A.Football

最新推荐文章于 2024-11-01 21:21:02 发布

aisliveF

最新推荐文章于 2024-11-01 21:21:02 发布

阅读量307

点赞数 1

分类专栏：练习文章标签： c++

本文链接：https://blog.csdn.net/weixin_46006714/article/details/120718403

版权

该博客讲述了如何判断一场足球比赛中是否存在危险局势。如果场上连续出现7个或以上同一队伍的球员，情况被视为危险。通过输入字符串中的0和1来表示两队球员，题目要求判断这个字符串是否包含至少7个连续的0或1。示例代码给出了判断方法。

摘要由CSDN通过智能技术生成

A. Football
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
Petya loves football very much. One day, as he was watching a football match, he was writing the players’ current positions on a piece of paper. To simplify the situation he depicted it as a string consisting of zeroes and ones. A zero corresponds to players of one team; a one corresponds to players of another team. If there are at least 7 players of some team standing one after another, then the situation is considered dangerous. For example, the situation 00100110111111101 is dangerous and 11110111011101 is not. You are given the current situation. Determine whether it is dangerous or not.

Input
The first input line contains a non-empty string consisting of characters “0” and “1”, which represents players. The length of the string does not exceed 100 characters. There’s at least one player from each team present on the fi