poj3278 Catch That Cow

     做得有点蛋疼的题目，剪枝时一直出现些小问题。

#include<stdio.h>
#include<queue>
using namespace std;
bool vis[200002];
int n,k;
queue<int>pai;
int bfs()
{
	int s=-1,len,i,t;
	for(;;)
	{
		len=pai.size();
		s++;
		for(i=0;i<len;i++)
		{			
			t=pai.front();
			if(t==k)return s;
			pai.pop();
			if(t-1>=0&&!vis[t-1])
			{
				pai.push(t-1);
				vis[t-1]=1;
			}
			if(t+1<100001&&!vis[t+1])
			{
				pai.push(t+1);
				vis[t+1]=1;
			}
			if(2*t<100001&&!vis[2*t])
			{
				pai.push(2*t);
				vis[2*t]=1;
			}
		}
	}

}
int main()
{
	//freopen("t.txt","r",stdin);
	while(scanf("%d%d",&n,&k)!=EOF)
	{
		memset(vis,0,sizeof(vis));
		while(!pai.empty())pai.pop();
		pai.push(n);vis[n]=1;
		int ans=bfs();
		printf("%d\n",ans);
	}
	return 0;
}