From ef9dfb5d8bfa705a0c056a2652d298e5ebb763fb Mon Sep 17 00:00:00 2001 From: omagdy7 Date: Wed, 22 Feb 2023 20:18:04 +0200 Subject: Solved a bunch of problems --- contests/Starters78/A/main | Bin 0 -> 47328 bytes contests/Starters78/A/main.cpp | 94 ++++++++++++++++++++++++++ contests/Starters78/A/main_input0.txt | 7 ++ contests/Starters78/A/main_output0.txt | 3 + contests/Starters78/B/main | Bin 0 -> 17688 bytes contests/Starters78/B/main.cpp | 109 ++++++++++++++++++++++++++++++ contests/Starters78/B/main_input0.txt | 4 ++ contests/Starters78/B/main_input1.txt | 2 + contests/Starters78/B/main_input2.txt | 2 + contests/Starters78/B/main_input3.txt | 2 + contests/Starters78/B/main_input4.txt | 2 + contests/Starters78/B/main_input5.txt | 2 + contests/Starters78/B/main_input6.txt | 2 + contests/Starters78/B/main_input7.txt | 2 + contests/Starters78/B/main_output0.txt | 3 + contests/Starters78/B/main_output1.txt | 1 + contests/Starters78/B/main_output2.txt | 1 + contests/Starters78/B/main_output3.txt | 1 + contests/Starters78/B/main_output4.txt | 1 + contests/Starters78/B/main_output5.txt | 1 + contests/Starters78/B/main_output6.txt | 1 + contests/Starters78/B/main_output7.txt | 1 + contests/Starters78/C/main | Bin 0 -> 17848 bytes contests/Starters78/C/main.cpp | 113 +++++++++++++++++++++++++++++++ contests/Starters78/C/main_input0.txt | 4 ++ contests/Starters78/C/main_input1.txt | 2 + contests/Starters78/C/main_output0.txt | 3 + contests/Starters78/C/main_output1.txt | 1 + contests/Starters78/D/main | Bin 0 -> 57544 bytes contests/Starters78/D/main.cpp | 117 +++++++++++++++++++++++++++++++++ contests/Starters78/D/main_input0.txt | 13 ++++ contests/Starters78/D/main_input1.txt | 4 ++ contests/Starters78/D/main_input2.txt | 4 ++ contests/Starters78/D/main_input3.txt | 4 ++ contests/Starters78/D/main_output0.txt | 4 ++ contests/Starters78/D/main_output1.txt | 1 + contests/Starters78/D/main_output2.txt | 1 + contests/Starters78/D/main_output3.txt | 1 + contests/Starters78/E/main.cpp | 89 +++++++++++++++++++++++++ contests/Starters78/F/main.cpp | 89 +++++++++++++++++++++++++ 40 files changed, 691 insertions(+) create mode 100755 contests/Starters78/A/main create mode 100755 contests/Starters78/A/main.cpp create mode 100644 contests/Starters78/A/main_input0.txt create mode 100644 contests/Starters78/A/main_output0.txt create mode 100755 contests/Starters78/B/main create mode 100755 contests/Starters78/B/main.cpp create mode 100644 contests/Starters78/B/main_input0.txt create mode 100644 contests/Starters78/B/main_input1.txt create mode 100644 contests/Starters78/B/main_input2.txt create mode 100644 contests/Starters78/B/main_input3.txt create mode 100644 contests/Starters78/B/main_input4.txt create mode 100644 contests/Starters78/B/main_input5.txt create mode 100644 contests/Starters78/B/main_input6.txt create mode 100644 contests/Starters78/B/main_input7.txt create mode 100644 contests/Starters78/B/main_output0.txt create mode 100644 contests/Starters78/B/main_output1.txt create mode 100644 contests/Starters78/B/main_output2.txt create mode 100644 contests/Starters78/B/main_output3.txt create mode 100644 contests/Starters78/B/main_output4.txt create mode 100644 contests/Starters78/B/main_output5.txt create mode 100644 contests/Starters78/B/main_output6.txt create mode 100644 contests/Starters78/B/main_output7.txt create mode 100755 contests/Starters78/C/main create mode 100755 contests/Starters78/C/main.cpp create mode 100644 contests/Starters78/C/main_input0.txt create mode 100644 contests/Starters78/C/main_input1.txt create mode 100644 contests/Starters78/C/main_output0.txt create mode 100644 contests/Starters78/C/main_output1.txt create mode 100755 contests/Starters78/D/main create mode 100755 contests/Starters78/D/main.cpp create mode 100644 contests/Starters78/D/main_input0.txt create mode 100644 contests/Starters78/D/main_input1.txt create mode 100644 contests/Starters78/D/main_input2.txt create mode 100644 contests/Starters78/D/main_input3.txt create mode 100644 contests/Starters78/D/main_output0.txt create mode 100644 contests/Starters78/D/main_output1.txt create mode 100644 contests/Starters78/D/main_output2.txt create mode 100644 contests/Starters78/D/main_output3.txt create mode 100755 contests/Starters78/E/main.cpp create mode 100755 contests/Starters78/F/main.cpp (limited to 'contests/Starters78') diff --git a/contests/Starters78/A/main b/contests/Starters78/A/main new file mode 100755 index 0000000..670aa7e Binary files /dev/null and b/contests/Starters78/A/main differ diff --git a/contests/Starters78/A/main.cpp b/contests/Starters78/A/main.cpp new file mode 100755 index 0000000..411b7ee --- /dev/null +++ b/contests/Starters78/A/main.cpp @@ -0,0 +1,94 @@ +#include +using namespace std; + +using ll = long long; +using pi = 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 + +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 +void printm(const map &mp) { + cerr << "{" << endl; + for (auto p : mp) { + cerr << " { " << p.first << " : " << p.second << " }\n"; + } + cerr << "}" << endl; +} +template +void printv(const vector &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 +void printvv(const vector> &v) { + cerr << "[\n"; + for (auto &vec : v) { + cout << " "; + printv(vec); + } + cerr << "]\n"; +} +void print() { + cerr << "\n"; +} + +template +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, x; + cin >> n >> x; + vi v(n); + for (auto &x : v) cin >> x; + sort(rall(v)); + cout << v[x - 1] - 1 << '\n'; +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/contests/Starters78/A/main_input0.txt b/contests/Starters78/A/main_input0.txt new file mode 100644 index 0000000..0a0258a --- /dev/null +++ b/contests/Starters78/A/main_input0.txt @@ -0,0 +1,7 @@ +3 +2 2 +5 1 +4 1 +5 1 7 4 +4 3 +15 70 100 31 diff --git a/contests/Starters78/A/main_output0.txt b/contests/Starters78/A/main_output0.txt new file mode 100644 index 0000000..288d060 --- /dev/null +++ b/contests/Starters78/A/main_output0.txt @@ -0,0 +1,3 @@ +0 +6 +30 diff --git a/contests/Starters78/B/main b/contests/Starters78/B/main new file mode 100755 index 0000000..0e36586 Binary files /dev/null and b/contests/Starters78/B/main differ diff --git a/contests/Starters78/B/main.cpp b/contests/Starters78/B/main.cpp new file mode 100755 index 0000000..d5c6cce --- /dev/null +++ b/contests/Starters78/B/main.cpp @@ -0,0 +1,109 @@ +#include +using namespace std; + +using ll = long long; +using pi = 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 + +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 void printm(const map &mp) { + cerr << "{" << endl; + for (auto p : mp) { + cerr << " { " << p.first << " : " << p.second << " }\n"; + } + cerr << "}" << endl; +} +template void printv(const vector &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 void printvv(const vector> &v) { + cerr << "[\n"; + for (auto &vec : v) { + cout << " "; + printv(vec); + } + cerr << "]\n"; +} +void print() { cerr << "\n"; } + +template 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, x; + cin >> n >> x; + if ((x < 0 && n - abs(x) < 1) || (x > 0 && n + 1 < x)) { + cout << "-1\n"; + return; + } + if (x == 0) { + for (int i = 0; i < n - 1; i++) { + cout << "*"; + } + cout << "-\n"; + return; + } + if (x > 0) { + for (int i = 0; i < n - abs(x) + 1; i++) { + cout << "*"; + } + for (int i = 0; i < abs(x) - 1; i++) { + cout << "+"; + } + } else { + for (int i = 0; i < n - abs(x) - 1; i++) { + cout << "*"; + } + for (int i = 0; i < abs(x) + 1; i++) { + cout << "-"; + } + + } + cout << '\n'; +} + +int main() { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while (tt--) { + solve(); + } +} diff --git a/contests/Starters78/B/main_input0.txt b/contests/Starters78/B/main_input0.txt new file mode 100644 index 0000000..1867e89 --- /dev/null +++ b/contests/Starters78/B/main_input0.txt @@ -0,0 +1,4 @@ +3 +3 4 +2 -5 +3 1 diff --git a/contests/Starters78/B/main_input1.txt b/contests/Starters78/B/main_input1.txt new file mode 100644 index 0000000..2269299 --- /dev/null +++ b/contests/Starters78/B/main_input1.txt @@ -0,0 +1,2 @@ +1 +7 0 \ No newline at end of file diff --git a/contests/Starters78/B/main_input2.txt b/contests/Starters78/B/main_input2.txt new file mode 100644 index 0000000..378d966 --- /dev/null +++ b/contests/Starters78/B/main_input2.txt @@ -0,0 +1,2 @@ +1 +7 -5 \ No newline at end of file diff --git a/contests/Starters78/B/main_input3.txt b/contests/Starters78/B/main_input3.txt new file mode 100644 index 0000000..2269299 --- /dev/null +++ b/contests/Starters78/B/main_input3.txt @@ -0,0 +1,2 @@ +1 +7 0 \ No newline at end of file diff --git a/contests/Starters78/B/main_input4.txt b/contests/Starters78/B/main_input4.txt new file mode 100644 index 0000000..250b313 --- /dev/null +++ b/contests/Starters78/B/main_input4.txt @@ -0,0 +1,2 @@ +1 +2 2 \ No newline at end of file diff --git a/contests/Starters78/B/main_input5.txt b/contests/Starters78/B/main_input5.txt new file mode 100644 index 0000000..563e0d2 --- /dev/null +++ b/contests/Starters78/B/main_input5.txt @@ -0,0 +1,2 @@ +1 +4 -5 \ No newline at end of file diff --git a/contests/Starters78/B/main_input6.txt b/contests/Starters78/B/main_input6.txt new file mode 100644 index 0000000..76f9fe1 --- /dev/null +++ b/contests/Starters78/B/main_input6.txt @@ -0,0 +1,2 @@ +1 +6 -5 \ No newline at end of file diff --git a/contests/Starters78/B/main_input7.txt b/contests/Starters78/B/main_input7.txt new file mode 100644 index 0000000..378d966 --- /dev/null +++ b/contests/Starters78/B/main_input7.txt @@ -0,0 +1,2 @@ +1 +7 -5 \ No newline at end of file diff --git a/contests/Starters78/B/main_output0.txt b/contests/Starters78/B/main_output0.txt new file mode 100644 index 0000000..45554cc --- /dev/null +++ b/contests/Starters78/B/main_output0.txt @@ -0,0 +1,3 @@ ++++ +-1 +*+- diff --git a/contests/Starters78/B/main_output1.txt b/contests/Starters78/B/main_output1.txt new file mode 100644 index 0000000..5e1d35c --- /dev/null +++ b/contests/Starters78/B/main_output1.txt @@ -0,0 +1 @@ +******- \ No newline at end of file diff --git a/contests/Starters78/B/main_output2.txt b/contests/Starters78/B/main_output2.txt new file mode 100644 index 0000000..1092cca --- /dev/null +++ b/contests/Starters78/B/main_output2.txt @@ -0,0 +1 @@ +*------ \ No newline at end of file diff --git a/contests/Starters78/B/main_output3.txt b/contests/Starters78/B/main_output3.txt new file mode 100644 index 0000000..5e1d35c --- /dev/null +++ b/contests/Starters78/B/main_output3.txt @@ -0,0 +1 @@ +******- \ No newline at end of file diff --git a/contests/Starters78/B/main_output4.txt b/contests/Starters78/B/main_output4.txt new file mode 100644 index 0000000..67a4ed1 --- /dev/null +++ b/contests/Starters78/B/main_output4.txt @@ -0,0 +1 @@ +*+ \ No newline at end of file diff --git a/contests/Starters78/B/main_output5.txt b/contests/Starters78/B/main_output5.txt new file mode 100644 index 0000000..d7d17fc --- /dev/null +++ b/contests/Starters78/B/main_output5.txt @@ -0,0 +1 @@ +-1 \ No newline at end of file diff --git a/contests/Starters78/B/main_output6.txt b/contests/Starters78/B/main_output6.txt new file mode 100644 index 0000000..8a8f91e --- /dev/null +++ b/contests/Starters78/B/main_output6.txt @@ -0,0 +1 @@ +------ \ No newline at end of file diff --git a/contests/Starters78/B/main_output7.txt b/contests/Starters78/B/main_output7.txt new file mode 100644 index 0000000..1092cca --- /dev/null +++ b/contests/Starters78/B/main_output7.txt @@ -0,0 +1 @@ +*------ \ No newline at end of file diff --git a/contests/Starters78/C/main b/contests/Starters78/C/main new file mode 100755 index 0000000..5162083 Binary files /dev/null and b/contests/Starters78/C/main differ diff --git a/contests/Starters78/C/main.cpp b/contests/Starters78/C/main.cpp new file mode 100755 index 0000000..26558b5 --- /dev/null +++ b/contests/Starters78/C/main.cpp @@ -0,0 +1,113 @@ +#include +using namespace std; + +using ll = long long; +using pi = 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 + +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 +void printm(const map &mp) { + cerr << "{" << endl; + for (auto p : mp) { + cerr << " { " << p.first << " : " << p.second << " }\n"; + } + cerr << "}" << endl; +} +template +void printv(const vector &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 +void printvv(const vector> &v) { + cerr << "[\n"; + for (auto &vec : v) { + cout << " "; + printv(vec); + } + cerr << "]\n"; +} +void print() { + cerr << "\n"; +} + +template +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; + if (n == 1) { + cout << 1 << " " << 4 << " " << 3 << " " << 2 << '\n'; + return; + } + if (n == 0) { + cout << 1 << " " << 3 << " " << 4 << " " << 5 << '\n'; + return; + } + if (n == 3) { + cout << 2 << " " << 4 << " " << 5 << " " << 6 << '\n'; + return; + } + if (n == 5) { + cout << 2 << " " << 4 << " " << 8 << " " << 13 << '\n'; + return; + } + cout << 2 << " " << 4 << " " << 1 << " "; + if (n % 2 == 0) { + cout << n + 1 << '\n'; + } else { + cout << n - 1 << '\n'; + } + +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/contests/Starters78/C/main_input0.txt b/contests/Starters78/C/main_input0.txt new file mode 100644 index 0000000..048ea83 --- /dev/null +++ b/contests/Starters78/C/main_input0.txt @@ -0,0 +1,4 @@ +3 +1 +2 +3221225472 diff --git a/contests/Starters78/C/main_input1.txt b/contests/Starters78/C/main_input1.txt new file mode 100644 index 0000000..c396a2c --- /dev/null +++ b/contests/Starters78/C/main_input1.txt @@ -0,0 +1,2 @@ +1 +3 \ No newline at end of file diff --git a/contests/Starters78/C/main_output0.txt b/contests/Starters78/C/main_output0.txt new file mode 100644 index 0000000..a201e4d --- /dev/null +++ b/contests/Starters78/C/main_output0.txt @@ -0,0 +1,3 @@ +1 4 3 2 +2 4 3 1 +920426639 955944413 754668683 4244364431 diff --git a/contests/Starters78/C/main_output1.txt b/contests/Starters78/C/main_output1.txt new file mode 100644 index 0000000..0adc443 --- /dev/null +++ b/contests/Starters78/C/main_output1.txt @@ -0,0 +1 @@ +2 4 1 3 \ No newline at end of file diff --git a/contests/Starters78/D/main b/contests/Starters78/D/main new file mode 100755 index 0000000..15f5057 Binary files /dev/null and b/contests/Starters78/D/main differ diff --git a/contests/Starters78/D/main.cpp b/contests/Starters78/D/main.cpp new file mode 100755 index 0000000..3865920 --- /dev/null +++ b/contests/Starters78/D/main.cpp @@ -0,0 +1,117 @@ +#include +using namespace std; + +using ll = long long; +using pi = 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 + +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 +void printm(const map &mp) { + cerr << "{" << endl; + for (auto p : mp) { + cerr << " { " << p.first << " : " << p.second << " }\n"; + } + cerr << "}" << endl; +} +template +void printv(const vector &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 +void printvv(const vector> &v) { + cerr << "[\n"; + for (auto &vec : v) { + cout << " "; + printv(vec); + } + cerr << "]\n"; +} +void print() { + cerr << "\n"; +} + +template +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, t; + cin >> n >> t; + vll p(n), b(n); + int ans = 0; + for (auto &x : p) cin >> x; + for (auto &x : b) cin >> x; + vector> tot(n); + for (int i = 0; i < n; i++) { + tot[i].first = p[i] + b[i]; + tot[i].second = i; + } + sort(all(tot)); + vector vis(n); + for (int i = 0; i < n; i++) { + if (t - tot[i].first >= 0) { + vis[tot[i].second] = true; + ans++; + t -= tot[i].first; + } + } + for (int i = 0; i < n; i++) { + if (t - p[i] >= 0 && !vis[i]) { + vis[i] = true; + ans++; + break; + } + } + 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/Starters78/D/main_input0.txt b/contests/Starters78/D/main_input0.txt new file mode 100644 index 0000000..9fd2186 --- /dev/null +++ b/contests/Starters78/D/main_input0.txt @@ -0,0 +1,13 @@ +4 +3 10 +3 4 5 +2 4 2 +3 8 +3 4 5 +2 4 2 +5 20 +23 54 124 54 83 +2 9 5 2 10 +5 20 +4 7 12 34 13 +30 4 3 0 9 diff --git a/contests/Starters78/D/main_input1.txt b/contests/Starters78/D/main_input1.txt new file mode 100644 index 0000000..af1185d --- /dev/null +++ b/contests/Starters78/D/main_input1.txt @@ -0,0 +1,4 @@ +1 +3 10 +3 5 4 +2 2 4 \ No newline at end of file diff --git a/contests/Starters78/D/main_input2.txt b/contests/Starters78/D/main_input2.txt new file mode 100644 index 0000000..243b7d4 --- /dev/null +++ b/contests/Starters78/D/main_input2.txt @@ -0,0 +1,4 @@ +1 +3 10 +3 1 2 +2 2 1 \ No newline at end of file diff --git a/contests/Starters78/D/main_input3.txt b/contests/Starters78/D/main_input3.txt new file mode 100644 index 0000000..39b2ff9 --- /dev/null +++ b/contests/Starters78/D/main_input3.txt @@ -0,0 +1,4 @@ +1 +3 10 +3 1 2 +2 3 1 \ No newline at end of file diff --git a/contests/Starters78/D/main_output0.txt b/contests/Starters78/D/main_output0.txt new file mode 100644 index 0000000..9efd8d1 --- /dev/null +++ b/contests/Starters78/D/main_output0.txt @@ -0,0 +1,4 @@ +2 +1 +0 +2 diff --git a/contests/Starters78/D/main_output1.txt b/contests/Starters78/D/main_output1.txt new file mode 100644 index 0000000..d8263ee --- /dev/null +++ b/contests/Starters78/D/main_output1.txt @@ -0,0 +1 @@ +2 \ No newline at end of file diff --git a/contests/Starters78/D/main_output2.txt b/contests/Starters78/D/main_output2.txt new file mode 100644 index 0000000..e440e5c --- /dev/null +++ b/contests/Starters78/D/main_output2.txt @@ -0,0 +1 @@ +3 \ No newline at end of file diff --git a/contests/Starters78/D/main_output3.txt b/contests/Starters78/D/main_output3.txt new file mode 100644 index 0000000..d8263ee --- /dev/null +++ b/contests/Starters78/D/main_output3.txt @@ -0,0 +1 @@ +2 \ No newline at end of file diff --git a/contests/Starters78/E/main.cpp b/contests/Starters78/E/main.cpp new file mode 100755 index 0000000..7590c13 --- /dev/null +++ b/contests/Starters78/E/main.cpp @@ -0,0 +1,89 @@ +#include +using namespace std; + +using ll = long long; +using pi = 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 + +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 +void printm(const map &mp) { + cerr << "{" << endl; + for (auto p : mp) { + cerr << " { " << p.first << " : " << p.second << " }\n"; + } + cerr << "}" << endl; +} +template +void printv(const vector &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 +void printvv(const vector> &v) { + cerr << "[\n"; + for (auto &vec : v) { + cout << " "; + printv(vec); + } + cerr << "]\n"; +} +void print() { + cerr << "\n"; +} + +template +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/Starters78/F/main.cpp b/contests/Starters78/F/main.cpp new file mode 100755 index 0000000..7590c13 --- /dev/null +++ b/contests/Starters78/F/main.cpp @@ -0,0 +1,89 @@ +#include +using namespace std; + +using ll = long long; +using pi = 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 + +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 +void printm(const map &mp) { + cerr << "{" << endl; + for (auto p : mp) { + cerr << " { " << p.first << " : " << p.second << " }\n"; + } + cerr << "}" << endl; +} +template +void printv(const vector &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 +void printvv(const vector> &v) { + cerr << "[\n"; + for (auto &vec : v) { + cout << " "; + printv(vec); + } + cerr << "]\n"; +} +void print() { + cerr << "\n"; +} + +template +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(); + } +} + + -- cgit v1.2.3