Submission #5558726

---

Source Code Expand

#include <stdio.h>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <vector>
#include <iostream>
#include<math.h>
#include<bitset>
#include<iomanip>
#include<queue>
using namespace std;

int main() {
	int T; cin >> T;
	vector<string> s(T);
	for (int i = 0; i < T; i++)cin >> s[i];
	for (int i = 0; i < T; i++) {
		int ans = 0;
		for (int j = 0; j < s[i].size()-4; j++) {
			if (s[i][j] == 't'&&s[i][j + 1] == 'o'&&s[i][j + 2] == 'k'&&s[i][j + 3] == 'y'&&s[i][j + 4] == 'o') {
				ans++;
				j += 4;
			}
			if (j >= s[i].size())break;
			if (s[i][j + 3] == 't'&&s[i][j + 4] == 'o'&&s[i][j] == 'k'&&s[i][j + 1] == 'y'&&s[i][j + 2] == 'o') {
				ans++;
				j += 4;
			}
		}
		cout << ans << endl;
	}
}

Submission Info

Judge Result