s_id stringlengths 10 10 | p_id stringlengths 6 6 | u_id stringlengths 10 10 | date stringlengths 10 10 | language stringclasses 1
value | original_language stringclasses 11
values | filename_ext stringclasses 1
value | status stringclasses 1
value | cpu_time stringlengths 1 5 | memory stringlengths 1 7 | code_size stringlengths 1 6 | code stringlengths 1 539k |
|---|---|---|---|---|---|---|---|---|---|---|---|
s454935116 | p03957 | u560708725 | 1596832706 | Python | Python (3.8.2) | py | Runtime Error | 29 | 8732 | 161 | 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") |
s126612773 | p03957 | u763410402 | 1595801011 | Python | Python (3.8.2) | py | Runtime Error | 20 | 8908 | 213 | 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()
|
s832011123 | p03957 | u217303170 | 1594204284 | Python | Python (3.8.2) | py | Runtime Error | 28 | 8976 | 144 | 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')
|
s443060645 | p03957 | u448720391 | 1593897524 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9040 | 89 | s = list(input())
if s.index("C") < s.index("F"):
print("Yes")
else:
print("No") |
s170785663 | p03957 | u350093546 | 1592854520 | Python | PyPy3 (7.3.0) | py | Runtime Error | 92 | 74752 | 129 | 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) |
s654720003 | p03957 | u600261652 | 1592342977 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 158 | 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() |
s878602982 | p03957 | u207799478 | 1591840449 | Python | PyPy3 (2.4.0) | py | Runtime Error | 271 | 60012 | 913 | 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')
|
s220340787 | p03957 | u373047809 | 1590732141 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 67 | k, _, *a = map(int, open(0).read().split())
print(max(a)*2 - k - 1) |
s832944333 | p03957 | u089142196 | 1590548641 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 165 | 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) |
s395128218 | p03957 | u228232845 | 1590144448 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3188 | 712 | 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')
|
s719271167 | p03957 | u652057333 | 1589684935 | Python | PyPy3 (2.4.0) | py | Runtime Error | 170 | 38256 | 174 | 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")
|
s807479065 | p03957 | u652057333 | 1589684900 | Python | PyPy3 (2.4.0) | py | Runtime Error | 182 | 38384 | 172 | 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")
|
s936143452 | p03957 | u494037809 | 1589317611 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 190 | 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") |
s289799008 | p03957 | u923270446 | 1586814280 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 154 | 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") |
s060247507 | p03957 | u600402037 | 1585985115 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 342 | #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';
}
} |
s670953240 | p03957 | u423585790 | 1585423662 | Python | PyPy3 (2.4.0) | py | Runtime Error | 179 | 38640 | 1110 | #!/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()
|
s324999498 | p03957 | u723721005 | 1583931796 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 177 | 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") |
s374846290 | p03957 | u002459665 | 1583624369 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 192 | 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') |
s456120599 | p03957 | u086503932 | 1583047380 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 94 | S = input()
a,b= S.find('C'),S.find('F')
print('Yes') if a>0 and b>0 and> a<b else print('No') |
s009251107 | p03957 | u189487046 | 1582706813 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 166 | 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')
|
s443623855 | p03957 | u189487046 | 1582706687 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 127 | s = input()
if s.index('C') >= 0 and s.index('F') >= 0 and s.index('C') < s.index('F'):
print('Yes')
else:
print('No')
|
s152269705 | p03957 | u828766688 | 1581054600 | Python | PyPy3 (2.4.0) | py | Runtime Error | 171 | 38384 | 164 |
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") |
s883481821 | p03957 | u642874916 | 1580484847 | Python | PyPy3 (2.4.0) | py | Runtime Error | 169 | 38640 | 185 | 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') |
s156722536 | p03957 | u729535891 | 1579792933 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 144 | 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') |
s852973584 | p03957 | u729535891 | 1579761989 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 66 | s = input()
print('Yes' if s.index('C') < s.rindex('F') else 'No') |
s360483921 | p03957 | u729535891 | 1579761925 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 66 | s = input()
print('Yes' if s.index('C') < s.rindex('F') else 'No') |
s252909181 | p03957 | u089230684 | 1579052700 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 53 | if 'CF' in input():
print('Yes')
else:
print('No) |
s804997664 | p03957 | u863370423 | 1579052613 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 219 | 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.
|
s752528379 | p03957 | u172111219 | 1578871128 | Python | PyPy3 (2.4.0) | py | Runtime Error | 180 | 38256 | 276 | 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() |
s069842241 | p03957 | u172111219 | 1578871077 | Python | PyPy3 (2.4.0) | py | Runtime Error | 179 | 38256 | 270 | 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() |
s488665288 | p03957 | u172111219 | 1578870855 | Python | PyPy3 (2.4.0) | py | Runtime Error | 174 | 38384 | 270 | 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() |
s533801011 | p03957 | u172111219 | 1578870833 | Python | PyPy3 (2.4.0) | py | Runtime Error | 168 | 38256 | 272 | 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() |
s012572652 | p03957 | u063073794 | 1578442382 | Python | Python (3.4.3) | py | Runtime Error | 24 | 2940 | 72 | s=input()
if "F" in s[s.index("C"):]:
print("Yes")
else:
print("No") |
s063950179 | p03957 | u905582793 | 1577660587 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 213 | 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") |
s313683520 | p03957 | u905582793 | 1577660554 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 206 | 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") |
s576854362 | p03957 | u748311048 | 1576289996 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 169 | 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') |
s353708695 | p03957 | u598229387 | 1576272522 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 176 | 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) |
s283481225 | p03957 | u102960641 | 1574783301 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 154 | 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")
|
s313113238 | p03957 | u008229752 | 1573687463 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 2550 | #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;
}
} |
s495637771 | p03957 | u727787724 | 1572766750 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 187 | 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')
|
s964221019 | p03957 | u091051505 | 1572659424 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 78 | t = s.find("C")
if s[t:].find("F") > 0:
print("Yes")
else:
print("No") |
s618859702 | p03957 | u668503853 | 1570242999 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 94 | K,T=map(int,input().split())
A=list(map(int,input().split()))
M=max(A)
print(max(M-1-(K-M),0)) |
s030319720 | p03957 | u794250528 | 1569245223 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 118 | s = input()
x = s.index('C')
y = s.rindex('F')
if x >= 0 and y >= 0 and x < y:
print('Yes')
else:
print('No') |
s691894955 | p03957 | u296518383 | 1569100077 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 163 | 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")
|
s282363299 | p03957 | u296518383 | 1569099975 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 106 | 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") |
s191276162 | p03957 | u296518383 | 1569099923 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 108 | 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")
|
s467272427 | p03957 | u723721005 | 1567301565 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 144 | // 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") |
s504486606 | p03957 | u476418095 | 1565895804 | Python | Python (2.7.6) | py | Runtime Error | 13 | 2692 | 252 | #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";
}
|
s798430737 | p03957 | u670180528 | 1565129244 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 57 | import re
print("YNEOS"[1-re.match('.*C.*F',input())::2]
|
s883089665 | p03957 | u993622994 | 1564091660 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 132 | 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') |
s508930985 | p03957 | u444349080 | 1563915019 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 136 | 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") |
s053372291 | p03957 | u444349080 | 1563914981 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 138 | 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") |
s613799198 | p03957 | u977642052 | 1563748370 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3188 | 83 | import re
s = input()
if re.match(r'C.*F', s):
print(YES)
else:
print(NO) |
s746442790 | p03957 | u977642052 | 1563748171 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3188 | 71 | import re
if re.match(r'C.*F', s):
print(YES)
else:
print(NO) |
s626937532 | p03957 | u977642052 | 1563748150 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 59 | if re.match(r'C.*F', s):
print(YES)
else:
print(NO) |
s198358941 | p03957 | u023229441 | 1563682658 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 107 | A=list(input())
for i in A:
if i=="C":
if "I" in A[i+1:]:
print("Yes")
exit()
print("No") |
s522568157 | p03957 | u928165979 | 1563459033 | Python | Python (2.7.6) | py | Runtime Error | 11 | 2568 | 452 | #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;
} |
s690990018 | p03957 | u539517139 | 1561603140 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 127 | 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) |
s048728074 | p03957 | u982594421 | 1560973580 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 116 | s = input()
ans = 'No'
c = s.find('C')
if c != -1:
f = s[c:].find('F')
if f != -1:
ans = 'Yes'
print(ans) |
s194922345 | p03957 | u982594421 | 1560973502 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 118 | s = input()
ans = 'No'
c = s.find('C')
if c != -1:
f = s.find('F', c)
if f != -1:
ans = 'Yes'
print(ans)
|
s195868811 | p03957 | u239316561 | 1559676001 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 168 | 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') |
s206542619 | p03957 | u565149926 | 1559605726 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 72 | s = input()
print("Yes" if 0 <= s.index("C") < s.rindex("F") else "No")
|
s015653663 | p03957 | u300637346 | 1558890162 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 183 | s=input()
c=[]
f=[]
for num in range(len(s)):
if s[num] == 'C':
c.append(num)
if s[num] == 'F':
f.append(num)
print('Yes') if min(c) < max(f) else print('No')
|
s816825827 | p03957 | u463655976 | 1558791255 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3188 | 57 | import re
print(["No", "Yes"][re.Match("C.*F", input())]) |
s603802148 | p03957 | u532966492 | 1557321486 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 156 | s = input()
flag = 0
for i in len(range(s)):
if s[i]=="C":
flag=1
if s[i]=="F" and flag==1:
flag=2
if flag>1:
print("Yes")
else:
print("No") |
s847528806 | p03957 | u532966492 | 1557321465 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 155 | s = input()
flag = 0
for i in len(range(s)):
if s[i]=="C":
flag=1
if s[i]=="F" and flag=1:
flag=2
if flag>1:
print("Yes")
else:
print("No") |
s797593660 | p03957 | u331464808 | 1555694564 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 152 | s= input()
a=0
b=0
for i in range(len(s)):
if s[i]=='C':
a += i
elif s[i]=='F':
b += i
if a,b!=0 and a<b:
print("Yes")
else:
print("No") |
s792409341 | p03957 | u426964396 | 1555438417 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 563 | #include<cstring>
#include<cstdio>
#include<iostream>
using namespace std;
int main()
{
////find函数返回类型 size_type
string s,r;
string::size_type position;
//find 函数 返回jk 在s 中的下标位置
cin>>s;
position = s.find('C');
if (position == s.npos) //如果没找到，返回一个特别的标志c++中用npos表示，我这里npos取值是4294967295，
{
cout<<"No";
return 0;
}
position = s.find('F');
if (position == s.npos) {
cout<<"No";
return 0;
}
cout<<"Yes";
} |
s049981693 | p03957 | u363610900 | 1555086837 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 133 | s = input()
res = [i for i in s if i == 'C' or i == 'F']
print('Yes' if res[0] + res[1] == 'CF' or res[1] + res[2] == 'CF' else'No')
|
s423409232 | p03957 | u379692329 | 1553321065 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 276 | s = input()
flag = False
for i in range(len(s)):
if s[i] == "C":
flag = True
break
if flag:
flag = False
for j in range(len(s)-1, -1, -1):
if s[j] == "F":
flag = True
break
print("Yes" if i < j and flag else "No") |
s048144088 | p03957 | u379692329 | 1553320848 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 275 | s = input()
flag = False
for i in range(len(s)):
if s[i] == "C":
flag = True
break
if flag:
flag = False
for j in range(len(s)-1, 0, -1):
if s[j] == "F":
flag = True
break
print("Yes" if i < j and flag else "No") |
s594869766 | p03957 | u913110564 | 1550205402 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3068 | 188 | a=input()
c=False
f=False
for i in range(len(a)):
if c==True:
if a[i]=='F':
f=True
else:
if a[i]=='C':
c=True
if c==True and f==True:
print("Yes")
else:
print("No") |
s446098656 | p03957 | u913110564 | 1550205332 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 187 | a=input()
c=False
f=False
for i in range(len(a))
if c==True:
if a[i]=='F':
f=True
else:
if a[i]=='C':
c=True
if c==True and f==True:
print("Yes")
else:
print("No") |
s055736645 | p03957 | u913110564 | 1550205296 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 185 | a=input()
c=False
f=False
for i in range(len(a))
if c==True:
if a[i]=='F'
f=True
else:
if a[i]=='C'
c=True
if c==True and f==True:
print("Yes")
else:
print("No") |
s248055740 | p03957 | u913110564 | 1550205267 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 167 | a=input()
c=False
f=False
for i in range(len(a))
if c:
if a[i]=='F'
f=True
else:
if a[i]=='C'
c=True
if c and f:
print("Yes")
else:
print("No") |
s432678400 | p03957 | u181431922 | 1546481856 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 134 | s = input()
a = s.find('C')
if a == -1:
print("No")
else:
if s[a:].find('F') == -1:
print("No")
else print("Yes") |
s233280665 | p03957 | u017810624 | 1538534386 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 178 | s=input()
x=0;y=0
for i in range(len(s)):
if s[i]=='C':
x=i+1
break
for j in range(len(s)):
if s[j]=='F':
y=j+1
if x*y!=0 and x<y:print('Yes')
else:print('No') |
s733582205 | p03957 | u426964396 | 1537820222 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 25 | print<>=~/C.*F/?Yes:No,$/ |
s449115645 | p03957 | u177398299 | 1536771767 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 83 | s = input()
if s.index('C') < s.rindex('F'):
print('Yes')
else:
print('No') |
s737892181 | p03957 | u761989513 | 1536370298 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 78 | s = input()
if "F" in s[s.index("C"):]:
print("Yes")
else:
print("No") |
s286179540 | p03957 | u461636820 | 1535858423 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 216 | s = input()
list = []
for i in s:
if i == 'C':
list.append(i)
elif i == 'F':
list.append(i)
else:
pass
if list[0] == 'C' and list[1] == 'F':
print('Yes')
else:
print('No') |
s848072937 | p03957 | u476418095 | 1535311639 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 452 | #include <bits/stdc++.h>
using namespace std;
int main()
{
char a[10010];
bool c, f;
fgets(a,10010,stdin);
for(int i=1;i<=strlen(a);i++)
{
if(a[i]=='C')
{
for(int j=i+1;j<=strlen(a)-i;j++)
{
if(a[j]=='F')
{
printf("Yes\n");
return 0;
}
}
}
}
printf("No\n");
return 0;
} |
s895164084 | p03957 | u247366051 | 1532918081 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 160 | at2084
n = list(input())
c = n.count('C')
f = n.count('F')
for i in range(len(n)):
if c >= 1 and f >= 1:
print('Yes')
else:
print('No')
|
s511282716 | p03957 | u476418095 | 1532917468 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 186 | strstart = input()
wzc = 0
wzf = 0
for i in strstart:
i2 += 1
if i == 'C':
wzc = i2
if i == 'F':
wzf = i2
if wzc < wzf:
print('YES')
else:
print('NO') |
s786217224 | p03957 | u723721005 | 1532917153 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 186 | strstart = input()
wzc = 0
wzf = 0
for i in strstart:
i2 += 1
if i == 'C':
wzc = i2
if i == 'F':
wzf = i2
if wzc < wzf:
print('YES')
else:
print('NO') |
s057432044 | p03957 | u723721005 | 1532912245 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 181 | #AT2084
s = list(input())
a = []
for i in s:
if i == 'C' or i == 'F':
a.append(i)
if a[0] == 'C' and a[1] == 'F' and len(a) == 2:
print('Yes')
else:
print('No')
|
s738693243 | p03957 | u723721005 | 1532909767 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 186 | strstart = input()
wzc = 0
wzf = 0
for i in strstart:
i2 += 1
if i == 'C':
wzc = i2
if i == 'F':
wzf = i2
if wzc < wzf:
print('YES')
else:
print('NO') |
s881842389 | p03957 | u476418095 | 1532909681 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 200 | strstart = input()
wzc = 0
wzf = 0
for i in strstart:
i2 += 1
if i == 'c':
wzc = i2
if i == 'F':
wzf = i2
break
if wzc < wzf:
print('YES')
else:
print('NO') |
s088791692 | p03957 | u476418095 | 1532909351 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 203 | strstart = input()
for i in strstart:
if i == 'C':
wzc = i
break
for i in strstart:
if i == 'F':
wzf = i
break
if wzc < wzf:
print('YES')
else:
print('NO') |
s562790530 | p03957 | u263933075 | 1532909226 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 156 | strstart = input()
for i in strstart:
if i == 'C':
wzc = i
if i == 'F':
wzf = i
if wzc < wzf:
print('YES')
else:
print('NO') |
s674233788 | p03957 | u476418095 | 1532903123 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 395 | def main()
s = input()
f = False
if s.count('C') == 0 or s.count('F') == 0:
print('NO')
return
for i in range(len(s)):
if s[i] == 'C':
for j in range(i, len(s)):
if s[j] == 'F':
print('Yes')
f = True
break
if f == False:
print('No')
main() |
s141099025 | p03957 | u952708174 | 1526769871 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 169 | import sys
S = input().strip()
for j in range(len(S)):
for k in range(j+1,len(S)):
if S[i] == 'C' and S[j] == 'F':
print('Yes')
sys.exit()
print('No') |
s556594285 | p03957 | u612721349 | 1524660552 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 36 | puts gets.index(/.*C.*F/)?"Yes":"No" |
s564875226 | p03957 | u723721005 | 1523297929 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 257 | #include<bits/stdc++.h>
using namespace std;
int main(){
char c[65000];
int i,j=0,l;
cin>>c;
l=strlen(c);
for(i=0;i<l;i++){
if(c[i]=='C'){
j=1;
}
if(c[i]=='F'){
if(j==1){
cout<<"YES";
return 0;
}
}
}
cout<<"NO";
return 0;
} |
s770998428 | p03957 | u030726788 | 1521575206 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 206 | import sys
s=input()
if("C" in s and "F" in s):
for i in range(len(s)):
if(s[i]=="C"):c=i
for i in range(len(s))[::-1]:
if(s[i]==="F"):f=i
if(c<f):
print("Yes")
sys.exit()
print("No")
|
s369314365 | p03957 | u030726788 | 1521574947 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3060 | 124 | import sys
s=input()
if("C" in s and "C" in s):
if(s.index("C")<s.index("F")):
print("Yes")
sys.exit()
print("No") |
s174056124 | p03957 | u976162616 | 1487398004 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 586 | import heapq
if __name__ == "__main__":
K,T = map(int, input().split())
data = list(map(int, input().split()))
data.sort()
cake = []
for i,x in enumerate(data):
cake.append([x, i])
heapq._heapify_max(cake)
while (len(cake) > 1):
p = heapq._heappop_max(cake)
q = heapq._heappop_max(cake)
p[0] -= 1
q[0] -= 1
if p[0] > 0:
heapq.heappush(cake, p)
if q[0] > 0:
heapq.heappush(cake, q)
result = 0
if len(cake) > 0:
result = cake[0][0]
print (max(0, result - 1))
|
s667085847 | p03957 | u054556734 | 1478237211 | Python | Python (3.4.3) | py | Runtime Error | 24 | 3064 | 166 | s=str(input())
p=list('ABDEGHIJKLMNOPQRSTUVWXYZ')
p.remove("C")
p.remove("F")
for i in p:
s=s.replace(i,'')
if 'CF' in s:
print('Yes')
else:
print('No') |
s675324284 | p03957 | u054556734 | 1478236585 | Python | Python (3.4.3) | py | Runtime Error | 24 | 3064 | 127 | s=input()
l=["a:z"]
l.remove(c)
l.remove(f)
for i in l:
s.replace(i, "")
if "CF" in l:
print("yes")
else:
print("NO") |
s241076746 | p03957 | u928248511 | 1477765917 | Python | Python (3.4.3) | py | Runtime Error | 22 | 3064 | 76 | s = str(input())
if('C' in a and 'F' in a):
print('Yes')
else:
print('No') |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.