codeforces #300 A. Cutting Banner
来源:互联网 发布:狂发短信软件 编辑:程序博客网 时间:2024/05/17 02:16
题意:
给定一个字符串,找出能否找出【一个】【连续】的串,从串中删掉,然后剩下的串只剩下【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 stubtokenizer = 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;}
0 0
- codeforces #300 A. Cutting Banner
- codeforces A. Cutting Banner
- codeforces 538 A.Cutting Banner
- codeforces 538 A Cutting Banner
- contest: Codeforces Round #300, problem: (A) Cutting Banner
- contest: Codeforces Round #300, problem: (A) Cutting Banner
- 第一次打CODEFORCES-----A. Cutting Banner
- #300 (div.1 2) A. Cutting Banner
- 538A - Cutting Banner
- A. Cutting Banner
- Codeforces Round #300-Cutting Banner(substr函数的应用)
- codeforces----193A Cutting Figure
- CodeForces 193A Cutting Figure
- Codeforces 193A. Cutting Figure
- CF 538A(Cutting Banner-暴力找切割点)
- Code Forces 538 A. Cutting Banner(水~)
- A538: Cutting Banner
- [CF538A]Cutting Banner
- MVC入门经典——深入理解原理
- DNS基础知识
- C++实验6—字符串操作
- Python学习笔记(二)在线用pip下载第三方包
- leetcode---3Sum
- codeforces #300 A. Cutting Banner
- Linux学习笔记一(Linux常用命令1)
- 动态规划算法介绍:
- HDU-1116-Play on Words
- H.265优化问题
- HDU 2089 数位dp水题 统计区间中不包含62 和 4 的个数
- jQery命名空间
- Spark中组件Mllib的学习27之逻辑回归-多元逻辑回归,较大数据集,带预测准确度计算
- 230. Kth Smallest Element in a BST