ZOJ 1284 Perfection

题意

思路

代码

#include <iostream>
#include <math.h>
#include <stdio.h>
using namespace std;
int temp[1000];
int isPerfect(int n){
int sum=0;
for(int i=1;i<=n/2;i++){
if(n%i==0){
sum+=i;
}
}
if(sum==n){
return 1;
}
else if(sum>n){
return 2;
}
else{
return 0;
}
}
int main(int argc, char *argv[])
{
int step=0;
while(cin>>temp[++step]){
if(temp[step]==0){
break;
}
}
cout<<"PERFECTION OUTPUT"<<endl;
for(int i=1;i<=step;i++){
if(temp[i]==0){
cout<<"END OF OUTPUT"<<endl;
break;
}
printf("%5d  ",temp[i]);//注意这里
if(isPerfect(temp[i])==1){
cout<<"PERFECT"<<endl;
} else if(isPerfect(temp[i])==2){
cout<<"ABUNDANT"<<endl;
}else{
cout<<"DEFICIENT"<<endl;
}
}
return 0;
}