poj2612Mine Sweeper

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

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

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

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

 int mov[][] = {{-, -}, {-, }, {-, }, {, -}, {, }, {, -}, {, }, {, }};

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

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

 int main()
 {

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

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

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

         if(tag == false)
         {
             for(i = ; i < n; ++i)
             {
                 for(j = ; j < n; ++j)
                 {
                     if(graph2[i][j] == 'x')
                     {
                         graph3[i][j] = '' + handle(i, j);
                     }
                     else
                     {
                         graph3[i][j] = '.';
                     }
                 }
             }
         }
         else
         {
             for(i = ; i < n; ++i)
             {
                 for(j = ; j < n; ++j)
                 {
                     if(graph1[i][j] != '*' && graph2[i][j] == 'x')
                     {
                         graph3[i][j] = '' + 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 = ; i < n; ++i)
         {
             puts(graph3[i]);
         }
     }
     return ;
 }