malteklaes/cpp-code-code_search_net-style · Datasets at Hugging Face

func_code_string stringlengths 59 71.4k
#include <bits/stdc++.h> using namespace std; template <typename T> ostream& operator<<(ostream& os, vector<T>& v) { if (v.size() == 0) { os << empty vector n ; return os; } for (auto element : v) os << element << ; return os; } template <typename T, typename second> ostream&...
#include <bits/stdc++.h> using namespace std; const long long INF = 1e18; const int32_t M = 1e9 + 7; const int32_t MM = 998244353; long long gcd(long long a, long long b) { if (a == 0) return b; return gcd(b % a, a); } long long exetended_euclid(long long a, long long b, long long &x, ...
#include <bits/stdc++.h> int main() { long n(0); scanf( %ld , &n); long currentDiv = 2, total = 1; while (n > 1) { if (currentDiv * currentDiv > n) { total += n; break; } else if (n % currentDiv == 0) { total += n; n /= currentDiv; } else { ++c...
#include<iostream> #include<iomanip> #include<queue> #include<stack> #include<numeric> #include<cstring> #include<vector> #include<algorithm> #include<set> #include<map> #include<unordered_map> #include<unordered_set> #include<climits> #include<cmath> using namespace std; #define int lo...
#include <bits/stdc++.h> using namespace std; const int N = 3e4 + 5; map<int, int> mp[N]; int arr[N]; int main() { int n, m, a, b; cin >> n >> m; while (m--) { cin >> a >> b; mp[a][b]++; } arr[1] = 1; for (int i = 2; i <= n; i++) { int j = i; arr[j] = j; w...
#include <bits/stdc++.h> using namespace std; const long long inf = 1e9; struct node { int i, j, bal; char scoba; node() {} node(long long _i, long long _j, long long _k, char _scoba) : i(_i), j(_j), bal(_k), scoba(_scoba) {} }; node p[210][210][410]; int main() { ios_base::sync_...
#include <bits/stdc++.h> using namespace std; int n, x, y, z, f[1000000], k, ans = 0, a, b, c, t; vector<long long> v; map<long long, long long> m; int main() { cin >> n >> a >> b >> c >> t; for (int i = 0; i < n; i++) cin >> f[i]; sort(f, f + n); for (int i = 0; i < n; i++) { x = a; ...
#include <bits/stdc++.h> using namespace std; const double pi = acos(-1.0); const int size = 60; const int ssize = 20; const int lsize = 20 * 1000; char field[size][size]; int n, m; int cnt[1 << ssize]; double ans[1 << ssize]; int clr[size][size]; int hmas[lsize]; int bc(int msk) { int c = 0...
#include <bits/stdc++.h> using namespace std; long long conv(char c) { return c - a ; } vector<long long> get_sa(const char *s, long long n) { vector<long long> sa(n); long long m = 26; vector<long long> cnt(max(n, m)), x(n), y(n); for (long long i = 0; i < (long long)(n); ++i) cnt[x[i] = conv(s[...
#include <bits/stdc++.h> using namespace std; const int MAX = 69; const int MOD = 1000000007; void solve() { int r, c; cin >> r >> c; char grid[MAX][MAX]; int rows[r], cols[c], aCount = 0; for (int i = 0; i < r; i++) { rows[i] = 0; } for (int i = 0; i < c; i++) { cols[i] ...
#include <bits/stdc++.h> const int maxn = 60; int mtx[maxn][maxn]; int n, m; bool col_ok(int a, int b) { for (int i = 0; i < n; i++) { if (mtx[i][a] != mtx[i][b]) return 0; } return 1; } int main() { scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) for (int j = 0; j < m; j+...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); string x; cin >> x; string y = x; for (int i = 0; i < x.length(); i++) { if (x[i] == a ) continue; for (int j = i; j < x.length(); j++) { if (x[j] == a ) break; x[j] = char(int(...
#include <bits/stdc++.h> using namespace std; long long a[100005], ans = 0; int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); for (int i = 1; i < n; i++) { int j; for (j = 0;; j++) if (i + (1 << j) > n) break; j--; ans += a[i]; ...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 5; long long a[maxn], dp[maxn], sum[maxn]; int main() { int n, c; scanf( %d%d , &n, &c); for (int i = 1; i <= n; i++) { scanf( %lld , &a[i]); sum[i] = sum[i - 1] + a[i]; } multiset<long long> st; for (int i ...
#include <bits/stdc++.h> using namespace std; const int MAX = 1e5 + 5; const double PI = acos(-1); vector<double> vec; double getAngle(double x, double y) { if (x == 0) { if (y > 0) return 90; return 270; } if (y == 0) { if (x > 0) return 0; return 180; } double ang...
#include <bits/stdc++.h> using namespace std; int main() { long long a = 0, b = 0; bool gr = 0; cout << ? << 0 << << 0 << endl; fflush(stdout); int g; cin >> g; if (g == 1) gr = 1; else gr = 0; for (int i = 29; i >= 0; i--) { cout << ? << (a + (1 << i)...
#include <bits/stdc++.h> using namespace std; void solve() { int n; cin >> n; for (int i = 0; i < n; i++) { cout << 1 << ; } cout << endl; } int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout << setprecision(32); int t; cin >> t; while (t--) solve(...
#include <bits/stdc++.h> using namespace std; int n, m, i, a[1005], b[1005], Id[1005]; int ans, ans1, ans2; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); b[i] = a[i]; Id[b[i]] = i; } sort(a + 1, a + n + 1); i = 1; while (i <= n) { ...
#include <bits/stdc++.h> using namespace std; long long A, B, N; long long l, t, m; int main() { cin >> A >> B >> N; for (int i = 0; i < N; i++) { cin >> l >> t >> m; if (t < A + (l - 1) * B) { cout << -1 << endl; } else { long long left = l, right = (t - A) / B + 1; ...
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; int main() { int t, n; string a; cin >> t; while (t--) { cin >> n; cin >> a; int l = 0, r = n - 1; while (a[l] == a[r] && l <= r) l++, r--; if (l > r) cout << 0 << endl; else { ...
#include <bits/stdc++.h> using namespace std; int t; int n; long long a[200010]; int ans_check[200010]; int main() { int i, j, k; scanf( %d , &t); while (t--) { int check = 0; int cnt = 1; memset(ans_check, 0, sizeof(ans_check)); scanf( %d , &n); for (i = 1; i <= n;...
#include <bits/stdc++.h> using namespace std; const long long MOD = 1000000007; int main() { long long n, i, j, t; vector<long long> a; vector<long long> b; cin >> n; for (i = 0; i < n; i++) { cin >> j; a.push_back(j); b.push_back(j); } sort(a.begin(), a.end()); s...
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1.0); const int INF = 1000000000; const int MOD = 1000000007; long long b(long long a, long long n, long long mod) { if (n == 0) { return 1; } if (n == 1) { return a % mod; } long long t = b(a, n / 2, mod); ...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int sum = n * (n + 1) / 2; for (int i = n; i > 0; i--) { sum += (n - i) * (i - 1); } cout << sum; }
#include <bits/stdc++.h> int a[200001]; int renew[200001]; int payoff[200001]; int maxpay[200001]; int main() { int n; scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d , a + i); int q; scanf( %d , &q); for (int i = 0; i < q; i++) { int mode; scanf( %d , &mode); ...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); int n, k; cin >> n >> k; vector<pair<int, int>> a(n); for (int i = 0; i < n; ++i) { cin >> a[i].first; a[i].second = i; } sort(a.rbegin(), a.rend()); queue<int> x;...
#include <bits/stdc++.h> using namespace std; inline void err(istringstream iss) {} template <typename T, typename... Args> void err(istringstream iss, const T &$val, const Args &...args) { string $name; *iss >> $name; if ($name.back() == , ) $name.pop_back(); cout << $name << = << $val <...
#include <bits/stdc++.h> using namespace std; int dx[] = {1, -1, 0, 0}; int dy[] = {0, 0, 1, -1}; int dx2[] = {1, -1, 0, 0, -1, 1, -1, 1}; int dy2[] = {0, 0, 1, -1, 1, -1, -1, 1}; int read() { int x; scanf( %d , &x); return x; } int a[505][505]; int main() { int x, y; x = read(); ...
#include <bits/stdc++.h> using namespace std; struct hashed_str { long long n; vector<long long> hs; vector<long long> pows; long long p = 61; long long mod = 1e9 + 7; hashed_str(string &s) { n = s.size(); long long n1 = (int)s.size(); pows = {1}; for (int i = 1; i < ...
#include <bits/stdc++.h> using namespace std; int max(long long int arr[], long long int n) { int m = INT_MIN; for (int i = 0; i < n; i++) { if (arr[i] > m) { m = arr[i]; } } return (m); } void display(long long int arr[], long long int n) { for (int i = 0; i < n; i++) { ...
#include <bits/stdc++.h> typedef struct { int num; int val; int rank; } data; int cnum(const void* a, const void* b) { return ((data)a)->num - ((data)b)->num; } int cval(const void* a, const void* b) { return ((data)b)->val - ((data)a)->val; } int main(void) { int i, n; dat...
#include <bits/stdc++.h> using namespace std; int v[2 * 110]; int main() { int n, m, ans = -0x3f3f3f3f; cin >> n; m = n; n *= 2; n -= 1; for (int i = 0; i < n; i++) { cin >> v[i]; } sort(v, v + n); if (m % 2 == 0) { for (int x = 0; x <= n - 1; x += 2) { int ...
#include <bits/stdc++.h> using namespace std; int n; vector<pair<int, int> > arr; long long solve1(vector<pair<int, int> > tab) { multiset<int> S; int W = 0; for (int i = 0; i < n; i++) { W += tab[i].first; S.insert(tab[i].second); } for (int j = 0; j < n / 2; j++) { int id...
#include <bits/stdc++.h> using namespace std; int main(void) { long long a, b, c; cin >> a >> b >> c; long long flag = 1; if (a == b) flag = 0; cout << c * 2 + min(a, b) * 2 + flag << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long N, M, K, L; cin >> N >> M >> K >> L; long long max = N / M; long long ans = 1; bool f1 = true, f2 = true, f3 = true; if (max < 1) f1 = !f1; if (max * M - K < L) f3 = !f3; if (f1 && f2 && f3) { ans = (L + K) / ...
#include <bits/stdc++.h> const int MAXN = 2e6 + 5; using namespace std; pair<int, int> arr[MAXN]; bool cmp(const pair<int, int> a, const pair<int, int> b) { return a.second > b.second; } int main() { int n, m; scanf( %d %d , &n, &m); for (int i = 0; i < m; i++) { int q, w; scanf(...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int t; cin >> t; while (t--) { int n, m, a, b; cin >> n >> m >> a >> b; int total_ones = n * a; if (total_ones != m * b) { cout << NO ...
#include <bits/stdc++.h> using namespace std; void ASS(bool bb) { if (!bb) { ++(int)0; } } #pragma comment(linker, /STACK:106777216 ) int read() { int x; scanf( %d , &x); return x; } int main() { int k, b, n; k = read(); b = read(); n = read(); map<int, int...
#include <bits/stdc++.h> using namespace std; signed main() { unsigned long long a, b; cin >> a >> b; if (a < b \|\| (a % 2 != b % 2)) { cout << -1 << endl; return 0; } unsigned long long x = (a - b) / 2; unsigned long long y = x + b; cout << x << << y << endl; return 0...
#include <bits/stdc++.h> using namespace std; const long long OO = 0x3f3f3f3f; const long long mod = 1e9 + 7; const double pi = 3.14159265359; void skrrrt() { ios_base::sync_with_stdio(0), cin.tie(0); } const int N = 2009; int n, d; long long mem[N][N][2][2]; string a, b; long long solve(int ind, in...
#include <bits/stdc++.h> template <class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template <class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } constexpr long long MAX = 5100000; constexp...
#include <bits/stdc++.h> using namespace std; int a[2001], b[2001], n, k, len = 0, ans = 0, res = 0; void solve() { scanf( %d %d , &n, &k); for (int i = 0; i < n; i++) { scanf( %d , a + i); } sort(a, a + n); for (int i = 0; i < n; i++) { if (a[i] + k <= 5) { len++; } ...
#include <bits/stdc++.h> int n, g, c[6010]; bool p(int x) { if (x == 1) return 0; for (int i = 2; i * i <= x; i++) if (x % i == 0) return 0; return 1; } int main() { scanf( %d , &n); g = n * (n + 1) / 2; if ((g & 1) && (n > 2) && !p(g - 2)) c[3] = 2, g -= 3; for (int i = 0; i <...
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; int a[n + 1]; int c; for (int i = 0; i <= n; i++) a[i] = i; if (k == n) cout << -1; else { for (int i = 1; i < (n - k); i++) { c = a[i]; a[i] = a[i + 1]; a[i + 1] = c; ...
#include <bits/stdc++.h> using namespace std; const int maxn = 105; map<string, int> mp1[maxn], mp2[maxn]; vector<int> ans; char getA(string a, string b) { int c[30]; for (int i = 0; i < 26; i++) c[i] = 0; for (int i = 0; i < a.size(); i++) c[a[i] - a ]++; for (int i = 0; i < b.size(); i++) c...
#include <bits/stdc++.h> int main() { int t; std::cin >> t; while (t--) { std::set<int> all; int n; std::cin >> n; while (n--) { int tmp; std::cin >> tmp; while ((tmp & 1) == 0) { all.insert(tmp); tmp >>= 1; } } printf...
#include <bits/stdc++.h> using namespace std; int n, k, q, inc[101]; double a[101], mi = 1000000007LL, ma; set<vector<int> > S; set<vector<int> >::iterator it; int main() { cin >> n >> k; for (int i = 0; i < n; i++) cin >> a[i]; cin >> q; int m = n / k; for (int i = 0; i < q; i++) { ...
#include <bits/stdc++.h> using namespace std; int ans, a, b, n, x; int main() { scanf( %d , &n); while (n--) { scanf( %d , &x); if (n == 0) a = x; b = max(b, x); } printf( %d n , a ^ b); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int T; cin >> T; while (T--) { int a; cin >> a; if (a % 2 == 0) cout << a - 1 << ; else cout << a << ; } }
#include <bits/stdc++.h> void merging(long long arr[], long long start, long long mid, long long end); void sort(long long arr[], long long start, long long end) { long long mid; if (end - start + 1 > 1) { mid = (start + end) / 2; sort(arr, start, mid); sort(arr, mid + 1, end); mergi...
#include <bits/stdc++.h> using namespace std; int getint() { unsigned int c; int x = 0; while (((c = getchar()) - 0 ) >= 10) { if (c == - ) return -getint(); if (!~c) exit(0); } do { x = (x << 3) + (x << 1) + (c - 0 ); } while (((c = getchar()) - 0 ) < 10); return x...
#include <bits/stdc++.h> using namespace std; int main() { long long al; cin >> al; while (al--) { long long b, c; cin >> b >> c; if ((abs(b - c)) % 10 == 0) cout << abs(b - c) / 10 << n ; else { b = abs(b - c); cout << b / 10 + 1 << n ; } } ...
#include <bits/stdc++.h> using namespace std; int n, m; int pos[100010]; int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; bool check(int i, int j) { int x = (i - 1) / m + 1, y = (i - 1) % m + 1; int x2 = (j - 1) / m + 1, y2 = (j - 1) % m + 1; for (int k = 0; k < 4; k++) if (x + dx[k] == x2 &&...
#include <bits/stdc++.h> const long long llinfinity = 9223372036854775807LL; const long long llminusinfinity = -9223372036854775808LL; const int intinfinity = 2147483647; const int intminusinfinity = -2147483648; using namespace std; const int maxn = 1e5 + 5; int a[maxn], n; long long ans; int main(in...
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10; int n, k, ps[N], mx[N], cnt[N], a[N]; long long ans; int getNeed(int p, int m) { int x = (((p - m) % k) + k) % k; return cnt[((k - x) + k) % k]; } void solve(int l, int r) { if (r - l <= 1) return; int mid = (l + r) / 2;...
#include <bits/stdc++.h> using namespace std; const int inf = (1 << 30) - 1; const long long linf = (1ll << 62) - 1; int n, l, t; vector<int> a; long double ans = 0; inline int getCount(int ll, int rr) { if (rr < l) { ll = lower_bound((a).begin(), (a).end(), ll) - a.begin(); rr = upper_bou...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int ans = 2; for (int i = 1; i <= n; i++) { int tmp; cin >> tmp; if (tmp % 2 == 0) { ans = 3 - ans; } cout << ans << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; char a[20][20]; int i, j, k = 0; string s = WBWBWBWB , s1 = BWBWBWBW , z[20]; int main() { for (i = 1; i <= 8; i++) { cin >> z[i]; } for (i = 1; i <= 8; i++) { if (z[i] != s && z[i] != s1) { cout << NO ; return 0; }...
#include <bits/stdc++.h> using namespace std; void gethas(string s, int &has0, int &hasa, int &hasA) { int n = int(s.size()); has0 = 0; hasa = 0; hasA = 0; for (int i = 0; i < n; i++) { char c = s[i]; has0 = has0 or ( 0 <= c and c <= 9 ); hasa = hasa or ( a <= c and c <= z ...
#include <bits/stdc++.h> using namespace std; const long long MOD = 1000000009; long long pow(long long a, long long b, long long m) { long long ans = 1; while (b) { if (b & 1) ans = (ans * a) % m; b /= 2; a = (a * a) % m; } return ans; } int32_t main() { ios_base::sync_w...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1007; long long lcp[MAXN][MAXN]; string s; bool cmp(pair<long long, long long> a, pair<long long, long long> b) { long long l = lcp[a.second][b.second]; long long al = a.second - a.first + 1; long long bl = b.second - b.first + 1; ...
#include <bits/stdc++.h> using namespace std; const int INF = std::numeric_limits<int>::max() / 3; long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); } int dp[6000][6000]; long long sum[1000000]; long long mi...
#include <bits/stdc++.h> using namespace std; const int maxn = 5e5 + 5; int a[maxn], n, k; long long sum; long long judge1(int m) { long long ans = 0; for (int i = 1; a[i] < m && i <= n; i++) { ans += m - a[i]; } return ans; } long long judge2(int m) { long long ans = 0; for ...
#include <bits/stdc++.h> using namespace std; template <typename A, typename B> string to_string(pair<A, B> p); template <typename A, typename B, typename C> string to_string(tuple<A, B, C> p); template <typename A, typename B, typename C, typename D> string to_string(tuple<A, B, C, D> p); string to_str...
#include <bits/stdc++.h> using namespace std; int s[200005]; struct pp { int lev; int loc; } s1[200005], s2[200005]; bool cmp(pp &a, pp &b) { return a.lev < b.lev; } int main() { int t; cin >> t; for (int i = 0; i < t; i++) { int s1h = 0, s2h = 0; string test; int n; ...
#include <bits/stdc++.h> using namespace std; const long long int mod = 1e9 + 7; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int T = clock(); long long int a, ta, b, tb; cin >> a >> ta >> b >> tb; string s; cin >> s; long long int i =...
#include <bits/stdc++.h> using namespace std; int main() { int a, b, a2 = 0, b2 = 0, a3 = 0, b3 = 0, a5 = 0, b5 = 0; cin >> a >> b; while (a % 2 == 0) { a2++; a /= 2; } while (a % 3 == 0) { a3++; a /= 3; } while (a % 5 == 0) { a5++; a /= 5; } w...
#include <bits/stdc++.h> using namespace std; const int N = 200514; vector<int> a3[N], a4[N], mn, mx; set<int> s; int p3[N], p4[N]; int n, m, M, a[N], ct[N], l1 = 1, l2 = 1; int j, p1, p2, k1, k2; int main() { scanf( %d%d , &n, &m); p3[n + 1] = p4[n + 1] = n + 1; for (int i = (1); i <= (n); ...
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; vector<vector<int> > g; vector<int> buf; g.clear(); buf.clear(); for (int i = 0; i < k; i++) g.push_back(buf); vector<int> num; num.clear(); int j; for (j = 0; j < n * k; j++) num.push_bac...
#include <bits/stdc++.h> using namespace std; const long long INF = (1ll << 45); long long bit[1000006]; void update(long long from, long long val) { for (long long i = from; i < 1000006; i += i & -i) bit[i] += val; } long long query(long long from) { if (from == 0) return 0; long long cnt = 0; ...
#include <bits/stdc++.h> using namespace std; const long long INF = 1 << 28; const long long LINF = 1ll << 61; inline long long getnum() { register long long r = 0; register bool ng = 0; register char c; c = getchar(); while (c != - && (c < 0 \|\| c > 9 )) c = getchar(); if (c == - )...
#include <bits/stdc++.h> int vi[60], ho[60]; int main() { int n, k, i; int x, y; scanf( %d , &n); for (k = 1; k <= n * n; k++) { scanf( %d%d , &x, &y); if (vi[x] \|\| ho[y]) continue; vi[x] = 1; ho[y] = 1; printf( %d , k); } }
#include<bits/stdc++.h> #define y1 dmytxdy #define pb push_back #define fi first #define se second #define mp make_pair using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair<int,int> pii; typedef pair<ll,ll> pll; typedef long double ld; template <typ...
#include<bits/stdc++.h> using namespace std; int main() { int tst,i,m,n; cin>>tst; while(tst--) { int ar[4]; cin>>ar[0]>>ar[1]>>ar[2]>>ar[3]; n=max(ar[2],ar[3]);m=max(ar[0],ar[1]); sort(ar,ar+4); ((n==ar[3]\|\|n==ar[2])&&(m==ar[3] \|\| m==ar[2]...
#include <bits/stdc++.h> using namespace std; constexpr int maxn = 1010; int n; bool e[maxn][maxn]; pair<int, int> flip(int a, int b, bool inv) { int x = -1, y; for (int i = 0; i < n; i++) if (e[a][i] && e[b][i]) if (x == -1) x = i; else { y = i; bre...
#include <bits/stdc++.h> using namespace std; template <class T> std::ostream& operator<<(std::ostream& os, const std::vector<T>& input) { for (auto const& i : input) { os << i << ; } return os; } template <class T1, class T2> std::ostream& operator<<(std::ostream& os, const std::pair<T...
#include <bits/stdc++.h> using namespace std; struct point { int x, y; }; int dist(const point &a, const point &b) { return (a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y); } int main(int argc, char *argv[]) { point p[8]; int a[8] = {0, 1, 2, 3, 4, 5, 6, 7}; for (int i = 0; i < 8; ...
#include <bits/stdc++.h> using namespace std; const int N = 59; int t[N]; inline int read() { int s = 1, a = 0; char ch = getchar(); while (ch < 0 \|\| ch > 9 ) { if (ch == - ) s = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { a = a * 10 + ch - 0 ; ch = ge...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 7; const int M = 23; const int inf = 1e9 + 7; const long long base = 1e18; const double pi = acos(-1); const double ep = 1e-9; map<int, int> st; int pre[1 << M]; int cur[1 << M]; int n; int a[N]; int main() { cin >> n; f...
#include <bits/stdc++.h> using namespace std; int n, r; vector<pair<int, int> > pos, L, R; vector<int> ans; map<pair<int, int>, int> vis; bool cmp(pair<int, int> a, pair<int, int> b) { return a.first + a.second < b.first + b.second; } int main() { cin >> n >> r; for (int i = 0; i < n; i++) {...
#include <bits/stdc++.h> using namespace std; int main(int argc, char* argv[]) { ios_base::sync_with_stdio(false); long long int N, M; cin >> N >> M; long long int max_n1; for (max_n1 = 1; (max_n1 * (max_n1 - 1)) / 2 + 1 <= N; max_n1 += 2) ; max_n1 -= 2; long long int max_n2; f...
#include <bits/stdc++.h> using namespace std; const int MAX = 111111; int N; char s[MAX]; int f[MAX]; int sum[MAX]; bool match(int i, int j) { if (i < 1 \|\| j < 1) return 0; if (s[i - 1] == ) ) return s[j - 1] == ( ; else return s[j - 1] == [ ; } int get(int i) { return f[i -...
#include <bits/stdc++.h> using namespace std; struct node { int num; double w; } point[1005]; bool cmp(node a, node b) { if (fabs(a.w - b.w) < 0.0001) return a.num < b.num; return a.w > b.w; } int main() { int i, n, t1, t2, k, a, b; scanf( %d%d%d%d , &n, &t1, &t2, &k); for (i = 1...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<pair<int, int> > v; for (int i = 0; i < n; i++) { int a, b; cin >> a >> b; v.push_back(make_pair(a, b)); } int k; cin >> k; int i; for (i = 0; i < n; i++) { if (k >= v[i].fi...
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; int a[n + 2][m + 2]; int counter = 1; for (int i = 1; i <= n; i += 2) { for (int j = 1; j <= m; j++) { if (n % 2 && i == n && j % 2 == 1) continue; a[i + (j % 2 == 1)][j] = counter; ...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int minutes[n]; int result = -1; int lastN = 0; for (int i = 0; i < n; i++) { cin >> minutes[i]; if (i == 0 && minutes[0] > 15) { result = 15; } else if (result < 0 && minutes[i] - minutes[i...
#include <bits/stdc++.h> using namespace std; int main() { int k; cin >> k; if (k % 2 == 1) { cout << -1 << endl; return 0; } for (int i = 0; i < k; i++) { if (i > 0) cout << endl; for (int j = 0; j < k; j++) { for (int l = 0; l < k; l++) { int layer = m...
#include <bits/stdc++.h> using namespace std; void dfs3(int v, vector<vector<int>> &graf, vector<int> &ways) { ways[v] = -1; for (auto el : graf[v]) { if (ways[el] != -1) { dfs3(el, graf, ways); } } } void dfs2(int v, vector<vector<int>> &graf, ve...
#include <bits/stdc++.h> int main() { long long int l1, r1, l2, r2, k, l, r, t; scanf( %lld%lld%lld%lld%lld , &l1, &r1, &l2, &r2, &k); if (l1 > l2) l = l1; else l = l2; if (r1 > r2) r = r2; else r = r1; if ((k >= l) && (k <= r)) t = r - l; else t = r...
#include <bits/stdc++.h> const int md = 1e9 + 7; int n, k, m, M, c; struct mat { int A[256][256]; inline mat() { memset(A, 0, sizeof A); } inline int* operator[](const int& x) { return A[x]; } inline mat operator*(const mat& b) const { mat c; for (int i = 0; i <= M; ++i) for (i...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int t_1 = -1, t_2 = -1; int c1 = 0, c2 = 0; int a = 0; for (int i = 0; i < n; ++i) { int t; cin >> t; if (t_1 == -1) { t_1 = t; c1++; } else if (t_1 == t) { c1++; ...
#include <bits/stdc++.h> using std::cerr; using std::endl; const int N = 2e5 + 233; int n, m; std::map<std::pair<int, int>, int> map; std::vector<std::pair<int, int>> seg[N * 4]; void insert(int p, int l, int r, std::pair<int, int> e, int L, int R) { if (l <= L && r >= R) return seg[p].push_back(e), v...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native ) #pragma GCC optimize( unroll-loops ) using namespace std; template <typename T1, typename T2> inline void chkmin(T1 &first, T2 second) { if (first > second) first = second; ...
#include <bits/stdc++.h> using namespace std; int main() { int n, q, x; vector<int> v; cin >> n; for (int i = 1; i <= n; i++) { cin >> x; v.push_back(x); } sort(v.begin(), v.end()); cin >> q; while (q--) { cin >> x; int ans = upper_bound(v.begin(), v.end(), x)...
#include <bits/stdc++.h> using namespace std; int p[100001], w[100001]; bool combine(int x, int y) { while (p[x] != x) x = p[x] = p[p[x]]; while (p[y] != y) y = p[y] = p[p[y]]; if (x == y) return false; if (w[x] < w[y]) w[p[x] = y] += w[x]; else w[p[y] = x] += w[y]; return true...
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, x, y, z; cin >> a >> b >> c >> x >> y >> z; int ans; if ((a == 0 && b == 0 && c) \|\| (x == 0 && y == 0 && z)) { ans = 0; } else if (a * y == b * x) { if (a * z == c * x && b * z == c * y) { ans = -1; ...
#include <bits/stdc++.h> using namespace std; const int N = 21; string s; long long heavy = 0, sol = 0; int main() { cin >> s; for (int i = 0; i < s.size(); i++) { string temp = s.substr(i, 5); if (temp == heavy ) { heavy++; i += 4; } else if (temp == metal ) { ...
#include <bits/stdc++.h> using namespace std; template <class T> inline void chmax(T &x, T &y) { if (x < y) swap(x, y); } template <class T> inline void chmin(T &x, T &y) { if (x > y) swap(x, y); } const long long INF = 0x3f3f3f3f3f3f; const long long MOD = 1e9 + 7; const double EPS = 10e-10...
#include <bits/stdc++.h> using namespace std; long long n, tmp; map<long long, int> b; long long j = 1, c[33]; void make_two_pow() { long long i = 2; while (j <= 32) { c[j++] = i; i *= 2; } } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);...
#include <bits/stdc++.h> using namespace std; const int Max = 1e5 + 10; int fw[Max][26]; int bw[Max][26]; int gs[Max][26]; int ge[Max][26]; int n; int A[Max]; int mex(vector<int> vec); void CalcGS(int i, int c); void CalcGE(int i, int c); int mex(vector<int> vec) { sort(vec.begin(), vec.end(...

#include <bits/stdc++.h> using namespace std; template <typename T> ostream& operator<<(ostream& os, vector<T>& v) { if (v.size() == 0) { os << empty vector n ; return os; } for (auto element : v) os << element << ; return os; } template <typename T, typename second> ostream&...

#include <bits/stdc++.h> using namespace std; const long long INF = 1e18; const int32_t M = 1e9 + 7; const int32_t MM = 998244353; long long gcd(long long a, long long b) { if (a == 0) return b; return gcd(b % a, a); } long long exetended_euclid(long long a, long long b, long long &x, ...

#include <bits/stdc++.h> int main() { long n(0); scanf( %ld , &n); long currentDiv = 2, total = 1; while (n > 1) { if (currentDiv * currentDiv > n) { total += n; break; } else if (n % currentDiv == 0) { total += n; n /= currentDiv; } else { ++c...

#include<iostream> #include<iomanip> #include<queue> #include<stack> #include<numeric> #include<cstring> #include<vector> #include<algorithm> #include<set> #include<map> #include<unordered_map> #include<unordered_set> #include<climits> #include<cmath> using namespace std; #define int lo...

#include <bits/stdc++.h> using namespace std; const int N = 3e4 + 5; map<int, int> mp[N]; int arr[N]; int main() { int n, m, a, b; cin >> n >> m; while (m--) { cin >> a >> b; mp[a][b]++; } arr[1] = 1; for (int i = 2; i <= n; i++) { int j = i; arr[j] = j; w...

#include <bits/stdc++.h> using namespace std; const long long inf = 1e9; struct node { int i, j, bal; char scoba; node() {} node(long long _i, long long _j, long long _k, char _scoba) : i(_i), j(_j), bal(_k), scoba(_scoba) {} }; node p[210][210][410]; int main() { ios_base::sync_...

#include <bits/stdc++.h> using namespace std; int n, x, y, z, f[1000000], k, ans = 0, a, b, c, t; vector<long long> v; map<long long, long long> m; int main() { cin >> n >> a >> b >> c >> t; for (int i = 0; i < n; i++) cin >> f[i]; sort(f, f + n); for (int i = 0; i < n; i++) { x = a; ...

#include <bits/stdc++.h> using namespace std; const double pi = acos(-1.0); const int size = 60; const int ssize = 20; const int lsize = 20 * 1000; char field[size][size]; int n, m; int cnt[1 << ssize]; double ans[1 << ssize]; int clr[size][size]; int hmas[lsize]; int bc(int msk) { int c = 0...

#include <bits/stdc++.h> using namespace std; long long conv(char c) { return c - a ; } vector<long long> get_sa(const char *s, long long n) { vector<long long> sa(n); long long m = 26; vector<long long> cnt(max(n, m)), x(n), y(n); for (long long i = 0; i < (long long)(n); ++i) cnt[x[i] = conv(s[...

#include <bits/stdc++.h> using namespace std; const int MAX = 69; const int MOD = 1000000007; void solve() { int r, c; cin >> r >> c; char grid[MAX][MAX]; int rows[r], cols[c], aCount = 0; for (int i = 0; i < r; i++) { rows[i] = 0; } for (int i = 0; i < c; i++) { cols[i] ...

#include <bits/stdc++.h> const int maxn = 60; int mtx[maxn][maxn]; int n, m; bool col_ok(int a, int b) { for (int i = 0; i < n; i++) { if (mtx[i][a] != mtx[i][b]) return 0; } return 1; } int main() { scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) for (int j = 0; j < m; j+...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); string x; cin >> x; string y = x; for (int i = 0; i < x.length(); i++) { if (x[i] == a ) continue; for (int j = i; j < x.length(); j++) { if (x[j] == a ) break; x[j] = char(int(...

#include <bits/stdc++.h> using namespace std; long long a[100005], ans = 0; int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); for (int i = 1; i < n; i++) { int j; for (j = 0;; j++) if (i + (1 << j) > n) break; j--; ans += a[i]; ...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 5; long long a[maxn], dp[maxn], sum[maxn]; int main() { int n, c; scanf( %d%d , &n, &c); for (int i = 1; i <= n; i++) { scanf( %lld , &a[i]); sum[i] = sum[i - 1] + a[i]; } multiset<long long> st; for (int i ...

#include <bits/stdc++.h> using namespace std; const int MAX = 1e5 + 5; const double PI = acos(-1); vector<double> vec; double getAngle(double x, double y) { if (x == 0) { if (y > 0) return 90; return 270; } if (y == 0) { if (x > 0) return 0; return 180; } double ang...

#include <bits/stdc++.h> using namespace std; int main() { long long a = 0, b = 0; bool gr = 0; cout << ? << 0 << << 0 << endl; fflush(stdout); int g; cin >> g; if (g == 1) gr = 1; else gr = 0; for (int i = 29; i >= 0; i--) { cout << ? << (a + (1 << i)...

#include <bits/stdc++.h> using namespace std; void solve() { int n; cin >> n; for (int i = 0; i < n; i++) { cout << 1 << ; } cout << endl; } int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout << setprecision(32); int t; cin >> t; while (t--) solve(...

#include <bits/stdc++.h> using namespace std; int n, m, i, a[1005], b[1005], Id[1005]; int ans, ans1, ans2; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); b[i] = a[i]; Id[b[i]] = i; } sort(a + 1, a + n + 1); i = 1; while (i <= n) { ...

#include <bits/stdc++.h> using namespace std; long long A, B, N; long long l, t, m; int main() { cin >> A >> B >> N; for (int i = 0; i < N; i++) { cin >> l >> t >> m; if (t < A + (l - 1) * B) { cout << -1 << endl; } else { long long left = l, right = (t - A) / B + 1; ...

#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; int main() { int t, n; string a; cin >> t; while (t--) { cin >> n; cin >> a; int l = 0, r = n - 1; while (a[l] == a[r] && l <= r) l++, r--; if (l > r) cout << 0 << endl; else { ...

#include <bits/stdc++.h> using namespace std; int t; int n; long long a[200010]; int ans_check[200010]; int main() { int i, j, k; scanf( %d , &t); while (t--) { int check = 0; int cnt = 1; memset(ans_check, 0, sizeof(ans_check)); scanf( %d , &n); for (i = 1; i <= n;...

#include <bits/stdc++.h> using namespace std; const long long MOD = 1000000007; int main() { long long n, i, j, t; vector<long long> a; vector<long long> b; cin >> n; for (i = 0; i < n; i++) { cin >> j; a.push_back(j); b.push_back(j); } sort(a.begin(), a.end()); s...

#include <bits/stdc++.h> using namespace std; const double PI = acos(-1.0); const int INF = 1000000000; const int MOD = 1000000007; long long b(long long a, long long n, long long mod) { if (n == 0) { return 1; } if (n == 1) { return a % mod; } long long t = b(a, n / 2, mod); ...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int sum = n * (n + 1) / 2; for (int i = n; i > 0; i--) { sum += (n - i) * (i - 1); } cout << sum; }

#include <bits/stdc++.h> int a[200001]; int renew[200001]; int payoff[200001]; int maxpay[200001]; int main() { int n; scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d , a + i); int q; scanf( %d , &q); for (int i = 0; i < q; i++) { int mode; scanf( %d , &mode); ...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); int n, k; cin >> n >> k; vector<pair<int, int>> a(n); for (int i = 0; i < n; ++i) { cin >> a[i].first; a[i].second = i; } sort(a.rbegin(), a.rend()); queue<int> x;...

#include <bits/stdc++.h> using namespace std; inline void err(istringstream *iss) {} template <typename T, typename... Args> void err(istringstream *iss, const T &$val, const Args &...args) { string $name; *iss >> $name; if ($name.back() == , ) $name.pop_back(); cout << $name << = << $val <...

#include <bits/stdc++.h> using namespace std; int dx[] = {1, -1, 0, 0}; int dy[] = {0, 0, 1, -1}; int dx2[] = {1, -1, 0, 0, -1, 1, -1, 1}; int dy2[] = {0, 0, 1, -1, 1, -1, -1, 1}; int read() { int x; scanf( %d , &x); return x; } int a[505][505]; int main() { int x, y; x = read(); ...

#include <bits/stdc++.h> using namespace std; struct hashed_str { long long n; vector<long long> hs; vector<long long> pows; long long p = 61; long long mod = 1e9 + 7; hashed_str(string &s) { n = s.size(); long long n1 = (int)s.size(); pows = {1}; for (int i = 1; i < ...

#include <bits/stdc++.h> using namespace std; int max(long long int arr[], long long int n) { int m = INT_MIN; for (int i = 0; i < n; i++) { if (arr[i] > m) { m = arr[i]; } } return (m); } void display(long long int arr[], long long int n) { for (int i = 0; i < n; i++) { ...

#include <bits/stdc++.h> typedef struct { int num; int val; int rank; } data; int cnum(const void* a, const void* b) { return ((data*)a)->num - ((data*)b)->num; } int cval(const void* a, const void* b) { return ((data*)b)->val - ((data*)a)->val; } int main(void) { int i, n; dat...

#include <bits/stdc++.h> using namespace std; int v[2 * 110]; int main() { int n, m, ans = -0x3f3f3f3f; cin >> n; m = n; n *= 2; n -= 1; for (int i = 0; i < n; i++) { cin >> v[i]; } sort(v, v + n); if (m % 2 == 0) { for (int x = 0; x <= n - 1; x += 2) { int ...

#include <bits/stdc++.h> using namespace std; int n; vector<pair<int, int> > arr; long long solve1(vector<pair<int, int> > tab) { multiset<int> S; int W = 0; for (int i = 0; i < n; i++) { W += tab[i].first; S.insert(tab[i].second); } for (int j = 0; j < n / 2; j++) { int id...

#include <bits/stdc++.h> using namespace std; int main(void) { long long a, b, c; cin >> a >> b >> c; long long flag = 1; if (a == b) flag = 0; cout << c * 2 + min(a, b) * 2 + flag << endl; return 0; }

#include <bits/stdc++.h> using namespace std; int main() { long long N, M, K, L; cin >> N >> M >> K >> L; long long max = N / M; long long ans = 1; bool f1 = true, f2 = true, f3 = true; if (max < 1) f1 = !f1; if (max * M - K < L) f3 = !f3; if (f1 && f2 && f3) { ans = (L + K) / ...

#include <bits/stdc++.h> const int MAXN = 2e6 + 5; using namespace std; pair<int, int> arr[MAXN]; bool cmp(const pair<int, int> a, const pair<int, int> b) { return a.second > b.second; } int main() { int n, m; scanf( %d %d , &n, &m); for (int i = 0; i < m; i++) { int q, w; scanf(...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int t; cin >> t; while (t--) { int n, m, a, b; cin >> n >> m >> a >> b; int total_ones = n * a; if (total_ones != m * b) { cout << NO ...

#include <bits/stdc++.h> using namespace std; void ASS(bool bb) { if (!bb) { ++*(int*)0; } } #pragma comment(linker, /STACK:106777216 ) int read() { int x; scanf( %d , &x); return x; } int main() { int k, b, n; k = read(); b = read(); n = read(); map<int, int...

#include <bits/stdc++.h> using namespace std; signed main() { unsigned long long a, b; cin >> a >> b; if (a < b || (a % 2 != b % 2)) { cout << -1 << endl; return 0; } unsigned long long x = (a - b) / 2; unsigned long long y = x + b; cout << x << << y << endl; return 0...

#include <bits/stdc++.h> using namespace std; const long long OO = 0x3f3f3f3f; const long long mod = 1e9 + 7; const double pi = 3.14159265359; void skrrrt() { ios_base::sync_with_stdio(0), cin.tie(0); } const int N = 2009; int n, d; long long mem[N][N][2][2]; string a, b; long long solve(int ind, in...

#include <bits/stdc++.h> template <class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template <class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } constexpr long long MAX = 5100000; constexp...

#include <bits/stdc++.h> using namespace std; int a[2001], b[2001], n, k, len = 0, ans = 0, res = 0; void solve() { scanf( %d %d , &n, &k); for (int i = 0; i < n; i++) { scanf( %d , a + i); } sort(a, a + n); for (int i = 0; i < n; i++) { if (a[i] + k <= 5) { len++; } ...

#include <bits/stdc++.h> int n, g, c[6010]; bool p(int x) { if (x == 1) return 0; for (int i = 2; i * i <= x; i++) if (x % i == 0) return 0; return 1; } int main() { scanf( %d , &n); g = n * (n + 1) / 2; if ((g & 1) && (n > 2) && !p(g - 2)) c[3] = 2, g -= 3; for (int i = 0; i <...

#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; int a[n + 1]; int c; for (int i = 0; i <= n; i++) a[i] = i; if (k == n) cout << -1; else { for (int i = 1; i < (n - k); i++) { c = a[i]; a[i] = a[i + 1]; a[i + 1] = c; ...

#include <bits/stdc++.h> using namespace std; const int maxn = 105; map<string, int> mp1[maxn], mp2[maxn]; vector<int> ans; char getA(string a, string b) { int c[30]; for (int i = 0; i < 26; i++) c[i] = 0; for (int i = 0; i < a.size(); i++) c[a[i] - a ]++; for (int i = 0; i < b.size(); i++) c...

#include <bits/stdc++.h> int main() { int t; std::cin >> t; while (t--) { std::set<int> all; int n; std::cin >> n; while (n--) { int tmp; std::cin >> tmp; while ((tmp & 1) == 0) { all.insert(tmp); tmp >>= 1; } } printf...

#include <bits/stdc++.h> using namespace std; int n, k, q, inc[101]; double a[101], mi = 1000000007LL, ma; set<vector<int> > S; set<vector<int> >::iterator it; int main() { cin >> n >> k; for (int i = 0; i < n; i++) cin >> a[i]; cin >> q; int m = n / k; for (int i = 0; i < q; i++) { ...

#include <bits/stdc++.h> using namespace std; int ans, a, b, n, x; int main() { scanf( %d , &n); while (n--) { scanf( %d , &x); if (n == 0) a = x; b = max(b, x); } printf( %d n , a ^ b); return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int T; cin >> T; while (T--) { int a; cin >> a; if (a % 2 == 0) cout << a - 1 << ; else cout << a << ; } }

#include <bits/stdc++.h> void merging(long long arr[], long long start, long long mid, long long end); void sort(long long arr[], long long start, long long end) { long long mid; if (end - start + 1 > 1) { mid = (start + end) / 2; sort(arr, start, mid); sort(arr, mid + 1, end); mergi...

#include <bits/stdc++.h> using namespace std; int getint() { unsigned int c; int x = 0; while (((c = getchar()) - 0 ) >= 10) { if (c == - ) return -getint(); if (!~c) exit(0); } do { x = (x << 3) + (x << 1) + (c - 0 ); } while (((c = getchar()) - 0 ) < 10); return x...

#include <bits/stdc++.h> using namespace std; int main() { long long al; cin >> al; while (al--) { long long b, c; cin >> b >> c; if ((abs(b - c)) % 10 == 0) cout << abs(b - c) / 10 << n ; else { b = abs(b - c); cout << b / 10 + 1 << n ; } } ...

#include <bits/stdc++.h> using namespace std; int n, m; int pos[100010]; int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; bool check(int i, int j) { int x = (i - 1) / m + 1, y = (i - 1) % m + 1; int x2 = (j - 1) / m + 1, y2 = (j - 1) % m + 1; for (int k = 0; k < 4; k++) if (x + dx[k] == x2 &&...

#include <bits/stdc++.h> const long long llinfinity = 9223372036854775807LL; const long long llminusinfinity = -9223372036854775808LL; const int intinfinity = 2147483647; const int intminusinfinity = -2147483648; using namespace std; const int maxn = 1e5 + 5; int a[maxn], n; long long ans; int main(in...

#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10; int n, k, ps[N], mx[N], cnt[N], a[N]; long long ans; int getNeed(int p, int m) { int x = (((p - m) % k) + k) % k; return cnt[((k - x) + k) % k]; } void solve(int l, int r) { if (r - l <= 1) return; int mid = (l + r) / 2;...

#include <bits/stdc++.h> using namespace std; const int inf = (1 << 30) - 1; const long long linf = (1ll << 62) - 1; int n, l, t; vector<int> a; long double ans = 0; inline int getCount(int ll, int rr) { if (rr < l) { ll = lower_bound((a).begin(), (a).end(), ll) - a.begin(); rr = upper_bou...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int ans = 2; for (int i = 1; i <= n; i++) { int tmp; cin >> tmp; if (tmp % 2 == 0) { ans = 3 - ans; } cout << ans << endl; } return 0; }

#include <bits/stdc++.h> using namespace std; char a[20][20]; int i, j, k = 0; string s = WBWBWBWB , s1 = BWBWBWBW , z[20]; int main() { for (i = 1; i <= 8; i++) { cin >> z[i]; } for (i = 1; i <= 8; i++) { if (z[i] != s && z[i] != s1) { cout << NO ; return 0; }...

#include <bits/stdc++.h> using namespace std; void gethas(string s, int &has0, int &hasa, int &hasA) { int n = int(s.size()); has0 = 0; hasa = 0; hasA = 0; for (int i = 0; i < n; i++) { char c = s[i]; has0 = has0 or ( 0 <= c and c <= 9 ); hasa = hasa or ( a <= c and c <= z ...

#include <bits/stdc++.h> using namespace std; const long long MOD = 1000000009; long long pow(long long a, long long b, long long m) { long long ans = 1; while (b) { if (b & 1) ans = (ans * a) % m; b /= 2; a = (a * a) % m; } return ans; } int32_t main() { ios_base::sync_w...

#include <bits/stdc++.h> using namespace std; const int MAXN = 1007; long long lcp[MAXN][MAXN]; string s; bool cmp(pair<long long, long long> a, pair<long long, long long> b) { long long l = lcp[a.second][b.second]; long long al = a.second - a.first + 1; long long bl = b.second - b.first + 1; ...

#include <bits/stdc++.h> using namespace std; const int INF = std::numeric_limits<int>::max() / 3; long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); } int dp[6000][6000]; long long sum[1000000]; long long mi...

#include <bits/stdc++.h> using namespace std; const int maxn = 5e5 + 5; int a[maxn], n, k; long long sum; long long judge1(int m) { long long ans = 0; for (int i = 1; a[i] < m && i <= n; i++) { ans += m - a[i]; } return ans; } long long judge2(int m) { long long ans = 0; for ...

#include <bits/stdc++.h> using namespace std; template <typename A, typename B> string to_string(pair<A, B> p); template <typename A, typename B, typename C> string to_string(tuple<A, B, C> p); template <typename A, typename B, typename C, typename D> string to_string(tuple<A, B, C, D> p); string to_str...

#include <bits/stdc++.h> using namespace std; int s[200005]; struct pp { int lev; int loc; } s1[200005], s2[200005]; bool cmp(pp &a, pp &b) { return a.lev < b.lev; } int main() { int t; cin >> t; for (int i = 0; i < t; i++) { int s1h = 0, s2h = 0; string test; int n; ...

#include <bits/stdc++.h> using namespace std; const long long int mod = 1e9 + 7; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int T = clock(); long long int a, ta, b, tb; cin >> a >> ta >> b >> tb; string s; cin >> s; long long int i =...

#include <bits/stdc++.h> using namespace std; int main() { int a, b, a2 = 0, b2 = 0, a3 = 0, b3 = 0, a5 = 0, b5 = 0; cin >> a >> b; while (a % 2 == 0) { a2++; a /= 2; } while (a % 3 == 0) { a3++; a /= 3; } while (a % 5 == 0) { a5++; a /= 5; } w...

#include <bits/stdc++.h> using namespace std; const int N = 200514; vector<int> a3[N], a4[N], mn, mx; set<int> s; int p3[N], p4[N]; int n, m, M, a[N], ct[N], l1 = 1, l2 = 1; int j, p1, p2, k1, k2; int main() { scanf( %d%d , &n, &m); p3[n + 1] = p4[n + 1] = n + 1; for (int i = (1); i <= (n); ...

#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; vector<vector<int> > g; vector<int> buf; g.clear(); buf.clear(); for (int i = 0; i < k; i++) g.push_back(buf); vector<int> num; num.clear(); int j; for (j = 0; j < n * k; j++) num.push_bac...

#include <bits/stdc++.h> using namespace std; const long long INF = (1ll << 45); long long bit[1000006]; void update(long long from, long long val) { for (long long i = from; i < 1000006; i += i & -i) bit[i] += val; } long long query(long long from) { if (from == 0) return 0; long long cnt = 0; ...

#include <bits/stdc++.h> using namespace std; const long long INF = 1 << 28; const long long LINF = 1ll << 61; inline long long getnum() { register long long r = 0; register bool ng = 0; register char c; c = getchar(); while (c != - && (c < 0 || c > 9 )) c = getchar(); if (c == - )...

#include <bits/stdc++.h> int vi[60], ho[60]; int main() { int n, k, i; int x, y; scanf( %d , &n); for (k = 1; k <= n * n; k++) { scanf( %d%d , &x, &y); if (vi[x] || ho[y]) continue; vi[x] = 1; ho[y] = 1; printf( %d , k); } }

#include<bits/stdc++.h> #define y1 dmytxdy #define pb push_back #define fi first #define se second #define mp make_pair using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair<int,int> pii; typedef pair<ll,ll> pll; typedef long double ld; template <typ...

#include<bits/stdc++.h> using namespace std; int main() { int tst,i,m,n; cin>>tst; while(tst--) { int ar[4]; cin>>ar[0]>>ar[1]>>ar[2]>>ar[3]; n=max(ar[2],ar[3]);m=max(ar[0],ar[1]); sort(ar,ar+4); ((n==ar[3]||n==ar[2])&&(m==ar[3] || m==ar[2]...

#include <bits/stdc++.h> using namespace std; constexpr int maxn = 1010; int n; bool e[maxn][maxn]; pair<int, int> flip(int a, int b, bool inv) { int x = -1, y; for (int i = 0; i < n; i++) if (e[a][i] && e[b][i]) if (x == -1) x = i; else { y = i; bre...

#include <bits/stdc++.h> using namespace std; template <class T> std::ostream& operator<<(std::ostream& os, const std::vector<T>& input) { for (auto const& i : input) { os << i << ; } return os; } template <class T1, class T2> std::ostream& operator<<(std::ostream& os, const std::pair<T...

#include <bits/stdc++.h> using namespace std; struct point { int x, y; }; int dist(const point &a, const point &b) { return (a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y); } int main(int argc, char *argv[]) { point p[8]; int a[8] = {0, 1, 2, 3, 4, 5, 6, 7}; for (int i = 0; i < 8; ...

#include <bits/stdc++.h> using namespace std; const int N = 59; int t[N]; inline int read() { int s = 1, a = 0; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) s = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { a = a * 10 + ch - 0 ; ch = ge...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 7; const int M = 23; const int inf = 1e9 + 7; const long long base = 1e18; const double pi = acos(-1); const double ep = 1e-9; map<int, int> st; int pre[1 << M]; int cur[1 << M]; int n; int a[N]; int main() { cin >> n; f...

#include <bits/stdc++.h> using namespace std; int n, r; vector<pair<int, int> > pos, L, R; vector<int> ans; map<pair<int, int>, int> vis; bool cmp(pair<int, int> a, pair<int, int> b) { return a.first + a.second < b.first + b.second; } int main() { cin >> n >> r; for (int i = 0; i < n; i++) {...

#include <bits/stdc++.h> using namespace std; int main(int argc, char* argv[]) { ios_base::sync_with_stdio(false); long long int N, M; cin >> N >> M; long long int max_n1; for (max_n1 = 1; (max_n1 * (max_n1 - 1)) / 2 + 1 <= N; max_n1 += 2) ; max_n1 -= 2; long long int max_n2; f...

#include <bits/stdc++.h> using namespace std; const int MAX = 111111; int N; char s[MAX]; int f[MAX]; int sum[MAX]; bool match(int i, int j) { if (i < 1 || j < 1) return 0; if (s[i - 1] == ) ) return s[j - 1] == ( ; else return s[j - 1] == [ ; } int get(int i) { return f[i -...

#include <bits/stdc++.h> using namespace std; struct node { int num; double w; } point[1005]; bool cmp(node a, node b) { if (fabs(a.w - b.w) < 0.0001) return a.num < b.num; return a.w > b.w; } int main() { int i, n, t1, t2, k, a, b; scanf( %d%d%d%d , &n, &t1, &t2, &k); for (i = 1...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<pair<int, int> > v; for (int i = 0; i < n; i++) { int a, b; cin >> a >> b; v.push_back(make_pair(a, b)); } int k; cin >> k; int i; for (i = 0; i < n; i++) { if (k >= v[i].fi...

#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; int a[n + 2][m + 2]; int counter = 1; for (int i = 1; i <= n; i += 2) { for (int j = 1; j <= m; j++) { if (n % 2 && i == n && j % 2 == 1) continue; a[i + (j % 2 == 1)][j] = counter; ...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int minutes[n]; int result = -1; int lastN = 0; for (int i = 0; i < n; i++) { cin >> minutes[i]; if (i == 0 && minutes[0] > 15) { result = 15; } else if (result < 0 && minutes[i] - minutes[i...

#include <bits/stdc++.h> using namespace std; int main() { int k; cin >> k; if (k % 2 == 1) { cout << -1 << endl; return 0; } for (int i = 0; i < k; i++) { if (i > 0) cout << endl; for (int j = 0; j < k; j++) { for (int l = 0; l < k; l++) { int layer = m...

#include <bits/stdc++.h> using namespace std; void dfs3(int v, vector<vector<int>> &graf, vector<int> &ways) { ways[v] = -1; for (auto el : graf[v]) { if (ways[el] != -1) { dfs3(el, graf, ways); } } } void dfs2(int v, vector<vector<int>> &graf, ve...

#include <bits/stdc++.h> int main() { long long int l1, r1, l2, r2, k, l, r, t; scanf( %lld%lld%lld%lld%lld , &l1, &r1, &l2, &r2, &k); if (l1 > l2) l = l1; else l = l2; if (r1 > r2) r = r2; else r = r1; if ((k >= l) && (k <= r)) t = r - l; else t = r...

#include <bits/stdc++.h> const int md = 1e9 + 7; int n, k, m, M, c; struct mat { int A[256][256]; inline mat() { memset(A, 0, sizeof A); } inline int* operator[](const int& x) { return A[x]; } inline mat operator*(const mat& b) const { mat c; for (int i = 0; i <= M; ++i) for (i...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int t_1 = -1, t_2 = -1; int c1 = 0, c2 = 0; int a = 0; for (int i = 0; i < n; ++i) { int t; cin >> t; if (t_1 == -1) { t_1 = t; c1++; } else if (t_1 == t) { c1++; ...

#include <bits/stdc++.h> using std::cerr; using std::endl; const int N = 2e5 + 233; int n, m; std::map<std::pair<int, int>, int> map; std::vector<std::pair<int, int>> seg[N * 4]; void insert(int p, int l, int r, std::pair<int, int> e, int L, int R) { if (l <= L && r >= R) return seg[p].push_back(e), v...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native ) #pragma GCC optimize( unroll-loops ) using namespace std; template <typename T1, typename T2> inline void chkmin(T1 &first, T2 second) { if (first > second) first = second; ...

#include <bits/stdc++.h> using namespace std; int main() { int n, q, x; vector<int> v; cin >> n; for (int i = 1; i <= n; i++) { cin >> x; v.push_back(x); } sort(v.begin(), v.end()); cin >> q; while (q--) { cin >> x; int ans = upper_bound(v.begin(), v.end(), x)...

#include <bits/stdc++.h> using namespace std; int p[100001], w[100001]; bool combine(int x, int y) { while (p[x] != x) x = p[x] = p[p[x]]; while (p[y] != y) y = p[y] = p[p[y]]; if (x == y) return false; if (w[x] < w[y]) w[p[x] = y] += w[x]; else w[p[y] = x] += w[y]; return true...

#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, x, y, z; cin >> a >> b >> c >> x >> y >> z; int ans; if ((a == 0 && b == 0 && c) || (x == 0 && y == 0 && z)) { ans = 0; } else if (a * y == b * x) { if (a * z == c * x && b * z == c * y) { ans = -1; ...

#include <bits/stdc++.h> using namespace std; const int N = 21; string s; long long heavy = 0, sol = 0; int main() { cin >> s; for (int i = 0; i < s.size(); i++) { string temp = s.substr(i, 5); if (temp == heavy ) { heavy++; i += 4; } else if (temp == metal ) { ...

#include <bits/stdc++.h> using namespace std; template <class T> inline void chmax(T &x, T &y) { if (x < y) swap(x, y); } template <class T> inline void chmin(T &x, T &y) { if (x > y) swap(x, y); } const long long INF = 0x3f3f3f3f3f3f; const long long MOD = 1e9 + 7; const double EPS = 10e-10...

#include <bits/stdc++.h> using namespace std; long long n, tmp; map<long long, int> b; long long j = 1, c[33]; void make_two_pow() { long long i = 2; while (j <= 32) { c[j++] = i; i *= 2; } } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);...

#include <bits/stdc++.h> using namespace std; const int Max = 1e5 + 10; int fw[Max][26]; int bw[Max][26]; int gs[Max][26]; int ge[Max][26]; int n; int A[Max]; int mex(vector<int> vec); void CalcGS(int i, int c); void CalcGE(int i, int c); int mex(vector<int> vec) { sort(vec.begin(), vec.end(...