POJ 3252 Round Numbers

数位DP，dp[index][zero][one]三维分别为层数，零的个数，一的个数，需要注意的是在传递零下去的时候只有在一的个数不为一的时候才能加一，不然加上去的就是前置零，是无意义的零。

#include <cstdio>
#include <cstring>
#include <string>
#include <iostream>
#include <queue>
#include <stack>
#include <algorithm>
#include <map>
#include <vector>
#include <cmath>
#include <stack>
using namespace std;
#define ll long long
#define int64 __int64
#define M 100005
#define N 1005
#define inf 1000010
#define mod 1000000009

int dig[105];
ll dp[105][105][105];

ll Dfs(int index , int zero , int one , int lim)
{
	if (!index)return zero >= one;
	if (!lim && dp[index][zero][one] != -1)return dp[index][zero][one];
	int i , up = lim ? dig[index] : 1;
	ll ret = 0;
	for (i = 0 ; i <= up ; i++)
	{
		ret += Dfs(index-1 , zero+(!i&&one) , one+i , lim&&i==up);//在一个数不为零时，零的个数才加一
	}
	if (!lim)dp[index][zero][one] = ret;
	return ret;
}

ll Solve(ll k)
{
	int len = 0;
	while (k)
	{
		dig[++len] = k%2;
		k /= 2;
	}
	return Dfs(len , 0 , 0 , 1);
}

int main()
{
	ll S , F;
	memset(dp , -1 , sizeof dp);
	while (~scanf("%lld%lld",&S,&F))
	{
		printf("%lld\n",Solve(F)-Solve(S-1));
	}
	return 0;
}