UVA_382_Perfection

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <sstream>
#include <stdlib.h>
#include <cmath>
#define LL unsigned long long
using namespace std;
vector <int> v;
void divisores(int n){
  for(int i=1;i<=n/2;i++){
    if(n%i==0) v.push_back(i);
  }
}
int main() {
    int n;
     printf("PERFECTION OUTPUT\n");
     while(scanf("%d",&n)){
        if(n==0) break;
        /*sacar divisores*/

        divisores(n);int sum=0;
        /*reviso vector*/
        for (int i=0;i<v.size();i++){
            sum+=v[i];
        }
        if(sum==n){
            printf("%5d  PERFECT\n",n);

        }else if(sum <n){
            printf("%5d  DEFICIENT\n",n);
        }else{
            printf("%5d  ABUNDANT\n",n);
        }
        v.clear();
     }
     printf("END OF OUTPUT\n");
    return 0;
}