From 41e4a123e8a63a0a33bc7c89569731c2daf65d95 Mon Sep 17 00:00:00 2001 From: omagdy7 Date: Sat, 25 Mar 2023 15:43:13 +0200 Subject: Solve some problems --- codeforces/ColorfulStamp/main | Bin 0 -> 37296 bytes codeforces/ColorfulStamp/main.cpp | 155 ++++++++++++++++++++++++ codeforces/ColorfulStamp/main_input0.txt | 25 ++++ codeforces/ColorfulStamp/main_input1.txt | 3 + codeforces/ColorfulStamp/main_input2.txt | 3 + codeforces/ColorfulStamp/main_input3.txt | 3 + codeforces/ColorfulStamp/main_output0.txt | 12 ++ codeforces/ColorfulStamp/main_output1.txt | 1 + codeforces/ColorfulStamp/main_output2.txt | 1 + codeforces/ColorfulStamp/main_output3.txt | 1 + codeforces/Coprime/main | Bin 0 -> 53952 bytes codeforces/Coprime/main.cpp | 162 +++++++++++++++++++++++++ codeforces/Coprime/main_input0.txt | 13 ++ codeforces/Coprime/main_input1.txt | 3 + codeforces/Coprime/main_output0.txt | 6 + codeforces/Coprime/main_output1.txt | 1 + codeforces/DivideAndConquer/main | Bin 0 -> 21896 bytes codeforces/DivideAndConquer/main.cpp | 166 ++++++++++++++++++++++++++ codeforces/DivideAndConquer/main_input0.txt | 9 ++ codeforces/DivideAndConquer/main_output0.txt | 4 + codeforces/MakeArrayGood/main | Bin 0 -> 22096 bytes codeforces/MakeArrayGood/main.cpp | 151 +++++++++++++++++++++++ codeforces/MakeArrayGood/main_input0.txt | 9 ++ codeforces/MakeArrayGood/main_output0.txt | 16 +++ codeforces/MakeItBeautiful/main | Bin 0 -> 47960 bytes codeforces/MakeItBeautiful/main.cpp | 162 +++++++++++++++++++++++++ codeforces/MakeItBeautiful/main_input0.txt | 9 ++ codeforces/MakeItBeautiful/main_output0.txt | 7 ++ codeforces/MatrixDifferences/main | Bin 0 -> 37840 bytes codeforces/MatrixDifferences/main.cpp | 151 +++++++++++++++++++++++ codeforces/MatrixDifferences/main_input0.txt | 3 + codeforces/MatrixDifferences/main_output0.txt | 5 + codeforces/Nirvana/main | Bin 0 -> 17816 bytes codeforces/Nirvana/main.cpp | 146 ++++++++++++++++++++++ codeforces/Nirvana/main_input0.txt | 1 + codeforces/Nirvana/main_input1.txt | 1 + codeforces/Nirvana/main_input2.txt | 1 + codeforces/Nirvana/main_input3.txt | 1 + codeforces/Nirvana/main_output0.txt | 1 + codeforces/Nirvana/main_output1.txt | 1 + codeforces/Nirvana/main_output2.txt | 1 + codeforces/Nirvana/main_output3.txt | 1 + codeforces/Nirvana/test.py | 29 +++++ codeforces/Stripes/main.cpp | 12 ++ codeforces/TheDoors/main | Bin 0 -> 22568 bytes codeforces/TheDoors/main.cpp | 148 +++++++++++++++++++++++ codeforces/TheDoors/main_input0.txt | 2 + codeforces/TheDoors/main_input1.txt | 2 + codeforces/TheDoors/main_output0.txt | 1 + codeforces/TheDoors/main_output1.txt | 1 + 50 files changed, 1430 insertions(+) create mode 100755 codeforces/ColorfulStamp/main create mode 100755 codeforces/ColorfulStamp/main.cpp create mode 100644 codeforces/ColorfulStamp/main_input0.txt create mode 100644 codeforces/ColorfulStamp/main_input1.txt create mode 100644 codeforces/ColorfulStamp/main_input2.txt create mode 100644 codeforces/ColorfulStamp/main_input3.txt create mode 100644 codeforces/ColorfulStamp/main_output0.txt create mode 100644 codeforces/ColorfulStamp/main_output1.txt create mode 100644 codeforces/ColorfulStamp/main_output2.txt create mode 100644 codeforces/ColorfulStamp/main_output3.txt create mode 100755 codeforces/Coprime/main create mode 100755 codeforces/Coprime/main.cpp create mode 100644 codeforces/Coprime/main_input0.txt create mode 100644 codeforces/Coprime/main_input1.txt create mode 100644 codeforces/Coprime/main_output0.txt create mode 100644 codeforces/Coprime/main_output1.txt create mode 100755 codeforces/DivideAndConquer/main create mode 100755 codeforces/DivideAndConquer/main.cpp create mode 100644 codeforces/DivideAndConquer/main_input0.txt create mode 100644 codeforces/DivideAndConquer/main_output0.txt create mode 100755 codeforces/MakeArrayGood/main create mode 100755 codeforces/MakeArrayGood/main.cpp create mode 100644 codeforces/MakeArrayGood/main_input0.txt create mode 100644 codeforces/MakeArrayGood/main_output0.txt create mode 100755 codeforces/MakeItBeautiful/main create mode 100755 codeforces/MakeItBeautiful/main.cpp create mode 100644 codeforces/MakeItBeautiful/main_input0.txt create mode 100644 codeforces/MakeItBeautiful/main_output0.txt create mode 100755 codeforces/MatrixDifferences/main create mode 100755 codeforces/MatrixDifferences/main.cpp create mode 100644 codeforces/MatrixDifferences/main_input0.txt create mode 100644 codeforces/MatrixDifferences/main_output0.txt create mode 100755 codeforces/Nirvana/main create mode 100755 codeforces/Nirvana/main.cpp create mode 100644 codeforces/Nirvana/main_input0.txt create mode 100644 codeforces/Nirvana/main_input1.txt create mode 100644 codeforces/Nirvana/main_input2.txt create mode 100644 codeforces/Nirvana/main_input3.txt create mode 100644 codeforces/Nirvana/main_output0.txt create mode 100644 codeforces/Nirvana/main_output1.txt create mode 100644 codeforces/Nirvana/main_output2.txt create mode 100644 codeforces/Nirvana/main_output3.txt create mode 100755 codeforces/Nirvana/test.py create mode 100755 codeforces/TheDoors/main create mode 100755 codeforces/TheDoors/main.cpp create mode 100644 codeforces/TheDoors/main_input0.txt create mode 100644 codeforces/TheDoors/main_input1.txt create mode 100644 codeforces/TheDoors/main_output0.txt create mode 100644 codeforces/TheDoors/main_output1.txt (limited to 'codeforces') diff --git a/codeforces/ColorfulStamp/main b/codeforces/ColorfulStamp/main new file mode 100755 index 0000000..9a61c77 Binary files /dev/null and b/codeforces/ColorfulStamp/main differ diff --git a/codeforces/ColorfulStamp/main.cpp b/codeforces/ColorfulStamp/main.cpp new file mode 100755 index 0000000..8c503b5 --- /dev/null +++ b/codeforces/ColorfulStamp/main.cpp @@ -0,0 +1,155 @@ +#include +#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; + vector tokens; + char delimiter = 'W'; + size_t pos = 0; + string token; + while((pos = s.find(delimiter)) != string::npos) { + token = s.substr(0, pos); + tokens.pb(token); + s.erase(0, pos + 1); + } + tokens.pb(s); + for (auto token : tokens) { + int cntR = count(all(token), 'R'); + int cntB = count(all(token), 'B'); + if ((cntR != 0 && cntR == token.length()) || (cntB != 0 && cntB == token.length())) { + 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/ColorfulStamp/main_input0.txt b/codeforces/ColorfulStamp/main_input0.txt new file mode 100644 index 0000000..84c62c5 --- /dev/null +++ b/codeforces/ColorfulStamp/main_input0.txt @@ -0,0 +1,25 @@ +12 +5 +BRBBW +1 +B +2 +WB +2 +RW +3 +BRB +3 +RBB +7 +WWWWWWW +9 +RBWBWRRBW +10 +BRBRBRBRRB +12 +BBBRWWRRRWBR +10 +BRBRBRBRBW +5 +RBWBW diff --git a/codeforces/ColorfulStamp/main_input1.txt b/codeforces/ColorfulStamp/main_input1.txt new file mode 100644 index 0000000..929eb17 --- /dev/null +++ b/codeforces/ColorfulStamp/main_input1.txt @@ -0,0 +1,3 @@ +1 +3 +BRB \ No newline at end of file diff --git a/codeforces/ColorfulStamp/main_input2.txt b/codeforces/ColorfulStamp/main_input2.txt new file mode 100644 index 0000000..3657277 --- /dev/null +++ b/codeforces/ColorfulStamp/main_input2.txt @@ -0,0 +1,3 @@ +1 +4 +RWWW \ No newline at end of file diff --git a/codeforces/ColorfulStamp/main_input3.txt b/codeforces/ColorfulStamp/main_input3.txt new file mode 100644 index 0000000..c8c461a --- /dev/null +++ b/codeforces/ColorfulStamp/main_input3.txt @@ -0,0 +1,3 @@ +1 +3 +WWWB \ No newline at end of file diff --git a/codeforces/ColorfulStamp/main_output0.txt b/codeforces/ColorfulStamp/main_output0.txt new file mode 100644 index 0000000..a4afeb3 --- /dev/null +++ b/codeforces/ColorfulStamp/main_output0.txt @@ -0,0 +1,12 @@ +YES +NO +NO +NO +YES +YES +YES +NO +YES +NO +YES +NO diff --git a/codeforces/ColorfulStamp/main_output1.txt b/codeforces/ColorfulStamp/main_output1.txt new file mode 100644 index 0000000..d2bb323 --- /dev/null +++ b/codeforces/ColorfulStamp/main_output1.txt @@ -0,0 +1 @@ +YES \ No newline at end of file diff --git a/codeforces/ColorfulStamp/main_output2.txt b/codeforces/ColorfulStamp/main_output2.txt new file mode 100644 index 0000000..ba28208 --- /dev/null +++ b/codeforces/ColorfulStamp/main_output2.txt @@ -0,0 +1 @@ +NO \ No newline at end of file diff --git a/codeforces/ColorfulStamp/main_output3.txt b/codeforces/ColorfulStamp/main_output3.txt new file mode 100644 index 0000000..ba28208 --- /dev/null +++ b/codeforces/ColorfulStamp/main_output3.txt @@ -0,0 +1 @@ +NO \ No newline at end of file diff --git a/codeforces/Coprime/main b/codeforces/Coprime/main new file mode 100755 index 0000000..48c20d4 Binary files /dev/null and b/codeforces/Coprime/main differ diff --git a/codeforces/Coprime/main.cpp b/codeforces/Coprime/main.cpp new file mode 100755 index 0000000..86cbd75 --- /dev/null +++ b/codeforces/Coprime/main.cpp @@ -0,0 +1,162 @@ +#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 isPrime(int x) { + if (x == 2) return true; + for (int i = 2; i * i < x; i++) { + if (x % i == 0) { + return false; + } + } + return true; +} + +void solve() { + int n; + cin >> n; + vi v(n); + unordered_map mp; + int mx = 0; + int mn = INT_MAX; + for (int i = 0; i < n; i++) { + cin >> v[i]; + mp[v[i]] = max(i + 1, mp[v[i]]); + mx = max(mx, v[i]); + mn = min(mn, v[i]); + } + int ans = -1; + for (int i = mn; i <= mx; i++) { + for (int j = mn; j <= mx; j++) { + if (__gcd(i, j) == 1 && (mp[i] != 0 && mp[j] != 0)) { + ans = max(ans, mp[i] + mp[j]); + } + } + } + cout << ans << '\n'; +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/codeforces/Coprime/main_input0.txt b/codeforces/Coprime/main_input0.txt new file mode 100644 index 0000000..148fb06 --- /dev/null +++ b/codeforces/Coprime/main_input0.txt @@ -0,0 +1,13 @@ +6 +3 +3 2 1 +7 +1 3 5 2 4 7 7 +5 +1 2 3 4 5 +3 +2 2 4 +6 +5 4 3 15 12 16 +5 +1 2 2 3 6 diff --git a/codeforces/Coprime/main_input1.txt b/codeforces/Coprime/main_input1.txt new file mode 100644 index 0000000..d213bc4 --- /dev/null +++ b/codeforces/Coprime/main_input1.txt @@ -0,0 +1,3 @@ +1 +3 +2 2 4 \ No newline at end of file diff --git a/codeforces/Coprime/main_output0.txt b/codeforces/Coprime/main_output0.txt new file mode 100644 index 0000000..9c9fc88 --- /dev/null +++ b/codeforces/Coprime/main_output0.txt @@ -0,0 +1,6 @@ +6 +12 +9 +-1 +10 +7 diff --git a/codeforces/Coprime/main_output1.txt b/codeforces/Coprime/main_output1.txt new file mode 100644 index 0000000..d7d17fc --- /dev/null +++ b/codeforces/Coprime/main_output1.txt @@ -0,0 +1 @@ +-1 \ No newline at end of file diff --git a/codeforces/DivideAndConquer/main b/codeforces/DivideAndConquer/main new file mode 100755 index 0000000..4c214a6 Binary files /dev/null and b/codeforces/DivideAndConquer/main differ diff --git a/codeforces/DivideAndConquer/main.cpp b/codeforces/DivideAndConquer/main.cpp new file mode 100755 index 0000000..b09f0bc --- /dev/null +++ b/codeforces/DivideAndConquer/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; + vi v(n); + int odds = 0; + for (int i = 0; i < n; i++) { + cin >> v[i]; + odds += v[i] % 2; + } + int ans = 0; + if (odds % 2 == 0) { + cout << 0 << '\n'; + } else { + int ev = 1e6 + 1; + int od = 1e6 + 1; + for (int i = 0; i < n; i++) { + if (v[i] % 2 == 0) { + int cnt = 0; + while(v[i] % 2 == 0) { + v[i] /= 2; + cnt++; + } + ev = min(ev, cnt); + } else { + int cnt = 0; + while(v[i] % 2 != 0) { + v[i] /= 2; + cnt++; + } + od = min(od, cnt); + } + } + cout << min(od, ev) << '\n'; + } + + +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/codeforces/DivideAndConquer/main_input0.txt b/codeforces/DivideAndConquer/main_input0.txt new file mode 100644 index 0000000..e97c46c --- /dev/null +++ b/codeforces/DivideAndConquer/main_input0.txt @@ -0,0 +1,9 @@ +4 +4 +1 1 1 1 +2 +7 4 +3 +1 2 4 +1 +15 diff --git a/codeforces/DivideAndConquer/main_output0.txt b/codeforces/DivideAndConquer/main_output0.txt new file mode 100644 index 0000000..ff0434f --- /dev/null +++ b/codeforces/DivideAndConquer/main_output0.txt @@ -0,0 +1,4 @@ +0 +2 +1 +4 diff --git a/codeforces/MakeArrayGood/main b/codeforces/MakeArrayGood/main new file mode 100755 index 0000000..93bd5b9 Binary files /dev/null and b/codeforces/MakeArrayGood/main differ diff --git a/codeforces/MakeArrayGood/main.cpp b/codeforces/MakeArrayGood/main.cpp new file mode 100755 index 0000000..b232daa --- /dev/null +++ b/codeforces/MakeArrayGood/main.cpp @@ -0,0 +1,151 @@ +#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); + int mn = INT_MAX; + for (int i = 0; i < n; i++) { + cin >> v[i]; + mn = min(mn, v[i]); + } + cout << n << '\n'; + for (int i = 0; i < n; i++) { + if (v[i] % mn != 0) { + cout << i << " " << mn - (v[i] % mn) << '\n'; + v[i] += mn - v[i] % mn; + } else { + cout << i << " " << 0 << '\n'; + } + } + +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/codeforces/MakeArrayGood/main_input0.txt b/codeforces/MakeArrayGood/main_input0.txt new file mode 100644 index 0000000..bbf4fd7 --- /dev/null +++ b/codeforces/MakeArrayGood/main_input0.txt @@ -0,0 +1,9 @@ +4 +4 +2 3 5 5 +2 +4 8 +5 +3 4 343 5 6 +3 +31 5 17 diff --git a/codeforces/MakeArrayGood/main_output0.txt b/codeforces/MakeArrayGood/main_output0.txt new file mode 100644 index 0000000..0001cb9 --- /dev/null +++ b/codeforces/MakeArrayGood/main_output0.txt @@ -0,0 +1,16 @@ +4 +1 2 +1 1 +2 2 +3 0 +0 +5 +1 3 +1 4 +2 1 +5 4 +3 7 +3 +1 29 +2 5 +3 3 diff --git a/codeforces/MakeItBeautiful/main b/codeforces/MakeItBeautiful/main new file mode 100755 index 0000000..cd4171f Binary files /dev/null and b/codeforces/MakeItBeautiful/main differ diff --git a/codeforces/MakeItBeautiful/main.cpp b/codeforces/MakeItBeautiful/main.cpp new file mode 100755 index 0000000..f52d658 --- /dev/null +++ b/codeforces/MakeItBeautiful/main.cpp @@ -0,0 +1,162 @@ +#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 isBeautiful(vi &v) { + int n = v.size(); + vi pref(n + 1); + ll sum = 0; + for (int i = 0; i < n; i++) { + if (sum == v[i]) { + return false; + } + sum += v[i]; + } + return true; +} + +void solve() { + int n; + cin >> n; + vi v(n); + for (int i = 0; i < n; i++) { + cin >> v[i]; + } + sort(rall(v)); + int fqmx = count(all(v), v[0]); + if (fqmx == n) { + cout << "NO\n"; + } else { + cout << "YES\n"; + cout << v[0] << ' '; + for (int i = n - 1; i > 0; i--) { + cout << v[i] << " \n"[i == 1]; + } + } + +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/codeforces/MakeItBeautiful/main_input0.txt b/codeforces/MakeItBeautiful/main_input0.txt new file mode 100644 index 0000000..68f3664 --- /dev/null +++ b/codeforces/MakeItBeautiful/main_input0.txt @@ -0,0 +1,9 @@ +4 +4 +3 3 6 6 +2 +10 10 +5 +1 2 3 4 5 +3 +1 4 4 diff --git a/codeforces/MakeItBeautiful/main_output0.txt b/codeforces/MakeItBeautiful/main_output0.txt new file mode 100644 index 0000000..31c2978 --- /dev/null +++ b/codeforces/MakeItBeautiful/main_output0.txt @@ -0,0 +1,7 @@ +YES +3 6 3 6 +NO +YES +2 4 1 5 3 +YES +1 4 4 diff --git a/codeforces/MatrixDifferences/main b/codeforces/MatrixDifferences/main new file mode 100755 index 0000000..aae30a9 Binary files /dev/null and b/codeforces/MatrixDifferences/main differ diff --git a/codeforces/MatrixDifferences/main.cpp b/codeforces/MatrixDifferences/main.cpp new file mode 100755 index 0000000..87f1ec5 --- /dev/null +++ b/codeforces/MatrixDifferences/main.cpp @@ -0,0 +1,151 @@ +#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(n, vi(n)); + bool flag = false; + int l = 1, r = n * n; + for (int i = 0; i < n; i++) { + for (int j = 0; j < n; j++) { + v[i][j] = flag ? l++: r--; + flag = !flag; + } + if (i & 1) { + reverse(all(v[i])); + } + } + for (int i = 0; i < n; i++) { + for (int j = 0; j < n; j++) { + cout << v[i][j] << " \n"[j == n - 1]; + } + } + +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/codeforces/MatrixDifferences/main_input0.txt b/codeforces/MatrixDifferences/main_input0.txt new file mode 100644 index 0000000..179d8a7 --- /dev/null +++ b/codeforces/MatrixDifferences/main_input0.txt @@ -0,0 +1,3 @@ +2 +2 +3 diff --git a/codeforces/MatrixDifferences/main_output0.txt b/codeforces/MatrixDifferences/main_output0.txt new file mode 100644 index 0000000..763d85c --- /dev/null +++ b/codeforces/MatrixDifferences/main_output0.txt @@ -0,0 +1,5 @@ +1 3 +4 2 +1 3 4 +9 2 7 +5 8 6 diff --git a/codeforces/Nirvana/main b/codeforces/Nirvana/main new file mode 100755 index 0000000..fbcca77 Binary files /dev/null and b/codeforces/Nirvana/main differ diff --git a/codeforces/Nirvana/main.cpp b/codeforces/Nirvana/main.cpp new file mode 100755 index 0000000..4f12e44 --- /dev/null +++ b/codeforces/Nirvana/main.cpp @@ -0,0 +1,146 @@ +#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 + */ +pair helper(int n) { + stack st; + int cnt = 0; + while(n) { + n /= 10; + cnt++; + st.push(n); + } + return {st.top(),cnt}; +} + +void solve() { + ll n; + cin >> n; + pii p = helper(n); + ll res = 1; + for (int i = 0; i < p.second; i++) { + res *= 9; + } + + +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + solve(); +} + + diff --git a/codeforces/Nirvana/main_input0.txt b/codeforces/Nirvana/main_input0.txt new file mode 100644 index 0000000..6f8a8c5 --- /dev/null +++ b/codeforces/Nirvana/main_input0.txt @@ -0,0 +1 @@ +390 diff --git a/codeforces/Nirvana/main_input1.txt b/codeforces/Nirvana/main_input1.txt new file mode 100644 index 0000000..7f8f011 --- /dev/null +++ b/codeforces/Nirvana/main_input1.txt @@ -0,0 +1 @@ +7 diff --git a/codeforces/Nirvana/main_input2.txt b/codeforces/Nirvana/main_input2.txt new file mode 100644 index 0000000..770fdcf --- /dev/null +++ b/codeforces/Nirvana/main_input2.txt @@ -0,0 +1 @@ +1000000000 diff --git a/codeforces/Nirvana/main_input3.txt b/codeforces/Nirvana/main_input3.txt new file mode 100644 index 0000000..8371327 --- /dev/null +++ b/codeforces/Nirvana/main_input3.txt @@ -0,0 +1 @@ +889878787 \ No newline at end of file diff --git a/codeforces/Nirvana/main_output0.txt b/codeforces/Nirvana/main_output0.txt new file mode 100644 index 0000000..a817176 --- /dev/null +++ b/codeforces/Nirvana/main_output0.txt @@ -0,0 +1 @@ +216 diff --git a/codeforces/Nirvana/main_output1.txt b/codeforces/Nirvana/main_output1.txt new file mode 100644 index 0000000..7f8f011 --- /dev/null +++ b/codeforces/Nirvana/main_output1.txt @@ -0,0 +1 @@ +7 diff --git a/codeforces/Nirvana/main_output2.txt b/codeforces/Nirvana/main_output2.txt new file mode 100644 index 0000000..47a3414 --- /dev/null +++ b/codeforces/Nirvana/main_output2.txt @@ -0,0 +1 @@ +387420489 diff --git a/codeforces/Nirvana/main_output3.txt b/codeforces/Nirvana/main_output3.txt new file mode 100644 index 0000000..8a901d1 --- /dev/null +++ b/codeforces/Nirvana/main_output3.txt @@ -0,0 +1 @@ +301327047 \ No newline at end of file diff --git a/codeforces/Nirvana/test.py b/codeforces/Nirvana/test.py new file mode 100755 index 0000000..688531e --- /dev/null +++ b/codeforces/Nirvana/test.py @@ -0,0 +1,29 @@ + +def prod(n): + prod = 1 + while n > 0: + prod *= n % 10 + n //= 10 + return prod + + +def main(): + mp = {} + for i in range(1, 1001): + mx = 0 + for j in range(1, i + 1): + mx = max(mx, prod(j)) + mp[mx] = j + print(i, mp[mx]) + + + +if __name__ == "__main__": + main() + + + + + + + diff --git a/codeforces/Stripes/main.cpp b/codeforces/Stripes/main.cpp index d9454c7..ccd20bd 100755 --- a/codeforces/Stripes/main.cpp +++ b/codeforces/Stripes/main.cpp @@ -23,6 +23,18 @@ const int dx[4]{1, 0, -1, 0}; const int dy[4]{0, 1, 0, -1}; void solve() { + vector v(8); + bool lastRed = false; + for (auto s : v) { + cin >> s; + int reds = count(all(s), 'R'); + if (reds == 8) { + lastRed = true; + } + } + cout << (lastRed ? 'R' : 'B') << '\n'; + + } int main() { diff --git a/codeforces/TheDoors/main b/codeforces/TheDoors/main new file mode 100755 index 0000000..d99ba2b Binary files /dev/null and b/codeforces/TheDoors/main differ diff --git a/codeforces/TheDoors/main.cpp b/codeforces/TheDoors/main.cpp new file mode 100755 index 0000000..856aa11 --- /dev/null +++ b/codeforces/TheDoors/main.cpp @@ -0,0 +1,148 @@ +#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); + int z = 0; + int o = 0; + for (auto &x : v) { + cin >> x; + z += (x == 0); + o += x; + } + for (int i = 0; i < n; i++) { + if (v[i] == 0) { + z--; + } else { + o--; + } + if (z < 1 || o < 1) { + cout << i + 1 << '\n'; + break; + } + } +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + solve(); +} + + diff --git a/codeforces/TheDoors/main_input0.txt b/codeforces/TheDoors/main_input0.txt new file mode 100644 index 0000000..d6b6bea --- /dev/null +++ b/codeforces/TheDoors/main_input0.txt @@ -0,0 +1,2 @@ +5 +0 0 1 0 0 diff --git a/codeforces/TheDoors/main_input1.txt b/codeforces/TheDoors/main_input1.txt new file mode 100644 index 0000000..6a7711a --- /dev/null +++ b/codeforces/TheDoors/main_input1.txt @@ -0,0 +1,2 @@ +4 +1 0 0 1 diff --git a/codeforces/TheDoors/main_output0.txt b/codeforces/TheDoors/main_output0.txt new file mode 100644 index 0000000..00750ed --- /dev/null +++ b/codeforces/TheDoors/main_output0.txt @@ -0,0 +1 @@ +3 diff --git a/codeforces/TheDoors/main_output1.txt b/codeforces/TheDoors/main_output1.txt new file mode 100644 index 0000000..00750ed --- /dev/null +++ b/codeforces/TheDoors/main_output1.txt @@ -0,0 +1 @@ +3 -- cgit v1.2.3