Luogu 1588(dfs)(false)

来源:互联网 发布:淘宝木子禅佛珠怎么样 编辑:程序博客网 时间:2024/04/28 23:47
#include<stdio.h>
#include<stdlib.h>
#include<cstring>
#include<string>
#include<cmath>
#include<algorithm>
using namespace std;
int minn=99999;
int cnt,x,y,t;
void search(int x,int y,int step)
{
if(x==y)
{
minn=min(minn,step);
return;
}
else if(x<y)
{
search(x+1,y,step+1);
search(x-1,y,step+1);
search(2*x,y,step+1);
}
else if(x>y)
{
search(x-1,y,step+1);
}
}
int main()
{
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&x,&y);
search(x,y,0);
printf("%d\n",minn);
}
return 0;
}
原创粉丝点击