hdu2717 Catch That Cow

http://acm.hdu.edu.cn/showproblem.php?pid=2717

//水搜。。。

 #include<stdio.h>
 #include<math.h>
 #include<string.h>
 #include<stdlib.h>
 #include<iostream>
 #include<queue>
 using namespace std;
 struct stu{
     int x;
     int t;
 }abc,q;
 int n,k;
 int vis[];
 void bfs()
 {
     queue<struct stu>p;
     p.push(abc);
     while(!p.empty())
     {
         abc=p.front();
         p.pop();
         if(abc.x==k)
         {
             printf("%d\n",abc.t);
             return ;
         }
         q.x=abc.x-;
         if(q.x>=&&q.x<=&&!vis[q.x])
         {
             q.t=abc.t+;
             vis[q.x]=;
             p.push(q);
         }
         q.x=abc.x+;
         if(q.x>=&&q.x<=&&!vis[q.x])
         {
             q.t=abc.t+;
             vis[q.x]=;
             p.push(q);
         }
         q.x=abc.x*;
         if(q.x>=&&q.x<=&&!vis[q.x])
         {
             q.t=abc.t+;
             vis[q.x]=;
             p.push(q);
         }
     }
 }

 int main()
 {
     //freopen("in.txt","r",stdin);
     while(~scanf("%d%d",&n,&k))
     {
         memset(vis,,sizeof(vis));
         abc.x=n;
         abc.t=;
         vis[n]=;
         bfs();
     }
     return ;
 }