HDU 5297 Y Sequence (容斥定理+迭代法搜索答案)*

Y sequence

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 2559    Accepted Submission(s): 633

 

Problem Description

Yellowstar likes integers so much that he listed all positive integers in ascending order,but he hates those numbers which can be written as a^b (a, b are positive integers,2<=b<=r),so he removed them all.Yellowstar calls the sequence that formed by the rest integers“Y sequence”.When r=3,The first few items of it are：
2,3,5,6,7,10......
Given positive integers n and r，you should output Y(n)(the n-th number of Y sequence.It is obvious that Y(1)=2 whatever r is).

 

 

Input

The first line of the input contains a single number T:the number of test cases.
Then T cases follow, each contains two positive integer n and r described above.
n<=2*10^18,2<=r<=62,T<=30000.

 

 

Output

For each case,output Y(n).

 

 

Sample Input

2 10 2 10 3

 

 

Sample Output

13 14

 

 

Author

FZUACM

 

 

Source

2015 Multi-University Training Contest 1

 

 

Recommend

We have carefully selected several similar problems for you:  6447 6446 6445 6444 6443 

 

 

#pragma comment(linker, "/STACK:102400000,102400000")
#include<bits/stdc++.h>
using namespace std;

#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)

#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define ll long long

const int  maxn =65;
const int mod=1e9+7;
/*
题目大意：数学题，给定一个上界k，要求数数不含m次方的数的个数，2<=m<=k.

和BZOJ上面的一道题很像，但是变形了一下，
由于容斥的对象特别小，别用筛法，用预处理，
虽然看起来每次62的常数复杂度不多，但是迭代法的上界是无法预知的，
这就需要预处理加速，
就相当于每个样例的预处理时间多了点，然后搜索答案的时间少了点，分摊了下。

这题容斥思想不难想，就是一个迭代法搜索答案的问题，
我也是第一次接触到迭代法搜索答案，二分法对这题而言很尴尬，
因为上界会爆long long 。
*/
ll gcd(ll x,ll y) { return y==0?x:gcd(y,x%y); }

const int fac[30] = {-2, -3, -5, -7, -11, -13, -17, -19, -23, -29, -31, -37, -41, -43, -47,-53,-59,-61,-67};///预处理比筛法快很多
vector<int> s;///存储质数的容器
void sieve(ll x)
{
    s.clear();
    for(int i=0;abs(fac[i])<=x;i++)
    {
        int tmp=s.size();
        for(int j=0;j<tmp;j++)  if(abs(s[j]*fac[i])<=63) s.push_back(fac[i]*s[j]);
        s.push_back(fac[i]);
    }
}
ll n,k;
ll calc(ll n)
{
    if(n==1) return 0;
    ll ans=n;
    for(int i=0;i<s.size();i++)
    {
        ll tmp=(ll)(pow(n+0.5,1.0/abs(s[i]))-1);
        if(s[i]>0)  ans+=tmp;
        else ans-=tmp;
    }
    return ans-1;
}
int main()
{
    int t;scanf("%d",&t);
    while(t--)
    {
        scanf("%lld%lld",&n,&k);
        ll ret=n;  sieve(k);
      ///  cout<<calc(100)<<endl;
        while(1)
        {
            ll g=calc(ret);
            if(g==n) break;
            ret+=n-g;///迭代步进法
        }///二分法会爆掉
        printf("%lld\n",ret);
    }
    return 0;
}
/*
100
2000000000000000000 62
*/