poj 3532 Round Numbers 入门数位dp

http://poj.org/problem?id=3252

题意: 一个数二进制0的个数>=1的个数这个数就是round number,问有多少round number

思路: 存s数组时存二进制即可.

代码:

#include<cstdio>
#include<cstring>
#define fuck(x) std::cout<<"["<<#x<<"->"<<x<<"]"<<endl;
using namespace std;
typedef long long ll;

const int M=2e5+5;
const int inf=1e9+5;
const int mod=1e9+7;
//memset(a,0x3f,sizeof(a));

ll dp[40][40][40][2];
//fs0=1表示还在前导零

int s[40];

ll dfs(int pos,int n0,int n1,int fs0,int lim) {
    if(pos<=0) {
        return n0>=n1;
    }
    if(!lim&&dp[pos][n0][n1][fs0]!=-1)
        return dp[pos][n0][n1][fs0];
    int nn=lim?s[pos]:1;
    ll ans=0;
    for(int i=0; i<=nn; i++) {
        int _n0=n0,_n1=n1,_fs0;
        if(fs0==0||i!=0)
            _fs0=0;
        else
            _fs0=1;
        if(_fs0==0&&i==0)
            _n0++;
        if(i==1)
            _n1++;
        ans+=dfs(pos-1,_n0,_n1,_fs0,lim&&i==s[pos]);
    }
    if(!lim)
        dp[pos][n0][n1][fs0]=ans;
    return ans;
}



ll solve(ll x) {
    int si=0;
    while(x>0) {
        s[++si]=x%2;
        x/=2;
    }
    return dfs(si,0,0,1,1);
}


int main() {
    ll n,m;
    scanf("%lld%lld",&n,&m);
    memset(dp,-1,sizeof(dp));
    printf("%lld\n",solve(m)-solve(n-1));
    return 0;
}