hdu2588 GCD 给定n，m。求x属于[1,n]。有多少个x满足gcd(x,n)>=m; 容斥或者欧拉函数

GCD
Time Limit: / MS (Java/Others)    Memory Limit: / K (Java/Others)
Total Submission(s):     Accepted Submission(s): 
 
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,(,)=,(,)=.
(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 <=X<=N and (X,N)>=M.
 
Input
The first line of input is an integer T(T<=) representing the number of test cases. The following T lines each contains two numbers N and M (<=N<=, <=M<=N), representing a test case.
 
Output
For each test case,output the answer on a single line.
 
Sample Input
 
Sample Output
 
欧拉函数做法：
/**
题目：GCD
链接：http://acm.hdu.edu.cn/showproblem.php?pid=2588
题意：给定n，m。求x属于[1,n]。有多少个x满足gcd(x,n)>=m;
思路：
x -> [1,n]
 
d = gcd(x,n) >= m
 
d肯定为n的约数。
 
对一个确定的d = gcd(x,n);
 
那么：gcd(x/d,n/d) = 1;
 
满足上面式子的x为：f(n/d); f(y)表示y的欧拉函数。
 
sigma(f(n/d)) (d为n的约数且d>=m);
 
f(y) = y*(p1-1)/p1*(p2-1)/p2...*(pe-1)/pe;
 
*/
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<vector>
#include<map>
#include<set>
#include<cmath>
#include<queue>
#define LL long long
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
ll Euler(ll x)
{
    ll n = x;
    for(int i = ; i*i<=x; i++){
        if(x%i==){
            n = n/i*(i-);
            while(x%i==)x/=i;
        }
    }
    if(x>){
       n = n/x*(x-);
    }
    return n;
}
vector<int> v;
int main()
{
    int T;
    int n, m;
    cin>>T;
    while(T--)
    {
        scanf("%d%d",&n,&m);
        v.clear();
        for(int i = ; i*i<=n; i++){
            if(n%i==){
                if(i*i==n){
                    if(i>=m) v.push_back(i);
                }
                else{
                    if(i>=m) v.push_back(i);
                    if(n/i>=m) v.push_back(n/i);
                }
            }
        }
        int len = v.size();
        int cnt = ;
        for(int i = ; i < len; i++){
            cnt += Euler(n/v[i]);
        }
        printf("%d\n",cnt);
    }
    return ;
}
 
容斥做法：
/**
题目：GCD
链接：http://acm.hdu.edu.cn/showproblem.php?pid=2588
题意：给定n，m。求x属于[1,n]。有多少个x满足gcd(x,n)>=m;
思路：
 
显然d = gcd(x,n)中的d一定是n的约数。
 
显然d = gcd(d,n); 先获得所有>=m的d;
 
那么d的倍数为x=k*d，如果小于等于n，则一定也满足gcd(x,n)>=m；
 
k = n/d; 如果对每个d这样计算，会有重复的计算。
 
当d = 2, 3时候，x=6会多计算一次。
 
所以要对所有的d进行容斥处理。
 
问题转化为：n的约数为d，求解d>=m的所有的d在n范围内至少有一个是d的倍数的数有多少个。
 
*/
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<vector>
#include<map>
#include<set>
#include<cmath>
#include<queue>
#define LL long long
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
vector<int> v;
int a[], z;  ///注意a数组要开大些，约数个数还是不是100就够的。
ll gcd(ll a,ll b)
{
    return b==?a:gcd(b,a%b);
}
ll rc(ll n)
{
    ll sum = ;
    ll mult;
    int ones;
    int len = v.size();
    int m = (<<len);
    //奇加偶减
    for(int i = ; i < m; i++){
        ones = ;
        mult = ;
        for(int j = ; j<len; j++){
            if(i&(<<j)){
                ones++;
                mult = mult/gcd(mult,v[j])*v[j];
                if(mult>n) break;
            }
        }
        if(ones%==){
            sum -= n/mult;
        }else
        {
            sum += n/mult;
        }
    }
    return sum;
}
int main()
{
    int T;
    int n, m;
    cin>>T;
    while(T--)
    {
        scanf("%d%d",&n,&m);
        v.clear();
        z = ;
        for(int i = ; i*i<=n; i++){
            if(n%i==){
                if(i*i==n){
                    if(i>=m) a[z++] = i;
                }
                else{
                    if(i>=m) a[z++] = i;
                    if(n/i>=m) a[z++] = n/i;
                }
            }
        }
        ///出去包含的，比如2,4那么4要去掉。以为4的倍数一定是2的倍数。
        sort(a,a+z);
        for(int i = ; i < z; i++){
            int sign = ;
            for(int j = ; j < i; j++){
                if(a[i]%a[j]==){
                    sign = ; break;
                }
            }
            if(sign==){
                v.push_back(a[i]);
            }
        }
        printf("%lld\n",rc(n));
    }
    return ;
}