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