连连看小游戏

刚才刚写完杭电的连连看那个题目，把他修改一下，这就是个小游戏了， 不过就是太简陋了

查看效果

附上代码：

#include <cstdio>
#include <queue>
using std::queue;
#define INF 99999999
int next[4][2] = {{0,1},{1,0},{0,-1},{-1,0}};
int map[100][100],book[100][100],m,n;
struct node
{
    int x,y,dir,turn;
};
node start,end;

void BFS()
{
    int k,i,j;
    queue<node> que;
    node cur,pre;
    start.dir = -1;
    start.turn = 0;
    que.push(start);
    while(!que.empty())
    {
        pre = que.front();
        que.pop();
        if(pre.x == end.x && pre.y == end.y)
        {
            map[start.x][start.y] = map[end.x][end.y] = 0;
            for(i = 1; i <= n; ++i)
            {
                for(j = 1; j <= m; ++j)
                    printf("%d ",map[i][j]);
                printf("\n");
            }
            return ;
        }

        for(k = 0; k < 4; ++k)
        {
            cur.x = pre.x + next[k][0];
            cur.y = pre.y + next[k][1];
            cur.turn = pre.turn;
            cur.dir = k;
            if(pre.dir != cur.dir && pre.dir != -1)
                cur.turn++;

            if(cur.x < 1 || cur.y < 1 || cur.x > n || cur.y > m || cur.turn > 2)
                continue;
            if(map[cur.x][cur.y] && !(cur.x == end.x && cur.y == end.y))
                continue;
            if(cur.turn < book[cur.x][cur.y])
            {
                book[cur.x][cur.y] = cur.turn;
                que.push(cur);
            }
        }
    }
    printf("Cannot Match!\n");
}

int main()
{
    int i,j,sum,flag;
    printf("Please input height and width:\n");
    while(scanf("%d %d",&n,&m) && (n+m))
    {
        for(i = 1; i <= n; ++i)
            for(j = 1; j <= m; ++j)
                scanf("%d",&map[i][j]);

        while(1)
        {
            sum = 0;
            printf("Start and Finish:");
            scanf("%d %d %d %d",&start.x,&start.y,&end.x,&end.y);
            if(start.x == end.x && start.y == end.y)
            {
                printf("Cannot Match!\n");
                continue;
            }
            if(!map[start.x][start.y] || !map[end.x][end.y] || (map[start.x][start.y] != map[end.x][end.y]))
            {
                printf("Cannot Match!\n");
                continue;
            }
            for(i = 1; i <= n; ++i)
                for(j = 1; j <= m; ++j)
                    book[i][j] = INF;

            BFS();

            for(i = 1; i <= n; ++i)
                for(j = 1; j <= m; ++j)
                    sum += map[i][j];
            if(!sum)
            {
                printf("Congratulation!\n");
                flag = 1;
                break;

            }
        }
        printf("1:Again\n2:Exit\n");
        scanf("%d",&flag);
        if(flag == 1)
        {
            printf("Please input height and width:\n");
            continue;
        }
        else
            break;
    }
    return 0;
}

效果：