func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> #pragma warning(disable : 4996) #pragma comment(linker, /STACK:666000000 ) using namespace std; const int inf = (1 << 30) - 1; const long double eps = 1e-9; const long double pi = fabs(atan2(0.0, -1.0)); void ML(const bool v) { if (v) return; int *ass; for (;;) { ass = new int[2500000]; for (int i = 0; i < 2500000; i++) ass[i] = rand(); } } void TL(const bool v) { if (v) return; int *ass; ass = new int[250]; for (;;) { for (int i = 0; i < 250; i++) ass[i] = rand(); } } void PE(const bool v) { if (v) return; puts( ass 1 2 3 4 5 6 fuck ); exit(0); } int n, m; bool was[300][300]; void LoAd() { cin >> n >> m; } vector<pair<int, int> > res; bool swapped; int x = 1, y = 1; bool can_dn() { return !was[x + 1][y]; } bool can_up() { return !was[x - 1][y]; } bool can_lt() { return !was[x][y - 1]; } bool can_rt() { return !was[x][y + 1]; } void go_dn() { res.push_back(make_pair(x, y)); was[x][y] = true; x++; } void go_up() { res.push_back(make_pair(x, y)); was[x][y] = true; x--; } void go_lt() { res.push_back(make_pair(x, y)); was[x][y] = true; y--; } void go_rt() { res.push_back(make_pair(x, y)); was[x][y] = true; y++; } void SoLvE() { if (min(n, m) == 1 && max(n, m) == 2) { puts( 0 ); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) printf( %d %d n , i, j); printf( 1 1 ); return; } if (n == 1 || m == 1) { puts( 1 ); printf( %d %d %d %d n , n, m, 1, 1); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) printf( %d %d n , i, j); printf( 1 1 ); return; } if (n % 2 == 0 && m % 2 == 1) { swap(n, m); swapped = true; } for (int i = 0; i < 300; i++) for (int j = 0; j < 300; j++) if (1 <= i && i <= n && 1 <= j && j <= m) was[i][j] = false; else was[i][j] = true; if (1 == n % 2 && 1 == m % 2) { puts( 1 ); printf( %d %d %d %d n , n, m, 1, 1); while (x != n || y != m) { while (can_dn()) go_dn(); if (can_rt()) go_rt(); while (can_up()) go_up(); if (can_rt()) go_rt(); } res.push_back(make_pair(n, m)); res.push_back(make_pair(1, 1)); } else { puts( 0 ); while (true) { while (can_dn()) go_dn(); if (can_rt()) go_rt(); if (x == n && y == m) break; while (can_up() && x > 2) go_up(); if (can_rt()) go_rt(); } while (can_up()) go_up(); while (can_lt()) go_lt(); res.push_back(make_pair(x, y)); res.push_back(make_pair(1, 1)); } for (int i = 0; i < (int)res.size(); i++) { if (swapped) swap(res[i].first, res[i].second); printf( %d %d n , res[i].first, res[i].second); } } int main() { srand((int)time(NULL)); LoAd(); SoLvE(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int a[1000005], b[1000005], ans[1000005]; int main() { int n; cin >> n; vector<int> v; int y = 1; while (y < n) { v.push_back(y); y *= 2; } int j = v.size() - 1, x; for (int i = 0; i < n; i++) { cin >> a[i]; if (i < n - 1) { x = a[i] + b[i]; if (i == 0) ans[i] = x; else ans[i] = ans[i - 1] + x; while (i + v[j] >= n && j < v.size()) { j--; } b[i + v[j]] += x; } } for (int i = 0; i < n - 1; i++) cout << ans[i] << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long PLUS = -1; const long long MULT = -2; string fo; vector<long long> tmp, whereMULT; long long i, nr, lo, hi, total, add, crt, j, p, ans; int main() { cin >> fo; fo = 1* + fo + *1 ; for (i = 0; i < fo.size();) { if (!( 0 <= fo[i] && fo[i] <= 9 )) { (fo[i] == + ) ? tmp.push_back(PLUS) : tmp.push_back(MULT); i += 1; } long long nr = 0; while ( 0 <= fo[i] && fo[i] <= 9 ) { nr = nr * 10 + fo[i] - 0 ; i += 1; } tmp.push_back(nr); } for (i = 0; i < tmp.size(); ++i) if (tmp[i] == MULT) whereMULT.push_back(i); for (i = 0; i < whereMULT.size(); ++i) for (j = i + 1; j < whereMULT.size(); ++j) { lo = whereMULT[i] + 1, hi = whereMULT[j] - 1; crt = 0; add = tmp[lo]; lo += 1; p = 0; while (lo <= hi) { if (tmp[lo] == MULT) { lo += 1; add *= tmp[lo]; lo += 1; } else { crt += add; lo += 1; add = tmp[lo]; lo += 1; } } crt += add; lo = 1, hi = tmp.size() - 1; total = 0, add = 1; while (lo <= hi) { if (lo == whereMULT[i]) { add *= crt; lo = whereMULT[j]; continue; } if (tmp[lo] == MULT) { lo += 1; add *= tmp[lo]; lo += 1; } else { total += add; lo += 1; add = tmp[lo]; lo += 1; } } total += add; ans = max(ans, total); } cout << ans << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int su(int n) { int r, sum = 0; while (n != 0) { r = n % 10; sum = sum + r; n = n / 10; } return sum; } int main() { int n; cin >> n; int k = n; int i = 0; while (i != 10) { int d = su(k + i); if (d % 4 == 0) { cout << k + i << endl; break; } i++; } }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int t; t = 1; while (t--) { int n, m; cin >> n >> m; string s[n]; for (int i = 0; i < n; ++i) { cin >> s[i]; } int cnt = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (s[i][j] == B ) cnt++; } } cnt = sqrt(cnt); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (s[i][j] == B ) { cout << i + cnt / 2 + 1 << << j + cnt / 2 + 1 << endl; return 0; } } } } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long res, d, e, k; int N; int h[2020]; long long dp[2020][2020]; long long pw(long long a, long long n) { long long ret = 1; while (n) { if (n % 2) ret *= a, ret %= 998244353; a *= a, a %= 998244353; n >>= 1; } return ret; } long long C(long long n, long long r) { if (r == 0 || r == n) return 1; if (dp[n][r]) return dp[n][r]; return dp[n][r] = (C(n - 1, r - 1) + C(n - 1, r)) % 998244353; } int main() { scanf( %d %d , &N, &k); if (k == 1) return !printf( 0 ); for (int i = 0; i < N; i++) scanf( %d , &h[i]); for (int i = 0; i < N; i++) { if (h[i] == h[(i + 1) % N]) e++; else d++; } for (long long s = 0; s < d; s++) { long long mul = 1; mul *= pw(k - 2, s); mul %= 998244353; mul *= C(d, s); mul %= 998244353; long long sum = 0; for (long long m = 0; m <= (d - s - 1) / 2; m++) { sum += C(d - s, m); sum %= 998244353; } mul *= sum; mul %= 998244353; res += mul; res %= 998244353; } res *= pw(k, e); res %= 998244353; printf( %lld , res); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z, ans, maxi, mini, res; string s1, s2; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> x; if (x == 2) cout << 2; else cout << 1; return 0; }
|
#include <bits/stdc++.h> using namespace std; int on[100005]; int prime[100005], cnt = 0; void ola() { for (int i = 2; i <= 100005; i++) { if (!on[i]) prime[cnt++] = i; for (int j = 0; j < cnt && i * prime[j] <= 100005; j++) { on[i * prime[j]] = 1; if (i % prime[j] == 0) break; } } } int main() { int n, flag = 0; cin >> n; ola(); for (int i = 2; i <= n + 1; i++) { if (on[i] == 1) { on[i] = 2; flag = 1; } else on[i] = 1; } if (flag == 1) cout << 2 << endl; else cout << 1 << endl; for (int i = 2; i <= n; i++) cout << on[i] << ; cout << on[n + 1] << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 400005; int n, q, a[maxn]; namespace SGT { int Min[maxn << 2]; void modify(int l, int r, int id, int x, int y) { if (l == r) { Min[id] = y; return; } int mid = (l + r) >> 1; if (x <= mid) modify(l, mid, id << 1, x, y); else modify(mid + 1, r, id << 1 | 1, x, y); Min[id] = min(Min[id << 1], Min[id << 1 | 1]); } int query(int l, int r, int id, int L, int R) { if (L <= l && r <= R) return Min[id]; int mid = (l + r) >> 1, res = 1e9; if (L <= mid) res = min(res, query(l, mid, id << 1, L, R)); if (R > mid) res = min(res, query(mid + 1, r, id << 1 | 1, L, R)); return res; } } // namespace SGT struct query { int r1, c1, c2, id; query() {} query(int _r1, int _c1, int _c2, int _i) { r1 = _r1, c1 = _c1, c2 = _c2, id = _i; } }; int ans[maxn], now[maxn]; vector<query> Q[2][maxn]; void solve(vector<query> *Q) { static int st[maxn], num[maxn], top; top = 0; for (int i = 1; i <= n; i++) { while (top && num[top] >= a[i]) top--; st[++top] = i; num[top] = a[i]; SGT ::modify(1, n, 1, top, -2 * i + a[i]); for (auto u : Q[i]) { int r1 = u.r1, c1 = u.c1, r2 = i, c2 = u.c2, id = u.id; int res = r2 - r1 + c2 + 1; int L = lower_bound(st + 1, st + top + 1, r1) - st, R = top; now[id] = min(c1, num[L]); res = min(res, r2 - r1 + abs(c2 - now[id])); int pos = lower_bound(num + L, num + R + 1, c2) - num; if (pos <= R) res = min(res, r2 - r1 + 1 + abs(c2 - num[pos])); if (pos > L) res = min(res, r2 - r1 + 1 + abs(c2 - num[pos - 1])); else { assert(pos == L); pos = upper_bound(num + 1, num + R + 1, c2) - num - 1; if (pos && st[pos] <= r1) res = min(res, r1 + r2 - 2 * st[pos] + (c1 < num[pos]) + abs(c2 - num[pos])); } if (pos + 1 < L) { R = L - 1, L = pos + 1; int mid = upper_bound(num + L, num + R + 1, c1) - num; if (mid <= R) res = min(res, r1 + r2 + 1 + SGT ::query(1, n, 1, mid, R) - c2); if (L < mid) res = min(res, r1 + r2 + SGT ::query(1, n, 1, L, mid - 1) - c2); } ans[id] = res; } } top = 0; for (int i = n; i >= 1; i--) { while (top && num[top] >= a[i]) top--; st[++top] = i; num[top] = a[i]; SGT ::modify(1, n, 1, top, 2 * i + a[i]); for (auto u : Q[i]) { int r1 = u.r1, r2 = i, c2 = u.c2, id = u.id; int pos = upper_bound(num + 1, num + top + 1, c2) - num - 1, res = 1e9; if (pos) res = -(r1 + r2) + 2 * st[pos] + (now[id] < num[pos]) + abs(c2 - num[pos]); if (pos + 1 <= top) { int L = pos + 1, R = top; int mid = upper_bound(num + L, num + R + 1, now[id]) - num; if (mid <= R) res = min(res, -(r1 + r2) + 1 + SGT ::query(1, n, 1, mid, R) - c2); if (L < mid) res = min(res, -(r1 + r2) + SGT ::query(1, n, 1, L, mid - 1) - c2); } ans[id] = min(ans[id], res); } } } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); scanf( %d , &q); for (int i = 1, r1, c1, r2, c2; i <= q; i++) { scanf( %d%d%d%d , &r1, &c1, &r2, &c2); if (r1 <= r2) Q[0][r2].push_back(query(r1, c1, c2, i)); else Q[1][n - r2 + 1].push_back(query(n - r1 + 1, c1, c2, i)); } solve(Q[0]); reverse(a + 1, a + n + 1); solve(Q[1]); for (int i = 1; i <= q; i++) printf( %d n , ans[i]); return 0; }
|
#include <bits/stdc++.h> using namespace std; const double EPS = 1E-9; const int INF = 1000000000; const long long INF64 = (long long)1E18; const double PI = 3.1415926535897932384626433832795; long long gcd(long long a, long long b) { if (a < b) return gcd(b, a); if (b == 0) return a; return gcd(b, a % b); } int main() { char *s = new char[2000000]; char *z = new char[2000000]; long long i, j, n, a, b, c, x = 0, y = 0, slen; memset(s, 0, 2000000); memset(z, 0, 2000000); cin >> s; slen = strlen(s); for (i = 0; i < slen; ++i) if (s[i] == x ) x++; else y++; if (x > y) { x = x - y; for (i = 0; i < x; ++i) z[i] = x ; } else { y = y - x; for (i = 0; i < y; ++i) z[i] = y ; } cout << z; return 0; }
|
#include <bits/stdc++.h> using namespace std; long long n, k, T; long long doit(long long n, long long k) { if (n == 1) return k * (k + 1) / 2; long long tp = (n - 1) / k + 1, v1 = doit(tp, k), tp2 = (n - 1) % k + 1; long long f1 = (tp - 1) * (k * k + 1), f2 = v1 - f1; if (tp2 * k < f2) return (f1 * 2 + tp2 * 2 * k - k + 1) * k / 2; else if ((tp2 - 1) * k >= f2) return (f1 * 2 - k + 3 + tp2 * 2 * k) * k / 2; else return (f1 * 2 - k + 1 + tp2 * 2 * k) * k / 2 + tp2 * k - f2 + 1; } long long solve(long long n, long long k) { long long tp = (n - 1) / (k * k + 1) + 1, st = doit(tp, k); if (n == st) return tp * (k + 1); else return (n - tp + (n < st) - 1) / k + n - tp + (n < st); } int main() { scanf( %d , &T); while (T--) scanf( %lld%lld , &n, &k), printf( %lld n , solve(n, k)); }
|
#include <bits/stdc++.h> using namespace std; int t, n, m, a[5][200], ans; vector<pair<int, int> > v, vec; int getidx(int i, int j) { return (i - 1) * m + j; } int geti(int idx) { return (idx - 1) / m; } int getj(int idx) { return (((idx - 1) % m) + 1); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> t; while (t--) { cin >> n >> m; v.clear(); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { cin >> a[i][j]; v.push_back({a[i][j], getidx(i, j)}); } } ans = 0; sort(v.rbegin(), v.rend()); if (n < 4 || m == 1) { for (int i = 0; i < n; i++) { ans += v[i].first; } } else { int ar[] = {0, 0, 0, 0, 1, 1, 1, 1}; do { int tmp = 0; vec.clear(); for (int i = 0; i < 8; i++) { if (ar[i] == 1) { int ii = geti(v[i].second); int jj = getj(v[i].second); vec.push_back({jj, ii}); tmp += v[i].first; } } sort(vec.begin(), vec.end()); int ct = 1; for (int i = 1; i < 4; i++) if (vec[i].first != vec[i - 1].first) ct++; if (ct != 2 || vec[1].first == vec[2].first || ((vec[1].second - vec[0].second + 4) % 2 == (vec[3].second - vec[2].second + 4) % 2)) { ans = max(ans, tmp); } } while (next_permutation(ar, ar + 8)); } cout << ans << n ; } }
|
#include <bits/stdc++.h> const int INF = 2147483647; using namespace std; unsigned char like[7][7]; int fenzu[7]; int n, totjy[3]; int getnum(char l[50]) { switch (l[0]) { case A : return 0; case C : if (l[1] == h ) return 1; else return 2; case T : return 3; case D : return 4; case S : return 5; case H : return 6; } } void init_and_read() { int i; char pa[50], pb[50]; scanf( %d , &n); memset(like, 0, sizeof(like)); for (i = 1; i <= n; i++) { scanf( %s likes %s , &pa, &pb); like[getnum(pa)][getnum(pb)] = 1; } for (i = 0; i < 3; i++) scanf( %d , &totjy[i]); } void Dec_To_Three(int x) { int i = 0; while (i < 7) { fenzu[i] = x % 3; x /= 3; i++; } } int Abs(int x) { return (x > 0) ? x : (-x); } int max(int a, int b, int c) { a = (a > b) ? a : b; return (a > c) ? a : c; } void solve_and_print() { int i, j, k, flag, peplo[3], jingyan[3], minidif = INF, maxlike = -INF; int tmp, totlike; for (i = 0; i <= 2186; i++) { Dec_To_Three(i); peplo[0] = peplo[1] = peplo[2] = 0; for (j = 0; j <= 6; j++) { peplo[fenzu[j]]++; } flag = 0; for (j = 0; j <= 2; j++) { if (!peplo[j]) { flag = 1; break; } jingyan[j] = totjy[j] / peplo[j]; } if (flag) continue; tmp = max(Abs(jingyan[0] - jingyan[1]), Abs(jingyan[0] - jingyan[2]), Abs(jingyan[1] - jingyan[2])); if (tmp < minidif) { minidif = tmp; maxlike = -INF; } if (tmp == minidif) { totlike = 0; for (j = 0; j <= 6; j++) { for (k = 0; k <= 6; k++) { if ((fenzu[j] == fenzu[k]) && (like[j][k])) { totlike++; } } } } if (totlike > maxlike) maxlike = totlike; } printf( %d %d n , minidif, maxlike); } int main() { init_and_read(); solve_and_print(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long MAXN = 1e6 + 7; const long double maxx = 1e11; int tmp[MAXN]; int main() { int n, k; cin >> n >> k; string s; cin >> s; k--; if (k >= n / 2) k = n - k - 1; int ans = 0, l = 0, r = 0; for (int i = 0, j = n - 1; i < j; i++, j--) { tmp[i] = min(abs(s[i] - s[j]), 26 - abs(s[i] - s[j])); } for (int i = 1; i <= n / 2; i++) tmp[i] += tmp[i - 1]; for (int i = 0; i < n / 2; i++) { if (tmp[i]) { l = i; break; } } for (int i = 0; i < n / 2; i++) if (tmp[i] == tmp[n / 2]) { r = i; break; } if (tmp[n / 2]) ans = tmp[n / 2] + min(abs(k - l), abs(k - r)) + abs(l - r); cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, tmp, curr = 0; cin >> n; int v[n], res[n]; for (int i = 0; i < n; i++) { cin >> tmp; v[tmp] = i + 1; } for (int i = 0; i < n; i++) { cin >> tmp; if (v[tmp] > curr) { res[i] = v[tmp] - curr; curr = v[tmp]; } else res[i] = 0; } for (int i = 0; i < n; i++) cout << res[i] << ; }
|
#include <bits/stdc++.h> using namespace std; int n, k; int Time = 0; string s; bool dp[2][(int)1e5 + 10]; struct Node { int nxt[26]; bool leaf; Node() { for (int i = 0; i < 26; i++) nxt[i] = -1; leaf = 1; } } trie[(int)1e5 + 10]; void dodaj(string s) { int niz[100010]; for (int i = 0; i < s.size(); i++) niz[i] = s[i] - a ; int tr = 0; for (int i = 0; i < s.size(); i++) { if (trie[tr].nxt[niz[i]] == -1) trie[tr].nxt[niz[i]] = ++Time; trie[tr].leaf = 0; tr = trie[tr].nxt[niz[i]]; } } bool uradi0(int tr, bool minn) { if (trie[tr].leaf) { dp[0][tr] = 1; return 1; } for (int i = 0; i < 26; i++) { if (trie[tr].nxt[i] != -1) minn = min(minn, uradi0(trie[tr].nxt[i], 1)); } dp[0][tr] = 1 ^ minn; return dp[0][tr]; } bool uradi1(int tr, bool minn) { if (trie[tr].leaf) { dp[1][tr] = 0; return 0; } for (int i = 0; i < 26; i++) { if (trie[tr].nxt[i] != -1) minn = min(minn, uradi1(trie[tr].nxt[i], 1)); } dp[1][tr] = 1 ^ minn; return dp[1][tr]; } int main() { cin >> n >> k; for (int i = 0; i < n; i++) { cin >> s; dodaj(s); } uradi0(0, 1); uradi1(0, 1); if (dp[0][0] == 1 && dp[1][0] == 1) cout << First << endl; else if (dp[0][0] == 1) cout << Second << endl; else if (dp[1][0] == 1) cout << ((k % 2 == 1) ? First : Second ) << endl; else cout << Second << endl; }
|
#include <bits/stdc++.h> int main() { int n, t, i; scanf( %d%d , &n, &t); if (n == 1 && t == 10) printf( -1 ); else { if (t == 10) { printf( 1 ); for (i = 0; i < n - 1; i++) printf( 0 ); } else for (i = 0; i < n; i++) printf( %d , t); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 52; int n, m, a[N][N], b[N][N], i, j; int main() { cin >> n >> m; for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) cin >> a[i][j]; } for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) cin >> b[i][j]; } for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) if (a[i][j] > b[i][j]) swap(a[i][j], b[i][j]); } for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) { if (a[i][j] <= a[i][j - 1] || i < n && (a[i][j] >= a[i + 1][j])) { cout << Impossible ; return 0; } } } for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) { if (b[i][j] <= b[i][j - 1] || i < n && (b[i][j] >= b[i + 1][j])) { cout << Impossible ; return 0; } } } cout << Possible ; }
|
#include <bits/stdc++.h> int n; char s[20]; int main() { scanf( %d , &n); getchar(); int ans = 0; for (int i = 1; i <= n; i++) { scanf( %s , s); if (s[0] == T ) { ans += 4; } else if (s[0] == C ) { ans += 6; } else if (s[0] == O ) { ans += 8; } else if (s[0] == D ) { ans += 12; } else { ans += 20; } } printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; pair<int, int> get_pair(int a, int b) { if (a > b) swap(a, b); return {a, b}; } template <class Cap, class Cost> struct mcf_graph { private: int _n; struct _edge { int to, rev; Cap cap; Cost cost; }; vector<pair<int, int>> pos; vector<vector<_edge>> g; vector<Cost> h; vector<Cost> dist; vector<int> pv, pe; vector<bool> vis; void norm(int s, int t) { h.resize(_n, numeric_limits<Cost>::max()); h[s] = 0; int ch = 1; int it = _n; while (ch-- && it--) { for (int i = 0; i < _n; i++) { if (h[i] == numeric_limits<Cost>::max()) continue; for (auto e : g[i]) { if (e.cap == 0) continue; if (h[i] + e.cost < h[e.to]) { h[e.to] = h[i] + e.cost; ch = 1; } } } assert(it >= 0); } for (int i = 0; i < _n; i++) h[i] -= h[t]; } bool dijkstra(int s, int t) { pv.clear(); pe.clear(); vis.clear(); dist.clear(); dist.resize(_n, numeric_limits<Cost>::max()); pv.resize(_n, -1); pe.resize(_n, -1); vis.resize(_n, false); priority_queue<pair<Cost, int>, vector<pair<Cost, int>>, greater<pair<Cost, int>>> pq; pq.push({0, s}); dist[s] = 0; while (!pq.empty()) { int x = pq.top().second; pq.pop(); if (vis[x]) continue; vis[x] = true; if (x == t) break; for (int i = 0; i < int(g[x].size()); ++i) { auto e = g[x][i]; if (vis[e.to] || e.cap == 0) continue; Cost cost = e.cost + h[x] - h[e.to]; if (dist[e.to] <= dist[x] + cost) continue; dist[e.to] = dist[x] + cost; pv[e.to] = x; pe[e.to] = i; pq.push({dist[e.to], e.to}); } } if (vis[t] == false) return false; for (int i = 0; i < _n; ++i) { if (!vis[i]) continue; h[i] -= dist[t] - dist[i]; } return true; } public: mcf_graph() {} mcf_graph(int n) : _n(n), g(n) {} int add_edge(int from, int to, Cap cap, Cost cost) { assert(from >= 0 && from < _n); assert(to >= 0 && to < _n); int m = int(pos.size()); pos.push_back({from, int(g[from].size())}); int from_id = int(g[from].size()); int to_id = int(g[to].size()); if (from == to) to_id++; g[from].push_back(_edge{to, to_id, cap, cost}); g[to].push_back(_edge{from, from_id, 0, -cost}); return m; } struct edge { int from, to; Cap cap, flow; Cost cost; }; edge get_edge(int i) { int m = int(pos.size()); assert(0 <= i && i < m); auto _e = g[pos[i].first][pos[i].second]; auto _re = g[_e.to][_e.rev]; return edge{ pos[i].first, _e.to, _e.cap + _re.cap, _re.cap, _e.cost, }; } vector<edge> edges() { int m = int(pos.size()); vector<edge> result(m); for (int i = 0; i < m; ++i) result[i] = get_edge(i); return result; } pair<Cap, Cost> flow(int s, int t, bool neg = false) { return flow(s, t, numeric_limits<Cap>::max(), neg); } pair<Cap, Cost> flow(int s, int t, Cap flow_limit, bool neg = false) { return slope(s, t, flow_limit, neg).back(); } vector<pair<Cap, Cost>> slope(int s, int t, bool neg = false) { return slope(s, t, numeric_limits<Cap>::max(), neg); } vector<pair<Cap, Cost>> slope(int s, int t, Cap flow_limit, bool neg = false) { assert(s >= 0 && s < _n); assert(t >= 0 && t < _n); assert(s != t); h.clear(); if (!neg) h.resize(_n, 0); else norm(s, t); Cap flow = 0; Cost cost = 0, prev = -1; vector<pair<Cap, Cost>> result; result.push_back({flow, cost}); while (flow < flow_limit) { if (dijkstra(s, t) == false) break; Cap c = flow_limit - flow; for (int i = t; i != s; i = pv[i]) { c = min(c, g[pv[i]][pe[i]].cap); } for (int i = t; i != s; i = pv[i]) { auto &e = g[pv[i]][pe[i]]; e.cap -= c; g[e.to][e.rev].cap += c; } Cost d = -h[s]; flow += c; cost += c * d; if (prev == d) result.pop_back(); result.push_back({flow, cost}); prev = d; } return result; } }; pair<vector<int>, vector<int>> bi_color(vector<pair<int, int>> &edges, map<int, int> &id) { int n = int(id.size()); vector<vector<int>> g(n); for (auto e : edges) { int u = id[e.first]; int v = id[e.second]; g[u].push_back(v); g[v].push_back(u); } vector<int> x, y; vector<int> col(n); for (int i = 0; i < n; i++) { if (col[i] > 0) continue; queue<int> q; col[i] = 1; q.push(i); x.push_back(i); while (!q.empty()) { auto u = q.front(); q.pop(); for (auto v : g[u]) { if (col[v] == 0) { col[v] = 3 - col[u]; q.push(v); if (col[v] == 1) x.push_back(v); else y.push_back(v); } else assert(col[v] == 3 - col[u]); } } } return {x, y}; } void solve() { int n, k; cin >> n >> k; vector<int> arr(1 << n); for (int i = 0; i < (1 << n); i++) cin >> arr[i]; int max_edge = min((2 * n) * k + 12, n * (1 << (n - 1))); map<pair<int, int>, bool> vis; vector<pair<int, int>> edges; using node = pair<int, pair<int, int>>; priority_queue<node> pq; vector<vector<pair<int, int>>> ord(1 << n); for (int i = 0; i < (1 << n); i++) { for (int j = 0; j < n; j++) { ord[i].push_back({arr[i] + arr[i ^ (1 << j)], i ^ (1 << j)}); } sort(ord[i].begin(), ord[i].end()); reverse(ord[i].begin(), ord[i].end()); pq.push({ord[i][0].first, {i, 0}}); } while (!pq.empty()) { auto a = pq.top(); pq.pop(); auto cost = a.first; int u = a.second.first, i = a.second.second; if (vis.find(get_pair(u, ord[u][i].second)) == vis.end()) { vis[get_pair(u, ord[u][i].second)] = true; edges.push_back({u, ord[u][i].second}); } if (int(edges.size()) == max_edge) { break; } if (i + 1 < n) { pq.push({ord[u][i + 1].first, {u, i + 1}}); } } assert(int(edges.size()) == max_edge); map<int, int> id; for (int i = 0, j = 0; i < max_edge; i++) { int a = edges[i].first; int b = edges[i].second; if (id.find(a) == id.end()) id[a] = j++; if (id.find(b) == id.end()) id[b] = j++; } int _n = int(id.size()); mcf_graph<int, long long> g(_n + 3); int _s = _n, _t = _n + 1; long long inf = 1e16; auto info = bi_color(edges, id); for (int i = 0; i < int(info.first.size()); i++) { g.add_edge(_s, info.first[i], 1, 0); } for (int i = 0; i < int(info.second.size()); i++) { g.add_edge(info.second[i], _t, 1, 0); } map<int, int> first; for (auto xx : info.first) first[xx] = true; for (int i = 0; i < max_edge; i++) { int a = id[edges[i].first]; int b = id[edges[i].second]; if (first[b]) swap(a, b); g.add_edge(a, b, 1, -(arr[edges[i].first] + arr[edges[i].second])); } auto tt = g.flow(_s, _t, k, true); cout << -tt.second << n ; } signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); solve(); }
|
#include <bits/stdc++.h> using namespace std; const long long MOD = (long long)1e9 + 7; const long double PI = 3.141592653589793238462643383279502884197; long long fac[1] = {1}, inv[1] = {1}; long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } long long mp(long long a, long long b) { long long ret = 1; while (b) { if (b & 1) ret = ret * a % MOD; a = a * a % MOD; b >>= 1; } return ret; } long long cmb(long long r, long long c) { return fac[r] * inv[c] % MOD * inv[r - c] % MOD; } int n[3]; int vec[3][200]; long long dp[201][201][201]; long long go(int a, int b, int c) { if (dp[a][b][c] != -1) return dp[a][b][c]; long long mav = 0; int nn[3] = {a, b, c}; for (int i = 0; i < 3; i++) { int flag = 0; for (int j = 0; j < 3; j++) { if (i == j) continue; if (nn[j] == n[j]) flag = 1; } if (flag) continue; if (i == 0) mav = max(mav, go(a, b + 1, c + 1) + vec[1][b] * vec[2][c]); if (i == 1) mav = max(mav, go(a + 1, b, c + 1) + vec[0][a] * vec[2][c]); if (i == 2) mav = max(mav, go(a + 1, b + 1, c) + vec[0][a] * vec[1][b]); } return dp[a][b][c] = mav; } int main() { memset(dp, -1, sizeof(dp)); scanf( %d %d %d , &n[0], &n[1], &n[2]); for (int i = 0; i < 3; i++) { for (int j = 0; j < n[i]; j++) scanf( %d , &vec[i][j]); sort(vec[i], vec[i] + n[i], greater<long long>()); } long long ans = go(0, 0, 0); printf( %lld , ans); }
|
#include <bits/stdc++.h> using namespace std; template <typename T1, typename T2> istream& operator>>(istream& in, pair<T1, T2>& a) { in >> a.first >> a.second; return in; } template <typename T1, typename T2> ostream& operator<<(ostream& out, pair<T1, T2> a) { out << a.first << << a.second; return out; } template <typename T, typename T1> T maxs(T& a, T1 b) { if (b > a) a = b; return a; } template <typename T, typename T1> T mins(T& a, T1 b) { if (b < a) a = b; return a; } const long long maxn = 2000005; long long p[maxn]; long long sz[maxn]; bool s1[maxn]; bool s2[maxn]; void clear(long long n = maxn) { for (long long i = 0; i < maxn; i++) p[i] = i, sz[i] = 1; } long long root(long long first) { while (first != p[first]) { p[first] = p[p[first]]; first = p[first]; } return first; } void merge(long long first, long long second) { long long p1 = root(first); long long p2 = root(second); if (p1 == p2) return; if (s1[p1] && s2[p1]) p[p2] = p1; else if (s1[p2] && s2[p2]) p[p1] = p2; else if (s1[p1] || s2[p1]) p[p2] = p1; else p[p1] = p2; } long long solve() { long long n, m; cin >> n >> m; vector<long long> g[n + 1]; vector<pair<long long, long long> > edges; vector<pair<long long, long long> > st; for (long long i = 1; i < m + 1; i++) { long long a, b; cin >> a >> b; g[a].push_back(b); g[b].push_back(a); edges.emplace_back(a, b); } long long s, t, ds, dt; cin >> s >> t >> ds >> dt; for (auto j : g[s]) { s1[j] = 1; } for (auto j : g[t]) { s2[j] = 1; } for (auto j : edges) { if (j.first == s || j.first == t || j.second == s || j.second == t) continue; if (root(j.first) == root(j.second)) continue; merge(j.first, j.second); st.emplace_back(j.first, j.second); } long long cnts = 0, cntt = 0, cntst = 0; set<long long> sts; vector<long long> ss(n + 1, 0), tt(n + 1, 0); for (long long i = 1; i < n + 1; i++) { if (i == s || i == t) continue; long long p = root(i); if (s1[i]) ss[p] = i; if (s2[i]) tt[p] = i; sts.insert(p); } for (auto i : sts) { if (ss[i] && tt[i]) cntst++; else if (ss[i]) cnts++; else cntt++; } if (cnts > ds || cntt > dt || cntst + cntt + cnts > ds + dt) { cout << No << n ; return 0; } if (cntst == 0 && (cnts + 1 > ds || cntt + 1 > dt)) { cout << No << n ; return 0; } if (cntst == 0) { st.emplace_back(s, t); merge(s, t); ds--, dt--; } for (auto i : sts) { if (ss[i] && tt[i] == 0) st.emplace_back(s, ss[i]), ds--, merge(s, ss[i]); else if (tt[i] && ss[i] == 0) st.emplace_back(t, tt[i]), dt--, merge(t, tt[i]); else { if (ds >= dt) st.emplace_back(s, ss[i]), ds--, merge(s, ss[i]); else st.emplace_back(t, tt[i]), dt--, merge(t, tt[i]); } } if (root(s) != root(t)) { bool f = 0; if (ds) { for (auto i : g[s]) { if (dt == 0 && i == t) continue; if (root(i) != root(s)) { f = 1; st.emplace_back(s, i); break; } } } if (f == 0 && dt) { for (auto i : g[t]) { if (ds == 0 && i == s) continue; if (root(i) != root(t)) { f = 1; st.emplace_back(t, i); break; } } } if (f == 0) { cout << No << n ; return 0; } } cout << Yes << n ; for (auto i : st) cout << i << n ; return 0; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); clear(); long long t = 1; while (t--) { solve(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long int ar[500009], br[500009], cr[500009], tr[500009]; long long int fx[] = {-1, 1, 0, 0}; long long int fy[] = {0, 0, 1, -1}; map<long long int, long long int> mp; vector<long long int> v; string s; struct evan { long long int l, r, pos; } st[500009]; bool com(evan i1, evan i2) { return (i1.r < i2.r); } int main() { long long int a, b, c, d, e, i, j, k, x, y, z, f, g, h, n, m; cin >> a; while (a--) { cin >> b; c = b / 4; j = (b * 4) - b; b -= c; for (i = 1; i < b; i++) { cout << 9 ; } if (j % 4) cout << 8 ; else { cout << 9 ; } for (i = 1; i <= c; i++) { cout << 8 ; } cout << endl; } }
|
#include <bits/stdc++.h> using namespace std; int main() { int x1, x2, y1, y2, x, y; cin >> x1 >> y1 >> x2 >> y2 >> x >> y; int temp1 = abs(x1 - x2), temp2 = abs(y1 - y2); int temp3 = temp1 / x, temp4 = temp2 / y; if (temp1 % x == 0 && temp2 % y == 0 && temp3 % 2 == temp4 % 2) cout << YES n ; else cout << NO n ; return 0; }
|
#include <bits/stdc++.h> struct point { double x, y, z; point() {} point(double _x, double _y, double _z) : x(_x), y(_y), z(_z) {} }; const double eps = 1e-8; double vlen(point p) { return sqrt(p.x * p.x + p.y * p.y + p.z * p.z); } point xmult(point u, point v) { point ret; ret.x = u.y * v.z - v.y * u.z; ret.y = u.z * v.x - u.x * v.z; ret.z = u.x * v.y - u.y * v.x; return ret; } point subt(point u, point v) { point ret; ret.x = u.x - v.x; ret.y = u.y - v.y; ret.z = u.z - v.z; return ret; } int dot_online_in(point p, point l1, point l2) { return (((vlen(xmult(subt(p, l1), subt(p, l2)))) > 0 ? (vlen(xmult(subt(p, l1), subt(p, l2)))) : -(vlen(xmult(subt(p, l1), subt(p, l2))))) < eps) && (l1.x - p.x) * (l2.x - p.x) < eps && (l1.y - p.y) * (l2.y - p.y) < eps && (l1.z - p.z) * (l2.z - p.z) < eps; } double x[10001], y[10001], z[10001], d[10001]; int main() { int n; scanf( %d , &n); for (int i = 0; i <= n; i++) scanf( %lf %lf %lf , &x[i], &y[i], &z[i]); double vp, vs, px, py, pz; scanf( %lf %lf , &vp, &vs); scanf( %lf %lf %lf , &px, &py, &pz); double lo = 0, hi = 0; for (int i = 1; i <= n; i++) { d[i] = sqrt((x[i] - x[i - 1]) * (x[i] - x[i - 1]) + (y[i] - y[i - 1]) * (y[i] - y[i - 1]) + (z[i] - z[i - 1]) * (z[i] - z[i - 1])); hi += d[i] / vs; } if (hi * vp < sqrt((x[n] - px) * (x[n] - px) + (y[n] - py) * (y[n] - py) + (z[n] - pz) * (z[n] - pz))) printf( NO n ); else { double X = -1, Y = -1, Z = -1; while ((hi - lo) >= 1e-10) { double mid = (lo + hi) / 2; double s = mid * vs; for (int i = 1; i <= n; i++) if (s > d[i]) s -= d[i]; else { double t = s / d[i]; X = x[i - 1] + (x[i] - x[i - 1]) * t; Y = y[i - 1] + (y[i] - y[i - 1]) * t; Z = z[i - 1] + (z[i] - z[i - 1]) * t; if (!dot_online_in(point(X, Y, Z), point(x[i - 1], y[i - 1], z[i - 1]), point(x[i], y[i], z[i]))) { X = x[i - 1] - (x[i] - x[i - 1]) * t; Y = y[i - 1] - (y[i] - y[i - 1]) * t; Z = z[i - 1] - (z[i] - z[i - 1]) * t; } break; } if (mid * vp >= sqrt((X - px) * (X - px) + (Y - py) * (Y - py) + (Z - pz) * (Z - pz))) hi = mid; else lo = mid; } printf( YES n ); printf( %.10lf n , lo); printf( %.10lf %.10lf %.10lf n , X, Y, Z); } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long h, w, n; pair<long long, long long> a[2005]; long long fact[200005]; long long ifact[200005]; long long dp[2005]; long long exp(long long a, long long b) { if (b == 0) return 1; if (b == 1) return a; if (b % 2 == 0) { long long r = exp(a, b / 2); return (r * r) % 1000000007; } long long r = exp(a, b - 1); return (r * a) % 1000000007; } long long C(long long n, long long k) { return (((fact[n] * ifact[k]) % 1000000007) * ifact[n - k]) % 1000000007; } int main() { scanf( %lld %lld %lld , &h, &w, &n); for (long long i = 0; i < n; i++) { scanf( %lld %lld , &a[i].first, &a[i].second); a[i].first--; a[i].second--; } sort(a, a + n); a[n++] = make_pair(h - 1, w - 1); fact[0] = 1; ifact[0] = 1; for (long long i = 1; i <= max(w, h) * 2; i++) { fact[i] = (fact[i - 1] * i) % 1000000007; ifact[i] = exp(fact[i], 1000000007 - 2); } for (long long i = 0; i < n; i++) { long long num = C(a[i].first + a[i].second, a[i].first); for (long long j = 0; j < i; j++) { if (a[j].first <= a[i].first && a[j].second <= a[i].second) { int sub = (dp[j] * C((a[i].first - a[j].first) + (a[i].second - a[j].second), a[i].first - a[j].first)) % 1000000007; num = (num - sub + 1000000007) % 1000000007; } } dp[i] = num; } cout << dp[n - 1] << endl; }
|
#include <bits/stdc++.h> using namespace std; const int N = 100000 + 2; int lis[N], where[N], length[N], link[N], a[N], b[N]; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; for (int i = 0; i < n; ++i) { cin >> a[i]; } a[n] = INT_MAX; int m; cin >> m; for (int i = 0; i < m; ++i) { cin >> b[i]; } sort(b, b + m); fill(lis, lis + n + 2, INT_MAX); fill(where, where + n + 2, -1); lis[0] = 0; for (int i = 0; i <= n; ++i) { if (a[i] == -1) { int fill = m - 1; for (int index = n + 1; index > 0; --index) { while (fill > 0 && b[fill - 1] > lis[index - 1]) { --fill; } if (b[fill] > lis[index - 1] && b[fill] <= lis[index]) { lis[index] = b[fill], where[index] = i; } } link[i] = i - 1; while (link[i] >= 0 && a[link[i]] != -1) { --link[i]; } length[i] = -1; } else { int index = lower_bound(lis, lis + n + 2, a[i]) - lis; lis[index] = a[i], where[index] = i; link[i] = where[index - 1]; length[i] = index; } } int index = n, prv = -1; while (index != -1) { if (a[index] == -1) { length[index] = length[prv] - 1; int fill = m - 1; while (b[fill] >= a[prv]) { --fill; } a[index] = b[fill]; b[fill] = INT_MAX; prv = index; if (length[index] == 1) { index = -1; } else { for (int i = 0; i < index; ++i) { if (a[i] < a[index] && length[i] + 1 == length[index]) { index = i; break; } } if (index == prv) { index = link[index]; } } } else { prv = index, index = link[index]; } } int ptr = 0; for (int i = 0; i < n; ++i) { if (a[i] == -1) { while (b[ptr] == INT_MAX) { ++ptr; } a[i] = b[ptr++]; } cout << a[i] << ; } cout << n ; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 100101; int pre[maxn], ind[maxn], cnt[maxn], f[maxn]; vector<int> g[maxn], q; int main() { int n; cin >> n; for (int i = 2; i <= n; ++i) { int l, r; scanf( %d%d , &l, &r); g[l].push_back(r); g[r].push_back(l); ind[l]++; ind[r]++; } q.push_back(1); for (int i = 0; i < q.size(); ++i) { int now = q[i]; for (int j = 0; j < g[now].size(); ++j) if (g[now][j] != pre[now]) { pre[g[now][j]] = now; q.push_back(g[now][j]); } } bool flag = 1; for (int i = (int)q.size() - 1; i >= 0; --i) { int now = q[i]; int k = cnt[now] + (ind[now] > 3); if (k) f[pre[now]]++; if (ind[now] > 2) cnt[now]++; cnt[pre[now]] += cnt[now]; } int sum = cnt[1]; for (int i = 0; i < q.size(); ++i) { int now = q[i]; for (int j = 0; j < g[now].size(); ++j) if (g[now][j] != pre[now]) { int k = sum - cnt[g[now][j]] - (ind[now] > 2) + (ind[now] > 3); if (k) f[g[now][j]]++; } } for (int i = 1; i <= n; ++i) if (f[i] > 2) flag = 0; if (flag) printf( Yes n ); else printf( No n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; struct node { int next, to; } a[400001]; int st[200001], vis[200001], fa[200001], last, cnt = 0, ans = 0, huan; int roo[200001], roo2[200001]; void add(int x, int y) { a[++cnt].to = y; a[cnt].next = st[x]; st[x] = cnt; } void dfs(int x, int last) { int i; if (vis[x]) { if (huan == 0) { huan = 1; roo[++roo[0]] = x; roo2[roo[0]] = 1; } return; } vis[x] = 1; for (i = st[x]; i; i = a[i].next) if (a[i].to != last) dfs(a[i].to, x); } int main() { int n, i, j; scanf( %d , &n); for (i = 1; i <= n; i++) { scanf( %d , &fa[i]); if (fa[i] == i) continue; add(fa[i], i); add(i, fa[i]); } for (i = 1; i <= n; i++) { huan = 0; if (vis[i] == 0) { dfs(i, 0); if (huan == 0) { for (j = i; fa[j] != j; j = fa[j]) ; roo[++roo[0]] = j; } } } for (i = 1; i <= roo[0]; i++) if (roo2[i] == 0) break; if (i <= roo[0]) { ans = roo[0] - 1; for (j = 1; j <= roo[0]; j++) fa[roo[j]] = roo[i]; } else { ans = roo[0]; for (j = 1; j <= roo[0]; j++) fa[roo[j]] = roo[1]; } printf( %d n , ans); for (i = 1; i <= n; i++) printf( %d , fa[i]); }
|
#include <bits/stdc++.h> using namespace std; int main() { long long n, x; string d; int t, m = 0; cin >> n >> x; for (int i = 0; i < n; i++) { cin >> d >> t; if (d[0] == + ) x += t; if (d[0] == - ) { if (x >= t) x -= t; else m++; } } cout << x << << m; return 0; }
|
#include <bits/stdc++.h> using namespace std; int t, n, pl; string s; int main() { std::ios::sync_with_stdio(false); cin >> t; for (int qqw = 1; qqw <= t; qqw++) { cin >> n; cin >> s; pl = -1; for (int i = 1; i <= n; i++) if (s[i - 1] == 0 ) pl = i; if (pl > 0) { if (n % 2 == 0) { if (pl <= n / 2) { cout << pl << << n << << pl + 1 << << n << n ; continue; } cout << 1 << << pl << << 1 << << pl - 1 << n ; } else { if (pl <= n / 2) { cout << pl << << n << << pl + 1 << << n << n ; continue; } cout << 1 << << pl << << 1 << << pl - 1 << n ; } } else { cout << 1 << << n - 1 << << 2 << << n << n ; continue; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; struct linearbasis { long long base[64], flag, cnt; bool add(long long x) { for (int i = 62; ~i; i--) { if (x >> i & 1) { if (!base[i]) { base[i] = x; return false; } x ^= base[i]; } } flag = 1; return true; } long long query_max(long long ans = 0) { for (int i = 62; ~i; i--) { if ((ans ^ base[i]) > ans) { ans ^= base[i]; } } return ans; } long long query_min() { for (int i = 0; i <= 62; i++) { if (base[i]) { return base[i]; } } } void rebuild() { cnt = 0; for (int i = 62; i >= 0; i--) { for (int j = i - 1; j >= 0; j--) { if (base[i] >> j & 1) { base[i] ^= base[j]; } } } for (int i = 0; i <= 62; i++) { if (base[i]) { long long temp = base[i]; base[i] = 0; base[cnt++] = temp; } } } long long query_k(long long k) { k -= flag; if (k == 0) return 0; if (k >= 1ll << cnt) return -1; long long ans = 0; for (int i = 62; ~i; i--) { if (k >> i & 1) { ans ^= base[i]; } } return ans; } void init() { memset(base, 0, sizeof base), flag = cnt = 0; } } a; int prime[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67}; const int mod = 1e9 + 7; int main() { int n, ans = 0; cin >> n; for (int i = 1; i <= n; i++) { int x, value = 0; cin >> x; for (int j = 0; j < 19; j++) { int cnt = 0; while (x % prime[j] == 0) { cnt++; x /= prime[j]; } if (cnt & 1) { value |= 1 << j; } } if (a.add(value)) { ans++; } } long long res = 1; for (int i = 1; i <= ans; i++) { res = res * 2 % mod; } printf( %lld n , res - 1); return 0; }
|
#include <bits/stdc++.h> using namespace std; std::mt19937 rng(std::chrono::steady_clock::now().time_since_epoch().count()); constexpr int MAXN = 1e9 + 7; constexpr int INF = 0x3f3f3f3f; constexpr long long INFLL = 0x3f3f3f3f3f3f3f3f; int main() { std::ios::sync_with_stdio(false); std::cin.tie(nullptr); std::cout.tie(nullptr); int a, b; cin >> a >> b; if (a == b) { cout << a << << 0 << n ; } else { int ans = min(a, b); a -= ans; b -= ans; int left = max(a, b); int ans2 = left / 2; cout << ans << << ans2 << n ; } }
|
// precompute lookup table for each digit? #include <iostream> #include <unordered_map> #include <utility> #include <algorithm> using namespace std; #define MP make_pair<int, int> int main() { unordered_map<int, int> lookup[10]; lookup[1].insert(MP(0, 1)); lookup[2].insert(MP(0, 2)); lookup[2].insert(MP(1, 21)); lookup[3].insert(MP(0, 3)); lookup[3].insert(MP(1, 13)); lookup[3].insert(MP(2, 23)); lookup[4].insert(MP(0, 4)); lookup[4].insert(MP(2, 14)); lookup[4].insert(MP(1, 41)); lookup[4].insert(MP(3, 43)); lookup[5].insert(MP(0, 5)); lookup[5].insert(MP(1, 51)); lookup[5].insert(MP(2, 52)); lookup[5].insert(MP(3, 53)); lookup[5].insert(MP(4, 54)); lookup[6].insert(MP(0, 6)); lookup[6].insert(MP(4, 16)); lookup[6].insert(MP(2, 26)); lookup[6].insert(MP(1, 61)); lookup[6].insert(MP(3, 63)); lookup[6].insert(MP(5, 65)); lookup[7].insert(MP(0, 7)); lookup[7].insert(MP(3, 17)); lookup[7].insert(MP(6, 27)); lookup[7].insert(MP(2, 37)); lookup[7].insert(MP(5, 47)); lookup[7].insert(MP(1, 57)); lookup[7].insert(MP(4, 67)); lookup[8].insert(MP(0, 8)); lookup[8].insert(MP(2, 18)); lookup[8].insert(MP(4, 28)); lookup[8].insert(MP(6, 38)); lookup[8].insert(MP(1, 81)); lookup[8].insert(MP(3, 83)); lookup[8].insert(MP(5, 85)); lookup[8].insert(MP(7, 87)); lookup[9].insert(MP(0, 9)); lookup[9].insert(MP(1, 19)); lookup[9].insert(MP(2, 29)); lookup[9].insert(MP(3, 39)); lookup[9].insert(MP(4, 49)); lookup[9].insert(MP(5, 59)); lookup[9].insert(MP(6, 69)); lookup[9].insert(MP(7, 79)); lookup[9].insert(MP(8, 89)); int t; cin >> t; while (t--) { int q, d; cin >> q >> d; for (int i = 0; i < q; ++i) { int x; cin >> x; int mod = x % d; if (lookup[d].at(mod) <= x) cout << YES << endl; else cout << NO << endl; } } }
|
#include <bits/stdc++.h> using namespace std; int main() { float h, l, ans; cin >> h >> l; ans = (l * l - h * h) / (2 * h); cout << setprecision(13) << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 50; const int mod = 1e9 + 7; const int inf = (1 << 30); vector<int> v[maxn][5], tpl; int ted[maxn], com[maxn], tmp = 1; bool visited[maxn]; bool dfs(int u, int d) { visited[u] = 1; bool rz = (ted[com[u]] == 1); if (d == 1) { com[u] = tmp; ted[tmp]++; } for (auto w : v[u][d]) { if (!visited[w]) { rz &= dfs(w, d); } } if (d == 0) tpl.push_back(u); return rz; } bool dfs1(int u) { visited[u] = 1; bool rz = (ted[com[u]] == 1); for (auto w : v[u][0]) if (!visited[w]) rz &= dfs1(w); for (auto w : v[u][1]) if (!visited[w]) rz &= dfs1(w); return rz; } int main() { ios_base::sync_with_stdio(false); int n, m; cin >> n >> m; for (int i = 1; i <= m; i++) { int a, b; cin >> a >> b; v[a][0].push_back(b); v[b][1].push_back(a); } for (int i = 1; i <= n; i++) if (!visited[i]) dfs(i, 0); memset(visited, 0, sizeof visited); for (int i = n - 1; i >= 0; i--) { int u = tpl[i]; if (!visited[u]) { dfs(u, 1); tmp++; } } memset(visited, 0, sizeof visited); long long ans = n; for (int i = 1; i <= n; i++) { if (!visited[i]) { bool k = dfs1(i); ans -= k; } } cout << ans << endl; }
|
#include <bits/stdc++.h> using namespace std; long long am[20]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector<long long> a(n); for (int i = 0, ThxDem = n; i < ThxDem; ++i) { cin >> a[i]; for (int j = 0, ThxDem = 20; j < ThxDem; ++j) if (a[i] & (1 << j)) am[j]++; a[i] = 0; } for (int i = 0, ThxDem = n; i < ThxDem; ++i) { for (int j = 0, ThxDem = 20; j < ThxDem; ++j) if (am[j]) a[i] |= 1 << j, am[j]--; } long long ans = 0; for (int i = 0, ThxDem = n; i < ThxDem; ++i) ans += a[i] * a[i]; cout << ans << n ; }
|
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:400000000 ) int n, r; string ans; pair<int, int> f(int a, int b) { if (a == 1 && b == 0) return pair<int, int>(0, 0); if (a > 1 && b == 0) return pair<int, int>(1000000007LL, 1000000007LL); if (a == 1 && b == 1) return pair<int, int>(1, 0); if (a > 1 && b == 1) return pair<int, int>(2, a - 2); pair<int, int> p = f(b, a % b); return pair<int, int>(p.first + 1, p.second + a / b - 1); } void g(int a, int b) { if (a == 1 && b == 0) return; if (a == 1 && b == 1) { ans += T ; return; } if (a > 1 && b == 1) { ans += TB ; for (int i = 0; i < a - 2; i++) ans += B ; return; } g(b, a % b); if (ans[ans.size() - 1] == T ) { ans += B ; for (int i = 0; i < a / b - 1; i++) ans += B ; } else { ans += T ; for (int i = 0; i < a / b - 1; i++) ans += T ; } } int main() { cin >> n >> r; int mi = 1000000007LL, best = -1; for (int i = 1; i < r + 1; i++) { if (r > 1 && r == i) continue; pair<int, int> p = f(r, i); if (p.first + p.second == n && p.second < mi) mi = p.second, best = i; } if (best == -1) cout << IMPOSSIBLE ; else { g(r, best); cout << mi << endl << ans; } }
|
#include <bits/stdc++.h> using namespace std; int n, m; int U[5005], V[5005]; struct emm { int a, b, x; } a[5005]; bool cmp(emm x, emm y) { return x.x < y.x; } struct Edge { int v; Edge *next; } pool[5005 << 1], *h[5005]; int fa[5005], dep[5005], ans[5005]; int tot; void addEdge(int u, int v) { Edge *p = &pool[tot++]; p->v = v; p->next = h[u]; h[u] = p; } void dfs(int u) { for (Edge *p = h[u]; p; p = p->next) { int v = p->v; if (v == fa[u]) continue; dep[v] = dep[u] + 1; fa[v] = u; dfs(v); } } int LCA(int u, int v) { if (dep[u] < dep[v]) swap(u, v); while (dep[u] > dep[v]) { u = fa[u]; } if (u == v) return u; while (fa[u] != fa[v]) { u = fa[u]; v = fa[v]; } return fa[u]; } void update(int u, int v, int x) { if (u == v) return; while (u != v) { ans[u] = x; u = fa[u]; } } int check(int u, int v) { int res = 0x3f3f3f3f; if (u == v) return res; while (u != v) { res = min(res, ans[u]); u = fa[u]; } return res; } int main() { scanf( %d , &n); for (int i = 1; i < n; i++) { scanf( %d%d , &U[i], &V[i]); addEdge(U[i], V[i]); addEdge(V[i], U[i]); } dep[1] = 1; dfs(1); scanf( %d , &m); for (int i = 1; i <= m; i++) scanf( %d%d%d , &a[i].a, &a[i].b, &a[i].x); sort(a + 1, a + m + 1, cmp); for (int i = 1; i <= m; i++) { int t = LCA(a[i].a, a[i].b); update(a[i].a, t, a[i].x); update(a[i].b, t, a[i].x); } for (int i = 1; i <= m; i++) { int t = LCA(a[i].a, a[i].b); if (min(check(a[i].a, t), check(a[i].b, t)) != a[i].x) { printf( -1 n ); return 0; } } for (int i = 1; i < n; i++) { if (dep[U[i]] < dep[V[i]]) swap(U[i], V[i]); printf( %d , max(ans[U[i]], 1)); } printf( n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { char a[1010]; cin >> a; int l = strlen(a), dot; for (int i = 0; i < l; i++) { if (a[i] == . ) { dot = i; } } if (a[dot - 1] == 9 ) { cout << GOTO Vasilisa. << endl; } else { if (a[dot + 1] >= 5 ) { a[dot - 1]++; } for (int i = 0; i <= dot - 2; i++) { cout << a[i]; } cout << a[dot - 1] << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 2e6 + 11; int use[N], a[N], b[N]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; use[a[i]] = 1; } for (int j = 1; j <= n; j++) { cin >> b[j]; use[b[j]] = 1; } int kol = 0; for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) { int d = a[i] ^ b[j]; if (d <= 2000000 && use[d] == 1) kol++; } if (kol % 2 == 0) cout << Karen << endl; else cout << Koyomi << endl; }
|
#include <bits/stdc++.h> using namespace std; int n, r, s; long long F[10005] = {1}, I[10005]; long long inv(long long a) { long long ans = 1; for (int k = 998244353 - 2; k; k >>= 1) { if (k & 1) ans = (ans * a) % 998244353; a = a * a % 998244353; } return ans; } long long C(int n, int m) { return n < m ? 0 : F[n] * I[m] % 998244353 * I[n - m] % 998244353; } long long calc(int s, int n, int r) { if (!n) return !s && r >= 0; long long ans = 0; for (int i = 0; i <= n; ++i) { long long t = C(s - r * i + n - 1, n - 1) * C(n, i) % 998244353; if (i & 1) ans = (ans + 998244353 - t) % 998244353; else ans = (ans + t) % 998244353; } return ans; } int main() { scanf( %d%d%d , &n, &s, &r); for (int i = 1; i < 10005; ++i) F[i] = F[i - 1] * i % 998244353; I[10005 - 1] = inv(F[10005 - 1]); for (int i = 10005 - 1; i; --i) I[i - 1] = I[i] * i % 998244353; long long ans = 0; for (int i = max((s + n - 1) / n, r); i <= s; ++i) for (int c = 1; c <= n && c * i <= s; ++c) { ans = (ans + calc(s - c * i, n - c, i) * C(n - 1, c - 1) % 998244353 * inv(c)) % 998244353; } ans = ans * inv(C(s - r + n - 1, n - 1)) % 998244353; printf( %lld n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m; int xans[200005]; bool pos; vector<pair<int, int> > xoc[200005]; vector<pair<int, int> > V[200005]; int erased[200005]; queue<int> toErase; int sgn(int v) { return abs(v) / v; } vector<pair<int, int> > E[200005]; int vis[200005]; int cycleRoot; bool assigned[200005]; bool arcUsed[200005]; void dfs(int u) { vis[u] = 2; for (int i = 0, v, x, i1, i2; i < E[u].size(); i++) { v = E[u][i].first; x = E[u][i].second; if (!assigned[x]) { i1 = xoc[x][1].first == u; i2 = 1 - i1; xans[x] = (xoc[x][i2].second == 1); assigned[x] = true; if (vis[v] != 2) dfs(v); } } } bool findCycle(int u) { vis[u] = 1; for (int i = 0, v, x; i < E[u].size(); i++) { v = E[u][i].first; x = E[u][i].second; if (arcUsed[x]) continue; arcUsed[x] = true; if (vis[v]) { cycleRoot = v; return true; } else if (findCycle(v)) { return true; } } return false; } void makeE(int c1) { for (int i = 0, x, i1, i2, c2; i < V[c1].size(); i++) { x = V[c1][i].first; i1 = xoc[x][1].first == c1; i2 = 1 - i1; c2 = xoc[x][i2].first; if (c1 < c2) { E[c1].push_back(make_pair(c2, x)); E[c2].push_back(make_pair(c1, x)); } } } void erase(int c) { int x, s, i1, i2; for (int i = 0; i < V[c].size(); i++) { x = V[c][i].first; s = V[c][i].second; if (xoc[x].size() == 1) { xans[x] = (xoc[x][0].second == 1); } else { i1 = (xoc[x][1].first == c); i2 = 1 - i1; if (xoc[x][i1].second == xoc[x][i2].second) { xans[x] = xoc[x][i1].second == 1; if (!erased[xoc[x][i2].first]) { erased[xoc[x][i2].first] = 1; erase(xoc[x][i2].first); } } else { if (erased[xoc[x][i2].first]) { xans[x] = xoc[x][i1].second == 1; } else { erased[xoc[x][i2].first] = 1; erase(xoc[x][i2].first); } } } } } int main() { scanf( %d%d , &n, &m); int cs, x, s; for (int i = 0; i < n; i++) { scanf( %d , &cs); for (int j = 0; j < cs; j++) { scanf( %d , &x); s = sgn(x); x = abs(x) - 1; V[i].push_back(make_pair(x, s)); xoc[x].push_back(make_pair(i, s)); } } for (int x = 0, c1, c2; x < m; x++) { if (xoc[x].size() == 1) { c1 = xoc[x][0].first; if (!erased[c1]) { erased[c1] = 1; erase(c1); } } else if (xoc[x].size() == 2 && xoc[x][0].second == xoc[x][1].second) { c1 = xoc[x][0].first; if (!erased[c1]) { erased[c1] = 1; erase(c1); } c2 = xoc[x][1].first; if (!erased[c2]) { erased[c2] = 1; erase(c2); } } } for (int i = 0; i < n; i++) { if (!erased[i]) { makeE(i); } } pos = true; for (int u = 0; u < n; u++) { if (!erased[u] && !vis[u]) { if (findCycle(u)) { dfs(cycleRoot); } else { pos = false; break; } } } if (!pos) printf( NO n ); else { printf( YES n ); for (int i = 0; i < m; i++) printf( %d , xans[i]); printf( n ); } }
|
#include <bits/stdc++.h> using namespace std; const int MX = 1234567; const double PI = acos(-1.0), EPS = 1e-9; long long N, arr[MX]; long long gcd(long long a, long long b) { while (a > 0 && b > 0) { if (a > b) a %= b; else b %= a; } return a + b; } int main() { cin >> N; long long g = 0; for (int i = 0; i < N; i++) cin >> arr[i]; for (int i = 0; i < N; i++) { g = gcd(g, arr[i]); } if (g != 1) { cout << YES n ; cout << 0 << n ; return 0; } int oper = 0; for (int i = 0; i < N; i++) { if (arr[i] % 2 && arr[i + 1] % 2) { i++; oper++; } else if (arr[i] % 2 && arr[i + 1] % 2 == 0) { i++; oper += 2; } } cout << YES n ; cout << oper << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c; scanf( %d%d%d , &a, &b, &c); int ok = 0; if (a == 1 || b == 1 || c == 1) ok = 1; if (a == 3 && b == 3 && c == 3) ok = 1; if (a == 2 && b == 2) ok = 1; if (b == 2 && c == 2) ok = 1; if (a == 2 && c == 2) ok = 1; if (a == 2 && b == 4 && c == 4) ok = 1; if (a == 4 && b == 2 && c == 4) ok = 1; if (a == 4 && b == 4 && c == 2) ok = 1; puts(ok ? YES : NO ); return 0; }
|
#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { f = ch == - ? -1 : 1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) x = x * 10 + ch - 0 , ch = getchar(); return x * f; } const int N = 105; int n, p[N], c[N]; int main() { int T = read(); while (T--) { n = read(); for (int i = 1; i <= n; i++) p[i] = read(), c[i] = read(); p[0] = 0; c[0] = 0; int fl = 1; for (int i = 1; i <= n; i++) { if (c[i] < c[i - 1] || p[i] < p[i - 1]) { fl = 0; break; } if (c[i] - c[i - 1] > p[i] - p[i - 1]) { fl = 0; break; } } if (fl) puts( YES ); else puts( NO ); } }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; char arr[100][100]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> arr[i][j]; if (arr[i][j] == - ) { arr[i][j] = - ; } else { if (i % 2 == 0 && j % 2 == 0) { arr[i][j] = B ; } else if (i % 2 == 0 && j % 2 != 0) { arr[i][j] = W ; } else if (i % 2 != 0 && j % 2 == 0) { arr[i][j] = W ; } else if (i % 2 != 0 && j % 2 != 0) { arr[i][j] = B ; } } cout << arr[i][j]; } cout << endl; } }
|
#include <bits/stdc++.h> using namespace std; template <typename S, typename T> ostream& operator<<(ostream& out, pair<S, T> const& p) { out << ( << p.first << , << p.second << ) ; return out; } template <typename T> ostream& operator<<(ostream& out, vector<T> const& v) { int l = v.size(); for (int i = 0; i < l - 1; i++) out << v[i] << ; if (l > 0) out << v[l - 1]; return out; } const int N = 10000001; int lp[N], primes[N], pcnt; void getSieve() { for (int i = 2; i <= N; i++) { if (lp[i] == 0) { lp[i] = i; primes[pcnt++] = i; } for (int j = 0; j < pcnt and primes[j] <= lp[i] and i * primes[j] <= N; j++) lp[i * primes[j]] = primes[j]; } return; } const int M = 1000100; int k, a, cnt[N], mx; long long cp[N]; int f(long long val) { long long p, d, tot; for (int i = 0; i < pcnt and primes[i] <= val; i++) { d = p = primes[i], tot = 0; while (d <= val and tot < cp[p]) { tot += val / d; d *= p; } if (tot < cp[p]) return 0; } return 1; } int main() { getSieve(); scanf( %d , &k); for (int i = 1; i <= k; i++) { scanf( %d , &a); mx = max(mx, a); cnt[1]++; cnt[a + 1]--; } int p, num; for (int i = 1; i <= mx; i++) { cnt[i] += cnt[i - 1]; num = i; while (num > 1) { p = lp[num]; while (lp[num] == p) { cp[p] += cnt[i]; num /= p; } } } long long lo = mx, hi = (1LL << 45), mid; while (lo < hi) { mid = (lo / 2) + (hi / 2); if (f(mid)) hi = mid; else lo = mid + 1; } cout << hi << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { double r, x, y, z, t; cin >> r >> x >> y >> z >> t; double d = (x - z) * (x - z) + (y - t) * (y - t); d = sqrt(d); double i; for (i = 0; i < 10000000; i++) { if ((i * r) >= d / 2) break; } cout << i << endl; }
|
#include <bits/stdc++.h> using namespace std; int w1, w2, h1, h2; int main() { scanf( %d%d%d%d , &w1, &h1, &w2, &h2); printf( %d n , (h1 + h2) * 2 + 4 + max(w1, w2) * 2); return 0; }
|
#include <bits/stdc++.h> #pragma GCC optimize( O500 ) #pragma comment(linker, /STACK:1677777216 ) #pragma warning(default : 4) using namespace std; const double eps = 1e-12; const int oo = 0x3F3F3F3F; const long long ooLL = 0x3F3F3F3F3F3F3F3FLL; const int MOD = 1000000007; template <typename T> T sqr(T x) { return x * x; } template <typename T> void debpr(const T &); template <typename T1, typename T2> void debpr(const pair<T1, T2> &); template <typename T1, typename T2> void debpr(const vector<T1, T2> &); template <typename T> void debpr(const set<T> &); template <typename T1, typename T2> void debpr(const map<T1, T2> &); template <typename T> void prcont(T be, T en, const string &st, const string &fi, const string &mi) { debpr(st); bool ft = 0; while (be != en) { if (ft) debpr(mi); ft = 1; debpr(*be); ++be; } debpr(fi); } template <typename T> void debpr(const T &a) {} template <typename T1, typename T2> void debpr(const pair<T1, T2> &p) { debpr( ( ); debpr(p.first); debpr( , ); debpr(p.second); debpr( ) ); } template <typename T1, typename T2> void debpr(const vector<T1, T2> &a) { prcont(a.begin(), a.end(), [ , ] , , ); } template <typename T> void debpr(const set<T> &a) { prcont(a.begin(), a.end(), { , } , , ); } template <typename T1, typename T2> void debpr(const map<T1, T2> &a) { prcont(a.begin(), a.end(), { , } , , ); } void deb(){}; template <typename T1> void deb(const T1 &t1) { debpr(t1); debpr( n ); } template <typename T1, typename T2> void deb(const T1 &t1, const T2 &t2) { debpr(t1); debpr( ); debpr(t2); debpr( n ); } template <typename T1, typename T2, typename T3> void deb(const T1 &t1, const T2 &t2, const T3 &t3) { debpr(t1); debpr( ); debpr(t2); debpr( ); debpr(t3); debpr( n ); } template <typename T1, typename T2, typename T3, typename T4> void deb(const T1 &t1, const T2 &t2, const T3 &t3, const T4 &t4) { debpr(t1); debpr( ); debpr(t2); debpr( ); debpr(t3); debpr( ); debpr(t4); debpr( n ); } const double PI = acos(-1.); long long Round(double x) { return x < 0 ? x - .5 : x + .5; } template <typename T> void ass(bool v, const T &x, string m = Fail ) { if (!v) { deb(m); deb(x); throw; } } int main() { void run(); run(); return 0; } long long a[1 << 20]; int n; long long gcd(long long a, long long b) { long long t; while (a) b %= a, t = a, a = b, b = t; return b; } long long mrand() { long long rs = 0; for (int i = (0), _b(60); i < _b; ++i) if (rand() % 2) rs += 1LL << i; return rs; } void run() { scanf( %d , &n); for (int i = (0), _b(n); i < _b; ++i) scanf( %lld , &a[i]); long long rs = 1; srand(2); for (int it = (0), _b(12); it < _b; ++it) { long long t = a[mrand() % n]; unordered_map<long long, int> m; m.reserve(1 << 15); for (int i = (0), _b(n); i < _b; ++i) ++m[gcd(a[i], t)]; vector<pair<long long, long long> > v((m).begin(), (m).end()); for (int i = (0), _b(v.size()); i < _b; ++i) { int z = 0; for (int j = (0), _b(v.size()); j < _b; ++j) if (v[j].first % v[i].first == 0) z += v[j].second; if (z >= (n + 1) / 2) rs = max(rs, v[i].first); } } cout << rs << endl; }
|
#include <bits/stdc++.h> using namespace std; int ispalin(string a) { string b = a; reverse(b.begin(), b.end()); return a == b; } int main() { string str; cin >> str; int N = str.size(); for (int i = 0; i <= N; i++) { for (char xc = a ; xc <= z ; xc++) { string str1; for (int j = 0; j < i; j++) str1 += str[j]; str1 += xc; for (int j = i; j < N; j++) str1 += str[j]; if (ispalin(str1)) { cout << str1; return 0; } } } cout << NA ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int h = n / 2; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (i <= h) { if (j >= h - i && j <= h + i) { cout << D ; } else { cout << * ; } } else { if (j >= i - h && j <= 3 * n / 2 - 1 - i) { cout << D ; } else { cout << * ; } } } cout << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 51; long long ans[maxn], a[maxn]; long long poww(long long a, long long b) { long long res = 1; while (b) { if (b & 1) res = res * a; b /= 2; a = a * a; } return res; } void init() { ans[0] = 1; a[0] = 1; for (long long i = 1; i <= 38; i++) { a[i] = poww(3, i); } for (long long i = 1; i <= 38; i++) { ans[i] = ans[i - 1] + a[i]; } } int main() { ios::sync_with_stdio(false); init(); long long t; cin >> t; while (t--) { long long n; cin >> n; long long m = 0; for (long long i = 38; i >= 1; i--) { if (ans[i - 1] >= n) continue; n -= a[i]; m += a[i]; } if (n > 0) { m += 1; } cout << m << endl; } }
|
#include <bits/stdc++.h> using namespace std; char a[1001][1001]; int d[1001][1001]; int n, m, ans; int main() { cin >> n >> m; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) cin >> a[i][j]; for (int i = n; i > 0; i--) for (int j = m; j > 0; j--) { int cur; d[i][j] = d[i + 1][j] + d[i][j + 1] - d[i + 1][j + 1]; if (a[i][j] == W ) cur = 1; else cur = -1; if (cur != d[i][j]) ans++; d[i][j] = cur; } cout << ans; }
|
#include <bits/stdc++.h> using namespace std; int n, m, k, i, p; int main() { cin >> n; if (n < 3) { cout << -1; } else { for (i = n; i >= 1; i--) { cout << i << ; } } }
|
#include <bits/stdc++.h> using namespace std; const int64_t MOD = 1e9 + 7; const int N = 2e5 + 5; int64_t mpow(int64_t b,int64_t e,int64_t m){ int64_t r = 1; while(e > 0){ if(e & 1){ r = (r*b)%m; } b = (b*b)%m; e >>= 1; } return r; } int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int64_t fact[N],ifact[N]; ifact[0] = fact[0] = 1; for(int i=1;i<N;i++){ fact[i] = (i * fact[i-1]) % MOD; ifact[i] = mpow(fact[i],MOD-2,MOD); } auto comb = [&](int x,int y){ // xCy return (fact[x]*ifact[x-y]%MOD*ifact[y])%MOD; }; int t; cin >> t; while(t--){ int n,l,r; cin >> n >> l >> r; int x = min(1-l,r-n); int L=0,R=n+1; int64_t res = (x*(((n%2)+1)*comb(n,n/2))%MOD)%MOD; res %= MOD; for(int i=x+1;;i++){ while(L+1-i < l) L++; while(R-1+i > r) R--; if(L > (n+1)/2 || n+1-R > (n+1)/2 || R-L-1 < 0) break; if(n%2 == 1){ if(L <= n/2) res = (res+comb(R-L-1,n/2-L))%MOD; if(L <= (n+1)/2) res = (res+comb(R-L-1,(n+1)/2-L))%MOD; }else{ res = (res+comb(R-L-1,n/2-L))%MOD; } } cout << (res%MOD+MOD)%MOD << n ; } }
|
#include <bits/stdc++.h> using namespace std; int nxt() { int x; cin >> x; return x; } int main() { int n = nxt(), k = nxt(); vector<int> a(n); generate(a.begin(), a.end(), nxt); int s = accumulate(a.begin(), a.end(), 0); int ans = 0; while ((s + k * ans) * 1.0 / (n + ans) < k - 0.5) { ans++; } cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; template <typename T> inline void read(T &x) { char c; bool nega = 0; while ((!isdigit(c = getchar())) && (c != - )) ; if (c == - ) { nega = 1; c = getchar(); } x = c - 48; while (isdigit(c = getchar())) x = x * 10 + c - 48; if (nega) x = -x; } template <typename T> inline void writep(T x) { if (x > 9) writep(x / 10); putchar(x % 10 + 48); } template <typename T> inline void write(T x) { if (x < 0) { putchar( - ); x = -x; } writep(x); } template <typename T> inline void writeln(T x) { write(x); putchar( n ); } int n; int ans[100001]; const long long inf = 2250000000000; inline long long cal(const pair<pair<long long, long long>, long long> &first) { return first.first.first * first.first.first + first.first.second * first.first.second; } inline long long mul(long long first, long long second) { return first * first + second * second; } inline bool cmp(const pair<pair<long long, long long>, long long> &a, const pair<pair<long long, long long>, long long> &b) { return cal(a) < cal(b); } pair<pair<long long, long long>, long long> a[100001]; void enter() { read(n); for (int i = 0; i < n; i++) { read(a[i].first.first); read(a[i].first.second); a[i].second = i; } sort(a, a + n, cmp); } void add(long long &first, long long second) { first = first + second; } void sub(long long &first, long long second) { first = first - second; } void progress() { long long first = 0, second = 0; long long xx = 0, yy = 0; for (int i = 0; i < n; i++) { add(xx, a[i].first.first); add(yy, a[i].first.second); if (mul(first + a[i].first.first, second + a[i].first.second) <= mul(first, second)) { add(second, a[i].first.second); add(first, a[i].first.first); ans[a[i].second] = 1; } else { sub(second, a[i].first.second); sub(first, a[i].first.first); ans[a[i].second] = -1; } } while (mul(first, second) > inf) { for (int i = n - 1; i >= 0; i--) { if (ans[a[i].second] == -1 && mul(first + 2 * a[i].first.first, second + 2 * a[i].first.second) <= inf) { add(second, 2 * a[i].first.second); add(first, 2 * a[i].first.first); ans[a[i].second] = 1; } else if (ans[a[i].second] == 1 && mul(first - 2 * a[i].first.first, second - 2 * a[i].first.second) <= inf) { sub(first, 2 * a[i].first.first); sub(second, 2 * a[i].first.second); ans[a[i].second] = -1; } } } } int main() { enter(); progress(); for (int i = 0; i < n; i++) { write(ans[i]); putchar( ); } }
|
#include <bits/stdc++.h> using namespace std; bool visited[100005] = {0}; vector<int> v[100005]; int color[100005]; int dfs(int s) { int result = 0; visited[s] = 1; for (int i = 0; i < v[s].size(); i++) { if (!visited[v[s][i]]) { if (color[v[s][i]] != color[s]) result += (1 + dfs(v[s][i])); else result += dfs(v[s][i]); } } return result; } int main() { int n; cin >> n; for (int i = 0; i < 100005; i++) visited[i] = 0; for (int i = 2; i <= n; i++) { int a; cin >> a; v[i].push_back(a); v[a].push_back(i); } for (int i = 0; i < n; i++) { cin >> color[i + 1]; } cout << (1 + dfs(1)) << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; void dfs(const vector<int> &next, vector<bool> &visited, vector<int> &end, int x) { visited[x] = true; int y = next[x]; if (!visited[y]) { dfs(next, visited, end, y); end[x] = end[y]; } else end[x] = x; } int main() { int n; scanf( %d , &n); vector<int> next(n), deg(n); for (int i = 0; i < n; ++i) { scanf( %d , &next[i]); --next[i]; ++deg[next[i]]; } vector<int> start, end, g_end(n, -1); vector<bool> visited(n, false); for (int i = 0; i < n; ++i) if (deg[i] == 0) { start.push_back(i); dfs(next, visited, g_end, i); end.push_back(g_end[i]); } for (int i = 0; i < n; ++i) if (!visited[i]) { start.push_back(i); dfs(next, visited, g_end, i); end.push_back(g_end[i]); } int cnt = int(start.size()); if (cnt == 1 && deg[start[0]] > 0) printf( 0 n ); else { printf( %d n , cnt); for (int i = 0; i < cnt; ++i) printf( %d %d n , end[i] + 1, start[(i + 1) % cnt] + 1); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MOD = (int)1e9 + 7; const int AL = 26; const int N = (int)1e6 + 9; int powr(int n, int k) { if (k == 0) return 1; int v = powr(n, k / 2); v = (v * 1ll * v) % MOD; if (k & 1) v = (v * 1ll * n) % MOD; return v; } int cnt[AL]; int f[N]; int inv[N]; int C(int a, int b) { if (b == 0) return 1; int v = f[a]; v = (v * 1ll * inv[b]) % MOD; v = (v * 1ll * inv[a - b]) % MOD; return v; } int ways(string a, string b) { for (int j = 0; j < AL; j++) cnt[j] = 0; for (auto x : a) { cnt[x - a ]++; } int answ = 0; int mlt; int sz = a.size(); int nsz; int y; bool ok; for (int i = 0; i < b.size(); i++) { nsz = sz - 1; y = b[i] - a ; ok = false; for (int t = 0; t < y; t++) { if (cnt[t] > 0) ok = true; } if (ok) { mlt = 1; for (int r = AL - 1; r >= 0; r--) { mlt = (mlt * 1ll * C(nsz, cnt[r])) % MOD; nsz -= cnt[r]; nsz += (r == y); } answ = (answ + mlt) % MOD; } cnt[b[i] - a ]--; if (cnt[b[i] - a ] < 0) break; sz--; } return answ; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; f[0] = 1; inv[0] = 1; for (int i = 1; i < N; i++) { f[i] = (1ll * i * f[i - 1]) % MOD; inv[i] = powr(f[i], MOD - 2); } string a, b; cin >> a >> b; cout << (ways(a, b) - ways(a, a) + MOD - 1) % MOD << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; void solution() { long long n, x, m = 0, ans = 0; cin >> n; ans += 2 * n - 1; while (n--) { cin >> x; ans += abs(x - m); m = x; } cout << ans << n ; } int main() { ios ::sync_with_stdio(0); cin.tie(0); long long t; t = 1; while (t--) { solution(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int q; cin >> q; for (int i = 0; i < q; i++) { int n, r; cin >> n >> r; int arr[n]; for (int j = 0; j < n; j++) { cin >> arr[j]; } sort(arr, arr + n); int shots = 0, act[n], p = 0; act[0] = arr[0]; p++; for (int j = 1; j < n; j++) { if (arr[j] == arr[j - 1]) { } else { act[p] = arr[j]; p++; } } for (int j = 0; j < p; j++) { if (act[p - j - 1] - j * r <= 0) { break; } shots++; } cout << shots << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; int ch = 0, nch = 0; int x; int b; if (n >= m) { b = m; } else { b = n; } for (int i = 0; i < n; i++) { cin >> x; if (x % 2 == 0) { ch++; } else { nch++; } } for (int i = 0; i < m; i++) { cin >> x; if (x % 2 == 0) { ch++; } else { nch++; } } if (nch > ch) { if (ch < b) { cout << ch << endl; } else { cout << b << endl; } } else { if (nch < b) { cout << nch << endl; } else { cout << b << endl; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { for (; b; a %= b, swap(a, b)) ; return a; } int n; pair<int, int> board[1001][1001]; int ans[1001][1001]; int dx[5] = {0, 1, -1, 0, 0}; int dy[5] = {0, 0, 0, 1, -1}; bool isValid(int x, int y) { return 1 <= x && x <= n && 1 <= y && y <= n; } int main() { ios::sync_with_stdio(0); cin.tie(0), cout.tie(0); memset(ans, -1, sizeof ans); cin >> n; for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) cin >> board[i][j].first >> board[i][j].second; queue<pair<int, int> > q; for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) { if (board[i][j].first == i && board[i][j].second == j) { ans[i][j] = 0; q.push({i, j}); } } while (!q.empty()) { pair<int, int> cur = q.front(); q.pop(); int x = cur.first, y = cur.second; for (int k = 1; k <= 4; k++) { int cx = x + dx[k], cy = y + dy[k]; if (!isValid(cx, cy)) continue; if (ans[cx][cy] != -1) continue; if (board[cx][cy] != board[x][y]) continue; ans[cx][cy] = k; q.push({cx, cy}); } } for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) { if (ans[i][j] == -1 && board[i][j] == pair<int, int>(-1, -1)) { int x = i, y = j; for (int k = 1; k <= 4; k++) { int cx = x + dx[k], cy = y + dy[k]; if (!isValid(cx, cy)) continue; if (ans[cx][cy] != -1) continue; if (board[cx][cy] != board[x][y]) continue; q.push({cx, cy}); q.push({x, y}); ans[cx][cy] = k; if (k == 1) ans[x][y] = 2; else if (k == 2) ans[x][y] = 1; else if (k == 3) ans[x][y] = 4; else if (k == 4) ans[x][y] = 3; while (!q.empty()) { pair<int, int> cur = q.front(); q.pop(); int x = cur.first, y = cur.second; for (int k = 1; k <= 4; k++) { int cx = x + dx[k], cy = y + dy[k]; if (!isValid(cx, cy)) continue; if (ans[cx][cy] != -1) continue; if (board[cx][cy] != board[x][y]) continue; ans[cx][cy] = k; q.push({cx, cy}); } } break; } } } bool isValid = true; for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) { if (ans[i][j] == -1) isValid = false; } if (!isValid) { cout << INVALID ; return 0; } cout << VALID n ; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { switch (ans[i][j]) { case 0: cout << X ; break; case 1: cout << U ; break; case 2: cout << D ; break; case 3: cout << L ; break; case 4: cout << R ; break; } } cout << n ; } }
|
#include <bits/stdc++.h> using namespace std; const int N = 21, inf = 1e7; int n, k, a[1 << N], pre[1 << N], ns, cs[1 << N]; inline int cmax(int x, int y) { if (x == -1 || y == -1) return x == -1 ? y : x; return a[x] > a[y] ? x : y; } bool E[1 << N][N]; void UPD(int x) { cs[x] = -1; for (int i = (0); i <= (n - 1); ++i) if (E[x][i]) { int nx = cmax(cs[x], x ^ (1 << i)); if (nx != cs[x]) pre[x] = x ^ (1 << i), cs[x] = x ^ (1 << i); } } int teshu[1 << N], g; void change(int u, int v) { int t = u ^ v; t = log2(t), E[u][t] ^= 1, E[v][t] ^= 1; } bool op[1 << N], vis[1 << N]; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> k; for (int i = (0); i <= ((1 << n) - 1); ++i) cin >> a[i], op[i] = op[i >> 1] ^ (i & 1), cs[i] = -1; for (int i = (0); i <= ((1 << n) - 1); ++i) if (!op[i]) for (int j = (0); j <= (n - 1); ++j) E[i][j] = true; for (int i = (0); i <= ((1 << n) - 1); ++i) if (!op[i]) UPD(i); while (k--) { int x = -1, r = -1; for (int i = (0); i <= ((1 << n) - 1); ++i) if (!op[i] && cs[i] != -1 && (x == -1 || a[i] + a[cs[i]] >= r)) x = i, r = a[i] + a[cs[i]]; if (x == -1 || a[x] + a[cs[x]] <= 0) break; ns += a[x], ns += a[cs[x]]; int rn = x; while (rn != cs[x]) change(rn, pre[rn]), rn = pre[rn]; a[cs[x]] = a[x] = -inf; teshu[++g] = x, teshu[++g] = cs[x]; cs[cs[x]] = -1, cs[x] = -1; for (int i = (1); i <= (g); ++i) { int x = teshu[i]; for (int j = (0); j <= (n - 1); ++j) { int v = x ^ (1 << j); cs[v] = -1; if (!op[v]) UPD(v); } } for (int i = (1); i <= (g); ++i) { int u = teshu[i]; if (op[u] == 1) cs[u] = pre[u] = -1; else pre[u] = -1, UPD(u); } for (int i = (1); i <= (g); ++i) vis[teshu[i]] = false; for (int i = (1); i <= (g); ++i) { int x = -1; for (int j = (1); j <= (g); ++j) if (!vis[teshu[j]]) x = teshu[j]; for (int j = (1); j <= (g); ++j) if (!vis[teshu[j]] && cmax(cs[x], cs[teshu[j]]) != cs[x]) x = teshu[j]; vis[x] = true; for (int j = (0); j <= (n - 1); ++j) if (!E[x][j]) { int v = x ^ (1 << j); int nx = cmax(cs[x], cs[v]); if (nx != cs[v]) pre[v] = x, cs[v] = cs[x]; } } } cout << ns << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 100 * 1000 + 5; int l[N]; int w[N]; int getw(long long s, long long e) { if (e % 2) { if (s % 2) { return 2; } return 1; } if (s * 2 > e) { if (s % 2 == e % 2) { return 2; } return 1; } if (s * 4 > e) { return 1; } return getw(s, e / 4); } int getl(long long s, long long e) { if (s * 2 > e) { return 1; } return getw(s, e / 2); } int main() { int n; cin >> n; w[0] = 2, l[0] = 1; for (int i = 1; i <= n; i++) { long long s, e; cin >> s >> e; int x = getw(s, e), y = getl(s, e); if (x == 1) { w[i] = l[i - 1]; } else { w[i] = w[i - 1]; } if (y == 1) { l[i] = l[i - 1]; } else { l[i] = w[i - 1]; } } cout << (w[n] == 1) << << (l[n] == 1); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int M = 10 + 10; int minn0[M][M]; int minn[M][M]; int dig[M]; int dignum; int fac(int x) { int ans = 1; for (int i = 1; i <= x; i++) { ans = ans * i; } return ans; } int ex(int a, int x) { int ans = 1; for (int i = 1; i <= x; i++) { ans = ans * a; } return ans; } void mluckyinn0() { for (int n = 1; n <= 9; n++) { for (int m = 0; m <= n; m++) { minn0[0][m] = 1; int nchm = fac(n) / fac(m) / fac(n - m); int lucky = ex(2, m); int unlucky = ex(8, n - m); minn0[n][m] = nchm * lucky * unlucky; } } } void mluckyinn() { minn[1][0] = 7; minn[1][1] = 2; for (int n = 2; n <= 9; n++) { for (int m = 0; m <= n; m++) { int t1 = 0; if (m - 1 >= 0 && n - 1 >= 0) { t1 = minn0[n - 1][m - 1]; } minn[n][m] = 2 * t1 + 7 * minn0[n - 1][m]; } } } void caldig(int x) { int idx = 0; while (x > 0) { dig[dignum - idx] = x % 10; x = x / 10; idx++; } } int lnum[M]; long long int mod = 1000000000 + 7; int main() { int m; cin >> m; mluckyinn0(); mluckyinn(); int tmp = m; while (tmp > 0) { dignum++; tmp /= 10; } caldig(m); for (int d = 1; d < dignum; d++) { for (int j = 0; j <= d; j++) { lnum[j] = lnum[j] + minn[d][j]; } } int pre = 0; int fi = 0; for (int i = 1; i <= dignum; i++) { int st = 0; if (i == 1) { st = 1; } int y47 = 0; int n47 = 0; for (int j = st; j < dig[i]; j++) { if (j == 4 || j == 7) { y47++; } else { n47++; } } int flag = 0; if (y47 > 0) { flag = 1; } int ndg = dignum - i; for (int j = 0; j <= ndg; j++) { lnum[pre + j] = lnum[pre + j] + minn0[ndg][j] * n47; lnum[pre + j + flag] = lnum[pre + j + flag] + minn0[ndg][j] * y47; } if (dig[i] == 4 || dig[i] == 7) { pre++; } } lnum[pre]++; long long int ans = 0; int sta[M]; for (int i1 = 0; i1 <= 9; i1++) { sta[1] = lnum[i1]; lnum[i1]--; for (int i2 = 0; i2 <= 9; i2++) { sta[2] = lnum[i2]; lnum[i2]--; for (int i3 = 0; i3 <= 9; i3++) { sta[3] = lnum[i3]; lnum[i3]--; for (int i4 = 0; i4 <= 9; i4++) { sta[4] = lnum[i4]; lnum[i4]--; for (int i5 = 0; i5 <= 9; i5++) { sta[5] = lnum[i5]; lnum[i5]--; for (int i6 = 0; i6 <= 9; i6++) { sta[6] = lnum[i6]; lnum[i6]--; int st = i1 + i2 + i3 + i4 + i5 + i6; for (int i7 = st + 1; i7 <= 9; i7++) { sta[7] = lnum[i7]; lnum[i7]--; long long int val = 1; for (int j = 1; j <= 7; j++) { if (sta[j] <= 0) { val = 0; break; } else { val = (val * sta[j]) % mod; } } ans = (ans + val) % mod; lnum[i7]++; } lnum[i6]++; } lnum[i5]++; } lnum[i4]++; } lnum[i3]++; } lnum[i2]++; } lnum[i1]++; } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int32_t main() { ios::sync_with_stdio(0); cout.tie(0); cin.tie(0); long long k; cin >> k; long long sum = 0; map<long long, long long> m; vector<long long> ssum(k, 0), g(5005 * k, -1); vector<vector<long long>> a(k); vector<pair<long long, long long>> v; for (long long i = 0; i < k; ++i) { long long n; cin >> n; a[i].resize(n); for (long long j = 0; j < n; ++j) { cin >> a[i][j]; m[a[i][j]] = v.size(); v.emplace_back(a[i][j], i); ssum[i] += a[i][j]; } sum += ssum[i]; } if (sum % k) { cout << No n ; return 0; } sum /= k; for (long long i = 0; i < k; ++i) { for (long long j = 0; j < (long long)a[i].size(); ++j) { if (m.count(sum - ssum[i] + a[i][j])) { long long id = m[sum - ssum[i] + a[i][j]], u = m[a[i][j]]; if (u != id && v[u].second == v[id].second) continue; g[u] = id; } } } long long timer = 0; vector<long long> dp(1 << k, 0), par(1 << k, 0), head(1 << k, -1); vector<long long> vis(v.size() + 5, 0); for (long long i = 0; i < k; ++i) { for (auto j : a[i]) { long long mask = 0, u = m[j]; ++timer; if (vis[u] || g[u] == -1) continue; while (~u && !vis[u]) { vis[u] = timer; u = g[u]; } if (u == -1 || vis[u] != timer) continue; long long c = 0, x = u, good = 1; while (x != u || !c) { if ((mask >> v[x].second) & 1) good = 0; mask |= (1 << v[x].second); x = g[x]; ++c; } if (good) { dp[mask] = 1; head[mask] = u; } } } dp[0] = 1; for (long long i = 0; i < (1 << k); ++i) { for (long long s = i; s; s = (s - 1) & i) { if (dp[s] && dp[i ^ s]) { dp[i] = 1; par[i] = s; } } } if (!dp[(1 << k) - 1]) { cout << No n ; return 0; } vector<pair<long long, long long>> ans(k); function<void(long long)> getans = [&](long long mask) { if (~head[mask]) { long long u = head[mask], x = g[u]; ans[v[x].second].first = v[x].first; ans[v[x].second].second = v[u].second + 1; while (u != x) { ans[v[g[x]].second].first = v[g[x]].first; ans[v[g[x]].second].second = v[x].second + 1; x = g[x]; } } else { getans(par[mask]); getans(mask ^ par[mask]); } }; getans((1 << k) - 1); cout << Yes n ; for (long long i = 0; i < k; ++i) cout << ans[i].first << << ans[i].second << n ; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, k, len; int i = 1; cin >> n; cin >> k; vector<int> a; while (n > 1) { if (n % (i + 1) == 0) { a.push_back(i + 1); n = n / (i + 1); i -= 1; } i += 1; } len = a.size() - k; if (len >= 0) { for (int i = 0; i < len; i++) { a[len + k - i - 2] = a[len + k - i - 1] * a[len + k - i - 2]; a.pop_back(); } for (int i = 0; i < a.size(); i++) { cout << a[i] << ; } } else { cout << -1; } }
|
#include <bits/stdc++.h> using namespace std; long long ar[100010]; unordered_map<long long, long long> um; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long t, n, x, ans, y, prev; scanf( %lld , &t); long long sm = 0; while (t--) { scanf( %lld , &n); scanf( %lld , &x); for (int i = 0; i < n; i++) { scanf( %lld , &ar[i]); } sm = 0; prev = ans = -1; for (long long i = 0; i < n; i++) { sm = (sm + ar[i]) % x; if (sm && prev == -1) prev = i; if (sm) ans = i + 1; else if (prev != -1) ans = max(ans, i - prev); } cout << ans << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; constexpr long long INF = 2e18; constexpr long long MOD = 1e9 + 7; constexpr long long MAXN = 2e5 + 3; struct Matrix { static constexpr long long MOD = 1e9 + 7; static constexpr long long MAXN = 200, MAXM = 200; array<array<long long, MAXM>, MAXN> mat = {}; long long n, m; Matrix(const long long n, const long long m) : n(n), m(m) {} static long long mod(long long n) { n %= MOD; if (n < 0) n += MOD; return n; } Matrix identity() { assert(n == m); Matrix mat_identity(n, m); for (long long i = 0; i < n; ++i) mat_identity.mat[i][i] = 1; return mat_identity; } Matrix operator*(const Matrix &other) const { assert(m == other.n); Matrix ans(n, other.m); for (long long i = 0; i < n; ++i) for (long long j = 0; j < m; ++j) for (long long k = 0; k < m; ++k) ans.mat[i][j] = mod(ans.mat[i][j] + mat[i][k] * other.mat[k][j]); return ans; } Matrix expo(long long p) { assert(p >= 0); Matrix ans = identity(), cur_power(n, m); cur_power.mat = mat; while (p) { if (p & 1) ans = ans * cur_power; cur_power = cur_power * cur_power; p >>= 1; } return ans; } }; void solve() { long long n; cin >> n; long long b, k, x; cin >> b >> k >> x; vector<long long> fq(10); for (long long i = 0; i < n; ++i) { long long x; cin >> x; ++fq[x]; } Matrix mat(x, x); for (long long j = 0; j < x; ++j) for (long long d = 0; d <= 9; ++d) mat.mat[(10 * j + d) % x][j] += fq[d]; mat = mat.expo(b); Matrix ini(x, 1); ini.mat[0][0] = 1; mat = mat * ini; cout << mat.mat[k].front() << n ; } signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long t = 1; while (t--) solve(); }
|
#include <bits/stdc++.h> using namespace std; inline int Read() { int x(0); char c = getchar(); while (c < 0 || c > 9 ) c = getchar(); while (c >= 0 && c <= 9 ) x = (x << 3) + (x << 1) + c - 0 , c = getchar(); return x; } const int maxn = 1e5 + 9, mod = 998244353, maxm = 409; int n, k, ans; int a[maxn], cnt[maxn], lst[maxn], fir[maxn], bl[maxm], br[maxm], col[maxn], v[maxn], lazy[maxm], f[maxn], sum[maxm][maxn]; inline int G(int x) { while (x > mod) x -= mod; return x; } inline void Fir() { int size(sqrt(n)), pieces(ceil(1.0 * n / size)); for (int i = 1; i < pieces; ++i) { bl[i] = (i - 1) * size + 1; br[i] = i * size; for (int j = bl[i]; j <= br[i]; ++j) col[j] = i; } bl[pieces] = (pieces - 1) * size + 1; br[pieces] = n; for (int j = bl[pieces]; j <= br[pieces]; ++j) col[j] = pieces; for (int i = 1; i <= n; ++i) { lst[i] = fir[a[i]]; fir[a[i]] = i; } } inline void Modify(int l, int r, int val) { int lt(col[l]), rt(col[r]); if (lt == rt) { for (int i = l; i <= r; ++i) { if (val == 1) { if (v[i] + lazy[lt] == k) ans = G(ans - f[i] + mod); } else { if (v[i] + lazy[lt] == k + 1) ans = G(ans + f[i]); } sum[lt][v[i]] = G(sum[lt][v[i]] - f[i] + mod), v[i] += val, sum[lt][v[i]] = G(sum[lt][v[i]] + f[i]); } } else { for (int i = l; i <= br[lt]; ++i) { if (val == 1) { if (v[i] + lazy[lt] == k) ans = G(ans - f[i] + mod); } else { if (v[i] + lazy[lt] == k + 1) ans = G(ans + f[i]); } sum[lt][v[i]] = G(sum[lt][v[i]] - f[i] + mod), v[i] += val, sum[lt][v[i]] = G(sum[lt][v[i]] + f[i]); } for (int i = bl[rt]; i <= r; ++i) { if (val == 1) { if (v[i] + lazy[rt] == k) ans = G(ans - f[i] + mod); } else { if (v[i] + lazy[rt] == k + 1) ans = G(ans + f[i]); } sum[rt][v[i]] = G(sum[rt][v[i]] - f[i] + mod), v[i] += val, sum[rt][v[i]] = G(sum[rt][v[i]] + f[i]); } for (int i = lt + 1; i <= rt - 1; ++i) { if (val == 1) ans = G(ans - sum[i][k - lazy[i]] + mod); else ans = G(ans + sum[i][k + 1 - lazy[i]]); lazy[i] += val; } } } inline void Solve() { ans = f[1] = sum[1][0] = 1; for (int i = 1; i <= n; ++i) { ++cnt[a[i]]; int p(lst[i]), q(lst[p]); if (cnt[a[i]] == 1) Modify(1, i, 1); else if (cnt[a[i]] == 2) { Modify(p + 1, i, 1); Modify(1, p, -1); } else { Modify(p + 1, i, 1); Modify(q + 1, p, -1); } f[i + 1] = ans; sum[col[i + 1]][v[i + 1]] = G(sum[col[i + 1]][v[i + 1]] + f[i + 1]); ans = G(ans + f[i + 1]); } printf( %d , f[n + 1]); } int main() { n = Read(); k = Read(); for (int i = 1; i <= n; ++i) a[i] = Read(); Fir(); Solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; template <class T> void REV(T *a, int n) { reverse(a + 1, a + 1 + n); } template <class T> void SRT(T *a, int n) { sort(a + 1, a + 1 + n); } template <class T> int UNI(T *a, int n) { sort(a + 1, a + 1 + n); return unique(a + 1, a + 1 + n) - (a + 1); } template <class T> int POS(T *a, int n, T v) { return lower_bound(a + 1, a + 1 + n, v) - a; } template <class T> void _R(T &x) { cin >> x; } void _R(int &x) { scanf( %d , &x); } void _R(long long &x) { scanf( %lld , &x); } void _R(double &x) { scanf( %lf , &x); } void _R(char &x) { scanf( %c , &x); } void _R(char *x) { scanf( %s , x); } void R() {} template <class T, class... U> void R(T &head, U &...tail) { _R(head); R(tail...); } template <class T> void _W(const T &x) { cout << x; } void _W(const int &x) { printf( %d , x); } void _W(const long long &x) { printf( %lld , x); } void _W(const double &x) { printf( %.12f , x); } void _W(const char &x) { putchar(x); } void _W(const char *x) { printf( %s , x); } template <class T, class U> void _W(const pair<T, U> &x) { _W(x.F); putchar( ); _W(x.S); } template <class T> void _W(const vector<T> &x) { for (auto i = x.begin(); i != x.end(); _W(*i++)) if (i != x.cbegin()) putchar( ); } void W() {} template <class T, class... U> void W(const T &head, const U &...tail) { _W(head); putchar(sizeof...(tail) ? : n ); W(tail...); } template <typename T> void cmin(T &x, T y) { if (y < x) x = y; } template <typename T> void cmax(T &x, T y) { if (y > x) x = y; } long long sum; int n; int a[200005]; int cnt[64]; void purin_solve() { R(sum, n); memset((cnt), 0, sizeof((cnt))); long long cursum = 0; for (int i = (1); i <= (n); ++i) { long long x; R(x); cursum += x; int c = -1; while (x) { ++c; x >>= 1; } ++cnt[c]; } if (cursum < sum) do { puts( -1 ); return; } while (false); ; long long SUM = 0; int ans = 0; for (int i = 0; i < 64; ++i) { if (SUM >= (1LL << i)) { SUM -= (1LL << i); ++cnt[i]; } if (sum >> i & 1) { int j; for (j = i; j < 64; ++j) { if (cnt[j]) break; }; if (j == 64) do { puts( -1 ); return; } while (false); while (j > i) { --cnt[j]; --j; cnt[j] += 2; ++ans; } assert(cnt[i]); --cnt[i]; } while (cnt[i]) { SUM += (1LL << i); --cnt[i]; } } W(ans); } int main() { cout << fixed << setprecision(12); cerr << fixed << setprecision(12); int t = 1; scanf( %d , &t); while (t--) purin_solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long int k; cin >> k; if (k > 36) cout << -1; else { for (int i = 0; i < k / 2; i++) cout << 8; if (k % 2) cout << 4; } }
|
#include <bits/stdc++.h> using namespace std; char N[(int)1e6 + 5], B[(int)1e6 + 5]; long long n, b, c; inline long long euler(long long n) { long long ans = n; for (int i = 2; i * i <= n; i++) { if (n % i == 0) { ans = ans / i * (i - 1); while (n % i == 0) n /= i; } } if (n > 1) ans = ans / n * (n - 1); return ans; } long long qpow(long long x, long long n, long long mod) { if (n == 0) return 1; long long ans = qpow(x, n >> 1, mod); ans = ans * ans % mod; if (n & 1) ans = ans * x % mod; return ans % mod; } int main() { cin >> B; cin >> N; int xx = strlen(N); int yy = strlen(B); cin >> c; n = 0; long long u = euler(c); if (xx < 10) { for (int i = 0; i < xx; i++) n = n * 10 + N[i] - 0 ; n--; } else { for (int i = 0; i < xx; i++) { n = n * 10 + N[i] - 0 ; n = n % u; } n = ((n - 1) + u) % u; n += u; } for (int i = 0; i < yy; i++) { b = b * 10 + B[i] - 0 ; b = b % c; } long long ans = (b - 1 + c) % c; ans = ans * qpow(b, n, c) % c; if (!ans) cout << c << endl; else cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> double dp[100111], ans; int sz[100111], ds[100111]; std::list<int> edge[100111]; int i, j, n; void dfs(int now, int fa) { ds[now] = ds[fa] + 1; ans += 1 / (double)ds[now]; for (std::list<int>::const_iterator it(edge[now].begin()); it != edge[now].end(); ++it) if (*it != fa) dfs(*it, now); } int main() { scanf( %d , &n); while (--n) { scanf( %d %d , &i, &j); edge[i].push_back(j); edge[j].push_back(i); } dfs(1, 0); printf( %.10lf n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m, jj = 0; long long a[22], b[22]; long long dp[10000][1000]; long long memo(int idx, int cnt) { long long res = (long long)(1e18); if (idx == 2 * n - 1) { if (cnt == 1) res = b[((idx + jj) % n)]; return dp[idx][cnt] = res; } if (dp[idx][cnt] != -1) return dp[idx][cnt]; if (cnt > 0) res = b[((idx + jj) % n)] + memo(idx + 1, cnt - 1); res = min(res, a[((idx + jj) % n)] + memo(idx + 1, cnt + 1)); return dp[idx][cnt] = res; } int main() { memset(dp, -1, sizeof dp); cin >> n >> m; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n; i++) cin >> b[i]; long long mn = memo(0, 0); long long ans = mn; for (jj = 1; jj < n; jj++) { memset(dp, -1, sizeof dp); mn = min(memo(0, 0), mn); } cout << (m / 2 - 1) * mn + ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; vector<int> leftSub[1000005]; vector<int> rightSub[1000005]; int leftSon[1000005], rightSon[1000005]; int maxVal[1000005], minVal[1000005]; int leftMax[1000005]; bool vis[1000005]; bool possible; int n, c, a, b; string d; int cnt; void findDfs(int u) { if (vis[u]) return; vis[u] = true; maxVal[u] = minVal[u] = u; int lmax = 0, rmax = 0; int lmin = n + 1, rmin = n + 1; int Lmax = 0, Rmin = n + 1; for (int i = 0; i < leftSub[u].size(); ++i) { int v = leftSub[u][i]; lmax = max(lmax, v); lmin = min(lmin, v); findDfs(v); Lmax = max(Lmax, maxVal[v]); maxVal[u] = max(maxVal[u], maxVal[v]); minVal[u] = min(minVal[u], minVal[v]); } for (int i = 0; i < rightSub[u].size(); ++i) { int v = rightSub[u][i]; rmax = max(rmax, v); rmin = min(rmin, v); findDfs(v); Rmin = min(Rmin, minVal[v]); maxVal[u] = max(maxVal[u], maxVal[v]); minVal[u] = min(minVal[u], minVal[v]); } if (lmin <= u || lmax >= rmin) { possible = false; return; } if (Lmax >= Rmin) { possible = false; return; } leftMax[u] = Lmax; } void findBoundary() { memset(vis, false, sizeof(vis)); for (int i = n; i >= 1; --i) { if (!vis[i]) { findDfs(i); } } } void dfs(int l, int r) { ++cnt; int lmin = n + 1, lmax = 0; int rmin = n + 1, rmax = 0; if (leftSub[l].size()) { leftSon[l] = l + 1; for (int i = 0; i < leftSub[l].size(); ++i) { int v = leftSub[l][i]; lmin = min(lmin, v); lmax = max(lmax, v); } if (lmin <= l) { possible = false; return; } dfs(l + 1, lmax); } if (rightSub[l].size()) { for (int i = 0; i < rightSub[l].size(); ++i) { int v = rightSub[l][i]; rmin = min(rmin, v); rmax = max(rmax, v); } if (rmin <= cnt) { possible = false; return; } if (leftSub[l].size()) { rightSon[l] = cnt + 1; dfs(cnt + 1, max(r, rmax)); } else { rightSon[l] = l + 1; dfs(l + 1, max(r, rmax)); } } else { if (l == r) return; int leftBound = max(l, cnt); if (leftBound < r) { rightSon[l] = leftBound + 1; dfs(leftBound + 1, r); } } } void print(int u) { if (leftSon[u]) { print(leftSon[u]); } cout << u << ; if (rightSon[u]) { print(rightSon[u]); } } void init() { memset(leftSon, 0, sizeof(leftSon)); memset(rightSon, 0, sizeof(rightSon)); possible = true; cnt = 0; for (int i = 1; i <= n; ++i) { leftMax[i] = 0; } } int main() { while (cin >> n >> c) { for (int i = 0; i < c; ++i) { cin >> a >> b >> d; if (d[0] == L ) { leftSub[a].push_back(b); } else { rightSub[a].push_back(b); } } init(); dfs(1, n); if (!possible) { puts( IMPOSSIBLE ); } else { print(1); puts( ); } } return 0; }
|
#include <bits/stdc++.h> using namespace std; using ll = long long; const int MOD = 998244353; void add(int& a, int b) { a += b; if (a >= MOD) a -= MOD; } int mul(int a, int b) { return ll(a) * b % MOD; } int modinv(int a, int m = MOD) { return a == 1 ? a : m - modinv(m % a, a) * ll(m) / a; } const int MAXV = 4242; int p2[MAXV], invp2[MAXV]; int p2m1[MAXV], invp2m1[MAXV]; void precomp() { p2[0] = 1; for (int i = 1; i < MAXV; i++) { p2[i] = mul(2, p2[i - 1]); } for (int i = 0; i < MAXV; i++) { invp2[i] = modinv(p2[i]); } for (int i = 0; i < MAXV; i++) { p2m1[i] = p2[i] - 1; } for (int i = 1; i < MAXV; i++) { invp2m1[i] = modinv(p2m1[i]); } } const int MAXN = 3010; int N, C; int A[MAXN]; int main() { precomp(); scanf( %d %d , &N, &C); for (int i = 0; i < N; i++) { scanf( %d , &A[i]); A[i]--; } vector<vector<int>> dp(N + 1); dp[0] = {{1}}; if (C > 10) { for (int i = 0; i < N; i++) { vector<int> freq(C); int prod = 1; int cnt_bad = C - 1; for (int j = i; j >= 0; j--) { if (A[i] != A[j]) { if (!freq[A[j]]) { cnt_bad--; } else { prod = mul(prod, invp2m1[freq[A[j]]]); } freq[A[j]]++; prod = mul(prod, p2m1[freq[A[j]]]); } if (cnt_bad == 0) { if (dp[i + 1].size() < dp[j].size() + 1) { dp[i + 1].resize(dp[j].size() + 1); } for (int l = 0; l < int(dp[j].size()); l++) { add(dp[i + 1][l + 1], mul(prod, dp[j][l])); } } } } } else { vector<vector<int>> dp2(1 << C); dp2[0] = {{1}}; for (int i = 0; i < N; i++) { for (int m = (1 << C) - 1; m >= 0; m--) { if (dp2[m | (1 << A[i])].size() < dp2[m].size()) { dp2[m | (1 << A[i])].resize(dp2[m].size()); } for (int l = 0; l < int(dp2[m].size()); l++) { add(dp2[m | (1 << A[i])][l], dp2[m][l]); } } swap(dp[i + 1], dp2[(1 << C) - 1]); dp[i + 1].insert(dp[i + 1].begin(), 0); if (dp2[0].size() < dp[i + 1].size()) { dp2[0].resize(dp[i + 1].size()); } for (int l = 0; l < int(dp[i + 1].size()); l++) { add(dp2[0][l], dp[i + 1][l]); } } } vector<int> ans(N + 1); for (int i = 0; i <= N; i++) { for (int l = 0; l < int(dp[i].size()); l++) { add(ans[l], mul(p2[N - i], dp[i][l])); } } ans[0]--; for (int i = 0; i < N; i++) { add(ans[i], MOD - ans[i + 1]); } for (int i = 0; i <= N; i++) { printf( %d%c , ans[i], n [i == N]); } return 0; }
|
#include <bits/stdc++.h> #pragma comment(linker, /STACK:256000000 ); using namespace std; const int MAX_ARRAY = 100005; string num2str(int i) { stringstream ss; ss << i; return ss.str(); } std::vector<std::string> split(std::string str, std::string pattern) { std::string::size_type pos; std::vector<std::string> result; str += pattern; int size = str.size(); for (int i = 0; i < size; i++) { pos = str.find(pattern, i); if (pos < size) { std::string s = str.substr(i, pos - i); result.push_back(s); i = pos + pattern.size() - 1; } } return result; } bool DesCmp(int a, int b) { return a > b; } int main() { int n; cin >> n; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { cout << (j - 1) * n + ((i + j - 1) % n) + 1 << ; } cout << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; void start() {} int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long t; cin >> t; while (t--) { long long a, b; cin >> a >> b; if (a < b) swap(a, b); b = 2 * b; if (b >= a) cout << b * b << endl; else cout << a * a << endl; } }
|
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; string str; cin >> str; long long count = 0, count2 = 0; for (int i = 0; i < n; i++) { if (str[i] == < ) { count++; } else { break; } } for (int i = n - 1; i >= 0; i--) { if (str[i] == > ) { count2++; } else { break; } } cout << min(count, count2) << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; char a[n][7]; for (int i = 0; i < n; i++) { for (int j = 0; j < 7; j++) cin >> a[i][j]; } int ans = 0, ct = 0; for (int j = 0; j < 7; j++) { ct = 0; for (int i = 0; i < n; i++) { if (a[i][j] == 1 ) ct++; } ans = max(ans, ct); } cout << ans; return 0; }
|
#include <bits/stdc++.h> #pragma GCC optimize(2) using namespace std; inline long long read() { long long x = 0, w = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) w = -1; c = getchar(); } while (c <= 9 && c >= 0 ) { x = (x << 1) + (x << 3) + c - 0 ; c = getchar(); } return w == 1 ? x : -x; } const int N = 1e5 + 10; int a[N], n; int main() { int _ = read(); while (_--) { long long x1 = read(), y1 = read(); long long x2 = read(), y2 = read(); if (x1 == x2 || y1 == y2) { puts( 1 ); continue; } long long ans = (x2 - x1) * (y2 - y1) + 1; printf( %lld n , ans); } }
|
#include <bits/stdc++.h> using namespace std; mt19937 rng(time(0)); uniform_int_distribution<int> uid(-1e9, 1e9); vector<int> g[100002]; int d[100002], u[100002], k; long long res, w[505], v[505]; int find(int x, int px, int sz) { for (auto& i : g[x]) if (i != px && !u[i] && d[i] > sz / 2) return find(i, x, sz); return x; } int dfs(int x, int px) { d[x] = 1; for (auto& i : g[x]) if (i != px && !u[i]) d[x] += dfs(i, x); return d[x]; } void dfs1(int x, int px, int dx) { if (dx <= k) ++w[dx]; for (auto& i : g[x]) if (i != px && !u[i]) dfs1(i, x, dx + 1); } void solve(int x) { int y = find(x, x, dfs(x, x)); u[y] = 1; fill(v, v + k + 1, 0); for (auto& i : g[y]) { if (!u[i]) { fill(w, w + k + 1, 0); dfs1(i, i, 1); res += w[k]; for (int i = 1; i < k; ++i) res += w[i] * v[k - i]; for (int i = 0; i < k; ++i) v[i] += w[i]; } } for (auto& i : g[y]) if (!u[i]) solve(i); } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, x, y; cin >> n >> k; for (int i = 0; i < n - 1; ++i) { cin >> x >> y; g[--x].push_back(--y); g[y].push_back(x); } solve(0); cout << res << n ; }
|
#include <bits/stdc++.h> using namespace std; int n, len, dp[200][100][2][2]; char x[200]; const int unDEF = 10000, INF = 1000000000; int solve(int idx, int left, int dir, int isM) { if (idx < 0) { if (left + dir == 0) { return 0; } if (isM) { return -INF; } return INF; } int &temp = dp[idx][left][dir][isM]; if (temp != unDEF) { return temp; } if (isM) { temp = -INF; } else temp = INF; int sign = dir ? -1 : 1; for (int i = 0; i <= left; i++) { int newDir = (x[idx] != T ) ^ (i & 1); if (newDir) { if (isM) { temp = max(temp, solve(idx - 1, left - i, dir, isM) + sign); } else { temp = min(temp, solve(idx - 1, left - i, dir, isM) + sign); } } else { if (isM) { temp = max(temp, solve(idx - 1, left - i, dir ^ 1, isM)); } else { temp = min(temp, solve(idx - 1, left - i, dir ^ 1, isM)); } } } return temp; } int main() { cin >> x >> n; len = strlen(x); for (int i = 0; i < len; i++) { for (int j = 0; j <= n; j++) { for (int k = 0; k < 2; k++) { for (int l = 0; l < 2; l++) { dp[i][j][k][l] = unDEF; } } } } int ans = 0, a = solve(len - 1, n, 0, 0), b = solve(len - 1, n, 0, 1), c = solve(len - 1, n, 1, 0), d = solve(len - 1, n, 1, 1); if (a < 1000) ans = max(ans, abs(a)); if (c < 1000) ans = max(ans, abs(c)); if (b > -1000) ans = max(ans, abs(b)); if (d > -1000) ans = max(ans, abs(d)); cout << ans << n ; return 0; }
|
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) #pragma GCC target( sse4 ) using namespace std; unsigned int a[100000 + 5], b[100000 + 5], p; int f(int x) { return ~((x - 1) >> 31); } int main() { int n, t, l, r, k, i; long long ans = 0; for (scanf( %d , &n); n--;) { scanf( %d%d%d , &t, &l, &r); if (t == 1) { scanf( %d , &k); p = k > 0 ? k - 1 : -k - 1; if (k > 0) for (i = l; i < r; ++i) a[i] = (a[i] - 1 < p ? a[i] - 1 : p) + 1; else for (i = l; i < r; ++i) b[i] = (b[i] - 1 < p ? b[i] - 1 : p) + 1; } else { for (ans = 0, i = l; i < r; ++i) ans += (a[i] + b[i]) & f(a[i]) & f(b[i]); printf( %I64d n , ans); } } }
|
#include <bits/stdc++.h> using namespace std; long long mod = 1e9; void err(istream_iterator<string> it) {} template <typename T, typename... Args> void err(istream_iterator<string> it, T a, Args... args) { cerr << *it << = << a << endl; err(++it, args...); } long long powm(long long a, long long b, long long mod) { long long res = 1; while (b) { if (b & 1) res = (res * a) % mod; a = (a * a) % mod; b >>= 1; } return res; } bool sortinrev(const pair<int, int> &a, const pair<int, int> &b) { return (a.first > b.first); } void solve() { long long n; cin >> n; vector<long long> a(n); for (long long i = 0; i < (n); i++) { cin >> a[i]; }; if (n == 1) { cout << YES n ; cout << 1 << << a[0] << endl; return; } long long x = 0, y = 0, m = 0; for (long long i = 0; i < (n - 1); i++) { m = max({m, a[i], a[i + 1]}); if (abs(a[i] - a[i + 1]) == 0) { cout << NO n ; return; } if (abs(a[i] - a[i + 1]) != 1 and y == 0) { y = abs(a[i] - a[i + 1]); } else if (abs(a[i] - a[i + 1]) != 1 and y != 0) { if (y != abs(a[i] - a[i + 1])) { cout << NO n ; return; } } } if (y == 0) { cout << YES n ; cout << (mod) << << (mod) << endl; return; } for (long long i = 0; i < (n - 1); i++) { if (abs(a[i] - a[i + 1]) == 1) { if (a[i] % y == 0 and a[i + 1] == a[i] + 1) { cout << NO n ; return; } if (a[i + 1] % y == 0 and a[i] == a[i + 1] + 1) { cout << NO n ; return; } } } cout << YES n ; cout << (m / y) + 1 << << y << endl; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); solve(); }
|
#include <bits/stdc++.h> long long a[100001]; int main() { int n; scanf( %d , &n); int i, j, k; int m = n / 2; for (i = 1; i < n; i += 2) { scanf( %I64d , &a[i]); } long long cur = 100000000000001LL; for (i = n - 1; i >= 1; i -= 2) { bool ok = false; for (k = 2 - a[i] % 2; (long long)(k)*k <= a[i]; k += 2) { if (a[i] % k) continue; long long miden = a[i] / k; if ((miden - k) % 2) continue; long long upper = (a[i] / k) + (k - 1); if (upper + 2 < cur) { ok = true; long long lower = (a[i] / k) - (k - 1); a[i + 1] = ((upper + 2) + (cur - 2)) * ((cur - (upper + 2)) / 2) / 2; cur = lower; break; } } if (!ok) { break; } } a[0] = (1 + (cur - 2)) * ((cur - 1) / 2) / 2; if (a[0] > 0 && i < 1) { puts( Yes ); for (i = 0; i < n; i++) { printf( %I64d%c , a[i], n [i == n - 1]); } } else { puts( No ); } }
|
#include <bits/stdc++.h> const int N = 2001000; int a[N], l[N], r[N], c[N]; int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); int t1 = 0, t2 = -1; for (int i = 1; i <= n; i++) if (a[i] > t2) t2 = a[i], t1 = i; for (int i = 1; i < t1; i++) a[n + i] = a[i]; for (int i = t1; i <= n; i++) a[i - t1 + 1] = a[i]; for (int i = n + 1; i < n + t1; i++) a[i - t1 + 1] = a[i]; for (int i = n; i >= 1; --i) { r[i] = i + 1; while (r[i] <= n && a[i] > a[r[i]]) r[i] = r[r[i]]; if (r[i] <= n && a[i] == a[r[i]]) { c[i] = c[r[i]] + 1; r[i] = r[r[i]]; } } for (int i = 1; i <= n; i++) { l[i] = i - 1; while (l[i] >= 1 && a[i] > a[l[i]]) l[i] = l[l[i]]; if (l[i] >= 1 && a[i] == a[l[i]]) { l[i] = l[l[i]]; } } long long ans = 0; for (int i = 1; i <= n; i++) { ans += c[i]; if (a[i] == a[1]) continue; ans += 2; if (l[i] == 1 && r[i] == n + 1) ans--; } printf( %I64d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * f; } using namespace std; const int N = 20; pair<double, double> p1[N], p2[N]; int n, m; bool tag; int p[N], vis[N]; bool ok(pair<double, double> a, pair<double, double> b, pair<double, double> c, pair<double, double> d) { if (!(min(a.first, b.first) <= max(c.first, d.first) && min(c.second, d.second) <= max(a.second, b.second) && min(c.first, d.first) <= max(a.first, b.first) && min(a.second, b.second) <= max(c.second, d.second))) return 0; double u, v, w, z; u = (c.first - a.first) * (b.second - a.second) - (b.first - a.first) * (c.second - a.second); v = (d.first - a.first) * (b.second - a.second) - (b.first - a.first) * (d.second - a.second); w = (a.first - c.first) * (d.second - c.second) - (d.first - c.first) * (a.second - c.second); z = (b.first - c.first) * (d.second - c.second) - (d.first - c.first) * (b.second - c.second); return (u * v <= 0.00000001 && w * z <= 0.00000001); } void dfs(int now) { bool flag; if (tag) return; if (now > n) { flag = 1; for (int i = 1; i <= n; i++) for (int j = i + 1; j <= n; j++) if (!ok(p1[i], p2[p[i]], p1[j], p2[p[j]])) return; tag = 1; return; } for (int i = 1; i <= m; i++) if (!vis[i]) { p[now] = i; dfs(now + 1); } } int main() { n = read(); m = read(); for (int i = 1; i <= n; i++) scanf( %lf%lf , &p1[i].first, &p1[i].second); for (int i = 1; i <= m; i++) scanf( %lf%lf , &p2[i].first, &p2[i].second); if (n != m) { puts( No ); return 0; } tag = 0; dfs(1); if (tag) puts( Yes ); else puts( No ); return 0; }
|
#include <bits/stdc++.h> using namespace std; inline int BITS(long long __a) { short int __c = 0; __a <<= 1; while (__a) __c += ((__a >>= 1) & 1); return __c; } inline bool prime(int n) { for (int i = 3; i * i <= n; i += 2) if (n % i == 0) return false; return true; } set<int> s; int N, M, V[100010], A[100010]; int main() { cin >> N >> M; for (int i = 0; i < N; i++) cin >> V[i]; s.insert(V[N - 1]); A[N - 1] = 1; for (int i = N - 2; i >= 0; i--) { s.insert(V[i]); A[i] = ((int)s.size()); } for (int i = 0; i < M; i++) { int j; cin >> j; cout << A[j - 1] << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; char s[100100]; char s1[111]; char s2[110]; int main() { scanf( %s%s%s , s, s1, s2); int flag1, flag2; int n = strlen(s); int n1 = strlen(s1); int n2 = strlen(s2); flag1 = flag2 = 0; int i, j; for (i = 0; i < n; i++) { for (j = 0; j < n1; j++) { if (s[i + j] != s1[j]) break; } if (j == n1) { break; } } i += n1; for (; i < n; i++) { for (j = 0; j < n2; j++) { if (s[i + j] != s2[j]) break; } if (j == n2) { flag1 = 1; break; } } for (i = 0; i < n; i++) { for (j = 0; j < n2; j++) { if (s[i + n2 - j - 1] != s2[j]) break; } if (j == n2) { break; } } i += n2; for (; i < n; i++) { for (j = 0; j < n1; j++) { if (s[i + n1 - j - 1] != s1[j]) break; } if (j == n1) { flag2 = 1; break; } } if (flag1 == 0 && flag2 == 0) { printf( fantasy n ); } if (flag1 == 0 && flag2 == 1) { printf( backward n ); } if (flag1 == 1 && flag2 == 0) { printf( forward n ); } if (flag1 == 1 && flag2 == 1) { printf( both n ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, d, sum = 0; cin >> n >> d; vector<pair<int, int> > ins(n); for (int i = 0; i < n; i++) { cin >> ins[i].first; ins[i].second = i + 1; } sort(ins.begin(), ins.end()); int i = 0; while (i < n and ((sum + ins[i].first) <= d)) { sum += ins[i].first; i++; } cout << i << endl; for (int j = 0; j < i; j++) { if (j > 0) cout << ; cout << ins[j].second; } return 0; }
|
#include <bits/stdc++.h> using namespace std; double dp[1050000]; int n, k; double p[25]; double ans[25]; int main() { memset(dp, 0, sizeof(dp)); memset(ans, 0, sizeof(ans)); scanf( %d%d , &n, &k); for (int i = 0; i < n; i++) scanf( %lf , p + i); dp[0] = 1; int st = (1 << n); for (int i = 1; i < st; i++) { double sp = 0; int o = 0; for (int j = 0; j < n; j++) { if (i & 1 << j) o++; else sp += p[j]; } if (o > k) continue; for (int j = 0; j < n; j++) if ((i & 1 << j) && p[j] > 0.000000001) { dp[i] += dp[i - (1 << j)] * p[j] / (sp + p[j]); ans[j] += dp[i - (1 << j)] * p[j] / (sp + p[j]); } } for (int i = 0; i < n; i++) cout << ans[i] << ; cout << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; set<string> st; const int N = 1e6 + 5; int a[3000]; int c1 = 0, c2; string s, c; int na, nb, m, ans = 0, mx = 0; int main() { int n, a, b; cin >> n; while (n--) { cin >> a >> b; if (a == 2) { cout << b / a << endl; continue; } if (a == 1) { cout << b << endl; continue; } if (a % 2 == 1) { cout << b / (a - a / 2) << endl; } else cout << b / (a - (a / 2 - 1)) << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; set<long long> myset; int base; int N; long long A[100005]; map<long long, int> Map; int ANS[600000]; int T[1200000]; int Lo[300000]; int ql, qu; int P[300000]; void update(int ind) { ind += base; T[ind] = ind - base; while (1) { ind /= 2; if (ind < 1) break; T[ind] = T[2 * ind]; if (ANS[T[2 * ind + 1]] > ANS[T[ind]]) T[ind] = T[2 * ind + 1]; } } int query(int ind, int cl, int cu) { if (cu < ql || cl > qu) return -1; if (cl >= ql && cu <= qu) return T[ind]; int ansl = query(2 * ind, cl, (cl + cu) / 2); int ansr = query(1 + 2 * ind, 1 + (cl + cu) / 2, cu); if (ansl == -1 || ansr == -1) return (ansl + ansr + 1); if (ANS[ansl] >= ANS[ansr]) return ansl; return ansr; } int main() { int n; int d; cin >> n >> d; for (__typeof((__typeof(n))0) i((__typeof(n))0); i < n; i++) { scanf( %lld , &A[i]); myset.insert(A[i]); myset.insert(A[i] - d); myset.insert(A[i] + d); } int c = 0; for (__typeof(myset.begin()) it(myset.begin()); it != myset.end(); it++) Map[*it] = c++; N = c; base = 1; while (base < N) base *= 2; for (int i = base; i < 2 * base; i++) T[i] = i - base; for (int i = base - 1; i > 0; i--) { T[i] = T[2 * i]; if (ANS[T[2 * i + 1]] > ANS[T[i]]) T[i] = T[2 * i + 1]; } for (int i = 0; i < n; i++) { long long h = A[i]; int x = Map[h]; int ans = -1; qu = Map[h - d]; ql = 0; ans = query(1, 0, base - 1); ql = Map[h + d]; qu = N - 1; int ans2 = query(1, 0, base - 1); if (ans == -1 || ANS[ans] < ANS[ans2]) ans = ans2; if (ans == -1 || ANS[ans] == 0) { ANS[x] = 1; P[i] = -1; } else { ANS[x] = 1 + ANS[ans]; P[i] = Lo[ans]; } update(x); Lo[x] = i; } int p = 0; for (int i = 0; i < N; i++) if (ANS[i] > ANS[p]) p = i; p = Lo[p]; vector<int> TP; while (p >= 0) { TP.push_back(p + 1); p = P[p]; } reverse(TP.begin(), TP.end()); cout << (int)(TP.size()) << endl; for (__typeof(TP.begin()) i(TP.begin()); i != TP.end(); i++) cout << *i << ; cout << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, x1, y1, x2, y2; long long int answ = 0; cin >> n; for (int i = 0; i < n; i++) { cin >> x1 >> y1 >> x2 >> y2; answ += (x2 - x1 + 1) * (y2 - y1 + 1); } cout << answ; return 0; }
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.