DIVSUM - Divisor Summation
Given a natural number n (1 <= n <= 500000), please output the summation of all its proper divisors.
Definition: A proper divisor of a natural number is the divisor that is strictly less than the number.
e.g. number 20 has 5 proper divisors: 1, 2, 4, 5, 10, and the divisor summation is: 1 + 2 + 4 + 5 + 10 = 22.
Input
An integer stating the number of test cases (equal to about 200000), and that many lines follow, each containing one integer between 1 and 500000 inclusive.
Output
One integer each line: the divisor summation of the integer given respectively.
Example
Sample Input: 3 2 10 20 Sample Output: 1 8 22
Warning: large Input/Output data, be careful with certain languages
hide comments
ipul ramadhan:
2013-06-24 07:36:41
tle :(
|
|
wichan:
2013-04-30 16:39:35
why i get time limit exceeded
|
|
shashank:
2013-04-27 16:59:16
finally, after 4 tle i got AC
|
|
alvaro:
2013-04-18 16:01:29
how can i do for no repeat outputs?
|
|
Shipu Ahamed:
2013-04-15 15:57:39
Don't use cin or cout or any define call |
|
Juɑƞ Chɑpɑrro:
2013-04-15 15:57:39
Easy! :) |
|
paras meena:
2013-04-15 15:57:39
<. snip .>
|
|
Bumbler:
2013-04-15 15:57:39
Last edit: 2013-03-02 06:53:15 |
|
Jesus Arevalo:
2013-04-15 15:57:39
Im using printf n scanf , also using sqrt but keep in TLE :( |
|
Anwar Alam:
2013-04-15 15:57:39
Hi,
|
Added by: | Neal Zane |
Date: | 2004-06-10 |
Time limit: | 3s |
Source limit: | 5000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All |
Resource: | Neal Zane |