1808375_ac_0ms_24k.c

北大大牛代码 1240道题的原代码 超级权威

# include <stdio.h>

void main()
{
  int i, j, n, m, mark, a[12][12];
  char mine[12][12], touch[12][12];
  
    scanf("%d\r",&n);
    mark = 0;
    for(i = 0; i < n; i++)
     gets(mine[i]);
    for(i = 0; i < n; i++)
     gets(touch[i]); 
    for(i = 0; i < 12; i++)
    for(j = 0; j < 12; j++)
    a[i][j] = 0;
    for(i = 0; i < n; i++)
    for(j = 0; j < n; j++)
    if(mine[i][j] == '*')
    { 
      a[i+1][j+1] = -10;
      a[i+1][j+2]++;a[i+1][j]++;
      a[i+2][j+2]++;a[i+2][j+1]++;
      a[i+2][j]++;a[i][j+1]++;
      a[i][j+2]++;a[i][j]++;
    } 
    for(i = 0; i < n; i++)
    for(j = 0; j < n; j++)
    if(touch[i][j] == 'x') 
    {
     if(a[i+1][j+1] < 0) mark = 1;
     touch[i][j] = a[i+1][j+1] + 48;
    }
    if(mark)
    for(i = 0; i < n; i++)
    for(j = 0; j < n; j++)
    if(mine[i][j] == '*')
    touch[i][j] = '*'; 
        for(i = 0; i < n; i++)
        puts(touch[i]);
            
  
}