Leyland Numbers
Details
A Leyland number is of the form xy + yx where 1 < y ≤ x.
For example, 8 is a Leyland number because 22 + 22 = 8.
Print all the Leyland numbers from 1 to 100,000,000,000 inclusive, each on their own line.
0 bytes, 0 chars
Restore solution
Compiled from
AT&T syntax to x86-64 Linux. Use
syscalls to write output.
Top-level programs are supported, args holds ARGV.
Implicit using directives for console applications are enabled.
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.
Code is compiled with clang with -std=c++2b.
Code is compiled with LDC2.
Arguments are available via STDIN, each argument is NULL terminated.
x is a no-op.
The stack is initialized with an array containing arguments, rather
than the contents of STDIN.
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.
Code is run under -E, all current features are enabled.
$args to access the arguments.
prolog_flag(argv, Args) to access the arguments.
Arguments are available via STDIN, each argument is seperated with a null byte.
The code is run with -E and -z.
Output replaces null bytes with newlines.
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