From 6411812a630e4230af27705d11f30405fbd83a68 Mon Sep 17 00:00:00 2001 From: omagdy7 Date: Mon, 20 Mar 2023 01:21:59 +0200 Subject: Solved 7 problems in Div4 --- AtCoder/+3+5+7/main | Bin 0 -> 24976 bytes AtCoder/+3+5+7/main.cpp | 183 +++++++++++++++++++++++++++ AtCoder/+3+5+7/main_input0.txt | 5 + AtCoder/+3+5+7/main_output0.txt | 4 + AtCoder/CallTheIdNumber/main | Bin 0 -> 35888 bytes AtCoder/CallTheIdNumber/main.cpp | 149 ++++++++++++++++++++++ AtCoder/CallTheIdNumber/main_input0.txt | 2 + AtCoder/CallTheIdNumber/main_input1.txt | 2 + AtCoder/CallTheIdNumber/main_output0.txt | 2 + AtCoder/CallTheIdNumber/main_output1.txt | 2 + AtCoder/MakeTakahashiHappy/main | Bin 0 -> 52192 bytes AtCoder/MakeTakahashiHappy/main.cpp | 155 +++++++++++++++++++++++ AtCoder/MakeTakahashiHappy/main_input0.txt | 4 + AtCoder/MakeTakahashiHappy/main_input1.txt | 11 ++ AtCoder/MakeTakahashiHappy/main_output0.txt | 1 + AtCoder/MakeTakahashiHappy/main_output1.txt | 1 + AtCoder/SwapOddAndEven/main | Bin 0 -> 25792 bytes AtCoder/SwapOddAndEven/main.cpp | 135 ++++++++++++++++++++ AtCoder/SwapOddAndEven/main_input0.txt | 1 + AtCoder/SwapOddAndEven/main_input1.txt | 1 + AtCoder/SwapOddAndEven/main_input2.txt | 1 + AtCoder/SwapOddAndEven/main_output0.txt | 1 + AtCoder/SwapOddAndEven/main_output1.txt | 1 + AtCoder/SwapOddAndEven/main_output2.txt | 1 + codeforces/Colourblindness/main | Bin 0 -> 25400 bytes codeforces/Colourblindness/main.cpp | 147 +++++++++++++++++++++ codeforces/Colourblindness/main_input0.txt | 19 +++ codeforces/Colourblindness/main_output0.txt | 6 + codeforces/Line/main | Bin 0 -> 42568 bytes codeforces/Line/main.cpp | 166 ++++++++++++++++++++++++ codeforces/Line/main_input0.txt | 13 ++ codeforces/Line/main_input1.txt | 3 + codeforces/Line/main_input2.txt | 3 + codeforces/Line/main_input3.txt | 3 + codeforces/Line/main_output0.txt | 6 + codeforces/Line/main_output1.txt | 1 + codeforces/Line/main_output2.txt | 1 + codeforces/Line/main_output3.txt | 1 + codeforces/SpellCheck/main | Bin 0 -> 29896 bytes codeforces/SpellCheck/main.cpp | 143 +++++++++++++++++++++ codeforces/SpellCheck/main_input0.txt | 21 +++ codeforces/SpellCheck/main_output0.txt | 10 ++ codeforces/WordGame/main | Bin 0 -> 139080 bytes codeforces/WordGame/main.cpp | 161 +++++++++++++++++++++++ codeforces/WordGame/main_input0.txt | 13 ++ codeforces/WordGame/main_output0.txt | 3 + contests/Round859(Div4)/A/main | Bin 0 -> 17688 bytes contests/Round859(Div4)/A/main.cpp | 139 ++++++++++++++++++++ contests/Round859(Div4)/A/main_input0.txt | 12 ++ contests/Round859(Div4)/A/main_output0.txt | 11 ++ contests/Round859(Div4)/B/main | Bin 0 -> 22328 bytes contests/Round859(Div4)/B/main.cpp | 150 ++++++++++++++++++++++ contests/Round859(Div4)/B/main_input0.txt | 7 + contests/Round859(Div4)/B/main_output0.txt | 3 + contests/Round859(Div4)/C/main | Bin 0 -> 17040 bytes contests/Round859(Div4)/C/main.cpp | 164 ++++++++++++++++++++++++ contests/Round859(Div4)/C/main_input0.txt | 17 +++ contests/Round859(Div4)/C/main_output0.txt | 8 ++ contests/Round859(Div4)/D/main | Bin 0 -> 26472 bytes contests/Round859(Div4)/D/main.cpp | 174 +++++++++++++++++++++++++ contests/Round859(Div4)/D/main_input0.txt | 15 +++ contests/Round859(Div4)/D/main_output0.txt | 10 ++ contests/Round859(Div4)/E/main | Bin 0 -> 34136 bytes contests/Round859(Div4)/E/main.cpp | 160 +++++++++++++++++++++++ contests/Round859(Div4)/F/main.cpp | 132 +++++++++++++++++++ contests/Round859(Div4)/G1/main | Bin 0 -> 39584 bytes contests/Round859(Div4)/G1/main.cpp | 154 ++++++++++++++++++++++ contests/Round859(Div4)/G1/main_input0.txt | 13 ++ contests/Round859(Div4)/G1/main_input1.txt | 2 + contests/Round859(Div4)/G1/main_input10.txt | 3 + contests/Round859(Div4)/G1/main_input11.txt | 3 + contests/Round859(Div4)/G1/main_input12.txt | 3 + contests/Round859(Div4)/G1/main_input2.txt | 3 + contests/Round859(Div4)/G1/main_input3.txt | 3 + contests/Round859(Div4)/G1/main_input4.txt | 3 + contests/Round859(Div4)/G1/main_input5.txt | 3 + contests/Round859(Div4)/G1/main_input6.txt | 3 + contests/Round859(Div4)/G1/main_input7.txt | 3 + contests/Round859(Div4)/G1/main_input8.txt | 3 + contests/Round859(Div4)/G1/main_input9.txt | 3 + contests/Round859(Div4)/G1/main_output0.txt | 6 + contests/Round859(Div4)/G1/main_output1.txt | 1 + contests/Round859(Div4)/G1/main_output10.txt | 1 + contests/Round859(Div4)/G1/main_output11.txt | 1 + contests/Round859(Div4)/G1/main_output12.txt | 1 + contests/Round859(Div4)/G1/main_output2.txt | 1 + contests/Round859(Div4)/G1/main_output3.txt | 1 + contests/Round859(Div4)/G1/main_output4.txt | 1 + contests/Round859(Div4)/G1/main_output5.txt | 1 + contests/Round859(Div4)/G1/main_output6.txt | 1 + contests/Round859(Div4)/G1/main_output7.txt | 1 + contests/Round859(Div4)/G1/main_output8.txt | 1 + contests/Round859(Div4)/G1/main_output9.txt | 1 + 93 files changed, 2604 insertions(+) create mode 100755 AtCoder/+3+5+7/main create mode 100755 AtCoder/+3+5+7/main.cpp create mode 100644 AtCoder/+3+5+7/main_input0.txt create mode 100644 AtCoder/+3+5+7/main_output0.txt create mode 100755 AtCoder/CallTheIdNumber/main create mode 100755 AtCoder/CallTheIdNumber/main.cpp create mode 100644 AtCoder/CallTheIdNumber/main_input0.txt create mode 100644 AtCoder/CallTheIdNumber/main_input1.txt create mode 100644 AtCoder/CallTheIdNumber/main_output0.txt create mode 100644 AtCoder/CallTheIdNumber/main_output1.txt create mode 100755 AtCoder/MakeTakahashiHappy/main create mode 100755 AtCoder/MakeTakahashiHappy/main.cpp create mode 100644 AtCoder/MakeTakahashiHappy/main_input0.txt create mode 100644 AtCoder/MakeTakahashiHappy/main_input1.txt create mode 100644 AtCoder/MakeTakahashiHappy/main_output0.txt create mode 100644 AtCoder/MakeTakahashiHappy/main_output1.txt create mode 100755 AtCoder/SwapOddAndEven/main create mode 100755 AtCoder/SwapOddAndEven/main.cpp create mode 100644 AtCoder/SwapOddAndEven/main_input0.txt create mode 100644 AtCoder/SwapOddAndEven/main_input1.txt create mode 100644 AtCoder/SwapOddAndEven/main_input2.txt create mode 100644 AtCoder/SwapOddAndEven/main_output0.txt create mode 100644 AtCoder/SwapOddAndEven/main_output1.txt create mode 100644 AtCoder/SwapOddAndEven/main_output2.txt create mode 100755 codeforces/Colourblindness/main create mode 100755 codeforces/Colourblindness/main.cpp create mode 100644 codeforces/Colourblindness/main_input0.txt create mode 100644 codeforces/Colourblindness/main_output0.txt create mode 100755 codeforces/Line/main create mode 100755 codeforces/Line/main.cpp create mode 100644 codeforces/Line/main_input0.txt create mode 100644 codeforces/Line/main_input1.txt create mode 100644 codeforces/Line/main_input2.txt create mode 100644 codeforces/Line/main_input3.txt create mode 100644 codeforces/Line/main_output0.txt create mode 100644 codeforces/Line/main_output1.txt create mode 100644 codeforces/Line/main_output2.txt create mode 100644 codeforces/Line/main_output3.txt create mode 100755 codeforces/SpellCheck/main create mode 100755 codeforces/SpellCheck/main.cpp create mode 100644 codeforces/SpellCheck/main_input0.txt create mode 100644 codeforces/SpellCheck/main_output0.txt create mode 100755 codeforces/WordGame/main create mode 100755 codeforces/WordGame/main.cpp create mode 100644 codeforces/WordGame/main_input0.txt create mode 100644 codeforces/WordGame/main_output0.txt create mode 100755 contests/Round859(Div4)/A/main create mode 100755 contests/Round859(Div4)/A/main.cpp create mode 100644 contests/Round859(Div4)/A/main_input0.txt create mode 100644 contests/Round859(Div4)/A/main_output0.txt create mode 100755 contests/Round859(Div4)/B/main create mode 100755 contests/Round859(Div4)/B/main.cpp create mode 100644 contests/Round859(Div4)/B/main_input0.txt create mode 100644 contests/Round859(Div4)/B/main_output0.txt create mode 100755 contests/Round859(Div4)/C/main create mode 100755 contests/Round859(Div4)/C/main.cpp create mode 100644 contests/Round859(Div4)/C/main_input0.txt create mode 100644 contests/Round859(Div4)/C/main_output0.txt create mode 100755 contests/Round859(Div4)/D/main create mode 100755 contests/Round859(Div4)/D/main.cpp create mode 100644 contests/Round859(Div4)/D/main_input0.txt create mode 100644 contests/Round859(Div4)/D/main_output0.txt create mode 100755 contests/Round859(Div4)/E/main create mode 100755 contests/Round859(Div4)/E/main.cpp create mode 100755 contests/Round859(Div4)/F/main.cpp create mode 100755 contests/Round859(Div4)/G1/main create mode 100755 contests/Round859(Div4)/G1/main.cpp create mode 100644 contests/Round859(Div4)/G1/main_input0.txt create mode 100644 contests/Round859(Div4)/G1/main_input1.txt create mode 100644 contests/Round859(Div4)/G1/main_input10.txt create mode 100644 contests/Round859(Div4)/G1/main_input11.txt create mode 100644 contests/Round859(Div4)/G1/main_input12.txt create mode 100644 contests/Round859(Div4)/G1/main_input2.txt create mode 100644 contests/Round859(Div4)/G1/main_input3.txt create mode 100644 contests/Round859(Div4)/G1/main_input4.txt create mode 100644 contests/Round859(Div4)/G1/main_input5.txt create mode 100644 contests/Round859(Div4)/G1/main_input6.txt create mode 100644 contests/Round859(Div4)/G1/main_input7.txt create mode 100644 contests/Round859(Div4)/G1/main_input8.txt create mode 100644 contests/Round859(Div4)/G1/main_input9.txt create mode 100644 contests/Round859(Div4)/G1/main_output0.txt create mode 100644 contests/Round859(Div4)/G1/main_output1.txt create mode 100644 contests/Round859(Div4)/G1/main_output10.txt create mode 100644 contests/Round859(Div4)/G1/main_output11.txt create mode 100644 contests/Round859(Div4)/G1/main_output12.txt create mode 100644 contests/Round859(Div4)/G1/main_output2.txt create mode 100644 contests/Round859(Div4)/G1/main_output3.txt create mode 100644 contests/Round859(Div4)/G1/main_output4.txt create mode 100644 contests/Round859(Div4)/G1/main_output5.txt create mode 100644 contests/Round859(Div4)/G1/main_output6.txt create mode 100644 contests/Round859(Div4)/G1/main_output7.txt create mode 100644 contests/Round859(Div4)/G1/main_output8.txt create mode 100644 contests/Round859(Div4)/G1/main_output9.txt diff --git a/AtCoder/+3+5+7/main b/AtCoder/+3+5+7/main new file mode 100755 index 0000000..54124e1 Binary files /dev/null and b/AtCoder/+3+5+7/main differ diff --git a/AtCoder/+3+5+7/main.cpp b/AtCoder/+3+5+7/main.cpp new file mode 100755 index 0000000..72da36d --- /dev/null +++ b/AtCoder/+3+5+7/main.cpp @@ -0,0 +1,183 @@ +#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 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 a, b, c; + cin >> a >> b >> c; + + // check if the 3 integers are already equal + if (a == b && b == c) { + cout << "0\n"; + return; + } + + + // calculate the differences between the integers + int diff1 = abs(a - b); + int diff2 = abs(b - c); + int diff3 = abs(c - a); + + // sort the differences in ascending order + int diffs[3] = {diff1, diff2, diff3}; + sort(diffs, diffs+3); + + // check if it's possible to make the integers equal + if (diffs[2] > diffs[0] + diffs[1]) { + cout << "-1\n"; + return; + } + + // calculate the number of operations needed + int operations = 0; + if (diffs[0] > 0) { + operations++; + a += 3; + b += 5; + c += 7; + diffs[0] = abs(a - b); + diffs[1] = abs(b - c); + diffs[2] = abs(c - a); + sort(diffs, diffs+3); + } + if (diffs[1] > 0) { + operations++; + a += 3; + b += 5; + c += 7; + } + if (diffs[2] > 0) { + operations++; + a += 3; + b += 5; + c += 7; + } + cout << operations << "\n"; + +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/AtCoder/+3+5+7/main_input0.txt b/AtCoder/+3+5+7/main_input0.txt new file mode 100644 index 0000000..224c309 --- /dev/null +++ b/AtCoder/+3+5+7/main_input0.txt @@ -0,0 +1,5 @@ +4 +2 8 8 +1 1 1 +5 5 10 +10 100 1000 diff --git a/AtCoder/+3+5+7/main_output0.txt b/AtCoder/+3+5+7/main_output0.txt new file mode 100644 index 0000000..19ef3e0 --- /dev/null +++ b/AtCoder/+3+5+7/main_output0.txt @@ -0,0 +1,4 @@ +2 +0 +-1 +315 diff --git a/AtCoder/CallTheIdNumber/main b/AtCoder/CallTheIdNumber/main new file mode 100755 index 0000000..a4d9237 Binary files /dev/null and b/AtCoder/CallTheIdNumber/main differ diff --git a/AtCoder/CallTheIdNumber/main.cpp b/AtCoder/CallTheIdNumber/main.cpp new file mode 100755 index 0000000..b0d575d --- /dev/null +++ b/AtCoder/CallTheIdNumber/main.cpp @@ -0,0 +1,149 @@ +#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 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 + */ +// 1 0 1 1 0 + +void solve() { + int n; + cin >> n; + vi v(n); + vector checked(n); + int len = n; + for (auto &x : v) cin >> x; + for (int i = 0; i < n; i++) { + if (!checked[i]) { + checked[v[i] - 1] = true; + len--; + } + } + cout << count(all(checked), false) << '\n'; + for (int i = 0; i < checked.size(); i++) { + if (!checked[i]) { + cout << i + 1 << ' '; + } + } + cout << '\n'; + + +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + solve(); +} + + diff --git a/AtCoder/CallTheIdNumber/main_input0.txt b/AtCoder/CallTheIdNumber/main_input0.txt new file mode 100644 index 0000000..60c723c --- /dev/null +++ b/AtCoder/CallTheIdNumber/main_input0.txt @@ -0,0 +1,2 @@ +5 +3 1 4 5 4 diff --git a/AtCoder/CallTheIdNumber/main_input1.txt b/AtCoder/CallTheIdNumber/main_input1.txt new file mode 100644 index 0000000..d4e3ed5 --- /dev/null +++ b/AtCoder/CallTheIdNumber/main_input1.txt @@ -0,0 +1,2 @@ +20 +9 7 19 7 10 4 13 9 4 8 10 15 16 3 18 19 12 13 2 12 diff --git a/AtCoder/CallTheIdNumber/main_output0.txt b/AtCoder/CallTheIdNumber/main_output0.txt new file mode 100644 index 0000000..810122a --- /dev/null +++ b/AtCoder/CallTheIdNumber/main_output0.txt @@ -0,0 +1,2 @@ +2 +2 4 diff --git a/AtCoder/CallTheIdNumber/main_output1.txt b/AtCoder/CallTheIdNumber/main_output1.txt new file mode 100644 index 0000000..78d261c --- /dev/null +++ b/AtCoder/CallTheIdNumber/main_output1.txt @@ -0,0 +1,2 @@ +10 +1 2 5 6 8 11 14 17 18 20 diff --git a/AtCoder/MakeTakahashiHappy/main b/AtCoder/MakeTakahashiHappy/main new file mode 100755 index 0000000..14e1052 Binary files /dev/null and b/AtCoder/MakeTakahashiHappy/main differ diff --git a/AtCoder/MakeTakahashiHappy/main.cpp b/AtCoder/MakeTakahashiHappy/main.cpp new file mode 100755 index 0000000..0a44517 --- /dev/null +++ b/AtCoder/MakeTakahashiHappy/main.cpp @@ -0,0 +1,155 @@ +#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 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 + */ + +bool is_valid(int x, int y, int m, int n) { + return x >= 0 && y >= 0 && x < m && y < n; +} + +void solve() { + int h, w; + cin >> h >> w; + vector grid(h, vector(w)); + for (auto &r : grid) { + for (auto &c : r) { + cin >> c; + } + } + function dfs = [&](int x, int y) { + set st; + print(x, y); + if (x == h && y == w) { + print("-------------"); + } + for (int i = 0; i < 4; i++) { + int nx = x + dx[i]; + int ny = y + dy[i]; + if (is_valid(nx, ny, h, w) && (nx != h && ny != w)) { + dfs(nx, ny); + } + } + }; + dfs(0, 0); + +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + solve(); +} + + diff --git a/AtCoder/MakeTakahashiHappy/main_input0.txt b/AtCoder/MakeTakahashiHappy/main_input0.txt new file mode 100644 index 0000000..b43496f --- /dev/null +++ b/AtCoder/MakeTakahashiHappy/main_input0.txt @@ -0,0 +1,4 @@ +3 3 +3 2 2 +2 1 3 +1 5 4 diff --git a/AtCoder/MakeTakahashiHappy/main_input1.txt b/AtCoder/MakeTakahashiHappy/main_input1.txt new file mode 100644 index 0000000..e093188 --- /dev/null +++ b/AtCoder/MakeTakahashiHappy/main_input1.txt @@ -0,0 +1,11 @@ +10 10 +1 2 3 4 5 6 7 8 9 10 +11 12 13 14 15 16 17 18 19 20 +21 22 23 24 25 26 27 28 29 30 +31 32 33 34 35 36 37 38 39 40 +41 42 43 44 45 46 47 48 49 50 +51 52 53 54 55 56 57 58 59 60 +61 62 63 64 65 66 67 68 69 70 +71 72 73 74 75 76 77 78 79 80 +81 82 83 84 85 86 87 88 89 90 +91 92 93 94 95 96 97 98 99 100 diff --git a/AtCoder/MakeTakahashiHappy/main_output0.txt b/AtCoder/MakeTakahashiHappy/main_output0.txt new file mode 100644 index 0000000..00750ed --- /dev/null +++ b/AtCoder/MakeTakahashiHappy/main_output0.txt @@ -0,0 +1 @@ +3 diff --git a/AtCoder/MakeTakahashiHappy/main_output1.txt b/AtCoder/MakeTakahashiHappy/main_output1.txt new file mode 100644 index 0000000..5307dbb --- /dev/null +++ b/AtCoder/MakeTakahashiHappy/main_output1.txt @@ -0,0 +1 @@ +48620 diff --git a/AtCoder/SwapOddAndEven/main b/AtCoder/SwapOddAndEven/main new file mode 100755 index 0000000..3dde09f Binary files /dev/null and b/AtCoder/SwapOddAndEven/main differ diff --git a/AtCoder/SwapOddAndEven/main.cpp b/AtCoder/SwapOddAndEven/main.cpp new file mode 100755 index 0000000..8d5798c --- /dev/null +++ b/AtCoder/SwapOddAndEven/main.cpp @@ -0,0 +1,135 @@ +#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 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() { + string s; + cin >> s; + string ans = ""; + for (int i = 0; i < s.size() - 1; i+=2){ + ans += s[i + 1]; + ans += s[i]; + } + cout << ans << '\n'; +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + solve(); +} + + diff --git a/AtCoder/SwapOddAndEven/main_input0.txt b/AtCoder/SwapOddAndEven/main_input0.txt new file mode 100644 index 0000000..0373d93 --- /dev/null +++ b/AtCoder/SwapOddAndEven/main_input0.txt @@ -0,0 +1 @@ +abcdef diff --git a/AtCoder/SwapOddAndEven/main_input1.txt b/AtCoder/SwapOddAndEven/main_input1.txt new file mode 100644 index 0000000..5d308e1 --- /dev/null +++ b/AtCoder/SwapOddAndEven/main_input1.txt @@ -0,0 +1 @@ +aaaa diff --git a/AtCoder/SwapOddAndEven/main_input2.txt b/AtCoder/SwapOddAndEven/main_input2.txt new file mode 100644 index 0000000..ae8bde7 --- /dev/null +++ b/AtCoder/SwapOddAndEven/main_input2.txt @@ -0,0 +1 @@ +atcoderbeginnercontest diff --git a/AtCoder/SwapOddAndEven/main_output0.txt b/AtCoder/SwapOddAndEven/main_output0.txt new file mode 100644 index 0000000..282e6cb --- /dev/null +++ b/AtCoder/SwapOddAndEven/main_output0.txt @@ -0,0 +1 @@ +badcfe diff --git a/AtCoder/SwapOddAndEven/main_output1.txt b/AtCoder/SwapOddAndEven/main_output1.txt new file mode 100644 index 0000000..5d308e1 --- /dev/null +++ b/AtCoder/SwapOddAndEven/main_output1.txt @@ -0,0 +1 @@ +aaaa diff --git a/AtCoder/SwapOddAndEven/main_output2.txt b/AtCoder/SwapOddAndEven/main_output2.txt new file mode 100644 index 0000000..f1d8ad5 --- /dev/null +++ b/AtCoder/SwapOddAndEven/main_output2.txt @@ -0,0 +1 @@ +taocedbrgeniencrnoetts diff --git a/codeforces/Colourblindness/main b/codeforces/Colourblindness/main new file mode 100755 index 0000000..532fff1 Binary files /dev/null and b/codeforces/Colourblindness/main differ diff --git a/codeforces/Colourblindness/main.cpp b/codeforces/Colourblindness/main.cpp new file mode 100755 index 0000000..1142da3 --- /dev/null +++ b/codeforces/Colourblindness/main.cpp @@ -0,0 +1,147 @@ +#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 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; + cin >> n; + vector v(2); + for (auto &s : v) { + cin >> s; + } + bool ok = true; + for (int j = 0; j < n; j++) { + char f = v[0][j]; + char s = v[1][j]; + if ((f == 'R' and s != 'R') or (s == 'R' and f != 'R')) { + cout << "NO\n"; + return; + } + } + cout << "YES\n"; +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/codeforces/Colourblindness/main_input0.txt b/codeforces/Colourblindness/main_input0.txt new file mode 100644 index 0000000..187ca0b --- /dev/null +++ b/codeforces/Colourblindness/main_input0.txt @@ -0,0 +1,19 @@ +6 +2 +RG +RB +4 +GRBG +GBGB +5 +GGGGG +BBBBB +7 +BBBBBBB +RRRRRRR +8 +RGBRRGBR +RGGRRBGR +1 +G +G diff --git a/codeforces/Colourblindness/main_output0.txt b/codeforces/Colourblindness/main_output0.txt new file mode 100644 index 0000000..60052d7 --- /dev/null +++ b/codeforces/Colourblindness/main_output0.txt @@ -0,0 +1,6 @@ +YES +NO +YES +NO +YES +YES diff --git a/codeforces/Line/main b/codeforces/Line/main new file mode 100755 index 0000000..a52a8c4 Binary files /dev/null and b/codeforces/Line/main differ diff --git a/codeforces/Line/main.cpp b/codeforces/Line/main.cpp new file mode 100755 index 0000000..7a06f97 --- /dev/null +++ b/codeforces/Line/main.cpp @@ -0,0 +1,166 @@ +#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 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; + cin >> n; + string s; + cin >> s; + ll ans = 0; + if (n == 1) { + cout << 0 << '\n'; + return; + } + for (int i = 0; i < n; i++) { + if (s[i] == 'L') { + ans += i; + } else { + ans += n - 1 - i; + } + } + vll ret; + for (int i = 0; i < n / 2; i++) { + int r = n - i - 1; + if (s[i] == 'L') { + ans += r - i; + ret.pb(ans); + } + if (s[r] == 'R') { + ans += 2 * r + 1 - n; + ret.pb(ans); + } + } + ret.pb(ans); + sort(all(ret)); + for (int i = 0; i < n; i++) { + int mn = min(i, (int)ret.size() - 1); + cout << ret[mn] << " "; + } + cout << '\n'; +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/codeforces/Line/main_input0.txt b/codeforces/Line/main_input0.txt new file mode 100644 index 0000000..89d0350 --- /dev/null +++ b/codeforces/Line/main_input0.txt @@ -0,0 +1,13 @@ +6 +3 +LLR +5 +LRRLL +1 +L +12 +LRRRLLLRLLRL +10 +LLLLLRRRRR +9 +LRLRLRLRL diff --git a/codeforces/Line/main_input1.txt b/codeforces/Line/main_input1.txt new file mode 100644 index 0000000..0fb1697 --- /dev/null +++ b/codeforces/Line/main_input1.txt @@ -0,0 +1,3 @@ +1 +2 +LL \ No newline at end of file diff --git a/codeforces/Line/main_input2.txt b/codeforces/Line/main_input2.txt new file mode 100644 index 0000000..dd63b98 --- /dev/null +++ b/codeforces/Line/main_input2.txt @@ -0,0 +1,3 @@ +1 +2 +LR \ No newline at end of file diff --git a/codeforces/Line/main_input3.txt b/codeforces/Line/main_input3.txt new file mode 100644 index 0000000..4ed6e0b --- /dev/null +++ b/codeforces/Line/main_input3.txt @@ -0,0 +1,3 @@ +1 +100 +LLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR \ No newline at end of file diff --git a/codeforces/Line/main_output0.txt b/codeforces/Line/main_output0.txt new file mode 100644 index 0000000..7112271 --- /dev/null +++ b/codeforces/Line/main_output0.txt @@ -0,0 +1,6 @@ +3 5 5 +16 16 16 16 16 +0 +86 95 98 101 102 102 102 102 102 102 102 102 +29 38 45 52 57 62 65 68 69 70 +44 50 54 56 56 56 56 56 56 diff --git a/codeforces/Line/main_output1.txt b/codeforces/Line/main_output1.txt new file mode 100644 index 0000000..6ad1e30 --- /dev/null +++ b/codeforces/Line/main_output1.txt @@ -0,0 +1 @@ +2 2 \ No newline at end of file diff --git a/codeforces/Line/main_output2.txt b/codeforces/Line/main_output2.txt new file mode 100644 index 0000000..1c6ae71 --- /dev/null +++ b/codeforces/Line/main_output2.txt @@ -0,0 +1 @@ +1 2 \ No newline at end of file diff --git a/codeforces/Line/main_output3.txt b/codeforces/Line/main_output3.txt new file mode 100644 index 0000000..a7a0df5 --- /dev/null +++ b/codeforces/Line/main_output3.txt @@ -0,0 +1 @@ +1 2 3 4 5 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 \ No newline at end of file diff --git a/codeforces/SpellCheck/main b/codeforces/SpellCheck/main new file mode 100755 index 0000000..5b26632 Binary files /dev/null and b/codeforces/SpellCheck/main differ diff --git a/codeforces/SpellCheck/main.cpp b/codeforces/SpellCheck/main.cpp new file mode 100755 index 0000000..c1be581 --- /dev/null +++ b/codeforces/SpellCheck/main.cpp @@ -0,0 +1,143 @@ +#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 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; + cin >> n; + string s; + cin >> s; + sort(all(s)); + print(s); + if (s == "Timru") { + 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/codeforces/SpellCheck/main_input0.txt b/codeforces/SpellCheck/main_input0.txt new file mode 100644 index 0000000..d8e5471 --- /dev/null +++ b/codeforces/SpellCheck/main_input0.txt @@ -0,0 +1,21 @@ +10 +5 +Timur +5 +miurT +5 +Trumi +5 +mriTu +5 +timur +4 +Timr +6 +Timuur +10 +codeforces +10 +TimurTimur +5 +TIMUR diff --git a/codeforces/SpellCheck/main_output0.txt b/codeforces/SpellCheck/main_output0.txt new file mode 100644 index 0000000..fbba558 --- /dev/null +++ b/codeforces/SpellCheck/main_output0.txt @@ -0,0 +1,10 @@ +YES +YES +YES +YES +NO +NO +NO +NO +NO +NO diff --git a/codeforces/WordGame/main b/codeforces/WordGame/main new file mode 100755 index 0000000..e8c358b Binary files /dev/null and b/codeforces/WordGame/main differ diff --git a/codeforces/WordGame/main.cpp b/codeforces/WordGame/main.cpp new file mode 100755 index 0000000..47effe0 --- /dev/null +++ b/codeforces/WordGame/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 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; + cin >> n; + vector> v(3, vector(n)); + unordered_map>> fq; + set st; + for (int i = 0; i < 3; i++) { + for (int j = 0; j < n; j++) { + string s; + cin >> s; + v[i][j] = s; + st.insert(s); + fq[s].first++; + fq[s].second.pb(i); + } + } + vi ans(3); + for (auto s : st) { + auto x = fq[s]; + if (x.first == 1) { + ans[x.second[0]] += 3; + } else if (x.first == 2) { + for (auto e : x.second) { + ans[e] += 1; + } + } + } + for (auto x : ans) { + cout << x << " "; + } + cout << '\n'; +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/codeforces/WordGame/main_input0.txt b/codeforces/WordGame/main_input0.txt new file mode 100644 index 0000000..b10577d --- /dev/null +++ b/codeforces/WordGame/main_input0.txt @@ -0,0 +1,13 @@ +3 +1 +abc +def +abc +3 +orz for qaq +qaq orz for +cod for ces +5 +iat roc hem ica lly +bac ter iol ogi sts +bac roc lly iol iat diff --git a/codeforces/WordGame/main_output0.txt b/codeforces/WordGame/main_output0.txt new file mode 100644 index 0000000..ccde6af --- /dev/null +++ b/codeforces/WordGame/main_output0.txt @@ -0,0 +1,3 @@ +1 3 1 +2 2 6 +9 11 5 diff --git a/contests/Round859(Div4)/A/main b/contests/Round859(Div4)/A/main new file mode 100755 index 0000000..bc6e935 Binary files /dev/null and b/contests/Round859(Div4)/A/main differ diff --git a/contests/Round859(Div4)/A/main.cpp b/contests/Round859(Div4)/A/main.cpp new file mode 100755 index 0000000..333bd0b --- /dev/null +++ b/contests/Round859(Div4)/A/main.cpp @@ -0,0 +1,139 @@ +#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 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 a, b, c; + cin >> a >> b >> c; + if (a + b == c) { + cout << "+" << '\n'; + } else { + cout << "-" << '\n'; + } + +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/contests/Round859(Div4)/A/main_input0.txt b/contests/Round859(Div4)/A/main_input0.txt new file mode 100644 index 0000000..91dc315 --- /dev/null +++ b/contests/Round859(Div4)/A/main_input0.txt @@ -0,0 +1,12 @@ +11 +1 2 3 +3 2 1 +2 9 -7 +3 4 7 +1 1 2 +1 1 0 +3 3 6 +9 9 18 +9 9 0 +1 9 -8 +1 9 10 diff --git a/contests/Round859(Div4)/A/main_output0.txt b/contests/Round859(Div4)/A/main_output0.txt new file mode 100644 index 0000000..a4d808b --- /dev/null +++ b/contests/Round859(Div4)/A/main_output0.txt @@ -0,0 +1,11 @@ ++ +- +- ++ ++ +- ++ ++ +- +- ++ diff --git a/contests/Round859(Div4)/B/main b/contests/Round859(Div4)/B/main new file mode 100755 index 0000000..9c85033 Binary files /dev/null and b/contests/Round859(Div4)/B/main differ diff --git a/contests/Round859(Div4)/B/main.cpp b/contests/Round859(Div4)/B/main.cpp new file mode 100755 index 0000000..0c93911 --- /dev/null +++ b/contests/Round859(Div4)/B/main.cpp @@ -0,0 +1,150 @@ +#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 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; + cin >> n; + vi v(n); + for (auto &x : v) cin >> x; + int even = 0; + int odd = 0; + for (int i = 0; i < n; i++) { + if (v[i] & 1) { + odd += v[i]; + } else { + even += v[i]; + } + } + if (even > odd) { + 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/Round859(Div4)/B/main_input0.txt b/contests/Round859(Div4)/B/main_input0.txt new file mode 100644 index 0000000..bdafd50 --- /dev/null +++ b/contests/Round859(Div4)/B/main_input0.txt @@ -0,0 +1,7 @@ +3 +4 +1 2 3 4 +4 +1 1 1 2 +3 +1 4 3 diff --git a/contests/Round859(Div4)/B/main_output0.txt b/contests/Round859(Div4)/B/main_output0.txt new file mode 100644 index 0000000..c6e03a3 --- /dev/null +++ b/contests/Round859(Div4)/B/main_output0.txt @@ -0,0 +1,3 @@ +YES +NO +NO diff --git a/contests/Round859(Div4)/C/main b/contests/Round859(Div4)/C/main new file mode 100755 index 0000000..17ac24c Binary files /dev/null and b/contests/Round859(Div4)/C/main differ diff --git a/contests/Round859(Div4)/C/main.cpp b/contests/Round859(Div4)/C/main.cpp new file mode 100755 index 0000000..566b95c --- /dev/null +++ b/contests/Round859(Div4)/C/main.cpp @@ -0,0 +1,164 @@ +#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 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; + cin >> n; + string s; + cin >> s; + set st1; + set st2; + for (int i = 0; i < n; i+=2) { + st1.insert(s[i]); + } + for (int i = 1; i < n; i++) { + st2.insert(s[i]); + } + for (auto ch : st1) { + for (int i = 0; i < n ; i++) { + if (s[i] == ch) { + s[i] = '0'; + } + } + } + for (auto ch : st2) { + for (int i = 0; i < n ; i++) { + if (s[i] == ch) { + s[i] = '1'; + } + } + } + for (int i = 0; i < n - 1; i++) { + if (s[i] == s[i + 1]) { + cout << "NO\n"; + return; + } + } + cout << "YES\n"; +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/contests/Round859(Div4)/C/main_input0.txt b/contests/Round859(Div4)/C/main_input0.txt new file mode 100644 index 0000000..e3b21b8 --- /dev/null +++ b/contests/Round859(Div4)/C/main_input0.txt @@ -0,0 +1,17 @@ +8 +7 +abacaba +2 +aa +1 +y +4 +bkpt +6 +ninfia +6 +banana +10 +codeforces +8 +testcase diff --git a/contests/Round859(Div4)/C/main_output0.txt b/contests/Round859(Div4)/C/main_output0.txt new file mode 100644 index 0000000..3876667 --- /dev/null +++ b/contests/Round859(Div4)/C/main_output0.txt @@ -0,0 +1,8 @@ +YES +NO +YES +YES +NO +YES +NO +NO diff --git a/contests/Round859(Div4)/D/main b/contests/Round859(Div4)/D/main new file mode 100755 index 0000000..7778923 Binary files /dev/null and b/contests/Round859(Div4)/D/main differ diff --git a/contests/Round859(Div4)/D/main.cpp b/contests/Round859(Div4)/D/main.cpp new file mode 100755 index 0000000..62f9db4 --- /dev/null +++ b/contests/Round859(Div4)/D/main.cpp @@ -0,0 +1,174 @@ +#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