1859414_ac_62ms_704k.c

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

# include <stdio.h>
# include <string.h>

int n, N, m, r, c;
char map[310][310];

void scan(int x, int y)
{
 if(x==0||y==0||x==n+1||y==n+1) return ;
 if(map[x+1][y]=='*'||map[x-1][y]=='*'||map[x+1][y+1]=='*'||map[x][y+1]=='*'||map[x-1][y+1]=='*'||map[x+1][y-1]=='*'||map[x][y-1]=='*'||map[x-1][y-1]=='*')
  {map[x][y] = '#';return ;}
 else 
 {
  map[x][y] = '.'; 
  if(map[x][y+1]=='?') scan(x,y+1);
  if(map[x][y-1]=='?') scan(x,y-1);
  if(map[x+1][y+1]=='?') scan(x+1,y+1);
  if(map[x+1][y-1]=='?') scan(x+1,y-1);
  if(map[x+1][y]=='?') scan(x+1,y);
  if(map[x-1][y+1]=='?') scan(x-1,y+1);
  if(map[x-1][y]=='?') scan(x-1,y);
  if(map[x-1][y-1]=='?') scan(x-1,y-1);
 }
 return ;
}
void main()
{
 int i, j, k;
 
 scanf("%d",&N);
 for(i = 1; i <= N; i++)
 {
  scanf("%d%d",&n,&m);
  for(j = 0; j <= n+1; j++)
   memset(map[j],'?',n+2);
  for(j = 0; j < m; j++)
   {
    scanf("%d%d",&r,&c);
    map[r][c] = '*';
   }
   scan(n/2+1,n/2+1);
   printf("Scenario #%d:\n",i);
   for(j = 1; j <=n; j++)
    {
     for(k = 1; k <= n; k++)
       putchar(map[j][k]);
       printf("\n");
    }
    printf("\n");
 }
}