codeforces #300 A. Cutting Banner

题意：

给定一个字符串，找出能否找出【一个】【连续】的串，从串中删掉，然后剩下的串只剩下【CODEFORCES】。 是则输出YES，否则输出NO

思路：

穷举删除的区间，查看剩下的串是否是【CODEFORCES】即可。

我穷举的区间是[i,j) 区间（注意开闭符号）， 对 【CODEFORCESXXXXXXX】这样的串先判定一下即可。

蓝桥杯要开始了，刷一波JAVA

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;


public class Main {
	static String input;
	static InputReader reader = new InputReader();
	
	public static void main(String args[])	throws IOException
	{
		input = reader.nextString();
		if (doit())
			System.out.print("YES\n");
		else System.out.print("NO\n");
	}
	
	public static boolean doit()
	{
		int len = input.length();
		String aim = new String("CODEFORCES");
		int len2 = aim.length();
		
		
		String tmp = new String("");
		if (len >= len2)
		{
			tmp = input.substring(0, len2);
			if (tmp.equals(aim))	return true;
		}
		
		
		
		for (int i = 0; i != len; ++ i)
			for (int j = i + 1; j != len; ++ j)
			{
				//String tmp = new String("");
			//	System.out.print(i+" "+j+"\n");
				tmp = input.substring(0, i);
				tmp = tmp.concat(input.substring(j));
				//if (i==1 && j == 12)	System.out.println(tmp);
				if (tmp.equals(aim))	return true;
			}
		return false;
		
	}
	
}

class InputReader
{
	public InputReader() {
		// TODO Auto-generated constructor stub
		tokenizer = new StringTokenizer("");
		reader = new BufferedReader(new InputStreamReader(System.in));
	}
	
	public String nextTokenizer()	throws IOException
	{
		while (!tokenizer.hasMoreTokens())
		{
			tokenizer = new StringTokenizer(reader.readLine());
		}
		return tokenizer.nextToken();
	}
	
	public int nextInt()	throws IOException
	{
		return Integer.valueOf(nextTokenizer());
	}
	
	public String nextString()	throws IOException
	{
		return nextTokenizer();
	}
	
	private StringTokenizer tokenizer;
	private BufferedReader reader;

}