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 }

 

转载于:https://www.cnblogs.com/acgoto/p/9105368.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值