diff options
Diffstat (limited to 'codeforces')
50 files changed, 1430 insertions, 0 deletions
diff --git a/codeforces/ColorfulStamp/main b/codeforces/ColorfulStamp/main Binary files differnew file mode 100755 index 0000000..9a61c77 --- /dev/null +++ b/codeforces/ColorfulStamp/main 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<bits/stdc++.h> +#include <regex> +using namespace std; + +using ll = long long; +using pii = pair<int, int>; +using vpi = vector<pii>; +using vi = vector<int>; +using vll = vector<long long>; +using mpii = map<int, int>; +using mpll = map<ll, ll>; +using db = long double; + +#define pb push_back +#define all(x) (x).begin(), (x).end() +#define rall(x) (x).rbegin(), (x).rend() +#define lb lower_bound +#define ub upper_bound +#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin()) +#define ceil(a, b) ((a) + (b) - 1) / (b)) + +const int MOD = (int)1e9 + 7; +const db PI = acos((db)-1); +const int dx[4]{1, 0, -1, 0}; +const int dy[4]{0, 1, 0, -1}; + +template<typename K, typename V> ostream& operator<<(ostream& os, const pair<K, V>& p); +template<typename T> ostream& operator<<(ostream& os, const vector<T>& vec); +template<typename K, typename V> ostream& operator<<(ostream& os, const map<K, V>& m); +template<typename K, typename V> ostream& operator<<(ostream& os, const unordered_map<K, V>& m); +template<typename T> ostream& operator<<(ostream& os, const set<T>& s); +template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s); + +template<typename K, typename V> +ostream& operator<<(ostream& os, const pair<K, V>& p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template<typename T> +ostream& operator<<(ostream& os, const vector<T>& vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + + +template<typename K, typename V> +ostream& operator<<(ostream& os, const map<K, V>& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template<typename K, typename V> +ostream& operator<<(ostream& os, const unordered_map<K, V>& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template<typename T> +ostream& operator<<(ostream& os, const set<T>& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template<typename T> +ostream& operator<<(ostream& os, const unordered_set<T>& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +void print() { + cerr << "\n"; +} + +template<typename T, typename... TS> +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<string> 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 Binary files differnew file mode 100755 index 0000000..48c20d4 --- /dev/null +++ b/codeforces/Coprime/main 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<bits/stdc++.h> +using namespace std; + +using ll = long long; +using pii = pair<int, int>; +using vpi = vector<pii>; +using vi = vector<int>; +using vll = vector<long long>; +using mpii = map<int, int>; +using mpll = map<ll, ll>; +using db = long double; + +#define pb push_back +#define all(x) (x).begin(), (x).end() +#define rall(x) (x).rbegin(), (x).rend() +#define lb lower_bound +#define ub upper_bound +#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin()) +#define ceil(a, b) ((a) + (b) - 1) / (b)) + +const int MOD = (int)1e9 + 7; +const db PI = acos((db)-1); +const int dx[4]{1, 0, -1, 0}; +const int dy[4]{0, 1, 0, -1}; + +template<typename K, typename V> ostream& operator<<(ostream& os, const pair<K, V>& p); +template<typename T> ostream& operator<<(ostream& os, const vector<T>& vec); +template<typename K, typename V> ostream& operator<<(ostream& os, const map<K, V>& m); +template<typename K, typename V> ostream& operator<<(ostream& os, const unordered_map<K, V>& m); +template<typename T> ostream& operator<<(ostream& os, const set<T>& s); +template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s); + +template<typename K, typename V> +ostream& operator<<(ostream& os, const pair<K, V>& p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template<typename T> +ostream& operator<<(ostream& os, const vector<T>& vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + + +template<typename K, typename V> +ostream& operator<<(ostream& os, const map<K, V>& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template<typename K, typename V> +ostream& operator<<(ostream& os, const unordered_map<K, V>& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template<typename T> +ostream& operator<<(ostream& os, const set<T>& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template<typename T> +ostream& operator<<(ostream& os, const unordered_set<T>& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +void print() { + cerr << "\n"; +} + +template<typename T, typename... TS> +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<int, int> 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 Binary files differnew file mode 100755 index 0000000..4c214a6 --- /dev/null +++ b/codeforces/DivideAndConquer/main 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<bits/stdc++.h> +using namespace std; + +using ll = long long; +using pii = pair<int, int>; +using vpi = vector<pii>; +using vi = vector<int>; +using vll = vector<long long>; +using mpii = map<int, int>; +using mpll = map<ll, ll>; +using db = long double; + +#define pb push_back +#define all(x) (x).begin(), (x).end() +#define rall(x) (x).rbegin(), (x).rend() +#define lb lower_bound +#define ub upper_bound +#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin()) +#define ceil(a, b) ((a) + (b) - 1) / (b)) + +const int MOD = (int)1e9 + 7; +const db PI = acos((db)-1); +const int dx[4]{1, 0, -1, 0}; +const int dy[4]{0, 1, 0, -1}; + +template<typename K, typename V> ostream& operator<<(ostream& os, const pair<K, V>& p); +template<typename T> ostream& operator<<(ostream& os, const vector<T>& vec); +template<typename K, typename V> ostream& operator<<(ostream& os, const map<K, V>& m); +template<typename K, typename V> ostream& operator<<(ostream& os, const unordered_map<K, V>& m); +template<typename T> ostream& operator<<(ostream& os, const set<T>& s); +template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s); + +template<typename K, typename V> +ostream& operator<<(ostream& os, const pair<K, V>& p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template<typename T> +ostream& operator<<(ostream& os, const vector<T>& vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + + +template<typename K, typename V> +ostream& operator<<(ostream& os, const map<K, V>& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template<typename K, typename V> +ostream& operator<<(ostream& os, const unordered_map<K, V>& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template<typename T> +ostream& operator<<(ostream& os, const set<T>& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template<typename T> +ostream& operator<<(ostream& os, const unordered_set<T>& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +void print() { + cerr << "\n"; +} + +template<typename T, typename... TS> +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 Binary files differnew file mode 100755 index 0000000..93bd5b9 --- /dev/null +++ b/codeforces/MakeArrayGood/main 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<bits/stdc++.h> +using namespace std; + +using ll = long long; +using pii = pair<int, int>; +using vpi = vector<pii>; +using vi = vector<int>; +using vll = vector<long long>; +using mpii = map<int, int>; +using mpll = map<ll, ll>; +using db = long double; + + +#define pb push_back +#define all(x) (x).begin(), (x).end() +#define rall(x) (x).rbegin(), (x).rend() +#define lb lower_bound +#define ub upper_bound +#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin()) +#define ceil(a, b) ((a) + (b) - 1) / (b)) + +const int MOD = (int)1e9 + 7; +const db PI = acos((db)-1); +const int dx[4]{1, 0, -1, 0}; +const int dy[4]{0, 1, 0, -1}; + +template<typename K, typename V> ostream& operator<<(ostream& os, const pair<K, V>& p); +template<typename T> ostream& operator<<(ostream& os, const vector<T>& vec); +template<typename K, typename V> ostream& operator<<(ostream& os, const map<K, V>& m); +template<typename K, typename V> ostream& operator<<(ostream& os, const unordered_map<K, V>& m); +template<typename T> ostream& operator<<(ostream& os, const set<T>& s); +template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s); + +template<typename K, typename V> +ostream& operator<<(ostream& os, const pair<K, V>& p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template<typename T> +ostream& operator<<(ostream& os, const vector<T>& vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + + +template<typename K, typename V> +ostream& operator<<(ostream& os, const map<K, V>& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template<typename K, typename V> +ostream& operator<<(ostream& os, const unordered_map<K, V>& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template<typename T> +ostream& operator<<(ostream& os, const set<T>& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template<typename T> +ostream& operator<<(ostream& os, const unordered_set<T>& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +void print() { + cerr << "\n"; +} + |