From 90c03b3c6301f5d8908ce3e2dec936a74b035014 Mon Sep 17 00:00:00 2001 From: omagdy7 Date: Sun, 5 Mar 2023 20:04:34 +0200 Subject: Solved a bunch of problems --- codechef/ConcatPalindrome/main | Bin 0 -> 48736 bytes codechef/ConcatPalindrome/main.cpp | 130 +++++++++++++++++++++ codechef/ConcatPalindrome/main_input0.txt | 13 +++ codechef/ConcatPalindrome/main_input1.txt | 4 + codechef/ConcatPalindrome/main_input2.txt | 4 + codechef/ConcatPalindrome/main_output0.txt | 4 + codechef/ConcatPalindrome/main_output1.txt | 1 + codechef/ConcatPalindrome/main_output2.txt | 1 + codechef/MinimizeTheMaximum/main | Bin 0 -> 32736 bytes codechef/MinimizeTheMaximum/main.cpp | 109 +++++++++++++++++ codechef/MinimizeTheMaximum/main_input0.txt | 7 ++ codechef/MinimizeTheMaximum/main_output0.txt | 3 + codechef/Tekken/main | Bin 0 -> 17928 bytes codechef/Tekken/main.cpp | 98 ++++++++++++++++ codechef/Tekken/main_input0.txt | 4 + codechef/Tekken/main_output0.txt | 3 + codeforces/Asterisk-MinorTemplate/main | Bin 0 -> 37304 bytes codeforces/Asterisk-MinorTemplate/main.cpp | 123 +++++++++++++++++++ codeforces/Asterisk-MinorTemplate/main_input0.txt | 13 +++ codeforces/Asterisk-MinorTemplate/main_output0.txt | 10 ++ codeforces/CompleteTheWord/main.cpp | 92 +++++++++++++++ codeforces/CrazyComputer/main | Bin 0 -> 22480 bytes codeforces/CrazyComputer/main.cpp | 98 ++++++++++++++++ codeforces/CrazyComputer/main_input0.txt | 2 + codeforces/CrazyComputer/main_input1.txt | 2 + codeforces/CrazyComputer/main_output0.txt | 1 + codeforces/CrazyComputer/main_output1.txt | 1 + codeforces/TypicalInterviewProblem/main | Bin 0 -> 605664 bytes codeforces/TypicalInterviewProblem/main.cpp | 102 ++++++++++++++++ codeforces/TypicalInterviewProblem/main_input0.txt | 7 ++ .../TypicalInterviewProblem/main_output0.txt | 3 + contests/Round#853/A/main | Bin 0 -> 43664 bytes contests/Round#853/A/main.cpp | 116 ++++++++++++++++++ contests/Round#853/A/main_input0.txt | 13 +++ contests/Round#853/A/main_output0.txt | 6 + "contests/Round#853/B/\\" | 105 +++++++++++++++++ contests/Round#853/B/main | Bin 0 -> 50488 bytes contests/Round#853/B/main.cpp | 107 +++++++++++++++++ contests/Round#853/B/main_input0.txt | 7 ++ contests/Round#853/B/main_input1.txt | 3 + contests/Round#853/B/main_input2.txt | 3 + contests/Round#853/B/main_input3.txt | 3 + contests/Round#853/B/main_input4.txt | 3 + contests/Round#853/B/main_input5.txt | 3 + contests/Round#853/B/main_input6.txt | 3 + contests/Round#853/B/main_input7.txt | 3 + contests/Round#853/B/main_output0.txt | 3 + contests/Round#853/B/main_output1.txt | 1 + contests/Round#853/B/main_output2.txt | 1 + contests/Round#853/B/main_output3.txt | 1 + contests/Round#853/B/main_output4.txt | 1 + contests/Round#853/B/main_output5.txt | 1 + contests/Round#853/B/main_output6.txt | 1 + contests/Round#853/B/main_output7.txt | 1 + contests/Round#853/C/main.cpp | 89 ++++++++++++++ contests/Round#853/D/main.cpp | 89 ++++++++++++++ contests/Round#853/E/main.cpp | 89 ++++++++++++++ contests/Round#853/F/main.cpp | 89 ++++++++++++++ contests/Round#855(Div3)/A/main | Bin 0 -> 600032 bytes contests/Round#855(Div3)/A/main.cpp | 101 ++++++++++++++++ contests/Round#855(Div3)/A/main_input0.txt | 15 +++ contests/Round#855(Div3)/A/main_output0.txt | 7 ++ contests/Round#855(Div3)/B/main | Bin 0 -> 50880 bytes contests/Round#855(Div3)/B/main.cpp | 113 ++++++++++++++++++ contests/Round#855(Div3)/B/main_input0.txt | 11 ++ contests/Round#855(Div3)/B/main_input1.txt | 3 + contests/Round#855(Div3)/B/main_output0.txt | 5 + contests/Round#855(Div3)/B/main_output1.txt | 1 + contests/Round#855(Div3)/C/main | Bin 0 -> 35160 bytes contests/Round#855(Div3)/C/main.cpp | 107 +++++++++++++++++ contests/Round#855(Div3)/C/main_input0.txt | 11 ++ contests/Round#855(Div3)/C/main_output0.txt | 5 + contests/Round#855(Div3)/D/main | Bin 0 -> 18456 bytes contests/Round#855(Div3)/D/main.cpp | 98 ++++++++++++++++ contests/Round#855(Div3)/D/main_input0.txt | 15 +++ contests/Round#855(Div3)/D/main_output0.txt | 7 ++ contests/Round#855(Div3)/E/main.cpp | 89 ++++++++++++++ contests/Round#855(Div3)/F/main.cpp | 89 ++++++++++++++ contests/Round#856(Div2)/A/main | Bin 0 -> 82000 bytes contests/Round#856(Div2)/A/main.cpp | 108 +++++++++++++++++ contests/Round#856(Div2)/A/main_input0.txt | 11 ++ contests/Round#856(Div2)/A/main_output0.txt | 5 + contests/Round#856(Div2)/B/main | Bin 0 -> 22480 bytes contests/Round#856(Div2)/B/main.cpp | 95 +++++++++++++++ contests/Round#856(Div2)/B/main_input0.txt | 7 ++ contests/Round#856(Div2)/B/main_input1.txt | 3 + contests/Round#856(Div2)/B/main_input2.txt | 3 + contests/Round#856(Div2)/B/main_output0.txt | 3 + contests/Round#856(Div2)/B/main_output1.txt | 1 + contests/Round#856(Div2)/B/main_output2.txt | 1 + contests/Round#856(Div2)/C/main | Bin 0 -> 21856 bytes contests/Round#856(Div2)/C/main.cpp | 107 +++++++++++++++++ contests/Round#856(Div2)/C/main_input0.txt | 7 ++ contests/Round#856(Div2)/C/main_output0.txt | 3 + contests/Round#856(Div2)/D/main.cpp | 89 ++++++++++++++ contests/Round#856(Div2)/E/main.cpp | 89 ++++++++++++++ contests/Round#856(Div2)/F/main.cpp | 89 ++++++++++++++ contests/Starters78/D/main | Bin 57544 -> 56552 bytes contests/Starters78/D/main.cpp | 56 +++++---- contests/Starters79/A/main | Bin 0 -> 17832 bytes contests/Starters79/A/main.cpp | 103 ++++++++++++++++ contests/Starters79/A/main_input0.txt | 5 + contests/Starters79/A/main_output0.txt | 4 + contests/Starters79/B/main | Bin 0 -> 17736 bytes contests/Starters79/B/main.cpp | 101 ++++++++++++++++ contests/Starters79/B/main_input0.txt | 4 + contests/Starters79/B/main_output0.txt | 3 + contests/Starters79/C/main | Bin 0 -> 22360 bytes contests/Starters79/C/main.cpp | 101 ++++++++++++++++ contests/Starters79/C/main_input0.txt | 5 + contests/Starters79/C/main_input1.txt | 5 + contests/Starters79/C/main_output0.txt | 4 + contests/Starters79/C/main_output1.txt | 4 + contests/Starters79/D/main | Bin 0 -> 17688 bytes contests/Starters79/D/main.cpp | 102 ++++++++++++++++ contests/Starters79/D/main_input0.txt | 4 + contests/Starters79/D/main_input1.txt | 3 + contests/Starters79/D/main_output0.txt | 3 + contests/Starters79/D/main_output1.txt | 2 + contests/Starters79/E/main.cpp | 89 ++++++++++++++ contests/Starters79/F/main.cpp | 89 ++++++++++++++ 121 files changed, 3538 insertions(+), 23 deletions(-) create mode 100755 codechef/ConcatPalindrome/main create mode 100755 codechef/ConcatPalindrome/main.cpp create mode 100644 codechef/ConcatPalindrome/main_input0.txt create mode 100644 codechef/ConcatPalindrome/main_input1.txt create mode 100644 codechef/ConcatPalindrome/main_input2.txt create mode 100644 codechef/ConcatPalindrome/main_output0.txt create mode 100644 codechef/ConcatPalindrome/main_output1.txt create mode 100644 codechef/ConcatPalindrome/main_output2.txt create mode 100755 codechef/MinimizeTheMaximum/main create mode 100755 codechef/MinimizeTheMaximum/main.cpp create mode 100644 codechef/MinimizeTheMaximum/main_input0.txt create mode 100644 codechef/MinimizeTheMaximum/main_output0.txt create mode 100755 codechef/Tekken/main create mode 100755 codechef/Tekken/main.cpp create mode 100644 codechef/Tekken/main_input0.txt create mode 100644 codechef/Tekken/main_output0.txt create mode 100755 codeforces/Asterisk-MinorTemplate/main create mode 100755 codeforces/Asterisk-MinorTemplate/main.cpp create mode 100644 codeforces/Asterisk-MinorTemplate/main_input0.txt create mode 100644 codeforces/Asterisk-MinorTemplate/main_output0.txt create mode 100755 codeforces/CompleteTheWord/main.cpp create mode 100755 codeforces/CrazyComputer/main create mode 100755 codeforces/CrazyComputer/main.cpp create mode 100644 codeforces/CrazyComputer/main_input0.txt create mode 100644 codeforces/CrazyComputer/main_input1.txt create mode 100644 codeforces/CrazyComputer/main_output0.txt create mode 100644 codeforces/CrazyComputer/main_output1.txt create mode 100755 codeforces/TypicalInterviewProblem/main create mode 100755 codeforces/TypicalInterviewProblem/main.cpp create mode 100644 codeforces/TypicalInterviewProblem/main_input0.txt create mode 100644 codeforces/TypicalInterviewProblem/main_output0.txt create mode 100755 contests/Round#853/A/main create mode 100755 contests/Round#853/A/main.cpp create mode 100644 contests/Round#853/A/main_input0.txt create mode 100644 contests/Round#853/A/main_output0.txt create mode 100644 "contests/Round#853/B/\\" create mode 100755 contests/Round#853/B/main create mode 100755 contests/Round#853/B/main.cpp create mode 100644 contests/Round#853/B/main_input0.txt create mode 100644 contests/Round#853/B/main_input1.txt create mode 100644 contests/Round#853/B/main_input2.txt create mode 100644 contests/Round#853/B/main_input3.txt create mode 100644 contests/Round#853/B/main_input4.txt create mode 100644 contests/Round#853/B/main_input5.txt create mode 100644 contests/Round#853/B/main_input6.txt create mode 100644 contests/Round#853/B/main_input7.txt create mode 100644 contests/Round#853/B/main_output0.txt create mode 100644 contests/Round#853/B/main_output1.txt create mode 100644 contests/Round#853/B/main_output2.txt create mode 100644 contests/Round#853/B/main_output3.txt create mode 100644 contests/Round#853/B/main_output4.txt create mode 100644 contests/Round#853/B/main_output5.txt create mode 100644 contests/Round#853/B/main_output6.txt create mode 100644 contests/Round#853/B/main_output7.txt create mode 100755 contests/Round#853/C/main.cpp create mode 100755 contests/Round#853/D/main.cpp create mode 100755 contests/Round#853/E/main.cpp create mode 100755 contests/Round#853/F/main.cpp create mode 100755 contests/Round#855(Div3)/A/main create mode 100755 contests/Round#855(Div3)/A/main.cpp create mode 100644 contests/Round#855(Div3)/A/main_input0.txt create mode 100644 contests/Round#855(Div3)/A/main_output0.txt create mode 100755 contests/Round#855(Div3)/B/main create mode 100755 contests/Round#855(Div3)/B/main.cpp create mode 100644 contests/Round#855(Div3)/B/main_input0.txt create mode 100644 contests/Round#855(Div3)/B/main_input1.txt create mode 100644 contests/Round#855(Div3)/B/main_output0.txt create mode 100644 contests/Round#855(Div3)/B/main_output1.txt create mode 100755 contests/Round#855(Div3)/C/main create mode 100755 contests/Round#855(Div3)/C/main.cpp create mode 100644 contests/Round#855(Div3)/C/main_input0.txt create mode 100644 contests/Round#855(Div3)/C/main_output0.txt create mode 100755 contests/Round#855(Div3)/D/main create mode 100755 contests/Round#855(Div3)/D/main.cpp create mode 100644 contests/Round#855(Div3)/D/main_input0.txt create mode 100644 contests/Round#855(Div3)/D/main_output0.txt create mode 100755 contests/Round#855(Div3)/E/main.cpp create mode 100755 contests/Round#855(Div3)/F/main.cpp create mode 100755 contests/Round#856(Div2)/A/main create mode 100755 contests/Round#856(Div2)/A/main.cpp create mode 100644 contests/Round#856(Div2)/A/main_input0.txt create mode 100644 contests/Round#856(Div2)/A/main_output0.txt create mode 100755 contests/Round#856(Div2)/B/main create mode 100755 contests/Round#856(Div2)/B/main.cpp create mode 100644 contests/Round#856(Div2)/B/main_input0.txt create mode 100644 contests/Round#856(Div2)/B/main_input1.txt create mode 100644 contests/Round#856(Div2)/B/main_input2.txt create mode 100644 contests/Round#856(Div2)/B/main_output0.txt create mode 100644 contests/Round#856(Div2)/B/main_output1.txt create mode 100644 contests/Round#856(Div2)/B/main_output2.txt create mode 100755 contests/Round#856(Div2)/C/main create mode 100755 contests/Round#856(Div2)/C/main.cpp create mode 100644 contests/Round#856(Div2)/C/main_input0.txt create mode 100644 contests/Round#856(Div2)/C/main_output0.txt create mode 100755 contests/Round#856(Div2)/D/main.cpp create mode 100755 contests/Round#856(Div2)/E/main.cpp create mode 100755 contests/Round#856(Div2)/F/main.cpp create mode 100755 contests/Starters79/A/main create mode 100755 contests/Starters79/A/main.cpp create mode 100644 contests/Starters79/A/main_input0.txt create mode 100644 contests/Starters79/A/main_output0.txt create mode 100755 contests/Starters79/B/main create mode 100755 contests/Starters79/B/main.cpp create mode 100644 contests/Starters79/B/main_input0.txt create mode 100644 contests/Starters79/B/main_output0.txt create mode 100755 contests/Starters79/C/main create mode 100755 contests/Starters79/C/main.cpp create mode 100644 contests/Starters79/C/main_input0.txt create mode 100644 contests/Starters79/C/main_input1.txt create mode 100644 contests/Starters79/C/main_output0.txt create mode 100644 contests/Starters79/C/main_output1.txt create mode 100755 contests/Starters79/D/main create mode 100755 contests/Starters79/D/main.cpp create mode 100644 contests/Starters79/D/main_input0.txt create mode 100644 contests/Starters79/D/main_input1.txt create mode 100644 contests/Starters79/D/main_output0.txt create mode 100644 contests/Starters79/D/main_output1.txt create mode 100755 contests/Starters79/E/main.cpp create mode 100755 contests/Starters79/F/main.cpp diff --git a/codechef/ConcatPalindrome/main b/codechef/ConcatPalindrome/main new file mode 100755 index 0000000..949fc76 Binary files /dev/null and b/codechef/ConcatPalindrome/main differ diff --git a/codechef/ConcatPalindrome/main.cpp b/codechef/ConcatPalindrome/main.cpp new file mode 100755 index 0000000..37c41d5 --- /dev/null +++ b/codechef/ConcatPalindrome/main.cpp @@ -0,0 +1,130 @@ +#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 + */ + +// dddaddd +// abcba +// dcaaacd + +void solve() { + int n, m; + cin >> n >> m; + string a, b; + cin >> a >> b; + set st; + string ab = a + b; + vector fq('z' - 'a' + 2); + for(auto ch : ab) { + st.insert(ch); + fq[ch - 'a']++; + } + int even = 0; + int odd = 0; + if ((n + m) % 2 == 0) { + for (auto ch : st) { + even += fq[ch - 'a'] % 2 == 0; + } + cout << (even == st.size() ? "YES" : "NO") << '\n'; + } else { + char cho; + for (auto ch : st) { + even += fq[ch - 'a'] % 2 == 0; + if (fq[ch - 'a'] % 2 != 0) { + odd += fq[ch - 'a'] % 2 != 0; + cho = ch; + } + } + if (odd == 1) { + if (n > m) { + cout << (count(all(a), cho) ? "YES" : "NO") << '\n'; + } else { + cout << (count(all(b), cho) ? "YES" : "NO") << '\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/codechef/ConcatPalindrome/main_input0.txt b/codechef/ConcatPalindrome/main_input0.txt new file mode 100644 index 0000000..a2f3667 --- /dev/null +++ b/codechef/ConcatPalindrome/main_input0.txt @@ -0,0 +1,13 @@ +4 +5 2 +abcdd +ac +3 3 +abc +xyz +2 4 +aa +aaaa +1 3 +a +aax diff --git a/codechef/ConcatPalindrome/main_input1.txt b/codechef/ConcatPalindrome/main_input1.txt new file mode 100644 index 0000000..39c23ff --- /dev/null +++ b/codechef/ConcatPalindrome/main_input1.txt @@ -0,0 +1,4 @@ +1 +3 4 +aaa +cddc \ No newline at end of file diff --git a/codechef/ConcatPalindrome/main_input2.txt b/codechef/ConcatPalindrome/main_input2.txt new file mode 100644 index 0000000..e59d54e --- /dev/null +++ b/codechef/ConcatPalindrome/main_input2.txt @@ -0,0 +1,4 @@ +1 +5 2 +accdd +ax \ No newline at end of file diff --git a/codechef/ConcatPalindrome/main_output0.txt b/codechef/ConcatPalindrome/main_output0.txt new file mode 100644 index 0000000..2bc7799 --- /dev/null +++ b/codechef/ConcatPalindrome/main_output0.txt @@ -0,0 +1,4 @@ +YES +NO +YES +NO diff --git a/codechef/ConcatPalindrome/main_output1.txt b/codechef/ConcatPalindrome/main_output1.txt new file mode 100644 index 0000000..d2bb323 --- /dev/null +++ b/codechef/ConcatPalindrome/main_output1.txt @@ -0,0 +1 @@ +YES \ No newline at end of file diff --git a/codechef/ConcatPalindrome/main_output2.txt b/codechef/ConcatPalindrome/main_output2.txt new file mode 100644 index 0000000..ba28208 --- /dev/null +++ b/codechef/ConcatPalindrome/main_output2.txt @@ -0,0 +1 @@ +NO \ No newline at end of file diff --git a/codechef/MinimizeTheMaximum/main b/codechef/MinimizeTheMaximum/main new file mode 100755 index 0000000..67a3eaa Binary files /dev/null and b/codechef/MinimizeTheMaximum/main differ diff --git a/codechef/MinimizeTheMaximum/main.cpp b/codechef/MinimizeTheMaximum/main.cpp new file mode 100755 index 0000000..1b5bfcc --- /dev/null +++ b/codechef/MinimizeTheMaximum/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 + */ + +bool isValid(vi v, long long ans) { + long long sum = v[0]; + if (v[0] > ans) { + return false; + } + for (int i = 1; i < v.size(); i++) { + int cap = (i * ans) - sum; + sum += v[i]; + if (v[i] > ans && v[i] - ans > cap) { + return false; + } + } + return true; +} + +void solve() { + int n; + cin >> n; + vi v(n); + for (auto &x : v) + cin >> x; + ll lo = 0, hi = INT_MAX; + while (hi - lo > 1) { + long long mid = (hi + lo) / 2; + if (isValid(v, mid)) { + hi = mid; + } else { + lo = mid; + } + } + cout << hi << '\n'; +} + +int main() { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while (tt--) { + solve(); + } +} diff --git a/codechef/MinimizeTheMaximum/main_input0.txt b/codechef/MinimizeTheMaximum/main_input0.txt new file mode 100644 index 0000000..782719d --- /dev/null +++ b/codechef/MinimizeTheMaximum/main_input0.txt @@ -0,0 +1,7 @@ +3 +4 +1 5 7 6 +3 +5 15 19 +4 +10 3 5 7 diff --git a/codechef/MinimizeTheMaximum/main_output0.txt b/codechef/MinimizeTheMaximum/main_output0.txt new file mode 100644 index 0000000..cc6e21e --- /dev/null +++ b/codechef/MinimizeTheMaximum/main_output0.txt @@ -0,0 +1,3 @@ +5 +13 +10 diff --git a/codechef/Tekken/main b/codechef/Tekken/main new file mode 100755 index 0000000..fdc2ffa Binary files /dev/null and b/codechef/Tekken/main differ diff --git a/codechef/Tekken/main.cpp b/codechef/Tekken/main.cpp new file mode 100755 index 0000000..4eeef2c --- /dev/null +++ b/codechef/Tekken/main.cpp @@ -0,0 +1,98 @@ +#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 a, b, c; + cin >> a >> b >> c; + int bc = min(b, c); + b -= bc; + c -= bc; + int ac = min(a, c); + int ab = min(a, b); + a -= ac; + a -= ab; + cout << (a > 0 ? "YES" : "NO") << '\n'; +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/codechef/Tekken/main_input0.txt b/codechef/Tekken/main_input0.txt new file mode 100644 index 0000000..3ac5b05 --- /dev/null +++ b/codechef/Tekken/main_input0.txt @@ -0,0 +1,4 @@ +3 +4 2 0 +2 7 4 +5 1 4 diff --git a/codechef/Tekken/main_output0.txt b/codechef/Tekken/main_output0.txt new file mode 100644 index 0000000..0db7433 --- /dev/null +++ b/codechef/Tekken/main_output0.txt @@ -0,0 +1,3 @@ +YES +NO +YES diff --git a/codeforces/Asterisk-MinorTemplate/main b/codeforces/Asterisk-MinorTemplate/main new file mode 100755 index 0000000..837d6d2 Binary files /dev/null and b/codeforces/Asterisk-MinorTemplate/main differ diff --git a/codeforces/Asterisk-MinorTemplate/main.cpp b/codeforces/Asterisk-MinorTemplate/main.cpp new file mode 100755 index 0000000..943cc0f --- /dev/null +++ b/codeforces/Asterisk-MinorTemplate/main.cpp @@ -0,0 +1,123 @@ +#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() { + string s1, s2; + cin >> s1; + cin >> s2; + if (s1[0] == s2[0]) { + cout << "YES\n"; + cout << s1[0]; + cout << "*\n"; + } else if(s1[s1.length() - 1] == s2[s2.length() - 1]) { + cout << "YES\n"; + cout << "*"; + cout << s1[s1.length() - 1] << '\n'; + } else { + int n = s1.length(); + int m = s2.length(); + vector substrs1; + vector substrs2; + for (int i = 0; i < s1.length(); i++) { + substrs1.pb(s1.substr(i, 2)); + } + for (int i = 0; i < s2.length(); i++) { + substrs2.pb(s2.substr(i, 2)); + } + for (int i = 0; i < n; i++) { + for (int j = 0; j < m; j++) { + if (substrs1[i] == substrs2[j]) { + string ans = "YES\n*" + substrs1[i] + "*\n"; + cout << ans; + return; + } + } + } + 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/Asterisk-MinorTemplate/main_input0.txt b/codeforces/Asterisk-MinorTemplate/main_input0.txt new file mode 100644 index 0000000..95f28a8 --- /dev/null +++ b/codeforces/Asterisk-MinorTemplate/main_input0.txt @@ -0,0 +1,13 @@ +6 +aaab +zzzb +codeforces +atcoder +codeforces +tokitlx +aaaa +aaaaaa +abcd +abcd +c +f diff --git a/codeforces/Asterisk-MinorTemplate/main_output0.txt b/codeforces/Asterisk-MinorTemplate/main_output0.txt new file mode 100644 index 0000000..b594c1e --- /dev/null +++ b/codeforces/Asterisk-MinorTemplate/main_output0.txt @@ -0,0 +1,10 @@ +YES +*b +YES +*co* +NO +YES +a*a*a*a +YES +abcd +NO diff --git a/codeforces/CompleteTheWord/main.cpp b/codeforces/CompleteTheWord/main.cpp new file mode 100755 index 0000000..6e8522f --- /dev/null +++ b/codeforces/CompleteTheWord/main.cpp @@ -0,0 +1,92 @@ +#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() { + string s; + cin >> s; + + +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/codeforces/CrazyComputer/main b/codeforces/CrazyComputer/main new file mode 100755 index 0000000..1b83fe9 Binary files /dev/null and b/codeforces/CrazyComputer/main differ diff --git a/codeforces/CrazyComputer/main.cpp b/codeforces/CrazyComputer/main.cpp new file mode 100755 index 0000000..f1e73a5 --- /dev/null +++ b/codeforces/CrazyComputer/main.cpp @@ -0,0 +1,98 @@ +#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, c; + cin >> n >> c; + vi v(n); + for (auto &x : v) cin >> x; + int ans = 1; + for (int i = 1; i < n; i++) { + if (v[i] - v[i - 1] > c) { + ans = 1; + } else { + ans++; + } + } + cout << ans << '\n'; + +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + solve(); +} + + diff --git a/codeforces/CrazyComputer/main_input0.txt b/codeforces/CrazyComputer/main_input0.txt new file mode 100644 index 0000000..702cd09 --- /dev/null +++ b/codeforces/CrazyComputer/main_input0.txt @@ -0,0 +1,2 @@ +6 5 +1 3 8 14 19 20 diff --git a/codeforces/CrazyComputer/main_input1.txt b/codeforces/CrazyComputer/main_input1.txt new file mode 100644 index 0000000..dbcc569 --- /dev/null +++ b/codeforces/CrazyComputer/main_input1.txt @@ -0,0 +1,2 @@ +6 1 +1 3 5 7 9 10 diff --git a/codeforces/CrazyComputer/main_output0.txt b/codeforces/CrazyComputer/main_output0.txt new file mode 100644 index 0000000..00750ed --- /dev/null +++ b/codeforces/CrazyComputer/main_output0.txt @@ -0,0 +1 @@ +3 diff --git a/codeforces/CrazyComputer/main_output1.txt b/codeforces/CrazyComputer/main_output1.txt new file mode 100644 index 0000000..0cfbf08 --- /dev/null +++ b/codeforces/CrazyComputer/main_output1.txt @@ -0,0 +1 @@ +2 diff --git a/codeforces/TypicalInterviewProblem/main b/codeforces/TypicalInterviewProblem/main new file mode 100755 index 0000000..c00327c Binary files /dev/null and b/codeforces/TypicalInterviewProblem/main differ diff --git a/codeforces/TypicalInterviewProblem/main.cpp b/codeforces/TypicalInterviewProblem/main.cpp new file mode 100755 index 0000000..51f37c3 --- /dev/null +++ b/codeforces/TypicalInterviewProblem/main.cpp @@ -0,0 +1,102 @@ +#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 + */ +// 3 5 6 9 10 12 15 18 20 21 24 25 27 30 +// F B F F B F FB F B F F B F FB +// FBFFBFFB FBFFBFFB + +void solve() { + int n; + string s; + cin >> n; + cin >> s; + string fb = "FBFFBFFBFBFFBFFBFBFFBFFBFBFFBFFB"; + if (regex_match(fb, regex(".*" + s + ".*"))) { + 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/TypicalInterviewProblem/main_input0.txt b/codeforces/TypicalInterviewProblem/main_input0.txt new file mode 100644 index 0000000..2abcb4f --- /dev/null +++ b/codeforces/TypicalInterviewProblem/main_input0.txt @@ -0,0 +1,7 @@ +3 +3 +FFB +8 +BFFBFFBF +3 +BBB diff --git a/codeforces/TypicalInterviewProblem/main_output0.txt b/codeforces/TypicalInterviewProblem/main_output0.txt new file mode 100644 index 0000000..5ae1e3d --- /dev/null +++ b/codeforces/TypicalInterviewProblem/main_output0.txt @@ -0,0 +1,3 @@ +YES +YES +NO diff --git a/contests/Round#853/A/main b/contests/Round#853/A/main new file mode 100755 index 0000000..8a4dd75 Binary files /dev/null and b/contests/Round#853/A/main differ diff --git a/contests/Round#853/A/main.cpp b/contests/Round#853/A/main.cpp new file mode 100755 index 0000000..48a23d2 --- /dev/null +++ b/contests/Round#853/A/main.cpp @@ -0,0 +1,116 @@ +#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 + */ + +bool isGood(vi &v) { + int n = v.size(); + int ans = __gcd(v[0], v[1]); + for (int i = 2; i < n; i++) { + ans = __gcd(ans, v[i]); + } + return ans <= n; +} + +bool isBeautiful(vi &v) { + for (int i = 0; i <= v.size() - 2; i++) { + vi newVec = vector(v.begin(), v.begin() + i + 2); + if (!isGood(newVec)) { + return false; + } + } + return true; +} + +void solve() { + int n; + cin >> n; + vi v(n); + for (auto &x : v) + cin >> x; + if (isBeautiful(v)) { + cout << "Yes" << '\n'; + return; + } else { + sort(all(v)); + do { + if (isBeautiful(v)) { + cout << "Yes" << '\n'; + return; + } + } while (next_permutation(all(v))); + } + 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/Round#853/A/main_input0.txt b/contests/Round#853/A/main_input0.txt new file mode 100644 index 0000000..e0ee38b --- /dev/null +++ b/contests/Round#853/A/main_input0.txt @@ -0,0 +1,13 @@ +6 +2 +3 6 +3 +1 2 4 +3 +3 6 1 +3 +15 35 21 +4 +35 10 35 14 +5 +1261 227821 143 4171 1941 diff --git a/contests/Round#853/A/main_output0.txt b/contests/Round#853/A/main_output0.txt new file mode 100644 index 0000000..14668ea --- /dev/null +++ b/contests/Round#853/A/main_output0.txt @@ -0,0 +1,6 @@ +No +Yes +Yes +No +Yes +Yes diff --git "a/contests/Round#853/B/\\" "b/contests/Round#853/B/\\" new file mode 100644 index 0000000..499f739 --- /dev/null +++ "b/contests/Round#853/B/\\" @@ -0,0 +1,105 @@ +#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 + */ + +bool isPalindrome(string &s) { return string(all(s)) == string(rall(s)); } + +void solve() { + int n; + cin >> n; + string s; + cin >> s; + if (isPalindrome(s)) { + cout << "Yes" << '\n'; + } else { + vector pal(n); + if (n & 1) + pal[n / 2] = 1; + for (int i = 0; i < n / 2; i++) { + pal[i] = pal[n - i - 1] = s[i] == s[n - i - 1]; + } + pal.erase(unique(all(pal))); + // string haystack = ""; + // for (int i = 0; i < n / 2; i++) { + // haystack += (pal[i] ? "R" : "W"); + // } + // if (regex_match(haystack, regex("WR+W"))) { + // cout << "No" << '\n'; + // } else { + // 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/Round#853/B/main b/contests/Round#853/B/main new file mode 100755 index 0000000..71f1358 Binary files /dev/null and b/contests/Round#853/B/main differ diff --git a/contests/Round#853/B/main.cpp b/contests/Round#853/B/main.cpp new file mode 100755 index 0000000..12517e2 --- /dev/null +++ b/contests/Round#853/B/main.cpp @@ -0,0 +1,107 @@ +#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 + */ + +bool isPalindrome(string &s) { return string(all(s)) == string(rall(s)); } + +void solve() { + int n; + cin >> n; + string s; + cin >> s; + vector pal(n); + if (n & 1) + pal[n / 2] = 1; + for (int i = 0; i < n / 2; i++) { + pal[i] = pal[n - i - 1] = s[i] == s[n - i - 1]; + } + pal.erase(unique(all(pal)), pal.end()); + n = pal.size(); + if (count(all(pal), 0) <= 2) { + cout << "Yes" << '\n'; + } else { + cout << "No" << '\n'; + } + // string haystack = ""; + // for (int i = 0; i < n / 2; i++) { + // haystack += (pal[i] ? "R" : "W"); + // } + // if (regex_match(haystack, regex("WR+W"))) { + // cout << "No" << '\n'; + // } else { + // 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/Round#853/B/main_input0.txt b/contests/Round#853/B/main_input0.txt new file mode 100644 index 0000000..27013f6 --- /dev/null +++ b/contests/Round#853/B/main_input0.txt @@ -0,0 +1,7 @@ +3 +4 +1001 +5 +10010 +7 +0111011 diff --git a/contests/Round#853/B/main_input1.txt b/contests/Round#853/B/main_input1.txt new file mode 100644 index 0000000..a3582ad --- /dev/null +++ b/contests/Round#853/B/main_input1.txt @@ -0,0 +1,3 @@ +1 +6 +100100 \ No newline at end of file diff --git a/contests/Round#853/B/main_input2.txt b/contests/Round#853/B/main_input2.txt new file mode 100644 index 0000000..33a4575 --- /dev/null +++ b/contests/Round#853/B/main_input2.txt @@ -0,0 +1,3 @@ +1 +6 +011100 \ No newline at end of file diff --git a/contests/Round#853/B/main_input3.txt b/contests/Round#853/B/main_input3.txt new file mode 100644 index 0000000..8435e27 --- /dev/null +++ b/contests/Round#853/B/main_input3.txt @@ -0,0 +1,3 @@ +1 +7 +0011011 \ No newline at end of file diff --git a/contests/Round#853/B/main_input4.txt b/contests/Round#853/B/main_input4.txt new file mode 100644 index 0000000..c64122e --- /dev/null +++ b/contests/Round#853/B/main_input4.txt @@ -0,0 +1,3 @@ +1 +2 +10 \ No newline at end of file diff --git a/contests/Round#853/B/main_input5.txt b/contests/Round#853/B/main_input5.txt new file mode 100644 index 0000000..82c90df --- /dev/null +++ b/contests/Round#853/B/main_input5.txt @@ -0,0 +1,3 @@ +1 +2 +01 \ No newline at end of file diff --git a/contests/Round#853/B/main_input6.txt b/contests/Round#853/B/main_input6.txt new file mode 100644 index 0000000..4efbaa0 --- /dev/null +++ b/contests/Round#853/B/main_input6.txt @@ -0,0 +1,3 @@ +1 +9 +110000101 \ No newline at end of file diff --git a/contests/Round#853/B/main_input7.txt b/contests/Round#853/B/main_input7.txt new file mode 100644 index 0000000..90e47d5 --- /dev/null +++ b/contests/Round#853/B/main_input7.txt @@ -0,0 +1,3 @@ +1 +8 +00001000 \ No newline at end of file diff --git a/contests/Round#853/B/main_output0.txt b/contests/Round#853/B/main_output0.txt new file mode 100644 index 0000000..3e42eac --- /dev/null +++ b/contests/Round#853/B/main_output0.txt @@ -0,0 +1,3 @@ +Yes +Yes +No diff --git a/contests/Round#853/B/main_output1.txt b/contests/Round#853/B/main_output1.txt new file mode 100644 index 0000000..289cc91 --- /dev/null +++ b/contests/Round#853/B/main_output1.txt @@ -0,0 +1 @@ +No \ No newline at end of file diff --git a/contests/Round#853/B/main_output2.txt b/contests/Round#853/B/main_output2.txt new file mode 100644 index 0000000..3fdfb3d --- /dev/null +++ b/contests/Round#853/B/main_output2.txt @@ -0,0 +1 @@ +Yes \ No newline at end of file diff --git a/contests/Round#853/B/main_output3.txt b/contests/Round#853/B/main_output3.txt new file mode 100644 index 0000000..3fdfb3d --- /dev/null +++ b/contests/Round#853/B/main_output3.txt @@ -0,0 +1 @@ +Yes \ No newline at end of file diff --git a/contests/Round#853/B/main_output4.txt b/contests/Round#853/B/main_output4.txt new file mode 100644 index 0000000..3fdfb3d --- /dev/null +++ b/contests/Round#853/B/main_output4.txt @@ -0,0 +1 @@ +Yes \ No newline at end of file diff --git a/contests/Round#853/B/main_output5.txt b/contests/Round#853/B/main_output5.txt new file mode 100644 index 0000000..3fdfb3d --- /dev/null +++ b/contests/Round#853/B/main_output5.txt @@ -0,0 +1 @@ +Yes \ No newline at end of file diff --git a/contests/Round#853/B/main_output6.txt b/contests/Round#853/B/main_output6.txt new file mode 100644 index 0000000..3fdfb3d --- /dev/null +++ b/contests/Round#853/B/main_output6.txt @@ -0,0 +1 @@ +Yes \ No newline at end of file diff --git a/contests/Round#853/B/main_output7.txt b/contests/Round#853/B/main_output7.txt new file mode 100644 index 0000000..3fdfb3d --- /dev/null +++ b/contests/Round#853/B/main_output7.txt @@ -0,0 +1 @@ +Yes \ No newline at end of file diff --git a/contests/Round#853/C/main.cpp b/contests/Round#853/C/main.cpp new file mode 100755 index 0000000..7590c13 --- /dev/null +++ b/contests/Round#853/C/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/Round#853/D/main.cpp b/contests/Round#853/D/main.cpp new file mode 100755 index 0000000..7590c13 --- /dev/null +++ b/contests/Round#853/D/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/Round#853/E/main.cpp b/contests/Round#853/E/main.cpp new file mode 100755 index 0000000..7590c13 --- /dev/null +++ b/contests/Round#853/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/Round#853/F/main.cpp b/contests/Round#853/F/main.cpp new file mode 100755 index 0000000..7590c13 --- /dev/null +++ b/contests/Round#853/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(); + } +} + + diff --git a/contests/Round#855(Div3)/A/main b/contests/Round#855(Div3)/A/main new file mode 100755 index 0000000..7f17c3a Binary files /dev/null and b/contests/Round#855(Div3)/A/main differ diff --git a/contests/Round#855(Div3)/A/main.cpp b/contests/Round#855(Div3)/A/main.cpp new file mode 100755 index 0000000..11e6cd2 --- /dev/null +++ b/contests/Round#855(Div3)/A/main.cpp @@ -0,0 +1,101 @@ +#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; + cin >> n; + string s; + cin >> s; + for (int i = 0; i < s.length(); i++) { + s[i] = tolower(s[i]); + } + if (regex_match(s, regex("^m+e+o+w+$"))) { + 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/Round#855(Div3)/A/main_input0.txt b/contests/Round#855(Div3)/A/main_input0.txt new file mode 100644 index 0000000..3a194d3 --- /dev/null +++ b/contests/Round#855(Div3)/A/main_input0.txt @@ -0,0 +1,15 @@ +7 +4 +meOw +14 +mMmeoOoWWWwwwW +3 +mew +7 +MmeEeUw +4 +MEOW +6 +MmyaVW +5 +meowA diff --git a/contests/Round#855(Div3)/A/main_output0.txt b/contests/Round#855(Div3)/A/main_output0.txt new file mode 100644 index 0000000..222b3f9 --- /dev/null +++ b/contests/Round#855(Div3)/A/main_output0.txt @@ -0,0 +1,7 @@ +YES +YES +NO +NO +YES +NO +NO diff --git a/contests/Round#855(Div3)/B/main b/contests/Round#855(Div3)/B/main new file mode 100755 index 0000000..1fcd57c Binary files /dev/null and b/contests/Round#855(Div3)/B/main differ diff --git a/contests/Round#855(Div3)/B/main.cpp b/contests/Round#855(Div3)/B/main.cpp new file mode 100755 index 0000000..5ef8ae8 --- /dev/null +++ b/contests/Round#855(Div3)/B/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() { + int n, k; + string s; + cin >> n >> k; + cin >> s; + map fq; + for (auto ch : s) { + fq[ch]++; + } + int ans = 0; + for (int i = 0; i < 26; i++) { + ans += min(fq['a' + i], fq['A' + i]); + } + for (int i = 0; i < 26; i++) { + int mx = max(fq['a' + i], fq['A' + i]); + int mn = min(fq['a' + i], fq['A' + i]); + int xn = (mx - mn) / 2; + if (k > 0) { + ans += (mx - mn) / 2; + k -= (mx - mn) / 2;; + } else { + break; + } + } + cout << ans + (k < 0 ? k : 0) << '\n'; + +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/contests/Round#855(Div3)/B/main_input0.txt b/contests/Round#855(Div3)/B/main_input0.txt new file mode 100644 index 0000000..5edeb84 --- /dev/null +++ b/contests/Round#855(Div3)/B/main_input0.txt @@ -0,0 +1,11 @@ +5 +11 2 +aAaaBACacbE +2 2 +ab +4 1 +aaBB +6 0 +abBAcC +5 3 +cbccb diff --git a/contests/Round#855(Div3)/B/main_input1.txt b/contests/Round#855(Div3)/B/main_input1.txt new file mode 100644 index 0000000..567b03b --- /dev/null +++ b/contests/Round#855(Div3)/B/main_input1.txt @@ -0,0 +1,3 @@ +1 +6 2 +aaaaaa \ No newline at end of file diff --git a/contests/Round#855(Div3)/B/main_output0.txt b/contests/Round#855(Div3)/B/main_output0.txt new file mode 100644 index 0000000..bf5057a --- /dev/null +++ b/contests/Round#855(Div3)/B/main_output0.txt @@ -0,0 +1,5 @@ +5 +0 +1 +3 +2 diff --git a/contests/Round#855(Div3)/B/main_output1.txt b/contests/Round#855(Div3)/B/main_output1.txt new file mode 100644 index 0000000..d8263ee --- /dev/null +++ b/contests/Round#855(Div3)/B/main_output1.txt @@ -0,0 +1 @@ +2 \ No newline at end of file diff --git a/contests/Round#855(Div3)/C/main b/contests/Round#855(Div3)/C/main new file mode 100755 index 0000000..5bfd3ac Binary files /dev/null and b/contests/Round#855(Div3)/C/main differ diff --git a/contests/Round#855(Div3)/C/main.cpp b/contests/Round#855(Div3)/C/main.cpp new file mode 100755 index 0000000..dda4a51 --- /dev/null +++ b/contests/Round#855(Div3)/C/main.cpp @@ -0,0 +1,107 @@ +#include +using namespace std; + +using ll = long long; +using pi = pair; +using vpi = vector; +using vi = vector; +using vll = vector; +