分析:
这道题比赛的时候居然
wa
了,实在是有点傻逼。这道题仔细想想就是一个递归,比赛的时候主要反转的操作没想清楚,其实只要再反转一次就好了,如果这一段多了
x
个数,那么这
复杂度:
o(64∗logn)
代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <vector>
#include <string>
using namespace std;
typedef long long LL;
typedef vector <int> VI;
typedef pair <int,int> PII;
#define FOR(i,x,y) for(int i = x;i < y;++ i)
#define IFOR(i,x,y) for(int i = x;i > y;-- i)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
LL query(LL x){
if(x == 0) return 0;
LL sum = 1;
FOR(i,0,100){
if(sum > x) {sum /= 2;break;}
sum = sum*2+1;
}
//cout << x << ":" << sum <<endl;
LL val = x-sum;
LL ans = (sum+1)/2;
if(val) ans ++;
if(val > 1){
val --;
LL len = sum-val;
ans += sum/2-(len-query(len));
}
return ans;
}
LL l,r;
int main(){
//freopen("test.in","r",stdin);
int T; scanf("%d",&T);
while(T--){
scanf("%I64d%I64d",&l,&r);
printf("%I64d\n",query(r)-query(l-1));
}
return 0;
}