# Happy Numbers (Long)

## 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
**1,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.

ctrl + enter or