Football

J - Football

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

题意：

输入一串数字，如果其中1或0连续出现7次或7次以上，则输出YES，否则输出NO。

此题用字符串数组比较简单，题解如下

#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;char a[1010];int main(){while(scanf("%s",a)!=EOF)   {int len=strlen(a);char x=a[0];int ant=1;for(int i=1;i<len;i++)  {  if(x==a[i])  {    ant++;  if(ant>=7)  {  printf("YES\n");  break;      }}    else    {    x=a[i];    ant=1;}  }  if(ant<7)  printf("NO\n");   }}