﻿ Ningbo University of Technology Online Judge :: [1005] 足球赛
• ### [1005] 足球赛

• 时间限制: 1000 ms　内存限制: 65535 K
• 问题描述
• 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.

• 输入
• The first input is an integer N, represents the number of cases.
Then there are N cases:
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.
• 输出
• Print "YES" if the situation is dangerous. Otherwise, print "NO".
• 样例输入
• ```2
001001
1000000001
```
• 样例输出
• ```NO
YES
```
• 提示
• `无`
• 来源
• `CodeForces`
• 操作
﻿