Solved 5 more problems

34 files changed, 1246 insertions, 0 deletions

diff --git a/codeforces/ArpaAndAResearchInMexicanWave/main b/codeforces/ArpaAndAResearchInMexicanWave/main
new file mode 100755
index 0000000..3d76aab
--- /dev/null
+++ b/codeforces/ArpaAndAResearchInMexicanWave/main
diff --git a/codeforces/ArpaAndAResearchInMexicanWave/main.cpp b/codeforces/ArpaAndAResearchInMexicanWave/main.cpp
new file mode 100644
index 0000000..9d26e81
--- /dev/null
+++ b/codeforces/ArpaAndAResearchInMexicanWave/main.cpp
@@ -0,0 +1,93 @@
+#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 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
+
+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};
+
+//pretty printing
+template<typename K, typename V>
+void printm(const map<K, V> &mp) {
+  cerr << "{" << endl;
+  for (auto p : mp) {
+    cerr << "  { " << p.first << " : " << p.second << " }\n";
+  }
+  cerr << "}" << endl;
+}
+template<typename T>
+void printv(const vector<T> &v) {
+  cerr << "[";
+  for (int i = 0; i < v.size(); i++) {
+    if (i == v.size() - 1) {
+      cerr << v[i];
+    } else {
+      cerr << v[i] << ", ";
+    }
+  }
+  cerr << "]\n";
+}
+
+template<typename T>
+void printvv(const vector<vector<T>> &v) {
+  cerr << "[\n";
+  for (auto &vec : v) {
+    cout << "  ";
+    printv(vec);
+  }
+  cerr << "]\n";
+}
+void print() {
+  cerr << "\n";
+}
+
+template<typename T, typename... TS>
+void print(T val, TS... vals) {
+  cerr << val << " ";
+  print(vals...);
+}
+
+
+/* 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, k, t;
+  cin >> n >> k >> t;
+  if (t < k) {
+    cout << t << '\n';
+  } else if (t >= k && t <= n){
+    cout << k << '\n';
+  } else {
+    cout << (n + k) - t << '\n';
+  }
+}
+
+int main () {
+	ios_base::sync_with_stdio(false);
+	cin.tie(NULL);
+  solve();
+}
+
+
diff --git a/codeforces/ArpaAndAResearchInMexicanWave/main_input0.txt b/codeforces/ArpaAndAResearchInMexicanWave/main_input0.txt
new file mode 100644
index 0000000..c07bf2e
--- /dev/null
+++ b/codeforces/ArpaAndAResearchInMexicanWave/main_input0.txt
@@ -0,0 +1 @@
+10 5 3
diff --git a/codeforces/ArpaAndAResearchInMexicanWave/main_input1.txt b/codeforces/ArpaAndAResearchInMexicanWave/main_input1.txt
new file mode 100644
index 0000000..bf9ac57
--- /dev/null
+++ b/codeforces/ArpaAndAResearchInMexicanWave/main_input1.txt
@@ -0,0 +1 @@
+10 5 7
diff --git a/codeforces/ArpaAndAResearchInMexicanWave/main_input2.txt b/codeforces/ArpaAndAResearchInMexicanWave/main_input2.txt
new file mode 100644
index 0000000..b0c4455
--- /dev/null
+++ b/codeforces/ArpaAndAResearchInMexicanWave/main_input2.txt
@@ -0,0 +1 @@
+10 5 12
diff --git a/codeforces/ArpaAndAResearchInMexicanWave/main_output0.txt b/codeforces/ArpaAndAResearchInMexicanWave/main_output0.txt
new file mode 100644
index 0000000..00750ed
--- /dev/null
+++ b/codeforces/ArpaAndAResearchInMexicanWave/main_output0.txt
@@ -0,0 +1 @@
+3
diff --git a/codeforces/ArpaAndAResearchInMexicanWave/main_output1.txt b/codeforces/ArpaAndAResearchInMexicanWave/main_output1.txt
new file mode 100644
index 0000000..7ed6ff8
--- /dev/null
+++ b/codeforces/ArpaAndAResearchInMexicanWave/main_output1.txt
@@ -0,0 +1 @@
+5
diff --git a/codeforces/ArpaAndAResearchInMexicanWave/main_output2.txt b/codeforces/ArpaAndAResearchInMexicanWave/main_output2.txt
new file mode 100644
index 0000000..00750ed
--- /dev/null
+++ b/codeforces/ArpaAndAResearchInMexicanWave/main_output2.txt
@@ -0,0 +1 @@
+3
diff --git a/codeforces/DoremyPaint/main.cpp b/codeforces/DoremyPaint/main.cpp
new file mode 100644
index 0000000..6f7ea61
--- /dev/null
+++ b/codeforces/DoremyPaint/main.cpp
@@ -0,0 +1,95 @@
+#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 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
+
+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};
+
+//pretty printing
+template<typename K, typename V>
+void printm(const map<K, V> &mp) {
+  cerr << "{" << endl;
+  for (auto p : mp) {
+    cerr << "  { " << p.first << " : " << p.second << " }\n";
+  }
+  cerr << "}" << endl;
+}
+template<typename T>
+void printv(const vector<T> &v) {
+  cerr << "[";
+  for (int i = 0; i < v.size(); i++) {
+    if (i == v.size() - 1) {
+      cerr << v[i];
+    } else {
+      cerr << v[i] << ", ";
+    }
+  }
+  cerr << "]\n";
+}
+
+template<typename T>
+void printvv(const vector<vector<T>> &v) {
+  cerr << "[\n";
+  for (auto &vec : v) {
+    cout << "  ";
+    printv(vec);
+  }
+  cerr << "]\n";
+}
+void print() {
+  cerr << "\n";
+}
+
+template<typename T, typename... TS>
+void print(T val, TS... vals) {
+  cerr << val << " ";
+  print(vals...);
+}
+
+
+/* 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;
+  for (int i = 0; i < n; i++) {
+    int x;
+    cin >> x;
+  }
+  cout << 1 << " " << n << '\n';
+}
+
+int main () {
+	ios_base::sync_with_stdio(false);
+	cin.tie(NULL);
+	int tt;
+	cin >> tt;
+	while(tt--) {
+    solve();
+	}
+}
+
+
diff --git a/codeforces/DoremyPerfectMathClass/main b/codeforces/DoremyPerfectMathClass/main
new file mode 100755
index 0000000..37b7ed1
--- /dev/null
+++ b/codeforces/DoremyPerfectMathClass/main
diff --git a/codeforces/DoremyPerfectMathClass/main.cpp b/codeforces/DoremyPerfectMathClass/main.cpp
new file mode 100644
index 0000000..fe43cbd
--- /dev/null
+++ b/codeforces/DoremyPerfectMathClass/main.cpp
@@ -0,0 +1,96 @@
+#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 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
+
+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};
+
+//pretty printing
+template<typename K, typename V>
+void printm(const map<K, V> &mp) {
+  cerr << "{" << endl;
+  for (auto p : mp) {
+    cerr << "  { " << p.first << " : " << p.second << " }\n";
+  }
+  cerr << "}" << endl;
+}
+template<typename T>
+void printv(const vector<T> &v) {
+  cerr << "[";
+  for (int i = 0; i < v.size(); i++) {
+    if (i == v.size() - 1) {
+      cerr << v[i];
+    } else {
+      cerr << v[i] << ", ";
+    }
+  }
+  cerr << "]\n";
+}
+
+template<typename T>
+void printvv(const vector<vector<T>> &v) {
+  cerr << "[\n";
+  for (auto &vec : v) {
+    cout << "  ";
+    printv(vec);
+  }
+  cerr << "]\n";
+}
+void print() {
+  cerr << "\n";
+}
+
+template<typename T, typename... TS>
+void print(T val, TS... vals) {
+  cerr << val << " ";
+  print(vals...);
+}
+
+/* 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;
+  int x;
+  int g = 0;
+  for (int i = 0; i < n; i++) {
+    cin >> x;
+    g = __gcd(g, x);
+  }
+  cout << x / g << '\n';
+}
+
+int main () {
+	ios_base::sync_with_stdio(false);
+	cin.tie(NULL);
+	int tt;
+	cin >> tt;
+	while(tt--) {
+    solve();
+	}
+}
+
+
diff --git a/codeforces/DoremyPerfectMathClass/main_input0.txt b/codeforces/DoremyPerfectMathClass/main_input0.txt
new file mode 100644
index 0000000..b5123de
--- /dev/null
+++ b/codeforces/DoremyPerfectMathClass/main_input0.txt
@@ -0,0 +1,5 @@
+2
+2
+1 2
+3
+5 10 25
diff --git a/codeforces/DoremyPerfectMathClass/main_output0.txt b/codeforces/DoremyPerfectMathClass/main_output0.txt
new file mode 100644
index 0000000..49ae94b
--- /dev/null
+++ b/codeforces/DoremyPerfectMathClass/main_output0.txt
@@ -0,0 +1,2 @@
+2
+5
diff --git a/codeforces/PhoenixAndBalance/main b/codeforces/PhoenixAndBalance/main
new file mode 100755
index 0000000..09351ca
--- /dev/null
+++ b/codeforces/PhoenixAndBalance/main
diff --git a/codeforces/PhoenixAndBalance/main.cpp b/codeforces/PhoenixAndBalance/main.cpp
new file mode 100644
index 0000000..be824f3
--- /dev/null
+++ b/codeforces/PhoenixAndBalance/main.cpp
@@ -0,0 +1,108 @@
+#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 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
+
+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};
+
+//pretty printing
+template<typename K, typename V>
+void printm(const map<K, V> &mp) {
+  cerr << "{" << endl;
+  for (auto p : mp) {
+    cerr << "  { " << p.first << " : " << p.second << " }\n";
+  }
+  cerr << "}" << endl;
+}
+template<typename T>
+void printv(const vector<T> &v) {
+  cerr << "[";
+  for (int i = 0; i < v.size(); i++) {
+    if (i == v.size() - 1) {
+      cerr << v[i];
+    } else {
+      cerr << v[i] << ", ";
+    }
+  }
+  cerr << "]\n";
+}
+
+template<typename T>
+void printvv(const vector<vector<T>> &v) {
+  cerr << "[\n";
+  for (auto &vec : v) {
+    cout << "  ";
+    printv(vec);
+  }
+  cerr << "]\n";
+}
+void print() {
+  cerr << "\n";
+}
+
+template<typename T, typename... TS>
+void print(T val, TS... vals) {
+  cerr << val << " ";
+  print(vals...);
+}
+
+
+/* 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;
+  vi v(n);
+  for (int i = 1; i < n + 1; i++) {
+    v[i - 1] = pow(2, i);
+  }
+  if (n > 2) {
+    int sum1 = v[n - 1];
+    int sum2 = 0;
+    for (int i = 0; i < (n / 2) - 1; i++) {
+      sum1 += v[i];
+    }
+    for (int i = (n / 2) - 1; i < n - 1; i++) {
+      sum2 += v[i];
+    }
+    cout << abs(sum1 - sum2) << '\n';
+  } else {
+    cout << 2 << '\n';
+  }
+
+}
+
+int main () {
+	ios_base::sync_with_stdio(false);
+	cin.tie(NULL);
+	int tt;
+	cin >> tt;
+	while(tt--) {
+    solve();
+	}
+}
+
+
diff --git a/codeforces/PhoenixAndBalance/main_input0.txt b/codeforces/PhoenixAndBalance/main_input0.txt
new file mode 100644
index 0000000..b0f38d1
--- /dev/null
+++ b/codeforces/PhoenixAndBalance/main_input0.txt
@@ -0,0 +1,3 @@
+2
+2
+4
diff --git a/codeforces/PhoenixAndBalance/main_output0.txt b/codeforces/PhoenixAndBalance/main_output0.txt
new file mode 100644
index 0000000..2b24e31
--- /dev/null
+++ b/codeforces/PhoenixAndBalance/main_output0.txt
@@ -0,0 +1,2 @@
+2
+6
diff --git a/codeforces/SeeingDouble/main b/codeforces/SeeingDouble/main
new file mode 100755
index 0000000..a231dcd
--- /dev/null
+++ b/codeforces/SeeingDouble/main
diff --git a/codeforces/SeeingDouble/main.cpp b/codeforces/SeeingDouble/main.cpp
new file mode 100644
index 0000000..3ae4c48
--- /dev/null
+++ b/codeforces/SeeingDouble/main.cpp
@@ -0,0 +1,92 @@
+#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 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
+
+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};
+
+//pretty printing
+template<typename K, typename V>
+void printm(const map<K, V> &mp) {
+  cerr << "{" << endl;
+  for (auto p : mp) {
+    cerr << "  { " << p.first << " : " << p.second << " }\n";
+  }
+  cerr << "}" << endl;
+}
+template<typename T>
+void printv(const vector<T> &v) {
+  cerr << "[";
+  for (int i = 0; i < v.size(); i++) {
+    if (i == v.size() - 1) {
+      cerr << v[i];
+    } else {
+      cerr << v[i] << ", ";
+    }
+  }
+  cerr << "]\n";
+}
+
+template<typename T>
+void printvv(const vector<vector<T>> &v) {
+  cerr << "[\n";
+  for (auto &vec : v) {
+    cout << "  ";
+    printv(vec);
+  }
+  cerr << "]\n";
+}
+void print() {
+  cerr << "\n";
+}
+
+template<typename T, typename... TS>
+void print(T val, TS... vals) {
+  cerr << val << " ";
+  print(vals...);
+}
+
+
+/* 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() {
+  string s, inv;
+  cin >> s;
+  inv = string(rall(s));
+  cout << s + inv << '\n';
+}
+
+int main () {
+	ios_base::sync_with_stdio(false);
+	cin.tie(NULL);
+	int tt;
+	cin >> tt;
+	while(tt--) {
+    solve();
+	}
+}
+
+
diff --git a/codeforces/SeeingDouble/main_input0.txt b/codeforces/SeeingDouble/main_input0.txt
new file mode 100644
index 0000000..fab3e3c
--- /dev/null
+++ b/codeforces/SeeingDouble/main_input0.txt
@@ -0,0 +1,5 @@
+4
+a
+sururu
+errorgorn
+anutforajaroftuna
diff --git a/codeforces/SeeingDouble/main_output0.txt b/codeforces/SeeingDouble/main_output0.txt
new file mode 100644
index 0000000..2b145df
--- /dev/null
+++ b/codeforces/SeeingDouble/main_output0.txt
@@ -0,0 +1,4 @@
+aa
+suurruurruus
+rgnororerrerorongr
+aannuuttffoorraajjaarrooffttuunnaa
diff --git a/codeforces/XorAverage/main b/codeforces/XorAverage/main
new file mode 100755
index 0000000..15d63b2
--- /dev/null
+++ b/codeforces/XorAverage/main
diff --git a/codeforces/XorAverage/main.cpp b/codeforces/XorAverage/main.cpp
new file mode 100644
index 0000000..9f3f41a
--- /dev/null
+++ b/codeforces/XorAverage/main.cpp
@@ -0,0 +1,100 @@
+#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 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
+
+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};
+
+//pretty printing
+template<typename K, typename V>
+void printm(const map<K, V> &mp) {
+  cerr << "{" << endl;
+  for (auto p : mp) {
+    cerr << "  { " << p.first << " : " << p.second << " }\n";
+  }
+  cerr << "}" << endl;
+}
+template<typename T>
+void printv(const vector<T> &v) {
+  cerr << "[";
+  for (int i = 0; i < v.size(); i++) {
+    if (i == v.size() - 1) {
+      cerr << v[i];
+    } else {
+      cerr << v[i] << ", ";
+    }
+  }
+  cerr << "]\n";
+}
+
+template<typename T>
+void printvv(const vector<vector<T>> &v) {
+  cerr << "[\n";
+  for (auto &vec : v) {
+    cout << "  ";
+    printv(vec);
+  }
+  cerr << "]\n";
+}
+void print() {
+  cerr << "\n";
+}
+
+template<typename T, typename... TS>
+void print(T val, TS... vals) {
+  cerr << val << " ";
+  print(vals...);
+}
+
+
+/* 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;
+  if (n & 1) {
+    for (int i = 0; i < n; i++) {
+      cout << 7 << " \n"[i == n - 1];
+    }
+  } else {
+    for (int i = 0; i < n - 2; i++) {
+      cout << 10 << " ";
+    }
+    cout << 13 << " " << 7 << '\n';
+  }
+}
+
+int main () {
+	ios_base::sync_with_stdio(false);
+	cin.tie(NULL);
+	int tt;
+	cin >> tt;
+	while(tt--) {
+    solve();
+	}
+}
+
+
diff --git a/codeforces/XorAverage/main_input0.txt b/codeforces/XorAverage/main_input0.txt
new file mode 100644
index 0000000..3f175ca
--- /dev/null
+++ b/codeforces/XorAverage/main_input0.txt
@@ -0,0 +1,4 @@
+3
+1
+4
+3
diff --git a/codeforces/XorAverage/main_output0.txt b/codeforces/XorAverage/main_output0.txt
new file mode 100644
index 0000000..aa91d9c
--- /dev/null
+++ b/codeforces/XorAverage/main_output0.txt
@@ -0,0 +1,3 @@
+69
+13 2 8 1
+7 7 7
diff --git a/contests/R_825/A/main b/contests/R_825/A/main
new file mode 100755
index 0000000..5f28c0e
--- /dev/null
+++ b/contests/R_825/A/main
diff --git a/contests/R_825/A/main.cpp b/contests/R_825/A/main.cpp
new file mode 100644
index 0000000..958e0e4
--- /dev/null
+++ b/contests/R_825/A/main.cpp
@@ -0,0 +1,162 @@
+#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 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
+
+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};
+
+//pretty printing
+template<typename K, typename V>
+void printm(const map<K, V> &mp) {
+  cerr << "{" << endl;
+  for (auto p : mp) {
+    cerr << "  { " << p.first << " : " << p.second << " }\n";
+  }
+  cerr << "}" << endl;
+}
+template<typename T>
+void printv(const vector<T> &v) {
+  cerr << "[";
+  for (int i = 0; i < v.size(); i++) {
+    if (i == v.size() - 1) {
+      cerr << v[i];
+    } else {
+      cerr << v[i] << ", ";
+    }
+  }
+  cerr << "]\n";
+}
+
+template<typename T>
+void printvv(const vector<vector<T>> &v) {
+  cerr << "[\n";
+  for (auto &vec : v) {
+    cout << "  ";
+    printv(vec);
+  }
+  cerr << "]\n";
+}
+void print() {
+  cerr << "\n";
+}
+
+template<typename T, typename... TS>
+void print(T val, TS... vals) {
+  cerr << val << " ";
+  print(vals...);
+}
+
+
+/* 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
+ */
+
+bool isSame(const vi &v1, const vi &v2) {
+  for (int i = 0; i < v1.size(); i++) {
+    if (v1[i] != v2[i]) {
+      return false;
+    }
+  }
+  return true;
+}
+
+bool isEqual(vi &v1, vi &v2) {
+  int o1 = 0, o2 = 0;
+  for (int i = 0; i < v1.size(); i++) {
+    o1 += v1[i];
+    o2 += v2[i];
+  }
+  return o1 == o2;
+}
+
+int getIndexZrs(vi &v1, vi &v2) {
+  for (int i = 0; i < v1.size(); i++) {
+    if (v1[i] != v2[i] && v1[i] == 0) {
+      return i;
+    }
+  }
+  return -1;
+}
+
+int getIndexOnes(vi &v1, vi &v2) {
+  for (int i = 0; i < v1.size(); i++) {
+    if (v1[i] != v2[i] && v1[i] == 1) {
+      return i;
+    }
+  }
+  return -1;
+}
+
+int getOnes(vi &v) {
+  int ones = 0;
+  for (auto x : v) {
+    ones += x;
+  }
+  return ones;
+}
+
+void solve() {
+  int n;
+  cin >> n;
+  vi v1(n), v2(n);
+  for (auto &x : v1) cin >> x;
+  for (auto &x : v2) cin >> x;
+  int o1 = getOnes(v1);
+  int o2 = getOnes(v2);
+  if (isSame(v1, v2)) {
+    cout << 0 << '\n';
+  } else if(isEqual(v1, v2) && !isSame(v1, v2)) {
+    cout << 1 << '\n';
+  } else if(o1 > o2) {
+    while(!isEqual(v1, v2)) {
+      v2[getIndexOnes(v1, v2)] = 1;
+    }
+    if (isSame(v1, v2)) {
+      cout << o1 - o2 << '\n';
+    } else {
+      cout << o1 - o2 + 1 << '\n';
+    }
+  } else if (o2 > o1) {
+    while(!isEqual(v1, v2)) {
+      v1[getIndexZrs(v1, v2)] = 1;
+    }
+    if (isSame(v1, v2)) {
+      cout << o2 - o1 << '\n';
+    } else {
+      cout << o2 - o1 + 1 << '\n';
+    }
+  }
+}
+
+int main () {
+	ios_base::sync_with_stdio(false);
+	cin.tie(NULL);
+	int tt;
+	cin >> tt;
+	while(tt--) {
+    solve();
+	}
+}
+