Submission #2211265

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <limits>
#include <map>
#define REP(i,n) for(int (i)=0;(i)<(n);(i)++)
#define IREP(i,j,n) for(int (i)=(j);(i)<(n);(i)++)
#define INF numeric_limits<double>::infinity()
constexpr long MOD = 1e9 + 7;
using namespace std;

int cnt;

void solve(string s) {
    REP(i,int(s.size())-4) {
        if (s.substr(i,5) == "tokyo" || s.substr(i,5) == "kyoto") {
            cnt++;
            solve(s.substr(i+5));
            break;
        }
    }
}

int main() {
    int t;
    cin >> t;
    string s;
    REP(i,t) {
        cin >> s;
        solve(s);
        cout << cnt << endl;
        cnt = 0;
    }
}

Submission Info

Judge Result