若是凉夜已成梦

青春里 总有些事情要努力去做 总有些梦想要拼命去追。


  • 运维

  • 前端

  • 编程

  • 随笔

  • hust-oj

1631: Beautiful Meadow

发表于 2017-10-06   |   分类于 HUSTOJ   |   阅读次数 1,172

题目描述

Tom's Meadow

Tom has a meadow in his garden. He divides it into N * M squares. Initially all the squares were covered with grass. He mowed down the grass on some of the squares and thinks the meadow is beautiful if and only if

1. Not all squares are covered with grass.
2. No two mowed squares are adjacent.

Two squares are adjacent if they share an edge. Here comes the problem: Is Tom's meadow beautiful now?

输入

The input contains multiple test cases!

Each test case starts with a line containing two integers N, M (1 <= N, M <= 10) separated by a space. There follows the description of Tom's Meadow. There're N lines each consisting of M integers separated by a space. 0(zero) means the corresponding position of the meadow is mowed and 1(one) means the square is covered by grass.

A line with N = 0 and M = 0 signals the end of the input, which should not be processed

输出

One line for each test case.

Output "Yes" (without quotations) if the meadow is beautiful, otherwise "No"(without quotations).

样例输入

2 2
1 0
0 1
2 2
1 1
0 0
2 3
1 1 1
1 1 1
0 0

样例输出

Yes
No
No

参考代码

#include <stdio.h>  
int main(int argc, char *argv[]) 
{
    int s[100][100];
    int M,N,i,j,t=0;
    scanf ("%d %d",&M,&N);
    while (M&&N) 
    {
        for (i=0;i<=M+1;i++) 
        {
            for (j=0;j<=N+1;j++) 
            {
                s[i][j]=8;
            }
        }
        for (i=1;i<=M;i++) 
        {
            for (j=1;j<=N;j++) 
            {
                scanf ("%d",&s[i][j]);
            }
        }
        for (i=1;i<=M;i++) 
        {
            for (j=1;j<=N;j++) 
            {
                if (s[i][j]==1) t++;
                if (s[i][j]==0&&(s[i][j]==s[i][j+1]||s[i][j]==s[i+1][j]||s[i][j]==s[i-1][j]||s[i][j]==s[i][j-1]))  
                                    break;
            }
            if (j<=N) break;
        }
        if (i==M+1&&j==N+1&&M*N!=t) printf ("Yesn");  
        else printf ("Non");  
        scanf ("%d %d",&M,&N);  
        t=0;  
    }  
}

解析

暂无

hustoj

发表评论 取消回复

邮箱地址不会被公开。 必填项已用*标注

*
*


hoxis wechat
著作权归作者所有
站点更新说明
  • 文章目录
  • 站点概览
若是凉夜已成梦

若是凉夜已成梦

青春里 总有些事情要努力去做 总有些梦想要拼命去追。

1904 日志
6 分类
12 标签
RSS
weibo github twitter facebook

友情链接

Skip Dreams孤独患者 原站点
© 2017 若是凉夜已成梦
Powered by WordPress | 已运行
Theme By NexT.Mist