if(xx>0&&xx<=n&&yy>0&&yy<=n&&c[xx][yy]=1&&a[xx][yy]==0)
by Genshineer @ 2019-06-07 18:38:10
请不要用Markdown来强调头文件的重要性
by Smile_Cindy @ 2019-06-07 18:55:59
。。。~~如何看待泥咕不懂使用Markdown而水贴日渐增多的现象？ - kkksc03的回答~~
by 我是坤坤 @ 2019-06-07 18:58:49
请不要用Markdown来强调头文件的重要性
by _lcy_ @ 2019-06-07 19:05:22
@[LCRlinchenrui](/space/show?uid=191248)
```c[xx][yy]=1```
您少打了一个等号
by Raw_Aya9285 @ 2019-06-09 07:15:40
```cpp
include<bits/stdc++.h>
using namespace std;
int n,a[31][31],b[31][31],xx,yy,dx[5]= {0,0,-1,0,1},dy[5]= {0,-1,0,1,0},c[31][31];
bool pd1(int x)
{
if(x==1) return 1;
else return 0;
}
bool pd2()
{
for(int i=1; i<=n; i++) for(int j=1; j<=n; j++) if(pd1(b[i][j])==0) return 0;
return 1;
}
void print()
{
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++) cout<<a[i][j];
cout<<endl;
}
}
void dfs(int x,int y)
{
for(int i=0; i<5; i++)
{
xx=x+dx[i];
yy=y+dy[i];
if(xx>0&&xx<=n&&yy>0&&yy<=n&&c[xx][yy]=1&&a[xx][yy]==0)
{
c[xx][yy]=0;
b[xx][yy]=1;
dfs(xx,yy);
}
else return;
}
}
int main()
{
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
for(int i=1; i<=n; i++) for(int j=1; j<=n; j++) c[i][j]=1;
cin>>n;
for(int i=1; i<=n; i++) for(int j=1; j<=n; j++) cin>>a[i][j];
for(int i=1; i<=n; i++) for(int j=1; j<=n; j++) if(i==1||j==1||i==n||j==n) dfs(i,j);
for(int i=1; i<=n; i++) for(int j=1; j<=n; j++) if(b[i][j]!=1&&a[i][j]!=1) a[i][j]=2;
print();
return 0;
}
```
by wuxinyang @ 2019-07-30 17:59:36