hdoj 3501 【欧拉函数求小于或者等于n的数中与n互质的数总和】

最新推荐文章于 2022-03-24 18:46:10 发布

笑着走完自己的路

最新推荐文章于 2022-03-24 18:46:10 发布

阅读量872

点赞数

分类专栏：欧拉函数

本文链接：https://blog.csdn.net/chenzhenyu123456/article/details/46463419

版权

欧拉函数专栏收录该内容

10 篇文章 0 订阅

订阅专栏

Calculation 2

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

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

Sample Output

  
  
   
   0
2
  
  
  
  
   
    
  
  
  
  
   
    
  
  
  
  
   
   题目意思： 求小于或者等于n的数中，与n互质的数之和。
  
  
  
  
   
   欧拉函数扩展： 小于或者等于n的数中(n > 1)，与n互质的数总和 -> euler[n] * n / 2。
  
  
  
  
   
    
  
  
  
  
   
   代码：
  
  
  
  
   
   //思路：欧拉函数的引伸：小于或等于n的数中，与n互质的数的总和为：euler(x) * x / 2。(n>1)
#include <cstdio>
#include <cstring>
#include <cmath>
#define LL long long 
#define MOD 1000000007
using namespace std;
LL euler(LL n)
{
	LL i;
	LL eu = n;
	for(i = 2; i*i <= n; i++)
	{
		if(n % i == 0)
		{
			eu = eu * (i-1) / i;
			while(n % i == 0)
			n /= i;
		}
	}
	if(n > 1) eu = eu * (n-1) / n;
	return eu;
}
int main()
{
	LL n;
	while(scanf("%lld", &n), n)
	{
		LL ans = n * (n+1) / 2;
		ans = ans - euler(n) * n / 2;
		printf("%lld\n", (ans-n)%MOD);
	}
	return 0;
}