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
|
sid779:
2019-07-02 06:11:34
Try DIVSUM2 :) |
|
emina652:
2019-04-21 19:56:37
if the number is 1 , the output must be 0.
|
|
saurav_2233:
2019-04-15 08:19:39
it was an easy but remember answer of 1 is 0 always.
|
|
midoriya:
2019-03-15 15:08:14
TOO easy, time limit should have been less |
|
backtracking:
2018-11-09 06:39:39
i get time limit exceed in python |
|
willis2014:
2018-10-31 17:31:25
1 should be output 0
|
|
porrapatcpe20:
2018-08-18 18:30:01
Do you have any test case?
|
|
excel_blaze:
2018-05-12 17:41:48
Super easy
|
|
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. :( |
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 |