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.
Longge is good at mathematics and he likes
阅读背景：
POJ 2480 Longge's Problem (欧拉函数+乘积函数)_满月照亮的路
来源：互联网
分享到：
