16A - Flag

最新推荐文章于 2021-09-20 17:14:09 发布

@java小白

最新推荐文章于 2021-09-20 17:14:09 发布

阅读量277

点赞数

CC 4.0 BY-SA版权

分类专栏： cf水题

本文链接：https://blog.youkuaiyun.com/weixin_43866567/article/details/88944288

cf水题专栏收录该内容

27 篇文章

订阅专栏

本文解析了CodeForces平台上的题目16A，该题要求判断一个棋盘式的旗帜是否符合新的ISO标准：每行颜色相同且相邻行颜色不同。文章提供了完整的AC代码实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

cf题目地址：https://codeforces.com/problemset/problem/16/A

According to a new ISO standard, a flag of every country should have a chequered field n × m, each square should be of one of 10 colours, and the flag should be «striped»: each horizontal row of the flag should contain squares of the same colour, and the colours of adjacent horizontal rows should be different. Berland’s government asked you to find out whether their flag meets the new ISO standard.

Input
The first line of the input contains numbers n and m (1 ≤ n, m ≤ 100), n — the amount of rows, m — the amount of columns on the flag of Berland. Then there follows the description of the flag: each of the following n lines contain m characters. Each character is a digit between 0 and 9, and stands for the colour of the corresponding square.

Output
Output YES, if the flag meets the new ISO standard, and NO otherwise.

在这里插入图片描述

题意：每行数字一样，相邻行不一样，则输出YES。

AC代码：

#include<iostream>
#include<cstring>
#include<cmath>

using namespace std;

int main()
{
	int n, m;
	char a[101][101], temp;
	int i, j, ans = 0;
	cin >> n >> m;
	for (i = 0; i < n; i++)
		for (j = 0; j < m; j++)
			cin >> a[i][j];
	for (i = 0; i < n; i++) {
		for (j = 0; j < m; j++) {
			temp = a[i][0];
			if (temp != a[i][j] || a[i][0] == a[i + 1][0]) {
				ans = 1; break;
			}
		}
		if (ans == 1)
			break;
	}
	if (ans == 1)
		cout << "NO" << endl;
	else
		cout << "YES" << endl;
	//system("pause");
	return 0;
}