Submission #532980

---

Source Code Expand

#include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define REP(i,n) for (int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
const int INF=1e9;
string tokyo="tokyo";
string kyoto="kyoto";
int main(){
      int n;
      cin>>n;
      while(n--){
            int cnt=0;
            string s;
            cin>>s;
            int i=0;
            while(i<s.size()){
                  if(s[i]=='t'){
                        bool f=true;
                        REP(j,tokyo.size())if(tokyo[j]!=s[i+j])f=false;
                        if(f){
                              cnt++;
                              i+=4;
                        }
                  }else if(s[i]=='k'){
                        bool f=true;
                        REP(j,kyoto.size())if(kyoto[j]!=s[i+j])f=false;
                        if(f){
                              cnt++;
                              i+=4;
                        }
                  }
                  i++;
            }
            cout<<cnt<<endl;
      }
}

Submission Info

Judge Result