leetcode 507. Perfect Number 完美数字

最新推荐文章于 2023-09-27 00:51:24 发布

JackZhangNJU

最新推荐文章于 2023-09-27 00:51:24 发布

阅读量310

点赞数

分类专栏： leetcode For C++

本文链接：https://blog.csdn.net/JackZhang_123/article/details/78776045

版权

leetcode For C++ 专栏收录该内容

551 篇文章 1 订阅

订阅专栏

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)

题意很简单，直接计算即可

代码如下：

#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <string>
#include <climits>
#include <algorithm>
#include <sstream>
#include <functional>
#include <bitset>
#include <cmath>

using namespace std;

class Solution 
{
public:
    bool checkPerfectNumber(int num) 
    {
        if (num == 1)
            return false;

        int sum = 1;
        for (int i= 2; i <= (int)sqrt(num); i++)
        {
            if (num%i == 0)
            {
                sum += i;
                if (i != num / i)
                    sum += num / i;
            }
        }
        return sum == num;
    }
};