python/TangDou/LanQiaoBei/LanQiao11ShengSai/620LCcb2.cpp

#include <iostream>
using namespace std;

//完美数
bool wms(int n) {
    int s = 0;
    for (int i = 1; i <= n / 2; i++)
        if (n % i == 0) s += i;
    return s == n;
}

int n;
int cnt;

int main() {
    cin >> n;
    for (int i = 1; i <= n; i++)
        if (wms(i)) {
            printf("%d ", i);
            cnt++;
        }
    puts("");
    printf("*%d\n", cnt);
    return 0;
}