http://codeforces.com/problemset/problem/520/B
题目给定两个数n,m,让你将n通过-1 或者 *2 操作获取m,1<=n<=m<=10000,且过程中不产生负数。
思路:建立二叉树,然后bfs。
#include<stdio.h>
#include<string.h>
#include<queue>
#include<algorithm>
using namespace std;
queue<int>q,p;
int bfs(int x,int y){
int visit[10010];
memset(visit,0,sizeof(visit));
while(!q.empty())q.pop();
while(!p.empty())p.pop();
q.push(x);
visit[x] = 1;
p.push(0);
while(!q.empty()){
int number = q.front();
int ceng = p.front();
q.pop();
p.pop();
if(number == y)return ceng;
if(number*2<=10000&&!visit[number*2]){
q.push(number*2);
visit[number*2] = 1;
p.push(ceng+1);
}
if(number -1 > 0&&!visit[number-1]){
q.push(number-1);
visit[number-1] = 1;
p.push(ceng+1);
}
}
}
int main(){
int n,m;
while(~scanf("%d%d",&n,&m)){
printf("%d\n",bfs(n,m));
}
}