Submission #2966189
Source Code Expand
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include <numeric>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v,n) reverse(v,v+n);
#define VREVERSE(v) reverse(v.begin(), v.end());
#define ll long long
#define pb(a) push_back(a)
#define INF 99999999
using namespace std;
int dy[4] = { 0,0,1,-1 };
int dx[4] = { 1,-1,0,0 };
int dxx[8] = { 0,0,1,1,1,-1,-1,-1 };
int dyy[8] = { 1,-1,0,1,-1,0,1,-1 };
ll m = 1000000007;
ll gcd(ll x, ll y) {
ll m = max(x, y), n = min(x, y);
if (m%n == 0)return n;
else return gcd(m%n, n);
}
ll myPow(ll x, ll n, ll m) {
if (n == 0)
return 1;
if (n % 2 == 0)
return myPow(x * x % m, n / 2, m);
else
return x * myPow(x, n - 1, m) % m;
}
int main() {
int T;
cin >> T;
string S[101];
REP(i, T)cin >> S[i];
REP(i, T) {
int ans = 0;
int l = S[i].length();
REP(j, l-4) {
string s = S[i].substr(j, 5);
if (s == "tokyo" || s == "kyoto") {
ans++;
j += 4;
}
}
cout << ans << endl;
}
}
Submission Info
Submission Time |
|
Task |
A - 東京都 |
User |
Mojumbo |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
1358 Byte |
Status |
AC |
Exec Time |
3 ms |
Memory |
256 KB |
Judge Result
Set Name |
All |
Score / Max Score |
100 / 100 |
Status |
|
Set Name |
Test Cases |
All |
10_random_to_kyo.txt, 20_noised_tokyoto.txt, 99_teuchi.txt |
Case Name |
Status |
Exec Time |
Memory |
10_random_to_kyo.txt |
AC |
2 ms |
256 KB |
20_noised_tokyoto.txt |
AC |
3 ms |
256 KB |
99_teuchi.txt |
AC |
2 ms |
256 KB |