From 6b548332bfc6469756526002971c422f43f86d0a Mon Sep 17 00:00:00 2001 From: omagdy7 Date: Mon, 24 Jul 2023 13:11:33 +0300 Subject: Removed some empty *.cpp files and Solved some new problems --- contests/Round886/A/main | Bin 0 -> 37728 bytes contests/Round886/A/main.cpp | 140 ++++++++++++++++++++++++++++++ contests/Round886/A/main_input0.txt | 6 ++ contests/Round886/A/main_output0.txt | 5 ++ contests/Round886/B/main | Bin 0 -> 18464 bytes contests/Round886/B/main.cpp | 145 +++++++++++++++++++++++++++++++ contests/Round886/B/main_input0.txt | 13 +++ contests/Round886/B/main_output0.txt | 3 + contests/Round886/C/main | Bin 0 -> 32704 bytes contests/Round886/C/main.cpp | 156 +++++++++++++++++++++++++++++++++ contests/Round886/C/main_input0.txt | 41 +++++++++ contests/Round886/C/main_output0.txt | 5 ++ contests/Round886/D/main | Bin 0 -> 37920 bytes contests/Round886/D/main.cpp | 161 +++++++++++++++++++++++++++++++++++ contests/Round886/D/main_input0.txt | 15 ++++ contests/Round886/D/main_output0.txt | 7 ++ contests/Round886/E/main.cpp | 129 ++++++++++++++++++++++++++++ contests/Round886/F/main.cpp | 129 ++++++++++++++++++++++++++++ 18 files changed, 955 insertions(+) create mode 100755 contests/Round886/A/main create mode 100755 contests/Round886/A/main.cpp create mode 100644 contests/Round886/A/main_input0.txt create mode 100644 contests/Round886/A/main_output0.txt create mode 100755 contests/Round886/B/main create mode 100755 contests/Round886/B/main.cpp create mode 100644 contests/Round886/B/main_input0.txt create mode 100644 contests/Round886/B/main_output0.txt create mode 100755 contests/Round886/C/main create mode 100755 contests/Round886/C/main.cpp create mode 100644 contests/Round886/C/main_input0.txt create mode 100644 contests/Round886/C/main_output0.txt create mode 100755 contests/Round886/D/main create mode 100755 contests/Round886/D/main.cpp create mode 100644 contests/Round886/D/main_input0.txt create mode 100644 contests/Round886/D/main_output0.txt create mode 100755 contests/Round886/E/main.cpp create mode 100755 contests/Round886/F/main.cpp (limited to 'contests/Round886') diff --git a/contests/Round886/A/main b/contests/Round886/A/main new file mode 100755 index 0000000..18a69c0 Binary files /dev/null and b/contests/Round886/A/main differ diff --git a/contests/Round886/A/main.cpp b/contests/Round886/A/main.cpp new file mode 100755 index 0000000..907ad1e --- /dev/null +++ b/contests/Round886/A/main.cpp @@ -0,0 +1,140 @@ +#include +using namespace std; + +using ll = long long; +using pii = pair; +using vpi = vector; +using vi = vector; +using vll = vector; +using mpii = map; +using mpll = map; +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}; + +template +ostream &operator<<(ostream &os, const pair &p); +template ostream &operator<<(ostream &os, const vector &vec); +template +ostream &operator<<(ostream &os, const map &m); +template +ostream &operator<<(ostream &os, const unordered_map &m); +template ostream &operator<<(ostream &os, const set &s); +template +ostream &operator<<(ostream &os, const unordered_set &s); + +template +ostream &operator<<(ostream &os, const pair &p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template ostream &operator<<(ostream &os, const vector &vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) + os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const map &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const unordered_map &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template ostream &operator<<(ostream &os, const set &s) { + int i = 0; + os << "{"; + for (const auto &e : s) { + if (i > 0) + os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const unordered_set &s) { + int i = 0; + os << "{"; + for (const auto &e : s) { + if (i > 0) + os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +void dbg() { cerr << "\n"; } + +template void dbg(T val, TS... vals) { + cerr << val << " "; + dbg(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() { + vi v(3); + for (int i = 0; i < 3; i++) { + cin >> v[i]; + } + sort(all(v)); + if (v[1] + v[2] >= 10) { + cout << "YES\n"; + } else { + 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/Round886/A/main_input0.txt b/contests/Round886/A/main_input0.txt new file mode 100644 index 0000000..1e70422 --- /dev/null +++ b/contests/Round886/A/main_input0.txt @@ -0,0 +1,6 @@ +5 +8 1 2 +4 4 5 +9 9 9 +0 0 0 +8 5 3 diff --git a/contests/Round886/A/main_output0.txt b/contests/Round886/A/main_output0.txt new file mode 100644 index 0000000..1653f37 --- /dev/null +++ b/contests/Round886/A/main_output0.txt @@ -0,0 +1,5 @@ +YES +NO +YES +NO +YES diff --git a/contests/Round886/B/main b/contests/Round886/B/main new file mode 100755 index 0000000..36b1f6d Binary files /dev/null and b/contests/Round886/B/main differ diff --git a/contests/Round886/B/main.cpp b/contests/Round886/B/main.cpp new file mode 100755 index 0000000..954794c --- /dev/null +++ b/contests/Round886/B/main.cpp @@ -0,0 +1,145 @@ +#include +using namespace std; + +using ll = long long; +using pii = pair; +using vpi = vector; +using vi = vector; +using vll = vector; +using mpii = map; +using mpll = map; +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}; + +template +ostream &operator<<(ostream &os, const pair &p); +template ostream &operator<<(ostream &os, const vector &vec); +template +ostream &operator<<(ostream &os, const map &m); +template +ostream &operator<<(ostream &os, const unordered_map &m); +template ostream &operator<<(ostream &os, const set &s); +template +ostream &operator<<(ostream &os, const unordered_set &s); + +template +ostream &operator<<(ostream &os, const pair &p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template ostream &operator<<(ostream &os, const vector &vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) + os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const map &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const unordered_map &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template ostream &operator<<(ostream &os, const set &s) { + int i = 0; + os << "{"; + for (const auto &e : s) { + if (i > 0) + os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const unordered_set &s) { + int i = 0; + os << "{"; + for (const auto &e : s) { + if (i > 0) + os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +void dbg() { cerr << "\n"; } + +template void dbg(T val, TS... vals) { + cerr << val << " "; + dbg(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; + vector v; + int ans = 0; + int mx = 0; + for (int i = 0; i < n; i++) { + int a, b; + cin >> a >> b; + int tmp = mx; + if (a <= 10 && b > mx) { + mx = b; + ans = i; + } + } + cout << ans + 1 << '\n'; +} + +int main() { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while (tt--) { + solve(); + } +} diff --git a/contests/Round886/B/main_input0.txt b/contests/Round886/B/main_input0.txt new file mode 100644 index 0000000..2192ffa --- /dev/null +++ b/contests/Round886/B/main_input0.txt @@ -0,0 +1,13 @@ +3 +5 +7 2 +12 5 +9 3 +9 4 +10 1 +3 +1 2 +3 4 +5 6 +1 +1 43 diff --git a/contests/Round886/B/main_output0.txt b/contests/Round886/B/main_output0.txt new file mode 100644 index 0000000..57d63ae --- /dev/null +++ b/contests/Round886/B/main_output0.txt @@ -0,0 +1,3 @@ +4 +3 +1 diff --git a/contests/Round886/C/main b/contests/Round886/C/main new file mode 100755 index 0000000..3d09a66 Binary files /dev/null and b/contests/Round886/C/main differ diff --git a/contests/Round886/C/main.cpp b/contests/Round886/C/main.cpp new file mode 100755 index 0000000..73ad780 --- /dev/null +++ b/contests/Round886/C/main.cpp @@ -0,0 +1,156 @@ +#include +using namespace std; + +using ll = long long; +using pii = pair; +using vpi = vector; +using vi = vector; +using vll = vector; +using mpii = map; +using mpll = map; +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}; + +template +ostream &operator<<(ostream &os, const pair &p); +template ostream &operator<<(ostream &os, const vector &vec); +template +ostream &operator<<(ostream &os, const map &m); +template +ostream &operator<<(ostream &os, const unordered_map &m); +template ostream &operator<<(ostream &os, const set &s); +template +ostream &operator<<(ostream &os, const unordered_set &s); + +template +ostream &operator<<(ostream &os, const pair &p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template ostream &operator<<(ostream &os, const vector &vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) + os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const map &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const unordered_map &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template ostream &operator<<(ostream &os, const set &s) { + int i = 0; + os << "{"; + for (const auto &e : s) { + if (i > 0) + os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const unordered_set &s) { + int i = 0; + os << "{"; + for (const auto &e : s) { + if (i > 0) + os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +void dbg() { cerr << "\n"; } + +template void dbg(T val, TS... vals) { + cerr << val << " "; + dbg(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() { + vector g(8); + for (int i = 0; i < 8; i++) { + cin >> g[i]; + } + + int ti = 42, tj = 42; + for (int i = 0; i < 8; i++) { + for (int j = 0; j < 8; j++) { + if (g[i][j] != '.') { + ti = i; + tj = j; + break; + } + } + if (ti != 42 && tj != 42) { + break; + } + } + + string ans = ""; + + for (int j = ti; j < 8 && g[j][tj] != '.'; j++) { + ans += g[j][tj]; + } + + 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/Round886/C/main_input0.txt b/contests/Round886/C/main_input0.txt new file mode 100644 index 0000000..b9e7b10 --- /dev/null +++ b/contests/Round886/C/main_input0.txt @@ -0,0 +1,41 @@ +5 +........ +........ +........ +........ +...i.... +........ +........ +........ +........ +.l...... +.o...... +.s...... +.t...... +........ +........ +........ +........ +........ +........ +........ +......t. +......h. +......e. +........ +........ +........ +........ +........ +.......g +.......a +.......m +.......e +a....... +a....... +a....... +a....... +a....... +a....... +a....... +a....... diff --git a/contests/Round886/C/main_output0.txt b/contests/Round886/C/main_output0.txt new file mode 100644 index 0000000..be5dce9 --- /dev/null +++ b/contests/Round886/C/main_output0.txt @@ -0,0 +1,5 @@ +i +lost +the +game +aaaaaaaa diff --git a/contests/Round886/D/main b/contests/Round886/D/main new file mode 100755 index 0000000..c3edf0a Binary files /dev/null and b/contests/Round886/D/main differ diff --git a/contests/Round886/D/main.cpp b/contests/Round886/D/main.cpp new file mode 100755 index 0000000..5326985 --- /dev/null +++ b/contests/Round886/D/main.cpp @@ -0,0 +1,161 @@ +#include +using namespace std; + +using ll = long long; +using pii = pair; +using vpi = vector; +using vi = vector; +using vll = vector; +using mpii = map; +using mpll = map; +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}; + +template +ostream &operator<<(ostream &os, const pair &p); +template ostream &operator<<(ostream &os, const vector &vec); +template +ostream &operator<<(ostream &os, const map &m); +template +ostream &operator<<(ostream &os, const unordered_map &m); +template ostream &operator<<(ostream &os, const set &s); +template +ostream &operator<<(ostream &os, const unordered_set &s); + +template +ostream &operator<<(ostream &os, const pair &p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template ostream &operator<<(ostream &os, const vector &vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) + os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const map &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const unordered_map &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template ostream &operator<<(ostream &os, const set &s) { + int i = 0; + os << "{"; + for (const auto &e : s) { + if (i > 0) + os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const unordered_set &s) { + int i = 0; + os << "{"; + for (const auto &e : s) { + if (i > 0) + os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +void dbg() { cerr << "\n"; } + +template void dbg(T val, TS... vals) { + cerr << val << " "; + dbg(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, k; + cin >> n >> k; + vi v(n); + for (auto &x : v) { + cin >> x; + } + if (n == 1) { + cout << 0 << '\n'; + return; + } + bool ok = true; + for (int i = 0; i < n - 1; i++) { + if (abs(v[i] - v[i + 1]) > k) { + ok = false; + } + } + if (ok) { + cout << 0 << '\n'; + return; + } + int mx = 0; + sort(all(v)); + for (int i = 0; i < n - 1; i++) { + int x = 1; + while (i < n - 1 && abs(v[i] - v[i + 1]) <= k) { + i++; + x++; + } + mx = max(mx, x); + } + 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/Round886/D/main_input0.txt b/contests/Round886/D/main_input0.txt new file mode 100644 index 0000000..25326dc --- /dev/null +++ b/contests/Round886/D/main_input0.txt @@ -0,0 +1,15 @@ +7 +5 1 +1 2 4 5 6 +1 2 +10 +8 3 +17 3 1 20 12 5 17 12 +4 2 +2 4 6 8 +5 3 +2 3 19 10 8 +3 4 +1 10 5 +8 1 +8 3 1 4 5 10 7 3 diff --git a/contests/Round886/D/main_output0.txt b/contests/Round886/D/main_output0.txt new file mode 100644 index 0000000..3195b8c --- /dev/null +++ b/contests/Round886/D/main_output0.txt @@ -0,0 +1,7 @@ +2 +0 +5 +0 +3 +1 +4 diff --git a/contests/Round886/E/main.cpp b/contests/Round886/E/main.cpp new file mode 100755 index 0000000..20800e5 --- /dev/null +++ b/contests/Round886/E/main.cpp @@ -0,0 +1,129 @@ +#include +using namespace std; + +using ll = long long; +using pii = pair; +using vpi = vector; +using vi = vector; +using vll = vector; +using mpii = map; +using mpll = map; +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}; + +template +ostream &operator<<(ostream &os, const pair &p); +template ostream &operator<<(ostream &os, const vector &vec); +template +ostream &operator<<(ostream &os, const map &m); +template +ostream &operator<<(ostream &os, const unordered_map &m); +template ostream &operator<<(ostream &os, const set &s); +template +ostream &operator<<(ostream &os, const unordered_set &s); + +template +ostream &operator<<(ostream &os, const pair &p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template ostream &operator<<(ostream &os, const vector &vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) + os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const map &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const unordered_map &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template ostream &operator<<(ostream &os, const set &s) { + int i = 0; + os << "{"; + for (const auto &e : s) { + if (i > 0) + os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const unordered_set &s) { + int i = 0; + os << "{"; + for (const auto &e : s) { + if (i > 0) + os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +void dbg() { cerr << "\n"; } + +template void dbg(T val, TS... vals) { + cerr << val << " "; + dbg(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/Round886/F/main.cpp b/contests/Round886/F/main.cpp new file mode 100755 index 0000000..20800e5 --- /dev/null +++ b/contests/Round886/F/main.cpp @@ -0,0 +1,129 @@ +#include +using namespace std; + +using ll = long long; +using pii = pair; +using vpi = vector; +using vi = vector; +using vll = vector; +using mpii = map; +using mpll = map; +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}; + +template +ostream &operator<<(ostream &os, const pair &p); +template ostream &operator<<(ostream &os, const vector &vec); +template +ostream &operator<<(ostream &os, const map &m); +template +ostream &operator<<(ostream &os, const unordered_map &m); +template ostream &operator<<(ostream &os, const set &s); +template +ostream &operator<<(ostream &os, const unordered_set &s); + +template +ostream &operator<<(ostream &os, const pair &p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template ostream &operator<<(ostream &os, const vector &vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) + os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const map &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const unordered_map &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template ostream &operator<<(ostream &os, const set &s) { + int i = 0; + os << "{"; + for (const auto &e : s) { + if (i > 0) + os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const unordered_set &s) { + int i = 0; + os << "{"; + for (const auto &e : s) { + if (i > 0) + os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +void dbg() { cerr << "\n"; } + +template void dbg(T val, TS... vals) { + cerr << val << " "; + dbg(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(); + } +} -- cgit v1.2.3