From 6b548332bfc6469756526002971c422f43f86d0a Mon Sep 17 00:00:00 2001 From: omagdy7 Date: Mon, 24 Jul 2023 13:11:33 +0300 Subject: Removed some empty *.cpp files and Solved some new problems --- contests/Round853/A/main | Bin 0 -> 43664 bytes contests/Round853/A/main.cpp | 116 +++++++++++++++++++++++++++++++++++ contests/Round853/A/main_input0.txt | 13 ++++ contests/Round853/A/main_output0.txt | 6 ++ "contests/Round853/B/\\" | 105 +++++++++++++++++++++++++++++++ contests/Round853/B/main | Bin 0 -> 50488 bytes contests/Round853/B/main.cpp | 107 ++++++++++++++++++++++++++++++++ contests/Round853/B/main_input0.txt | 7 +++ contests/Round853/B/main_input1.txt | 3 + contests/Round853/B/main_input2.txt | 3 + contests/Round853/B/main_input3.txt | 3 + contests/Round853/B/main_input4.txt | 3 + contests/Round853/B/main_input5.txt | 3 + contests/Round853/B/main_input6.txt | 3 + contests/Round853/B/main_input7.txt | 3 + contests/Round853/B/main_output0.txt | 3 + contests/Round853/B/main_output1.txt | 1 + contests/Round853/B/main_output2.txt | 1 + contests/Round853/B/main_output3.txt | 1 + contests/Round853/B/main_output4.txt | 1 + contests/Round853/B/main_output5.txt | 1 + contests/Round853/B/main_output6.txt | 1 + contests/Round853/B/main_output7.txt | 1 + contests/Round853/C/main.cpp | 89 +++++++++++++++++++++++++++ contests/Round853/D/main.cpp | 89 +++++++++++++++++++++++++++ contests/Round853/E/main.cpp | 89 +++++++++++++++++++++++++++ contests/Round853/F/main.cpp | 89 +++++++++++++++++++++++++++ 27 files changed, 741 insertions(+) create mode 100755 contests/Round853/A/main create mode 100755 contests/Round853/A/main.cpp create mode 100644 contests/Round853/A/main_input0.txt create mode 100644 contests/Round853/A/main_output0.txt create mode 100644 "contests/Round853/B/\\" create mode 100755 contests/Round853/B/main create mode 100755 contests/Round853/B/main.cpp create mode 100644 contests/Round853/B/main_input0.txt create mode 100644 contests/Round853/B/main_input1.txt create mode 100644 contests/Round853/B/main_input2.txt create mode 100644 contests/Round853/B/main_input3.txt create mode 100644 contests/Round853/B/main_input4.txt create mode 100644 contests/Round853/B/main_input5.txt create mode 100644 contests/Round853/B/main_input6.txt create mode 100644 contests/Round853/B/main_input7.txt create mode 100644 contests/Round853/B/main_output0.txt create mode 100644 contests/Round853/B/main_output1.txt create mode 100644 contests/Round853/B/main_output2.txt create mode 100644 contests/Round853/B/main_output3.txt create mode 100644 contests/Round853/B/main_output4.txt create mode 100644 contests/Round853/B/main_output5.txt create mode 100644 contests/Round853/B/main_output6.txt create mode 100644 contests/Round853/B/main_output7.txt create mode 100755 contests/Round853/C/main.cpp create mode 100755 contests/Round853/D/main.cpp create mode 100755 contests/Round853/E/main.cpp create mode 100755 contests/Round853/F/main.cpp (limited to 'contests/Round853') diff --git a/contests/Round853/A/main b/contests/Round853/A/main new file mode 100755 index 0000000..8a4dd75 Binary files /dev/null and b/contests/Round853/A/main differ diff --git a/contests/Round853/A/main.cpp b/contests/Round853/A/main.cpp new file mode 100755 index 0000000..48a23d2 --- /dev/null +++ b/contests/Round853/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/Round853/A/main_input0.txt b/contests/Round853/A/main_input0.txt new file mode 100644 index 0000000..e0ee38b --- /dev/null +++ b/contests/Round853/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/Round853/A/main_output0.txt b/contests/Round853/A/main_output0.txt new file mode 100644 index 0000000..14668ea --- /dev/null +++ b/contests/Round853/A/main_output0.txt @@ -0,0 +1,6 @@ +No +Yes +Yes +No +Yes +Yes diff --git "a/contests/Round853/B/\\" "b/contests/Round853/B/\\" new file mode 100644 index 0000000..499f739 --- /dev/null +++ "b/contests/Round853/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/Round853/B/main b/contests/Round853/B/main new file mode 100755 index 0000000..71f1358 Binary files /dev/null and b/contests/Round853/B/main differ diff --git a/contests/Round853/B/main.cpp b/contests/Round853/B/main.cpp new file mode 100755 index 0000000..12517e2 --- /dev/null +++ b/contests/Round853/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/Round853/B/main_input0.txt b/contests/Round853/B/main_input0.txt new file mode 100644 index 0000000..27013f6 --- /dev/null +++ b/contests/Round853/B/main_input0.txt @@ -0,0 +1,7 @@ +3 +4 +1001 +5 +10010 +7 +0111011 diff --git a/contests/Round853/B/main_input1.txt b/contests/Round853/B/main_input1.txt new file mode 100644 index 0000000..a3582ad --- /dev/null +++ b/contests/Round853/B/main_input1.txt @@ -0,0 +1,3 @@ +1 +6 +100100 \ No newline at end of file diff --git a/contests/Round853/B/main_input2.txt b/contests/Round853/B/main_input2.txt new file mode 100644 index 0000000..33a4575 --- /dev/null +++ b/contests/Round853/B/main_input2.txt @@ -0,0 +1,3 @@ +1 +6 +011100 \ No newline at end of file diff --git a/contests/Round853/B/main_input3.txt b/contests/Round853/B/main_input3.txt new file mode 100644 index 0000000..8435e27 --- /dev/null +++ b/contests/Round853/B/main_input3.txt @@ -0,0 +1,3 @@ +1 +7 +0011011 \ No newline at end of file diff --git a/contests/Round853/B/main_input4.txt b/contests/Round853/B/main_input4.txt new file mode 100644 index 0000000..c64122e --- /dev/null +++ b/contests/Round853/B/main_input4.txt @@ -0,0 +1,3 @@ +1 +2 +10 \ No newline at end of file diff --git a/contests/Round853/B/main_input5.txt b/contests/Round853/B/main_input5.txt new file mode 100644 index 0000000..82c90df --- /dev/null +++ b/contests/Round853/B/main_input5.txt @@ -0,0 +1,3 @@ +1 +2 +01 \ No newline at end of file diff --git a/contests/Round853/B/main_input6.txt b/contests/Round853/B/main_input6.txt new file mode 100644 index 0000000..4efbaa0 --- /dev/null +++ b/contests/Round853/B/main_input6.txt @@ -0,0 +1,3 @@ +1 +9 +110000101 \ No newline at end of file diff --git a/contests/Round853/B/main_input7.txt b/contests/Round853/B/main_input7.txt new file mode 100644 index 0000000..90e47d5 --- /dev/null +++ b/contests/Round853/B/main_input7.txt @@ -0,0 +1,3 @@ +1 +8 +00001000 \ No newline at end of file diff --git a/contests/Round853/B/main_output0.txt b/contests/Round853/B/main_output0.txt new file mode 100644 index 0000000..3e42eac --- /dev/null +++ b/contests/Round853/B/main_output0.txt @@ -0,0 +1,3 @@ +Yes +Yes +No diff --git a/contests/Round853/B/main_output1.txt b/contests/Round853/B/main_output1.txt new file mode 100644 index 0000000..289cc91 --- /dev/null +++ b/contests/Round853/B/main_output1.txt @@ -0,0 +1 @@ +No \ No newline at end of file diff --git a/contests/Round853/B/main_output2.txt b/contests/Round853/B/main_output2.txt new file mode 100644 index 0000000..3fdfb3d --- /dev/null +++ b/contests/Round853/B/main_output2.txt @@ -0,0 +1 @@ +Yes \ No newline at end of file diff --git a/contests/Round853/B/main_output3.txt b/contests/Round853/B/main_output3.txt new file mode 100644 index 0000000..3fdfb3d --- /dev/null +++ b/contests/Round853/B/main_output3.txt @@ -0,0 +1 @@ +Yes \ No newline at end of file diff --git a/contests/Round853/B/main_output4.txt b/contests/Round853/B/main_output4.txt new file mode 100644 index 0000000..3fdfb3d --- /dev/null +++ b/contests/Round853/B/main_output4.txt @@ -0,0 +1 @@ +Yes \ No newline at end of file diff --git a/contests/Round853/B/main_output5.txt b/contests/Round853/B/main_output5.txt new file mode 100644 index 0000000..3fdfb3d --- /dev/null +++ b/contests/Round853/B/main_output5.txt @@ -0,0 +1 @@ +Yes \ No newline at end of file diff --git a/contests/Round853/B/main_output6.txt b/contests/Round853/B/main_output6.txt new file mode 100644 index 0000000..3fdfb3d --- /dev/null +++ b/contests/Round853/B/main_output6.txt @@ -0,0 +1 @@ +Yes \ No newline at end of file diff --git a/contests/Round853/B/main_output7.txt b/contests/Round853/B/main_output7.txt new file mode 100644 index 0000000..3fdfb3d --- /dev/null +++ b/contests/Round853/B/main_output7.txt @@ -0,0 +1 @@ +Yes \ No newline at end of file diff --git a/contests/Round853/C/main.cpp b/contests/Round853/C/main.cpp new file mode 100755 index 0000000..7590c13 --- /dev/null +++ b/contests/Round853/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/Round853/D/main.cpp b/contests/Round853/D/main.cpp new file mode 100755 index 0000000..7590c13 --- /dev/null +++ b/contests/Round853/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/Round853/E/main.cpp b/contests/Round853/E/main.cpp new file mode 100755 index 0000000..7590c13 --- /dev/null +++ b/contests/Round853/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/Round853/F/main.cpp b/contests/Round853/F/main.cpp new file mode 100755 index 0000000..7590c13 --- /dev/null +++ b/contests/Round853/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(); + } +} + + -- cgit v1.2.3