func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> const int inf = 1e7 + 7; long long mod = 1e9 + 7; const double eps = 1e-9; using namespace std; int num[1000005]; char s[1000005]; int main() { cin >> s; int len = strlen(s); num[len] = 0; for (int i = len - 1; i >= 0; i--) { if (s[i] == 0 ) num[i] = num[i + 1] - 1; else { num[i] = num[i + 1] + 1; if (num[i] > 0) { num[i] = 0; s[i] = 0 ; } } } cout << s << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, a, b, x, r; int main() { for (cin >> n >> a >> b, r = n; x * a <= n; x++) r = min(r, (n - x * a) % (5 * b)); cout << r; }
|
#include <bits/stdc++.h> using namespace std; typedef long double ld; const long double PI = 3.141592653589793238462643383279502884197169399375105820974944; long long mod = 1e9 + 7; const long long inf = 1e18; const long long maxn = 3e5 + 5; void solve() { long long n, k; cin >> n >> k; vector<pair<long long, pair<long long, long long>>> v(n); for (long long i = 0; i < n; i++) { cin >> v[i].first >> v[i].second.first; v[i].second.second = i + 1; } sort((v).begin(), (v).end()); multiset<pair<long long, long long>> s; vector<long long> ans; for (auto i : v) { while (!s.empty() && (*s.begin()).first < i.first) s.erase(s.begin()); while ((long long)((s).size()) > k) { auto it = --s.end(); ans.push_back((*it).second); s.erase(it); } if ((long long)((s).size()) == k) { auto it = --s.end(); if ((*it).first >= i.second.first) { ans.push_back((*it).second); s.erase(it); s.insert({i.second.first, i.second.second}); } else ans.push_back(i.second.second); } else s.insert({i.second.first, i.second.second}); } cout << (long long)((ans).size()) << n ; for (auto i : ans) cout << i << ; } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long tc = 1; while (tc--) { solve(); cout << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int inf = ~0U >> 1; const int N = 1005; int a[N][N]; int dp[N][N][2]; int d[] = {2, 5}; void print(int x, int y, int z) { if (x == 0 && y == 0) return; if (x == 0 || y && dp[x - 1][y][z] > dp[x][y - 1][z]) { print(x, y - 1, z); cout << R ; } else { print(x - 1, y, z); cout << D ; } } int main() { int n; cin >> n; int zx = -1, zy = -1; for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) { cin >> a[i][j]; if (a[i][j] == 0) { zx = i; zy = j; } } for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) for (int k = 0; k < 2; ++k) { if (i == 0 && j == 0) dp[i][j][k] = 0; else if (i == 0) dp[i][j][k] = dp[i][j - 1][k]; else if (j == 0) dp[i][j][k] = dp[i - 1][j][k]; else dp[i][j][k] = min(dp[i][j - 1][k], dp[i - 1][j][k]); if (a[i][j] == 0) dp[i][j][k] = 1; for (int x = a[i][j]; x && x % d[k] == 0; x /= d[k]) dp[i][j][k]++; } int z = dp[n - 1][n - 1][0] > dp[n - 1][n - 1][1]; if (zx != -1 && dp[n - 1][n - 1][z] != 0) { cout << 1 << endl; for (int i = 0; i < zx; i++) cout << D ; for (int i = 0; i < zy; i++) cout << R ; for (int i = zx + 1; i < n; i++) cout << D ; for (int i = zy + 1; i < n; i++) cout << R ; return 0; } cout << dp[n - 1][n - 1][z] << endl; print(n - 1, n - 1, z); }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> a(n + 1); for (int i = 1; i <= n; i++) { cin >> a[i]; } for (int i = 1; i <= n; i++) { if (i == a[a[a[i]]]) { return cout << YES , 0; } } cout << NO ; }
|
#include <bits/stdc++.h> using namespace std; int T, N, P, ap[109][109]; int main() { scanf( %d , &T); while (T--) { scanf( %d %d , &N, &P), P += 2 * N; for (int df = 1; df < N && P; df++) for (int i = 0; i < N && P; i++) ap[i][(i + df) % N] = 1, P--; for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) if (ap[i][j]) printf( %d %d n , i + 1, j + 1); for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) ap[i][j] = 0; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n; int main() { int s = 0, i; cin >> n; while (n != 0) { s = 0; for (i = 0;; ++i) { s += (1 << i); if (s >= n) break; } if (s == n) { cout << i + 1 << ; n -= (1 << i); } else { cout << i + 1 << ; n -= (1 << i); } } cout << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int a1, a2; cin >> a1 >> a2; int res = 0; while (a1 && a2 && (a1 > 1 || a2 > 1)) { if (a1 > a2) swap(a1, a2); ++a1; a2 -= 2; ++res; } cout << res << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long mod = 1e9 + 7; long long fact[1100000]; void find_fact() { fact[0] = fact[1] = 1; for (int i = 2; i <= 1e6; i++) fact[i] = (i * fact[i - 1]) % mod; } bool isvalid(long long num, int num1, int num2) { while (num > 0) { int cval = (num % 10); if ((cval != num1) && (cval != num2)) return 0; num = (num / 10); } return 1; } long long my_exp(int base, int exp) { if (exp == 0) return 1; if (exp == 1) return base; long long ans = my_exp(base, exp / 2); ans = (ans * ans) % mod; if (exp % 2) ans = (ans * base) % mod; return ans; } long long my_comb(int n, int i) { return (fact[n] * my_exp((fact[i] * fact[n - i]) % mod, mod - 2)) % mod; } int main() { find_fact(); int num1, num2, n; cin >> num1 >> num2 >> n; long long csm, ans = 0; for (int i = 0; i <= n; i++) { csm = (i * num1 + (n - i) * num2); if (isvalid(csm, num1, num2)) ans = (ans + my_comb(n, i)) % mod; } cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; template <class A, class B> inline bool mina(A &first, B second) { return (first > second) ? (first = second, 1) : 0; } template <class A, class B> inline bool maxa(A &first, B second) { return (first < second) ? (first = second, 1) : 0; } const int MAXN = 2e5 + 5; int N, K, A, B, Q; int total[MAXN]; class SegmentTree { public: typedef struct segment_st { int numa, numb; int l, r; } TreeNode; vector<TreeNode> tree; int N; int tree_size; vector<int> leaves; SegmentTree(int n) { build_tree(n); } int query(int ll, int rr, int limit) { return query(1, ll, rr, limit); } void update(int at, int val) { internal_update(at, val); } private: void initialize_node(int at) { tree[at].numa = 0; tree[at].numb = 0; } void update_up(int at) { int left = at + at; int right = at + at + 1; tree[at].numa = tree[left].numa + tree[right].numa; tree[at].numb = tree[left].numb + tree[right].numb; } void update_result(int &res, int val) { res += val; } void update_leaf_value(int at, int &val, int d) { tree[at].numa = min(A, total[d]); tree[at].numb = min(B, total[d]); } int query(int at, int ll, int rr, int limit) { if (ll > tree[at].r || rr < tree[at].l) return 0; if (ll <= tree[at].l && tree[at].r <= rr) { if (limit == 0) { return tree[at].numb; } else { return tree[at].numa; } } else { int res = 0; update_result(res, query(at + at, ll, rr, limit)); update_result(res, query(at + at + 1, ll, rr, limit)); return res; } } void internal_update(int at, int &val) { int tmp = at; at = leaves[at]; update_leaf_value(at, val, tmp); at >>= 1; while (at) { update_up(at); at >>= 1; } } void build_tree(int n) { N = n; int base = 1; while (base < N) base <<= 1; tree_size = base << 1; leaves.resize(N + 1); tree = vector<TreeNode>(tree_size); init(1, 1, n); } void init(int at, int ll, int rr) { tree[at].l = ll; tree[at].r = rr; initialize_node(at); if (ll == rr) { leaves[ll] = at; } else { int mid = (tree[at].l + tree[at].r) >> 1; init(at + at, tree[at].l, mid); init(at + at + 1, mid + 1, tree[at].r); update_up(at); } } }; int main() { scanf( %d %d %d %d %d , &N, &K, &A, &B, &Q); SegmentTree tree(N); int c; for (int(i) = 0; (i) < (Q); ++(i)) { scanf( %d , &c); if (c == 1) { int d, a; scanf( %d %d , &d, &a); total[d] += a; tree.update(d, a); } else { int p; scanf( %d , &p); int res = 0; if (p - 1 >= 1) res += tree.query(1, p - 1, 0); p += K; if (p <= N) res += tree.query(p, N, 1); printf( %d n , res); } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int a, b; int ans = 0; cin >> a >> b; ans += a; while (a >= b) { ans += (a / b); a = (a / b) + (a % b); } cout << ans; }
|
#include <bits/stdc++.h> using namespace std; long long mx, my, w; map<double, int> a, b; int rev(long long x) { long long ret = 0; while (x) { ret *= 10; ret += x % 10; x /= 10; } return ret; } long long get(long long x, long long y) { a.clear(); for (long long i = 1; i <= y; ++i) { double tmp = 1.0 * rev(i) / i; a[tmp]++; } long long ret = 0; for (long long i = 1; i <= x; ++i) { double tmp = 1.0 * i / rev(i); ret += a[tmp]; } return ret; } int main() { cin >> mx >> my >> w; if (get(mx, my) < w) { puts( -1 ); return 0; } int nx = mx, ny = 1, ax = mx, ay = my; long long now = get(nx, ny); a.clear(); for (long long i = 1; i <= nx; ++i) { a[1.0 * i / rev(i)]++; } b.clear(); for (long long i = 1; i <= ny; ++i) { b[1.0 * rev(i) / i]++; } while (nx >= 1 && ny <= my) { if (now < w) { ny++; double tmp = 1.0 * rev(ny) / ny; now += a[tmp]; b[tmp]++; } else { if (1ll * nx * ny < 1ll * ax * ay) { ax = nx; ay = ny; } double tmp = 1.0 * nx / rev(nx); nx--; now -= b[tmp]; a[tmp]--; } } cout << ax << << ay << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; void solve() { int n; cin >> n; int a, b, c; cin >> a >> b >> c; string s; cin >> s; vector<int> brr[26]; int p1 = R - A ; int p2 = P - A ; int p3 = S - A ; for (int i = 0; i < s.size(); ++i) { brr[s[i] - A ].emplace_back(i); } string ans; for (int i = 0; i < n; ++i) { ans += * ; } int cnt = 0; while (brr[p1].size()) { if (b == 0) break; ans[brr[p1].back()] = P ; brr[p1].pop_back(); --b; ++cnt; } while (brr[p2].size()) { if (c == 0) break; ans[brr[p2].back()] = S ; brr[p2].pop_back(); --c; ++cnt; } while (brr[p3].size()) { if (a == 0) break; ans[brr[p3].back()] = R ; brr[p3].pop_back(); --a; ++cnt; } int half = ceil(n / 2.0); if (cnt >= half) { for (int i = 0; i < ans.size(); ++i) { if (ans[i] == * ) { if (a > 0) ans[i] = R , --a; else if (b > 0) ans[i] = P , --b; else if (c > 0) ans[i] = S , --c; } } assert(a == 0 && b == 0 && c == 0); cout << YES n << ans << n ; } else { cout << NO n ; } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int T; cin >> T; while (T--) { solve(); } }
|
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; int a[30]; bool mark[N]; bool dp[30][1000]; int n; void update() { dp[0][0] = 1; for (int i = 1; i <= n; i++) for (int j = 0; j < 1000; j++) { dp[i][j] = dp[i - 1][j]; if (j >= a[i] && !mark[i]) dp[i][j] |= dp[i - 1][j - a[i]]; } } int main() { ios_base::sync_with_stdio(0); cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; sort(a + 1, a + n + 1); update(); int k = n; for (int i = 1; i <= n; i++) { int t = a[i] - 1; for (int j = i - 1; j >= 1; j--) { if (a[j] != a[i] - 1 && a[j] <= t && !mark[j] && dp[j - 1][t - a[j]]) { update(); mark[j] = 1; t -= a[j]; k--; } } if (t) k = 200; } if (k == 1) cout << YES ; else cout << NO ; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long a[2][2010]; long long b[2010]; int dp[2010][2010][2]; int way[2010][2010][2]; int sz[2]; int r(int p1, int p2, int w) { if ((p1 == sz[0]) && (p2 == sz[1])) return 0; if (dp[p1][p2][w] != -1) return dp[p1][p2][w]; if ((p1 == 0) && (p2 == 0)) { int v1 = r(p1 + 1, p2, 0); int v2 = r(p1, p2 + 1, 1); if (v1 < v2) way[p1][p2][w] = 0; else way[p1][p2][w] = 1; return dp[p1][p2][w] = ((v1 < v2) ? (v1) : (v2)); } long long last; if (w == 0) last = a[0][p1 - 1]; else last = a[1][p2 - 1]; int res1 = 2000000000, res2 = 2000000000; if (p1 != sz[0]) { int t = 0; if (a[0][p1] < last) t = 1; res1 = t + r(p1 + 1, p2, 0); } if (p2 != sz[1]) { int t = 0; if (a[1][p2] < last) t = 1; res2 = t + r(p1, p2 + 1, 1); } if (res1 < res2) way[p1][p2][w] = 0; else way[p1][p2][w] = 1; return dp[p1][p2][w] = ((res1 < res2) ? (res1) : (res2)); } int main() { int it; scanf( %d , &it); for (int i = (0); i < (it); ++i) { scanf( %d , &sz[i]); cin >> a[i][0]; int x, y, m; cin >> x >> y >> m; for (int j = (1); j < (sz[i]); ++j) a[i][j] = (a[i][j - 1] * x + y) % m; } memset(dp, -1, sizeof(dp)); int res = r(0, 0, 0); cout << res << endl; int p1 = 0, p2 = 0, w = 0; while ((p1 < sz[0]) || (p2 < sz[1])) { if (way[p1][p2][w] == 0) { printf( %d 1 n , a[0][p1]); p1++; w = 0; } else { printf( %d 2 n , a[1][p2]); p2++; w = 1; } } return 0; }
|
#include <bits/stdc++.h> const int MAXN = 100 * 1000; int a[MAXN + 10]; int dp[MAXN + 10]; int mx = 0; using namespace std; int main() { long long n, m, k, s = 0; cin >> k >> n >> m; long long shif = (k - (n % k)) % k; n = n + shif; if (m < n) cout << 0 << endl; else cout << (m - n) / k + 1 << endl; }
|
#include <bits/stdc++.h> using namespace std; int a[(1 << 17) + 1]; int tree[4 * (1 << 17)]; void build(int nd, int s, int e, bool ex) { if (s == e) { tree[nd] = a[s]; return; } int mid = (s + e) / 2; int left = 2 * nd; int right = 2 * nd + 1; build(left, s, mid, !ex); build(right, mid + 1, e, !ex); if (ex) { tree[nd] = tree[left] ^ tree[right]; } else { tree[nd] = tree[left] | tree[right]; } } void update(int nd, int s, int e, int p, int v, bool ex) { if (s == e && s == p) { tree[nd] = v; return; } if (e < p || s > p) return; int mid = (s + e) / 2; int left = 2 * nd; int right = 2 * nd + 1; update(left, s, mid, p, v, !ex); update(right, mid + 1, e, p, v, !ex); if (ex) { tree[nd] = tree[left] ^ tree[right]; } else { tree[nd] = tree[left] | tree[right]; } } int main() { int n, m, total; cin >> n >> m; total = (1 << n); for (int i = 1; i <= total; i++) { scanf( %d , a + i); } build(1, 1, total, !(n & 1)); int p, v; while (m--) { scanf( %d %d , &p, &v); update(1, 1, total, p, v, !(n & 1)); cout << tree[1] << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n; string s; queue<int> q[2]; int main() { ios_base::sync_with_stdio(); cin.tie(); cin >> n >> s; for (int i = 0; i < n; i++) { if (s[i] == D ) { q[0].push(i); } if (s[i] == R ) { q[1].push(i); } } while (q[1].size() > 0 && q[0].size() > 0) { int x = q[0].front(); int y = q[1].front(); if (x < y) { q[1].pop(); q[0].pop(); q[0].push(x + n); } else { q[0].pop(); q[1].pop(); q[1].push(y + n); } } if (q[0].size()) { cout << D n ; } else { cout << R n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m, q; pair<int, int> t[300100]; pair<int, int> up[300100]; pair<int, int> down[300100]; pair<int, int> inter(pair<int, int> a, pair<int, int> b) { int f = max(a.first, b.first); int s = min(a.second, b.second); pair<int, int> res = {f, s}; return res; } long long int len(pair<int, int> a) { int res = a.second - a.first; if (res < 0) res = 0; return res; } int main() { cin >> n; for (int i = 0; i < n; i++) cin >> t[i].first >> t[i].second; down[0] = t[0]; up[n - 1] = t[n - 1]; for (int i = 0; i < n - 1; i++) down[i + 1] = inter(down[i], t[i + 1]); for (int i = n - 1; i > 0; i--) up[i - 1] = inter(up[i], t[i - 1]); long long int ma = -1; ma = max(ma, len(up[1])); ma = max(ma, len(down[n - 2])); for (int i = 1; i < n - 1; i++) { long long int a = len(inter(down[i - 1], up[i + 1])); ma = max(ma, a); } cout << ma; return 0; }
|
#include <bits/stdc++.h> using namespace std; int min(int x, int y) { return x < y ? x : y; } int max(int x, int y) { return x > y ? x : y; } void swap(int &x, int &y) { int t; t = x, x = y, y = t; } char s[200000]; int main() { int x, y, i, j, n, k, t; while (~scanf( %d%d , &n, &k)) { if ((k + n - 1) / n == 2) { printf( %d n , n); continue; } for (i = 0;; i++) { t = k - i * 2; if (t == 0) break; if (n - i <= 0) { i--; break; } if ((t) / (n - i) > 2) { break; } } printf( %d n , i); } return 0; }
|
#include <bits/stdc++.h> using namespace std; using ll = long long; const ll inf = INT_MAX - 1; bool check(ll r, ll g, ll b, ll w, ll total) { if (r < 0 || g < 0 || b < 0 || w < 0) { return false; } ll numberIsOne = 0; if (r & 1) { numberIsOne++; } if (g & 1) { numberIsOne++; } if (b & 1) { numberIsOne++; } if (w & 1) { numberIsOne++; } if (numberIsOne == 0 && total % 2 == 0) { return true; } if (total % 2 == 1 && numberIsOne == 1) { return true; } } void solve() { ll r, g, b, w; cin >> r >> g >> b >> w; ll total = r + g + b + w; ll minNum = min(r, min(g, b)); if (check(r, g, b, w, total)) { cout << Yes n ; return; } if (check(r - 1, g - 1, b - 1, w + 3, total)) { cout << Yes n ; return; } if (check(r - 2, g - 2, b - 2, w + 6, total)) { cout << Yes n ; return; } if (check(r - minNum, g - minNum, b - minNum, w + minNum * 3, total)) { cout << Yes n ; return; } cout << No n ; } int main() { ios_base::sync_with_stdio(false); ll t; cin >> t; while (t--) { solve(); } }
|
#include <bits/stdc++.h> using namespace std; const double eps = 1e-7; const long long INFF = 1e18; const int INF = 1e9; const int mod = 1e9 + 7; const int MAX = 2e7 + 7; vector<long long> st1, st2; int main(void) { long long a, b; scanf( %lld %lld , &a, &b); ; long long c = a + b; for (long long i = 1; i <= MAX; ++i) { if (i * i > a) break; if (a % i == 0) st1.push_back(i); } int tp = ((int)st1.size()) - 1; for (int i = tp; i >= 0; --i) st1.push_back(a / st1[i]); for (long long i = 1; i <= MAX; ++i) { if (i * i > b) break; if (b % i == 0) st2.push_back(i); } tp = ((int)st2.size()) - 1; for (int i = tp; i >= 0; --i) st2.push_back(b / st2[i]); long long ans = INFF; for (long long i = 1; i <= MAX; ++i) { if (i * i > c) break; if (c % i == 0) { bool ok = 0; long long n = i, m = c / i; long long n1 = *(--upper_bound((st1).begin(), (st1).end(), n)); if (m >= a / n1) ok = 1; n1 = *(--upper_bound((st1).begin(), (st1).end(), m)); if (n >= a / n1) ok = 1; n1 = *(--upper_bound((st2).begin(), (st2).end(), n)); if (m >= b / n1) ok = 1; n1 = *(--upper_bound((st2).begin(), (st2).end(), m)); if (n >= b / n1) ok = 1; if (ok) ans = min(ans, 2 * (n + m)); } } printf( %lld n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; string second; cin >> second; int mi = 0, gr = 0, le = 0, ans = 0; for (int i = 0; i < second.length(); i++) { if (second[i] == - ) mi++; else if (second[i] == > ) gr++; else le++; } if (mi == n || gr == n || le == n) { cout << n << endl; continue; } if (mi == 0 && gr && le) { cout << 0 << endl; continue; } if ((mi && gr && !le) || (mi && le && !gr)) { cout << n << endl; continue; } for (int i = 0; i < second.length(); i++) { if (second[i] == - || second[(i - 1 + n) % n] == - ) ans++; } cout << ans << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAX = 1e5 + 7; const int MOD = 1e9 + 7; int a[MAX], h[MAX], c[MAX] = {0}; int main() { int n, m, i, j, k, q; scanf( %d %d %d , &n, &k, &m); for (i = 0; i < n; i++) scanf( %d , &a[i]); for (i = 0; i < n; i++) { h[i] = a[i] % m; c[h[i]]++; } for (i = 0; i < m; i++) if (c[i] >= k) break; if (i == m) { printf( No n ); return 0; } printf( Yes n ); j = i, q = 0; for (i = 0; i < n && q < k; i++) { if (h[i] == j) printf( %d , a[i]), q++; } printf( n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long logN = 20; const long long M = 1000000007; const long long INF = 1e12; const long long N = 100005; const long int maxi = 1000000; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long n, m, h1, i, j; cin >> n >> m >> h1; long long a[m]; for (i = 0; i < m; i++) { cin >> a[i]; } long long b[n]; for (i = 0; i < n; i++) { cin >> b[i]; } long long h[n][m], ans[n][m]; for (i = 0; i < n; i++) { for (j = 0; j < m; j++) { cin >> h[i][j]; ans[i][j] = 0; } } for (i = 0; i < m; i++) { if (a[i] > 0) { for (j = 0; j < n; j++) { if (h[j][i] == 1 && a[i] <= b[j]) { ans[j][i] = a[i]; break; } } } } for (i = 0; i < n; i++) { if (b[i] > 0) { for (j = 0; j < m; j++) { if (h[i][j] == 1 && ans[i][j] == 0 && b[i] <= a[j]) { ans[i][j] = b[i]; break; } } } } for (i = 0; i < n; i++) { for (j = 0; j < m; j++) { cout << max(ans[i][j], h[i][j]) << ; } cout << endl; } }
|
#include <bits/stdc++.h> using namespace std; inline int solve(int w, int h, int S) { if (S == (2 * w + 1) * (2 * h + 1)) return 2 * (w + 1) * (h + 1) - 1; if (S > (2 * w + 1) * (2 * h + 1)) return 0; S = (2 * w + 1) * (2 * h + 1) - S; if (S & 3) return 0; S /= 4; int res = 0; for (int w2 = 0; w2 < w; w2++) { if (S % (w - w2)) continue; int h2 = h - S / (w - w2); if (h2 < 0 || h2 >= h) continue; res++; } return 2 * res; } int main() { int W, H, s; while (scanf( %d%d%d , &W, &H, &s) >= 1) { long long ans = 0; for (int w = 0; 2 * w + 1 <= W; w++) { for (int h = 0; 2 * h + 1 <= H; h++) { ans += solve(w, h, s) * (long long)(W - (2 * w + 1) + 1) * (H - (2 * h + 1) + 1); } } printf( %lld n , ans); } return 0; }
|
#include <bits/stdc++.h> using namespace std; map<string, int> mp; int main() { int T[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; string s, t, Ans = , M; int d = 0, m = 0, y = 0, x = 0; cin >> s; for (int i = 0; i <= s.length() - 10; i++) { t = s.substr(i + 6, 4); if (t != 2013 && t != 2014 && t != 2015 ) continue; if (s[i + 2] != - || s[i + 5] != - ) continue; if (s[i + 3] == - || s[i + 4] == - ) continue; if (s[i] == - || s[i + 1] == - ) continue; m = 10 * int(s[i + 3] - 0 ) + int(s[i + 4] - 0 ); d = 10 * int(s[i] - 0 ) + int(s[i + 1] - 0 ); if (m > 12 || d > T[m] || d == 0) continue; M = s.substr(i, 10); mp[M]++; if (mp[M] > x) Ans = M, x = mp[M]; } cout << Ans; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long int n; cin >> n; long long int max1 = 0, max2 = 0, min1 = (1000000000 + 9), min2 = (1000000000 + 9); for (int i = 0; i < n; i++) { long long int x, y; cin >> x >> y; if (y < min1) { min1 = y; } if (x > max1) { max1 = x; } } long long int m; cin >> m; for (int i = 0; i < m; i++) { long long int x, y; cin >> x >> y; if (y < min2) { min2 = y; } if (x > max2) { max2 = x; } } long long int x1 = (max1 - min2); long long int x2 = (max2 - min1); long long int x3 = max(x1, x2); if (x3 < 0) { cout << 0 << endl; } else { cout << x3 << endl; } }
|
#include <bits/stdc++.h> using namespace std; bool debug = true; const int dx[] = {0, 1, 0, -1, 1, 1, -1, -1, 0}; const int dy[] = {1, 0, -1, 0, -1, 1, 1, -1, 0}; template <typename X> inline X square(const X& a) { return a * a; } int scan_d() { bool minus = false; int result = 0; char ch; ch = getchar(); while (true) { if (ch == - ) break; if (ch >= 0 && ch <= 9 ) break; ch = getchar(); } if (ch == - ) minus = true; else result = ch - 0 ; while (true) { ch = getchar(); if (ch < 0 || ch > 9 ) break; result = (result << 3) + (result << 1) + (ch - 0 ); } if (minus) return -result; else return result; } long scan_ld() { bool minus = false; long result = 0; char ch; ch = getchar(); while (true) { if (ch == - ) break; if (ch >= 0 && ch <= 9 ) break; ch = getchar(); } if (ch == - ) minus = true; else result = ch - 0 ; while (true) { ch = getchar(); if (ch < 0 || ch > 9 ) break; result = (result << 3) + (result << 1) + (ch - 0 ); } if (minus) return -result; else return result; } long long scan_lld() { bool minus = false; long long result = 0; char ch; ch = getchar(); while (true) { if (ch == - ) break; if (ch >= 0 && ch <= 9 ) break; ch = getchar(); } if (ch == - ) minus = true; else result = ch - 0 ; while (true) { ch = getchar(); if (ch < 0 || ch > 9 ) break; result = (result << 3) + (result << 1) + (ch - 0 ); } if (minus) return -result; else return result; } long long unsigned scan_llu() { long long unsigned result = 0; char ch; ch = getchar(); while (true) { if (ch == - ) break; if (ch >= 0 && ch <= 9 ) break; ch = getchar(); } result = ch - 0 ; while (true) { ch = getchar(); if (ch < 0 || ch > 9 ) break; result = (result << 3) + (result << 1) + (ch - 0 ); } return result; } void print_d(int n) { if (n < 0) { n = -n; putchar( - ); } int i = 10; char output_buffer[10]; do { output_buffer[--i] = (n % 10) + 0 ; n /= 10; } while (n); do { putchar(output_buffer[i]); } while (++i < 10); } void print_ld(long n) { if (n < 0) { n = -n; putchar( - ); } int i = 11; char output_buffer[11]; do { output_buffer[--i] = (n % 10) + 0 ; n /= 10; } while (n); do { putchar(output_buffer[i]); } while (++i < 11); } void print_lld(long long n) { if (n < 0) { n = -n; putchar( - ); } int i = 21; char output_buffer[21]; do { output_buffer[--i] = (n % 10) + 0 ; n /= 10; } while (n); do { putchar(output_buffer[i]); } while (++i < 21); } void print_llu(long long unsigned n) { int i = 21; char output_buffer[21]; do { output_buffer[--i] = (n % 10) + 0 ; n /= 10; } while (n); do { putchar(output_buffer[i]); } while (++i < 21); } void println_d(int n) { if (n < 0) { n = -n; putchar( - ); } int i = 10; char output_buffer[11]; output_buffer[10] = n ; do { output_buffer[--i] = (n % 10) + 0 ; n /= 10; } while (n); do { putchar(output_buffer[i]); } while (++i < 11); } void println_ld(long n) { if (n < 0) { n = -n; putchar( - ); } int i = 11; char output_buffer[12]; output_buffer[11] = n ; do { output_buffer[--i] = (n % 10) + 0 ; n /= 10; } while (n); do { putchar(output_buffer[i]); } while (++i < 12); } void println_lld(long long n) { if (n < 0) { n = -n; putchar( - ); } int i = 21; char output_buffer[22]; output_buffer[21] = n ; do { output_buffer[--i] = (n % 10) + 0 ; n /= 10; } while (n); do { putchar(output_buffer[i]); } while (++i < 22); } void println_llu(long long unsigned n) { int i = 21; char output_buffer[22]; output_buffer[21] = n ; do { output_buffer[--i] = (n % 10) + 0 ; n /= 10; } while (n); do { putchar(output_buffer[i]); } while (++i < 22); } char sp; void printsp_d(int n) { if (n < 0) { n = -n; putchar( - ); } int i = 10; char output_buffer[11]; output_buffer[10] = sp; do { output_buffer[--i] = (n % 10) + 0 ; n /= 10; } while (n); do { putchar(output_buffer[i]); } while (++i < 11); } void printsp_ld(long n) { if (n < 0) { n = -n; putchar( - ); } int i = 11; char output_buffer[12]; output_buffer[11] = sp; do { output_buffer[--i] = (n % 10) + 0 ; n /= 10; } while (n); do { putchar(output_buffer[i]); } while (++i < 12); } void printsp_lld(long long n) { if (n < 0) { n = -n; putchar( - ); } int i = 21; char output_buffer[22]; output_buffer[21] = sp; do { output_buffer[--i] = (n % 10) + 0 ; n /= 10; } while (n); do { putchar(output_buffer[i]); } while (++i < 22); } void printsp_llu(long long unsigned n) { int i = 21; char output_buffer[22]; output_buffer[21] = sp; do { output_buffer[--i] = (n % 10) + 0 ; n /= 10; } while (n); do { putchar(output_buffer[i]); } while (++i < 22); } long long cal[100005][15], dp[105][105][15]; vector<pair<int, int> > ind; int main() { int n, q, c, j, i, x, y, x1, x2, y1, y2, t; long long ans = 0; n = scan_d(); q = scan_d(); c = scan_d(); for (i = 0; i < n; i++) { x = scan_d(); y = scan_d(); t = scan_d(); cal[i][0] = t; dp[x][y][0] += t; ind.push_back(make_pair(x, y)); } for (i = 1; i <= c + 3; i++) { for (j = 0; j < n; j++) { cal[j][i] = (cal[j][i - 1] + 1) % (c + 1); dp[ind[j].first][ind[j].second][i] += (cal[j][i]); } } for (t = 0; t <= c + 3; t++) { for (i = 1; i <= 100; i++) { for (j = 1; j <= 100; j++) { dp[i][j][t] += dp[i][j - 1][t]; } } } while (q--) { ans = 0; t = scan_d(); x1 = scan_d(); y1 = scan_d(); x2 = scan_d(); y2 = scan_d(); if (y1 > y2) swap(y1, y2); if (x1 > x2) swap(x1, x2); t %= (c + 1); for (i = x1; i <= x2; i++) { ans += (dp[i][y2][t] - dp[i][y1 - 1][t]); } println_lld(ans); } return 0; }
|
#include <bits/stdc++.h> using namespace std; #pragma warning(disable : 4996) #pragma comment(linker, /STACK:20000007 ) #pragma GCC optimize( unroll-loops ) const int N = (int)1e6 + 100; const int maxn = (int)1e3 + 100; const int base = (int)1e9; const int mod = (int)1e9 + 7; const int inf = INT_MAX; const long long ll_inf = LLONG_MAX; const long double PI = acos((long double)-1.0); const long double eps = 1e-8; void solve() { int n, s; scanf( %d%d , &n, &s); vector<int> P(n); for (int i = 0; i < n; ++i) { scanf( %d , &P[i]); } multiset<int> S; for (int i = 0; i < n; ++i) { S.insert(P[i]); } map<int, int> C; for (int i = 0; i < n; ++i) { C[P[i]]++; } int ans = 0; --s; if (P[s]) { C[P[s]]--; S.erase(S.find(P[s])); C[0]++; ++ans; P[s] = 0; } ans += C[0] - 1; int have = C[0] - 1; S.erase(0); int now = 1; while (!S.empty() && now <= *(--S.end())) { if (S.find(now) != S.end()) ; else if (have) --have; else { ++ans; S.erase(--S.end()); } ++now; } printf( %d n , ans); } int main() { int T = 1; for (; T; --T) solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long int det(long long int a, long long int b, int bit) { if (!bit) { if (a & 1) return a; if (b & 1) return b; return a; } if (a & (1ll << bit)) return det(a, b, bit - 1); if (!(b & (1ll << bit))) return det(a, b, bit - 1); if ((b & ((1ll << (bit + 1)) - 1)) == ((1ll << (bit + 1)) - 1)) return b; return ((a & (~((1ll << bit) - 1))) | ((1ll << bit) - 1)); } int main() { int n = 0; cin >> n; long long int a = 0, b = 0; while (n--) { cin >> a >> b; cout << det(a, b, 60) << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1005; int n, m, b[N][N], a[N][N]; void solve() { if (n % 2) { printf( %d n , n); return; } bool ok = 1; while (n > 1 && ok && n % 2 == 0) { for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (b[i][j] != b[n - i - 1][j]) { ok = 0; break; } } } if (ok) n /= 2; } printf( %d n , n); } int main() { ios::sync_with_stdio(false); scanf( %d %d , &n, &m); for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) scanf( %d , &b[i][j]); solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int day[4][48] = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; int a[30]; int main() { int n; cin >> n; int k = 1, vis_28, vis_29; vis_28 = vis_29 = 0; for (int i = 0; i < n; i++) { cin >> a[i]; } if (vis_28) k = 0; int flag = 0, x = 0, tmp; for (int k = 0; k < 4; k++) { while (x < 36) { if (day[k][x] == a[0]) { int i; for (i = 0; i < n; i++) { if (a[i] != day[k][(x + i) % 36]) break; } if (i == n) { flag = 1; break; } } x++; } } if (flag) cout << Yes n ; else cout << No n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int inf = (int)1e9; const int mod = inf + 7; const double eps = 1e-9; const double pi = acos(-1.0); int n, t; int a[100100], cur = 0, all; int binpow(int a, int k) { if (k == 0) return 1; int ans = binpow(a, k / 2); ans = 1ll * ans * ans % mod; if (k % 2) ans = 1ll * ans * a % mod; return ans; } int main() { cin >> n; int bad = 0; for (int i = 1; i < 4; i++) { for (int j = 1; j < 4; j++) { for (int k = 1; k < 4; k++) { if (i + j + k == 6) bad++; } } } bad = binpow(bad, n); all = binpow(3, 3 * n); all -= bad; all %= mod; all += mod; all %= mod; cout << all << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long ceilVal(long long a, long long b) { long long sum = a / b; if (a % b) return ++sum; return sum; } int main() { long long a, n, m; scanf( %lld%lld%lld , &n, &m, &a); long long sum = 0; sum = ceilVal(n, a) * ceilVal(m, a); printf( %lld , sum); return 0; }
|
#include <bits/stdc++.h> using namespace std; void p(vector<int> a) { int x = 0; for (int y : a) { if (x) printf( ); printf( %d , y); x = 1; } puts( ); } int main() { int n; cin >> n; if (n % 2 == 0) return !printf( -1 n ); vector<int> a, b, c; for (int i = 0; i < n; ++i) a.emplace_back(i), b.emplace_back(i); for (int i = 0; i < n; ++i) c.emplace_back((a[i] + b[i]) % n); p(a); p(b); p(c); }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, x, y, sum = 0; cin >> n >> x >> y; sum = (n * y) / 100; if ((n * y) % 100 != 0) { sum += 1; } if (sum <= x) cout << 0; else cout << abs(sum - x); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int n; cin >> n; if (n & 1) cout << n / 2 << n ; else { long long int p = 1; for (long long int i = 1; 2 * p <= n; i++) p = 1 << i; cout << (n - p) / 2 << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; template <typename T> T gcd(T a, T b) { while (b > 0) { a %= b; swap(a, b); } return a; } template <class _T> inline _T sqr(const _T& first) { return first * first; } template <class _T> inline string tostr(const _T& a) { ostringstream os( ); os << a; return os.str(); } const long double PI = 3.1415926535897932384626433832795L; const double EPS = 1e-9; char TEMPORARY_CHAR; const int INF = 1e9; inline void input(int& a) { a = 0; while (((TEMPORARY_CHAR = getchar()) > 9 || TEMPORARY_CHAR < 0 ) && (TEMPORARY_CHAR != - )) { } char neg = 0; if (TEMPORARY_CHAR == - ) { neg = 1; TEMPORARY_CHAR = getchar(); } while (TEMPORARY_CHAR <= 9 && TEMPORARY_CHAR >= 0 ) { a = 10 * a + TEMPORARY_CHAR - 0 ; TEMPORARY_CHAR = getchar(); } if (neg) a = -a; } inline void out(long long a) { if (!a) putchar( 0 ); if (a < 0) { putchar( - ); a = -a; } char s[20]; int i; for (i = 0; a; ++i) { s[i] = 0 + a % 10; a /= 10; } for (int j = (i)-1; j >= 0; j--) putchar(s[j]); } inline int nxt() { int(ret); input((ret)); ; return ret; } const int MAXN = 300000; long long powers[MAXN + 1]; struct data { int len; long long data1; long long data2; }; data merge(const data& l, const data& r) { data res; res.len = l.len + r.len; res.data1 = r.data1 + l.data1 * powers[r.len]; res.data2 = l.data2 + r.data2 * powers[l.len]; return res; } int main() { int(n); input((n)); ; int first[n]; powers[0] = 1; for (int i = 1; i <= n; ++i) { powers[i] = powers[i - 1] * 3; } for (int i = 0; i < n; ++i) { first[i] = nxt() - 1; } data t[n + n]; for (int i = 0; i < n; ++i) { t[i + n].len = 1; t[i + n].data1 = t[i + n].data2 = 0; } for (int i = n - 1; i > 0; --i) { t[i] = merge(t[i + i], t[i + i + 1]); } for (int i = 0; i < n; ++i) { t[first[i] + n].data1 = t[first[i] + n].data2 = 1; int pos = first[i] + n; for (pos >>= 1; pos; pos >>= 1) { t[pos] = merge(t[pos + pos], t[pos + pos + 1]); } int r = min(first[i], n - first[i] - 1); data L{0, 0, 0}; data R{0, 0, 0}; int a = first[i] - r, b = first[i] + r; for (a += n, b += n; a <= b; a = (a + 1) >> 1, b = (b - 1) >> 1) { if (a & 1) { L = merge(L, t[a]); } if (!(b & 1)) { R = merge(t[b], R); } } data res = merge(L, R); if (res.data1 != res.data2) { puts( YES ); return 0; } } puts( NO ); return 0; }
|
#include <bits/stdc++.h> using namespace std; template <typename T, typename U> inline void smin(T &a, U b) { if (a > b) a = b; } template <typename T, typename U> inline void smax(T &a, U b) { if (a < b) a = b; } template <class T> inline void gn(T &first) { char c, sg = 0; while (c = getchar(), (c > 9 || c < 0 ) && c != - ) ; for ((c == - ? sg = 1, c = getchar() : 0), first = 0; c >= 0 && c <= 9 ; c = getchar()) first = (first << 1) + (first << 3) + c - 0 ; if (sg) first = -first; } template <class T> inline void print(T first) { if (first < 0) { putchar( - ); return print(-first); } if (first < 10) { putchar( 0 + first); return; } print(first / 10); putchar(first % 10 + 0 ); } template <class T, class T1> inline void gn(T &first, T1 &second) { gn(first); gn(second); } template <class T, class T1, class T2> inline void gn(T &first, T1 &second, T2 &z) { gn(first); gn(second); gn(z); } template <class T> inline void println(T first) { print(first); putchar( n ); } template <class T> inline void printsp(T first) { print(first); putchar( ); } template <class T1, class T2> inline void print(T1 x1, T2 x2) { printsp(x1), println(x2); } template <class T1, class T2, class T3> inline void print(T1 x1, T2 x2, T3 x3) { printsp(x1), printsp(x2), println(x3); } template <class T1, class T2, class T3, class T4> inline void print(T1 x1, T2 x2, T3 x3, T4 x4) { printsp(x1), printsp(x2), printsp(x3), println(x4); } int son[400400][2], pa[400400], sz[400400]; long long sum[400400]; long long ans; struct SplayTree { int root; void init(int first) { root = first; sz[first] = 1; sum[first] = first; } void push_up(int first) { sum[first] = first + sum[son[first][0]] + sum[son[first][1]]; sz[first] = 1 + sz[son[first][0]] + sz[son[first][1]]; } void rot(int first, int d) { int second = pa[first], z = pa[second]; son[second][!d] = son[first][d]; pa[son[first][d]] = second; pa[first] = pa[second]; if (son[z][0] == second) son[z][0] = first; else if (son[z][1] == second) son[z][1] = first; pa[second] = first; son[first][d] = second; push_up(second); } void splay(int first, int g) { while (pa[first] != g) { if (pa[pa[first]] == g) rot(first, son[pa[first]][0] == first); else { int second = pa[first], z = pa[second]; int d = (son[z][0] == second); son[second][d] == first ? rot(first, !d) : rot(second, d); rot(first, d); } } push_up(first); if (g == 0) root = first, pa[first] = 0; } void insert(int first, int second) { if (second < first) { if (son[first][0]) insert(son[first][0], second); else son[first][0] = second, pa[second] = first; } else { if (son[first][1]) insert(son[first][1], second); else son[first][1] = second, pa[second] = first; } push_up(first); } long long insert1(int first, int f) { son[first][0] = son[first][1] = 0; sz[first] = 1; insert(root, first); splay(first, 0); if (!f) return -(long long)first * sz[son[first][0]] + sum[son[first][0]]; return -sum[son[first][1]] + (long long)first * sz[son[first][1]]; } void get(int first, vector<int> &vec) { if (son[first][0]) get(son[first][0], vec); vec.push_back(first); if (son[first][1]) get(son[first][1], vec); } } tree[400400]; int id[400400], pos[400400]; int nxt[400400]; int find_nxt(int u) { return u == nxt[u] ? u : nxt[u] = find_nxt(nxt[u]); } void merge(int u, int v, int f = 0) { if (sz[tree[u].root] < sz[tree[v].root]) swap(u, v), f = 1; vector<int> vec; tree[v].get(tree[v].root, vec); if (!f) reverse(vec.begin(), vec.end()); for (int i = 0; i < vec.size(); i++) { ans += tree[u].insert1(vec[i], f); id[pos[vec[i]]] = u; } } int main() { int n; gn(n); for (int i = 1; i < 400400; i++) nxt[i] = i; for (int i = 1; i <= n; i++) tree[i].init(i); for (int i = 0, a, b; i < n; i++) { gn(a, b); int aa = a; a = find_nxt(a); ans += (long long)(a - aa) * b; pos[b] = a; id[a] = b; nxt[a] = a + 1; if (nxt[a - 1] > a - 1) merge(id[a - 1], id[a]); if (nxt[a + 1] > a + 1) merge(id[a], id[a + 1]); println(ans); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 2007; const int mod = 998244353; template <class I> inline void read(I &x) { int f = 1; char c; for (c = getchar(); c < 0 || c > 9 ; c = getchar()) if (c == - ) f = -1; for (x = 0; c >= 0 && c <= 9 ; x = (x << 3) + (x << 1) + (c & 15), c = getchar()) ; x *= f; } long long ksm(int x, int y) { long long res = 1; while (y) { if (y & 1) res = res * x % mod; y >>= 1; x = 1ll * x * x % mod; } return res; } long long f[2 * N][2 * N][2], jc[N * 2]; int main() { int n, l, k; read(n), read(k), read(l); f[0][0][0] = 1; for (int i = 0; i <= 2 * n; i++) for (int j = 0; j <= i; j++) for (int o = 0; o <= 1; o++) { f[i + 1][j + 1][o] = (f[i + 1][j + 1][o] + f[i][j][o]) % mod; if (o == 0 && j >= k) f[i + 1][j][1] = (f[i + 1][j][1] + f[i][j][o]) % mod; if (j) f[i + 1][j - 1][o] = (f[i + 1][j - 1][o] + f[i][j][o] * j) % mod; } jc[0] = 1; for (int i = 1; i <= 2 * n + 1; i++) jc[i] = jc[i - 1] * i % mod; long long ans = f[2 * n + 1][0][1] * ksm(2, n) % mod * jc[n] % mod * ksm(jc[2 * n + 1], mod - 2) % mod * l % mod; printf( %lld n , ans); return 0; }
|
#include <bits/stdc++.h> long long expow(long long a, long long b, long long p) { long long v = 1; for (; b; b >>= 1, a = a * a % p) if (b & 1) v = v * a % p; return v; } long long inv(long long a, long long p) { return expow(a, p - 2, p); } using namespace std; const int N = 1000 + 11; const int M = 1000000007; struct node { int a, b, c, d, e; } p[N]; node sub(node a, node b) { return (node){a.a - b.a, a.b - b.b, a.c - b.c, a.d - b.d, a.e - b.e}; } double mix(node a, node b) { return 1.0 * a.a * b.a + a.b * b.b + a.c * b.c + a.d * b.d + a.e * b.e; } vector<int> ans; int main() { int k; scanf( %d , &k); for (int i = 0; i < k; i++) { scanf( %d%d%d%d%d , &p[i].a, &p[i].b, &p[i].c, &p[i].d, &p[i].e); } for (int j = 0; j < k; j++) { bool f = false; for (int i = 0; i < k; i++) if (i != j) { for (int l = 0; l < k; l++) if (l != i && l != j) { node cha = sub(p[j], p[i]), cha2 = sub(p[j], p[l]); double ding = mix(cha, cha2), di = sqrt(mix(cha, cha)) * sqrt(mix(cha2, cha2)); double xx = ding / di; if (xx > 0 && xx <= 1) { f = true; break; } } if (f) break; } if (!f) ans.push_back(j + 1); } int sz = ans.size(); printf( %d n , sz); for (int j = 0; j < sz; j++) printf( %d n , ans[j]); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; const int Inf = 0x3f3f3f3f; struct Edge { int id; int u, v, w; Edge(int x = 0, int y = 0, int z = 0) : v(x), w(y), id(z) {} } e[N]; vector<Edge> edges; vector<int> G[N]; int ans[N], fa[N][20], dep[N], st[N][20], used[N], f[N], to[N]; int n, m; void addeage(int u, int v, int w, int id) { edges.push_back(Edge(v, w, id)); int tot = edges.size(); G[u].push_back(tot - 1); } void dfs(int u, int fat) { fa[u][0] = fat; for (int i = 1; i <= 18; ++i) fa[u][i] = fa[fa[u][i - 1]][i - 1], st[u][i] = max(st[u][i - 1], st[fa[u][i - 1]][i - 1]); for (int i = 0; i < G[u].size(); ++i) { Edge e = edges[G[u][i]]; if (e.v == fat) continue; to[e.v] = e.id; st[e.v][0] = e.w; dep[e.v] = dep[u] + 1; dfs(e.v, u); } } int LCA(int u, int v, int& d) { d = 0; if (dep[u] < dep[v]) swap(u, v); int t = dep[u] - dep[v]; for (int i = 0; i <= 18; ++i) if ((1 << i) & t) { d = max(d, st[u][i]); u = fa[u][i]; } if (u == v) return u; for (int i = 18; i >= 0; --i) { if (fa[u][i] != fa[v][i]) { d = max(d, max(st[u][i], st[v][i])); u = fa[u][i]; v = fa[v][i]; } } d = max(d, max(st[u][0], st[v][0])); return fa[u][0]; } int getfa(int u) { return (u == f[u]) ? u : f[u] = getfa(f[u]); } bool cmp(Edge x, Edge y) { return x.w < y.w; } void KrusKal() { int tot = 0; sort(e + 1, e + 1 + m, cmp); for (int i = 1; i <= m; ++i) { int u = e[i].u, v = e[i].v; int u1 = getfa(u), v1 = getfa(v); if (u1 != v1) { f[u1] = v1; used[i] = 1; addeage(u, v, e[i].w, e[i].id); addeage(v, u, e[i].w, e[i].id); tot++; } if (tot == n - 1) break; } } void modify(int u, int v, int d) { u = getfa(u); while (dep[u] > dep[v]) { ans[to[u]] = min(ans[to[u]], d); int y = getfa(fa[u][0]); f[u] = y; u = getfa(u); } } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= m; ++i) { int u, v, w; scanf( %d%d%d , &u, &v, &w); e[i].u = u, e[i].v = v, e[i].w = w, e[i].id = i; } for (int i = 1; i <= n; ++i) f[i] = i; KrusKal(); dfs(1, 1); memset(ans, Inf, sizeof ans); for (int i = 1; i <= n; ++i) f[i] = i; for (int i = 1; i <= m; ++i) { if (used[i]) continue; int u = e[i].u, v = e[i].v; int ffa = LCA(u, v, ans[e[i].id]); ans[e[i].id]--; modify(u, ffa, e[i].w - 1); modify(v, ffa, e[i].w - 1); } for (int i = 1; i <= m; ++i) if (ans[i] == Inf) printf( -1 ); else printf( %d , ans[i]); return 0; }
|
#include <bits/stdc++.h> const int N = 1e5 + 10, M = 26; template <typename T = int> inline T read() { T x = 0, f = 0; char ch = getchar(); while (!isdigit(ch)) f |= ch == - , ch = getchar(); while (isdigit(ch)) x = x * 10 + ch - 0 , ch = getchar(); return f ? -x : x; } char s[N]; int a[N], pre[N][26], suf[N][26], f[N][26], g[N], dp[27]; inline int mex(int a) { int res = 0; while (a >> res & 1) ++res; return res; } inline int solve(int l, int r, int c) { if (l > r) return 0; if (dp[c] != -1) return dp[c]; int sta = 0; for (int i = 0; i < 26; ++i) { int L = suf[l][i], R = pre[r][i]; if (R < L) continue; sta |= 1 << (f[L - 1][c] ^ g[R] ^ g[L] ^ solve(R + 1, r, i)); } return dp[c] = mex(sta); } inline int Solve(int l, int r, int c) { if (l > r) return 0; if (dp[c] != -1) return dp[c]; int sta = 0; for (int i = 0; i < 26; ++i) { int L = suf[l][i], R = pre[r][i]; if (R < L) continue; sta |= 1 << (Solve(l, L - 1, i) ^ g[R] ^ g[L] ^ f[r][i]); } return dp[c] = mex(sta); } int main() { scanf( %s , s + 1); int n = strlen(s + 1); for (int i = 1; i <= n; ++i) a[i] = s[i] - a ; for (int i = 0; i < 26; ++i) suf[n + 1][i] = n + 1; for (int i = 1; i <= n; ++i) memcpy(pre[i], pre[i - 1], sizeof(pre[i])), pre[i][a[i]] = i; for (int i = n; i >= 1; --i) memcpy(suf[i], suf[i + 1], sizeof(suf[i])), suf[i][a[i]] = i; for (int i = 1; i <= n; ++i) { memset(dp, -1, sizeof(dp)), g[i] = g[pre[i - 1][a[i]]] ^ f[i - 1][a[i]]; for (int c = 0; c < 26; ++c) f[i][c] = solve(pre[i][c] + 1, i, c); } for (int q = read(); q; --q) { int l = read(), r = read(); memset(dp, -1, sizeof(dp)); puts(Solve(l, r, 26) ? Alice : Bob ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long power(long long x, long long n) { long long ans = 1; for (int i = 1; i <= n; i++) ans *= x; return ans; } long long gcd(long long x, long long y) { return (x % y == 0) ? y : gcd(y, x % y); } long long n, l, r; int main() { cin >> n >> l >> r; if (n == 1) cout << r - l + 1; else if (n == 2) { cout << (r - l + 1) * (r - l); } else if (n > 30) { cout << 0; } else { long long ans = 0; for (int i = 2; i < r; i++) { int p = i, R = r / power(p, n - 1); if (R == 0) break; for (int j = 1; j < p; j++) { int q = j; int L = (l - 1) / power(q, n - 1) + 1; if (L > R) continue; if (gcd(p, q) == 1) { ans += (R - L + 1); } } } cout << ans * 2 << endl; } }
|
#include <bits/stdc++.h> using namespace std; const int M = 200000 + 10; int a[M]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; } sort(a, a + n); double R_L = 0; double R_R = 0.5 * a[n - 1] - 0.5 * a[0]; int num = 0; double C1, C2, C3; C2 = a[0]; while (num < 200) { double R_M = (R_L + R_R) / 2; double D1 = a[0] + R_M * 2; int ind1 = -1; for (int i = 0; i < n; i++) { if (a[i] > D1) { ind1 = i; break; } } double D2 = R_M * 2; int ind2 = -1; for (int i = n - 1; i >= 0; i--) { if (a[i] + D2 < a[n - 1]) { ind2 = i; break; } } if (ind1 == -1 || ind2 == -1) { R_R = R_M; } else { if (ind1 > ind2) { R_R = R_M; } else { int Dis = a[ind2] - a[ind1]; C2 = 0.5 * (a[ind2] + a[ind1]); if (Dis <= R_M * 2) { R_R = R_M; } else { R_L = R_M; } } } num++; } C1 = a[0] + R_R; C3 = a[n - 1] - R_R; C2 = a[0]; for (int i = 0; i < n; i++) { if (a[i] > a[0] + 2 * R_R) { C2 = a[i] + R_R; break; } } printf( %.10f n , R_R); printf( %.10f %.10f %.10f n , C1, C2, C3); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 100000 + 10; using ll = long long; using pii = pair<int, int>; int pa[maxn]; int sz[maxn]; int d[maxn]; int f[maxn]; vector<ll> pre[maxn]; vector<int> g[maxn], dis[maxn]; map<pii, ll> ans; int find(int p) { return p == pa[p] ? pa[p] : pa[p] = find(pa[p]); } void unionPQ(int p, int q) { int pp = find(p); int pq = find(q); if (pp != pq) { pa[pp] = pq; sz[pq] += sz[pp]; } } int depth, id, root, flag; void dfs(int node, int fa = -1, int h = 0) { if (h > depth) { depth = h; id = node; } if (f[node] < h) f[node] = h; if (flag) dis[root].push_back(f[node]); for (auto v : g[node]) if (v != fa) dfs(v, node, h + 1); } int main() { int n, m, q; scanf( %d%d%d , &n, &m, &q); for (int i = 0; i < n; ++i) { pa[i] = i; sz[i] = 1; } for (int i = 0; i < m; ++i) { int a, b; scanf( %d%d , &a, &b); a--, b--; g[a].push_back(b); g[b].push_back(a); unionPQ(a, b); } for (int i = 0; i < n; ++i) if (i == pa[i]) { flag = false; root = i; depth = 0; id = i; dfs(i); depth = 0; dfs(id); d[i] = depth; flag = true; dfs(id); sort(dis[i].begin(), dis[i].end()); pre[i].resize(1 + sz[i]); pre[i][0] = 0; for (int j = 0; j < sz[i]; ++j) pre[i][j + 1] = pre[i][j] + dis[i][j]; } for (int i = 0; i < q; ++i) { int u, v; scanf( %d%d , &u, &v); u--; v--; u = find(u); v = find(v); if (u == v) { printf( -1 n ); continue; } if (sz[u] > sz[v] || (sz[u] == sz[v] && u > v)) swap(u, v); if (ans.count({u, v})) { printf( %.10f n , (double)ans[{u, v}] / sz[u] / sz[v]); continue; } int maxd = max(d[u], d[v]); ll t = 0; int p = sz[v] - 1; for (int x : dis[u]) { while (p >= 0 && x + 1 + dis[v][p] > maxd) p--; t += (ll)maxd * (p + 1) + (ll)(x + 1) * (sz[v] - p - 1) + pre[v].back() - pre[v][p + 1]; } ans[{u, v}] = t; printf( %.10f n , (double)ans[{u, v}] / sz[u] / sz[v]); } return 0; }
|
#include <bits/stdc++.h> using namespace std; inline void ad(int& x, long long y) { x = (x + y) % 1000000007; } int n, f[40][40][2], t[40], c; int main() { scanf( %d , &n); f[30][0][1] = 1; for (int i = 30; i; --i) for (int j = 0; j <= 30; ++j) { ad(f[i - 1][j][0], f[i][j][0] * (1ll << j) % 1000000007); ad(f[i - 1][j + 1][0], f[i][j][0]); int x = j ? (1 << j - 1) : 1, y = j ? (1 << j - 1) : 0; if ((n >> i - 1) & 1) { ad(f[i - 1][j][0], (long long)x * f[i][j][1] % 1000000007); ad(f[i - 1][j][1], (long long)y * f[i][j][1] % 1000000007); ad(f[i - 1][j + 1][1], f[i][j][1]); } else ad(f[i - 1][j][1], (long long)x * f[i][j][1]); } int A = 0; for (int i = 30; ~i; --i) ad(A, f[0][i][0] + f[0][i][1]); printf( %d n , A); }
|
#include<bits/stdc++.h> using namespace std; long long ans; int d[100005]; int main(){ int t; cin>>t; while(t--){ int n; scanf( %d ,&n); for(int i=1;i<=n;++i)scanf( %d ,&d[i]); sort(d+1,d+1+n); ans=d[n]; for(int i=1;i<=n;++i)ans+=d[i]*(n+1ll-i-i); printf( %lld n ,ans); } }
|
#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { if (b == 0) return a; return gcd(b, a % b); } void solve() { int a, b, n; cin >> a >> b >> n; bool aturn = true; while (n > 0) { int x; if (aturn) { x = gcd(a, n); aturn = false; } else { x = gcd(b, n); aturn = true; } n -= x; } if (aturn == false) cout << 0 << n ; else cout << 1 << n ; } int main(void) { ios_base::sync_with_stdio(false); cin.tie(NULL); solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int read() { int res = 0, f = 1; char c = getchar(); while (!isdigit(c) && c != - ) c = getchar(); if (c == - ) f = -1, c = getchar(); while (isdigit(c)) res = (res << 3) + (res << 1) + (c ^ 48), c = getchar(); return res * f; } const int maxn = 2e5 + 10; int n, k, val[26]; char s[maxn]; int main() { int T = read(); while (T--) { n = read(); k = read(); int ans = 0; scanf( %s , s + 1); for (int i = 1; i <= k / 2; i++) { memset(val, 0, sizeof(val)); for (int j = 0; j < n / k; j++) { val[s[i + j * k] - a ]++; val[s[k - i + 1 + j * k] - a ]++; } int tmp = 0; for (int j = 0; j < 26; j++) tmp = max(tmp, val[j]); ans += n / k * 2 - tmp; } if (k & 1) { memset(val, 0, sizeof(val)); for (int j = 0; j < n / k; j++) { val[s[k / 2 + 1 + j * k] - a ]++; } int tmp = 0; for (int j = 0; j < 26; j++) tmp = max(tmp, val[j]); ans += n / k - tmp; } printf( %d n , ans); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long a, b; while (cin >> a >> b) { long long divi = a - b, cnt = 0; if (a == b) cout << infinity << endl; else { for (long long i = 1; i * i <= divi; i++) { if (divi % i == 0) { long long other = divi / i; if (i > b) cnt++; if (other > b && other != i) cnt++; } } cout << cnt << endl; } } return 0; }
|
#include <bits/stdc++.h> const long long MAX = 300000; const double PI = 3.14159265358979323846; long long T[MAX * 2]; long long ceil_log2(long long n) { long long v = 1; long long log = 0; while (v < n) { v <<= 1; log++; } return log; } std::bitset<64> reverse(std::bitset<64> set, long long bit_count) { for (long long i = 0; i < bit_count / 2; i++) { bool tmp = set[i]; set[i] = set[bit_count - 1 - i]; set[bit_count - 1 - i] = tmp; } return set; } void fft(std::complex<double> *A, long long bit_count, bool inverse = false) { static std::complex<double> W[MAX]; long long N = 1 << bit_count; for (long long i = 0; i < N; i++) { long long j = T[i]; if (i < j) std::swap(A[i], A[j]); } for (long long step = 1; step < N; step <<= 1) { double angle = -PI / step; if (inverse) angle = -angle; std::complex<double> w(1, 0), wn(std::cos(angle), std::sin(angle)); for (long long i = 0; i < step; i++) { W[i] = w; w *= wn; } for (long long start_even = 0; start_even < N; start_even += step * 2) { auto start_odd = start_even + step; for (long long i = 0; i < step; i++) { std::complex<double> U = A[start_even + i]; std::complex<double> V = W[i] * A[start_odd + i]; A[start_even + i] = U + V; A[start_odd + i] = U - V; } } } if (inverse) { for (long long i = 0; i < N; i++) A[i] /= N; } } long long C[MAX]; long long zero_count = 0; long long n, x; long long C_len, bit_count, N; void init() { std::fill(C, C + n + 1, 0); C[0] = 1; C_len = n + 1; bit_count = ceil_log2(C_len * 2); N = 1 << bit_count; for (long long i = 0; i < N; i++) { T[i] = reverse(i, bit_count).to_ullong(); } } void input() { std::cin >> n >> x; init(); long long sum = 0; for (long long i = 0; i < n; i++) { long long v; std::cin >> v; sum += v < x; C[sum]++; } for (long long i = 0; i <= sum; i++) if (C[i] > 1) zero_count += C[i] * (C[i] - 1) / 2; } int main() { input(); std::cout << zero_count << ; static std::complex<double> A[MAX * 2], B[MAX * 2]; std::copy(C, C + C_len, A); std::fill(A + C_len, A + N, 0); std::fill(B, B + 2 * n - C_len, 0); std::reverse_copy(C, C + C_len, B + 2 * n - C_len); std::fill(B + 2 * n, B + N, 0); fft(A, bit_count); fft(B, bit_count); for (long long i = 0; i < N; i++) A[i] *= B[i]; fft(A, bit_count, true); for (long long k = 1; k <= n; k++) std::cout << (long long)std::round(A[2 * n - k - 1].real()) << ; std::cout << std::endl; return 0; for (long long i = 0; i < N; i++) std::cout << A[i] << ; std::cout << std::endl; for (long long i = 0; i < N; i++) std::cout << B[i] << ; std::cout << std::endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MOD = 998244353; int add_MOD(int a, int b) { a += b; if (a >= MOD) { return a - MOD; } if (a < 0) { return a + MOD; } return a; } int mul_MOD(int a, int b) { return a * (long long)b % MOD; } const int N = (int)2e5 + 7; int n; int q; int brute[N]; vector<vector<int>> queries; vector<pair<int, int>> segments[N]; vector<bool> is[N]; vector<int> urm[N]; map<int, int> who_l[N]; map<int, int> who_r[N]; map<int, int> id[N]; set<int> changes[N]; struct T { int a; int b; int val; }; T segt[4 * N]; void push(int v, int tl, int tr) { segt[v].val = add_MOD(mul_MOD(tr - tl + 1, segt[v].b), mul_MOD(segt[v].val, segt[v].a)); if (tl < tr) { segt[2 * v].a = mul_MOD(segt[2 * v].a, segt[v].a); segt[2 * v + 1].a = mul_MOD(segt[2 * v + 1].a, segt[v].a); segt[2 * v].b = add_MOD(segt[v].b, mul_MOD(segt[2 * v].b, segt[v].a)); segt[2 * v + 1].b = add_MOD(segt[v].b, mul_MOD(segt[2 * v + 1].b, segt[v].a)); } segt[v].a = 1; segt[v].b = 0; } void add(int v, int tl, int tr, int l, int r) { push(v, tl, tr); if (tr < l || r < tl) { return; } if (l <= tl && tr <= r) { segt[v].b = 1; push(v, tl, tr); return; } int tm = (tl + tr) / 2; add(2 * v, tl, tm, l, r); add(2 * v + 1, tm + 1, tr, l, r); segt[v].val = add_MOD(segt[2 * v].val, segt[2 * v + 1].val); } void mult(int v, int tl, int tr, int l, int r) { push(v, tl, tr); if (tr < l || r < tl) { return; } if (l <= tl && tr <= r) { segt[v].a = 2; push(v, tl, tr); return; } int tm = (tl + tr) / 2; mult(2 * v, tl, tm, l, r); mult(2 * v + 1, tm + 1, tr, l, r); segt[v].val = add_MOD(segt[2 * v].val, segt[2 * v + 1].val); } int get(int v, int tl, int tr, int l, int r) { push(v, tl, tr); if (tr < l || r < tl) { return 0; } if (l <= tl && tr <= r) { return segt[v].val; } else { int tm = (tl + tr) / 2; return add_MOD(get(2 * v, tl, tm, l, r), get(2 * v + 1, tm + 1, tr, l, r)); } } void add_brute(int l, int r) { add(1, 1, n, l, r); return; for (int i = l; i <= r; i++) { brute[i] = add_MOD(brute[i], 1); } } void mult_brute(int l, int r) { mult(1, 1, n, l, r); return; for (int i = l; i <= r; i++) { brute[i] = mul_MOD(brute[i], 2); } } int get_brute(int l, int r) { return get(1, 1, n, l, r); int sol = 0; for (int i = l; i <= r; i++) { sol = add_MOD(sol, brute[i]); } return sol; } void add(int l, int r, int x) { int p = who_l[x][l]; int p2 = who_r[x][r]; while (p <= p2) { if (is[x][p]) { int until = urm[x][p]; if (until > p2) { until = p2; } mult_brute(segments[x][p].first, segments[x][until].second); int ant_p = p; p = urm[x][p] + 1; urm[x][ant_p] = max(urm[x][ant_p], p2); } else { is[x][p] = 1; add_brute(segments[x][p].first, segments[x][p].second); urm[x][p] = p2; p++; } } } int main() { ios::sync_with_stdio(0); cin.tie(0); for (int i = 0; i < 4 * N; i++) { segt[i].a = 1; } cin >> n >> q; for (int i = 1; i <= q; i++) { int t, l, r; cin >> t >> l >> r; if (t == 1) { int x; cin >> x; queries.push_back({l, r, x}); changes[x].insert(l); changes[x].insert(r + 1); } else { queries.push_back({l, r}); } } for (int x = 1; x <= n; x++) { changes[x].insert(1); changes[x].insert(n + 1); int j = -1; for (auto &i : changes[x]) { if (j != -1) { segments[x].push_back({j, i - 1}); } j = i; } is[x].resize((int)segments[x].size(), 0); urm[x].resize((int)segments[x].size()); for (int j = 0; j < (int)segments[x].size(); j++) { who_l[x][segments[x][j].first] = j; who_r[x][segments[x][j].second] = j; } } for (auto &vec : queries) { if ((int)vec.size() == 3) { add(vec[0], vec[1], vec[2]); } else { cout << get_brute(vec[0], vec[1]) << n ; } } }
|
#include <bits/stdc++.h> #pragma GCC optimize( Ofast,no-stack-protector ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx ) #pragma GCC target( avx,tune=native ) using namespace std; const long long mod = 1e9 + 7; long long w[11]; vector<vector<long long> > mul(vector<vector<long long> >& a, vector<vector<long long> >& b) { vector<vector<long long> > ret(a.size(), vector<long long>(a.size(), 0)); for (long long i = 0; i < a.size(); i++) for (long long j = 0; j < a.size(); j++) ret[i][j] = 0; for (long long i = 0; i < a.size(); i++) { for (long long j = 0; j < a.size(); j++) { for (long long k = 0; k < a.size(); k++) { ret[i][j] += a[i][k] * b[k][j]; ret[i][j] %= mod; } } } return ret; } vector<vector<long long> > Pow(vector<vector<long long> > a, long long k) { vector<vector<long long> > ret = a, m = a; k--; do { if (k & 1) ret = mul(ret, m); m = mul(m, m); } while (k >>= 1); return ret; } long long dp[1 << 7], tdp[1 << 7], pre; void solve(long long x, long long times) { vector<vector<long long> > mat((1 << x), vector<long long>((1 << x), 0)); for (long long st = 0; st < (1 << x); st++) { for (long long ed = 0; ed < (1 << x); ed++) { for (long long bt = 0; bt < (1 << (x - 1)); bt++) { long long add = 1; for (long long j = 0; j < x; j++) { long long cnt = 0; if (bt & (1 << j) || j == x - 1) cnt++; if (j == 0 || (bt & (1 << (j - 1)))) cnt++; if (st & (1 << j)) cnt++; if (ed & (1 << j)) cnt++; if (cnt == 4) add = 0; } if (add) mat[st][ed]++; if (mat[st][ed] >= mod) mat[st][ed] -= mod; } } } mat = Pow(mat, times); memset(tdp, 0, sizeof tdp); long long or_mask = 0; for (long long i = pre; i < x; i++) or_mask |= (1 << i); for (long long i = 0; i < (1 << x); i++) { for (long long j = 0; j < (1 << x); j++) { tdp[j] += dp[i] * mat[i | or_mask][j]; tdp[j] %= mod; } } memcpy(dp, tdp, sizeof tdp); pre = x; } signed main() { for (long long i = 1; i <= 7; i++) cin >> w[i]; for (long long i = 1; i <= 7; i++) { if (w[i]) { dp[(1 << i) - 1] = 1; break; } } for (long long i = 1; i <= 7; i++) { if (w[i]) { solve(i, w[i]); } } for (long long i = 7; i >= 1; i--) { if (w[i]) { cout << dp[(1 << i) - 1] << endl; return 0; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long int mod = 1e9 + 7; long long int dx[] = {0, 0, 1, -1}; long long int dy[] = {1, -1, 0, 0}; long long int m = 0, n, res = 0, k; string s2, ch = , s, t, s1 = ; vector<pair<string, long long int> > vm; vector<pair<pair<long long int, long long int>, long long int> > vvv; vector<pair<long long int, long long int> > vv, vv2; vector<long long int> v[200005], v2, v1; long long int a[500005], vis[500005], dp[500005]; int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); long long int i = 0, x = 0, z = 0, y = 0, j = 0, q, mx = 0, idx = 0, ok = 0, l = 0, r = 0, negatif = 0, positif = 0, l1, r1, p, t, d; set<pair<long long int, long long int> >::iterator itp; cin >> n >> k >> d; for (i = 1; i <= n; i++) { cin >> a[i]; dp[i] = 0; } sort(a + 1, a + 1 + n); dp[0] = 1; dp[1] = -1; for (i = 1; i <= n; i++) { if (!dp[i - 1]) continue; dp[i] += dp[i - 1]; x = a[i] + d; l = i + k - 1; r = upper_bound(a + i, a + 1 + n, x) - a - 1; if (r >= l) { dp[l]++; dp[r + 1]--; } } if (dp[n]) cout << YES ; else cout << NO ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MX = (1 << 20); class Disjoint_Set { public: int sz[MX], P[MX]; int find_(int x) { if (x != P[x]) P[x] = find_(P[x]); return P[x]; } int comp; void init(int N) { for (int j = 1; j <= N; j++) sz[j] = 1, P[j] = j; comp = N; } bool same(int x, int y) { return find_(x) == find_(y); } int compsize(int node) { return sz[find_(node)]; } bool merge_(int x, int y) { int px = find_(x), py = find_(y); if (px == py) return false; if (sz[px] < sz[py]) swap(px, py); P[py] = px; comp--; sz[px] += sz[py]; return true; } } G; int n, m; int main() { scanf( %d %d , &n, &m); if (n != m) { puts( NO ); return 0; } G.init(n); int tt = 0; while (m--) { int a, b; scanf( %d %d , &a, &b); if (!G.merge_(a, b)) tt++; } if (tt == 1) puts( FHTAGN! ); else puts( NO ); }
|
#include <bits/stdc++.h> using namespace std; const int N = 200007; int n, m, q, p[N], a[N], apre[N], lst[N], ppre[N], fa[N], dep[N], w[N], b[N]; vector<int> G[N]; int max(int a, int b) { return a > b ? a : b; } int min(int a, int b) { return a < b ? a : b; } int read() { int x; scanf( %d , &x); return x; } void dfs(int u) { int i, v; b[dep[u]] = u, w[u] = dep[u] >= n ? b[dep[u] - (n - 1)] : m + 1; for (i = G[u].size() - 1; ~i; --i) v = G[u][i], dep[v] = dep[u] + 1, dfs(v); } int main() { n = read(), m = read(), q = read(); int i, j; for (i = 1; i <= n; ++i) p[i] = read(); p[0] = p[n]; for (i = 1; i <= n; ++i) ppre[p[i]] = p[i - 1]; for (i = 1; i <= m; ++i) { a[i] = read(), apre[i] = lst[a[i]], lst[a[i]] = i; for (j = lst[ppre[a[i]]]; j && !fa[j]; j = apre[j]) fa[j] = i; } for (i = 1; i <= m; ++i) fa[i] ? G[fa[i]].push_back(i) : G[0].push_back(i); dfs(0); for (i = m - 1; i; --i) w[i] = min(w[i + 1], w[i]); while (q--) i = read(), j = read(), putchar(48 + (w[i] <= j)); }
|
#include <bits/stdc++.h> using namespace std; const long long MAXN = 1e6; long long a[MAXN], mod = 1e9 + 7, ans; long long power(long long x, long long y) { if (y == 0) return 1; long long mid = power(x, y / 2); if (y % 2 == 1) return mid * mid % mod * x % mod; else return mid * mid % mod; } int main() { int n; cin >> n; bool is = false, is2 = false; for (int i = 0; i < n; i++) { cin >> a[i]; if (a[i] % 2 == 0) is = true; if (a[i] != 1) is2 = true; } for (int i = 0; i < n; i++) { if (i == 0) ans = power(2, a[i]); else ans = power(ans, a[i]); } ans = ans * power(2, mod - 2) % mod; long long ans2 = ans; long long k = -1; if (is) k = 1; ans = (ans + k) * power(3, mod - 2) % mod; cout << ans << / << ans2 << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long int n, i, j = 0, c1 = 0, c0 = 0; string a, b; vector<long long int> v0, v1; cin >> n; cin >> a; cin >> b; for (i = 0; i < n; i++) { if (b[i] == 0 ) { if (a[i] == 1 ) v1.push_back(i); else v0.push_back(i); } if (a[i] == 0 ) c0++; else c1++; } j = v0.size() * c1; j += (v1.size() * c0); j -= (v1.size() * v0.size()); cout << j << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; bool check(long long n, long long s) { long long sum = 0; while (n) { sum += n % 10; n /= 10; } return sum == s; } int main() { long long n, s, rt, ans = -1; cin >> n; for (s = 1; s < 100; s++) { rt = sqrt(s * s + 4 * n); if (rt * rt == s * s + 4 * n) { if ((rt - s) % 2 == 0) { if (check((rt - s) / 2, s)) { if (ans == -1) ans = (rt - s) / 2; else ans = min(ans, (rt - s) / 2); } } } } cout << ans << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; vector<int> e; double best = -1; int main() { int n, u; cin >> n >> u; for (int i = 0; i < n; i++) { int k = 0; cin >> k; e.push_back(k); } int k = 2; for (int j = 1; j < n; j++) { int ej = e[j]; int ei = e[j - 1]; while (k < n && e[k] - ei <= u) { k++; } k--; if (k <= j) { continue; } double value = ((double)(e[k] - ej)) / (e[k] - ei); if (value > best) { best = value; } } cout << setprecision(12) << best; return 0; }
|
#include <bits/stdc++.h> using namespace std; using ll = long long int; using ui = unsigned int; using pii = pair<int, int>; using pll = pair<int, int>; struct fast_ios { fast_ios() { ios::sync_with_stdio(false); cin.tie(NULL); } } fast_ios_; ll u, v, a; int solve() { cin >> u >> v; if (u > v || (v - u) & 1) return puts( -1 ), 0; if (u + v == 0) return puts( 0 ), 0; if (u == v) return printf( 1 n%lld n , u), 0; a = (v - u) / 2; if (u & a) return printf( 3 n%lld %lld %lld n , u, a, a), 0; return printf( 2 n%lld %lld n , u + a, a), 0; } int main() { solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long t, n, m, u, v, q, k; const int N = 3e5 + 500; const int LN = 20; const int SN = 331; const long long mod = 1e9 + 7; const long long INF = 1LL << 57; long long arr[N], brr[N]; string str, ss; vector<int> adj[N]; vector<int> idx[N]; int d[N]; int actuald[N]; bool can[N]; bool vis[N]; void dfs(int v, int p) { if (d[v] == -1) d[v] = 0; vis[v] = true; for (int i = 0; i < adj[v].size(); ++i) { int u = adj[v][i]; if (u == p || vis[u]) continue; dfs(u, v); if (actuald[u] != d[u]) { can[idx[v][i]] = true; actuald[v]++; actuald[u]++; actuald[v] %= 2; actuald[u] %= 2; } } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n >> m; int has = -1, sum = 0; for (int i = 1; i <= n; ++i) { cin >> d[i]; if (d[i] == -1) has = i; else sum += d[i]; } for (int i = 1; i <= m; ++i) { cin >> u >> v; adj[u].push_back(v); adj[v].push_back(u); idx[u].push_back(i); idx[v].push_back(i); } if (sum % 2 == 1 && has == -1) { cout << -1 << n ; return 0; } if (sum % 2 == 1) d[has] = 1; dfs(1, 0); sum = 0; for (int i = 1; i <= m; ++i) { sum += can[i]; } cout << sum << n ; for (int i = 1; i <= m; ++i) { if (can[i]) cout << i << ; } cout << n ; }
|
#include <bits/stdc++.h> using namespace std; const int N = 2000200; bool Ch(int Ans); int n, k; int a[N]; int c[N]; int p[N]; int main() { cin >> n >> k; for (int i = 1; i <= n; i++) scanf( %d , a + i), c[a[i]]++; for (int i = 1; i < N; i++) p[i] = c[i] + p[i - 1]; sort(a + 1, a + n + 1); for (int Ans = a[1]; Ans >= 1; Ans--) if (Ch(Ans)) return cout << Ans, 0; assert(0); } bool Ch(int Ans) { if (Ans <= k + 1) return true; for (int j = Ans + Ans; j <= N; j += Ans) if (p[j - 1] - p[j - Ans + k]) return false; return true; }
|
#include <bits/stdc++.h> using namespace std; vector<int> v; int n, m; int f() { int ans = 0; for (int i = 0; i < n; i++) { int a = 10; for (int j = i; j < n; j++) { for (int k = i; k <= j; k++) a = min(a, v[k]); ans += a; } } return ans; } int main() { cin >> n >> m; for (int i = 1; i <= n; i++) { v.push_back(i); } sort(v.begin(), v.end()); int maxx = 0; do { maxx = max(maxx, f()); } while (next_permutation(v.begin(), v.end())); int k = 0; sort(v.begin(), v.end()); int c = 0; do { if (f() == maxx) c++; if (c == m) { for (auto i : v) cout << i << ; break; } } while (next_permutation(v.begin(), v.end())); cout << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { if (a == 0) return b; return gcd(b % a, a); } long long powmod(long long a, long long b, long long p) { if (b == 0) return 1; if (b == 1) return a; long long temp = powmod(a, b / 2, p); temp *= temp; temp %= p; if (b % 2 == 0) return temp; temp = temp * a; temp %= p; return temp; } void solve() { int n, x, y, d; cin >> n >> x >> y >> d; if (abs(x - y) % d == 0) { cout << abs(x - y) / d << endl; ; return; } long long ans = 1e18; if (abs(y - 1) % d == 0) { ans = (y - 1) / d; ans += (x - 1 + d - 1) / d; } if ((n - y) % d == 0) { long long ans2 = (n - y) / d; ans2 += (n - x + d - 1) / d; ans = min(ans, ans2); } if (ans > 1e10) cout << -1 << endl; else cout << ans << endl; return; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { solve(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long pw(long long x, long long p) { if (p == 0) return 1; long long t = pw(x, p / 2); if (p % 2 == 0) return (t * t) % 1000000007; else return (((t * t) % 1000000007) * x) % 1000000007; } const long long NN = 500007; long long parent[NN], sizee[NN]; void make_set(long long v) { parent[v] = v; sizee[v] = 1; } long long find_set(long long v) { if (v == parent[v]) return v; return parent[v] = find_set(parent[v]); } void union_sets(long long a, long long b) { a = find_set(a); b = find_set(b); if (a != b) { if (sizee[a] < sizee[b]) swap(a, b); parent[b] = a; sizee[a] += sizee[b]; } } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); map<long long, long long> m; long long i, n, M; long long k; cin >> n >> M >> k; long long a[n + 1]; for (i = 1; i <= n; i++) cin >> a[i]; long long x, y, cur = 0, virus, pos; vector<pair<long long, long long> > edges[M + 1]; while (M--) { cin >> x >> y; virus = a[x] ^ a[y]; if (m.find(virus) == m.end()) { m.insert({virus, cur}); cur++; } pos = m.find(virus)->second; edges[pos].push_back({x, y}); } long long siz, comp; long long unsafe = 0, temp; for (i = 0; i < cur; i++) { set<long long> SS; for (auto &x : edges[i]) { make_set(x.first), make_set(x.second); SS.insert(x.first), SS.insert(x.second); } siz = SS.size(); comp = siz; for (auto &x : edges[i]) { if (find_set(x.first) != find_set(x.second)) comp--, union_sets(x.first, x.second); } temp = (pw(2, siz) - pw(2, comp) + 1000000007) % 1000000007; unsafe = (unsafe + (temp * pw(2, n - siz)) % 1000000007) % 1000000007; } cout << ((pw(2, k) * pw(2, n)) % 1000000007 - unsafe + 1000000007) % 1000000007 << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long f, n; long double a, b, ans; while (cin >> a >> b >> n) { long flag = 0, i, j; for (i = -1000; i <= 1000; i++) { ans = 1; f = 0; for (j = 0; j < n; j++) { ans *= i; if (abs(ans) > 1000) { f = 1; break; } } if (!f) if (a * ans == b) { flag = 1; break; } } if (flag) cout << i << endl; else cout << No solution n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; void solve() { int n; cin >> n; vector<int> x(n); for (int i = 0; i < n; i++) cin >> x[i]; vector<int> ans(n + 1); for (int i = 0; i < n; i++) { int dominant = 0; vector<int> m(n + 1); for (int j = i; j < n; j++) { m[x[j]]++; if (m[x[j]] > m[dominant] or (m[x[j]] == m[dominant] and x[j] < dominant)) dominant = x[j]; ans[dominant]++; } } for (int i = 1; i < n + 1; i++) cout << ans[i] << ; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t = 1; while (t--) { solve(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long nax = 105; long long a[nax]; signed main() { long long n, cnt0 = 0, cnt1 = 0; cin >> n; for (long long i = 1; i <= n; i++) { cin >> a[i]; if (a[i] == 0) cnt0++; else cnt1++; } if (cnt0 == n) { cout << 0 << endl; return 0; } else if (cnt1 == n) { cout << 1 << endl; return 0; } long long idx = 0; long long pdt = 1; for (long long i = 1; i <= n; i++) { if (a[i] == 1) { if (idx == 0) idx = i; else { long long temp = idx; pdt *= i - temp; idx = i; } } } cout << pdt << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int n; int y[50010] = {}; int t[50010] = {}; unordered_map<int, int> ha; bool cmp(int x, int y) { return x > y; } bool ff(int x) { ha.clear(); for (int i = 1; i <= n; i++) y[i] = t[i]; for (int i = 1; i <= n; i++) { if (y[i] <= x && ha[y[i]] == 0) { ha[y[i]] = 1; } else { while (1) { if (y[i] == 1) { return 0; } if (ha.find(y[i] / 2) == ha.end() && (y[i] / 2) <= x) { ha[y[i] / 2] = 1; break; } else y[i] = y[i] / 2; } } } return 1; } void ans(int x) { ha.clear(); for (int i = 1; i <= n; i++) y[i] = t[i]; for (int i = 1; i <= n; i++) { if (y[i] <= x && ha[y[i]] == 0) { ha[y[i]] = 1; printf( %d , y[i]); } else { while (1) { if (ha.find(y[i] / 2) == ha.end() && (y[i] / 2) <= x) { ha[y[i] / 2] = 1; break; } else y[i] = y[i] / 2; } printf( %d , y[i] / 2); } } } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &t[i]); sort(t + 1, t + n + 1, cmp); int l = 1; int r = 1000000000; while (l < r) { int mid = (l + r) / 2; if (ff(mid)) r = mid; else l = mid + 1; } ans(l); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n; int m; cin >> n >> m; int arr[n]; for (int i = 0; i < n; i++) { cin >> arr[i]; } map<int, int> freq; freq.clear(); for (int i = 0; i < m; i++) { int curr; cin >> curr; freq[curr]++; } for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) if (arr[j] > arr[j + 1] && freq[j + 1]) { swap(arr[j], arr[j + 1]); } } bool possible = true; for (int i = 0; i < n - 1; i++) { if (arr[i] > arr[i + 1]) { possible = false; break; } } if (possible) { cout << YES << endl; } else { cout << NO << endl; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; void maloosh_lazma() { ios_base::sync_with_stdio(false); cin.tie(NULL); } int main() { maloosh_lazma(); int n, k; cin >> n >> k; string s; cin >> s; int l, ll; char q, qq; for (int i = 0; i < k; i++) { cin >> l >> ll >> q >> qq; --l, --ll; for (int j = l; j <= ll; j++) { if (s[j] == q) s[j] = qq; } } cout << s; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; ; int beauty[n]; for (int asdf = 0; asdf < n; asdf++) { cin >> beauty[asdf]; }; map<int, long long int> occ; long long int most = 0; for (int i = 0; i < n; i++) { int x = i - beauty[i]; if (!occ.count(x)) occ[x] = 0LL; occ[x] = occ[x] + beauty[i]; if (occ[x] > most) most = occ[x]; } cout << most; }
|
#include <bits/stdc++.h> using namespace std; int n, m, i, ii, c; long long xa, xb, xc, xd, mask, a[100100], b[100100]; int main() { scanf( %d%d , &n, &m); for (i = 0; i < n; i++) { scanf( %I64d.%I64d.%I64d.%I64d , &xa, &xb, &xc, &xd); a[i] = (xa << 24) + (xb << 16) + (xc << 8) + xd; } sort(a, a + n); for (ii = 31; ii > 0; ii--) { mask |= 1LL << ii; for (c = i = 0; i < n; i++) { b[i] = a[i] & mask; if (i == 0 || b[i] != b[i - 1]) c++; } if (c == m) { printf( %I64d.%I64d.%I64d.%I64d n , (mask >> 24) & 255, (mask >> 16) & 255, (mask >> 8) & 255, mask & 255); return 0; } } puts( -1 ); return 0; }
|
#include <bits/stdc++.h> using namespace std; const double EPS = 1e-9; const double PI = 3.1415926535897932384626433832795; unsigned long long mod = 1000 * 1000 * 1000 + 7; int INF = 1000 * 1000 * 1000; vector<int> v; class node { public: node() { left = right = NULL; addVal = 0; } int from, to; int minVal, minPos, addVal; node *left, *right; void build(int i, int j) { from = i; to = j; if (i == j) { minVal = v[i]; minPos = i; } else { int mid = (i + j) / 2; if (i <= mid) { left = new node(); left->build(i, mid); } if (mid + 1 <= j) { right = new node(); right->build(mid + 1, j); } if (left->minVal < right->minVal) { minVal = left->minVal; minPos = left->minPos; } else { minVal = right->minVal; minPos = right->minPos; } } } pair<int, int> getMin(int i, int j) { if (i <= from && to <= j) return make_pair(minVal + addVal, minPos); if (i > to || j < from) return make_pair(INF, -1); pair<int, int> r1 = left->getMin(i, j); pair<int, int> r2 = right->getMin(i, j); r1.first += addVal; r2.first += addVal; return min(r1, r2); } void add(int i, int j, int val) { if (i <= from && to <= j) { addVal += val; return; } if (i > to || j < from) return; left->add(i, j, val); right->add(i, j, val); return; } } * root; int main() { int n; cin >> n; v.resize(n); for (int i = 0; i < n; i++) cin >> v[i]; root = new node(); root->build(0, n - 1); queue<pair<int, int> > q; q.push(make_pair(0, n - 1)); vector<pair<int, int> > res; while (!q.empty()) { pair<int, int> top = q.front(); q.pop(); pair<int, int> r = root->getMin(top.first, top.second); for (int i = 0; i < r.first; i++) res.push_back(make_pair(top.first, top.second)); root->add(top.first, top.second, -r.first); if (top.first <= r.second - 1) q.push(make_pair(top.first, r.second - 1)); if (r.second + 1 <= top.second) q.push(make_pair(r.second + 1, top.second)); } cout << res.size() << endl; for (int i = 0; i < res.size(); i++) cout << res[i].first + 1 << << res[i].second + 1 << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; signed main() { ios::sync_with_stdio(false); cin.tie(0); long long t; cin >> t; while (t--) { long long n, a, b; cin >> n >> a >> b; string s; cin >> s; for (long long i = 1; i < s.length() - 1; i++) { if (s[i] == 0 ) { if (s[i + 1] == 1 && s[i - 1] == 1 ) s[i] = 1 ; } } long long c = -1; long long ans = 0; vector<long long> v; for (long long i = 0; i < s.length(); i++) { char ch = s[i]; long long d = 0; while (s[i] == ch && i < s.length()) { i++; d++; } i--; ans += d * a; if (ch == 0 ) ans += (d + 1) * b; else ans += (d + 1) * 2 * b; if (ch == 0 ) v.push_back(d); c++; } ans += c * (a - b); long long p = v.size(); if (p > 2) { for (long long i = 1; i < p - 1; i++) { if (2 * a > b * (v[i] - 1)) { ans -= 2 * a; ans += b * (v[i] - 1); } } } cout << ans << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int N, M; vector<int> P; vector<int> vis; vector<vector<int> > C; vector<int> lab, sz; void getCycle() { vis = vector<int>(N, 0); lab = vector<int>(N, 0); for (int i = 0; i < N; i++) { if (vis[i]) continue; C.push_back(vector<int>()); sz.push_back(0); int u = i; while (!vis[u]) { vis[u] = 1; lab[u] = C.size() - 1; C.back().push_back(u); sz.back()++; u = P[u]; } } } vector<int> tmp; void mrg() { printf( 1 ); for (int i = 1; i < N; i++) { if (lab[i] != lab[0]) { printf( %d , i + 1); tmp.clear(); tmp.push_back(0); for (int j = 1; j < C[lab[i]].size(); j++) { tmp.push_back(C[lab[i]][j]); } tmp.push_back(i); for (int j = 1; j < C[lab[0]].size(); j++) { tmp.push_back(C[lab[0]][j]); } C[lab[i]].clear(); for (int j = 0; j < tmp.size(); j++) { lab[tmp[j]] = lab[0]; } C[lab[0]] = tmp; return; } } } void split() { for (int i = 0; i < N; i++) { if (sz[lab[i]] > 1) { printf( %d , i + 1); int idx = 1; for (int j = 1; j < C[lab[i]].size(); j++) { if (C[lab[i]][idx] > C[lab[i]][j]) { idx = j; } } printf( %d , C[lab[i]][idx] + 1); tmp.clear(); tmp.push_back(C[lab[i]][idx]); for (int j = 1; j < idx; j++) { tmp.push_back(C[lab[i]][j]); } C.push_back(tmp); sz.push_back(tmp.size()); for (int j = 0; j < tmp.size(); j++) lab[tmp[j]] = C.size() - 1; tmp.clear(); for (int j = 0; j < C[lab[i]].size(); j++) { if (lab[C[lab[i]][j]] == lab[i]) { tmp.push_back(C[lab[i]][j]); } } C[lab[i]] = tmp; sz[lab[i]] = tmp.size(); return; } } } int main() { scanf( %d , &N); P.resize(N); for (int i = 0; i < N; i++) { scanf( %d , &P[i]); P[i]--; } getCycle(); scanf( %d , &M); M = N - M; if (C.size() < M) { printf( %d n , M - C.size()); for (int i = C.size(); i < M; i++) split(); } else { printf( %d n , C.size() - M); for (int i = C.size(); i > M; i--) mrg(); } }
|
#include <bits/stdc++.h> using namespace std; int main() { string p; cin >> p; bool yon; for (int i = 0; i < p.length(); i++) { if (p[i] == H || p[i] == Q || p[i] == 9 ) { yon = true; break; } else yon = false; } if (yon) cout << YES << endl; else cout << NO << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; int mod = 1e6 + 3; string mm(char c) { if (c == > ) return 1000 ; if (c == < ) return 1001 ; if (c == + ) return 1010 ; if (c == - ) return 1011 ; if (c == . ) return 1100 ; if (c == , ) return 1101 ; if (c == [ ) return 1110 ; if (c == ] ) return 1111 ; } long long pow2(long long a, long long b, long long c = 0) { c = mod; long long res = 1; a %= c; while (b) { if (b & 1) res = (res * a) % c; a = (a * a) % c; b >>= 1; } return res; } int main() { string tmp; cin >> tmp; string ans = ; for (auto &i : tmp) { ans += mm(i); } int sz = ans.length(); int cnt = 0; long long res = 0; for (int i = sz - 1; i >= 0; i--) { if (ans[i] == 1 ) { res += pow2(2, cnt); res %= mod; } cnt++; } cout << res << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; template <typename T> class Sieve { public: vector<T> primes; vector<bool> is_prime; Sieve(int MAX = 1000000) { is_prime.resize(MAX + 1, true); is_prime[0] = is_prime[1] = false; for (long long int i = 2; i * i <= MAX; i++) if (is_prime[i]) for (long long int j = i * i; j <= MAX; j += i) is_prime[j] = false; for (long long int i = 2; i <= MAX; i++) if (is_prime[i]) primes.push_back(i); } }; template <typename T> vector<vector<T>> matmul(const vector<vector<T>>& a, const vector<vector<T>>& b) { int n = a.size(), m = b[0].size(), k = b.size(); vector<vector<T>> c(n, vector<T>(m)); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { for (int l = 0; l < k; l++) c[i][j] += (a[i][k] * b[k][j]); } } return c; } template <typename T> T extended_euclid(T a, T b, vector<T>& X) { if (b == 0) { X = {1, 0}; return a; } else { T g = extended_euclid(b, a % b, X); vector<vector<T>> G = {{0LL, 1LL}, {1LL, -(a / b)}}; X = matmul<T>(G, X); return g; } } template <typename T> bool isPrime(T n) { if (n <= 1) return false; else if (n == 2 || n == 3) return true; else if (n % 2 == 0 || n % 3 == 0) return false; T x = 5; T p = 2; while (x * x <= n) { if (n % x == 0) return true; x += p; p = 6 - p; } return true; } long long int binpow(long long int x, long long int n, long long int mod = 1000000007) { long long int ans = 1; x = x % mod; while (n >= 1) { if (n & 1) ans = (ans * x) % mod; x = (x * x) % mod; n >>= 1; } return ans; } long long int gcd(long long int a, long long int b) { if (b == 0) return a; else return gcd(b, a % b); } template <typename T> class Graph { public: int n; vector<vector<T>> adj; bool directed; Graph(int n, bool directed = false) { this->n = n; adj.resize(n + 1); this->directed = directed; } void add_edge(int u, int v) { adj[u].push_back(v); if (!directed) adj[v].push_back(u); } void add_edge(int u, int v, int w) { adj[u].push_back({v, w}); if (!directed) adj[v].push_back({u, w}); } }; class DisjointSets { public: int n; vector<int> parent; vector<int> rank; vector<int> sz; DisjointSets(int n, bool Rank = true) { this->n = n; parent.resize(n + 1, 0); (Rank ? rank.resize(n + 1, 1) : sz.resize(n + 1, 1)); } int find(int i) { if (i != parent[i]) parent[i] = find(parent[i]); return parent[i]; } void UnionByRank(int i, int j) { i = find(i); j = find(j); if (i == j) return; if (rank[i] < rank[j]) swap(i, j); parent[j] = i; rank[i] += rank[j]; } void UnionBySize(int i, int j) { i = find(i); j = find(j); if (i == j) return; if (sz[i] < sz[j]) swap(i, j); parent[j] = i; sz[i] += sz[j]; } }; template <typename T> class SegmentTree { public: vector<T> t; int n, H; void init(int n) { this->n = n; t.resize(2 * n); this->H = sizeof(int) * 8 - __builtin_clz(n); } void build() { for (int i = n - 1; i > 0; i--) t[i] = t[i << 1] + t[(i << 1) | 1]; } void update(int pos, T val) { for (t[pos += n] += val; pos > 1; pos >>= 1) t[pos >> 1] = t[pos] + t[pos ^ 1]; } T query(int l, int r) { T res = 0; for (l += n, r += n; l < r; l >>= 1, r >>= 1) { if (l & 1) res += t[l++]; if (r & 1) res += t[--r]; } return res; } }; bool isSubsequenceString(string x, string y) { int i = 0, j = 0; while (i < x.length() && j < y.length()) x[i] == y[j] ? i++, j++ : i++; return (j == y.length()); } int max(int a, int b, int c, int d) { return max(a, max(b, max(c, d))); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n; cin >> n; vector<int> a(n), b(n); for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n; i++) cin >> b[i]; int tx = 0, ty = 0; for (int i = 0; i < n; i++) { if (a[i] == 1 && b[i] == 0) tx++; else if (a[i] == 0 && b[i] == 1) ty++; } if (tx > ty) cout << 1 << n ; else if (tx == 0) cout << -1 n ; else { int dif = (ty + 1); cout << ceil((double)dif / tx); } }
|
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using vl = vector<ll>; using pll = pair<ll, ll>; using vll = vector<pll>; using MAP = map<ll, ll>; using sl = set<ll>; using sll = set<pll>; using MAPs = map<ll, sl>; using MAPv = map<ll, vl>; const ll inf = LLONG_MAX; const ll mod = 1e9 + 7; const ll N = 2e5 + 5; int dx8[] = {0, 1, 1, 1, 0, -1, -1, -1}, dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}; int dx4[] = {0, 1, 0, -1}, dy4[] = {1, 0, -1, 0}; int n, a[N]; void MAIN() { cin >> n; vector<int> v; for (int i = 0; i < n; i++) cin >> a[i], v.push_back(a[i]); sort((v).begin(), (v).end()); int ind1 = 0, ind2 = 0, cnt = 0; for (int i = 0; i < n; i++) { if (a[i] != v[i]) { cnt++; if (!ind1) ind1 = i; else ind2 = i; } } if (cnt > 2) { cout << NO n ; return; } swap(a[ind1], a[ind2]); for (int i = 0; i < n - 1; i++) { if (a[i] > a[i + 1]) { cout << NO n ; return; } } cout << YES n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; int t = 1; while (t-- > 0) { MAIN(); } }
|
#include <bits/stdc++.h> using namespace std; int n, d[128][128][8]; string s; int main() { ios::sync_with_stdio(0); cin >> n >> s; for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) for (int k = 0; k <= 4; k++) { if (s[i - 1] == . ) continue; if (!k) { d[i][j][k] = 1; continue; } if (i >= j) d[i][j][k] |= d[i - j][j][k - 1]; if (k == 4 && d[i][j][k]) { cout << yes << endl; return 0; } } cout << no << endl; }
|
#include <bits/stdc++.h> using namespace std; int a[100100]; int d[100100]; int main() { int n; scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , &a[i]); } for (int i = 0; i <= n; i++) { d[i] = 100100; } d[0] = 0; for (int i = 0; i < n; i++) { int l = 0; int r = n - 1; while (l < r) { int m = (l + r + 1) / 2; if (d[m] > a[i]) { r = m - 1; } else { l = m; } } d[r + 1] = a[i]; } int ans = 0; for (int i = 0; i <= n; i++) { if (d[i] < 100100) { ans = i; } } printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> int main() { int a[10000], b = 1, i, n; for (i = 1; i < 1000; i++) { a[b] = i; if (a[b] >= 100) { a[b + 2] = a[b] % 10; a[b + 1] = a[b] / 10 - a[b] / 100 * 10; a[b] = a[b] / 100; b += 3; } else if (a[b] >= 10) { a[b + 1] = a[b] % 10; a[b] = a[b] / 10; b += 2; } else b++; } scanf( %d , &n); printf( %d , a[n]); }
|
#include <bits/stdc++.h> using ll=long long; #define MOD 1000000007 using namespace std; void calc(double c, double m, double p, double v, double *exp, double prob, int n, int x){ if(x==1){ prob *= p; *exp += prob*n; return; } else if(x>1){ double prob1 = prob; prob1 *= p; *exp += prob1*n; if(c>0){ double prob2 = prob; prob2 *= c; if(c-v>1e-7){ calc(c-v, ((m==0)?(0):(m+(v/2))), ((m==0)?(p+v):(p+(v/2))), v, exp, prob2, n+1, x); } else{ calc(0, ((m==0)?(0):(m+(c/2))), ((m==0)?(p+c):(p+(c/2))), v, exp, prob2, n+1, x-1); } } if(m>0){ double prob3 = prob; prob3 *= m; if(m-v>1e-7){ calc(((c==0)?(0):(c+(v/2))), m-v, ((c==0)?(p+v):(p+(v/2))), v, exp, prob3, n+1, x); } else{ calc(((c==0)?(0):(c+(m/2))), 0, ((c==0)?(p+m):(p+(m/2))), v, exp, prob3, n+1, x-1); } } return; } else return; } void solve() { // Write your solution here double c, m, p, v; cin>>c>>m>>p>>v; double exp = 0.0; int n = 1; int x=3; calc(c, m, p, v, &exp, 1, 1, x); cout<<setprecision(10)<<exp<< n ; return ; } int main() { cin.tie(nullptr)->sync_with_stdio(false); int t = 1; cin >> t; // Comment out if single test case while (t--) { solve(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long n, m; long long sum = 0; int main() { scanf( %lld%lld , &n, &m); long long max_add = (n - 1) * n / 2; long long min_add; if (n % 2) min_add = (n / 2 + 1) * (n / 2); if (n % 2 == 0) { long long a1 = (n / 2 + 1) * (n / 2) / 2; long long a2 = (n / 2 - 1) * (n / 2) / 2; min_add = a1 + a2; } for (int i = 1; i <= m; i++) { long long x, d; scanf( %lld%lld , &x, &d); sum += x * n; if (d >= 0) sum += (long long)d * max_add; else sum += (long long)d * min_add; } double ans = sum / 1.0; ans = ans / n; printf( %.15lf , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 4010; long long O_O[N][N]; const long long mod = 1e9 + 7; int main() { int o_o; memset(O_O, 0, sizeof(O_O)); O_O[0][0] = 1; for (int i = 1; i <= 4000; ++i) { if (i < 4000) o_o = i; else o_o = 4000; for (int j = 1; j <= o_o; ++j) { O_O[i][j] = ((long long)j * O_O[i - 1][j] % mod + O_O[i - 1][j - 1]) % mod; } } int n; cin >> n; long long ans = 0; for (int i = 1; i <= n; i++) { ans = (ans + (O_O[n][i] * i) % mod) % mod; } cout << ans << endl; }
|
#include <bits/stdc++.h> using namespace std; const int N = 17; int n, m, x, y, z, inf; int bin[N], d[N][N], du[N], f[1 << N], q[N]; int main() { for (register int i = 1; i <= 16; ++i) bin[i] = 1 << (i - 1); int sum = 0; scanf( %d , &n); scanf( %d , &m); memset(d, 60, sizeof(d)); inf = d[0][0]; for (register int i = 1; i <= m; ++i) { scanf( %d%d%d , &x, &y, &z); sum += z; du[x]++; du[y]++; d[x][y] = d[y][x] = min(d[x][y], z); } for (register int k = 1; k <= n; ++k) for (register int i = 1; i <= n; ++i) for (register int j = 1; j <= n; ++j) d[i][j] = min(d[i][j], d[i][k] + d[k][j]); for (register int i = 2; i <= n; ++i) if (du[i] && d[1][i] == inf) { puts( -1 ); return 0; } int tot = 0; for (register int i = 1; i <= n; ++i) if (du[i] & 1) q[++tot] = i; int max_statue = bin[tot + 1] - 1; memset(f, 60, sizeof(f)); f[0] = 0; for (register int p = 0; p < max_statue; ++p) { for (register int i = 1; i <= tot; ++i) if (!(bin[i] & p)) { for (register int j = i + 1; j <= tot; ++j) if (!(bin[j] & p)) f[p | bin[i] | bin[j]] = min(f[p | bin[i] | bin[j]], f[p] + d[q[i]][q[j]]); break; } } sum += f[max_statue]; printf( %d n , sum); return 0; }
|
#include <bits/stdc++.h> long long mod = 1000000007; using namespace std; int n, m; long long b; struct node { int money, monitors, pre; vector<int> G; } a[202]; bool cmp(node x, node y) { return x.monitors > y.monitors; } long long dp[2][1 << 20]; int setbit(int x, int pos) { return x | (1 << pos); } bool checkbit(int x, int pos) { return x & (1 << pos); } long long powmod(long long a, long long b) { long long res = 1; a %= mod; for (; b; b >>= 1) { if (b & 1) res = res * a % mod; a = a * a % mod; } return res; } int has[25]; int main() { int i, j, fl, test, index, mask, cnt = 0; scanf( %d%d%lld , &n, &m, &b); for (i = 0; i < n; i++) { scanf( %d%d%d , &a[i].money, &a[i].monitors, &j); while (j--) { scanf( %d , &fl); fl--; a[i].pre = setbit(a[i].pre, fl); a[i].G.push_back(fl); if (has[fl] == 0) { cnt++; has[fl] = 1; } } } if (cnt < m) { printf( -1 n ); return 0; } sort(a, a + n, cmp); int tmask, touse; for (index = n; index >= 0; index--) { for (mask = 0; mask < (1 << m); mask++) { touse = index % 2; if (mask == (1 << m) - 1) { dp[touse][mask] = 0ll; continue; } if (index == n) { dp[touse][mask] = -2; continue; } int i; long long op1, op2 = a[index].money, op3; op1 = dp[(touse + 1) % 2][mask]; if (mask == 0) op2 += a[index].monitors * b; tmask = mask; tmask = tmask | a[index].pre; op3 = dp[(touse + 1) % 2][tmask]; if (op1 == -2 && op3 == -2) dp[touse][mask] = -2; else if (op1 != -2 && op3 != -2) dp[touse][mask] = min(op1, op2 + op3); else if (op1 == -2) dp[touse][mask] = op2 + op3; else dp[touse][mask] = op1; } } long long ans = dp[0][0]; if (ans == -2) printf( -1 n ); else printf( %lld n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; struct Number { array<int, 4> x = {{0, 0, 0, 0}}; Number() {} Number(int a) { if (a != -1) x[a]++; } long double log_value() const { if (x[0] > 0) return -INFINITY; return x[2] * log(2L) + x[3] * log(3L); } int mod() const { long long result = 1; for (int i = 0; i < 4; i++) for (int j = 0; j < x[i]; j++) result = (result * i) % (int)(1e9 + 7); return result; } bool is_zero() const { return x[0] > 0; } }; bool operator<(const Number& a, const Number& b) { return a.log_value() < b.log_value(); } Number operator*(const Number& a, const Number& b) { Number result; for (int i = 0; i < 4; i++) result.x[i] = a.x[i] + b.x[i]; return result; } Number operator/(const Number& a, const Number& b) { Number result; for (int i = 0; i < 4; i++) result.x[i] = a.x[i] - b.x[i]; return result; } template <typename T> using Matrix = vector<vector<T>>; template <typename T> Matrix<T> matrix(int R, int C, T x = T()) { return Matrix<T>(R, vector<T>(C, x)); } struct RangeProduct { int N; Matrix<int> grid; Matrix<Number> hprod; Matrix<Number> vprod; bool valid(int r, int c) { return 0 <= r && r < N && 0 <= c && c < N; } RangeProduct(int N, Matrix<int> grid) : N(N), grid(grid) { hprod = matrix<Number>(N + 1, N + 1); vprod = matrix<Number>(N + 1, N + 1); for (int r = 0; r < N; r++) for (int c = 0; c < N; c++) { hprod[r][c + 1] = hprod[r][c] * Number(grid[r][c]); vprod[r + 1][c] = vprod[r][c] * Number(grid[r][c]); } } Number hquery(int r, int c, int radius) { int c1 = c - radius, c2 = c + radius; if (!valid(r, c1) || !valid(r, c2)) return Number(0); return hprod[r][c2 + 1] / hprod[r][c1]; } Number vquery(int r, int c, int radius) { int r1 = r - radius, r2 = r + radius; if (!valid(r1, c) || !valid(r2, c)) return Number(0); return vprod[r2 + 1][c] / vprod[r1][c]; } Number cross(int r, int c, int radius) { return hquery(r, c, radius) * vquery(r, c, radius) / Number(grid[r][c]); } Number max_cross(int r, int c) { int a = 0, b = N; while (a < b) { int mid = (a + b + 1) / 2; if (cross(r, c, mid).is_zero()) b = mid - 1; else a = mid; } return cross(r, c, a); } }; Number solve(int N, Matrix<int> grid) { RangeProduct rp(N, grid); Number result(0); for (int r = 0; r < N; r++) for (int c = 0; c < N; c++) result = max(result, rp.max_cross(r, c)); return result; } Matrix<int> rotate(int N, const Matrix<int>& grid, int shift) { auto ngrid = matrix<int>(N, N); for (int r = 0; r < N; r++) for (int c = 0; c < N; c++) if ((r + c) % 2 == shift) ngrid[(r + c) / 2][(r - c + N) / 2] = grid[r][c]; return ngrid; } int main() { int N; cin >> N; auto grid = matrix<int>(N, N); for (int i = 0; i < N; i++) { string s; cin >> s; for (int j = 0; j < N; j++) grid[i][j] = s[j] - 0 ; } auto rgrid0 = rotate(N, grid, 0); auto rgrid1 = rotate(N, grid, 1); Number answer = max({solve(N, grid), solve(N, rgrid0), solve(N, rgrid1)}); cout << answer.mod() << endl; }
|
#include <bits/stdc++.h> using namespace std; void solve(); signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long t = 1; cin >> t; while (t--) solve(); } void solve() { long long n; cin >> n; string a, b; cin >> a >> b; string c = a, d = b; sort(c.begin(), c.end()); sort(d.begin(), d.end()); if (c != d) { cout << -1 << n ; return; } long long ans[n], mx = n; for (long long l = 0; l < n; l++) for (long long k = 0; k < n; k++) { ans[l] = n; long long i = l, j = k; while (j != n && b[j] != a[i]) j++; if (j != n) { ans[l]--; i++; j++; } while (i != n && j != n) { while (i != n && j != n && a[i] != b[j]) i++; if (i != n) ans[l]--, j++, i++; } mx = min(ans[l], mx); } cout << mx << n ; }
|
#include <bits/stdc++.h> using namespace std; const int N = 305; int c[N], a[N], d[N]; bool cmp(int first, int second) { if (a[first] != a[second]) return a[first] < a[second]; return first > second; } inline int lowbit(int first) { return first & -first; } int query(int first) { int res = 0; for (int i = first; i; i -= lowbit(i)) res += c[i]; return res; } void modify(int first, int v) { for (int i = first; i < N; i += lowbit(i)) c[i] += v; } int main() { int T; scanf( %d , &T); while (T--) { int n, m; scanf( %d%d , &n, &m); for (int i = 1; i <= m; ++i) scanf( %d , &a[i]), d[i] = i, c[i] = 0; sort(d + 1, d + m + 1, cmp); long long res = 0; for (int i = 1; i <= m; ++i) { res += query(d[i]); modify(d[i], 1); } printf( %lld n , res); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); int n, m, q; cin >> n >> m >> q; vector<vector<pair<int, int>>> pos(n, vector<pair<int, int>>(m)); for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { pos[i][j] = {i, j}; } } vector<vector<int>> val(n, vector<int>(m, 0)); for (int i = 0; i < q; ++i) { int t; cin >> t; if (t == 1) { int r; cin >> r; --r; auto tmp = pos[r][0]; for (int i = 1; i < m; ++i) { pos[r][i - 1] = pos[r][i]; } pos[r][m - 1] = tmp; } else if (t == 2) { int c; cin >> c; --c; auto tmp = pos[0][c]; for (int i = 1; i < n; ++i) { pos[i - 1][c] = pos[i][c]; } pos[n - 1][c] = tmp; } else { int r, c, x; cin >> r >> c >> x; --r, --c; auto p = pos[r][c]; val[p.first][p.second] = x; } } for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { cout << val[i][j] << ; } cout << endl; } }
|
#include <bits/stdc++.h> using namespace std; int N, K; int gru0[] = {0, 1, 2}; int gru1[] = {0, 1, 0, 1, 2}; int grundy(int x) { if (K) { if (x < 5) { return gru1[x]; } else if (x & 1) { return 0; } else { return grundy(x / 2) == 1 ? 2 : 1; } } else { return x <= 2 ? x : !(x & 1); } } int main() { if (fopen( input.txt , r )) { freopen( input.txt , r , stdin); } ios::sync_with_stdio(false); cin >> N >> K; K %= 2; int ans = 0; for (int i = 0, x; i < N; i++) { cin >> x; ans ^= grundy(x); } cout << (ans ? Kevin : Nicky ) << endl; }
|
#include <bits/stdc++.h> using namespace std; int main() { int h, m, n; cin >> h >> m >> n; int* id = new int[n]; int* hash = new int[n]; int* hsh = new int[h]; int nc = 0; int res = 0; char z; int i, j, k, l; for (i = 0; i < h; i++) { hsh[i] = 0; } for (i = 0; i < n; i++) { cin >> z; if (z == + ) { cin >> id[nc] >> hash[nc]; int chash = hash[nc]; while (hsh[chash] == 1) { res++; chash = (chash + m) % h; } hsh[chash] = 1; hash[nc] = chash; nc++; } else { int cid; cin >> cid; for (j = 0; j < nc; j++) { if (id[j] == cid) { hsh[hash[j]] = 0; break; } } } } cout << res; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int P = 1e9 + 7, INF = 0x3f3f3f3f; long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } long long qpow(long long a, long long n) { long long r = 1 % P; for (a %= P; n; a = a * a % P, n >>= 1) if (n & 1) r = r * a % P; return r; } long long inv(long long first) { return first <= 1 ? 1 : inv(P % first) * (P - P / first) % P; } inline int rd() { int first = 0; char p = getchar(); while (p < 0 || p > 9 ) p = getchar(); while (p >= 0 && p <= 9 ) first = first * 10 + p - 0 , p = getchar(); return first; } const int N = 1e6 + 10; int n; long long k; char s[N], t[N]; int main() { scanf( %d%lld%s%s , &n, &k, s + 1, t + 1); long long ans = 0, tot = 1, INF = 1e15; for (int i = 1; i <= n; ++i) { tot <<= 1; if (s[i] == b ) --tot; if (t[i] == a ) --tot; ans += min(k, tot); tot = min(tot, INF); } printf( %lld n , ans); }
|
#include <bits/stdc++.h> using namespace std; long long dp[int(1e5 + 2)][2]; int a[int(1e5 + 2)]; vector<int> v[2]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int mod = 998244353; int t; cin >> t; while (t--) { v[0].clear(); v[1].clear(); for (int i = 0; i < int(1e5 + 2); i++) dp[i][0] = dp[i][1] = 0; int n; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; long long ans = 0; for (int i = n - 1; i >= 0; i--) { int one = i % 2; dp[a[i]][one] = 1; v[one].push_back(a[i]); for (auto x : v[1 - one]) { int k = a[i] / x; if (a[i] % x != 0) k++; int x_ = a[i] / k; if (dp[x_][one] == 0) v[one].push_back(x_); dp[x_][one] += dp[x][1 - one]; ans = (ans + (i + 1) * dp[x][1 - one] * (k - 1)) % mod; dp[x][1 - one] = 0; } v[1 - one].clear(); } cout << ans << n ; } }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; while (n--) { int q, ans = 0; cin >> q; if (q % 2) q -= 9, ans++; if (q < 0) ans = -1; else ans += q / 4; if (q == 2) ans = -1; cout << ans << endl; } return 0; }
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.