Calculation 2
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2379 Accepted Submission(s): 1003
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>
#define mod 1000000007
__int64 eular(__int64 n)
{
__int64 p=1;
for(__int64 i=2;i*i<=n;i++)//欧拉函数模板
{
if(n%i==0)
{
n=n/i;
p=p*(i-1);
while(n%i==0)
{
n=n/i;
p=p*i;
}
}
}
if(n>1) return p=p*(n-1);
return p;
}
int main()
{
__int64 ans,n;
while(scanf("%I64d",&n)&&n)
{
ans=n*(n-1)/2;
printf("%I64d\n",(ans-n*eular(n)/2)%mod);
}
return 0;
}
题目的意思是求不大于n且和n不是互质的数色和,
不大于n的和n不沪指的数的和=不大于n的数的和-与n互质的数的和