From 65cbc4732866264a930f30d948f7258f6dde7497 Mon Sep 17 00:00:00 2001
From: omagdy7 <omar.professional8777@gmail.com>
Date: Mon, 14 Nov 2022 12:16:09 +0200
Subject: Added new problems

---
 codeforces/TechnicalSupport/main             | Bin 0 -> 24096 bytes
 codeforces/TechnicalSupport/main.cpp         |  58 +++++++++++++++++++++++++++
 codeforces/TechnicalSupport/main_input0.txt  |  11 +++++
 codeforces/TechnicalSupport/main_output0.txt |   5 +++
 4 files changed, 74 insertions(+)
 create mode 100755 codeforces/TechnicalSupport/main
 create mode 100644 codeforces/TechnicalSupport/main.cpp
 create mode 100644 codeforces/TechnicalSupport/main_input0.txt
 create mode 100644 codeforces/TechnicalSupport/main_output0.txt

(limited to 'codeforces/TechnicalSupport')

diff --git a/codeforces/TechnicalSupport/main b/codeforces/TechnicalSupport/main
new file mode 100755
index 0000000..06b1637
Binary files /dev/null and b/codeforces/TechnicalSupport/main differ
diff --git a/codeforces/TechnicalSupport/main.cpp b/codeforces/TechnicalSupport/main.cpp
new file mode 100644
index 0000000..57e8dd3
--- /dev/null
+++ b/codeforces/TechnicalSupport/main.cpp
@@ -0,0 +1,58 @@
+#include<bits/stdc++.h>
+
+using namespace std;
+
+using ll = long long;
+using pi = pair<int, int>;
+using vpi = vector<pi>;
+using vi = vector<int>;
+using vll = vector<long long>;
+using mpii = map<int, int>;
+using mpll = map<ll, ll>;
+using db = long double;
+
+#define push_back pb
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+#define lb lower_bound
+#define ub upper_bound
+
+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};
+
+void solve() {
+  int n;
+  cin >> n;
+  string s;
+  cin >> s;
+  int cnt = 0;
+  for (auto ch : s) {
+    if (ch == 'A') {
+      cnt = max(cnt - 1, 0);
+    } else if (ch == 'Q') {
+      cnt++;
+    }
+  }
+  cout << (cnt == 0 ? "Yes" : "No") << '\n';
+}
+
+int main () {
+	ios_base::sync_with_stdio(false);
+	cin.tie(NULL);
+	int tt;
+	cin >> tt;
+	while(tt--) {
+    solve();
+	}
+}
+
+/* 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
+ */
diff --git a/codeforces/TechnicalSupport/main_input0.txt b/codeforces/TechnicalSupport/main_input0.txt
new file mode 100644
index 0000000..9f27501
--- /dev/null
+++ b/codeforces/TechnicalSupport/main_input0.txt
@@ -0,0 +1,11 @@
+5
+4
+QQAA
+4
+QQAQ
+3
+QAA
+1
+Q
+14
+QAQQAQAAQQQAAA
diff --git a/codeforces/TechnicalSupport/main_output0.txt b/codeforces/TechnicalSupport/main_output0.txt
new file mode 100644
index 0000000..0705ef5
--- /dev/null
+++ b/codeforces/TechnicalSupport/main_output0.txt
@@ -0,0 +1,5 @@
+Yes
+No
+Yes
+No
+Yes
-- 
cgit v1.2.3