zoj 2850 Beautiful Meadow
2014-06-07 19:25
267 查看
时间复杂度最好情况和最坏情况一样,都必须接收所有数组元素。。刚开始判断“非”给break了,结果。。。看了好久才看出来
#include <iostream>
using namespace std;
bool arr[10][10];
int main()
{
int n,m;
while(cin>>n>>m&&n!=0)
{
bool flag=true;
int sum=0;
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
cin>>arr[i][j];
sum+=arr[i][j];
if((arr[i][j]==0&&j>0&&arr[i][j-1]==0)||(i>0&&arr[i-1][j]==0&&arr[i][j]==0))
{
flag=false;
}
}
}
if(flag&&sum!=m*n)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
}
return 0;
}
#include <iostream>
using namespace std;
bool arr[10][10];
int main()
{
int n,m;
while(cin>>n>>m&&n!=0)
{
bool flag=true;
int sum=0;
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
cin>>arr[i][j];
sum+=arr[i][j];
if((arr[i][j]==0&&j>0&&arr[i][j-1]==0)||(i>0&&arr[i-1][j]==0&&arr[i][j]==0))
{
flag=false;
}
}
}
if(flag&&sum!=m*n)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
}
return 0;
}
相关文章推荐
- ZOJ - 2850
- zoj 2850 Beautiful Meadow 水题
- zoj 2850 Beautiful Meadow
- ZOJ 2850 Beautiful Meadow
- ZOJ 2850 Beautiful Meadow
- zoj 2850 Beautiful Meadow(水~)
- ZOJ-2850
- [水] zoj 2850 Beautiful Meadow
- zoj 2850 Beautiful Meadow
- ZOJ 2850 Beautiful Meadow
- ZOJ 2850 Beautiful Meadow
- ZOJ 2850和ZOJ 1414
- ZOJ Problem Set - 2850 Beautiful Meadow
- ZOJ 2850和ZOJ 1414
- zoj 2850 Beautiful Meadow
- zoj 2850
- ZOJ Problem Set - 2850 Beautiful Meadow
- zoj-【2850 】
- ZOJ 2850 Beautidul Meadow(水题)
- ZOJ 2850 Beautiful Meadow