CodeForces-96A-Football

最新推荐文章于 2024-04-19 22:10:11 发布

原创最新推荐文章于 2024-04-19 22:10:11 发布 · 551 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#codeforces #java #string

本文介绍了一个简单的程序，用于判断足球比赛中是否存在至少7名连续站在同一位置的球员，这种情况被视为危险。程序通过检查输入字符串中是否存在连续的'0000000'或'1111111'来实现这一目标。

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 and11110111011101 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 test(s)

input
001001

output
NO

input
1000000001

output
YES

import java.util.*;
public class Football {
	public static void main(String[]args){
		Scanner inScanner=new Scanner(System.in);
		String s=inScanner.next();
		if(s.contains("0000000")||s.contains("1111111"))
			System.out.println("YES");
		else
			System.out.println("NO");
		
	}
}

改进：单独的if与else运算可以采用三目运算符进行