CPZT ACGO

100%AC
使用函数解决
点个关注！

---

#include <iostream>
#include <cmath>
using namespace std;
int pz[10005];
void wanquannumber(int n) {
    int sum = 0,p = 0;
	for (int i = 2;i <= 10000;i++) {
        sum = 0;
        for (int j = 1;j < i;j++) {
            if (i % j == 0) {
                sum += j;
            }
        }
        if (i == sum) {
            pz[p] = i;
            p++;
        }
    }
    for (int i = 0;i <= n;i++) {
        if (pz[i] > 2 && pz[i] <= n) {
            cout << pz[i] << endl;
        }
    }
} 
int main() {
	int n;
	cin >> n;
	wanquannumber(n);
	return 0;
}

当前链接：https://www.acgo.cn/problemset/7856/explanation?questionCollectionId=1476