题解 | #完全数计算#C++常规思路

最常规的思路，首先从1开始遍历数，每个数再遍历求因子，再将因子求和判断，如果和数相等则count++

#include <iostream>
using namespace std;
int main()
{
    int perfectNum;
    int count = 0;
    int add = 0;
    while (cin >> perfectNum)
    {
        for (int j = 1; j <= perfectNum; j++)
        {
            add = 0;

            for (int i = 1; i < j; i++)
            {
                if (j % i == 0)
                    add += i;
            }
            if (add == j)
            {
                count++;
                add = 0;
            }
        }
        cout << count << endl;
        count = 0;
    }
}