神秘随机化算法求hack

#include<bits/stdc++.h>
using namespace std;
#define ull unsigned long long
const int N=100;
ull p[N],a,b,ans=0;
priority_queue<ull> q;
void SA(){
	int cnt=6e5;
	while(cnt--){
		random_shuffle(p,p+64);
		ull tot=0,dnt=0;
		for(int i=0;i<=63;i++){
			tot+=p[i];dnt++;
			if(tot>b)tot-=p[i],dnt--;
			if(tot>=a&&tot<=b)ans=max(ans,dnt);
		}
	}
}
int main(){
	srand(time(0));
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	cin>>a>>b;p[0]=1ll;
	for(int i=1;i<=63;i++)p[i]=p[i-1]*2ll;
	SA();
	cout<<ans<<"\n";
	return 0;
}