Removed some empty *.cpp files and Solved some new problems

44 files changed, 0 insertions, 1280 deletions

diff --git a/contests/Round#849(Div4)/A/main b/contests/Round#849(Div4)/A/main
deleted file mode 100755
index 3e81677..0000000
--- a/contests/Round#849(Div4)/A/main
+++ /dev/null
diff --git a/contests/Round#849(Div4)/A/main.cpp b/contests/Round#849(Div4)/A/main.cpp
deleted file mode 100755
index aa30531..0000000
--- a/contests/Round#849(Div4)/A/main.cpp
+++ /dev/null
@@ -1,92 +0,0 @@
-#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 haystack = "codeforces";
-  char ch;
-  cin >> ch;
-  cout << (count(all(haystack), ch) ? "YES" : "NO") << '\n';
-}
-
-int main () {
-  ios_base::sync_with_stdio(false);
-  cin.tie(NULL);
-  int tt;
-  cin >> tt;
-  while(tt--) {
-    solve();
-  }
-}
-
-
diff --git a/contests/Round#849(Div4)/A/main_input0.txt b/contests/Round#849(Div4)/A/main_input0.txt
deleted file mode 100644
index 9d71f59..0000000
--- a/contests/Round#849(Div4)/A/main_input0.txt
+++ /dev/null
@@ -1,11 +0,0 @@
-10
-a
-b
-c
-d
-e
-f
-g
-h
-i
-j
diff --git a/contests/Round#849(Div4)/A/main_output0.txt b/contests/Round#849(Div4)/A/main_output0.txt
deleted file mode 100644
index 6df8a46..0000000
--- a/contests/Round#849(Div4)/A/main_output0.txt
+++ /dev/null
@@ -1,10 +0,0 @@
-NO
-NO
-YES
-YES
-YES
-YES
-NO
-NO
-NO
-NO
diff --git a/contests/Round#849(Div4)/B/main b/contests/Round#849(Div4)/B/main
deleted file mode 100755
index 24928cb..0000000
--- a/contests/Round#849(Div4)/B/main
+++ /dev/null
diff --git a/contests/Round#849(Div4)/B/main.cpp b/contests/Round#849(Div4)/B/main.cpp
deleted file mode 100755
index da40ca0..0000000
--- a/contests/Round#849(Div4)/B/main.cpp
+++ /dev/null
@@ -1,122 +0,0 @@
-#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
- */
-
-struct Point {
-  int x;
-  int y;
-  Point(int x, int y) {
-    this->x = x;
-    this->y = y;
-  }
-};
-
-void solve() {
-  Point p(0, 0);
-  int n;
-  cin >> n;
-  string str;
-  cin >> str;
-  for (auto ch: str) {
-    if(ch == 'U') {
-      p.y++;
-    }
-    else if(ch == 'D') {
-      p.y--;
-    }
-    else if(ch == 'R') {
-      p.x++;
-    }
-    else if(ch == 'L') {
-      p.x--;
-    }
-
-    if (p.x == 1 && p.y == 1) {
-      cout << "YES" << '\n';
-      return;
-    }
-  }
-  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/Round#849(Div4)/B/main_input0.txt b/contests/Round#849(Div4)/B/main_input0.txt
deleted file mode 100644
index bca5a3e..0000000
--- a/contests/Round#849(Div4)/B/main_input0.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-7
-7
-UUURDDL
-2
-UR
-8
-RRRUUDDD
-3
-LLL
-4
-DUUR
-5
-RUDLL
-11
-LLLLDDRUDRD
diff --git a/contests/Round#849(Div4)/B/main_output0.txt b/contests/Round#849(Div4)/B/main_output0.txt
deleted file mode 100644
index 4699a2d..0000000
--- a/contests/Round#849(Div4)/B/main_output0.txt
+++ /dev/null
@@ -1,7 +0,0 @@
-YES
-YES
-NO
-NO
-YES
-YES
-NO
diff --git a/contests/Round#849(Div4)/C/main b/contests/Round#849(Div4)/C/main
deleted file mode 100755
index 7f05022..0000000
--- a/contests/Round#849(Div4)/C/main
+++ /dev/null
diff --git a/contests/Round#849(Div4)/C/main.cpp b/contests/Round#849(Div4)/C/main.cpp
deleted file mode 100755
index 91c1a12..0000000
--- a/contests/Round#849(Div4)/C/main.cpp
+++ /dev/null
@@ -1,105 +0,0 @@
-#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
- */
-
-int countPairs(string &str) {
-  int cnt = 0;
-  for (int i = 0; i < str.length() / 2; i++) {
-    if (str[i] != str[str.length() - 1 - i]) {
-      cnt++;
-    } else {
-      break;
-    }
-  }
-  return cnt;
-}
-
-void solve() {
-  int n;
-  cin >> n;
-  string str;
-  cin >> str;
-  cout << str.length() - 2 * countPairs(str) << '\n';
-}
-
-int main () {
-  ios_base::sync_with_stdio(false);
-  cin.tie(NULL);
-  int tt;
-  cin >> tt;
-  while(tt--) {
-    solve();
-  }
-}
-
-
diff --git a/contests/Round#849(Div4)/C/main_input0.txt b/contests/Round#849(Div4)/C/main_input0.txt
deleted file mode 100644
index b07910f..0000000
--- a/contests/Round#849(Div4)/C/main_input0.txt
+++ /dev/null
@@ -1,19 +0,0 @@
-9
-3
-100
-4
-0111
-5
-10101
-6
-101010
-7
-1010110
-1
-1
-2
-10
-2
-11
-10
-1011011010
diff --git a/contests/Round#849(Div4)/C/main_output0.txt b/contests/Round#849(Div4)/C/main_output0.txt
deleted file mode 100644
index 89375dd..0000000
--- a/contests/Round#849(Div4)/C/main_output0.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-1
-2
-5
-0
-3
-1
-0
-2
-4
diff --git a/contests/Round#849(Div4)/D/main b/contests/Round#849(Div4)/D/main
deleted file mode 100755
index b59f7cc..0000000
--- a/contests/Round#849(Div4)/D/main
+++ /dev/null
diff --git a/contests/Round#849(Div4)/D/main.cpp b/contests/Round#849(Div4)/D/main.cpp
deleted file mode 100755
index 9e9da38..0000000
--- a/contests/Round#849(Div4)/D/main.cpp
+++ /dev/null
@@ -1,104 +0,0 @@
-#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
- */
-
-// abcabcabc
-void solve() {
-  int n;
-  cin >> n;
-  string str;
-  cin >> str;
-  vi fq(27);
-  int split = 0;
-  for (int i = 0; i < n; i++) {
-    char ch = str[i];
-    fq[ch - 'a']++;
-    if (fq[ch - 'a'] > 1) {
-      split = i;
-      break;
-    }
-  }
-  cout << unordered_set<char>(str.begin(), str.begin() + split).size() + unordered_set<char>(str.begin() + split, str.end()).size() << '\n';
-}
-
-int main () {
-  ios_base::sync_with_stdio(false);
-  cin.tie(NULL);
-  int tt;
-  cin >> tt;
-  while(tt--) {
-    solve();
-  }
-}
-
-
diff --git a/contests/Round#849(Div4)/D/main_input0.txt b/contests/Round#849(Div4)/D/main_input0.txt
deleted file mode 100644
index 8d60cf9..0000000
--- a/contests/Round#849(Div4)/D/main_input0.txt
+++ /dev/null
@@ -1,11 +0,0 @@
-5
-2
-aa
-7
-abcabcd
-5
-aaaaa
-10
-paiumoment
-4
-aazz
diff --git a/contests/Round#849(Div4)/D/main_output0.txt b/contests/Round#849(Div4)/D/main_output0.txt
deleted file mode 100644
index 8162782..0000000
--- a/contests/Round#849(Div4)/D/main_output0.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-2
-7
-2
-10
-3
diff --git a/contests/Round#849(Div4)/E/main b/contests/Round#849(Div4)/E/main
deleted file mode 100755
index 6a259d3..0000000
--- a/contests/Round#849(Div4)/E/main
+++ /dev/null
diff --git a/contests/Round#849(Div4)/E/main.cpp b/contests/Round#849(Div4)/E/main.cpp
deleted file mode 100755
index d1605ce..0000000
--- a/contests/Round#849(Div4)/E/main.cpp
+++ /dev/null
@@ -1,124 +0,0 @@
-#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
- */
-
-/* 
- * Ideally we want them all to be positive
- * If we can't get them all to be positive we want to flip the largest numbers in absloute
- * The 0 can be a joker because flipping its sign is meaningless anyways
-*/
-
-void solve() {
-  int n;
-  cin >> n;
-  vll v(n);
-  for (auto &x : v) cin >> x;
-  int neg = 0;
-  for (auto x : v) {
-    neg += (x < 0);
-  }
-  ll sum = 0;
-  if (neg % 2 == 0) {
-    for (auto x : v) {
-      if (x < 0) {
-        sum += -x;
-      } else {
-        sum += x;
-      }
-    }
-  } else {
-    for (auto &x : v) {
-      if (x < 0) {
-        x = -x;
-      }
-    }
-    for (auto x : v) {
-      sum += x;
-    }
-    sum -= *min_element(all(v)) * 2;
-  }
-  cout << sum << '\n';
-
-}
-
-int main () {
-  ios_base::sync_with_stdio(false);
-  cin.tie(NULL);
-  int tt;
-  cin >> tt;
-  while(tt--) {
-    solve();
-  }
-}
-
-
diff --git a/contests/Round#849(Div4)/E/main_input0.txt b/contests/Round#849(Div4)/E/main_input0.txt
deleted file mode 100644
index 7111644..0000000
--- a/contests/Round#849(Div4)/E/main_input0.txt
+++ /dev/null
@@ -1,11 +0,0 @@
-5
-3
--1 -1 -1
-5
-1 5 -5 0 2
-3
-1 2 3
-6
--1 10 9 8 7 6
-2
--1 -1
diff --git a/contests/Round#849(Div4)/E/main_input1.txt b/contests/Round#849(Div4)/E/main_input1.txt
deleted file mode 100644
index 5285b38..0000000
--- a/contests/Round#849(Div4)/E/main_input1.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-1
-4
-1 -10 9 8
\ No newline at end of file
diff --git a/contests/Round#849(Div4)/E/main_input2.txt b/contests/Round#849(Div4)/E/main_input2.txt
deleted file mode 100644
index 028be5f..0000000
--- a/contests/Round#849(Div4)/E/main_input2.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-1
-7
--1 1 -1 1 -1 1 -1
\ No newline at end of file
diff --git a/contests/Round#849(Div4)/E/main_output0.txt b/contests/Round#849(Div4)/E/main_output0.txt
deleted file mode 100644
index 9ce57b7..0000000
--- a/contests/Round#849(Div4)/E/main_output0.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-1
-13
-6
-39
-2
diff --git a/contests/Round#849(Div4)/E/main_output1.txt b/contests/Round#849(Div4)/E/main_output1.txt
deleted file mode 100644
index a5c750f..0000000
--- a/contests/Round#849(Div4)/E/main_output1.txt
+++ /dev/null
@@ -1 +0,0 @@
-27
\ No newline at end of file
diff --git a/contests/Round#849(Div4)/E/main_output2.txt b/contests/Round#849(Div4)/E/main_output2.txt
deleted file mode 100644
index c793025..0000000
--- a/contests/Round#849(Div4)/E/main_output2.txt
+++ /dev/null
@@ -1 +0,0 @@
-7
\ No newline at end of file
diff --git a/contests/Round#849(Div4)/F/main b/contests/Round#849(Div4)/F/main
deleted file mode 100755
index ebe8061..0000000
--- a/contests/Round#849(Div4)/F/main
+++ /dev/null
diff --git a/contests/Round#849(Div4)/F/main.cpp b/contests/Round#849(Div4)/F/main.cpp
deleted file mode 100755
index 79a7299..0000000
--- a/contests/Round#849(Div4)/F/main.cpp
+++ /dev/null
@@ -1,114 +0,0 @@
-#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);
-  }