### 1996 Canadian Computing Competition, Stage 1

## Problem A: Deficient, Perfect, and Abundant

Write a program that repeatedly reads a positive integer,
determines if the integer is *deficient*, *perfect*,
or *abundant*, and outputs the number along with its
classification.

A positive integer, `n`, is said to be *perfect*
if the sum of its proper divisors equals the number itself.
(Proper divisors include 1 but not the number itself.) If this
sum is less that `n`, the number is *deficient*, and if
the sum is greater than `n`, the number is *abundant*.

The input starts with the number of integers that follow. For each of the following integers, your program should output the classification, as given below. You may assume that the input integers are greater than 1 and less than 32500.

### Sample Input

3 4 6 12

### Sample Output

4 is a deficient number. 6 is a perfect number. 12 is an abundant number.

All Submissions

Best Solutions

**Point Value:** 5

**Time Limit:** 2.00s

**Memory Limit:** 16M

**Added:** Sep 28, 2008

**Problem Types:**[Show]

**Languages Allowed:**

C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3

## Comments (Search)

It's quiet in here...