Submission #941918
Source Code Expand
#include<iostream> #include<iomanip> #include<map> #include<unordered_map> #include<set> #include<unordered_set> #include<vector> #include<array> #include<string> #include<stack> #include<queue> #include<algorithm> #include<cassert> #include<functional> #include<random> #include<complex> #include<bitset> #include<chrono> //#include<boost/multiprecision/cpp_int.hpp> #define int int64_t #define uint uint64_t #define REP(i, a, b) for (int64_t i = (int64_t)(a); i < (int64_t)(b); i++) #define rep(i, a) REP(i, 0, a) #define EACH(i, a) for (auto i: a) #define ITR(x, a) for (auto x = a.begin(); x != a.end(); x++) #define ALL(a) (a.begin()), (a.end()) #define HAS(a, x) (a.find(x) != a.end()) #define Min(x) *min_element(ALL(x)) #define Max(x) *max_element(ALL(x)) #define Unique(L) (L.erase(unique(ALL(L)), L.end())) #define veccat(v1, v2) std::copy((v2).begin(),(v2).end(),std::back_inserter(v1)) #define intmax (std::numeric_limits<int64_t>::max() / 4) using namespace std; //typedef boost::multiprecision::cpp_int bigint; const double EPS = 1e-9; const double PI = acos(-1.0); signed main() { cin.tie(0); ios::sync_with_stdio(false); string S; int a = 0; rep(i, S.size()) { if (a == 0 && S[i] == 'C')a = 1; else if (a == 1 && S[i] == 'F')a = 2; } if (a == 2)cout << "Yes" << endl; else cout << "No" << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - CF |
User | eukaryo |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1393 Byte |
Status | WA |
Exec Time | 10 ms |
Memory | 764 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 10 ms | 764 KB |
0_001.txt | AC | 3 ms | 256 KB |
0_002.txt | WA | 3 ms | 256 KB |
0_003.txt | WA | 3 ms | 256 KB |
1_004.txt | AC | 3 ms | 256 KB |
1_005.txt | WA | 3 ms | 256 KB |
1_006.txt | AC | 3 ms | 256 KB |
1_007.txt | AC | 3 ms | 256 KB |
1_008.txt | WA | 3 ms | 256 KB |
1_009.txt | AC | 3 ms | 256 KB |
1_010.txt | WA | 3 ms | 256 KB |
1_011.txt | WA | 3 ms | 256 KB |