首页 > 代码库 > hdoj 3501

hdoj 3501

  

Problem Description
Given a positive integer N, your task is to calculate the sum of the positive integers less than N which are not coprime to N. A is said to be coprime to B if A, B share no common positive divisors except 1.
 

 

Input
For each test case, there is a line containing a positive integer N(1 ≤ N ≤ 1000000000). A line containing a single 0 follows the last test case.
 

 

Output
For each test case, you should print the sum module 1000000007 in a line.
 

 

Sample Input
3 4 0
 

 

Sample Output
0 2

 分析:欧拉函数的引申,小于或等于n的数中,与n互质的数的总和为φ(x) * x / 2。(n>1)

hdoj 3501