Football

Football

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

题意：判断有无连续7或7个以上的0或1，若有输出“YES”，没有输出“NO”。

思路：判断有无连续7或7个以上的0或1。

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
using namespace std;

int main(){
char a[110];
int len;
int l;
while(scanf("%s",a)!=EOF){

l=1;
len=strlen(a);
for (int i=0;i<len;i++){

if (a[i]==a[i+1])
l++;
if(l>=7)
{printf("YES\n");break;
}
if (a[i]!=a[i+1])
l=1;
}
if (l<7)
printf("NO\n");
}
return 0;
}