725 完全数
include[HTML_REMOVED]
int main()
{
int N, i, n;
scanf(“%d”, &N);
int shu[100];
for (i = 0; i < N; i)
scanf(“%d”, &shu[i]);
for (i = 0; i < N; i) {
if (shu[i] == 6 || shu[i] == 28 || shu[i] == 496 || shu[i] == 8128 || shu[i] == 33550336)
printf(“%d is perfect\n”, shu[i]);
else printf(“%d is not perfect\n”, shu[i]);
}
return 0;
}