HPYNOS  Happy Numbers I
The process of “breaking” an integer is defined as summing the squares of its digits. For example, the result of breaking the integer 125 is (1^{2} + 2^{2} + 5^{2}) = 30. An integer N is happy if after “breaking” it repeatedly the result reaches 1. If the result never reaches 1 no matter how many times the “breaking” is repeated, then N is not a happy number.
TASK
Write a program that given an integer N, determines whether it is a happy number or not.
CONSTRAINTS
2 ≤ N ≤ 2,147,483,647
Input
A single line containing a single integer N.
Output
A single line containing a single integer T which is the number of times the process had to be done to determine that N is happy, or 1 if N is not happy.
Example
Input: 19 Output: 4
1) 19 : 1^{2} + 9^{2} = 82 2) 82 : 82 + 2^{2} = 68 3) 68 : 6^{2} + 8^{2} = 100 4) 100 : 1^{2 }+ 0^{2} + 0^{2} = 1
The solution is 4 because we discovered that the integer 19 is happy after we repeated the process 4 times.
Input: 204 Output: 1
204 –> 20 –> 4 –> 16 –> 37 –> 58 –> 89 –> 145 –> 42 –> 20 –> 4 –> 16 –> 37 –> 58 –> 89 –> 145 ……
204 is not a happy number because after breaking it several times the results start repeating so we can deduce that if we continue breaking it, the result will never reach 1.
Number of input files is 32.
Don't use precalculated values (Don't Cheat)!!!
hide comments
thakur_saab7:
20190103 17:05:34
Hi! I got AC in the 2nd submission.


yogesh1208:
20181215 09:10:29
hi syamphanindra r u a java coder?? 

littleboy123:
20181027 13:09:53
used map to check whether a number was visited before and don't forget to use unsigned long long int 

dewa251202:
20180916 03:28:18
Wow, my first Floyd's Tortoise and Hare 

phoemur:
20180916 02:47:36
AC in std::numeric_limits<unsigned long long>::max() GO!!! 

n1trob4ct3r:
20180825 21:13:38
Time to show off now:


anirudnits:
20180821 13:05:32
don't trust tool it for this one 

kirill_1984:
20180802 13:08:20
I got a WA after 31 test. Just wonder what I really did wrong. May anybody help to find a mistake? My solution id is 22082540. 

vivek_dwivedi:
20180625 09:42:21
sorry we used precalculated value ;) 

ankur314:
20180621 10:23:26
when i took number of i/p files=32 i got WA

Added by:  Rofael Emil 
Date:  20101103 
Time limit:  0.162s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 
Resource:  Egyptian Olympiad in Informatics ( EOI ) 2009, August 14  21, Cairo 