题目:
POJ3252
题意:
求出给定区间[l, r]中所有二进制表示时0个数不小于1个的数的个数
方法:
数位DP
定义状态:lldfs(int pos, int zNum, int oNum, bool flag, bool flag2)表示二进制的当前位pos,已有0的个数zNum,1的个数oNum,flag表示是否受限,flag2表示是否为第一位(若为第一位,则枚举为0时不计入zNum)
状态转移:if (flag2 && !i ) ans += dfs(pos - 1, zNum, oNum, flag && (i ==sig), 1);
else ans +=dfs(pos - 1, zNum + (i ^ 1), oNum + (i ^ 0), flag && (i == sig), 0);
#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstring>
#include<string>
#include<algorithm>
#include<climits>
#include<cstdlib>
using namespace std;
//#define DEBUG
typedef long long ll;
int num[100];
ll f[100][100][100];
ll dfs(int pos, int zNum, int oNum, bool flag, bool flag2)
{
#ifdef DEBUG
cout<<"pos="<<pos<<" zNum="<<zNum<<" oNum="<<oNum<<endl;
#endif
if ( !pos ) return (zNum >= oNum);
if ( !flag && ~f[pos][zNum][oNum] ) return f[pos][zNum][oNum];
int sig = (flag)? num[pos]:1;
ll ans = 0;
for(int i = 0; i <= sig; i++){
if ( flag2 && !i ) ans += dfs(pos - 1, zNum, oNum, flag && (i == sig), 1);
else ans += dfs(pos - 1, zNum + (i ^ 1), oNum + (i ^ 0), flag && (i == sig), 0);
}
if ( !flag ) f[pos][zNum][oNum] = ans;
return ans;
}
ll getAns(ll x)
{
#ifdef DEBUG
cout<<"num="<<x<<endl;
#endif
int len = 0;
while ( x ) num[++len] = x % 2, x /= 2;
return dfs(len, 0, 0, 1, 1);
}
int main()
{
//freopen("in.txt", "r", stdin);
ll l, r;
memset(f, -1, sizeof(f));
while( scanf("%I64d%I64d", &l, &r)!=EOF )
{
printf("%I64d\n", getAns(r) - getAns(l - 1));
}
return 0;
}