func_code_string stringlengths 59 71.4k |
|---|
#include <bits/stdc++.h> using namespace std; int main() { int n, c1 = 0, c2 = 0; cin >> n; char x[n]; for (int i = 0; i < n; i++) { cin >> x[i]; if (x[i] == A ) c1++; else if (x[i] == D ) c2++; } if (c1 > c2) cout << Anton ; else if (c1 < c2) cout << Danik ; else cout << Friendship ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 998244353; inline int add(int x, int y) { x += y; return x >= mod ? x - mod : x; } inline int sub(int x, int y) { x -= y; return x < 0 ? x + mod : x; } inline int mul(int x, int y) { return 1ll * x * y % mod; } int quick_pow(int x, int y) { int res = 1; while (y) { if (y & 1) res = mul(res, x); x = mul(x, x), y >>= 1; } return res; } inline int getinv(int x) { return quick_pow(x, mod - 2); } const int maxk = 17; const int maxn = 1 << 16 | 5; int fac[maxk], ifac[maxk], inv[maxk]; void init(int N) { fac[0] = 1; for (int i = 1; i <= N; i++) fac[i] = mul(fac[i - 1], i); ifac[N] = getinv(fac[N]); for (int i = N; i >= 1; i--) ifac[i - 1] = mul(ifac[i], i); inv[0] = inv[1] = 1; for (int i = 2; i <= N; i++) inv[i] = mul(inv[mod % i], mod - mod / i); } int n, K, c; map<vector<int>, int> Map; void getln(int *A) { static int B[maxk]; B[0] = 0; for (int i = 1; i <= K; i++) { int tmp = 0; for (int j = 1; j < i; j++) tmp = add(tmp, mul(j, mul(B[j], A[i - j]))); B[i] = sub(A[i], mul(tmp, inv[i])); } for (int i = 0; i <= K; i++) A[i] = B[i]; } void getexp(int *A) { static int B[maxk]; B[0] = 1; for (int i = 1; i <= K; i++) { int tmp = 0; for (int j = 0; j < i; j++) tmp = add(tmp, mul(mul(A[i - j], i - j), B[j])); B[i] = mul(tmp, inv[i]); } for (int i = 0; i <= K; i++) A[i] = B[i]; } int popcnt[maxn], A[maxn]; vector<int> num[205]; int cnt[205], sum[maxn << 1], tot; int st[205], top; int Ln[maxn][maxk]; int main() { scanf( %d%d%d , &n, &K, &c), init(K); int all = 0; for (int i = 1, x; i <= n; i++) { scanf( %d , &x), all ^= x; vector<int> A; for (int j = 1; j <= K; j++) A.push_back(x ^ (x - j)); Map[A]++; } for (auto u : Map) num[++tot] = u.first, cnt[tot] = u.second; int S = (1 << K) - 1; for (int i = 0; i <= S; i++) { static int f[maxk]; f[0] = 1; for (int j = 0; j < K; j++) f[j + 1] = ((i >> j) & 1) ? mod - ifac[j + 1] : ifac[j + 1]; getln(f); for (int j = 0; j <= K; j++) Ln[i][j] = f[j]; } S = (1 << c) - 1; for (int i = 1; i <= S; i++) popcnt[i] = popcnt[i >> 1] + (i & 1); for (int i = 0; i <= S; i++) { for (int j = 1; j <= tot; j++) { int sta = 0; for (int k = 0; k < K; k++) if (popcnt[i & num[j][k]] & 1) sta |= (1 << k); if (!sum[sta]) st[++top] = sta; sum[sta] += cnt[j]; } static int f[maxk], g[maxk], h[maxk]; for (int j = 0; j <= K; j++) f[j] = h[j] = 0; f[0] = 1; for (int j = 1; j <= top; j++) { int sta = st[j]; for (int k = 0; k <= K; k++) g[k] = mul(Ln[sta][k], sum[sta]); getexp(g); for (int k = 0; k <= K; k++) for (int l = 0; k + l <= K; l++) h[k + l] = add(h[k + l], mul(f[k], g[l])); for (int k = 0; k <= K; k++) f[k] = h[k], h[k] = 0; sum[sta] = 0; } top = 0; A[i] = mul(f[K], fac[K]); } int N = 1 << c; for (int l = 2; l <= N; l <<= 1) { int m = (l >> 1); for (int j = 0; j < N; j += l) for (int i = j; i < j + m; i++) { int u = A[i], v = A[i + m]; A[i] = add(u, v); A[i + m] = sub(u, v); } } int tmp = getinv(mul(N, quick_pow(n, K))); for (int i = 0; i < N; i++) printf( %d , mul(A[i ^ all], tmp)); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int T; cin >> T; while (T--) { int flag = 0; int n; int now; cin >> n >> now; int l = now, r = now; int past = 0; for (int i = 0; i < n; i++) { int len, lb, rb; cin >> len >> lb >> rb; l -= len - past; r += len - past; l = max(l, lb); r = min(r, rb); if (l > r) flag = 1; past = len; } if (flag) cout << NO << endl; else cout << YES << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int dx[8] = {-1, -1, -1, 0, 0, 1, 1, 1}; const int dy[8] = {-1, 0, 1, -1, 1, 0, 1, -1}; const int maxn = 1000; const int mod = 998244353; int res, sum, r, n; string s; int main() { ios::sync_with_stdio(false); cin >> s; for (char c : s) { r = (c - 0 ) % 3; sum += r; ++n; if (n == 3 || r == 0 || sum % 3 == 0) res++, sum = n = 0; } cout << res; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, i, j, s, r, m, ans; string x; cin >> n >> m; long long a[n + 1][m + 1]; for (i = 1; i <= n; i++) { if (i % 2 == 1) { for (j = 0; j < m; j++) a[i][j] = 0; } else { for (j = 0; j < m; j++) a[i][j] = 1; } } for (i = 2; i <= n; i += 2) { if (i % 4 == 2) { a[i][m - 1] = 0; } else a[i][0] = 0; } for (i = 1; i <= n; i++) { for (j = 0; j < m; j++) { if (a[i][j] == 0) cout << # ; else cout << . ; } cout << endl; } } |
#include <bits/stdc++.h> using namespace std; int main() { cin.tie(NULL); ios_base::sync_with_stdio(false); int t; cin >> t; while (t--) { int k; cin >> k; string s; cin >> s; int ps = 0; int maxps = 0; for (int i = k - 1; i >= 0; --i) { if (s[i] == P ) { ++ps; } else { maxps = max(ps, maxps); ps = 0; } } cout << maxps << n ; } return 0; } |
#include <bits/stdc++.h> int main(void) { int matrix[12][12]; memset(matrix, 0, sizeof(matrix)); int i; char s[3]; int col_r, row_r, col_k, row_k; scanf( %s , s); col_r = s[0] - a + 2; row_r = s[1] - 1 + 2; scanf( %s , s); col_k = s[0] - a + 2; row_k = s[1] - 1 + 2; for (i = 2; i < 10; i++) { matrix[row_r][i] = 1; matrix[i][col_r] = 1; } matrix[row_k][col_k] = 1; matrix[row_k - 1][col_k + 2] = 1; matrix[row_k - 1][col_k - 2] = 1; matrix[row_k + 1][col_k - 2] = 1; matrix[row_k + 1][col_k + 2] = 1; matrix[row_k - 2][col_k + 1] = 1; matrix[row_k - 2][col_k - 1] = 1; matrix[row_k + 2][col_k + 1] = 1; matrix[row_k + 2][col_k - 1] = 1; matrix[row_r - 1][col_r + 2] = 1; matrix[row_r - 1][col_r - 2] = 1; matrix[row_r + 1][col_r + 2] = 1; matrix[row_r + 1][col_r - 2] = 1; matrix[row_r - 2][col_r + 1] = 1; matrix[row_r - 2][col_r - 1] = 1; matrix[row_r + 2][col_r + 1] = 1; matrix[row_r + 2][col_r - 1] = 1; int j, sum = 0; for (i = 2; i < 10; i++) for (j = 2; j < 10; j++) if (matrix[i][j] == 0) sum++; printf( %d n , sum); return 0; } |
#include <bits/stdc++.h> const int mod = 1e9 + 7; const double eps = 1e-6; const double pi = acos(-1); const int inf = 0x7fffffff; using namespace std; int a[105]; int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); if (a[1] == 3) return 0 * printf( NO n ); int x = 1, y = 2; for (int i = 1; i <= n; i++) { if (a[i] == x) { if (x == 1) { if (y == 2) y = 3; else y = 2; } else if (x == 2) { if (y == 1) y = 3; else y = 1; } else if (x == 3) { if (y == 1) y = 2; else y = 1; } } else if (a[i] == y) { if (y == 1) { if (x == 2) x = 3; else x = 2; } else if (y == 2) { if (x == 1) x = 3; else x = 1; } else if (y == 3) { if (x == 1) x = 2; else x = 1; } } else return 0 * printf( NO n ); } printf( YES n ); return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 1000000001; const long double EPS = 1e-9; const int MOD = 1000000007; const long long LLINF = 1000000000000000001; const int maxn = 350000; int n, k; int result[maxn]; int cost[maxn]; int main() { ios_base::sync_with_stdio(false); cin >> n >> k; for (int i = 1; i <= n; i++) cin >> cost[i]; set<pair<int, int>, greater<pair<int, int> > > s; for (int i = 1; i <= k; i++) s.insert(make_pair(cost[i], i)); for (int i = k + 1; i <= n; i++) { s.insert(make_pair(cost[i], i)); result[s.begin()->second] = i; s.erase(s.begin()); } for (int i = n + 1; i <= n + k; i++) { result[s.begin()->second] = i; s.erase(s.begin()); } long long sumCost = 0; for (int i = 1; i <= n; i++) sumCost += (long long)(result[i] - i) * cost[i]; cout << sumCost << n ; for (int i = 1; i <= n; i++) cout << result[i] << ; cout << endl; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; const long long MOD = 1e9 + 6; const long long inf = 2e18; const int maxn = 200005; const int maxa = 300005; long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } long long powmod(long long a, long long b) { long long res = 1; a %= mod; if (b < 0) return -1; for (; b; b >>= 1) { if (b & 1) res = res * a % mod; a = a * a % mod; } return res; } long long powmod2(long long a, long long b) { long long res = 1; a %= MOD; if (b < 0) return -1; for (; b; b >>= 1) { if (b & 1) res = res * a % MOD; a = a * a % MOD; } return res; } const int INF = 0x3f3f3f3f; int a[maxn]; vector<pair<int, int> > ans; vector<int> val[maxn]; int dis[maxn]; int main() { ios::sync_with_stdio(0); int n, m, k; cin >> n >> m >> k; for (int i = 1; i <= m; i++) cin >> a[i]; int now = 2; int cnt = 1; val[0].push_back(1); for (int i = 1; i <= m; i++) { for (int j = 1; j <= a[i]; j++) { dis[now] = i; val[i].push_back(now++); } cnt += a[i] - 1; } if (k > cnt) { return 0 * puts( -1 ); } int lstpos = 0; int nowval = 0; for (int i = 2; i <= n; i++) { if (dis[i] > nowval) { nowval = dis[i]; lstpos = 0; } if (lstpos != val[dis[i] - 1].size() && cnt > k) { ans.push_back({i, val[dis[i] - 1][lstpos]}); if (lstpos != 0) { cnt--; } lstpos++; } else { ans.push_back({i, val[dis[i] - 1][0]}); } } if (k != cnt) { return 0 * puts( -1 ); } cout << n << endl; for (auto k : ans) { cout << k.first << << k.second << endl; } } |
#include <bits/stdc++.h> using namespace std; const int MOD = 999999929, MAXN = 300005, P2 = (1 << 19), MTS = (1 << 20) + 5; int pot2[MAXN]; int TREE[MTS][2]; int n; long long suma(int p, int k, int num) { p += P2; k += P2; long long res = 0LL; while (p < k) { if ((p & 1)) { res += TREE[p++][num]; if (res >= MOD) res -= MOD; } if (!(k & 1)) { res += TREE[k--][num]; if (res >= MOD) res -= MOD; } p >>= 1; k >>= 1; } if (p == k) { res += TREE[p][num]; if (res >= MOD) res -= MOD; } return res; } void aT(int pos, int val, int num) { pos += P2; TREE[pos][num] = val; while (pos > 1) { pos >>= 1; TREE[pos][num] = TREE[(pos << 1)][num] + TREE[((pos << 1) + 1)][num]; if (TREE[pos][num] >= MOD) TREE[pos][num] -= MOD; } } void add(int pos) { aT(pos, pot2[pos], 0); aT(n - pos + 1, pot2[n - pos + 1], 1); } bool palindrom(int l) { int k = min(l - 1, n - l); long long a = suma(l - k, l + k, 0); long long b = suma(n - l - k + 1, n - l + k + 1, 1); if (l - k > n - l - k + 1) { int g = l - k - (n - l - k + 1); b *= pot2[g]; b %= MOD; } else { int g = n - l + 1 - l; a *= pot2[g]; a %= MOD; } return (a == b); } int main() { scanf( %d , &n); pot2[0] = 1; for (int i = 1; i <= n; ++i) { pot2[i] = (pot2[i - 1] << 1); if (pot2[i] >= MOD) pot2[i] %= MOD; } for (int i = 0; i < n; ++i) { int a; scanf( %d , &a); if (!palindrom(a)) { printf( YES ); return 0; } add(a); } printf( NO ); } |
#include <bits/stdc++.h> using namespace std; const int inf = ~0u >> 1, mod = (int)(1e9) + 7; int n, m; long long pow2[555 * 555], f[555][555]; int main() { scanf( %d%d , &n, &m); pow2[0] = 1ll; for (int i = 0; i < (int)500 * 500; ++i) pow2[i + 1] = (pow2[i] * 2ll) % mod; f[0][0] = 1ll; for (int k = 0; k < (int)m; ++k) { for (int i = 1; i <= n; ++i) for (int j = 0; j < i; ++j) { long long tmp = f[j][k]; tmp = tmp * (pow2[i - j] - 1) % mod; tmp = tmp * (pow2[j * (i - j)]) % mod; f[i][k + 1] = (f[i][k + 1] + tmp) % mod; } } long long ans = 0; for (int i = 1; i <= n; ++i) ans = (ans + f[i][m] * pow2[i * (n - i)] % mod) % mod; if (m) cout << ans << endl; else cout << 1; return 0; } |
#include <bits/stdc++.h> using namespace std; long long int MOD = 998244353; long long int exp(long long int n, long long int e) { if (e == 0) return 1; long long int temp = exp((n * n) % MOD, e / 2); return e % 2 == 0 ? temp : (temp * n) % MOD; } long long int inverse(long long int n) { return exp(n, MOD - 2); } int LIM = 3e5 + 10; vector<long long int> factorial(LIM, 1); vector<long long int> inv(LIM, 1); long long int choose(long long int n, long long int r) { long long int ans = ((factorial[n] * inv[r]) % MOD * inv[n - r]) % MOD; return ans; } void solve() { int n, k; cin >> n >> k; vector<long long int> arr(n + 1); int a = 0; for (int i = 1; i <= n; i++) { cin >> arr[i]; if (i > 1) a += arr[i] == arr[i - 1]; } a += (arr[1] == arr[n]); long long int ans = 0; long long int m = n - a; for (int i = 0; i < m; i++) { long long int temp = (exp(k - 2, i) * choose(m, i)) % MOD; long long int prod = -1; long long int c = m - i; if (c % 2 == 1) prod = exp(2, c - 1); else prod = (((exp(2, c) - choose(c, c / 2) + MOD) % MOD) * inv[2]) % MOD; ; temp = (temp * prod) % MOD; ans = (ans + temp) % MOD; } ans = (ans * exp(k, a)) % MOD; cout << ans << endl; } int main() { int t; t = 1; for (int i = 1; i < LIM; i++) { factorial[i] = (factorial[i - 1] * i) % MOD; inv[i] = inverse(factorial[i]); } while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, k, x, y, p; int v[109][109]; int main() { cin >> n >> k; p = n; while (p) { v[x++][y++] = k; p--; } for (int i = 0; i < n; i++) { for (int h = 0; h < n; h++) cout << v[i][h] << ; cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = (1 << 30) - 1; const long double EPS = 1e-9; const long double PI = fabs(atan2(0.0, -1.0)); const int MAXV = 80010; int n; vector<int> g[MAXV]; void load() { scanf( %d , &n); for (int i = 0, u, v; i < n - 1; i++) { scanf( %d%d , &u, &v); --u, --v; g[u].push_back(v); g[v].push_back(u); } } int sz[MAXV]; unsigned long long pths[MAXV]; unsigned long long dp[MAXV]; unsigned long long bad = 0; void dfs(int v, int p) { sz[v] = 1; for (int i = 0; i < (int)g[v].size(); i++) { int to = g[v][i]; if (to == p) continue; dfs(to, v); sz[v] += sz[to]; } pths[v] = 0; for (int i = 0; i < (int)g[v].size(); i++) { int to = g[v][i]; if (to == p) continue; pths[v] += sz[to] * 1ULL * (sz[v] - sz[to] - 1); } assert(pths[v] % 2 == 0); pths[v] /= 2; pths[v] += sz[v] - 1; dp[v] = 0; for (int i = 0; i < (int)g[v].size(); i++) { int to = g[v][i]; if (to == p) continue; dp[v] += dp[to]; } bad += dp[v]; dp[v] += pths[v] * 1ULL * sz[v]; for (int i = 0; i < (int)g[v].size(); i++) { int to = g[v][i]; if (to == p) continue; bad += dp[to] * 1ULL * (sz[v] - sz[to] - 1); } } void solve() { dfs(0, -1); unsigned long long res = 0; unsigned long long all = 0; for (int i = 0; i < n; i++) all += pths[i]; for (int i = 0; i < n; i++) res += pths[i] * (all - pths[i]); cout << res - 2 * bad << n ; } int main() { load(); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; const long long inf = 1e18; const long double eps = 1e-10; struct Pnt { long long x, y; Pnt(long long x, long long y) : x(x), y(y) {} }; Pnt operator+(Pnt a, Pnt b) { return {a.x + b.x, a.y + b.y}; } bool operator==(Pnt a, Pnt b) { return (a.x == b.x) && (a.y == b.y); } struct Solver { vector<Pnt> a; long long n; Solver(vector<Pnt> a) : a(a) { n = a.size(); } long long solve() { if (n % 2) return 0; long long d = n / 2; Pnt mid = a[0] + a[d]; for (long long i = 0; i < n; ++i) { long long j = (i + d) % n; if (!(a[i] + a[j] == mid)) return 0; } return 1; } }; const long long debug = 0; int32_t main() { if (debug) freopen( input.txt , r , stdin); ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long tests = 1; if (debug) cin >> tests; while (tests--) { long long stress = 0; if (!stress) { long long n; cin >> n; vector<Pnt> a; a.reserve(n); for (long long i = 0; i < n; ++i) { long long x, y; cin >> x >> y; a.push_back({x, y}); } Solver solver(a); long long res = solver.solve(); if (res) cout << YES n ; else cout << NO n ; } else { } } return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> void debug(T v, string delimiter = n ) { for (__typeof(v.begin()) it = v.begin(), it_end = v.end(); it != it_end; it++) cout << *it << delimiter; cout << flush; } int dx[] = {0, 1, 0, -1}; int dy[] = {1, 0, -1, 0}; string ds = SENW ; const double PI = 4.0 * atan(1.0); string solve(string s) { if (s[0] == 0 ) return 0; long long ans = 1; if (s[0] == ? || isalpha(s[0])) ans = 9; string zero = ; vector<int> used(30); int rem = 10; if (isalpha(s[0])) { used[s[0] - A ] = 1; rem--; } for (int i = 1; i < (int)(s.size()); i++) { if (s[i] == ? ) { zero += 0 ; } else if (isalpha(s[i])) { if (used[s[i] - A ] == 0) { used[s[i] - A ] = 1; ans *= rem; rem--; } } } ostringstream out; out << ans; string ret = out.str(); return ret + zero; } int main() { string s; while (cin >> s) { cout << solve(s) << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 300000; int sub[2 * MAXN + 5][2]; int par[2 * MAXN + 5]; int getRoot(int a) { while (par[a] > 0) { a = par[a]; } return a; } long long int ans = 0; void dsu(int a, int b) { int x0 = sub[a][0] + sub[b][0]; int x1 = sub[a][1] + sub[b][1]; ans -= sub[a][0] * 1ll * sub[a][1] + sub[b][0] * 1ll * sub[b][1]; ans += x0 * 1ll * x1; if (sub[a][0] + sub[a][1] < sub[b][0] + sub[b][1]) { sub[b][0] = x0; sub[b][1] = x1; par[a] = b; } else { sub[a][0] = x0; sub[a][1] = x1; par[b] = a; } } void removeDSU(int a, int b) { if (sub[a][0] + sub[a][1] < sub[b][0] + sub[b][1]) { sub[b][0] -= sub[a][0]; sub[b][1] -= sub[a][1]; par[a] = -1; } else { sub[a][0] -= sub[b][0]; sub[a][1] -= sub[b][1]; par[b] = -1; } ans -= (sub[a][0] + sub[b][0]) * 1ll * (sub[a][1] + sub[b][1]); ans += sub[a][0] * 1ll * sub[a][1] + sub[b][0] * 1ll * sub[b][1]; } vector<pair<int, int> > st[8 * MAXN]; void addEdge(int id, int l, int r, int u, int v, int x, int y) { if (v < l || r < u) return; if (u <= l && r <= v) { st[id].push_back(pair<int, int>(x, y)); return; } int mid = (l + r) / 2; addEdge(id * 2, l, mid, u, v, x, y); addEdge(id * 2 + 1, mid + 1, r, u, v, x, y); } unordered_map<int, int> prevApp[MAXN + 4]; long long int res[MAXN + 5]; void dfs(int id, int l, int r) { vector<pair<int, int> > operations; for (auto i : st[id]) { int m = getRoot(i.first); int n = getRoot(i.second); if (m == n) { continue; } operations.push_back(pair<int, int>(m, n)); dsu(m, n); } int mid = (l + r) / 2; if (l == r) { res[l] = ans; } else { dfs(id * 2, l, mid); dfs(id * 2 + 1, mid + 1, r); } reverse(operations.begin(), operations.end()); for (auto i : operations) { removeDSU(i.first, i.second); } } int main() { ios::sync_with_stdio(0); cin.tie(NULL); int q; cin >> q; for (int i = 1; i <= q; i++) { int x, y; cin >> x >> y; if (prevApp[x][y] == 0) { prevApp[x][y] = i; } else { addEdge(1, 1, q, prevApp[x][y], i - 1, x, y + MAXN); prevApp[x][y] = 0; } } for (int i = 1; i <= MAXN; i++) { for (auto j : prevApp[i]) { if (j.second > 0) { addEdge(1, 1, q, j.second, q, i, j.first + MAXN); } } } memset(par, -1, sizeof(par)); for (int i = 1; i <= MAXN; i++) { sub[i][0] = 1; sub[i + MAXN][1] = 1; } dfs(1, 1, q); for (int i = 1; i <= q; i++) cout << res[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; bool flag = 0; void sss(int &n, int &k) { if (flag == 0) n = n + k; else if (flag == 1) n = n - k; } void print(int &now, int k) { k += 48; if (k > now) { while (k != now) { printf( + ); now++; } } else if (k < now) { while (k != now) { printf( - ); now--; } } printf( . ); } int main() { int i, k = 0, n = 0; char c; while ((c = getchar()) != EOF) { if (c >= 0 && c <= 9 ) n = n * 10 + c - 0 ; else if (c == + ) { sss(k, n); n = 0; flag = 0; } else if (c == - ) { sss(k, n); n = 0; flag = 1; } } sss(k, n); n = 0; int p = k, j; while (p) { p /= 10; n++; } if (k == 0) n = 1; int now = 0; for (i = n; i >= 1; i--) { p = k; for (j = 1; j <= i - 1; j++) p /= 10; p %= 10; print(now, p); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 100 + 10; double dp[2][maxn][maxn]; double s[maxn][maxn], s2[maxn][maxn]; inline double S(int x1, int y1, int x2, int y2) { return s[x2][y2] - s[x2][y1 - 1] - s[x1 - 1][y2] + s[x1 - 1][y1 - 1]; } inline double S2(int x1, int y1, int x2, int y2) { return s2[x2][y2] - s2[x1 - 1][y1 - 1]; } int a[maxn]; int main() { int n, k; scanf( %d%d , &n, &k); k = min(k, 1000); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); for (int m = 1; m <= k; m++) { for (int i = 1; i <= n + 1; i++) for (int j = 1; j <= n + 1; j++) s[i][j] = s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1] + dp[(m + 1) % 2][i][j], s2[i][j] = s2[i - 1][j - 1] + dp[(m + 1) % 2][i][j]; for (int i = 1; i <= n; i++) for (int j = i + 1; j <= n; j++) { double &d = dp[m % 2][i][j]; d = 0; for (int x = 1; x <= i; x++) d += S(x, j, x + j - i - 1, j) + (n - j + 1 - S2(x, x + j - i, x + n - j, x + n - i)); for (int x = i + 1; x <= j; x++) d += S(i, x, i, x + n - j); int mul = (n - j + 1) * (n - j) / 2 + i * (i - 1) / 2 + (j - i) * (j - i - 1) / 2; d += mul * dp[(m + 1) % 2][i][j]; d /= (n * (n + 1) / 2); } } double ans = 0; for (int i = 1; i <= n; i++) for (int j = i + 1; j <= n; j++) ans += (a[i] > a[j] ? (1 - dp[k % 2][i][j]) : dp[k % 2][i][j]); printf( %.10f n , ans); } |
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; long long mod = 1000000007; long long sols = 0, ti = 0; for (int i = s.size() - 1; i >= 0; i--) { if (s[i] == b ) ti++; else { sols += ti; ti *= 2; sols %= mod; ti %= mod; } } cout << sols << endl; } |
#include <bits/stdc++.h> using namespace std; int n, t; string str1, str2; int main() { scanf( %d %d , &n, &t); cin >> str1 >> str2; int l1 = n - t, l2 = n - t; string ans; ans.resize(n); for (int i = 0; i < n; i++) { if (l1 == 0 && l2 == 0) break; if (str1[i] == str2[i]) { ans[i] = str1[i]; l1--; l2--; } } if (l1 == 0 && l2 == 0) { for (int i = 0; i < n; i++) { if (ans[i] >= a && ans[i] <= z ) continue; for (int j = a ; j <= z ; j++) { if (j != str1[i] && j != str2[i]) { ans[i] = j; break; } } } } else { int state = 0; for (int i = 0; i < n; i++) { if (l1 == 0 && l2 == 0) { if (ans[i] >= a && ans[i] <= z ) continue; for (int j = a ; j <= z ; j++) { if (j != str1[i] && j != str2[i]) { ans[i] = j; break; } } } else { if (ans[i] >= a && ans[i] <= z ) continue; if (state == 0) { l1--; ans[i] = str1[i]; state = 1; } else { l2--; ans[i] = str2[i]; state = 0; } } } } if (l1 > 0 || l2 > 0) printf( -1 n ); else cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; const int mod = 1000000007; struct M { int v[2][2]; } A, V, c[1 << 20]; struct Vec { int v[2]; } a[1 << 20], Vec0; bool E(const M& a) { return a.v[0][0] == 1 && a.v[1][1] == 1 && a.v[0][1] == 0 && a.v[1][0] == 0; } M operator*(const M& a, const M& b) { M ret; for (int i = 0; i < 2; ++i) for (int j = 0; j < 2; ++j) ret.v[i][j] = (1ll * a.v[i][0] * b.v[0][j] + 1ll * a.v[i][1] * b.v[1][j]) % mod; return ret; }; Vec operator+(const Vec& a, const Vec& b) { Vec ret; ret.v[0] = (a.v[0] + b.v[0]) % mod; ret.v[1] = (a.v[1] + b.v[1]) % mod; return ret; } Vec operator*(const M& m, const Vec& vec) { Vec ret; ret.v[0] = (1ll * vec.v[0] * m.v[0][0] + 1ll * vec.v[1] * m.v[0][1]) % mod; ret.v[1] = (1ll * vec.v[0] * m.v[1][0] + 1ll * vec.v[1] * m.v[1][1]) % mod; return ret; } M pow(M a, int b) { M t; t.v[0][0] = t.v[1][1] = 1; t.v[0][1] = t.v[1][0] = 0; while (b) { if (b & 1) t = t * a; b = b >> 1; a = a * a; } return t; } void init(int u, int l, int r) { if (l == r) { int b; scanf( %d , &b); M t = pow(A, b - 1); a[u].v[0] = t.v[0][0]; a[u].v[1] = t.v[0][1]; return; } c[u].v[0][0] = c[u].v[1][1] = 1; c[u].v[0][1] = c[u].v[1][0] = 0; int mid = (l + r) >> 1; init(u << 1, l, mid); init(u << 1 | 1, mid + 1, r); a[u] = a[u << 1] + a[u << 1 | 1]; } int L, R; void change(int u, int l, int r) { if (R < l || r < L) return; if (L <= l && r <= R) { c[u] = V * c[u]; a[u] = V * a[u]; return; } if (!E(c[u])) { c[u << 1] = c[u] * c[u << 1]; a[u << 1] = c[u] * a[u << 1]; c[u << 1 | 1] = c[u] * c[u << 1 | 1]; a[u << 1 | 1] = c[u] * a[u << 1 | 1]; c[u].v[0][0] = c[u].v[1][1] = 1; c[u].v[0][1] = c[u].v[1][0] = 0; } int mid = (l + r) >> 1; change(u << 1, l, mid); change(u << 1 | 1, mid + 1, r); a[u] = a[u << 1] + a[u << 1 | 1]; } Vec query(int u, int l, int r) { if (R < l || r < L) return Vec0; if (L <= l && r <= R) return a[u]; int mid = (l + r) >> 1; return c[u] * (query(u << 1, l, mid) + query(u << 1 | 1, mid + 1, r)); } int main() { A.v[0][0] = A.v[0][1] = A.v[1][0] = 1; int n, m; scanf( %d%d , &n, &m); init(1, 1, n); for (int i = 0; i < m; ++i) { int op, x; scanf( %d , &op); if (op == 1) { scanf( %d%d%d , &L, &R, &x); V = pow(A, x); change(1, 1, n); } else { scanf( %d%d , &L, &R); Vec vec = query(1, 1, n); printf( %d n , vec.v[0]); } } return 0; } |
#include <bits/stdc++.h> using namespace std; bool sortbysec(const pair<long long int, long long int> &a, const pair<long long int, long long int> &b) { if (a.first > b.first) return (a.first < b.first); else if (a.first == b.first) return (a.second > b.second); else return true; } void solve() { long long int n, c; cin >> n >> c; long long int a[n]; for (long long int i = 0; i < n; i++) cin >> a[i]; long long int cnt = 1; for (long long int i = 1; i < n; i++) { if (a[i] - a[i - 1] <= c) cnt++; else cnt = 1; } if (n == 1) cout << 1; else cout << cnt; } int main() { solve(); return 0; } |
#include <bits/stdc++.h> const unsigned long long M1 = 1e8 + 7; const unsigned long long M2 = 1e9 + 7; const unsigned long long M3 = 998244353; const int N = 2e5 + 5; int n, m, k, U[N], V[N], h[10], ans; unsigned long long k1[N], k2[N], k3[N], f1[10][10], f2[10][10], f3[10][10], g[10][10]; unsigned long long s1, s2, s3; std::vector<int> E[N]; void dfs(int dep) { if (dep == k + 1) { unsigned long long b1, b2, b3, d = 0; b1 = 0; b2 = 0; b3 = 0; for (int i = 1; i <= k; i++) { b1 += f1[i][h[i]]; b2 += f2[i][h[i]]; b3 += f3[i][h[i]]; d += g[i][h[i]]; } if (b1 == s1 && b2 == s2 && b3 == s3 && d == n) ++ans; return; } for (int i = 1; i <= dep; i++) { h[dep] = i; dfs(dep + 1); } } int main() { scanf( %d%d%d , &n, &m, &k); for (int i = 1, x, y, w; i <= m; i++) { scanf( %d%d%d , &x, &y, &w); U[w] = x; V[w] = y; E[x].push_back(w); } k1[0] = k2[0] = k3[0] = 1; for (int i = 1; i <= n; i++) { std::sort(E[i].begin(), E[i].end()); k1[i] = k1[i - 1] * M1; k2[i] = k2[i - 1] * M2; k3[i] = k3[i - 1] * M3; s1 += k1[i]; s2 += k2[i]; s3 += k3[i]; } for (int i = 1; i <= n; i++) for (int v = 0, s = E[i].size(); v < s; v++) { f1[s][v + 1] += k1[V[E[i][v]]]; f2[s][v + 1] += k2[V[E[i][v]]]; f3[s][v + 1] += k3[V[E[i][v]]]; g[s][v + 1]++; } dfs(1); printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2005; int arr[N][N], n; vector<int> adj[N], revAdj[N]; bool visited[N]; vector<int> vec; void dfs(int v) { visited[v] = 1; for (auto i : revAdj[v]) if (!visited[i]) dfs(i); vec.push_back(v); } void dfs2(int v) { visited[v] = 1; for (auto i : adj[v]) if (!visited[i]) dfs2(i); } void func() { cin >> n; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { cin >> arr[i][j]; if (arr[i][j]) arr[i][j] = 1; } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { if (j != i && arr[i][j]) { revAdj[j].push_back(i); adj[i].push_back(j); } } } for (int i = 1; i <= n; i++) if (!visited[i]) dfs(i); reverse(vec.begin(), vec.end()); for (int i = 1; i <= n; i++) visited[i] = 0; int cnt = 0; for (int i = 0; i < n; i++) { if (!visited[vec[i]]) { cnt++; if (cnt > 1) { cout << NO n ; return; } dfs2(vec[i]); } } cout << YES n ; } int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); int ntc = 1; for (int i = 1; i <= ntc; i++) { func(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int a[2 * 100000 + 10]; int n, m, k; bool find(int pos) { int m1 = 0; while (m1 < m && pos <= n) { int k1 = k; while (pos <= n && a[pos] <= k1) { k1 -= a[pos++]; } m1++; } return pos == n + 1 ? 1 : 0; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); cerr.tie(nullptr); cin >> n >> m >> k; for (int i = 1; i <= n; i++) { cin >> a[i]; } int ans = 0; int l = 1, r = n; while (l <= r) { int mid = (l + r) / 2; if (find(mid)) { ans = max(ans, n - mid + 1); r = mid - 1; } else { l = mid + 1; } } cout << ans; return 0; } |
#include <bits/stdc++.h> constexpr int Mod = 1e9 + 7; inline int fpm(int a, int b) { int res = 1; while (b) { if (b & 1) res = 1LL * res * a % Mod; a = 1LL * a * a % Mod; b >>= 1; } return res; } int n, m, k, r, c, sx, sy, tx, ty; int tot; int main() { scanf( %d%d%d , &n, &m, &k); scanf( %d%d , &r, &c); scanf( %d%d%d%d , &sx, &sy, &tx, &ty); if (sx == tx && sy == ty) tot = 1LL * n * m % (Mod - 1); else tot = ((1LL * n * m - 1LL * r * c) % (Mod - 1) + Mod - 1) % (Mod - 1); printf( %d n , fpm(k, tot)); } |
#include <bits/stdc++.h> using namespace std; const int buf_size = 1e5 + 5; char buf[buf_size], *S, *T; inline char gc() { if (S == T) T = (S = buf) + fread(buf, 1, buf_size, stdin); return S != T ? *(S++) : EOF; } inline int in() { int x = 0, f = 1; char c = gc(); while (c < 0 || c > 9 ) { if (c == - ) f = -1; c = gc(); } while (c >= 0 && c <= 9 ) x = x * 10 + c - 48, c = gc(); return x * f; } const int N = 2e6 + 5, mod = 1e9 + 7; int q, x, y, n = 2000000, ans; int inv[N], fac[N], finv[N]; int pri[N], pc, c[N]; int p[N]; bool inp[N]; int a[105], ac; inline int add(const int &a, const int &b) { return a + b >= mod ? a + b - mod : a + b; } inline int mul(const int &a, const int &b) { return 1ll * a * b % mod; } inline int C(const int &a, const int &b) { return mul(fac[a], mul(finv[b], finv[a - b])); } int main() { inv[1] = fac[0] = fac[1] = finv[0] = finv[1] = 1; for (int i = 2; i <= n; i++) { inv[i] = mul(mod - mod / i, inv[mod % i]); fac[i] = mul(fac[i - 1], i); finv[i] = mul(finv[i - 1], inv[i]); } for (int i = 2; i <= n; i++) { if (!inp[i]) pri[++pc] = i, c[i] = i; for (int j = 1; j <= pc && i * pri[j] <= n; j++) { inp[i * pri[j]] = 1; c[i * pri[j]] = pri[j]; if (i % pri[j] == 0) break; } } p[0] = 1; for (int i = 1; i <= n; i++) p[i] = mul(p[i - 1], 2); q = in(); while (q--) { x = in(), y = in(); ac = 0, ans = 0; int res = 1; while (x > 1) { a[++ac] = c[x]; x /= c[x]; } for (int i = 1, j; i <= ac; i = j + 1) { j = i; while (j + 1 <= ac && a[j + 1] == a[i]) j++; res = mul(res, C(j - i + y, y - 1)); } ans = mul(res, p[y - 1]); printf( %d n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 100; char s[maxn], t[maxn]; int s_big[30], s_small[30], t_big[30], t_small[30]; int main() { while (scanf( %s%s , s + 1, t + 1) != EOF) { memset(s_big, 0, sizeof(s_big)); memset(s_small, 0, sizeof(s_small)); memset(t_big, 0, sizeof(t_big)); memset(t_small, 0, sizeof(t_small)); int len1 = strlen(s + 1); int len2 = strlen(t + 1); for (int i = 1; i <= len1; i++) { if (s[i] > Z ) { s_small[s[i] - a ]++; } else { s_big[s[i] - A ]++; } } for (int i = 1; i <= len2; i++) { if (t[i] > Z ) { t_small[t[i] - a ]++; } else { t_big[t[i] - A ]++; } } int ans1 = 0, ans2 = 0; for (int i = 0; i < 26; i++) { ans1 += min(s_small[i], t_small[i]); ans1 += min(s_big[i], t_big[i]); if (s_small[i] < t_small[i]) { t_small[i] -= s_small[i]; s_small[i] = 0; } else { s_small[i] -= t_small[i]; t_small[i] = 0; } if (s_big[i] < t_big[i]) { t_big[i] -= s_big[i]; s_big[i] = 0; } else { s_big[i] -= t_big[i]; t_big[i] = 0; } } for (int i = 0; i < 26; i++) { ans2 += min(s_small[i], t_big[i]); ans2 += min(s_big[i], t_small[i]); } printf( %d %d n , ans1, ans2); } return 0; } |
#include <bits/stdc++.h> using namespace std; vector<pair<int, int>> P; bool used[111]; int pos; bool ok(int T) { if (T == pos) return true; used[T] = true; for (int i = 0; i < P.size(); i++) { if (used[i] == false) { if (P[T].first > P[i].first && P[T].first < P[i].second || P[T].second > P[i].first && P[T].second < P[i].second) { used[i] = true; if (ok(i)) return true; } } } return false; } string ans(int l, int r) { pos = r; for (int i = 0; i < 111; i++) used[i] = false; if (ok(l)) return YES ; return NO ; } int main() { int n; cin >> n; for (int i = 0; i < n; i++) { int type; cin >> type; if (type == 1) { int a, b; cin >> a >> b; P.push_back(make_pair(a, b)); } else { int l, r; cin >> l >> r; l--; r--; cout << ans(l, r) << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int gcd(int x, int y) { if (y == 0) return x; else return gcd(y, x % y); } int lcm(int x, int y) { return x / gcd(x, y) * y; } int binpow(int a, int p) { if (!p) return 1; int g = binpow(a, p >> 1); if (p % 2 == 0) return (g * g) % 1000000007; else return (((g * g) % 1000000007) * a) % 1000000007; } int rev(int n) { return binpow(n, 1000000007 - 2); } void solve(); int main() { cout.setf(ios::fixed); cout.precision(20); cerr.setf(ios::fixed); cerr.precision(3); int n = 1; for (int i = 0; i < n; ++i) solve(); } long long a[100100]; long long n; long long r[100100]; void solve() { cin >> n; int i; for (i = 0; i < n; i++) cin >> a[i]; r[0] = a[0]; for (i = 1; i < n; i++) r[i] = max(r[i - 1], a[i]); int m; cin >> m; long long len, sz; for (i = 0; i < m; i++) { cin >> len >> sz; cout << max(r[0], r[len - 1]) << endl; r[0] = max(r[0], r[len - 1]) + sz; } } |
#include <bits/stdc++.h> using namespace std; const int INF = 1 << 29; const double EPS = 1e-8; const double PI = acos(-1); const int MAX_N = 400000; struct SegSum { int bit[MAX_N + 1]; int n; void init(int _n) { n = _n; memset(bit, 0, sizeof(bit)); } int sum(int i) { int s = 0; while (i > 0) { s += bit[i]; i -= i & -i; } return s; } int sum(int a, int b) { return sum(b) - sum(a - 1); } void add(int i, int x) { while (i <= n) { bit[i] += x; i += i & -i; } } } SegSum; int a[300000]; int pos[300000]; int main() { int n; while (cin >> n) { for (int i = 0; i < (int)n; ++i) { scanf( %d , a + i); a[i]--; pos[a[i]] = i; } SegSum.init(n); for (int i = 0; i < (int)n; ++i) { if (a[i] == 0 || pos[a[i] - 1] > i) { SegSum.add(a[i] + 1, 1); } } int q; cin >> q; for (int i = 0; i < (int)q; ++i) { int k, x, y; scanf( %d%d%d , &k, &x, &y); x--; y--; if (k == 1) { int r = SegSum.sum(x + 1, y + 1); if (SegSum.sum(x + 1, x + 1) == 0) r++; cout << r << endl; } else { if (a[x] + 1 < n && pos[a[x] + 1] > x && pos[a[x] + 1] < y) { SegSum.add(a[x] + 1 + 1, 1); } if (a[x] - 1 >= 0 && pos[a[x] - 1] > x && pos[a[x] - 1] < y) { SegSum.add(a[x] + 1, -1); } if (a[y] + 1 < n && pos[a[y] + 1] >= x && pos[a[y] + 1] < y) { SegSum.add(a[y] + 1 + 1, -1); } if (a[y] - 1 >= 0 && pos[a[y] - 1] >= x && pos[a[y] - 1] < y) { SegSum.add(a[y] + 1, 1); } swap(a[x], a[y]); swap(pos[a[x]], pos[a[y]]); } } } } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5; int t, n; long long x[maxn + 10], y[maxn + 10], z[maxn + 10]; long long l[4], r[4], tl[4], tr[4]; long long a[4]; void update(int p, long long a, long long b) { l[p] = max(l[p], a - b); r[p] = min(r[p], a + b); } bool calc() { long long sum = 0; for (int i = 0; i <= 3; ++i) { tl[i] = l[i] & 1 ? (l[i] + 1) / 2 : l[i] / 2; tr[i] = r[i] & 1 ? (r[i] - 1) / 2 : r[i] / 2; if (tl[i] > tr[i]) return 0; if (i) { a[i] = tl[i]; sum += tl[i]; } } for (int i = 1; i <= 3; ++i) { long long v = min(max(tl[0] - sum, 0ll), tr[i] - tl[i]); a[i] += v; sum += v; } return sum >= tl[0] && sum <= tr[0]; } bool chk(long long v) { memset(l, -0x3f, sizeof l); memset(r, 0x3f, sizeof r); for (int i = 1; i <= n; ++i) { update(0, x[i] + y[i] + z[i], v); update(1, x[i] + y[i] - z[i], v); update(2, x[i] - y[i] + z[i], v); update(3, -x[i] + y[i] + z[i], v); } if (calc()) { for (int i = 1; i <= 3; ++i) a[i] *= 2; return 1; } l[0] -= 3; r[0] -= 3; for (int i = 1; i <= 3; ++i) { --l[i]; --r[i]; } if (calc()) { for (int i = 1; i <= 3; ++i) a[i] = a[i] * 2 + 1; return 1; } return 0; } int main() { scanf( %d , &t); while (t--) { scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %lld%lld%lld , &x[i], &y[i], &z[i]); long long l = 0, r = 3e18; while (l != r) { long long mid = (l + r) >> 1; if (chk(mid)) r = mid; else l = mid + 1; } chk(l); printf( %lld %lld %lld n , (a[1] + a[2]) / 2, (a[1] + a[3]) / 2, (a[2] + a[3]) / 2); } } |
#include <bits/stdc++.h> using namespace std; int main() { long t; cin >> t; while (t--) { long long n, k; cin >> n >> k; n = n * k; if (n % 2 == 1) cout << n / 2 + 1; else cout << n / 2; cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; typedef pair<long long, long long> ll; typedef vector<long long> vl; typedef vector<ll> vll; typedef vector<vl> vvl; template <typename T> ostream &operator<<(ostream &o, vector<T> v) { if (v.size() > 0) o << v[0]; for (unsigned i = 1; i < v.size(); i++) o << << v[i]; return o << ; } template <typename U, typename V> ostream &operator<<(ostream &o, pair<U, V> p) { return o << ( << p.first << , << p.second << ) ; } template <typename T> istream &operator>>(istream &in, vector<T> &v) { for (unsigned i = 0; i < v.size(); i++) in >> v[i]; return in; } template <typename T> istream &operator>>(istream &in, pair<T, T> &p) { in >> p.first; in >> p.second; return in; } template <typename T> ostream &operator<<(ostream &o, set<T> v) { for (auto &it : v) o << it << ; return o << n ; } template <typename T, typename U> ostream &operator<<(ostream &o, map<T, U> v) { for (auto &it : v) o << it << ; return o << n ; } struct custom_hash { static uint64_t splitmix64(uint64_t x) { x += 0x9e3779b97f4a7c15; x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9; x = (x ^ (x >> 27)) * 0x94d049bb133111eb; return x ^ (x >> 31); } size_t operator()(uint64_t x) const { static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count(); return splitmix64(x + FIXED_RANDOM); } }; int main(int argc, char *argv[]) { long long n, d; cin >> n >> d; vl a(n); cin >> a; long long m; cin >> m; sort((a).begin(), (a).end()); if (m <= n) { long long res = 0; for (long long i = (0); i < (long long)m; i++) res += a[i]; cout << res; } else { long long sum = accumulate((a).begin(), (a).end(), 0LL); cout << sum - (m - n) * d; } return 0; } |
#include <bits/stdc++.h> using namespace std; int a, b, c; int sisa(int x, int n) { if (x >= 0) return x % n; else if (abs(x) % n == 0) return 0; else return ((abs(x) / n) + 1) * n + x; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> a >> b >> c; b += c; cout << (sisa(b, a) == 0 ? a : sisa(b, a)) << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; int k; cin >> k; if (k == 0) { if (n % 6 == 0 || n % 6 == 5) cout << 0; else if (n % 6 == 1 || n % 6 == 2) cout << 1; else cout << 2; } else if (k == 1) { if (n % 3 == 0) cout << 1; else if (n % 3 == 1) cout << 0; else cout << 2; } else { if (n % 6 == 0 || n % 6 == 1) cout << 2; else if (n % 6 == 2 || n % 6 == 3) cout << 0; else cout << 1; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 4, INF = 1e9; int sub[N], par[N], nn, level[N]; set<int> adj[N]; vector<int> ar[N]; void dfs(int n, int p) { for (auto i : ar[n]) if (i != p) level[i] = level[n] + 1, dfs(i, n); } void dfs1(int n, int p) { nn++; sub[n] = 1; for (auto i : adj[n]) if (i != p) dfs1(i, n), sub[n] += sub[i]; } int dfs2(int n, int p) { for (auto i : adj[n]) if (i != p and sub[i] > nn / 2) return dfs2(i, n); return n; } void decompos(int n, int p) { nn = 0; dfs1(n, n); int centroid = dfs2(n, n); if (p == -1) p = centroid; par[centroid] = p; for (auto i : adj[centroid]) adj[i].erase(centroid), decompos(i, centroid); adj[centroid].clear(); } int main() { int n, m, i, j, a, b; cin >> n; for (i = 1; i < n; i++) cin >> a >> b, adj[a].insert(b), adj[b].insert(a); decompos(1, -1); for (i = 1; i <= n; i++) { if (par[i] == i) { j = i; continue; } ar[i].push_back(par[i]); ar[par[i]].push_back(i); } dfs(j, -1); for (i = 1; i <= n; i++) cout << char(level[i] + A ) << ; cout << endl; } |
#include <bits/stdc++.h> using namespace std; const int Maxn = 1000 + 10; int n, m, k, t; vector<pair<int, int> > w; int main() { cin >> n >> m >> k >> t; for (int i = 0; i < k; i++) { int f, s; cin >> f >> s; w.push_back(make_pair(f, s)); } sort(w.begin(), w.end()); for (int i = 0; i < t; i++) { int x, y; cin >> x >> y; pair<int, int> cell = make_pair(x, y); int in = -2; for (int j = 0; j < k; j++) { if (cell == w[j]) { in = -1; break; } else if (cell < w[j]) break; else in = j; } if (in == -1) cout << Waste n ; else { int num = (x - 1) * m + (y - 1) - max(in + 1, 0); if (num % 3 == 0) cout << Carrots n ; else if (num % 3 == 1) cout << Kiwis n ; else cout << Grapes n ; } } } |
#include <bits/stdc++.h> using namespace std; long long n, m; int gcd(long long a, long long b) { if (!b) return a; return gcd(b, a % b); } int main() { ios_base::sync_with_stdio(false); cin.tie(0), cout.tie(0); long long a, b = 0, c = 0, t, lj = 0, k = 0, r = 0, l = 0, sum = 0, rr, mn = LLONG_MAX, mx = LLONG_MIN, w, y = 0, x = 0, d, neg = 0, pos = 0, ans = 0; string s5 = , s2 = , s3 = , s1 = , s = ; map<char, long long> mp; cin >> a >> b >> x >> y; c = gcd(x, y); while (c != 1) { x /= c; y /= c; c = gcd(x, y); } cout << min(b / y, a / x); } |
#include <bits/stdc++.h> using namespace std; long long a[100010]; int main() { int n; scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %lld , &a[i]); int m; scanf( %d , &m); long long l = 0; while (m--) { long long w, h; scanf( %lld%lld , &w, &h); l = max(l, a[w - 1]); printf( %lld n , l); l += h; } return 0; } |
#include <bits/stdc++.h> using namespace std; using pii = pair<int, int>; const int N = 3 + 1e5; struct node { int x, h, id; bool operator<(const node& b) const { return x < b.x; } } a[N]; struct { int l, r, v; bool flag; } tr[1000000 * 4]; int n; int b[N * 10], t; int ans[N]; void up(int k) { tr[k].v = tr[(k << 1)].v + tr[(k << 1 | 1)].v; } void down(int k) { tr[(k << 1)].v = 0; tr[(k << 1 | 1)].v = 0; tr[(k << 1)].flag = tr[(k << 1 | 1)].flag = true; tr[k].flag = false; } void build(int k, int l, int r) { tr[k].l = l; tr[k].r = r; if (l == r) { return; } int mid = l + r >> 1; build((k << 1), l, mid); build((k << 1 | 1), mid + 1, r); } void update1(int k, int l, int r) { if (l <= tr[k].l && tr[k].r <= r) { tr[k].v = 0; tr[k].flag = true; return; } int mid = tr[k].l + tr[k].r >> 1; if (tr[k].flag) down(k); if (l <= mid) update1((k << 1), l, r); if (r > mid) update1((k << 1 | 1), l, r); up(k); } void update2(int k, int p, int v) { if (tr[k].l == tr[k].r) { tr[k].v += v; return; } int mid = tr[k].l + tr[k].r >> 1; if (tr[k].flag) down(k); if (p <= mid) update2((k << 1), p, v); else update2((k << 1 | 1), p, v); up(k); } int query(int k, int l, int r) { if (l <= tr[k].l && tr[k].r <= r) return tr[k].v; if (tr[k].flag) down(k); int ans = 0, mid = tr[k].l + tr[k].r >> 1; if (l <= mid) ans = query((k << 1), l, r); if (r > mid) ans += query((k << 1 | 1), l, r); return ans; } int main() { cin >> n; for (int i = 1; i <= n; ++i) { cin >> a[i].x >> a[i].h; a[i].id = i; b[++t] = a[i].x; b[++t] = a[i].x + 1; b[++t] = a[i].x + a[i].h - 1; } sort(b + 1, b + t + 1); t = unique(b + 1, b + t + 1) - b - 1; sort(a + 1, a + n + 1); build(1, 1, t); for (int i = n; i; --i) { int p1 = lower_bound(b + 1, b + t + 1, a[i].x) - b; int p2 = lower_bound(b + 1, b + t + 1, a[i].x + 1) - b; int p3 = lower_bound(b + 1, b + t + 1, a[i].x + a[i].h - 1) - b; int rec = query(1, p2, p3); ans[a[i].id] = rec + 1; update1(1, p2, p3); update2(1, p1, rec + 1); } for (int i = 1; i <= n; ++i) cout << ans[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, a[1005]; void Solve() { scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %d , &a[i]); for (int i = 1;; ++i) { for (int j = 2; j <= n; ++j) { if (a[j] < a[j - 1]) goto fail; } printf( %d n , i - 1); break; fail:; if (i & 1) { for (int j = 1; j <= n; j += 2) { if (j + 1 > n) continue; if (a[j] > a[j + 1]) swap(a[j], a[j + 1]); } } else { for (int j = 2; j <= n; j += 2) { if (j + 1 > n) continue; if (a[j] > a[j + 1]) swap(a[j], a[j + 1]); } } } } int main() { int T; scanf( %d , &T); while (T-- > 0) Solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; void print(pair<int, int> v) { if (v.first < 10) { cout << 0 << v.first << : ; } else { cout << v.first << : ; } if (v.second < 10) { cout << 0 << v.second; } else { cout << v.second; } } int main() { int n; cin >> n; vector<pair<int, int> > v; for (int i = 0; i < n; i++) { int h, m; char d; cin >> h >> d >> m; v.push_back({h, m}); } sort(v.begin(), v.end()); v.push_back({v[0].first + 24, v[0].second}); int mans = -1; for (int i = 0; i < v.size() - 1; i++) { int m = 0; m = (v[i + 1].first - v[i].first) * 60 + (v[i + 1].second - v[i].second) - 1; mans = max(mans, m); } print({mans / 60, mans % 60}); } |
#include <bits/stdc++.h> using namespace std; int rdn() { int ret = 0; bool fx = 1; char ch = getchar(); while (ch > 9 || ch < 0 ) { if (ch == - ) fx = 0; ch = getchar(); } while (ch >= 0 && ch <= 9 ) ret = ret * 10 + ch - 0 , ch = getchar(); return fx ? ret : -ret; } long long Sqr(int x) { return (long long)x * x; } const int N = 1e6 + 5, M = N * 3; int n, m, col[N], hd[N], xnt, to[M], nxt[M]; int f[N], fa[N], c[N][2], siz[N], sizi[N]; int p[N], tot; bool vis[N]; long long siz2i[N], tmp, dlt[N]; bool isrt(int x) { return c[fa[x]][0] != x && c[fa[x]][1] != x; } void pshp(int x) { siz[x] = siz[c[x][0]] + siz[c[x][1]] + sizi[x] + 1; } void rotate(int x) { int y = fa[x], z = fa[y]; bool d = (x == c[y][1]); if (!isrt(y)) c[z][y == c[z][1]] = x; fa[x] = z; fa[y] = x; fa[c[x][!d]] = y; c[y][d] = c[x][!d]; c[x][!d] = y; pshp(y); pshp(x); } void splay(int x) { for (int y, z; !isrt(x); rotate(x)) { y = fa[x]; z = fa[y]; if (!isrt(y)) ((y == c[z][0]) ^ (x == c[y][0])) ? rotate(x) : rotate(y); } } void access(int x) { for (int t = 0; x; t = x, x = fa[x]) { splay(x); int y = c[x][1]; sizi[x] += siz[y]; siz2i[x] += Sqr(siz[y]); sizi[x] -= siz[t]; siz2i[x] -= Sqr(siz[t]); c[x][1] = t; pshp(x); } } int fnd_rt(int x) { access(x); splay(x); while (c[x][0]) x = c[x][0]; splay(x); return x; } void link(int x) { splay(x); tmp -= Sqr(siz[c[x][1]]) + siz2i[x]; int y = f[x], rt = fnd_rt(y); splay(rt); tmp -= Sqr(siz[c[rt][1]]); splay(y); fa[x] = y; sizi[y] += siz[x]; siz2i[y] += Sqr(siz[x]); pshp(y); access(x); splay(rt); tmp += Sqr(siz[c[rt][1]]); } void cut(int x) { int rt = fnd_rt(x); tmp += siz2i[x]; tmp -= Sqr(siz[c[rt][1]]); int y = f[x]; splay(y); c[y][1] = 0; fa[x] = 0; pshp(y); splay(rt); tmp += Sqr(siz[c[rt][1]]); } namespace Q { int hd[N], xnt, to[M], id[M], nxt[M]; void add(int x, int y, int i) { to[++xnt] = y; nxt[xnt] = hd[x]; hd[x] = xnt; id[xnt] = i; } void solve(int cr) { tot = 0; for (int i = hd[cr]; i; i = nxt[i]) p[++tot] = i; for (int i = tot, d; i; i--) { tmp = 0; d = p[i]; if (vis[to[d]]) link(to[d]); else cut(to[d]); dlt[id[d]] += tmp; vis[to[d]] ^= 1; } } void solve2(int cr) { for (int i = hd[cr]; i; i = nxt[i]) { tmp = 0; if (vis[to[i]]) link(to[i]); else cut(to[i]); vis[to[i]] ^= 1; } } } // namespace Q namespace I { int hd[N], xnt, to[N], nxt[N]; void add(int x, int y) { to[++xnt] = y; nxt[xnt] = hd[x]; hd[x] = xnt; } void solve(int cr) { tot = 0; for (int i = hd[cr]; i; i = nxt[i]) p[++tot] = to[i]; tmp = 0; for (int i = tot; i; i--) { if (vis[p[i]]) link(p[i]); else cut(p[i]); vis[p[i]] ^= 1; } dlt[0] += tmp; } void solve2(int cr) { for (int i = hd[cr]; i; i = nxt[i]) { tmp = 0; if (vis[to[i]]) link(to[i]); else cut(to[i]); vis[to[i]] ^= 1; } } } // namespace I void add(int x, int y) { to[++xnt] = y; nxt[xnt] = hd[x]; hd[x] = xnt; } void ini_dfs(int cr, int fa) { f[cr] = fa; for (int i = hd[cr], v; i; i = nxt[i]) if ((v = to[i]) != fa) ini_dfs(v, cr); } int main() { n = rdn(); m = rdn(); for (int i = 2; i <= n + 1; i++) { col[i] = rdn(); I::add(col[i], i); } for (int i = 1, u, v; i < n; i++) u = rdn() + 1, v = rdn() + 1, add(u, v), add(v, u); add(1, 2); add(2, 1); ini_dfs(1, 0); for (int i = 1, u, d; i <= m; i++) { u = rdn() + 1; d = rdn(); Q::add(col[u], u, i); col[u] = d; Q::add(d, u, i); } for (int i = 2; i <= n + 1; i++) siz[i] = 1; for (int i = 2; i <= n + 1; i++) link(i); dlt[0] = (long long)n * n * n; for (int i = 1; i <= n; i++) { I::solve(i); Q::solve(i); Q::solve2(i); I::solve2(i); } long long ans = (long long)n * n * n; for (int i = 0; i <= m; i++) { ans -= dlt[i]; printf( %lld n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long x, y, z; cin >> x >> y >> z; long long ans1 = x / z + y / z, ans2 = 0; x %= z; y %= z; if (x + y >= z) { ans1++; ans2 = min(z - x, z - y); } cout << ans1 << << ans2 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; vector<long long> v; int main() { long long pl, pr, vl, vr, k; double ans = 0; cin >> pl >> pr >> vl >> vr >> k; for (int h = 1; h <= 9; h++) { for (int i = 0; i < (1 << h); i++) { int x = 0, y = 1; for (int j = 0; j < h; j++) { if (i & (1 << j)) { x += 4 * y; } else { x += 7 * y; } y *= 10; } v.push_back(x); } } v.push_back(0); sort(v.begin(), v.end()); v.push_back(1e9 + 1); double pt = 0; for (int i = 0; i + k + 1 < v.size(); i++) { ans += max(0ll, (min(v[i + 1], pr) - max(v[i] + 1, pl)) + 1) * max(0ll, (min(v[i + k + 1] - 1, vr) - max(v[i + k], vl)) + 1); ans += max(0ll, (min(v[i + 1], vr) - max(v[i] + 1, vl)) + 1) * max(0ll, (min(v[i + k + 1] - 1, pr) - max(v[i + k], pl)) + 1); if (pt != ans && k == 1) { if (min(v[i + 1], pr) == max(v[i + k], vl) || max(v[i] + 1, vl) == min(v[i + k + 1] - 1, pr)) { ans--; } } pt = ans; } double all = ((pr - pl) + 1) * ((vr - vl) + 1); cout << fixed << setprecision(12) << ans / all; return 0; } |
#include <bits/stdc++.h> using namespace std; const double pi = 2 * acos(0.0); long long int pow1(long long int n, long long int k) { long long int ret = 1; while (k) { if (k % 2 == 1) ret = (ret * n) % 1000000007; n = (n * n) % 1000000007; k /= 2; } return ret; } string s, s1; int n; string q[100000]; long long int A[10], len[10]; int main() { cin >> s; cin >> n; for (int i = 0; i < n; i++) cin >> q[i]; for (int i = 0; i < 10; i++) { A[i] = i; len[i] = 1; } for (int i = n - 1; i >= 0; i--) { int idx = q[i][0] - 0 ; long long int val = 0, val1 = 0; for (int j = 3; j < q[i].size(); j++) { int d = q[i][j] - 0 ; val = (val * pow1(10, len[d])) % 1000000007; val += A[d]; val %= 1000000007; val1 += len[d]; val1 %= (1000000007 - 1); } A[idx] = val; len[idx] = val1; } long long int ans = 0; for (int i = 0; i < s.size(); i++) { int d = s[i] - 0 ; ans = (ans * pow1(10, len[d]) + A[d]) % 1000000007; } printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long inf = 1e9 + 7, llinf = 1e18 + 123; void xru() { setlocale(LC_ALL, rus ); ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } void dolitb(long long p, long long x, set<long long>& s, vector<long long>& a) { if (s.empty() || s.lower_bound(p) == s.end()) { return; } long long np = *s.lower_bound(p); if (x > a[np]) { x -= a[np]; a[np] = 0; s.erase(s.find(np)); dolitb(np + 1, x, s, a); } else { a[np] -= x; } } int main() { xru(); long long n; cin >> n; vector<long long> a(n); for (long long ghgh = 0; ghgh < a.size(); ghgh++) cin >> a[ghgh]; ; vector<long long> cnt = a; set<long long> s; for (long long i = 0; i < n; i++) { s.insert(i); } long long t; cin >> t; vector<long long> ans; for (long long q = 0; q < t; q++) { long long num; cin >> num; if (num == 1) { long long p, x; cin >> p >> x; p--; dolitb(p, x, s, a); } else { long long p; cin >> p; p--; ans.push_back(cnt[p] - a[p]); } } for (long long ghgha = 0; ghgha < ans.size(); ghgha++) cout << ans[ghgha] << endl; ; } |
#include <bits/stdc++.h> using namespace std; int n, k; string s; int sol(string a) { int co = 0; for (int i = 0; i < k; i++) if (s[i] != a[i % 3]) co++; int ans = co; for (int i = 1; i <= n - k; i++) { if (s[i - 1] != a[(i - 1) % 3]) co--; if (s[i + k - 1] != a[(i + k - 1) % 3]) co++; ans = min(ans, co); } return ans; } int main() { int t; cin >> t; while (t--) { cin >> n >> k >> s; cout << min(min(sol( RGB ), sol( GBR )), sol( BRG )) << endl; } } |
#include <bits/stdc++.h> using namespace std; const int mx = 8e3; void run_case(void) { int n; cin >> n; vector<int> x(n); for (int i = 0; i < n; i++) cin >> x[i]; int d = x[1] - x[0]; for (int i = 1; i < n - 1; i++) { if (x[i + 1] - x[i] != d) { cout << x[n - 1] << endl; return; } } cout << x[n - 1] + d << endl; } int main(void) { ios_base ::sync_with_stdio(false); cin.tie(NULL); run_case(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = (int)1e4 + 10; struct Edge { int from, to, l, r, nxt; } e[N << 2]; int head[N], cnt = 0; int n, m, k, s1, s2, f, book[N]; long long d1[N], d2[N]; void add(int u, int v, int l, int r) { e[++cnt] = (Edge){u, v, l, r, head[u]}; head[u] = cnt; } void spfa1(int s) { memset(d1, 38, sizeof(d1)); memset(book, 0, sizeof(book)); book[s] = 1; d1[s] = 0; queue<int> q; while (!q.empty()) q.pop(); q.push(s); while (!q.empty()) { int x = q.front(); q.pop(); book[x] = 0; for (int i = head[x]; i; i = e[i].nxt) { int v = e[i].to; if (d1[v] > d1[x] + e[i].r) { d1[v] = d1[x] + e[i].r; if (!book[v]) book[v] = 1, q.push(v); } } } } void spfa2(int s) { memset(d2, 38, sizeof(d2)); memset(book, 0, sizeof(book)); book[s] = 1; d2[s] = 0; queue<int> q; while (!q.empty()) q.pop(); q.push(s); while (!q.empty()) { int x = q.front(); q.pop(); book[x] = 0; for (int i = head[x]; i; i = e[i].nxt) { int v = e[i].to; if (d2[v] > d2[x] + e[i].r) { d2[v] = d2[x] + e[i].r; if (!book[v]) book[v] = 1, q.push(v); } } } } bool check(int fff) { int fl = 1; while (fl) { fl = 0; spfa1(s1), spfa2(s2); for (int i = m + 1; i <= m + k; i++) if (d1[e[i].from] < d2[e[i].from] && (e[i].l != e[i].r)) e[i].r = e[i].l, fl = 1; if (d1[f] < d2[f] + fff) { puts(fff ? DRAW : WIN ); for (int i = m + 1; i <= m + k; i++) cout << e[i].r << ; return 1; } } return 0; } int main() { cin >> n >> m >> k; cin >> s1 >> s2 >> f; for (int i = 1; i <= m; i++) { int u, v, w; scanf( %d%d%d , &u, &v, &w); add(u, v, w, w); } for (int i = 1; i <= k; i++) { int u, v, l1, l2; scanf( %d%d%d%d , &u, &v, &l1, &l2); add(u, v, l1, l2); } if (!check(0) && !check(1)) puts( LOSE ); } |
#include <bits/stdc++.h> using namespace std; int mark(int n) { for (int i = 2; i * i <= n; i++) { if (n % i == 0) return i; } return 0; } int main() { int n; cin >> n; int res = n; while (n != 1) { if (n % 2 == 0) { n = n / 2; res += n; } else { int x = mark(n); if (x == 0) { res += 1; n = 1; } else { n /= x; res += n; } } } cout << res << endl; } |
#include <bits/stdc++.h> using namespace std; #define st first #define nd second #define pb push_back #define cl(x,v) memset((x), (v), sizeof(x)) #define db(x) cerr << #x << == << x << endl #define dbs(x) cerr << x << endl #define _ << , << typedef long long ll; typedef long double ld; typedef pair<int,int> pii; typedef pair<int, pii> piii; typedef pair<ll,ll> pll; typedef pair<ll, pll> plll; typedef vector<int> vi; typedef vector <vi> vii; const ld EPS = 1e-9, PI = acos(-1.); const ll LINF = 0x3f3f3f3f3f3f3f3f; const int INF = 0x3f3f3f3f, MOD = 1e9+7; const int N = 5e5+5; int t,n,st[4*N], v[N], nxt[N], d[N]; void build (int p, int l, int r) { if (l == r) {st[p] = v[l]; return;} build (2*p, l, (l+r)/2); build (2*p+1, (l+r)/2+1, r); st[p] = max(st[2*p], st[2*p+1]); } int query (int p, int l, int r, int i, int j) { if (r < i or j < l) return -INF; if (i <= l and r <= j) return st[p]; int x = query(2*p, l, (l+r)/2, i, j); int y = query(2*p+1, (l+r)/2+1, r, i, j); return max(x, y); } void update (int p, int l, int r, int x, int v) { if (x < l or r < x) return; if (l == r and l == x) {st[p] = v; return;} update (2*p, l, (l+r)/2, x, v); update (2*p+1, (l+r)/2+1, r, x, v); if (l != r) st[p] = max(st[2*p], st[2*p+1]); } int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> t; while(t--){ cin >> n; build(1,0,n); stack<pii> s; for(int i=1;i<=n;i++){ cin >> v[i]; while(s.size()){ pii cur = s.top(); if(cur.st < v[i]) nxt[cur.nd] = i; else break; s.pop(); } s.push({v[i],i}); } update(1,0,n,0,1); nxt[0] = 1; priority_queue <pii> pq; pq.push({-nxt[0],0}); for(int i=1;i<=n;i++){ int mx = query(1,0,n,0,v[i]); //cout << mx+1 << ; update(1,0,n,v[i],mx+1); int last = -1; while(pq.size()){ pii cur = pq.top(); if(-cur.st == i) { if(last != cur.nd){ int now = query(1,0,n,cur.nd,cur.nd); update(1,0,n,cur.nd,now+1); } } else break; pq.pop(); last = cur.nd; } if(nxt[i]) pq.push({-nxt[i],v[i]}); } cout << query(1,0,n,0,n) - 1 << n ; for(int i=0;i<=n;i++) v[i] = nxt[i] = 0; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1010 + 1; const double EPS = 1E-8; int n; double a[MAXN], low[MAXN], high[MAXN], mmin, mmax; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %lf , &a[i]); if (i) { low[i] = 10 * a[i] / (i + 1); high[i] = 10 * (a[i] + 1) / (i + 1); mmin = max(mmin, low[i]); mmax = min(mmax, high[i]); } else { low[i] = 10 * a[i]; high[i] = 10 * (a[i] + 1); mmin = low[i]; mmax = high[i]; } } mmin = (n + 1) * mmin / 10; mmax = (n + 1) * mmax / 10; int res = (int)floor(mmin + EPS); if (res - EPS < mmin && mmax < res + 1 + EPS) { puts( unique ); printf( %d n , res); } else { puts( not unique ); } return 0; } |
#include <bits/stdc++.h> using namespace std; bitset<6> a[6]; bool check(int i, int j, int k) { if (a[i][j] and a[i][k] and a[j][k]) return 1; if (!a[i][j] and !a[i][k] and !a[j][k]) return 1; return 0; } int main() { int n; cin >> n; for (int i = 0; i < 6; ++i) a[i].reset(); for (int i = 0; i < n; ++i) { int l, r; cin >> l >> r; a[l][r] = a[r][l] = 1; } for (int i = 1; i < 6; ++i) { for (int j = i + 1; j < 6; ++j) { for (int k = j + 1; k < 6; ++k) { if (check(i, j, k)) return cout << WIN , 0; } } } return cout << FAIL , 0; } |
#include <bits/stdc++.h> using namespace std; int n; int v[100111]; int main() { ios_base::sync_with_stdio(false); cin >> n; for (int i = 0; i < n; i++) cin >> v[i]; sort(v, v + n); int ans = 1; for (int i = 0; i < n; i++) { if (v[i] >= ans) { ans++; } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n, i, ans, st, ed; cin >> n; string s; cin >> s; st = 1, ed = 1; for (i = 1; i < n; i++) { if (s[i] == s[i - 1]) st++; else break; } for (i = n - 2; i >= 0; i--) { if (s[i] == s[i + 1]) ed++; else break; } if (s[0] == s[n - 1]) { ans = ((ed + 1) * (st + 1)) % 998244353; } else { ans = (st + ed) % 998244353; ans = (ans + 1) % 998244353; } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; const long long inf = 6 * 1e18; const long long Mod = 1e9 + 7; const long double pai = acos(-1); long long N, Add, Remove, Move; long long A[100009]; long long Cost(long long Goal) { long long More = 0, Need = 0; for (int i = 0; i < N; i++) { if (A[i] < Goal) Need += Goal - A[i]; else More += A[i] - Goal; } long long Mn = min(More, Need); More -= Mn, Need -= Mn; return More * Remove + Need * Add + Mn * Move; } long long Search(int l, int r) { while (r - l > 1) { int Mid1 = l + (r - l + 1) / 3; int Mid2 = r - (r - l + 1) / 3; if (Cost(Mid1) < Cost(Mid2)) r = Mid2; else l = Mid1; } long long Ans = inf; l = max(0, l - 10), r += 10; for (int i = l; i <= r; i++) Ans = min(Ans, Cost(i)); return Ans; } int main() { cin >> N >> Add >> Remove >> Move; Move = min(Move, Add + Remove); for (int i = 0; i < N; i++) cin >> A[i]; cout << Search(0, 1e9) << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { vector<int> v; long long int n, a, cnt = 0; cin >> n; for (int i = 0; i < n; i++) { cin >> a; v.push_back(a); } for (int i = 1; i < n - 1; i++) { if (v[i] < v[i - 1] && v[i] < v[i + 1]) cnt++; else if ((v[i] > v[i - 1] && v[i] > v[i + 1])) cnt++; } cout << cnt; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n]; int f = 0; for (int i = 1; i <= n; i++) { if (n % i == 0) { a[f] = i; f++; } } int h = 0; int j; for (int i = 0; i < f; i++) { for (j = 0; j <= f / 2; j++) { if (a[i] * a[j] == n) { h++; } } if (h != 0) { cout << a[i] << << a[j - 1]; break; } } return 0; } |
#include <bits/stdc++.h> using namespace std; long long dp[1 << 13][13], g[1 << 13]; bool good[1 << 13]; int parent[1 << 13], root[1 << 13], n; long long solve(int mask, int root); long long f(int mask) { if (g[mask] == -1) { if (root[mask] == -1) { g[mask] = 0; for (int i = 0; i < n; i++) if (((mask >> i) & 1) == 1) g[mask] += solve(mask ^ (1 << i), i); } else g[mask] = solve(mask ^ (1 << root[mask]), root[mask]); } return g[mask]; } long long solve(int mask, int root) { if (mask == 0) return 1; if (dp[mask][root] == -1) { dp[mask][root] = 0; for (int i = mask; i > 0; i = (i - 1) & mask) { if ((i & mask & -mask) == 0 || !good[i] || (parent[i] != -1 && parent[i] != root)) continue; dp[mask][root] += solve(mask ^ i, root) * f(i); } } return dp[mask][root]; } int u[100], v[100], a[100], b[100], c[100]; int main() { int m, q; scanf( %d %d %d , &n, &m, &q); if (n == 1) { printf( 1 n ); return 0; } for (int i = 0; i < m; i++) { scanf( %d %d , u + i, v + i); u[i]--; v[i]--; } for (int i = 0; i < q; i++) { scanf( %d %d %d , a + i, b + i, c + i); a[i]--; b[i]--; c[i]--; } for (int i = 0; i < (1 << n); i++) { good[i] = true; parent[i] = root[i] = -1; g[i] = -1; for (int j = 0; j < n; j++) dp[i][j] = -1; for (int j = 0; j < m; j++) { int w = -1; if (((i >> u[j]) & 1) == 1 && ((i >> v[j]) & 1) == 0) w = v[j]; if (((i >> v[j]) & 1) == 1 && ((i >> u[j]) & 1) == 0) w = u[j]; if (w != -1) { if (parent[i] == -1) parent[i] = w, root[i] = u[j] + v[j] - w; else good[i] = false; } } for (int j = 0; j < q; j++) { int cnt = 0; if (((i >> a[j]) & 1) == 1) cnt++; if (((i >> b[j]) & 1) == 1) cnt++; if (((i >> c[j]) & 1) == 1) cnt++; if (cnt == 2 || (cnt == 1 && ((i >> c[j]) & 1) == 1)) good[i] = false; } } printf( %I64d n , solve((1 << n) - 2, 0)); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MaxN = 2100; inline long long add(long long a, long long b) { long long c = a + b; if (c >= (1000000007)) { c -= (1000000007); } return c; } inline long long mul(long long a, long long b) { return (a * b) % (1000000007); } int n, m; long long D[MaxN][MaxN], D2[MaxN][MaxN]; int main() { scanf( %d %d , &n, &m); for (int i = 2; i <= m; i++) { D[0][i] = 1; D2[0][i] = 1; } for (int i = 1; i < n; i++) { long long sum = 0; for (int j = 2; j <= m; j++) { sum = add(sum, D[i - 1][j]), D[i][j] = add(D[i][j - 1], sum); } for (int j = 2; j <= m; j++) { D[i][j] = add(D[i][j], 1), D2[i][j] = add(D[i][j], (1000000007) - D[i - 1][j]); } } long long ans = 0; for (int i = 0; i < n; i++) { for (int j = 2; j <= m; j++) { ans = add(ans, mul(m - j + 1, mul(D[i][j], D2[n - i - 1][j]))); } } printf( %I64d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; enum op_t { AND = 0, OR, XOR, VAL }; op_t bin_op_from_string(const string& s) { if (s == AND ) { return AND; } else if (s == OR ) { return OR; } else if (s == XOR ) { return XOR; } else { throw std::runtime_error( Unknown op: + s); } } struct Operation { op_t op; int v1, v2; string v; }; int n, m; map<string, int> num; vector<Operation> ops; vector<int> val; string min_val, max_val; bool isNumber(const string& s) { for (const char& c : s) { if (c < 0 || c > 9 ) { return false; } } return true; } int num_from_string(const string& s) { if (s == ? ) { return -1; } return num[s]; } int val_from_operand(int v, int x) { if (v == -1) { return x; } else { return val[v]; } } int calc(int b, int x) { int ret = 0; for (int i = 0; i < n; ++i) { int v = 0; switch (ops[i].op) { case VAL: v = ops[i].v[b] - 0 ; break; case AND: v = val_from_operand(ops[i].v1, x) & val_from_operand(ops[i].v2, x); break; case OR: v = val_from_operand(ops[i].v1, x) | val_from_operand(ops[i].v2, x); break; case XOR: v = val_from_operand(ops[i].v1, x) ^ val_from_operand(ops[i].v2, x); break; default: throw std::runtime_error( Unknown op ); } val[i] = v; ret += v; } return ret; } int main() { cin >> n >> m; ops.resize(n); min_val.resize(m, 0 ); max_val.resize(m, 1 ); val.resize(n, 0); string s, eq, op, v1, v2; for (int i = 0; i < n; ++i) { cin >> s >> eq >> v1; num[s] = i; if (isNumber(v1)) { ops[i].op = VAL; ops[i].v = v1; } else { cin >> op >> v2; ops[i].op = bin_op_from_string(op); ops[i].v1 = num_from_string(v1); ops[i].v2 = num_from_string(v2); } } for (int i = 0; i < m; ++i) { int fst = calc(i, 0); int snd = calc(i, 1); if (fst < snd) { min_val[i] = 0 ; max_val[i] = 1 ; } else if (fst > snd) { min_val[i] = 1 ; max_val[i] = 0 ; } else { min_val[i] = max_val[i] = 0 ; } } cout << min_val << endl << max_val << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long INF = (long long)1e18 + 5; const long long MOD = (long long)1e9 + 7; const int MAXN = 55; const int MAXM = 20005; struct ST { long long val[4 * MAXM], add[4 * MAXM]; void init(int l, int r, int idx) { add[idx] = val[idx] = 0; if (l == r) { return; } int m = (l + r) >> 1; init(l, m, idx << 1); init(m + 1, r, idx << 1 | 1); } long long RMQ(int ql, int qr, int l, int r, int idx) { assert(ql <= qr); if (ql <= l && r <= qr) { return val[idx]; } long long m = (l + r) >> 1, ans = -INF; if (ql <= m) ans = max(ans, RMQ(ql, qr, l, m, idx << 1) + add[idx]); if (qr > m) ans = max(ans, RMQ(ql, qr, m + 1, r, idx << 1 | 1) + add[idx]); return ans; } void range_add(int ql, int qr, long long v, int l, int r, int idx) { assert(ql <= qr); if (ql <= l && r <= qr) { add[idx] += v; val[idx] += v; return; } int m = (l + r) >> 1; if (ql <= m) range_add(ql, qr, v, l, m, idx << 1); if (qr > m) range_add(ql, qr, v, m + 1, r, idx << 1 | 1); val[idx] = max(val[idx << 1], val[idx << 1 | 1]) + add[idx]; } } tree; int n, m, k; long long sum[MAXN][MAXM], dp[MAXN][MAXM]; long long range_sum(int r1, int c1, int r2, int c2) { assert(r1 <= r2 && c1 <= c2); return sum[r2][c2] - sum[r2][c1 - 1] - sum[r1 - 1][c2] + sum[r1 - 1][c1 - 1]; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> m >> k; for (int i = 1; i <= n + 1; i++) { for (int j = 1; j <= m; j++) { if (i <= n) { cin >> sum[i][j]; } sum[i][j] += sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1]; } } for (int i = n; i >= 1; i--) { tree.init(1, m, 1); for (int j = 1; j <= m; j++) { long long p = range_sum(i, max(1, j - k + 1), i + 1, j); if (i != 1 && j >= m - k + 1) { p -= range_sum(i, m - k + 1, i, j); } tree.range_add(j, j, p + dp[i + 1][j], 1, m, 1); } for (int j = m; j >= 1; j--) { dp[i][j] = tree.RMQ(1, m, 1, m, 1); if (i != 1 && j > 1) { long long r = range_sum(i, j, i, j); tree.range_add(j, min(m, j + k - 1), r, 1, m, 1); if (j - k >= 1) { long long l = range_sum(i, j - k, i, j - k); tree.range_add(j - k, j - 1, -l, 1, m, 1); } } } } cout << *max_element(dp[1] + 1, dp[1] + 1 + m) << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int csum[2000][2000]; int rsum[2000][2000]; int segCol[2000][2 * (1 << 11)]; int segRow[2000][2 * (1 << 11)]; int l[2 * (1 << 11)]; int r[2 * (1 << 11)]; void init() { for (int i = (1 << 11); i < 2 * (1 << 11); i++) l[i] = r[i] = i - (1 << 11); for (int i = ((1 << 11) - 1); i > 0; i--) { l[i] = l[2 * i]; r[i] = r[2 * i + 1]; } for (int k = 0; k < 2000; k++) { for (int i = 0; i < 2 * (1 << 11); i++) segCol[k][i] = segRow[k][i] = 0; } } void update(int x, int y) { int i = x + (1 << 11); int j = y + (1 << 11); segCol[y][i] = 1; segRow[x][j] = 1; i /= 2; j /= 2; while (i > 0) { segCol[y][i] = segCol[y][2 * i] + segCol[y][2 * i + 1]; i /= 2; } while (j > 0) { segRow[x][j] = segRow[x][2 * j] + segRow[x][2 * j + 1]; j /= 2; } } int x, y, low, high; int getRow(int i) { if ((r[i] < low) || (l[i] > high)) return 0; if ((l[i] >= low) && (r[i] <= high)) return segRow[x][i]; return getRow(2 * i) + getRow(2 * i + 1); } int getCol(int i) { if ((r[i] < low) || (l[i] > high)) return 0; if ((l[i] >= low) && (r[i] <= high)) return segCol[y][i]; return getCol(2 * i) + getCol(2 * i + 1); } string A[2000]; int main() { cin.tie(0); ios::sync_with_stdio(0); int N, M; cin >> N >> M; int lowx = 2000; int highx = -1; int lowy = 2000; int highy = -1; int tot = 0; for (int i = 0; i < N; i++) for (int j = 0; j < M; j++) rsum[i][j] = csum[i][j] = 0; for (int i = 0; i < N; i++) { cin >> A[i]; for (int j = 0; j < M; j++) { if (A[i][j] != w ) continue; lowx = min(lowx, i); highx = max(highx, i); lowy = min(lowy, j); highy = max(highy, j); rsum[i][j]++; csum[i][j]++; tot++; } } for (int i = 0; i < N; i++) for (int j = 1; j < M; j++) rsum[i][j] += rsum[i][j - 1]; for (int j = 0; j < M; j++) for (int i = 1; i < N; i++) csum[i][j] += csum[i - 1][j]; int d = max(highx - lowx, highy - lowy); int onB; for (int i = 0; (i + d) < N; i++) { for (int j = 0; (j + d) < M; j++) { if ((i < lowx) && (j < lowy)) continue; onB = rsum[i][j + d - 1] - rsum[i][j]; onB += rsum[i + d][j + d - 1] - rsum[i + d][j]; onB += csum[i + d - 1][j] - csum[i][j]; onB += csum[i + d - 1][j + d] - csum[i][j + d]; onB += (A[i][j] == w ) + (A[i][j + d] == w ) + (A[i + d][j] == w ) + (A[i + d][j + d] == w ); if (d == 0) onB = (A[i][j] == w ); if (onB == tot) { for (int x = 0; x < N; x++) { for (int y = 0; y < M; y++) { if (A[x][y] == w ) cout << w ; else if (((x == i) || (x == (i + d))) && (y >= j) && (y <= (j + d))) cout << + ; else if (((y == j) || (y == (j + d))) && (x >= i) && (x <= (i + d))) cout << + ; else cout << . ; } cout << n ; } return 0; } } } cout << -1 << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, m; long long dp[102][10005]; long long fwd[105][105]; long long ar[105][105]; long long solve(long long row, long long rem) { if (row > n || rem == m) { return 0; } if (dp[row][rem] != -1) return dp[row][rem]; long long i, ans = 0; ans = max(ans, solve(row + 1, rem)); for (i = 1; i <= ar[row][0]; i++) { if (rem + i <= m) { ans = max(ans, solve(row + 1, rem + i) + ar[row][i]); } else break; } return dp[row][rem] = ans; } int main() { long long tc, test, i, j, k, ans; scanf( %lld %lld , &n, &m); for (i = 1; i <= n; i++) { scanf( %lld , &ar[i][0]); for (j = 1; j <= ar[i][0]; j++) { scanf( %lld , &ar[i][j]); fwd[i][j] = fwd[i][j - 1] + ar[i][j]; } for (j = 1; j <= ar[i][0]; j++) { ar[i][j] = 0; for (k = 0; k <= j; k++) { ar[i][j] = max(ar[i][j], fwd[i][k] + fwd[i][ar[i][0]] - fwd[i][ar[i][0] - (j - k)]); } } } memset(dp, -1, sizeof dp); ans = solve(1, 0); printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int s[200500]; vector<int> gr[200500]; int res[200500]; map<int, map<int, int> > w; char clr[200500]; vector<int> com; int sum = 0; int root = 0; vector<int> tr[200500]; void dfs(int i) { clr[i] = 1; sum += s[i]; for (auto u : gr[i]) { if (!clr[u]) { tr[i].push_back(u); dfs(u); } } } void go(int i) { for (auto u : tr[i]) { go(u); if (w[i].count(u)) { res[w[i][u]] = s[u]; } else { res[w[u][i]] = -s[u]; } s[i] += s[u]; } } int main() { int n; cin >> n; for (int i = 1; i <= n; i++) cin >> s[i]; int m; cin >> m; for (int i = 0; i < m; i++) { int a, b; cin >> a >> b; gr[a].push_back(b); gr[b].push_back(a); w[a][b] = i; } for (int i = 1; i <= n; i++) { if (!clr[i]) { root = i; dfs(i); if (sum == 0) { go(i); } else { cout << Impossible ; return 0; } } } cout << Possible << endl; for (int i = 0; i < m; i++) { cout << res[i] << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; using LL = long long; using PII = pair<int, int>; char S[55][55]; int main() { int a, b, c, d; cin >> a >> b >> c >> d; int n = 50, m = 50; int x = 2, y = 2; bool flag = true; auto newline = [&]() { y = 2; x += flag ? 3 : 2; flag = true; }; auto fil = [&](int t, char c) { while (t--) { if (y + 1 == m) { newline(); } S[x][y] = c; if (!t) break; x += flag ? 1 : -1; y++; flag = !flag; } }; for (int i = (1); i <= (n); ++i) for (int j = (1); j <= (m); ++j) S[i][j] = D ; fil(a, A ); newline(); fil(b, B ); newline(); fil(c, C ); for (int j = (y); j <= (m); ++j) S[x][j] = C ; for (int i = (x); i <= (n); ++i) S[i][m] = C ; newline(); for (int i = (x); i <= (n); ++i) for (int j = (1); j <= (m); ++j) S[i][j] = C ; x++; fil(d - 1, D ); printf( %d %d n , n, m); for (int i = (1); i <= (n); ++i) printf( %s n , S[i] + 1); return 0; } |
#include <bits/stdc++.h> using namespace std; long long powmod(long long a, long long b, long long MOD) { long long res = 1; a %= MOD; for (; b; b >>= 1) { if (b & 1) res = res * a % MOD; a = a * a % MOD; } return res; } const int N = 1e5 + 5; int a[N]; map<long long, int> m; long long getAns(long long n) { long long x = m.begin()->first; while (m[x] % n == 0) { m[x + 1] += m[x] / n; x++; } return x; } int main() { int n; long long x, sum = 0; scanf( %d%I64d , &n, &x); for (int i = 0; i < n; i++) { scanf( %d , a + i); sum += a[i]; } for (int i = 0; i < n; i++) { m[sum - a[i]]++; } sum = min(getAns(x), sum); printf( %I64d n , powmod(x, sum, 1e9 + 7)); return 0; } |
#include <bits/stdc++.h> using namespace std; long long cyc[1000006][27], n, m; long long done[1000006]; string a, b; int main() { cin >> n >> m; cin >> a >> b; int s1 = a.size(); int s2 = b.size(); long long tot = s1 * n; memset(cyc, 0, sizeof(cyc)); memset(done, 0, sizeof(done)); long long ans = 0; for (int i = 0; i < s1; i++) { int st = i % s2; if (!done[st]) { int H[27]; memset(H, 0, sizeof(H)); H[b[st] - a ]++; done[st] = 1; int pos = 1; int en = (st + s1) % s2; while (en != st) { pos++; H[b[en] - a ]++; done[en] = pos; en = (en + s1) % s2; } done[st] = pos; for (int k = 0; k < 26; k++) cyc[st][k] = H[k]; en = (st + s1) % s2; while (en != st) { for (int k = 0; k < 26; k++) cyc[en][k] = H[k]; done[en] = pos; en = (en + s1) % s2; } } ans += (cyc[st][a[i] - a ] * ((tot) / (s1 * done[st]))); } cout << tot - ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; const ll MOD = 1e9 + 7; const int N = 2000; int board[N][N]; bool flip_row[N]; bool flip_col[N]; int bar[N]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n; cin >> n; for (int y = 0; y < n; ++y) { string str; cin >> str; for (int x = 0; x < n; ++x) { if (str[x] == 1 ) board[y][x] ^= 1; } } for (int y = 0; y < n; ++y) { string str; cin >> str; for (int x = 0; x < n; ++x) { if (str[x] == 1 ) board[y][x] ^= 1; } } string str; cin >> str; for (int i = 0; i < n; ++i) { if (str[i] == 1 ) bar[i] ^= 1; } for (int y = 0; y < n; ++y) { for (int x = 0; x < n; ++x) { if (board[y][x]) { if (!bar[y]) flip_row[y] = true; else if (!bar[x]) flip_col[x] = true; } } } int y0 = 0; for (y0 = 0; y0 < n; ++y0) { if (!bar[y0]) continue; for (int x = 0; x < n; ++x) { if (bar[x] && board[y0][x]) { flip_col[x] = true; } } break; } for (int y = y0 + 1; y < n; ++y) { if (!bar[y]) continue; for (int x = 0; x < n; ++x) { if (bar[x] && (board[y][x] ^ flip_col[x])) flip_row[y] = true; } } bool fail = false; for (int y = 0; y < n; ++y) { for (int x = 0; x < n; ++x) { if (flip_row[y]) board[y][x] ^= bar[x]; if (flip_col[x]) board[y][x] ^= bar[y]; if (board[y][x] == 1) fail = true; } } if (fail) { cout << -1 n ; } else { int cou = 0; for (int i = 0; i < n; ++i) cou += flip_row[i] + flip_col[i]; cout << cou << n ; for (int x = 0; x < n; ++x) { if (flip_col[x]) cout << col << x << n ; } for (int y = 0; y < n; ++y) { if (flip_row[y]) cout << row << y << n ; } } } |
#include <bits/stdc++.h> using namespace std; template <class T> inline T bigmod(T p, T e, T M) { long long ret = 1; for (; e > 0; e >>= 1) { if (e & 1) ret = (ret * p) % M; p = (p * p) % M; } return (T)ret; } template <class T> inline T gcd(T a, T b) { if (b == 0) return a; return gcd(b, a % b); } template <class T> inline T modinverse(T a, T M) { return bigmod(a, M - 2, M); } template <class T> inline T lcm(T a, T b) { a = abs(a); b = abs(b); return (a / gcd(a, b)) * b; } template <class T, class X> inline bool getbit(T a, X i) { T t = 1; return ((a & (t << i)) > 0); } template <class T, class X> inline T setbit(T a, X i) { T t = 1; return (a | (t << i)); } template <class T, class X> inline T resetbit(T a, X i) { T t = 1; return (a & (~(t << i))); } inline long long getnum() { char c = getchar(); long long num, sign = 1; for (; c < 0 || c > 9 ; c = getchar()) if (c == - ) sign = -1; for (num = 0; c >= 0 && c <= 9 ;) { c -= 0 ; num = num * 10 + c; c = getchar(); } return num * sign; } inline long long power(long long a, long long b) { long long multiply = 1; for (int i = (0); i < (b); i++) { multiply *= a; } return multiply; } string s, t; long long up[100002], thash, shash[100002]; bool exist[100002]; long long aux[100002], dp[100002], help[100002]; int main() { int test, cases = 1; cin >> s >> t; s = # + s; int l = t.size(), n = s.size() - 1; up[0] = 1; for (int i = 1; i < 100002; i++) up[i] = (up[i - 1] * 43) % 1000000007LL; for (int i = (0); i < (l); i++) { thash = (thash + (t[i] - a + 1) * up[i]) % 1000000007LL; } for (int i = (1); i < (n + 1); i++) { shash[i] = (shash[i - 1] + (s[i] - a + 1) * up[i - 1]) % 1000000007LL; } for (int i = n; i >= l; i--) { long long now = (shash[i] - shash[i - l]) % 1000000007LL; if (now < 0) now += 1000000007LL; long long temp = (thash * up[i - l]) % 1000000007LL; if (temp == now) { exist[i] = true; } } for (int i = 1; i <= n; i++) { if (exist[i]) { dp[i] = help[i - l] + i - l + 1; dp[i] %= 1000000007LL; } else dp[i] = dp[i - 1]; aux[i] = dp[i]; aux[i] += aux[i - 1]; aux[i] %= 1000000007LL; help[i] = help[i - 1] + aux[i]; help[i] %= 1000000007LL; } long long ans = 0; for (int i = (1); i < (n + 1); i++) ans = (ans + dp[i]) % 1000000007LL; cout << ans << n ; return 0; } |
#include <bits/stdc++.h> int dizi[200005][3], ans[200005]; int main() { int n, i, x, y; scanf( %d , &n); if (n == 3) { printf( 2 1 3 ); return 0; } for (i = 1; i <= n; i++) { scanf( %d %d , &x, &y); dizi[i][1] = x; dizi[i][2] = y; } for (i = 1; i <= n; i++) { x = dizi[i][1]; y = dizi[i][2]; if (dizi[x][1] == y || dizi[x][2] == y) { dizi[i][1] = x; dizi[i][2] = y; } else { dizi[i][1] = y; dizi[i][2] = x; } } y = 1; for (i = 1; i <= n; i++) { x = dizi[y][1]; printf( %d , x); y = x; } } |
#include <bits/stdc++.h> using namespace std; int cnt[(1 << 19)], mn[(1 << 19)], mx[(1 << 19)], ans[(1 << 19)]; void solve(int L, int R) { if (L + 1 == R) { ans[L] = 0x3f3f3f3f; mn[L] = cnt[L] ? 0 : 0x3f3f3f3f; mx[L] = cnt[L] ? 0 : -0x3f3f3f3f; } else { int M = (L + R) / 2, i, H = M - L; solve(L, M), solve(M, R); for (i = L; i < M; ++i) { int mn1 = mn[i], mx1 = mx[i], ans1 = ans[i], mn2 = mn[i + H], mx2 = mx[i + H], ans2 = ans[i + H]; mn[i] = min(mn1, mn2 + H); mx[i] = max(mx1, mx2 + H); ans[i] = min({ans1, ans2, mn2 + H - mx1}); mn[i + H] = min(mn2, mn1 + H); mx[i + H] = max(mx2, mx1 + H); ans[i + H] = min({ans1, ans2, mn1 + H - mx2}); } } } int main() { int n, k, i; scanf( %d%d , &n, &k); while (n--) { scanf( %d , &i); ++cnt[i]; } solve(0, 1 << k); for (i = 0; i < (1 << k); ++i) printf( %d , ans[i]); printf( n ); return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:256000000 ) using namespace std; const int MAXN = 1000100; int q = 0, qq, n; double x[MAXN], y[MAXN]; double c1[MAXN]; double c2[MAXN]; double c[MAXN]; void solve() { cin >> n; for (int i = 0; i < n; ++i) { cin >> c1[i]; } for (int i = 0; i < n; ++i) { cin >> c2[i]; c[i] = c2[i] + c1[i]; } double s1 = 0, s2 = 0; for (int i = 0; i < n; ++i) { double b = (c[i] + s2 - s1); double x1 = -(-b + sqrt(max(0.0, ((b) * (b)) + 4 * (c[i] * s1 - c1[i])))) / 2; double x2 = -(-b - sqrt(max(0.0, ((b) * (b)) + 4 * (c[i] * s1 - c1[i])))) / 2; x[i] = max(x1, x2); y[i] = c[i] - x[i]; s1 += x[i]; s2 += y[i]; } cout.precision(10); for (int i = 0; i < n; ++i) cout << fixed << x[i] << ; cout << endl; for (int i = 0; i < n; ++i) cout << fixed << y[i] << ; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); srand(1313); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, count = 0; cin >> n; char arr[n][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { cin >> arr[i][j]; } } for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { count = 0; int a = i - 1, b = i + 1, c = j - 1, d = j + 1; if (a >= 0 && a < n) if (arr[a][j] == o ) count++; if (b >= 0 && b < n) if (arr[b][j] == o ) count++; if (c >= 0 && c < n) if (arr[i][c] == o ) count++; if (d >= 0 && d < n) if (arr[i][d] == o ) count++; if (count & 1) return cout << NO << endl, 0; } } return cout << YES << endl, 0; } |
#include <bits/stdc++.h> using namespace std; int arr[400033], pp; int main() { int n, k, i; scanf( %d%d , &n, &k); for (i = 0; i < k; i++) scanf( %d , &arr[i]); stack<int> s; int curr = 1, pos = 1; for (i = 0; i < k; i++) { if (arr[i] == curr) curr++; else s.push(arr[i]); while (!s.empty() && s.top() == curr) { curr++; s.pop(); } } if (k == n) { if (curr == (n + 1)) for (i = 0; i < k; i++) printf( %d , arr[i]); else printf( -1 ); return 0; } while (1) { if (s.empty()) { int aa = n; while (k < n) { arr[k++] = aa--; } for (i = 0; i < k; i++) printf( %d , arr[i]); return 0; } else { int aa = s.top() - 1; if (aa + 1 < curr) { printf( -1 ); return 0; } while (k < n && aa >= curr) { arr[k++] = aa--; } curr = s.top() + 1; s.pop(); } if (k > n) { printf( -1 ); return 0; } } return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> bool elem(set<T> st, T val) { return (st.find(val) != st.end()); } template <typename T> void printv(vector<T> vt) { for (int i = 0; i < (int)vt.size() - 1; ++i) cout << vt[i] << ; cout << vt[vt.size() - 1] << endl; } int d[4][4]; int main(void) { int n; cin >> n; for (int i = 0; i < (int)4; ++i) { for (int j = 0; j < (int)4; ++j) cin >> d[i][j]; } int mn = 1000000; int mnp = -1; for (int i = 0; i < (int)4; ++i) { int r = ((d[i][0]) > (d[i][1])) ? (d[i][1]) : (d[i][0]); int l = ((d[i][2]) > (d[i][3])) ? (d[i][3]) : (d[i][2]); if (r + l <= n) { mn = ((d[i][0]) > (d[i][1])) ? (d[i][1]) : (d[i][0]); mnp = i; } } if (mnp == -1) cout << -1 << endl; else cout << mnp + 1 << << mn << << n - mn << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const int MAXN = 1000005; long long f[5010][5]; int _prev[5010][5], n; int a[MAXN]; long long sum[MAXN]; int main() { scanf( %d , &n); for (int i = (1); i < (n + 1); i++) scanf( %d , a + i); for (int i = (1); i < (n + 1); i++) sum[i] = sum[i - 1] + a[i]; for (int i = (1); i < (n + 1); i++) for (int j = (0); j < (4); j++) { if (j == 0) f[i][j] = sum[i]; else { f[i][j] = 1ll << 63; for (int k = (0); k < (i + 1); k++) { if (j & 1 && f[i][j] < f[k][j - 1] - sum[i] + sum[k]) _prev[i][j] = k, f[i][j] = f[k][j - 1] - sum[i] + sum[k]; if (!(j & 1) && f[i][j] < f[k][j - 1] + sum[i] - sum[k]) _prev[i][j] = k, f[i][j] = f[k][j - 1] + sum[i] - sum[k]; } } } long long ans = 1ll << 63, t; stack<int> res; for (int k = (0); k < (4); k++) if (ans <= f[n][k]) ans = f[n][k], t = k; int now = n; while (t) { now = _prev[now][t]; res.push(now); t--; } for (int i = (0); i < (3); i++) { if (res.empty()) printf( %d , n); else printf( %d , res.top()), res.pop(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n; const long long mod = 1e9 + 7; long long w[100010], ans = 0; vector<int> g[100010]; map<long long, int> mp[100010]; long long gcd(long long a, long long b) { if (!b) return a; return gcd(b, a % b); } void dfs(int u, int fa) { for (int i = 0; i < g[u].size(); ++i) { int v = g[u][i]; if (v == fa) continue; for (map<long long, int>::iterator it = mp[u].begin(); it != mp[u].end(); ++it) { long long d = gcd(it->first, w[v]); mp[v][d] += it->second; ans += d % mod * it->second % mod; ans %= mod; } mp[v][w[v]]++; ans += w[v]; dfs(v, u); } } int main() { cin >> n; for (int i = 1; i <= n; ++i) { scanf( %lld , &w[i]); } for (int i = 1; i < n; ++i) { int a, b; scanf( %d%d , &a, &b); g[a].push_back(b); g[b].push_back(a); } mp[1][w[1]]++; ans += w[1]; ans %= mod; dfs(1, 0); printf( %lld n , ans % mod); } |
#include <bits/stdc++.h> using namespace std; int main() { int N, K; cin >> N >> K; if (N * (N - 1) / 2 <= K) { cout << no solution n ; return 0; } for (int i = 0; i < N; ++i) cout << 0 << i << n ; } |
#include <bits/stdc++.h> using namespace std; void swapCols(int p1, int p2, vector<vector<int> >& matrix) { for (int i = 0; i < ((int)(matrix).size()); i++) swap(matrix[i][p1], matrix[i][p2]); } void swapRows(int p1, int p2, vector<vector<int> >& matrix) { for (int i = 0; i < ((int)(matrix[0]).size()); i++) swap(matrix[p1][i], matrix[p2][i]); } int main() { ios ::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; vector<vector<int> > matrix(n, vector<int>(n, 0)); vector<tuple<int, int, int> > operations; vector<int> cols(n), rows(n); for (int i = 0; i < (n - 1); i++) { int u, v; cin >> u >> v; u--; v--; matrix[u][v] = 1; rows[u]++; cols[v]++; } int dim = n - 1; while (dim != 0) { for (int i = 0; i <= dim; i++) { if (cols[i] == 0) { swap(cols[i], cols[dim]); swapCols(i, dim, matrix); if (i + 1 != dim + 1) operations.push_back(make_tuple(2, i + 1, dim + 1)); break; } } for (int i = 0; i <= dim; i++) { if (rows[i] != 0) { swap(rows[i], rows[dim]); swapRows(i, dim, matrix); if (i + 1 != dim + 1) operations.push_back(make_tuple(1, i + 1, dim + 1)); break; } } for (int i = 0; i <= dim; i++) { if (matrix[dim][i] == 1) cols[i]--; if (matrix[i][dim] == 1) rows[i]--; } dim--; } cout << ((int)(operations).size()) << n ; for (tuple<int, int, int> tup : operations) cout << get<0>(tup) << << get<1>(tup) << << get<2>(tup) << n ; } |
#include <bits/stdc++.h> using namespace std; long long n, tmp, ans, curr; string s; deque<pair<long long, long long> > v; void add(long long val, long long pos) { while (v.front().first <= val) { curr -= v.front().first * (v[1].second - v.front().second); v.pop_front(); } v.push_front({val, pos}); curr += v.front().first * (v[1].second - v.front().second); } int main() { cin >> n >> s; curr = ans = tmp = 0; v.push_front({1000000, n}); for (int i = s.size() - 1; i >= 0; i--) { if (s[i] == 0 ) { while (tmp >= 0) { add(tmp, i + tmp); tmp--; } tmp = 0; } else { tmp++; ans += (tmp * (tmp + 1)) / 2ll; add(tmp, i + tmp); } ans += curr; } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b, s; cin >> a >> b >> s; if (a < 0) a *= -1; if (b < 0) b *= -1; if (s < (a + b) || (s - a - b) % 2 != 0) cout << No << endl; else cout << Yes << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; inline char gc() { static char buf[1 << 14], *p1 = buf, *p2 = buf; return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 14, stdin), p1 == p2) ? EOF : *p1++; } inline long long read(long long &x) { x = 0; bool f = 1; char c = gc(); for (; !isdigit(c); c = gc()) { if (c == - ) f ^= 1; if (c == EOF) return EOF; } for (; isdigit(c); c = gc()) x = (x << 1) + (x << 3) + (c ^ 48); x = f ? x : -x; return 1; } inline void wr(long long x) { if (x < 0) putchar( - ), x = -x; if (x > 9) wr(x / 10); putchar(x % 10 | 48); } const long long N = 1e5 + 10; long long n; long long a[N], ans; int main() { read(n); for (long long i = 1, x; i <= n; ++i) read(a[i]); sort(a + 1, a + 1 + n); for (long long i = 2; i <= n; ++i) if (a[i] - a[i - 1] > 1) ans += a[i] - a[i - 1] - 1; wr(ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const double eps = 1e-7; double dp[10050][1005]; int ans[1005]; int main() { int k, q, p, i, j; cin >> k >> q; memset(dp, 0, sizeof dp); dp[0][0] = 1; for (i = 1;; ++i) { for (j = 1; j <= k; ++j) { dp[i][j] += dp[i - 1][j] * j / k; dp[i][j] += dp[i - 1][j - 1] * (k - j + 1.0) / k; } if (dp[i][k] >= 0.5) break; } int cout = 1; for (i = 1; i <= 1000; ++i) { while (dp[cout][k] < (i - eps) / 2000) cout++; ans[i] = cout; } while (q--) { cin >> p; printf( %d n , ans[p]); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 2147483647; const int N = 2005; int z, n, k, c, i, ind, tab[N]; char t[N]; string s; vector<pair<int, int> > v; void sett(int val, int ind) { if (tab[ind] == val) return; int i = ind + 1; while (tab[i] != val) i++; v.push_back(pair<int, int>(ind, i)); while (ind < i) { swap(tab[ind], tab[i]); ind++; i--; } } int main() { scanf( %d , &z); while (z--) { scanf( %d %d , &n, &k); scanf( %s , t); s = t; for (i = 0; i < n; i++) if (s[i] == ( ) tab[i] = 0; else tab[i] = 1; v.clear(); ind = 0; for (i = 0; i < k - 1; i++) { sett(0, ind++); sett(1, ind++); } c = n / 2 - k + 1; for (i = 0; i < c; i++) sett(0, ind++); for (i = 0; i < c; i++) sett(1, ind++); printf( %d n , v.size()); for (auto& w : v) printf( %d %d n , w.first + 1, w.second + 1); } return 0; } |
#include <bits/stdc++.h> using namespace std; vector<vector<pair<int, int> > > Mat; vector<int> Grafo; vector<int> Entrada; vector<int> Rev; vector<int> Aristas; stack<int> STACK; vector<int> Backi; int grafos; bool dfs(int A, int i, int pos) { Grafo[A] = grafos; Entrada[A] = pos; Backi[A] = pos; bool J = false; for (int I = 0; I < Mat[A].size(); I++) { if (Mat[A][I].first != i) { if (Grafo[Mat[A][I].first] == 0) { STACK.push(Mat[A][I].second); bool JJ = dfs(Mat[A][I].first, A, pos + 1); Backi[A] = min(Backi[A], Backi[Mat[A][I].first]); if (i == -1 || (i != -1 && Backi[Mat[A][I].first] >= Entrada[A])) { if (JJ) { int UU = STACK.top(); STACK.pop(); while (UU != Mat[A][I].second) { Aristas[UU] = 1; UU = STACK.top(); STACK.pop(); } Aristas[Mat[A][I].second] = 1; } else { int UU = STACK.top(); STACK.pop(); while (UU != Mat[A][I].second) { UU = STACK.top(); STACK.pop(); } } } else { if (JJ) J = JJ; } } else if (Entrada[Mat[A][I].first] < Entrada[A]) { if ((Entrada[A] - Entrada[Mat[A][I].first]) % 2 == 0) { J = true; } STACK.push(Mat[A][I].second); Backi[A] = min(Backi[A], Backi[Mat[A][I].first]); } } } return J; } int main() { int N, A, B, C; scanf( %d%d , &N, &A); Mat.resize(N); for (int I = 0; I < A; I++) { scanf( %d%d , &B, &C); B--; C--; Mat[B].push_back(make_pair(C, I)); Mat[C].push_back(make_pair(B, I)); } Backi.resize(N); Aristas.resize(A); Grafo.resize(N); grafos = 1; Entrada.resize(N); Entrada.resize(0); Entrada.resize(N); Rev.resize(N); for (int I = 0; I < N; I++) { if (Grafo[I] == 0) { bool OO = dfs(I, -1, 0); grafos++; } } vector<int> Distancias(N); vector<int> CC(N), Rev3(N); int cont = 0; int var; for (int I = 0; I < N; I++) { if (Rev3[I] == 0) { cont++; queue<int> COLA; COLA.push(I); Distancias[I] = 1; CC[I] = cont; Rev3[I] = 1; while (!COLA.empty()) { int KKK = COLA.front(); COLA.pop(); CC[KKK] = cont; Rev3[KKK] = 1; for (int I2 = 0; I2 < Mat[KKK].size(); I2++) { var = Mat[KKK][I2].first; if (Aristas[Mat[KKK][I2].second] == 0 && Rev3[var] == 0) { Distancias[var] = Distancias[KKK] + 1; COLA.push(var); Rev3[var] = 1; } } } } } int MM, AA, BB; scanf( %d , &MM); for (int I = 0; I < MM; I++) { scanf( %d%d , &AA, &BB); AA--; BB--; if (Grafo[AA] != Grafo[BB] || AA == BB) { printf( No n ); } else { if (CC[AA] != CC[BB]) printf( Yes n ); else { if ((Distancias[AA] + Distancias[BB] + 1) % 2 == 0) { printf( Yes n ); } else printf( No n ); } } } return 0; } |
#include <bits/stdc++.h> using namespace std; ifstream f( 1.in ); int n, k, x; long long a[205], ans; long long dp[205][205]; int main() { cin >> n >> k >> x; for (int i = 1; i <= n; i++) cin >> a[i]; if (k * (x + 1) - 1 < n) cout << -1 ; else { for (int i = 1; i <= n; i++) { for (int j = 0; j < min(x, i); j++) { if (k * (j + 1) - 1 < i - 1) continue; for (int l = max(0, i - k); l < i; l++) dp[i][j + 1] = max(dp[i][j + 1], dp[l][j] + a[i]); } } for (int j = 1; j <= n; j++) for (int l = n - k + 1; l <= n; l++) ans = max(ans, dp[l][j]); cout << ans; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int N; scanf( %d , &N); pair<int, int> *P = new pair<int, int>[N]; int *A = new int[N]; for (int i = 0; i < N; i++) { scanf( %d , &P[i].first); P[i].second = i; } sort(P, P + N); int p = 0; for (int i = 0; i < N; i++) { if (P[i].first < ++p) P[i].first = p; A[P[i].second] = p = P[i].first; } for (int i = 0; i < N; i++) { if (i != 0) putchar( ); printf( %d , A[i]); } puts( ); return 0; } |
#include <bits/stdc++.h> using namespace std; int dcmp(double x, double y) { return fabs(x - y) <= 1e-9 ? 0 : x < y ? -1 : 1; }; vector<long long> holder; void dfs(long long num, int i) { if (i == 10) { if (num) holder.push_back(num); return; } dfs(num * 10 + 4, i + 1); dfs(num * 10 + 7, i + 1); dfs(num, i + 1); } long long solve(long long idx) { long long ret = 0; long long hold = 0; for (int i = 0; i < ((int)((holder).size())); ++i) { if (idx >= holder[i]) { ret += (holder[i] * (holder[i] - hold)); hold = holder[i]; } else { ret += (idx - hold) * holder[i]; break; } } return ret; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long l, r; cin >> l >> r; dfs(0, 1); sort(holder.begin(), holder.end()); holder.push_back(4444444444); cout << solve(r) - solve(l - 1) << n ; } |
#include <bits/stdc++.h> using namespace std; int n, m; int getsum(long long x) { int res = 0; for (int i = 0; i <= m; i++) { long long num = x + i; while (num > 0) { res += num % 10; num /= 10; if (res > n) return n + 1; } } return res; } int main() { int q; scanf( %d , &q); for (int times = 1; times <= q; times++) { scanf( %d%d , &n, &m); long long pow = 100, sum = 0, ans = 1ll << 60; for (int i = 0; i <= 99; i++) if (getsum(i) == n) ans = min(ans, 1ll * i); for (int i = 0; i <= n / 9 - 1; i++) { for (int j = 1; j <= 9; j++) { for (int k = 0; k <= 9; k++) for (int l = 0; l <= 9; l++) { if (getsum(pow * j + sum + k * 10 + l) == n) { ans = min(ans, pow * j + sum + k * 10 + l); } } } sum += pow * 9; pow *= 10; if (getsum(pow + sum) > n) break; } if (ans == (1ll << 60)) puts( -1 ); else printf( %lld n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 301; int i, j, l, r, k, x, y, z, t, tot; int f[N][26], sum[N], p[N], q[N]; long long A[N][N], E[N][N], tmp[N][N]; long long n, m, a[N], INF, ans; char s[N]; void build(int value) { int x = 0, t; for (int i = 0; i < strlen(s); i++) { t = s[i] - a ; if (!f[x][t]) f[x][t] = ++tot; x = f[x][t]; } sum[x] += value; } void init() { cin >> n >> m; for (i = 1; i <= n; i++) cin >> a[i]; for (i = 1; i <= n; i++) { cin >> s; build(a[i]); } } void Ac() { int l = 0, r = 0; for (i = 0; i < 26; i++) if (f[0][i]) q[++r] = f[0][i]; while (l != r) { l++; x = q[l]; for (i = 0; i < 26; i++) if (f[x][i]) { q[++r] = f[x][i]; y = p[x]; while (!f[y][i] && y) y = p[y]; if (f[y][i]) y = f[y][i]; p[f[x][i]] = y; sum[f[x][i]] += sum[y]; } } } void cal(long long c[][N], long long a[][N], long long b[][N]) { int i, j, k; for (i = 0; i <= tot; i++) for (j = 0; j <= tot; j++) tmp[i][j] = INF; for (i = 0; i <= tot; i++) for (j = 0; j <= tot; j++) for (k = 0; k <= tot; k++) if (a[i][k] + b[k][j] > tmp[i][j]) tmp[i][j] = a[i][k] + b[k][j]; for (i = 0; i <= tot; i++) for (j = 0; j <= tot; j++) c[i][j] = tmp[i][j]; } void pr(long long a[][N]) { for (i = 0; i <= tot; i++) { for (j = 0; j <= tot; j++) if (a[i][j] > INF / 2) cout << a[i][j] << ; else cout << * ; printf( n ); } printf( n ); } void Matrix() { INF = 1LL << 60; INF *= -1; for (i = 0; i <= tot; i++) for (j = 0; j <= tot; j++) A[i][j] = E[i][j] = INF; for (i = 0; i <= tot; i++) E[i][i] = 0; for (i = 0; i <= tot; i++) for (j = 0; j < 26; j++) { y = i; while (y && !f[y][j]) y = p[y]; if (f[y][j]) y = f[y][j]; A[i][y] = sum[y]; } while (m) { if (m % 2) cal(E, E, A); cal(A, A, A); m /= 2; } ans = E[0][0]; for (i = 1; i <= tot; i++) ans = max(ans, E[0][i]); cout << ans; } int main() { init(); Ac(); Matrix(); } |
#include <bits/stdc++.h> int main() { int i = 0, j, t, n; char p[100]; scanf( %s , p); n = strlen(p); for (; i < n - 1; i = i + 2) { for (j = 0; j < n - 1; j = j + 2) { if (p[j] > p[j + 2]) { t = p[j]; p[j] = p[j + 2]; p[j + 2] = t; } } } printf( %s n , p); } |
#include <bits/stdc++.h> using namespace std; const int maxN = 1000; const int mod = 1000 * 1000 + 3; int toInt(string x) { stringstream second; second << x; int ret; second >> ret; return ret; } string Ex(int x) { for (int l = 1, p = 26;; l++, p *= 26) if (x <= p) { x--; string res; for (int i = 0; i < l; i++) res += string(1, A + x % 26), x /= 26; reverse(res.begin(), res.end()); return res; } else x -= p; } int rEx(string x) { int res = 0; for (int l = 1, p = 26; l < x.size(); l++, p *= 26) res += p; reverse(x.begin(), x.end()); for (int i = 0, p = 1; i < x.size(); i++, p *= 26) res += p * (x[i] - A ); return res + 1; } int main() { int t; cin >> t; while (t-- > 0) { string s; cin >> s; int valid = 0; for (int i = 0; i < s.size() - 1; i++) if ( 0 <= s[i] && s[i] <= 9 && s[i + 1] == C ) valid = i + 1; if (valid) { int x = toInt(s.substr(1, valid - 1)); int y = toInt(s.substr(valid + 1)); cout << Ex(y) << x << endl; } else for (int i = 0; i < s.size(); i++) if ( 0 <= s[i] && s[i] <= 9 ) { cout << R << s.substr(i) << C << rEx(s.substr(0, i)) << endl; break; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long tt; cin >> tt; while (tt--) { long long n; cin >> n; vector<long long> v(n); for (auto &i : v) cin >> i; bool ans = false; for (size_t i = 0; i < n; i++) { if (v[i] >= v[i - 1]) { ans = true; break; } } cout << ((ans) ? YES : NO ) << n ; } } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; string s; cin >> s; map<char, vector<int> > m; for (int j = 0; j < s.size(); j++) { m[s[j]].push_back(j); } for (int i = 0; i < n; i++) { string p; cin >> p; long long f = 0; for (int j = 0; j < p.size(); j++) { if (m.find(p[j]) == m.end()) { f += p.size(); continue; } vector<int> v = m[p[j]]; if (v[0] >= j) { f += v[0] - j; continue; } if (v[v.size() - 1] <= j) { f += j - v[v.size() - 1]; continue; } if (binary_search(v.begin(), v.end(), j)) { continue; } vector<int>::iterator it1 = lower_bound(v.begin(), v.end(), j); vector<int>::iterator it2 = upper_bound(v.begin(), v.end(), j); it1--; if (it2 == v.end()) it2--; f += min(abs((*it1) - j), abs((*it2) - j)); } cout << f << n ; } } |
#include <bits/stdc++.h> using namespace std; const long long p = 998244353; long long n, ans, a[1000010], c[1000010], cnt[1000010]; long long ksm(long long x, long long y) { long long xlh = 1; while (y) { if (y & 1) xlh = xlh * x % p; x = x * x % p; y /= 2; } return xlh; } int main() { long long i, j, x; scanf( %lld , &n); for (i = 1; i <= n; i++) { scanf( %lld , &a[i]); for (j = 1; j <= a[i]; j++) { scanf( %lld , &x); cnt[x]++; c[x] = (c[x] + ksm(a[i], p - 2) * ksm(n, p - 2) % p) % p; } } for (i = 1; i <= 1000000; i++) if (cnt[i]) { ans = (ans + c[i] * cnt[i] % p * ksm(n, p - 2) % p) % p; } printf( %lld , ans); } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.