Codeforces Round #300(Div. 2)-538A.str.substr 538B.不会 538C.不会 。。。

 

A. Cutting Banner

 

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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).

Examples

Input

CODEWAITFORITFORCES

Output

YES

Input

BOTTOMCODER

Output

NO

Input

DECODEFORCES

Output

YES

Input

DOGEFORCES

Output

NO

题意就是条幅打错字母了，让你随便剪一次，剪去多余的字母，问你剩下的能否接成CODEFORCES的字样，要注意的是接的时候不可以改变顺序，只能剪一次！！！wa在没看清题意是剪一次。。。

一个很6的函数，直接就可以了。。。

substr函数用法举例:

substr('ABCDEFG', 0);     //返回：ABCDEFG，截取所有字符
substr('ABCDEFG', 2);     //返回：CDEFG，截取从C开始之后所有字符
substr('ABCDEFG', 0, 3); //返回：ABC，截取从A开始3个字符
substr('ABCDEFG', 0, 100); //返回：ABCDEFG，100虽然超出预处理的字符串最长度，但不会影响返回结果，系统按预处理字符串最大数量返回。
substr('ABCDEFG', -3); //返回：EFG，注意参数-3，为负值时表示从尾部开始算起，字符串排列位置不变

代码:

#include<bits/stdc++.h>
using namespace std;
int main(){
    string str,str1;
    int i,j;
    cin>>str;
    for(i=;i<str.size();i++){
        for(j=i+;j<=str.size();j++){
            str1=str.substr(,i)+str.substr(j);
            if(str1=="CODEFORCES"){
                printf("YES\n");
                return ;
            }
        }
    }
    printf("NO\n");
    return ;
}