Submission #2994701
Source Code Expand
#include <bits/stdc++.h> using namespace std; using ll = long long int; using ld = long double; using pii = pair<int, int>; using pll = pair<ll, ll>; template<typename Q_temp> using smaller_queue = priority_queue <Q_temp, vector<Q_temp>, greater<Q_temp> >; const int INF = (int) 1e9; const ll LINF = (ll) 4e18; const ll MOD = (ll) (1e9 + 7); const double PI = acos(-1.0); const int limit = 100010; #define REP(i,m,n) for(ll i = m; i < (ll)(n); ++i) #define rep(i,n) REP(i, 0, n) #define MP make_pair #define YES(n) cout << ((n) ? "YES" : "NO") << endl #define Yes(n) cout << ((n) ? "Yes" : "No") << endl #define Possible(n) cout << ((n) ? "Possible" : "Impossible") << endl #define NP(v) next_permutation(v.begin(),v.end()) #define debug(x) cout << #x << ":" << x << endl; #define debug2(x) for(auto a : x) cout << a << " "; cout << endl; vector<pii> around = {MP(1, 0), MP(-1, 0), MP(0, 1), MP(0, -1)}; //------------------------------------------------------ int main() { cin.tie(0); ios::sync_with_stdio(false); int t; cin >> t; rep(k, t) { string s; cin >> s; int cnt = 0; for (int i = 0; i + 4 < s.length(); ++i) { if (s.substr(i, 5) == "tokyo" || s.substr(i, 5) == "kyoto") { cnt++; i += 4; } } cout << cnt << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 東京都 |
User | stoq |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1431 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 256 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | 10_random_to_kyo.txt, 20_noised_tokyoto.txt, 99_teuchi.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
10_random_to_kyo.txt | AC | 2 ms | 256 KB |
20_noised_tokyoto.txt | AC | 2 ms | 256 KB |
99_teuchi.txt | AC | 2 ms | 256 KB |