Submission #2179432

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
using namespace std;

int solve(string);
int main(){
  int t; cin >> t;
  for(int i=0; i<t; i++){
    string s; cin >> s;
    cout << solve(s) << endl;
  }

  return 0;
}

int solve(string s){
  string tokyo="tokyo", kyoto="kyoto";
  int tindex=0, kindex=0;
  for(int i=0; i<s.length(); i++){
    if(s[i]==tokyo[tindex%tokyo.length()]){
      tindex++;
    }
    if(s[i]==kyoto[kindex%kyoto.length()]){
      kindex++;
    }
  }
  return max(tindex/tokyo.length(), kindex/kyoto.length());
}

Submission Info

Judge Result