Submission #533068

---

Source Code Expand

#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <sstream>
#include <functional>
#include <map>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <list>
#include <numeric>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const ll INF = 1LL<<25;
#define rep(i,n) for(ll (i)=0;(i)<(ll)(n);++(i))
#define repd(i,n,d) for(ll (i)=0;(i)<(ll)(n);(i)+=(d))
#define all(v) (v).begin(), (v).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset((m),(v),sizeof(m))

void solve(string &s){
	int res = 0;
	for(int i = 0; i < s.size()-10; i++){
		string t = s.substr(i, 5);
		if(t=="kyoto" || t=="tokyo"){
			res++;
			i += 4;
		}
	}
	cout<<res<<endl;
}

int main(){
	int T;
	cin>>T;
	while(T--){
		string s;
		cin>>s;
		s += string(10, '_');
		solve(s);
	}
	return 0;
}

Submission Info

Judge Result