HDU_2717_Catch That Cow

很短的 BFS 队列

HDU_2717_Catch That Cow

 #include<iostream>
 #include<algorithm>
 #include<cstring>
 #include<cstdio>
 #include<queue>
 using namespace std;

 int book[<<]={};
 int que[<<];
 int n,k;
 int main()
 {
     cin>>n>>k;
     queue<int>q;
     que[n]=;
     book[n]=;
     q.push(n);
     while(!q.empty())
     {
         int a=q.front();
         q.pop();
         if(a->= && !book[a-])
         {
             book[a-]=;
             que[a-]=que[a]+;
             q.push(a-);
         }
         if(a+<=*k && !book[a+])
         {
             book[a+]=;
             que[a+]=que[a]+;
             q.push(a+);
         }
         if(a*<=*k && !book[a*])
         {
             book[a*]=;
             que[a*]=que[a]+;
             q.push(a*);
         }
     }
     cout<<que[k]<<endl;
 }