codeforces553C. Problem for Nazar

题目传送门 ┗|｀O′|┛ 嗷~~

---

大概是个数学模拟题来着，写好通项和前n项和就行了

---

#include <stdio.h>
#include <climits>
#include <cstring>
#include <time.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <vector>
#include <string>

#define INF 0x3f3f3f3f
#define ll long long
#define Pair pair<int,int>
#define re return

#define getLen(name,index) name[index].size()
#define mem(a,b) memset(a,b,sizeof(a))
#define Make(a,b) make_pair(a,b)
#define Push(num) push_back(num)
#define rep(index,star,finish) for(register int index=star;index<finish;index++)
#define drep(index,finish,star) for(register int index=finish;index>=star;index--)
using namespace std;
const int mod=1000000007;

ll limt[64];
ll cal(ll pos);
ll getpow(int p);
inline ll S1(ll t);
inline ll S2(ll t);
int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    
    ll pow=1;
    rep(n,0,61){
        limt[n]=pow-1;
        pow*=2;
    }

    ll l,r;
    cin>>l>>r;
    cout<<((cal(r)+mod-cal(l-1))%mod)<<endl;

    re 0;
}
ll cal(ll pos){
    if(pos==0)
        re 0;
    int index=1;
    rep(i,1,61){
        if(limt[i]>=pos){
            index=i;
            break;
        }
    }

    int t;
    ll tot=0;
    ll oddSum=0,evenSum=0;
    if(index%2){
        t=(index-1)/2;
        tot=((getpow(t)-1)*2)/3%mod;
        evenSum=S2(tot);
        t=(index+1)/2;
        tot=((getpow(t)-1)/3-(limt[index]-pos))%mod;
        oddSum=S1(tot);
    }else{
        t=index/2;
        tot=(getpow(t)-1)/3%mod;
        oddSum=S1(tot);
        tot=(((getpow(t)-1)*2)/3-(limt[index]-pos))%mod;
        evenSum=S2(tot);
    }

    re (oddSum+evenSum)%mod;
}
inline ll S1(ll t){
    re (t*t)%mod;
}
inline ll S2(ll t){
    re (t*t%mod+t)%mod;
}
ll getpow(int p){
    ll ans=1;
    while(p){
        ans*=4;
        p--;
    }
    re ans;
}