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
anuveshkothari:
20150526 12:46:51
always showing me wrong answer, can't find where it went wrong..please help!! 

Prasanna Patil:
20150415 13:01:03
Take care when input is 1


Sue:
20150331 16:37:27
AC in the first go :))


Ankit:
20150302 07:43:01
Sillly mistakes ... ;( 

Tanmay :
20150223 19:04:29
There are not 32 cases.


pooh:
20150207 16:33:47
green in one go ;)


Rohit:
20150129 16:09:53
Got ac in first time


Gaurav chandel:
20150117 08:13:53
WA in 32nd test case.. dont know why 

Shekhar Prasad Rajak:
20150116 10:22:43
Got AC in first time ..\m/ 

Ankur Singh:
20150107 05:27:48
@admin, i am trying to submit in c++(4.3.2) and it is giving error that :"language available only on cube cluster"

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