OpenJudge

14:Longge's problem

总时间限制:
1000ms
内存限制:
65536kB
描述
Longge is good at mathematics and he likes to think about hard mathematical problems which will be solved by some graceful algorithms. Now a problem comes: Given an integer N(1 < N < 2^31),you are to calculate ∑gcd(i, N) 1<=i <=N.

"Oh, I know, I know!" Longge shouts! But do you know? Please solve it.
输入
Input contain several test case.
A number N per line.
输出
For each N, output ,∑gcd(i, N) 1<=i <=N, a line
样例输入
2
6
样例输出
3
15
来源
POJ Contest,Author:Mathematica@ZSU
全局题号
1482
添加于
2017-05-05
提交次数
29
尝试人数
12
通过人数
7