小明有一块矩形草坪,为了使其更加美观,将其分成M行N列
在这个M*N的草坪中选取其中一些快,将草剪掉,如果有相邻(上下左右都算相邻)的两块都被剪掉,则认为草坪不漂亮,如果整块草坪都没剪掉,则认为草坪不漂亮;其余情况认为草坪修剪的漂亮
程序判断修剪后的草坪是否漂亮:
/*
2014-11-17 16:37 shihz
*/
#include<iostream>
using std::cin;
using std::cout;
int main()
{
int M, N, i, j, flag = 1, cont = 0;
cout << "Please input the scale of the Meadow\n";
cin >> M >> N;
cout << "\n";
int s[100][100];
for (i = 0; i <= M + 1; i++)
{
for (j = 0; j <= N + 1; j++)
{
s[i][j] = 9;
}
}
for (i = 1; i <= M; i++)
{
for (j = 1; j <= N; j++)
{
cin >> s[i][j];
}
}
for (i = 1; i <= M; i++)
{
for (j = 1; j <= N; j++)
{
if (s[i][j] == 0)
{
if (s[i + 1][j] * s[i - 1][j] * s[i][j + 1] * s[i][j - 1] == 0)
flag = 0;
break;
}
else cont++;
}
if (flag == 0)
break;
}
if (cont == N*M)
flag = 0;
if (flag == 0)
cout <<"The Meadow is\t"<< "NO\n";
else cout << "The Meadow is\t" << "YES\n";
return 0;
}
例如 输入 2 3 1 0 1 0 1 0.则输出为 YES
输入 2 2 1 1 0 0,则输出NO