Problem:


Score : 100 points

Problem Statement

This contest is CODEFESTIVAL, which can be shortened to the string CF by deleting some characters.  

Mr. Takahashi, full of curiosity, wondered if he could obtain CF from other strings in the same way.  

You are given a string s consisting of uppercase English letters.
Determine whether the string CF can be obtained from the string s by deleting some characters.

Constraints

2 ≤ |s| ≤ 100

All characters in s are uppercase English letters (A-Z).

Input

The input is given from Standard Input in the following format:

s

Output

Print Yes if the string CF can be obtained from the string s by deleting some characters.
Otherwise print No.

Sample Input 1

CODEFESTIVAL

Sample Output 1

Yes

CF is obtained by deleting characters other than the first character C and the fifth character F.

Sample Input 2

FESTIVALCODE

Sample Output 2

No

FC can be obtained but CF cannot be obtained because you cannot change the order of the characters.

Sample Input 3

CF

Sample Output 3

Yes

It is also possible not to delete any characters.

Sample Input 4

FCF

Sample Output 4

Yes

CF is obtained by deleting the first character.



Sample input:
CODEFESTIVAL


Sample output:
Yes

Submission status: Wrong Answer

Solution code:
s = input()
if s.count("C")>=1 and s.count("F")>=1:
    if s.index("C")<s.index("F"):
        print("Yes")
    else:
        print("No")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s = input()
if s.count("C")>=1 and s.count("F"):
    if s.index("C")<s.index("F"):
        print("Yes")
    else:
        print("No")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s=set(input())
print("Yes" if "C"in s and "F" in s else "No")

Submission status: Wrong Answer

Solution code:
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    S = input()

    if "C" in S and "F" in S:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
s=list(map(str,input()))
if 'C' in s and 'F' in s:
  if s.index('C')<s.index('F'):
    print('Yes')
  else:
    print('No')
else:
  print('No')
  exit()

Submission status: Wrong Answer

Solution code:
S = input()
a = len(S)
b = -1
for i in range(len(S)):
    if S[i] == "C":
        a = i
        break
for i in range(len(S)):
    if S[len(S)-i-1] == "F":
        b = i
        break
if a < b:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
S = input()
if "C" in S and "F" in S:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
n = input()
if "C" in n and "F" in n:
  if n.index("C") < n.index("F"):
    print("Yes")
  else:
    print("No")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
n = input()
if "C" in n and "F" in n:
  if n.index("C") < n.index("F"):
    print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
s = input()

if "C" in s and "F" in s:
    if s.index("C") < s.index("F"): 
        print("Yes")
    else:
        print("No")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
S = input()

if 'CF' in S:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
s = input()

if 'CF' in s:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
s = input()
c = s.find('C')
f = s.find('F')
print('Yes') if c >= 0 and f >= 0 and (c - f) < 0 else print('No')

Submission status: Wrong Answer

Solution code:
s =  list(input())
if ("C" in s and "F" in s):
    if(s.index("C") < s.index("F")):
       print("Yes")
    else:
       print("No")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
S=input()

nc=0
nf=0
for i in range(len(S)):
    if S[i]=='C':
        nc=i
        break
for i in range(len(S)):
    if S[i]=='F':
        nf=i

print('Yes' if nc < nf else 'No')

Submission status: Wrong Answer

Solution code:
s = input()
if -1 < s.find("C") < s.find("F"):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s = input()
if 0 <= s.find("C") < s.find("F"):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s = input()
if s.find("C") < s.rfind("F"):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s = input()
if s.find("C") < s.find("F"):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s = input()
flag = 0
for i in range(len(s)):
    if s[i] == "C":
        flag += 1
    if flag == 1 and s[i] == "F":
        flag += 1
if flag == 2:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
def main():
    s=input()
    s2=s[::-1]
    a=s.find('C')
    a2=len(s)-s2.find('F')-1
    if(a==-1 or a2==-1):
        print('No')
    elif(a<a2):
        print('Yes')
    else:
        print('No')

main()

Submission status: Wrong Answer

Solution code:
def main():
    s=input()
    s2=s[::-1]
    a=s.find('C')
    a2=len(s)-s2.find('F')-1
    if(a<a2):
        print('Yes')
    else:
        print('No')

main()

Submission status: Wrong Answer

Solution code:
s = input()

c_idx = len(s)
f_idx = -1
for i in range(len(s)):
    if s[i] == 'C':
        c_idx = min(c_idx, i)
    if s[i] == 'F':
        f_idx = max(c_idx, i)
print('Yes' if c_idx < f_idx else 'No')

Submission status: Wrong Answer

Solution code:
s = input()
a = s.find("C")
b = s.rfind("F")

if 0 < a < b:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s = input()
a = s.find("C")
b = s.rfind("F")

if a < b:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
S = input()
if S.count("C") > 0 and S.count("F") > 0:
  if S.index("C") < S.index("F"):
    print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
S = input()
if S.count("C") > 0 and S.count("F") > 0:
  if S.index("C") < S.index("C"):
    print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
S = input()
if S.count("C") > 0 and S.count("F") > 0:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
import re
S = input()
print('NO' if re.search(r'C.*F', S) is None else 'YES')

Submission status: Wrong Answer

Solution code:
S = input()

alp = "ABDEGHIJKLMNOPQRSTUVWXYZ"
for a in alp:
    S = S.replace(a, '')
if 'CF' in S:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
s = input()

if 'C' in s and 'F' in s:
    if s.index('C') < s.index('F'):
        print('Yes')
        exit()
print('No')

Submission status: Wrong Answer

Solution code:
s=input()
flag=False
for i in range(len(s)):
  if s[i]=="C":
    flag=True
  if s[i]=="F" and flag:
    print("Yes")
    break
if not flag:
  print("No")

Submission status: Wrong Answer

Solution code:
s=input();
print("Yes" if "C" in s and "F" in s and s.index("C")<s.index("F") else "No")

Submission status: Wrong Answer

Solution code:
s=input()
c=0
f=0
for i in range(len(s)):
    if s[i]=="C":
        c=min(c,i)
    elif s[i]=="F":
        f=max(f,i)

if s.count("C")>=1 and s.count("F")>=1 and f-c>0:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s=input()
c=0
f=0
if s.count("C")>=1 and s.count("F")>=1:
    for i in range(len(s)):
        if s[i]=="C":
            c=min(c,i)
        elif s[i]=="F":
            f=max(f,i)

    if f-c>0:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
S = input()
if "C" in S and "F" in S:
  if S.index("C")<[i for i, x in enumerate(S) if x == "F"][-1]:
    print("Yes")
print("No")

Submission status: Wrong Answer

Solution code:
S = input()
if "C" in S and "F" in S:
  if S.index("C")<S.index("F"):
    print("Yes")
print("No")

Submission status: Wrong Answer

Solution code:
s = list(input())

for i in range(len(s)):
    if s[i] == 'C':
        for i in range(len(s)):
            if s[i] == 'F':
                print('Yes')
                exit(0)

print('No')

Submission status: Wrong Answer

Solution code:
s = list(input())

for i in range(len(s)):
    if s[i] == 'C':
        for i in range(len(s)):
            if s[i] == 'F':
                print('Yes')

print('No')

Submission status: Wrong Answer

Solution code:
s=input()
print("Yes" if s.find("C")<=0<s.rfind("F") else "No")

Submission status: Wrong Answer

Solution code:
s=input()
print("Yes" if s.find("C")<s.rfind("F") else "No")

Submission status: Wrong Answer

Solution code:
s=input()
c=0
f=0
for i in range(len(s)):
    if s[i]=="C":
        if c==0:
            c=i+1
    if s[i]=="F":
        f=i+1
if c<f:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s = list(input())

if 'C' in s and 'F' in s and s.index('C') < s.index('F'):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import sys
s = list(input())
a = []

for i in range(len(s)):
    if s[i] == 'C':
        a.append(0)
    elif s[i] == 'F':
        a.append(1)

for j in range(len(a)-1):
    if a[j] < a[j+1]:
        print('Yes')
        sys.exit()
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
s = list(input())
if 'C' and 'F' in s:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    s=input()
    if 'C' in s:
        if 'F' in s[s.index('C'):]:
            print('Yes')
        else:
            print('No')
resolve()

Submission status: Wrong Answer

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    s=input()
    if 'C' in s:
        if 'F' in s[s.index('C')+1:]:
            print('Yes')
        else:
            print('No')
resolve()

Submission status: Wrong Answer

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    s=input()
    if 'C' in s:
        x=s.index('C')
        if 'F' in s[x+1:]:
            print('Yes')
        else:
            print('No')
resolve()

Submission status: Wrong Answer

Solution code:
s = input()
sc = ''
c = 0

for i in range(len(s)):
  if 'C' == s[i]:
    sc = s[i+1:]
    for j in range(len(sc)):
      if 'F' == sc[j]:
        c += 1

if c >= 0:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
def main():
  ans = 'No'
  s = input()
  if 'F' in s or 'C' in s:
    ans = 'Yes'
  print(ans)

if __name__ == '__main__':
  main()

Submission status: Wrong Answer

Solution code:
import re

p = re.compile('C.*F')
s = input()
m = re.match(p, s)
print('Yes' if m is not None else 'No')

Submission status: Wrong Answer

Solution code:
# coding: utf-8
import re
import math
import itertools
from copy import deepcopy
import fractions
import random
from heapq import heappop,heappush
import time
import os
import queue
import sys
import datetime
from functools import lru_cache
readline=sys.stdin.readline
sys.setrecursionlimit(2000)
#import numpy as np
alphabet="abcdefghijklmnopqrstuvwxyz"
mod=int(10**9+7)
inf=int(10**20)
def yn(b):
    if b:
        print("yes")
    else:
        print("no")
def Yn(b):
    if b:
        print("Yes")
    else:
        print("No")
def YN(b):
    if b:
        print("YES")
    else:
        print("NO")
class union_find():
    def __init__(self,n):
        self.n=n
        self.P=[a for a in range(N)]
        self.rank=[0]*n
 
    def find(self,x):
        if(x!=self.P[x]):self.P[x]=self.find(self.P[x])
        return self.P[x]
 
    def same(self,x,y):
        return self.find(x)==self.find(y)
 
    def link(self,x,y):
        if self.rank[x]<self.rank[y]:
            self.P[x]=y
        elif self.rank[y]<self.rank[x]:
            self.P[y]=x
        else:
            self.P[x]=y
            self.rank[y]+=1
 
    def unite(self,x,y):
        self.link(self.find(x),self.find(y))
 
    def size(self):
        S=set()
        for a in range(self.n):
            S.add(self.find(a))
        return len(S)
def is_power(a,b):#aはbの累乗数か
    now=b
    while now<a:
        now*=b
    if now==a:return True
    else:return False
def bin_(num,size):
    A=[0]*size
    for a in range(size):
        if (num>>(size-a-1))&1==1:
            A[a]=1
        else:
            A[a]=0
    return A
def fac_list(n,mod_=0):
    A=[1]*(n+1)
    for a in range(2,len(A)):
        A[a]=A[a-1]*a
        if(mod>0):A[a]%=mod_
    return A
def comb(n,r,mod,fac):
    if(n-r<0):return 0
    return (fac[n]*pow(fac[n-r],mod-2,mod)*pow(fac[r],mod-2,mod))%mod
def next_comb(num,size):
    x=num&(-num)
    y=num+x
    z=num&(~y)
    z//=x
    z=z>>1
    num=(y|z)
    if(num>=(1<<size)):return False
    else:
        return num
def get_primes(n,type="int"):
    A=[True]*(n+1)
    A[0]=False
    A[1]=False
    for a in range(2,n+1):
        if A[a]:
            for b in range(a*2,n+1,a):
                A[b]=False
    if(type=="bool"):return A
    B=[]
    for a in range(n+1):
        if(A[a]):B.append(a)
    return B
def is_prime(num):
    if(num<=2):return False
    i=2
    while i*i<=num:
       if(num%i==0):return False
       i+=1
    return True
def ifelse(a,b,c):
    if a:return b
    else:return  c
def join(A,c=" "):
    n=len(A)
    A=list(map(str,A))
    s=""
    for a in range(n):
        s+=A[a]
        if(a<n-1):s+=c
    return s
def factorize(n,type_="dict"):
    b = 2
    list_ = []
    while b * b <= n:
        while n % b == 0:
            n //= b
            list_.append(b)
        b+=1
    if n > 1:list_.append(n)
    if type_=="dict":
        dic={}
        for a in list_:
            if a in dic:
                dic[a]+=1
            else:
                dic[a]=1
        return dic
    elif type_=="list":
        return list_
    else:
        return None
############################################
s=input()
if "C" in s and "F" in s:
    Yn(s.index("C")<s[::-1].index("F"))
else:
    print("No")

Submission status: Wrong Answer

Solution code:
a=input()
if "C" in a and "F" in a and a.index("C")>a.index("F"):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

def lcm(x, y):
    return (x * y) // math.gcd(x, y)

if __name__ == '__main__':
    s =input()


    if "C" in s and "F" in s and s.index("C") < s.index("F"):
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def S(): return input().rstrip()
def LS(): return S().split()
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = 1e10

#solve
def solve():
    s = S()
    ans = [0, 0]
    for i in s:
        ans[0] |= i == "C"
        ans[1] |= i == "F" and ans[1]
    print("Yes" if ans[1] else "No")
    return


#main
if __name__ == '__main__':
    solve()

Submission status: Wrong Answer

Solution code:
s = input()

t = 0
for i in range(len(s)):
    for j in range(i+1, len(s)):
        if s[i:].count("C") >= 1 and s[j:].count("F") >= 1:
            t = 1
            break
if t == 1:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
l = list(input())

if ("C" in l) & ("F" in l):
  if l.index("C") < l.index("F"):
  	print("Yes")
  else:
    print("No")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
l = list(input())

if ("C" in l) & ("F" in l):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
c  = 0
s = input()
for i,si in enumerate(s):
  if si == "C":
    c = 1
  elif si == "F":
    print("Yes")
    exit()
print("No")

Submission status: Wrong Answer

Solution code:
s = input()
c = False
f = False
for i in s:
    if (i=='C'):
        c = True
    if (i=='F'):
        f = True
if (c==True and f==True):
    print("Yes")
if (not(c==True and f==True)):
    print("No")

Submission status: Wrong Answer

Solution code:
import sys
S = input()

if S.count("C") != 0 and S.count("F") != 0:
    pass
else:
    print("No")
    sys.exit()

ans = 0
for i in range(len(S) -1 ):
    if S[i] == "C":
        ans = 1
    
    if ans == 1 and S[i] == "F":

        print("Yes")
        sys.exit()

print("No")

Submission status: Wrong Answer

Solution code:
import sys
S = input()

if S.count("C") != 0 and S.count("F") != 0:
    pass
else:
    print("No")
    sys.exit()

ans = 0
for i in range(len(S) -1 ):
    if S[i] == "C" and S[i+1] == "F":
        print("Yes")
        sys.exit()

print("No")

Submission status: Wrong Answer

Solution code:
import sys
S = input()

if S.count("C") != 0 and S.count("F") != 0:
    pass
else:
    print("No")
    sys.exit()

for i in S:
    if i == "C":
        print("Yes")
        sys.exit()
    elif i != "C" and i == "F" and S.count("F") == 1:
        print("No")
        sys.exit()

Submission status: Wrong Answer

Solution code:
S = input()
a,b= S.find('C'),S.find('F')
print('Yes') if a>=0 and b>=0 and a<b else print('No')

Submission status: Wrong Answer

Solution code:
S = input()
a,b= S.find('C'),S.find('F')
print(a,b)
print('Yes') if a>=0 and b>=0 and a<b else print('No')

Submission status: Wrong Answer

Solution code:
S = input()
a,b= S.find('C'),S.find('F')
print('Yes') if a>0 and b>0 and a<b else print('No')

Submission status: Wrong Answer

Solution code:
s = input()
if s.count('C') >= 1 and s.count('F') >= 1:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
s = input()
if s.find("C") and s.find("F") :
    print("Yes" if s.find("C") < s.rfind("F") else "No")
else :
    print("No")

Submission status: Wrong Answer

Solution code:
s = input()
if s.find("C") != -1 or s.find("F") != -1 :
    print("Yes" if s.find("C") < s.rfind("F") else "No")
else :
    print("No")

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
s = input()
if s.count("C") >= 1 and s.count("F") >= 1:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s = input()
ans = []

for i in range(len(s)):
  if len(ans) < 2 and (s[i] == 'C' or s[i] == 'F'):
    ans.append(s[i])

if len(ans) == 2 and ans[0] == 'C' and ans[1] == 'F':
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
s=input()
f=0
for i in range(len(s)):
    if s==0:
        if s[i]=='C':
            s=1
    else:
        if s[i]=='F':
            print('Yes')
            exit()
print('No')

Submission status: Wrong Answer

Solution code:
s=input()
if(s.find('C') < s.find('F')):
    print('Yes')
elif(s.find('C') < s.rfind('F')):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
s=input()
if(s.find('C') < s.find('F')):
    print('Yes')
elif('CF' in s):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
s=input()
if(s.find('C') < s.find('F')):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
s=input()
for i in range(len(s)):
    if(s[i] == 'C'):
        print('Yes' if 'F' in s[i:] else 'No')
    elif(i==len(s)):
        print('No')

Submission status: Wrong Answer

Solution code:
s=input();print('YNeos'[s[s.find('C'):].find('F')==-1::2])

Submission status: Wrong Answer

Solution code:
s=input()
if 'C' in s and 'F' in s:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
S = input()
if "C" in S and "F" in S:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
s=list(input())

if 'C' in s and 'F' in s:
    if s.index('C') < s.index('F'):
        print('Yes')
    else:
        print('No')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
S = input()
print('Yes' if S.find('C')<S.rfind('F') else 'No')

Submission status: Wrong Answer

Solution code:
s = input().strip()
if "C" in s:
    indc = s.index("C")
else:
    indc = 10**3
if "F" in s[indc:]:
    indf = indc+s.index("F")
else:
    indf = -1
if indc<indf:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s = input().strip()
if "C" in s:
    indc = s.index("C")
else:
    indc = 10**3
if "F" in s:
    indf = s.index("F")
else:
    indf = -1
if indc<indf:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s = input()
a = s.count('C')
b = s.count('F')

print('Yes' if a*b != 0 else 'No')

Submission status: Wrong Answer

Solution code:
s=input()
if s.find("C",0)<s.find("F",s.find("C",0)+1):print("Yes")
else:print("No")

Submission status: Wrong Answer

Solution code:
import sys
t = 0
s = list(input())
for i in range(len(s)):
    if s[i] == "C":
        t = i
        break
for i in range(t,len(s)):
    if s[i] == "F":
        print("Yes")
        sys.exit()
print("No")

Submission status: Wrong Answer

Solution code:
import sys
t = 0
s = list(input())
for i in range(len(s)):
    if s[i] == "C":
        t = i
        break
for i in range(i,len(s)):
    if s[i] == "F":
        print("Yes")
        sys.exit()
print("No")

Submission status: Wrong Answer

Solution code:
s = input()
C = s.find('C')
F = s.rfind('F')

if C < F:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
s=input()
c=f=0
for i in range(len(s)):
	if s[i]=="C":
		c=True
	if s[i]=="F":
		f=True
if c==f==True:
	print("Yes")
else:
	print("No")

Submission status: Wrong Answer

Solution code:
s=input()
t=0
for i in range(len(s)):
    if s[i]=='C':
        t=i
    if s[i]=='F' and i>t:
        print('Yes')
        exit()
print('No')

Submission status: Wrong Answer

Solution code:
n=list(input())
cindex=[i for i,j in enumerate(n) if j=="C"]
findex=[i for i,j in enumerate(n) if j=="F"]
if "C" in n and "F" in n:
    if min(cindex)<max(findex):
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
s = input()
if 0 < s.find("C") < (s.find("F") or s.find("F", 2)):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s = input()

if s.find("C") < (s.find("F") or s.find("F", 2)):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s = input()

if s.find("C") < s.find("F") or s.find("C") < s.find("F", 2) :
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
#CF
s = input()
n = len(s)
c = 0
f = 0
for i in range(n):
    if s[i] == 'C' and c == 0:
        c = i
    if s[i] == 'F':
        f = i
if c != 0 and f != 0 and c < f:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
#CF
s = input()
n = len(s)
c = 0
f = 0
for i in range(n):
    if s[n-i-1] == 'C':
        c = c + (n-i)
    if s[n-i-1] == 'F':
        f = f + (n-i)
if c != 0 and f != 0 and c < f:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s = list(input())

c = -1
f = -1

for i in range(len(s)):
    if s[i] == "C" and c == -1:
        c = i
    if s[i] == "F":
        f = i
        
if c < f and f != -1:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s=list(input())
ans=0
for i in range(len(s)):
  if ans==2:
    break
  elif s[i]=='C':
    ans+=1
  elif ans==1 and s[i]=='F':
      print('Yes')
      break
  if i==len(s)-1:
      print('No')
      break

Submission status: Wrong Answer

Solution code:
s=list(input())
ans=0
for i in range(len(s)):
  if ans==2:
    break
  if s[i]=='C':
    ans+=1
  if ans==1:
    if s[i]=='F':
      ans+=1
if ans==2:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
s = input()
cnt = 0
if 'C' and 'F' in s:
    for i in s:
        cnt += 1
        if i == 'C':
            for i in s[cnt:]:
                if i == 'F':
                    print('Yes')
                    break
                else:
                    print('No')
                    break
else:
    print('No')

Submission status: Wrong Answer

Solution code:
s = input()
if 'C' and 'F' in s:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
def main():
  s=input()
  x = s.find("C")
  y = s.find("F")
  if x<0 or y<0:
    print("No")
    return 0
  while x<len(s):
    if s[x]=="F":
      print("Yes")
      return 0
    x+=1

    
main()

Submission status: Wrong Answer

Solution code:
def main():
  s=input()
  x = s.find("C")
  y = s.find("F")
  if x<0 or y<0:
    print("No")
    return 0
  while x<len(s):
    if s[x]=="F":
      print("YES")
      return 0
    x+=1

    
main()

Submission status: Wrong Answer

Solution code:
s = input()
c = False
f = False
for i in s:
    if i == 'c':
        c = True
    if c == True and i == 'f':
        f = True

if c & f:
    print("Yes")
else :
    print("No")

Submission status: Wrong Answer

Solution code:
s=str(input())
n=s.find('C');m=s.rfind('F')
if n<m:print('Yes')
else:print('No')

Submission status: Wrong Answer

Solution code:
s = input()
if s[s.find('C'):].count('F') > 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
s=list(input())
c=len(s)+10
n=len(s)
f=len(s)
for i in range(len(s)):
    if s[n-1-i]=='F':
        f=n-1-i
        break
for i in range(n):
    if s[i]=="C":
        c=i
        break
if c<f:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
s = input()
c_ind = -1
for i in range(len(s)):
    if s[i] == "C":
        c_ind = i
        break
f_ind = -1
for i in range(len(s)):
    if s[i] == "F":
        f_ind = i

if c_ind != -1 and f_ind != -1:
    if c_ind < f_ind:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
from sys import stdin

def readString() :
    return  stdin.readline().rstrip()

def solve() :
    S = readString()
    pos = S.find('C')
    pos = S[pos:].find('F')
    if(pos !=-1):
        print("Yes")
    else :
        print("No")

solve()

Submission status: Wrong Answer

Solution code:
S = input()
for i,c in enumerate(S):
    if c=='C': break
print('Yes' if 'F' in S[i:] else 'o')

Submission status: Wrong Answer

Solution code:
s=list(input())
n=len(s)
ans="No"
for i in range(n):
    if(s[i]=="C"):
        for j in range(n-i-1):
            if(s[i+j+1]):
                ans="Yes"
print(ans)

Submission status: Wrong Answer

Solution code:
s = input()
i = 0
for i in range(len(s)):
  if s[i] == "C":
    if "F" in s[i:]:
      print("Yes")
    else:
      print("No")

Submission status: Wrong Answer

Solution code:
s = input()
n = 0
m = 0
for i in range(0, len(s)):
    if s[i] == 'C':
        n = 1
        break
for j in range (0, len(s)):
    if s[j] == 'F':
        m = 1
        break
if n == 1 and m == 1 and i < j:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
# luogu-judger-enable-o2
a = input()
if a.find("C")!=-1 and a.find("F")!=-1 and a.find("C")<a.find("F"):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
a = input()
if a.find('C')<a.rfind("F"):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
a = input()
if a.find('C')<a.find("F"):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
S = input()
f = 0
for s in S:
  if f==0:
    if s=="C":
      f = 1
  elif f==1:
    if s=="C":
      f = 2
if f == 2:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
# code-festival-2016-qualc
def main():
    S = input()
    flg = S.find("C") < S.rfind("F")
    print("Yes" if flg else "No")


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
a = input()
if a.find("C")!=-1 and a.find("F")!=-1 and a.find("C")<a.find("F"):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
a = input()
if a.find("C")!=-1 and a.find("F")!=-1:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s = input()

if -1 < s.find("F", s.find("C")):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s = input()

cf = s.find('C')
ff = s.find('F')

if cf >= 0 and ff > cf:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import re
print("YNEOS"[not re.match('.*C.*F',input())::2])

Submission status: Wrong Answer

Solution code:
s = input()
print('Yes' if s.rfind('F') > s.find('C') else 'No')

Submission status: Wrong Answer

Solution code:
# 正規表現を利用する。

import re
if re.match("[A-Z]*?C[A-Z]*?F[A-Z]*?", input()):
	print("YES")
else:
	print("NO")

Submission status: Wrong Answer

Solution code:
s=input()
ans="No"
try:
  c=s.index("C")
  f=s.index("F")
  if c<f:
    ans="Yes"
except:
  pass
print(ans)

Submission status: Wrong Answer

Solution code:
s = input()
if 0 <= s.find("C") < s.find("F"):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
import re

s = input()

if re.match(r'C.*F', s):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
A=list(input())
for i in range(len(A)):
  if A[i]=="C":
    if "I" in A[i+1:]:
      print("Yes")
      exit()
print("No")

Submission status: Wrong Answer

Solution code:
a1 = input().split()
n = 0
a = [a1[i] for i in range(len(a1))]
for i in range(len(a)):
    if a[i] == 'C':
        n = 1
    if n == 1 and a[i] == 'F':
        n = 2
if n == 2:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
S = input()

c, f = False, False
for s in S:
	if s == "F":
		c = True
	if s == "F" and c:
		f = True
print(["Yes", "No"][not(all([c, f]))])

Submission status: Wrong Answer

Solution code:
import re
s = input()
print('Yes' if re.search('CF', s) else 'No')

Submission status: Wrong Answer

Solution code:
s = input()
print("Yes" if 0 <= s.find("C") < s.find("F")  else "No")

Submission status: Wrong Answer

Solution code:
s=input()
for i in range(len(s)):
    for j in range(len(s)):
        if s[j]=="F":
            break
    if s[i]=="C":
        print("Yes" if i<j else "No")
        break

Submission status: Wrong Answer

Solution code:
s=input()
for i in range(len(s)):
    for j in range(len(s)):
        if s[j]=="F":
            break
    if s[i]=="C":
        print("Yes" if i<j else "No")

Submission status: Wrong Answer

Solution code:
s = input()
c = s.find('C')
f = s.find('F')
if c < f and c >= 0 and f >= 0:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
s = input()
c = s.find('C')
f = s.find('F')
if c < f and not(c < 0 or f < 0):
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
import sys
s = input()

for i, c in enumerate(s):
  if c == 'C':
    for j in s[i:]:
      if j=='F':
      	print('Yes')
      	sys.exit()
  print('No')
  sys.exit()