poj 2407 欧拉函数

最新推荐文章于 2020-07-17 07:59:37 发布

「已注销」

最新推荐文章于 2020-07-17 07:59:37 发布

阅读量362

点赞数

分类专栏：数论通用模板

本文链接：https://blog.csdn.net/Summer__show_/article/details/52195562

版权

acm 同时被 3 个专栏收录

310 篇文章 1 订阅

订阅专栏

数论

57 篇文章 0 订阅

订阅专栏

通用模板

42 篇文章 0 订阅

订阅专栏

Relatives

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 13531		Accepted: 6724

Description

Given n, a positive integer, how many positive integers less than n are relatively prime to n? Two integers a and b are relatively prime if there are no integers x > 1, y > 0, z > 0 such that a = xy and b = xz.

Input

There are several test cases. For each test case, standard input contains a line with n <= 1,000,000,000. A line containing 0 follows the last case.

Output

For each test case there should be single line of output answering the question posed above.

Sample Input

7
12
0

Sample Output

6
4

欧拉函数

在程序中利用欧拉函数如下性质，可以快速求出欧拉函数的值 ( P为N的质因子 )

　　　　若(N%P==0 && (N/P)%P==0) 则有:E(N)=E(N/P)*P;

　　　　若(N%P==0 && (N/P)%P!=0) 则有:E(N)=E(N/P)*(P-1);

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;

int main()
{
    long long n;
    //freopen("in.txt","r",stdin);
    while(scanf("%I64d",&n),n)
    {
        long long temp=n,ans=n;
        for(long long i=2;i*i<=n;i++){
            if(n%i==0){
                ans-=ans/i;
                do{
                    n/=i;
                }while(n%i==0);
            }
        }
        //欧拉函数要注意n为1的情况
        if(n!=1)
            ans-=ans/n;
        printf("%d\n",temp==1?0:ans);
    }
    return 0;
}