Submission #942304

---

Source Code Expand

#include <iostream> 
#include <string> 
#include <vector> 
#include <cmath> 
#include <algorithm> 
#include <cstdlib> 
#include <ctime> 
#include <cstdio> 
#include <functional> 
#include <set> 
#include <sstream> 
#include <cctype>
#include <stack>
#include <queue>
#include <cstring>
#include <map>
#include <list>
#include <cassert>
 
using namespace std; 

const long long INF=1LL<<50LL;
const double PI=3.14159265358979323846264;
const long long mod=1000000000LL+7LL;

long long gcd(long long x,long long y){
	return y==0 ? x : gcd(y,x%y);
}

int main(){

	string s;
	cin>>s;

	int x=0,y=0;
	for(int i=0;i<s.size();i++){
		if(s[i]=='C'){x=i;break;}
	}

	for(int i=s.size()-1;i>=0;i--){
		if(s[i]=='F'){x=i;break;}
	}

	if(x<y) cout<<"Yes"<<endl;
	else cout<<"No"<<endl;

}

Submission Info

Judge Result