Submission #532978
Source Code Expand
#include <iostream> #include <cstdio> #include <cstdlib> #include <cmath> #include <cstring> #include <vector> #include <algorithm> #include <set> #include <queue> #include <map> #include <climits> #include <complex> #include <numeric> using namespace std; #define REP(i,n) for(int i=0; i<(int)(n); i++) #define RREP(i,n) for(int i=(int)n-1; i>=0; i--) #define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i) #define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();++i) #define ALL(c) (c).begin(), (c).end() typedef long long int ll; typedef pair<int, int> pii; typedef pair<int, pair<int, int> > pipii; typedef vector<int> vi; const int INF = 1e9; const int MOD = 1e9+7; int main(void){ int n; cin >> n; while(n--){ string s; cin >> s; int sn = s.size(); int ans = 0; for(int i = 0; i < sn; i++){ if(s.substr(i, 5) == "kyoto" || s.substr(i, 5) == "tokyo"){ ans++; i += 5; } } cout << ans << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 東京都 |
User | no15_renne |
Language | C++ (GCC 4.9.2) |
Score | 0 |
Code Size | 1134 Byte |
Status | WA |
Exec Time | 29 ms |
Memory | 928 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 0 / 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 | WA | 29 ms | 728 KB |
20_noised_tokyoto.txt | WA | 28 ms | 792 KB |
99_teuchi.txt | WA | 26 ms | 928 KB |