hdu 3501 Calculation 2 (欧拉函数的延伸)

最新推荐文章于 2022-07-04 10:21:22 发布

wdmzsly

最新推荐文章于 2022-07-04 10:21:22 发布

阅读量258

点赞数

分类专栏：欧拉函数

本文链接：https://blog.youkuaiyun.com/wdmzsly/article/details/51387610

版权

欧拉函数专栏收录该内容

1 篇文章

订阅专栏

Calculation 2

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

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
  
  
  
  

  
  
  
  
   
   #include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;

long long euler(long long n){
     long long res=n,a=n;
     for(long long i=2;i*i<=a;i++){
         if(a%i==0){
             res=res/i*(i-1);
             while(a%i==0) a/=i;
         }
     }
     if(a>1) res=res/a*(a-1);
     return res;
}
int main(){
	long long n,s;
	while(scanf("%lld",&n),n){
		s=n*(n-1)/2;
		s=s-euler(n)*n/2;
		printf("%lld\n",s%1000000007);
	}
	return 0;
}