Solved a bunch of problems

22 files changed, 631 insertions, 0 deletions

diff --git a/contests/Starters79/A/main b/contests/Starters79/A/main
new file mode 100755
index 0000000..3773cae
--- /dev/null
+++ b/contests/Starters79/A/main
diff --git a/contests/Starters79/A/main.cpp b/contests/Starters79/A/main.cpp
new file mode 100755
index 0000000..205cbcc
--- /dev/null
+++ b/contests/Starters79/A/main.cpp
@@ -0,0 +1,103 @@
+#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 a, b;
+  cin >> a >> b;
+  print(a, b);
+  int f = 100 - a;
+  int s = 200 - 2 * b;
+  print(f, s);
+  if ( f < s ) {
+    cout << "FIRST" << '\n';
+  } else if ( s < f ) {
+    cout << "SECOND" << '\n';
+  } else {
+    cout << "BOTH" << '\n';
+  }
+
+
+}
+
+int main () {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while(tt--) {
+    solve();
+  }
+}
+
+
diff --git a/contests/Starters79/A/main_input0.txt b/contests/Starters79/A/main_input0.txt
new file mode 100644
index 0000000..50cd4f7
--- /dev/null
+++ b/contests/Starters79/A/main_input0.txt
@@ -0,0 +1,5 @@
+4
+5 20
+10 60
+7 7
+10 55
\ No newline at end of file
diff --git a/contests/Starters79/A/main_output0.txt b/contests/Starters79/A/main_output0.txt
new file mode 100644
index 0000000..5de1dd4
--- /dev/null
+++ b/contests/Starters79/A/main_output0.txt
@@ -0,0 +1,4 @@
+FIRST
+SECOND
+FIRST
+BOTH
\ No newline at end of file
diff --git a/contests/Starters79/B/main b/contests/Starters79/B/main
new file mode 100755
index 0000000..a509ab1
--- /dev/null
+++ b/contests/Starters79/B/main
diff --git a/contests/Starters79/B/main.cpp b/contests/Starters79/B/main.cpp
new file mode 100755
index 0000000..469bafa
--- /dev/null
+++ b/contests/Starters79/B/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;
+  for (int i = n; i >= 1; i--) {
+    if (i & 1) {
+      cout << i << " ";
+    }
+  }
+  for (int i = 1; i <= n; i++) {
+    if (i % 2 == 0) {
+      cout << i << " ";
+    }
+  }
+  cout << '\n';
+}
+
+int main () {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while(tt--) {
+    solve();
+  }
+}
+
+
diff --git a/contests/Starters79/B/main_input0.txt b/contests/Starters79/B/main_input0.txt
new file mode 100644
index 0000000..1d54e1a
--- /dev/null
+++ b/contests/Starters79/B/main_input0.txt
@@ -0,0 +1,4 @@
+3
+2
+6
+4
\ No newline at end of file
diff --git a/contests/Starters79/B/main_output0.txt b/contests/Starters79/B/main_output0.txt
new file mode 100644
index 0000000..ba35a4f
--- /dev/null
+++ b/contests/Starters79/B/main_output0.txt
@@ -0,0 +1,3 @@
+2 1
+1 3 2 4 5 6
+2 1 3 4
\ No newline at end of file
diff --git a/contests/Starters79/C/main b/contests/Starters79/C/main
new file mode 100755
index 0000000..c6cabc2
--- /dev/null
+++ b/contests/Starters79/C/main
diff --git a/contests/Starters79/C/main.cpp b/contests/Starters79/C/main.cpp
new file mode 100755
index 0000000..fc2aa20
--- /dev/null
+++ b/contests/Starters79/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
+ */
+// 7 / 3
+// 7 + 3 - 1 / 3
+
+void solve() {
+  // a + b - 1 / b
+  vector<int> pf = {0, 0, 2, 3, 2, 5, 2, 7, 2, 3, 2};
+  int x, y;
+  cin >> x >> y;
+  if (x % 2 == 0) {
+    cout << ((y - x - 1) / 2) + 1 << '\n';
+  } else {
+    cout << ((y - x - pf[x] + 1) / 2) + 1 << '\n';
+  }
+
+
+}
+
+int main () {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while(tt--) {
+    solve();
+  }
+}
+
+
diff --git a/contests/Starters79/C/main_input0.txt b/contests/Starters79/C/main_input0.txt
new file mode 100644
index 0000000..6e427ae
--- /dev/null
+++ b/contests/Starters79/C/main_input0.txt
@@ -0,0 +1,5 @@
+4
+2 23
+9 20
+5 100
+6 89
\ No newline at end of file
diff --git a/contests/Starters79/C/main_input1.txt b/contests/Starters79/C/main_input1.txt
new file mode 100644
index 0000000..ba7e2ea
--- /dev/null
+++ b/contests/Starters79/C/main_input1.txt
@@ -0,0 +1,5 @@
+4
+2 5
+10 20
+7 49
+5 52
\ No newline at end of file
diff --git a/contests/Starters79/C/main_output0.txt b/contests/Starters79/C/main_output0.txt
new file mode 100644
index 0000000..4046dbf
--- /dev/null
+++ b/contests/Starters79/C/main_output0.txt
@@ -0,0 +1,4 @@
+11
+5
+46
+42
\ No newline at end of file
diff --git a/contests/Starters79/C/main_output1.txt b/contests/Starters79/C/main_output1.txt
new file mode 100644
index 0000000..08c986d
--- /dev/null
+++ b/contests/Starters79/C/main_output1.txt
@@ -0,0 +1,4 @@
+2
+5
+19
+22
\ No newline at end of file
diff --git a/contests/Starters79/D/main b/contests/Starters79/D/main
new file mode 100755
index 0000000..c7fd93d
--- /dev/null
+++ b/contests/Starters79/D/main
diff --git a/contests/Starters79/D/main.cpp b/contests/Starters79/D/main.cpp
new file mode 100755
index 0000000..5eaae94
--- /dev/null
+++ b/contests/Starters79/D/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 x, y;
+  cin >> x >> y;
+  if (x - y >= 2) {
+    cout << "CHEF" << '\n';
+  } else if (y - x >= 2) {
+    cout << "CHEFINA" << '\n';
+  } else if (x == y) {
+    if (x % 2 == 0) {
+      cout << "CHEFINA" << '\n';
+    } else {
+      cout << "CHEF" << '\n';
+    }
+  } else {
+    if (x > y and x % 2 == 1 and y % 2 == 0) {
+      cout << "CHEFINA" << '\n';
+    } else if (x < y && x % 2 == 1 && y % 2 == 0) {
+      cout << "CHEF" << '\n';
+    } else if (x > y && x % 2 == 0 && y % 2 == 1) {
+      cout << "CHEF" << '\n';
+    } else if (x < y && x % 2 == 0 && y % 2 == 1) {
+      cout << "CHEFINA" << '\n';
+    }
+  }
+}
+
+int main() {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while (tt--) {
+    solve();
+  }
+}
diff --git a/contests/Starters79/D/main_input0.txt b/contests/Starters79/D/main_input0.txt
new file mode 100644
index 0000000..b87d859
--- /dev/null
+++ b/contests/Starters79/D/main_input0.txt
@@ -0,0 +1,4 @@
+3
+1 10
+2 2
+4 2
\ No newline at end of file
diff --git a/contests/Starters79/D/main_input1.txt b/contests/Starters79/D/main_input1.txt
new file mode 100644
index 0000000..9a04404
--- /dev/null
+++ b/contests/Starters79/D/main_input1.txt
@@ -0,0 +1,3 @@
+2
+3 2
+2 3
\ No newline at end of file
diff --git a/contests/Starters79/D/main_output0.txt b/contests/Starters79/D/main_output0.txt
new file mode 100644
index 0000000..92e3279
--- /dev/null
+++ b/contests/Starters79/D/main_output0.txt
@@ -0,0 +1,3 @@
+CHEFINA
+CHEFINA
+CHEF
\ No newline at end of file
diff --git a/contests/Starters79/D/main_output1.txt b/contests/Starters79/D/main_output1.txt
new file mode 100644
index 0000000..0b90a1d
--- /dev/null
+++ b/contests/Starters79/D/main_output1.txt
@@ -0,0 +1,2 @@
+CHEFINA
+CHEFINA
\ No newline at end of file
diff --git a/contests/Starters79/E/main.cpp b/contests/Starters79/E/main.cpp
new file mode 100755
index 0000000..7590c13
--- /dev/null
+++ b/contests/Starters79/E/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/Starters79/F/main.cpp b/contests/Starters79/F/main.cpp
new file mode 100755
index 0000000..7590c13
--- /dev/null
+++ b/contests/Starters79/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();
+  }
+}
+
+