hdu 3501 Calculation 2 求所以小于n且与n不互质的数之和

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<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
//phi(n)*n/2求得所以小于n且与n互质的数之和，
//再用所有小于n的和减去它就为结果。
const int maxn=110000;
int flag[maxn],pri[maxn],pl;
void _prime()
{
    for(int i=2;i<maxn;i++)
    {
        if(flag[i]==0) pri[pl++]=i;
        for(int j=0;j<pl&&i*pri[j]<maxn;j++)
        {
            flag[i*pri[j]]=1;
            if(i%pri[j]==0) break;
        }
    }
}
int phi(int n)
{
    int ans=n;
    for(int i=0;i<pl&&pri[i]*pri[i]<=n;i++)
    {
        if(n%pri[i]==0)
        {
            ans-=ans/pri[i];
            while(n%pri[i]==0) n/=pri[i];
        }
    }
    if(n>1) ans-=ans/n;
    return ans;
}
int main()
{
    _prime();
    int n;
    int mod=1000000007;
    while(scanf("%d",&n)==1&&n)
    {
        int tmp=((long long)n*(n-1)/2)%mod;
        int sf=((long long)phi(n)*n/2)%mod;
        int ans=tmp-sf;
        printf("%d\n",(ans%mod+mod)%mod);
    }
    return 0;
}