diff options
Diffstat (limited to 'contests/Round#853')
27 files changed, 0 insertions, 741 deletions
diff --git a/contests/Round#853/A/main b/contests/Round#853/A/main Binary files differdeleted file mode 100755 index 8a4dd75..0000000 --- a/contests/Round#853/A/main +++ /dev/null diff --git a/contests/Round#853/A/main.cpp b/contests/Round#853/A/main.cpp deleted file mode 100755 index 48a23d2..0000000 --- a/contests/Round#853/A/main.cpp +++ /dev/null @@ -1,116 +0,0 @@ -#include <bits/stdc++.h> -using namespace std; - -using ll = long long; -using pi = pair<int, int>; -using vpi = vector<pi>; -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 - -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 <typename K, typename V> void printm(const map<K, V> &mp) { - cerr << "{" << endl; - for (auto p : mp) { - cerr << " { " << p.first << " : " << p.second << " }\n"; - } - cerr << "}" << endl; -} -template <typename T> void printv(const vector<T> &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 <typename T> void printvv(const vector<vector<T>> &v) { - cerr << "[\n"; - for (auto &vec : v) { - cout << " "; - printv(vec); - } - cerr << "]\n"; -} -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 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<int>(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 deleted file mode 100644 index e0ee38b..0000000 --- a/contests/Round#853/A/main_input0.txt +++ /dev/null @@ -1,13 +0,0 @@ -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 deleted file mode 100644 index 14668ea..0000000 --- a/contests/Round#853/A/main_output0.txt +++ /dev/null @@ -1,6 +0,0 @@ -No -Yes -Yes -No -Yes -Yes diff --git a/contests/Round#853/B/\ b/contests/Round#853/B/\ deleted file mode 100644 index 499f739..0000000 --- a/contests/Round#853/B/\ +++ /dev/null @@ -1,105 +0,0 @@ -#include <bits/stdc++.h> -using namespace std; - -using ll = long long; -using pi = pair<int, int>; -using vpi = vector<pi>; -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 - -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 <typename K, typename V> void printm(const map<K, V> &mp) { - cerr << "{" << endl; - for (auto p : mp) { - cerr << " { " << p.first << " : " << p.second << " }\n"; - } - cerr << "}" << endl; -} -template <typename T> void printv(const vector<T> &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 <typename T> void printvv(const vector<vector<T>> &v) { - cerr << "[\n"; - for (auto &vec : v) { - cout << " "; - printv(vec); - } - cerr << "]\n"; -} -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 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<bool> 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 Binary files differdeleted file mode 100755 index 71f1358..0000000 --- a/contests/Round#853/B/main +++ /dev/null diff --git a/contests/Round#853/B/main.cpp b/contests/Round#853/B/main.cpp deleted file mode 100755 index 12517e2..0000000 --- a/contests/Round#853/B/main.cpp +++ /dev/null @@ -1,107 +0,0 @@ -#include <bits/stdc++.h> -using namespace std; - -using ll = long long; -using pi = pair<int, int>; -using vpi = vector<pi>; -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 - -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 <typename K, typename V> void printm(const map<K, V> &mp) { - cerr << "{" << endl; - for (auto p : mp) { - cerr << " { " << p.first << " : " << p.second << " }\n"; - } - cerr << "}" << endl; -} -template <typename T> void printv(const vector<T> &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 <typename T> void printvv(const vector<vector<T>> &v) { - cerr << "[\n"; - for (auto &vec : v) { - cout << " "; - printv(vec); - } - cerr << "]\n"; -} -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 isPalindrome(string &s) { return string(all(s)) == string(rall(s)); } - -void solve() { - int n; - cin >> n; - string s; - cin >> s; - vector<bool> 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 deleted file mode 100644 index 27013f6..0000000 --- a/contests/Round#853/B/main_input0.txt +++ /dev/null @@ -1,7 +0,0 @@ -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 deleted file mode 100644 index a3582ad..0000000 --- a/contests/Round#853/B/main_input1.txt +++ /dev/null @@ -1,3 +0,0 @@ -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 deleted file mode 100644 index 33a4575..0000000 --- a/contests/Round#853/B/main_input2.txt +++ /dev/null @@ -1,3 +0,0 @@ -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 deleted file mode 100644 index 8435e27..0000000 --- a/contests/Round#853/B/main_input3.txt +++ /dev/null @@ -1,3 +0,0 @@ -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 deleted file mode 100644 index c64122e..0000000 --- a/contests/Round#853/B/main_input4.txt +++ /dev/null @@ -1,3 +0,0 @@ -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 deleted file mode 100644 index 82c90df..0000000 --- a/contests/Round#853/B/main_input5.txt +++ /dev/null @@ -1,3 +0,0 @@ -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 deleted file mode 100644 index 4efbaa0..0000000 --- a/contests/Round#853/B/main_input6.txt +++ /dev/null @@ -1,3 +0,0 @@ -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 deleted file mode 100644 index 90e47d5..0000000 --- a/contests/Round#853/B/main_input7.txt +++ /dev/null @@ -1,3 +0,0 @@ -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 deleted file mode 100644 index 3e42eac..0000000 --- a/contests/Round#853/B/main_output0.txt +++ /dev/null @@ -1,3 +0,0 @@ -Yes -Yes -No diff --git a/contests/Round#853/B/main_output1.txt b/contests/Round#853/B/main_output1.txt deleted file mode 100644 index 289cc91..0000000 --- a/contests/Round#853/B/main_output1.txt +++ /dev/null @@ -1 +0,0 @@ -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 deleted file mode 100644 index 3fdfb3d..0000000 --- a/contests/Round#853/B/main_output2.txt +++ /dev/null @@ -1 +0,0 @@ -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 deleted file mode 100644 index 3fdfb3d..0000000 --- a/contests/Round#853/B/main_output3.txt +++ /dev/null @@ -1 +0,0 @@ -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 deleted file mode 100644 index 3fdfb3d..0000000 --- a/contests/Round#853/B/main_output4.txt +++ /dev/null @@ -1 +0,0 @@ -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 deleted file mode 100644 index 3fdfb3d..0000000 --- a/contests/Round#853/B/main_output5.txt +++ /dev/null @@ -1 +0,0 @@ -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 deleted file mode 100644 index 3fdfb3d..0000000 --- a/contests/Round#853/B/main_output6.txt +++ /dev/null @@ -1 +0,0 @@ -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 deleted file mode 100644 index 3fdfb3d..0000000 --- a/contests/Round#853/B/main_output7.txt +++ /dev/null @@ -1 +0,0 @@ -Yes
\ No newline at end of file diff --git a/contests/Round#853/C/main.cpp b/contests/Round#853/C/main.cpp deleted file mode 100755 index 7590c13..0000000 --- a/contests/Round#853/C/main.cpp +++ /dev/null @@ -1,89 +0,0 @@ -#include<bits/stdc++.h> -using namespace std; - -using ll = long long; -using pi = pair<int, int>; -using vpi = vector<pi>; -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 - -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<typename K, typename V> -void printm(const map<K, V> &mp) { - cerr << "{" << endl; - for (auto p : mp) { - cerr << " { " << p.first << " : " << p.second << " }\n"; - } - cerr << "}" << endl; -} -template<typename T> -void printv(const vector<T> &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<typename T> -void printvv(const vector<vector<T>> &v) { - cerr << "[\n"; - for (auto &vec : v) { - cout << " "; - printv(vec); - } - cerr << "]\n"; -} -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 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 deleted file mode 100755 index 7590c13..0000000 --- a/contests/Round#853/D/main.cpp +++ /dev/null @@ -1,89 +0,0 @@ -#include<bits/stdc++.h> -using namespace std; - -using ll = long long; -using pi = pair<int, int>; -using vpi = vector<pi>; -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 - -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<typename K, typename V> -void printm(const map<K, V> &mp) { - cerr << "{" << endl; - for (auto p : mp) { - cerr << " { " << p.first << " : " << p.second << " }\n"; - } - cerr << "}" << endl; -} -template<typename T> -void printv(const vector<T> &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<typename T> -void printvv(const vector<vector<T>> &v) { - cerr << "[\n"; - for (auto &vec : v) { - cout << " "; - printv(vec); - } - cerr << "]\n"; -} -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 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 deleted file mode 100755 index 7590c13..0000000 --- a/contests/Round#853/E/main.cpp +++ /dev/null @@ -1,89 +0,0 @@ -#include<bits/stdc++.h> -using namespace std; - -using ll = long long; -using pi = pair<int, int>; -using vpi = vector<pi>; -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 - -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<typename K, typename V> -void printm(const map<K, V> &mp) { - cerr << "{" << endl; - for (auto p : mp) { - cerr << " { " << p.first << " : " << p.second << " }\n"; - } - cerr << "}" << endl; -} -template<typename T> -void printv(const vector<T> &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<typename T> -void printvv(const vector<vector<T>> &v) { - cerr << "[\n"; - for (auto &vec : v) { - cout << " "; - printv(vec); - } - cerr << "]\n"; -} -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 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 deleted file mode 100755 index 7590c13..0000000 --- a/contests/Round#853/F/main.cpp +++ /dev/null @@ -1,89 +0,0 @@ -#include<bits/stdc++.h> -using namespace std; - -using ll = long long; -using pi = pair<int, int>; -using vpi = vector<pi>; -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 - -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<typename K, typename V> -void printm(const map<K, V> &mp) { - cerr << "{" << endl; - for (auto p : mp) { - cerr << " { " << p.first << " : " << p.second << " }\n"; - } - cerr << "}" << endl; -} -template<typename T> -void printv(const vector<T> &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<typename T> -void printvv(const vector<vector<T>> &v) { - cerr << "[\n"; - for (auto &vec : v) { - cout << " "; - printv(vec); - } - cerr << "]\n"; -} -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 main () { - ios_base::sync_with_stdio(false); - cin.tie(NULL); - int tt; - cin >> tt; - while(tt--) { - solve(); - } -} - - |