# Happy Numbers

## Details

A happy number is defined by the following Sequence: Starting with any positive integer, replace the number by the sum of the squares of its digits in base-ten, and repeat the process until the number either equals 1 (where it will stay), or it loops endlessly in a cycle that does not include 1. Those numbers for which this process ends in 1 are happy numbers, while those that do not end in 1 are sad numbers.

For example, 19 is happy, as the associated Sequence is:

- 1
^{2}+ 9^{2}= 82 - 8
^{2}+ 2^{2}= 68 - 6
^{2}+ 8^{2}= 100 - 1
^{2}+ 0^{2}+ 0^{2}= 1.

Print all the happy numbers from **1** to **200** inclusive, each on
their own line.

0 characters

Top-level programs are supported,

**args**holds ARGV.
ARGV is available via STDIN, joined on NULL.

**x**is a no-op.**arguments**holds ARGV,

**print()**to output with a newline,

**write()**to output without a newline.

**say()**is available without any import.

**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.

ctrl + enter
or
Run