human
Happy Numbers | Returns sum of squares of digits of a number n . For example for n = 12 it returns 1 + 4 = 5.
Returns true if n is Happy number else returns false ..
A set to store numbers during repeated square sum process.
Keep replacing n with sum of squares of digits until we either reach 1 or we endup in a cycle.
Number is Happy if we reach 1.
Replace n with sum of squares of digits.
If n is already visited , a cycle is formed , means not Happy.
Mark n as visited.
Driver code"
Solution in Python:
assistant
#Here is code to happy Numbers and the other steps required.
 def sumDigitSquare ( n ) :
	sq = 0 ;
	while ( n != 0 ) :
		digit = n % 10
		sq += digit * digit
		n = n // 10
	return sq ;
def isHappy ( n ) :
	s = set ( )
	s . add ( n )
	while ( True ) :
		if ( n == 1 ) :
			return True ;
		n = sumDigitSquare ( n )
		if n in s :
			return False
		s . add ( n )
	return false ;
n = 4
if ( isHappy ( n ) ) :
	print ( " Yes " )
else :
	print ( " No " )