这个应该无所谓吧$qwq$
by 皎月半洒花 @ 2018-03-04 16:18:17
不会
by MorsLin @ 2018-03-04 16:27:54
https://www.luogu.org/blog/34188/solution2-p1162
by MorsLin @ 2018-03-04 16:28:45
```pascal
// luogu-judger-enable-o2
var i,j,ii,jj,n,m,t,w,x:longint;
a:array[0..31,0..31]of longint;
procedure b(x,y:longint);
begin
ii:=x; jj:=y;
end;
procedure dfs(x,y:longint);
begin
b(x,y); repeat dec(ii);
until (a[ii,jj]=1)or(ii=0);
if a[ii,jj]<>1 then exit;
b(x,y); repeat inc(ii);
until (a[ii,jj]=1)or(ii=n);
if a[ii,jj]<>1 then exit;
b(x,y); repeat dec(jj);
until (a[ii,jj]=1)or(jj=0);
if a[ii,jj]<>1 then exit;
b(x,y); repeat inc(jj);
until (a[ii,jj]=1)or(jj=n);
if a[ii,jj]<>1 then exit;
a[x,y]:=2;
end;
begin
readln(n);
for i:=1 to n do
begin
for j:=1 to n do
read(a[i][j]);
readln;
end;
for i:=2 to n-1 do
for j:=2 to n-1 do
if a[i][j]=0 then begin dfs(i,j); end;
for i:=1 to n do
begin
for j:=1 to n do
write(a[i][j],' ');
writeln;
end;
end.
```
by huangzhewer @ 2018-06-01 20:21:35
# 不会的
## ~~我没考虑到~~/笑
by huangzhewer @ 2018-06-01 20:22:12