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. For example 6 is a perfect integer because its divisors are 1, 2 and 3 and the sum of them is 6). If this sum is less that n (the number), the number is deficient, and if the sum is greater than n, the number is abundant.
this is the question and i dont know how shuld i begin.........i know that i hv to use if/else .....but how to get the divisors condition?