CodeForces 96AFootball

248 阅读 0 评论 164 点赞

我是靠谱客的博主英俊乌龟，这篇文章主要介绍CodeForces 96AFootball，现在分享给大家，希望可以做个参考。

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

Output

NO

Input

1000000001

Output

YES

代码：

#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
int main()
{
	char a[101];
	int k;
	while(scanf("%s",a)!=EOF)
	{
		k=strlen(a);
		int sum=1;
		for(int i=0;i<k-1;i++)
		{
			if(a[i]==a[i+1])
			sum++;
			else
			{
				sum=1;
			}
			if(sum==7)
			{
				printf("YESn");
				break;
			}
		}
		if(sum!=7)
		printf("NOn");
		memset(a,0,sizeof(a));
	 } 
	return 0;
}

思路：

判断连续共有多少个，大于等于七就输出yes，否则输出no。水题