-
11th November 2011, 02:52 PM
#1
c++ help
A number is known as a perfect number - if sum of its divisors (excluding itself) is equal to the number, deficit – if sum is less than number, abundant – if sum is greater than number. Write an algorithm that checks a number for perfect, deficit and abundant.
e.g, 6, its divisors sum = 1 + 2 + 3 = 6. As sum = number, so number is perfect
ma ishq-e-kainaat ma zanjeer ho saku
mujh ko hisar-e-zaat ke shar se rahai de
Posting Permissions
- You may not post new threads
- You may not post replies
- You may not post attachments
- You may not edit your posts
-
Forum Rules
Bookmarks