解析:注意L/(R-L+1) <= 2015。所以向上搜索的过程最多不会超过11层。
[code]:
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
typedef long long LL;
const LL INF = 0x3f3f3f3f3f3f3f3f;
LL l,r,ans;
void dfs(LL l,LL r,int num){
//printf("%I64d %I64d %d\n",l,r,num);
if(num>11||r > INF||l < 0||l > r) return;
if(l!= 0&&2*l <= r) return;
if(l==0){
ans = min(ans,r);
return;
}
dfs(2*l-r-2,r,num+1);
dfs(2*l-r-1,r,num+1);
dfs(l,2*r-l,num+1);
dfs(l,2*r-l+1,num+1);
}
int main(){
int i,j,u,v;
while(~scanf("%I64d%I64d",&l,&r)){
ans = INF;
dfs(l,r,0);
printf("%I64d\n",ans==INF?-1:ans);
}
return 0;
}