题解 | 完数VS盈数

#include<bits/stdc++.h>
using namespace std;

int judge(int k) {
    int num = 1;
    for (int i = 2; i <= sqrt(k); i++) {
        if (k % i == 0) {
            num += i;
            if (i != k / i) {
                num += k / i;
            }
        }
    }
    if(num == k)
    {
        return 1;
    }
    else if(num > k)
    {
        return 2;
    }
    else
    {
        return 3;
    }
}

int main() {
    int wan[60] = {0}, i = 0;
    int ying[60] = {0}, j = 0;
    for (int k = 2; k <= 60; k++) {
        if (judge(k) == 1) {
            wan[i++] = k;
        } else if (judge(k) == 2) {
            ying[j++] = k;
        }
    }
    cout << "E: ";
    for (int k1 = 0; k1 < i; k1++) {
        cout << wan[k1] << " ";
    }
    cout<<endl;
    cout<<"G: ";
    for (int k2 = 0; k2 < j; k2++) {
        cout << ying[k2]<<" ";
    }

    return 0;
}