zoukankan      html  css  js  c++  java
  • hdu 1787(欧拉函数)

    GCD Again

    Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 2874    Accepted Submission(s): 1240


    Problem Description
    Do you have spent some time to think and try to solve those unsolved problem after one ACM contest?
    No? Oh, you must do this when you want to become a "Big Cattle".
    Now you will find that this problem is so familiar:
    The greatest common divisor GCD (a, b) of two positive integers a and b, sometimes written (a, b), is the largest divisor common to a and b. For example, (1, 2) =1, (12, 18) =6. (a, b) can be easily found by the Euclidean algorithm. Now I am considering a little more difficult problem:
    Given an integer N, please count the number of the integers M (0<M<N) which satisfies (N,M)>1.
    This is a simple version of problem “GCD” which you have done in a contest recently,so I name this problem “GCD Again”.If you cannot solve it still,please take a good think about your method of study.
    Good Luck!
     
    Input
    Input contains multiple test cases. Each test case contains an integers N (1<N<100000000). A test case containing 0 terminates the input and this test case is not to be processed.
     
    Output
    For each integers N you should output the number of integers M in one line, and with one line of output for each line in input.
     
    Sample Input
    2 4 0
     
    Sample Output
    0 1
     水题一枚
    #include <stdio.h>
    #include <string.h>
    using namespace std;
    typedef long long LL;
    LL phi(LL x)
    {
        LL ans=x;
        for(LL i=2; i*i<=x; i++)
            if(x%i==0)
            {
                ans=ans/i*(i-1);
                while(x%i==0) x/=i;
            }
        if(x>1)
            ans=ans/x*(x-1);
        return ans;
    }
    
    int main(){
        LL n;
        while(scanf("%lld",&n)!=EOF,n){
            printf("%lld
    ",n-phi(n)-1);
        }
    }
  • 相关阅读:
    124. 二叉树中的最大路径和
    快速排序,归并排序
    剑指offer ——重建二叉树
    共享指针的简单实现
    string_自定义
    幸运的袋子
    动态规划——出差问题
    计算数组平均值
    时间格式化并算差值
    适配器模式
  • 原文地址:https://www.cnblogs.com/liyinggang/p/5540481.html
Copyright © 2011-2022 走看看