32 files changed, 694 insertions, 0 deletions
diff --git a/contests/Starters80/A/main b/contests/Starters80/A/main
new file mode 100755
index 0000000..afab9ce
--- /dev/null
+++ b/contests/Starters80/A/main
diff --git a/contests/Starters80/A/main.cpp b/contests/Starters80/A/main.cpp
new file mode 100755
index 0000000..30e5948
--- /dev/null
+++ b/contests/Starters80/A/main.cpp
@@ -0,0 +1,98 @@
+#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 h, x, y;
+  cin >> h >> x >> y;
+  int ans = 1;
+  h -= y;
+  while (h > 0) {
+    h -= x;
+    ans++;
+  }
+  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/Starters80/A/main_input0.txt b/contests/Starters80/A/main_input0.txt
new file mode 100644
index 0000000..ed3ba77
--- /dev/null
+++ b/contests/Starters80/A/main_input0.txt
@@ -0,0 +1,5 @@
+4
+100 25 40
+100 29 45
+46 1 2
+78 15 78
diff --git a/contests/Starters80/A/main_output0.txt b/contests/Starters80/A/main_output0.txt
new file mode 100644
index 0000000..ced7f8b
--- /dev/null
+++ b/contests/Starters80/A/main_output0.txt
@@ -0,0 +1,4 @@
+4
+3
+45
+1
diff --git a/contests/Starters80/B/main b/contests/Starters80/B/main
new file mode 100755
index 0000000..acb6894
--- /dev/null
+++ b/contests/Starters80/B/main
diff --git a/contests/Starters80/B/main.cpp b/contests/Starters80/B/main.cpp
new file mode 100755
index 0000000..eec794e
--- /dev/null
+++ b/contests/Starters80/B/main.cpp
@@ -0,0 +1,102 @@
+#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 a(n);
+  vi b(n);
+  for (auto &x : a) cin >> x;
+  for (auto &x : b) cin >> x;
+  int ans = 0;
+  for (int i = 0; i < n; i++) {
+    if (abs(a[i] - b[i]) <= max(a[i], b[i]) / 2) {
+      ans++;
+    }
+  }
+  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/Starters80/B/main_input0.txt b/contests/Starters80/B/main_input0.txt
new file mode 100644
index 0000000..d772d54
--- /dev/null
+++ b/contests/Starters80/B/main_input0.txt
@@ -0,0 +1,13 @@
+4
+3
+100 200 300
+300 200 100
+4
+1000 1000 1000 1000
+400 500 600 1200
+4
+800 399 1400 532
+2053 2300 3400 23
+5
+800 850 900 950 1000
+600 800 1000 1200 1400
diff --git a/contests/Starters80/B/main_output0.txt b/contests/Starters80/B/main_output0.txt
new file mode 100644
index 0000000..e69337e
--- /dev/null
+++ b/contests/Starters80/B/main_output0.txt
@@ -0,0 +1,4 @@
+1
+3
+0
+5
diff --git a/contests/Starters80/C/main b/contests/Starters80/C/main
new file mode 100755
index 0000000..358edd7
--- /dev/null
+++ b/contests/Starters80/C/main
diff --git a/contests/Starters80/C/main.cpp b/contests/Starters80/C/main.cpp
new file mode 100755
index 0000000..2dd3ce4
--- /dev/null
+++ b/contests/Starters80/C/main.cpp
@@ -0,0 +1,101 @@
+#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);
+  vi fq(n);
+  for (int i = 0; i < n; i++) {
+    int x;
+    cin >> x;
+    v[i] = x;
+    fq[x]++;
+  }
+  int mx = *max_element(all(fq));
+  cout << n - mx << '\n';
+
+}
+
+int main () {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while(tt--) {
+    solve();
+  }
+}
+
+
diff --git a/contests/Starters80/C/main_input0.txt b/contests/Starters80/C/main_input0.txt
new file mode 100644
index 0000000..a301148
--- /dev/null
+++ b/contests/Starters80/C/main_input0.txt
@@ -0,0 +1,7 @@
+3
+3
+1 2 3
+4
+2 2 3 1
+4
+3 1 2 4
diff --git a/contests/Starters80/C/main_output0.txt b/contests/Starters80/C/main_output0.txt
new file mode 100644
index 0000000..179d8a7
--- /dev/null
+++ b/contests/Starters80/C/main_output0.txt
@@ -0,0 +1,3 @@
+2
+2
+3
diff --git a/contests/Starters80/D/main b/contests/Starters80/D/main
new file mode 100755
index 0000000..52eeeea
--- /dev/null
+++ b/contests/Starters80/D/main
diff --git a/contests/Starters80/D/main.cpp b/contests/Starters80/D/main.cpp
new file mode 100755
index 0000000..e742d6a
--- /dev/null
+++ b/contests/Starters80/D/main.cpp
@@ -0,0 +1,125 @@
+#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() {
+  ll n;
+  cin >> n;
+  ll sum = (n * (n + 1)) / 2;
+  vi v1 = {3, 4, 1, 2};
+  vi v2 = {1, 2, 4, 6, 3, 5};
+  if (sum % n == 0) {
+    cout << -1 << '\n';
+  } else {
+    vi ans(n);
+    if (n == 2) {
+      cout << 1 << " " << 2 << '\n';
+    }
+    else if (n == 4) {
+      for (auto x : v1) {
+        cout << x << ' ';
+      }
+      cout << '\n';
+    } else if (n == 6) {
+      for (auto x : v2) {
+        cout << x << ' ';
+      }
+      cout << '\n';
+    } else {
+      for (int i = 7; i <= n; i++) {
+        if (i % 2 == 1) {
+          v2.push_back(i + 1);
+        } else {
+          v2.push_back(i - 1);
+        }
+      }
+      for (auto x : v2) {
+        cout << x << ' ';
+      }
+      cout << '\n';
+    }
+  }
+
+}
+
+int main () {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while(tt--) {
+    solve();
+  }
+}
+
+
diff --git a/contests/Starters80/D/main_input0.txt b/contests/Starters80/D/main_input0.txt
new file mode 100644
index 0000000..11f6059
--- /dev/null
+++ b/contests/Starters80/D/main_input0.txt
@@ -0,0 +1,4 @@
+3
+4
+6
+7
diff --git a/contests/Starters80/D/main_input1.txt b/contests/Starters80/D/main_input1.txt
new file mode 100644
index 0000000..4551b90
--- /dev/null
+++ b/contests/Starters80/D/main_input1.txt
@@ -0,0 +1,2 @@
+1
+8
+\ No newline at end of file
diff --git a/contests/Starters80/D/main_input2.txt b/contests/Starters80/D/main_input2.txt
new file mode 100644
index 0000000..ecf8935
--- /dev/null
+++ b/contests/Starters80/D/main_input2.txt
@@ -0,0 +1,2 @@
+1
+12
+\ No newline at end of file
diff --git a/contests/Starters80/D/main_input3.txt b/contests/Starters80/D/main_input3.txt
new file mode 100644
index 0000000..7a754f4
--- /dev/null
+++ b/contests/Starters80/D/main_input3.txt
@@ -0,0 +1,2 @@
+1
+2
+\ No newline at end of file
diff --git a/contests/Starters80/D/main_input4.txt b/contests/Starters80/D/main_input4.txt
new file mode 100644
index 0000000..7a754f4
--- /dev/null
+++ b/contests/Starters80/D/main_input4.txt
@@ -0,0 +1,2 @@
+1
+2
+\ No newline at end of file
diff --git a/contests/Starters80/D/main_output0.txt b/contests/Starters80/D/main_output0.txt
new file mode 100644
index 0000000..5602f68
--- /dev/null
+++ b/contests/Starters80/D/main_output0.txt
@@ -0,0 +1,3 @@
+3 4 1 2
+1 2 4 6 3 5
+-1
diff --git a/contests/Starters80/D/main_output1.txt b/contests/Starters80/D/main_output1.txt
new file mode 100644
index 0000000..f2036c1
--- /dev/null
+++ b/contests/Starters80/D/main_output1.txt
@@ -0,0 +1 @@
+1 2 4 6 3 5 8 7
+\ No newline at end of file
diff --git a/contests/Starters80/D/main_output2.txt b/contests/Starters80/D/main_output2.txt
new file mode 100644
index 0000000..9a0233d
--- /dev/null
+++ b/contests/Starters80/D/main_output2.txt
@@ -0,0 +1 @@
+1 2 4 6 3 5 8 7 10 9 12 11
+\ No newline at end of file
diff --git a/contests/Starters80/D/main_output3.txt b/contests/Starters80/D/main_output3.txt
new file mode 100644
index 0000000..1c6ae71
--- /dev/null
+++ b/contests/Starters80/D/main_output3.txt
@@ -0,0 +1 @@
+1 2
+\ No newline at end of file
diff --git a/contests/Starters80/D/main_output4.txt b/contests/Starters80/D/main_output4.txt
new file mode 100644
index 0000000..1c6ae71
--- /dev/null
+++ b/contests/Starters80/D/main_output4.txt
@@ -0,0 +1 @@
+1 2
+\ No newline at end of file
diff --git a/contests/Starters80/E/main b/contests/Starters80/E/main
new file mode 100755
index 0000000..6f8e448
--- /dev/null
+++ b/contests/Starters80/E/main
diff --git a/contests/Starters80/E/main.cpp b/contests/Starters80/E/main.cpp
new file mode 100755
index 0000000..c53ffef
--- /dev/null
+++ b/contests/Starters80/E/main.cpp
@@ -0,0 +1,110 @@
+#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);
+  map<int, int> fq;
+  for (int i = 0; i < n; i++) {
+    int x;
+    cin >> x;
+    v[i] = x;
+    fq[x]++;
+  }
+  vll dp(n); 
+  dp[0] = fq[1];
+  for (int i = 1; i < n; i++) {
+    dp[i] = (dp[i - 1] * fq[i + 1]) % MOD;
+  }
+  ll sum = 0;
+  for (auto x : dp) {
+    sum = (sum + x) % MOD;
+  }
+  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/Starters80/E/main_input0.txt b/contests/Starters80/E/main_input0.txt
new file mode 100644
index 0000000..8353715
--- /dev/null
+++ b/contests/Starters80/E/main_input0.txt
@@ -0,0 +1,5 @@
+2
+5
+1 2 3 2 4
+6
+1 3 5 8 9 8
diff --git a/contests/Starters80/E/main_output0.txt b/contests/Starters80/E/main_output0.txt
new file mode 100644
index 0000000..107b687
--- /dev/null
+++ b/contests/Starters80/E/main_output0.txt
@@ -0,0 +1,2 @@
+7
+1
diff --git a/contests/Starters80/F/main.cpp b/contests/Starters80/F/main.cpp
new file mode 100755
index 0000000..7590c13
--- /dev/null
+++ b/contests/Starters80/F/main.cpp
@@ -0,0 +1,89 @@
+#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/Starters80/main.cpp b/contests/Starters80/main.cpp
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/contests/Starters80/main.cpp
diff --git a/contests/Starters80/main_input0.txt b/contests/Starters80/main_input0.txt
new file mode 100644
index 0000000..8353715
--- /dev/null
+++ b/contests/Starters80/main_input0.txt
@@ -0,0 +1,5 @@
+2
+5
+1 2 3 2 4
+6
+1 3 5 8 9 8
diff --git a/contests/Starters80/main_output0.txt b/contests/Starters80/main_output0.txt
new file mode 100644
index 0000000..107b687
--- /dev/null
+++ b/contests/Starters80/main_output0.txt
@@ -0,0 +1,2 @@
+7
+1