Submission #3266652

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <stack>
#include <queue>
using namespace std;

#define ll long long
#define ull unsigned long long
#define rep(i,N) for (int i=0;i<N;i++)

//変数
int T;
vector<string> vec;
string tokyo = "tokyo", kyoto = "kyoto";

//解法
void solve() {

	rep(i, T) {

		int ans=0;
		int size = vec[i].size();
		rep(j, size-4) {

			bool flag = true;
			rep(k, 5) {
				if (vec[i][j + k] == tokyo[k]) {

				}
				else {
					flag = false;
					break;
				}
			}

			if (flag == true) {
				j += 4;
				ans++;
				continue;
			}

			flag = true;
			rep(k, 5) {
				if (vec[i][j + k] == kyoto[k]) {

				}
				else {
					flag = false;
					break;
				}
			}

			if (flag == true) {
				j += 4;
				ans++;
				continue;
			}

		}

		cout << ans << endl;

	}

	return;
}

int main() {
	//入力
	cin >> T;
	vec.resize(T);
	rep(i, T) cin >> vec[i];
	solve();
	//cout << endl;
	return 0;
}

Submission Info

Judge Result