HDU2588（欧拉函数）

GCD

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

Problem Description

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 Carp is considering a little more difficult problem:
Given integers N and M, how many integer X satisfies 1<=X<=N and (X,N)>=M.

 

Input

The first line of input is an integer T(T<=100) representing the number of test cases. The following T lines each contains two numbers N and M (2<=N<=1000000000, 1<=M<=N), representing a test case.

 

Output

For each test case,output the answer on a single line.

 

Sample Input

3 1 1 10 2 10000 72

 

Sample Output

1 6 260

欧拉函数：求<=n中与n互素的数的个数。至于这道题为什么用到欧拉函数：gcd(n,x)=d; n=p*d,x=q*d;  p与q是互质的，因为n>=x所以要求d>=m时p的欧拉函数值。

#include<stdio.h>
#include<string.h>
int euler(int n){ //返回euler(n)
     int res=n;
     for(int i=2;i*i<=n;i++){
         if(n%i==0){
             res-=res/i;
             while(n%i==0) n/=i;
         }
     }
     if(n>1) res-=res/n;
     return res;
}
int main()
{
    int T,n,m,i,sum;
    while(scanf("%d",&T)!=EOF)
    {
        while(T--)
        {
          sum=0;
          scanf("%d%d",&n,&m);
          for(i=1;i*i<=n;i++)
          {
              if(n%i==0)
              {
                  if(i>=m)
                      sum=sum+euler(n/i);
                  if((n/i)!=i&&(n/i)>=m)
                      sum=sum+euler(i);
              }
          }
          printf("%d\n",sum);
        }
    }
    return 0;
}