08-25-2003, 08:00 PM
Challenge: Find all complete numbers between 0 and 500, as fast and simple, while presenting it in a comfortable way.
Complete numbers? Well, actually I don't know if its ther correct translation, but a complete number is a number where the sum of all divisors is equal to the number itself. Eg: '6'. 6 can be divided by 1, 2, and 3 (6 doesn't count), and 1+2+3=6.
You can't use ASM or libs, not that I can see why you want to, and code simplicity values over speed, at least to a certain point.
/Zap
Complete numbers? Well, actually I don't know if its ther correct translation, but a complete number is a number where the sum of all divisors is equal to the number itself. Eg: '6'. 6 can be divided by 1, 2, and 3 (6 doesn't count), and 1+2+3=6.
You can't use ASM or libs, not that I can see why you want to, and code simplicity values over speed, at least to a certain point.
/Zap