题解 | #完全数计算#

#include <iostream>
#include <vector>
int get_num(int n){
    int tol = 0;
    int count = 0;
    vector<int> res;
    for(int j = 1; j <= n; j++){
        res.clear();
        tol = 0;
        for(int i = 1; i <= j; i++)
        {
            if(j % i == 0){
                res.push_back(i);           
            }
        }
        for(int k = 0; k < res.size(); k++){
            tol += res[k];
        }
        if((tol-j) == j)//除去自身的数，再与自身相比较
        {
            count++;
        }    
    }
    return count;
}


int main()
{
    int num;
    cin >> num;
    cout<<get_num(num);
}