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


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

hide comments
2013-06-24 07:36:41 ipul ramadhan
tle :(
2013-04-30 16:39:35 wichan
why i get time limit exceeded
i use python 3.3.0
--ans(francky)--> Although this problem is in tutorial, it is one of the hardest one feasible in Python. I can do it in Py2.7 and not in Py3. numerix is the only one able to solve it in Py3. If you see another problem with few recent AC in Python, then choose another one, it's an advice. Good luck.

Last edit: 2013-04-30 17:06:00
2013-04-27 16:59:16 shashank
finally, after 4 tle i got AC
Nice question...
2013-04-18 16:01:29 alvaro
how can i do for no repeat outputs?
tip ?
2013-04-15 15:57:39 Shipu Ahamed
Don't use cin or cout or any define call
2013-04-15 15:57:39 Juɑƞ Chɑpɑrro
Easy! :)
2013-04-15 15:57:39 paras meena
<. snip .>
Please see notes below:
1. Don't post any source code here.
(Edit by Francky)



Last edit: 2013-03-10 14:33:57
2013-04-15 15:57:39 Bumbler


Last edit: 2013-03-02 06:53:15
2013-04-15 15:57:39 Jesus Arevalo
Im using printf n scanf , also using sqrt but keep in TLE :(
2013-04-15 15:57:39 Anwar Alam
Hi,
I got TLE..
My code id is 8757717..
I am using printf, scanf and taking care of 1 too..
Any advice on how to avoid it
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.