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
istiak7_: 2021-09-26 13:11:17

why showing "wrong answer edit ideone it....Standard input is empty" after submission?

Last edit: 2021-09-26 13:18:08
upstriver: 2021-09-05 18:58:43

AC in 1 Go
I like cock

Last edit: 2021-09-05 21:13:01
rangey_18o3_20: 2021-07-26 21:14:35

A clue to anyone unable to see why a sieve won't work
n + n/2 + n/3 + n/4 + n/5 ..... + n/n is nearly n log n

jainnamah: 2021-07-19 21:34:31

sum of GP + Fast Expo + sieve (to pre calculate primes)

rapiram31: 2021-06-23 20:05:51

preprocess using sieve : ) 0.3ms

trantheba0: 2021-06-15 06:48:30

nlogn trick without any factorization. Time: 0.04

Last edit: 2021-06-15 06:50:08
hemang_ranga: 2021-04-26 17:16:29

how to check the code

fantastic_4: 2021-04-18 23:20:36

I'm a faggot

Last edit: 2021-04-18 23:58:54
navin123: 2021-04-18 22:15:48

Solve it using O(Sqrt(n))

AC in one go : 0.46ms C++

Solution(Only if you have tried) :
https://im.afagg.ot/

Last edit: 2021-04-18 23:59:36
everythingra: 2021-03-14 16:28:02

time limit exceeded, what is it? and what might be the issue here?


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