Codeforces Round #300-Cutting Banner(substr函数的应用)

Cutting Banner

Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status

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 outTEM), '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

Input

CODEWAITFORITFORCES

Output

YES

Input

BOTTOMCODER

Output

NO

Input

DECODEFORCES

Output

YES

Input

DOGEFORCES

Output

NO

注意有点坑，some subtring的subtring不带s，意思是某个子串，而不是一些子串。

#include <stdio.h>
#include <math.h>
#include <string.h>
#include <stdlib.h>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <set>
#include <queue>
#include <stack>
#include <map>
using namespace std;
typedef long long LL;
const int inf=0x3f3f3f3f;
const double pi= acos(-1.0);
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
string str,str1;
int main()
{
    int i,j;
        cin>>str;
        for(i=0; i<str.size(); i++) {
            for(j=i+1; j<=str.size(); j++) {
                str1=str.substr(0,i)+str.substr(j);
                if(str1=="CODEFORCES") {
                    printf("YES\n");
                    return 0;
                }
            }
        }
        printf("NO\n");
    return 0;
}