A8243 | Football
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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 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".
输入输出样例
输入 #1
001001
输出 #1
NO
输入 #2
1000000001
输出 #2
YES
暂无题解
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted