[leetcode]-507. Perfect Number(C语言）

We define the Perfect Number is a positive integer that is equal to the sum of all its positive divisors except itself.

Now, given an integer n, write a function that returns true when it is a perfect number and false when it is not.

Example:

Input: 28
Output: True
Explanation: 28 = 1 + 2 + 4 + 7 + 14

Note:The input number n will not exceed 100,000,000. (1e8)

bool checkPerfectNumber(int num) {
    int i,j,sum=1;
    if(num<=1)
        return false;
    int b=(int)sqrt(num);
    for(i=2;i<b;i++)
    {
        if(num%i==0)
            sum=sum+i+num/i;
    }
    if(num%b==0)               //对于6这种特殊值进行判断
    {
        if(num/b==b)
            sum+=b;
        else
            sum=sum+b+num/b;
    }
        
    if(num==sum)
        return true;
    else
        return false;
}