Happy Number

Happy Number

Write an algorithm to determine if a number is "happy".

A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares of its digits, and repeat the process until the number equals 1 (where it will stay), or it loops endlessly in a cycle which does not include 1. Those numbers for which this process ends in 1 are happy numbers.

Example: 19 is a happy number

• 1² + 9² = 82
• 8² + 2² = 68
• 6² + 8² = 100
• 1² + 0² + 0² = 1

---

bool isHappy(int n) {
    int a,b,c,i,j;
    b = n;
    c = 0;
    int cc[10000];
    i=0;


    while(b > 0)
    {
        i++;
        while(b>0)
        {
            a = b % 10;
            b = b / 10;
            c = c + a*a;
        }
        b = c;

        if(c==1)
        return 1;

       for(j = 0; j < i; j++)
       {

           if(cc[j] == c)
           return 0;

       }

       cc[i] = c;
       c = 0;
    }

}