fork download
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. int main() {
  5. int cases, num, count;
  6. cin>>cases;
  7.  
  8. for(int i=0; i<cases; i++){
  9. cin>>num;
  10. count = 0;
  11. for(int k=1; k<num; k++){
  12. if(num%k == 0){
  13. count+=k;
  14. }
  15. }
  16. if(count>num){
  17. cout<<num<<" is an abundant number."<<endl;
  18. }
  19. else if(count<num){
  20. cout<<num<<" is a deficient number."<<endl;
  21. }
  22. else{
  23. cout<<num<<" is a perfect number."<<endl;
  24. }
  25. }
  26. return 0;
  27. }
Success #stdin #stdout 0s 3416KB
stdin
3
4
6
12
stdout
4 is a deficient number.
6 is a perfect number.
12 is an abundant number.