欧拉函数（求互质个数）

最新推荐文章于 2024-05-11 11:16:52 发布

原创最新推荐文章于 2024-05-11 11:16:52 发布 · 501 阅读

本内容遵循CC 4.0 BY-SA版权协议

该博客介绍了Farey序列的概念，即对于正整数n，Farey序列Fn包含了所有分母小于等于n且与分母互质的不可约分数，并按升序排列。博客提出了计算Fn中项数的任务，提供了输入输出示例，并讨论了求小于x与x互质数的个数问题，指出某些方法可能导致超时。

Farey Sequence

The Farey Sequence Fn for any integer n with n >= 2 is the set of irreducible rational numbers a/b with 0 < a < b <= n and gcd(a,b) = 1 arranged in increasing order. The first few are
F2 = {1/2}
F3 = {1/3, 1/2, 2/3}
F4 = {1/4, 1/3, 1/2, 2/3, 3/4}
F5 = {1/5, 1/4, 1/3, 2/5, 1/2, 3/5, 2/3, 3/4, 4/5}

You task is to calculate the number of terms in the Farey sequence Fn.
Input
There are several test cases. Each test case has only one line, which contains a positive integer n (2 <= n <= 106). There are no blank lines between cases. A line with a single 0 terminates the input.
Output
For each test case, you should output one line, which contains N(n) ---- the number of terms in the Farey sequence Fn.
Sample Input
2
3
4
5
0
Sample Output
1
3
5
9
求小于x(1<x<n)的数中与x互质的个数，从2<x<n的和

/**欧拉函数 即求1到(n-1)内与n互质的数的个数**/
#include<stdio.h>
#define ll long long
ll f[1001000];
void phi()  
{  
    for(int i=2;i<=1000000;i++){  
        if(!f[i])  
        for(int j=i;j<=1000000;j+=i){  
            if(!f[j])f[j]=j;  
            f[j]=f[j]/i*(i-1);  
        }  
    }  
}
int main(){
	ll n;
	phi();
	while(~scanf("%lld",&n)&&n){
		ll ans=0;
		for(int i=2;i<=n;i++)
		    ans+=f[i];
		printf("%lld\n",ans);
	}
	return 0;
}

下面这样就会超时(搞不懂)

/**欧拉函数 即求1到(n-1)内与n互质的数的个数**/
#include<stdio.h>
#define ll long long
ll f[1001000];
void phi(){
	ll i,j,rea,k;
	for(j=2;j<=1000000;j++){
		rea=j;k=j;
		for(i=2;i*i<=k;i++){
	    	if(k%i==0){
	    		rea=rea-rea/i;
	    		while(k%i==0)
	        		k/=i;
	    	}
    	}
    	if(k>1)
	    	rea=rea-rea/k;
	    f[j]=rea;
	}	
}
int main(){
	ll n;
	phi();
	while(~scanf("%lld",&n)&&n){
		ll ans=0;
		for(int i=2;i<=n;i++)
		    ans+=f[i];
		printf("%lld\n",ans);
	}
	return 0;
}