Description
![](http://acm.zju.edu.cn/onlinejudge/showImage.do?name=0000%2F2850%2Fpic.jpg)
Tom's Meadow
Tom has a meadow in his garden. He divides it into N * M squares. Initially all the squares were covered with grass. He mowed down the grass on some of the squares and thinks the meadow is beautiful if and only if
- Not all squares are covered with grass.
- No two mowed squares are adjacent.
Two squares are adjacent if they share an edge. Here comes the problem: Is Tom's meadow beautiful now?
Input
The input contains multiple test cases!
Each test case starts with a line containing two integers N, M (1 <= N, M <= 10) separated by a space. There follows the description of Tom's Meadow. There're N lines each consisting of M integers separated by a space. 0(zero) means the corresponding position of the meadow is mowed and 1(one) means the square is covered by grass.
A line with N = 0 and M = 0 signals the end of the input, which should not be processed
Output
One line for each test case.
Output "Yes" (without quotations) if the meadow is beautiful, otherwise "No"(without quotations).
Sample Input
2 2
1 0
0 1
2 2
1 1
0 0
2 3
1 1 1
1 1 1
0 0
Sample Output
Yes
No
No
输入的数相邻两个不能是0,但是全部为1,也不行
分析:
数组储存,然后比较
代码:
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a[20][20],n,m,i,j,t,f,q;
while(cin>>n>>m&&n!=0&&m!=0)
{
f=0;
q=0;
for(i=0;i<n;i++)
for(j=0;j<m;j++)
{
cin>>a[i][j];
if(a[i][j]==0)
q=1;
}
for(i=0;i<n;i++)
{
if(a[i][0])
t=1;
else
t=0;
for(j=1;j<m;j++)
{
if(a[i][j]==0&&t==0)
{
f=1;
break;
}
else
if(a[i][j]==0)
t=0;
else
t=1;
}
}
for(i=0;i<m;i++)
{
if(a[0][i])
t=1;
else
t=0;
for(j=1;j<n;j++)
{
if(a[j][i]==0&&t==0)
{
f=1;
break;
}
else
if(a[j][i]==0)
t=0;
else
t=1;
}
}
if(f||q==0)
cout<<"No"<<endl;
else
cout<<"Yes"<<endl;
}
}
感受:
这么水的一个本来一次能过,但是没有注意输出的字母除第一个都是小写,没过。。。。。。最后才发现