Submission #533077

---

Source Code Expand

#include <algorithm>
#include <iostream>
#include <set>
#include <iterator>
#include <cmath>
#include <tuple>
#include <stack>
#include <iomanip>
#include <string>
#include <vector>
#include <queue>
#include <limits>
#include <cassert>

using namespace std;

template<class T = int>
inline bool within(T min_x, T x, T max_x){ return min_x<=x&&x<max_x; }
typedef long long ll;

int count(string &str,string &key){
	int ind = 0, ret = 0;
	bool flag;
	do{
		auto it = str.find(key,ind);
		flag = it!=string::npos;
		if(flag){
			ind = it+1;
			ret++;
		}
	}while(flag);
	return ret;
}
int main() {
    cin.tie(nullptr); ios::sync_with_stdio(false);
    int n;
    cin >> n;
    string tkt = "tokyoto";
    string tk = "tokyo";
    string kt = "kyoto";
    for(int i = 0; i < n; ++i){
    	string str;
    	cin >> str;
    	int tktc = count(str,tkt);
    	int tkc = count(str,tk);
    	int ktc = count(str,kt);
    	cout << tkc+ktc-tktc << endl;
    }
  return 0;
}

Submission Info

Judge Result