《ACM程序设计》书中题目W
来源:互联网 发布:java中的访问修饰符 编辑:程序博客网 时间:2024/06/02 04:17
Description
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
Not all squares are covered with grass.
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?
Input
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
Output
One line for each test case.
Output “Yes” (without quotations) if the meadow is beautiful, otherwise “No”(without quotations).
Sample Input
2 2
1 0
0 1
2 2
1 1
0 0
2 3
1 1 1
1 1 1
0 0
Sample Output
Yes
No
No
统计0的个数以及搜索是否存在纵向和横向两个方向之一存在连续0的情况,用二位map进行搜索。
代码如下:
#include<bits/stdc++.h>using namespace std;const int MAX = 12;int main(){ int map[MAX][MAX]; int i,j,n,m,flag1,flag2; while(scanf("%d%d",&n,&m)!=EOF) { if(n==0||m==0) { break; } for(i=0;i<MAX;++i) { for(j=0;j<MAX;++j) { map[i][j]=1; } } flag1=0; flag2=1; for(i=1;i<=n;++i) { for(j=1;j<=m;++j) { scanf("%d",&map[i][j]); if(map[i][j] == 0) { flag1=1; } } } for(i=1;i<=n&&flag2;++i) { for(j=1;j<=m&&flag2;++j) { if((map[i-1][j]==0||map[i+1][j]==0||map[i][j+1]==0||map[i][j-1]==0)&&map[i][j]==0) { flag2=0; } } } if(flag1&&flag2) { printf("Yes\n"); } else { printf("No\n"); } } return 0;}
- 《acm程序设计》书中题目W-23
- 《ACM程序设计》书中题目--problem w
- 《ACM程序设计》书中题目 W
- 《ACM程序设计》书中题目 W
- 《ACM程序设计》书中题目 W
- 《ACM程序设计》书中题目W
- ACM程序设计书中题目--W(草地问题)
- 《ACM书中题目》 W
- ACM程序设计书上题目W
- 《ACM程序设计》书中题目W 第二十三题 漂亮的草坪
- 《ACM程序设计》书中题目W(让草坪变美丽吧,Tom!)
- acm书中题目 w-23
- 《ACM程序设计》书中题目
- 《ACM程序设计》书中题目--problem j
- 《ACM程序设计》书中题目 J
- 《ACM程序设计》书中题目O-15
- 《ACM程序设计》书中题目M-13
- 《ACM程序设计》书中题目--problem o
- 算法分析与设计第五周习题:95. Unique Binary Search Trees II
- python tile函数
- C语言实现TCP服务器---模型(二)
- hdu 2612 Find a way
- 最长上升子序列(LIS) -最长公共子序列(LCS)
- 《ACM程序设计》书中题目W
- 怎么在Linux下启动mysql
- L题
- win7 64+python2.7.12安装numpy+scipy+matplotlib+scikit-learn
- 超全的机器学习、深度学习视频课程和讲义的百度网盘下载
- SVN项目资源库目录更换
- (转)为什么Dialog不能用Application的Context
- 计算机网络复习笔记
- PE文件详解(七)