Submission #2090307
Source Code Expand
#include<stdio.h> #include<vector> #include<algorithm> #include<math.h> #include<stdlib.h> #include<string> #include<iostream> #include<set> #include<map> #include<deque> using namespace std; typedef long long ll; typedef pair<ll, ll>pii; typedef pair<pii, ll>pi3; ll mod = 1000000007; int main() { string a; cin >> a; int r = 0; for (int i = 0; i < a.size(); i++) { if (r == 0) { if (a[i] == 'C')r++; } else if (r == 1) { if (a[i] == 'F')r++; } } //printf("%c%c%c\n", a[0]+'A'-'a',b[0]+'A'-'a',c[0]+'A'-'a'); //cout << max(a*b,c*d) << endl; printf((r==2) ? "Yes\n" :"No\n"); }
Submission Info
Submission Time | |
---|---|
Task | A - CF |
User | DEGwer |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 638 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt |
All | 0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_000.txt | AC | 1 ms | 256 KB |
0_001.txt | AC | 1 ms | 256 KB |
0_002.txt | AC | 1 ms | 256 KB |
0_003.txt | AC | 1 ms | 256 KB |
1_004.txt | AC | 1 ms | 256 KB |
1_005.txt | AC | 1 ms | 256 KB |
1_006.txt | AC | 1 ms | 256 KB |
1_007.txt | AC | 1 ms | 256 KB |
1_008.txt | AC | 1 ms | 256 KB |
1_009.txt | AC | 1 ms | 256 KB |
1_010.txt | AC | 1 ms | 256 KB |
1_011.txt | AC | 1 ms | 256 KB |