Submission #533049

---

Source Code Expand

#include<iostream>
#include<sstream>
#include<iomanip>
#include<cstdio>
#include<cmath>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<utility>
#include<queue>
#include<limits>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
typedef pair< int,int > P;
const int inf = numeric_limits< int >::max();

bool used[200];

void solve(string s){
  int res = 0;
  for(int i = 0;i < (int)s.size();++i){
    used[i] = false;
  }
  for(int i = 0;i+4 < (int)s.size();++i){
    if(!used[i] &&
       s.substr(i,5) == "tokyo"){
      ++res;
      for(int j = 0;j < 4;++j){
	used[i+j] = true;
      }
    }
  }
  for(int i = 0;i < (int)s.size();++i){
    if(!used[i] &&
       s.substr(i,5) == "kyoto"){
      ++res;
      for(int j = 0;j < 4;++j){
	used[i+j] = true;
      }
    }
  }
  cout << res << endl;
}


int main(void){
  int n;
  cin >> n;
  for(int i = 0;i < n;++i){
    string s;
    cin >> s;
    solve(s);
  }
  return 0;
}

Submission Info

Judge Result