Submission #1312353

---

Source Code Expand

// {{{ Boilerplate Code <--------------------------------------------------
// vim:filetype=cpp:foldmethod=marker:foldmarker={{{,}}}

#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>

#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
#define ALL(A)     (A).begin(), (A).end()

using namespace std;

// }}}

int lsb(long long in){
	int ret=0;
	while(in){
		ret++;
		in>>=1;
	}
	return ret;
}

int main(){
	long long A,B;
	cin>>A>>B;

	if(A==B){
		cout<<1<<endl;
		return 0;
	}

	while(lsb(A)==lsb(B)){
		long long t=1LL<<(lsb(A)-1);
		A-=t;
		B-=t;
	}

	int lsbnow=lsb(B)-1;

	long long ans=0;

	long long t1 = (1LL<<lsbnow)-A;
	long long t2 = (1LL<<lsb(B-(1LL<<lsbnow)));

	if(t1+t2>1LL<<lsbnow){
		ans = (1LL<<lsbnow) + t1;
	}else{
		ans = t1+t1+t2;
	}

	cout<<ans<<endl;
}

Submission Info

Judge Result