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
deisylix: 2020-07-13 00:57:34

say the wrong answer but I don't understand why

mrghasita: 2020-06-16 05:00:55

Python users getting TLE should use stdin and stdout

vikhyat_123: 2020-05-28 13:00:53

why it give run time error

deepshikha_14: 2020-05-12 10:50:11

getting right answers in my system(Just according to formula) still getting wrong ans here... what else should I take care of?

spyder_40: 2020-04-24 12:03:20

use i<=sqrt(num) to avoid TLE

sonushahuji4: 2020-04-20 17:42:11

When I submit code in python3 for this problem, I get TLE but same logic when I write in cpp, it accepts. Why is this so?

Last edit: 2020-04-20 18:51:41
sanjeev30798: 2020-01-21 17:26:26

for n=1 output is 0

trungvt: 2019-08-08 12:24:56

corner case: n = 1

sanket17: 2019-08-02 15:17:47

same solution in c++ give wrong answer and in c it is Ac

lamphong25: 2019-07-27 13:54:01

did anyone know name of file input output please tell me


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