RT，调了一下午都不行...样例都过不了，会输出9。

#include<bits/stdc++.h>
using namespace std;
int dp[100][100][100],a[100],len;
int dfs(int pos,int num0,int num1,int lead,int limit){
	if(pos>len){
		if(num0>=num1&&)return 1;
		return 0;
	}
	if(!limit&&!lead&&dp[pos][num0][num1]!=-1)return dp[pos][num0][num1];
	int res=limit?a[len-pos+1]:1,ans=0;
	for(int i=0;i<=res;i++){
		if(!i&&lead)ans+=dfs(pos+1,0,0,1,i==res&&limit);
		else{
			if(i==0)num0++;
			else num1++;
			ans+=dfs(pos+1,num0,num1,0,i==res&&limit);
		}
	}
	if(!limit&&!lead)dp[pos][num0][num1]=ans;
	return ans;
}
int round(int x){
	len=0;
	while(x){
		a[++len]=x%2;
		x/=2;
	}
	memset(dp,-1,sizeof(dp));
	return dfs(1,0,0,1,1);
}
int main(){
	int l,r;
	cin>>l>>r;
	cout<<round(r)-round(l-1);
	return 0;
}