https://leetcode.com/problems/perfect-number/description/
class Solution {
public:
bool checkPerfectNumber(int num) {
if(num==1) return false;
int n = sqrt(num);
int ans = 1;
for(int i=2; i<=n; i++){
if(num%i == 0){
ans += i + num/i;
}
}
return ans==num;
}
};