首页 > 其他 > 详细

ZOJ 2850: Beautiful Meadow

时间:2017-07-28 00:12:58      阅读:333      评论:0      收藏:0      [点我收藏+]

ZOJ - 2850

///@author Sycamore, ZJNU
///@accepted_on 2017-01-19
#include<iostream>
using namespace std;
bool bl[10][10];
int main()
{
    short M, N;
    while (cin >> M >> N&&M&&N)
    {
        bool b1=true,b2 = false;
        for (int i = 0; i<M; i++)
            for (int j = 0; j < N; j++)
            {
                cin >> bl[i][j];
                if ((i&&bl[i][j] == 0 && bl[i - 1][j] == 0 )|| (j&&bl[i][j] == 0 && bl[i][j - 1] == 0))
                {
                    b1 = false;
                }
                if (b1&&!bl[i][j])
                {
                    b2 = true;
                    
                }
            }
    
        cout << (b1&&b2 ? "Yes" : "No" )<< endl;
    }
    return 0;
}
#include<iostream>
using namespace std;
bool bl[10][10];
int main()
{
    short M, N;
    while (cin >> M >> N&&M&&N)
    {
        bool b1 = true, b2 = false;
        for (int i = 0; i<M; i++)
            for (int j = 0; j < N; j++)
            {
                cin >> bl[i][j];
                if ((i&&bl[i][j] == 0 && bl[i - 1][j] == 0) || (j&&bl[i][j] == 0 && bl[i][j - 1] == 0))
                {
                    b1 = false;
                }
                if (b1 && !bl[i][j])
                {
                    b2 = true;

                }
            }

        cout << (b1&&b2 ? "Yes" : "No") << endl;
    }
    return 0;
}

 

ZOJ 2850: Beautiful Meadow

原文:http://www.cnblogs.com/zjnu/p/7248024.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!