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
2023-03-15 09:57:50
hu
2023-03-15 09:56:24
negeroes
2022-02-05 19:16:57
Be careful about the corner case of input n=1;It has no proper divisor.
2021-11-01 19:24:53
AC with Naive solution to calculate sum of divs for each input.
2021-10-20 18:18:12
Pre calculation can be an optimization.
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
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
2021-07-19 21:34:31
sum of GP + Fast Expo + sieve (to pre calculate primes)
2021-06-23 20:05:51
preprocess using sieve : ) 0.3ms
2021-06-15 06:48:30
nlogn trick without any factorization. Time: 0.04

Last edit: 2021-06-15 06:50:08
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.