Perfect Number

Problem Link - https://leetcode.com/problems/perfect-number/

---

Solution

    class Solution {
    public:
        bool checkPerfectNumber(int num) {
            if(num == 1)
                return false;
            int sum = 1;
            for(int i = 2; i <= sqrt(num); i++) {
                if(num % i == 0)
                    sum += i + num / i;
            }
            return sum == num;
        }
    };