func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; long long ar[1005][1005], br[1005][1005], fr[555]; string s[555]; string s1, s2; int main() { long long i, j, k, m, n, r, c; while (cin >> r >> c) { getchar(); s[0] = ; for (i = 1; i <= r; i++) { getline(cin, s[i]); } n = r; if (n & 1) { cout << n << endl; continue; } while (n > 0) { i = 1; j = n; while (s[i] == s[j]) { i++, j--; if (i > j) break; } if (i > j) n /= 2; else { cout << n << endl; return 0; } if (n & 1) { cout << n << endl; return 0; } } cout << 1 << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int cnt[27][200010]; int main() { string s; int q, i, j, l, r, c; cin >> s >> q; memset(cnt, 0, sizeof(cnt)); for (i = 0; i < s.length(); i++) { c = s[i] - a ; cnt[c][i + 1]++; for (j = 0; j < 26; j++) cnt[j][i + 1] += cnt[j][i]; } for (; q > 0; q--) { scanf( %d%d , &l, &r); if (l == r) cout << Yes << endl; else { if (s[l - 1] != s[r - 1]) cout << Yes << endl; else { int sum = 0; for (i = 0; i < 26; i++) { if (cnt[i][r] - cnt[i][l - 1] >= 1) sum++; if (sum == 3) break; } if (sum == 3) cout << Yes << endl; else cout << No << endl; } } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; bool palindrom = true; for (int i = 0; i < ceil(s.length() / 2.0); i++) { if (s[i] != s[s.length() - 1 - i]) palindrom = false; } if (!palindrom) { cout << s.length() << n ; return 0; } char elso = s[0]; bool mind_ugyanaz = true; for (auto c : s) { if (c != elso) mind_ugyanaz = false; } if (mind_ugyanaz) cout << 0 n ; else cout << s.length() - 1 << n ; }
|
#include <bits/stdc++.h> using namespace std; int n, m, dfn[100010], siz[100010], tim, idfn[100010], a[100010], Q; vector<int> v[100010]; inline int add(int a, int b) { if ((a += b) >= m) a -= m; return a; } void dfs(int np, int fath) { dfn[np] = ++tim; idfn[tim] = np; siz[np] = 1; for (auto &x : v[np]) { if (x == fath) continue; dfs(x, np); siz[np] += siz[x]; } } bitset<1000> bas, prm; inline void shift(bitset<1000> &bt, int v) { if (!v) return; bt = ((bt << v) | (bt >> (m - v))) & bas; } class sgt { public: bitset<1000> dat[400010]; int lzy[400010]; void pushnow(int p, int v) { lzy[p] = add(lzy[p], v); shift(dat[p], v); } void pushdown(int p) { if (lzy[p]) { pushnow((p << 1), lzy[p]); pushnow(((p << 1) | 1), lzy[p]); lzy[p] = 0; } } void pushup(int p) { dat[p] = dat[(p << 1)] | dat[((p << 1) | 1)]; } void build(int p, int l, int r) { for (int i = l; i <= r; i++) dat[p].set(a[idfn[i]]); if (l == r) return; int mid = (l + r) >> 1; build((p << 1), l, mid); build(((p << 1) | 1), mid + 1, r); } void modify(int p, int l, int r, int ml, int mr, int v) { if (ml <= l && r <= mr) { pushnow(p, v); return; } pushdown(p); int mid = (l + r) >> 1; if (ml <= mid) modify((p << 1), l, mid, ml, mr, v); if (mr > mid) modify(((p << 1) | 1), mid + 1, r, ml, mr, v); pushup(p); } void query(int p, int l, int r, int ql, int qr, bitset<1000> &q) { if (ql <= l && r <= qr) { q |= dat[p]; return; } pushdown(p); int mid = (l + r) >> 1; if (ql <= mid) query((p << 1), l, mid, ql, qr, q); if (qr > mid) query(((p << 1) | 1), mid + 1, r, ql, qr, q); return; } } T; vector<int> prime; int main() { scanf( %d%d , &n, &m); for (int i = 0; i < m; i++) bas.set(i); for (int i = 2; i < m; i++) prm.set(i); for (int i = 2; i < m; i++) { if (prm[i]) prime.push_back(i); for (int j = 0; j < prime.size() && i * prime[j] < m; j++) { prm[i * prime[j]] = 0; if ((i % prime[j]) == 0) break; } } for (int i = 1; i <= n; i++) scanf( %d , &a[i]), a[i] %= m; for (int i = 1, ti, tj; i < n; i++) { scanf( %d%d , &ti, &tj); v[ti].push_back(tj); v[tj].push_back(ti); } dfs(1, 0); T.build(1, 1, n); scanf( %d , &Q); bitset<1000> ans; while (Q--) { int opt, x, y; scanf( %d%d , &opt, &x); if (opt == 1) { scanf( %d , &y); y %= m; T.modify(1, 1, n, dfn[x], dfn[x] + siz[x] - 1, y); } else { ans.reset(); T.query(1, 1, n, dfn[x], dfn[x] + siz[x] - 1, ans); printf( %d n , (ans & prm).count()); } } return 0; }
|
#include <bits/stdc++.h> using namespace std; struct ppp { int x1, x2, y1, y2; void make_pair(int x1_, int x2_, int y1_, int y2_) { x1 = x1_; x2 = x2_; y1 = y1_; y2 = y2_; } } a[120]; long long ans; int n, m, i, j, k, x, y, l, r, P[220], tot, Pn, u, d; char c[1010][1010]; int Find(int x) { return lower_bound(P + 1, P + Pn + 1, x) - P; } int main() { scanf( %d%d%*d , &n, &m); for (i = 1; i <= n; ++i) scanf( %s , c[i] + 1); for (i = 1; i <= n; ++i) for (j = 1; j <= m; ++j) if (c[i][j] == * ) { k = j; while (c[i][k] == * ) k++; k--; l = i; while (c[l][j] == * ) l++; l--; for (x = i; x <= l; ++x) for (y = j; y <= k; ++y) c[x][y] = . ; a[++tot].make_pair(i, l, j, k); P[++Pn] = i; P[++Pn] = l; } P[++Pn] = 0; P[++Pn] = n + 1; sort(P + 1, P + Pn + 1); Pn = unique(P + 1, P + Pn + 1) - P - 1; for (i = 1; i <= tot; ++i) a[i].x1 = Find(a[i].x1), a[i].x2 = Find(a[i].x2); for (u = 2; u < Pn; ++u) { for (d = u; d < Pn; ++d) { long long tmp = 0; vector<pair<int, int> > Q; for (i = 1; i <= tot; ++i) { if (a[i].x2 < u || a[i].x1 > d) continue; if (a[i].x1 >= u && a[i].x2 <= d) Q.push_back(make_pair(a[i].y1, -1)), Q.push_back(make_pair(a[i].y2, 1)); else Q.push_back(make_pair(a[i].y1, -100)), Q.push_back(make_pair(a[i].y2, 100)); } sort(Q.begin(), Q.end()); int num = Q.size(), C, suml, sumr, cc; Q.push_back(make_pair(m + 1, 0)); for (int C = 1; C <= 3; ++C) { suml = sumr = 0; cc = 0; for (l = 0, r = 0; r < num; ++r) { sumr += Q[r].second; cc += max(0, Q[r].second); if (!sumr) { while (suml || cc > C) { suml -= Q[l].second; cc -= max(0, Q[l].second); l++; } if (!suml && cc == C) tmp += (Q[r + 1].first - Q[r].first) * (Q[l].first - (!l ? 0 : Q[l - 1].first)); } } } ans += tmp * (P[u] - P[u - 1]) * (P[d + 1] - P[d]); } } printf( %I64d n , ans); }
|
#include <bits/stdc++.h> int n, k, s, e, m, ans, temp, tp, tv; bool m11, m22, first, b[100005], move; char a[100005]; int dist() { if (m - s < e - m) return e - m; else return m - s; } int main() { scanf( %d %d , &n, &k); scanf( %s , a); for (e = 0; e < n; e++) { if (a[e] == 0 ) temp++; if (a[e] == 0 && !first) s = e, first = true; if (temp >= k + 1) break; } m = s; ans = dist(); while (e < n) { tv = dist(); tp = m; move = false; if (ans > dist()) { ans = dist(); } while (m <= e) { m++; if (a[m] == 0 ) { if (tv > dist()) { tv = dist(); tp = m; if (ans > dist()) { ans = dist(); } } else { m = tp; break; } } } while (e < n) { e++; if (e < n && a[e] == 0 ) { while (true) { s++; if (a[s] == 0 ) { if (m < s) { m = s; } move = true; break; } } } if (move) break; } } printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; pair<int, int> temp[102][102]; int ans[102][102]; int main() { int n, m, q; cin >> n >> m >> q; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { temp[i][j].first = i; temp[i][j].second = j; } } while (q--) { int t; cin >> t; if (t == 1) { int r; cin >> r; pair<int, int> p; p = temp[r][1]; for (int j = 1; j < m; j++) { temp[r][j] = temp[r][j + 1]; } temp[r][m] = p; } else if (t == 2) { int c; cin >> c; pair<int, int> p; p = temp[1][c]; for (int j = 1; j < n; j++) { temp[j][c] = temp[j + 1][c]; } temp[n][c] = p; } else { int r, c, x; cin >> r >> c >> x; int indx1 = temp[r][c].first; int indx2 = temp[r][c].second; ans[indx1][indx2] = x; } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { cout << ans[i][j] << ; } cout << n ; } return 0; }
|
#include <bits/stdc++.h> #pragma GCC optimize( Ofast,no-stack-protector,unroll-loops,fast-math,O3 ) using namespace std; long long powmod(long long a, long long b, long long mod) { if (b == 0 || a == 1) { if (mod == 1) return 0; else return 1; } if (b % 2 == 0) { long long k = powmod(a, b / 2, mod); return (k * k) % mod; } else { long long k = powmod(a, b / 2, mod); return ((k * k) % mod * a) % mod; } } long long gcd(long long a, long long b) { if (a == 0) return b; if (b == 0) return a; if (a > b) return gcd(a % b, b); else return gcd(b % a, a); } long long prime(long long p) { for (long long i = 2; i * i <= p; i++) { if (p % i == 0 && i < p) return i; } return 1; } long long inv(long long a, long long mod) { return powmod(a, mod - 2, mod); } void solve(long long ppppppppp = 1) { long long a, b; cin >> a >> b; if (a + b == 2) { cout << 0; return; } if (a == 1) { for (long long i = 0; i < b; i++) cout << i + 2 << ; return; } if (b == 1) { for (long long i = 0; i < a; i++) cout << i + 2 << ; return; } for (long long i = 0; i < a; i++) { for (long long j = 0; j < b; j++) cout << (i + 1) * (a + j + 1) << ; cout << n ; } return; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long tututu; tututu = 1; for (long long qwerty = 0; qwerty < tututu; qwerty++) solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 100005; pair<pair<int, int>, int> queries[N]; long long arr[N], acc[N], in[N]; int main() { int n, m, k; scanf( %d %d %d , &n, &m, &k); for (int i = 0; i < n; ++i) { int x; scanf( %d , &x); in[i] = x; } for (int i = 0; i < m; ++i) { scanf( %d %d %d , &queries[i].first.first, &queries[i].first.second, &queries[i].second); --queries[i].first.first; --queries[i].first.second; } for (int i = 0; i < k; ++i) { int a, b; scanf( %d %d , &a, &b); --a; --b; acc[a] += 1; acc[b + 1] -= 1; } for (int i = 1; i < m; ++i) { acc[i] += acc[i - 1]; } for (int i = 0; i < m; ++i) { int a = queries[i].first.first; int b = queries[i].first.second; long long x = queries[i].second * acc[i]; arr[a] += x; arr[b + 1] -= x; } for (int i = 1; i < n; ++i) { arr[i] += arr[i - 1]; } for (int i = 0; i < n - 1; ++i) { cout << arr[i] + in[i] << ; } cout << arr[n - 1] + in[n - 1] << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long N = 1e5 + 5; long long R = 1, n, q, arr[N]; vector<long long> a[N]; long long h[N], p[N][20]; long long cnt = 0, st[N], en[N], pos[2 * N]; long long it[8 * N], lz[8 * N]; void dfs(long long u) { st[u] = ++cnt; pos[cnt] = arr[u]; for (long long i = 1; i < 17; ++i) p[u][i] = p[p[u][i - 1]][i - 1]; for (long long i = 0; i < a[u].size(); ++i) { long long v = a[u][i]; if (v == p[u][0]) continue; h[v] = h[u] + 1; p[v][0] = u; dfs(v); } en[u] = ++cnt; pos[cnt] = arr[u]; } long long par(long long u, long long d) { for (long long i = 0; i < 17; ++i) if ((d >> i & 1)) u = p[u][i]; return u; } long long lca(long long u, long long v) { if (h[u] != h[v]) { if (h[u] < h[v]) swap(u, v); u = par(u, h[u] - h[v]); } if (u == v) return u; for (long long i = 16; i >= 0; --i) if (p[u][i] != p[v][i]) { u = p[u][i]; v = p[v][i]; } return p[u][0]; } void build_IT(long long i, long long l, long long r) { if (l == r) { it[i] = pos[l]; return; } long long m = (l + r) / 2; build_IT(i * 2, l, m); build_IT(i * 2 + 1, m + 1, r); it[i] = it[i * 2] + it[i * 2 + 1]; } void true_val(long long i, long long l, long long r) { if (lz[i] == 0) return; it[i] += (r - l + 1) * lz[i]; if (l != r) { lz[i * 2] += lz[i]; lz[i * 2 + 1] += lz[i]; } lz[i] = 0; } void update(long long i, long long l, long long r, long long a, long long b, long long val) { true_val(i, l, r); if (l > b || r < a || l > r) return; if (a <= l && r <= b) { it[i] += (r - l + 1) * val; if (l != r) { lz[i * 2] += val; lz[i * 2 + 1] += val; } return; } long long m = (l + r) / 2; update(i * 2, l, m, a, b, val); update(i * 2 + 1, m + 1, r, a, b, val); it[i] = it[i * 2] + it[i * 2 + 1]; } long long get(long long i, long long l, long long r, long long a, long long b) { true_val(i, l, r); if (l > b || r < a || l > r) return 0; if (a <= l && r <= b) return it[i]; long long m = (l + r) / 2; return get(i * 2, l, m, a, b) + get(i * 2 + 1, m + 1, r, a, b); } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); scanf( %lld%lld , &n, &q); for (long long i = 1; i <= n; ++i) scanf( %lld , &arr[i]); for (long long i = 1; i < n; ++i) { long long x, y; scanf( %lld%lld , &x, &y); a[x].push_back(y); a[y].push_back(x); } dfs(1); n *= 2; build_IT(1, 1, n); while (q--) { long long t; scanf( %lld , &t); if (t == 1) { scanf( %lld , &R); continue; } if (t == 3) { long long u, ans = 0; scanf( %lld , &u); if (lca(R, u) != u) ans = get(1, 1, n, st[u], en[u]); else if (R == u) ans = it[1]; else { long long z = par(R, h[R] - h[u] - 1); ans = it[1] - get(1, 1, n, st[z], en[z]); } printf( %lld n , ans / 2); continue; } long long u, v, val; scanf( %lld%lld%lld , &u, &v, &val); long long x = lca(u, v); if (lca(x, R) != x) update(1, 1, n, st[x], en[x], val); else { long long a = lca(u, R), b = lca(v, R); long long w = (a == x ? b : a); update(1, 1, n, 1, n, val); if (w != R) { long long z = par(R, h[R] - h[w] - 1); update(1, 1, n, st[z], en[z], -val); } } } }
|
#include <bits/stdc++.h> using namespace std; int dig[15]; int qpow(int digit) { int a = 2, b = digit, ans = 1; while (b) { if (b & 1) ans *= a; a *= a; b >>= 1; } return ans; } int getDigit(int x) { int ans = 0; while (x) { x /= 10; ans++; } return ans; } void getHead(int x, int len) { int index = len; while (x) { dig[index--] = x % 10; x /= 10; } } int main() { int n; while (~scanf( %d , &n)) { int len = getDigit(n); int ans = 0; for (int i = 1; i <= len - 1; i++) ans += qpow(i); if (ans == 1) ans -= 1; getHead(n, len); for (int i = 1; i <= len; i++) { if (dig[i] > 7) { ans += qpow(len - i + 1); break; } else if (dig[i] == 7) { ans += qpow(len - i); if (i == len) ans += 1; } else if (dig[i] > 4) { ans += qpow(len - i); break; } else if (dig[i] == 4) { if (i == len) ans += 1; continue; } else break; } printf( %d n , ans); } return 0; }
|
#include <bits/stdc++.h> #pragma GCC optimize( Ofast,no-stack-protector,unroll-loops,fast-math ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt,tune=native ) using namespace std; int n, m, k, ct[200010], cnt; vector<pair<int, int> > e[200010]; vector<int> mp[200010]; char bf[100000], *p1 = bf, *p2 = bf; inline int read() { int x = 0; char ch = (p1 == p2 && (p2 = (p1 = bf) + fread(bf, 1, 100000, stdin), p2 == p1) ? -1 : *p1++); for (; ch < 0 || ch > 9 ; ch = (p1 == p2 && (p2 = (p1 = bf) + fread(bf, 1, 100000, stdin), p2 == p1) ? -1 : *p1++)) ; for (; ch <= 9 && ch >= 0 ; x = x * 10 + ch - 48, ch = (p1 == p2 && (p2 = (p1 = bf) + fread(bf, 1, 100000, stdin), p2 == p1) ? -1 : *p1++)) ; return x; } int ans, O = 1; int hah, val[10][200010]; void dfs(int x, int f) { if (x == k + 1) { if (f == hah) ++ans; return; } if (mp[x].size() == 0) { dfs(x + 1, f); return; } for (auto i = (1); i <= (x); ++i) { int flag = 1; dfs(x + 1, f + val[x][i]); } } int hsh[200010]; inline void solve() { n = read(), m = read(), k = read(); for (auto i = (1); i <= (n); ++i) hsh[i] = rand(), hah += hsh[i]; for (auto i = (1); i <= (m); ++i) { int u = read(), v = read(), w = read(); e[u].push_back({w, v}); } for (auto i = (1); i <= (n); ++i) sort(e[i].begin(), e[i].end()); for (auto i = (1); i <= (n); ++i) mp[e[i].size()].push_back(i); for (auto i = (1); i <= (k); ++i) for (auto j = (1); j <= (i); ++j) { val[i][j] = 0; for (auto v : mp[i]) val[i][j] += hsh[e[v][j - 1].second]; } for (auto i = (1); i <= (k); ++i) if (mp[i].size() == 0) O *= i; dfs(1, 0); printf( %d n , ans * O); } int main() { int T = 1; while (T--) solve(); }
|
#include <bits/stdc++.h> using namespace std; const int N = 205; template <typename T> inline void read(T &AKNOI) { T x = 0, flag = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) flag = -1; ch = getchar(); } while (isdigit(ch)) { x = x * 10 + ch - 0 ; ch = getchar(); } AKNOI = flag * x; } namespace ModCalculator { long long MOD; inline void Inc(long long &x, long long y) { x += y; if (x >= MOD) x -= MOD; } inline void Dec(long long &x, long long y) { x -= y; if (x < 0) x += MOD; } inline long long Add(long long x, long long y) { Inc(x, y); return x; } inline long long Sub(long long x, long long y) { Dec(x, y); return x; } inline long long Mul(long long x, long long y) { return x * y % MOD; } } // namespace ModCalculator using namespace ModCalculator; int n, d; long long C[N][N], dp[N][N], sum[N], ans; void init() { read(n); read(d); read(MOD); for (int i = 0; i <= n; ++i) { C[i][0] = 1; for (int j = 1; j <= i; ++j) { C[i][j] = Add(C[i - 1][j], C[i - 1][j - 1]); } } } void solve() { dp[1][0] = sum[1] = 1; for (int i = 2; i <= n; ++i) { for (int j = 1; j <= d; ++j) { for (int k = 1; k < i; ++k) { Inc(dp[i][j], Mul(C[i - 2][k - 1], Mul(sum[k], dp[i - k][j - 1]))); } if (j < d) Inc(sum[i], dp[i][j]); } } for (int i = 1; i <= n; ++i) { for (int j = 0; j <= d; ++j) { for (int k = 0; k + j <= d; ++k) { if (k == 1) continue; Inc(ans, Mul(dp[i][j], dp[n - i + 1][k])); } } } printf( %lld n , Mul(ans, 2LL * n * (n - 1))); } int main() { init(); solve(); return 0; }
|
#include <bits/stdc++.h> #pragma GCC target( avx ) #pragma GCC optimize( O3 ) #pragma GCC optimize( unroll-loops ) using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); long long int A, B, C, D, E, H, W, M, K, L, R, N, X, Y, Z, num = 0, sum = 0, flag = 0; string S, T; cin >> Z; while (Z--) { cin >> N >> M; vector<long long int> P(N, 0); vector<long long int> Q(M, 0); for (long long int i = 0; i < N; i++) cin >> P[i]; for (long long int i = 0; i < M; i++) cin >> Q[i]; sort(P.begin(), P.end()); sort(Q.begin(), Q.end()); num = -1; for (long long int i = 0; i < N; i++) for (long long int j = 0; j < M; j++) if (P[i] == Q[j]) num = P[i]; if (num == -1) cout << NO << endl; else { cout << YES << endl; cout << 1 << << num << endl; } } }
|
#include <bits/stdc++.h> using namespace std; int main() { long n; while (cin >> n) { long flag = 0, count = 0, a[100005] = {0}, i; for (i = 0; i < n; i++) cin >> a[i]; for (i = n - 1; i > 0; i--) { if (a[i - 1] > a[i]) break; else count++; } cout << n - count - 1 << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long a, b; int main() { cin >> a >> b; long long v = (a * (a + 1) / 2) % 1000000007; long long rs = b * (b - 1) / 2; rs %= 1000000007; long long res = 0; for (long long i = 1; i <= a; ++i) res = (res + rs * (i * b % 1000000007 + 1) % 1000000007) % 1000000007; cout << res << endl; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); int t, x, n; cin >> t; while (t--) { cin >> n; vector<int> v(109, 0); while (n--) { cin >> x; v[x] += 1; } int sum = 0; for (int i = 0; i < v.size(); i++) { if (v[i] == 0) { sum += i; break; } } for (int i = 0; i < v.size(); i++) { if (v[i] <= 1) { sum += i; break; } } cout << sum << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 6010; const int mod = 1000000007; int n; long long k[MAXN], k2[MAXN]; int main() { string asd; string asd2; cin >> asd; cin >> asd2; n = ((int)(asd2.size())); long long res = 0; for (int i = 0; i < ((int)(asd.size())); i++) { for (int j = 0; j < ((int)(asd2.size())); j++) { if (asd2[j] == asd[i]) { k2[j] = (k2[j] + k[j - 1] + 1) % mod; } k2[j + 1] = (k2[j + 1] + k2[j]) % mod; } res = (res + k2[n]) % mod; for (int j = 0; j < ((int)(asd2.size())); j++) k[j] = k2[j]; memset(k2, 0, sizeof k2); } cout << res << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 5010; int Case, n, a[N], la[N], fn[N]; int f[N][N]; int main() { scanf( %d , &Case); while (Case--) { scanf( %d , &n); for (int i = 1; i <= n; ++i) fn[i] = 0; for (int i = 1; i <= n; ++i) { scanf( %d , a + i); if (a[i] == a[i - 1]) { --i; --n; } else { la[i] = fn[a[i]]; fn[a[i]] = i; } } for (int i = n; i; --i) { for (int j = i + 1; j <= n; ++j) { f[i][j] = f[i][j - 1]; for (int k = la[j]; k >= i; k = la[k]) { f[i][j] = max(f[i][j], f[i][k] + f[k][j - 1] + 1); } } } printf( %d n , n - 1 - f[1][n]); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); int tc; cin >> tc; while (tc--) { int n; cin >> n >> ws; string str; cin >> str; int flag = 0, i; for (i = 0; i < str.size() - 1; i++) { if (str[i] > str[i + 1]) { flag = 1; break; } } if (flag == 0) { cout << str << endl; continue; } string clean_str; for (i = 0; i < str.size(); i++) { if (str[i] == 1 ) break; clean_str.push_back( 0 ); } clean_str.push_back( 0 ); for (i = str.size() - 1; i >= 0; i--) { if (str[i] == 0 ) break; clean_str.push_back( 1 ); } cout << clean_str << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int nax = 4e5 + 5; int ans[nax]; int b[nax]; int n; bool solve(int bb) { vector<int> a; int val = (1 << (bb)); int val2 = val * 2; int val3 = val * 3; int val4 = val * 4; for (int i = 1; i <= n; i++) { a.push_back(b[i] & ((1 << (bb + 1)) - 1)); } sort(a.begin(), a.end()); int hi2 = n - 1; int hi1 = n - 1; long long ans = 0; for (int i = 0; i < n; i++) { hi1 = min(hi1, n - 1); while (hi1 >= i && a[i] + a[hi1] >= val) hi1--; if (a[i] + a[hi1] < val) hi1++; hi1 = max(hi1, i + 1); while (hi2 >= 0 && a[i] + a[hi2] >= val2) hi2--; ans += max(0, hi2 - hi1 + 1); } hi2 = n - 1; hi1 = n - 1; for (int i = 0; i < n; i++) { hi1 = min(hi1, n - 1); while (hi1 >= i && a[i] + a[hi1] >= val3) hi1--; if (a[i] + a[hi1] < val3) hi1++; hi1 = max(hi1, i + 1); while (hi2 >= 0 && a[i] + a[hi2] >= val4) hi2--; ans += max(0, hi2 - hi1 + 1); } return ans % 2; } void brut() { int ans = 0; for (int i = 1; i <= n; i++) { for (int j = i + 1; j <= n; j++) ans ^= (b[i] + b[j]); } cout << ans << endl; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; for (int i = 1; i <= n; i++) cin >> b[i]; int ans = 0; for (int i = 0; i <= 27; i++) { if (solve(i)) ans += (1 << i); } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long n, k; cin >> n >> k; long long a[n]; for (int i = 0; i < n; i++) cin >> a[i]; long long ind = 0, xtr = 0; sort(a, a + n); while (ind < n) { for (long long i = ind; i < n; i++) { if (a[i] > 2 * k) { ind = i; break; } else if (i == n - 1 and a[i] <= 2 * k) { ind = n; break; } k = max(k, a[i]); } if (ind != n) { if (ind > 0) k = max(k, a[ind - 1]); k = 2 * k; xtr++; } } cout << xtr << endl; return 0; }
|
#include <bits/stdc++.h> #pragma GCC optimize( -O3 ) #pragma GCC optimize( Ofast ) #pragma GCC optimize( unroll-loops ) using namespace std; const long long MAXN = 1123456; const long long N = 2e6; const long long inf = 3e18; const long long mod = 998244353; const long long MOD = mod * (mod - 2); mt19937_64 rnd(chrono::system_clock::now().time_since_epoch().count()); template <typename T> void vout(T s) { cout << s << endl; exit(0); } void main_solve() { long long n; cin >> n; vector<long long> a(n + 1); for (int i = 1; i <= n; i++) cin >> a[i]; vector<bool> f(n + 1); vector<long long> c, ans; long long s = 1; while (1) { c.push_back(s); if (f[s]) break; f[s] = 1; s = s - a[s]; } reverse(c.begin(), c.end()); ans.push_back(c[0]); for (int i = 1; i < (int)c.size(); i++) if (c[i] != c[0]) { ans.push_back(c[i]); } else break; cout << (int)ans.size() << n ; for (auto i : ans) cout << i << ; cout << n ; } int main() { ios_base ::sync_with_stdio(0); cin.tie(0); long long t; cin >> t; while (t--) { main_solve(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { char field[8][8]; for (int i = 0; i < 8; i++) { for (int j = 0; j < 8; j++) { cin >> field[i][j]; } } int minDist = 10; for (int j = 0; j < 8; j++) { for (int i = 0; i < 8; i++) { if (field[i][j] == B ) { break; } if (field[i][j] == W ) { if (minDist > i) minDist = i; } } } int blackMinDist = -1; for (int j = 0; j < 8; j++) { for (int i = 7; i >= 0; i--) { if (field[i][j] == W ) { break; } if (field[i][j] == B ) { if (blackMinDist < i) blackMinDist = i; } } } blackMinDist = 7 - blackMinDist; if (blackMinDist >= minDist) { cout << A ; return 0; } cout << B ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long MAX = 1e15; int main() { ios_base::sync_with_stdio(0); cin.tie(0); ; int n, k; cin >> n >> k; vector<int> first(n); for (int i = 0; i < n; i++) cin >> first[i]; vector<long long> pr(n + 1); for (int i = 0; i < n; i++) pr[i + 1] = pr[i] + first[i]; map<long long, int> how; for (int i = 0; i < n; i++) { how[pr[i + 1]]++; } long long ans = 0; for (int i = 0; i < n; i++) { if (k == 1) { ans += how[k + pr[i]]; } else { if (k == -1) { ans += how[k + pr[i]]; ans += how[-k + pr[i]]; } else { for (long long p = 1; p <= MAX; p *= k) { ans += how[p + pr[i]]; } } } how[pr[i + 1]]--; } cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10; vector<pair<int, bool> > adj[maxn]; vector<pair<pair<int, int>, bool> > edge; int dp[maxn], dis[maxn], par[maxn]; bool mark[maxn], in_path[maxn]; int n, m, ans = 0; void input() { cin >> n >> m; for (int i = 0; i < m; i++) { int a, b, w; cin >> a >> b >> w; adj[a - 1].push_back(make_pair(b - 1, 1 - w)); adj[b - 1].push_back(make_pair(a - 1, 1 - w)); edge.push_back(make_pair(make_pair(a - 1, b - 1), 1 - w)); if (w) ans++; } } void bfs() { queue<int> q; q.push(0); mark[0] = true; dis[0] = 0; dp[0] = 0; while (!q.empty()) { int v = q.front(); q.pop(); for (auto u : adj[v]) { if (!mark[u.first]) { q.push(u.first); mark[u.first] = true; dis[u.first] = dis[v] + 1; par[u.first] = v; dp[u.first] = dp[v] + u.second; } else if ((dp[u.first] > dp[v] + u.second) && (dis[u.first] == dis[v] + 1)) { par[u.first] = v; dp[u.first] = dp[v] + u.second; } } } } void check() { for (int i = 0; i < n; i++) cout << par << par[i] << endl; } void pp(int v) { if (par[v] == v) return; in_path[v] = true; pp(par[v]); } void output() { cout << ans - dis[n - 1] + 2 * dp[n - 1] << endl; in_path[0] = true; in_path[n - 1] = true; pp(n - 1); for (int i = 0; i < m; i++) { int a = edge[i].first.first, b = edge[i].first.second, w = edge[i].second; if (!in_path[a] || !in_path[b]) if (!w) cout << a + 1 << << b + 1 << << w << endl; if (in_path[a] && in_path[b]) if (w) cout << a + 1 << << b + 1 << << w << endl; } return; } int main() { input(); bfs(); output(); return 0; }
|
#include <bits/stdc++.h> using namespace std; template <typename T> void read(T &x) { x = 0; char ch = getchar(); long long f = 1; while (!isdigit(ch)) { if (ch == - ) f *= -1; ch = getchar(); } while (isdigit(ch)) { x = x * 10 + ch - 48; ch = getchar(); } x *= f; } template <typename T, typename... Args> void read(T &first, Args &...args) { read(first); read(args...); } template <typename T> void write(T arg) { T x = arg; if (x < 0) { putchar( - ); x = -x; } if (x > 9) { write(x / 10); } putchar(x % 10 + 0 ); } template <typename T, typename... Ts> void write(T arg, Ts... args) { write(arg); if (sizeof...(args) != 0) { putchar( ); write(args...); } } const long long MOD = 998244353; const int MAXN = 5e5 + 50; long long n, k, fac[MAXN], inv[MAXN]; long long qpow(long long a, long long p) { long long sum = 1; while (p) { if (p & 1) { sum = sum * a % MOD; } a = a * a % MOD; p >>= 1; } return sum; } long long get_inv(long long k) { return qpow(k, MOD - 2); } void pre() { fac[0] = 1; for (register int i = 1; i <= n; ++i) { fac[i] = fac[i - 1] * i % MOD; inv[i] = get_inv(fac[i]); } } long long C(long long n, long long m) { if (m > n) { return 0; } else { return fac[n] * get_inv(fac[n - m] * fac[m] % MOD) % MOD; } } int main() { read(n, k); pre(); long long ans = 0; for (register int i = 1; i <= n; ++i) { long long p = n / i - 1; ans = (ans + C(p, k - 1)) % MOD; } write(ans), putchar( n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; string s; int cnt; int getdeal(long long c) { int ret = 0; while (c) { ret += c % 10; c /= 10; } return ret; } int main() { ios::sync_with_stdio(false); long long n; cin >> n; long long temp = 0; while (temp * 10 + 9 <= n) { temp = temp * 10 + 9; } cout << getdeal(temp) + getdeal(n - temp); }
|
#include <bits/stdc++.h> using namespace std; int mod = 998244353; const int M = 1e6 + 10; const int N = 1e5 + 10; inline long long read() { long long b = 1, sum = 0; char c = getchar(); while (!isdigit(c)) { if (c == - ) b = -1; c = getchar(); } while (isdigit(c)) { sum = sum * 10 + c - 0 ; c = getchar(); } return b * sum; } int a[N], in[N], d[N]; int n, m, k, T; int vis[N]; vector<int> e[N]; vector<pair<int, int> > ans; void dfs(int x, int _fa, int need) { int i, j; if (x == 1) { for (i = 0; i < e[x].size(); i++) { int y = e[x][i]; ans.push_back({y, i + 1}); dfs(y, x, i); } return; } int cha = need - in[x] + 1, sum = 0; if (in[x] == 1) { ans.push_back({x, need}); } else if (cha >= 0) { ans.push_back({x, cha}); for (i = 0; i < e[x].size(); i++) { int y = e[x][i]; if (y == _fa) continue; ans.push_back({y, cha + sum + 1}); dfs(y, x, cha + sum); sum++; } } else { int now = need + 1, sum = 0; for (i = 0; sum < -cha && i < e[x].size(); i++) { int y = e[x][i]; if (y == _fa) continue; ans.push_back({y, now + 1}); dfs(y, x, now); now++; sum++; } ans.push_back({x, 0}); sum = 0; for (; i < e[x].size(); i++) { int y = e[x][i]; if (y == _fa) continue; ans.push_back({y, sum + 1}); dfs(y, x, sum); sum++; } } ans.push_back({_fa, need + 1}); } int main() { int i, j; n = read(); for (i = 1; i <= n - 1; i++) { int x = read(), y = read(); e[x].push_back(y); e[y].push_back(x); in[x]++; in[y]++; } ans.push_back({1, 0}); dfs(1, 0, 0); printf( %d n , ans.size()); for (i = 0; i < ans.size(); i++) { printf( %d %d n , ans[i].first, ans[i].second); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int maxn = 3e5 + 100; int t, T, n, k; int A[maxn]; int B[maxn]; int main() { ios::sync_with_stdio(false); cin >> T; while (T--) { cin >> n; int sum = 0; for (int i = 1; i <= n; i++) { cin >> A[i]; sum += A[i]; B[i] = A[i]; } if (sum % n) { cout << -1 << endl; continue; } sum /= n; int cnt = 0; for (int i = 2; i <= n; i++) { int d = (A[i] + i - 1) / i * i - A[i]; if (d <= A[1]) { A[i] += d; A[1] -= d; cnt++; } int x = A[i] / i * i; A[1] += x; A[i] -= x; } int ok = 1; for (int i = n; i > 1; i--) { if (A[i] > sum) ok = 0; A[1] -= (sum - A[i]); if (A[1] < 0) ok = 0; if (!ok) break; } if (!ok) { cout << -1 << endl; continue; } if (ok) { cout << 2 * (n - 1) + cnt << endl; for (int i = 2; i <= n; i++) { int d = (B[i] + i - 1) / i * i - B[i]; if (d <= B[1]) { B[i] += d; B[1] -= d; cout << 1 << << i << << d << endl; } int x = B[i] / i * i; B[1] += x; B[i] -= x; cout << i << << 1 << << x / i << endl; } for (int i = n; i > 1; i--) { int x = sum - B[i]; B[1] -= x; B[i] += x; cout << 1 << << i << << x << endl; } } } }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, v, k1 = 0, k2 = 0; int how_many1 = 0; vector<int> molt[99 + 1]; scanf( %d , &n); short b[n << 1]; for (int i = 0; i < (n << 1); i++) { scanf( %d , &v); molt[v].push_back(i); } for (int v = 10; v <= 99; v++) if (molt[v].size() >= 2) { k1++; k2++; how_many1++; b[molt[v][0]] = 1; b[molt[v][1]] = 2; } for (int v = 10; v <= 99; v++) if (molt[v].size() == 1) { if (k1 <= k2) { k1++; how_many1++; b[molt[v][0]] = 1; } else { k2++; b[molt[v][0]] = 2; } } for (int v = 10; v <= 99; v++) { for (int i = 2; i < molt[v].size(); i++) { if (how_many1 < n) { b[molt[v][i]] = 1; how_many1++; } else { b[molt[v][i]] = 2; } } } printf( %d n , k1 * k2); for (int i = 0; i < 2 * n; i++) printf( %d , b[i]); return 0; }
|
#include <bits/stdc++.h> using namespace std; int arr[105][3]; vector<int> vec[105]; bool vis[105]; void dfs(int i) { vis[i] = true; for (int j = 0; j < vec[i].size(); j++) { if (!vis[vec[i][j]]) dfs(vec[i][j]); } return; } int main() { int n, i, cnt = 0, j; cin >> n; for (i = 1; i <= n; i++) { scanf( %d%d , &arr[i][0], &arr[i][1]); } for (i = 1; i <= n; i++) { for (j = i + 1; j <= n; j++) { if (i != j) { if (arr[i][0] == arr[j][0] || arr[i][1] == arr[j][1]) { vec[i].push_back(j); vec[j].push_back(i); } } } } for (i = 1; i <= n; i++) { if (!vis[i]) { cnt++; dfs(i); } } cout << cnt - 1; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int kMaxN = 1 + 50; char A[kMaxN][kMaxN], B[kMaxN][kMaxN]; int N, M; int type; void ReadInput() { scanf( %d%d , &N, &M); for (int i = 1; i <= N; i++) { scanf( %s , A[i] + 1); } for (int i = 1; i <= N; i++) { scanf( %s , B[i] + 1); } if (N % 2 == 0) { type = 0; } else { type = 1; } } bool Perfect(char mat[kMaxN][kMaxN]) { if (type == 0) { for (int i = 1; i <= N; i++) { for (int j = 1; j <= M; j++) { if (i % 2 == 1 && mat[i][j] != U ) { return false; } if (i % 2 == 0 && mat[i][j] != D ) { return false; } } } return true; } else { for (int i = 1; i <= N; i++) { for (int j = 1; j <= M; j++) { if (j % 2 == 1 && mat[i][j] != L ) { return false; } if (j % 2 == 0 && mat[i][j] != R ) { return false; } } } return true; } } vector<pair<int, int> > Normalize(char mat[kMaxN][kMaxN]) { vector<pair<int, int> > moves; bool now = 0; while (!Perfect(mat)) { if (now == 0) { for (int i = 1; i < N; i++) { for (int j = 1; j < M; j++) { if (mat[i][j] == U && mat[i][j + 1] == U && mat[i + 1][j] == D && mat[i + 1][j + 1] == D ) { mat[i][j] = mat[i + 1][j] = L ; mat[i][j + 1] = mat[i + 1][j + 1] = R ; moves.push_back(make_pair(i, j)); } } } } else { for (int i = 1; i < N; i++) { for (int j = 1; j < M; j++) { if (mat[i][j] == L && mat[i + 1][j] == L && mat[i][j + 1] == R && mat[i + 1][j + 1] == R ) { mat[i][j] = mat[i][j + 1] = U ; mat[i + 1][j] = mat[i + 1][j + 1] = D ; moves.push_back(make_pair(i, j)); } } } } now ^= 1; } return moves; } int main() { ReadInput(); vector<pair<int, int> > first = Normalize(A); vector<pair<int, int> > second = Normalize(B); reverse(second.begin(), second.end()); printf( %d n , (int)first.size() + (int)second.size()); for (auto p : first) { printf( %d %d n , p.first, p.second); } for (auto p : second) { printf( %d %d n , p.first, p.second); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int MX = 1e5 + 6; long long l, r; int main() { cin >> l >> r; puts( YES ); for (long long i = l; i <= r; i += 2) cout << i << << i + 1 << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, m, a, b; cin >> n >> m >> a >> b; if (n * a != m * b) { cout << NO << endl; continue; } int index = 0; cout << YES << endl; for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { cout << ((index + j) % m < a ? 1 : 0); } index -= a; if (index < 0) index += m; cout << endl; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; struct dot { string f, s; }; bool cmp(dot x, dot y) {} int main() { int i, j, k, n; int p[100010]; dot A[100010]; cin >> n; for (int(i) = int(1); i <= int(n); i++) { cin >> A[i].f >> A[i].s; } string las = ; for (int(i) = int(1); i <= int(n); i++) { cin >> p[i]; } bool OK = true; las = min(A[p[1]].f, A[p[1]].s); for (int(i) = int(2); i <= int(n); i++) { if (min(A[p[i]].f, A[p[i]].s) > las) las = min(A[p[i]].f, A[p[i]].s); else if (max(A[p[i]].f, A[p[i]].s) > las) { las = max(A[p[i]].f, A[p[i]].s); } else { OK = false; break; } } if (OK) cout << YES n ; else cout << NO << endl; }
|
#include <bits/stdc++.h> using namespace std; int f[1005][1005], s[1005][1005]; int n, k, a[1005], ans; inline int X(int x) { for (int i = 1; i <= k; i++) for (int j = 1; j <= n; j++) f[i][j] = s[i][j] = 0; for (int i = 1; i <= n; i++) f[1][i] = 1; for (int i = 1; i <= k; i++) { int l = 1; for (int j = 1; j <= n; j++) { while (a[j] - a[l] >= x) l++; f[i][j] = (f[i][j] + s[i - 1][l - 1]) % 998244353; s[i][j] = (f[i][j] + s[i][j - 1]) % 998244353; } } int ret = 0; for (int i = k; i <= n; i++) (ret += f[k][i]) %= 998244353; return ret; } int main() { scanf( %d%d , &n, &k); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); sort(a + 1, a + n + 1); for (int i = 1; i <= (a[n]) / (k - 1); i++) (ans += X(i)) %= 998244353; printf( %d n , ans); }
|
#include <bits/stdc++.h> using namespace std; long long num[30]; int main() { int n, m; long long k; string temp; scanf( %d%I64d , &n, &k); long long cnt = 0; cin >> temp; for (int i = 0; i < n; i++) { num[temp[i] - A + 1]++; } for (int i = 0; i < 26 && k != 0; i++) { m = 1; for (int j = 2; j <= 26; j++) { if (num[m] < num[j]) m = j; } if (num[m] <= k) { cnt += num[m] * num[m]; k -= num[m]; num[m] = 0; } else { cnt += k * k; break; } } printf( %I64d n , cnt); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n; int c[1000010]; int mp[1000]; int in[1000010]; int fir[1000010]; int ans[1000010]; vector<int> v[1000010]; int calc(int nod) { if (c[nod] == 5) return fir[nod] = in[nod]; if (c[nod] == 4) return fir[nod] = 1 - calc(v[nod][0]); int q1 = calc(v[nod][0]); int q2 = calc(v[nod][1]); if (c[nod] == 3) return fir[nod] = q1 ^ q2; if (c[nod] == 2) return fir[nod] = q1 | q2; if (c[nod] == 1) return fir[nod] = q1 & q2; } void dfs(int nod, int ch) { if (c[nod] == 5) { ans[nod] = ch; return; } if (c[nod] == 4) { dfs(v[nod][0], ch); return; } if (ch == 0) { dfs(v[nod][0], 0); dfs(v[nod][1], 0); return; } int q1 = fir[v[nod][0]]; int q2 = fir[v[nod][1]]; if (c[nod] == 3) { if ((q1 ^ (!q2)) == fir[nod]) { dfs(v[nod][1], 0); } else { dfs(v[nod][1], 1); } if ((q2 ^ (!q1)) == fir[nod]) { dfs(v[nod][0], 0); } else { dfs(v[nod][0], 1); } } if (c[nod] == 2) { if ((q1 | (!q2)) == fir[nod]) { dfs(v[nod][1], 0); } else { dfs(v[nod][1], 1); } if ((q2 | (!q1)) == fir[nod]) { dfs(v[nod][0], 0); } else { dfs(v[nod][0], 1); } } if (c[nod] == 1) { if ((q1 & (!q2)) == fir[nod]) { dfs(v[nod][1], 0); } else { dfs(v[nod][1], 1); } if ((q2 & (!q1)) == fir[nod]) { dfs(v[nod][0], 0); } else { dfs(v[nod][0], 1); } } } int main() { memset(ans, -1, sizeof ans); mp[ A ] = 1; mp[ O ] = 2; mp[ X ] = 3; mp[ N ] = 4; mp[ I ] = 5; cin >> n; for (int i = 1; i <= n; i++) { string s; cin >> s; if (s == IN ) { int a; cin >> a; c[i] = 5; in[i] = a; } else if (s == NOT ) { int a; cin >> a; c[i] = mp[ N ]; v[i].push_back(a); } else { int a, b; cin >> a >> b; v[i].push_back(a); v[i].push_back(b); c[i] = mp[s[0]]; } } calc(1); dfs(1, 1); string s1 = ; for (int i = 1; i <= n; i++) { if (ans[i] != -1) { if (ans[i]) ans[i] = 1 - fir[1]; else ans[i] = fir[1]; s1 += char( 0 + ans[i]); } } cout << s1 << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int a[1010]; int main() { int n, k; scanf( %d%d , &n, &k); for (int i = 0; i < n; i++) scanf( %d , &a[i]); sort(a, a + n); int ans = 0; for (int i = 0; i < n; i++) { if (a[i] <= k * 2) { k = max(k, a[i]); continue; } else { k = k * 2; ans++; i--; } } printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; char a[1000005], b[1000005], s[1000005]; int k, T, tmp[27], vis[27], p, n, tt[27], vv[27]; bool check(int x, int cas) { memcpy(tt, tmp, sizeof(tt)); memcpy(vv, vis, sizeof(vv)); if (cas == 1) { for (int i = x; i <= n; i++) { if (tt[s[i] - a ] != -1) { if (tt[s[i] - a ] > a[i]) return 1; if (tt[s[i] - a ] < a[i]) return 0; continue; } for (int j = a[i] + 1; j <= k + a - 1; j++) if (!vv[j - a ]) return 1; if (!vv[a[i] - a ]) vv[a[i] - a ] = 1, tt[s[i] - a ] = a[i]; else return 0; } return 1; } else { for (int i = x; i <= n; i++) { if (tt[s[i] - a ] != -1) { if (tt[s[i] - a ] > b[i]) return 0; if (tt[s[i] - a ] < b[i]) return 1; continue; } for (int j = a ; j < b[i]; j++) if (!vv[j - a ]) return 1; if (!vv[b[i] - a ]) vv[b[i] - a ] = 1, tt[s[i] - a ] = b[i]; else return 0; } return 1; } } void solve() { scanf( %d%s%s%s , &k, s + 1, a + 1, b + 1); n = strlen(s + 1); memset(tmp, -1, sizeof(tmp)); p = n + 1; memset(vis, 0, sizeof(vis)); for (int i = 1; i <= n; i++) if (a[i] == b[i]) { if (tmp[s[i] - a ] == a[i]) continue; if (tmp[s[i] - a ] == -1 && !vis[a[i] - a ]) tmp[s[i] - a ] = a[i], vis[a[i] - a ] = 1; else { puts( NO ); return; } } else { p = i; break; } int flag = 0; for (int i = p; i <= n; i++) { if (!flag && a[i] > b[i]) { puts( NO ); return; } if (tmp[s[i] - a ] != -1) { if ((((flag & 2) == 0) && tmp[s[i] - a ] < a[i]) || (((flag & 4) == 0) && tmp[s[i] - a ] > b[i])) { puts( NO ); return; } if ((flag & 2) == 0 && tmp[s[i] - a ] > a[i]) flag |= 2; if ((flag & 4) == 0 && tmp[s[i] - a ] < b[i]) flag |= 4; } else if ((flag & 6) == 0) { bool used = 0; for (int j = a[i] + 1; j < b[i]; j++) if (!vis[j - a ]) { tmp[s[i] - a ] = j; vis[j - a ] = 1; flag |= 6; used = 1; break; } if (!used) { if (!used && !vis[b[i] - a ]) { vis[b[i] - a ] = 1, tmp[s[i] - a ] = b[i]; if (!check(i + 1, 2)) vis[b[i] - a ] = 0, tmp[s[i] - a ] = -1; else flag |= 2, used = 1; } if (!used && !vis[a[i] - a ]) { vis[a[i] - a ] = 1, tmp[s[i] - a ] = a[i]; if (check(i + 1, 1)) flag |= 4, used = 1; } if (!used) { puts( NO ); return; } } } else if ((flag & 2) == 0) { bool used = 0; for (int j = a[i] + 1; j <= k + a - 1; j++) if (!vis[j - a ]) { tmp[s[i] - a ] = j; vis[j - a ] = 1; flag |= 2; used = 1; break; } if (!used) { if (!vis[a[i] - a ]) vis[a[i] - a ] = 1, tmp[s[i] - a ] = a[i]; else { puts( NO ); return; } } } else if ((flag & 4) == 0) { bool used = 0; for (int j = a ; j < b[i]; j++) if (!vis[j - a ]) { tmp[s[i] - a ] = j; vis[j - a ] = 1; flag |= 4; used = 1; break; } if (!used) { if (!vis[b[i] - a ]) vis[b[i] - a ] = 1, tmp[s[i] - a ] = b[i]; else { puts( NO ); return; } } } flag |= 1; if (flag == 7) break; } puts( YES ); int now = 0; while (vis[now]) now++; for (int i = 0; i < k; i++) if (tmp[i] == -1) { tmp[i] = a + now; vis[now] = 1; while (vis[now]) now++; } for (int i = 0; i < k; i++) printf( %c , tmp[i]); puts( ); } int main() { scanf( %d , &T); while (T--) solve(); }
|
#include <bits/stdc++.h> using namespace std; using std::string; int main() { int n, k; cin >> n >> k; if (n * (n - 1) / 2 > k) { int i = 0, j = 0; while (n--) { cout << i << << j++ << endl; } } else cout << no solution ; }
|
#include <bits/stdc++.h> int main() { int g[5][5]; int ans = 0; for (int i = 0; i < 5; i++) for (int j = 0; j < 5; j++) scanf( %d , &g[i][j]); for (int i1 = 0; i1 < 5; i1++) { for (int i2 = 0; i2 < 5; i2++) { if (i2 == i1) continue; for (int i3 = 0; i3 < 5; i3++) { if (i3 == i1 || i3 == i2) continue; for (int i4 = 0; i4 < 5; i4++) { if (i4 == i1 || i4 == i2 || i4 == i3) continue; for (int i5 = 0; i5 < 5; i5++) { if (i5 == i1 || i5 == i2 || i5 == i3 || i5 == i4) continue; ans = std::max(ans, g[i1][i2] + g[i2][i1] + g[i2][i3] + g[i3][i2] + g[i3][i4] + g[i3][i4] + g[i4][i3] + g[i4][i3] + g[i4][i5] + g[i4][i5] + g[i5][i4] + g[i5][i4]); } } } } } printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long n, ans = 1; long long C(long long m, long long n) { long long p = 1; for (long long i = 1; i <= n; i++) p *= i; for (long long i = 1; i <= m; i++) p /= i; for (long long i = 1; i <= n - m; i++) p /= i; return p; } signed main() { cin >> n; for (long long i = 1; i <= n / 2 - 1; i++) ans *= i; ans *= ans; ans *= C(n / 2, n); ans /= 2; cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; int T[100010], first[100010], canKill[100010], ans = 0; char flag; int X, M, N, fle = 0, A[100010]; int main() { scanf( %d %d , &N, &M); memset(T, 0, sizeof(T)); memset(first, 0, sizeof(first)); memset(canKill, 0, sizeof(canKill)); ans = 0; for (int i = 1; i <= N; i++) { scanf( %d , &A[i]); if (A[i] > 0) T[A[i]]++; else { first[-1 * A[i]]++; fle++; } } for (int i = 1; i <= N; i++) { if (fle - first[i] + T[i] == M) { canKill[i] = 1; ans++; } } for (int i = 1; i <= N; i++) { if (A[i] > 0) { if (canKill[A[i]] == 1) { if (ans == 1) printf( Truth n ); else printf( Not defined n ); } else { printf( Lie n ); } } else { A[i] = A[i] * -1; if (canKill[A[i]] == 0) { printf( Truth n ); } else { if (ans == 1) printf( Lie n ); else printf( Not defined n ); } } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; vector<long long> v(2000000); for (long long i = 0; i < 2000000; i++) v[i] = 0; for (long long i = 0; i < n; i++) { long long t1; cin >> t1; v[t1]++; } long long t = 0; long long l = 1; long long r = 1000000; while (n > 0) { t++; l++; r--; if (v[l]) n--; if (v[r]) n--; } cout << t; }
|
#include <bits/stdc++.h> using namespace std; void solve() { int n = 0; cin >> n; string s; vector<vector<int> > v(5, vector<int>(0)); for (int i = 0; i < n; i++) { cin >> s; vector<int> cnt(5, 0); int sum = 0; for (int j = 0; j < s.size(); j++) { cnt[s[j] - a ]++; sum++; } for (int j = 0; j < 5; j++) { v[j].push_back(cnt[j] - (sum - cnt[j])); } } long long ans = -1; for (int i = 0; i < 5; i++) { sort(v[i].rbegin(), v[i].rend()); long long sum = 0; long long cnt = 0; for (int j = 0; j < v[i].size(); j++) { sum += v[i][j]; if (sum > 0) { cnt++; } } ans = max(ans, cnt); } cout << ans << endl; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t = 0; cin >> t; while (t--) { solve(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long read() { char x = getchar(); long long ans = 0, flag = 1; while (!isdigit(x)) if (x == - ) flag = -1, x = getchar(); else x = getchar(); while (isdigit(x)) ans = ans * 10 + x - 0 , x = getchar(); return ans * flag; } long long n, a[200005], ans, las; map<long long, long long> mp; signed main() { cin >> n; for (long long i = 1; i <= n; i++) cin >> a[i]; for (long long i = 1; i <= n; i++) a[i] += a[i - 1]; mp[0] = 0; las = 0; for (long long i = 1; i <= n; i++) { if (mp.find(a[i]) != mp.end()) { if (mp[a[i]] >= las) { ans -= (mp[a[i]] - las + 1) * ((n - i + 1)); las = mp[a[i]] + 1; } } mp[a[i]] = i; } cout << ans + n * (n + 1) / 2; return 0; }
|
#include <bits/stdc++.h> using namespace std; using namespace std; ; int n; long long mod = 1000 * 1000 * 1000 + 7; const int maxn = 1000005; int gcd(int a, int b) { if (a == 0) return b; return gcd(b % a, a); } long long d[maxn]; long long cnt[maxn]; long long pow2[maxn]; long long coef[maxn]; long long bad[maxn]; int main() { pow2[0] = 1; for (int i = 1; i < maxn; ++i) { pow2[i] = pow2[i - 1] * 2; pow2[i] %= mod; } cin >> n; vector<int> v; v.resize(n); for (int i = 0; i < n; ++i) { scanf( %d , &v[i]); cnt[v[i]]++; } for (int i = 2; i < maxn; ++i) { for (int j = i; j < maxn; j += i) { d[i] += cnt[j]; if (i != j) bad[j] += i; bad[j] %= mod; } } long long ans = 0; for (int i = maxn - 1; i >= 2; --i) { if (d[i] == 0) continue; coef[i] = (1LL * ((d[i] * pow2[d[i] - 1]) % mod)) % mod; for (int j = i * 2; j < maxn; j += i) coef[i] -= coef[j]; ans += i * coef[i]; ans %= mod; ans += mod; ans %= mod; } cout << ans << n ; }
|
#include <bits/stdc++.h> using namespace std; int gcd(int x, int y) { if (y == 0) return x; else return gcd(y, x % y); } vector<int> ed[200001]; int an[200001]; int b[200001]; set<int> o[2000001]; void dfs(int x, int g, int p) { int i; if (x == 1) { an[x] = b[1]; o[x].insert(0); } else { o[x].insert(g); an[x] = g; if (o[p].size()) { set<int>::iterator f = o[p].begin(); for (i = 0; i < o[p].size(); i++) { int y = gcd(b[x], *f); an[x] = max(an[x], y); if (y != 1) o[x].insert(y); f++; } } } g = gcd(g, b[x]); for (i = 0; i < ed[x].size(); i++) { if (ed[x][i] != p) { dfs(ed[x][i], g, x); } } } int main() { int n; cin >> n; int i; for (i = 1; i <= n; i++) cin >> b[i]; for (i = 1; i < n; i++) { int x, y; cin >> x >> y; ed[x].push_back(y); ed[y].push_back(x); } dfs(1, 0, 0); for (i = 1; i <= n; i++) cout << an[i] << ; cout << endl; return 0; }
|
#include <bits/stdc++.h> int main() { char arr[200]; int i, j, jp, g, t, cl, jm, a, m, n; scanf( %d%d , &cl, &jm); scanf( %c , &arr[0]); for (i = 1; i <= cl; i++) scanf( %c , &arr[i]); for (i = 1; i <= cl; i++) { if (arr[i] == G ) { g = i; } if (arr[i] == T ) { t = i; } } if (g > t) { m = t; n = g; a = g - t; } else { m = g; n = t; a = t - g; } for (i = m; i < n; i = i + jm) { if (arr[i] == # ) { printf( NO n ); return 0; } } if ((a % jm) == 0) printf( YES n ); else printf( NO n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; double eps = 1e-9; const int INF = 1e9 + 7; const int MAXN = int(2e5 + 7); int n, k, b, ans; long long cur = 1, t; int main() { cin >> k >> b >> n >> t; while (cur <= t) { cur = cur * k + b; n--; } cout << max(0, ++n); return 0; }
|
#include <bits/stdc++.h> using namespace std; void boost() { ios_base::sync_with_stdio(false); cin.tie(NULL); } const int N = 2e5 + 5; int arr[N], ans[N]; vector<int> adj[N]; vector<int> factor[2][N]; bool avail[N]; void dfs(int u, int p, int d) { if (u != 1) { for (auto x : factor[0][p]) if (arr[u] % x == 0) factor[0][u].push_back(x); else factor[1][u].push_back(x); for (auto x : factor[1][p]) if (arr[u] % x == 0) factor[1][u].push_back(x); } if (d == 2) { for (int i = 1; i * i <= arr[u]; i++) { if (arr[u] % i == 0) { if (!avail[i]) factor[1][u].push_back(i); } if (i * i != arr[u] && (arr[u] % (arr[u] / i)) == 0) { if (!avail[arr[u] / i]) { factor[1][u].push_back(arr[u] / i); } } } } for (auto x : factor[0][u]) ans[u] = max(ans[u], x); for (auto x : factor[1][u]) ans[u] = max(ans[u], x); for (auto v : adj[u]) { if (v != p) dfs(v, u, d + 1); } } void solve() { int n; cin >> n; for (int i = 1; i < n + 1; ++i) { cin >> arr[i]; } int u, v; for (int i = 0; i < n - 1; ++i) { cin >> u >> v; adj[u].push_back(v); adj[v].push_back(u); } for (int i = 1; i * i <= arr[1]; i++) { if (arr[1] % i == 0) { factor[0][1].push_back(i); avail[i] = true; } if (i * i != arr[1] && (arr[1] % (arr[1] / i)) == 0) { factor[0][1].push_back(arr[1] / i); avail[arr[1] / i] = true; } } dfs(1, 0, 1); for (int i = 1; i < n + 1; ++i) { cout << ans[i] << ; } return; } int main() { boost(); int tc = 1; while (tc--) solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, k, g, t; cin >> n >> k; char a[n]; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n; i++) { if (a[i] == G ) g = i; if (a[i] == T ) t = i; } for (int i = 0; i < n; i++) { if (g < t) { while (g < n && a[g] != # && a[g] != T ) g = g + k; if (a[g] == T ) { cout << YES << endl; return 0; } else if (a[g] == # || g >= n) { cout << NO << endl; return 0; } } else if (g > t) { while (g >= 0 && a[g] != # && a[g] != T ) g = g - k; if (a[g] == T ) { cout << YES << endl; return 0; } else if (a[g] == # || g < 0) { cout << NO << endl; return 0; } } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); string s; cin >> s; int n = s.size(); bool dp[n + 1][8]; memset(dp, false, sizeof(dp)); string ans[8]; for (int i = 1; i < n + 1; i++) { string temp_ans[8]; dp[i][(s[i - 1] - 0 ) % 8] = true; temp_ans[(s[i - 1] - 0 ) % 8] = s[i - 1]; for (int j = 0; j < 8; j++) { if (dp[i - 1][j]) { int temp = (10 * j + (s[i - 1] - 0 )) % 8; dp[i][temp] = true; temp_ans[temp] = ans[j] + s[i - 1]; dp[i][j] = true; temp_ans[j] = ans[j]; } } for (int j = 0; j < 8; j++) ans[j] = temp_ans[j]; } if (dp[n][0]) { cout << YES n ; cout << ans[0] << endl; } else cout << NO n ; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long int b, l, d; cin >> b >> l >> d; long long int m = b; if (l > m) { m = l; } if (d > m) { m = d; } long long int miss = 0; if (m - 1 - b > 0) { miss += m - 1 - b; } if (m - 1 - l > 0) { miss += m - 1 - l; } if (m - 1 - d > 0) { miss += m - 1 - d; } cout << miss; }
|
#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > a[100500]; int d[100500]; int main() { int n, m, cap; scanf( %d%d%d , &n, &m, &cap); cap--; for (int i = 0; i < (m); i++) { int x, y, w; scanf( %d%d%d , &x, &y, &w); x--, y--; a[x].push_back(pair<int, int>(y, w)); a[y].push_back(pair<int, int>(x, w)); } int l; scanf( %d , &l); const int INF = 1100000000; for (int i = 0; i < (n); i++) d[i] = INF; d[cap] = 0; set<pair<int, int> > s; s.insert(pair<int, int>(d[cap], cap)); while (!s.empty()) { int v = s.begin()->second; s.erase(s.begin()); for (typeof((a[v]).begin()) it = (a[v]).begin(); it != (a[v]).end(); ++it) { int u = it->first; int w = it->second; if (d[u] >= INF || d[u] >= d[v] + w) { if (d[u] < INF) s.erase(s.find(pair<int, int>(d[u], u))); d[u] = d[v] + w; s.insert(pair<int, int>(d[u], u)); } } } int ans = 0; for (int i = 0; i < (n); i++) for (typeof((a[i]).begin()) it = (a[i]).begin(); it != (a[i]).end(); ++it) { int u = i; int v = it->first; int w = it->second; int x = d[v] - d[u] + w; assert(0 <= x && x <= w + w); if (0 < x && x < w + w) { if (d[u] < l && l + l <= 2 * d[u] + x) ans++; if (d[v] < l && l + l <= 2 * d[v] + w + w - x) ans++; if (l + l == 2 * d[u] + x && l + l == 2 * d[v] + w + w - x) ans--; } else { if (min(d[u], d[v]) < l && l < max(d[u], d[v])) ans++; } } ans >>= 1; for (int i = 0; i < (n); i++) ans += d[i] == l; printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using D = double; using uint = unsigned int; template <typename T> using pair2 = pair<T, T>; const int maxn = 300005; bool used[maxn]; int n, k; vector<int> all; int main() { cin >> n >> k; if (k == 6) { if (n < 6) printf( No n ); else { printf( Yes n ); printf( 5 n ); printf( 1 2 4 5 6 n ); } return 0; } int cur = 0; int mx = 0; for (int i = 1; i <= n && cur < k; i++) { mx = i; used[i] = true; for (int j = 1; j < i && j * j <= i; j++) if (i % j == 0) { cur++; if (i / j > j && i / j < i) cur++; } } if (cur < k) { printf( No n ); return 0; } for (int IT = 0; IT < 3; IT++) { for (int i = mx; i >= 1 && cur > k; i--) if (used[i]) { int cnt = 0; for (int j = 1; j < i && j * j <= i; j++) if (i % j == 0) { if (used[j]) cnt++; if (i / j > j && i / j < i && used[i / j]) cnt++; } for (int j = 2 * i; j <= mx; j++) if (used[j]) cnt++; if (cnt <= cur - k) { used[i] = false; cur -= cnt; } } } assert(cur == k); for (int i = 0; i <= mx; i++) if (used[i]) all.push_back(i); printf( Yes n ); printf( %d n , (int)all.size()); for (auto t : all) printf( %d , t); printf( n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int sz = 55; int n, r1, c1, r2, c2, ans = 1000000000; string s[sz]; bool visited[sz][sz]; vector<pair<int, int> > v; void dfs(int x, int y, bool flag) { if (x < 1 || x > n || y < 1 || y > n || s[x][y] == 1 || visited[x][y] == true) { return; } visited[x][y] = true; if (flag == true) { v.push_back(make_pair(x, y)); } else { for (int i = 0; i < v.size(); i++) { int cost = (v[i].first - x) * (v[i].first - x) + (v[i].second - y) * (v[i].second - y); ans = min(ans, cost); } } dfs(x - 1, y, flag); dfs(x + 1, y, flag); dfs(x, y - 1, flag); dfs(x, y + 1, flag); } int main() { cin >> n; cin >> r1 >> c1 >> r2 >> c2; for (int i = 1; i <= n; i++) { cin >> s[i]; s[i] = + s[i]; } memset(visited, false, sizeof(visited)); dfs(r2, c2, true); memset(visited, false, sizeof(visited)); dfs(r1, c1, false); cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { string s1, s2, t = ; cin >> s1 >> s2; int n = s1.size(), c = 0, c1 = 0, c2 = 0; for (int i = 0; i < n; i++) { if (s1[i] != s2[i]) c++; } if (c % 2 != 0) cout << impossible << endl; else { c1 = c2 = c / 2; for (int i = 0; i < n; i++) { if (s1[i] == s2[i]) t += s1[i]; else if (s1[i] != s2[i]) { if (c1 > 0) { c1--; t += s1[i]; } else if (c2 > 0) { c2--; t += s2[i]; } } } cout << t << endl; } }
|
#include <bits/stdc++.h> using namespace std; template <class T> inline void checkMin(T &a, T b) { if (b < a) a = b; } template <class T> inline void checkMax(T &a, T b) { if (a < b) a = b; } template <class T> inline T Min(T a, T b) { return a < b ? a : b; } template <class T> inline T Max(T a, T b) { return a > b ? a : b; } template <class T> inline T Myabs(T a) { return a > 0 ? a : -a; } const int dx[] = {-1, 0, 1, 0}; const int dy[] = {0, 1, 0, -1}; const int inf = 0x3f3f3f3f; const long long linf = 1LL << 60; const double pi = acos(-1.0); const double eps = 1e-9; const int mod = 100000007; const int maxn = 10010; int n, r, c; char ch[maxn], s[maxn]; void print(int v) { if (v) { print((v - 1) / 26); printf( %c , A + (v - 1) % 26); } } int main() { scanf( %d , &n); for (int cas = 1; cas <= n; cas++) { scanf( %s , ch); if (sscanf(ch, R%dC%d , &r, &c) == 2) { print(c); printf( %d n , r); } else { sscanf(ch, %[^0-9]%d , s, &r); int ans = 0; for (int i = 0; s[i]; i++) ans *= 26, ans += s[i] - A + 1; printf( R%dC%d n , r, ans); } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int dp[2][4500005], xl[3005], ans, gd[3005]; void merge(int l, int r) { if (l == r) return; int mid = (l + r) >> 1; merge(l, mid), merge(mid + 1, r); int i = l, j = mid + 1, dq = l; while (i <= mid && j <= r) { if (xl[i] <= xl[j]) gd[dq++] = xl[i++]; else gd[dq++] = xl[j++], ans += mid - i + 1; } for (; i <= mid; ++i) gd[dq++] = xl[i]; for (; j <= r; ++j) gd[dq++] = xl[j]; for (int i = l; i <= r; ++i) xl[i] = gd[i]; return; } int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %d , &xl[i]); merge(1, n); for (int i = 1; i <= ans; ++i) { dp[1][i] = dp[0][i - 1] + 1; dp[0][i] = dp[1][i - 1] + 3; } printf( %.6lf , (double)dp[1][ans]); }
|
#include <bits/stdc++.h> int main() { int n, i; while (scanf( %d , &n) != EOF) { printf( %d , n); for (i = 1; i < n; i++) printf( %d , i); printf( n ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 203600; pair<pair<int, int>, int> p[N]; int n; vector<int> ans; int main() { cin >> n; for (int i = (0); i < (int)(n); i++) { cin >> p[i].first.first >> p[i].first.second; p[i].second = i + 1; } sort(p, p + n); for (int i = (0); i < (int)(n); i++) { int cur = -1e9; bool ok = 1; for (int j = (0); j < (int)(n); j++) if (j != i) { if (p[j].first.first < cur) ok = 0; else cur = p[j].first.second; } if (ok) ans.push_back(p[i].second); } sort((ans).begin(), (ans).end()); printf( %d n , (int)ans.size()); for (int i = (0); i < (int)(ans.size()); i++) printf( %d%s , ans[i], i + 1 == ans.size() ? n : ); }
|
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int n, r1 = -1, p1 = -1, p2 = INT_MAX, x, a, b; cin >> n; while (n--) cin >> x, r1 = max(r1, x); cin >> n; while (n--) cin >> x, p1 = max(p1, x); cin >> n; while (n--) cin >> x, p2 = min(p2, x); cin >> a >> b; long double q = ((long long)(b * p1) / (long double)(a * p2 + b * p1)); q = sqrt(q); q *= r1; printf( %.12Lf n , q); return 0; }
|
#include <bits/stdc++.h> using namespace std; int a[100005], f[100005], st[100005]; int main() { int n, top = 0; scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d , a + i); for (int i = n - 1; i >= 0; i--) { int t = 0; while (top && a[st[top - 1]] < a[i]) f[i] = t = max(t + 1, f[st[--top]]); st[top++] = i; } printf( %d n , *max_element(f, f + n)); }
|
#include <bits/stdc++.h> using namespace std; map<long long, int> m; map<long long, int>::iterator it; int main() { int n, k, q, a[150001]; cin >> n >> k >> q; for (int i = 1; i <= n; i++) cin >> a[i]; while (q--) { int x, y; cin >> x >> y; if (x == 1) m.insert(make_pair(-a[y], y)); else { int count = 0, p = 1; if (m.find(-a[y]) == m.end()) p = 0; else { for (it = m.begin(); it != m.end(); it++) { if (it->first == -a[y]) break; else count++; if (count == k) { p = 0; break; } } } if (p) cout << YES n ; else cout << NO n ; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; double PI = 3.141592653589793; vector<complex<double> > duzywek; vector<complex<double> > duzyret[50][2]; void szykuj() { for (int j = 0; j < 22; j++) { for (int i = 1; i <= (1 << (21 - j)); i++) { duzyret[j][0].push_back(0); if (j) duzyret[j][1].push_back(0); } } } int potenga(int v) { for (int i = 1; 1; i <<= 1) { if (i >= v) { return i; } } } void dft(int nn, int kt, int coile, complex<double> omega, int gdzie, int poz) { if (nn == 1) { duzyret[poz][gdzie][0] = duzywek[kt]; return; } dft(nn >> 1, kt, coile << 1, omega * omega, 0, poz + 1); dft(nn >> 1, kt + coile, coile << 1, omega * omega, 1, poz + 1); complex<double> jeden(1.0, 0.0); int w = 0; int an = (nn >> 1) - 1; for (int i = 0; i < nn; i++) { duzyret[poz][gdzie][i] = duzyret[poz + 1][0][i & an] + jeden * duzyret[poz + 1][1][i & an]; jeden *= omega; } } vector<int> fft(vector<int> jed, vector<int> dwa) { int n1 = potenga(jed.size() + dwa.size()); while (jed.size() < n1) { jed.push_back(0); } while (dwa.size() < n1) { dwa.push_back(0); } complex<double> omega(cos(2.0 * PI / n1), sin(2.0 * PI / n1)); vector<complex<double> > pam; duzywek.clear(); for (int i = 0; i < n1; i++) { duzywek.push_back(complex<double>(jed[i], 0.0)); } dft(n1, 0, 1, omega, 0, 0); pam = duzyret[0][0]; for (int i = 0; i < n1; i++) { duzywek[i] = complex<double>(dwa[i], 0.0); } dft(n1, 0, 1, omega, 0, 0); for (int i = 0; i < n1; i++) { duzywek[i] = pam[i] * duzyret[0][0][i]; } omega = (complex<double>(1.0, 0.0)) / omega; dft(n1, 0, 1, omega, 0, 0); vector<int> retret; int dowrzucenia; for (int i = 0; i < n1; i++) { duzyret[0][0][i] /= n1; dowrzucenia = round(duzyret[0][0][i].real()); retret.push_back(dowrzucenia); } return retret; } int n, m; vector<int> dopo; vector<int> otrz; vector<int> wyn; int x; int main() { szykuj(); scanf( %d%d , &n, &m); while (dopo.size() <= m) { dopo.push_back(0); } dopo[0] = 1; for (int i = 1; i <= n; i++) { scanf( %d , &x); dopo[x] = 1; } otrz = fft(dopo, dopo); while (otrz.size() > m + 1) otrz.pop_back(); for (int i = 1; i < otrz.size(); i++) { if (otrz[i] && !dopo[i]) { printf( NO ); return 0; } if (otrz[i] == 2) { wyn.push_back(i); } } printf( YES n ); printf( %d n , (int)wyn.size()); for (int i = 0; i < wyn.size(); i++) { printf( %d , wyn[i]); } return 0; }
|
#include <bits/stdc++.h> using namespace std; map<long long, int> last; int b[1000000]; long long a[100000]; long long d[100][2]; pair<long long, long long> solve(long long x, long long y) { long long xx, yy; pair<long long, long long> ans; if (x == 1) { return make_pair(1, 0); } xx = x; yy = y % x; if (yy == 1) { ans = make_pair(1, xx - 1); } else { ans = solve(xx % yy, yy); ans.second += (xx / yy) * ans.first; ans.first %= yy; ans.second %= xx; } ans.first += (y / x) * ans.second; ans.first %= y; ans.second %= x; return ans; } long long inv(long long x, long long y) { x %= y; pair<long long, long long> p = solve(x, y); return p.first; } long long gcd(long long x, long long y) { if (y == 0) return x; else return gcd(y, x % y); } int main() { vector<long long> primes; long long i, j, k, l; long long m, n, now, tmp, tmp1, cnt, b1, nn, ans, all; memset(b, 0, sizeof(b)); primes.clear(); for (i = 2; i < 1000000; i++) { if (b[i] == 0) { primes.push_back(i); for (j = i + i; j < 1000000; j += i) b[j] = 1; } } scanf( %I64d%I64d%I64d , &n, &m, &k); for (i = 0; i < k; i++) scanf( %I64d , &a[i]); last.clear(); now = 1; for (i = 0; i < k; i++) { tmp = gcd(now, a[i]); now /= tmp; if ((1LL << 60) / now < a[i]) { printf( NO n ); return 0; } now *= a[i]; if (now > n) { printf( NO n ); return 0; } tmp = a[i]; for (j = 0; j < primes.size() && primes[j] * primes[j] <= tmp; j++) { cnt = 0; while (tmp % primes[j] == 0) { tmp /= primes[j]; cnt++; } tmp1 = 1; for (l = 0; l < cnt; l++) { tmp1 *= primes[j]; if (i - tmp1 >= 0) { if ((last.find(tmp1) == last.end()) || (last[tmp1] != i - tmp1)) { printf( NO n ); return 0; } last[tmp1] = i; } else { if (last.find(tmp1) != last.end()) { printf( NO n ); return 0; } last[tmp1] = i; } } } if (tmp > 1) { tmp1 = tmp; if (i - tmp1 >= 0) { if ((last.find(tmp1) == last.end()) || (last[tmp1] != i - tmp1)) { printf( NO n ); return 0; } last[tmp1] = i; } else { if (last.find(tmp1) != last.end()) { printf( NO n ); return 0; } last[tmp1] = i; } } } for (map<long long, int>::iterator it = last.begin(); it != last.end(); it++) { if (it->second + it->first < k) { printf( NO n ); return 0; } } nn = 0; for (map<long long, int>::reverse_iterator it = last.rbegin(); it != last.rend(); it++) { b1 = 1; for (i = 0; i < nn; i++) if (d[i][0] % it->first == 0) { b1 = 0; break; } if (b1 == 0) continue; d[nn][0] = it->first; d[nn][1] = k - 1 - it->second; nn++; } ans = 0; all = 1; for (i = 0; i < nn; i++) all *= d[i][0]; for (i = 0; i < nn; i++) { tmp = 1; for (j = 0; j < nn; j++) if (j != i) tmp *= d[j][0]; tmp *= inv(tmp, d[i][0]); tmp *= d[i][1]; tmp %= all; ans += tmp; } ans %= all; if (ans - (k - 1) <= 0) ans += all; if (ans <= m) { printf( YES n ); } else printf( NO n ); }
|
#include <bits/stdc++.h> using namespace std; struct node { int x, y; bool operator<(const node& a) const { return x < a.x || x == a.x && y < a.y; } }; const int dr[] = {-1, 1, 0, 0, -1, -1, 1, 1}; const int dc[] = {0, 0, -1, 1, -1, 1, -1, 1}; int HH[277]; char s[401000]; int main() { int n, k; do { char _c = getchar(), _v = 1; for (n = 0; _c < 48 || _c > 57; _c = getchar()) if (_c == 45) _v = -1; for (; _c >= 48 && _c <= 57; n = (n << 1) + (n << 3) + _c - 48, _c = getchar()) ; n *= _v; } while (0); do { char _c = getchar(), _v = 1; for (k = 0; _c < 48 || _c > 57; _c = getchar()) if (_c == 45) _v = -1; for (; _c >= 48 && _c <= 57; k = (k << 1) + (k << 3) + _c - 48, _c = getchar()) ; k *= _v; } while (0); scanf( %s , s); for (int i = 0; i < n; i++) ++HH[s[i]]; if (n == k) return 0; char c; for (c = a ; c <= z ; ++c) { k -= HH[c]; if (k <= 0) { k += HH[c]; break; } HH[c] = 0; } int cnt = 0; for (int i = 0; i < n; i++) { if (HH[s[i]]) { if (s[i] != c) putchar(s[i]); else { cnt++; if (cnt > k) putchar(s[i]); } } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { int n, m; cin >> n >> m; bitset<32> b1(n); bitset<32> b2(m + 1); vector<int> a(32), b(32); for (int i = 0; i < 32; i++) a[i] = b1[31 - i]; for (int i = 0; i < 32; i++) b[i] = b2[31 - i]; long long ans = 0; for (int i = 0; i < 32; i++) { if (a[i] == 1 && b[i] == 0) break; else ans += (a[i] ^ b[i]) * pow(2, 31 - i); } cout << ans << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long INF = 1e18; const int INFi = 2e9; const int maxN = 1e5 + 5; const int md = 998244353; const int md2 = 1e9 + 7; double getTime() { return clock() / (double)CLOCKS_PER_SEC; }; void solve() { int m, n; cin >> m >> n; vector<pair<int, int>> a(n); for (int i = 0; i < n; ++i) cin >> a[i].first >> a[i].second; sort((a).begin(), (a).end()); vector<long long> suf(n + 1); suf[n] = 0; suf[n - 1] = a[n - 1].first; for (int i = n - 2; i >= 0; --i) suf[i] = suf[i + 1] + a[i].first; long long ans = 0; for (int i = 0; i < n; ++i) { long long res = 0; pair<int, int> kek = {a[i].second, -1}; int l = lower_bound((a).begin(), (a).end(), kek) - a.begin(); l = max(l, n - m); int cnt = n - l; res += suf[l]; if (i < l && cnt < m) { cnt++; res += a[i].first; } res += 1ll * a[i].second * (m - cnt); ans = max(ans, res); } cout << ans << n ; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int tests = 1; cin >> tests; for (int _ = 0; _ < tests; ++_) { solve(); } return 0; }
|
#include <bits/stdc++.h> const int N = 5010; const int M = 1 << 20; const int K = 30; char s[N]; int vis[K]; bool dp[M]; int cnt[K], l[K], r[K]; int main(){ int n, a, b; scanf( %d%d%d , &n, &a, &b); scanf( %s , s); memset(vis, -1, sizeof(vis)); int id = 0; for (int i = 0; i < n; ++ i){ if (vis[s[i] - a ] != -1){ continue; } vis[s[i] - a ] = id; l[id] = i; for (int j = i; j < n; ++ j){ if (s[j] == s[i]){ r[id] = j; ++ cnt[id]; } } if (1ll * a * (r[id] - l[id] + 1) <= 1ll * cnt[id] * b){ dp[1 << id] = true; } ++ id; } for (int i = 3; i < (1 << id) - 1; ++ i){ if (__builtin_popcount(i) <= 1){ continue; } for (int j = 1; j < id; ++ j){ int x = i & ((1 << j) - 1); int y = i ^ x; if (x < i && y < i){ if (dp[x] && dp[y]){ dp[i] = true; break; } } } if (dp[i]){ continue; } int left = INT_MAX, right = INT_MIN; int ccnt = 0; for (int j = 0; j < id; ++ j){ if (i >> j & 1){ left = std::min(left, l[j]); right = std::max(right, r[j]); ccnt += cnt[j]; } } if (1ll * a * (right - left + 1) <= 1ll * ccnt * b){ for (int j = 0; j < id; ++ j){ if (i >> j & 1){ if (dp[i ^ 1 << j]){ dp[i] = true; break; } } } } } dp[0] = true; std::vector <char> ans; for (int i = 0; i < 26; ++ i){ if (vis[i] == -1){ continue; } if (dp[((1 << id) - 1) ^ (1 << vis[i])]){ ans.emplace_back( a + i); } } printf( %d , int(ans.size())); for (auto u : ans){ printf( %c , u); } puts( ); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, m; char a[55][55]; memset(a, 0, sizeof(a)); scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { cin >> a[i][j]; } } cout << a[1] << endl; int r[55], c[55], rn = 0, cn = 0; bool rr[55]; memset(rr, 0, sizeof(rr)); for (int i = 1; i <= n; i++) { rr[i] = 1; memset(r, 0, sizeof(r)); memset(c, 0, sizeof(c)); rn = cn = 0; for (int j = 1; j <= m; j++) { if (a[i][j] == # ) { c[++cn] = j; for (int k = i + 1; k <= n; k++) { if (a[k][j] == # && !rr[k]) { rr[k] = 1; r[++rn] = k; } } } } for (int j = 1; j <= rn; j++) { for (int k = 1; k <= cn; k++) { if (a[r[j]][c[k]] != # ) { cout << No n ; return 0; } } int num = 0; for (int k = 1; k <= m; k++) { if (a[r[j]][k] == # ) { num++; } } if (num != cn) { cout << No n ; return 0; } } } cout << Yes n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 7; int h; int a[N]; int sum[N]; int main() { scanf( %d , &h); for (int i = 0; i <= h; i++) { scanf( %d , &a[i]); sum[i] += sum[i - 1] + a[i]; } bool check = false; int pre = 1; for (int i = 0; i <= h; i++) { if (a[i] == 1) { pre = 1; continue; } else { if (pre == 1) { pre = a[i]; continue; } else { check = true; } } } if (check == false) { cout << perfect ; return 0; } cout << ambiguous << endl; cout << 0 ; for (int i = 1; i <= h; i++) { for (int j = 1; j <= a[i]; j++) { cout << sum[i - 2] + 1 << ; } } cout << endl; cout << 0 ; for (int i = 1; i <= h; i++) { for (int j = 1; j <= a[i]; j++) { if (sum[i - 2] + j <= sum[i - 1]) cout << sum[i - 2] + j << ; else { cout << sum[i - 2] + 1 << ; } } } cout << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int n; int a[100010]; int b[100010]; int main() { cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; b[0] = 1; for (int i = 1; i < n; i++) if (a[i] > a[i - 1]) b[i] = b[i - 1] + 1; else b[i] = 1; int mx = 1; for (int i = 0; i < n; i++) mx = max(mx, b[i]); if (mx != n) mx += 1; int nx = 0; if (n > 1 && a[0] >= a[1]) { for (int i = 2; i < n; i++) if (b[i] == 1) { mx = max(mx, b[i - 1] + 1); break; } else if (i == n - 1) mx = max(mx, b[n - 1] + 1); } for (int i = 1; i < n; i++) { if (b[i] == 1) { mx = max(mx, b[i - 1] + nx); mx = max(mx, b[i - 1] + 1); if (a[i + 1] - a[i - 1] >= 2) nx = b[i - 1]; else nx = 0; } else if (i == n - 1) mx = max(mx, b[i] + nx); } nx = 0; for (int i = 0; i < n; i++) { if (b[i + 1] == 1 && i + 1 < n) { mx = max(mx, b[i] + nx); mx = max(mx, b[i] + 1); if (a[i + 1] - a[i - 1] >= 2) nx = b[i]; else nx = 0; } else if (i + 1 == n) mx = max(mx, b[i] + nx); } cout << mx << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 110; int T, mod = 1e9 + 7, n, k, deep[N], timer, sz; long long ans, fact[N], mem[N][N], vis[N][N]; vector<int> adj[N], v; map<int, int> mp[N]; void _clear() { ans = 0; for (int i = 1; i <= n; i++) adj[i].clear(); } long long po(long long x, long long os) { if (os == 0) return 1; long long z = po(x, os / 2); if (os & 1) return z * z % mod * x % mod; return z * z % mod; } long long modInv(long long x) { return po(x, mod - 2); } long long c(long long n, long long r) { return fact[n] * modInv(fact[r] * fact[n - r] % mod) % mod; } void dfs(int u, int v) { deep[u] = deep[v] + 1; mp[u][deep[u]]++; for (auto &x : adj[u]) if (x != v) { dfs(x, u); for (auto &p : mp[x]) mp[u][p.first] += p.second; } } long long dp(int i, int k) { if (k == 0) return 1; if (i == sz) return 0; long long &ret = mem[i][k]; if (vis[i][k] == timer) return ret; vis[i][k] = timer; return ret = (dp(i + 1, k) + dp(i + 1, k - 1) * v[i] % mod) % mod; } long long calc(int p) { deep[p] = 0; for (int i = 1; i <= n; i++) mp[i].clear(); dfs(p, p); long long ret = 0; for (int i = 2; i <= n; i++) { int num = 0; v.clear(); for (auto &x : adj[p]) if (mp[x].find(i) != mp[x].end()) { num++; v.push_back(mp[x][i]); } if (num < k) continue; timer++; sz = (int)(v.size()); ret = (ret + dp(0, k)) % mod; } return ret; } int main() { fact[0] = 1; for (int i = 1; i < N; i++) fact[i] = fact[i - 1] * i % mod; scanf( %d , &T); while (T--) { scanf( %d%d , &n, &k); _clear(); for (int i = 1; i <= n - 1; i++) { int a, b; scanf( %d%d , &a, &b); adj[a].push_back(b); adj[b].push_back(a); } if (k == 2) { printf( %lld n , c(n, 2)); continue; } for (int i = 1; i <= n; i++) ans = (ans + calc(i)) % mod; printf( %lld n , ans); } }
|
#include <bits/stdc++.h> using namespace std; int read() { char c = getchar(); while (c < 0 || c > 9 ) c = getchar(); int x = 0; while (c >= 0 && c <= 9 ) { x = x * 10 + c - 0 ; c = getchar(); } return x; } const int maxn = (1 << 21) + 3; const int INF = 0x3f3f3f3f; struct segtree { int n; int tag[maxn], mmin[maxn]; int ul, ur, uv; void update(int o, int l, int r) { if (ul <= l && ur >= r) { tag[o] = max(tag[o], uv); mmin[o] = max(mmin[o], uv); return; } int mid = (l + r) / 2; if (ul <= mid) update(o * 2, l, mid); if (ur > mid) update(o * 2 + 1, mid + 1, r); mmin[o] = max(min(mmin[o * 2], mmin[o * 2 + 1]), tag[o]); } void modify(int l, int r, int v) { if (l > r) return; ul = l, ur = r, uv = v; update(1, 1, n); } int p, x; int query2(int o, int l, int r) { if (max(tag[o], mmin[o]) >= x) return n + 1; if (l == r) return l; int mid = (l + r) / 2; if (mmin[o * 2] < x) return query2(o * 2, l, mid); else return query2(o * 2 + 1, mid + 1, r); } int query(int o, int l, int r) { if (max(tag[o], mmin[o]) >= x) return n + 1; if (l == r) return l; int mid = (l + r) / 2; if (p > mid) return query(o * 2 + 1, mid + 1, r); else { int ans = query(o * 2, l, mid); if (ans != n + 1) return ans; else return query2(o * 2 + 1, mid + 1, r); } } int query(int p, int x) { if (p > n) return n + 1; this->p = p, this->x = x; return query(1, 1, n); } } t; struct edge { int l, r; bool operator<(const edge& rhs) const { return r < rhs.r; } } e[maxn]; struct query { int id, x, y; bool operator<(const query& rhs) const { return y < rhs.y; } } q[maxn]; int ans[maxn]; void write(int x) { if (x >= 10) write(x / 10); putchar(x % 10 + 0 ); } void writeln(int x) { write(x); putchar( n ); } int main() { int n = t.n = read(), k = read(); for (int i = 1; i <= k; i++) e[i].l = read(), e[i].r = read(); sort(e + 1, e + k + 1); int m = read(); for (int i = 1; i <= m; i++) q[i].id = i, q[i].x = read(), q[i].y = read(); sort(q + 1, q + m + 1); int now = 1; for (int i = 1; i <= m; i++) { while (now <= k && e[now].r <= q[i].y) { t.modify(e[now].l + 1, e[now].r, e[now].l); now++; } ans[q[i].id] = t.query(q[i].x + 1, q[i].x) - 1; } for (int i = 1; i <= m; i++) writeln(ans[i]); }
|
#include <bits/stdc++.h> const int MOD = 1000000007; const int SIZE_N = 2000 + 10; int n; int ary[SIZE_N]; int vis[SIZE_N]; int fac[SIZE_N]; int madd(long long a, long long b) { return (a + b) % MOD; } int mmul(long long a, long long b) { return (a * b) % MOD; } int dp[SIZE_N][SIZE_N], v[SIZE_N][SIZE_N]; int f(int a, int b) { if (v[a][b] == 1) return dp[a][b]; v[a][b] = 1; if (a == 0) return dp[a][b] = fac[b]; if (a == 1) return dp[a][b] = mmul(b, fac[b]); return dp[a][b] = madd(mmul(b, f(a - 1, b)), mmul(a - 1, f(a - 2, b + 1))); } int main(void) { fac[0] = 1; scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %d , ary + i); vis[ary[i]] = 1; fac[i] = mmul(fac[i - 1], i); } int a = 0, b = 0; for (int i = 1; i <= n; ++i) { if (vis[i] == 1) continue; if (ary[i] == -1) ++a; else ++b; } int ans = 0; ans = f(a, b); printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 5; const int M = 1e9 + 7; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; int s, x1, x2, t1, t2, p, d; cin >> s >> x1 >> x2; cin >> t1 >> t2; cin >> p >> d; int ans = t2 * abs(x1 - x2); if (x1 < x2) { if (d == -1) ans = min(ans, (p + x2) * t1); else if (p <= x1) ans = min(ans, (x2 - p) * t1); else ans = min(ans, (s + s - p + x2) * t1); } else { if (d == 1) ans = min(ans, (s + s - p - x2) * t1); else if (p >= x1) ans = min(ans, (p - x2) * t1); else ans = min(ans, (s + p + s - x2) * t1); } cout << ans << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); int t; cin >> t; while ((t--)) { int n; cin >> n; int arr[n]; int diff[n - 1]; for (int i = 0; i < n; i++) { cin >> arr[i]; } int ctr = 0; int min = arr[n - 1]; for (int i = n - 2; i >= 0; i--) { if (min >= arr[i]) { min = arr[i]; } else { ctr++; } } cout << ctr << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long MAX = 1e9; vector<long long> lucky_nums; void generate_lucky(long long n) { if (n > MAX) return; long long n1 = 10 * n + 4; lucky_nums.push_back(n1); generate_lucky(n1); long long n2 = 10 * n + 7; lucky_nums.push_back(n2); generate_lucky(n2); } void solve() { generate_lucky(0); sort(lucky_nums.begin(), lucky_nums.end()); long long l, r; cin >> l >> r; int i = lower_bound(lucky_nums.begin(), lucky_nums.end(), l) - lucky_nums.begin(); long long prev = l, ans = 0; while (lucky_nums[i] < r) { ans += (lucky_nums[i] - prev + 1) * lucky_nums[i]; prev = lucky_nums[i] + 1; i++; } ans += (r - prev + 1) * lucky_nums[i]; cout << ans << endl; } int main() { solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 500005; int n, k; char a[N], b[N]; int main() { scanf( %d%d%s%s , &n, &k, a, b); long long cur = 1, ans = 0; if (k == 1) { cout << n << endl; return 0; } for (int i = 0; i < n; i++) { cur *= 2; if (a[i] != a ) --cur; if (b[i] != b ) --cur; cur = min(cur, k * 1ll); ans += cur; } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int INF = (1 << 30) - 1; const long long oo = (1ll << 62) - 1; const long double PI = 3.1415926535898; const int N = 1000000 + 5; int n, m; vector<int> a[N], e[N]; int num[N], low[N], vt[N], dd[N]; int Time = 0, tpltm = 0; stack<int> s; vector<int> res1, res2; void minimize(int &a, int b) { if (a > b) a = b; } void dfs(int u) { num[u] = low[u] = ++Time; s.push(u); for (int v : a[u]) { if (num[v] == -2) continue; if (num[v] > 0) { minimize(low[u], num[v]); } else { dfs(v); minimize(low[u], low[v]); } } if (low[u] >= num[u]) { tpltm += 1; int v; do { v = s.top(); s.pop(); vt[v] = tpltm; num[v] = -2; } while (v != u); } } void solve() { cin >> n >> m; for (int i = 1; i <= n; i++) a[i].clear(); for (int i = 1; i <= m; i++) { int u, v; cin >> u >> v; if (u == v) continue; a[u].push_back(v); } Time = 0; tpltm = 0; while (s.size()) s.pop(); for (int i = 1; i <= n; i++) num[i] = 0; for (int i = 1; i <= n; i++) { if (num[i]) continue; dfs(i); } if (tpltm <= 1) { cout << No << n ; return; } for (int i = 1; i <= tpltm; i++) e[i].clear(); for (int u = 1; u <= n; u++) { for (int v : a[u]) { if (vt[u] == vt[v]) continue; e[vt[u]].push_back(vt[v]); } } int gt = INF, dinh = 0; for (int i = 1; i <= tpltm; i++) { if (e[i].size() < gt) { gt = e[i].size(); dinh = i; } } res1.clear(); res2.clear(); for (int i = 1; i <= n; i++) { if (vt[i] == dinh) { res1.push_back(i); } else res2.push_back(i); } if (res1.size() == 0 || res2.size() == 0) { cout << No << n ; return; } cout << Yes << n ; cout << res1.size() << << res2.size() << n ; for (int i = 0; i < res1.size(); i++) cout << res1[i] << ; cout << n ; for (int i = 0; i < res2.size(); i++) cout << res2[i] << ; cout << n ; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); int t; cin >> t; for (int i = 1; i <= t; i++) solve(); }
|
#include <bits/stdc++.h> using namespace std; const int MAX = 505; long long l1[MAX], l2[MAX], r1[MAX], r2[MAX], a1[MAX], a2[MAX]; int main() { ios::sync_with_stdio(0); cin.tie(0); int q; cin >> q; for (int i = 0; i < q; ++i) { cin >> l1[i] >> r1[i] >> l2[i] >> r2[i]; } for (int i = 0; i < q; ++i) { a1[i] = l1[i], a2[i] = l2[i]; while (a1[i] == a2[i] && a2[i] <= r2[i]) { a2[i]++; } cout << a1[i] << << a2[i] << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; const int M = 1000000000; const int INF = 1e18; int a[N], b[N], s1[N], s2[N]; int n, m, k, d, top1, top2, ansr, ansl, sum[N], pos[N], t[N], mn[N]; map<int, int> mp; void reset(int x) { mn[x] = INF; for (int i = (x - 1) * m + 1; i <= min(n, x * m); i++) mn[x] = min(mn[x], t[i] + sum[x]); } inline void add(int l, int r, int c) { for (int i = l; i <= min(r, pos[l] * m); i++) t[i] += c; reset(pos[l]); if (pos[l] != pos[r]) { for (int i = (pos[r] - 1) * m + 1; i <= min(n, r); i++) t[i] += c; reset(pos[r]); } for (int i = pos[l] + 1; i <= pos[r] - 1; i++) sum[i] += c, mn[i] += c; } inline int query(int l, int r, int c) { for (int i = r; i >= max((pos[r] - 1) * m + 1, l); i--) if (t[i] + sum[pos[i]] <= c) { return i; } for (int i = pos[r] - 1; i >= pos[l] + 1; i--) if (mn[i] <= c) for (int j = i * m; j >= (i - 1) * m + 1; j--) if (t[j] + sum[pos[j]] <= c) { return j; } if (pos[l] != pos[r]) { for (int i = pos[l] * m; i >= l; i--) { if (t[i] + sum[pos[i]] <= c) return i; } } } inline void sol(int L, int R) { if (L == R) return; mp.clear(); int r = R + 1; top1 = top2 = 0; s1[top1] = s2[top2] = R + 1; for (int i = 0; i <= pos[n]; i++) sum[i] = 0; for (int i = R; i >= L; i--) { if (mp.count(a[i])) r = min(r, mp[a[i]]); while (top1 && a[i] > a[s1[top1]]) { add(s1[top1], s1[top1 - 1] - 1, -a[s1[top1]]); top1--; } s1[++top1] = i; add(s1[top1], s1[top1 - 1] - 1, a[s1[top1]]); while (top2 && a[i] < a[s2[top2]]) { add(s2[top2], s2[top2 - 1] - 1, a[s2[top2]]); top2--; } s2[++top2] = i; add(s2[top2], s2[top2 - 1] - 1, -a[s2[top2]]); int rr = query(i, r - 1, k - i); if (rr - i > ansr - ansl || (rr - i == ansr - ansl && i < ansl)) ansl = i, ansr = rr; mp[a[i]] = i; } return; } int main() { scanf( %d%d%d , &n, &k, &d); if (d == 0) { for (int i = 1; i <= n; i++) scanf( %d , &a[i]); int ansl = 1; int ansr = 1; int lst = 1; for (int i = 2; i <= n; i++) { if (a[i] != a[lst]) { if (i - 1 - lst > ansr - ansl) { ansl = lst; ansr = i - 1; } lst = i; } } printf( %d %d n , ansl, ansr); return 0; } ansl = n + 1; ansr = 0; m = sqrt(n); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); b[i] = (a[i] += M) % d; a[i] = (a[i]) / d + 1; pos[i] = (i - 1) / m + 1; t[i] = -i; } for (int i = 1, j; i <= n; i = j) { for (j = i + 1; j <= n; j++) { if (b[i] != b[j]) break; } sol(i, j - 1); } printf( %d %d n , ansl, ansr); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long n, p[200005]; int pn; int main() { scanf( %I64d , &n); n *= 2; for (int k = 0; k < 60; ++k) { long long a = (1LL << (k + 1)) - 3; long long l = 0, r = 2000000000; if (a > 1) r = min(r, n / a + 1); while (r - l > 1) { long long x = (r + l) / 2; if (x * x + a * x <= n) l = x; else r = x; } if (l % 2 == 1 && l * l + a * l == n) p[pn++] = (l << k); } if (pn == 0) { puts( -1 ); exit(0); } sort(p, p + pn); for (int i = 0; i < pn; ++i) printf( %I64d n , p[i]); return 0; }
|
#include <bits/stdc++.h> using namespace std; char s[200010], t[200010]; string ans; void solve() { int n = strlen(s), x = 0; for (int i = 0; i < n; i++) { if (i) ans += + ; if (i < n - 1 && rand() % 2 == 0) { ans += (s[i]), ans += s[++i]; x += 10 * (s[i - 1] - 0 ) + s[i] - 0 ; } else { ans += (s[i]); x += s[i] - 0 ; } } ans += n ; sprintf(s, %d , x); } int main() { srand(time(0)); scanf( %s%s , s, t); while (1) { strcpy(s, t); ans = ; solve(); solve(); solve(); if (strlen(s) == 1) return cout << ans, 0; } }
|
#include <bits/stdc++.h> namespace fastIO { static const int IN_BUF = 1 << 23, OUT_BUF = 1 << 23; char buf[IN_BUF], *ps = buf, *pt = buf; inline char my_getchar() { return ps == pt && (pt = (ps = buf) + fread(buf, 1, IN_BUF, stdin), ps == pt) ? EOF : *ps++; } template <typename T> inline bool read(T &x) { char op = 0, ch = my_getchar(); for (x = 0; !isdigit(ch) && ch != EOF; ch = my_getchar()) if (ch == - ) op ^= 1; if (ch == EOF) return false; for (; isdigit(ch); ch = my_getchar()) x = x * 10 + (ch ^ 0 ); if (ch != . ) return op ? x = -x : 0, true; else ch = my_getchar(); T t = 1; for (; isdigit(ch); ch = my_getchar()) t /= 10, x += (ch ^ 0 ) * t; return op ? x = -x : 0, true; } inline int reads(char *s) { int n = 0; char ch = my_getchar(); for (; isspace(ch) && ch != EOF; ch = my_getchar()) ; for (; !isspace(ch) && ch != EOF; ch = my_getchar()) s[n++] = ch; return s[n] = 0 , n; } char pbuf[OUT_BUF], *pp = pbuf; struct _flusher { ~_flusher() { fwrite(pbuf, 1, pp - pbuf, stdout); } } OutputFlusher; inline void my_putchar(char x) { pp == pbuf + OUT_BUF ? fwrite(pbuf, 1, OUT_BUF, stdout), pp = pbuf : 0, *pp++ = x; } template <typename T> inline void print_(T x) { if (x == 0) return my_putchar( 0 ), void(0); std::vector<int> num; for (x < 0 ? my_putchar( - ), x = -x : 0; x; x /= 10) num.push_back(x % 10); while (!num.empty()) my_putchar(num.back() ^ 0 ), num.pop_back(); } template <typename T> inline void print(T x, char ch = n ) { print_(x), my_putchar(ch); } inline void prints_(const char *s, int n = -1) { if (n == -1) n = strlen(s); for (register int i = 0; i < n; ++i) my_putchar(s[i]); } inline void prints(const char *s, int n = -1, char ch = n ) { prints_(s, n), my_putchar(ch); } template <typename T> inline void printd_(T x, int n) { if (x < 0) x = -x, my_putchar( - ); long long a, b; for (register int i = 0; i < n; ++i) x *= 10; x = (long long)(x + 0.5); for (register int i = 0; i < n; ++i) x /= 10; a = x, x -= a; for (register int i = 0; i < n; ++i) x *= 10; b = x; print_(a); if (n) my_putchar( . ); else return; std::vector<int> num(n); for (register int i = 0; i < n; ++i) num[i] = b % 10, b /= 10; while (!num.empty()) my_putchar(num.back() ^ 0 ), num.pop_back(); } template <typename T> inline void printd(T x, int n, char ch = n ) { printd_(x, n), my_putchar(ch); } } // namespace fastIO using namespace fastIO; const int N = 200005; int n, p[N], c[N], vis[N]; int solve(std::vector<int> &a) { std::vector<int> d; int l = a.size(); for (register int i = 1; 1ll * i * i <= l; ++i) if (l % i == 0) { d.push_back(i); if (i * i < l) d.push_back(l / i); } std::sort(d.begin(), d.end()); for (int k : d) { for (register int i = 0; i < k; ++i) { bool flag = 1; for (register int j = i; j < l; j += k) flag &= a[j] == a[i]; if (flag) return k; } } return l; } void solve() { read(n); for (register int i = 1; i <= n; ++i) read(p[i]), vis[i] = 0; for (register int i = 1; i <= n; ++i) read(c[i]); int ans = n; for (register int i = 1; i <= n; ++i) if (!vis[i]) { std::vector<int> tmp; tmp.push_back(c[i]), vis[i] = 1; for (register int j = p[i]; j != i; j = p[j]) tmp.push_back(c[j]), vis[j] = 1; ans = std::min(ans, solve(tmp)); } print(ans); } int main() { int T = 1; read(T); while (T--) solve(); }
|
#include <bits/stdc++.h> using namespace std; int p[1001][1001], row[1001], col[1001]; int main() { int n, m, k; scanf( %d%d%d , &n, &m, &k); for (int r = 1; r <= n; ++r) row[r] = r; for (int c = 1; c <= m; ++c) col[c] = c; for (int r = 1; r <= n; ++r) for (int c = 1; c <= m; ++c) scanf( %d , &p[r][c]); while (k--) { char s[2]; int x, y; scanf( %s%d%d , s, &x, &y); switch (s[0]) { case r : swap(row[x], row[y]); break; case c : swap(col[x], col[y]); break; case g : printf( %d n , p[row[x]][col[y]]); break; default: break; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; bool ok = false, a[5][5]; int u[5]; string p, maxs; int pol(char s) { if (s == A ) return 1; if (s == B ) return 2; if (s == C ) return 3; } string pol2(int s) { if (s == 1) return A ; if (s == 2) return B ; if (s == 3) return C ; } void dfs(int v) { if (ok) return; u[v] = 1; for (int i = 1; i <= 3; i++) if (a[v][i] && u[i] == 0) dfs(i); else if (a[v][i] && u[i] == 1) ok = true; u[v] = 2; p = p + pol2(v); } int main() { string s; for (int i = 1; i <= 3; i++) { cin >> s; if (s[1] == > ) a[pol(s[0])][pol(s[2])] = 1; else a[pol(s[2])][pol(s[0])] = 1; } for (int i = 1; i <= 3; i++) { for (int j = 1; j <= 3; j++) u[j] = 0; p = ; dfs(i); if (p.size() > maxs.size()) maxs = p; } if (ok) cout << Impossible ; else cout << maxs; return 0; }
|
#include <bits/stdc++.h> using namespace std; unsigned int seed; unsigned int getrand() { seed ^= seed << 13; seed ^= seed >> 17; seed ^= seed << 5; return seed; } int get() { char ch; while (ch = getchar(), (ch < 0 || ch > 9 ) && ch != - ) ; if (ch == - ) { int s = 0; while (ch = getchar(), ch >= 0 && ch <= 9 ) s = s * 10 + ch - 0 ; return -s; } int s = ch - 0 ; while (ch = getchar(), ch >= 0 && ch <= 9 ) s = s * 10 + ch - 0 ; return s; } const int N = 2e5 + 5; int n; int fa[N * 2]; struct node { int l, r, tot; long long sum, sumv; unsigned int key; int val; } tree[N]; int lef[N], rig[N]; int rt[N * 2]; long long ans; int tot; int getfather(int x) { return fa[x] == x ? x : fa[x] = getfather(fa[x]); } void update_ans(int x, long long v) { ans = ans + v * (tree[rt[x]].sum + tree[rt[x]].sumv * (lef[x] - 1)); } void update(int now) { int l = tree[now].l, r = tree[now].r; tree[now].tot = tree[l].tot + tree[r].tot + 1; tree[now].sumv = tree[l].sumv + tree[r].sumv + tree[now].val; tree[now].sum = tree[l].sum + 1ll * tree[now].val * (tree[l].tot + 1) + tree[r].sum + tree[r].sumv * (tree[l].tot + 1); } pair<int, int> split(int now, int v) { if (!now) return make_pair(0, 0); if (tree[now].val > v) { pair<int, int> u = split(tree[now].r, v); tree[now].r = u.first; update(now); return make_pair(now, u.second); } pair<int, int> u = split(tree[now].l, v); tree[now].l = u.second; update(now); return make_pair(u.first, now); } int merge(int x, int y) { if (!x || !y) return x | y; if (tree[x].key < tree[y].key) { tree[x].r = merge(tree[x].r, y); update(x); return x; } tree[y].l = merge(x, tree[y].l); update(y); return y; } void add(int x, int v, int id = 0) { if (!id) update_ans(x, -1); pair<int, int> u = split(rt[x], v); int t = id; if (!id) t = ++tot; tree[t].l = tree[t].r = 0; tree[t].sum = tree[t].val = tree[t].sumv = v; tree[t].tot = 1; tree[t].key = getrand(); rt[x] = merge(u.first, merge(t, u.second)); if (!id) update_ans(x, 1); } int que[N]; int id[N]; int k; void getque(int now) { if (!now) return; getque(tree[now].l); que[++k] = tree[now].val; id[k] = now; getque(tree[now].r); } void Merge(int x, int y) { update_ans(x, -1); update_ans(y, -1); if (tree[rt[x]].tot < tree[rt[y]].tot) { k = 0; getque(rt[x]); for (int i = 1; i <= k; i++) add(y, que[i], id[i]); lef[y] = lef[x]; fa[x] = y; update_ans(y, 1); } else { k = 0; getque(rt[y]); for (int i = 1; i <= k; i++) add(x, que[i], id[i]); rig[x] = rig[y]; fa[y] = x; update_ans(x, 1); } } int main() { seed = 29382343; n = get(); ans = 0; for (int i = 1; i <= n; i++) { int x = get(), v = get(); ans = ans - 1ll * x * v; if (!fa[x]) { fa[x] = x; lef[x] = rig[x] = x; add(x, v); } else { int y = getfather(x); fa[++rig[y]] = y; add(y, v); } int y = getfather(x); if (fa[rig[y] + 1]) Merge(y, getfather(rig[y] + 1)); y = getfather(y); if (fa[lef[y] - 1]) Merge(getfather(lef[y] - 1), y); printf( %I64d n , ans); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 69; const int MAXP = 2e6 + 69; int n, q; int val[MAXN]; vector<int> a[MAXN]; int check[MAXP]; vector<int> p; void build() { for (long long i = 2; i < MAXP; i++) { if (check[i] == 0) { p.push_back(i); check[i] = i; for (long long j = i * i; j < MAXP; j += i) { if (check[j] == 0) check[j] = i; } } } } int ans[MAXN]; int h[MAXN]; vector<int> prim[MAXP]; void ptich(int i) { int x = val[i]; while (check[x] != 0) { int t = check[x]; if (!prim[t].empty()) { int u = prim[t].back(); if (h[u] > h[ans[i]]) { ans[i] = u; } } prim[t].push_back(i); while (x % t == 0) x /= t; } } void xoa(int i) { int x = val[i]; while (check[x] != 0) { int t = check[x]; prim[t].pop_back(); while (x % t == 0) x /= t; } } void dfs(int x, int p) { h[x] = h[p] + 1; ptich(x); for (int u : a[x]) { if (u == p) continue; dfs(u, x); } xoa(x); } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); build(); cin >> n >> q; for (int i = 1; i <= n; i++) cin >> val[i]; for (int i = 1; i < n; i++) { int x, y; cin >> x >> y; a[x].push_back(y); a[y].push_back(x); } dfs(1, 1); while (q--) { int type; cin >> type; if (type == 2) { for (int i = 1; i <= n; i++) ans[i] = 0, h[i] = 0; for (int i = 1; i < MAXP; i++) prim[i].clear(); int x, y; cin >> x >> y; val[x] = y; dfs(1, 1); } else { int x; cin >> x; if (ans[x] != 0) cout << ans[x] << n ; else cout << -1 << n ; } } }
|
#include <bits/stdc++.h> using namespace std; int main() { int v_1, v_2, v_3, v_m, m_1, m_2, m_3; cin >> v_1 >> v_2 >> v_3 >> v_m; if (v_m >= v_2 || v_m < v_2 && v_m > v_3 && 2 * v_3 < v_m || v_m <= v_3 && 2 * v_m < v_3) { cout << -1; return 0; } cout << 2 * v_1 << n << 2 * v_2 << n ; if (v_m > v_3) { cout << v_m; } else cout << v_3; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int MN = 1000010; int exp(int x, int n) { int ret = 1; while (n) { if (n & 1) ret = 1LL * ret * x % mod; x = 1LL * x * x % mod; n >>= 1; } return ret; } int inv(int x) { return exp(x, mod - 2); } int fact[MN], invf[MN]; int K, W, ans; int main() { fact[0] = 1; for (int i = 1; i < MN; i++) { fact[i] = 1LL * fact[i - 1] * i % mod; } for (int i = 0; i < MN; i++) { invf[i] = inv(fact[i]); } cin >> K >> W; for (int i = 1; i <= min(K, W - 1); i++) { ans += 1LL * i * fact[K] % mod * fact[K] % mod * exp(K, W - 1 - i) % mod * invf[K - i] % mod * invf[K - i] % mod; ans %= mod; } for (int i = W; i <= K; i++) { ans += 1LL * W * fact[K] % mod * fact[K - i + W - 1] % mod * invf[K - i] % mod * invf[K - i] % mod; ans %= mod; } for (int i = 1; i <= min(K - 1, W - 2); i++) { ans += 1LL * i * fact[K] % mod * fact[K] % mod * exp(K, W - 2 - i) % mod * invf[K - i] % mod * invf[K - i - 1] % mod; ans %= mod; } for (int i = W - 1; i <= K - 1; i++) { ans += 1LL * (W - 1) * fact[K] % mod * fact[K - i + W - 2] % mod * invf[K - i] % mod * invf[K - i - 1] % mod; ans %= mod; } cout << ans; }
|
#include <bits/stdc++.h> using namespace std; const long long int inf = 9e18; const long double pi = 2 * acos(0.0); long long int arr[100005]; void solve() { long long int n, k; cin >> n >> k; ; for (int i = 0; i < n; i++) cin >> arr[i]; ; long long int mn = inf, pos = 0; for (long long int i = 0; i < n; ++i) { if (arr[i] < mn) { mn = arr[i]; pos = i; } } long long int ans = 0; for (long long int i = 0; i < n; ++i) { if (i == pos) continue; long long int t = abs(k - arr[i]); ans += (t / mn); } cout << ans << n ; return; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long int tc = 1; cin >> tc; while (tc--) { solve(); } }
|
#include <bits/stdc++.h> using namespace std; string s; vector<vector<int> > a[28]; vector<int> t, v1, v2; int ans = 1e9; void gen(int ind) { if (ind == 3) { a[t[0] + t[1] + t[2]].push_back(t); return; } for (int i = 0; i <= 9; i++) { t.push_back(i); gen(ind + 1); t.pop_back(); } } int dif(vector<int> aa, vector<int> bb) { int ret = 0; for (int i = 0; i < aa.size(); i++) ret += (aa[i] != bb[i]); return ret; } int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); cin >> s; v1.push_back(s[0] - 0 ); v1.push_back(s[1] - 0 ); v1.push_back(s[2] - 0 ); v2.push_back(s[3] - 0 ); v2.push_back(s[4] - 0 ); v2.push_back(s[5] - 0 ); gen(0); for (int i = 0; i <= 27; i++) for (int j = 0; j < a[i].size(); j++) for (int k = 0; k < a[i].size(); k++) ans = min(ans, dif(v1, a[i][j]) + dif(v2, a[i][k])); cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; struct trie { trie* child[2]; int cnt; trie() { child[0] = child[1] = NULL; cnt = 0; } } * root; int n, k, sum; long long res; void add(int val) { trie* node = root; for (int i = 29; i >= 0; i--) { int j = (val >> i) & 1; if (!node->child[j]) node->child[j] = new trie; node = node->child[j]; node->cnt++; } } void get(trie* node, int i, int val, int remain) { if (i == -1) return; if (remain > (1 << (i + 1)) - 1) return; int j = (val >> i) & 1; if (node->child[j ^ 1]) { if ((1 << i) >= remain) res += node->child[j ^ 1]->cnt; else get(node->child[j ^ 1], i - 1, val, remain - (1 << i)); } if (node->child[j]) get(node->child[j], i - 1, val, remain); } int main(int argc, char const* argv[]) { ios ::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> k; root = new trie; add(0); for (int i = 1; i <= n; i++) { int a; cin >> a; sum ^= a; get(root, 29, sum, k); add(sum); } cout << res; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long n, k, A[1000100], A2[1000010], N; int main() { cin >> n >> k; for (int i = 1; i <= n; i++) { cin >> A[i]; } N = n; long long cumsum = 0; for (int i = 2, rank = 2; i <= n; i++) { long long cumsum2 = cumsum + (rank - 2) * A2[rank - 1]; long long d = cumsum2 - (rank - 1) * (N - rank) * A[i]; if (d < k) { cout << i << endl; N--; } else { A2[rank] = A[i]; rank++; cumsum = cumsum2; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; map<int, int> vis; string s[1000009]; int n, m, i; bool dfs(int x, int y) { if (x == n - 1 && y == m - 1) return true; if (x < 0 || y < 0 || x >= n || y >= m || vis[y + x * m] == 1 || s[x][y] == # ) return false; if (x || y) { vis[y + x * m] = 1; } return dfs(x + 1, y) || dfs(x, y + 1); } int main() { cin >> n >> m; for (i = 0; i < n; i++) cin >> s[i]; if (dfs(0, 0) == false) { cout << 0 ; return 0; } if (dfs(0, 0) == false) { cout << 1 ; return 0; } cout << 2 ; }
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.