程序師世界是廣大編程愛好者互助、分享、學習的平台,程序師世界有你更精彩!
首頁
編程語言
C語言|JAVA編程
Python編程
網頁編程
ASP編程|PHP編程
JSP編程
數據庫知識
MYSQL數據庫|SqlServer數據庫
Oracle數據庫|DB2數據庫
 程式師世界 >> 編程語言 >> 更多編程語言 >> 編程解疑 >> gcd-Longges problem

gcd-Longges problem

編輯:編程解疑
Longge's problem

Description

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

Input contain several test case.
A number N per line.
Output

For each N, output ,∑gcd(i, N) 1<=i <=N, a line
Sample Input

2
6
Sample Output

3
15

最佳回答:


http://blog.csdn.net/sepnine/article/details/46337703

  1. 上一頁:
  2. 下一頁:
Copyright © 程式師世界 All Rights Reserved