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

14 files changed, 0 insertions, 654 deletions

diff --git a/contests/Round#857/A/main b/contests/Round#857/A/main
deleted file mode 100755
index 162e13a..0000000
--- a/contests/Round#857/A/main
+++ /dev/null
diff --git a/contests/Round#857/A/main.cpp b/contests/Round#857/A/main.cpp
deleted file mode 100755
index baecf5a..0000000
--- a/contests/Round#857/A/main.cpp
+++ /dev/null
@@ -1,121 +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() {
-  int n;
-  cin >> n;
-  vi v(n);
-  int neg = 0;
-  for (int i = 0; i < n; i++) {
-    int x;
-    cin >> x;
-    v[i] = x;
-    neg += x < 0;
-  }
-  sort(rall(v));
-  int pos = 1;
-  for (int i = 0; i < n; i++) {
-    if (v[i] > 0) {
-      cout << pos << ' ';
-      pos++;
-    } else {
-      pos--;
-      cout << pos - 1 << ' ';
-    }
-  }
-  cout << '\n';
-  for (int i = 0; i < neg; i++) {
-    cout << 1 << ' ' << 0 << ' ';
-  }
-  for (int i = 0; i < n - neg * 2; i++) {
-    cout << i + 1 << ' ';
-   }
-  cout << '\n';
-
-
-
-
-}
-
-int main () {
-  ios_base::sync_with_stdio(false);
-  cin.tie(NULL);
-  int tt;
-  cin >> tt;
-  while(tt--) {
-    solve();
-  }
-}
-
-
diff --git a/contests/Round#857/A/main_input0.txt b/contests/Round#857/A/main_input0.txt
deleted file mode 100644
index edc0583..0000000
--- a/contests/Round#857/A/main_input0.txt
+++ /dev/null
@@ -1,11 +0,0 @@
-5
-3
-1 2 -2
-2
-1 -1
-6
-4 3 -1 2 1 -2
-5
-4 2 -2 1 3
-7
--1 6 -4 3 2 4 1
diff --git a/contests/Round#857/A/main_input1.txt b/contests/Round#857/A/main_input1.txt
deleted file mode 100644
index f439e9e..0000000
--- a/contests/Round#857/A/main_input1.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-1
-8
-1 -1 1 -1 1 -1 1 -1
\ No newline at end of file
diff --git a/contests/Round#857/A/main_output0.txt b/contests/Round#857/A/main_output0.txt
deleted file mode 100644
index d947087..0000000
--- a/contests/Round#857/A/main_output0.txt
+++ /dev/null
@@ -1,10 +0,0 @@
-1 2 1
-1 0 1
-1 0
-1 0
-1 2 3 4 3 2
-1 0 1 0 1 2
-1 2 3 4 3
-1 0 1 2 3
-1 2 3 4 5 4 3
-1 0 1 0 1 2 3
diff --git a/contests/Round#857/A/main_output1.txt b/contests/Round#857/A/main_output1.txt
deleted file mode 100644
index 5ba3329..0000000
--- a/contests/Round#857/A/main_output1.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-1 2 3 4 3 2 1 0
-1 0 1 0 1 0 1 0
\ No newline at end of file
diff --git a/contests/Round#857/B/main b/contests/Round#857/B/main
deleted file mode 100755
index fa8f5c5..0000000
--- a/contests/Round#857/B/main
+++ /dev/null
diff --git a/contests/Round#857/B/main.cpp b/contests/Round#857/B/main.cpp
deleted file mode 100755
index 324c05c..0000000
--- a/contests/Round#857/B/main.cpp
+++ /dev/null
@@ -1,132 +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
- */
-
-vi helper(vi &v) {
-  vi ret;
-  v.pb(2);
-  int x = 0;
-  for (int i = 0; i < v.size(); i++) {
-    if (v[i] == 1) {
-      x++;
-    } else {
-      if (x != 0)  {
-        ret.pb(x);
-      }
-      x = 0;
-    }
-  }
-  return ret;
-}
-
-// 10 2 3 4
-// max(1 + 10 / 2 + 2, 10)
-// max(1 + 12 / 2 + 3, 10)
-// max(1 + 15 / 2 + 4, 10)
-// max(1 + 15 / 2 + 4, 11)
-
-void solve() {
-  int n;
-  uint32_t x;
-  cin >> n;
-  vi v(n);
-  for (auto &x : v) cin >> x;
-  vi tmp = v;
-  vi ret = helper(tmp);
-  if(ret.size() == 0) {
-    cout << 0 << '\n';
-    return;
-  }
-  int pfx = ret[0];
-  int ans = ret[0];
-  for (int i = 1; i < ret.size(); i++) {
-    if (ret[i] == 0) continue;
-    ans = max(1 + pfx / 2 + ret[i], ans);
-    pfx += ret[i];
-  }
-  cout << ans << '\n';
-
-}
-
-int main () {
-  ios_base::sync_with_stdio(false);
-  cin.tie(NULL);
-  int tt;
-  cin >> tt;
-  while(tt--) {
-    solve();
-  }
-}
-
-
diff --git a/contests/Round#857/B/main_input0.txt b/contests/Round#857/B/main_input0.txt
deleted file mode 100644
index d60568c..0000000
--- a/contests/Round#857/B/main_input0.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-6
-3
-1 1 1
-3
-2 2 2
-5
-1 1 1 2 1
-10
-1 2 1 2 1 2 1 2 1 2
-20
-1 2 1 1 1 1 1 2 1 2 1 2 2 1 1 1 1 1 1 1
-20
-2 1 1 2 1 1 2 1 2 2 1 1 1 2 2 1 1 1 1 2
diff --git a/contests/Round#857/B/main_output0.txt b/contests/Round#857/B/main_output0.txt
deleted file mode 100644
index ea5c498..0000000
--- a/contests/Round#857/B/main_output0.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-3
-0
-3
-4
-12
-9
diff --git a/contests/Round#857/C/main.cpp b/contests/Round#857/C/main.cpp
deleted file mode 100755
index 7590c13..0000000
--- a/contests/Round#857/C/main.cpp
+++ /dev/null
@@ -1,89 +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() {
-
-}
-
-int main () {
-  ios_base::sync_with_stdio(false);
-  cin.tie(NULL);
-  int tt;
-  cin >> tt;
-  while(tt--) {
-    solve();
-  }
-}
-
-
diff --git a/contests/Round#857/D/main.cpp b/contests/Round#857/D/main.cpp
deleted file mode 100755
index 7590c13..0000000
--- a/contests/Round#857/D/main.cpp
+++ /dev/null
@@ -1,89 +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() {
-
-}
-
-int main () {
-  ios_base::sync_with_stdio(false);
-  cin.tie(NULL);
-  int tt;
-  cin >> tt;
-  while(tt--) {
-    solve();
-  }
-}
-
-
diff --git a/contests/Round#857/E/main.cpp b/contests/Round#857/E/main.cpp
deleted file mode 100755
index 7590c13..0000000
--- a/contests/Round#857/E/main.cpp
+++ /dev/null
@@ -1,89 +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() {
-
-}
-
-int main () {
-  ios_base::sync_with_stdio(false);
-  cin.tie(NULL);
-  int tt;
-  cin >> tt;
-  while(tt--) {
-    solve();
-  }
-}
-
-
diff --git a/contests/Round#857/F/main.cpp b/contests/Round#857/F/main.cpp
deleted file mode 100755
index 7590c13..0000000
--- a/contests/Round#857/F/main.cpp
+++ /dev/null
@@ -1,89 +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() {
-
-}
-
-int main () {
-  ios_base::sync_with_stdio(false);
-  cin.tie(NULL);
-  int tt;
-  cin >> tt;
-  while(tt--) {
-    solve();
-  }
-}
-
-