Please in order to save solutions and appear on the leaderboards.

Smith Numbers

Details

A Smith number is a composite number whose digit sum is equal to the sum of the digits of its prime factors.

One example of a Smith number is the beast number 666 = 2 × 3 × 3 × 37, since 6 + 6 + 6 = 2 + 3 + 3 + (3 + 7) = 18.

Print all the Smith numbers from 1 to 10,000 inclusive, each on their own line.

0 bytes, 0 chars
 
 
 
 
 
 
 
 
Compiled from AT&T syntax to x86-64 Linux. Use syscalls to write output. For accurate byte counts and syntax highlighting, please use the new editor.
Top-level programs are supported, args holds ARGV.
Arguments are available via STDIN, each argument is NULL terminated. Taking input after EOF leaves the cell unchanged, the tape is circular with 65536 cells, and cells are 8-bit with wrapping.
Arguments are available via STDIN, each argument is NULL terminated. x is a no-op.
Arguments are available via STDIN, each argument is NULL terminated.
arguments holds ARGV, print() to output with a newline, write() to output without a newline.
say() is available without any import.
$args to access the arguments.
SELECT arg FROM argv to access the arguments, only the first column of the first result set will be printed, NULL values will be skipped, and the dialect is SQLite.
Arguments are available via args list variable. To terminate script execution, write and quit the current buffer.
ctrl + enter or Run