CodeForces 96A Football

95 阅读 0 评论 63 点赞

我是靠谱客的博主明理水壶，最近开发中收集的这篇文章主要介绍CodeForces 96A 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

Output

NO

Input

1000000001

Output

YES

题意：如果0或1连续出现的次数大于等于7输出NO，否则输出YES

字符串处理问题很简单；

#include<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;
int main()
{
	char str[11000];
	int i,j,k,l,m,n;
	while(scanf("%s",str)!=EOF)
	{
		int ans=1;
		int len=strlen(str);
		m=str[0]-'0';
		for(i=1;i<len;i++)
		{
			if(str[i]-'0'==m)
			ans++;
			else
			{
				m=str[i]-'0';
				ans=1;
			}
			if(ans>=7)
			{
				printf("YESn");
				break;
			}
		}
		if(ans<7)
		printf("NOn");
	}
	return 0;
}