Perfect Numbers - CISCO

3

4 votes
Medium
Problem

Given a number and check if a number is perfect or not. A number is said to be perfect if sum of all its factors excluding the number itself is equal to the number.

Input:
First line consists of T test cases. Then T test cases follow .Each test case consists of a number N.

Output:
Output in a single line 1 if a number is a perfect number else print 0.

Constraints:
1<=T<=300
1<=N<=10000

Example:
Input:

2
6
23
Output:
1
0

Time Limit: 5
Memory Limit: 256
Source Limit:
Editor Image

?