classSolution { public: intops(int n) { int res = 0; int num; while (n) { num = n % 10; res += num * num; n /= 10; } return res; } boolisHappy(int n) { unordered_set<int> numbers; int i; for (i = n; numbers.count(i) == 0; i = ops(i)) { if (i == 1) { returntrue; } numbers.insert(i); }