football <水题>

J - Football

Crawling in process... Crawling failed Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit Status

Description

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

Output

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

Sample Input

Input

001001

Output

NO

Input

1000000001

Output

YES

题意  俩个足球队的队员站在一排  分别用0和1表示  每个队不能有连续7个或者以上的人站在一起

思路  用字符串输入  计算长度l，用两个for循环从第一个人开始搜索，如果某个人的下一位是队友，令j+1，j和i为球员位置，j-i+1为同一队人站在一起的人数，一次循环之后比较，留下最大的值   最后与7比较  如果>7，输出"YES"否则输出"NO“

#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<cstring>
using namespace std;
int main()
{
	char s[101];
	int j,l,ll=0;
	scanf("%s",s);
	l=strlen(s);
    for(int i=0;i<l;i++)
	   {
	   	for(j=i;j<l&&s[j+1]==s[j];j++);
	   		if(j-i+1>ll)	ll = j-i+1;
	   }
	   if(ll>=7)
	printf("YES\n");
	else
	printf("NO\n");
	return 0;
}