hdoj 3501 Calculation 2 【欧拉函数】

Calculation 2

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 2306    Accepted Submission(s): 976

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
  
  

数论什么的最不懂了

代码：

#include <stdio.h>
#include <string.h>
#define LL __int64
#define INF 1000000007

LL oular(LL n){
    LL i, ans = n;
    for(i = 2; i*i <= n; i++){
        if(n%i == 0){
        n/=i;
        ans -= ans/i;
        while(n%i == 0){
            n/=i; 
        }
    }
    }    
    if(n > 1) ans -= ans/n;
    return ans;
}

int main(){
    LL n;
    while(scanf("%I64d", &n), n){
        LL ans = n*(n-1)/2;
        printf("%I64d\n", (ans-(n*oular(n)/2))%INF);
    }
    return 0;
}