[kuangbin带你飞]专题一 简单搜索 - C - Catch That Cow

 #include<iostream>
 #include<cstdio>
 #include<string>
 #include<vector>
 #include<queue>
 #include<cstring>
 using namespace std;
 int n, k, c, ans;
 int num[];
 int main()
 {
 //    freopen("in.in","r",stdin);
     while(cin>>n>>k)
     {
         ans = ;
         queue<int>q;
         q.push(n);
         num[n] = ;
         while(q.size())
         {
             c = q.front();
             if(c == k)
             {
                 ans = num[c];
                 break;
             }
             q.pop();
             if(!num[c-] && c->=)
             {
                 num[c-] = num[c] + ;
                 q.push(c-);
             }
             if(c+<= && !num[c+])
             {
                 num[c+] = num[c] + ;
                 q.push(c+);
             }
             if(c*<= && !num[*c])
             {
                 num[*c] = num[c] + ;
                 q.push(*c);
             }
         }
         cout<<ans-<<endl;
     }
     return ;
 }