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
hiddenman: 2013-04-15 15:57:39

easy bt cautious abt case whn n=1......:P

@looser@: 2013-04-15 15:57:39

I love to hate TLE ::

Ouditchya Sinha: 2013-04-15 15:57:39

finally AC :)

Vitalis Salis: 2013-04-15 15:57:39

Value for 1 is 0. Don't forget to take a special case about that ;)

nbcool: 2013-04-15 15:57:39

My solution is also giving TLE there is a just order n loop

Rounak Patni: 2013-04-15 15:57:39

TLE help plz

arijit pande: 2013-04-15 15:57:39

got AC..

o.O: 2013-04-15 15:57:39

TLE...
plz someone help....

Francky: 2013-04-15 15:57:39

@tjandra, no you're #10, Miki Maric gave a wrong code, those two submissions are making some trouble in this rank list. I think they should be hidden.


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