这篇博客讨论了Petya如何分析足球比赛中的球员位置，判断是否出现连续7个以上同队球员的危险情况。此外，还提到了Petya对幸运和超级幸运数字的定义，并给出寻找不低于给定数的最小超级幸运数的方法。最后，文章介绍了Petya在冰球比赛中改换球队名称的挑战，如何处理禁止的子串并最大化特定字母的出现次数。
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.
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 field.
Print "YES" if the situation is dangerous. Otherwise, print "NO".
水题，判断有没有连续的7个或7个以上的0或1即可。
最低0.47元/天 解锁文章
712
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
