Catch That Cow （bfs）

Catch That Cow

bfs代码

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<bitset>
#include<cstdlib>
#include<cmath>
#include<set>
#include<list>
#include<deque>
#include<map>
#include<queue>
using namespace std;
typedef long long lint;
const double PI = acos(-1.0);
const int INF = ;
const int maxn = ;

struct node{
    int n, t;
};

node n;
int s, e;
int vis[maxn];

int bfs()
{
    queue<node>q;
    q.push(n);
    while(!q.empty())
    {
        int b[];
        node tmp;
        tmp = q.front();
        q.pop();
        //  cout << tmp.n << "&&" << tmp.t << "   ";
        if(tmp.n == e)
        {
            return tmp.t;
        }
        for(int i = ; i < ;i++)
        {
            if(i == ) b[i] = tmp.n - ;
            else if(i == ) b[i] = tmp.n + ;
            else if(i == ) b[i] = tmp.n * ;
            if(b[i] < maxn && !vis[b[i]] && b[i] >= )
            {
                node g;
                g.n = b[i];
                g.t = tmp.t + ;
                vis[g.n] = ;
                q.push(g);
            }
        }
    }
    return -;
}

int main()
{
    while(cin >> s >> e)
    {
        n.n = s, n.t = ;
        memset(vis, , sizeof(vis));
        int ans = bfs();
        cout << ans << endl;
    }

}