-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathproblem13.cpp
60 lines (41 loc) · 1023 Bytes
/
problem13.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
///link of problem : https://codeforces.com/contest/1941/problem/C
#include<bits/stdc++.h>
#include<iostream> ///* code by Ahmed Elnemr *///
using namespace std;
///template<typename type1,typename type2>
///#define b 10 --> const int b= 10;
#define ll long long
#define f first
#define sec second
//#define endl "\n"
#define lp(n) for(ll i=0;i<n;i++)
#define seet set<int>
#define vec vector<int>
void fast_run()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
signed main() {
fast_run();
int t=1;
cin>>t;
while(t--) {
int n,ans=0; cin>>n;
string s; cin>>s;
for(int i=0;i<n-2;i++) {
if(s[i]=='m' && s[i+1]=='a' && s[i+2]=='p') {
ans++;
i+=2;
continue;
}
if(s[i]=='p' && s[i+1]=='i' && s[i+2]=='e') {
ans++;
i+=2;
}
}
cout<<ans<<endl;
}
return 0;
}