#include <iostream>
using namespace std;
int main ()
{
int N , M;
bool flag;
while (cin>>N>>M)
{
if (N == 0 && M ==0) break;
char nn[N][M];
flag = false;
for (int i = 0; i < N; i++)
{
for (int j = 0; j < M; j++)
{
cin>>nn[i][j];
}
}
for (int i = 0; i < N; i++) //判断是否全为1,flag=true表示不全为0
{
for (int j = 0; j < M; j++)
{
if (nn[i][j] == '0')
{
flag = true;
break;
}
}
if (flag) break;
}
for (int i = 0; i < N && flag; i++)
{
for (int j = 0; j < M - 1; j++)
{
if (nn[i][j] == '0')
{
if (nn[i][j+1] == '0')
{
flag = false;
break;
}
}
}
}
for (int i = 0; i < N-1 && flag; i++)
{
for (int j = 0; j < N; j++)
{
if (nn[i][j] == '0')
{
if (nn[i+1][j] == '0')
{
flag = false;
break;
}
}
}
}
if (flag) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
return 0;
}
ZOJ Problem Set - 2850 Beautiful Meadow
最新推荐文章于 2018-08-20 20:02:12 发布