Calculation 2
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3789 Accepted Submission(s): 1586
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
Author
GTmac
欧拉函数扩展: 小于或者等于n的数中(n > 1),与n互质的数总和 -> euler[n] * n / 2。
#include<stdio.h>
#define LL long long
#define mod 1000000007
LL euler(LL n)
{
LL ans=n;
for(LL i=2;i*i<=n;i++)
{
if(n%i==0)
ans=ans/i*(i-1);
while(n%i==0)
n/=i;
}
if(n>1)
ans=ans/n*(n-1);
return ans;
}
int main()
{
LL n;
while(scanf("%lld",&n),n)
{
printf("%lld\n",n*(n-1-euler(n))/2%mod);
}
return 0;
}
#define LL long long
#define mod 1000000007
LL euler(LL n)
{
LL ans=n;
for(LL i=2;i*i<=n;i++)
{
if(n%i==0)
ans=ans/i*(i-1);
while(n%i==0)
n/=i;
}
if(n>1)
ans=ans/n*(n-1);
return ans;
}
int main()
{
LL n;
while(scanf("%lld",&n),n)
{
printf("%lld\n",n*(n-1-euler(n))/2%mod);
}
return 0;
}