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
aditya9125:
20161230 11:17:27
Can be done without map or sets.Read few lines about happy numbers n you'll be able to figure out the rest. 

avi892nash:
20161227 20:23:09
How can we say that breaking the number would lead to a cycle or it become 1....is there is any case in which breaking of a number goes to infinity but 1 does not appear and cycle also not appear 

nolex:
20161213 01:51:46
Does output have to be in file or on console... If it is file, do I need one more scanf for file for output? Last edit: 20161213 19:41:18 

kira28:
20161208 12:38:29
LOL!!! its as easy as it looks 

epsilonalpha:
20161127 03:28:21
Easy, analyze the given examples.


E Naveen Kumar:
20161104 07:43:38
Please analyse carefully. Simple


ayush5148:
20161029 08:00:03
Think as simple as you can as even for the largest 10 digit number. Last edit: 20161029 08:00:37 

nikhil03:
20161028 13:49:33
Ac after analyzing the pattern for different numbers!!! Last edit: 20161028 13:50:04 

rishabh325:
20161026 22:07:51
try map.AC in first go... 

Vaporeon:
20160903 13:56:39
Easy one using hashing. 
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 