POJ 2773 二分 +容斥原理

http://bak.vjudge.net/problem/10260/origin

给m k

求与m互质的第k个数 

(1 <= m <= 1000000), K (1 <= K <= 100000000).

。

k比较大，对于一个数n，1到n以内和m互质的数可以通过容斥原理很快算出来，并且随n递增

因此二分k就好了

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<set>
using namespace std;
typedef long long  ll;
const ll p =1000000007;
const long long  N=1000000;

ll prim[100];
long long ok=0;
void ff(ll x)
{
    ok=0;
    long long ret;
    for (ll i=2; i*i<=x; i++)
    {
        if (x%i==0)
        {
            prim[ok++ ]=i;
            while(x%i==0) x=x/i;
        }
    }
    if (x!=1)	prim[ok++]=x;
}
ll m,k ;
ll judge(ll x)
{
    ll ret=0;
    ll all=1LL<<ok;
    for (int i=1;i<all;i++)
    {
        ll tmp=1,cun=0;
        for (int j=0;j<ok;j++)
            if (i&(1LL<<j)) tmp*=prim[j],cun++;
        if (cun&1) ret+=x/tmp;
        else ret-=x/tmp;
    }
    return x-ret;
}
ll bin(ll k)
{
    ll l=1,r=1e18,ans=-1;
    while(l<=r)
    {
        ll mid=(l+r)>>1;
        if (judge(mid)>=k)
        r=mid-1,ans=mid;
        else l=mid+1;
    }
    return ans;
}
int  main()
{
    long long t,cnt=1;
    while(scanf("%lld%lld",&m,&k)!=EOF)
    {
        ff(m);
        ll ans=bin(k);
        printf("%lld\n",ans);
    }


    return 0;
}