/*#ince <stdlib.h>
int ma
printf("Hllo world!\n"); return 0;
*/
/*
#include <stdio.h>
int arr[100][100]= {};
int queue[2][10000]= {};
int back = 0;
int front = 0;
int n, px, py;
int k=1;
void push( int x, int y )
{
queue[0][back] = x;
queue[1][back] = y;
arr[x][y]=k;
back++;
}
void bfs(int x, int y)
{
push(x,y);
while(front != back)
{
view();
k++;
int max=back-1;
for(int t = front; t<=max; t++)
{
px = queue[0][t];
py = queue[1][t];
if(py-1 >= 1 && arr[px][py-1] == 0 )
{
push(px,py-1);
}
if(py+1 <= n && arr[px][py+1] == 0)
{
push(px,py+1);
}
if(px-1 >= 1 && arr[px-1][py] == 0)
{
push(px-1,py);
}
if(px+1 <= n && arr[px+1][py] ==0)
{
push(px+1,py);
}
front++;
}
}
}
void view()
{
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
{
printf("%d ",arr[i][j]);
}
printf("\n");
}
printf("\n");
}
int main()
{
int i, j;
scanf("%d",&n);
scanf("%d %d",&i,&j);
bfs(i,j);
view();
return 0;
}
1. 단지번호 bfs로 풀기.
2. 앞으로 뭐할지 생각해오기!!!
*/