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
excel_blaze: 2018-05-12 17:41:48

Super easy
waste of time ('_')

atikarizki41: 2018-04-19 06:30:30

why its time limit exceeded?

supriyanta: 2018-03-29 09:02:46

the answer for 1 should be 0. It costs me two wrong answers. :(

ramini1996: 2018-02-06 13:07:54

AC in ONE GO !!!

Last edit: 2018-02-06 13:08:23
payal2621: 2018-01-13 13:08:11

a nyc problem
the simple logic is that we loop around for i*i<n
think simple logic dont bother about learning sieve

Last edit: 2018-01-13 13:09:03
dunjen_master: 2017-12-30 14:53:54

https://mathschallenge.net/library/number/sum_of_divisors...... this could help!!

karthik1997: 2017-12-28 09:41:25

Use Sieve for pre computation and solve each query in O(1) .Dont Forget to use long. you'll surely endup with fastest submission :) 0.00s

Last edit: 2017-12-28 09:54:07
pranaykhin1999: 2017-12-19 13:13:15

why i am getting time limit exceeded??
can someone please help

jvjplus: 2017-12-16 13:54:55

remember: sqrt(x)*sqrt(x)!=x vs (int)sqrt(x)*(int)sqrt(x)==x

guilheramos: 2017-12-06 14:42:31

Somebody solve this problem using python?


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