Given a number, determine if it is perfect, abundant, or deficient.
Input
A list of N positive integers (none greater than 60,000), with 1 < N < 100. A 0 will mark the end of the list.
Output
The first line of output should read PERFECTION OUTPUT. The next N lines of output should list for each input integer whether it is perfect, deficient, or abundant, as shown in the example below. Format counts: the echoed integers should be right justified within the first 5 spaces of the output line, followed by two blank spaces, followed by the description of the integer. The final line of output should read END OF OUTPUT.
Sample Input
15 28 6 56 60000 22 496 0
Sample Output
PERFECTION OUTPUT 15 DEFICIENT 28 PERFECT 6 PERFECT 56 ABUNDANT 60000 ABUNDANT 22 DEFICIENT 496 PERFECTEND OF OUTPUT
#include<iostream> #include<iomanip> using namespace std; int b[101][60001]; int main(){ int a[101],c[101],i,num,sum; i=0; while(cin>>a[i]){ if(a[i]==0) break; else{ num=0; sum=0; for(int j=1;j<a[i];j++){ if(a[i]%j==0){ b[i][num]=j; num++; } } for(int j=0;j<num;j++) sum=sum+b[i][j]; if(sum==a[i]) c[i]=0; else if(sum<a[i]) c[i]=1; else c[i]=2; } i++; } cout << "PERFECTION OUTPUT" << endl; for(int j=0;j<i;j++) { cout<<setw(5)<<a[j]<<" "; if(c[j]==0) cout << "PERFECT"<<endl; else if(c[j]==1) cout << "DEFICIENT"<<endl; else cout << "ABUNDANT"<<endl; } cout << "END OF OUTPUT" << endl; //system("pause"); return 0; }