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: Accepted

Solution code:
S = raw_input()
count = 0
for s in S:
    if s == 'C' and count == 0:
        count += 1
    elif s == 'F' and count == 1:
        count += 1
        break

if count == 2:
    print 'Yes'
else:
    print 'No'

Submission status: Accepted

Solution code:
S = input()

c=False
f=False
ans=0
for s in S:
    if not c and s=="C":
        c=True
    if c and s=="F":
        f=True

if s and f:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:

s = input()

ans_i = 0
ans_j = 0

for s_i in s:
    if s_i == 'C':
        ans_i = 1

    if ans_i == 1 and s_i == 'F':
        ans_j = 1

if ans_i and ans_j:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import re

S = input()

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
s=raw_input()

c_index=s.find('C')
if c_index == -1:
    print "No"
    exit()

f_index=s.find('F', c_index)
if f_index == -1:
    print "No"
    exit()
print "Yes"

Submission status: Accepted

Solution code:
s = raw_input()
flag = 0
for i in s:
    if flag == 0 and i == 'C': flag = 1
    elif flag == 1 and i == 'F': flag = 2
    else: continue
print 'Yes' if flag == 2 else 'No'

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding:utf-8 -*-

from __future__ import division, print_function, absolute_import, unicode_literals
import sys

s = input()


start = s.find('C')
if start == -1:
    print("No")
    sys.exit()
start = s.find('F', start)
if start == -1:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
s = raw_input()

flag = 0
flag2 = 0

for i in s:
    if i == "C":
        flag += 1
    if flag > 0 and i == "F":
        flag2 += 1

if flag2 > 0:
    print "Yes"

else:
    print "No"

Submission status: Accepted

Solution code:
import sys
s=raw_input()
flag=False
for j in range(len(s)):
    if s[j]=='C':
        flag=True
    if s[j]=='F' and flag:
        print "Yes"
        sys.exit()
print "No"

Submission status: Accepted

Solution code:
import sys

if __name__ == '__main__':
    str = input()
    flg = 0
    for c in str:
        if c == 'C' or flg == 1:
            flg = 1
            if c == 'F':
                print('Yes')
                sys.exit(0)
    print("No")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3


def judge(s):
    rest = "".join(filter(lambda c: c in "CF", s))
    return "CF" in rest


def main():
    if judge(input()):
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = input()

if "C" in N and "F" in N:
    c = N.find("C")
    f = N.rfind("F")
    if c < f:
        print("Yes")
    else:
        print("No")
else:
    print("No")

Submission status: Accepted

Solution code:
s = raw_input()

try:
    c = s.index("C")
    f = len(s) - s[::-1].index("F") - 1
    if c < f:
        print "Yes"
    else:
        print "No"
except:
    print "No"

Submission status: Accepted

Solution code:
def read_input():
    return input()

def checker(inp_str):
    flag = 0
    for i in list(inp_str):
        if flag == 0:
            if i == "C":
                flag = 1
        if flag == 1:
            if i == "F":
                flag = 2

    if flag == 2:
        print("Yes")
    else:
        print("No")

if __name__ == "__main__":
    checker(read_input())

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys

def s():
    return raw_input().strip()
def n():
    return int(raw_input())
def d():
    return float(raw_input())

def ls():
    return raw_input().strip().split()
def ln():
    return map(int, raw_input().strip().split())
def ld():
    return map(float, raw_input().strip().split())

def fs():
    return [raw_input().strip() for i in xrange(input())]
def fn():
    return [int(raw_input().strip()) for i in xrange(input())]
def fd():
    return [float(raw_input().strip()) for i in xrange(input())]

S = s()

a = S.find('C')
b = S.find('F', a)

if a == -1 or b == -1:
    print 'No'
else:
    print 'Yes'

Submission status: Accepted

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

Submission status: Accepted

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

main()

Submission status: Accepted

Solution code:
s=raw_input()
ls = list(s)
cflag=False
ansflag=False
for i in ls:
    if i=="C":
        cflag=True
    if i=="F" and cflag:
        ansflag=True
if ansflag:
    print "Yes"
else:
    print "No"

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = raw_input()
c_flag = False
f_flag = False

for c in S:
    if c == 'C':
        c_flag = True
    elif c == 'F' and c_flag:
        f_flag = True
        break

if f_flag:
    print 'Yes'
else:
    print 'No'

Submission status: Accepted

Solution code:
s = raw_input()
flg1 = False
flg2 = False
for c in s:
    if not flg1:
        if c=="C":
            flg1 = True
    elif not flg2:
        if c=="F":
            flg2 = True

if flg2:
    print "Yes"
else:
    print "No"

Submission status: Accepted

Solution code:
c = 0
f = 0
for i in input():
    if i == 'C' : c = 1
    if c and i == 'F':
        f = 1
        break
print( 'Yes' if c + f > 1 else 'No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = raw_input()
flag1, flag2 = False, False
for ch in s:
    if not flag1:
        if ch == 'C':
            flag1 = True
    else:
        if ch == 'F':
            flag2 = True
            break
if flag1 and flag2:
    print 'Yes'
else:
    print 'No'

Submission status: Accepted

Solution code:
S = input()
if "C" in S and "F" in S:
    C_ind = S.index("C")
    S_inv = S[::-1]
    S_ind = S_inv.find("F")
    S_ind = len(S) - S_ind - 1
    if C_ind < S_ind:
        print("Yes")
    else:
        print("No")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import re

s = input()

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

Submission status: Accepted

Solution code:
import re
s = raw_input()
if re.match('.*C.*F.*', s):
    print 'Yes'
else:
    print 'No'

Submission status: Accepted

Solution code:
s = input()
k1 = len(s) - 1
k2 = 0
for i in range(len(s)):
    if s[i] == 'C' and i < k1:
        k1 = i
    if s[i] == 'F':
        k2 = i
if k2 - k1 > 0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a = raw_input()
ans = False
flag = False
for c in a:
    if c == "F" and flag:
        ans = True
    if c == "C":
        flag = True
print "Yes" if ans else "No"

Submission status: Accepted

Solution code:
S = raw_input()
flag = False
for s in S:
    if s == 'C':
        flag = True
    if s == 'F' and flag:
        print 'Yes'
        break
else:
    print 'No'

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
s = input()

f = False
ans = "No"
for c in s:
    if c=="C":
        f = True
    elif f and c=="F":
        ans = "Yes"
        break

print(ans)

Submission status: Accepted

Solution code:
#import string,itertools,fractions,heapq,re,array,bisect
#from math import *
#from collections import Counter
def rl(s): return xrange(len(s))


INF = 2147483647


import sys
stdin = sys.stdin

s =        ( stdin.readline().strip() )

c = s.find('C')
if -1 != c:
    f = s[c:].find('F')
    if f != -1:
        print "Yes"
        s = None

if s is not None:
    print "No"

Submission status: Accepted

Solution code:
s = raw_input()
f1 = False
f2 = False
for i in s:
    if i == "C":
        f1 = True
    if f1:
        if i == "F":
            f2 = True
if f1 and f2:
    print "Yes"
else:
    print "No"

Submission status: Accepted

Solution code:
s = input()

c_exists = False
f_exists = False
for c in s:
    if c == 'C' and not c_exists:
        c_exists = True
    if c_exists and c == 'F' and not f_exists:
        f_exists = True

if c_exists and f_exists:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time

sys.setrecursionlimit(10**7)
inf = 10**10
mod = 10**9 + 7


def f():
    s = input()
    if re.match(r'.*C.*F.*', s):
        return 'Yes'
    return 'No'

print(f())

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

import re
s = input()
t = []
for ch in s:
    if ch == 'C' or ch == 'F':
        t.append(ch)
t = "".join(t)
if "CF" in t:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import sys
a = raw_input()

c = False

for i in a:
    if(i=='C'):
        c = True
    if(c and i=='F'):
        print 'Yes'
        sys.exit()

print 'No'

Submission status: Accepted

Solution code:
import re
if re.search('C.*F', raw_input()):
    print 'Yes'
else:
    print 'No'

Submission status: Accepted

Solution code:
s = raw_input()
a = s.find('C')
if a != -1:
    b = s.find('F', a + 1)
    if b != -1:
        print "Yes"
    else:
        print "No"
else:
    print "No"

Submission status: Accepted

Solution code:
S = input()
c, f = S.find("C"), S.rfind("F")
print("Yes" if c != -1 and f != -1 and c < f else "No")

Submission status: Accepted

Solution code:
import re
print('Yes' if re.search('C.*F', input()) else 'No')

Submission status: Accepted

Solution code:
# def makelist(n, m):
# 	return [[0 for i in range(m)] for j in range(n)]

# n = int(input())
# a, b = map(int, input().split())
# s = input()

ans = 0
s = input()
for c in s:
	if ans == 0:
		if c == 'C':
			ans += 1
	else:
		if c == 'F':
			ans += 1
			break

if ans == 2:
	print("Yes")
else:
	print("No")

Submission status: Accepted

Solution code:
s = raw_input()
t = False
for i in s:
    if i == "C":
        t = True
    if i == "F" and t:
        print "Yes"
        exit()

print "No"

Submission status: Accepted

Solution code:
S = raw_input()
c = 0
f = 0
for s in S:
    if s == "C":
        c = 1
    if s == "F" and c:
        f = 1
print "Yes" if f else "No"

Submission status: Accepted

Solution code:
S = input()

NEED = "CF"
for c in S:
    if len(NEED) > 0 and NEED[0] == c:
        NEED = NEED[1:]

if NEED == "":
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys,copy,math,heapq,itertools as it,fractions,re,bisect,collections as coll

s = raw_input()
c, f = 1e10, -1
for i, si in enumerate(s):
    if si == "C":
        c = min(c, i)
    if si == "F":
        f = max(f, i)
print "Yes" if c < f else "No"

Submission status: Accepted

Solution code:
#!/usr/bin/env python

s = raw_input()
if s.find('C') == -1:
    print 'No'
else:
    if s[s.find('C'):].find('F') == -1:
        print 'No'
    else:
        print 'Yes'

Submission status: Accepted

Solution code:
s = input()
i = ['C','F']
ind = 0
for c in s:
    if i[ind] == c:
        ind += 1
    if ind == 2:
        break
print("Yes") if ind == 2 else print("No")

Submission status: Accepted

Solution code:
import re

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

Submission status: Runtime Error

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:
    s.remove(s[s.index('F')])
    if s.index('C')<s.index('F'):
      print('Yes')
    else:
      print('No')
else:
  print('No')
  exit()

Submission status: Runtime Error

Solution code:
import collections


def main():
    s = list(input())
    if s.count("C") == 0 or s.count("F") == 0:
        print("No")
        return

    if s.index("C") == len(s) - 1:
        print("No")
        return

    print("Yes" if s.index("C") < s.index("F", s.index("C")) else "No")


if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
s=input()

A=s.index('C')
for i in range(A,len(s)):
    if s[i]=='F':
        print('Yes')
        break
else:
    print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

main()

Submission status: Runtime Error

Solution code:
s = list(input())
rs = sorted(s, reverse=True)
x = s.index('C')
y = rs.index('F')
z = len(s)
if x < z-y:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
s = list(input())

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def resolve():
    S = input()
    i = S.index("C")
    s = S[i+1:]
    if "C" in S and "F" in s:
        print("Yes")
    else:
        print("No")
resolve()

Submission status: Runtime Error

Solution code:
import math
import string
import collections
from collections import Counter
from collections import deque
from decimal import Decimal
import sys
import fractions


def readints():
    return list(map(int, input().split()))


def nCr(n, r):
    return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


# coordinates
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]
s = input()
for i in range(len(s)):
    if s[i] == 'C':
        # print(i)
        tmp = i
# print(s[1:])
ss = s[(tmp+1):]
# print(ss)
for i in range(len(ss)):
    if ss[i] == 'F':
        print('Yes')
        exit()
print('No')

Submission status: Runtime Error

Solution code:
k, _, *a = map(int, open(0).read().split())
print(max(a)*2 - k - 1)

Submission status: Runtime Error

Solution code:
s=input()

ans="No"
for i in range(len(s)):
  if s[i]=="C":
    for j in range(i+1,len(s)):
      if s[j]="F":
        print("Yes")
        exit()
else:
  print(ans)

Submission status: Runtime Error

Solution code:
import sys


def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]


s = S()
ans = ''
if 'C' in s:
    ans += 'C'
if 'F' in s[s.index('C'):]:
    ans += 'F'
if ans == 'CF':
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
s = input()
n = len(s)

f = 0
for i in range(s):
    if s[i] == 'C' and f == 0:
        f += 1
    if s[i] == 'F' and f == 1:
        print("Yes")
        exit()
print("No")

Submission status: Runtime Error

Solution code:
s = input()
n = len(s)

f = 0
for i in range(s):
    if s[i] == 'C' and f = 0:
        f += 1
    if s[i] == 'F' and f = 1:
        print("Yes")
        exit()
print("No")

Submission status: Runtime Error

Solution code:
val = input()
for i in range(len(val)):
  if val[i] == "C":
  	for n range(i+1, len(val)):
      if val[n] == "F":
      	print("Yes")
      else:
        print("No")
  else:
    print("No")

Submission status: Runtime Error

Solution code:
s = list(input())
for i in range(len(s)):
    if s[i] == "C":
        c = True
    elif c and s[i] == "F":
        print("Yes")
        exit()
print("No")

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;
int main() {
  string S;
  cin >> S;
  int cnt = 0;
  for (int i = 0; i < S.size(); i++) {
    if (cnt == 0 && S.at(i) == 'C') {
      cnt++;
    }
    if (cnt == 1 && S.at(i) == 'F') {
      cnt++;
    }
  }
  if (cnt == 2) {
    cout << "Yes" << '\n';
  } else {
    cout << "No" << '\n';
  }
}

Submission status: Runtime Error

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] |= s[i] == "C"
        ans[1] |= s[i] == "F" and ans[1]
    print("Yes" if ans[1] else "No")
    return


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

Submission status: Runtime Error

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: Runtime Error

Solution code:
S = input()

c = []
f = []

for i, si in enumerate(S):
    if si == 'C':
        c.append(i)
    elif si == 'F':
        f.append(i)

if min(c) < max(f):
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

S = int(input())

a = 0

for i in S:
  if a == 0 and i == "C":
    a += 1
  if a == 1 and i == "F":
    a += 1
    
if a == 2:
  print ("Yes")
else:
  print ("No")

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

Solution code:
s = input()
flag = True
if 'C' not in s or 'F' not in s:
  flag = False

print('Yes' if s.index('C') < s.rindex('F') and flag == True else 'No')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
if 'CF' in input():
  print('Yes')
else:
  print('No)

Submission status: Runtime Error

Solution code:
from submissions.parsers import PBInfoParser as PBI

def test_pbinfo():
	pbi = PBI.PBInfoParser()
	l = pbi.parse('andrei_boaca', 0)
	# self.assertNotEqual(len(l), 0)
	print(l)


test_pbinfo()

# Create your tests here.

Submission status: Runtime Error

Solution code:
def main():
    s = list(input())
    for i in range(len(s)):
        if s[i]=="C":
            idx = i
            break

    for j in range(idx,len(s)):
        if s[j]=="F":
            print("Yes")
            exit()

    print("No")

if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
def main():
    s = input()
    for i in range(len(s)):
        if s[i]=="C":
            idx = i
            break

    for j in range(idx,len(s)):
        if s[j]=="F":
            print("Yes")
            exit()

    print("No")

if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
def main():
    s = input()
    for i in range(len(s)):
        if s[i]=="C":
            idx = i
            break

    for i in range(idx,len(s)):
        if s[i]=="F":
            print("Yes")
            exit()

    print("No")

if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
def main():
    s = input()
    for i in range(len(s)):
        if s[i]=="C":
            idx = i
            break

    for i in range(idx+1,len(s)):
        if s[i]=="F":
            print("Yes")
            exit()

    print("No")

if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
s=input()
if "F" in s[s.index("C"):]:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
s=input()
t = 1000
u = 1000
for i in range(n):
  if s[i] == "C":
    t = i
    break
for i in range(n-1,-1,-1):
  if s[i] == "F":
    u = i
    break
if max(t,u) != 1000 and t<u:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
s=input()
t,u = 1000
for i in range(n):
  if s[i] == "C":
    t = i
    break
for i in range(n-1,-1,-1):
  if s[i] == "F":
    u = i
    break
if max(t,u) != 1000 and t<u:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
s=str(input())
count=0
for i in range(len(s)):
  if count==0 and s[i]==C:
    count+=1
  elif count==1 and s[i]==F:
    count+=1
    print('Yes');exit()
    
print('No')

Submission status: Runtime Error

Solution code:
s=input()

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

Submission status: Runtime Error

Solution code:
s = input()
c = len(s)
f = 0
for i in s:
  if i == "C":
    c = min(c,i)
  elif i == "F":
    f = max(f,i)
if c < f:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
#include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
using namespace std;
using pii  = pair<int,int>;
using ll=long long;
using ld=long double;
#define pb push_back
#define mp make_pair
#define sc second
#define fr first
#define stpr setprecision
#define cYES cout<<"YES"<<endl
#define cNO cout<<"NO"<<endl
#define cYes cout<<"Yes"<<endl
#define cNo cout<<"No"<<endl
#define rep(i,n) for(ll i=0;i<(n);++i)
#define Rep(i,a,b) for(ll i=(a);i<(b);++i)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define rRep(i,a,b) for(int i=a;i>=b;i--)
#define crep(i) for(char i='a';i<='z';++i)
#define psortsecond(A,N) sort(A,A+N,[](const pii &a, const pii &b){return a.second<b.second;});
#define ALL(x) (x).begin(),(x).end()
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define endl '\n'
int ctoi(const char c){
  if('0' <= c && c <= '9') return (c-'0');
  return -1;
}
ll gcd(ll a,ll b){return (b == 0 ? a : gcd(b, a%b));}
ll lcm(ll a,ll b){return a*b/gcd(a,b);}
constexpr ll MOD=1000000007;
constexpr ll INF=1000000011;
constexpr ll MOD2=998244353;
constexpr ll LINF = 1001002003004005006ll;
constexpr ld EPS=10e-8;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> istream& operator>>(istream& is,vector<T>& v){for(auto&& x:v)is >> x;return is;}
template<typename T,typename U> istream& operator>>(istream& is, pair<T,U>& p){ is >> p.first; is >> p.second; return is;}
template<typename T,typename U> ostream& operator>>(ostream& os, const pair<T,U>& p){ os << p.first << ' ' << p.second; return os;}
template<class T> ostream& operator<<(ostream& os, vector<T>& v){
    for(auto i=begin(v); i != end(v); ++i){
        if(i !=begin(v)) os << ' ';
        os << *i;
    }
    return os;
}

ll ans,M[100007];

ll compME(ll b, ll e, ll m){  // bのe乗のmod m を返す
    if (e == 0) return 1;
    ans = compME(b, e / 2, m);
    ans = (ans * ans) % m;
    if (e % 2 == 1) ans = (ans * b) % m;
    return ans;
}

int main(){
    string S;
    cin >> S;
    ll C=0;
    rep(i,S.size()){
        if(S[i]=='C' && C==0){
            C=1;
        }
        if(S[i]=='F' && C== 1){
            C=2;
        }
    }
    if(C==2){
        cYes;
    }
    else{
        cNo;
    }
}

Submission status: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

Solution code:
K,T=map(int,input().split())
A=list(map(int,input().split()))
M=max(A)
print(max(M-1-(K-M),0))

Submission status: Runtime Error

Solution code:
s = input()
x = s.index('C')
y = s.rindex('F')
if x >= 0 and y >= 0 and x < y:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
S=input()
N=len(S)

if "C" in S and "F" in S:
  print("No")
else:
  c=S.index("C")
  S=S[::-1]
  f=N-S.index("F")-1
  #print(c,f)
  print("Yes" if c<f else "No")

Submission status: Runtime Error

Solution code:
S=input()
N=len(S)

c=S.index("C")
S=S[::-1]
f=N-S.index("F")-1
#print(c,f)

print("Yes" if c<f else "No")

Submission status: Runtime Error

Solution code:
S=input()
N=len(S)

c=S.index("C")
S=S[::-1]
f=N-S.index("F")-1
#print(c,f)

print("Yes" if c<f else "No")

Submission status: Runtime Error

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: Runtime Error

Solution code:
#include<bits/stdc++.h>
using namespace std;

int main(){
	
	string a;
	cin>>a;
	int la = a.length();
	bool c=false,f=false;
	for(int i=0;i<la;i++){
		if(a[i] == 'C')c = true;
		if(a[i]=='F' && c)f=true; 
	}
	if(c&&f)cout<<"Yes";
	else cout<<"No";
	
}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = input()

c = int(s.index('C'))
f = max(int(s.index('F')), int(s.rindex('F')))

if c <= f:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
N=input()
c=0
flag = 0
for i in N:
    if i=='C' and  c==0 :c+=1
    if i=='F' and c==1: flag=1
if flag==:print("Yes")
else :print("No")

Submission status: Runtime Error

Solution code:
N=input()
c=0
flag = 0
for i in N:
    if i=='C' and  c==0 :c+=1
    if i=='F' and c==1: flag=1
if flag:print("Yes")
else flag:print("No")

Submission status: Runtime Error

Solution code:
import re

s = input()

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

Submission status: Runtime Error

Solution code:
import re


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

Submission status: Runtime Error

Solution code:
if re.match(r'C.*F', s):
    print(YES)
else:
    print(NO)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include<iostream>
#include<cstdio>
#include<string>
using namespace std;
string s;
int l;
int main()
{
    cin>>s;
    l=s.size();
    for(register int i=0;i<l;i++)
    {
        if(s[i]=='C')
        {
            for(register int j=i+1;j<l;j++)
            {
                if(s[j]=='F')
                {
                    cout<<"Yes";
                    return 0;
                }
            }
        }
    }
    cout<<"No";
    return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = input()
ans = 'No'
c = s.find('C')
if c != -1:
	f = s[c:].find('F')
    if f != -1:
      ans = 'Yes'
print(ans)

Submission status: Runtime Error

Solution code:
s = input()
ans = 'No'
c = s.find('C')
if c != -1:
	f = s.find('F', c)
    if f != -1:
      ans = 'Yes'
print(ans)

Submission status: Runtime Error

Solution code:
n = input().split()

for i in range(len(n)):
    if n[i] == 'C':
        cflag = 1
    elif cflag == 1 and n[i] == 'F':
        print('Yes')
        exit()

print('No')

Submission status: Runtime Error

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