class Solution { public: bool checkPerfectNumber(int num) { int sum = 1; for (int i = 2; i * i <= num; ++i) { if (num % i == 0) { sum += i + (num / i == i ? 0 : num / i); } } return num != 1 && sum == num; } };
1 2 3 4 5 6 7
class Solution { public: bool checkPerfectNumber(int num) { return num == 6 || num == 28 || num == 496 || num == 8128 || num == 33550336; } };