hdu 2717——Catch That Cow

寬搜裸題

#include<cstdio>#include<iostream>#include<cstring>#include<queue>using namespace std;queue<int>q;int num[100005];int vis[100005];int x,n;void bfs(int cnt){int temp;while(!q.empty())q.pop();vis[x]=1;q.push(x);memset(vis,0,sizeof(vis));memset(num,0,sizeof(num));while(!q.empty()){temp=q.front();q.pop();if(temp==n){printf("%d\n",num[temp]);return ;}if(temp+1<=100000&&temp+1>=0&&!vis[temp+1]){q.push(temp+1);vis[temp+1]=1;num[temp+1]=num[temp]+1;}if(temp-1<=100000&&temp-1>=0&&!vis[temp-1]){q.push(temp-1);vis[temp-1]=1;num[temp-1]=num[temp]+1;}if(temp*2<=100000&&temp*2>=0&&!vis[temp*2]){q.push(temp*2);vis[temp*2]=1;num[temp*2]=num[temp]+1;}}}int main(){while(cin>>x>>n){bfs(0);}return 0;}