Codeforces Beta Round #77 (Div. 2 Only) A. Football【字符串/判断是否存在连续7个0或7个1】...

最新推荐文章于 2022-12-16 16:19:21 发布

weixin_30608503

最新推荐文章于 2022-12-16 16:19:21 发布

阅读量73

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/Roni-i/p/7989699.html

本文介绍了一个简单的程序，用于判断足球比赛中的一种特定危险局势。该程序通过读取一串由0和1组成的字符串来模拟球员的位置，如果同一队伍连续7名球员站在了一起，则认为局势危险。文章提供了完整的C++实现代码。

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 and11110111011101 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 field.

Output

Print "YES" if the situation is dangerous. Otherwise, print "NO".

Examples

input

output

NO

input

1000000001

output

YES

【代码】：

#include <bits/stdc++.h>

using namespace std;
int cnt=1;
int main ()
{
    string a;
    cin>>a;
    for(int i=0;i<a.size();i++)
    {
        if(a.find("0000000")!= a.npos||a.find("1111111")!= a.npos)
        {
            puts("YES");
            return 0;
        }
    }
    puts("NO");
    return 0;
}

转载于:https://www.cnblogs.com/Roni-i/p/7989699.html