C - Football

Posted 霜雪千年

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了C - Football相关的知识,希望对你有一定的参考价值。

Problem 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 100characters. There‘s at least one player from each team present on the field.

Output

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

Examples

Input
001001
Output
NO
Input
1000000001
Output
YES
解题思路:题目很简单(水),简单处理字符串,如果有连续相同的数字不小于7个,则输出"YES",否则输出"NO"。
AC代码:
 1 #include <bits/stdc++.h>
 2 using namespace std;
 3 int main()
 4 {
 5     char a[105];int cnt=0,i=0;bool flag=false;
 6     cin>>a;
 7     while(a[i]!=\0){
 8         if(a[i]==1){while(a[i]==1){cnt++;i++;}}
 9         else{while(a[i]==0){cnt++;i++;}}
10         if(cnt>=7){flag=true;break;}
11         cnt=0;
12     }
13     if(flag)cout<<"YES"<<endl;
14     else cout<<"NO"<<endl;
15     return 0;
16 }

 

以上是关于C - Football的主要内容,如果未能解决你的问题,请参考以下文章

CF 1244 C - The Football Season

Codeforces Round #592 (Div. 2) C - The Football Season(推公式)

POJ 3071 Football

Codeforces 1244C The Football Season (解方程)

大连网络赛 1006 Football Games

POJ 3071 Football (概率DP)