Solved 4 problems in last Div.3

13 files changed, 462 insertions, 0 deletions

diff --git a/codeforces/Fireworks/main.cpp b/codeforces/Fireworks/main.cpp
new file mode 100755
index 0000000..e7bb04a
--- /dev/null
+++ b/codeforces/Fireworks/main.cpp
@@ -0,0 +1,58 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+using ll = long long;
+using pii = pair<int, int>;
+using vpii = vector<pii>;
+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
+#define make_unique(x)                                                         \
+  sort(all((x)));                                                              \
+  (x).resize(unique(all((x))) - (x).begin())
+#define ceil(a, b) ((a) + (b)-1) / (b)
+
+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};
+
+#ifdef LOCAL
+#include "debug.h"
+#else
+#define dbg(...) 42
+#endif
+
+/* 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 a, b, m;
+  cin >> a >> b >> m;
+  cout << ceil(m + 1, a) + ceil(m + 1, b) << '\n';
+}
+
+int main() {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while (tt--) {
+    solve();
+  }
+}
diff --git a/codeforces/Fireworks/main_input0.txt b/codeforces/Fireworks/main_input0.txt
new file mode 100644
index 0000000..69b526a
--- /dev/null
+++ b/codeforces/Fireworks/main_input0.txt
@@ -0,0 +1,7 @@
+6
+6 7 4
+3 4 10
+7 8 56
+5 6 78123459896
+1 1 1
+1 1 1000000000000000000
diff --git a/codeforces/Fireworks/main_output0.txt b/codeforces/Fireworks/main_output0.txt
new file mode 100644
index 0000000..e3d2222
--- /dev/null
+++ b/codeforces/Fireworks/main_output0.txt
@@ -0,0 +1,6 @@
+2
+7
+17
+28645268630
+4
+2000000000000000002
diff --git a/codeforces/SeraphimTheOwl/main.cpp b/codeforces/SeraphimTheOwl/main.cpp
new file mode 100755
index 0000000..34bad85
--- /dev/null
+++ b/codeforces/SeraphimTheOwl/main.cpp
@@ -0,0 +1,65 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+using ll = long long;
+using pii = pair<int, int>;
+using vpii = vector<pii>;
+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
+#define make_unique(x)                                                         \
+  sort(all((x)));                                                              \
+  (x).resize(unique(all((x))) - (x).begin())
+#define ceil(a, b) ((a) + (b)-1) / (b)
+
+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};
+
+#ifdef LOCAL
+#include "debug.h"
+#else
+#define dbg(...) 42
+#endif
+
+/* 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, m;
+  cin >> n >> m;
+  vi a(n);
+  vi b(n);
+  for (auto &x : a) {
+    cin >> x;
+  }
+  for (auto &x : b) {
+    cin >> x;
+  }
+}
+
+int main() {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while (tt--) {
+    solve();
+  }
+}
diff --git a/codeforces/SettingUpCamp/main.cpp b/codeforces/SettingUpCamp/main.cpp
new file mode 100755
index 0000000..93886b5
--- /dev/null
+++ b/codeforces/SettingUpCamp/main.cpp
@@ -0,0 +1,66 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+using ll = long long;
+using pii = pair<int, int>;
+using vpii = vector<pii>;
+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
+#define make_unique(x)                                                         \
+  sort(all((x)));                                                              \
+  (x).resize(unique(all((x))) - (x).begin())
+#define ceil(a, b) ((a) + (b)-1) / (b)
+
+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};
+
+#ifdef LOCAL
+#include "debug.h"
+#else
+#define dbg(...) 42
+#endif
+
+/* 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, c;
+  cin >> a >> b >> c;
+  if (b % 3 != 0 && b % 3 + c <= 2) {
+    cout << -1 << '\n';
+    return;
+  }
+  int ans = a + (b + c) / 3;
+  if ((b + c) % 3 > 0) {
+    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/codeforces/SettingUpCamp/main_input0.txt b/codeforces/SettingUpCamp/main_input0.txt
new file mode 100644
index 0000000..42d7034
--- /dev/null
+++ b/codeforces/SettingUpCamp/main_input0.txt
@@ -0,0 +1,11 @@
+10
+1 2 3
+1 4 1
+1 4 2
+1 1 1
+1 3 2
+19 7 18
+0 0 0
+7 0 0
+0 24 0
+1000000000 1000000000 1000000000
diff --git a/codeforces/SettingUpCamp/main_output0.txt b/codeforces/SettingUpCamp/main_output0.txt
new file mode 100644
index 0000000..d5228d1
--- /dev/null
+++ b/codeforces/SettingUpCamp/main_output0.txt
@@ -0,0 +1,10 @@
+3
+-1
+3
+-1
+3
+28
+0
+7
+8
+1666666667
diff --git a/codeforces/StairPeakOrNeither/main.cpp b/codeforces/StairPeakOrNeither/main.cpp
new file mode 100755
index 0000000..231e38b
--- /dev/null
+++ b/codeforces/StairPeakOrNeither/main.cpp
@@ -0,0 +1,64 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+using ll = long long;
+using pii = pair<int, int>;
+using vpii = vector<pii>;
+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
+#define make_unique(x)                                                         \
+  sort(all((x)));                                                              \
+  (x).resize(unique(all((x))) - (x).begin())
+#define ceil(a, b) ((a) + (b)-1) / (b)
+
+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};
+
+#ifdef LOCAL
+#include "debug.h"
+#else
+#define dbg(...) 42
+#endif
+
+/* 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, c;
+  cin >> a >> b >> c;
+  if (a < b && b < c) {
+    cout << "STAIR\n";
+  } else if (a < b && b > c) {
+    cout << "PEAK\n";
+  } else {
+    cout << "NONE\n";
+  }
+}
+
+int main() {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while (tt--) {
+    solve();
+  }
+}
diff --git a/codeforces/StairPeakOrNeither/main_input0.txt b/codeforces/StairPeakOrNeither/main_input0.txt
new file mode 100644
index 0000000..2a59631
--- /dev/null
+++ b/codeforces/StairPeakOrNeither/main_input0.txt
@@ -0,0 +1,8 @@
+7
+1 2 3
+3 2 1
+1 5 3
+3 4 1
+0 0 0
+4 1 7
+4 5 7
diff --git a/codeforces/StairPeakOrNeither/main_output0.txt b/codeforces/StairPeakOrNeither/main_output0.txt
new file mode 100644
index 0000000..3f723a8
--- /dev/null
+++ b/codeforces/StairPeakOrNeither/main_output0.txt
@@ -0,0 +1,7 @@
+STAIR
+NONE
+PEAK
+PEAK
+NONE
+NONE
+STAIR
diff --git a/codeforces/Upscaling/main.cpp b/codeforces/Upscaling/main.cpp
new file mode 100755
index 0000000..7744a9f
--- /dev/null
+++ b/codeforces/Upscaling/main.cpp
@@ -0,0 +1,135 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+using ll = long long;
+using pii = pair<int, int>;
+using vpii = vector<pii>;
+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
+#define make_unique(x)                                                         \
+  sort(all((x)));                                                              \
+  (x).resize(unique(all((x))) - (x).begin())
+#define ceil(a, b) ((a) + (b)-1) / (b)
+
+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};
+
+#ifdef LOCAL
+#include "debug.h"
+#else
+#define dbg(...) 42
+#endif
+
+/* 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
+ */
+
+
+vector<string> checkerboard = {
+  "##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..",
+  "##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..",
+  "..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##",
+  "..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##",
+  "##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..",
+  "##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..",
+  "..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##",
+  "..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##",
+  "##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..",
+  "##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..",
+  "..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##",
+  "..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##",
+  "##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..",
+  "##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..",
+  "..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##",
+  "..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##",
+  "##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..",
+  "##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..",
+  "..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##",
+  "..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##",
+  "##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..",
+  "##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..",
+  "..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##",
+  "..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##",
+  "##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..",
+  "##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..",
+  "..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##",
+  "..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##",
+  "##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..",
+  "##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..",
+  "..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##",
+  "..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##",
+  "##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..",
+  "##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..",
+  "..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##",
+  "..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##",
+  "##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..",
+  "##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..",
+  "..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##",
+  "..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##",
+  "##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..",
+  "##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..",
+  "..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##",
+  "..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##",
+  "##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..",
+  "##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..",
+  "..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##",
+  "..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##",
+  "##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..",
+  "##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..",
+  "..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##",
+  "..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##",
+  "##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..",
+  "##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..",
+  "..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##",
+  "..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##",
+  "##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..",
+  "##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..",
+  "..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##",
+  "..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##",
+  "##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..",
+  "##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..",
+  "..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##",
+  "..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##..##",
+};
+
+
+void solve() {
+  int n;
+  cin >> n;
+  bool toggle = true;
+  cerr << checkerboard.size() << '\n';
+  cerr << checkerboard[0].size() << '\n';
+  for (int i = 0; i < n * 2; i++) {
+    for (int j = 0; j < n * 2; j++) {
+      cout << checkerboard[i][j];
+    }
+    cout << "\n";
+  }
+}
+
+int main() {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while (tt--) {
+    solve();
+  }
+}
diff --git a/codeforces/Upscaling/main_input0.txt b/codeforces/Upscaling/main_input0.txt
new file mode 100644
index 0000000..4934959
--- /dev/null
+++ b/codeforces/Upscaling/main_input0.txt
@@ -0,0 +1,5 @@
+4
+1
+2
+3
+4
diff --git a/codeforces/Upscaling/main_output0.txt b/codeforces/Upscaling/main_output0.txt
new file mode 100644
index 0000000..7cd83b6
--- /dev/null
+++ b/codeforces/Upscaling/main_output0.txt
@@ -0,0 +1,20 @@
+##
+##
+##..
+##..
+..##
+..##
+##..##
+##..##
+..##..
+..##..
+##..##
+##..##
+##..##..
+##..##..
+..##..##
+..##..##
+##..##..
+##..##..
+..##..##
+..##..##