Solved 3 problems in the last Div3

33 files changed, 723 insertions, 0 deletions

diff --git a/contests/Round928/A/main.cpp b/contests/Round928/A/main.cpp
new file mode 100755
index 0000000..539fdb0
--- /dev/null
+++ b/contests/Round928/A/main.cpp
@@ -0,0 +1,54 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+using ll = long long;
+using pii = pair<int, int>;
+using vpii = vector<pii>;
+using vi = vector<int>;
+using vll = vector<long long>;
+using mpii = map<int, int>;
+using mpll = map<ll, ll>;
+using db = long double;
+
+#define pb push_back
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+#define lb lower_bound
+#define ub upper_bound
+#define make_unique(x)                                                         \
+  sort(all((x)));                                                              \
+  (x).resize(unique(all((x))) - (x).begin())
+#define ceil(a, b) ((a) + (b)-1) / (b)
+
+const int mod = (int)1e9 + 7;
+const db pi = acos((db)-1);
+const int dx[4]{1, 0, -1, 0};
+const int dy[4]{0, 1, 0, -1};
+
+#ifdef LOCAL
+#include "debug.h"
+#else
+#define dbg(...) 42
+#endif
+
+/* stuff you should look for:
+  ---------------------------
+   * special cases (n=1?)
+   * int overflow, array bounds
+   * do smth instead of nothing and stay organized
+   * WRITE STUFF DOWN
+   * DON'T GET STUCK ON ONE APPROACH
+ */
+
+void solve() { <()> }
+
+int main() {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while (tt--) {
+    solve();
+  }
+}
diff --git a/contests/Round928/B/main.cpp b/contests/Round928/B/main.cpp
new file mode 100755
index 0000000..539fdb0
--- /dev/null
+++ b/contests/Round928/B/main.cpp
@@ -0,0 +1,54 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+using ll = long long;
+using pii = pair<int, int>;
+using vpii = vector<pii>;
+using vi = vector<int>;
+using vll = vector<long long>;
+using mpii = map<int, int>;
+using mpll = map<ll, ll>;
+using db = long double;
+
+#define pb push_back
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+#define lb lower_bound
+#define ub upper_bound
+#define make_unique(x)                                                         \
+  sort(all((x)));                                                              \
+  (x).resize(unique(all((x))) - (x).begin())
+#define ceil(a, b) ((a) + (b)-1) / (b)
+
+const int mod = (int)1e9 + 7;
+const db pi = acos((db)-1);
+const int dx[4]{1, 0, -1, 0};
+const int dy[4]{0, 1, 0, -1};
+
+#ifdef LOCAL
+#include "debug.h"
+#else
+#define dbg(...) 42
+#endif
+
+/* stuff you should look for:
+  ---------------------------
+   * special cases (n=1?)
+   * int overflow, array bounds
+   * do smth instead of nothing and stay organized
+   * WRITE STUFF DOWN
+   * DON'T GET STUCK ON ONE APPROACH
+ */
+
+void solve() { <()> }
+
+int main() {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while (tt--) {
+    solve();
+  }
+}
diff --git a/contests/Round928/C/main.cpp b/contests/Round928/C/main.cpp
new file mode 100755
index 0000000..539fdb0
--- /dev/null
+++ b/contests/Round928/C/main.cpp
@@ -0,0 +1,54 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+using ll = long long;
+using pii = pair<int, int>;
+using vpii = vector<pii>;
+using vi = vector<int>;
+using vll = vector<long long>;
+using mpii = map<int, int>;
+using mpll = map<ll, ll>;
+using db = long double;
+
+#define pb push_back
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+#define lb lower_bound
+#define ub upper_bound
+#define make_unique(x)                                                         \
+  sort(all((x)));                                                              \
+  (x).resize(unique(all((x))) - (x).begin())
+#define ceil(a, b) ((a) + (b)-1) / (b)
+
+const int mod = (int)1e9 + 7;
+const db pi = acos((db)-1);
+const int dx[4]{1, 0, -1, 0};
+const int dy[4]{0, 1, 0, -1};
+
+#ifdef LOCAL
+#include "debug.h"
+#else
+#define dbg(...) 42
+#endif
+
+/* stuff you should look for:
+  ---------------------------
+   * special cases (n=1?)
+   * int overflow, array bounds
+   * do smth instead of nothing and stay organized
+   * WRITE STUFF DOWN
+   * DON'T GET STUCK ON ONE APPROACH
+ */
+
+void solve() { <()> }
+
+int main() {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while (tt--) {
+    solve();
+  }
+}
diff --git a/contests/Round928/D/main.cpp b/contests/Round928/D/main.cpp
new file mode 100755
index 0000000..05b3cc4
--- /dev/null
+++ b/contests/Round928/D/main.cpp
@@ -0,0 +1,106 @@
+#include <algorithm>
+#include <bits/stdc++.h>
+
+using namespace std;
+
+using ll = long long;
+using pii = pair<int, int>;
+using vpii = vector<pii>;
+using vi = vector<int>;
+using vll = vector<long long>;
+using mpii = map<int, int>;
+using mpll = map<ll, ll>;
+using db = long double;
+
+#define pb push_back
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+#define lb lower_bound
+#define ub upper_bound
+#define make_unique(x)                                                         \
+  sort(all((x)));                                                              \
+  (x).resize(unique(all((x))) - (x).begin())
+#define ceil(a, b) ((a) + (b)-1) / (b)
+
+const int mod = (int)1e9 + 7;
+const db pi = acos((db)-1);
+const int dx[4]{1, 0, -1, 0};
+const int dy[4]{0, 1, 0, -1};
+
+#ifdef LOCAL
+#include "debug.h"
+#else
+#define dbg(...) 42
+#endif
+
+/* stuff you should look for:
+  ---------------------------
+   * special cases (n=1?)
+   * int overflow, array bounds
+   * do smth instead of nothing and stay organized
+   * WRITE STUFF DOWN
+   * DON'T GET STUCK ON ONE APPROACH
+ */
+
+int binarySearch(const std::vector<int> &arr, int target) {
+  int left = 0;
+  int right = arr.size() - 1;
+
+  while (left <= right) {
+    int mid = left + (right - left) / 2;
+
+    if (arr[mid] == target) {
+      return mid;
+    } else if (arr[mid] < target) {
+      left = mid + 1;
+    } else {
+      right = mid - 1;
+    }
+  }
+
+  return -1;
+}
+
+int negateNumber(int num) {
+  int signMask = 1 << (sizeof(int) * 8 - 1);
+
+  int inverted = ~num & (signMask - 1);
+
+  return inverted + 1;
+}
+
+void solve() {
+  random_device rd;
+  mt19937 gen(rd());
+  uniform_int_distribution<> distribution(1, INT_MAX);
+  int n;
+  cin >> n;
+  vi v(n);
+  for (auto &x : v) {
+    cin >> x;
+  }
+  sort(all(v));
+  int ans = 0;
+  vector<bool> marked(n, false);
+  for (int i = 0; i < n; i++) {
+    auto it = binarySearch(v, negateNumber(v[i]) - 1);
+    if (it != -1) {
+      ans++;
+      v[it] = distribution(gen);
+      marked[i] = true;
+      marked[it] = true;
+    }
+  }
+  int cnt = count(all(marked), false);
+  cout << ans + cnt << '\n';
+}
+
+int main() {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while (tt--) {
+    solve();
+  }
+}
diff --git a/contests/Round928/D/main_input0.txt b/contests/Round928/D/main_input0.txt
new file mode 100644
index 0000000..b9e8c65
--- /dev/null
+++ b/contests/Round928/D/main_input0.txt
@@ -0,0 +1,19 @@
+9
+4
+1 4 3 4
+2
+0 2147483647
+5
+476319172 261956880 2136179468 1671164475 1885526767
+3
+1335890506 811593141 1128223362
+4
+688873446 627404104 1520079543 1458610201
+4
+61545621 2085938026 1269342732 1430258575
+4
+0 0 2147483647 2147483647
+3
+0 0 2147483647
+8
+1858058912 289424735 1858058912 2024818580 1858058912 289424735 122665067 289424735
diff --git a/contests/Round928/D/main_output0.txt b/contests/Round928/D/main_output0.txt
new file mode 100644
index 0000000..6572dc5
--- /dev/null
+++ b/contests/Round928/D/main_output0.txt
@@ -0,0 +1,9 @@
+4
+1
+3
+2
+2
+3
+2
+2
+4
diff --git a/contests/Round928/E/main.cpp b/contests/Round928/E/main.cpp
new file mode 100755
index 0000000..539fdb0
--- /dev/null
+++ b/contests/Round928/E/main.cpp
@@ -0,0 +1,54 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+using ll = long long;
+using pii = pair<int, int>;
+using vpii = vector<pii>;
+using vi = vector<int>;
+using vll = vector<long long>;
+using mpii = map<int, int>;
+using mpll = map<ll, ll>;
+using db = long double;
+
+#define pb push_back
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+#define lb lower_bound
+#define ub upper_bound
+#define make_unique(x)                                                         \
+  sort(all((x)));                                                              \
+  (x).resize(unique(all((x))) - (x).begin())
+#define ceil(a, b) ((a) + (b)-1) / (b)
+
+const int mod = (int)1e9 + 7;
+const db pi = acos((db)-1);
+const int dx[4]{1, 0, -1, 0};
+const int dy[4]{0, 1, 0, -1};
+
+#ifdef LOCAL
+#include "debug.h"
+#else
+#define dbg(...) 42
+#endif
+
+/* stuff you should look for:
+  ---------------------------
+   * special cases (n=1?)
+   * int overflow, array bounds
+   * do smth instead of nothing and stay organized
+   * WRITE STUFF DOWN
+   * DON'T GET STUCK ON ONE APPROACH
+ */
+
+void solve() { <()> }
+
+int main() {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while (tt--) {
+    solve();
+  }
+}
diff --git a/contests/Round928/F/main.cpp b/contests/Round928/F/main.cpp
new file mode 100755
index 0000000..539fdb0
--- /dev/null
+++ b/contests/Round928/F/main.cpp
@@ -0,0 +1,54 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+using ll = long long;
+using pii = pair<int, int>;
+using vpii = vector<pii>;
+using vi = vector<int>;
+using vll = vector<long long>;
+using mpii = map<int, int>;
+using mpll = map<ll, ll>;
+using db = long double;
+
+#define pb push_back
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+#define lb lower_bound
+#define ub upper_bound
+#define make_unique(x)                                                         \
+  sort(all((x)));                                                              \
+  (x).resize(unique(all((x))) - (x).begin())
+#define ceil(a, b) ((a) + (b)-1) / (b)
+
+const int mod = (int)1e9 + 7;
+const db pi = acos((db)-1);
+const int dx[4]{1, 0, -1, 0};
+const int dy[4]{0, 1, 0, -1};
+
+#ifdef LOCAL
+#include "debug.h"
+#else
+#define dbg(...) 42
+#endif
+
+/* stuff you should look for:
+  ---------------------------
+   * special cases (n=1?)
+   * int overflow, array bounds
+   * do smth instead of nothing and stay organized
+   * WRITE STUFF DOWN
+   * DON'T GET STUCK ON ONE APPROACH
+ */
+
+void solve() { <()> }
+
+int main() {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while (tt--) {
+    solve();
+  }
+}
diff --git a/contests/Round933/A/main.cpp b/contests/Round933/A/main.cpp
new file mode 100755
index 0000000..23f4fd3
--- /dev/null
+++ b/contests/Round933/A/main.cpp
@@ -0,0 +1,74 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+using ll = long long;
+using pii = pair<int, int>;
+using vpii = vector<pii>;
+using vi = vector<int>;
+using vll = vector<long long>;
+using mpii = map<int, int>;
+using mpll = map<ll, ll>;
+using db = long double;
+
+#define pb push_back
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+#define lb lower_bound
+#define ub upper_bound
+#define make_unique(x)                                                         \
+  sort(all((x)));                                                              \
+  (x).resize(unique(all((x))) - (x).begin())
+#define ceil(a, b) ((a) + (b)-1) / (b)
+
+const int mod = (int)1e9 + 7;
+const db pi = acos((db)-1);
+const int dx[4]{1, 0, -1, 0};
+const int dy[4]{0, 1, 0, -1};
+
+#ifdef LOCAL
+#include "debug.h"
+#else
+#define dbg(...) 42
+#endif
+
+/* stuff you should look for:
+  ---------------------------
+   * special cases (n=1?)
+   * int overflow, array bounds
+   * do smth instead of nothing and stay organized
+   * WRITE STUFF DOWN
+   * DON'T GET STUCK ON ONE APPROACH
+ */
+
+void solve() {
+  int n, m, k;
+  cin >> n >> m >> k;
+  int cnt = 0;
+  vi b(n);
+  vi c(m);
+  for (auto &x : b) {
+    cin >> x;
+  }
+  for (auto &x : c) {
+    cin >> x;
+  }
+  for (int i = 0; i < n; i++) {
+    for (int j = 0; j < m; j++) {
+      if (b[i] + c[j] <= k) {
+        cnt++;
+      }
+    }
+  }
+  cout << cnt << '\n';
+}
+
+int main() {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while (tt--) {
+    solve();
+  }
+}
diff --git a/contests/Round933/A/main_input0.txt b/contests/Round933/A/main_input0.txt
new file mode 100644
index 0000000..3b4a7e5
--- /dev/null
+++ b/contests/Round933/A/main_input0.txt
@@ -0,0 +1,13 @@
+4
+4 4 8
+1 5 10 14
+2 1 8 1
+2 3 4
+4 8
+1 2 3
+4 2 7
+1 1 1 1
+2 7
+3 4 2000
+1 1 1
+1 1 1 1
diff --git a/contests/Round933/A/main_output0.txt b/contests/Round933/A/main_output0.txt
new file mode 100644
index 0000000..a649b49
--- /dev/null
+++ b/contests/Round933/A/main_output0.txt
@@ -0,0 +1,4 @@
+6
+0
+4
+12
diff --git a/contests/Round933/B/main.cpp b/contests/Round933/B/main.cpp
new file mode 100755
index 0000000..eae9018
--- /dev/null
+++ b/contests/Round933/B/main.cpp
@@ -0,0 +1,80 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+using ll = long long;
+using pii = pair<int, int>;
+using vpii = vector<pii>;
+using vi = vector<int>;
+using vll = vector<long long>;
+using mpii = map<int, int>;
+using mpll = map<ll, ll>;
+using db = long double;
+
+#define pb push_back
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+#define lb lower_bound
+#define ub upper_bound
+#define make_unique(x)                                                         \
+  sort(all((x)));                                                              \
+  (x).resize(unique(all((x))) - (x).begin())
+#define ceil(a, b) ((a) + (b)-1) / (b)
+
+const int mod = (int)1e9 + 7;
+const db pi = acos((db)-1);
+const int dx[4]{1, 0, -1, 0};
+const int dy[4]{0, 1, 0, -1};
+
+#ifdef LOCAL
+#include "debug.h"
+#else
+#define dbg(...) 42
+#endif
+
+/* stuff you should look for:
+  ---------------------------
+   * special cases (n=1?)
+   * int overflow, array bounds
+   * do smth instead of nothing and stay organized
+   * WRITE STUFF DOWN
+   * DON'T GET STUCK ON ONE APPROACH
+ */
+
+void apply(vi &v, int idx, int times) {
+  v[idx] -= 2 * times;
+  v[idx - 1] -= times;
+  v[idx + 1] -= times;
+}
+
+void solve() {
+  int n;
+  cin >> n;
+  vi v(n);
+  for (auto &x : v) {
+    cin >> x;
+  }
+  for (int i = 0; i < n - 2; i++) {
+    int times = v[i];
+    if (times < 0) {
+      cout << "NO\n";
+      return;
+    }
+    apply(v, i + 1, times);
+  }
+  if (all_of(all(v), [](int x) { return x == 0; })) {
+    cout << "YES\n";
+  } else {
+    cout << "NO\n";
+  }
+}
+
+int main() {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while (tt--) {
+    solve();
+  }
+}
diff --git a/contests/Round933/B/main_input0.txt b/contests/Round933/B/main_input0.txt
new file mode 100644
index 0000000..315e8f5
--- /dev/null
+++ b/contests/Round933/B/main_input0.txt
@@ -0,0 +1,15 @@
+7
+5
+1 3 5 5 2
+5
+2 4 4 5 1
+5
+0 1 3 3 1
+6
+5 6 0 2 3 0
+4
+1 2 7 2
+3
+7 1 0
+4
+1 1 1 1
diff --git a/contests/Round933/B/main_input1.txt b/contests/Round933/B/main_input1.txt
new file mode 100644
index 0000000..f8f351a
--- /dev/null
+++ b/contests/Round933/B/main_input1.txt
@@ -0,0 +1,3 @@
+1
+5
+0 0 0 0 0
\ No newline at end of file
diff --git a/contests/Round933/B/main_input2.txt b/contests/Round933/B/main_input2.txt
new file mode 100644
index 0000000..f8f351a
--- /dev/null
+++ b/contests/Round933/B/main_input2.txt
@@ -0,0 +1,3 @@
+1
+5
+0 0 0 0 0
\ No newline at end of file
diff --git a/contests/Round933/B/main_input3.txt b/contests/Round933/B/main_input3.txt
new file mode 100644
index 0000000..2343d1c
--- /dev/null
+++ b/contests/Round933/B/main_input3.txt
@@ -0,0 +1,3 @@
+1
+5
+0 1 2 1 0
\ No newline at end of file
diff --git a/contests/Round933/B/main_input4.txt b/contests/Round933/B/main_input4.txt
new file mode 100644
index 0000000..08c4b02
--- /dev/null
+++ b/contests/Round933/B/main_input4.txt
@@ -0,0 +1,3 @@
+1
+7
+0 0 1 2 1 0 0
\ No newline at end of file
diff --git a/contests/Round933/B/main_input5.txt b/contests/Round933/B/main_input5.txt
new file mode 100644
index 0000000..a12c920
--- /dev/null
+++ b/contests/Round933/B/main_input5.txt
@@ -0,0 +1,3 @@
+1
+6
+0 0 1 2 1 0
\ No newline at end of file
diff --git a/contests/Round933/B/main_input6.txt b/contests/Round933/B/main_input6.txt
new file mode 100644
index 0000000..c5c8724
--- /dev/null
+++ b/contests/Round933/B/main_input6.txt
@@ -0,0 +1,3 @@
+1
+5
+0 2 4 2 0
\ No newline at end of file
diff --git a/contests/Round933/B/main_input7.txt b/contests/Round933/B/main_input7.txt
new file mode 100644
index 0000000..fa13f69
--- /dev/null
+++ b/contests/Round933/B/main_input7.txt
@@ -0,0 +1,3 @@
+1
+5
+0 3 4 2 0
\ No newline at end of file
diff --git a/contests/Round933/B/main_output0.txt b/contests/Round933/B/main_output0.txt
new file mode 100644
index 0000000..c5bec53
--- /dev/null
+++ b/contests/Round933/B/main_output0.txt
@@ -0,0 +1,7 @@
+YES
+NO
+YES
+NO
+NO
+NO
+NO
diff --git a/contests/Round933/B/main_output1.txt b/contests/Round933/B/main_output1.txt
new file mode 100644
index 0000000..d2bb323
--- /dev/null
+++ b/contests/Round933/B/main_output1.txt
@@ -0,0 +1 @@
+YES
\ No newline at end of file
diff --git a/contests/Round933/B/main_output2.txt b/contests/Round933/B/main_output2.txt
new file mode 100644
index 0000000..d2bb323
--- /dev/null
+++ b/contests/Round933/B/main_output2.txt
@@ -0,0 +1 @@
+YES
\ No newline at end of file
diff --git a/contests/Round933/B/main_output3.txt b/contests/Round933/B/main_output3.txt
new file mode 100644
index 0000000..d2bb323
--- /dev/null
+++ b/contests/Round933/B/main_output3.txt
@@ -0,0 +1 @@
+YES
\ No newline at end of file
diff --git a/contests/Round933/B/main_output4.txt b/contests/Round933/B/main_output4.txt
new file mode 100644
index 0000000..d2bb323
--- /dev/null
+++ b/contests/Round933/B/main_output4.txt
@@ -0,0 +1 @@
+YES
\ No newline at end of file
diff --git a/contests/Round933/B/main_output5.txt b/contests/Round933/B/main_output5.txt
new file mode 100644
index 0000000..d2bb323
--- /dev/null
+++ b/contests/Round933/B/main_output5.txt
@@ -0,0 +1 @@
+YES
\ No newline at end of file
diff --git a/contests/Round933/B/main_output6.txt b/contests/Round933/B/main_output6.txt
new file mode 100644
index 0000000..d2bb323
--- /dev/null
+++ b/contests/Round933/B/main_output6.txt
@@ -0,0 +1 @@
+YES
\ No newline at end of file
diff --git a/contests/Round933/B/main_output7.txt b/contests/Round933/B/main_output7.txt
new file mode 100644
index 0000000..ba28208
--- /dev/null
+++ b/contests/Round933/B/main_output7.txt
@@ -0,0 +1 @@
+NO
\ No newline at end of file
diff --git a/contests/Round933/C/main.cpp b/contests/Round933/C/main.cpp
new file mode 100755
index 0000000..5a66e2c
--- /dev/null
+++ b/contests/Round933/C/main.cpp
@@ -0,0 +1,75 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+using ll = long long;
+using pii = pair<int, int>;
+using vpii = vector<pii>;
+using vi = vector<int>;
+using vll = vector<long long>;
+using mpii = map<int, int>;
+using mpll = map<ll, ll>;
+using db = long double;
+
+#define pb push_back
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+#define lb lower_bound
+#define ub upper_bound
+#define make_unique(x)                                                         \
+  sort(all((x)));                                                              \
+  (x).resize(unique(all((x))) - (x).begin())
+#define ceil(a, b) ((a) + (b)-1) / (b)
+
+const int mod = (int)1e9 + 7;
+const db pi = acos((db)-1);
+const int dx[4]{1, 0, -1, 0};
+const int dy[4]{0, 1, 0, -1};
+
+#ifdef LOCAL
+#include "debug.h"
+#else
+#define dbg(...) 42
+#endif
+
+/* stuff you should look for:
+  ---------------------------
+   * special cases (n=1?)
+   * int overflow, array bounds
+   * do smth instead of nothing and stay organized
+   * WRITE STUFF DOWN
+   * DON'T GET STUCK ON ONE APPROACH
+ */
+
+void solve() {
+  int n;
+  cin >> n;
+  string s;
+  cin >> s;
+  int cnt = 0;
+  for (int i = 0; i < n; i++) {
+    if (s[i] == 'p') {
+      if (i > 1 && s[i - 1] == 'a' && s[i - 2] == 'm') {
+        cnt++;
+      }
+      if (i < n - 2 && s[i + 1] == 'i' && s[i + 2] == 'e') {
+        cnt++;
+      }
+      if (i < n - 2 && (s[i + 1] == 'i' && s[i + 2] == 'e') &&
+          (s[i - 1] == 'a' && s[i - 2] == 'm')) {
+        cnt--;
+      }
+    }
+  }
+  cout << cnt << '\n';
+}
+
+int main() {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while (tt--) {
+    solve();
+  }
+}
diff --git a/contests/Round933/C/main_input0.txt b/contests/Round933/C/main_input0.txt
new file mode 100644
index 0000000..00c0620
--- /dev/null
+++ b/contests/Round933/C/main_input0.txt
@@ -0,0 +1,13 @@
+6
+9
+mmapnapie
+9
+azabazapi
+8
+mappppie
+18
+mapmapmapmapmapmap
+1
+p
+11
+pppiepieeee
diff --git a/contests/Round933/C/main_input1.txt b/contests/Round933/C/main_input1.txt
new file mode 100644
index 0000000..50c7ecb
--- /dev/null
+++ b/contests/Round933/C/main_input1.txt
@@ -0,0 +1,3 @@
+1
+5
+mapie
\ No newline at end of file
diff --git a/contests/Round933/C/main_output0.txt b/contests/Round933/C/main_output0.txt
new file mode 100644
index 0000000..b4f2215
--- /dev/null
+++ b/contests/Round933/C/main_output0.txt
@@ -0,0 +1,6 @@
+2
+0
+2
+6
+0
+2
diff --git a/contests/Round933/C/main_output1.txt b/contests/Round933/C/main_output1.txt
new file mode 100644
index 0000000..56a6051
--- /dev/null
+++ b/contests/Round933/C/main_output1.txt
@@ -0,0 +1 @@
+1
\ No newline at end of file