malteklaes/cpp-code-code_search_net-style · Datasets at Hugging Face

func_code_string stringlengths 59 71.4k
#include <bits/stdc++.h> using namespace std; const int MAXN = 1000010; unordered_map<int, vector<pair<int, int> > > rows; unordered_map<int, vector<pair<int, int> > > cols; int n, m; int cnum; map<pair<int, int>, int> id; map<pair<int, int>, vector<pair<int, int> > > adj1; unordered_map<int, vector<int> > adj2; int dp[MAXN]; void fgreat(const vector<pair<int, int> >& v, int row, int col) { int sz = v.size(); for (int i = 0; i < (sz - 1); ++i) if (v[i].first < v[i + 1].first) { if (row == -1) { adj2[id[make_pair(v[i + 1].second, col)]].push_back( id[make_pair(v[i].second, col)]); } else { adj2[id[{row, v[i + 1].second}]].push_back( id[make_pair(row, v[i].second)]); } } } void fequal(const vector<pair<int, int> >& v, int row, int col) { int sz = v.size(); for (int i = 0; i < (sz - 1); ++i) if (v[i].first == v[i + 1].first) { if (row == -1) { adj1[{v[i].second, col}].push_back(make_pair(v[i + 1].second, col)); adj1[{v[i + 1].second, col}].push_back(make_pair(v[i].second, col)); } else { adj1[{row, v[i].second}].push_back(make_pair(row, v[i + 1].second)); adj1[{row, v[i + 1].second}].push_back(make_pair(row, v[i].second)); } } } void dfs(int sx, int sy) { id[{sx, sy}] = cnum; const auto& v = adj1[{sx, sy}]; for (__typeof((v).begin()) it = (v).begin(); it != (v).end(); ++it) if (!id.count(it)) { dfs(it->first, it->second); } } int solve(int id) { int& ans = dp[id]; if (ans != -1) return ans; ans = 0; const auto& v = adj2[id]; for (__typeof((v).begin()) it = (v).begin(); it != (v).end(); ++it) ans = max(ans, solve(it)); return ++ans; } int main() { scanf( %d %d , &(n), &(m)); for (int i = 0; i < (n); ++i) for (int j = 0; j < (m); ++j) { int x; scanf( %d , &(x)); rows[i].push_back(make_pair(x, j)); cols[j].push_back(make_pair(x, i)); } for (__typeof((rows).begin()) it = (rows).begin(); it != (rows).end(); ++it) { auto& v = it->second; sort(v.begin(), v.end()); } for (__typeof((cols).begin()) it = (cols).begin(); it != (cols).end(); ++it) { auto& v = it->second; sort(v.begin(), v.end()); } for (__typeof((rows).begin()) it = (rows).begin(); it != (rows).end(); ++it) { fequal(it->second, it->first, -1); } for (__typeof((cols).begin()) it = (cols).begin(); it != (cols).end(); ++it) { fequal(it->second, -1, it->first); } for (int i = 0; i < (n); ++i) for (int j = 0; j < (m); ++j) if (!id.count({i, j})) { dfs(i, j); ++cnum; } for (__typeof((rows).begin()) it = (rows).begin(); it != (rows).end(); ++it) { fgreat(it->second, it->first, -1); } for (__typeof((cols).begin()) it = (cols).begin(); it != (cols).end(); ++it) { fgreat(it->second, -1, it->first); } memset(dp, -1, sizeof(dp)); for (int i = 0; i < (n); ++i) { for (int j = 0; j < (m); ++j) { if (j) printf( ); printf( %d , solve(id[{i, j}])); } printf( n ); } return 0; }
#include <bits/stdc++.h> using namespace std; string c1, c2; int main() { int x; cin >> c1 >> c2; for (int i = 0; i < c1.size(); i++) { if (c1[i] < 92) { c1[i] += 32; } if (c2[i] < 92) { c2[i] += 32; } } if (c1 < c2) { x = -1; } else if (c1 > c2) { x = 1; } else { x = 0; } printf( %d n , x); return 0; }
#include <bits/stdc++.h> const int MAXN = 10010100; const int MAZN = 301010; int ch[MAXN][3]; int n, cnt, cout[MAXN]; int arr[MAZN]; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &arr[i]); } for (int i = 1; i <= n; i++) { int tem, p = 0; scanf( %d , &tem); for (int k = 29; k >= 0; k--) { int tmp = (tem >> k) & 1; if (ch[p][tmp]) p = ch[p][tmp]; else p = ch[p][tmp] = ++cnt; cout[p]++; } } for (int i = 1; i <= n; i++) { int x = arr[i]; int ans = 0, p = 0; for (int j = 29; j >= 0; j--) { int tmp = (x >> j) & 1; if (ch[p][tmp] && cout[ch[p][tmp]]) { p = ch[p][tmp]; } else { p = ch[p][!tmp]; ans += (1 << j); } cout[p]--; } printf( %d , ans); } }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, ans = 0; string s; cin >> n; while (cin >> s) { int cnt = 0; for (int i = 0; i < s.length(); ++i) { if (s[i] >= A && s[i] <= Z ) { ++cnt; } } ans = max(ans, cnt); } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int gi() { char cc = getchar(); int cn = 0, flus = 1; while (cc < 0 \|\| cc > 9 ) { if (cc == - ) flus = -flus; cc = getchar(); } while (cc >= 0 && cc <= 9 ) cn = cn * 10 + cc - 0 , cc = getchar(); return cn * flus; } const int N = 1e5 + 5; int n, m, q, L[N]; struct SegmentBeats { int bef, mx, se, tot, tag; } tr[N << 2]; void cmax(int &x, int y) { x = (x < y) ? y : x; } inline void pushup(int x) { tr[x].tot = tr[x].se = 0, tr[x].mx = max(tr[(x << 1)].mx, tr[(x << 1 \| 1)].mx); if (tr[x].mx == tr[(x << 1)].mx) tr[x].tot += tr[(x << 1)].tot, cmax(tr[x].se, tr[(x << 1)].se); else cmax(tr[x].se, tr[(x << 1)].mx); if (tr[x].mx == tr[(x << 1 \| 1)].mx) tr[x].tot += tr[(x << 1 \| 1)].tot, cmax(tr[x].se, tr[(x << 1 \| 1)].se); else cmax(tr[x].se, tr[(x << 1 \| 1)].mx); tr[x].bef = tr[x].mx; } inline void push(int x, int k) { tr[x].mx = k, tr[x].tag = k; } inline void pushmark(int x) { if (!tr[x].tag) return; if (tr[(x << 1)].mx == tr[x].bef) push((x << 1), tr[x].tag); if (tr[(x << 1 \| 1)].mx == tr[x].bef) push((x << 1 \| 1), tr[x].tag); tr[x].tag = 0, tr[x].bef = tr[x].mx; } int query(int x, int l, int r, int k) { if (l == r) return tr[x].mx; int mid = (l + r) >> 1; pushmark(x); if (k <= mid) return query((x << 1), l, mid, k); else return query((x << 1 \| 1), mid + 1, r, k); } void update(int x, int l, int r, int k, int d) { if (l == r) return tr[x].mx = d, tr[x].se = 0, tr[x].tot = 1, void(); int mid = (l + r) >> 1; pushmark(x); if (k <= mid) update((x << 1), l, mid, k, d); else update((x << 1 \| 1), mid + 1, r, k, d); pushup(x); } void modify(int x, int l, int r, int ql, int qr, int y, int z) { if (tr[x].mx < y \|\| r < ql \|\| qr < l) return; if ((ql <= l && r <= qr) && (tr[x].se < y && tr[x].mx >= y)) return push(x, z); int mid = (l + r) >> 1; pushmark(x); modify((x << 1), l, mid, ql, qr, y, z), modify((x << 1 \| 1), mid + 1, r, ql, qr, y, z), pushup(x); } vector<pair<int, int> > p[N]; int ans[N]; signed main() { n = gi(), m = gi(); int x, y; for (int i = (1); i <= (m); ++i) x = gi(), y = gi(), L[y] = x; q = gi(); for (int i = (1); i <= (q); ++i) x = gi(), y = gi(), p[y].push_back(make_pair(x, i)); for (int i = (1); i <= (n); ++i) { update(1, 1, n, i, i); if (L[i]) modify(1, 1, n, 1, L[i], L[i], i); for (auto u : p[i]) ans[u.second] = query(1, 1, n, u.first); } for (int i = (1); i <= (q); ++i) printf( %d n , ans[i]); return 0; }
#include <bits/stdc++.h> const int N = 3003; const long long mod = 998244353; using namespace std; int n; int c; int a[N]; int p[N]; int res[N]; int d[N][N]; int g[N][N]; int f1[N][1 << 12]; void upd(int &x, int y) { x += y; if (x >= mod) { x -= mod; } else if (x < 0) { x += mod; } } void solve1() { int nj, nk, last = (1 << c) - 1; for (int i = 1; i <= n; i++) { for (int j = (i - 1) / c; j >= 0; j--) { for (int k = last - 1; k >= 0; k--) { nj = j; nk = k \| (1 << a[i]); if (nk == last) { nj += 1; nk = 0; upd(d[i][nj], f1[j][k]); } upd(f1[nj][nk], f1[j][k]); } } if (c == 1) { upd(d[i][1], 1); upd(f1[1][0], 1); } else { upd(f1[0][1 << a[i]], 1); } } } long long pw(long long x, long long n) { long long res = 1; while (n) { if (n & 1) { res = res * x % mod; } x = x * x % mod; n /= 2; } return res; } int t[N]; int inv[N]; void solve2() { for (int i = 1; i < n; i++) { inv[i] = pw(p[i] - 1, mod - 2); } for (int i = 1; i <= n; i++) { for (int j = 0; j < c; j++) { t[j] = 0; } int j = i - 1; int sad = c; while (j < n && sad) { j += 1; t[a[j]] += 1; sad -= t[a[j]] == 1; } if (sad) { break; } long long res = 1; for (int h = 0; h < c; h++) { res = res * (p[t[h]] - 1) % mod; } sad = 1; for (; j <= n; j++) { res = res * inv[t[a[j]]] % mod; g[i][j] = res; if (sad) { sad = 0; } else { t[a[j]] += 1; } res = res * (p[t[a[j]]] - 1) % mod; } } d[0][0] = 1; int k = n / c; d[0][0] = 1; long long sum, MOD = mod, MOD2 = mod * mod; for (int r = 1; r <= k; r++) { d[0][r] = 0; for (int i = r * c - 1; i < n; i++) { sum = 0; for (int j = i; j >= (r - 1) * c; j--) { sum += 1LL * g[j + 1][i + 1] * d[j][r - 1]; if (sum >= MOD2) sum -= MOD2; } d[i + 1][r] = (sum % MOD); } } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> c; for (int i = 1; i <= n; i++) { cin >> a[i]; a[i] -= 1; } p[0] = 1; for (int i = 1; i <= n; i++) { p[i] = p[i - 1]; upd(p[i], p[i]); } if (c <= 10) { solve1(); } else { solve2(); } for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { upd(res[j], 1ll * d[i][j] * p[n - i] % mod); } } res[0] = p[n]; upd(res[0], -1); for (int i = 0; i <= n; i++) { upd(res[i], -res[i + 1]); cout << res[i] << ; } }
#include <bits/stdc++.h> using namespace std; const int maxn = 100 + 10; const long long inf = 0x3f3f3f3f3f3f3f3f; string s; int a[maxn]; int main() { ios::sync_with_stdio(0); cin.tie(0); int t; cin >> t; while (t--) { int flag = 0; int n; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); for (int i = 1; i < n; i++) { if (a[i] - a[i - 1] == 1) { flag = 1; break; } } if (flag) cout << 2 << endl; else cout << 1 << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; const int MOD = 1000000007; void solve() { int n; cin >> n; vector<vector<int>> dp(4, vector<int>(n + 1, 0)); dp[3][0] = 1; for (int i = 1; i < n + 1; i++) for (int j = 0; j < 4; j++) for (int k = 0; k < 4; k++) if (k != j) dp[j][i] = (dp[j][i] + dp[k][i - 1]) % MOD; cout << dp[3][n] << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t = 1; while (t--) { solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; long long l, r, n, k; string Bad; int ask(long long l, long long r) { cout << l << << r << endl; cout.flush(); cin >> Bad; if (Bad[0] == B ) exit(0); if (Bad[0] == Y ) { if (l == r) exit(0); return 1; } return 0; } int main() { srand(2109888); cin >> n >> k; l = 1; r = n; while (l <= r) { long long mid = (l + r) >> 1; if (ask(l, mid)) r = mid; else l = mid + 1; l = max(1ll, l - k); r = min(n, r + k); mid = l + rand() % (r - l + 1); ask(mid, mid); l = max(1ll, l - k); r = min(n, r + k); } return 0; }
#include <bits/stdc++.h> using namespace std; const int nn = 100005; const double eps = 1e-10; struct point { double x, y; } a[nn], b[nn]; int n, m, t, l[nn], r[nn]; int h[nn], p[nn]; double R, c[nn]; inline double cp(const point &x, const point &y, const point &z) { return (x.x - z.x) * (y.y - z.y) - (x.y - z.y) * (y.x - z.x); } inline double dis(const point &x, const point &y) { return sqrt((x.x - y.x) * (x.x - y.x) + (x.y - y.y) * (x.y - y.y)); } inline bool cmp(const point &x, const point &y) { double z = cp(x, y, a[1]); if (z > eps) return 1; if (z < -eps) return 0; return dis(x, a[1]) < dis(y, a[1]); } void init() { scanf( %d%lf , &n, &R); for (int i = 1; i <= n; ++i) { scanf( %lf%lf , &a[i].x, &a[i].y); if (a[i].y < a[1].y \|\| (a[i].y < a[1].y + eps && a[i].x < a[1].x)) swap(a[i], a[1]); } sort(a + 2, a + n + 1, cmp); b[m = 1] = a[1]; for (int i = 2; i <= n; ++i) { for (; m > 1 && cp(a[i], b[m], b[m - 1]) > -eps; --m) ; b[++m] = a[i]; } } inline void change(int x, int y) { swap(p[h[x]], p[h[y]]); swap(h[x], h[y]); } void up(int x) { for (; x > 1 && c[h[x]] > c[h[x >> 1]]; x >>= 1) change(x, x >> 1); } void down(int x) { for (int y = x << 1; y <= t; x = y, y = x << 1) { if (y < t && c[h[y]] < c[h[y + 1]]) ++y; if (c[h[x]] < c[h[y]]) change(x, y); else break; } } inline void calc(int x) { point y = b[l[x]], z = b[r[x]]; c[x] = dis(y, z) * dis(b[x], y) * dis(b[x], z) / (2 * abs(cp(y, z, b[x]))); up(p[x]); } inline double count(int x, int y) { double z = 2 * asin(dis(b[x], b[y]) / (2 * R)); return R * R / 2 * (z - sin(z)); } void work() { for (int i = 1; i <= m; ++i) { h[i] = p[i] = i; l[i] = i - 1, r[i] = i + 1; } t = m; l[1] = m; r[m] = 1; for (int i = 1; i <= m; ++i) calc(i); while (c[h[1]] > R) { int i = h[1]; l[r[i]] = l[i]; r[l[i]] = r[i]; change(1, t--); down(1); calc(l[i]); calc(r[i]); } int j = h[1]; double s = count(j, l[j]) + count(j, r[j]); for (int i = r[j]; r[i] != j; i = r[i]) s += abs(cp(b[i], b[r[i]], b[j])) / 2 + count(i, r[i]); printf( %.10lf n , s); } int main() { init(); work(); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int k; cin >> k; int days[14]; int ones = 0; for (int i = 0; i < 7; i++) { cin >> days[i]; if (days[i]) ones++; days[i + 7] = days[i]; } int ans = 0; int left = 0; if (k % ones == 0) { ans = 7 * (k / ones - 1); left = ones; } else { ans = 7 * (k / ones); left = k % ones; } int c = 0, mini = INT_MAX; for (int i = 0; i < 14; i++) { if (!days[i]) continue; int c = 0, c2 = 0; for (int j = i; j < 14; j++) { if (days[j] == 1) c++; c2++; if (c == left) { mini = min(mini, c2); break; } } } cout << mini + ans << endl; } }
#include <bits/stdc++.h> using namespace std; int n, m, k; int c[10000007]; vector<pair<int, int> > x; int temp; vector<int> vt; int main() { scanf( %d %d %d , &m, &k, &n); for (int i = 0; i < m; i++) { scanf( %d , &temp); c[temp]++; if (c[temp] > n) { printf( -1 n ); return 0; } } for (int i = 0; i < k; i++) { scanf( %d , &temp); x.push_back(make_pair(temp, i)); } sort(x.begin(), x.end()); int cur = 0; int remain = 0; for (int i = 0; i < k; i++) { while (cur <= x[i].first) { remain += n - c[cur]; cur++; } if (remain) { remain--; vt.push_back(x[i].second); } } printf( %d n , vt.size()); for (int i = 0; i < vt.size(); i++) printf( %d , vt[i] + 1); return 0; }
#include <bits/stdc++.h> using namespace std; char a[55][55]; int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0}; int n, T, m; inline int valid(int x, int y) { return x >= 0 && x < n && y >= 0 && y < m; } int cyc[55][55][4][2] = {}; int main(void) { scanf( %d%d , &n, &T); for (int i = 0; i < n; i++) scanf( %s , a[i]); m = strlen(a[0]); int x = 0, y = 0, DP = 0, CP = 0; int Cx = -dy[DP] * (CP ? -1 : 1), Cy = dx[DP] * (CP ? -1 : 1); int Dx = dx[DP], Dy = dy[DP]; for (int step = 1; step <= T; step++) { while (valid(x + Dx, y + Dy) && a[x + Dx][y + Dy] == a[x][y]) x += Dx, y += Dy; while (valid(x + Cx, y + Cy) && a[x + Cx][y + Cy] == a[x][y]) x += Cx, y += Cy; if (cyc[x][y][DP][CP]) { int ii = step - cyc[x][y][DP][CP]; while (step + ii <= T) step += ii; } else cyc[x][y][DP][CP] = step; if (!valid(x + Dx, y + Dy) \|\| a[x + Dx][y + Dy] == 0 ) { if (CP == 0) CP = 1; else if (CP == 1) { DP = (DP + 1) % 4; CP = 0; } Cx = -dy[DP] * (CP ? -1 : 1), Cy = dx[DP] * (CP ? -1 : 1); Dx = dx[DP], Dy = dy[DP]; } else x += Dx, y += Dy; } printf( %c n , a[x][y]); return 0; }
#include <bits/stdc++.h> using namespace std; inline int read() { int f = 1, r = 0; char ch = getchar(); while (!isdigit(ch)) f ^= ch == - , ch = getchar(); while (isdigit(ch)) r = (r << 1) + (r << 3) + (ch ^ 48), ch = getchar(); return f ? r : -r; } const int N = 3005, M = 305; int n, m, cnt[N]; double f[M][N], g[N], d[N], sv[N], siv[N], val[N]; double ans, p[N][M]; inline void upd(int x) { memcpy(g, f[x], sizeof(g)); f[x][0] = 0; for (int i = 1; i <= n; i++) f[x][i] = f[x][i - 1] * (1 - p[i][x]) + g[i - 1] * p[i][x]; cnt[x]++, sv[x] += f[x][n]; siv[x] += f[x][n] * cnt[x]; double E = siv[x] + cnt[x] * (1 - sv[x]); d[x] = E - val[x], val[x] = E; } int main() { n = read(), m = read(); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) p[i][j] = read() / 1000.; for (int i = 1; i <= m; i++) { f[i][0] = 1; for (int j = 1; j <= n; j++) f[i][j] = f[i][j - 1] * (1 - p[j][i]); sv[i] = f[i][n], upd(i); } for (int i = 1; i <= n; i++) { int k = 0; for (int j = 1; j <= m; j++) if (d[k] < d[j]) k = j; if (!k) break; ans += d[k], upd(k); } return printf( %.12lf n , ans), 0; }
#include <bits/stdc++.h> using namespace std; int n, m, a[101], b[101], z[101], x, s, k, i, j; int main() { cin >> n >> m; for (i = 1; i <= n; i++) cin >> a[i]; for (i = 1; i <= m; i++) { cin >> b[i]; s += b[i]; } for (i = 1; i <= n - s + 1; i++) { for (k = i; k <= i + s - 1; k++) z[a[k]]++; for (j = 1; j <= 100; j++) if (z[j] != b[j]) { x = 1; break; } if (x == 0) { cout << YES ; return 0; } x = 0; memset(z, 0, 101 * sizeof(int)); } cout << NO ; return 0; }
#include <bits/stdc++.h> long long cacu(long long l, long long r) { return (r + l) / 2 * ((r - l) / 2 + 1); } int main() { int q, l, r; scanf( %d , &q); while (q--) { long long ans; scanf( %d%d , &l, &r); ans = cacu(l + (l & 1), r - (r & 1)); ans -= cacu(l \| 1, r - !(r & 1)); printf( %lld n , ans); } return 0; }
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1); template <typename T> void chmin(T &x, const T &y) { if (x > y) x = y; } template <typename T> void chmax(T &x, const T &y) { if (x < y) x = y; } template <typename T> T gcd(T x, T y) { return y ? gcd(y, x % y) : x; } const int mod = 998244353; template <typename T> void Mod(T &x) { while (x >= mod) x -= mod; } long long qk(long long x, long long y) { long long r = 1; for (; y; y >>= 1) { if (y & 1) r = (r * x) % mod; x = (x * x) % mod; } return r; } map<int, vector<int>> dps; int cal(int a, int b, int c, int d) { int x = d + b - a; if (x < 0) return 0; int k = d + c; chmin(x, k); if (dps.count(k)) return dps[k][x]; auto &dp = dps[k]; dp.resize(k + 1); int t = 0, w = 1; for (int i = 0; i <= k; ++i) { Mod(t += w); dp[i] = t; w = (long long)w * (k - i) % mod; w = (long long)w * qk(i + 1, mod - 2) % mod; } return dp[x]; } void solve(int times) { string s; cin >> s; int n = s.length(); int a = 0, b = 0, c = 0, d = 0; for (int i = 0; i < n; ++i) { if (s[i] == ) ) ++b; else if (s[i] == ? ) ++d; } long long ans = 0; for (int i = 0; i < n; ++i) { if (s[i] == ( ) { ++a; } else if (s[i] == ? ) { ++c; --d; } else if (s[i] == ) ) { --b; } if (s[i] == ( ) { Mod(ans += cal(a, b, c, d)); } else if (s[i] == ? ) { ++a; --c; Mod(ans += cal(a, b, c, d)); ++c; --a; } } cout << ans << endl; } void Init() {} int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int times = 1; { solve(times++); Init(); } return 0; }
#include <bits/stdc++.h> using namespace std; template <class T> inline T gcd(T a, T b) { if (a < 0) return gcd(-a, b); if (b < 0) return gcd(a, -b); return (b == 0) ? a : gcd(b, a % b); } const double EPS = 1e-10; const double PI = acos(-1.0); const int INF = 1 << 29; const int mod = 1000000007; const int MAX_V = 1000 + 10; const int MAX_M = 10000 + 10; const int maxm = 1 + 5; const int maxn = 50000 + 5; int used[20]; int n; int main() { scanf( %d , &n); int i, j, sum = 0, a; memset(used, 0, sizeof(used)); for (int i = 0; i < n; i++) { scanf( %d , &a); sum += a; used[a]++; } if (used[0] == 0) cout << -1 << endl; else { int flag = 0; if (sum % 3 == 1) { if (used[1] + used[4] + used[7]) { for (int i = 1; i <= 7; i += 3) { if (used[i]) { used[i]--, sum -= i; break; } } } else if (used[2] + used[5] + used[8] >= 2) { for (j = 1, i = 2; i <= 8; i += 3) { while (used[i] && j <= 2) used[i]--, sum -= i, j++; } } } if (sum % 3 == 2) { if (used[2] + used[5] + used[8]) { for (i = 2; i <= 8; i += 3) if (used[i]) { used[i]--, sum -= i; break; } } else if (used[1] + used[4] + used[7] >= 2) { for (j = 1, i = 1; i <= 7; i += 3) while (used[i] && j <= 2) used[i]--, sum -= i, j++; } else flag = 1; } if (!flag) { if (used[1] + used[2] + used[3] + used[4] + used[5] + used[6] + used[7] + used[8] + used[9]) { for (i = 9; i >= 0; i--) while (used[i]--) printf( %d , i); printf( n ); } else printf( 0 n ); } else printf( 0 n ); } return 0; }
#include <bits/stdc++.h> using namespace std; int N; list<int> adj[1000005]; int T[1000005]; bool visited[1000005]; bool uniq[1000005]; int rev[10000005]; void dfs(int v) { visited[v] = true; for (list<int>::iterator it = adj[v].begin(); it != adj[v].end(); it++) { if (!visited[it]) dfs(it); } } int gcd(int a, int b) { if (b == 0) return a; else return gcd(b, a % b); } int main() { scanf( %d , &N); for (int i = 0; i < (N); i++) scanf( %d , &T[i]); sort(T, T + N); T[N] = -1; for (int i = 0; i < (10000001); i++) rev[i] = N; for (int i = 0; i < (N); i++) rev[T[i]] = i; int temp[3]; int v[3]; for (int i = 1; i <= 5000; i += 2) for (int j = 2; i * i + j * j <= T[N - 1]; j += 2) { if (gcd(i, j) > 1) continue; temp[0] = abs(i * i - j * j); temp[1] = i * i + j * j; temp[2] = 2 * i * j; for (int t = 0; t < (3); t++) v[t] = rev[temp[t]]; for (int u = 0; u < (3); u++) for (int s = 0; s < (u); s++) { if ((T[v[u]] == temp[u]) && (T[v[s]] == temp[s])) { adj[v[u]].push_back(v[s]); adj[v[s]].push_back(v[u]); } } } for (int i = 1; i <= T[N - 1]; i += 2) for (int j = 2; i * j <= T[N - 1]; j += 2) { if (gcd(i, j) > 1) continue; long long int L1 = abs(i * (long long int)i - j * (long long int)j); long long int L2 = 2 * i * j; if (L1 > 10000000 \|\| L2 > 10000000) continue; int v1 = rev[L1]; int v2 = rev[L2]; if ((T[v1] == L1) && (T[v2] == L2)) { adj[v1].push_back(v2); adj[v2].push_back(v1); } } for (int i = 0; i < (N); i++) visited[i] = false; int result = 0; for (int i = 0; i < (N); i++) if (!visited[i]) { result++; dfs(i); } printf( %d n , result); }
#include <bits/stdc++.h> using namespace std; int n; void solve() { if (n <= 3) printf( NO n ); else if (n == 4) { printf( YES n ); printf( 2 * 3 = 6 n ); printf( 6 * 4 = 24 n ); printf( 24 * 1 = 24 n ); } else if (n == 5) { printf( YES n ); printf( 1 + 5 = 6 n ); printf( 3 - 2 = 1 n ); printf( 6 * 1 = 6 n ); printf( 6 * 4 = 24 n ); } else if (n >= 6) { printf( YES n ); printf( 3 - 2 = 1 n ); printf( 1 - 1 = 0 n ); printf( 4 * 6 = 24 n ); printf( 5 * 0 = 0 n ); int i = 7; while (i <= n) { printf( %d * 0 = 0 n , i); i++; } printf( 24 + 0 = 24 n ); } else printf( NO n ); } int main() { while (scanf( %d , &n) != EOF) { solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; const long long INF = LONG_LONG_MAX; const long long NINF = LONG_LONG_MIN; const long long mmod = 1000000007; int32_t main() { long long k; cin >> k; while (k-- > 0) { long long n; cin >> n; string s, t; cin >> s >> t; vector<long long> cnt(26, 0); for (long long i = 0; i < n; i++) { cnt[s[i] - a ]++; cnt[t[i] - a ]++; } bool found = true; for (long long i = 0; i < 26; i++) if (cnt[i] & 1) found = false; if (found) { vector<pair<long long, long long>> ans; for (long long i = 0; i < n - 1; i++) { if (s[i] != t[i]) { bool f = false; for (long long j = i + 1; j < n; j++) { if (t[j] == t[i]) { swap(s[i], t[j]); f = true; ans.emplace_back(i + 1, j + 1); break; } } if (!f) { for (long long j = i + 1; j < n; j++) { if (s[j] == t[i]) { swap(s[j], t[j]); swap(s[i], t[j]); ans.emplace_back(j + 1, j + 1); ans.emplace_back(i + 1, j + 1); break; } } } } } cout << YES << endl; cout << (long long)ans.size() << endl; for (pair<long long, long long> x : ans) cout << x.first << << x.second << endl; } else { cout << No << endl; } } }
#include <bits/stdc++.h> using namespace std; long long p, k; vector<int> v; int main() { cin >> p >> k; v.push_back(p % k); long long a0 = -p / k; while (1) { long long a1 = -a0 / k; while (a1 * k + a0 < 0) a1++; while (a1 * k + a0 >= k) a1--; if (a1 < k && a1 >= 0) { v.push_back(a0 + k * a1); v.push_back(a1); break; } v.push_back(a0 + k * a1); a0 = a1; } while (v.back() == 0) v.pop_back(); printf( %d n , v.size()); for (int i = 0; i < v.size(); ++i) printf( %d , v[i]); }
#include <bits/stdc++.h> using namespace std; long long a[200010]; long long vis[200010]; long long cnt[200010]; long long n; long long max_n = 0; void solve(long long pos) { vis[pos]++; long long temp1 = pos; long long temp2 = pos; long long step1 = 0; long long step2 = 0; while (temp1 <= max_n) { temp1 <<= 1; step1++; vis[temp1]++; cnt[temp1] += step1; } while (temp2) { if ((temp2 & 1) && (temp2 != 1)) { temp2 >>= 1; step2++; vis[temp2]++; cnt[temp2] += step2; long long temp3 = temp2; long long step3 = step2; while (temp3 <= max_n) { temp3 <<= 1; step3++; vis[temp3]++; cnt[temp3] += step3; } } else { temp2 >>= 1; step2++; vis[temp2]++; cnt[temp2] += step2; } } } int main() { scanf( %lld , &n); for (long long i = 1; i <= n; i++) { scanf( %lld , &a[i]); max_n = max(a[i], max_n); } memset(vis, 0, sizeof(vis)); memset(cnt, 0, sizeof(cnt)); for (long long i = 1; i <= n; i++) solve(a[i]); long long ans = 1 << 29; for (long long i = 1; i <= 2 * max_n - 1; i++) { if (vis[i] == n) ans = min(ans, cnt[i]); } printf( %lld n , ans); return 0; }
#include <bits/stdc++.h> int read() { int x = 0, y = 1; char ch = getchar(); while (ch > 9 \|\| ch < 0 ) { if (ch == - ) y = -1; ch = getchar(); } while (ch <= 9 && ch >= 0 ) x = (x << 3) + (x << 1) + ch - 0 , ch = getchar(); return x * y; } void print(int x) { if (x < 0) { putchar( 0 ); return; } if (x < 10) { putchar(x + 0 ); return; } print(x / 10); putchar(x % 10 + 0 ); } int n, x, maxx; int main() { n = read(); for (int _ = 0; _ < n; _++) x = read(), maxx = maxx > x ? maxx : x; print(maxx - 25); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10; int x, y, tx, ty, vis[N]; int chk(int x, int y) { for (int i = 0; i < 7; i++) vis[i] = 0; for (int i = 1; i <= tx; i++) ++vis[x % 7], x /= 7; for (int i = 1; i <= ty; i++) ++vis[y % 7], y /= 7; for (int i = 0; i < 7; i++) if (vis[i] > 1) return 0; return 1; } int main() { scanf( %d%d , &x, &y), --x, --y; if ((long long)x * y > 6543210) return puts( 0 ), 0; for (int i = x; i; i /= 7) ++tx; for (int i = y; i; i /= 7) ++ty; tx = max(tx, 1), ty = max(ty, 1); int ans = 0; for (int i = 0; i <= x; i++) for (int j = 0; j <= y; j++) ans += chk(i, j); printf( %d n , ans); }
#include <bits/stdc++.h> using namespace std; const int N = 207; const int M = 1507; const int inf = INT_MAX; int nx[M], to[M], head[N], cap[M], fl[M], who[N][N], vis[N], es = 2; int a[N], b[N]; int n, m, s, t, turn = 1; int dfs(int u, int mini) { vis[u] = turn; if (u == t) return mini; for (int e = head[u]; e; e = nx[e]) { int v = to[e]; if (vis[v] != turn && cap[e] - fl[e]) { int k = dfs(v, min(mini, cap[e] - fl[e])); if (k != inf) { fl[e] += k; fl[e ^ 1] -= k; return k; } } } return inf; } int maxflow() { int mf = 0, k; while ((k = dfs(s, inf)) != inf) { turn++; mf += k; } return mf; } int addedge(int u, int v, int _cap) { who[u][v] = es; to[es] = v; nx[es] = head[u]; head[u] = es; cap[es] = _cap; fl[es++] = 0; to[es] = u; nx[es] = head[v]; head[v] = es; cap[es] = 0; fl[es++] = 0; } int main() { scanf( %d %d , &n, &m); for (int i = 0; i < n; i++) scanf( %d , a + i); for (int i = 0; i < n; i++) scanf( %d , b + i); for (int i = 0; i < m; i++) { int u, v; scanf( %d %d , &u, &v); u--; v--; addedge(u, v + n, inf); addedge(v, u + n, inf); } s = 2 * n; t = 2 * n + 1; int sa = 0, sb = 0; for (int i = 0; i < n; i++) { sa += a[i]; sb += b[i]; addedge(i, i + n, inf); addedge(s, i, a[i]); addedge(i + n, t, b[i]); } int res = maxflow(); if (res == sa && res == sb) { printf( YES n ); for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) printf( %d%c , fl[who[i][j + n]], n [j == n - 1]); } else puts( NO ); }
#include <bits/stdc++.h> int main() { int n, t, pos = 0; std::cin >> n >> t; std::vector<std::pair<int, int> > vec; for (int i = 0; i < n; i++) { int x, y; std::cin >> x >> y; vec.push_back(std::make_pair(x, y)); } std::sort(vec.begin(), vec.end()); for (int i = 0; i < n - 1; i++) { int temp = 2 * vec[i + 1].first - 2 * vec[i].first - vec[i + 1].second - vec[i].second; if (temp >= 2 * t) { pos++; } if (temp > 2 * t) { pos++; } } std::cout << pos + 2; return 0; }
#include <bits/stdc++.h> using namespace std; const unsigned long long MOD = 1e8 + 7; const unsigned long long base = 71; const unsigned long long max_n = 2e5 + 400; unsigned long long n, m, k, q; string s; unsigned long long pw[2 * max_n + 200]; unsigned long long save[20][2 * max_n + 200]; unsigned long long seg[10 * max_n], lazy[10 * max_n]; void init(unsigned long long v, unsigned long long b, unsigned long long e) { lazy[v] = -1; if (b == e) { seg[v] = s[b]; return; } unsigned long long mid = (b + e) / 2; init(v << 1, b, mid); init(v << 1 ^ 1, mid + 1, e); seg[v] = (seg[v << 1] * pw[e - mid] + seg[v << 1 ^ 1]) % MOD; } void shift(unsigned long long v, unsigned long long b, unsigned long long e, unsigned long long mid) { if (lazy[v] == -1) return; lazy[v << 1] = lazy[v << 1 ^ 1] = lazy[v]; seg[v << 1] = save[lazy[v]][mid - b]; seg[v << 1 ^ 1] = save[lazy[v]][e - mid - 1]; lazy[v] = -1; } void update(unsigned long long v, unsigned long long b, unsigned long long e, unsigned long long l, unsigned long long r, unsigned long long val) { if (b > r \|\| l > e) return; if (l <= b && e <= r) { seg[v] = save[val][e - b]; lazy[v] = val; return; } unsigned long long mid = (b + e) / 2; shift(v, b, e, mid); update(v << 1, b, mid, l, r, val); update(v << 1 ^ 1, mid + 1, e, l, r, val); seg[v] = (seg[v << 1] * pw[e - mid] + seg[v << 1 ^ 1]) % MOD; } unsigned long long get(unsigned long long v, unsigned long long b, unsigned long long e, unsigned long long l, unsigned long long r) { if (b > r \|\| l > e) return 0; if (l <= b && e <= r) return seg[v]; unsigned long long mid = (b + e) / 2; shift(v, b, e, mid); unsigned long long first = get(v << 1, b, mid, l, r); unsigned long long second = get(v << 1 ^ 1, mid + 1, e, l, r); first = (first * pw[max(0, int(min(r, e) - mid))] + second) % MOD; return first; } int main() { ios_base::sync_with_stdio(false), cin.tie(0); cin >> n >> m >> k; q = m + k; cin >> s; pw[0] = 1; for (unsigned long long i = 1; i < max_n; i++) pw[i] = (pw[i - 1] * base) % MOD; for (unsigned long long i = 0; i < 10; i++) { save[i][0] = i + 48; for (unsigned long long j = 1; j < max_n; j++) save[i][j] = (save[i][j - 1] * base + (i + 48)) % MOD; } init(1, 0, n - 1); while (q--) { unsigned long long type, l, r; cin >> type >> l >> r; l--, r--; if (type == 1) { unsigned long long c; cin >> c; update(1, 0, n - 1, l, r, c); continue; } bool fl = 0; unsigned long long d; cin >> d; if (d == r - l + 1) fl = 1; if (!fl) fl = get(1, 0, n - 1, l, r - d) == get(1, 0, n - 1, l + d, r); if (fl) cout << YES n ; else cout << NO n ; } return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 2E5 + 77; void putint(int x) { static bool first = true; if (first) { printf( %d , x); first = false; } else printf( %d , x); } struct QUERY { int t, r; } Q[maxn]; int cnt = 0; int N, M, A[maxn], B[maxn], pb = 0; int main() { scanf( %d%d , &N, &M); for (int i = 0; i < N; ++i) scanf( %d , A + i); for (int i = 0; i < M; ++i) { int t, r; scanf( %d%d , &t, &r); while (cnt && r >= Q[cnt - 1].r) --cnt; if (!cnt \|\| t != Q[cnt - 1].t) Q[cnt++] = (QUERY){t, r}; } Q[cnt] = (QUERY){0, 0}; sort(A, A + Q[0].r); int ptr[2] = {0, Q[0].r - 1}, d = Q[0].t == 1; for (int i = 0; i < cnt; ++i) { for (int j = Q[i].r; j > Q[i + 1].r; --j) { B[pb++] = A[ptr[d]]; ptr[d] += d ? -1 : 1; } d ^= 1; } for (int i = Q[0].r - 1; i >= 0; --i) putint(B[i]); for (int i = Q[0].r; i < N; ++i) putint(A[i]); printf( n ); }
#include <bits/stdc++.h> #pragma comment(linker, /STACK:136777216 ) using namespace std; int bits(int x) { return x == 0 ? 0 : 1 + bits(x & (x - 1)); } const double PI = acos(-1.0); const double eps = 1e-9; const int INF = 1000000000; string nextString() { char buf[1000000]; scanf( %s , buf); return buf; } int dx[] = {0, 1, 0, -1}; int dy[] = {1, 0, -1, 0}; int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); } string month[] = { January , February , March , April , May , June , July , August , September , October , November , December }; int main() { string s = nextString(); int start; for (int(i) = 0; (i) < (12); (i)++) if (s == month[i]) start = i; int n; scanf( %d , &n); int end = (n + start) % 12; printf( %s n , month[end].c_str()); return 0; }
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; const int mod = (int)1e9 + 7; const long long INF = 1000000000000000000LL; const int WASTE = (int)2e5; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); int t; cin >> t; while (t--) { int x, y, p, q; cin >> x >> y >> p >> q; if (!p) { cout << (x == 0 ? 0 : -1) << n ; continue; } if (p == q) { if (x == y) cout << 0 << n ; else cout << -1 << n ; continue; } int i = (x + p - 1) / p; int i1 = (y - x - p + q - 1) / (q - p); cout << (q * 1LL * max(i, i1) - y) << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int T; cin >> T; for (int i = 0; i < T; i++) { long long int n, x; cin >> n >> x; cout << 2 * x << endl; } }
#include <bits/stdc++.h> using namespace std; const int N = 1e3; int n, x[N], d[N], i, j; int main() { cin >> n; for (i = 0; i < n; i++) cin >> x[i] >> d[i]; for (i = 0; i < n; i++) for (j = i + 1; j < n; j++) if (x[i] + d[i] == x[j] && x[j] + d[j] == x[i]) return cout << YES , 0; cout << NO ; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 205; int n; char s[N]; bool ck(int l, int r) { int a = 0, b = 0, c = 0, d = 0; for (int i = l; i <= r; i++) { if (s[i] == U ) a++; else if (s[i] == D ) b++; else if (s[i] == L ) c++; else d++; } if (a == b && c == d) return 1; else return 0; } int main() { scanf( %d , &n); scanf( %s , s); int ans = 0; for (int i = 0; i < n; i++) for (int j = i; j < n; j++) ans += ck(i, j); cout << ans << endl; return 0; }
#include <bits/stdc++.h> int main() { int n, i; scanf( %d , &n); char s[100]; int a[n], b[n], c[n]; scanf( %s , s); for (i = 0; i < n; i++) { int h = (int)s[i]; a[i] = h - 48; } for (i = 0; i < n; i++) { b[n - i - 1] = a[i]; c[n - i - 1] = a[i]; } i = n - 1; int c1 = 1; while (c1 == 1) { if (b[i] == 1) { c[i] = 0; c1 = 1; i--; } else if (b[i] == 0) { c[i] = 1; c1 = 0; i--; } if (i < 0) break; } int count = 0; for (i = 0; i < n; i++) { if (b[i] != c[i]) count++; } printf( %d n , count); }
#include <bits/stdc++.h> using namespace std; int main() { string x; cin >> x; string ans, in, dec, exp; int flag = 0; for (int i = 0; i < x.length(); i++) { if (x[i] == . ) flag = 1; else if (x[i] == e ) flag = 2; else if (flag == 0) in += x[i]; else if (flag == 1) dec += x[i]; else if (flag == 2) exp += x[i]; } int e = stoi(exp); ans += in; if (e <= dec.length()) { ans += dec.substr(0, e); if (e < dec.length()) { ans += . ; ans += dec.substr(e, dec.length()); } } else { ans += dec; ans += string(e - dec.length(), 0 ); } flag = 0; if (dec.length() < 2 && stoi(dec) == 0 && e == 0) ans = in; cout << ans << endl; }
#include <bits/stdc++.h> using namespace std; const int limN = 2e5 + 5; char s[limN]; char arr[2000]; int bu[400]; int main() { int t; scanf( %d , &t); for (int i = 0; i < t; i++) { scanf( %s , s); for (int j = 0; j < 2000; j++) arr[j] = . ; for (int j = 0; j < 400; j++) bu[j] = 0; int n = strlen(s); int ini = 500; int fin = 500; bool f = true; arr[ini] = s[0]; bu[s[0]]++; int pos = ini; for (int j = 1; j < n; j++) { if (j == 1) { fin++; arr[fin] = s[j]; bu[s[j]]++; pos = fin; continue; } if (arr[pos - 1] == s[j]) { pos--; continue; } if (arr[pos + 1] == s[j]) { pos++; continue; } if (bu[s[j]] > 0) { f = false; break; } else { if (pos == ini) { ini--; arr[ini] = s[j]; bu[s[j]]++; pos--; } else if (pos == fin) { fin++; arr[fin] = s[j]; bu[s[j]]++; pos++; } else { f = false; break; } } } if (!f) { printf( NO n ); } else { printf( YES n ); for (int j = ini; j <= fin; j++) { printf( %c , arr[j]); } for (int j = a ; j <= z ; j++) { if (bu[j] == 0) { printf( %c , j); } } printf( n ); } } return 0; }
#include <bits/stdc++.h> using namespace std; const int Maxv = 110; int n, m; int val[Maxv][Maxv * Maxv]; int org[Maxv][Maxv]; int dp[Maxv][Maxv * Maxv]; int Len[Maxv]; int main() { int i, j, k; cin >> n >> m; for (i = 1; i <= n; i++) { scanf( %d , &Len[i]); for (j = 1; j <= Len[i]; j++) scanf( %d , &org[i][j]); int sum1 = 0; for (j = 0; j <= Len[i]; j++) { int sum2 = 0; sum1 += org[i][j]; for (k = Len[i] + 1; k > j; k--) { sum2 += org[i][k]; int tcost = j + Len[i] + 1 - k; val[i][tcost] = max(sum1 + sum2, val[i][tcost]); } } for (k = m; k >= 1; k--) { for (j = 0; j <= Len[i] && j <= k; j++) { dp[i][k] = max(dp[i][k], dp[i - 1][k - j] + val[i][j]); } } } printf( %d n , dp[n][m]); return 0; }
#include <bits/stdc++.h> using namespace std; long long int n, x, a[100005], ct[100005]; int main() { cin >> n >> x; for (long long int i = 1; i <= n; ++i) cin >> a[i], ct[a[i]]++; sort(a + 1, a + n + 1); long long int ans = 0; for (long long int i = 1; i <= n; ++i) { long long int ch = x ^ a[i]; if (ch == a[i]) { ans += (ct[ch] - 1); } else if (ch <= 100000) ans += ct[ch]; } cout << ans / 2; }
#include <bits/stdc++.h> using namespace std; using namespace std; int main() { long long a, b; cin >> a >> b; if (a < b) puts( -1 ); else printf( %.12f n , (a + b) / (2. * ((a + b) / (2 * b)))); return 0; }
#include <bits/stdc++.h> using namespace std; const int Mod = (int)1e9 + 7; const int MX = 1073741822; const long long MXLL = 4e18; const int Sz = 1110111; inline void Read_rap() { ios_base ::sync_with_stdio(0); cin.tie(0); cout.tie(0); } inline void randomizer3000() { unsigned int seed; asm( rdtsc : =A (seed)); srand(seed); } void files(string problem) { if (fopen((problem + .in ).c_str(), r )) { freopen((problem + .in ).c_str(), r , stdin); freopen((problem + .out ).c_str(), w , stdout); } } void localInput(const char in[] = s ) { if (fopen(in, r )) { freopen(in, r , stdin); } else cerr << Warning: Input file not found << endl; } int n; const int N = 302; int pref[N][N]; int dp[N][N]; int a[N]; int plen[N], len[N]; int main() { Read_rap(); cin >> n; for (int i = 1; i <= n; i++) { static string s; cin >> s; static map<string, int> id; if (!id.count(s)) id[s] = (int)(id.size()); a[i] = id[s]; len[i] = (int)(s.size()); } for (int i = n; i >= 1; i--) for (int j = n; j >= 1; j--) if (a[i] == a[j]) pref[i][j] = pref[i + 1][j + 1] + 1; for (int i = 1; i <= n; i++) plen[i] = plen[i - 1] + len[i]; for (int i = 1; i <= n; i++) { for (int j = 1; j <= i; j++) { int len = i - j + 1; for (int p = len; p < j; p++) { int q = p - len + 1; if (pref[j][q] >= len) dp[i][j] = max(dp[i][j], dp[p][q] + 1); } } } int ans = 0; for (int i = 1; i <= n; i++) { for (int j = 1; j <= i; j++) { int len = i - j + 1; if (dp[i][j]) { int cost = len - 1 + plen[i] - plen[j - 1] - len; ans = max(ans, cost * (dp[i][j] + 1)); } } } int sum = accumulate(len + 1, len + n + 1, 0) + n - 1; cout << sum - ans; return 0; }
#include <bits/stdc++.h> using namespace std; long long n; long long ask(long long a, long long b, long long c, long long d) { long long res; cout << ? << a << << b << << c << << d << endl; cout.flush(); cin >> res; return res; } int main() { ios_base::sync_with_stdio(false); cin >> n; long long x1 = -1; long long x2 = -1; long long y1 = -1; long long y2 = -1; for (int i = 1; i < n; i++) { if (ask(i, 1, i, n) % 2 == 1) { if (x1 == -1) x1 = i; else { x2 = i; break; } } } if (x1 == -1) { for (int i = 1; i < n; i++) { if (ask(1, i, n, i) % 2 == 1) { if (y1 == -1) y1 = i; else { y2 = i; break; } } } if (y2 == -1) y2 = n; long long low = 1; long long high = n; x1 = n; while (low <= high) { long long mid = (low + high) / 2; if (ask(low, y1, mid, y1) % 2 == 1) { high = mid - 1; x1 = min(x1, mid); } else { low = mid + 1; } } x2 = x1; } else { if (x2 == -1) x2 = n; long long low = 1; long long high = n; y1 = n; while (low <= high) { long long mid = (low + high) / 2; if (ask(x1, low, x1, mid) % 2 == 1) { y1 = min(y1, mid); high = mid - 1; } else { low = mid + 1; } } low = 1; high = n; y2 = n; while (low <= high) { long long mid = (low + high) / 2; if (ask(x2, low, x2, mid) % 2 == 1) { y2 = min(y2, mid); high = mid - 1; } else { low = mid + 1; } } } cout << ! << x1 << << y1 << << x2 << << y2 << endl; cout.flush(); return 0; }
#include <bits/stdc++.h> using namespace std; int x[111111]; int y[111111]; int main() { int i, n, m, t; long long xx = 0, yy = 0; scanf( %d , &n); for (i = 1; i <= n; i++) { scanf( %d , &t); x[t] = i; y[t] = n - i + 1; } scanf( %d , &m); for (i = 1; i <= m; i++) { scanf( %d , &t); xx += x[t]; yy += y[t]; } cout << xx << << yy << endl; return 0; }
#include <bits/stdc++.h> using namespace std; template <typename T> inline T abs(T t) { return t < 0 ? -t : t; } const unsigned long long modn = 1000000007; inline unsigned long long mod(unsigned long long x) { return x % modn; } const int MAX = 100009; int deg[MAX], ok[MAX]; vector<int> adj[MAX]; void dfs(int u, int p) { if (deg[u] > 3) return; ok[u]++; if (deg[u] == 3) return; for (int v : adj[u]) if (v != p) dfs(v, u); } int main() { int i, n, a, b; scanf( %d , &n); for (i = 0; i < n - 1; i++) { scanf( %d %d , &a, &b); adj[--a].push_back(--b); adj[b].push_back(a); deg[a]++; deg[b]++; } for (i = 0; i < n; i++) if (deg[i] == 1) dfs(i, -1); for (i = 0; i < n; i++) if (deg[i] == 3 && ok[i] <= 1) ok[i] = 0; for (i = 0; i < n; i++) { if (ok[i]) continue; int ct = 0; for (int v : adj[i]) if (!ok[v]) ct++; if (ct > 2) break; } if (i < n) puts( No ); else puts( Yes ); }
#include <bits/stdc++.h> using namespace std; const int maxn = 3e5 + 5; int n; pair<long long, long long> a[maxn + 1]; pair<long long, long long> b; priority_queue<long long, vector<long long>, greater<long long> > q; bool cmp(pair<long long, long long> a, pair<long long, long long> b) { return a > b; } int main() { int ans; scanf( %d n , &n); for (int i = 1; i <= n; i++) { scanf( %lld%lld , &a[i - 1].first, &a[i - 1].second); } b = a[0]; sort(a + 1, a + n, cmp); int i = 1; for (; i <= n && a[i].first > b.first; i++) q.push(a[i].second - a[i].first + 1); ans = i; int lans = 0; while (!q.empty()) { long long k = q.top(); q.pop(); if (k > b.first) break; b.first -= k; lans++; for (; i <= n && a[i].first > b.first; i++) q.push(a[i].second - a[i].first + 1); ans = min(ans, i - lans); } printf( %d n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; int acc[1002], s[1002]; int main() { int n, t; cin >> n; for (int i = 0; i < n; i++) { cin >> t; s[t]++; } for (int i = 1; i < 1002; i++) { acc[i] = acc[i - 1] + s[i]; } int d; cin >> d; int total = 0; for (int i = d + 1; i < 1002; i++) { if (acc[i] - acc[i - d - 1] > total) total = acc[i] - acc[i - d - 1]; } cout << total << endl; return 0; }
#include <bits/stdc++.h> int main() { std::map<long, long> map; long q, id, leftMAX = 0, rightMAX = 0, firstTime = 0; char c; std::cin >> q; while (q--) { std::cin >> c >> id; if (!firstTime--) { map.insert(std::pair<long, long>(id, 0)); } else { if (c == ? ) std::cout << std::min(map[id] - leftMAX, rightMAX - map[id]) << std::endl; else if (c == R ) map.insert(std::pair<long, long>(id, ++rightMAX)); else map.insert(std::pair<long, long>(id, --leftMAX)); } } }
#include <bits/stdc++.h> using namespace std; #pragma warning(disable : 4996) vector<int> up, down; int main() { int T, n; char ch; scanf( %d , &T); while (T--) { scanf( %d , &n); up.clear(); down.clear(); for (int i = 1; i < n; i += 2) { printf( ? %d %d n , i, i + 1); fflush(stdout); cin >> ch; if (ch == < ) down.push_back(i), up.push_back(i + 1); else down.push_back(i + 1), up.push_back(i); } if (n & 1) down.push_back(n), up.push_back(n); int Min = down[0], Max = up[0]; for (int i = 1; i < down.size(); i++) { printf( ? %d %d n , Min, down[i]); fflush(stdout); cin >> ch; if (ch == > ) Min = down[i]; } for (int i = 1; i < up.size(); i++) { printf( ? %d %d n , Max, up[i]); fflush(stdout); cin >> ch; if (ch == < ) Max = up[i]; } printf( ! %d %d n , Min, Max); fflush(stdout); } }
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } long long lcm(long a, long b) { return ((a * b) / gcd(a, b)); } long long a[100000]; int main() { long long i, j, k, l, m, n, maxx = 0, g = 0; cin >> n; for (i = 0; i < n; i++) { cin >> a[i]; } sort(a, a + n); for (i = 0; i < n; i++) { while (a[i] % 2 == 0) { a[i] /= 2; } while (a[i] % 3 == 0) { a[i] /= 3; } } sort(a, a + n); if (a[0] == a[n - 1]) cout << Yes << endl; else cout << NO << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); long long a, b, c; cin >> a >> b >> c; if (a > b) swap(a, b); cout << a + min(c, a + b) + min(b, a + c); return 0; }
#include <bits/stdc++.h> using namespace std; void read(long long &x) { scanf( %lld , &x); } void read(long long &x, long long &y) { scanf( %lld%lld , &x, &y); } void read(long long &x, long long &y, long long &z) { scanf( %lld%lld%lld , &x, &y, &z); } void print(long long x) { printf( %lld , x); } void println(long long x) { printf( %lld n , x); } const long long N = 300100; long long q, n, a[N], ans, b[N], sz; int main() { cin >> q; for (; q--;) { read(n); for (long long i = 1; i <= n; i++) read(a[i]); sort(a + 1, a + n + 1); sz = 0; for (long long i = 1; i <= n; i++) if (i == 1 \|\| a[i] != a[i - 1]) b[++sz] = a[i]; reverse(b + 1, b + sz + 1); for (long long i = 1; i <= sz; i++) a[i] = b[i]; n = sz; ans = a[1]; for (long long i = 1; i <= min(59LL, n); i++) for (long long j = i + 1; j <= (i + 59LL, n); j++) if (a[i] % a[j] != 0) ans = max(ans, a[i] + a[j]), j = n; for (long long i = 1; i <= min(59LL, n); i++) { if (i + 2 <= n && a[i] + a[i + 1] + a[i + 2] <= ans) break; for (long long j = i + 1; j <= (i + 59LL, n); j++) if (a[i] % a[j] != 0) { if (j < n && a[i] + a[j] + a[j + 1] <= ans) break; for (long long k = j + 1; k <= min(j + 59LL, n); k++) if (a[i] % a[k] != 0 && a[j] % a[k] != 0) ans = max(ans, a[i] + a[j] + a[k]), k = n; } } println(ans); } }
#include <bits/stdc++.h> using namespace std; template <typename A> ostream &operator<<(ostream &cout, vector<A> const &v); template <typename A, typename B> ostream &operator<<(ostream &cout, pair<A, B> const &p) { return cout << ( << p.first << , << p.second << ) ; } template <typename A> ostream &operator<<(ostream &cout, vector<A> const &v) { cout << [ ; for (int i = 0; i < v.size(); i++) { if (i) cout << , ; cout << v[i]; } return cout << ] ; } template <typename A, typename B> istream &operator>>(istream &cin, pair<A, B> &p) { cin >> p.first; return cin >> p.second; } mt19937_64 rng(std::chrono::steady_clock::now().time_since_epoch().count()); void usaco(string filename) { freopen((filename + .in ).c_str(), r , stdin); freopen((filename + .out ).c_str(), w , stdout); } const long double pi = 3.14159265358979323846; long long n, m, q, k, l, r, x, y, z; const long long template_array_size = 1e6 + 16318; long long a[template_array_size]; long long b[template_array_size]; long long c[template_array_size]; string second, t; long long ans = 0; string op[5005]; string val[5005]; pair<long long, long long> dep[5005]; map<string, long long> rev; long long dp[5005]; long long check(long long x, long long p, long long t) { if (x == -1) return t; if (dp[x] != -1) return dp[x]; if (op[x] == = ) return dp[x] = val[x][p] - 0 ; else if (op[x] == OR ) return dp[x] = check(dep[x].first, p, t) \| check(dep[x].second, p, t); else if (op[x] == AND ) return dp[x] = check(dep[x].first, p, t) & check(dep[x].second, p, t); else return dp[x] = check(dep[x].first, p, t) ^ check(dep[x].second, p, t); } void solve(int tc = 0) { cin >> n >> m; string v; getline(cin, v); rev[ ? ] = -1; for (long long i = 0; i < n; i++) { vector<string> x; getline(cin, v); istringstream is(v); while (is >> v) { x.push_back(v); } rev[x[0]] = i; if (x.size() == 3) { op[i] = = ; val[i] = x[2]; } else { op[i] = x[3]; dep[i] = {rev[x[2]], rev[x[4]]}; } } string rmin = , rmax = ; for (long long i = 0; i < m; i++) { long long c0 = 0, c1 = 0; memset(dp, -1, sizeof(dp)); for (long long j = 0; j < n; j++) { c0 += check(j, i, 0); } memset(dp, -1, sizeof(dp)); for (long long j = 0; j < n; j++) { c1 += check(j, i, 1); } if (c0 == c1) { rmin += 0 ; rmax += 0 ; } else if (c0 < c1) { rmin += 0 ; rmax += 1 ; } else { rmin += 1 ; rmax += 0 ; } } cout << rmin << n << rmax << n ; } int main() { { ios_base::sync_with_stdio(false); } { cin.tie(NULL); } cout << setprecision(15) << fixed; int tc = 1; for (int t = 0; t < tc; t++) solve(t); }
#include <bits/stdc++.h> using namespace std; int main() { int i, pos, n, cnt, sz, dummy; vector<int> ans; long long k, tot = 0, examine[100005], temp; scanf( %d %I64d , &n, &k); for (i = 0; i < n; ++i) { scanf( %I64d , &examine[i]); tot += examine[i]; } if (tot < k) printf( -1 n ); else if (tot == k) printf( n ); else { dummy = n; while (k > (long long)n) { temp = k / (long long)n; k = k % (long long)n; cnt = 0; for (i = 0; i < dummy; ++i) { if (examine[i] != 0) { if ((long long)examine[i] <= temp) { k += (long long)(temp - (long long)examine[i]); examine[i] = 0; ++cnt; } else examine[i] -= temp; } } n -= cnt; } pos = 0; if (k != 0) { while (k != 0) { if (examine[pos] > 0) { --examine[pos]; --k; } ++pos; } } for (i = pos; i < dummy; ++i) if (examine[i] > 0) ans.push_back(i + 1); for (i = 0; i < pos; ++i) if (examine[i] > 0) ans.push_back(i + 1); sz = ans.size(); for (i = 0; i < (sz - 1); ++i) printf( %d , ans[i]); printf( %d n , ans[sz - 1]); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); int n; cin >> n; string s; cin >> s; long long l = s.length(); bool visit[256]; memset(visit, false, sizeof(visit)); int dis = 0, i; for (i = 0; i < l; i++) { if (!visit[s[i]]) { visit[s[i]] = true; dis++; } } if (dis == 1) { cout << ((l * (l + 1)) / 2) % 998244353; return 0; } int s_cnt = 1, e_cnt = 1; i = 1; int j = l - 2; for (; i < l; i++) { if (s[i] == s[0]) s_cnt++; else break; } for (; j >= 0; j--) { if (s[j] == s[n - 1]) e_cnt++; else break; } if (s[0] != s[l - 1]) { cout << (e_cnt + s_cnt + 1) % 998244353; } else { cout << (long long)((long long)(s_cnt + 1) % 998244353 * (long long)(e_cnt + 1) % 998244353) % 998244353; } return 0; }
#include <bits/stdc++.h> using namespace std; long long n, a[1000009], m, ans, mx, b[1000009]; int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> b[i]; if (n % 2 == 0) { if (i <= n / 2) a[b[i] + (n / 2 - i)]++; else a[b[i] + (i - (n / 2) - 1)]++; } else { if (i <= n / 2 + 1) a[b[i] + (n / 2 + 1 - i)]++; else a[b[i] + (i - (n / 2 + 1))]++; } } for (int i = 1; i < 1000009; i++) { if (n % 2 == 0 && i - n / 2 >= 0) mx = max(mx, a[i]); else if (n % 2 == 1 && i - (n / 2 + 1) >= 0) mx = max(mx, a[i]); } cout << n - mx; return 0; }
#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; const int Nmax = 100005; int count_one(vector<int> s) { int ct = 0; int i = 0; while (i < s.size()) { if (s[i] == 1) ++ct; ++i; } return ct; } int count_zero(string s, int index) { int i = 0; int ct = 0; while (s[i] != 1 && i < s.length()) { ++ct; ++i; } } int gcd(int a, int b) { if (a == 0) { return b; } return gcd(b % a, a); } bool isPrime(int n) { for (int i = 2; i <= sqrt(n); i++) if (n % i == 0) return 0; return 1; } void binaryRepresentation(int x) { for (int i = 31; i >= 0; i--) { if (x & (1 << i)) cout << 1 ; else cout << 0 ; } } void DFS(vector<vector<int> > &adj, int u, vector<bool> &visit, vector<int> &dist, vector<int> &freq) { visit[u] = true; for (int i = 0; i < adj[u].size(); i++) { int x = adj[u][i]; if (!visit[x]) { dist[x] = dist[u] + 1; freq[u]++; DFS(adj, adj[u][i], visit, dist, freq); } } } bool check(string a, string b) { vector<int> first(26, 0); vector<int> second(26, 0); for (int i = 0; i < a.length(); i++) { first[a[i] - a ]++; second[b[i] - a ]++; } if (first != second) return false; else return true; } long long combination(long long n, long long r) { if (r == n \|\| r == 0) { return 1; } return combination(n - 1, r - 1) + combination(n - 1, r); } bool cmp(const pair<int, int> &a, const pair<int, int> &b) { if (a.second == b.second) return a.first < b.first; return a.second > b.second; } int main() { ios_base::sync_with_stdio(false); long long n, k; cin >> n >> k; vector<int> ar(n); map<long long, long long> right; map<long long, long long> left; for (long long i = 0; i < n; i++) { cin >> ar[i]; } long long ans = 0; for (long long i = n - 1; i >= 0; i--) { ans += right[ar[i] * k]; right[ar[i]] += left[ar[i] * k]; left[ar[i]]++; } cout << ans << n ; return 0; }
#include <bits/stdc++.h> using namespace std; const unsigned long long base = 133; unsigned long long hash1[200005][26], hash2[200005][26], Pow[200005]; int n, m; char str1[200005], str2[200005]; int main() { scanf( %d%d , &n, &m); scanf( %s%s , str1 + 1, str2 + 1); Pow[0] = 1; for (int i = 1; i <= n; i++) { Pow[i] = Pow[i - 1] * base; } for (int i = 0; i < 26; i++) { for (int j = 1; j <= n; j++) { hash1[j][i] = hash1[j - 1][i] * base + (str1[j] - a == i); } } for (int i = 0; i < 26; i++) { for (int j = 1; j <= m; j++) { hash2[j][i] = hash2[j - 1][i] * base + (str2[j] - a == i); } } vector<int> vec; for (int i = 1; i <= n - m + 1; i++) { int cnt = 0; for (int x = 0; x < 26; x++) { if (cnt != x) break; for (int y = 0; y < 26; y++) { if (hash2[m][x] == hash1[i + m - 1][y] - hash1[i - 1][y] * Pow[m]) { if (hash2[m][y] == hash1[i + m - 1][x] - hash1[i - 1][x] * Pow[m]) { cnt++; break; } } } } if (cnt == 26) vec.push_back(i); } int sz = vec.size(); printf( %d n , sz); for (int i = 0; i < sz; i++) { printf( %d , vec[i]); } return 0; }
#include <bits/stdc++.h> using namespace std; long long n, m, i, j, y, s, ans; char a[2222][2222]; int l[2222][2222], r[2222][2222], u[2222][2222], d[2222][2222]; pair<pair<int, int>, int> st[2444444]; bool f[2222][2222]; int main() { ios_base::sync_with_stdio(0); cin >> n >> m; for (i = 1; i <= n; i++) for (j = 1; j <= m; j++) cin >> a[i][j]; for (i = 1; i <= n; i++) for (j = 1; j <= m; j++) if (a[i][j] == * ) l[i][j] = l[i][j - 1] + 1; else l[i][j] = 0; for (i = 1; i <= n; i++) for (j = m; j >= 1; j--) if (a[i][j] == * ) r[i][j] = r[i][j + 1] + 1; else r[i][j] = 0; for (j = 1; j <= m; j++) for (i = 1; i <= n; i++) if (a[i][j] == * ) u[i][j] = u[i - 1][j] + 1; else u[i][j] = 0; for (j = m; j >= 1; j--) for (i = n; i >= 1; i--) if (a[i][j] == * ) d[i][j] = d[i + 1][j] + 1; else d[i][j] = 0; for (i = 1; i <= n; i++) for (j = 1; j <= m; j++) if (a[i][j] == * ) { s = min(min(r[i][j + 1], l[i][j - 1]), min(u[i - 1][j], d[i + 1][j])); if (s > 0) { st[++ans] = {{i, j}, s}; for (y = j - s; y <= j + s; y++) f[i][y] = 1; for (y = i - s; y <= i + s; y++) f[y][j] = 1; } } for (i = 1; i <= n; i++) for (j = 1; j <= m; j++) if (a[i][j] == * && f[i][j] == 0) { cout << -1 << n ; return 0; } cout << ans << n ; for (i = 1; i <= ans; i++) cout << st[i].first.first << << st[i].first.second << << st[i].second << n ; return 0; }
#include <bits/stdc++.h> using namespace std; const long long N = 1e5 + 5, INF = -1e9; long long down[N], mx[N], up[N], dp[N], sum[N]; unordered_map<long long, vector<long long>> mp[N]; long long n, m, pre[N], suf[N], ans[N]; vector<pair<long long, long long>> adj[N]; bool mark[N]; void dfs_down(long long u, long long par) { down[u] = up[u] = mark[u] ? 0 : INF; for (auto x : adj[u]) { long long v = x.first, w = x.second; if (v == par) continue; dfs_down(v, u); mp[u][down[v] + w].push_back(v); down[u] = max(down[u], down[v] + w); } pre[0] = suf[adj[u].size() - 1] = INF; for (long long i = 0; i < adj[u].size(); i++) { long long v = adj[u][i].first, w = adj[u][i].second; pre[i + 1] = v ^ par ? max(pre[i], down[v] + w) : pre[i]; } for (long long i = adj[u].size() - 1; i; i--) { long long v = adj[u][i].first, w = adj[u][i].second; suf[i - 1] = v ^ par ? max(suf[i], down[v] + w) : suf[i]; } for (long long i = 0; i < adj[u].size(); i++) if (adj[u][i].first ^ par) mx[adj[u][i].first] = max(suf[i], pre[i]); } void dfs_up(long long u, long long par) { for (auto x : adj[u]) { long long v = x.first, w = x.second; if (v == par) continue; up[v] = max(up[v], max(up[u], mx[v]) + w); dfs_up(v, u); } } void dfs1(long long u, long long par) { if (mark[u] && up[u] > down[u]) dp[u]++; for (auto x : adj[u]) { long long v = x.first, w = x.second; if (v == par) continue; dfs1(v, u); ans[u] += dp[v]; if (up[u] > mx[v]) dp[u] += dp[v]; if (up[u] < mx[v]) { long long sz = mp[u][mx[v]].size(); if (down[v] + w == mx[v]) sz--; if (sz ^ 1) continue; for (long long s : mp[u][mx[v]]) if (s ^ v) sum[s] += dp[v]; } } } void dfs2(long long u, long long par) { if (mark[u] && down[u] > up[u]) sum[u]++; if (mp[u][down[u]].size() == 1) sum[mp[u][down[u]][0]] += sum[u]; for (auto x : adj[u]) if (x.first ^ par) dfs2(x.first, u); ans[u] += sum[u]; } inline void read_input() { cin >> n >> m; for (long long i = 0; i < m; i++) { long long v; cin >> v; mark[--v] = true; } for (long long i = 1; i < n; i++) { long long u, v, w; cin >> u >> v >> w; adj[--u].push_back({--v, w}); adj[v].push_back({u, w}); } } inline void solve() { dfs_down(0, 0); dfs_up(0, 0); dfs1(0, 0); dfs2(0, 0); } inline void write_output() { long long mx = 0, cnt = 0; for (long long u = 0; u < n; u++) { if (mark[u]) continue; if (mx < ans[u]) { mx = ans[u]; cnt = 0; } if (mx == ans[u]) cnt++; } cout << mx << << cnt << endl; } int32_t main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); read_input(), solve(), write_output(); return 0; }
#include <bits/stdc++.h> #pragma GCC optimize( -O2 ) using namespace std; void err(istream_iterator<string> it) { cerr << endl; } template <typename T, typename... Args> void err(istream_iterator<string> it, T a, Args... args) { cerr << *it << = << a << t ; err(++it, args...); } template <typename T1, typename T2> ostream& operator<<(ostream& c, pair<T1, T2>& v) { c << ( << v.first << , << v.second << ) ; return c; } template <template <class...> class TT, class... T> ostream& operator<<(ostream& out, TT<T...>& c) { out << { ; for (auto& x : c) out << x << ; out << } ; return out; } const int LIM = 1e5 + 5, MOD = 1e9 + 7; int t, n, m, k, x, y; struct Gaussbase2 { int numofbits = 31; int rk = 0; vector<int> Base; Gaussbase2() { Base.assign(numofbits, 0); } Gaussbase2& operator=(Gaussbase2& g) { for (int i = 0; i < numofbits; i++) Base[i] = g.Base[i]; rk = g.rk; } bool canbemade(int x) { for (int i = numofbits - 1; i >= 0; i--) x = min(x, x ^ Base[i]); return x == 0; } void Add(int x) { for (int i = numofbits; i >= 0; i--) { if ((x >> i) & 1) { if (!Base[i]) { Base[i] = x; rk++; return; } else x ^= Base[i]; } } } } g; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n; int tot = 0; for (int i = 0; i < n; i++) { cin >> x; tot ^= x; g.Add(x); } if (tot == 0) cout << -1 << n ; else cout << g.rk << n ; return 0; }
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; const int N = 2e5 + 555; int n, m, q, z; pair<long long, int> a[N]; int qt[N]; long long ql[N], qr[N]; long long ans[N]; vector<pair<int, int> > ed[N]; long long bl[N], br[N], arin[N]; int f[N * 20]; const int iu = 18; int lg[N * 2]; long long st[N][iu], nid[N][iu]; long long sh[N][iu]; void adde(int u, int v, int t) { ed[t].push_back({u, v}); } void add(int id, int l, int r) { int duh = lg[r - l + 1]; int e = r - (1 << duh) + 1; st[l][duh] = max(st[l][duh], min(arin[id], sh[l][duh])); st[e][duh] = max(st[e][duh], min(arin[id], sh[e][duh])); adde(id, nid[l][duh], min(arin[id], sh[l][duh])); adde(id, nid[e][duh], min(arin[id], sh[e][duh])); } int find(int x) { if (f[x] != x) f[x] = find(f[x]); return f[x]; } void join(int x, int y) { x = find(x); y = find(y); f[x] = y; } int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n >> q; for (int i = 2; i < 262144; i++) lg[i] = lg[i / 2] + 1; a[++m] = {-1, -q - 1}; a[++m] = {1LL << n, q + 1}; for (int i = 1; i <= q; i++) { string s; cin >> s >> ql[i] >> qr[i]; if (s[0] == b ) qt[i] = 1; else qt[i] = 2; if (qt[i] == 1) { a[++m] = {ql[i], -i}; a[++m] = {qr[i], i}; } } sort(a + 1, a + m + 1); for (int i = 1; i < m; i++) { long long cl = a[i].first + (i % 2); long long cr = a[i + 1].first - (i % 2); int cc; if (i % 2 == 1) cc = q + 1; else cc = -a[i].second; if (cl > cr) continue; if (cl == cr) { bl[++z] = cl; br[z] = cr; arin[z] = cc; } else { long long fk = cl ^ cr; while (fk != (fk & -fk)) fk ^= fk & -fk; long long mid = cl \| (fk - 1); bl[++z] = cl; br[z] = mid; arin[z] = cc; bl[++z] = mid + 1; br[z] = cr; arin[z] = cc; } } int ptr = z; for (int j = 0; j < iu; j++) { for (int i = 1; i <= z; i++) { nid[i][j] = ++ptr; if (j == 0) sh[i][j] = arin[i]; else if (i + (1 << (j - 1)) <= z) { sh[i][j] = max(sh[i][j - 1], sh[i + (1 << (j - 1))][j - 1]); } } } for (int i = 1; i <= z; i++) { for (int k = n - 1; k >= 0; k--) { long long cl, cr; bool die = false; if (br[i] - bl[i] + 1 > (1LL << k)) { cr = bl[i] \| ((1LL << (k + 1)) - 1); cl = cr ^ ((1LL << (k + 1)) - 1); die = true; } else { cl = bl[i] ^ (1LL << k); cr = br[i] ^ (1LL << k); } int zl = lower_bound(br + 1, br + z + 1, cl) - br; int zr = lower_bound(bl + 1, bl + z + 1, cr + 1) - bl - 1; add(i, zl, zr); if (die) break; } adde(i, nid[i][0], arin[i]); } for (int j = iu - 2; j >= 0; j--) { for (int i = 1; i <= z; i++) { st[i][j] = max(st[i][j], st[i][j + 1]); adde(nid[i][j], nid[i][j + 1], min(st[i][j + 1], sh[i][j])); if (i > (1 << j)) { st[i][j] = max(st[i][j], st[i - (1 << j)][j + 1]); adde(nid[i][j], nid[i - (1 << j)][j + 1], min(st[i - (1 << j)][j + 1], sh[i][j])); } } } for (int i = 1; i <= ptr; i++) f[i] = i; for (int i = q + 1; i >= 1; i--) { for (auto c : ed[i]) join(c.first, c.second); if (qt[i] == 2) { int cl = lower_bound(br + 1, br + z + 1, ql[i]) - br; int cr = lower_bound(br + 1, br + z + 1, qr[i]) - br; ans[i] = find(cl) == find(cr); } } for (int i = 1; i <= q; i++) { if (qt[i] == 2) cout << ans[i] << n ; } }
#include <bits/stdc++.h> using namespace std; int a[100010]; int main() { int t; cin >> t; while (t--) { int n; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); int i = (n - 1) / 2, j = i + 1; while (i >= 0 \|\| j <= n - 1) { if (i >= 0) cout << a[i--] << ; if (j <= n - 1) cout << a[j++] << ; } cout << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, m; int aray[100007]; while (scanf( %d %d , &n, &m) != EOF) { for (int i = 1; i < n; i++) { scanf( %d , &aray[i]); } int sum = 0, i = 1; bool flag = false; while (true) { sum = (i + aray[i]); i = sum; if (sum == m) { flag = true; break; } if (sum > m) { break; } } (flag) ? printf( YES n ) : printf( NO n ); } return 0; }
#include <bits/stdc++.h> using namespace std; const int inf = 1e9 + 333; const long long linf = 1e18 + inf; const int LEN = 6e5 + 5; int n, m, q, len; char str[LEN], s[LEN]; int a[LEN], st[LEN], nd[LEN], suf[LEN], ord[LEN], lcp[LEN], w[LEN], root[LEN], L[LEN], R[LEN]; pair<pair<int, int>, int> C[LEN]; long long cnt[LEN]; void add(int x, char str[]) { int m = strlen(str); s[++len] = # ; st[x] = len + 1; for (int i = 0; i < m; i++) s[++len] = str[i]; nd[x] = len; } int f(int x) { if (x == root[x]) return x; return root[x] = f(root[x]); } void merge(int x, int y) { x = f(x); y = f(y); if (x == y) return; root[y] = x; cnt[x] += cnt[y]; L[x] = min(L[x], L[y]); R[x] = max(R[x], R[y]); } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %s , str); add(i, str); } for (int i = 1; i <= n; i++) scanf( %d , a + i); for (int i = 1; i <= len; i++) suf[i] = s[i]; for (int it = 1; it < len; it = 2) { for (int j = 1; j <= len; j++) { C[j] = make_pair(pair<int, int>(suf[j], suf[min(j + it, len + 1)]), j); } sort(C + 1, C + len + 1); for (int j = 1; j <= len; j++) { suf[C[j].second] = suf[C[j - 1].second] + (C[j].first != C[j - 1].first); } } for (int i = 1; i <= len; i++) ord[suf[i]] = i; for (int i = 1; i <= len; i++) { } int j = 0; for (int i = 1; i <= len; i++) { if (suf[i] == 1) continue; while (i + j <= len and ord[suf[i] - 1] + j <= len and s[i + j] == s[ord[suf[i] - 1] + j] and s[i + j] != # ) j++; lcp[suf[i]] = j; if (j) j--; } for (int i = 1; i <= len; i++) { assert(s[ord[i] + lcp[i]] != s[ord[i - 1] + lcp[i]] or s[ord[i] + lcp[i]] == # ); } for (int i = 1; i <= len; i++) { } memset(w, -1, sizeof(w)); for (int i = 1; i <= n; i++) { for (int j = st[i]; j <= nd[i]; j++) { w[suf[j]] = i; } } for (int i = 1; i <= len; i++) { if (w[i] != -1) cnt[i] = a[w[i]]; L[i] = R[i] = root[i] = i; } vector<pair<int, int> > vs; for (int i = 1; i <= len; i++) { vs.push_back(pair<int, int>(lcp[i], i)); } sort(vs.begin(), vs.end()); long long ans = 0; for (int i = 1; i <= n; i++) { int x = suf[st[i]]; if (nd[i] - st[i] + 1 > lcp[x] and nd[i] - st[i] + 1 > lcp[x + 1]) { ans = max(ans, (long long)a[i] (nd[i] - st[i] + 1)); } } for (int it = len - 1; it >= 0; it--) { int l = vs[it].first, x = vs[it].second; merge(x, x - 1); x = f(x); if (lcp[L[x]] < l and lcp[R[x] + 1] < l) ans = max(ans, cnt[f(x)] * l); } printf( %lld n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; int n, s, ll, v[100011]; int dp[100011]; const int oo = 1 << 28; int seg[400001]; int at, l, r; void add(int n, int s, int e) { if (at < s \|\| at > e \|\| s > e) return; if (s == e) { seg[n] = dp[s]; return; } add(n * 2, s, (s + e) / 2); add(n * 2 + 1, (s + e) / 2 + 1, e); seg[n] = min(seg[n * 2], seg[n * 2 + 1]); } int get(int n, int s, int e) { if (l > e \|\| r < s \|\| l > r \|\| s > e) return oo; if (s >= l && e <= r) return seg[n]; return min(get(n * 2, s, (s + e) / 2), get(n * 2 + 1, (s + e) / 2 + 1, e)); } int main() { scanf( %d%d%d , &n, &s, &ll); for (int i = 1; i <= n; ++i) scanf( %d , v + i); set<pair<int, int> > q; int E = n; for (int i = n; i > 0; --i) { dp[i] = oo; q.insert(make_pair(v[i], i)); while ((--q.end())->first - q.begin()->first > s) { q.erase(make_pair(v[E], E)); --E; } l = i + ll; r = E + 1; if (r >= l) { if (r == n + 1) dp[i] = 1; else dp[i] = min(dp[i], 1 + get(1, 1, n)); } at = i; add(1, 1, n); } if (dp[1] > 500000) dp[1] = -1; printf( %d n , dp[1]); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 2e3 + 10; const int mod = 1e9 + 7; int read() { int x = 0, f = 1; char c = getchar(); while (c < 0 \|\| c > 9 ) { if (c == - ) f = -1; c = getchar(); } while (c >= 0 && c <= 9 ) x = (x << 1) + (x << 3) + c - 0 , c = getchar(); return x * f; } int inc(int x, int y) { return (x + y >= mod) ? (x + y - mod) : (x + y); } int del(int x, int y) { return (x - y < 0) ? (x - y + mod) : (x - y); } int qpow(int a, int x, int mo) { int res = 1; while (x) { if (x & 1) res = 1ll * res * a % mo; a = 1ll * a * a % mod; x >>= 1; } return res; } vector<pair<int, int> > g[N]; long long dp[N][N]; map<int, long long> mp; int q[N]; int main() { int n = read(), m = read(), Q = read(); for (int i = 0; i < m; i++) { int u = read(), v = read(), w = read(); g[u].push_back(make_pair(v, w)); g[v].push_back(make_pair(u, w)); } for (int i = 0; i <= m; i++) for (int j = 1; j <= n; j++) dp[i][j] = -2e18; dp[0][1] = 0; int ans = 0; for (int i = 1; i <= m; i++) { long long res = 0; for (int j = 1; j <= n; j++) for (int t = 0; t < g[j].size(); t++) { pair<int, int> now = g[j][t]; int u = now.first, v = j; dp[i][u] = max(dp[i - 1][v] + now.second, dp[i][u]); if (i == m) mp[now.second] = max(dp[i - 1][v] + now.second, mp[now.second]); res = max(res, dp[i][u]); } ans = inc(ans, res % mod); } vector<pair<int, int> > p; for (auto it : mp) { p.push_back(it); } int head = 1, tail = 0; int Inv2 = qpow(2, mod - 2, mod); for (int i = 0; i < p.size(); i++) { while (head <= tail && p[q[tail]].second <= p[i].second) tail--; q[++tail] = i; } Q -= m; int cnt = 0; int pre = 1; for (int i = 2; i <= tail; i++) { pair<int, int> now = p[q[pre]]; pair<int, int> nxt = p[q[i]]; bool ok = 1; long long k = (now.second - nxt.second) / (nxt.first - now.first); for (int j = i + 1; j <= tail; j++) { pair<int, int> o = p[q[j]]; if ((now.second - o.second) / (o.first - now.first) <= k) { ok = 0; break; } } k -= cnt; if (k <= 0 \|\| ok == 0) continue; if (Q <= k) k = Q; ans = inc(ans, inc(1ll * k * (1 + k) % mod * Inv2 % mod * now.first % mod, 1ll * (now.second + 1ll * cnt * now.first % mod) % mod * k % mod)); Q -= k; cnt += k; pre = i; if (Q == 0) break; } pair<int, int> now = p[q[tail]]; if (Q > 0) ans = inc(ans, inc(1ll * Q * (1 + Q) % mod * Inv2 % mod * now.first % mod, 1ll * (now.second + 1ll * cnt * now.first % mod) % mod * Q % mod)); printf( %d n , ans); }
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int maxn = 1e6 + 5; long long int power(long long int base, long long int exp) { long long int res = 1; while (exp) { if (exp % 2) res = base; base = base; res %= mod; base %= mod; exp /= 2; } return res; } long long int x[2], y[2], val[2]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int i, n, a, b, c; for (long long int j = 0; j < 2; j++) cin >> x[j] >> y[j]; cin >> n; long long int ans = 0; for (i = 1; i <= n; i++) { cin >> a >> b >> c; for (long long int j = 0; j < 2; j++) { val[j] = -1; if (a * x[j] + b * y[j] + c > 0) val[j] = 1; } if (val[1] > 0 && val[0] < 0) ans++; if (val[1] < 0 && val[0] > 0) ans++; } cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; int const bound = 1e6 + 2, N = 2e5 + 1; long long OO = 1e18; double eps = 1e-6; int oo = 1e9, mod = 1e9 + 7; int n, m, s, app[N][2]; pair<int, int> par[N][2]; vector<int> adj[N], rev[N]; queue<pair<int, int> > q; int vis[N]; void buildpath() { puts( Win ); int cur = s, c = 1; while (cur != -1) { printf( %d , cur); pair<int, int> ne = par[cur][c]; cur = ne.first; c = ne.second; } } bool cyc(int u) { vis[u] = 2; for (auto v : rev[u]) { if (vis[v] == 2) return 1; if (!vis[v] && cyc(v)) return 1; } vis[u] = 1; return 0; } int main() { scanf( %d%d , &n, &m); for (int(i) = 1; (i) <= (n); (i)++) { int sz; scanf( %d , &sz); if (!sz) { q.push({i, 0}); app[i][0] = 1; par[i][0] = {-1, -1}; } while (sz--) { int a; scanf( %d , &a); adj[a].push_back(i); rev[i].push_back(a); } } scanf( %d , &s); while (!q.empty()) { pair<int, int> cur = q.front(); q.pop(); for (auto v : adj[cur.first]) { int cost = cur.second + 1; int md = cost % 2; if (app[v][md]) continue; app[v][md] = 1; par[v][md] = {cur.first, cur.second}; if (v == s && md) { buildpath(); return 0; } q.push({v, cost % 2}); } } if (cyc(s)) { puts( Draw ); return 0; } puts( Lose ); return 0; }
#include <bits/stdc++.h> using namespace std; int dp[25][25][5], ans, n, t; int main() { cin >> n >> t; for (int i = 1; i <= 4; i++) for (int j = i + 1; j <= 4; j++) dp[2][1][j]++; for (int i = 3; i <= n; i++) for (int j = 1; j <= t * 2; j++) for (int k = 1; k <= 4; k++) { if (j & 1) for (int l = 1; l < k; l++) dp[i][j][k] += dp[i - 1][j][l] + dp[i - 1][j - 1][l]; else for (int l = k + 1; l <= 4; l++) dp[i][j][k] += dp[i - 1][j][l] + dp[i - 1][j - 1][l]; } for (int i = 1; i <= 4; i++) ans += dp[n][t * 2][i]; cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int t, n; cin >> t; while (t--) { cin >> n; int a = 0, b = 0, k = 2; for (int i = 0; i < n / 2 - 1; i++) { a += k; k = 2; } for (int i = 0; i < n / 2; i++) { b += k; k = 2; } a += k; cout << abs(a - b) << endl; } }
#include <bits/stdc++.h> using namespace std; int k, t, state[16]; unordered_map<unsigned long long, long long> M[10]; unsigned long long tobeull(int state[]) { int tmp[16] = { 0, }; unsigned long long ret = 0; for (int i = 0; i < 16; i++) tmp[i] = state[i]; sort(tmp, tmp + 16); for (int i = 0; i < 16; i++) { ret \|= (tmp[i] << (i * 4)); } return ret; } long long dp(int len, int state[]) { if (len == 0) { return 1; } auto it = M[len].emplace(tobeull(state), 0); if (it.second) { long long ret = 0; for (int i = 0; i < 16; i++) { if (state[i] == t) continue; state[i]++; ret += dp(len - 1, state); state[i]--; } it.first->second = ret; return it.first->second; } else return it.first->second; } int main() { scanf( %d %d , &k, &t); if (k <= 15) { printf( %lx , k); return 0; } int mylen = 1; state[15]++; long long rem = 0; while (1) { long long key = dp(mylen - 1, state) * (long long)15; if (rem + key >= k) { break; } else rem += key; ++mylen; } int st = 1; state[15] = 0; for (int digit = 1; digit <= mylen; digit++) { long long rem = 0; if (st == 1) { state[15] = 1; for (int ite = mylen - 2; ite >= 0; ite--) rem += dp(ite, state) * (long long)15; state[15] = 0; } for (int num = st; num < 16; num++) { if (state[num] == t) continue; state[num]++; long long cnt = dp(mylen - digit, state); if (rem + cnt >= k) { printf( %x , num); break; } else { rem += cnt; state[num]--; } } k -= rem; st = 0; } }
#include <bits/stdc++.h> using namespace std; void solve() { int n, ans = -2; cin >> n; vector<int> v(n); for (auto &a : v) cin >> a; vector<int> max_ele_index; int maxx = 0; for (auto a : v) maxx = max(a, maxx); for (int i = 0; i < n; i++) if (v[i] == maxx) max_ele_index.push_back(i); if (v[0] == maxx and v[1] != maxx) { cout << 1 << n ; return; } if (v[0] != maxx and v[1] == maxx) { cout << 2 << n ; return; } if (v[n - 1] == maxx and v[n - 2] != maxx) { cout << n << n ; return; } for (int i = 1; i < n - 1; i++) if (v[i] == maxx and (v[i - 1] != maxx or v[i + 1] != maxx)) { ans = i; break; } cout << ans + 1 << n ; } int main() { int t; cin >> t; while (t--) solve(); }
#include <bits/stdc++.h> using namespace std; int a[5100], b[5100]; long long c[5100]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; b[i] = a[i]; } sort(b, b + n); for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) { int d = b[j] - a[i]; if (d > 0) c[j] = min(c[j - 1], d + c[j]); else c[j] -= d; } long long ans = c[0]; while (--n) if (ans > c[n]) ans = c[n]; cout << ans << endl; }
#include <bits/stdc++.h> using namespace std; const int MOD = 1000 * 1000 * 1000 + 7; const int INF = 2000 * 1000 * 1000; const double EPS = 1e-9; const double pi = acos(-1.0); template <typename T> inline T sqr(T n) { return (n * n); } long long gcd(int a, int b) { while (a && b) { a %= b; swap(a, b); } return a + b; } struct Point { long long x, y; Point() {} Point(int x, int y) : x(x), y(y) {} Point(const Point& a) { this = a; } Point operator-(const Point& a) const { return Point(x - a.x, y - a.y); } inline long long dist() { return sqr(x) + sqr(y); } bool operator<(const Point& p1) const { return (x < p1.x \|\| (x == p1.x && y < p1.y)); } }; struct Line { long long a, b, c; Line() {} inline void normalize() { if (a < 0 \|\| (a == 0 && b < 0)) { a = -1; b = -1; c = -1; } long long g = gcd(gcd(abs(a), abs(b)), abs(c)); if (g > 1) { a /= g; b /= g; c /= g; } } Line(int aa, int bb, int cc) { a = aa, b = bb, c = cc; normalize(); } Line(const Point& p1, const Point& p2) { a = p2.y - p1.y; b = p1.x - p2.x; c = p1.y * p2.x - p1.x * p2.y; normalize(); } }; const int maxn = 300010; vector<pair<Point, int> > v[maxn]; vector<int> vec[maxn]; map<long long, int> position; vector<Point> tmp[maxn]; Point center[2000]; long long rad[2000]; long long get_hash(const Line& l) { long long a = l.a + 50000; long long b = l.b + 50000; long long c = l.c + 2000000000; long long ret = c * 2000000000LL; ret += a * 100000; ret += b; return ret; } void prepare(int pos) { vector<pair<Point, int> >& cur = v[pos]; sort((cur).begin(), (cur).end()); vec[pos].resize(cur.size()); int cnt = 0; for (size_t i = 0; i < cur.size(); i++) { if (cur[i].second == 0) cnt++; else cnt--; vec[pos][i] = cnt; } } long long get_ans(const Point& p1, const Point& p2) { Line cur(p1, p2); Point mid((p1.x + p2.x) / 2, (p1.y + p2.y) / 2); Point norm(cur.a, cur.b); norm.x += mid.x; norm.y += mid.y; cur = Line(mid, norm); long long h = get_hash(cur); if (!position.count(h)) return 0; int pos = position[h]; int q = upper_bound((v[pos]).begin(), (v[pos]).end(), make_pair(mid, 1)) - v[pos].begin() - 1; if (q != -1) return vec[pos][q]; return 0; } int main() { int n, m; scanf( %d%d , &n, &m); Point p1, p2; int sz = 0; for (int i = 0; i < n; i++) { scanf( %I64d%I64d%I64d%I64d , &p1.x, &p1.y, &p2.x, &p2.y); p1.x = 2, p1.y = 2; p2.x = 2, p2.y = 2; Line cur(p1, p2); long long h = get_hash(cur); int pos = 0; if (position.count(h)) pos = position[h]; else { pos = sz++; position[h] = pos; } v[pos].push_back(make_pair(p1, (p1 < p2) ? 0 : 2)); v[pos].push_back(make_pair(p2, (p1 < p2) ? 2 : 0)); } for (int i = 0; i < sz; i++) prepare(i); long long ans = 0; for (int i = 0; i < m; i++) { scanf( %I64d%I64d%I64d , &center[i].x, &center[i].y, &rad[i]); center[i].x = 2; center[i].y = 2; rad[i] = 2; for (size_t j = 0; j < tmp[rad[i]].size(); j++) { if ((center[i] - tmp[rad[i]][j]).dist() > 4 sqr(rad[i])) ans += get_ans(center[i], tmp[rad[i]][j]); } tmp[rad[i]].push_back(center[i]); } printf( %I64d , ans); return 0; }
#include <bits/stdc++.h> #pragma hdrstop #pragma argsused using namespace std; int main(int argc, char* argv[]) { int i, j, resp, resn, resv, resl, res, n, a, b; vector<int> x, y; scanf( %d , &n); for (i = 0; i < n; i++) { scanf( %d %d , &a, &b); x.push_back(a); y.push_back(b); } res = 0; for (i = 0; i < n; i++) { resv = 0; resn = 0; resp = 0; resl = 0; for (j = 0; j < n; j++) { if (i != j) { if (x[i] == x[j] && y[i] > y[j]) resn++; else if (x[i] == x[j] && y[i] < y[j]) resv++; else if (x[i] > x[j] && y[i] == y[j]) resl++; else if (x[i] < x[j] && y[i] == y[j]) resp++; } if (resp != 0 && resl != 0 && resv != 0 && resn != 0) { res++; break; } } } printf( %d , res); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n; long long d; cin >> n >> d; vector<long long> v; long long x; for (int i = 0; i < n; i++) { cin >> x; v.push_back(x); } int count = 0; for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { if (v[i] - v[j] >= 0 && v[i] - v[j] <= d) count++; else if (v[j] - v[i] >= 0 && v[j] - v[i] <= d) count++; } } cout << count * 2 << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int n, k; long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } long long lcm(long long a, long long b) { return a * b / gcd(a, b); } int main() { ios::sync_with_stdio(false); cin.tie(NULL); cin >> n >> k; vector<int> c(n); for (int &x : c) cin >> x; long long cur = 1; for (int &x : c) { cur = gcd(k, lcm(cur, x)); } if (cur == k) { cout << Yes n ; } else { cout << No n ; } return 0; }
#include <bits/stdc++.h> #pragma GCC optimize(2) #pragma GCC optimize(3) #pragma GCC optimize( Ofast ) #pragma GCC optimize( inline ) #pragma GCC optimize( -fgcse ) #pragma GCC optimize( -fgcse-lm ) #pragma GCC optimize( -fipa-sra ) #pragma GCC optimize( -ftree-pre ) #pragma GCC optimize( -ftree-vrp ) #pragma GCC optimize( -fpeephole2 ) #pragma GCC optimize( -ffast-math ) #pragma GCC optimize( -fsched-spec ) #pragma GCC optimize( unroll-loops ) #pragma GCC optimize( -falign-jumps ) #pragma GCC optimize( -falign-loops ) #pragma GCC optimize( -falign-labels ) #pragma GCC optimize( -fdevirtualize ) #pragma GCC optimize( -fcaller-saves ) #pragma GCC optimize( -fcrossjumping ) #pragma GCC optimize( -fthread-jumps ) #pragma GCC optimize( -funroll-loops ) #pragma GCC optimize( -fwhole-program ) #pragma GCC optimize( -freorder-blocks ) #pragma GCC optimize( -fschedule-insns ) #pragma GCC optimize( inline-functions ) #pragma GCC optimize( -ftree-tail-merge ) #pragma GCC optimize( -fschedule-insns2 ) #pragma GCC optimize( -fstrict-aliasing ) #pragma GCC optimize( -fstrict-overflow ) #pragma GCC optimize( -falign-functions ) #pragma GCC optimize( -fcse-skip-blocks ) #pragma GCC optimize( -fcse-follow-jumps ) #pragma GCC optimize( -fsched-interblock ) #pragma GCC optimize( -fpartial-inlining ) #pragma GCC optimize( no-stack-protector ) #pragma GCC optimize( -freorder-functions ) #pragma GCC optimize( -findirect-inlining ) #pragma GCC optimize( -fhoist-adjacent-loads ) #pragma GCC optimize( -frerun-cse-after-loop ) #pragma GCC optimize( inline-small-functions ) #pragma GCC optimize( -finline-small-functions ) #pragma GCC optimize( -ftree-switch-conversion ) #pragma GCC optimize( -foptimize-sibling-calls ) #pragma GCC optimize( -fexpensive-optimizations ) #pragma GCC optimize( -funsafe-loop-optimizations ) #pragma GCC optimize( inline-functions-called-once ) #pragma GCC optimize( -fdelete-null-pointer-checks ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt,tune=native ) using namespace std; struct node { int next, to; } w[2000010]; int n, m, cnt = 1, ans[1000005], h[1000005], top, ln, op, c[1000005], dfn[1000005], timer, bj[1000005], v[1000005], id[2000005]; const int MAX_SIZE = 1 << 21; char l, r, buf[MAX_SIZE]; inline int gc() { if (l == r) if (l == (r = (l = buf) + fread(buf, 1, MAX_SIZE, stdin))) return -1; return *l++; } inline void read(int &x) { register char c = gc(); for (; c < 48 \|\| c > 57; c = gc()) ; for (x = 0; c > 47 && c < 58; c = gc()) x = (x << 3) + (x << 1) + (c ^ 48); } inline void write(int x) { if (x > 9) write(x / 10); putchar(x % 10 + 0 ); } void add(int x, int y, int z) { cnt++; w[cnt].to = y; w[cnt].next = h[x]; id[cnt] = z; h[x] = cnt; } inline void DFS1(int u, int co, int tag) { register int i; c[u] = co; dfn[u] = ++timer; for (i = h[u]; i; i = w[i].next) { if (i == (tag ^ 1)) { continue; } int e = w[i].to; if (c[e] == 0) { DFS1(e, 3 - co, i); } else { if (dfn[u] < dfn[e]) { continue; } if (c[u] == c[e]) { op++; ln = i; bj[u]++; bj[e]--; } else { bj[u]--; bj[e]++; } } } } inline void DFS2(int u, int tag) { register int i; v[u] = 1; for (i = h[u]; i; i = w[i].next) { if (i == (tag ^ 1)) continue; int e = w[i].to; if (v[e] == 0) { DFS2(e, i); bj[u] += bj[e]; } } if (bj[u] == op) { top++; ans[top] = tag; } } int main() { register int i, x, y; read(n); read(m); for (i = 1; i <= m; i++) { read(x); read(y); if (x == y) { op++; add(0, 0, i); ln = cnt; continue; } add(x, y, i); add(y, x, i); } for (i = 1; i <= n; i++) { if (c[i] == 0) { DFS1(i, 1, 0); } } for (i = 1; i <= n; i++) { if (v[i] == 0) { DFS2(i, 0); } } if (op == 0) { write(m); putchar( n ); for (i = 1; i <= m; i++) { write(i); putchar( ); } } else { if (op == 1) { top++; ans[top] = ln; } write(top); putchar( n ); sort(ans + 1, ans + 1 + top); for (i = 1; i <= top; i++) { write(id[ans[i]]); putchar( ); } } }
#include <bits/stdc++.h> using namespace std; char s[1111][1111]; int d[1111][1111]; queue<pair<int, int> > Q; vector<pair<int, int> > v; int n, m, lim; int dx[4] = {1, 0, -1, 0}; int dy[4] = {0, 1, 0, -1}; void check(int x, int y, int z) { if (x < 0 \|\| x >= n \|\| y < 0 \|\| y >= m) return; if (s[x][y] == T ) return; if (s[x][y] == S ) lim = z; d[x][y] = z; if ( 0 <= s[x][y] && s[x][y] <= 9 ) v.push_back(make_pair(s[x][y] - 0 , z)); s[x][y] = T ; Q.push(make_pair(x, y)); } int main() { scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) scanf( %s , s[i]); for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) if (s[i][j] == E ) Q.push(make_pair(i, j)); while (!Q.empty()) { pair<int, int> now = Q.front(), tmp; Q.pop(); for (int dir = 0; dir < 4; dir++) check(now.first + dx[dir], now.second + dy[dir], d[now.first][now.second] + 1); } int ans = 0; for (vector<pair<int, int> >::iterator ii = v.begin(); ii != v.end(); ii++) if (ii->second <= lim) ans += ii->first; cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; struct less_key { bool operator()(pair<double, int64_t> p1, pair<double, int64_t> p2) { return (p1.first > p2.first) \|\| ((p1.first == p2.first) && (p1.second < p2.second)); } }; struct pair_hash { std::size_t operator()(const pair<int64_t, int64_t>& k) const { return static_cast<size_t>(k.first ^ k.second); } }; const int64_t mod = 100000000007ll; const int64_t inf = 10000000000000007ll; const double eps = 0.00000001; int64_t n, k; string s; int64_t amin[256]; int64_t amax[256]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> n >> k; cin >> s; for (int64_t i = 0; i < s.size(); i++) { if (!amin[s[i]]) { amin[s[i]] = i + 1; } amax[s[i]] = i + 1; } set<pair<int64_t, int64_t> > q; for (int64_t i = A ; i <= Z ; i++) { if (amin[i]) { q.insert({amin[i], 0}); q.insert({amax[i], 1}); } } int64_t z = 0; for (auto i : q) { if (i.second) { z--; } else { z++; } if (z > k) { cout << YES << endl; return 0; } } cout << NO << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; int main() { int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } map<vector<int>, int> S; for (int bit = 0; bit < (1 << 15); bit++) { vector<int> b(n); for (int i = 0; i < n; i++) { int c = a[i] ^ bit; for (int j = 0; j < 15; j++) { if (c & (1 << j)) b[i]++; } } vector<int> vec(n - 1); for (int i = 1; i < n; i++) { vec[i - 1] = b[i] - b[0]; } S[vec] = bit; } for (int bit = 0; bit < (1 << 15); bit++) { vector<int> b(n); for (int i = 0; i < n; i++) { int c = a[i] ^ (bit << 15); for (int j = 15; j < 30; j++) { if (c & (1 << j)) b[i]++; } } vector<int> vec(n - 1); for (int i = 1; i < n; i++) { vec[i - 1] = b[0] - b[i]; } if (S.find(vec) != S.end()) { cout << (bit << 15) + S[vec] << endl; return 0; } } cout << -1 << endl; }
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c; cin >> a >> b >> c; int Time = 0; a -= 2; int Turn = 2; while (a > 0 \|\| b > 0 \|\| c > 0) { if (Turn == 1) { Time++; a -= 2; Turn = 2; } else if (Turn == 2) { Time++; b -= 2; Turn = 3; } else if (Turn == 3) { Time++; c -= 2; Turn = 1; } } Time += 30; cout << Time; }
#include <bits/stdc++.h> using namespace std; int gcd(int x, int y) { if (x == 0) return y; return gcd(y % x, x); } int main() { int n, m, x, g; cin >> n >> m >> x; g = x - 1; for (int i = 1; i < n; ++i) { scanf( %d , &x); g = gcd(g, x - 1); } set<int> second; int d = 1; while (d * d <= g) { if (g % d == 0) { for (int p = 1; p * d <= m; p = 2) second.insert(p d); for (int p = 1; p * (g / d) <= m; p = 2) second.insert(p (g / d)); } ++d; } long long ans = 0; for (set<int>::iterator it = second.begin(); it != second.end(); it++) ans += m - (*it); cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, f[6]; cin >> a >> b >> c; f[0] = a + b + c; f[1] = a + b * c; f[2] = a * b + c; f[3] = a * b * c; f[4] = (a + b) * c; f[5] = a * (b + c); sort(f, f + 6); cout << f[5]; return 0; }
#include <bits/stdc++.h> using namespace std; vector<long long int> ar[100005]; long long int vis[100005]; long long int mi; long long int val[100005]; void dfs(long long int a) { vis[a] = 1; mi = min(val[a], mi); for (auto it : ar[a]) { if (vis[it] == 0) { dfs(it); } } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int n, i, m, a, b, sum = 0; cin >> n >> m; for (i = 1; i <= n; i++) cin >> val[i]; for (i = 1; i <= m; i++) { cin >> a >> b; ar[a].push_back(b); ar[b].push_back(a); } for (i = 1; i <= n; i++) { if (vis[i] == 0) { mi = INT_MAX; dfs(i); sum = sum + mi; } } cout << sum << n ; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n; int arr[10] = {0}; string s; cin >> n >> s; for (int i = 0; i < n; i++) arr[s[i] - 0 ]++; if ((arr[1] \|\| arr[2] \|\| arr[3]) && (arr[7] \|\| arr[0] \|\| arr[9]) && (((arr[1] \|\| arr[4] \|\| arr[7]) && (arr[3] \|\| arr[6] \|\| arr[9])) \|\| arr[0])) cout << YES ; else cout << NO n ; }
#include <bits/stdc++.h> using namespace std; using namespace std; const int INF = 1000000000; const int inf = INF; struct Edge { int from, to, cap, flow, index; Edge(int from, int to, int cap, int flow, int index) : from(from), to(to), cap(cap), flow(flow), index(index) {} }; struct Dinic { int N; vector<vector<Edge> > G; vector<Edge > dad; vector<int> Q; Dinic(int N) : N(N), G(N), dad(N), Q(N) {} void AddEdge(int from, int to, int cap) { G[from].push_back(Edge(from, to, cap, 0, G[to].size())); if (from == to) G[from].back().index++; G[to].push_back(Edge(to, from, 0, 0, G[from].size() - 1)); } long long BlockingFlow(int s, int t) { fill(dad.begin(), dad.end(), (Edge )NULL); dad[s] = &G[0][0] - 1; int head = 0, tail = 0; Q[tail++] = s; while (head < tail) { int x = Q[head++]; for (int i = 0; i < G[x].size(); i++) { Edge &e = G[x][i]; if (!dad[e.to] && e.cap - e.flow > 0) { dad[e.to] = &G[x][i]; Q[tail++] = e.to; } } } if (!dad[t]) return 0; long long totflow = 0; for (int i = 0; i < G[t].size(); i++) { Edge start = &G[G[t][i].to][G[t][i].index]; int amt = INF; for (Edge e = start; amt && e != dad[s]; e = dad[e->from]) { if (!e) { amt = 0; break; } amt = min(amt, e->cap - e->flow); } if (amt == 0) continue; for (Edge e = start; amt && e != dad[s]; e = dad[e->from]) { e->flow += amt; G[e->to][e->index].flow -= amt; } totflow += amt; } return totflow; } long long GetMaxFlow(int s, int t) { long long totflow = 0; while (long long flow = BlockingFlow(s, t)) totflow += flow; return totflow; } }; struct node { int r, c, t; node() {} node(int r, int c, int t) : r(r), c(c), t(t) {} }; vector<node> qm, qf; node read() { int r, c, t; cin >> r >> c >> t; r--; c--; return node(r, c, t); } const int MAXN = 25; const int MAXT = 600; char mat[MAXN][MAXN]; int n, m, male, female; int id[MAXN][MAXN]; int dis[MAXT][MAXT]; int main() { cin >> n >> m >> male >> female; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) cin >> mat[i][j]; if (male < female) qm.push_back(read()); else qf.push_back(read()); for (int i = 0; i < male; i++) qm.push_back(read()); for (int i = 0; i < female; i++) qf.push_back(read()); if (male < female) male++; else female++; if (male != female) { cout << -1 << endl; return 0; } int tot = 0; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) if (mat[i][j] == . ) id[i][j] = tot++; for (int i = 0; i < tot; i++) for (int j = 0; j < tot; j++) dis[i][j] = (i == j) ? 0 : inf; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) if (mat[i][j] == . ) for (int ii = 0; ii < n; ii++) for (int jj = 0; jj < m; jj++) if (mat[ii][jj] == . && abs(i - ii) + abs(j - jj) == 1) dis[id[i][j]][id[ii][jj]] = 1; for (int k = 0; k < tot; k++) for (int i = 0; i < tot; i++) for (int j = 0; j < tot; j++) dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]); long long lo = 0, hi = 1LL << 60, ans = -1; while (lo <= hi) { long long mid = (lo + hi) / 2; Dinic res(male + female + 2 tot + 2); for (int i = 0; i < (int)qm.size(); i++) { int index = id[qm[i].r][qm[i].c]; for (int j = 0; j < tot; j++) if (dis[index][j] != inf && (long long)dis[index][j] * qm[i].t <= mid) res.AddEdge(i, male + j, 1); } for (int j = 0; j < tot; j++) res.AddEdge(male + j, male + tot + j, 1); for (int j = 0; j < tot; j++) for (int k = 0; k < (int)qf.size(); k++) { int index = id[qf[k].r][qf[k].c]; if (dis[index][j] != inf && (long long)dis[index][j] * qf[k].t <= mid) res.AddEdge(male + tot + j, male + tot + tot + k, 1); } int source = male + tot + tot + female; int sink = source + 1; for (int i = 0; i < male; i++) res.AddEdge(source, i, 1); for (int i = 0; i < female; i++) res.AddEdge(male + tot + tot + i, sink, 1); if (res.GetMaxFlow(source, sink) == male) ans = mid, hi = mid - 1; else lo = mid + 1; } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int x[505], r[505]; int main() { int i; x[0] = 0; r[0] = 1000000; double dd; int d; for (i = 1; i <= 300; i++) { r[i] = 300 - i + 1; dd = 2 * sqrt(double(r[i - 1])) * sqrt(double(r[i])); d = int(dd + 3); x[i] = x[i - 1] + d; } x[301] = x[300] + 10000; r[301] = 1000000; printf( 302 ); for (i = 0; i < 302; i++) { printf( n%d %d , x[i], r[i]); } return 0; }
#include <bits/stdc++.h> using namespace std; int a[200000 + 1]; int n; int b[200000 + 1]; int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; b[a[i]] = 0; } int max = -1; int k = 0; int numb; for (int i = n; i > 0; i--) { k = 0; if (b[a[i]] == 0) { b[a[i]] = 1; k = n - i; } if (k > max) { max = k; numb = a[i]; } } cout << numb; return 0; }
#include <bits/stdc++.h> using namespace std; const int modulo = 1000000009; long long A(int events, int days) { if (events < days) return 0; long long result = 1; for (int e = events - 1; e >= days; --e) { result = e; result %= modulo; } for (int i = 0; i < days; i++) { result = events; result %= modulo; --events; } return result; } int main() { int n, w, b; scanf( %i%i%i , &n, &w, &b); long long result = 0; for (int i = 2; i < n; i++) { result += ((i - 1) * A(w, i)) % modulo * A(b, n - i); result %= modulo; } printf( %i n , (int)result); return 0; }
#include <bits/stdc++.h> using namespace std; double p[100005], e1[100005], e2[100005]; int main() { int n; scanf( %d , &n); for (register int i = 1; i <= n; ++i) scanf( %lf , p + i); for (register int i = 1; i <= n; ++i) { e1[i] = (e1[i - 1] + 1) * p[i]; e2[i] = e2[i - 1] + (e1[i - 1] + e1[i - 1] + 1) * p[i]; } printf( %.15lf , e2[n]); return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXN = (int)3e3 + 5; const int INF = (int)1e9; const string T = aeiou ; int dp[MAXN], par[MAXN]; bool space[MAXN]; bool vowel[256]; string s; int n; bool bad(char a, char b, char c) { if (a == b && b == c) { return 0; } if (!vowel[a] && !vowel[b] && !vowel[c]) { return 1; } return 0; } void solve() { cin >> s; n = s.size(); s = # + s; for (char c : T) { vowel[c] = 1; } for (int i = 1; i <= n; ++i) { dp[i] = INF; } for (int l = 1; l <= n; ++l) { bool good = 1; for (int r = l; r <= n; ++r) { if (r - 2 >= l && bad(s[r - 2], s[r - 1], s[r])) { good = 0; break; } if (dp[l - 1] + 1 < dp[r]) { dp[r] = dp[l - 1] + 1; par[r] = l - 1; } } } for (int v = n; v > 0; v = par[v]) { space[v] = 1; } for (int i = 1; i <= n; ++i) { printf( %c , s[i]); if (space[i]) { printf( ); } } } int main() { int tt = 1; while (tt--) { solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; int vis[6000]; int dp[5][100], mp[5][55], num[55]; int main() { int n; cin >> n; for (int i = 1; i <= 2; i++) for (int j = 1; j < n; j++) cin >> mp[i][j]; for (int i = 1; i <= n; i++) cin >> num[i]; memset(dp, 0, sizeof dp); for (int i = n - 1; i >= 1; i--) dp[2][i] = dp[2][i + 1] + mp[2][i]; int t1 = 10000000, t2 = 10000000, cnt = 0; for (int i = 1; i <= n; i++) { int kl = dp[2][i] + num[i] + cnt; if (kl < t2) { if (kl < t1) t2 = t1, t1 = kl; else t2 = kl; } cnt += mp[1][i]; } int ans = t1 + t2; cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; set<string> ss; string s; void readInput() { cin >> s; } void solve() { for (int i = 0; i <= s.length(); i++) { for (char c = a ; c <= z ; c++) { string tmp; tmp += s.substr(0, i) + c + s.substr(i, s.length()); ss.insert(tmp); } } cout << ss.size(); } int main() { readInput(); solve(); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int t, n; scanf( %d , &t); while (t--) { scanf( %d , &n); printf( %d n , n - 1); for (int i = 2; i <= n; ++i) printf( %d , i); printf( n ); } }
#include <bits/stdc++.h> using namespace std; const int MAX_TAILLE = 100 * 1000 + 3; long long T[1]; long long paire[MAX_TAILLE], impaire[MAX_TAILLE]; int n, e, a; long long best; int main() { paire[0] = 0; impaire[0] = 0; int p = 1, ip = 1; cin >> n >> e; T[0] = 0; for (int i = 1; i <= n; i++) { cin >> a; if (i % 2 == 1) { paire[p] = paire[p - 1] + a - T[0]; p++; } else { impaire[ip] = impaire[ip - 1] + a - T[0]; ip++; } T[0] = a; } if ((n + 1) % 2 == 1) { paire[p] = paire[p - 1] + e - T[0]; ip--; } else { impaire[ip] = impaire[ip - 1] + e - T[0]; p--; } best = paire[p]; for (int i = 1; i <= p; i++) { best = max(best, paire[i] + impaire[ip] - impaire[i - 1] - 1); } cout << best; }
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( Ofast ) #pragma GCC optimize( unroll-loops ) const long long maxn = 4005, maxk = 1e5 + 2, mod = 1e9 + 7; long long a[maxn]; vector<long long> v; bool mrk[maxn]; int32_t main() { long long t; cin >> t; while (t--) { long long n, mx = 0, lst = 0; cin >> n >> mx; for (long long i = 1; i < 2 * n; i++) { cin >> a[i]; if (a[i] > mx) { mx = a[i]; v.push_back(i - lst); lst = i; } } v.push_back(2 * n - lst); for (long long i = 1; i <= n; i++) mrk[i] = false; mrk[0] = true; for (long long i = 0; i < (long long)(v).size(); i++) { for (long long j = n - v[i]; j >= 0; j--) mrk[j + v[i]] \|= mrk[j]; } if (mrk[n]) cout << YES << n ; else cout << NO << n ; v.clear(); } }
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; int turn = 2 * k + 1; if (n % turn == 0) cout << n / turn << ; else cout << n / turn + 1 << ; double upperbound = (n - 1) % turn + 1; int MAXN = 0; upperbound /= 2; int temp = ceil(upperbound); for (int i = min(k + 1, temp); i <= n; i += turn) { cout << i << ; MAXN = i; } if (MAXN + k < n) cout << MAXN + 2 * k + 1; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long n, l, r; cin >> n >> l >> r; cout << (n - l) + (int)pow(2, l) - 1 << << (n - r) * ((int)pow(2, r - 1)) + ((int)pow(2, r) - 1) << endl; }
#include <bits/stdc++.h> using namespace std; inline int read() { char c; int x = 0; int b = 1; do { c = getchar(); if (c == 45) b = -1; } while (c > 57 \|\| c < 48); do x = x * 10 + c - 48, c = getchar(); while (c <= 57 && c >= 48); x *= b; return x; } int n, m, t; const int maxn = 300 + 5; const int logn = 10 + 5; int f[logn][maxn][maxn]; int g[maxn][maxn], w[maxn][maxn]; int main() { n = read(), m = read(); t = log2(n); memset(f, 0xcf, sizeof(f)); memset(w, 0xcf, sizeof(w)); for (int i = 1, x, y, z, l; i <= m; i++) { x = read(), y = read(); z = read(); l = read(); f[0][x][y] = z, f[0][y][x] = l; } for (int i = 1; i <= n; i++) w[i][i] = f[0][i][i] = 0; for (int s = 1; s <= 10; s++) { for (int k = 1; k <= n; k++) { for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { f[s][i][j] = max(f[s][i][j], f[s - 1][i][k] + f[s - 1][k][j]); } } } } int ans = 0; for (int s = 10; s >= 0; s--) { memset(g, 0xcf, sizeof(g)); for (int k = 1; k <= n; k++) { for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { g[i][j] = max(g[i][j], w[i][k] + f[s][k][j]); } } } int sig = 0; for (int i = 1; i <= n; i++) if (g[i][i] > 0) sig = 1; if (sig) continue; else { for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { w[i][j] = g[i][j]; } } ans += (1 << s); } } printf( %d n , ans >= n ? 0 : ans + 1); return 0; }

#include <bits/stdc++.h> using namespace std; const int MAXN = 1000010; unordered_map<int, vector<pair<int, int> > > rows; unordered_map<int, vector<pair<int, int> > > cols; int n, m; int cnum; map<pair<int, int>, int> id; map<pair<int, int>, vector<pair<int, int> > > adj1; unordered_map<int, vector<int> > adj2; int dp[MAXN]; void fgreat(const vector<pair<int, int> >& v, int row, int col) { int sz = v.size(); for (int i = 0; i < (sz - 1); ++i) if (v[i].first < v[i + 1].first) { if (row == -1) { adj2[id[make_pair(v[i + 1].second, col)]].push_back( id[make_pair(v[i].second, col)]); } else { adj2[id[{row, v[i + 1].second}]].push_back( id[make_pair(row, v[i].second)]); } } } void fequal(const vector<pair<int, int> >& v, int row, int col) { int sz = v.size(); for (int i = 0; i < (sz - 1); ++i) if (v[i].first == v[i + 1].first) { if (row == -1) { adj1[{v[i].second, col}].push_back(make_pair(v[i + 1].second, col)); adj1[{v[i + 1].second, col}].push_back(make_pair(v[i].second, col)); } else { adj1[{row, v[i].second}].push_back(make_pair(row, v[i + 1].second)); adj1[{row, v[i + 1].second}].push_back(make_pair(row, v[i].second)); } } } void dfs(int sx, int sy) { id[{sx, sy}] = cnum; const auto& v = adj1[{sx, sy}]; for (__typeof((v).begin()) it = (v).begin(); it != (v).end(); ++it) if (!id.count(*it)) { dfs(it->first, it->second); } } int solve(int id) { int& ans = dp[id]; if (ans != -1) return ans; ans = 0; const auto& v = adj2[id]; for (__typeof((v).begin()) it = (v).begin(); it != (v).end(); ++it) ans = max(ans, solve(*it)); return ++ans; } int main() { scanf( %d %d , &(n), &(m)); for (int i = 0; i < (n); ++i) for (int j = 0; j < (m); ++j) { int x; scanf( %d , &(x)); rows[i].push_back(make_pair(x, j)); cols[j].push_back(make_pair(x, i)); } for (__typeof((rows).begin()) it = (rows).begin(); it != (rows).end(); ++it) { auto& v = it->second; sort(v.begin(), v.end()); } for (__typeof((cols).begin()) it = (cols).begin(); it != (cols).end(); ++it) { auto& v = it->second; sort(v.begin(), v.end()); } for (__typeof((rows).begin()) it = (rows).begin(); it != (rows).end(); ++it) { fequal(it->second, it->first, -1); } for (__typeof((cols).begin()) it = (cols).begin(); it != (cols).end(); ++it) { fequal(it->second, -1, it->first); } for (int i = 0; i < (n); ++i) for (int j = 0; j < (m); ++j) if (!id.count({i, j})) { dfs(i, j); ++cnum; } for (__typeof((rows).begin()) it = (rows).begin(); it != (rows).end(); ++it) { fgreat(it->second, it->first, -1); } for (__typeof((cols).begin()) it = (cols).begin(); it != (cols).end(); ++it) { fgreat(it->second, -1, it->first); } memset(dp, -1, sizeof(dp)); for (int i = 0; i < (n); ++i) { for (int j = 0; j < (m); ++j) { if (j) printf( ); printf( %d , solve(id[{i, j}])); } printf( n ); } return 0; }

#include <bits/stdc++.h> using namespace std; string c1, c2; int main() { int x; cin >> c1 >> c2; for (int i = 0; i < c1.size(); i++) { if (c1[i] < 92) { c1[i] += 32; } if (c2[i] < 92) { c2[i] += 32; } } if (c1 < c2) { x = -1; } else if (c1 > c2) { x = 1; } else { x = 0; } printf( %d n , x); return 0; }

#include <bits/stdc++.h> const int MAXN = 10010100; const int MAZN = 301010; int ch[MAXN][3]; int n, cnt, cout[MAXN]; int arr[MAZN]; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &arr[i]); } for (int i = 1; i <= n; i++) { int tem, p = 0; scanf( %d , &tem); for (int k = 29; k >= 0; k--) { int tmp = (tem >> k) & 1; if (ch[p][tmp]) p = ch[p][tmp]; else p = ch[p][tmp] = ++cnt; cout[p]++; } } for (int i = 1; i <= n; i++) { int x = arr[i]; int ans = 0, p = 0; for (int j = 29; j >= 0; j--) { int tmp = (x >> j) & 1; if (ch[p][tmp] && cout[ch[p][tmp]]) { p = ch[p][tmp]; } else { p = ch[p][!tmp]; ans += (1 << j); } cout[p]--; } printf( %d , ans); } }

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, ans = 0; string s; cin >> n; while (cin >> s) { int cnt = 0; for (int i = 0; i < s.length(); ++i) { if (s[i] >= A && s[i] <= Z ) { ++cnt; } } ans = max(ans, cnt); } cout << ans << endl; return 0; }

#include <bits/stdc++.h> using namespace std; int gi() { char cc = getchar(); int cn = 0, flus = 1; while (cc < 0 || cc > 9 ) { if (cc == - ) flus = -flus; cc = getchar(); } while (cc >= 0 && cc <= 9 ) cn = cn * 10 + cc - 0 , cc = getchar(); return cn * flus; } const int N = 1e5 + 5; int n, m, q, L[N]; struct SegmentBeats { int bef, mx, se, tot, tag; } tr[N << 2]; void cmax(int &x, int y) { x = (x < y) ? y : x; } inline void pushup(int x) { tr[x].tot = tr[x].se = 0, tr[x].mx = max(tr[(x << 1)].mx, tr[(x << 1 | 1)].mx); if (tr[x].mx == tr[(x << 1)].mx) tr[x].tot += tr[(x << 1)].tot, cmax(tr[x].se, tr[(x << 1)].se); else cmax(tr[x].se, tr[(x << 1)].mx); if (tr[x].mx == tr[(x << 1 | 1)].mx) tr[x].tot += tr[(x << 1 | 1)].tot, cmax(tr[x].se, tr[(x << 1 | 1)].se); else cmax(tr[x].se, tr[(x << 1 | 1)].mx); tr[x].bef = tr[x].mx; } inline void push(int x, int k) { tr[x].mx = k, tr[x].tag = k; } inline void pushmark(int x) { if (!tr[x].tag) return; if (tr[(x << 1)].mx == tr[x].bef) push((x << 1), tr[x].tag); if (tr[(x << 1 | 1)].mx == tr[x].bef) push((x << 1 | 1), tr[x].tag); tr[x].tag = 0, tr[x].bef = tr[x].mx; } int query(int x, int l, int r, int k) { if (l == r) return tr[x].mx; int mid = (l + r) >> 1; pushmark(x); if (k <= mid) return query((x << 1), l, mid, k); else return query((x << 1 | 1), mid + 1, r, k); } void update(int x, int l, int r, int k, int d) { if (l == r) return tr[x].mx = d, tr[x].se = 0, tr[x].tot = 1, void(); int mid = (l + r) >> 1; pushmark(x); if (k <= mid) update((x << 1), l, mid, k, d); else update((x << 1 | 1), mid + 1, r, k, d); pushup(x); } void modify(int x, int l, int r, int ql, int qr, int y, int z) { if (tr[x].mx < y || r < ql || qr < l) return; if ((ql <= l && r <= qr) && (tr[x].se < y && tr[x].mx >= y)) return push(x, z); int mid = (l + r) >> 1; pushmark(x); modify((x << 1), l, mid, ql, qr, y, z), modify((x << 1 | 1), mid + 1, r, ql, qr, y, z), pushup(x); } vector<pair<int, int> > p[N]; int ans[N]; signed main() { n = gi(), m = gi(); int x, y; for (int i = (1); i <= (m); ++i) x = gi(), y = gi(), L[y] = x; q = gi(); for (int i = (1); i <= (q); ++i) x = gi(), y = gi(), p[y].push_back(make_pair(x, i)); for (int i = (1); i <= (n); ++i) { update(1, 1, n, i, i); if (L[i]) modify(1, 1, n, 1, L[i], L[i], i); for (auto u : p[i]) ans[u.second] = query(1, 1, n, u.first); } for (int i = (1); i <= (q); ++i) printf( %d n , ans[i]); return 0; }

#include <bits/stdc++.h> const int N = 3003; const long long mod = 998244353; using namespace std; int n; int c; int a[N]; int p[N]; int res[N]; int d[N][N]; int g[N][N]; int f1[N][1 << 12]; void upd(int &x, int y) { x += y; if (x >= mod) { x -= mod; } else if (x < 0) { x += mod; } } void solve1() { int nj, nk, last = (1 << c) - 1; for (int i = 1; i <= n; i++) { for (int j = (i - 1) / c; j >= 0; j--) { for (int k = last - 1; k >= 0; k--) { nj = j; nk = k | (1 << a[i]); if (nk == last) { nj += 1; nk = 0; upd(d[i][nj], f1[j][k]); } upd(f1[nj][nk], f1[j][k]); } } if (c == 1) { upd(d[i][1], 1); upd(f1[1][0], 1); } else { upd(f1[0][1 << a[i]], 1); } } } long long pw(long long x, long long n) { long long res = 1; while (n) { if (n & 1) { res = res * x % mod; } x = x * x % mod; n /= 2; } return res; } int t[N]; int inv[N]; void solve2() { for (int i = 1; i < n; i++) { inv[i] = pw(p[i] - 1, mod - 2); } for (int i = 1; i <= n; i++) { for (int j = 0; j < c; j++) { t[j] = 0; } int j = i - 1; int sad = c; while (j < n && sad) { j += 1; t[a[j]] += 1; sad -= t[a[j]] == 1; } if (sad) { break; } long long res = 1; for (int h = 0; h < c; h++) { res = res * (p[t[h]] - 1) % mod; } sad = 1; for (; j <= n; j++) { res = res * inv[t[a[j]]] % mod; g[i][j] = res; if (sad) { sad = 0; } else { t[a[j]] += 1; } res = res * (p[t[a[j]]] - 1) % mod; } } d[0][0] = 1; int k = n / c; d[0][0] = 1; long long sum, MOD = mod, MOD2 = mod * mod; for (int r = 1; r <= k; r++) { d[0][r] = 0; for (int i = r * c - 1; i < n; i++) { sum = 0; for (int j = i; j >= (r - 1) * c; j--) { sum += 1LL * g[j + 1][i + 1] * d[j][r - 1]; if (sum >= MOD2) sum -= MOD2; } d[i + 1][r] = (sum % MOD); } } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> c; for (int i = 1; i <= n; i++) { cin >> a[i]; a[i] -= 1; } p[0] = 1; for (int i = 1; i <= n; i++) { p[i] = p[i - 1]; upd(p[i], p[i]); } if (c <= 10) { solve1(); } else { solve2(); } for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { upd(res[j], 1ll * d[i][j] * p[n - i] % mod); } } res[0] = p[n]; upd(res[0], -1); for (int i = 0; i <= n; i++) { upd(res[i], -res[i + 1]); cout << res[i] << ; } }

#include <bits/stdc++.h> using namespace std; const int maxn = 100 + 10; const long long inf = 0x3f3f3f3f3f3f3f3f; string s; int a[maxn]; int main() { ios::sync_with_stdio(0); cin.tie(0); int t; cin >> t; while (t--) { int flag = 0; int n; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); for (int i = 1; i < n; i++) { if (a[i] - a[i - 1] == 1) { flag = 1; break; } } if (flag) cout << 2 << endl; else cout << 1 << endl; } return 0; }

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; const int MOD = 1000000007; void solve() { int n; cin >> n; vector<vector<int>> dp(4, vector<int>(n + 1, 0)); dp[3][0] = 1; for (int i = 1; i < n + 1; i++) for (int j = 0; j < 4; j++) for (int k = 0; k < 4; k++) if (k != j) dp[j][i] = (dp[j][i] + dp[k][i - 1]) % MOD; cout << dp[3][n] << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t = 1; while (t--) { solve(); } return 0; }

#include <bits/stdc++.h> using namespace std; long long l, r, n, k; string Bad; int ask(long long l, long long r) { cout << l << << r << endl; cout.flush(); cin >> Bad; if (Bad[0] == B ) exit(0); if (Bad[0] == Y ) { if (l == r) exit(0); return 1; } return 0; } int main() { srand(2109888); cin >> n >> k; l = 1; r = n; while (l <= r) { long long mid = (l + r) >> 1; if (ask(l, mid)) r = mid; else l = mid + 1; l = max(1ll, l - k); r = min(n, r + k); mid = l + rand() % (r - l + 1); ask(mid, mid); l = max(1ll, l - k); r = min(n, r + k); } return 0; }

#include <bits/stdc++.h> using namespace std; const int nn = 100005; const double eps = 1e-10; struct point { double x, y; } a[nn], b[nn]; int n, m, t, l[nn], r[nn]; int h[nn], p[nn]; double R, c[nn]; inline double cp(const point &x, const point &y, const point &z) { return (x.x - z.x) * (y.y - z.y) - (x.y - z.y) * (y.x - z.x); } inline double dis(const point &x, const point &y) { return sqrt((x.x - y.x) * (x.x - y.x) + (x.y - y.y) * (x.y - y.y)); } inline bool cmp(const point &x, const point &y) { double z = cp(x, y, a[1]); if (z > eps) return 1; if (z < -eps) return 0; return dis(x, a[1]) < dis(y, a[1]); } void init() { scanf( %d%lf , &n, &R); for (int i = 1; i <= n; ++i) { scanf( %lf%lf , &a[i].x, &a[i].y); if (a[i].y < a[1].y || (a[i].y < a[1].y + eps && a[i].x < a[1].x)) swap(a[i], a[1]); } sort(a + 2, a + n + 1, cmp); b[m = 1] = a[1]; for (int i = 2; i <= n; ++i) { for (; m > 1 && cp(a[i], b[m], b[m - 1]) > -eps; --m) ; b[++m] = a[i]; } } inline void change(int x, int y) { swap(p[h[x]], p[h[y]]); swap(h[x], h[y]); } void up(int x) { for (; x > 1 && c[h[x]] > c[h[x >> 1]]; x >>= 1) change(x, x >> 1); } void down(int x) { for (int y = x << 1; y <= t; x = y, y = x << 1) { if (y < t && c[h[y]] < c[h[y + 1]]) ++y; if (c[h[x]] < c[h[y]]) change(x, y); else break; } } inline void calc(int x) { point y = b[l[x]], z = b[r[x]]; c[x] = dis(y, z) * dis(b[x], y) * dis(b[x], z) / (2 * abs(cp(y, z, b[x]))); up(p[x]); } inline double count(int x, int y) { double z = 2 * asin(dis(b[x], b[y]) / (2 * R)); return R * R / 2 * (z - sin(z)); } void work() { for (int i = 1; i <= m; ++i) { h[i] = p[i] = i; l[i] = i - 1, r[i] = i + 1; } t = m; l[1] = m; r[m] = 1; for (int i = 1; i <= m; ++i) calc(i); while (c[h[1]] > R) { int i = h[1]; l[r[i]] = l[i]; r[l[i]] = r[i]; change(1, t--); down(1); calc(l[i]); calc(r[i]); } int j = h[1]; double s = count(j, l[j]) + count(j, r[j]); for (int i = r[j]; r[i] != j; i = r[i]) s += abs(cp(b[i], b[r[i]], b[j])) / 2 + count(i, r[i]); printf( %.10lf n , s); } int main() { init(); work(); return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int k; cin >> k; int days[14]; int ones = 0; for (int i = 0; i < 7; i++) { cin >> days[i]; if (days[i]) ones++; days[i + 7] = days[i]; } int ans = 0; int left = 0; if (k % ones == 0) { ans = 7 * (k / ones - 1); left = ones; } else { ans = 7 * (k / ones); left = k % ones; } int c = 0, mini = INT_MAX; for (int i = 0; i < 14; i++) { if (!days[i]) continue; int c = 0, c2 = 0; for (int j = i; j < 14; j++) { if (days[j] == 1) c++; c2++; if (c == left) { mini = min(mini, c2); break; } } } cout << mini + ans << endl; } }

#include <bits/stdc++.h> using namespace std; int n, m, k; int c[10000007]; vector<pair<int, int> > x; int temp; vector<int> vt; int main() { scanf( %d %d %d , &m, &k, &n); for (int i = 0; i < m; i++) { scanf( %d , &temp); c[temp]++; if (c[temp] > n) { printf( -1 n ); return 0; } } for (int i = 0; i < k; i++) { scanf( %d , &temp); x.push_back(make_pair(temp, i)); } sort(x.begin(), x.end()); int cur = 0; int remain = 0; for (int i = 0; i < k; i++) { while (cur <= x[i].first) { remain += n - c[cur]; cur++; } if (remain) { remain--; vt.push_back(x[i].second); } } printf( %d n , vt.size()); for (int i = 0; i < vt.size(); i++) printf( %d , vt[i] + 1); return 0; }

#include <bits/stdc++.h> using namespace std; char a[55][55]; int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0}; int n, T, m; inline int valid(int x, int y) { return x >= 0 && x < n && y >= 0 && y < m; } int cyc[55][55][4][2] = {}; int main(void) { scanf( %d%d , &n, &T); for (int i = 0; i < n; i++) scanf( %s , a[i]); m = strlen(a[0]); int x = 0, y = 0, DP = 0, CP = 0; int Cx = -dy[DP] * (CP ? -1 : 1), Cy = dx[DP] * (CP ? -1 : 1); int Dx = dx[DP], Dy = dy[DP]; for (int step = 1; step <= T; step++) { while (valid(x + Dx, y + Dy) && a[x + Dx][y + Dy] == a[x][y]) x += Dx, y += Dy; while (valid(x + Cx, y + Cy) && a[x + Cx][y + Cy] == a[x][y]) x += Cx, y += Cy; if (cyc[x][y][DP][CP]) { int ii = step - cyc[x][y][DP][CP]; while (step + ii <= T) step += ii; } else cyc[x][y][DP][CP] = step; if (!valid(x + Dx, y + Dy) || a[x + Dx][y + Dy] == 0 ) { if (CP == 0) CP = 1; else if (CP == 1) { DP = (DP + 1) % 4; CP = 0; } Cx = -dy[DP] * (CP ? -1 : 1), Cy = dx[DP] * (CP ? -1 : 1); Dx = dx[DP], Dy = dy[DP]; } else x += Dx, y += Dy; } printf( %c n , a[x][y]); return 0; }

#include <bits/stdc++.h> using namespace std; inline int read() { int f = 1, r = 0; char ch = getchar(); while (!isdigit(ch)) f ^= ch == - , ch = getchar(); while (isdigit(ch)) r = (r << 1) + (r << 3) + (ch ^ 48), ch = getchar(); return f ? r : -r; } const int N = 3005, M = 305; int n, m, cnt[N]; double f[M][N], g[N], d[N], sv[N], siv[N], val[N]; double ans, p[N][M]; inline void upd(int x) { memcpy(g, f[x], sizeof(g)); f[x][0] = 0; for (int i = 1; i <= n; i++) f[x][i] = f[x][i - 1] * (1 - p[i][x]) + g[i - 1] * p[i][x]; cnt[x]++, sv[x] += f[x][n]; siv[x] += f[x][n] * cnt[x]; double E = siv[x] + cnt[x] * (1 - sv[x]); d[x] = E - val[x], val[x] = E; } int main() { n = read(), m = read(); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) p[i][j] = read() / 1000.; for (int i = 1; i <= m; i++) { f[i][0] = 1; for (int j = 1; j <= n; j++) f[i][j] = f[i][j - 1] * (1 - p[j][i]); sv[i] = f[i][n], upd(i); } for (int i = 1; i <= n; i++) { int k = 0; for (int j = 1; j <= m; j++) if (d[k] < d[j]) k = j; if (!k) break; ans += d[k], upd(k); } return printf( %.12lf n , ans), 0; }

#include <bits/stdc++.h> using namespace std; int n, m, a[101], b[101], z[101], x, s, k, i, j; int main() { cin >> n >> m; for (i = 1; i <= n; i++) cin >> a[i]; for (i = 1; i <= m; i++) { cin >> b[i]; s += b[i]; } for (i = 1; i <= n - s + 1; i++) { for (k = i; k <= i + s - 1; k++) z[a[k]]++; for (j = 1; j <= 100; j++) if (z[j] != b[j]) { x = 1; break; } if (x == 0) { cout << YES ; return 0; } x = 0; memset(z, 0, 101 * sizeof(int)); } cout << NO ; return 0; }

#include <bits/stdc++.h> long long cacu(long long l, long long r) { return (r + l) / 2 * ((r - l) / 2 + 1); } int main() { int q, l, r; scanf( %d , &q); while (q--) { long long ans; scanf( %d%d , &l, &r); ans = cacu(l + (l & 1), r - (r & 1)); ans -= cacu(l | 1, r - !(r & 1)); printf( %lld n , ans); } return 0; }

#include <bits/stdc++.h> using namespace std; const double PI = acos(-1); template <typename T> void chmin(T &x, const T &y) { if (x > y) x = y; } template <typename T> void chmax(T &x, const T &y) { if (x < y) x = y; } template <typename T> T gcd(T x, T y) { return y ? gcd(y, x % y) : x; } const int mod = 998244353; template <typename T> void Mod(T &x) { while (x >= mod) x -= mod; } long long qk(long long x, long long y) { long long r = 1; for (; y; y >>= 1) { if (y & 1) r = (r * x) % mod; x = (x * x) % mod; } return r; } map<int, vector<int>> dps; int cal(int a, int b, int c, int d) { int x = d + b - a; if (x < 0) return 0; int k = d + c; chmin(x, k); if (dps.count(k)) return dps[k][x]; auto &dp = dps[k]; dp.resize(k + 1); int t = 0, w = 1; for (int i = 0; i <= k; ++i) { Mod(t += w); dp[i] = t; w = (long long)w * (k - i) % mod; w = (long long)w * qk(i + 1, mod - 2) % mod; } return dp[x]; } void solve(int times) { string s; cin >> s; int n = s.length(); int a = 0, b = 0, c = 0, d = 0; for (int i = 0; i < n; ++i) { if (s[i] == ) ) ++b; else if (s[i] == ? ) ++d; } long long ans = 0; for (int i = 0; i < n; ++i) { if (s[i] == ( ) { ++a; } else if (s[i] == ? ) { ++c; --d; } else if (s[i] == ) ) { --b; } if (s[i] == ( ) { Mod(ans += cal(a, b, c, d)); } else if (s[i] == ? ) { ++a; --c; Mod(ans += cal(a, b, c, d)); ++c; --a; } } cout << ans << endl; } void Init() {} int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int times = 1; { solve(times++); Init(); } return 0; }

#include <bits/stdc++.h> using namespace std; template <class T> inline T gcd(T a, T b) { if (a < 0) return gcd(-a, b); if (b < 0) return gcd(a, -b); return (b == 0) ? a : gcd(b, a % b); } const double EPS = 1e-10; const double PI = acos(-1.0); const int INF = 1 << 29; const int mod = 1000000007; const int MAX_V = 1000 + 10; const int MAX_M = 10000 + 10; const int maxm = 1 + 5; const int maxn = 50000 + 5; int used[20]; int n; int main() { scanf( %d , &n); int i, j, sum = 0, a; memset(used, 0, sizeof(used)); for (int i = 0; i < n; i++) { scanf( %d , &a); sum += a; used[a]++; } if (used[0] == 0) cout << -1 << endl; else { int flag = 0; if (sum % 3 == 1) { if (used[1] + used[4] + used[7]) { for (int i = 1; i <= 7; i += 3) { if (used[i]) { used[i]--, sum -= i; break; } } } else if (used[2] + used[5] + used[8] >= 2) { for (j = 1, i = 2; i <= 8; i += 3) { while (used[i] && j <= 2) used[i]--, sum -= i, j++; } } } if (sum % 3 == 2) { if (used[2] + used[5] + used[8]) { for (i = 2; i <= 8; i += 3) if (used[i]) { used[i]--, sum -= i; break; } } else if (used[1] + used[4] + used[7] >= 2) { for (j = 1, i = 1; i <= 7; i += 3) while (used[i] && j <= 2) used[i]--, sum -= i, j++; } else flag = 1; } if (!flag) { if (used[1] + used[2] + used[3] + used[4] + used[5] + used[6] + used[7] + used[8] + used[9]) { for (i = 9; i >= 0; i--) while (used[i]--) printf( %d , i); printf( n ); } else printf( 0 n ); } else printf( 0 n ); } return 0; }

#include <bits/stdc++.h> using namespace std; int N; list<int> adj[1000005]; int T[1000005]; bool visited[1000005]; bool uniq[1000005]; int rev[10000005]; void dfs(int v) { visited[v] = true; for (list<int>::iterator it = adj[v].begin(); it != adj[v].end(); it++) { if (!visited[*it]) dfs(*it); } } int gcd(int a, int b) { if (b == 0) return a; else return gcd(b, a % b); } int main() { scanf( %d , &N); for (int i = 0; i < (N); i++) scanf( %d , &T[i]); sort(T, T + N); T[N] = -1; for (int i = 0; i < (10000001); i++) rev[i] = N; for (int i = 0; i < (N); i++) rev[T[i]] = i; int temp[3]; int v[3]; for (int i = 1; i <= 5000; i += 2) for (int j = 2; i * i + j * j <= T[N - 1]; j += 2) { if (gcd(i, j) > 1) continue; temp[0] = abs(i * i - j * j); temp[1] = i * i + j * j; temp[2] = 2 * i * j; for (int t = 0; t < (3); t++) v[t] = rev[temp[t]]; for (int u = 0; u < (3); u++) for (int s = 0; s < (u); s++) { if ((T[v[u]] == temp[u]) && (T[v[s]] == temp[s])) { adj[v[u]].push_back(v[s]); adj[v[s]].push_back(v[u]); } } } for (int i = 1; i <= T[N - 1]; i += 2) for (int j = 2; i * j <= T[N - 1]; j += 2) { if (gcd(i, j) > 1) continue; long long int L1 = abs(i * (long long int)i - j * (long long int)j); long long int L2 = 2 * i * j; if (L1 > 10000000 || L2 > 10000000) continue; int v1 = rev[L1]; int v2 = rev[L2]; if ((T[v1] == L1) && (T[v2] == L2)) { adj[v1].push_back(v2); adj[v2].push_back(v1); } } for (int i = 0; i < (N); i++) visited[i] = false; int result = 0; for (int i = 0; i < (N); i++) if (!visited[i]) { result++; dfs(i); } printf( %d n , result); }

#include <bits/stdc++.h> using namespace std; int n; void solve() { if (n <= 3) printf( NO n ); else if (n == 4) { printf( YES n ); printf( 2 * 3 = 6 n ); printf( 6 * 4 = 24 n ); printf( 24 * 1 = 24 n ); } else if (n == 5) { printf( YES n ); printf( 1 + 5 = 6 n ); printf( 3 - 2 = 1 n ); printf( 6 * 1 = 6 n ); printf( 6 * 4 = 24 n ); } else if (n >= 6) { printf( YES n ); printf( 3 - 2 = 1 n ); printf( 1 - 1 = 0 n ); printf( 4 * 6 = 24 n ); printf( 5 * 0 = 0 n ); int i = 7; while (i <= n) { printf( %d * 0 = 0 n , i); i++; } printf( 24 + 0 = 24 n ); } else printf( NO n ); } int main() { while (scanf( %d , &n) != EOF) { solve(); } return 0; }

#include <bits/stdc++.h> using namespace std; const long long INF = LONG_LONG_MAX; const long long NINF = LONG_LONG_MIN; const long long mmod = 1000000007; int32_t main() { long long k; cin >> k; while (k-- > 0) { long long n; cin >> n; string s, t; cin >> s >> t; vector<long long> cnt(26, 0); for (long long i = 0; i < n; i++) { cnt[s[i] - a ]++; cnt[t[i] - a ]++; } bool found = true; for (long long i = 0; i < 26; i++) if (cnt[i] & 1) found = false; if (found) { vector<pair<long long, long long>> ans; for (long long i = 0; i < n - 1; i++) { if (s[i] != t[i]) { bool f = false; for (long long j = i + 1; j < n; j++) { if (t[j] == t[i]) { swap(s[i], t[j]); f = true; ans.emplace_back(i + 1, j + 1); break; } } if (!f) { for (long long j = i + 1; j < n; j++) { if (s[j] == t[i]) { swap(s[j], t[j]); swap(s[i], t[j]); ans.emplace_back(j + 1, j + 1); ans.emplace_back(i + 1, j + 1); break; } } } } } cout << YES << endl; cout << (long long)ans.size() << endl; for (pair<long long, long long> x : ans) cout << x.first << << x.second << endl; } else { cout << No << endl; } } }

#include <bits/stdc++.h> using namespace std; long long p, k; vector<int> v; int main() { cin >> p >> k; v.push_back(p % k); long long a0 = -p / k; while (1) { long long a1 = -a0 / k; while (a1 * k + a0 < 0) a1++; while (a1 * k + a0 >= k) a1--; if (a1 < k && a1 >= 0) { v.push_back(a0 + k * a1); v.push_back(a1); break; } v.push_back(a0 + k * a1); a0 = a1; } while (v.back() == 0) v.pop_back(); printf( %d n , v.size()); for (int i = 0; i < v.size(); ++i) printf( %d , v[i]); }

#include <bits/stdc++.h> using namespace std; long long a[200010]; long long vis[200010]; long long cnt[200010]; long long n; long long max_n = 0; void solve(long long pos) { vis[pos]++; long long temp1 = pos; long long temp2 = pos; long long step1 = 0; long long step2 = 0; while (temp1 <= max_n) { temp1 <<= 1; step1++; vis[temp1]++; cnt[temp1] += step1; } while (temp2) { if ((temp2 & 1) && (temp2 != 1)) { temp2 >>= 1; step2++; vis[temp2]++; cnt[temp2] += step2; long long temp3 = temp2; long long step3 = step2; while (temp3 <= max_n) { temp3 <<= 1; step3++; vis[temp3]++; cnt[temp3] += step3; } } else { temp2 >>= 1; step2++; vis[temp2]++; cnt[temp2] += step2; } } } int main() { scanf( %lld , &n); for (long long i = 1; i <= n; i++) { scanf( %lld , &a[i]); max_n = max(a[i], max_n); } memset(vis, 0, sizeof(vis)); memset(cnt, 0, sizeof(cnt)); for (long long i = 1; i <= n; i++) solve(a[i]); long long ans = 1 << 29; for (long long i = 1; i <= 2 * max_n - 1; i++) { if (vis[i] == n) ans = min(ans, cnt[i]); } printf( %lld n , ans); return 0; }

#include <bits/stdc++.h> int read() { int x = 0, y = 1; char ch = getchar(); while (ch > 9 || ch < 0 ) { if (ch == - ) y = -1; ch = getchar(); } while (ch <= 9 && ch >= 0 ) x = (x << 3) + (x << 1) + ch - 0 , ch = getchar(); return x * y; } void print(int x) { if (x < 0) { putchar( 0 ); return; } if (x < 10) { putchar(x + 0 ); return; } print(x / 10); putchar(x % 10 + 0 ); } int n, x, maxx; int main() { n = read(); for (int _ = 0; _ < n; _++) x = read(), maxx = maxx > x ? maxx : x; print(maxx - 25); return 0; }

#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10; int x, y, tx, ty, vis[N]; int chk(int x, int y) { for (int i = 0; i < 7; i++) vis[i] = 0; for (int i = 1; i <= tx; i++) ++vis[x % 7], x /= 7; for (int i = 1; i <= ty; i++) ++vis[y % 7], y /= 7; for (int i = 0; i < 7; i++) if (vis[i] > 1) return 0; return 1; } int main() { scanf( %d%d , &x, &y), --x, --y; if ((long long)x * y > 6543210) return puts( 0 ), 0; for (int i = x; i; i /= 7) ++tx; for (int i = y; i; i /= 7) ++ty; tx = max(tx, 1), ty = max(ty, 1); int ans = 0; for (int i = 0; i <= x; i++) for (int j = 0; j <= y; j++) ans += chk(i, j); printf( %d n , ans); }

#include <bits/stdc++.h> using namespace std; const int N = 207; const int M = 1507; const int inf = INT_MAX; int nx[M], to[M], head[N], cap[M], fl[M], who[N][N], vis[N], es = 2; int a[N], b[N]; int n, m, s, t, turn = 1; int dfs(int u, int mini) { vis[u] = turn; if (u == t) return mini; for (int e = head[u]; e; e = nx[e]) { int v = to[e]; if (vis[v] != turn && cap[e] - fl[e]) { int k = dfs(v, min(mini, cap[e] - fl[e])); if (k != inf) { fl[e] += k; fl[e ^ 1] -= k; return k; } } } return inf; } int maxflow() { int mf = 0, k; while ((k = dfs(s, inf)) != inf) { turn++; mf += k; } return mf; } int addedge(int u, int v, int _cap) { who[u][v] = es; to[es] = v; nx[es] = head[u]; head[u] = es; cap[es] = _cap; fl[es++] = 0; to[es] = u; nx[es] = head[v]; head[v] = es; cap[es] = 0; fl[es++] = 0; } int main() { scanf( %d %d , &n, &m); for (int i = 0; i < n; i++) scanf( %d , a + i); for (int i = 0; i < n; i++) scanf( %d , b + i); for (int i = 0; i < m; i++) { int u, v; scanf( %d %d , &u, &v); u--; v--; addedge(u, v + n, inf); addedge(v, u + n, inf); } s = 2 * n; t = 2 * n + 1; int sa = 0, sb = 0; for (int i = 0; i < n; i++) { sa += a[i]; sb += b[i]; addedge(i, i + n, inf); addedge(s, i, a[i]); addedge(i + n, t, b[i]); } int res = maxflow(); if (res == sa && res == sb) { printf( YES n ); for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) printf( %d%c , fl[who[i][j + n]], n [j == n - 1]); } else puts( NO ); }

#include <bits/stdc++.h> int main() { int n, t, pos = 0; std::cin >> n >> t; std::vector<std::pair<int, int> > vec; for (int i = 0; i < n; i++) { int x, y; std::cin >> x >> y; vec.push_back(std::make_pair(x, y)); } std::sort(vec.begin(), vec.end()); for (int i = 0; i < n - 1; i++) { int temp = 2 * vec[i + 1].first - 2 * vec[i].first - vec[i + 1].second - vec[i].second; if (temp >= 2 * t) { pos++; } if (temp > 2 * t) { pos++; } } std::cout << pos + 2; return 0; }

#include <bits/stdc++.h> using namespace std; const unsigned long long MOD = 1e8 + 7; const unsigned long long base = 71; const unsigned long long max_n = 2e5 + 400; unsigned long long n, m, k, q; string s; unsigned long long pw[2 * max_n + 200]; unsigned long long save[20][2 * max_n + 200]; unsigned long long seg[10 * max_n], lazy[10 * max_n]; void init(unsigned long long v, unsigned long long b, unsigned long long e) { lazy[v] = -1; if (b == e) { seg[v] = s[b]; return; } unsigned long long mid = (b + e) / 2; init(v << 1, b, mid); init(v << 1 ^ 1, mid + 1, e); seg[v] = (seg[v << 1] * pw[e - mid] + seg[v << 1 ^ 1]) % MOD; } void shift(unsigned long long v, unsigned long long b, unsigned long long e, unsigned long long mid) { if (lazy[v] == -1) return; lazy[v << 1] = lazy[v << 1 ^ 1] = lazy[v]; seg[v << 1] = save[lazy[v]][mid - b]; seg[v << 1 ^ 1] = save[lazy[v]][e - mid - 1]; lazy[v] = -1; } void update(unsigned long long v, unsigned long long b, unsigned long long e, unsigned long long l, unsigned long long r, unsigned long long val) { if (b > r || l > e) return; if (l <= b && e <= r) { seg[v] = save[val][e - b]; lazy[v] = val; return; } unsigned long long mid = (b + e) / 2; shift(v, b, e, mid); update(v << 1, b, mid, l, r, val); update(v << 1 ^ 1, mid + 1, e, l, r, val); seg[v] = (seg[v << 1] * pw[e - mid] + seg[v << 1 ^ 1]) % MOD; } unsigned long long get(unsigned long long v, unsigned long long b, unsigned long long e, unsigned long long l, unsigned long long r) { if (b > r || l > e) return 0; if (l <= b && e <= r) return seg[v]; unsigned long long mid = (b + e) / 2; shift(v, b, e, mid); unsigned long long first = get(v << 1, b, mid, l, r); unsigned long long second = get(v << 1 ^ 1, mid + 1, e, l, r); first = (first * pw[max(0, int(min(r, e) - mid))] + second) % MOD; return first; } int main() { ios_base::sync_with_stdio(false), cin.tie(0); cin >> n >> m >> k; q = m + k; cin >> s; pw[0] = 1; for (unsigned long long i = 1; i < max_n; i++) pw[i] = (pw[i - 1] * base) % MOD; for (unsigned long long i = 0; i < 10; i++) { save[i][0] = i + 48; for (unsigned long long j = 1; j < max_n; j++) save[i][j] = (save[i][j - 1] * base + (i + 48)) % MOD; } init(1, 0, n - 1); while (q--) { unsigned long long type, l, r; cin >> type >> l >> r; l--, r--; if (type == 1) { unsigned long long c; cin >> c; update(1, 0, n - 1, l, r, c); continue; } bool fl = 0; unsigned long long d; cin >> d; if (d == r - l + 1) fl = 1; if (!fl) fl = get(1, 0, n - 1, l, r - d) == get(1, 0, n - 1, l + d, r); if (fl) cout << YES n ; else cout << NO n ; } return 0; }

#include <bits/stdc++.h> using namespace std; const int maxn = 2E5 + 77; void putint(int x) { static bool first = true; if (first) { printf( %d , x); first = false; } else printf( %d , x); } struct QUERY { int t, r; } Q[maxn]; int cnt = 0; int N, M, A[maxn], B[maxn], pb = 0; int main() { scanf( %d%d , &N, &M); for (int i = 0; i < N; ++i) scanf( %d , A + i); for (int i = 0; i < M; ++i) { int t, r; scanf( %d%d , &t, &r); while (cnt && r >= Q[cnt - 1].r) --cnt; if (!cnt || t != Q[cnt - 1].t) Q[cnt++] = (QUERY){t, r}; } Q[cnt] = (QUERY){0, 0}; sort(A, A + Q[0].r); int ptr[2] = {0, Q[0].r - 1}, d = Q[0].t == 1; for (int i = 0; i < cnt; ++i) { for (int j = Q[i].r; j > Q[i + 1].r; --j) { B[pb++] = A[ptr[d]]; ptr[d] += d ? -1 : 1; } d ^= 1; } for (int i = Q[0].r - 1; i >= 0; --i) putint(B[i]); for (int i = Q[0].r; i < N; ++i) putint(A[i]); printf( n ); }

#include <bits/stdc++.h> #pragma comment(linker, /STACK:136777216 ) using namespace std; int bits(int x) { return x == 0 ? 0 : 1 + bits(x & (x - 1)); } const double PI = acos(-1.0); const double eps = 1e-9; const int INF = 1000000000; string nextString() { char buf[1000000]; scanf( %s , buf); return buf; } int dx[] = {0, 1, 0, -1}; int dy[] = {1, 0, -1, 0}; int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); } string month[] = { January , February , March , April , May , June , July , August , September , October , November , December }; int main() { string s = nextString(); int start; for (int(i) = 0; (i) < (12); (i)++) if (s == month[i]) start = i; int n; scanf( %d , &n); int end = (n + start) % 12; printf( %s n , month[end].c_str()); return 0; }

#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; const int mod = (int)1e9 + 7; const long long INF = 1000000000000000000LL; const int WASTE = (int)2e5; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); int t; cin >> t; while (t--) { int x, y, p, q; cin >> x >> y >> p >> q; if (!p) { cout << (x == 0 ? 0 : -1) << n ; continue; } if (p == q) { if (x == y) cout << 0 << n ; else cout << -1 << n ; continue; } int i = (x + p - 1) / p; int i1 = (y - x - p + q - 1) / (q - p); cout << (q * 1LL * max(i, i1) - y) << n ; } return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int T; cin >> T; for (int i = 0; i < T; i++) { long long int n, x; cin >> n >> x; cout << 2 * x << endl; } }

#include <bits/stdc++.h> using namespace std; const int N = 1e3; int n, x[N], d[N], i, j; int main() { cin >> n; for (i = 0; i < n; i++) cin >> x[i] >> d[i]; for (i = 0; i < n; i++) for (j = i + 1; j < n; j++) if (x[i] + d[i] == x[j] && x[j] + d[j] == x[i]) return cout << YES , 0; cout << NO ; return 0; }

#include <bits/stdc++.h> using namespace std; const int N = 205; int n; char s[N]; bool ck(int l, int r) { int a = 0, b = 0, c = 0, d = 0; for (int i = l; i <= r; i++) { if (s[i] == U ) a++; else if (s[i] == D ) b++; else if (s[i] == L ) c++; else d++; } if (a == b && c == d) return 1; else return 0; } int main() { scanf( %d , &n); scanf( %s , s); int ans = 0; for (int i = 0; i < n; i++) for (int j = i; j < n; j++) ans += ck(i, j); cout << ans << endl; return 0; }

#include <bits/stdc++.h> int main() { int n, i; scanf( %d , &n); char s[100]; int a[n], b[n], c[n]; scanf( %s , s); for (i = 0; i < n; i++) { int h = (int)s[i]; a[i] = h - 48; } for (i = 0; i < n; i++) { b[n - i - 1] = a[i]; c[n - i - 1] = a[i]; } i = n - 1; int c1 = 1; while (c1 == 1) { if (b[i] == 1) { c[i] = 0; c1 = 1; i--; } else if (b[i] == 0) { c[i] = 1; c1 = 0; i--; } if (i < 0) break; } int count = 0; for (i = 0; i < n; i++) { if (b[i] != c[i]) count++; } printf( %d n , count); }

#include <bits/stdc++.h> using namespace std; int main() { string x; cin >> x; string ans, in, dec, exp; int flag = 0; for (int i = 0; i < x.length(); i++) { if (x[i] == . ) flag = 1; else if (x[i] == e ) flag = 2; else if (flag == 0) in += x[i]; else if (flag == 1) dec += x[i]; else if (flag == 2) exp += x[i]; } int e = stoi(exp); ans += in; if (e <= dec.length()) { ans += dec.substr(0, e); if (e < dec.length()) { ans += . ; ans += dec.substr(e, dec.length()); } } else { ans += dec; ans += string(e - dec.length(), 0 ); } flag = 0; if (dec.length() < 2 && stoi(dec) == 0 && e == 0) ans = in; cout << ans << endl; }

#include <bits/stdc++.h> using namespace std; const int limN = 2e5 + 5; char s[limN]; char arr[2000]; int bu[400]; int main() { int t; scanf( %d , &t); for (int i = 0; i < t; i++) { scanf( %s , s); for (int j = 0; j < 2000; j++) arr[j] = . ; for (int j = 0; j < 400; j++) bu[j] = 0; int n = strlen(s); int ini = 500; int fin = 500; bool f = true; arr[ini] = s[0]; bu[s[0]]++; int pos = ini; for (int j = 1; j < n; j++) { if (j == 1) { fin++; arr[fin] = s[j]; bu[s[j]]++; pos = fin; continue; } if (arr[pos - 1] == s[j]) { pos--; continue; } if (arr[pos + 1] == s[j]) { pos++; continue; } if (bu[s[j]] > 0) { f = false; break; } else { if (pos == ini) { ini--; arr[ini] = s[j]; bu[s[j]]++; pos--; } else if (pos == fin) { fin++; arr[fin] = s[j]; bu[s[j]]++; pos++; } else { f = false; break; } } } if (!f) { printf( NO n ); } else { printf( YES n ); for (int j = ini; j <= fin; j++) { printf( %c , arr[j]); } for (int j = a ; j <= z ; j++) { if (bu[j] == 0) { printf( %c , j); } } printf( n ); } } return 0; }

#include <bits/stdc++.h> using namespace std; const int Maxv = 110; int n, m; int val[Maxv][Maxv * Maxv]; int org[Maxv][Maxv]; int dp[Maxv][Maxv * Maxv]; int Len[Maxv]; int main() { int i, j, k; cin >> n >> m; for (i = 1; i <= n; i++) { scanf( %d , &Len[i]); for (j = 1; j <= Len[i]; j++) scanf( %d , &org[i][j]); int sum1 = 0; for (j = 0; j <= Len[i]; j++) { int sum2 = 0; sum1 += org[i][j]; for (k = Len[i] + 1; k > j; k--) { sum2 += org[i][k]; int tcost = j + Len[i] + 1 - k; val[i][tcost] = max(sum1 + sum2, val[i][tcost]); } } for (k = m; k >= 1; k--) { for (j = 0; j <= Len[i] && j <= k; j++) { dp[i][k] = max(dp[i][k], dp[i - 1][k - j] + val[i][j]); } } } printf( %d n , dp[n][m]); return 0; }

#include <bits/stdc++.h> using namespace std; long long int n, x, a[100005], ct[100005]; int main() { cin >> n >> x; for (long long int i = 1; i <= n; ++i) cin >> a[i], ct[a[i]]++; sort(a + 1, a + n + 1); long long int ans = 0; for (long long int i = 1; i <= n; ++i) { long long int ch = x ^ a[i]; if (ch == a[i]) { ans += (ct[ch] - 1); } else if (ch <= 100000) ans += ct[ch]; } cout << ans / 2; }

#include <bits/stdc++.h> using namespace std; using namespace std; int main() { long long a, b; cin >> a >> b; if (a < b) puts( -1 ); else printf( %.12f n , (a + b) / (2. * ((a + b) / (2 * b)))); return 0; }

#include <bits/stdc++.h> using namespace std; const int Mod = (int)1e9 + 7; const int MX = 1073741822; const long long MXLL = 4e18; const int Sz = 1110111; inline void Read_rap() { ios_base ::sync_with_stdio(0); cin.tie(0); cout.tie(0); } inline void randomizer3000() { unsigned int seed; asm( rdtsc : =A (seed)); srand(seed); } void files(string problem) { if (fopen((problem + .in ).c_str(), r )) { freopen((problem + .in ).c_str(), r , stdin); freopen((problem + .out ).c_str(), w , stdout); } } void localInput(const char in[] = s ) { if (fopen(in, r )) { freopen(in, r , stdin); } else cerr << Warning: Input file not found << endl; } int n; const int N = 302; int pref[N][N]; int dp[N][N]; int a[N]; int plen[N], len[N]; int main() { Read_rap(); cin >> n; for (int i = 1; i <= n; i++) { static string s; cin >> s; static map<string, int> id; if (!id.count(s)) id[s] = (int)(id.size()); a[i] = id[s]; len[i] = (int)(s.size()); } for (int i = n; i >= 1; i--) for (int j = n; j >= 1; j--) if (a[i] == a[j]) pref[i][j] = pref[i + 1][j + 1] + 1; for (int i = 1; i <= n; i++) plen[i] = plen[i - 1] + len[i]; for (int i = 1; i <= n; i++) { for (int j = 1; j <= i; j++) { int len = i - j + 1; for (int p = len; p < j; p++) { int q = p - len + 1; if (pref[j][q] >= len) dp[i][j] = max(dp[i][j], dp[p][q] + 1); } } } int ans = 0; for (int i = 1; i <= n; i++) { for (int j = 1; j <= i; j++) { int len = i - j + 1; if (dp[i][j]) { int cost = len - 1 + plen[i] - plen[j - 1] - len; ans = max(ans, cost * (dp[i][j] + 1)); } } } int sum = accumulate(len + 1, len + n + 1, 0) + n - 1; cout << sum - ans; return 0; }

#include <bits/stdc++.h> using namespace std; long long n; long long ask(long long a, long long b, long long c, long long d) { long long res; cout << ? << a << << b << << c << << d << endl; cout.flush(); cin >> res; return res; } int main() { ios_base::sync_with_stdio(false); cin >> n; long long x1 = -1; long long x2 = -1; long long y1 = -1; long long y2 = -1; for (int i = 1; i < n; i++) { if (ask(i, 1, i, n) % 2 == 1) { if (x1 == -1) x1 = i; else { x2 = i; break; } } } if (x1 == -1) { for (int i = 1; i < n; i++) { if (ask(1, i, n, i) % 2 == 1) { if (y1 == -1) y1 = i; else { y2 = i; break; } } } if (y2 == -1) y2 = n; long long low = 1; long long high = n; x1 = n; while (low <= high) { long long mid = (low + high) / 2; if (ask(low, y1, mid, y1) % 2 == 1) { high = mid - 1; x1 = min(x1, mid); } else { low = mid + 1; } } x2 = x1; } else { if (x2 == -1) x2 = n; long long low = 1; long long high = n; y1 = n; while (low <= high) { long long mid = (low + high) / 2; if (ask(x1, low, x1, mid) % 2 == 1) { y1 = min(y1, mid); high = mid - 1; } else { low = mid + 1; } } low = 1; high = n; y2 = n; while (low <= high) { long long mid = (low + high) / 2; if (ask(x2, low, x2, mid) % 2 == 1) { y2 = min(y2, mid); high = mid - 1; } else { low = mid + 1; } } } cout << ! << x1 << << y1 << << x2 << << y2 << endl; cout.flush(); return 0; }

#include <bits/stdc++.h> using namespace std; int x[111111]; int y[111111]; int main() { int i, n, m, t; long long xx = 0, yy = 0; scanf( %d , &n); for (i = 1; i <= n; i++) { scanf( %d , &t); x[t] = i; y[t] = n - i + 1; } scanf( %d , &m); for (i = 1; i <= m; i++) { scanf( %d , &t); xx += x[t]; yy += y[t]; } cout << xx << << yy << endl; return 0; }

#include <bits/stdc++.h> using namespace std; template <typename T> inline T abs(T t) { return t < 0 ? -t : t; } const unsigned long long modn = 1000000007; inline unsigned long long mod(unsigned long long x) { return x % modn; } const int MAX = 100009; int deg[MAX], ok[MAX]; vector<int> adj[MAX]; void dfs(int u, int p) { if (deg[u] > 3) return; ok[u]++; if (deg[u] == 3) return; for (int v : adj[u]) if (v != p) dfs(v, u); } int main() { int i, n, a, b; scanf( %d , &n); for (i = 0; i < n - 1; i++) { scanf( %d %d , &a, &b); adj[--a].push_back(--b); adj[b].push_back(a); deg[a]++; deg[b]++; } for (i = 0; i < n; i++) if (deg[i] == 1) dfs(i, -1); for (i = 0; i < n; i++) if (deg[i] == 3 && ok[i] <= 1) ok[i] = 0; for (i = 0; i < n; i++) { if (ok[i]) continue; int ct = 0; for (int v : adj[i]) if (!ok[v]) ct++; if (ct > 2) break; } if (i < n) puts( No ); else puts( Yes ); }

#include <bits/stdc++.h> using namespace std; const int maxn = 3e5 + 5; int n; pair<long long, long long> a[maxn + 1]; pair<long long, long long> b; priority_queue<long long, vector<long long>, greater<long long> > q; bool cmp(pair<long long, long long> a, pair<long long, long long> b) { return a > b; } int main() { int ans; scanf( %d n , &n); for (int i = 1; i <= n; i++) { scanf( %lld%lld , &a[i - 1].first, &a[i - 1].second); } b = a[0]; sort(a + 1, a + n, cmp); int i = 1; for (; i <= n && a[i].first > b.first; i++) q.push(a[i].second - a[i].first + 1); ans = i; int lans = 0; while (!q.empty()) { long long k = q.top(); q.pop(); if (k > b.first) break; b.first -= k; lans++; for (; i <= n && a[i].first > b.first; i++) q.push(a[i].second - a[i].first + 1); ans = min(ans, i - lans); } printf( %d n , ans); return 0; }

#include <bits/stdc++.h> using namespace std; int acc[1002], s[1002]; int main() { int n, t; cin >> n; for (int i = 0; i < n; i++) { cin >> t; s[t]++; } for (int i = 1; i < 1002; i++) { acc[i] = acc[i - 1] + s[i]; } int d; cin >> d; int total = 0; for (int i = d + 1; i < 1002; i++) { if (acc[i] - acc[i - d - 1] > total) total = acc[i] - acc[i - d - 1]; } cout << total << endl; return 0; }

#include <bits/stdc++.h> int main() { std::map<long, long> map; long q, id, leftMAX = 0, rightMAX = 0, firstTime = 0; char c; std::cin >> q; while (q--) { std::cin >> c >> id; if (!firstTime--) { map.insert(std::pair<long, long>(id, 0)); } else { if (c == ? ) std::cout << std::min(map[id] - leftMAX, rightMAX - map[id]) << std::endl; else if (c == R ) map.insert(std::pair<long, long>(id, ++rightMAX)); else map.insert(std::pair<long, long>(id, --leftMAX)); } } }

#include <bits/stdc++.h> using namespace std; #pragma warning(disable : 4996) vector<int> up, down; int main() { int T, n; char ch; scanf( %d , &T); while (T--) { scanf( %d , &n); up.clear(); down.clear(); for (int i = 1; i < n; i += 2) { printf( ? %d %d n , i, i + 1); fflush(stdout); cin >> ch; if (ch == < ) down.push_back(i), up.push_back(i + 1); else down.push_back(i + 1), up.push_back(i); } if (n & 1) down.push_back(n), up.push_back(n); int Min = down[0], Max = up[0]; for (int i = 1; i < down.size(); i++) { printf( ? %d %d n , Min, down[i]); fflush(stdout); cin >> ch; if (ch == > ) Min = down[i]; } for (int i = 1; i < up.size(); i++) { printf( ? %d %d n , Max, up[i]); fflush(stdout); cin >> ch; if (ch == < ) Max = up[i]; } printf( ! %d %d n , Min, Max); fflush(stdout); } }

#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } long long lcm(long a, long b) { return ((a * b) / gcd(a, b)); } long long a[100000]; int main() { long long i, j, k, l, m, n, maxx = 0, g = 0; cin >> n; for (i = 0; i < n; i++) { cin >> a[i]; } sort(a, a + n); for (i = 0; i < n; i++) { while (a[i] % 2 == 0) { a[i] /= 2; } while (a[i] % 3 == 0) { a[i] /= 3; } } sort(a, a + n); if (a[0] == a[n - 1]) cout << Yes << endl; else cout << NO << endl; return 0; }

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); long long a, b, c; cin >> a >> b >> c; if (a > b) swap(a, b); cout << a + min(c, a + b) + min(b, a + c); return 0; }

#include <bits/stdc++.h> using namespace std; void read(long long &x) { scanf( %lld , &x); } void read(long long &x, long long &y) { scanf( %lld%lld , &x, &y); } void read(long long &x, long long &y, long long &z) { scanf( %lld%lld%lld , &x, &y, &z); } void print(long long x) { printf( %lld , x); } void println(long long x) { printf( %lld n , x); } const long long N = 300100; long long q, n, a[N], ans, b[N], sz; int main() { cin >> q; for (; q--;) { read(n); for (long long i = 1; i <= n; i++) read(a[i]); sort(a + 1, a + n + 1); sz = 0; for (long long i = 1; i <= n; i++) if (i == 1 || a[i] != a[i - 1]) b[++sz] = a[i]; reverse(b + 1, b + sz + 1); for (long long i = 1; i <= sz; i++) a[i] = b[i]; n = sz; ans = a[1]; for (long long i = 1; i <= min(59LL, n); i++) for (long long j = i + 1; j <= (i + 59LL, n); j++) if (a[i] % a[j] != 0) ans = max(ans, a[i] + a[j]), j = n; for (long long i = 1; i <= min(59LL, n); i++) { if (i + 2 <= n && a[i] + a[i + 1] + a[i + 2] <= ans) break; for (long long j = i + 1; j <= (i + 59LL, n); j++) if (a[i] % a[j] != 0) { if (j < n && a[i] + a[j] + a[j + 1] <= ans) break; for (long long k = j + 1; k <= min(j + 59LL, n); k++) if (a[i] % a[k] != 0 && a[j] % a[k] != 0) ans = max(ans, a[i] + a[j] + a[k]), k = n; } } println(ans); } }

#include <bits/stdc++.h> using namespace std; template <typename A> ostream &operator<<(ostream &cout, vector<A> const &v); template <typename A, typename B> ostream &operator<<(ostream &cout, pair<A, B> const &p) { return cout << ( << p.first << , << p.second << ) ; } template <typename A> ostream &operator<<(ostream &cout, vector<A> const &v) { cout << [ ; for (int i = 0; i < v.size(); i++) { if (i) cout << , ; cout << v[i]; } return cout << ] ; } template <typename A, typename B> istream &operator>>(istream &cin, pair<A, B> &p) { cin >> p.first; return cin >> p.second; } mt19937_64 rng(std::chrono::steady_clock::now().time_since_epoch().count()); void usaco(string filename) { freopen((filename + .in ).c_str(), r , stdin); freopen((filename + .out ).c_str(), w , stdout); } const long double pi = 3.14159265358979323846; long long n, m, q, k, l, r, x, y, z; const long long template_array_size = 1e6 + 16318; long long a[template_array_size]; long long b[template_array_size]; long long c[template_array_size]; string second, t; long long ans = 0; string op[5005]; string val[5005]; pair<long long, long long> dep[5005]; map<string, long long> rev; long long dp[5005]; long long check(long long x, long long p, long long t) { if (x == -1) return t; if (dp[x] != -1) return dp[x]; if (op[x] == = ) return dp[x] = val[x][p] - 0 ; else if (op[x] == OR ) return dp[x] = check(dep[x].first, p, t) | check(dep[x].second, p, t); else if (op[x] == AND ) return dp[x] = check(dep[x].first, p, t) & check(dep[x].second, p, t); else return dp[x] = check(dep[x].first, p, t) ^ check(dep[x].second, p, t); } void solve(int tc = 0) { cin >> n >> m; string v; getline(cin, v); rev[ ? ] = -1; for (long long i = 0; i < n; i++) { vector<string> x; getline(cin, v); istringstream is(v); while (is >> v) { x.push_back(v); } rev[x[0]] = i; if (x.size() == 3) { op[i] = = ; val[i] = x[2]; } else { op[i] = x[3]; dep[i] = {rev[x[2]], rev[x[4]]}; } } string rmin = , rmax = ; for (long long i = 0; i < m; i++) { long long c0 = 0, c1 = 0; memset(dp, -1, sizeof(dp)); for (long long j = 0; j < n; j++) { c0 += check(j, i, 0); } memset(dp, -1, sizeof(dp)); for (long long j = 0; j < n; j++) { c1 += check(j, i, 1); } if (c0 == c1) { rmin += 0 ; rmax += 0 ; } else if (c0 < c1) { rmin += 0 ; rmax += 1 ; } else { rmin += 1 ; rmax += 0 ; } } cout << rmin << n << rmax << n ; } int main() { { ios_base::sync_with_stdio(false); } { cin.tie(NULL); } cout << setprecision(15) << fixed; int tc = 1; for (int t = 0; t < tc; t++) solve(t); }

#include <bits/stdc++.h> using namespace std; int main() { int i, pos, n, cnt, sz, dummy; vector<int> ans; long long k, tot = 0, examine[100005], temp; scanf( %d %I64d , &n, &k); for (i = 0; i < n; ++i) { scanf( %I64d , &examine[i]); tot += examine[i]; } if (tot < k) printf( -1 n ); else if (tot == k) printf( n ); else { dummy = n; while (k > (long long)n) { temp = k / (long long)n; k = k % (long long)n; cnt = 0; for (i = 0; i < dummy; ++i) { if (examine[i] != 0) { if ((long long)examine[i] <= temp) { k += (long long)(temp - (long long)examine[i]); examine[i] = 0; ++cnt; } else examine[i] -= temp; } } n -= cnt; } pos = 0; if (k != 0) { while (k != 0) { if (examine[pos] > 0) { --examine[pos]; --k; } ++pos; } } for (i = pos; i < dummy; ++i) if (examine[i] > 0) ans.push_back(i + 1); for (i = 0; i < pos; ++i) if (examine[i] > 0) ans.push_back(i + 1); sz = ans.size(); for (i = 0; i < (sz - 1); ++i) printf( %d , ans[i]); printf( %d n , ans[sz - 1]); } return 0; }

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); int n; cin >> n; string s; cin >> s; long long l = s.length(); bool visit[256]; memset(visit, false, sizeof(visit)); int dis = 0, i; for (i = 0; i < l; i++) { if (!visit[s[i]]) { visit[s[i]] = true; dis++; } } if (dis == 1) { cout << ((l * (l + 1)) / 2) % 998244353; return 0; } int s_cnt = 1, e_cnt = 1; i = 1; int j = l - 2; for (; i < l; i++) { if (s[i] == s[0]) s_cnt++; else break; } for (; j >= 0; j--) { if (s[j] == s[n - 1]) e_cnt++; else break; } if (s[0] != s[l - 1]) { cout << (e_cnt + s_cnt + 1) % 998244353; } else { cout << (long long)((long long)(s_cnt + 1) % 998244353 * (long long)(e_cnt + 1) % 998244353) % 998244353; } return 0; }

#include <bits/stdc++.h> using namespace std; long long n, a[1000009], m, ans, mx, b[1000009]; int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> b[i]; if (n % 2 == 0) { if (i <= n / 2) a[b[i] + (n / 2 - i)]++; else a[b[i] + (i - (n / 2) - 1)]++; } else { if (i <= n / 2 + 1) a[b[i] + (n / 2 + 1 - i)]++; else a[b[i] + (i - (n / 2 + 1))]++; } } for (int i = 1; i < 1000009; i++) { if (n % 2 == 0 && i - n / 2 >= 0) mx = max(mx, a[i]); else if (n % 2 == 1 && i - (n / 2 + 1) >= 0) mx = max(mx, a[i]); } cout << n - mx; return 0; }

#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; const int Nmax = 100005; int count_one(vector<int> s) { int ct = 0; int i = 0; while (i < s.size()) { if (s[i] == 1) ++ct; ++i; } return ct; } int count_zero(string s, int index) { int i = 0; int ct = 0; while (s[i] != 1 && i < s.length()) { ++ct; ++i; } } int gcd(int a, int b) { if (a == 0) { return b; } return gcd(b % a, a); } bool isPrime(int n) { for (int i = 2; i <= sqrt(n); i++) if (n % i == 0) return 0; return 1; } void binaryRepresentation(int x) { for (int i = 31; i >= 0; i--) { if (x & (1 << i)) cout << 1 ; else cout << 0 ; } } void DFS(vector<vector<int> > &adj, int u, vector<bool> &visit, vector<int> &dist, vector<int> &freq) { visit[u] = true; for (int i = 0; i < adj[u].size(); i++) { int x = adj[u][i]; if (!visit[x]) { dist[x] = dist[u] + 1; freq[u]++; DFS(adj, adj[u][i], visit, dist, freq); } } } bool check(string a, string b) { vector<int> first(26, 0); vector<int> second(26, 0); for (int i = 0; i < a.length(); i++) { first[a[i] - a ]++; second[b[i] - a ]++; } if (first != second) return false; else return true; } long long combination(long long n, long long r) { if (r == n || r == 0) { return 1; } return combination(n - 1, r - 1) + combination(n - 1, r); } bool cmp(const pair<int, int> &a, const pair<int, int> &b) { if (a.second == b.second) return a.first < b.first; return a.second > b.second; } int main() { ios_base::sync_with_stdio(false); long long n, k; cin >> n >> k; vector<int> ar(n); map<long long, long long> right; map<long long, long long> left; for (long long i = 0; i < n; i++) { cin >> ar[i]; } long long ans = 0; for (long long i = n - 1; i >= 0; i--) { ans += right[ar[i] * k]; right[ar[i]] += left[ar[i] * k]; left[ar[i]]++; } cout << ans << n ; return 0; }

#include <bits/stdc++.h> using namespace std; const unsigned long long base = 133; unsigned long long hash1[200005][26], hash2[200005][26], Pow[200005]; int n, m; char str1[200005], str2[200005]; int main() { scanf( %d%d , &n, &m); scanf( %s%s , str1 + 1, str2 + 1); Pow[0] = 1; for (int i = 1; i <= n; i++) { Pow[i] = Pow[i - 1] * base; } for (int i = 0; i < 26; i++) { for (int j = 1; j <= n; j++) { hash1[j][i] = hash1[j - 1][i] * base + (str1[j] - a == i); } } for (int i = 0; i < 26; i++) { for (int j = 1; j <= m; j++) { hash2[j][i] = hash2[j - 1][i] * base + (str2[j] - a == i); } } vector<int> vec; for (int i = 1; i <= n - m + 1; i++) { int cnt = 0; for (int x = 0; x < 26; x++) { if (cnt != x) break; for (int y = 0; y < 26; y++) { if (hash2[m][x] == hash1[i + m - 1][y] - hash1[i - 1][y] * Pow[m]) { if (hash2[m][y] == hash1[i + m - 1][x] - hash1[i - 1][x] * Pow[m]) { cnt++; break; } } } } if (cnt == 26) vec.push_back(i); } int sz = vec.size(); printf( %d n , sz); for (int i = 0; i < sz; i++) { printf( %d , vec[i]); } return 0; }

#include <bits/stdc++.h> using namespace std; long long n, m, i, j, y, s, ans; char a[2222][2222]; int l[2222][2222], r[2222][2222], u[2222][2222], d[2222][2222]; pair<pair<int, int>, int> st[2444444]; bool f[2222][2222]; int main() { ios_base::sync_with_stdio(0); cin >> n >> m; for (i = 1; i <= n; i++) for (j = 1; j <= m; j++) cin >> a[i][j]; for (i = 1; i <= n; i++) for (j = 1; j <= m; j++) if (a[i][j] == * ) l[i][j] = l[i][j - 1] + 1; else l[i][j] = 0; for (i = 1; i <= n; i++) for (j = m; j >= 1; j--) if (a[i][j] == * ) r[i][j] = r[i][j + 1] + 1; else r[i][j] = 0; for (j = 1; j <= m; j++) for (i = 1; i <= n; i++) if (a[i][j] == * ) u[i][j] = u[i - 1][j] + 1; else u[i][j] = 0; for (j = m; j >= 1; j--) for (i = n; i >= 1; i--) if (a[i][j] == * ) d[i][j] = d[i + 1][j] + 1; else d[i][j] = 0; for (i = 1; i <= n; i++) for (j = 1; j <= m; j++) if (a[i][j] == * ) { s = min(min(r[i][j + 1], l[i][j - 1]), min(u[i - 1][j], d[i + 1][j])); if (s > 0) { st[++ans] = {{i, j}, s}; for (y = j - s; y <= j + s; y++) f[i][y] = 1; for (y = i - s; y <= i + s; y++) f[y][j] = 1; } } for (i = 1; i <= n; i++) for (j = 1; j <= m; j++) if (a[i][j] == * && f[i][j] == 0) { cout << -1 << n ; return 0; } cout << ans << n ; for (i = 1; i <= ans; i++) cout << st[i].first.first << << st[i].first.second << << st[i].second << n ; return 0; }

#include <bits/stdc++.h> using namespace std; const long long N = 1e5 + 5, INF = -1e9; long long down[N], mx[N], up[N], dp[N], sum[N]; unordered_map<long long, vector<long long>> mp[N]; long long n, m, pre[N], suf[N], ans[N]; vector<pair<long long, long long>> adj[N]; bool mark[N]; void dfs_down(long long u, long long par) { down[u] = up[u] = mark[u] ? 0 : INF; for (auto x : adj[u]) { long long v = x.first, w = x.second; if (v == par) continue; dfs_down(v, u); mp[u][down[v] + w].push_back(v); down[u] = max(down[u], down[v] + w); } pre[0] = suf[adj[u].size() - 1] = INF; for (long long i = 0; i < adj[u].size(); i++) { long long v = adj[u][i].first, w = adj[u][i].second; pre[i + 1] = v ^ par ? max(pre[i], down[v] + w) : pre[i]; } for (long long i = adj[u].size() - 1; i; i--) { long long v = adj[u][i].first, w = adj[u][i].second; suf[i - 1] = v ^ par ? max(suf[i], down[v] + w) : suf[i]; } for (long long i = 0; i < adj[u].size(); i++) if (adj[u][i].first ^ par) mx[adj[u][i].first] = max(suf[i], pre[i]); } void dfs_up(long long u, long long par) { for (auto x : adj[u]) { long long v = x.first, w = x.second; if (v == par) continue; up[v] = max(up[v], max(up[u], mx[v]) + w); dfs_up(v, u); } } void dfs1(long long u, long long par) { if (mark[u] && up[u] > down[u]) dp[u]++; for (auto x : adj[u]) { long long v = x.first, w = x.second; if (v == par) continue; dfs1(v, u); ans[u] += dp[v]; if (up[u] > mx[v]) dp[u] += dp[v]; if (up[u] < mx[v]) { long long sz = mp[u][mx[v]].size(); if (down[v] + w == mx[v]) sz--; if (sz ^ 1) continue; for (long long s : mp[u][mx[v]]) if (s ^ v) sum[s] += dp[v]; } } } void dfs2(long long u, long long par) { if (mark[u] && down[u] > up[u]) sum[u]++; if (mp[u][down[u]].size() == 1) sum[mp[u][down[u]][0]] += sum[u]; for (auto x : adj[u]) if (x.first ^ par) dfs2(x.first, u); ans[u] += sum[u]; } inline void read_input() { cin >> n >> m; for (long long i = 0; i < m; i++) { long long v; cin >> v; mark[--v] = true; } for (long long i = 1; i < n; i++) { long long u, v, w; cin >> u >> v >> w; adj[--u].push_back({--v, w}); adj[v].push_back({u, w}); } } inline void solve() { dfs_down(0, 0); dfs_up(0, 0); dfs1(0, 0); dfs2(0, 0); } inline void write_output() { long long mx = 0, cnt = 0; for (long long u = 0; u < n; u++) { if (mark[u]) continue; if (mx < ans[u]) { mx = ans[u]; cnt = 0; } if (mx == ans[u]) cnt++; } cout << mx << << cnt << endl; } int32_t main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); read_input(), solve(), write_output(); return 0; }

#include <bits/stdc++.h> #pragma GCC optimize( -O2 ) using namespace std; void err(istream_iterator<string> it) { cerr << endl; } template <typename T, typename... Args> void err(istream_iterator<string> it, T a, Args... args) { cerr << *it << = << a << t ; err(++it, args...); } template <typename T1, typename T2> ostream& operator<<(ostream& c, pair<T1, T2>& v) { c << ( << v.first << , << v.second << ) ; return c; } template <template <class...> class TT, class... T> ostream& operator<<(ostream& out, TT<T...>& c) { out << { ; for (auto& x : c) out << x << ; out << } ; return out; } const int LIM = 1e5 + 5, MOD = 1e9 + 7; int t, n, m, k, x, y; struct Gaussbase2 { int numofbits = 31; int rk = 0; vector<int> Base; Gaussbase2() { Base.assign(numofbits, 0); } Gaussbase2& operator=(Gaussbase2& g) { for (int i = 0; i < numofbits; i++) Base[i] = g.Base[i]; rk = g.rk; } bool canbemade(int x) { for (int i = numofbits - 1; i >= 0; i--) x = min(x, x ^ Base[i]); return x == 0; } void Add(int x) { for (int i = numofbits; i >= 0; i--) { if ((x >> i) & 1) { if (!Base[i]) { Base[i] = x; rk++; return; } else x ^= Base[i]; } } } } g; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n; int tot = 0; for (int i = 0; i < n; i++) { cin >> x; tot ^= x; g.Add(x); } if (tot == 0) cout << -1 << n ; else cout << g.rk << n ; return 0; }

#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; const int N = 2e5 + 555; int n, m, q, z; pair<long long, int> a[N]; int qt[N]; long long ql[N], qr[N]; long long ans[N]; vector<pair<int, int> > ed[N]; long long bl[N], br[N], arin[N]; int f[N * 20]; const int iu = 18; int lg[N * 2]; long long st[N][iu], nid[N][iu]; long long sh[N][iu]; void adde(int u, int v, int t) { ed[t].push_back({u, v}); } void add(int id, int l, int r) { int duh = lg[r - l + 1]; int e = r - (1 << duh) + 1; st[l][duh] = max(st[l][duh], min(arin[id], sh[l][duh])); st[e][duh] = max(st[e][duh], min(arin[id], sh[e][duh])); adde(id, nid[l][duh], min(arin[id], sh[l][duh])); adde(id, nid[e][duh], min(arin[id], sh[e][duh])); } int find(int x) { if (f[x] != x) f[x] = find(f[x]); return f[x]; } void join(int x, int y) { x = find(x); y = find(y); f[x] = y; } int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n >> q; for (int i = 2; i < 262144; i++) lg[i] = lg[i / 2] + 1; a[++m] = {-1, -q - 1}; a[++m] = {1LL << n, q + 1}; for (int i = 1; i <= q; i++) { string s; cin >> s >> ql[i] >> qr[i]; if (s[0] == b ) qt[i] = 1; else qt[i] = 2; if (qt[i] == 1) { a[++m] = {ql[i], -i}; a[++m] = {qr[i], i}; } } sort(a + 1, a + m + 1); for (int i = 1; i < m; i++) { long long cl = a[i].first + (i % 2); long long cr = a[i + 1].first - (i % 2); int cc; if (i % 2 == 1) cc = q + 1; else cc = -a[i].second; if (cl > cr) continue; if (cl == cr) { bl[++z] = cl; br[z] = cr; arin[z] = cc; } else { long long fk = cl ^ cr; while (fk != (fk & -fk)) fk ^= fk & -fk; long long mid = cl | (fk - 1); bl[++z] = cl; br[z] = mid; arin[z] = cc; bl[++z] = mid + 1; br[z] = cr; arin[z] = cc; } } int ptr = z; for (int j = 0; j < iu; j++) { for (int i = 1; i <= z; i++) { nid[i][j] = ++ptr; if (j == 0) sh[i][j] = arin[i]; else if (i + (1 << (j - 1)) <= z) { sh[i][j] = max(sh[i][j - 1], sh[i + (1 << (j - 1))][j - 1]); } } } for (int i = 1; i <= z; i++) { for (int k = n - 1; k >= 0; k--) { long long cl, cr; bool die = false; if (br[i] - bl[i] + 1 > (1LL << k)) { cr = bl[i] | ((1LL << (k + 1)) - 1); cl = cr ^ ((1LL << (k + 1)) - 1); die = true; } else { cl = bl[i] ^ (1LL << k); cr = br[i] ^ (1LL << k); } int zl = lower_bound(br + 1, br + z + 1, cl) - br; int zr = lower_bound(bl + 1, bl + z + 1, cr + 1) - bl - 1; add(i, zl, zr); if (die) break; } adde(i, nid[i][0], arin[i]); } for (int j = iu - 2; j >= 0; j--) { for (int i = 1; i <= z; i++) { st[i][j] = max(st[i][j], st[i][j + 1]); adde(nid[i][j], nid[i][j + 1], min(st[i][j + 1], sh[i][j])); if (i > (1 << j)) { st[i][j] = max(st[i][j], st[i - (1 << j)][j + 1]); adde(nid[i][j], nid[i - (1 << j)][j + 1], min(st[i - (1 << j)][j + 1], sh[i][j])); } } } for (int i = 1; i <= ptr; i++) f[i] = i; for (int i = q + 1; i >= 1; i--) { for (auto c : ed[i]) join(c.first, c.second); if (qt[i] == 2) { int cl = lower_bound(br + 1, br + z + 1, ql[i]) - br; int cr = lower_bound(br + 1, br + z + 1, qr[i]) - br; ans[i] = find(cl) == find(cr); } } for (int i = 1; i <= q; i++) { if (qt[i] == 2) cout << ans[i] << n ; } }

#include <bits/stdc++.h> using namespace std; int a[100010]; int main() { int t; cin >> t; while (t--) { int n; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); int i = (n - 1) / 2, j = i + 1; while (i >= 0 || j <= n - 1) { if (i >= 0) cout << a[i--] << ; if (j <= n - 1) cout << a[j++] << ; } cout << endl; } return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int n, m; int aray[100007]; while (scanf( %d %d , &n, &m) != EOF) { for (int i = 1; i < n; i++) { scanf( %d , &aray[i]); } int sum = 0, i = 1; bool flag = false; while (true) { sum = (i + aray[i]); i = sum; if (sum == m) { flag = true; break; } if (sum > m) { break; } } (flag) ? printf( YES n ) : printf( NO n ); } return 0; }

#include <bits/stdc++.h> using namespace std; const int inf = 1e9 + 333; const long long linf = 1e18 + inf; const int LEN = 6e5 + 5; int n, m, q, len; char str[LEN], s[LEN]; int a[LEN], st[LEN], nd[LEN], suf[LEN], ord[LEN], lcp[LEN], w[LEN], root[LEN], L[LEN], R[LEN]; pair<pair<int, int>, int> C[LEN]; long long cnt[LEN]; void add(int x, char str[]) { int m = strlen(str); s[++len] = # ; st[x] = len + 1; for (int i = 0; i < m; i++) s[++len] = str[i]; nd[x] = len; } int f(int x) { if (x == root[x]) return x; return root[x] = f(root[x]); } void merge(int x, int y) { x = f(x); y = f(y); if (x == y) return; root[y] = x; cnt[x] += cnt[y]; L[x] = min(L[x], L[y]); R[x] = max(R[x], R[y]); } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %s , str); add(i, str); } for (int i = 1; i <= n; i++) scanf( %d , a + i); for (int i = 1; i <= len; i++) suf[i] = s[i]; for (int it = 1; it < len; it *= 2) { for (int j = 1; j <= len; j++) { C[j] = make_pair(pair<int, int>(suf[j], suf[min(j + it, len + 1)]), j); } sort(C + 1, C + len + 1); for (int j = 1; j <= len; j++) { suf[C[j].second] = suf[C[j - 1].second] + (C[j].first != C[j - 1].first); } } for (int i = 1; i <= len; i++) ord[suf[i]] = i; for (int i = 1; i <= len; i++) { } int j = 0; for (int i = 1; i <= len; i++) { if (suf[i] == 1) continue; while (i + j <= len and ord[suf[i] - 1] + j <= len and s[i + j] == s[ord[suf[i] - 1] + j] and s[i + j] != # ) j++; lcp[suf[i]] = j; if (j) j--; } for (int i = 1; i <= len; i++) { assert(s[ord[i] + lcp[i]] != s[ord[i - 1] + lcp[i]] or s[ord[i] + lcp[i]] == # ); } for (int i = 1; i <= len; i++) { } memset(w, -1, sizeof(w)); for (int i = 1; i <= n; i++) { for (int j = st[i]; j <= nd[i]; j++) { w[suf[j]] = i; } } for (int i = 1; i <= len; i++) { if (w[i] != -1) cnt[i] = a[w[i]]; L[i] = R[i] = root[i] = i; } vector<pair<int, int> > vs; for (int i = 1; i <= len; i++) { vs.push_back(pair<int, int>(lcp[i], i)); } sort(vs.begin(), vs.end()); long long ans = 0; for (int i = 1; i <= n; i++) { int x = suf[st[i]]; if (nd[i] - st[i] + 1 > lcp[x] and nd[i] - st[i] + 1 > lcp[x + 1]) { ans = max(ans, (long long)a[i] * (nd[i] - st[i] + 1)); } } for (int it = len - 1; it >= 0; it--) { int l = vs[it].first, x = vs[it].second; merge(x, x - 1); x = f(x); if (lcp[L[x]] < l and lcp[R[x] + 1] < l) ans = max(ans, cnt[f(x)] * l); } printf( %lld n , ans); return 0; }

#include <bits/stdc++.h> using namespace std; int n, s, ll, v[100011]; int dp[100011]; const int oo = 1 << 28; int seg[400001]; int at, l, r; void add(int n, int s, int e) { if (at < s || at > e || s > e) return; if (s == e) { seg[n] = dp[s]; return; } add(n * 2, s, (s + e) / 2); add(n * 2 + 1, (s + e) / 2 + 1, e); seg[n] = min(seg[n * 2], seg[n * 2 + 1]); } int get(int n, int s, int e) { if (l > e || r < s || l > r || s > e) return oo; if (s >= l && e <= r) return seg[n]; return min(get(n * 2, s, (s + e) / 2), get(n * 2 + 1, (s + e) / 2 + 1, e)); } int main() { scanf( %d%d%d , &n, &s, &ll); for (int i = 1; i <= n; ++i) scanf( %d , v + i); set<pair<int, int> > q; int E = n; for (int i = n; i > 0; --i) { dp[i] = oo; q.insert(make_pair(v[i], i)); while ((--q.end())->first - q.begin()->first > s) { q.erase(make_pair(v[E], E)); --E; } l = i + ll; r = E + 1; if (r >= l) { if (r == n + 1) dp[i] = 1; else dp[i] = min(dp[i], 1 + get(1, 1, n)); } at = i; add(1, 1, n); } if (dp[1] > 500000) dp[1] = -1; printf( %d n , dp[1]); return 0; }

#include <bits/stdc++.h> using namespace std; const int N = 2e3 + 10; const int mod = 1e9 + 7; int read() { int x = 0, f = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) f = -1; c = getchar(); } while (c >= 0 && c <= 9 ) x = (x << 1) + (x << 3) + c - 0 , c = getchar(); return x * f; } int inc(int x, int y) { return (x + y >= mod) ? (x + y - mod) : (x + y); } int del(int x, int y) { return (x - y < 0) ? (x - y + mod) : (x - y); } int qpow(int a, int x, int mo) { int res = 1; while (x) { if (x & 1) res = 1ll * res * a % mo; a = 1ll * a * a % mod; x >>= 1; } return res; } vector<pair<int, int> > g[N]; long long dp[N][N]; map<int, long long> mp; int q[N]; int main() { int n = read(), m = read(), Q = read(); for (int i = 0; i < m; i++) { int u = read(), v = read(), w = read(); g[u].push_back(make_pair(v, w)); g[v].push_back(make_pair(u, w)); } for (int i = 0; i <= m; i++) for (int j = 1; j <= n; j++) dp[i][j] = -2e18; dp[0][1] = 0; int ans = 0; for (int i = 1; i <= m; i++) { long long res = 0; for (int j = 1; j <= n; j++) for (int t = 0; t < g[j].size(); t++) { pair<int, int> now = g[j][t]; int u = now.first, v = j; dp[i][u] = max(dp[i - 1][v] + now.second, dp[i][u]); if (i == m) mp[now.second] = max(dp[i - 1][v] + now.second, mp[now.second]); res = max(res, dp[i][u]); } ans = inc(ans, res % mod); } vector<pair<int, int> > p; for (auto it : mp) { p.push_back(it); } int head = 1, tail = 0; int Inv2 = qpow(2, mod - 2, mod); for (int i = 0; i < p.size(); i++) { while (head <= tail && p[q[tail]].second <= p[i].second) tail--; q[++tail] = i; } Q -= m; int cnt = 0; int pre = 1; for (int i = 2; i <= tail; i++) { pair<int, int> now = p[q[pre]]; pair<int, int> nxt = p[q[i]]; bool ok = 1; long long k = (now.second - nxt.second) / (nxt.first - now.first); for (int j = i + 1; j <= tail; j++) { pair<int, int> o = p[q[j]]; if ((now.second - o.second) / (o.first - now.first) <= k) { ok = 0; break; } } k -= cnt; if (k <= 0 || ok == 0) continue; if (Q <= k) k = Q; ans = inc(ans, inc(1ll * k * (1 + k) % mod * Inv2 % mod * now.first % mod, 1ll * (now.second + 1ll * cnt * now.first % mod) % mod * k % mod)); Q -= k; cnt += k; pre = i; if (Q == 0) break; } pair<int, int> now = p[q[tail]]; if (Q > 0) ans = inc(ans, inc(1ll * Q * (1 + Q) % mod * Inv2 % mod * now.first % mod, 1ll * (now.second + 1ll * cnt * now.first % mod) % mod * Q % mod)); printf( %d n , ans); }

#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int maxn = 1e6 + 5; long long int power(long long int base, long long int exp) { long long int res = 1; while (exp) { if (exp % 2) res *= base; base *= base; res %= mod; base %= mod; exp /= 2; } return res; } long long int x[2], y[2], val[2]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int i, n, a, b, c; for (long long int j = 0; j < 2; j++) cin >> x[j] >> y[j]; cin >> n; long long int ans = 0; for (i = 1; i <= n; i++) { cin >> a >> b >> c; for (long long int j = 0; j < 2; j++) { val[j] = -1; if (a * x[j] + b * y[j] + c > 0) val[j] = 1; } if (val[1] > 0 && val[0] < 0) ans++; if (val[1] < 0 && val[0] > 0) ans++; } cout << ans; return 0; }

#include <bits/stdc++.h> using namespace std; int const bound = 1e6 + 2, N = 2e5 + 1; long long OO = 1e18; double eps = 1e-6; int oo = 1e9, mod = 1e9 + 7; int n, m, s, app[N][2]; pair<int, int> par[N][2]; vector<int> adj[N], rev[N]; queue<pair<int, int> > q; int vis[N]; void buildpath() { puts( Win ); int cur = s, c = 1; while (cur != -1) { printf( %d , cur); pair<int, int> ne = par[cur][c]; cur = ne.first; c = ne.second; } } bool cyc(int u) { vis[u] = 2; for (auto v : rev[u]) { if (vis[v] == 2) return 1; if (!vis[v] && cyc(v)) return 1; } vis[u] = 1; return 0; } int main() { scanf( %d%d , &n, &m); for (int(i) = 1; (i) <= (n); (i)++) { int sz; scanf( %d , &sz); if (!sz) { q.push({i, 0}); app[i][0] = 1; par[i][0] = {-1, -1}; } while (sz--) { int a; scanf( %d , &a); adj[a].push_back(i); rev[i].push_back(a); } } scanf( %d , &s); while (!q.empty()) { pair<int, int> cur = q.front(); q.pop(); for (auto v : adj[cur.first]) { int cost = cur.second + 1; int md = cost % 2; if (app[v][md]) continue; app[v][md] = 1; par[v][md] = {cur.first, cur.second}; if (v == s && md) { buildpath(); return 0; } q.push({v, cost % 2}); } } if (cyc(s)) { puts( Draw ); return 0; } puts( Lose ); return 0; }

#include <bits/stdc++.h> using namespace std; int dp[25][25][5], ans, n, t; int main() { cin >> n >> t; for (int i = 1; i <= 4; i++) for (int j = i + 1; j <= 4; j++) dp[2][1][j]++; for (int i = 3; i <= n; i++) for (int j = 1; j <= t * 2; j++) for (int k = 1; k <= 4; k++) { if (j & 1) for (int l = 1; l < k; l++) dp[i][j][k] += dp[i - 1][j][l] + dp[i - 1][j - 1][l]; else for (int l = k + 1; l <= 4; l++) dp[i][j][k] += dp[i - 1][j][l] + dp[i - 1][j - 1][l]; } for (int i = 1; i <= 4; i++) ans += dp[n][t * 2][i]; cout << ans; return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int t, n; cin >> t; while (t--) { cin >> n; int a = 0, b = 0, k = 2; for (int i = 0; i < n / 2 - 1; i++) { a += k; k *= 2; } for (int i = 0; i < n / 2; i++) { b += k; k *= 2; } a += k; cout << abs(a - b) << endl; } }

#include <bits/stdc++.h> using namespace std; int k, t, state[16]; unordered_map<unsigned long long, long long> M[10]; unsigned long long tobeull(int state[]) { int tmp[16] = { 0, }; unsigned long long ret = 0; for (int i = 0; i < 16; i++) tmp[i] = state[i]; sort(tmp, tmp + 16); for (int i = 0; i < 16; i++) { ret |= (tmp[i] << (i * 4)); } return ret; } long long dp(int len, int state[]) { if (len == 0) { return 1; } auto it = M[len].emplace(tobeull(state), 0); if (it.second) { long long ret = 0; for (int i = 0; i < 16; i++) { if (state[i] == t) continue; state[i]++; ret += dp(len - 1, state); state[i]--; } it.first->second = ret; return it.first->second; } else return it.first->second; } int main() { scanf( %d %d , &k, &t); if (k <= 15) { printf( %lx , k); return 0; } int mylen = 1; state[15]++; long long rem = 0; while (1) { long long key = dp(mylen - 1, state) * (long long)15; if (rem + key >= k) { break; } else rem += key; ++mylen; } int st = 1; state[15] = 0; for (int digit = 1; digit <= mylen; digit++) { long long rem = 0; if (st == 1) { state[15] = 1; for (int ite = mylen - 2; ite >= 0; ite--) rem += dp(ite, state) * (long long)15; state[15] = 0; } for (int num = st; num < 16; num++) { if (state[num] == t) continue; state[num]++; long long cnt = dp(mylen - digit, state); if (rem + cnt >= k) { printf( %x , num); break; } else { rem += cnt; state[num]--; } } k -= rem; st = 0; } }

#include <bits/stdc++.h> using namespace std; void solve() { int n, ans = -2; cin >> n; vector<int> v(n); for (auto &a : v) cin >> a; vector<int> max_ele_index; int maxx = 0; for (auto a : v) maxx = max(a, maxx); for (int i = 0; i < n; i++) if (v[i] == maxx) max_ele_index.push_back(i); if (v[0] == maxx and v[1] != maxx) { cout << 1 << n ; return; } if (v[0] != maxx and v[1] == maxx) { cout << 2 << n ; return; } if (v[n - 1] == maxx and v[n - 2] != maxx) { cout << n << n ; return; } for (int i = 1; i < n - 1; i++) if (v[i] == maxx and (v[i - 1] != maxx or v[i + 1] != maxx)) { ans = i; break; } cout << ans + 1 << n ; } int main() { int t; cin >> t; while (t--) solve(); }

#include <bits/stdc++.h> using namespace std; int a[5100], b[5100]; long long c[5100]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; b[i] = a[i]; } sort(b, b + n); for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) { int d = b[j] - a[i]; if (d > 0) c[j] = min(c[j - 1], d + c[j]); else c[j] -= d; } long long ans = c[0]; while (--n) if (ans > c[n]) ans = c[n]; cout << ans << endl; }

#include <bits/stdc++.h> using namespace std; const int MOD = 1000 * 1000 * 1000 + 7; const int INF = 2000 * 1000 * 1000; const double EPS = 1e-9; const double pi = acos(-1.0); template <typename T> inline T sqr(T n) { return (n * n); } long long gcd(int a, int b) { while (a && b) { a %= b; swap(a, b); } return a + b; } struct Point { long long x, y; Point() {} Point(int x, int y) : x(x), y(y) {} Point(const Point& a) { *this = a; } Point operator-(const Point& a) const { return Point(x - a.x, y - a.y); } inline long long dist() { return sqr(x) + sqr(y); } bool operator<(const Point& p1) const { return (x < p1.x || (x == p1.x && y < p1.y)); } }; struct Line { long long a, b, c; Line() {} inline void normalize() { if (a < 0 || (a == 0 && b < 0)) { a *= -1; b *= -1; c *= -1; } long long g = gcd(gcd(abs(a), abs(b)), abs(c)); if (g > 1) { a /= g; b /= g; c /= g; } } Line(int aa, int bb, int cc) { a = aa, b = bb, c = cc; normalize(); } Line(const Point& p1, const Point& p2) { a = p2.y - p1.y; b = p1.x - p2.x; c = p1.y * p2.x - p1.x * p2.y; normalize(); } }; const int maxn = 300010; vector<pair<Point, int> > v[maxn]; vector<int> vec[maxn]; map<long long, int> position; vector<Point> tmp[maxn]; Point center[2000]; long long rad[2000]; long long get_hash(const Line& l) { long long a = l.a + 50000; long long b = l.b + 50000; long long c = l.c + 2000000000; long long ret = c * 2000000000LL; ret += a * 100000; ret += b; return ret; } void prepare(int pos) { vector<pair<Point, int> >& cur = v[pos]; sort((cur).begin(), (cur).end()); vec[pos].resize(cur.size()); int cnt = 0; for (size_t i = 0; i < cur.size(); i++) { if (cur[i].second == 0) cnt++; else cnt--; vec[pos][i] = cnt; } } long long get_ans(const Point& p1, const Point& p2) { Line cur(p1, p2); Point mid((p1.x + p2.x) / 2, (p1.y + p2.y) / 2); Point norm(cur.a, cur.b); norm.x += mid.x; norm.y += mid.y; cur = Line(mid, norm); long long h = get_hash(cur); if (!position.count(h)) return 0; int pos = position[h]; int q = upper_bound((v[pos]).begin(), (v[pos]).end(), make_pair(mid, 1)) - v[pos].begin() - 1; if (q != -1) return vec[pos][q]; return 0; } int main() { int n, m; scanf( %d%d , &n, &m); Point p1, p2; int sz = 0; for (int i = 0; i < n; i++) { scanf( %I64d%I64d%I64d%I64d , &p1.x, &p1.y, &p2.x, &p2.y); p1.x *= 2, p1.y *= 2; p2.x *= 2, p2.y *= 2; Line cur(p1, p2); long long h = get_hash(cur); int pos = 0; if (position.count(h)) pos = position[h]; else { pos = sz++; position[h] = pos; } v[pos].push_back(make_pair(p1, (p1 < p2) ? 0 : 2)); v[pos].push_back(make_pair(p2, (p1 < p2) ? 2 : 0)); } for (int i = 0; i < sz; i++) prepare(i); long long ans = 0; for (int i = 0; i < m; i++) { scanf( %I64d%I64d%I64d , &center[i].x, &center[i].y, &rad[i]); center[i].x *= 2; center[i].y *= 2; rad[i] *= 2; for (size_t j = 0; j < tmp[rad[i]].size(); j++) { if ((center[i] - tmp[rad[i]][j]).dist() > 4 * sqr(rad[i])) ans += get_ans(center[i], tmp[rad[i]][j]); } tmp[rad[i]].push_back(center[i]); } printf( %I64d , ans); return 0; }

#include <bits/stdc++.h> #pragma hdrstop #pragma argsused using namespace std; int main(int argc, char* argv[]) { int i, j, resp, resn, resv, resl, res, n, a, b; vector<int> x, y; scanf( %d , &n); for (i = 0; i < n; i++) { scanf( %d %d , &a, &b); x.push_back(a); y.push_back(b); } res = 0; for (i = 0; i < n; i++) { resv = 0; resn = 0; resp = 0; resl = 0; for (j = 0; j < n; j++) { if (i != j) { if (x[i] == x[j] && y[i] > y[j]) resn++; else if (x[i] == x[j] && y[i] < y[j]) resv++; else if (x[i] > x[j] && y[i] == y[j]) resl++; else if (x[i] < x[j] && y[i] == y[j]) resp++; } if (resp != 0 && resl != 0 && resv != 0 && resn != 0) { res++; break; } } } printf( %d , res); return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int n; long long d; cin >> n >> d; vector<long long> v; long long x; for (int i = 0; i < n; i++) { cin >> x; v.push_back(x); } int count = 0; for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { if (v[i] - v[j] >= 0 && v[i] - v[j] <= d) count++; else if (v[j] - v[i] >= 0 && v[j] - v[i] <= d) count++; } } cout << count * 2 << endl; return 0; }

#include <bits/stdc++.h> using namespace std; int n, k; long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } long long lcm(long long a, long long b) { return a * b / gcd(a, b); } int main() { ios::sync_with_stdio(false); cin.tie(NULL); cin >> n >> k; vector<int> c(n); for (int &x : c) cin >> x; long long cur = 1; for (int &x : c) { cur = gcd(k, lcm(cur, x)); } if (cur == k) { cout << Yes n ; } else { cout << No n ; } return 0; }

#include <bits/stdc++.h> #pragma GCC optimize(2) #pragma GCC optimize(3) #pragma GCC optimize( Ofast ) #pragma GCC optimize( inline ) #pragma GCC optimize( -fgcse ) #pragma GCC optimize( -fgcse-lm ) #pragma GCC optimize( -fipa-sra ) #pragma GCC optimize( -ftree-pre ) #pragma GCC optimize( -ftree-vrp ) #pragma GCC optimize( -fpeephole2 ) #pragma GCC optimize( -ffast-math ) #pragma GCC optimize( -fsched-spec ) #pragma GCC optimize( unroll-loops ) #pragma GCC optimize( -falign-jumps ) #pragma GCC optimize( -falign-loops ) #pragma GCC optimize( -falign-labels ) #pragma GCC optimize( -fdevirtualize ) #pragma GCC optimize( -fcaller-saves ) #pragma GCC optimize( -fcrossjumping ) #pragma GCC optimize( -fthread-jumps ) #pragma GCC optimize( -funroll-loops ) #pragma GCC optimize( -fwhole-program ) #pragma GCC optimize( -freorder-blocks ) #pragma GCC optimize( -fschedule-insns ) #pragma GCC optimize( inline-functions ) #pragma GCC optimize( -ftree-tail-merge ) #pragma GCC optimize( -fschedule-insns2 ) #pragma GCC optimize( -fstrict-aliasing ) #pragma GCC optimize( -fstrict-overflow ) #pragma GCC optimize( -falign-functions ) #pragma GCC optimize( -fcse-skip-blocks ) #pragma GCC optimize( -fcse-follow-jumps ) #pragma GCC optimize( -fsched-interblock ) #pragma GCC optimize( -fpartial-inlining ) #pragma GCC optimize( no-stack-protector ) #pragma GCC optimize( -freorder-functions ) #pragma GCC optimize( -findirect-inlining ) #pragma GCC optimize( -fhoist-adjacent-loads ) #pragma GCC optimize( -frerun-cse-after-loop ) #pragma GCC optimize( inline-small-functions ) #pragma GCC optimize( -finline-small-functions ) #pragma GCC optimize( -ftree-switch-conversion ) #pragma GCC optimize( -foptimize-sibling-calls ) #pragma GCC optimize( -fexpensive-optimizations ) #pragma GCC optimize( -funsafe-loop-optimizations ) #pragma GCC optimize( inline-functions-called-once ) #pragma GCC optimize( -fdelete-null-pointer-checks ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt,tune=native ) using namespace std; struct node { int next, to; } w[2000010]; int n, m, cnt = 1, ans[1000005], h[1000005], top, ln, op, c[1000005], dfn[1000005], timer, bj[1000005], v[1000005], id[2000005]; const int MAX_SIZE = 1 << 21; char *l, *r, buf[MAX_SIZE]; inline int gc() { if (l == r) if (l == (r = (l = buf) + fread(buf, 1, MAX_SIZE, stdin))) return -1; return *l++; } inline void read(int &x) { register char c = gc(); for (; c < 48 || c > 57; c = gc()) ; for (x = 0; c > 47 && c < 58; c = gc()) x = (x << 3) + (x << 1) + (c ^ 48); } inline void write(int x) { if (x > 9) write(x / 10); putchar(x % 10 + 0 ); } void add(int x, int y, int z) { cnt++; w[cnt].to = y; w[cnt].next = h[x]; id[cnt] = z; h[x] = cnt; } inline void DFS1(int u, int co, int tag) { register int i; c[u] = co; dfn[u] = ++timer; for (i = h[u]; i; i = w[i].next) { if (i == (tag ^ 1)) { continue; } int e = w[i].to; if (c[e] == 0) { DFS1(e, 3 - co, i); } else { if (dfn[u] < dfn[e]) { continue; } if (c[u] == c[e]) { op++; ln = i; bj[u]++; bj[e]--; } else { bj[u]--; bj[e]++; } } } } inline void DFS2(int u, int tag) { register int i; v[u] = 1; for (i = h[u]; i; i = w[i].next) { if (i == (tag ^ 1)) continue; int e = w[i].to; if (v[e] == 0) { DFS2(e, i); bj[u] += bj[e]; } } if (bj[u] == op) { top++; ans[top] = tag; } } int main() { register int i, x, y; read(n); read(m); for (i = 1; i <= m; i++) { read(x); read(y); if (x == y) { op++; add(0, 0, i); ln = cnt; continue; } add(x, y, i); add(y, x, i); } for (i = 1; i <= n; i++) { if (c[i] == 0) { DFS1(i, 1, 0); } } for (i = 1; i <= n; i++) { if (v[i] == 0) { DFS2(i, 0); } } if (op == 0) { write(m); putchar( n ); for (i = 1; i <= m; i++) { write(i); putchar( ); } } else { if (op == 1) { top++; ans[top] = ln; } write(top); putchar( n ); sort(ans + 1, ans + 1 + top); for (i = 1; i <= top; i++) { write(id[ans[i]]); putchar( ); } } }

#include <bits/stdc++.h> using namespace std; char s[1111][1111]; int d[1111][1111]; queue<pair<int, int> > Q; vector<pair<int, int> > v; int n, m, lim; int dx[4] = {1, 0, -1, 0}; int dy[4] = {0, 1, 0, -1}; void check(int x, int y, int z) { if (x < 0 || x >= n || y < 0 || y >= m) return; if (s[x][y] == T ) return; if (s[x][y] == S ) lim = z; d[x][y] = z; if ( 0 <= s[x][y] && s[x][y] <= 9 ) v.push_back(make_pair(s[x][y] - 0 , z)); s[x][y] = T ; Q.push(make_pair(x, y)); } int main() { scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) scanf( %s , s[i]); for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) if (s[i][j] == E ) Q.push(make_pair(i, j)); while (!Q.empty()) { pair<int, int> now = Q.front(), tmp; Q.pop(); for (int dir = 0; dir < 4; dir++) check(now.first + dx[dir], now.second + dy[dir], d[now.first][now.second] + 1); } int ans = 0; for (vector<pair<int, int> >::iterator ii = v.begin(); ii != v.end(); ii++) if (ii->second <= lim) ans += ii->first; cout << ans << endl; return 0; }

#include <bits/stdc++.h> using namespace std; struct less_key { bool operator()(pair<double, int64_t> p1, pair<double, int64_t> p2) { return (p1.first > p2.first) || ((p1.first == p2.first) && (p1.second < p2.second)); } }; struct pair_hash { std::size_t operator()(const pair<int64_t, int64_t>& k) const { return static_cast<size_t>(k.first ^ k.second); } }; const int64_t mod = 100000000007ll; const int64_t inf = 10000000000000007ll; const double eps = 0.00000001; int64_t n, k; string s; int64_t amin[256]; int64_t amax[256]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> n >> k; cin >> s; for (int64_t i = 0; i < s.size(); i++) { if (!amin[s[i]]) { amin[s[i]] = i + 1; } amax[s[i]] = i + 1; } set<pair<int64_t, int64_t> > q; for (int64_t i = A ; i <= Z ; i++) { if (amin[i]) { q.insert({amin[i], 0}); q.insert({amax[i], 1}); } } int64_t z = 0; for (auto i : q) { if (i.second) { z--; } else { z++; } if (z > k) { cout << YES << endl; return 0; } } cout << NO << endl; return 0; }

#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; int main() { int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } map<vector<int>, int> S; for (int bit = 0; bit < (1 << 15); bit++) { vector<int> b(n); for (int i = 0; i < n; i++) { int c = a[i] ^ bit; for (int j = 0; j < 15; j++) { if (c & (1 << j)) b[i]++; } } vector<int> vec(n - 1); for (int i = 1; i < n; i++) { vec[i - 1] = b[i] - b[0]; } S[vec] = bit; } for (int bit = 0; bit < (1 << 15); bit++) { vector<int> b(n); for (int i = 0; i < n; i++) { int c = a[i] ^ (bit << 15); for (int j = 15; j < 30; j++) { if (c & (1 << j)) b[i]++; } } vector<int> vec(n - 1); for (int i = 1; i < n; i++) { vec[i - 1] = b[0] - b[i]; } if (S.find(vec) != S.end()) { cout << (bit << 15) + S[vec] << endl; return 0; } } cout << -1 << endl; }

#include <bits/stdc++.h> using namespace std; int main() { int a, b, c; cin >> a >> b >> c; int Time = 0; a -= 2; int Turn = 2; while (a > 0 || b > 0 || c > 0) { if (Turn == 1) { Time++; a -= 2; Turn = 2; } else if (Turn == 2) { Time++; b -= 2; Turn = 3; } else if (Turn == 3) { Time++; c -= 2; Turn = 1; } } Time += 30; cout << Time; }

#include <bits/stdc++.h> using namespace std; int gcd(int x, int y) { if (x == 0) return y; return gcd(y % x, x); } int main() { int n, m, x, g; cin >> n >> m >> x; g = x - 1; for (int i = 1; i < n; ++i) { scanf( %d , &x); g = gcd(g, x - 1); } set<int> second; int d = 1; while (d * d <= g) { if (g % d == 0) { for (int p = 1; p * d <= m; p *= 2) second.insert(p * d); for (int p = 1; p * (g / d) <= m; p *= 2) second.insert(p * (g / d)); } ++d; } long long ans = 0; for (set<int>::iterator it = second.begin(); it != second.end(); it++) ans += m - (*it); cout << ans; return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, f[6]; cin >> a >> b >> c; f[0] = a + b + c; f[1] = a + b * c; f[2] = a * b + c; f[3] = a * b * c; f[4] = (a + b) * c; f[5] = a * (b + c); sort(f, f + 6); cout << f[5]; return 0; }

#include <bits/stdc++.h> using namespace std; vector<long long int> ar[100005]; long long int vis[100005]; long long int mi; long long int val[100005]; void dfs(long long int a) { vis[a] = 1; mi = min(val[a], mi); for (auto it : ar[a]) { if (vis[it] == 0) { dfs(it); } } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int n, i, m, a, b, sum = 0; cin >> n >> m; for (i = 1; i <= n; i++) cin >> val[i]; for (i = 1; i <= m; i++) { cin >> a >> b; ar[a].push_back(b); ar[b].push_back(a); } for (i = 1; i <= n; i++) { if (vis[i] == 0) { mi = INT_MAX; dfs(i); sum = sum + mi; } } cout << sum << n ; return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int n; int arr[10] = {0}; string s; cin >> n >> s; for (int i = 0; i < n; i++) arr[s[i] - 0 ]++; if ((arr[1] || arr[2] || arr[3]) && (arr[7] || arr[0] || arr[9]) && (((arr[1] || arr[4] || arr[7]) && (arr[3] || arr[6] || arr[9])) || arr[0])) cout << YES ; else cout << NO n ; }

#include <bits/stdc++.h> using namespace std; using namespace std; const int INF = 1000000000; const int inf = INF; struct Edge { int from, to, cap, flow, index; Edge(int from, int to, int cap, int flow, int index) : from(from), to(to), cap(cap), flow(flow), index(index) {} }; struct Dinic { int N; vector<vector<Edge> > G; vector<Edge *> dad; vector<int> Q; Dinic(int N) : N(N), G(N), dad(N), Q(N) {} void AddEdge(int from, int to, int cap) { G[from].push_back(Edge(from, to, cap, 0, G[to].size())); if (from == to) G[from].back().index++; G[to].push_back(Edge(to, from, 0, 0, G[from].size() - 1)); } long long BlockingFlow(int s, int t) { fill(dad.begin(), dad.end(), (Edge *)NULL); dad[s] = &G[0][0] - 1; int head = 0, tail = 0; Q[tail++] = s; while (head < tail) { int x = Q[head++]; for (int i = 0; i < G[x].size(); i++) { Edge &e = G[x][i]; if (!dad[e.to] && e.cap - e.flow > 0) { dad[e.to] = &G[x][i]; Q[tail++] = e.to; } } } if (!dad[t]) return 0; long long totflow = 0; for (int i = 0; i < G[t].size(); i++) { Edge *start = &G[G[t][i].to][G[t][i].index]; int amt = INF; for (Edge *e = start; amt && e != dad[s]; e = dad[e->from]) { if (!e) { amt = 0; break; } amt = min(amt, e->cap - e->flow); } if (amt == 0) continue; for (Edge *e = start; amt && e != dad[s]; e = dad[e->from]) { e->flow += amt; G[e->to][e->index].flow -= amt; } totflow += amt; } return totflow; } long long GetMaxFlow(int s, int t) { long long totflow = 0; while (long long flow = BlockingFlow(s, t)) totflow += flow; return totflow; } }; struct node { int r, c, t; node() {} node(int r, int c, int t) : r(r), c(c), t(t) {} }; vector<node> qm, qf; node read() { int r, c, t; cin >> r >> c >> t; r--; c--; return node(r, c, t); } const int MAXN = 25; const int MAXT = 600; char mat[MAXN][MAXN]; int n, m, male, female; int id[MAXN][MAXN]; int dis[MAXT][MAXT]; int main() { cin >> n >> m >> male >> female; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) cin >> mat[i][j]; if (male < female) qm.push_back(read()); else qf.push_back(read()); for (int i = 0; i < male; i++) qm.push_back(read()); for (int i = 0; i < female; i++) qf.push_back(read()); if (male < female) male++; else female++; if (male != female) { cout << -1 << endl; return 0; } int tot = 0; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) if (mat[i][j] == . ) id[i][j] = tot++; for (int i = 0; i < tot; i++) for (int j = 0; j < tot; j++) dis[i][j] = (i == j) ? 0 : inf; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) if (mat[i][j] == . ) for (int ii = 0; ii < n; ii++) for (int jj = 0; jj < m; jj++) if (mat[ii][jj] == . && abs(i - ii) + abs(j - jj) == 1) dis[id[i][j]][id[ii][jj]] = 1; for (int k = 0; k < tot; k++) for (int i = 0; i < tot; i++) for (int j = 0; j < tot; j++) dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]); long long lo = 0, hi = 1LL << 60, ans = -1; while (lo <= hi) { long long mid = (lo + hi) / 2; Dinic res(male + female + 2 * tot + 2); for (int i = 0; i < (int)qm.size(); i++) { int index = id[qm[i].r][qm[i].c]; for (int j = 0; j < tot; j++) if (dis[index][j] != inf && (long long)dis[index][j] * qm[i].t <= mid) res.AddEdge(i, male + j, 1); } for (int j = 0; j < tot; j++) res.AddEdge(male + j, male + tot + j, 1); for (int j = 0; j < tot; j++) for (int k = 0; k < (int)qf.size(); k++) { int index = id[qf[k].r][qf[k].c]; if (dis[index][j] != inf && (long long)dis[index][j] * qf[k].t <= mid) res.AddEdge(male + tot + j, male + tot + tot + k, 1); } int source = male + tot + tot + female; int sink = source + 1; for (int i = 0; i < male; i++) res.AddEdge(source, i, 1); for (int i = 0; i < female; i++) res.AddEdge(male + tot + tot + i, sink, 1); if (res.GetMaxFlow(source, sink) == male) ans = mid, hi = mid - 1; else lo = mid + 1; } cout << ans << endl; return 0; }

#include <bits/stdc++.h> using namespace std; int x[505], r[505]; int main() { int i; x[0] = 0; r[0] = 1000000; double dd; int d; for (i = 1; i <= 300; i++) { r[i] = 300 - i + 1; dd = 2 * sqrt(double(r[i - 1])) * sqrt(double(r[i])); d = int(dd + 3); x[i] = x[i - 1] + d; } x[301] = x[300] + 10000; r[301] = 1000000; printf( 302 ); for (i = 0; i < 302; i++) { printf( n%d %d , x[i], r[i]); } return 0; }

#include <bits/stdc++.h> using namespace std; int a[200000 + 1]; int n; int b[200000 + 1]; int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; b[a[i]] = 0; } int max = -1; int k = 0; int numb; for (int i = n; i > 0; i--) { k = 0; if (b[a[i]] == 0) { b[a[i]] = 1; k = n - i; } if (k > max) { max = k; numb = a[i]; } } cout << numb; return 0; }

#include <bits/stdc++.h> using namespace std; const int modulo = 1000000009; long long A(int events, int days) { if (events < days) return 0; long long result = 1; for (int e = events - 1; e >= days; --e) { result *= e; result %= modulo; } for (int i = 0; i < days; i++) { result *= events; result %= modulo; --events; } return result; } int main() { int n, w, b; scanf( %i%i%i , &n, &w, &b); long long result = 0; for (int i = 2; i < n; i++) { result += ((i - 1) * A(w, i)) % modulo * A(b, n - i); result %= modulo; } printf( %i n , (int)result); return 0; }

#include <bits/stdc++.h> using namespace std; double p[100005], e1[100005], e2[100005]; int main() { int n; scanf( %d , &n); for (register int i = 1; i <= n; ++i) scanf( %lf , p + i); for (register int i = 1; i <= n; ++i) { e1[i] = (e1[i - 1] + 1) * p[i]; e2[i] = e2[i - 1] + (e1[i - 1] + e1[i - 1] + 1) * p[i]; } printf( %.15lf , e2[n]); return 0; }

#include <bits/stdc++.h> using namespace std; const int MAXN = (int)3e3 + 5; const int INF = (int)1e9; const string T = aeiou ; int dp[MAXN], par[MAXN]; bool space[MAXN]; bool vowel[256]; string s; int n; bool bad(char a, char b, char c) { if (a == b && b == c) { return 0; } if (!vowel[a] && !vowel[b] && !vowel[c]) { return 1; } return 0; } void solve() { cin >> s; n = s.size(); s = # + s; for (char c : T) { vowel[c] = 1; } for (int i = 1; i <= n; ++i) { dp[i] = INF; } for (int l = 1; l <= n; ++l) { bool good = 1; for (int r = l; r <= n; ++r) { if (r - 2 >= l && bad(s[r - 2], s[r - 1], s[r])) { good = 0; break; } if (dp[l - 1] + 1 < dp[r]) { dp[r] = dp[l - 1] + 1; par[r] = l - 1; } } } for (int v = n; v > 0; v = par[v]) { space[v] = 1; } for (int i = 1; i <= n; ++i) { printf( %c , s[i]); if (space[i]) { printf( ); } } } int main() { int tt = 1; while (tt--) { solve(); } return 0; }

#include <bits/stdc++.h> using namespace std; int vis[6000]; int dp[5][100], mp[5][55], num[55]; int main() { int n; cin >> n; for (int i = 1; i <= 2; i++) for (int j = 1; j < n; j++) cin >> mp[i][j]; for (int i = 1; i <= n; i++) cin >> num[i]; memset(dp, 0, sizeof dp); for (int i = n - 1; i >= 1; i--) dp[2][i] = dp[2][i + 1] + mp[2][i]; int t1 = 10000000, t2 = 10000000, cnt = 0; for (int i = 1; i <= n; i++) { int kl = dp[2][i] + num[i] + cnt; if (kl < t2) { if (kl < t1) t2 = t1, t1 = kl; else t2 = kl; } cnt += mp[1][i]; } int ans = t1 + t2; cout << ans << endl; return 0; }

#include <bits/stdc++.h> using namespace std; set<string> ss; string s; void readInput() { cin >> s; } void solve() { for (int i = 0; i <= s.length(); i++) { for (char c = a ; c <= z ; c++) { string tmp; tmp += s.substr(0, i) + c + s.substr(i, s.length()); ss.insert(tmp); } } cout << ss.size(); } int main() { readInput(); solve(); return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int t, n; scanf( %d , &t); while (t--) { scanf( %d , &n); printf( %d n , n - 1); for (int i = 2; i <= n; ++i) printf( %d , i); printf( n ); } }

#include <bits/stdc++.h> using namespace std; const int MAX_TAILLE = 100 * 1000 + 3; long long T[1]; long long paire[MAX_TAILLE], impaire[MAX_TAILLE]; int n, e, a; long long best; int main() { paire[0] = 0; impaire[0] = 0; int p = 1, ip = 1; cin >> n >> e; T[0] = 0; for (int i = 1; i <= n; i++) { cin >> a; if (i % 2 == 1) { paire[p] = paire[p - 1] + a - T[0]; p++; } else { impaire[ip] = impaire[ip - 1] + a - T[0]; ip++; } T[0] = a; } if ((n + 1) % 2 == 1) { paire[p] = paire[p - 1] + e - T[0]; ip--; } else { impaire[ip] = impaire[ip - 1] + e - T[0]; p--; } best = paire[p]; for (int i = 1; i <= p; i++) { best = max(best, paire[i] + impaire[ip] - impaire[i - 1] - 1); } cout << best; }

#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( Ofast ) #pragma GCC optimize( unroll-loops ) const long long maxn = 4005, maxk = 1e5 + 2, mod = 1e9 + 7; long long a[maxn]; vector<long long> v; bool mrk[maxn]; int32_t main() { long long t; cin >> t; while (t--) { long long n, mx = 0, lst = 0; cin >> n >> mx; for (long long i = 1; i < 2 * n; i++) { cin >> a[i]; if (a[i] > mx) { mx = a[i]; v.push_back(i - lst); lst = i; } } v.push_back(2 * n - lst); for (long long i = 1; i <= n; i++) mrk[i] = false; mrk[0] = true; for (long long i = 0; i < (long long)(v).size(); i++) { for (long long j = n - v[i]; j >= 0; j--) mrk[j + v[i]] |= mrk[j]; } if (mrk[n]) cout << YES << n ; else cout << NO << n ; v.clear(); } }

#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; int turn = 2 * k + 1; if (n % turn == 0) cout << n / turn << ; else cout << n / turn + 1 << ; double upperbound = (n - 1) % turn + 1; int MAXN = 0; upperbound /= 2; int temp = ceil(upperbound); for (int i = min(k + 1, temp); i <= n; i += turn) { cout << i << ; MAXN = i; } if (MAXN + k < n) cout << MAXN + 2 * k + 1; return 0; }

#include <bits/stdc++.h> using namespace std; int main() { long long n, l, r; cin >> n >> l >> r; cout << (n - l) + (int)pow(2, l) - 1 << << (n - r) * ((int)pow(2, r - 1)) + ((int)pow(2, r) - 1) << endl; }

#include <bits/stdc++.h> using namespace std; inline int read() { char c; int x = 0; int b = 1; do { c = getchar(); if (c == 45) b = -1; } while (c > 57 || c < 48); do x = x * 10 + c - 48, c = getchar(); while (c <= 57 && c >= 48); x *= b; return x; } int n, m, t; const int maxn = 300 + 5; const int logn = 10 + 5; int f[logn][maxn][maxn]; int g[maxn][maxn], w[maxn][maxn]; int main() { n = read(), m = read(); t = log2(n); memset(f, 0xcf, sizeof(f)); memset(w, 0xcf, sizeof(w)); for (int i = 1, x, y, z, l; i <= m; i++) { x = read(), y = read(); z = read(); l = read(); f[0][x][y] = z, f[0][y][x] = l; } for (int i = 1; i <= n; i++) w[i][i] = f[0][i][i] = 0; for (int s = 1; s <= 10; s++) { for (int k = 1; k <= n; k++) { for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { f[s][i][j] = max(f[s][i][j], f[s - 1][i][k] + f[s - 1][k][j]); } } } } int ans = 0; for (int s = 10; s >= 0; s--) { memset(g, 0xcf, sizeof(g)); for (int k = 1; k <= n; k++) { for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { g[i][j] = max(g[i][j], w[i][k] + f[s][k][j]); } } } int sig = 0; for (int i = 1; i <= n; i++) if (g[i][i] > 0) sig = 1; if (sig) continue; else { for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { w[i][j] = g[i][j]; } } ans += (1 << s); } } printf( %d n , ans >= n ? 0 : ans + 1); return 0; }