Light OJ 1170 Counting Perfect BST (DP+数学)

解析：如果知道了区间[a,b]内perfct power的个数，就可以dp求对应的BST的个数。

设dp[i]为有i个perfct power对应的BST的个数（卡特兰数）。

dp[0] = 1;

dp[i] = sigma(dp[j]*dp[i-1-j]) (0<=j<=i-1)

至于求区间[a,b]内perfct power的个数，有两种方法。

方法一：定义一个数是基，当且仅当这个数不是另一个数的幂次方。我们可以在近似O(nlogn)的时间内找出[1,100000]内的所有的基。

然后对于每一个幂次k，通过二分找出x^k <= bound的基的个数，累加即可求得。

[code]:

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>

using namespace std;
typedef long long LL;
const int maxn = 1e5+5;
const double eps = 1e-9;
const LL MOD = 1e8+7;

LL a,b,p[maxn],pl,dp[5000];

void init(){
    LL i,j;pl = 0;
    static bool ip[maxn];
    memset(ip,0,sizeof(ip));
    for(i = 2;i < maxn;i++){
        if(!ip[i]){
            p[pl++] = i;
            for(j = i;j < maxn;j*=i) ip[j]=1;
        }
    }
    dp[0] = 1;
    for(i = 1;i < 5000;i++){
        for(j = 0;j < i;j++)
            dp[i] = (dp[i]+dp[j]*dp[i-1-j])%MOD;
    }
}

int main(){
    int i,j,cas,T;
    scanf("%d",&cas);
    init();
    for(T = 1;T <= cas;T++){
        scanf("%lld%lld",&a,&b);
        LL num = 0;int ta,tb;
        for(i = 2;i < 34;i++){
            ta = (int)floor(pow(a-1,1.0/i)+eps);
            tb = (int)floor(pow(b,1.0/i)+eps);
            ta = upper_bound(p,p+pl,ta)-p;
            tb = upper_bound(p,p+pl,tb)-p;
            num += tb-ta;
        }
        printf("Case %d: %lld\n",T,num?dp[num]:0);
    }
    return 0;
}

方法二：对幂进行容斥即可。

[code]:

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<cmath>

using namespace std;
typedef long long LL;
const int maxn = 1e6+5;
const double eps = 1e-9;
const LL MOD = 1e8+7;

LL a,b,dp[maxn];
LL prime[11] = {2,3,5,7,11,13,17,19,23,29,31};
LL C[36];

LL exgcd(LL a,LL b,LL &x,LL &y){
    LL d = a;
    if(b != 0){
        d = exgcd(b,a % b,y,x);
        y -= (a / b)* x;
    }else{
        x = 1;y = 0;
    }
    return d;
}
LL inv(LL a,LL MOD){
    LL x,y;
    exgcd(a,MOD,x,y);
    return (x%MOD+MOD)%MOD;
}
void init(){
    LL i,j;
    dp[1] = 1;
    for(i = 2;i < maxn;i++){
        dp[i] = ((2LL*(2*i-1)*dp[i-1])%MOD*inv(i+1,MOD))%MOD;
    }
    for(i = 2;i < 34;i++){
        LL n = i,c1,c2;c1 = c2 = 0;
        for(j = 0;j < 11;j++){
            if(prime[j]*prime[j]>n) break;
            if(n % prime[j]==0){
                c1++;
                n /= prime[j];
                while(n%prime[j]==0){
                    c2 = 1;
                    n /= prime[j];
                }
            }
        }
        if(n != 1) c1++;
        if(c2) C[i] = 0;
        else C[i] = (c1&1)?1:-1;
    }
}

bool cmp(LL a,LL x,LL b){
    LL ans = 1;
    while(x--){
        ans *= a;
        if(ans > b) return true;
    }
    return false;
}

LL bin(LL x,LL bound){
    LL l = 1,r = maxn,mid;
    while(r-l>1){
        mid = (l+r)>>1;
        if(cmp(mid,x,bound)) r = mid;
        else l = mid;
    }
    return r-2;
}
int main(){
    LL i,j,cas,T;
    init();
    scanf("%lld",&cas);
    for(T = 1;T <= cas;T++){
        scanf("%lld%lld",&a,&b);
        LL num = 0,ta,tb;
        for(i = 2;i < 34;i++){
            ta = bin(i,a-1);
            tb = bin(i,b);
            num += C[i]*(tb-ta);
        }
        printf("Case %lld: %lld\n",T,dp[num]);
    }
    return 0;
}