hdoj 3501 Calculation 2(欧拉函数)



http://acm.hdu.edu.cn/showproblem.php?pid=3501

Calculation 2

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2347    Accepted Submission(s): 992

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，求出2~N-1中所有不与N互质的数的和。

开始写时用for循环，每一次都余，但数据大时耗时太长，后来才知道sum_1不会超__int64，不需要每次都取余，对结果取余就行了。

#include<stdio.h>
#include<string.h>
#define NUM 1000000007
__int64 Euler(__int64 n)
{
	__int64 ret=n,i;
	for(i=2;i*i<=n;i++)
	{
		if(n%i==0)
		ret=ret-ret/i;
		while(n%i==0)
		n=n/i;
	}
	if(n>1) ret=ret-ret/n;
	return ret;
}
int main()
{
	__int64 N,sum_1,sum_2;
	while(scanf("%I64d",&N)&&N!=0)
	{
		sum_1=N*(N-1)/2;//当N取最大时不会超__int64 
		sum_2=N*Euler(N)/2;
		printf("%I64d\n",(sum_1-sum_2)%NUM);
	}
	return 0;
}