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
amanjainnnn:
20200802 11:23:37
Ac in one go


hafiz_:
20200718 17:23:26
AC. Time: 0.50ms. Lang.: C++


sohelr360:
20200715 17:35:36
At least AC.


deisylix:
20200713 00:57:34
say the wrong answer but I don't understand why 

mrghasita:
20200616 05:00:55
Python users getting TLE should use stdin and stdout 

vikhyat_123:
20200528 13:00:53
why it give run time error 

mohan_saini:
20200518 13:09:46
AC in one go!! 

jyoti369:
20200516 08:47:50
AC IN ONE GO 

deepshikha_14:
20200512 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:
20200424 12:03:20
use i<=sqrt(num) to avoid TLE

Added by:  Neal Zane 
Date:  20040610 
Time limit:  3s 
Source limit:  5000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 
Resource:  Neal Zane 