首页 > Codeforces Round #300 A. Cutting Banner 水题

Codeforces Round #300 A. Cutting Banner 水题

A. Cutting Banner

Time Limit: 1 Sec Memory Limit: 256 MB

题目连接

http://codeforces.com/contest/538/problem/A

Description

A large banner with word CODEFORCES was ordered for the 1000-th onsite round of Codeforces^ω that takes place on the Miami beach. Unfortunately, the company that made the banner mixed up two orders and delivered somebody else's banner that contains someone else's word. The word on the banner consists only of upper-case English letters.

There is very little time to correct the mistake. All that we can manage to do is to cut out some substring from the banner, i.e. several consecutive letters. After that all the resulting parts of the banner will be glued into a single piece (if the beginning or the end of the original banner was cut out, only one part remains); it is not allowed change the relative order of parts of the banner (i.e. after a substring is cut, several first and last letters are left, it is allowed only to glue the last letters to the right of the first letters). Thus, for example, for example, you can cut a substring out from string 'TEMPLATE' and get string 'TEMPLE' (if you cut out string AT), 'PLATE' (if you cut out TEM), 'T' (if you cut out EMPLATE), etc.

Help the organizers of the round determine whether it is possible to cut out of the banner some substring in such a way that the remaining parts formed word CODEFORCES.

Input

The single line of the input contains the word written on the banner. The word only consists of upper-case English letters. The word is non-empty and its length doesn't exceed 100 characters. It is guaranteed that the word isn't word CODEFORCES.

Output

Print 'YES', if there exists a way to cut out the substring, and 'NO' otherwise (without the quotes).

Sample Input

CODEWAITFORITFORCES

Sample Output

YES

HINT

题意

给你一个字符串，然后让你删除一段字符，看是否能构成CODEFORCES

题解：

啊，枚举区间就好了……

代码：

//qscqesze
#include 
#include 
#include 
#include 
#include 
#include 
#include <set>
#include 
#include 
#include 
#include 
#include 
#include 
#include 
typedef long long ll;
using namespace std;
//freopen("D.in","r",stdin);
//freopen("D.out","w",stdout);
#define sspeed ios_base::sync_with_stdio(0);cin.tie(0)
#define maxn 200001
#define mod 10007
#define eps 1e-9
int Num;
char CH[20];
//const int inf=0x7fffffff;   //нчоч╢С
const int inf=0x3f3f3f3f;
/*inline void P(int x)
{Num=0;if(!x){putchar('0');puts("");return;}while(x>0)CH[++Num]=x%10,x/=10;while(Num)putchar(CH[Num--]+48);puts("");
}
*/
inline ll read()
{int x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){ if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}return x*f;
}
inline void P(int x)
{Num=0;if(!x){putchar('0');puts("");return;}while(x>0)CH[++Num]=x%10,x/=10;while(Num)putchar(CH[Num--]+48);puts("");
}
//**************************************************************************************string s;
int a[maxn];
string kiss="CODEFORCES";
int main()
{cin>>s;for(int i=0;i){for(int j=i+1;j<=s.size();j++){string p=s.substr(0,i)+s.substr(j);//cout<if(p=="CODEFORCES"){cout<<"YES"<<endl;return 0;}}}cout<<"NO"<<endl;
}

转载于:https://www.cnblogs.com/qscqesze/p/4458882.html

Codeforces Round #300 A. Cutting Banner 水题

A. Cutting Banner

题目连接

Description

Input

Output

Sample Input

Sample Output

HINT

更多相关：

grpc 传递上下文_grpc 源码笔记 02：ClientConn

Tensorflow C++ API调用Keras模型实现RGB图像语义分割

Path Tracing

configure_file路径疑惑

自定义国内maven镜像包设置settings.xml