poj2612Mine Sweeper

很简单的模拟题目，但在队内赛的时候一直WA了10发。。。我ca

题目没看懂，也不算，就是我以为摸到地雷他会标星（*） ，但其实还是（x），T_T

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

int n;
bool tag = false;
char graph1[15][15];
char graph2[15][15];
char graph3[15][15];

int mov[8][2] = {{-1, -1}, {-1, 0}, {-1, 1}, {0, -1}, {0, 1}, {1, -1}, {1, 0}, {1, 1}};

bool check(int x, int y)
{
    if(x >= 0 && y >= 0 && x < n && y < n)
        return true;
    return false;
}

int handle(int i, int j)
{
    int sum = 0;
    for(int k = 0; k < 8; ++k)
    {
        int x = mov[k][0] + i;
        int y = mov[k][1] + j;
        if(check(x, y) && graph1[x][y] == '*')
        {
            sum++;
        }
    }
    return sum;
}

int main()
{

    int i, j;
    while(scanf("%d%*c", &n) != EOF)
    {
        memset(graph1, 0, sizeof(graph1));
        memset(graph2, 0, sizeof(graph2));
        memset(graph3, 0, sizeof(graph3));

        for(i = 0; i < n; ++i)
        {
           gets(graph1[i]);
           //puts(graph1[i]);
        }
        for(i = 0; i < n; ++i)
        {
            gets(graph2[i]);
            //puts(graph2[i]);
        }

        for(i = 0; i < n; ++i)
        {
            for(j = 0; j < n; ++j)
            {
                if(graph2[i][j] == 'x' && graph1[i][j] == '*')
                    tag = true;
            }
        }

        if(tag == false)
        {
            for(i = 0; i < n; ++i)
            {
                for(j = 0; j < n; ++j)
                {
                    if(graph2[i][j] == 'x')
                    {
                        graph3[i][j] = '0' + handle(i, j);
                    }
                    else
                    {
                        graph3[i][j] = '.';
                    }
                }
            }
        }
        else
        {
            for(i = 0; i < n; ++i)
            {
                for(j = 0; j < n; ++j)
                {
                    if(graph1[i][j] != '*' && graph2[i][j] == 'x')
                    {
                        graph3[i][j] = '0' + handle(i, j);
                    }
                    else if(graph2[i][j] == '.' && graph1[i][j] == '*')
                    {
                        graph3[i][j] = '*';
                    }
                    else if(graph2[i][j] == 'x' && graph1[i][j] == '*')
                    {
                        graph3[i][j] = '*';
                    }
                    else
                    {
                        graph3[i][j] = '.';
                    }
                }
            }
        }

        for(i = 0; i < n; ++i)
        {
            puts(graph3[i]);
        }
    }
    return 0;
}