题意
求[L,R]区间有多少个round numbers? round numbers:二进制下0的个数不少于1的个数。
思路
dp[pos][zero][one]表示选了前pos位,zero个0,one个1。
注意前导0不能算0的个数,,,
//#include <bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int len, num[32], dp[32][32][32];
int dfs(int pos, int zero, int one, bool limit, bool fzero)
{
if (pos == -1) return zero>=one;
if (!limit && dp[pos][zero][one] != -1) return dp[pos][zero][one];
int E = limit?num[pos]:1, ans = 0;
for (int i = 0; i <= E; i++)
ans += dfs(pos-1, zero+(!fzero&&i==0), one+(i==1), limit&&(i==E), fzero&&(i==0));
if (!limit) dp[pos][zero][one] = ans;
return ans;
}
int solve(int x)
{
len = 0;
while (x)
{
num[len++] = x%2;
x/=2;
}
return dfs(len-1, 0, 0, 1, 1);
}
int main()
{
memset(dp, -1, sizeof(dp));
int L, R;
scanf("%d%d", &L, &R);
printf("%d\n", solve(R)-solve(L-1));
return 0;
}
/*
2 12
*/