题目链接点击进入
题目
思路
state//表示前面有多个1
dp [ i ] [ j ] 为状态第 i 位数字之后,1 的个数为 j 的情况的数量
代码
//#pragma GCC optimize(3)//O3
//#pragma GCC optimize(2)//O2
#include<iostream>
#include<string>
#include<map>
#include<set>
//#include<unordered_map>
#include<queue>
#include<cstdio>
#include<vector>
#include<cstring>
#include<algorithm>
#include<iomanip>
#include<cmath>
#include<fstream>
#define X first
#define Y second
#define best 131
#define INF 0x3f3f3f3f3f3f3f3f
#define pii pair<int,int>
#define lowbit(x) x & -x
#define inf 0x3f3f3f3f
#define int long long
//#define double long double
//#define max(a,b) a>b?a:b
//#define min(a,b) a<b?a:b
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const double pai=acos(-1.0);
const int maxn=2e4+10;
const int mod=998244353;
const int Mod=1e9+10;
const double eps=1e-9;
const int N=1e6+10;
int a[80];
int dp[80][80];
int dfs(int pos,int pre,int state,bool lead,bool limit)
{
if(pos==-1) return state&1;
if(!limit&&!lead&&dp[pos][state]!=-1) return dp[pos][state];
int up=limit?a[pos]:1;
int res=0;
for(int i=0;i<=up;i++)
res+=dfs(pos-1,i,state+(i==0?0:1),lead&&i==0,limit&&i==a[pos]);
if(!limit&&!lead) dp[pos][state]=res;
return res;
}
int solve(int x)
{
int pos=0;
while(x)
{
a[pos++]=x%2;
x/=2;
}
return dfs(pos-1,-1,0,1,1);
}
signed main()
{
// ios::sync_with_stdio(false);
// cin.tie(0);cout.tie(0);
int l,r,t;
memset(dp,-1,sizeof(dp));
scanf("%lld",&t);
while(t--)
{
scanf("%lld%lld",&l,&r);
printf("%lld\n",solve(r)-solve(l-1));
}
return 0;
}