diff options
29 files changed, 1697 insertions, 0 deletions
diff --git a/codeforces/ChipsOnTheBoard/main.cpp b/codeforces/ChipsOnTheBoard/main.cpp new file mode 100755 index 0000000..cd05891 --- /dev/null +++ b/codeforces/ChipsOnTheBoard/main.cpp @@ -0,0 +1,129 @@ +#include <bits/stdc++.h> +using namespace std; + +using ll = long long; +using pii = pair<int, int>; +using vpi = 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}; + +template <typename K, typename V> +ostream &operator<<(ostream &os, const pair<K, V> &p); +template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec); +template <typename K, typename V> +ostream &operator<<(ostream &os, const map<K, V> &m); +template <typename K, typename V> +ostream &operator<<(ostream &os, const unordered_map<K, V> &m); +template <typename T> ostream &operator<<(ostream &os, const set<T> &s); +template <typename T> +ostream &operator<<(ostream &os, const unordered_set<T> &s); + +template <typename K, typename V> +ostream &operator<<(ostream &os, const pair<K, V> &p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) + os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + +template <typename K, typename V> +ostream &operator<<(ostream &os, const map<K, V> &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template <typename K, typename V> +ostream &operator<<(ostream &os, const unordered_map<K, V> &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template <typename T> ostream &operator<<(ostream &os, const set<T> &s) { + int i = 0; + os << "{"; + for (const auto &e : s) { + if (i > 0) + os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template <typename T> +ostream &operator<<(ostream &os, const unordered_set<T> &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 <typename T, typename... TS> 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/codeforces/ChipsOnTheBoard/main_input0.txt b/codeforces/ChipsOnTheBoard/main_input0.txt new file mode 100644 index 0000000..35d6d40 --- /dev/null +++ b/codeforces/ChipsOnTheBoard/main_input0.txt @@ -0,0 +1,13 @@ +4 +3 +1 4 1 +3 2 2 +1 +4 +5 +2 +4 5 +2 3 +5 +5 2 4 5 3 +3 4 2 1 5 diff --git a/codeforces/ChipsOnTheBoard/main_output0.txt b/codeforces/ChipsOnTheBoard/main_output0.txt new file mode 100644 index 0000000..3e20c59 --- /dev/null +++ b/codeforces/ChipsOnTheBoard/main_output0.txt @@ -0,0 +1,4 @@ +10 +9 +13 +24 diff --git a/codeforces/Rigged/main.cpp b/codeforces/Rigged/main.cpp new file mode 100755 index 0000000..77aa54d --- /dev/null +++ b/codeforces/Rigged/main.cpp @@ -0,0 +1,147 @@ +#include <bits/stdc++.h> +using namespace std; + +using ll = long long; +using pii = pair<int, int>; +using vpi = 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}; + +template <typename K, typename V> +ostream &operator<<(ostream &os, const pair<K, V> &p); +template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec); +template <typename K, typename V> +ostream &operator<<(ostream &os, const map<K, V> &m); +template <typename K, typename V> +ostream &operator<<(ostream &os, const unordered_map<K, V> &m); +template <typename T> ostream &operator<<(ostream &os, const set<T> &s); +template <typename T> +ostream &operator<<(ostream &os, const unordered_set<T> &s); + +template <typename K, typename V> +ostream &operator<<(ostream &os, const pair<K, V> &p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) + os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + +template <typename K, typename V> +ostream &operator<<(ostream &os, const map<K, V> &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template <typename K, typename V> +ostream &operator<<(ostream &os, const unordered_map<K, V> &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template <typename T> ostream &operator<<(ostream &os, const set<T> &s) { + int i = 0; + os << "{"; + for (const auto &e : s) { + if (i > 0) + os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template <typename T> +ostream &operator<<(ostream &os, const unordered_set<T> &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 <typename T, typename... TS> 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; + vpi v(n); + int mx = 0; + for (int i = 0; i < n; i++) { + cin >> v[i].first >> v[i].second; + if (i > 0 && v[i].second >= v[0].second) { + mx = max(mx, v[i].first); + } + } + for (int i = 1; i < n; i++) { + if (v[i].first >= v[0].first && v[i].second >= v[0].second) { + cout << -1 << '\n'; + return; + } + } + cout << mx + 1 << '\n'; +} + +int main() { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while (tt--) { + solve(); + } +} diff --git a/codeforces/Rigged/main_input0.txt b/codeforces/Rigged/main_input0.txt new file mode 100644 index 0000000..d4e8d40 --- /dev/null +++ b/codeforces/Rigged/main_input0.txt @@ -0,0 +1,12 @@ +3 +4 +7 4 +9 3 +4 6 +2 2 +2 +4 6 +100 100 +2 +1337 3 +1337 3 diff --git a/codeforces/Rigged/main_output0.txt b/codeforces/Rigged/main_output0.txt new file mode 100644 index 0000000..efc503c --- /dev/null +++ b/codeforces/Rigged/main_output0.txt @@ -0,0 +1,3 @@ +5 +-1 +-1 diff --git a/codeforces/TheWayToHome/] b/codeforces/TheWayToHome/] new file mode 100644 index 0000000..dbdfb72 --- /dev/null +++ b/codeforces/TheWayToHome/] @@ -0,0 +1,166 @@ +#include <bits/stdc++.h> +using namespace std; + +using ll = long long; +using pii = pair<int, int>; +using vpi = 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}; + +template <typename K, typename V> +ostream &operator<<(ostream &os, const pair<K, V> &p); +template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec); +template <typename K, typename V> +ostream &operator<<(ostream &os, const map<K, V> &m); +template <typename K, typename V> +ostream &operator<<(ostream &os, const unordered_map<K, V> &m); +template <typename T> ostream &operator<<(ostream &os, const set<T> &s); +template <typename T> +ostream &operator<<(ostream &os, const unordered_set<T> &s); + +template <typename K, typename V> +ostream &operator<<(ostream &os, const pair<K, V> &p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) + os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + +template <typename K, typename V> +ostream &operator<<(ostream &os, const map<K, V> &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template <typename K, typename V> +ostream &operator<<(ostream &os, const unordered_map<K, V> &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template <typename T> ostream &operator<<(ostream &os, const set<T> &s) { + int i = 0; + os << "{"; + for (const auto &e : s) { + if (i > 0) + os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template <typename T> +ostream &operator<<(ostream &os, const unordered_set<T> &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 <typename T, typename... TS> 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; + string s; + cin >> s; + int cur = 0; + int ans = 0; + if (k == 1) { + for (int i = 0; i < n; i++) { + while (s[i] == 1) { + ans++; + i++; + } + if (ans == n - 1) { + cout << ans << '\n'; + } else { + cout << -1 << '\n'; + } + return; + } + } + while (true) { + int tmp = cur + 1; + bool ok = false; + for (int j = tmp + 1; j < min(n, tmp + k); j++) { + dbg(j); + if (s[j] == '1') { + ok = true; + cur = j; + } + } + if (!ok) { + cout << -1; + return; + } + ans++; + if (cur + 1 == n) { + break; + } + } + cout << ans << '\n'; +} + +int main() { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + solve(); +} diff --git a/codeforces/TheWayToHome/main.cpp b/codeforces/TheWayToHome/main.cpp new file mode 100755 index 0000000..7a01e31 --- /dev/null +++ b/codeforces/TheWayToHome/main.cpp @@ -0,0 +1,167 @@ +#include <bits/stdc++.h> +using namespace std; + +using ll = long long; +using pii = pair<int, int>; +using vpi = 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}; + +template <typename K, typename V> +ostream &operator<<(ostream &os, const pair<K, V> &p); +template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec); +template <typename K, typename V> +ostream &operator<<(ostream &os, const map<K, V> &m); +template <typename K, typename V> +ostream &operator<<(ostream &os, const unordered_map<K, V> &m); +template <typename T> ostream &operator<<(ostream &os, const set<T> &s); +template <typename T> +ostream &operator<<(ostream &os, const unordered_set<T> &s); + +template <typename K, typename V> +ostream &operator<<(ostream &os, const pair<K, V> &p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) + os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + +template <typename K, typename V> +ostream &operator<<(ostream &os, const map<K, V> &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template <typename K, typename V> +ostream &operator<<(ostream &os, const unordered_map<K, V> &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template <typename T> ostream &operator<<(ostream &os, const set<T> &s) { + int i = 0; + os << "{"; + for (const auto &e : s) { + if (i > 0) + os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template <typename T> +ostream &operator<<(ostream &os, const unordered_set<T> &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 <typename T, typename... TS> 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; + string s; + cin >> s; + int cur = 0; + int ans = 0; + if (k == 1) { + for (int i = 0; i < n; i++) { + while (s[i] == '1') { + ans++; + i++; + } + dbg(ans); + if (ans == n) { + cout << ans - 1 << '\n'; + } else { + cout << -1 << '\n'; + } + return; + } + } + while (true) { + int tmp = cur + 1; + bool ok = false; + for (int j = tmp + 1; j < min(n, tmp + k); j++) { + dbg(j); + if (s[j] == '1') { + ok = true; + cur = j; + } + } + if (!ok) { + cout << -1; + return; + } + ans++; + if (cur + 1 == n) { + break; + } + } + cout << ans << '\n'; +} + +int main() { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + solve(); +} diff --git a/codeforces/TheWayToHome/main_input0.txt b/codeforces/TheWayToHome/main_input0.txt new file mode 100644 index 0000000..62e1672 --- /dev/null +++ b/codeforces/TheWayToHome/main_input0.txt @@ -0,0 +1,2 @@ +8 4 +10010101 diff --git a/codeforces/TheWayToHome/main_input1.txt b/codeforces/TheWayToHome/main_input1.txt new file mode 100644 index 0000000..0d15152 --- /dev/null +++ b/codeforces/TheWayToHome/main_input1.txt @@ -0,0 +1,2 @@ +4 2 +1001 diff --git a/codeforces/TheWayToHome/main_input2.txt b/codeforces/TheWayToHome/main_input2.txt new file mode 100644 index 0000000..7119b16 --- /dev/null +++ b/codeforces/TheWayToHome/main_input2.txt @@ -0,0 +1,2 @@ +8 4 +11100101 diff --git a/codeforces/TheWayToHome/main_input3.txt b/codeforces/TheWayToHome/main_input3.txt new file mode 100644 index 0000000..1be6871 --- /dev/null +++ b/codeforces/TheWayToHome/main_input3.txt @@ -0,0 +1,2 @@ +12 3 +101111100101 diff --git a/codeforces/TheWayToHome/main_input4.txt b/codeforces/TheWayToHome/main_input4.txt new file mode 100644 index 0000000..e9f7130 --- /dev/null +++ b/codeforces/TheWayToHome/main_input4.txt @@ -0,0 +1,2 @@ +100 1 +1111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111
\ No newline at end of file diff --git a/codeforces/TheWayToHome/main_output0.txt b/codeforces/TheWayToHome/main_output0.txt new file mode 100644 index 0000000..0cfbf08 --- /dev/null +++ b/codeforces/TheWayToHome/main_output0.txt @@ -0,0 +1 @@ +2 diff --git a/codeforces/TheWayToHome/main_output1.txt b/codeforces/TheWayToHome/main_output1.txt new file mode 100644 index 0000000..3a2e3f4 --- /dev/null +++ b/codeforces/TheWayToHome/main_output1.txt @@ -0,0 +1 @@ +-1 diff --git a/codeforces/TheWayToHome/main_output2.txt b/codeforces/TheWayToHome/main_output2.txt new file mode 100644 index 0000000..00750ed --- /dev/null +++ b/codeforces/TheWayToHome/main_output2.txt @@ -0,0 +1 @@ +3 diff --git a/codeforces/TheWayToHome/main_output3.txt b/codeforces/TheWayToHome/main_output3.txt new file mode 100644 index 0000000..b8626c4 --- /dev/null +++ b/codeforces/TheWayToHome/main_output3.txt @@ -0,0 +1 @@ +4 diff --git a/codeforces/TheWayToHome/main_output4.txt b/codeforces/TheWayToHome/main_output4.txt new file mode 100644 index 0000000..d97edbb --- /dev/null +++ b/codeforces/TheWayToHome/main_output4.txt @@ -0,0 +1 @@ +99
\ No newline at end of file diff --git a/contests/Round899/A/main.cpp b/contests/Round899/A/main.cpp new file mode 100755 index 0000000..ead6bdd --- /dev/null +++ b/contests/Round899/A/main.cpp @@ -0,0 +1,153 @@ +#include <bits/stdc++.h> +using namespace std; + +using ll = long long; +using pii = pair<int, int>; +using vpi = 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}; + +template <typename K, typename V> +ostream &operator<<(ostream &os, const pair<K, V> &p); +template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec); +template <typename K, typename V> +ostream &operator<<(ostream &os, const map<K, V> &m); +template <typename K, typename V> +ostream &operator<<(ostream &os, const unordered_map<K, V> &m); +template <typename T> ostream &operator<<(ostream &os, const set<T> &s); +template <typename T> +ostream &operator<<(ostream &os, const unordered_set<T> &s); + +template <typename K, typename V> +ostream &operator<<(ostream &os, const pair<K, V> &p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) + os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + +template <typename K, typename V> +ostream &operator<<(ostream &os, const map<K, V> &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template <typename K, typename V> +ostream &operator<<(ostream &os, const unordered_map<K, V> &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template <typename T> ostream &operator<<(ostream &os, const set<T> &s) { + int i = 0; + os << "{"; + for (const auto &e : s) { + if (i > 0) + os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template <typename T> +ostream &operator<<(ostream &os, const unordered_set<T> &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 <typename T, typename... TS> 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 + */ + +// 2 3 2 6 7 +void solve() { + int n; + cin >> n; + vi v(n); + for (auto &x : v) { + cin >> x; + } + vi b(n); + if (v[0] != 1) { + b[0] = 1; + } else { + b[0] = 2; + } + for (int i = 1; i < n; i++) { + if (b[i - 1] != v[i] - 1) { + b[i] = b[i - 1] + 1; + } else { + b[i] = b[i - 1] + 2; + } + } + dbg(b); + cout << b[n - 1] << '\n'; + /* dbg(b[n - 1]); */ +} + +int main() { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while (tt--) { + solve(); + } +} diff --git a/contests/Round899/A/main_input0.txt b/contests/Round899/A/main_input0.txt new file mode 100644 index 0000000..d7a05b6 --- /dev/null +++ b/contests/Round899/A/main_input0.txt @@ -0,0 +1,7 @@ +3 +5 +1 3 2 6 7 +4 +2 3 4 5 +1 +1 diff --git a/contests/Round899/A/main_output0.txt b/contests/Round899/A/main_output0.txt new file mode 100644 index 0000000..626d7dd --- /dev/null +++ b/contests/Round899/A/main_output0.txt @@ -0,0 +1,3 @@ +8 +4 +2 diff --git a/contests/Round899/B/] b/contests/Round899/B/] new file mode 100644 index 0000000..b2b3325 --- /dev/null +++ b/contests/Round899/B/] @@ -0,0 +1,177 @@ +#include |