1164 Perfect Number

URI Online Judge | 1164

Perfect Number

In mathematics, a perfect number is an integer for which the sum of all its own positive divisors (excluding itself) is equal to the number itself. For example the number 6 is perfect, because 1+2+3 is equal to 6. Your task is to write a program that read integer numbers and print a message informing if these numbers are perfect or are not perfect.

Input

The input contains several test cases. The first contains the number of test cases N (1 ≤ N ≤ 100). Each one of the following N lines contains an integer X (1 ≤ X ≤ 108), that can be or not a perfect number.

Output

For each test case print the message “X eh perfeito” (X is perfect) or “X nao eh perfeito” (X isn't perfect) according with to above specification.

Input Sample	Output Sample
3 6 5 28	6 eh perfeito 5 nao eh perfeito 28 eh perfeito

Solution:

#include <stdio.h> int main() {     int n, X, i, j, c, d=0;     scanf("%d", &n);     for(i=1; i<=n; i++)     {         scanf("%d", &X);         c=X/2; d=0;         for(j=1; j<=c; j++)         {             if(X%j==0)                 d+=j;         }         if(d==X)             printf("%d eh perfeito\n",X);         else             printf("%d nao eh perfeito\n",X);     }     return 0; }