func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; cin >> n; ; long long ans = 0; int arr[n]; for (int i = 0; i < n; i++) { cin >> arr[i]; } sort(arr, arr + n); for (int i = 0; i < n; i++) { ans += abs(i + 1 - arr[i]); } cout << ans; } |
#include <bits/stdc++.h> using namespace std; int fa[100010]; int find(int x) { return fa[x] == x ? x : fa[x] = find(fa[x]); } bool merge(int x, int y) { int f1 = find(x), f2 = find(y); if (f1 == f2) return false; fa[f2] = f1; return true; } int main() { int n, k; scanf( %d %d , &n, &k); int ans = 0; for (int i = 1; i <= n; i++) fa[i] = i; for (int i = 1; i <= k; i++) { int u, v; scanf( %d %d , &u, &v); ans += merge(u, v); } printf( %d n , k - ans); return 0; } |
#include <bits/stdc++.h> using namespace std; inline void open(const char *s) {} inline int rd() { static int x, f; x = 0; f = 1; char ch = getchar(); for (; ch < 0 || ch > 9 ; ch = getchar()) if (ch == - ) f = -1; for (; ch >= 0 && ch <= 9 ; ch = getchar()) x = x * 10 + ch - 0 ; return f > 0 ? x : -x; } const int N = 5010; int n; bool f[N][N]; char s[N], ans[N]; int main() { open( hh ); scanf( %s , s + 1); n = strlen(s + 1); int m = -1; while ((1 << (m + 1)) <= n) ++m; int Max = (1 << m) - 1, nn = n - Max; memset(f[0], 1, sizeof f[0]); for (int i = 1; i <= nn; i++) { char mn = z + 1; for (int j = 0; j <= Max; j++) f[i][j] = f[i - 1][j]; for (int j = 0; j <= Max; j++) if (f[i][j]) mn = min(mn, s[i + j]); for (int j = 0; j <= Max; j++) if (mn != s[i + j]) f[i][j] = 0; for (int j = 0; j <= Max; j++) for (int k = 0; k <= m; k++) if (j >> k & 1) f[i][j] |= f[i][j ^ (1 << k)]; ans[i] = mn; } printf( %s , ans + 1); return 0; } |
#include <bits/stdc++.h> using namespace std; struct edge { int to, cost; edge(int to = 0, int cost = 0) : to(to), cost(cost) {} }; vector<edge> vec[100005]; long long int F[100005], G[100005]; int nd[100005]; int n; long long int mpow(long long int m, long long int t) { if (t == 0) return 1LL; long long int ret = mpow(m * m % 1000000007, t / 2); if (t % 2 == 1) ret = ret * m % 1000000007; return ret; } long long int inv(long long int m) { return mpow(m, 1000000007 - 2); } void dfs(int v = 0, int p = -1) { if (vec[v].size() == 1) { F[v] = G[v] = 0; return; } long long int sumG = 0, sumF = vec[v].size(); for (int i = 0; i < vec[v].size(); i++) { edge e = vec[v][i]; sumG += e.cost; if (sumG >= 1000000007) sumG -= 1000000007; if (e.to != p) { dfs(e.to, v); sumG += G[e.to]; if (sumG >= 1000000007) sumG -= 1000000007; sumF -= F[e.to]; if (sumF < 0) sumF += 1000000007; } } long long int g = inv(sumF); F[v] = g; G[v] = g * sumG % 1000000007; } int main() { scanf( %d , &n); for (int i = 0; i < n - 1; i++) { int a, b, c; scanf( %d %d %d , &a, &b, &c); vec[a].push_back(edge(b, c)); vec[b].push_back(edge(a, c)); } dfs(); printf( %lld n , G[0]); return 0; } |
#include <bits/stdc++.h> using namespace std; int xa, xb, xc, da, db, dc, ta, tb, tc, ans; bool f[42 + 5][42 + 5][42 + 5][8][8][8]; void calc(int a, int b, int c, int aa, int bb, int cc) { if (a < 0 || b < 0 || c < 0) return; if (a == b || a == c || b == c || f[a][b][c][aa][bb][cc]) return; int x = max(a > 42 ? 0 : a, max(b > 42 ? 0 : b, c > 42 ? 0 : c)), y = min(a, min(b, c)); ans = max(ans, x), f[a][b][c][aa][bb][cc] = 1; if (a <= 42) { if (aa == 1 || aa == 7) for (int i = a + da; i >= a - da && i >= y - 1; i--) calc(i, b, c, aa ^ 1, bb, cc); if (aa & 2) { if (b == a - 1 || b == a + 1) calc(a, 42 + 1, c, aa ^ 2, bb, cc); if (c == a - 1 || c == a + 1) calc(a, b, 42 + 1, aa ^ 2, bb, cc); } if ((aa & 4) && !(aa & 2)) for (int i = a + ta; i >= a - ta && i >= y - 1; i--) { if (b == 42 + 1) calc(a, i, c, aa ^ 4, bb, cc); if (c == 42 + 1) calc(a, b, i, aa ^ 4, bb, cc); } } if (b <= 42) { if (bb == 1 || bb == 7) for (int i = b + db; i >= b - db && i >= y - 1; i--) calc(a, i, c, aa, bb ^ 1, cc); if (bb & 2) { if (a == b - 1 || a == b + 1) calc(42 + 2, b, c, aa, bb ^ 2, cc); if (c == b - 1 || c == b + 1) calc(a, b, 42 + 2, aa, bb ^ 2, cc); } if ((bb & 4) && !(bb & 2)) for (int i = b + tb; i >= b - tb && i >= y - 1; i--) { if (a == 42 + 2) calc(i, b, c, aa, bb ^ 4, cc); if (c == 42 + 2) calc(a, b, i, aa, bb ^ 4, cc); } } if (c <= 42) { if (cc == 1 || cc == 7) for (int i = c + dc; i >= c - dc && i >= y - 1; i--) calc(a, b, i, aa, bb, cc ^ 1); if (cc & 2) { if (a == c - 1 || a == c + 1) calc(42 + 3, b, c, aa, bb, cc ^ 2); if (b == c - 1 || b == c + 1) calc(a, 42 + 3, c, aa, bb, cc ^ 2); } if ((cc & 4) && !(cc & 2)) for (int i = c + tc; i >= c - tc && i >= y - 1; i--) { if (a == 42 + 3) calc(i, b, c, aa, bb, cc ^ 4); if (b == 42 + 3) calc(a, i, c, aa, bb, cc ^ 4); } } } void doit() { scanf( %d%d%d%d%d%d%d%d%d , &xa, &da, &ta, &xb, &db, &tb, &xc, &dc, &tc); ans = 0, memset(f, 0, sizeof(f)), calc(xa, xb, xc, 7, 7, 7); printf( %d n , ans); } int main() { doit(); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long INF = LLONG_MAX - 1e10; const long long maxn = 1e6 + 5; const long long mo_num = 1e9 + 7; long long n, m, a[maxn], b[maxn], ans; int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); for (long long i = 1; i <= 4; i++) cin >> a[i]; long long key = 0; if (a[1] == a[4]) { if (!a[3]) key = 1; else if (a[1] > 0) key = 1; } cout << key ? 1 : 0; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; scanf( %d , &t); while (t--) { int x; scanf( %d , &x); bool found = 0; for (int n = 1; n <= 200000; n++) { int lo = 1, hi = n; bool done = 0; while (lo <= hi) { int m = lo + hi >> 1; long long val = 1ll * n * n - 1ll * (n / m) * (n / m); if (val == x) { done = 1; printf( %d %d n , n, m); break; } if (val < x) lo = m + 1; if (val > x) hi = m - 1; } if (done) { found = 1; break; } } if (!found) puts( -1 ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 100; int n, h, l, r, dp[2222][2222], a[2222]; int main() { ios_base::sync_with_stdio(false); cin >> n >> h >> l >> r; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < h; i++) for (int j = 0; j <= n; j++) dp[j][i] = -1e9; dp[0][0] = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < h; j++) { int x = j + a[i]; if (x >= h) x -= h; dp[i + 1][x] = max(dp[i + 1][x], dp[i][j] + (l <= x && x <= r)); int y = j + a[i] - 1; if (y >= h) y -= h; dp[i + 1][y] = max(dp[i + 1][y], dp[i][j] + (l <= y && y <= r)); } } cout << *max_element(dp[n], dp[n] + h); cerr << nTime elapsed: << 1.0 * clock() / CLOCKS_PER_SEC << s. n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int max_n = 1e3 + 5; const int max_p = 1e3 + 5; const int max_k = 50 + 5; bool a[max_n], b[max_n]; int dp[2][max_p][max_k][max_k]; inline void check_max(int &x, int y) { x = max(x, y); } int main() { int n, p, k; scanf( %d%d%d , &n, &p, &k); int r; scanf( %d , &r); for (int i = 1; i <= r; ++i) { int x; scanf( %d , &x); a[x] = true; } int s; scanf( %d , &s); for (int i = 1; i <= s; ++i) { int x; scanf( %d , &x); b[x] = true; } if (p >= 2 * ((n + k - 1) / k)) { int ans = 0; for (int i = 1; i <= n; ++i) ans += a[i] | b[i]; printf( %d n , ans); return 0; } for (int j = 0; j <= p; ++j) for (int l = 0; l < k; ++l) for (int r = 0; r < k; ++r) dp[0][j][l][r] = -1e9; dp[0][p][0][0] = 0; for (int i = 1; i <= n; ++i) { int y = i & 1, x = y ^ 1; for (int j = 0; j <= p; ++j) for (int l = 0; l < k; ++l) for (int r = 0; r < k; ++r) dp[y][j][l][r] = -1e9; for (int j = 0; j <= p; ++j) for (int l = 0; l < k; ++l) for (int r = 0; r < k; ++r) { if (dp[x][j][l][r] >= 0) { check_max(dp[y][j][max(l - 1, 0)][max(r - 1, 0)], dp[x][j][l][r] + ((l > 0 && a[i]) || (r > 0 && b[i]))); if (j > 0) { if (a[i]) check_max(dp[y][j - 1][k - 1][max(r - 1, 0)], dp[x][j][l][r] + 1); if (b[i]) check_max(dp[y][j - 1][max(l - 1, 0)][k - 1], dp[x][j][l][r] + 1); } } } } int x = n & 1, ans = 0; for (int j = 0; j <= p; ++j) for (int l = 0; l < k; ++l) for (int r = 0; r < k; ++r) ans = max(ans, dp[x][j][l][r]); printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; long long calc(long long n, long long k) { long long a = 1, b = 1, c; for (long long i = 1; i <= k; i++) a = a * (n - i + 1), b = b * i; if (k == 4) c = 9; else if (k == 3) c = 2; else if (k == 2) c = 1; else c = 0; return c * a / b; } int main() { long long n, k; cin >> n >> k; long long res = 0; while (k) res += calc(n, k--); cout << res + 1; return 0; } |
#include <bits/stdc++.h> using namespace std; inline long long read() { long long x = 0; char zf = 1; char ch = getchar(); while (ch != - && !isdigit(ch)) ch = getchar(); if (ch == - ) zf = -1, ch = getchar(); while (isdigit(ch)) x = x * 10 + ch - 0 , ch = getchar(); return x * zf; } void write(long long y) { if (y < 0) putchar( - ), y = -y; if (y > 9) write(y / 10); putchar(y % 10 + 48); } void writeln(const long long y) { write(y); putchar( n ); } int i, j, k, m, n, cnt; const double PI = acos(-1.0); struct node { int x, y; } a[3030]; double b[5030]; int main() { n = read(); for (register int i = 1; i <= n; i++) a[i].x = read(), a[i].y = read(); unsigned long long ans = 0; for (register int i = 1; i <= n; i++) { cnt = 0; for (register int j = 1; j <= n; j++) if (i != j) b[++cnt] = atan2(a[j].x - a[i].x, a[j].y - a[i].y); sort(b + 1, b + cnt + 1); for (register int i = cnt + 1; i <= 2 * cnt; i++) b[i] = b[i - cnt] + PI * 2; for (register int j = k = 1; j <= cnt; j++) { if (k < j) k = j; while (k < cnt * 2 && b[k + 1] - b[j] < PI) k++; int sum = k - j, sum2 = cnt - sum - 1; ans += (unsigned long long)sum * (sum - 1) * sum2 * (sum2 - 1) / 4; } } cout << ans / 2; return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> ostream &operator<<(ostream &str, vector<T> &a) { for (auto &i : a) { str << i << ; } return str; } template <class T> istream &operator>>(istream &str, vector<T> &a) { for (auto &i : a) { str >> i; } return str; } template <class T> ostream &operator<<(ostream &str, pair<T, T> &a) { str << a.first << << a.second; return str; } template <class T> istream &operator>>(istream &str, pair<T, T> &a) { str >> a.first >> a.second; return str; } void solve(); signed main() { srand(time(0)); ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout.setf(ios::fixed); cout.precision(6); solve(); return 0; } const long long MOD = 998244353, MAXN = 5e5 + 10, INF = 1e18 + 10, BASE = 37; long long bin_pow(long long a, long long n) { if (n == 0) { return 1; } if (n & 1) { return a * bin_pow(a, n - 1) % MOD; } else { long long tmp = bin_pow(a, n / 2); return tmp * tmp % MOD; } } void solve() { long long n; cin >> n; vector<long long> c(n); cin >> c; sort((c).rbegin(), (c).rend()); long long ans = 0; for (long long i = 0; i < n; ++i) { ans = (ans + i * c[i] % MOD) % MOD; } cout << ans * bin_pow(n, MOD - 2) % MOD << ; vector<long long> ps(n); ps[0] = c[0]; for (long long i = 1; i < n; ++i) { ps[i] = (ps[i - 1] + c[i]) % MOD; } for (long long k = 2; k <= n; ++k) { ans = 0; for (long long i = k - 1; i <= n - 1; i += k) { ans = (ans + ((i / k) * (ps[i] - (i - k == -1 ? 0 : ps[i - k]) + MOD)) % MOD) % MOD; } if (n % k != 0) { ans = (ans + ((n - 1) / k) * (ps[n - 1] - (n - 1 - n % k == -1 ? 0 : ps[n - 1 - n % k]) + MOD) % MOD) % MOD; } cout << ans * bin_pow(n, MOD - 2) % MOD << ; } } |
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( Ofast ) #pragma GCC optimize( unroll-loops ) #pragma GCC optimize( -ffloat-store ) #pragma GCC optimize( -fno-defer-pop ) long long int power(long long int a, long long int b, long long int m) { if (b == 0) return 1; if (b == 1) return a % m; long long int t = power(a, b / 2, m) % m; t = (t * t) % m; if (b & 1) t = ((t % m) * (a % m)) % m; return t; } long long int modInverse(long long int a, long long int m) { return power(a, m - 2, m); } long long int solve(long long int n) { long long int a, b, mid, an = -1, k, l; a = 1; b = 1e9; while (b >= a) { mid = (a + b) / 2; k = mid; l = 0; while (k > 0) { l += (k / 5); k = k / 5; } if (l == n) { an = mid; b = mid - 1; } else if (l > n) { b = mid - 1; } else { a = mid + 1; } } return an; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int i, j, k, l, n; cin >> n; k = solve(n); if (k == -1) { cout << 0 << n ; } else { cout << 5 n ; for (i = k; i < k + 5; i++) { cout << i << ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int nn = 115; const double PI = 2 * acos(0); int main() { int n; double r; double ans; cin >> n >> r; double x = (PI * (180 - (360.0 / n)) / 2.0) / 180.0; double L = 0, R = 1e5; while (L <= R) { double mid = (L + R) / 2.0; if (fabs(cos(x) * (mid + r) - mid) < 1e-9) { ans = mid; break; } else if (cos(x) * (mid + r) > (mid)) { L = mid; } else { R = mid; } } printf( %.6f n , ans); } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, i, o = 0; cin >> n; long long int a[n]; for (i = 0; i < n; ++i) { cin >> a[i]; if (a[i] & 1) o++; } cout << min(o, n - o); } |
#include <bits/stdc++.h> using namespace std; int count(string &s) { int p = 0; for (int i = 0; i < s.length(); i++) { if (s[i] == 1 ) p++; } return p; } int main() { string a, b; cin >> a >> b; int x, y; x = count(a); y = count(b); if (x >= y || (x + 1 == y && x % 2 == 1)) cout << YES ; else cout << NO ; } |
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int n = s.length(); bool sign = false; for (int i = 0; i < n; i++) { if (s[i] == a && !sign) continue; if (s[i] == a && sign) break; s[i]--; sign = true; } if (!sign) s[n - 1] = z ; cout << s << n ; } |
#include <bits/stdc++.h> using namespace std; int q, n, a[200000 + 5], cnt[200000 + 5]; int main() { scanf( %d , &q); for (; q--;) { memset(cnt, 0, sizeof(cnt)); int sum1 = 0, sum2 = 0, tot = 0, m = 0; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); cnt[a[i]]++; m = max(a[i], m); } if (m % 30 == 0 && cnt[m / 2] && cnt[m / 3] && cnt[m / 5]) sum1 = m / 30 * 31; for (int i = 200000; i >= 1; i--) if (cnt[i]) { for (int j = i - 1; j >= 1; j--) if (i % j == 0) cnt[j] = 0; tot++; sum2 += i; if (tot == 3) break; } printf( %d n , max(sum1, sum2)); } return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> inline T sqr(T x) { return x * x; } template <class T> inline T parse(const string &s) { T x; stringstream ss(s); ss >> x; return x; } const double EPS = 1e-12; const int INF = 1000 * 1000 * 1000; const long long LINF = INF * 1ll * INF; const double DINF = 1e200; const double PI = 3.1415926535897932384626433832795l; int gcd(int a, int b) { return a ? gcd(b % a, a) : b; } long long gcd(long long a, long long b) { return a ? gcd(b % a, a) : b; } long long gcdex(long long a, long long b, long long &x, long long &y) { if (!a) { x = 0, y = 1; return b; } long long k = b / a; long long g = gcdex(b - k * a, a, y, x); x -= k * y; return g; } long long inv(long long a, long long m) { assert(m > 1); long long x, y, g; g = gcdex(a, m, x, y); return (x % (m / g) + m / g) % m / g; } long long crt(long long a1, long long m1, long long a2, long long m2) { long long a = (a2 - a1 % m2 + m2) % m2; long long x, y, g; g = gcdex(m1, m2, x, y); if (a % g) return -1; long long m = m1 / g * m2; assert(x + m2 >= 0); x = a / g * (x + m2) % m2; long long r = (a1 + x * m1) % m; assert(r % m1 == a1 && r % m2 == a2); return r; } long long powmod(long long a, long long p, long long m) { assert(p >= 0); long long r = 1; while (p) { if (p & 1) r = r * a % m; p >>= 1; a = a * a % m; } return r; } bool isprime(long long a) { if (a <= 1) return false; for (long long i = 2; i * i <= a; ++i) { if (a % i == 0) return false; } return true; } long long sqrtup(long long a) { if (!a) return 0; long long x = max(0ll, (long long)sqrt((double)a)); while (x * x >= a) --x; while ((x + 1) * (x + 1) < a) ++x; return x + 1; } long long isqrt(long long a) { if (a <= 0) { assert(!a); return 0; } long long x = (long long)sqrt((double)a); while (sqr(x + 1) <= a) ++x; while (x * x > a) --x; return x; } long long sgn(long long x) { return x < 0 ? -1 : x > 0 ? 1 : 0; } template <class T> ostream &operator<<(ostream &s, const vector<T> &v); template <class A, class B> ostream &operator<<(ostream &s, const pair<A, B> &p); template <class K, class V> ostream &operator<<(ostream &s, const map<K, V> &m); template <class T> ostream &operator<<(ostream &s, const set<T> &m); template <class T, size_t N> ostream &operator<<(ostream &s, const array<T, N> &a); template <class... T> ostream &operator<<(ostream &s, const tuple<T...> &t); template <class T> ostream &operator<<(ostream &s, const vector<T> &v) { s << [ ; for (int i = 0; i < (((int)(v).size())); ++i) { if (i) s << , ; s << v[i]; } s << ] ; return s; } template <class A, class B> ostream &operator<<(ostream &s, const pair<A, B> &p) { s << ( << p.first << , << p.second << ) ; return s; } template <class K, class V> ostream &operator<<(ostream &s, const map<K, V> &m) { s << { ; bool f = false; for (const auto &it : m) { if (f) s << , ; f = true; s << it.first << : << it.second; } s << } ; return s; } template <class T> ostream &operator<<(ostream &s, const set<T> &m) { s << { ; bool f = false; for (const auto &it : m) { if (f) s << , ; f = true; s << it; } s << } ; return s; } template <class T> ostream &operator<<(ostream &s, const multiset<T> &m) { s << { ; bool f = false; for (const auto &it : m) { if (f) s << , ; f = true; s << it; } s << } ; return s; } template <class T, class V, class C> ostream &operator<<(ostream &s, const priority_queue<T, V, C> &q) { auto a = q; s << { ; bool f = false; while (!a.empty()) { if (f) s << , ; f = true; s << a.top(); a.pop(); } return s << } ; } template <class T, size_t N> ostream &operator<<(ostream &s, const array<T, N> &a) { s << [ ; for (int i = 0; i < (((int)(a).size())); ++i) { if (i) s << , ; s << a[i]; } s << ] ; return s; } template <class T> ostream &operator<<(ostream &s, const deque<T> &a) { s << [ ; for (int i = 0; i < (((int)(a).size())); ++i) { if (i) s << , ; s << a[i]; } s << ] ; return s; } template <size_t n, class... T> struct put1 { static ostream &put(ostream &s, const tuple<T...> &t) { s << get<sizeof...(T) - n>(t); if (n > 1) s << , ; return put1<n - 1, T...>::put(s, t); } }; template <class... T> struct put1<0, T...> { static ostream &put(ostream &s, const tuple<T...> &t) { return s; } }; template <class... T> ostream &operator<<(ostream &s, const tuple<T...> &t) { s << ( ; put1<sizeof...(T), T...>::put(s, t); s << ) ; return s; } ostream &put3(ostream &s, const char *, bool) { return s; } template <class U, class... T> ostream &put3(ostream &s, const char *f, bool fs, U &&u, T &&...t) { while (*f == ) ++f; if (!fs) s << , ; auto nf = f; int d = 0; while (*nf && (*nf != , || d)) { if (*nf == ( ) ++d; else if (*nf == ) ) --d; ++nf; } auto nf2 = nf; while (nf2 > f && *(nf2 - 1) == ) --nf; fs = *f == ; if (!fs) { s.write(f, nf2 - f); s << = ; }; s << u; if (fs) s << ; if (*nf) ++nf; return put3(s, nf, fs, forward<T>(t)...); } vector<pair<string, string>> solve() { vector<pair<string, string>> R; R.push_back(make_pair( init carry , ddd0uuu )); const int L = 40; for (int i = 0; i < (L); ++i) { string andup = uu10dtr0uel10dddttrudtedddl ; string xordown = d10utled0r0uduuutt1ludtru ; string stepdown = d10ut ; R.push_back(make_pair( pad up , uuued0sdt0uudtddd )); R.push_back(make_pair( pad down , ddeu0sut0ddutuu )); R.push_back(make_pair( x and y , andup)); R.push_back(make_pair( x xor y , xordown)); R.push_back(make_pair( xy xor c , ddd + xordown)); R.push_back(make_pair( xy and c , andup)); R.push_back(make_pair( not1 , uuuu01dt )); R.push_back(make_pair( not2 , u01ut )); R.push_back(make_pair( carry and , d + andup)); R.push_back(make_pair( carry not , uu01ut )); R.push_back(make_pair( 6 steps down , )); for (int j = 0; j < (6); ++j) R.back().second += stepdown; R.push_back(make_pair( carry left , l10rtuuu )); } R.push_back(make_pair( go to ans , rddddd )); R.push_back(make_pair( unpad , )); for (int i = 0; i < (L); ++i) R.back().second += rlt ; return R; } string concat(const vector<pair<string, string>> &S) { string r; for (auto &p : S) r += p.second; return r; } map<pair<int, int>, char> A; void putnum(int a, int x, int y) { while (a) { A[make_pair(x, y)] = 0 + a % 2; a /= 2; --x; } } string bin(int a) { string r; while (a) { r += (char)( 0 + a % 2); a /= 2; } reverse((r).begin(), (r).end()); return r; } string readout(int x, int y) { string r; while (A.count(make_pair(x, y))) { r += A.at(make_pair(x, y)); ++x; } return r; } string sim(const vector<pair<string, string>> &S) { vector<pair<char, char>> st; int x = 0, y = 0; for (auto &sub : S) { for (char c : sub.second) { if (c == t ) { if (A.count(make_pair(x, y))) { int cnt = A.at(make_pair(x, y)) - 0 + 1; for (int qq = 0; qq < (cnt); ++qq) { if (st.empty()) break; c = st.back().first; char pr = st.back().second; st.pop_back(); if (c == 0 || c == 1 || c == e ) { if (!pr) A.erase(make_pair(x, y)); else A[make_pair(x, y)] = pr; continue; } if (c == l ) ++x; else if (c == r ) --x; else if (c == u ) --y; else if (c == d ) ++y; else assert(c == s ); } } } else { st.push_back(make_pair(c, - )); if (c == 0 || c == 1 || c == e ) { st.back().second = A[make_pair(x, y)]; if (c == e ) A.erase(make_pair(x, y)); else A[make_pair(x, y)] = c; } else if (c == l ) --x; else if (c == r ) ++x; else if (c == u ) ++y; else if (c == d ) --y; else assert(c == s ); } } } return readout(x, y); } void test() { auto S = solve(); for (int s = 2; s <= 100; ++s) { for (int a = 1; a < s; ++a) { A.clear(); putnum(a, 0, 0); putnum(s - a, 0, 1); string r = sim(S); string b = bin(s); if (r != b) { do { } while (false); return; } } } do { } while (false); } int main(int argc, char **argv) { ios_base::sync_with_stdio(false); cin.tie(0); cout.precision(20); srand(time(0)); cout << concat(solve()); return 0; } |
#include <bits/stdc++.h> const int N = 1e2 + 9; using namespace std; int n, m; int mp[N][N]; int main() { scanf( %d%d , &n, &m); puts( YES ); memset(mp, 0, sizeof mp); if (m <= n - 2) { int mid = (n + 1) / 2; if (m & 1) { mp[2][mid] = 1; } for (int i = 1; i <= m / 2; i++) { mp[2][mid - i] = mp[2][mid + i] = 1; } } else { for (int i = 2; i < n; i++) { mp[2][i] = 1; } m -= n - 2; int mid = (n + 1) / 2; if (m & 1) { mp[3][mid] = 1; } for (int i = 1; i <= m / 2; i++) { mp[3][mid - i] = mp[3][mid + i] = 1; } } for (int i = 1; i <= 4; i++) { for (int j = 1; j <= n; j++) { if (mp[i][j] == 1) printf( # ); else printf( . ); } puts( ); } } |
#include <bits/stdc++.h> using namespace std; const long long INF = 1e9; const long long MOD = 1e9 + 7; const long long maxn = 2e5 + 7; const long long maxm = 2e5 + 7; int n; bool isPrime(int a) { for (int i = 2; i <= sqrt(a); i++) { if (a % i == 0) { return 0; } } return 1; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; cin >> n; for (int m = 1;; m++) { if (!isPrime(n * m + 1)) { cout << m << endl; return 0; } } return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; using pll = pair<ll, ll>; using ld = long double; const int MN = 5e5 + 5, MM = 1e6 + 3; vector<int> bs; struct Lady { int a, b, c; } ladies[MN]; int bit[MN]; int n; void update(int i, int v) { for (i = MN - i; i < MN; i += i & -i) bit[i] = max(bit[i], v); } int query(int i) { int ret = 0; for (i = MN - i; i; i ^= i & -i) ret = max(ret, bit[i]); return ret; } void getb(int &b) { b = lower_bound((bs).begin(), (bs).end(), b) - bs.begin() + 1; } int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &ladies[i].a); for (int i = 1; i <= n; i++) scanf( %d , &ladies[i].b), bs.push_back(ladies[i].b); for (int i = 1; i <= n; i++) scanf( %d , &ladies[i].c); sort((bs).begin(), (bs).end()); for (Lady &l : ladies) getb(l.b); sort(ladies + 1, ladies + 1 + n, [](Lady a, Lady b) { return a.a > b.a; }); vector<Lady> toadd; int ans = 0; for (int i = 1; i <= n; i++) { if (ladies[i].a != ladies[i - 1].a) { for (Lady &l : toadd) update(l.b, l.c); toadd.clear(); } toadd.push_back(ladies[i]); ans += query(ladies[i].b + 1) > ladies[i].c; } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; vector<pair<double, double> > a; pair<double, double> cur; double r; void findmax(pair<double, double> p) { double y = sqrt(2 * r * 2 * r - abs(p.first - cur.first) * abs(p.first - cur.first)); y += p.second; cur.second = max(cur.second, y); } void doit(double x) { for (double k = 0; k < a.size(); k++) { if (abs(x - a[k].first) <= 2 * r) findmax(a[k]); } a.push_back(cur); } int main() { double x, n; cin >> n >> r; for (double k = 0; k < n; k++) { cin >> x; cur.first = x; cur.second = r; doit(x); } for (double k = 0; k < a.size(); k++) cout << setprecision(17) << a[k].second << ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; int b[100]; for (int i = 0; i < 100; i++) b[i] = 0; int x; for (int i = 0; i < n; i++) { cin >> x; b[x - 1] += 1; } x = b[0]; for (int i = 0; i < 100; i++) { if (b[i] > x) { x = b[i]; } } if (x % k == 0) x = x / k; else x = x / k + 1; x = x * k; k = 0; for (int i = 0; i < 100; i++) if (b[i]) { k += x - b[i]; } cout << k; return 0; } |
#include <bits/stdc++.h> using namespace std; struct node { int point, w; } p[30][30]; int n, m; int s[30][30], w[30][30], Min[30], f[3000000]; int Get() { char c = getchar(); while (!isalpha(c)) c = getchar(); return c; } void init(int x, int y) { int t1 = 0, t2 = 0, mx = 0; for (int i = 1; i <= n; i++) if (s[i][y] == s[x][y]) { t1 |= 1 << (i - 1); t2 += w[i][y]; mx = max(mx, w[i][y]); } p[x][y] = (node){t1, t2 - mx}; } int Getlow(int x) { int ss[200]; int num = 0; if (x == 0) return 1; while (x) { ss[++num] = x % 2; x /= 2; } ss[++num] = 0; for (int i = 1; i <= num; i++) if (ss[i] == 0) return i; } int main() { for (int i = 1; i <= 29; i++) Min[i] = 19240012; for (int i = 1; i <= 3000000 - 1; i++) f[i] = 30000000; cin >> n >> m; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) s[i][j] = Get(); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { cin >> w[i][j]; Min[i] = min(Min[i], w[i][j]); } for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) init(i, j); f[0] = 0; for (int i = 0; i < (1 << n); i++) { int p_ = Getlow(i); f[i | (1 << (p_ - 1))] = min(f[i | (1 << (p_ - 1))], f[i] + Min[p_]); for (int j = 1; j <= m; j++) f[i | p[p_][j].point] = min(f[i | p[p_][j].point], f[i] + p[p_][j].w); } cout << f[(1 << n) - 1] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; string s; cin >> s; int ctra = 0; int ctrb = 0; for (int i = 0; i < n; i++) { if (s[i] == A ) { ctra++; } else { ctrb++; } } if (ctra > ctrb) { cout << Anton ; } else if (ctra < ctrb) { cout << Danik ; } else { cout << Friendship ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, x, y, z; cin >> a >> b >> c; cin >> x >> y >> z; a -= x; b -= y; c -= z; if (a >= 0) a /= 2; if (b >= 0) b /= 2; if (c >= 0) c /= 2; if (a + b + c >= 0) cout << Yes << endl; else cout << No << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, tot, Trie[2000000 + 5][2], Num[2000000 + 5]; long long x; char s[9], ch[20]; int main() { for (scanf( %d , &n); n; n--) { scanf( %s , s); if (s[0] == ? ) { scanf( %s , ch); int len = strlen(ch), u = 0, ans; for (int i = 1; i <= 19; i++) { int j = 0; if (i <= len) { j = ch[len - i] - 0 ; ch[len - i] = 0 ; } if (!Trie[u][j]) { u = -1; break; } u = Trie[u][j]; } if (!~u) ans = 0; else ans = Num[u]; printf( %d n , ans); } else { scanf( %I64d , &x); for (int i = 0, u = 0; i <= 18 || x; i++, x /= 10) { int j = (x % 10) & 1; if (!Trie[u][j]) Trie[u][j] = ++tot; u = Trie[u][j]; Num[u] += (s[0] == + ? 1 : -1); } } } return 0; } |
#include <bits/stdc++.h> using namespace std; int p[300100], l[300100]; vector<int> e[300100]; int f(int x) { while (x != p[x]) { x = p[x] = p[p[x]]; } return x; } pair<int, int> L(int x, int p) { int lon = 0, h1 = 0, h2 = 0, S = e[x].size(); pair<int, int> R; for (int i = 0; i < S; i++) { if (p == e[x][i]) continue; R = L(e[x][i], x); if (R.first > h1) { h2 = max(h1, h2); h1 = R.first; } else if (R.first > h2) { h2 = R.first; } if (R.second > lon) lon = R.second; } lon = max(h1 + h2, lon); return pair<int, int>(h1 + 1, lon); } int main() { stringstream ss; memset(l, 0, sizeof(l)); int n, m, q; scanf( %d %d %d , &n, &m, &q); for (int i = 0; i < n; i++) p[i] = i; int a, b; for (int i = 0; i < m; i++) { scanf( %d %d , &a, &b); a--; b--; e[a].push_back(b); e[b].push_back(a); } bitset<300100> B; queue<int> Q; for (int i = 0; i < n; i++) { if (!B.test(i)) { B.set(i); Q.push(i); while (!Q.empty()) { int x = Q.front(); Q.pop(); for (int j = 0; j < e[x].size(); j++) { if (!B.test(e[x][j])) { B.set(e[x][j]); Q.push(e[x][j]); p[e[x][j]] = i; } } } l[i] = L(i, i).second; } } int c, x, y; for (int i = 0; i < q; i++) { scanf( %d , &c); if (c == 2) { scanf( %d %d , &x, &y); x--; y--; x = f(x); y = f(y); if (x != y) { int m = max(l[x], l[y]); l[x] = max(m, (l[x] + 1) / 2 + (l[y] + 1) / 2 + 1); p[y] = x; } } else if (c == 1) { scanf( %d , &x); x--; printf( %d n , l[f(x)]); } } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( O2 ) using namespace std; const int MAX = 3e5 + 5; const long long MAX2 = 11; const long long MOD = 1000000007; const long long MOD2 = 1000005329; const long long INF = 2e18; const int dr[] = {1, 0, -1, 0, 1, 1, -1, -1, 0}; const int dc[] = {0, 1, 0, -1, 1, -1, 1, -1, 0}; const double pi = acos(-1); const double EPS = 1e-9; const int block = 555; int n; long long a, b, c, mx, ans, nw; string s[MAX]; int main() { cout << fixed << setprecision(10); ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n; for (long long i = 1; i <= n; ++i) cin >> s[i]; for (char tgt = a ; tgt <= z ; ++tgt) { nw = 0; for (long long i = 1; i <= n; ++i) { a = b = c = mx = 0; reverse(s[i].begin(), s[i].end()); for (char j : s[i]) { if (j != tgt) break; ++a; } reverse(s[i].begin(), s[i].end()); for (char j : s[i]) { if (j != tgt) break; ++b; } for (char j : s[i]) { if (j != tgt) c = 0; else ++c, mx = max(c, mx); } if (mx == s[i].size()) nw = min(MOD, nw + (nw + 1) * mx); else nw = max(nw ? a + b + 1 : 0, mx); } ans = max(ans, nw); } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long t; cin >> t; while (t--) { long long n; cin >> n; map<string, int> m; int ans = 0; vector<string> a, b; for (int i = 0; i < n; i++) { string s; cin >> s; if (m[s] != 0) ans++; m[s]++; b.push_back(s); } for (int i = 0; i < n; i++) { string s; s = b[i]; if (m[s] != 1) { m[s]--; while (true) { if (s[3] == 9 ) s[3] = 0 ; else s[3] = ((int)s[3] + 1); if (m[s] == 0) { m[s]++; a.push_back(s); break; } } } else { a.push_back(s); } } cout << ans << endl; for (int i = 0; i < a.size(); i++) { cout << a[i] << endl; } } return 0; } |
#define _CRT_SECURE_NO_WARNINGS #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef unsigned long long ull; #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() //#define endl n #define boostIO() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); ll gcd(ll a, ll b) { return (b == 0 ? a : gcd(b, a % b)); } ll mod = 998244353; ll binpow(ll a, ll n) { ll res = 1; while (n) { if (n & 1) res = (1LL * res * a) % mod; a = (1LL * a * a) % mod; n >>= 1; } return res; } signed main() { int q = 1; //cin >> q; while (q--) { int n; cin >> n; vector<ll> dp(n + 3, 0); dp[1] = 1, dp[2] = 1; for (int i = 3; i <= n; ++i) { dp[i] = dp[i - 1] + dp[i - 2]; if (dp[i] >= mod) dp[i] -= mod; } cout << (dp[n] * binpow(binpow(2, n), mod - 2)) % mod; } } |
#include <bits/stdc++.h> using namespace std; const int N = 100; int n, k[N]; double p[N], p_log[N], p_log_1[N]; priority_queue<pair<double, int>> s; inline double P(int i, int k) { double x = pow(p[i], k); if (x > 1e-6) return log(1 - x); x = -x; return x - x * x / 2 + x * x * x / 3; } void add(int i) { s.push(make_pair(P(i, k[i] + 1) - P(i, k[i]), i)); } int main() { ios_base::sync_with_stdio(0), cin.tie(0); cin >> n; if (n == 1) { puts( 1 ); return 0; } for (int i = 0; i < (int)(n); i++) { int a; cin >> a; p[i] = 1 - a * 1e-2; p_log[i] = log(p[i]); p_log_1[i] = log(1 - p[i]); } double sum = 0; int cnt = n; for (int i = 0; i < (int)(n); i++) sum += P(i, k[i] = 1); double res = exp(sum) * cnt; for (int i = 0; i < (int)(n); i++) add(i); while (cnt <= 1e6) { cnt++; int i = s.top().second; s.pop(); sum -= P(i, k[i]); double x = cnt * exp(sum + p_log[i] * k[i]) * (1 - p[i]); res += x; sum += P(i, ++k[i]); add(i); } printf( %.15f n , (double)res); fprintf(stderr, time = %.2f, cnt = %d n , 1. * clock() / CLOCKS_PER_SEC, cnt); return 0; } |
#include <bits/stdc++.h> using namespace std; long long read() { long long x = 0, f = 1; char ch; while (!isdigit(ch = getchar())) (ch == - ) && (f = -f); for (x = ch ^ 48; isdigit(ch = getchar()); x = (x << 3) + (x << 1) + (ch ^ 48)) ; return x * f; } const long long N = 2e5 + 66; long long n, m, k, A, B, C, AB, tmp1, tmp2, a[N], b[N], tag[N], taga[N], tagb[N], tagab[N]; long long n1[N], n2[N], n3[N]; long long suma[N], sumb[N], sumc[N], sum, ans; bool visa[N], visb[N]; struct seg { long long a, b, c; } tr[N << 2]; void up(long long o) { tr[o].a = tr[(o << 1 | 1)].a; tr[o].b = tr[(o << 1 | 1)].b; tr[o].c = tr[(o << 1 | 1)].c; } void build(long long o, long long l, long long r) { if (l == r) { tr[o].a = n1[l]; tr[o].b = n2[l]; tr[o].c = n3[l]; return; } build((o << 1), l, ((l + r) >> 1)); build((o << 1 | 1), ((l + r) >> 1) + 1, r); up(o); } long long query(long long o, long long l, long long r, long long a) { if (l == r) return suma[max(tr[o].a, a)] + sumb[max(tr[o].b, a)] + sumc[tr[o].c] - b[l] * (max(tr[o].a, a) + max(tr[o].b, a) + tr[o].c + k - a - m); long long t = max(tr[(o << 1)].a, a) + max(tr[(o << 1)].b, a) + tr[(o << 1)].c + k - a; if (t >= m) return query((o << 1), l, ((l + r) >> 1), a); else return query((o << 1 | 1), ((l + r) >> 1) + 1, r, a); } signed main() { n = read(); m = read(); k = read(); for (long long i = 1; i <= n; i++) a[i] = read(), b[i] = a[i]; sort(b + 1, b + 1 + n); long long cur = unique(b + 1, b + 1 + n) - b - 1; for (long long i = 1; i <= n; i++) a[i] = lower_bound(b + 1, b + 1 + cur, a[i]) - b; tmp1 = read(); for (long long i = 1; i <= tmp1; i++) visa[read()] = 1; tmp2 = read(); for (long long i = 1; i <= tmp2; i++) visb[read()] = 1; for (long long i = 1; i <= n; i++) { if (visa[i] && visb[i]) tagab[++AB] = b[a[i]]; else if (visa[i]) taga[++A] = b[a[i]], n1[a[i]]++; else if (visb[i]) tagb[++B] = b[a[i]], n2[a[i]]++; else tag[++C] = b[a[i]], n3[a[i]]++; } if (k > m || (AB + A < k) || (AB + B < k)) { puts( -1 ); return 0; } sort(tagab + 1, tagab + 1 + AB); sort(taga + 1, taga + 1 + A); sort(tagb + 1, tagb + 1 + B); sort(tag + 1, tag + 1 + C); for (long long i = 1; i <= cur; i++) n1[i] += n1[i - 1], n2[i] += n2[i - 1], n3[i] += n3[i - 1]; for (long long i = 1; i <= A; i++) suma[i] = suma[i - 1] + taga[i]; for (long long i = 1; i <= B; i++) sumb[i] = sumb[i - 1] + tagb[i]; for (long long i = 1; i <= C; i++) sumc[i] = sumc[i - 1] + tag[i]; build(1, 0, cur); sum = 0; ans = 1ll << 60; for (long long i = 0, tmp; i <= min(AB, m); i++) { sum += tagab[i]; if (min(A, B) >= k - i && 2 * k - i <= m && i + A + B + C >= m) ans = min(ans, sum + (tmp = query(1, 0, cur, k - i))); } if (ans == (1ll << 60)) puts( -1 ); else printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int n; struct node { int x, index; } a[1010]; bool cmp(node x, node y) { if (x.x != y.x) return x.x > y.x; else return x.index > y.index; } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &a[i].x); a[i].index = i; } sort(a + 1, a + n + 1, cmp); int SUM = 0; for (int i = 1; i <= n; i++) { SUM += ((i - 1) * a[i].x + 1); } printf( %d n , SUM); for (int i = 1; i <= n; i++) { printf( %d , a[i].index); } } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int t; cin >> t; while (t--) { long long int n, a, b, x, y; cin >> n; x = 1 + (n - 1) / 3; long long int sum = 0, k = 1; while (sum < x) { sum += k; k <<= 2; } k >>= 2; sum -= k; y = a = (x - sum - 1 + k); int c[] = {0, 2, 3, 1}; k = 1, b = 0; while (y) { b += c[y % 4] * k; k <<= 2; y >>= 2; } x = a ^ b; if (n % 3 == 1) { cout << a << endl; } else if (n % 3 == 2) { cout << b << endl; } else cout << x << endl; } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast,no-stack-protector,unroll-loops,fast-math ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt,tune=native ) using namespace std; namespace _c { const double pi = acos(-1.0); namespace min { const int i8 = -128; const int i16 = -32768; const int i = -2147483647 - 1; const long long l = -9223372036854775807LL - 1; } // namespace min namespace max { const int i8 = 127; const int i16 = 32767; const int i = 2147483647; const long long l = 9223372036854775807LL; } // namespace max } // namespace _c namespace _f { template <typename T> inline const T gcd(T m, T n) { while (n != 0) { T t = m % n; m = n; n = t; } return m; } template <typename T> inline const T max(const T &a, const T &b) { return a > b ? a : b; } template <typename T> inline const T min(const T &a, const T &b) { return a < b ? a : b; } template <typename T> inline const T abs(const T &a) { return a > 0 ? a : -a; } } // namespace _f namespace io { template <typename T> inline void read(T &t) { register T res = 0, neg = 1; char c = getchar(); for (; !isdigit(c); c = getchar()) { if (c == - ) { neg = -1; } } for (; isdigit(c); c = getchar()) { res = res * 10 + c - 0 ; } t = res * neg; } inline int in() { register int T; read(T); return T; } inline long long in_ll() { register long long T; read(T); return T; } } // namespace io int n; double a[110], ans; int main() { scanf( %d , &n); for (int i = 0; i <= n; i++) { scanf( %lf , a + i); } if (~n & 1) { ans = a[n / 2]; } for (int i = 0; i * 2 <= n; i++) { for (int j = n; j > n / 2; j--) { ans = _f::max(ans, ((n - 2 * i) * a[j] + (2 * j - n) * a[i]) / (2 * (j - i))); } } printf( %.9lf n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX = 100005; const int INF = 1 << 30; int n, m, D; int a[MAX]; vector<int> v[MAX]; int down[MAX]; inline void Down(int x, int fa) { int res = -1; for (int i = 0; i < v[x].size(); i++) { int next = v[x][i]; if (next == fa) continue; Down(next, x); res = max(res, down[next]); } if (res != -1) down[x] = max(down[x], res + 1); } int up[MAX]; inline void Up(int x, int fa) { int max1 = -1, max2 = -1; for (int i = 0; i < v[x].size(); i++) { int next = v[x][i]; if (next == fa) continue; if (down[next] > max1) max2 = max1, max1 = down[next]; else if (down[next] > max2) max2 = down[next]; } int res = -1; for (int i = 0; i < v[x].size(); i++) { int next = v[x][i]; if (next == fa) continue; if (up[x] != -1) up[next] = max(up[next], up[x] + 1); int val = (down[next] == max1 ? max2 : max1); if (val != -1) up[next] = max(up[next], val + 2); Up(next, x); } } int main() { scanf( %d%d%d , &n, &m, &D); for (int i = 1; i <= m; i++) scanf( %d , &a[i]); for (int i = 1; i < n; i++) { int x, y; scanf( %d%d , &x, &y); v[x].push_back(y); v[y].push_back(x); } memset(down, -1, sizeof(down)); memset(up, -1, sizeof(up)); for (int i = 1; i <= m; i++) down[a[i]] = up[a[i]] = 0; Down(1, 0); Up(1, 0); int ans = 0; for (int i = 1; i <= n; i++) if (up[i] <= D && down[i] <= D) ans++; printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int a, b, c, d; double Max(double x, double y, double d) { double temp = (x - d) * (y + d); temp = max((x - d) * (y - d), temp); temp = max((x + d) * (y - d), temp); temp = max((x + d) * (y + d), temp); return temp; } double Min(double x, double y, double d) { double temp = (x - d) * (y - d); temp = min((x - d) * (y + d), temp); temp = min((x + d) * (y - d), temp); temp = min((x + d) * (y + d), temp); return temp; } bool check(double x) { double l1 = Min(a, d, x); double r1 = Max(a, d, x); double l2 = Min(b, c, x); double r2 = Max(b, c, x); if (l1 <= r2 && r1 >= l2) return true; return false; } int main() { while (~scanf( %d %d %d %d , &a, &b, &c, &d)) { double r = max(max(abs(a), abs(b)), max(abs(c), abs(d))); double l = 0.0; int num = 1000000; while (num--) { double mid = (l + r) / 2.0; if (check(mid)) r = mid; else l = mid; } printf( %.11lf n , l); } } |
#include <bits/stdc++.h> using namespace std; const int p = 1000000007; long long quick_mod(long long a, long long b) { long long ans = 1; a %= p; while (b) { if (b & 1) { ans = ans * a % p; b--; } b >>= 1; a = a * a % p; } return ans; } long long C(long long n, long long m) { if (m > n) return 0; long long ans = 1; for (int i = 1; i <= m; i++) { long long a = (n + i - m) % p; long long b = i % p; ans = ans * (a * quick_mod(b, p - 2) % p) % p; } return ans; } long long Lucas(long long n, long long m) { if (m == 0) return 1; return C(n % p, m % p) * Lucas(n / p, m / p) % p; } int main() { long long ans = 1; int n, cnt, x; scanf( %d%d , &n, &cnt); for (int i = 2; i <= n; i++) { scanf( %d , &x); long long t = C(cnt + x - 1, x - 1) % p; ans = ans * t % p; cnt += x; } printf( %d , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; int cnt = 0, rem = m; int arr[10000]; for (int i = 0; i < n; i++) cin >> arr[i]; for (int i = 0; i < n; i++) { if (rem >= arr[i]) rem -= arr[i]; else { cnt++; rem = m; rem -= arr[i]; } } cout << cnt + 1; } |
#include <bits/stdc++.h> using namespace std; long long a[200500]; long long res[200500]; long long n; bool check(long long x) { for (long long i = 0; i < n; i++) { res[i] = 0; } for (long long i = n - 1; i >= 2; i--) { long long f = (a[i] + res[i]) - x; if (f < 0) { return false; } long long k = min((f / 3), (a[i] / 3)); res[i - 1] += k; res[i - 2] += 2 * k; } if (a[0] + res[0] < x) { return false; } if (a[1] + res[1] < x) { return false; } return true; } signed main() { long long t; cin >> t; while (t--) { cin >> n; for (long long i = 0; i < n; i++) { cin >> a[i]; } long long l = 0, r = 2000000000; while (r - l > 1) { long long mid = (l + r) / 2; if (check(mid)) { l = mid; } else { r = mid; } } cout << l << n ; } } |
#include <bits/stdc++.h> using namespace std; const int maxn = 3e5; int l = 0; int r = 0; int res = 0; int f[maxn + 11][55]; int a[maxn + 11]; int cnt[maxn + 11]; void add(int x) { if (!cnt[a[x]]) res++; cnt[a[x]]++; } void del(int x) { cnt[a[x]]--; if (!cnt[a[x]]) res--; } int calc(int L, int R) { while (r < R) add(++r); while (r > R) del(r--); while (l > L) add(--l); while (l < L) del(l++); return res; } void solve(int k, int l, int r, int al, int ar) { int mid = (l + r) >> 1; if (l > r || al > ar) return; int ind = 0; for (int i = al; i <= min(ar, mid - 1); i++) { if (f[i][k - 1] + calc(i + 1, mid) > f[mid][k]) { f[mid][k] = f[i][k - 1] + calc(i + 1, mid); ind = i; } } solve(k, l, mid - 1, al, ind); solve(k, mid + 1, r, ind, ar); } int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); int n, k; cin >> n >> k; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= k; i++) solve(i, 1, n, 0, n); cout << f[n][k] << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int a[100][3]; int n = 0; cin >> n; for (int i = 0; i < n; i++) { for (int j = 0; j < 3; j++) { cin >> a[i][j]; } } int s = 1; int m = 0; int f = 0; int cou = 0; int back = 0; for (int k = 0; k < n; k++) { if (a[k][0] == s && a[k][1] != back) { back = s; s = a[k][1]; m += a[k][2]; cou++; k = -1; } if (k == n - 1) { for (int k2 = 0; k2 < n; k2++) { if (a[k2][1] == s && a[k2][0] != back) { back = s; s = a[k2][0]; f += a[k2][2]; cou++; k = -1; k2 = n; } } } if (cou == n) { k = n; } } if (m > f) cout << f << endl; else cout << m << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long int power(long long int first, long long int n) { if (n == 0) return 1; else if (n % 2 == 0) { long long int second = power(first, n / 2); return second * second; } else return first * power(first, n - 1); } int strTOint(string s) { stringstream ss; int first; ss << s; ss >> first; return first; } double geo_dist(int a, int b, int c, int d) { double dd = (double)(a - c) * (a - c) + (b - d) * (b - d); double r = sqrt(dd) + 1e-9; return r; } long long int bigmod(long long int a, long long int p, long long int m) { if (p == 0) return 1 % m; if (p % 2 == 0) { long long int second = bigmod(a, p / 2, m); return (second * second) % m; } else { return (a * bigmod(a, p - 1, m)) % m; } } long long int first, second, d, g; void ext_gcd(long long int a, long long int b) { if (b == 0) { first = 1; second = 0; d = a; return; } ext_gcd(b, a % b); long long int x1 = second; long long int y1 = first - (a / b) * second; first = x1; second = y1; } long long int modInv(long long int a, long long int m) { ext_gcd(a, m); first %= m; if (first < 0) first += m; return first; } int fx[] = {0, 0, -1, 1, -1, 1, 1, -1}; int fy[] = {1, -1, 0, 0, 1, 1, -1, -1}; map<string, int> mp; vector<pair<int, int> > adj[1000]; vector<int> v; int main() { long long int n, m; cin >> n >> m; long long int a, b, c, d, e, a1, b1, c1, d1, e1; long long int sum = 0; int j = 0; a = n / 5; a1 = m / 5; a *= a1; sum += a; for (int i = 1; i <= 4; i++) { j = 5 - i; j %= 5; a = n / 5; if (n % 5 >= i) a++; a1 = m / 5; if (m % 5 >= j) a1++; a *= a1; sum += a; } cout << sum << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); int n, m, m1, arr[9] = {0}, num = 0, num1 = 0; cin >> n >> m, m1 = m; if (n == 1 && m == 0) cout << 0 0 ; else if (9 * n < m || m == 0) cout << -1 -1 ; else { num1 = 1; while (m - (num1) > (n - 1) * 9) num1++; cout << num1; num += num1; num1 = 0; for (int i = 1; i < n; i++) { while (m - (num1 + num) > (n - (i + 1)) * 9) num1++; cout << num1; num += num1; num1 = 0; } num = 0; cout << ; for (int i = 8; i >= 0; i--) { arr[i] = m1 / (i + 1); m1 %= (i + 1); num += arr[i]; } for (int i = 8; i >= 0; i--) while (arr[i]--) cout << i + 1; while (num < n) cout << 0 , num++; } return 0; } |
#include <bits/stdc++.h> using namespace std; using namespace rel_ops; using ll = int64_t; using Pii = pair<int, int>; using ull = uint64_t; using Vi = vector<int>; void run(); int main() { cin.sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(10); run(); return 0; } int uplg(int n) { return 32 - __builtin_clz(n); } int uplg(ll n) { return 64 - __builtin_clzll(n); } struct Vert { int ver{-1}; int defPar{-1}, par; bool defBlocked{1}, blocked; }; int hei, wid, nQuestions; vector<Vert> G; set<Pii> permEdges, tempEdges; int currentVer = 1; void update(int i) { if (G[i].ver != currentVer) { G[i].ver = currentVer; G[i].par = G[i].defPar; G[i].blocked = G[i].defBlocked; } } int find(int i) { update(i); if (G[i].par == -1) return i; return G[i].par = find(G[i].par); } int join(int i, int j) { i = find(i); j = find(j); if (i == j) return i; if (rand() % 2) swap(i, j); return G[i].par = j; } int ind(int first, int second) { return first * wid + second; } Vert& vert(int i) { update(i); return G[i]; } Vert& vert(int first, int second) { return vert(ind(first, second)); } void eachNeigh(int i, int j, function<void(int, int)> func) { for (int dx = (-1); dx < (2); dx++) for (int dy = (-1); dy < (2); dy++) if (dx != 0 || dy != 0) { int first = i + dx, second = j + dy; if (first >= 0 && second >= 0 && first < hei && second < wid) { func(first, second); } } } void addEdges(int i, int j) { assert(vert(i, j).blocked); eachNeigh(i, j, [&](int first, int second) { if (vert(first, second).blocked) return; eachNeigh(first, second, [&](int a, int b) { if (vert(a, b).blocked) { int p1 = find(ind(i, j)), p2 = find(ind(a, b)); tempEdges.insert({p1, p2}); tempEdges.insert({p2, p1}); } }); }); } void query() { int k; cin >> k; vector<Pii> toBlock(k); for (auto& p : (toBlock)) cin >> p.first >> p.second; Vi toCheck; currentVer++; tempEdges.clear(); for (auto& p : (toBlock)) { vert(p.first, p.second).blocked = 1; toCheck.push_back(find(ind(p.first, p.second))); eachNeigh(p.first, p.second, [&](int i, int j) { if (vert(i, j).blocked) { toCheck.push_back(find(ind(i, j))); join(ind(i, j), ind(p.first, p.second)); } }); addEdges(p.first, p.second); toCheck.push_back(find(ind(p.first, p.second))); eachNeigh(p.first, p.second, [&](int i, int j) { if (vert(i, j).blocked) { toCheck.push_back(find(ind(i, j))); } }); } int top = find(ind(0, 3)), bottom = find(ind(3, 0)); toCheck.push_back(top); toCheck.push_back(bottom); for (auto& i : (toCheck)) if (find(i) == top) { for (auto& j : (toCheck)) if (find(j) == bottom) { if (permEdges.count({i, j}) || tempEdges.count({i, j})) { cout << NO << endl; return; } } } cout << YES << endl; } void run() { cin >> hei >> wid >> nQuestions; hei += 2; wid += 2; G.resize(hei * wid); for (int i = (0); i < (3); i++) { vert(i, 0).defBlocked = vert(0, i).defBlocked = 0; vert(hei - i - 1, wid - 1).defBlocked = vert(hei - 1, wid - i - 1).defBlocked = 0; } for (int i = (1); i < (hei - 1); i++) { string tmp; cin >> tmp; for (int j = (1); j < (wid - 1); j++) vert(i, j).defBlocked = (tmp[j - 1] == # ); } for (int first = (0); first < (hei); first++) for (int second = (0); second < (wid); second++) { auto& cur = vert(first, second); if (!cur.defBlocked) continue; eachNeigh(first, second, [&](int i, int j) { if (vert(i, j).defBlocked) { join(ind(first, second), ind(i, j)); } }); } for (auto& v : (G)) v.defPar = v.par; currentVer++; for (int i = (0); i < (hei); i++) for (int j = (0); j < (wid); j++) { auto& cur = vert(i, j); if (cur.defBlocked) addEdges(i, j); } swap(tempEdges, permEdges); while (nQuestions--) query(); } |
#include <bits/stdc++.h> using namespace std; int piles[105]; int main() { int n; cin >> n; vector<int> A(n); for (int i = 0; i < n; ++i) cin >> A[i]; sort(A.begin(), A.end()); for (int i = 0; i < n; ++i) { bool flag = false; for (int j = 0; j <= A[i]; ++j) if (piles[j]) { --piles[j]; ++piles[j + 1]; flag = true; break; } if (!flag) piles[1] += 1; } int cnt = 0; for (int i = 1; i < 105; ++i) cnt += piles[i]; cout << cnt; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 10005; long long int p[N], s[N], n, c; long long int dp[2][N]; int main() { cin >> n >> c; for (int i = 0; i < n; i++) cin >> p[i]; for (int i = 0; i < n; i++) cin >> s[i]; dp[0][0] = p[0]; dp[0][1] = s[0]; int row = 1; for (int i = 1; i < n; i++) { for (int j = 0; j <= i + 1; j++) { dp[row][j] = (long long)(1e18); if (j != i + 1) dp[row][j] = dp[1 - row][j] + j * c + p[i]; if (j != 0) dp[row][j] = min(dp[row][j], dp[1 - row][j - 1] + s[i]); } row = 1 - row; } row = 1 - row; long long ansa = (long long)(1e18); for (int j = 0; j <= n; j++) ansa = min(ansa, dp[row][j]); cout << ansa << endl; return 0; } |
#include <bits/stdc++.h> std::set<int> s; std::vector<bool> wh; bool push(int n) { for (int it = 1; it < 32; ++it) { if (!wh[n >> it]) { s.erase(n); wh[n] = false; s.insert(n >> it); wh[n >> it] = true; return true; } } return false; } void solution() { int n, temp; scanf( %d , &n); wh.resize(1000000001, false); wh[0] = true; while (n-- > 0) { scanf( %d , &temp); s.insert(temp); wh[temp] = true; } while (push(*(s.rbegin()))) ; for (auto it : s) { printf( %d , it); } } int main() { solution(); return 0; } |
#include <bits/stdc++.h> using namespace std; char buf[1000000]; vector<vector<int> > g; vector<bool> used; vector<long long> border, space, w, h; vector<int> tp; void dfs(int v) { used[v] = true; for (int i = (0); i < (int((g[v]).size())); ++i) if (!used[g[v][i]]) dfs(g[v][i]); if (tp[v] == 0) { long long W = 0, H = 0; for (int i = (0); i < (int((g[v]).size())); ++i) { W += w[g[v][i]]; H = max(H, h[g[v][i]]); } if (int((g[v]).size()) == 0) return; W += (int((g[v]).size()) - 1) * space[v] + 2 * border[v]; H += 2 * border[v]; w[v] = W; h[v] = H; return; } if (tp[v] == 1) { long long W = 0, H = 0; for (int i = (0); i < (int((g[v]).size())); ++i) { H += h[g[v][i]]; W = max(W, w[g[v][i]]); } if (int((g[v]).size()) == 0) return; H += (int((g[v]).size()) - 1) * space[v] + 2 * border[v]; W += 2 * border[v]; w[v] = W; h[v] = H; return; } } int main() { g.resize(110); map<string, int> M; int it = 0; int n; cin >> n; vector<string> names; for (int i = (0); i < (n); ++i) { string s; scanf( %s , buf); s = buf; if (s == HBox ) { scanf( %s , buf); s = buf; M[s] = it; names.push_back(s); tp.push_back(0); w.push_back(0); h.push_back(0); border.push_back(0); space.push_back(0); it++; continue; } if (s == VBox ) { scanf( %s , buf); s = buf; M[s] = it; names.push_back(s); tp.push_back(1); w.push_back(0); h.push_back(0); border.push_back(0); space.push_back(0); it++; continue; } if (s == Widget ) { scanf( %s , buf); s = buf; string nm = ; int j = 0; while (s[j] != ( ) { nm.push_back(s[j]); j++; } M[nm] = it; names.push_back(nm); long long W, H; W = H = 0; j++; while (s[j] != , ) { W = W * 10 + (s[j] - 0 ); j++; } j++; while (s[j] != ) ) { H = H * 10 + (s[j] - 0 ); j++; } tp.push_back(2); w.push_back(W); h.push_back(H); border.push_back(0); space.push_back(0); it++; continue; } for (int j = (0); j < (int((s).size())); ++j) if (s[j] == , || s[j] == ( || s[j] == . || s[j] == ) ) s[j] = ; stringstream sin; sin << s; vector<string> q; while (sin >> s) q.push_back(s); if (q[1] == pack ) { g[M[q[0]]].push_back(M[q[2]]); } else { long long t = 0; for (int j = (0); j < (int((q[2]).size())); ++j) t = t * 10 + (q[2][j] - 0 ); if (q[1] == set_border ) border[M[q[0]]] = t; else space[M[q[0]]] = t; } } used.resize(it, false); for (int i = (0); i < (it); ++i) { if (!used[i]) dfs(i); } vector<pair<string, int> > res; for (int i = (0); i < (it); ++i) res.push_back(make_pair(names[i], i)); sort((res).begin(), (res).end()); for (int i = (0); i < (it); ++i) { int j = res[i].second; cout << names[j] << << w[j] << << h[j] << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int Array[10005]; int main() { int N, m, i, j, l, r, x, Count; scanf( %d%d , &N, &m); for (i = 1; i <= N; i++) scanf( %d , Array + i); for (i = 1; i <= m; i++) { Count = 0; scanf( %d%d%d , &l, &r, &x); for (j = l; j <= r; j++) { if (Array[j] < Array[x]) Count++; } if (Count == x - l) puts( Yes ); else puts( No ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int M = 105; const int MOD = 1e6 + 3; struct matrix { int val[M][M]; int n; matrix(int nn, int x = 0) { n = nn; for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) if (i != j) val[i][j] = 0; else val[i][j] = x; } int* operator[](int x) { return val[x]; } matrix operator*(matrix b) { matrix ans(n, 0); for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) for (int k = 0; k < n; k++) ans[i][k] += 1LL * val[i][j] * b[j][k] % MOD, ans[i][k] %= MOD; return ans; } }; matrix operator^(matrix a, long long b) { matrix ans(a.n, 1); while (b) { if (b & 1) ans = ans * a; a = a * a; b >>= 1; } return ans; } int main() { long long n; int w, h; cin >> n >> w >> h; matrix mat(w + 1, 0); for (int i = 0; i < w; i++) mat[i][i + 1] = 1; int k = 1; for (int i = w; i >= 0; i--) { mat[w][i] = k; k = 1LL * k * h % MOD; } mat = mat ^ n; cout << (mat[w][w - 1] + mat[w][w]) % MOD << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; struct re { int x, y; }; int n, K, f[2001][2001]; char mp[2001][2001]; vector<re> A, B, zy[4001]; string Ans; void upd(int &x, int y) { if (y <= K) { if (x == -1) x = y; if (y < x) x = y; } } int main() { scanf( %d%d , &n, &K); for (int i = 1; i <= n; ++i) scanf( %s , mp[i] + 1); for (int i = 1; i <= n; ++i) for (int j = 1; j <= n; ++j) { f[i][j] = -1; zy[i + j - 1].push_back((re){i, j}); } if (mp[1][1] == a ) { Ans.push_back( a ); A.push_back((re){1, 1}); f[1][1] = 0; } else { if (K >= 1) { Ans.push_back( a ); A.push_back((re){1, 1}); f[1][1] = 1; } else { Ans.push_back(mp[1][1]); A.push_back((re){1, 1}); f[1][1] = 0; } } for (int i = 2; i <= 2 * n - 1; ++i) { char Min = z ; for (auto u : A) { if (f[u.x][u.y] + 1 <= K) Min = a ; if (u.x + 1 <= n) Min = min(Min, mp[u.x + 1][u.y]); if (u.y + 1 <= n) Min = min(Min, mp[u.x][u.y + 1]); } Ans.push_back(Min); for (auto u : A) { if (u.x + 1 <= n) { upd(f[u.x + 1][u.y], f[u.x][u.y] + (mp[u.x + 1][u.y] != Min)); } if (u.y + 1 <= n) { upd(f[u.x][u.y + 1], f[u.x][u.y] + (mp[u.x][u.y + 1] != Min)); } } for (auto u : zy[i]) if (f[u.x][u.y] != -1) B.push_back(u); swap(A, B); B.clear(); } printf( %s n , Ans.c_str()); return 0; } |
#include <bits/stdc++.h> using namespace std; const int mxn = 1e5 + 100; int a[mxn], b[mxn], c[mxn]; set<int> mp; void add(int x) { if (c[x] == 0) mp.insert(b[x]); else if (c[x] == 1) mp.erase(b[x]); c[x]++; } void remove(int x) { if (c[x] == 2) mp.insert(b[x]); else if (c[x] == 1) mp.erase(b[x]); c[x]--; } int main() { int n, k, m; scanf( %d%d , &n, &k); for (int i = 1; i <= n; i++) scanf( %d , a + i), b[i - 1] = a[i]; sort(b, b + n), m = unique(b, b + n) - b; for (int i = 1; i <= n; i++) { a[i] = lower_bound(b, b + m, a[i]) - b; add(a[i]); if (i >= k) { if (mp.empty()) puts( Nothing ); else printf( %d n , *mp.rbegin()); remove(a[i - k + 1]); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; long long n; cin >> t; while (t--) { cin >> n; if (n % 2) { if ((n / 2) & 1) { cout << n + 1 << endl; } else { cout << 2 * n + 1 << endl; } } else { cout << 4 * n + 1 << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; inline long long read() { char c = getchar(); long long f = 1, x = 0; while (c < 0 || c > 9 ) { if (c == - ) f = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { x = (x << 1) + (x << 3) + (c ^ 0 ); c = getchar(); } return x * f; } long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } char s[3]; char b[3]; int main() { scanf( %s , s + 1); long long flag = 0; long long ff = 0, f = 0, fff = 0; long long n = read(); for (int i = 1; i <= n; i++) { memset(b, 0 , sizeof(b)); scanf( %s , b + 1); if (b[1] == s[1] && b[2] == s[2]) { fff = 1; } if (b[1] == s[2] && b[2] == s[1]) { flag = 1; } if (b[2] == s[1]) { f = 1; } if (b[1] == s[2]) { ff = 1; } } if (flag != 0 || ff + f == 2 || fff == 1) { printf( YES n ); } else { printf( NO n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long inf = (1LL << 60) - 1; int dx[] = {-1, 1, 0, 0}; int dy[] = {0, 0, -1, 1}; void solve() { long long n, x, y, k, c = 0; cin >> n >> x >> y; for (long long i = 0; i < n; i++) { cin >> k; if (k <= x) c++; } if (x > y) cout << n << n ; else cout << (c + 1) / 2 << n ; } int main() { ios::sync_with_stdio(0); cout.tie(0); ; solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { cin.tie(NULL); cout.tie(NULL); ios_base::sync_with_stdio(false); int arr[4]; for (int i = 0; i < 4; i++) cin >> arr[i]; int a, b; cin >> a >> b; sort(arr, arr + 4); if (arr[0] > b) cout << b - a + 1 << endl; else if (arr[0] > a) cout << arr[0] - a << endl; else cout << 0 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int ans = -1; int n, dol, cent, s, i; cin >> n >> s; for (i = 0; i < n; i++) { cin >> dol >> cent; if (s > dol && cent != 0 && 100 - cent > ans) ans = 100 - cent; if (s >= dol && cent == 0 && ans == -1) ans = 0; } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int tree[270000 * 4]; int t; char opt; void insert(long long x) { if (x == 0) { ++tree[2]; return; } int num = x % 10; x /= 10; num = (num % 2 == 0 ? 0 : 1); int root = (num == 0 ? 2 : 3); ++tree[root]; while (x) { num = x % 10; x /= 10; num = (num % 2 == 0 ? 0 : 1); root = (num == 0 ? root * 2 : root * 2 + 1); ++tree[root]; } } void erase(long long x) { if (x == 0) { --tree[2]; return; } int num = x % 10; x /= 10; num = (num % 2 == 0 ? 0 : 1); int root = (num == 0 ? 2 : 3); --tree[root]; while (x) { num = x % 10; x /= 10; num = (num % 2 == 0 ? 0 : 1); root = (num == 0 ? root * 2 : root * 2 + 1); --tree[root]; } } void query(string s) { stack<int> stk; int lens = s.length(), beg = 0; for (int i = 0; i < lens; ++i) if (s[i] != 0 || i == lens - 1) { beg = i; break; } for (int i = beg; i < lens; ++i) stk.push(s[i] - 0 ); int now = stk.top(); stk.pop(); int root = (now == 0 ? 2 : 3); int ans = tree[root]; while (!stk.empty()) { now = stk.top(); stk.pop(); root = (now == 0 ? root * 2 : root * 2 + 1); ans = min(tree[root], ans); } while (beg) { root *= 2; ans -= tree[root + 1]; --beg; } while (tree[root * 2] || tree[root * 2 + 1]) { root *= 2; ans -= tree[root + 1]; } cout << ans << endl; } int main() { cin >> t; for (int i = 1; i <= t; ++i) { cin >> opt; if (opt == + ) { long long x; cin >> x; insert(x); } else if (opt == - ) { long long x; cin >> x; erase(x); } else { string s; cin >> s; query(s); } } } |
#include <bits/stdc++.h> using namespace std; long long ans, tot, n; long long a[105]; void update(long long d) { long long sum = 0; for (int i = 1; i <= n; i++) sum += (a[i] - 1) / d + 1; if (sum * d <= tot) ans = max(ans, d); } int main() { long long k; scanf( %lld %lld , &n, &k); for (int i = 1; i <= n; i++) { scanf( %lld , &a[i]); tot += a[i]; } tot += k; for (long long i = 1; i * i <= tot - 1; i++) { update(i); update(tot / i); } printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:1108864220 ) using namespace std; const int MOD = 1000000007; const int INF = 1000000000; const double EPS = 1e-9; const int HASH_POW = 29; const long double PI = acos(-1.0); mt19937_64 rnd(chrono::high_resolution_clock::now().time_since_epoch().count()); long long nextLong(long long l, long long r) { uniform_int_distribution<long long> foo(l, r); return foo(rnd); } double nextDouble(double l, double r) { uniform_real_distribution<double> foo(l, r); return foo(rnd); } double workTime() { return double(clock()) / CLOCKS_PER_SEC; } void myReturn(int code = 0) { exit(code); } int n; long long goal = 0; vector<int> p[15]; vector<long long> sum; unordered_map<int, pair<int, int> > pos; pair<int, int> cycles[1 << 15]; bool dp[1 << 15]; int par[1 << 15]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); scanf( %d , &n); sum.resize(n); for (int i = 0; i < n; ++i) { int s; scanf( %d , &s); p[i].resize(s); sum[i] = 0; for (int j = 0; j < s; ++j) { scanf( %d , &p[i][j]); goal += p[i][j]; sum[i] += p[i][j]; pos[p[i][j]] = {i, j}; } } if (goal % n != 0) { printf( No n ); myReturn(); } else { goal /= n; } for (int i = 0; i < (1 << n); ++i) { cycles[i] = {-1, -1}; } for (int i = 0; i < n; ++i) { for (int j = 0; j < p[i].size(); ++j) { int msk = 0, row = i, col = j; bool good = true; while (true) { if (msk & (1 << row)) { if (row != i) { good = false; } else if (col != j) { good = false; } break; } msk |= (1 << row); long long val = goal - sum[row] + p[row][col]; if (abs(val) > 1000000000) { good = false; break; } int key = (int)val; if (pos.find(key) == pos.end()) { good = false; break; } if (pos[key].first == row && pos[key].second != col) { good = false; break; } row = pos[key].first, col = pos[key].second; } if (good) { cycles[msk] = {i, j}; } } } dp[0] = true; for (int i = 1; i < (1 << n); ++i) { for (int s = i; s > 0; s = ((s - 1) & i)) { if (cycles[s].first != -1 && dp[i ^ s]) { dp[i] = true; par[i] = s; } } } if (!dp[(1 << n) - 1]) { printf( No n ); myReturn(); } vector<pair<int, int> > ans(n, {-1, -1}); int q = (1 << n) - 1; while (q != 0) { int s = par[q]; q ^= s; int msk = 0, row = cycles[s].first, col = cycles[s].second; while (true) { if (msk & (1 << row)) { break; } msk |= (1 << row); long long val = goal - sum[row] + p[row][col]; int key = (int)val; ans[pos[key].first] = {p[pos[key].first][pos[key].second], row + 1}; row = pos[key].first, col = pos[key].second; } } printf( Yes n ); for (int i = 0; i < n; ++i) { printf( %d %d n , ans[i].first, ans[i].second); } myReturn(); } |
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const int N = 2100; int a[N][N], b[N][N], d[N][N]; int c[N], n, tag = -1, res[N]; void print() { cout << -1; exit(0); } int cnt = 0; void solve(int id, int T) { if (T) { for (int i = 1; i <= n; i++) { if (i == tag) continue; if (d[i][id] != c[i]) res[i]++; } } else { for (int i = 1; i <= n; i++) { if (i == tag) continue; if (d[i][id] != 0) res[i]++; } } } int main() { std::ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); cin >> n; char ch; for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) cin >> ch, a[i][j] = ch - 0 ; for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) cin >> ch, b[i][j] = ch - 0 ; for (int i = 1; i <= n; i++) cin >> ch, c[i] = ch - 0 ; for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) d[i][j] = a[i][j] ^ b[i][j]; for (int i = 1; i <= n; i++) if (c[i]) tag = i; if (tag == -1) { bool f = 0; for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) if (d[i][j]) f = 1; if (f) print(); } for (int i = 1; i <= n; i++) if (d[tag][i]) cnt++; for (int i = 1; i <= n; i++) solve(i, d[tag][i]); for (int i = 1; i <= n; i++) { if (res[i]) { cnt++; for (int j = 1; j <= n; j++) d[i][j] ^= c[j]; } } for (int j = 1; j <= n; j++) { int C = 0; bool f = 0; for (int i = 1; i <= n; i++) { if ((d[i][j] && c[i] == 0) || (!d[i][j] && c[i])) f = 1; if (d[i][j]) C++; } if (C && f) print(); } cout << cnt << n ; for (int i = 1; i <= n; i++) if (res[i]) cout << row << i - 1 << n ; for (int i = 1; i <= n; i++) if (d[tag][i]) cout << col << i - 1 << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int cambio; cin >> cambio; vector<int> hansel; int madera = 0; int piedra = 0; int ladrillo; for (int i = 0; cambio > i; i++) { int gretel; cin >> gretel; piedra = piedra + gretel; hansel.push_back(gretel); } sort(hansel.begin(), hansel.end()); for (int i = 0; i < cambio; i++) { madera = madera + hansel[i]; piedra = piedra - hansel[i]; if (madera >= piedra) { ladrillo = cambio - i; break; } } cout << ladrillo; return 0; } |
#include <bits/stdc++.h> using namespace std; inline int mod(int a, int k) { return (a % k + k) % k; } int main() { int n, k, v; cin >> n >> k >> v; vector<int> a(1 + n, 0); int ss = 0; for (int i = 1; i <= n; ++i) { cin >> a[i]; ss += a[i]; } if (ss < v) { cout << NO n ; return 0; } int target = v % k; vector<vector<pair<int, int>>> dp(1 + n, vector<pair<int, int>>(k, {0, 0})); dp[0][0] = {-1, 0}; for (int i = 1; i <= n; ++i) { for (int j = 0; j < k; ++j) { auto var1 = dp[i - 1][mod(j - a[i], k)]; auto var2 = dp[i - 1][j]; if (var1.first && var2.first) { if (var1.second + a[i] % k > var2.second) { dp[i][j] = {2, var1.second + a[i] % k}; } else { dp[i][j] = {1, var2.second}; } } else if (var1.first) { dp[i][j] = {2, var1.second + a[i] % k}; } else if (var2.first) { dp[i][j] = {1, var2.second}; } } } if (dp[n][target].first == 0) { cout << NO n ; return 0; } if (n == 1 && a[1] != v) { cout << NO n ; return 0; } cout << YES n ; int x = -1; int y = -1; int curr = n; int rem1 = target; while (curr > 0) { if (dp[curr][rem1].first == 2) { if (x == -1) { x = curr; rem1 = mod(rem1 - a[curr], k); } else { if (a[curr] > 0) { cout << (a[curr] - 1) / k + 1 << << curr << << x << n ; } a[x] += a[curr]; rem1 = mod(rem1 - a[curr], k); a[curr] = 0; } } else { if (y == -1) { y = curr; } else { if (a[curr] > 0) { cout << (a[curr] - 1) / k + 1 << << curr << << y << n ; } a[y] += a[curr]; a[curr] = 0; } } --curr; } if (y == -1) { if (x == 1) { y = 2; } else { y = 1; } } if (x == -1) { if (y == 1) { x = 2; } else { x = 1; } } if (x != -1) { if (a[x] < v) { cout << (v - a[x]) / k << << y << << x << n ; } else if (a[x] > v) { cout << (a[x] - v) / k << << x << << y << n ; } } } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, k; cin >> n >> k; long long l = 1, u = n, mid; while (l <= u) { mid = (l + u) / 2; long long sum = (mid * (mid + 1)) / 2; sum = sum - (n - mid); if (sum == k) { cout << n - mid << endl; break; } else if (sum < k) { l = mid + 1; } else u = mid - 1; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long t; cin >> t; while (t--) { long long n, k; cin >> n >> k; long long arr[n]; for (long long i = 0; i < n; i++) cin >> arr[i]; long long x = 0; vector<long long> v; map<long long, long long> mp; for (long long i = 0; i < n; i++) { if (mp.find(arr[i]) == mp.end()) { v.push_back(arr[i]); mp[arr[i]] = 1; x++; } } if (x > k) cout << -1 << endl; else { long long x = 0; while (v.size() < k) { v.push_back(v[x]); x++; } vector<long long> w; long long j = 0, l = 0; while (j < n) { if (arr[j] == v[l]) { w.push_back(arr[j]); j++; l++; } else { w.push_back(v[l]); l++; } l %= v.size(); } cout << w.size() << endl; for (long long i = 0; i < w.size(); i++) cout << w[i] << ; cout << endl; } } } |
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); int m = (n << 1) - 1; vector<int> a(m); int first = -1; for (int i = 0; i < m; ++i) { scanf( %d , &a[i]); --a[i]; if (!~first && ~a[i]) { first = i; } } if (!~first) { puts( yes ); printf( 1 ); for (int i = 1; i < n; ++i) { printf( %d 1 , i + 1); } putchar(10); return 0; } if (first) { vector<int> temp; for (int i = first; i < m; ++i) { temp.push_back(a[i]); } for (int i = 0; i < first; ++i) { temp.push_back(a[i]); } a = temp; } if (~a.back() && a.back() != a[0]) { puts( no ); return 0; } a.back() = a[0]; vector<int> free, parity(n, -1); for (int i = 0; i < m; ++i) { if (~a[i]) { if (~parity[a[i]]) { if (parity[a[i]] != (i & 1)) { puts( no ); return 0; } } else { parity[a[i]] = i & 1; } } } for (int i = 0; i < n; ++i) { if (!~parity[i]) { free.push_back(i); } } vector<int> prev(m), next(m); for (int i = 0; i < m; ++i) { prev[i] = i - 1; next[i] = i + 1; } auto erase = [&](int x) { if (next[x] != m) { prev[next[x]] = prev[x]; } if (~prev[x]) { next[prev[x]] = next[x]; } }; auto solve = [&](int l, int r) { for (int i = next[l]; i < r;) { if (~a[i] && ~a[next[i]] && !~a[prev[i]]) { a[prev[i]] = a[next[i]]; erase(i); erase(next[i]); i = prev[i]; if (i > l) { i = prev[i]; } if (i == l) { i = next[i]; } } else if (~a[i] && ~a[prev[i]] && !~a[next[i]]) { a[next[i]] = a[prev[i]]; erase(i); erase(next[i]); i = prev[i]; if (i == l) { i = next[i]; } } else { i = next[i]; } } for (int i = next[l]; i < r; i = next[i]) { erase(i); } erase(r); }; vector<bool> not_first(n), ban(n); for (int i = 0; i < m; ++i) { if (~a[i]) { if (not_first[a[i]]) { if (ban[a[i]]) { puts( no ); return 0; } int left = prev[i], right = i, numbers = 1, total = 1; while (a[left] != a[right]) { if (~a[left]) { ban[a[left]] = true; ++numbers; } ++total; left = prev[left]; } int need = (total >> 1) + 1 - numbers; if (need < 0) { puts( no ); return 0; } for (int j = left; j < right; j = next[j]) { if (!~a[j] && need) { if (free.empty()) { puts( no ); return 0; } else { a[j] = free.back(); --need; free.pop_back(); } } } solve(left, right); } else { not_first[a[i]] = true; } } } puts( yes ); if (first) { vector<int> temp; for (int i = m - 1 - first; i < m - 1; ++i) { temp.push_back(a[i]); } for (int i = 0; i < m - 1 - first; ++i) { temp.push_back(a[i]); } temp.push_back(a[m - 1 - first]); a = temp; } for (int i = 0; i < m; ++i) { printf( %d%c , a[i] + 1, i == m - 1 ? n : ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int answer(); int main() { long long t; t = 1; while (t--) { answer(); } return 0; } int answer() { string k; cin >> k; int sup[10] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2}; if (k.size() > 1) { cout << sup[k[0] - 0 ] * sup[k[1] - 0 ] << endl; } else { cout << sup[k[0] - 0 ] << endl; } return 0; } |
#include <bits/stdc++.h> int main() { double n, m; scanf( %lf %lf , &m, &n); double ans = 0; for (int i = 1; i <= m; i++) { ans += pow(i / m, n); } ans = m - ans + 1; printf( %.10lf , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1 << 20; const long long MOD = 2305843009255636993, RT = 5; struct CD { double r, i; CD(double r = 0, double i = 0) : r(r), i(i) {} double real() const { return r; } void operator/=(const int c) { r /= c, i /= c; } }; CD operator*(const CD& a, const CD& b) { return CD(a.r * b.r - a.i * b.i, a.r * b.i + a.i * b.r); } CD operator+(const CD& a, const CD& b) { return CD(a.r + b.r, a.i + b.i); } CD operator-(const CD& a, const CD& b) { return CD(a.r - b.r, a.i - b.i); } const double pi = acos(-1.0); CD cp1[MAXN + 9], cp2[MAXN + 9]; int R[MAXN + 9]; void dft(CD* a, int n, bool inv) { for (int i = 0, ThxDem = n; i < ThxDem; ++i) if (R[i] < i) swap(a[R[i]], a[i]); for (int m = 2; m <= n; m *= 2) { double z = 2 * pi / m * (inv ? -1 : 1); CD wi = CD(cos(z), sin(z)); for (int j = 0; j < n; j += m) { CD w(1); for (int k = j, k2 = j + m / 2; k2 < j + m; k++, k2++) { CD u = a[k]; CD v = a[k2] * w; a[k] = u + v; a[k2] = u - v; w = w * wi; } } } if (inv) for (int i = 0, ThxDem = n; i < ThxDem; ++i) a[i] /= n; } vector<long long> multiply(vector<long long>& p1, vector<long long>& p2) { int n = p1.size() + p2.size() + 1; int m = 1, cnt = 0; while (m <= n) m += m, cnt++; for (int i = 0, ThxDem = m; i < ThxDem; ++i) { R[i] = 0; for (int j = 0, ThxDem = cnt; j < ThxDem; ++j) R[i] = (R[i] << 1) | ((i >> j) & 1); } for (int i = 0, ThxDem = m; i < ThxDem; ++i) cp1[i] = 0, cp2[i] = 0; for (int i = 0, ThxDem = p1.size(); i < ThxDem; ++i) cp1[i] = p1[i]; for (int i = 0, ThxDem = p2.size(); i < ThxDem; ++i) cp2[i] = p2[i]; dft(cp1, m, false); dft(cp2, m, false); for (int i = 0, ThxDem = m; i < ThxDem; ++i) cp1[i] = cp1[i] * cp2[i]; dft(cp1, m, true); vector<long long> res; n -= 2; for (int i = 0, ThxDem = n; i < ThxDem; ++i) res.push_back((long long)floor(cp1[i].real() + 0.5)); return res; } int spf[MAXN]; vector<int> ds; vector<pair<int, int> > prs; void gen(int x, int pos) { if (pos == int(prs.size())) ds.push_back(x); else { for (int i = 0, ThxDem = prs[pos].second + 1; i < ThxDem; ++i) { if (i || prs[pos].first != 2) gen(x, pos + 1); x *= prs[pos].first; } } } vector<int> dis[MAXN]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); for (int i = 2, ThxDem = MAXN; i < ThxDem; ++i) if (!spf[i]) for (int j = i; j < MAXN; j += i) if (!spf[j]) spf[j] = i; for (int i = 2, ThxDem = MAXN; i < ThxDem; ++i) if (i % 2 == 0) { prs.clear(); ds.clear(); int x = i; while (x > 1) { int now = spf[x], pw = 0; while (x % now == 0) x /= now, pw++; prs.push_back({now, pw}); } gen(1, 0); sort(ds.begin(), ds.end()); reverse(ds.begin(), ds.end()); dis[i] = ds; } int n, x, y; cin >> n >> x >> y; n++; vector<int> a(n); int off = x + 1; vector<long long> neg(2 * (x + 1)), pos(2 * (x + 1)); for (int i = 0, ThxDem = n; i < ThxDem; ++i) { cin >> a[i]; neg[x + 1 - a[i]] = 1; pos[off + a[i]] = 1; } auto ws = multiply(neg, pos); int q; cin >> q; vector<int> ans(q, -1); for (int j = 0, ThxDem = q; j < ThxDem; ++j) { int v; cin >> v; for (auto tt : dis[v]) { int len = tt - 2 * y; if (len <= 0 || len % 2) continue; len /= 2; if (2 * off + len < int(ws.size()) && ws[2 * off + len] > 0) { ans[j] = tt; break; } } } for (auto x : ans) cout << x << ; cout << n ; } |
#include <bits/stdc++.h> using namespace std; long long int pow(long long int x, long long int y, long long int m) { long long int res = 1; x = x % m; while (y > 0) { if (y & 1) res = ((res % m) * (x % m)) % m; y = y >> 1; x = ((x % m) * (x % m)) % m; } return res % m; } template <typename Arg1> void ZZ(const char* name, Arg1&& arg1) { std::cerr << name << = << arg1 << endl; } template <typename Arg1, typename... Args> void ZZ(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, , ); std::cerr.write(names, comma - names) << = << arg1; ZZ(comma, args...); } const long long int INF = 0xFFFFFFFFFFFFFFFL; long long int clz(unsigned long long N) { return N ? 64LL - __builtin_clzll(N) : -INF; } clock_t time_p = clock(); void abhigyan10() { time_p = clock() - time_p; cerr << Time Taken : << (float)(time_p) / CLOCKS_PER_SEC << n ; } long long int seed; mt19937 rng(seed = chrono::steady_clock::now().time_since_epoch().count()); inline long long int rnd(long long int l = 0, long long int r = INF) { return uniform_int_distribution<long long int>(l, r)(rng); } const long long int mod = 1000000007; long long int modinv(long long int x) { return pow(x, mod - 2, mod); } vector<long long int> a; int bs(long long int x, long long int n) { long long int l = 0, h = n - 1, m, ans = 0; while (l <= h) { m = (l + h) / 2; if (a[m] <= x) { l = m + 1; ans = max(ans, m); } else { h = m - 1; } } return ans; } int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int s = 0, t, n, p, i; cin >> n >> p; a.resize(n); for (i = 0; i < n; i++) cin >> a[i]; sort(a.begin(), a.end()); for (i = 0; i < n; i++) s = max(s, a[i] - i); t = a[n - 1]; for (i = 0; i < n;) { int d = t + i; int u = bs(d, n) + 1 - i; if (u < p) i++; else t--; if (t < s) break; } cout << max(0LL, t - s + 1) << n ; for (i = s; i <= t; i++) cout << i << ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long MOD = 1e9 + 7; long long powmod(long long a, long long l, long long md) { long long res = 1; while (l) { if (l & 1) res = res * a % md; l /= 2; a = a * a % md; } return res; } long long binpow(long long a, long long l) { long long res = 1; while (l) { if (l & 1) res = res * a; l /= 2; a = a * a; } return res; } long long __set(long long b, long long i) { return b | (1 << i); } long long __unset(long long b, long long i) { return b & (~(1UL << i)); } long long __check(long long b, long long i) { return b & (1 << i); } long long mulmod(long long a, long long b, long long md) { return ((a % md) * (b % md)) % md; } long long addmod(long long a, long long b, long long md) { return (a + b) % md; } long long submod(long long a, long long b, long long md) { return (((a - b) % md) + md) % md; } long long divmod(long long a, long long b, long long md) { return mulmod(a, powmod(b, md - 2, md), md); } const long long inf = 0xFFFFFFFFFFFFFFFL; priority_queue<long long, vector<long long>, greater<long long> > pq; clock_t time_p = clock(); void time() { time_p = clock() - time_p; cerr << Time Taken : << (float)(time_p) / CLOCKS_PER_SEC << n ; } long long d[3][10]; signed main(void) { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; for (long long i = 0; i < 3; i++) { string s; cin >> s; if (s[1] == m ) { d[0][s[0] - 0 ]++; } else if (s[1] == p ) { d[1][s[0] - 0 ]++; } else { d[2][s[0] - 0 ]++; } } long long mx = 3; for (long long i = 0; i < 3; i++) { for (long long j = 1; j <= 9; j++) mx = min(mx, 3 - min(3ll, d[i][j])); for (long long j = 1; j <= 7; j++) { long long tp = 0; if (!d[i][j]) tp++; if (!d[i][j + 1]) tp++; if (!d[i][j + 2]) tp++; mx = min(mx, tp); } } cout << mx << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; using namespace chrono; const int N = 1205; const int INF = 0x3f3f3f3f; template <class T> bool read(T& x) { char c; while (!isdigit(c = getchar()) && c != - && c != EOF) ; if (c == EOF) return false; T flag = 1; if (c == - ) { flag = -1; x = 0; } else x = c - 0 ; while (isdigit(c = getchar())) x = x * 10 + c - 0 ; x *= flag; return true; } template <class T, class... R> bool read(T& a, R&... b) { if (!read(a)) return false; return read(b...); } mt19937 gen(steady_clock::now().time_since_epoch().count()); struct edge { int to, cap, next; } e[N * 4]; int head[N], cnt, depth[N], group[N]; void add(int u, int v, int c) { e[cnt] = {v, c, head[u]}; head[u] = cnt++; } void add_edge(int u, int v, int c) { add(u, v, c); add(v, u, 0); } bool isap_bfs(int s, int t) { memset(depth, -1, sizeof(depth)); memset(group, 0, sizeof(group)); group[depth[t] = 0]++; queue<int> q; q.push(t); while (!q.empty()) { int u = q.front(); q.pop(); for (int i = head[u]; ~i; i = e[i].next) { int v = e[i].to; if (~depth[v]) continue; group[depth[v] = depth[u] + 1]++; q.push(v); } } return ~depth[s]; } int isap_dfs(int u, int t, int c) { if (u == t) return c; int tmp = c; for (int i = head[u]; tmp && ~i; i = e[i].next) { int v = e[i].to; if (depth[v] + 1 == depth[u] && e[i].cap) { int d = isap_dfs(v, t, min(tmp, e[i].cap)); e[i].cap -= d; e[i ^ 1].cap += d; tmp -= d; } } if (tmp) { if (!--group[depth[u]]) depth[t] = -1; group[++depth[u]]++; } return c - tmp; } int isap(int s, int t) { if (!isap_bfs(s, t)) return 0; int max_flow = 0; while (~depth[t]) max_flow += isap_dfs(s, t, INF); return max_flow; } int deg[N], x[N], y[N], xe[N], ye[N]; vector<int> edg[N]; int main() { time_point<steady_clock> start = steady_clock::now(); int T, n, m, k; read(T); while (T--) { read(n, m, k); int s = 0, t = n + m + 1; cnt = 0; for (int i = s; i <= t; i++) { head[i] = -1; deg[i] = 0; edg[i].clear(); } for (int i = 1; i <= m; i++) { read(x[i], y[i]); deg[x[i]]++; deg[y[i]]++; edg[x[i]].push_back(i); edg[y[i]].push_back(i); } for (int i = 1; i <= n; i++) { if (deg[i] > 2 * k) { k = -1; break; } } if (k == -1) { for (int i = 1; i <= m; i++) printf( 0 ); puts( ); continue; } int tot = 0; for (int i = 1; i <= n; i++) { if (deg[i] > k) { tot += deg[i] - k; add_edge(m + i, t, 2 * (deg[i] - k)); } } tot *= 2; for (int i = 1; i <= m; i++) { add_edge(s, i, 1); add_edge(i, m + x[i], 1); xe[i] = cnt - 1; add_edge(i, m + y[i], 1); ye[i] = cnt - 1; } if (isap(s, t) == tot) { for (int i = 1; i <= m; i++) deg[i] = 0; k = 1; for (int i = 1; i <= n; i++) { int c = 0; for (auto j : edg[i]) { if (x[j] == i && e[xe[j]].cap || y[j] == i && e[ye[j]].cap) { if (c == 0) deg[j] = k; else deg[j] = k++; c ^= 1; } } } for (int i = 1; i <= m; i++) if (!deg[i]) deg[i] = k++; for (int i = 1; i <= m; i++) printf( %d , deg[i]); puts( ); } else { for (int i = 1; i <= m; i++) printf( 0 ); puts( ); } } cerr << endl << ------------------------------ << endl << Time: << duration<double, milli>(steady_clock::now() - start).count() << ms. << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 500001; int a[maxn][2]; int cur, n; int r[maxn][2], tot; void dosth() { int i; a[1][cur ^ 1] = a[1][cur]; a[n][cur ^ 1] = a[n][cur]; for (i = 2; i < n; ++i) a[i][cur ^ 1] = a[i - 1][cur] + a[i][cur] + a[i + 1][cur] > 1 ? 1 : 0; cur ^= 1; } int count() { int f = !a[1][0], i, j, ans = 0, tmp = 1; a[0][0] = a[1][0]; for (i = 2; i <= n; ++i) { if (a[i][0] != ((i + f) & 1)) { if (1) { for (j = 1; j <= tmp / 2; ++j) a[i - j][0] = a[i][0]; for (j = tmp / 2 + 1; j <= tmp; ++j) a[i - j][0] = a[i - tmp - 1][0]; } ans = max(ans, tmp), tmp = 1, f ^= 1; } else tmp++; } for (j = 1; j <= tmp / 2; ++j) a[i - j][0] = a[n][0]; for (j = tmp / 2 + 1; j <= tmp; ++j) a[i - j][0] = a[i - tmp - 1][0]; return (max(ans, tmp) - 1) / 2; } int main() { scanf( %d , &n); int i, j; cur = 0; for (i = 1; i <= n; ++i) { char c; do c = getchar(); while (!isdigit(c)); a[i][0] = c - 48; } printf( %d n , count()); for (i = 1; i <= n; ++i) putchar(a[i][0] + 0 ), putchar( ); putchar( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int num[100005]; int main() { int n, k; scanf( %d%d , &n, &k); for (int i = 1; i <= n; i++) scanf( %1d , num + i); for (int i = 1; i <= n && k; i++) { if (num[i] == 4 && num[i + 1] == 7) { if (i % 2 == 0 && num[i - 1] == 4) { if (k % 2) { num[i] = 7; } break; } if (i % 2 == 1 && i + 2 <= n && num[i + 2] == 7) { if (k % 2) { num[i + 1] = 4; } break; } if (i % 2 == 0) num[i] = 7; else num[i + 1] = 4; k--; } } for (int i = 1; i <= n; i++) printf( %d , num[i]); puts( ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int ans = 1; for (int i = 6; i <= n; i++) { if (n % i == 0) { int k1 = 0, k0 = 0; int f = 0; int x = i; while (x > 1 and f == 0) { int x2 = x % 2; if (x2 == 1 and k0 > 0) k1++; else if (x2 == 0 and k1 == 0) k0++; else f = 1; x /= 2; } if (k1 - k0 == 0 and f == 0) ans = i; } } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, k, ans[2005]; char a[2010][2010]; void load() { scanf( %d%d%d n , &n, &m, &k); for (int i = 0; i < n; i++) { scanf( %s , a[i]); } } void solve() { for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (a[i][j] == L ) { if (j - i >= 0) { ans[j - i]++; } } if (a[i][j] == R ) { if (j + i < m) { ans[j + i]++; } } if (a[i][j] == U ) { if (i % 2 == 0) { ans[j]++; } } } } for (int i = 0; i < m; i++) { if (i > 0) printf( ); printf( %d , ans[i]); } printf( n ); } int main() { load(); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int m; cin >> m; int c[m]; int sum1 = 0; for (int i = 0; i < m; i++) { cin >> c[i]; sum1 += c[i]; } int x, y; cin >> x >> y; int flag = 0; int k = 1; int sum2 = 0; if (sum2 >= x && sum2 <= y && sum1 - sum2 >= x && sum1 - sum2 <= y) { flag = 1; cout << 1 << endl; } else { for (int i = 1; i <= m; i++) { k = i; sum2 += c[i - 1]; if (sum2 >= x && sum2 <= y && sum1 - sum2 >= x && sum1 - sum2 <= y) { flag = 1; cout << i + 1 << endl; break; } } } if (flag == 0) { cout << 0 << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, x, y; char a[100005]; int main(void) { scanf( %d%d%d , &n, &x, &y); for (int i = 1; i <= n; i++) { cin >> a[i]; } if (a[x] == a[y]) puts( 0 ); else puts( 1 ); } |
#include <bits/stdc++.h> using namespace std; int kk[(100010)]; map<int, int> possible; int main() { int t, m, k, tj, rj, pre(0); bool first(false), already(false); scanf( %d , &t); for (int i = 0; i < t; ++i) { first = false; already = false; pre = 0; possible.clear(); scanf( %d%d , &m, &k); for (int j = 1; j <= k; ++j) { scanf( %d , &kk[j]); } for (int j = 0; j < m - 1; ++j) { scanf( %d%d , &tj, &rj); if (rj == 1 && !first) { first = true; for (int l = 1; l <= k; ++l) { if (kk[l] == 0) { already = true; break; } } if (!already) { for (int l = 1; l <= k; ++l) { if (kk[l] <= pre) { possible[l] = kk[l]; } } } } if (tj == 0) { pre += 1; } else { kk[tj] -= 1; if (first && !already) { if (possible[tj] != 0) { possible.erase(tj); } } } } if (!already && first) { int min = 100001; map<int, int>::iterator it = possible.begin(); while (it != possible.end()) { int count = (*it).second; if (count != 0 && count < min) { min = (*it).second; } it++; } pre -= min; } for (int j = 1; j <= k; ++j) { if (possible[j] != 0) { printf( %c , Y ); } else if (kk[j] <= pre) { printf( %c , Y ); } else { printf( %c , N ); } } printf( n ); } } |
#include <bits/stdc++.h> using namespace std; long long int B = 257; char s[1000100]; char t[1000100]; int n; int m; unsigned long long int hash1[1000100]; unsigned long long int hash2[1000100]; struct resp { unsigned long long int count; unsigned long long int indices[1000100]; } indice; long long int expBinaria(long long int a, long long int b) { long long int res = 1; while (b) { if (b % 2) res = res * a; b = b / 2; a = a * a; } return res; } void armaHashes() { hash1[0] = 0; for (int i = 1; i <= n; i++) { hash1[i] = hash1[i - 1] * B + s[i - 1]; } hash2[0] = 0; for (int i = 1; i <= m; i++) { hash2[i] = hash2[i - 1] * B + t[i - 1]; } } long long int h_1(int i, int j) { return hash1[j] - hash1[i - 1] * expBinaria(B, j - i + 1); } long long int h_2(int i, int j) { return hash2[j] - hash2[i - 1] * expBinaria(B, j - i + 1); } void solve() { long long int cuenta = 0; if (h_1(2, n) == h_2(1, m)) { indice.indices[cuenta] = 1; cuenta++; } for (int i = 2; i < n; i++) { if (h_1(1, i - 1) == h_2(1, i - 1) && h_1(i + 1, n) == h_2(i, m)) { indice.indices[cuenta] = i; cuenta++; } } if (h_1(1, n - 1) == h_2(1, m)) { indice.indices[cuenta] = n; cuenta++; } indice.count = cuenta; return; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> s; cin >> t; n = strlen(s); m = strlen(t); armaHashes(); solve(); cout << indice.count; cout << n ; for (int i = 0; i < indice.count; i++) { cout << indice.indices[i]; cout << t ; } return 0; } |
#include <bits/stdc++.h> using namespace std; bool isPrime(long long int n) { if (n <= 1) return false; if (n <= 3) return true; if (n % 2 == 0 || n % 3 == 0) return false; for (long long int i = 5; i * i <= n; i = i + 6) if (n % i == 0 || n % (i + 2) == 0) return false; return true; } vector<int> gr[50005]; int n, k; bool vis[50005]; int lev[50005][505]; long long int dp[50005]; void dfs(int v) { vis[v] = true; lev[v][0] = 1; for (auto ed : gr[v]) { if (!vis[ed]) { dfs(ed); for (long long int i = 1; i < k + 1; i++) lev[v][i] += lev[ed][i - 1]; } } } void solve(int v) { vis[v] = true; for (auto ed : gr[v]) { if (!vis[ed]) { solve(ed); for (long long int i = 1; i < k; i++) dp[v] += lev[ed][i - 1] * (lev[v][k - i] - lev[ed][k - i - 1]); } } dp[v] /= 2; dp[v] += lev[v][k]; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> k; int a, b; for (long long int i = 0; i < n - 1; i++) { cin >> a >> b; gr[a].push_back(b); gr[b].push_back(a); } memset(lev, 0, sizeof(lev)); memset(vis, false, sizeof(vis)); dfs(1); memset(vis, false, sizeof(vis)); memset(dp, 0, sizeof(dp)); solve(1); long long int ans = 0; for (long long int i = 1; i < n + 1; i++) ans += dp[i]; cout << ans; } |
#include <bits/stdc++.h> using namespace std; using namespace std; vector<bool> Prime(20000000 + 1, 1); vector<bool> Pal(20000000 + 1, 1); void gen1() { long long int n = 2000000; Prime[1] = 0; for (long long int i = 2; i <= 20000000; i++) { if (Prime[i]) { for (long long int j = i + i; j <= n; j += i) Prime[j] = false; } } } void gen2() { long long int n = 20000000; long long int num, rev = 0, digit; for (long long int i = 1; i <= 20000000; i++) { num = i; while (num > 0) { digit = num % 10; rev = rev * 10 + digit; num = num / 10; } if (i != rev) Pal[i] = false; rev = 0; } } long long int a, b; int main() { ios::sync_with_stdio(false); gen1(), gen2(); cin >> a >> b; long long int ans = 1, primes = 0, pals = 0; for (long long int i = 1; i <= 20000000; i++) { if (Prime[i]) primes++; if (Pal[i]) pals++; if (b * primes <= a * pals) ans = max(ans, i); } cout << ans; } |
#include <bits/stdc++.h> using namespace std; bitset<6> a, b; int main() { int n; cin >> n; a = bitset<6>(n); b.set(5, a[5]); b.set(4, a[0]); b.set(3, a[2]); b.set(2, a[3]); b.set(1, a[1]); b.set(0, a[4]); cout << b.to_ulong(); } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, c[100000], b[100000], a[100000], s1 = 0, s2 = 0, s3 = 0; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; s1 += a[i]; } for (int i = 0; i < n - 1; i++) { cin >> b[i]; s2 += b[i]; } for (int i = 0; i < n - 2; i++) { cin >> c[i]; s3 += c[i]; } cout << s1 - s2 << endl << s2 - s3; return 0; } |
#include <bits/stdc++.h> using namespace std; bool a[30][30]; void fun(int x, int y) { a[x][y] = a[y][x] = true; } int main() { ios_base::sync_with_stdio(false); int t; cin >> t; while (t--) { memset(a, false, sizeof a); int n, p; cin >> n >> p; if (n % 2 == 0) { for (int i = 1; i <= n; i++) { fun(i, i + 1); } fun(1, n); int last; for (int i = 1; i + 2 <= n; i += 2) { fun(i, i + 2); last = i + 2; } fun(2, last); for (int i = 2; i + 2 <= n - 2; i += 2) { if (i + 2 == n - 2) { fun(i, i + 4); last = i + 2; } else fun(i, i + 2); last = i + 2; } fun(last, last + 2); fun(1, last); for (int i = 1; i <= n; i++) for (int j = 1; j <= n and p > 0; j++) { if (i != j and a[i][j] == false) { p--; fun(i, j); } } for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) if (i < j and a[i][j]) cout << i << << j << endl; } else { for (int i = 1; i <= n; i++) { fun(i, i + 1); } fun(1, n); int last; for (int i = 1; i + 2 <= n; i += 2) { fun(i, i + 2); last = i + 2; } fun(2, last); for (int i = 2; i + 2 <= n; i += 2) { fun(i, i + 2); last = i + 2; } fun(1, last); for (int i = 1; i <= n; i++) for (int j = 1; j <= n and p > 0; j++) { if (i != j and a[i][j] == false) { p--; fun(i, j); } } for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) if (i < j and a[i][j]) cout << i << << j << endl; } } } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; if (n < k * 1ll * (k + 1) / 2) { cout << NO << endl; return 0; } int nn = n - k * (k + 1) / 2; vector<int> a(k); for (int i = 0; i < k; ++i) { a[i] = i + 1 + (nn / k) + (i >= k - nn % k); } if (nn != k - 1) { cout << YES << endl; for (int i = 0; i < k; ++i) cout << a[i] << ; cout << endl; } else { if (k > 3) { --a[1]; ++a[k - 1]; } if (k == 2 || k == 3) { cout << NO << endl; } else { cout << YES << endl; for (int i = 0; i < k; ++i) cout << a[i] << ; cout << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 5, mod = 1e9 + 7; long long a[N], x, n, sum; long long fastpower(long long b, long long p) { if (p == 0) return 1; long long halfpower = fastpower(b, p / 2) % mod; halfpower *= halfpower; halfpower %= mod; if (p % 2) halfpower = (halfpower * (b % mod)) % mod; return halfpower; } int main() { ios_base::sync_with_stdio(false); cin >> n >> x; for (int i = 0; i < n; i++) { cin >> a[i]; sum += a[i]; } map<long long, long long> mp; for (int i = 0; i < n; i++) mp[sum - a[i]]++; for (auto i : mp) { mp[i.first + 1] += (i.second / x); if (i.second % x) { cout << fastpower(x, min(i.first, sum)); return 0; } } } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; if (n == 1) { cout << 1 1 << endl << 1 ; return 0; } cout << 5 * (n - 1) << << 2 << endl << 1 5 ; } |
#include <bits/stdc++.h> int const maxn = 255; int const mod = 1e9 + 7; long long a[maxn]; long long c[maxn][maxn]; long long pow(long long a, long long b, long long p) { long long r = 1; while (b) { if (b & 1) r = (r * a) % p; a = (a * a) % p; b >>= 1; } return r; } int main() { int n, k, i, j; for (i = 0; i < maxn; i++) { c[i][0] = c[i][i] = 1; for (j = 1; j < i; j++) c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod; } scanf( %d%d , &n, &k); for (i = 1; i <= n; i++) a[i] = pow(pow(k, i, mod) - pow(k - 1, i, mod), n, mod); long long ans = a[n]; for (i = 1; i <= n; i++) { if (i & 1) ans = (ans - ((c[n][i] * pow(k - 1, i * n, mod)) % mod * a[n - i]) % mod + mod) % mod; else ans = (ans + ((c[n][i] * pow(k - 1, i * n, mod)) % mod * a[n - i]) % mod) % mod; } printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; long long power(long long a, long long b) { long long res = 1; a = a % 1000000007; while (b > 0) { if (b & 1) { res = (res * a) % 1000000007; b--; } a = (a * a) % 1000000007; b >>= 1; } return res; } long long fermat_inv(long long y) { return power(y, 1000000007 - 2); } long long gcd(long long a, long long b) { return (b == 0) ? a : gcd(b, a % b); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t = 1; while (t--) { int n, q; cin >> n >> q; set<int> s; for (int i = 0; i < n; i++) { int a; cin >> a; s.insert(a); } map<long long, int> m; for (auto it = s.begin(); it != s.end();) { int val = *it; val = -val; it++; if (it == s.end()) break; val += (*it); m[val]++; } auto it = m.end(); if (it == m.begin()) cout << 0 n ; else { auto it1 = s.begin(); auto it2 = s.end(); it2--; long long ans = (*it2) - (*it1); it--; ans -= it->first; cout << ans << n ; } while (q--) { int ty, x; cin >> ty >> x; if (ty == 0) { auto it = s.lower_bound(x); int ctr = 0; long long val1 = 0; if (it != s.begin()) { it--; long long val = x - (*it); val1 += val; ctr++; m[val]--; if (m[val] == 0) m.erase(val); } auto it1 = s.upper_bound(x); if (it1 != s.end()) { long long val = (*it1) - x; m[val]--; ctr++; val1 += val; if (m[val] == 0) m.erase(val); } if (ctr == 2) m[val1]++; s.erase(x); } else { int ctr = 0; auto it = s.lower_bound(x); long long val1 = 0; if (it != s.begin()) { it--; long long val = x - (*it); val1 += val; ctr++; m[val]++; } auto it1 = s.upper_bound(x); if (it1 != s.end()) { long long val = (*it1) - x; val1 += val; ctr++; m[val]++; } if (ctr == 2) m[val1]--; if (m[val1] == 0) m.erase(val1); s.insert(x); } auto it = m.end(); if (it == m.begin()) cout << 0 n ; else { auto it1 = s.begin(); auto it2 = s.end(); it2--; long long ans = (*it2) - (*it1); it--; ans -= it->first; cout << ans << n ; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long int MOD = 1000 * 1000 * 1000 + 7; const long long int INF = 1ll * 1000 * 1000 * 1000 * 1000 * 1000 * 1000 + 7; const long long int MOD2 = 998244353; const long double PI = 3.141592653589793; long long int gcd(long long int a, long long int b) { if (!b) return a; return gcd(b, a % b); } long long int power(long long int x, long long int y, long long int p) { long long int res = 1; x %= p; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } long long int power1(long long int x, long long int y) { long long int res = 1; while (y > 0) { if (y & 1) res = (res * x); y = y >> 1; x = (x * x); } return res; } long long int lcm(long long int a, long long int b) { return (a * b) / gcd(a, b); } long long int max(long long int a, long long int b) { if (a > b) return a; return b; } long long int min(long long int a, long long int b) { if (a > b) return b; return a; } bool sortbysec(const pair<long long int, long long int> &a, const pair<long long int, long long int> &b) { return a.second < b.second; } vector<long long int> prime; bool val[500]; void sieve() { memset(val, true, sizeof(val)); val[1] = false; val[0] = false; for (long long int i = 2 * 2; i <= 500; i += 2) { val[i] = false; } for (long long int i = 3; i <= 500; i++) { if (val[i] == false) continue; for (long long int j = i * i; j <= 500; j += i) { val[j] = false; } } for (int i = 0; i <= 500; i++) { if (val[i] == true) { prime.push_back(i); } } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { long long int n, k; cin >> n >> k; long long int arr[n]; for (long long int i = 0; i < n; i++) { cin >> arr[i]; } if (n == 1) { cout << k + 1 << n ; continue; } if (k < 9) { cout << k + 1 << n ; continue; } long long int ans = 0; long long int flag = 0; long long int count = 0; long long int count1 = 0; for (long long int i = 1; i < n; i++) { long long int num = power1(10, arr[i]) - 1; count = 0; for (long long int j = i - 1; j >= 0; j--) { count += num / power1(10, arr[j]); num -= ((num / power1(10, arr[j])) * power1(10, arr[j])); } if (count > k) { cout << power1(10, arr[i - 1]) * (k - count1 + 1) + power1(10, arr[i - 1]) - 1 << n ; flag = 1; break; } count1 = count; } if (flag == 0) { cout << (power1(10, arr[n - 1]) - 1) + power1(10, arr[n - 1]) * (k - count1 + 1) << n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; long long a, b; int ans[60]; void dfs(int dep) { long long cur = ans[dep - 1]; long long x = cur << 1; long long y = cur * 10 + 1; if (x == b || y == b) { puts( YES ); cout << dep + 1 << endl; for (int i = 0; i < dep; i++) cout << ans[i] << ; cout << b << endl; exit(0); } ans[dep] = x; if (x < b) dfs(dep + 1); ans[dep] = y; if (y < b) dfs(dep + 1); } int main() { cin >> a >> b; ans[0] = a; dfs(1); puts( NO ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, x, y, z, r = 0; scanf( %d%d%d%d%d%d , &a, &b, &c, &x, &y, &z); if (a > x) { r += (a - x) / 2; a -= r * 2; } if (b > y) { r += (b - y) / 2; b -= (b - y) / 2 * 2; } if (c > z) { r += (c - z) / 2; c -= (c - z) / 2 * 2; } if (a < x) { r -= x - a; a += x - a; } if (r < 0) { printf( No ); return 0; } if (b < y) { r -= y - b; b += y - b; } if (r < 0) { printf( No ); return 0; } if (c < z) { r -= z - c; c += z - c; } if (r < 0) { printf( No ); return 0; } printf( Yes ); return 0; } |
#include <bits/stdc++.h> int a[6] = {0, 2, 3, 1, 2, 1}; int main() { int n; scanf( %d , &n); printf( %d n , a[n]); return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /stack:20000000 ) #pragma warning(disable : 4146) #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; const int inf = 1e9; const long long lnf = 1e18; const long long h1 = 239017, h2 = 731604233; const long long mod = 1000000007, mod2 = 1000000009; const long double pi = 3.141592653589793238462643383279; const long double EPS = 1e-9; struct rectangle { int x1, x2; int y1, y2; rectangle(int x1, int y1, int x2, int y2) : x1(x1), y1(y1), x2(x2), y2(y2) {} }; vector<rectangle> v; int n, x, y, first, second; int xm[2005], ym[2005]; bool obs[2005][2005], a[2005][2005]; map<int, int> mx, my; void dfs(int x, int y) { if (x < 0 || x >= first || y < 0 || y >= second || obs[x][y] || a[x][y]) return; a[x][y] = true; dfs(x + 1, y); dfs(x - 1, y); dfs(x, y + 1); dfs(x, y - 1); } int main() { ios_base::sync_with_stdio(false); cin.tie(); cout.tie(); cout << setprecision(20); cin >> n; for (int i = 0; i < (n); i++) { char dir; int d; cin >> dir >> d; if (dir == L ) { rectangle r = {x - d, y, x + 1, y + 1}; v.push_back(r); x -= d; } if (dir == R ) { rectangle r = {x, y, x + d + 1, y + 1}; v.push_back(r); x += d; } if (dir == U ) { rectangle r = {x, y, x + 1, y + d + 1}; v.push_back(r); y += d; } if (dir == D ) { rectangle r = {x, y - d, x + 1, y + 1}; v.push_back(r); y -= d; } } for (int i = 0; i < (n); i++) { mx[v[i].x1] = mx[v[i].x2] = 0; my[v[i].y1] = my[v[i].y2] = 0; } for (auto &it : mx) { it.second = first; xm[first++] = it.first; } for (auto &it : my) { it.second = second; ym[second++] = it.first; } --first, --second; for (int i = 0; i < (n); i++) { int x1 = mx[v[i].x1], x2 = mx[v[i].x2], y1 = my[v[i].y1], y2 = my[v[i].y2]; for (int j = x1; j < x2; ++j) for (int k = y1; k < y2; ++k) obs[j][k] = true; } for (int i = 0; i < (first); i++) for (int j = 0; j < (second); j++) if (!i || i == first - 1 || !j || j == second - 1) dfs(i, j); long long ans = 0; for (int i = 0; i < (first); i++) for (int j = 0; j < (second); j++) if (!a[i][j]) { long long dx = xm[i + 1] - xm[i], dy = ym[j + 1] - ym[j]; ans += dx * dy; } cout << ans << endl; cerr << Time used : << (double)clock() * 1.0 / 1000 << seconds. n << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, x, y; cin >> n >> x >> y; vector<int> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } if (x > y) { cout << n << endl; return 0; } int cnt = 0; for (int i = 0; i < n; i++) { if (a[i] <= x) { cnt++; } } cout << (cnt + 1) / 2 << endl; } |
#include <bits/stdc++.h> const int N = 100005; using namespace std; long long n, a, b, k; char s[N]; long long mod = 1e9 + 9; long long pow(long long a, long long b) { long long ans = 1; while (b) { if (b & 1) ans = ans * a % mod; b >>= 1; a = a * a % mod; } return ans; } long long ex_gcd(long long a, long long b, long long &x, long long &y) { if (!b) { x = 1, y = 0; return a; } long long tmp = ex_gcd(b, a % b, x, y); long long t = x; x = y; y = t - (a / b) * x; return tmp; } long long inv(long long x) { long long a, b; ex_gcd(x, mod, a, b); return (a + mod) % mod; } int main() { scanf( %lld%lld%lld%lld , &n, &a, &b, &k); scanf( %s , s); long long ans = 0, m = (n + 1) / k; for (int i = 0; i < k; i++) { long long x = pow(a, n - i), y = pow(b, i); long long now = x * y % mod; if (s[i] == + ) ans += now; else ans -= now; ans = (ans + mod) % mod; } long long q = pow(inv(a), k) * pow(b, k) % mod; if (q == 1) ans = ans * m % mod; else { long long x = inv(q - 1) % mod; ans = (ans * (pow(q, m) - 1) % mod) * x % mod; } ans = (ans + mod) % mod; printf( %lld n , ans); return 0; } |
Subsets and Splits