func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; long long nod(long long a, long long b) { while (a != 0 && b != 0) { if (a > b) a %= b; else b %= a; } return a + b; } int main() { long long n, a[100]; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); long long p = nod(a[0], a[1]); for (int i = 1; i < n; i++) p = nod(p, a[i]); long long max = a[n - 1], s; s = ((max - p) / p) + 1; if ((s - n) % 2 == 0) cout << Bob ; else cout << Alice ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; const long long M = (long long)1e9 + 7; int Int() { int x; scanf( %d , &x); return x; } long long Long() { long long x; scanf( %lld , &x); return x; } void Char(char *ch) { scanf( %s , ch); } template <typename t> inline t abs(t a) { if (a >= 0) return a; return -a; } template <typename T> inline T modpow(T b, T p, T Mod) { T res = 1; while (p) { if (p & 1) { res *= b; res %= Mod; } b *= b; b %= Mod; p >>= 1; } return res; } template <typename T> inline T ModInv(T b, T Mod) { return modpow(b, Mod - 2, Mod); } long long pwr(long long b, long long p) { long long res = 1LL; while (p) { if (p & 1) { res *= b; } b *= b; p >>= 1LL; } return res; } template <typename T> inline T gcd(T a, T b) { if (b == 0) return a; return gcd(b, a % b); } template <typename T> inline void Int(T &n) { n = 0; int f = 1; register int ch = getchar(); for (; !isdigit(ch); ch = getchar()) if (ch == - ) f = -1; for (; isdigit(ch); ch = getchar()) n = (n << 3) + (n << 1) + ch - 0 ; n = n * f; } template <typename T, typename U> inline void Int(T &a, U &b) { Int(a); Int(b); } template <typename T, typename U, typename W> inline void Int(T &a, U &b, W &c) { Int(a, b); Int(c); } template <typename T, typename U, typename W, typename X> inline void Int(T &a, U &b, W &c, X &d) { Int(a, b, c); Int(d); } vector<int> Unique(vector<int> v) { sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); return v; } vector<string> split(const string &s, char c) { vector<string> v; stringstream ss(s); string x; while (getline(ss, x, c)) v.emplace_back(x); return move(v); } void err(vector<string>::iterator it) {} template <typename T, typename... Args> void err(vector<string>::iterator it, T a, Args... args) { cout << it->substr((*it)[0] == , it->length()) << = << a << ; err(++it, args...); } int digit(long long n) { int s = 0; while (n) { n /= 10; s++; } return s; } long long F(long long n) { int len = digit(n); if (len <= 1) return n; long long res = 0, add = 9; for (int i = 1; i < len; i++) { if (i == 1) { res += 9; } else { res += add; add *= 10; } } long long k = pwr(10, len - 1); long long x = n / k; long long y = n % 10LL; long long p = (n % k) / 10LL; if (y >= x) { res += (p + 1) + ((x - 1) * (k / 10LL)); } else { res += p + ((x - 1) * (k / 10LL)); } return res; } int main() { long long a = Long(), b = Long(); printf( %lld n , F(b) - F(a - 1)); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; std::cin >> n >> m; getchar(); int a[n][m], nums[m]; for (int i = 0; i < m; i++) { nums[i] = 0; } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { a[i][j] = getchar() - 0 ; nums[j] += a[i][j]; } getchar(); } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (a[i][j]) { if (nums[j] == 1) goto A; } } std::cout << YES ; return 0; A:; } printf( NO ); return 0; } |
#include <bits/stdc++.h> using namespace std; struct point { long double x, y, s; point() {} point(int xx, int yy, point o) { x = (long double)xx, y = (long double)yy; s = atan2(y - o.y, x - o.x); } } o, p; bool operator<(point _1, point _2) { if (_1.s == _2.s) { return _1.x < _2.x; } return _1.s < _2.s; } point operator-(point a, point b) { return point(a.x - b.x, a.y - b.y, o); } long double Cro(point a, point b) { return a.x * b.y - a.y * b.x; } int px[5], py[5], n; set<point> s; set<point>::iterator getpre(set<point>::iterator it) { if (it == s.begin()) { return --s.end(); } return --it; } set<point>::iterator getnxt(set<point>::iterator it) { if ((++it) == s.end()) { return s.begin(); } return it; } void Insert(point p) { s.insert(p); set<point>::iterator tmp = s.find(p); set<point>::iterator i = getpre(tmp), j = getpre(i); while (Cro(p - (*j), (*i) - (*j)) >= 0) { s.erase(i); i = j, j = getpre(j); } i = getnxt(tmp), j = getnxt(i); while (Cro(p - (*j), (*i) - (*j)) <= 0) { s.erase(i); i = j, j = getnxt(j); } return; } int main() { { n = 0; char ch; int f = 0; do { ch = getchar(); if (ch == - ) { f = 1; } } while (ch < 0 || ch > 9 ); while ( 0 <= ch && ch <= 9 ) { n = (n << 1) + (n << 3) + ch - 48; ch = getchar(); } if (f) n = -n; } int op, x, y; for (int i = 1; i <= 3; i++) { { op = 0; char ch; int f = 0; do { ch = getchar(); if (ch == - ) { f = 1; } } while (ch < 0 || ch > 9 ); while ( 0 <= ch && ch <= 9 ) { op = (op << 1) + (op << 3) + ch - 48; ch = getchar(); } if (f) op = -op; } { px[i] = 0; char ch; int f = 0; do { ch = getchar(); if (ch == - ) { f = 1; } } while (ch < 0 || ch > 9 ); while ( 0 <= ch && ch <= 9 ) { px[i] = (px[i] << 1) + (px[i] << 3) + ch - 48; ch = getchar(); } if (f) px[i] = -px[i]; } { py[i] = 0; char ch; int f = 0; do { ch = getchar(); if (ch == - ) { f = 1; } } while (ch < 0 || ch > 9 ); while ( 0 <= ch && ch <= 9 ) { py[i] = (py[i] << 1) + (py[i] << 3) + ch - 48; ch = getchar(); } if (f) py[i] = -py[i]; } o.x += (long double)px[i], o.y += (long double)py[i]; } o.x /= 3.0, o.y /= 3.0; for (int i = 1; i <= 3; i++) { s.insert(point(px[i], py[i], o)); } for (int i = 4; i <= n; i++) { { op = 0; char ch; int f = 0; do { ch = getchar(); if (ch == - ) { f = 1; } } while (ch < 0 || ch > 9 ); while ( 0 <= ch && ch <= 9 ) { op = (op << 1) + (op << 3) + ch - 48; ch = getchar(); } if (f) op = -op; } { x = 0; char ch; int f = 0; do { ch = getchar(); if (ch == - ) { f = 1; } } while (ch < 0 || ch > 9 ); while ( 0 <= ch && ch <= 9 ) { x = (x << 1) + (x << 3) + ch - 48; ch = getchar(); } if (f) x = -x; } { y = 0; char ch; int f = 0; do { ch = getchar(); if (ch == - ) { f = 1; } } while (ch < 0 || ch > 9 ); while ( 0 <= ch && ch <= 9 ) { y = (y << 1) + (y << 3) + ch - 48; ch = getchar(); } if (f) y = -y; } p = point(x, y, o); set<point>::iterator nxt = s.lower_bound(p); if (nxt == s.end()) { nxt = s.begin(); } set<point>::iterator pre = getpre(nxt); if (op == 1) { if (Cro(p - (*pre), (*nxt) - p) > 0) { Insert(p); } } else { if (Cro(p - (*pre), (*nxt) - p) > 0) { puts( NO ); } else { puts( YES ); } } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { double n, l, v1, v2, k; cin >> n >> l >> v1 >> v2 >> k; double m = ceil(n / k); double ans = l * v2 / (v1 * v2 - v2 * (v1 * v1 - v2 * v2) / (v1 + (2 * m - 1) * v2)); cout << fixed << setprecision(10) << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int ar[5000009]; long long j; int finder(vector<pair<long long, long long> > v, long long jump) { for (int i = 0; i < v.size(); i++) { if (v[i].first > jump) { return i; } } return v.size(); } long long count = 0; vector<pair<long long, long long> > v[4]; void dfs1(long long b, long long p, long long jump) { if (v[b].size() == 0) { ::count = max(::count, p); return; } else { long long low = finder(v[b], jump); if (v[b][0].first > jump) { ::count = max(::count, p); return; } else { low--; long long u = 0, maxi = v[b][0].second; for (int k = 1; k <= low; k++) { if (maxi < v[b][k].second) { maxi = v[b][k].second; u = k; } } jump += v[b][u].second; v[b].erase(v[b].begin() + u); dfs1((b == 1) ? 0 : ((b == 0) ? 1 : ((b == 2) ? 3 : 2)), p + 1, jump); } } } int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); long long n, jump, a, s, d; cin >> n >> jump; for (int i = 0; i < n; ++i) { cin >> a >> s >> d; if (a == 0) { v[0].push_back(make_pair(s, d)); v[2].push_back(make_pair(s, d)); } else { v[3].push_back(make_pair(s, d)); v[1].push_back(make_pair(s, d)); } } sort(v[0].begin(), v[0].end()); sort(v[1].begin(), v[1].end()); sort(v[2].begin(), v[2].end()); sort(v[3].begin(), v[3].end()); dfs1(0, 0, jump); dfs1(3, 0, jump); cout << ::count; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; int f[1 << 6], ff[1 << 6], g[1 << 6], gg[1 << 6]; int b[N]; char s[N], w[100]; int n, m; bool check() { for (int i = 1; i < (1 << 6); i++) gg[i] = gg[i - (i & -i)] + g[i & -i]; for (int i = 1; i < (1 << 6) - 1; i++) if (gg[i] > f[i] || ff[i] > gg[i]) return 0; return 1; } int main() { scanf( %s , s + 1); n = strlen(s + 1); for (int i = 1; i <= n; i++) g[1 << (s[i] - a )]++; scanf( %d , &m); for (int i = 1; i <= m; i++) { int x, y, z = 0; scanf( %d %s , &x, w); y = strlen(w); for (int j = 0; j < y; j++) z |= (1 << (w[j] - a )); for (int j = 0; j < (1 << 6); j++) { if (j & z) f[j]++; if ((j & z) == z) ff[j]++; } b[x] = z; } for (int i = 1; i <= n; i++) if (!b[i]) { ff[b[i] = (1 << 6) - 1]++; for (int j = 0; j < (1 << 6); j++) f[j]++; } if (!check()) { printf( Impossible n ); return 0; } for (int i = 1; i <= n; i++) { for (int j = 0; j < (1 << 6); j++) { if (j & b[i]) f[j]--; if ((j & b[i]) == b[i]) ff[j]--; } for (int j = 0; j < 6; j++) if (g[1 << j] && ((b[i] >> j) & 1)) { g[1 << j]--; if (check()) { printf( %c , j + a ); break; } g[1 << j]++; } } return 0; } |
#include <bits/stdc++.h> using namespace std; long long int power(long long int x, long long int y) { long long int res = 1; x = x; while (y > 0) { if (y & 1) res = (res * x); y = y >> 1; x = (x * x); } return res; } long long int logtwo(long long int n) { if (n == 1) return 0; return logtwo(n / 2) + 1; } vector<long long int> adj[105][105]; long long int vis[105][105]; void dfs(int par, long long int col) { for (auto child : adj[par][col]) { if (vis[child][col]) continue; vis[child][col] = vis[par][col]; dfs(child, col); } } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t = 1; while (t--) { long long int N, M; cin >> N >> M; for (long long int i = 0; i < M; i++) { long long int a, b, c; cin >> a >> b >> c; a--; b--; adj[a][c].push_back(b); adj[b][c].push_back(a); } for (long long int i = 0; i < 105; i++) { long long int c = 1; for (long long int j = 0; j < N; j++) { if (vis[j][i]) continue; vis[j][i] = c++; dfs(j, i); } } long long int Q; cin >> Q; while (Q--) { long long int x, y; cin >> x >> y; long long int ans = 0; x--; y--; for (long long int i = 0; i < 105; i++) { if (vis[x][i] && vis[x][i] == vis[y][i]) ans++; } cout << ans << n ; } } cerr << Time : << 1000 * (long double)clock() / (long double)CLOCKS_PER_SEC << ms n ; ; } |
#include <bits/stdc++.h> using namespace std; int st[200011], disc = 0, mod, en[200011]; vector<int> adj[200011]; bitset<1003> m[1000011]; int flag[1000011], a[200011]; int p[2011], arr[200011]; vector<int> pr; bitset<1003> def; void dfs(int u, int p) { st[u] = disc; arr[disc] = u; disc++; for (int i = 0; i < adj[u].size(); i++) { int k = adj[u][i]; if (k == p) continue; dfs(k, u); } en[u] = disc - 1; } void rotate(std::bitset<1003>& b, unsigned m) { b = (((b << m) & def) | (b >> (mod - m))); } void build(int n, int b, int e) { if (b == e) { m[n].set(a[arr[b]]); return; } int l = 2 * n, mid = (b + e) / 2; build(l, b, mid); build(l + 1, mid + 1, e); m[n] = m[l] | m[l + 1]; } void update(int n, int b, int e, int x, int y, int v) { if (flag[n] != 0) { rotate(m[n], flag[n]); if (b != e) { flag[2 * n] = (flag[2 * n] + flag[n]) % mod; flag[2 * n + 1] = (flag[2 * n + 1] + flag[n]) % mod; } flag[n] = 0; } if (b > y || e < x) return; if (b >= x && e <= y) { rotate(m[n], v); if (b != e) { flag[2 * n] = (flag[2 * n] + v) % mod; flag[2 * n + 1] = (flag[2 * n + 1] + v) % mod; } return; } int l = 2 * n, mid = (b + e) / 2; update(l, b, mid, x, y, v); update(l + 1, mid + 1, e, x, y, v); m[n] = m[l] | m[l + 1]; } bitset<1003> query(int n, int b, int e, int x, int y) { if (flag[n] != 0) { rotate(m[n], flag[n]); if (b != e) { flag[2 * n] = (flag[2 * n] + flag[n]) % mod; flag[2 * n + 1] = (flag[2 * n + 1] + flag[n]) % mod; } flag[n] = 0; } if (b > y || e < x) return 0; if (b >= x && e <= y) return m[n]; int l = 2 * n, mid = (b + e) / 2; return (query(l, b, mid, x, y) | query(l + 1, mid + 1, e, x, y)); } int main() { int n, i, j, k; scanf( %d %d , &n, &mod); for (i = 2; i < mod; i++) if (p[i] == 0) { pr.push_back(i); for (j = i + i; j < mod; j += i) p[j] = 1; } for (i = 1; i <= n; i++) scanf( %d , &a[i]), a[i] %= mod; for (i = 0; i < n - 1; i++) { int u, v; scanf( %d %d , &u, &v); adj[u].push_back(v); adj[v].push_back(u); } dfs(1, 0); build(1, 0, n - 1); int q; scanf( %d , &q); for (i = 0; i < mod; i++) def.set(i); while (q--) { int t; scanf( %d , &t); if (t == 1) { int x, v; scanf( %d %d , &v, &x); x %= mod; update(1, 0, n - 1, st[v], en[v], x); } else { int v, ans = 0; scanf( %d , &v); bitset<1003> b = query(1, 0, n - 1, st[v], en[v]); for (int i = 0; i < pr.size(); i++) if (b.test(pr[i])) ans++; printf( %d n , ans); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int z, n, m; while (cin >> n >> m) { if (m > n) z = -1; else { if (n % 2 == 0) z = n / 2; else z = (n / 2) + 1; while (z % m != 0) { z++; } } cout << z; } return 0; } |
#include <bits/stdc++.h> using namespace std; int gcd(int p, int q) { return q == 0 ? p : gcd(q, p % q); } char s[100100]; long long res[2][2]; int main() { cin >> s; int len = strlen(s); memset(res, 0, sizeof(res)); long long a = 0, b = 0; for (int i = 0; i < len; i++) { int temp = i & 1; res[s[i] - a ][temp]++; a += res[s[i] - a ][1 - temp]; b += res[s[i] - a ][temp]; } cout << a << << b << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n, m; cin >> n >> m; long long int a[m]; for (int i = 0; i < m; i++) { cin >> a[i]; } sort(a, a + m); int i = 0; while (i < m - 2) { if (a[i] + 1 == a[i + 1] && a[i + 1] + 1 == a[i + 2]) { cout << NO n ; return 0; } i++; } if (a[0] == 1 || a[m - 1] == n) { cout << NO n ; return 0; } cout << YES n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const long double lim = 1e99; template <typename T> inline T read() { register T sum = 0; register char cc = getchar(); int sym = 1; while (cc != - && (cc > 9 || cc < 0 )) cc = getchar(); if (cc == - ) sym = -1, cc = getchar(); sum = sum * 10 + cc - 0 ; cc = getchar(); while (cc >= 0 && cc <= 9 ) sum = sum * 10 + cc - 0 , cc = getchar(); return sym * sum; } template <typename T> inline T read(T& a) { a = read<T>(); return a; } template <typename T, typename... Others> inline void read(T& a, Others&... b) { a = read(a); read(b...); } int n, m, K; long double ans, fac[100010]; long double C(int n, int m) { return fac[n] - fac[m] - fac[n - m]; } int main() { read(n, m, K); for (int i = 1; i <= m; i++) fac[i] = fac[i - 1] + log(1. * i); for (int i = 0; i <= n; i++) for (int j = 0; j <= n; j++) { int num = (i + j) * n - i * j; if (num <= K) { long double p = C(n, i) + C(n, j) + C(m - num, K - num) - C(m, K); ans = min(ans + exp(p), lim); } } printf( %.15Lf n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int Max_N(1050); int N; double P[Max_N][Max_N], F[Max_N], G[Max_N], V[Max_N]; bool done[Max_N]; int main() { scanf( %d , &N); for (int i = 1; i <= N; ++i) { V[i] = 1.0; for (int j = 1; j <= N; ++j) scanf( %lf , P[i] + j), P[i][j] /= 100.0; if (i < N) F[i] = 1E100; } for (int u;;) { u = -1; for (int x = 1; x <= N; ++x) if (!done[x] && (u == -1 || F[x] < F[u])) u = x; if (u == -1) break; done[u] = true; for (int v = 1; v <= N; ++v) if (!done[v] && P[v][u] != 0.0) G[v] += V[v] * P[v][u] * F[u], V[v] *= (1.0 - P[v][u]), F[v] = 1.0 / (1.0 - V[v]) + G[v] / (1.0 - V[v]); } printf( %.10lf , F[1]); return 0; } |
#include <bits/stdc++.h> using namespace std; constexpr int MAX_N = 200000; int N, M, S, D; int X[MAX_N + 10]; int DP[MAX_N + 1] = {0}; stack<string> OPS; void run(int x) { if (x == 0) return; std::ostringstream os; os << RUN << x; OPS.push(os.str()); } void jump(int x) { assert(x > 0); std::ostringstream os; os << JUMP << x; OPS.push(os.str()); } bool dfs(int p) { assert(p >= 0 && p <= N); if (DP[p] != 0) { assert(DP[p] == 2); return false; } if (M < X[p]) { DP[p] = 2; return false; } if (p == N || M < X[p + 1]) { run(M - X[p] - 1); DP[p] = 1; } else { DP[p] = 2; int space = X[p + 1] - X[p] - 2; if (space < S) { return false; } int i = p + 1; while (DP[p] != 1 && i <= N && X[i] + 1 <= X[p + 1] - 1 + D) { if (dfs(i)) { DP[p] = 1; jump(X[i] + 1 - X[p + 1] + 1); run(space); } i++; } } return DP[p] == 1; } int main() { cin >> N >> M >> S >> D; X[0] = -1; for (int i = 0; i < N; i++) { cin >> X[i + 1]; } sort(&X[0], &X[N + 1]); if (!dfs(0)) { printf( IMPOSSIBLE n ); } else { while (!OPS.empty()) { cout << OPS.top() << endl; OPS.pop(); } } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; long long mpow(long long x, long long y) { if (y == 0) return 1; if (y % 2) return x * mpow(x, y - 1) % MOD; long long h = mpow(x, y / 2); return h * h % MOD; } long long arr[111111]; int main() { int k; scanf( %d , &k); for (int i = 0; i < k; i++) scanf( %lld , arr + i); long long p = 2; for (int i = 0; i < k; i++) p = mpow(p, arr[i]); p = p * mpow(2, MOD - 2) % MOD; long long q = p; if (all_of(arr, arr + k, [&](long long i) { return i % 2; })) p = (p - 1 + MOD) % MOD; else p = (p + 1) % MOD; p = p * mpow(3, MOD - 2) % MOD; printf( %lld/%lld , p, q); } |
#include <bits/stdc++.h> using namespace std; long long solve() { long long m, n, i, j; string a, b; cin >> m >> n >> a >> b; long long t[m + 1][n + 1]; memset(t, 0, sizeof(t)); long long sol = 0; for (i = 1; i <= m; i++) for (j = 1; j <= n; j++) { if (a[i - 1] == b[j - 1]) t[i][j] = 2 + t[i - 1][j - 1]; else t[i][j] = max(t[i - 1][j], t[i][j - 1]) - 1; t[i][j] = max((long long)0, t[i][j]); sol = max(sol, t[i][j]); } return sol; } int32_t main() { long long t = 1; while (t--) cout << solve() << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int read() { int nm = 0, f = 1; char c = getchar(); for (; !isdigit(c); c = getchar()) if (c == - ) f = -1; for (; isdigit(c); c = getchar()) nm = nm * 10 + c - 0 ; return nm * f; } long long cup[10001], flow[10001], to[10001], head[10001], nxt[10001], deep[10001]; bool vis[10001]; int n, m, s, t, cnt = 1; long long ans = 0; void push(int vi, int vj, long long v) { cnt++, to[cnt] = vj, nxt[cnt] = head[vi], head[vi] = cnt, cup[cnt] = v; cnt++, to[cnt] = vi, nxt[cnt] = head[vj], head[vj] = cnt; } bool bfs(int be, int ed) { memset(deep, 0, sizeof(deep)); deep[be] = 1; queue<int> q; q.push(be); while (!q.empty()) { int now = q.front(); q.pop(); for (int i = head[now]; i; i = nxt[i]) { int vj = to[i]; if (flow[i] >= cup[i] || deep[vj]) continue; deep[vj] = deep[now] + 1; q.push(vj); if (vj == ed) return true; } } return false; } long long dfs(int now, int ed, long long f) { if (f == 0 || now == ed) return f; long long tot = 0, x; for (int i = head[now]; i; i = nxt[i]) { int vj = to[i]; if (deep[vj] != deep[now] + 1) continue; if (x = dfs(vj, ed, min(f, cup[i] - flow[i]))) { flow[i] += x; flow[i ^ 1] -= x; tot += x; f -= x; } if (f == 0) break; } if (tot == 0) deep[now] = -1; return tot; } void Dinic(int be, int ed) { while (bfs(be, ed)) ans -= dfs(be, ed, 1ll << 50); } int main() { n = read(), m = read(); s = n + m + 1, t = s + 1; for (int i = 1; i <= n; i++) { push(i, t, read()); } for (int i = 1; i <= m; i++) { int vi = read(), vj = read(), v = read(); ans += v; push(s, n + i, v); push(n + i, vi, 1ll << 50); push(n + i, vj, 1ll << 50); } Dinic(s, t); cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2036000; const long long INF = 199999999999LL; int n, m; long long a[N], b[N]; long long first, second, mod; long long w[N], t[N]; int nn; void AddA(int &i) { w[nn] = a[i++]; t[nn++] = 1; } void AddB(int &j) { w[nn] = b[j++]; t[nn++] = 2; } int main() { cin >> n; cin >> n >> a[0] >> first >> second >> mod; for (int i = (1); i < (int)(n); i++) a[i] = (a[i - 1] * first + second) % mod; cin >> m >> b[0] >> first >> second >> mod; for (int j = (1); j < (int)(m); j++) b[j] = (b[j - 1] * first + second) % mod; int i = 0, j = 0; nn = 0; long long lt = -INF; while (i < n || j < m) { if (i == n) { AddB(j); } else if (j == m) { AddA(i); } else { bool ga = a[i] >= lt; bool gb = b[j] >= lt; if (ga ^ gb) { if (ga) { AddA(i); } else { AddB(j); } } else { if (a[i] < b[j]) { AddA(i); } else { AddB(j); } } } lt = w[nn - 1]; } int bad = 0; for (int k = (1); k < (int)(nn); k++) bad += (w[k] < w[k - 1]); cout << bad << endl; if (n + m <= 200000) { for (int k = (0); k < (int)(nn); k++) cout << w[k] << << t[k] << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX = 1e5 + 5; const int inf = 1e9 + 1; const long long OO = 1e18; long long p1, p2, c1, c2, w1, w2; long long solve() { long long a2, b1, b3, ans = 0; for (int i = 0; i <= min(p1 / w1, c1); i++) { long long a2 = min((p1 - i * w1) / w2, c2); long long b1 = min(p2 / w1, c1 - i); long long b2 = min((p2 - b1 * w1) / w2, c2 - a2); ans = max(ans, i + a2 + b1 + b2); } return ans; } int main() { int t; cin >> t; while (t--) { cin >> p1 >> p2 >> c1 >> c2 >> w1 >> w2; if (w1 > w2) { swap(w1, w2); swap(c1, c2); } cout << solve() << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, lam, mx = 0, c = 0; cin >> n; vector<int> cand(n); for (int i = 0; i < n; i++) { cin >> cand[i]; if (mx < cand[i]) mx = cand[i]; } for (int i = 0; i < n; i++) if (mx == cand[i]) c++; int x = lam = cand[0]; if (lam == mx && c > 1) return cout << 1 , 0; if (lam == mx && c == 1) return cout << 0 , 0; sort(cand.begin(), cand.end()); while (lam <= cand[n - 1]) { lam += 1; cand[n - 1] -= 1; sort(cand.begin(), cand.end()); } cout << lam - x; } |
#include <bits/stdc++.h> using namespace std; int64_t *arry[3]; int main(void) { int64_t n, p, q, r; cin >> n >> p >> q >> r; for (int i = 0; i < 3; i++) { arry[i] = (int64_t *)malloc(sizeof(int64_t) * n); } for (int i = 0; i < n; i++) { int buf; cin >> buf; arry[0][i] = buf * p; arry[1][i] = buf * q; arry[2][i] = buf * r; } { int64_t *pt = (int64_t *)malloc(sizeof(int64_t) * n); pt[n - 1] = arry[2][n - 1]; for (int i = n - 1; i > 0; i--) { pt[i - 1] = max(pt[i], arry[2][i - 1]); } free(arry[2]); arry[2] = pt; } { int64_t *pt = (int64_t *)malloc(sizeof(int64_t) * n); for (int i = 0; i < n; i++) { pt[i] = arry[1][i] + arry[2][i]; } free(arry[1]); arry[1] = pt; } { int64_t *pt = (int64_t *)malloc(sizeof(int64_t) * n); pt[0] = *arry[0]; for (int i = 1; i < n; i++) { pt[i] = max(pt[i - 1], arry[0][i]); } free(arry[0]); arry[0] = pt; } int64_t max = arry[0][0] + arry[1][0]; for (int i = 1; i < n; i++) { int64_t buf = arry[0][i] + arry[1][i]; if (buf > max) max = buf; } cout << max << endl; for (int i = 0; i < 3; i++) { free(arry[i]); } } |
#include <bits/stdc++.h> int main() { int n, w = 0, k = 1, i = 0, t = 0; scanf( %d , &n); int a[n]; for (i = 0; i < n; i++) { scanf( %d , &a[i]); if (a[i] > t) t = a[i]; } for (i = 0; i < n; i++) { if ((a[i] == t) && (a[i + 1] == t)) k++; else if ((a[i] == t) && (a[i + 1] != t)) { if (k > w) w = k; k = 1; } } printf( %d , w); return 0; } |
#include <bits/stdc++.h> using namespace std; long long int func(long long int n) { long long int res = 0; while (n != 0) { n /= 10; res++; } return res; } int main() { long long int w, m, k; cin >> w >> m >> k; long long int n = func(m), tr = w / k, res = 0; while (tr > 0) { long long int dum = pow(10, n) - m; res += fmin(tr / n, dum); tr -= dum * n; m += dum; n++; } cout << res; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC optimization( O3 ) #pragma GCC optimize( unroll-loops ) #pragma GCC target( avx,avx2,fma ) using namespace std; int main() { long double r, x1, y1, x2, y2; cin >> r >> x1 >> y1 >> x2 >> y2; long double x = sqrt((y1 - y2) * (y1 - y2) + (x1 - x2) * (x1 - x2)); if (x - r >= 0) cout << fixed << setprecision(10) << x1 << << y1 << << r; else { if (x == 0) { cout << x1 - r / 2 << << y1 << << r / 2; return 0; } x1 = x1 + ((x - r) / 2) * (x2 - x1) / x; y1 = y1 + ((x - r) / 2) * (y2 - y1) / x; cout << fixed << setprecision(10) << x1 << << y1 << << r - (r - x) / 2; } return 0; } |
#include <bits/stdc++.h> using namespace std; void Rd(int &x) { static char c; x = 0; while ((c = getchar()) < 48) ; do x = (x << 3) + (x << 1) + (c ^ 48); while ((c = getchar()) > 47); } int n; int Next[200004 << 1], V[200004 << 1], W[200004], Head[200004], tot; void Add_Edge(int u, int v) { Next[++tot] = Head[u], V[Head[u] = tot] = v; } int Sz[200004], G, Mn, Nowsz; bool Mark[200004]; long long Ans, Dis[200004]; void GetG(int x, int f) { int y, mx = 0; Sz[x] = 1; for (int i = Head[x]; i; i = Next[i]) if (!Mark[y = V[i]] && y != f) { GetG(y, x); Sz[x] += Sz[y]; mx = max(mx, Sz[y]); } mx = max(mx, Nowsz - Sz[x]); if (mx < Mn) Mn = mx, G = x; } int m; struct Node { int l; long long d; } D[200004]; long long Calc(int x) { long long Tmp[2] = {0, 0}, Cnt[2] = {0, 0}, Res = 0; for (int i = (0), i_end_ = (m); i < i_end_; ++i) (Tmp[D[i].l & 1] += D[i].d) %= 1000000007, Cnt[D[i].l & 1]++; Res -= 2 * Cnt[1] * Tmp[1] + Cnt[1] * Cnt[1] % 1000000007 * W[x]; Res += 2 * Cnt[0] * Tmp[0] + Cnt[0] * Cnt[0] % 1000000007 * W[x]; return Res % 1000000007; } void Gets(int x, int f, int d) { D[m++] = (Node){d, Dis[x]}; int y; Sz[x] = 1; for (int i = Head[x]; i; i = Next[i]) if (!Mark[y = V[i]] && y != f) { Dis[y] = Dis[x] + ((d & 1) ? W[y] : -W[y]); Gets(y, x, d + 1); Sz[x] += Sz[y]; } } void Work(int x, int sz) { Mn = 200004, Nowsz = sz; GetG(x, 0); Mark[x = G] = 1; m = Dis[x] = 0; Gets(x, 0, 0); Ans += Calc(x); if (sz == 1) return; int y; for (int i = Head[x]; i; i = Next[i]) if (!Mark[y = V[i]]) { m = 0; Gets(y, x, 1); Ans -= Calc(x); Work(y, Sz[y]); } } int main() { Rd(n); for (int i = (1), i_end_ = (n + 1); i < i_end_; ++i) scanf( %d , &W[i]); for (int i = (1), i_end_ = (n); i < i_end_; ++i) { int u, v, w; Rd(u), Rd(v); Add_Edge(u, v); Add_Edge(v, u); } Work(1, n); printf( %I64d n , (Ans % 1000000007 + 1000000007) % 1000000007); return 0; } |
#include<bits/stdc++.h> using namespace std; typedef long long ll; const ll MOD = 998244353; #define rep(i,a,b) for(ll i=a;i<b;++i) #define pii pair<int,int> int main() { ios_base::sync_with_stdio(0); cin.tie(0); int tt=1; cin>>tt; while(tt--) { int n; cin>>n; int a[n]; rep(i,0,n) cin>>a[i]; vector<int> v; rep(i,0,n) { v.push_back(a[i]); int p = i+1; rep(j,i+1,n) { p = j; if(a[j]>a[i]) break; v.push_back(a[j]); } reverse(v.begin()+i,v.end()); i = p-1; if(p==n-1 && v.size()==n) i=n; } for(int i=v.size()-1;i>=0;--i) cout<<v[i]<< ; cout<< n ; } } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m, a[120], i, j, res; while (scanf( %d %d , &n, &m) == 2) { for (i = 1; i <= n; i++) { scanf( %d , &a[i]); } bool flag = true; int k = 0; while (flag) { for (i = 1; i <= n; i++) { if (a[i]) { if (a[i] <= m) { a[i] = 0; k++; if (k == n) { flag = false; res = i; } } else if (a[i] > m) { a[i] -= m; } } } } printf( %d n , res); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n; double r, v, si, fi; cin >> n >> r >> v; for (int i = 0; i < n; i++) { cin >> si >> fi; double dist = fi - si; double cir = 2 * 3.14159265358979323846 * r; double rev = dist / cir; rev = floor(rev); double time = rev * (cir / v); dist -= time * v; double left = 0; double right = cir / v; double x; while (right - left > 1e-12) { double mid = (left + right) / 2; double temp = 2 * r * sin((mid * 3.14159265358979323846) / (cir / v)) + mid * v; if (temp >= dist) { right = mid; } else left = mid; } time += left; printf( %.12f n , time); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 5e5 + 5; int n, Q, x; int fa[N], fv[N]; vector<int> c[N]; struct nod { int i, l, r; } b; vector<nod> a[N]; int pl, pr; long long px; long long t[N * 4], lz[N * 4]; void down(int i) { if (lz[i]) { t[i + i] += lz[i]; lz[i + i] += lz[i]; t[i + i + 1] += lz[i]; lz[i + i + 1] += lz[i]; lz[i] = 0; } } void add(int i, int x, int y) { if (y < pl || x > pr) return; if (x >= pl && y <= pr) { t[i] += px; lz[i] += px; return; } int m = x + y >> 1; down(i); add(i + i, x, m); add(i + i + 1, m + 1, y); t[i] = min(t[i + i], t[i + i + 1]); } void ft(int i, int x, int y) { if (y < pl || x > pr) return; if (x >= pl && y <= pr) { px = min(px, t[i]); return; } int m = x + y >> 1; down(i); ft(i + i, x, m); ft(i + i + 1, m + 1, y); } int p[N], q[N], tp; long long s[N]; const long long M = 1e18; void dg(int x) { p[x] = ++tp; for (int j = 0, B = c[x].size() - 1; j <= B; j++) { int y = c[x][j]; s[y] = s[x] + fv[y], dg(y); } q[x] = tp; if (p[x] == q[x]) { pl = pr = p[x]; px = s[x] - M; add(1, 1, n); } } long long ans[N]; void dfs(int x) { for (int j = 0, B = a[x].size() - 1; j <= B; j++) { pl = a[x][j].l, pr = a[x][j].r; px = 1e18; ft(1, 1, n); ans[a[x][j].i] = px; } for (int j = 0, B = c[x].size() - 1; j <= B; j++) { int y = c[x][j]; px = -fv[y]; pl = p[y]; pr = q[y]; add(1, 1, n); px = fv[y]; pl = 1; pr = p[y] - 1; add(1, 1, n); pl = q[y] + 1; pr = n; add(1, 1, n); dfs(y); px = -fv[y]; pl = q[y] + 1; pr = n; add(1, 1, n); pl = 1; pr = p[y] - 1; add(1, 1, n); px = fv[y]; pl = p[y]; pr = q[y]; add(1, 1, n); } } int main() { scanf( %d %d , &n, &Q); for (int i = 1, B = n * 4; i <= B; i++) t[i] = 1e18; for (int i = 2, B = n; i <= B; i++) { scanf( %d %d , &fa[i], &fv[i]); c[fa[i]].push_back(i); } for (int i = 1, B = Q; i <= B; i++) { scanf( %d , &x); scanf( %d %d , &b.l, &b.r); b.i = i; a[x].push_back(b); } dg(1); dfs(1); for (int i = 1, B = Q; i <= B; i++) printf( %I64d n , ans[i]); } |
#include <bits/stdc++.h> using namespace std; int main() { int NWarm, NChip; cin >> NWarm >> NChip; int temp = NWarm * (NWarm + 1) / 2; int ans = NChip % temp; int i; for (i = 1; i <= temp; i++) { ans = ans - i; if (ans < 0) break; } int ans1 = ans + i; cout << ans1 << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; vector<int> start(m); vector<int> ending(m); vector<int> time(m); vector<int> prize(m); int money = 0; for (int i = 0; i < m; i++) { cin >> start[i] >> ending[i] >> time[i] >> prize[i]; } int mn = 9000; int currprize; for (int j = 1; j <= n; j++) { mn = 9000; currprize = 0; for (int i = 0; i < m; i++) { if (start[i] <= j && ending[i] >= j && time[i] < mn) { mn = time[i]; currprize = prize[i]; } } money += currprize; } cout << money << endl; } |
#include <bits/stdc++.h> using namespace std; const int Maxn = 200005; const int Maxd = 10; int bits[1 << Maxd]; int t; char str[Maxn]; int slen; int main() { for (int i = 1; i < 1 << Maxd; i++) bits[i] = 1 + bits[i - (i & -i)]; scanf( %d , &t); while (t--) { scanf( %s , str); slen = strlen(str); int cur = 0; for (int i = 0; i < slen; i++) cur ^= 1 << int(str[i] - 0 ); bool solved = false; for (int i = slen - 1; i >= 0 && !solved; i--) { int my = str[i] - 0 ; cur ^= 1 << my; for (int j = my - 1; j >= 0 && !solved; j--) { cur ^= 1 << j; if (i + 1 + bits[cur] <= slen) { solved = true; str[i] = j + 0 ; int pnt = i + 1; int lft = slen - (i + 1 + bits[cur]); while (lft--) str[pnt++] = 9 ; for (int l = Maxd - 1; l >= 0; l--) if (cur & 1 << l) str[pnt++] = 0 + l; } cur ^= 1 << j; } } int pnt = 0; while (str[pnt] == 0 ) pnt++; for (int i = pnt; i < slen - pnt; i++) printf( %c , str[i]); printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; int n; vector<int> v, lm, rm; class SegmentTreeMax { public: int n; vector<long long> vect; SegmentTreeMax(int _n) : n(_n) { vect.resize(2 * n); fill(vect.begin(), vect.end(), 0); } void modify(int p, long long value) { for (vect[p += n] = value; p > 1; p >>= 1) { int val = rm[vect[p]] > rm[vect[p ^ 1]] ? vect[p] : vect[p ^ 1]; vect[p >> 1] = val; } } long long query(int l, int r) { long long res = 0; for (l += n, r += n; l < r; l >>= 1, r >>= 1) { if (l & 1) { if (rm[res] < rm[vect[l]]) res = vect[l]; l++; } if (r & 1) { if (rm[res] < rm[vect[r - 1]]) res = vect[r - 1]; r--; } } return res; } }; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; v.resize(n + 1); lm.resize(n + 1); rm.resize(n + 1); vector<int> v2; for (int i = 1; i <= n; i++) { cin >> v[i]; v2.push_back(v[i]); } v2.push_back(0); sort(v2.begin(), v2.end()); auto it = unique(v2.begin(), v2.end()); v2.resize(it - v2.begin()); int l = 1, r = 1; vector<int> ans; SegmentTreeMax stm(n + 1); vector<int> visited, ct(n + 1); vector<vector<int>> updates(n + 1); while (r <= n) { int id = lower_bound(v2.begin(), v2.end(), v[r]) - v2.begin(); if (!lm[id]) lm[id] = r; int val = stm.query(l, lm[id]); updates[id].push_back(r); rm[id] = r; ct[id]++; visited.push_back(id); if (rm[val] > lm[id] || ct[id] == 4) { if (ct[id] == 4) { for (int i = 0; i < 4; i++) ans.push_back(v[r]); } else { ans.push_back(v2[val]); ans.push_back(v[r]); ans.push_back(v2[val]); ans.push_back(v[r]); } for (int i : visited) { lm[i] = 0; rm[i] = 0; ct[i] = 0; updates[i].clear(); } visited.clear(); l = r + 1; r = l; } else { for (int i : updates[id]) { stm.modify(i, id); } r++; } } cout << ans.size() << n ; for (int i : ans) { cout << i << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> bool get_int(T &x) { char t = getchar(); bool neg = false; x = 0; for (; (t > 9 || t < 0 ) && t != - && t != EOF; t = getchar()) ; if (t == - ) neg = true, t = getchar(); if (t == EOF) return false; for (; t <= 9 && t >= 0 ; t = getchar()) x = x * 10 + t - 0 ; if (neg) x = -x; return true; } template <typename T> void print_int(T x) { if (x < 0) putchar( - ), x = -x; short a[20] = {}, sz = 0; while (x > 0) a[sz++] = x % 10, x /= 10; if (sz == 0) putchar( 0 ); for (int i = sz - 1; i >= 0; i--) putchar( 0 + a[i]); } const int inf = 0x3f3f3f3f; const long long Linf = 1ll << 61; const double pi = acos(-1.0); const int mod = 1e9 + 7; const int maxn = 100111; int qpow(int x, int y) { int ret = 1; while (y) { if (y & 1) ret = (long long)ret * x % mod; x = (long long)x * x % mod; y >>= 1; } return ret; } int n, k, p[maxn]; long long cnt[maxn]; vector<int> divs[maxn * 2]; int main() { (get_int(n) && get_int(k)); k = qpow(k, mod - 2); p[0] = 1; for (int i = 1; i <= n; i++) p[i] = (long long)p[i - 1] * k % mod; for (int i = 1; i < n; i++) for (int j = i; j < n * 2; j += i) divs[j].push_back(i); for (int s = 1; s < n + n; s++) { reverse(divs[s].begin(), divs[s].end()); vector<int> ansv; for (auto g : divs[s]) { int lb = g, rb = (n - 1) / g * g; lb = max(lb, s - rb); rb = min(rb, s - lb); if (lb > rb) ansv.push_back(0); else ansv.push_back((rb - lb) / g + 1); } for (int i = 0; i < (int)divs[s].size(); i++) { for (int j = 0; j < i; j++) if (divs[s][j] % divs[s][i] == 0) ansv[i] -= ansv[j]; int g = divs[s][i]; if (s - g <= n) cnt[n - g] += ansv[i]; else cnt[n + n - s] += ansv[i]; } } int ans = 0; for (int i = 1; i <= n; i++) ans = (ans + cnt[i] % mod * p[i]) % mod; printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int N, M; int A[104][104], B[104][104]; int main() { scanf( %d %d , &N, &M); for (int i = 1; i <= N; ++i) for (int j = 1; j <= M; ++j) { char c; scanf( %c , &c); if (c == * ) A[i][j] = 1; } int cnt = 0; for (int i = 1; i <= N; ++i) for (int j = 1; j <= M; ++j) if (A[i][j]) { int x; for (x = 0;; ++x) { if (!A[i - x][j] || !A[i + x][j] || !A[i][j - x] || !A[i][j + x]) break; } --x; if (x) { ++cnt; for (int k = 0; k <= x; ++k) { B[i - k][j] = B[i + k][j] = B[i][j - k] = B[i][j + k] = 1; } } } for (int i = 1; i <= N; ++i) for (int j = 1; j <= M; ++j) if (A[i][j] != B[i][j]) { puts( -1 ); return 0; } printf( %d n , cnt); for (int i = 1; i <= N; ++i) for (int j = 1; j <= M; ++j) if (A[i][j]) { int x; for (x = 0;; ++x) { if (!A[i - x][j] || !A[i + x][j] || !A[i][j - x] || !A[i][j + x]) break; } --x; if (x) printf( %d %d %d n , i, j, x); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int k, n, w, t; cin >> k >> n >> w >> t; t = (w * (w + 1) / 2) * k; t = t - n; if (t < 0) cout << 0 ; else cout << t; } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b; scanf( %d%d , &a, &b); if (b > a) printf( -1 n ); else { double ans, a1, a2; a1 = (a + b) / (2.0 * ((a + b) / (2 * b))); a2 = (a - b) / (2.0 * ((a - b) / (2 * b))); printf( %.12lf n , min(a1, a2)); } } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int arr[201]; for (int i = 1; i <= n; ++i) cin >> arr[i]; int brr[201] = {0}, count = 0; for (int i = 1; i <= n; ++i) { if (i == 1 && n >= 2) { if (arr[1] == 1 && arr[2] == 2) brr[i] = 1; } else { if (i == n && n >= 2) { if (arr[n] == 1000 && arr[n - 1] == 999) brr[i] = 1; } else { if (arr[i - 1] == arr[i] - 1 && arr[i + 1] == arr[i] + 1) brr[i] = 1; } } } int t = 0; for (int i = 1; i <= n;) { while (i <= n && brr[i] == 1) { t++; i++; } while (i <= n && brr[i] == 0) { i++; } count = max(count, t); t = 0; } cout << count << endl; } |
#include <bits/stdc++.h> using namespace std; double esp = 1e-11; const double PI = acos(-1.0); const long long int INF = 0x3f3f3f3f; const long long int MOD = 1e9 + 7; const int maxn = 200010; int main() { int a, b, c; scanf( %d%d%d , &a, &b, &c); long double x = (-b + sqrt((long double)b * b - 4 * a * c)) / (2 * a); long double y = (-b - sqrt((long double)b * b - 4 * a * c)) / (2 * a); if (x < y) swap(x, y); printf( %.6f n%.6f n , (double)x, (double)y); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; const int NMAX = 300010; const double E = 1e-8; const double PI = acos(-1); int n, m, stest; int d; set<long long> St; long long st[NMAX], h[NMAX]; pair<int, int> Tree[4 * NMAX]; int dp[NMAX], trace[NMAX]; pair<int, int> cmp(pair<int, int> a, pair<int, int> b) { if (a.first > b.first) return a; else return b; } void update(int i, int lo, int hi, int u, int x, int vt) { if (lo == hi) { Tree[i] = cmp(Tree[i], pair<int, int>(x, vt)); return; } int mid = (lo + hi) >> 1; if (u <= mid) update(2 * i, lo, mid, u, x, vt); else update(2 * i + 1, mid + 1, hi, u, x, vt); Tree[i] = cmp(Tree[2 * i], Tree[2 * i + 1]); } pair<int, int> query(int i, int lo, int hi, int u, int v) { if (v < lo || hi < u) return pair<int, int>(0, 0); if (u <= lo && hi <= v) return Tree[i]; int mid = (lo + hi) >> 1; return cmp(query(2 * i, lo, mid, u, v), query(2 * i + 1, mid + 1, hi, u, v)); } void truy(int x) { if (x == 0) return; truy(trace[x]); cout << x << ; } int main() { ios::sync_with_stdio(false); cin >> n >> d; for (int i = 1; i <= n; i++) { cin >> h[i]; St.insert(h[i]); St.insert(h[i] - d); St.insert(h[i] + d); } for (set<long long>::iterator it = St.begin(); it != St.end(); it++) st[++m] = *it; int ans = 0, vt = 0; for (int i = 1; i <= n; i++) { int pos = lower_bound(st + 1, st + m + 1, h[i]) - st; int u = lower_bound(st + 1, st + m + 1, h[i] - d) - st; int v = lower_bound(st + 1, st + m + 1, h[i] + d) - st; pair<int, int> res = cmp(query(1, 1, m, 1, u), query(1, 1, m, v, m)); dp[i] = res.first + 1; trace[i] = res.second; update(1, 1, m, pos, dp[i], i); if (dp[i] > ans) { ans = dp[i]; vt = i; } } cout << ans << endl; truy(vt); return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; const int MXN = 3e5 + 5; const int MOD = 998244353; const int LOG = 19; int add(int x, int y) { return (x += y) < MOD ? x : x - MOD; } int sub(int x, int y) { return (x -= y) >= 00 ? x : x + MOD; } int mul(int x, int y) { return (ll)x * y % MOD; } int pwr(int x, int p) { if (p == 0) return 1; if (p % 2) return mul(x, pwr(x, p - 1)); return pwr(mul(x, x), p / 2); } int inv(int x) { return pwr(x, MOD - 2); } int sol = 1; int ok[MXN]; int val[MXN]; int dep[MXN]; int lca[MXN]; int nxt[MXN]; int dp[MXN][2]; int anc[MXN][LOG]; vector<int> adj[MXN]; int getlca(int x, int y) { if (dep[x] < dep[y]) swap(x, y); int diff = dep[x] - dep[y]; for (int i = 0; i < LOG; ++i) { if (diff >> i & 1) x = anc[x][i]; } if (x == y) return x; for (int i = LOG - 1; i >= 0; --i) { if (anc[x][i] != anc[y][i]) { x = anc[x][i]; y = anc[y][i]; } } return anc[x][0]; } void dfs1(int x, int p) { if (val[x]) { if (lca[val[x]]) { lca[val[x]] = getlca(lca[val[x]], x); } else { lca[val[x]] = x; } } for (int y : adj[x]) { if (y == p) continue; anc[y][0] = x; dep[y] = dep[x] + 1; for (int i = 0; i < LOG - 1; ++i) { anc[y][i + 1] = anc[anc[y][i]][i]; } dfs1(y, x); } } void dfs2(int x, int p) { vector<int> vec; for (int y : adj[x]) { if (y == p) continue; dfs2(y, x); if (ok[y]) { ok[x] = 1; vec.push_back(y); } if (val[y] && y != lca[val[y]]) { if (val[x] && val[x] != val[y]) { cout << 0 n ; exit(0); } val[x] = val[y]; } } if (val[x]) { dp[x][0] = ok[x] = 1; for (int y : vec) { sol = mul(sol, add(mul(dp[y][0], nxt[y] + 1), dp[y][1])); } } else if (vec.size() > 1) { dp[x][1] = 1; for (int y : vec) { int tmp = add(dp[y][1], mul(dp[y][0], nxt[y] + 1)); dp[x][1] = mul(dp[x][1], tmp); } for (int y : vec) { int tmp = add(dp[y][1], mul(dp[y][0], nxt[y] + 1)); dp[x][0] = add(dp[x][0], mul(mul(dp[x][1], inv(tmp)), dp[y][0])); } } else if (vec.size() == 1) { dp[x][0] = dp[vec[0]][0]; dp[x][1] = dp[vec[0]][1]; nxt[x] = nxt[vec[0]] + 1; } } int main() { ios::sync_with_stdio(0), cin.tie(0); int n, k; cin >> n >> k; for (int i = 1; i <= n; ++i) { cin >> val[i]; } for (int i = 2; i <= n; ++i) { int x, y; cin >> x >> y; adj[x].push_back(y); adj[y].push_back(x); } dfs1(1, 0); dfs2(1, 0); if (dp[1][0]) sol = mul(sol, dp[1][0]); cout << sol << n ; } |
#include <bits/stdc++.h> using namespace std; int l[100000 + 9], r[100000 + 9]; int n, p; int main() { cin >> n >> p; for (int i = 0; i < n; i++) { cin >> l[i] >> r[i]; } double ans = 0; for (int i = 0; i < n; i++) { int j = (i + 1) % n; int div1 = r[i] / p - (l[i] - 1) / p; int nondiv1 = r[i] - l[i] + 1 - div1; int div2 = r[j] / p - (l[j] - 1) / p; int nondiv2 = r[j] - l[j] + 1 - div2; double nondivs = 1.0 - ((double)nondiv1 / double(r[i] - l[i] + 1)) * ((double)nondiv2 / double(r[j] - l[j] + 1)); ans += nondivs * 2000.0; } cout << fixed << setprecision(15) << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int main(int argc, char *argv[]) { ios::sync_with_stdio(false); cin.tie(nullptr); string s, t; cin >> s >> t; int ns = s.size() - 1; int nt = t.size() - 1; bool stop = true; while (stop && (ns >= 0 && nt >= 0)) { if (s[ns] != t[nt]) { stop = false; } if (stop) { ns--; nt--; } } int r = ns + nt + 2; cout << r; return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = 1e9; const long long inf64 = 1e18; const int mod = inf + 7; inline int _sum(int a, int b) { return a + b < mod ? a + b : a + b - mod; } inline int _mul(int a, int b) { return (1ll * a * b) % mod; } inline int _sub(int a, int b) { return a >= b ? a - b : a - b + mod; } inline void _inc(int& x, int y) { if ((x += y) >= mod) { x -= mod; } } inline void _dec(int& x, int y) { if ((x -= y) < 0) { x += mod; } } inline int _binpow(int x, int pw) { int res = 1; int tmp = x; while (pw > 0) { if (pw & 1) { res = _mul(res, tmp); } tmp = _mul(tmp, tmp); pw >>= 1; } return res; } inline int _div(int a, int b) { return _mul(a, _binpow(b, mod - 2)); } void read(string& s) { cin >> s; } void gen(string& s) { mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count()); int n = 2 * (rnd() % 3 + 1); s.resize(n, ? ); for (int i = 0; i < n; i++) { s[i] = rnd() % 5 == 0 ? a : b ; } } string join_halfs(string s) { int n = (int)s.size(); string t; for (int i = 0; i < n / 2; i++) { t.push_back(s[i]); t.push_back(s[n - 1 - i]); } return t; } int slow(string s) { s = join_halfs(s); int n = (int)s.size(); s = # + s; vector<int> dp(n + 1); dp[0] = 1; cout << s << n ; for (int i = 1; i <= n; i++) { for (int j = i; j >= 1; j--) { if ((i - j + 1) % 2) continue; string hlp = s.substr(j, i - j + 1); string rhlp = hlp; reverse(rhlp.begin(), rhlp.end()); if (hlp == rhlp) { _inc(dp[i], dp[j - 1]); } } } return dp[n]; } const int N = 2e6 + 5; struct Node { map<int, int> nxt; int link = -1; int dp = 0; int slink = -1; int len = 0; int diff = 0; Node() = default; }; Node t[N]; int sz, max_suff; int fast(string s) { { sz = 0; t[sz++] = Node(); t[sz++] = Node(); max_suff = 1; t[0].link = 1; t[1].link = 0; t[0].len = -1; t[1].len = 0; } int n = (int)s.size(); s = # + join_halfs(s); vector<int> dp(n + 1); dp[0] = 1; max_suff = 1; for (int i = 1; i <= n; i++) { { while (s[i] != s[i - t[max_suff].len - 1]) { max_suff = t[max_suff].link; } if (!t[max_suff].nxt.count(s[i])) { t[sz++] = Node(); t[sz - 1].len = t[max_suff].len + 2; int next_max_suff = t[max_suff].link; while (s[i] != s[i - t[next_max_suff].len - 1]) { next_max_suff = t[next_max_suff].link; } t[sz - 1].link = t[next_max_suff].nxt.count(s[i]) ? t[next_max_suff].nxt[s[i]] : 1; t[sz - 1].diff = t[sz - 1].len - t[t[sz - 1].link].len; if (t[sz - 1].diff == t[t[sz - 1].link].diff) { t[sz - 1].slink = t[t[sz - 1].link].slink; } else { t[sz - 1].slink = t[sz - 1].link; } t[max_suff].nxt[s[i]] = sz - 1; } max_suff = t[max_suff].nxt[s[i]]; } for (int x = max_suff; t[x].len > 0; x = t[x].slink) { { int j = i - t[t[x].slink].len - t[x].diff; t[x].dp = dp[j]; } if (t[x].diff == t[t[x].link].diff) { _inc(t[x].dp, t[t[x].link].dp); } if (i % 2 == 0) { _inc(dp[i], t[x].dp); } } } return dp[n]; } void WORK() { string s; read(s); cout << fast(s) << n ; } void TEST() { while (1) { string s; gen(s); cout << s = << s << endl; int sl = slow(s); int fs = fast(s); if (sl == fs) { cout << OK ( << fs << ) << endl; } else { cout << WA << endl; cout << exp = << sl << endl; cout << fnd = << fs << endl; break; } } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); WORK(); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long maxm = 3e5 + 5; const long long mod = 998244353; long long fac[maxm], inv[maxm]; long long l[maxm], r[maxm]; pair<long long, long long> p[25]; long long sum[maxm][45]; long long num[maxm]; long long n, m; long long ppow(long long a, long long b, long long mod) { long long ans = 1 % mod; a %= mod; while (b) { if (b & 1) ans = ans * a % mod; a = a * a % mod; b >>= 1; } return ans; } void init() { fac[0] = 1; for (long long i = 1; i < maxm; i++) fac[i] = fac[i - 1] * i % mod; inv[maxm - 1] = ppow(fac[maxm - 1], mod - 2, mod); for (long long i = maxm - 2; i >= 0; i--) inv[i] = inv[i + 1] * (i + 1) % mod; } long long cal(long long x) { long long ans = 0; while (x) { ans++; x &= (x - 1); } return ans; } long long C(long long n, long long m) { if (m < 0 || m > n) return 0; return fac[n] * inv[m] % mod * inv[n - m] % mod; } signed main() { ios::sync_with_stdio(0); init(); cin >> n >> m; for (long long i = 1; i <= n; i++) { cin >> l[i] >> r[i]; } for (long long i = 0; i < m; i++) { cin >> p[i].first >> p[i].second; } for (long long i = 1; i <= n; i++) { num[l[i]]++; num[r[i] + 1]--; } for (long long i = 1; i <= n; i++) { num[i] += num[i - 1]; } for (long long i = 1; i <= n; i++) { for (long long j = 0; j <= m * 2; j++) { sum[i][j] = (sum[i - 1][j] + C(num[i] - j, i - j)) % mod; } } long long ans = 0; for (long long i = 0; i < (1 << m); i++) { set<long long> s; for (long long j = 0; j < m; j++) { if (i >> j & 1) { s.insert(p[j].first); s.insert(p[j].second); } } long long tot = s.size(); long long L = 1, R = n; for (auto x : s) { L = max(L, l[x]); R = min(R, r[x]); } if (L > R) continue; long long t = (sum[R][tot] - sum[L - 1][tot] + mod) % mod; if (cal(i) & 1) { ans = (ans - t + mod) % mod; } else { ans = (ans + t) % mod; } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 5, R = 1e4; int n, l[N], r[N]; long long cnt[R + 1]; double all; bool used[N]; long long f(int cur, int c, int mn, int x = N) { if (cur == n) { if (mn > 0) { return 0; } long long cnt = 1; for (int i = 0; i < n; i++) { if (!used[i] && i != x) { cnt *= max(0, min(c, r[i] + 1) - l[i]); } } return cnt; } long long cnt = f(cur + 1, c, mn, x); if (cur != x && l[cur] <= c && c <= r[cur]) { used[cur] = true; cnt += f(cur + 1, c, mn - 1, x); used[cur] = false; } return cnt; } int main() { scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d%d , l + i, r + i); } for (int cur = 0; cur <= R; cur++) { long long sum = 0; for (int i = 0; i < n; i++) { sum += f(0, cur, 1, i) * max(0, r[i] - max(cur, l[i] - 1)); } sum += f(0, cur, 2); all += sum; cnt[cur] = sum; } double ans = 0; for (int i = 0; i <= R; i++) { ans += cnt[i] / all * i; } printf( %.10f , ans); } |
#include <bits/stdc++.h> using namespace std; int i, n, k, x, ans, c; pair<int, int> a[100005]; int main() { cin >> n >> k; for (i = 0; i < n; i++) { cin >> x; a[i].first = 10 - x % 10; a[i].second = x; } sort(a, a + n); for (i = 0; i < n; i++) { if (a[i].second < 100 && (k - (10 - a[i].second % 10) >= 0)) { a[i].second += 10 - a[i].second % 10; k -= a[i].first; } else { break; } if (i == n - 1) { break; } } for (i = 0; i < n; i++) { ans += a[i].second / 10; } cout << min(n * 10, ans + k / 10); } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m, h; cin >> n >> m >> h; int f[m]; int l[n]; int t[n][m]; int ans[n][m]; for (int i = 0; i < m; i++) cin >> f[i]; for (int i = 0; i < n; i++) cin >> l[i]; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) { cin >> t[i][j]; if (t[i][j] == 1) { ans[i][j] = 1; } } memset(ans, 0, sizeof(ans)); for (int i = 0; i < m; i++) { int h1 = f[i]; for (int j = 0; j < n; j++) { if (t[j][i] == 1 && l[j] >= h1) { ans[j][i] = h1; } } } for (int i = 0; i < n; i++) { int h1 = l[i]; for (int j = 0; j < m; j++) { if (t[i][j] == 1 && f[j] >= h1) { ans[i][j] = h1; } } } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cout << ans[i][j] << ; } cout << endl; } } |
#include <bits/stdc++.h> using namespace std; int main() { int n, i, now, t, mx, gcd, m, a[107]; scanf( %d , &n); for (i = 0; i ^ n; i++) { scanf( %d , a + i); } sort(a, a + n); mx = gcd = a[0]; m = 1; for (i = 1; i ^ n; i++) { if (a[i - 1] != a[i]) { mx = mx < a[i] ? a[i] : mx; m++; now = a[i]; while (gcd) { t = now; now = gcd; gcd = t % gcd; } gcd = now; } } mx /= gcd; mx -= m; printf(mx & 1 ? Alice n : Bob n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int a[100009]; int b[100009]; int main() { int n; cin >> n; map<int, int> mp; for (int i = 0; i < n; i++) { cin >> a[i]; mp[a[i]]++; } for (int j = 0; j < n; j++) { cin >> b[j]; mp[b[j]]++; } int c = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (mp.find(a[i] xor b[j]) != mp.end()) c++; } } if (c & 1) { cout << Koyomi n ; } else { cout << Karen n ; } } |
#include <bits/stdc++.h> using namespace std; signed main() { int n; cin >> n; int ar[n]; for (int i = 0; i < n; i++) cin >> ar[i]; int max_n = pow(2, n); bool ans = false; for (int i = 0; i < max_n; i++) { int temp = i; int val = 0; for (int j = 0; j < n; j++) { if (temp & 1) { val = (val + ar[j]) % 360; } else { val = (val - ar[j] + 360) % 360; } temp = temp >> 1; } if (val == 0) { ans = true; break; } } if (ans) { cout << YES n ; } else { cout << NO n ; } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize(2) using namespace std; const int INF = 0x3f3f3f3f; const int GRAPH_SIZE = 20010; int pin[GRAPH_SIZE], dep[GRAPH_SIZE], s = 0, t = GRAPH_SIZE - 1; struct EDGE { int u, v, c; }; vector<EDGE> e; vector<int> each[GRAPH_SIZE]; bool bfs() { queue<int> Q; Q.push(s); while (!Q.empty()) { int now = Q.front(); Q.pop(); for (auto it : each[now]) { int next = e[it].v; if (e[it].c) if (dep[next] > dep[now] + 1) { dep[next] = dep[now] + 1; Q.push(next); } } } return dep[t] != INF; } int dfs(int now, int flow) { if (now == t) { return flow; } for (int& i = pin[now]; i < each[now].size(); i++) { int it = each[now][i]; if (e[it].c && dep[e[it].v] == dep[now] + 1) { int tmp; if (tmp = dfs(e[it].v, min(flow, e[it].c))) { e[it].c -= tmp; e[it ^ 1].c += tmp; return tmp; } } } return 0; } int Dinic() { int max_flow = 0; for (int i = 0; i < GRAPH_SIZE; ++i) { dep[i] = INF; } dep[s] = 0; while (bfs()) { for (int i = 0; i < GRAPH_SIZE; ++i) { pin[i] = 0; } int tmp; while (tmp = dfs(s, INF)) { max_flow += tmp; } for (int i = 0; i < GRAPH_SIZE; ++i) { dep[i] = INF; } dep[s] = 0; } return max_flow; } void make_edge(int U, int V, int C) { EDGE tmp; tmp.u = U; tmp.v = V; tmp.c = C; e.push_back(tmp); each[U].push_back(e.size() - 1); swap(tmp.u, tmp.v); tmp.c = 0; e.push_back(tmp); each[V].push_back(e.size() - 1); } void init() { e.clear(); for (int i = 0; i < GRAPH_SIZE; ++i) { each[i].clear(); } } vector<pair<int, pair<int, int> > > edges; int n; int m; bool check(int x) { init(); for (int i = 1; i <= n; ++i) make_edge(s, i, 1); for (int i = 1; i <= n; ++i) make_edge(i + n, t, 1); for (int i = 0; i < x; ++i) { make_edge(edges[i].second.first, edges[i].second.second + n, 1); } if (Dinic() == n) return true; return false; } int main() { ios::sync_with_stdio(false); cin >> n >> m; for (int i = 1; i <= m; ++i) { int u, v, d; cin >> u >> v >> d; edges.push_back(make_pair(d, make_pair(u, v))); } sort(edges.begin(), edges.end()); if (!check(m)) { cout << -1 << endl; return 0; } int l = 1, r = m; while (l < r) { int mid = (l + r) >> 1; if (check(mid)) { r = mid; } else { l = mid + 1; } } cout << edges[l - 1].first << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, i, j, x1, x2, y1, y2; cin >> n; vector<string> a(n); for (i = 0; i < n; i++) cin >> a[i]; x1 = 0; y1 = 0; while (a[x1][y1] == 0 && (x1 <= n - 1 || y1 < n - 1)) if (y1 == n - 1) { y1 = 0; x1++; } else y1++; x2 = n - 1; y2 = n - 1; while (a[x2][y2] == 0 && (x2 > 0 || y2 > 0)) if (y2 == 0) { y2 = n - 1; x2--; } else y2--; bool f = true; if (x1 > x2 || y1 > y2) f = false; if (a[x1][y1] != 1 ) f = false; if (a[x1][y2] != 1 ) f = false; if (a[x2][y1] != 1 ) f = false; if (a[x2][y2] != 1 ) f = false; for (i = y1 + 1; i < y2; i++) if (a[x1][i] != 2 || a[x2][i] != 2 ) f = false; for (i = x1 + 1; i < x2; i++) if (a[i][y1] != 2 || a[i][y2] != 2 ) f = false; for (i = x1 + 1; i < x2; i++) for (j = y1 + 1; j < y2; j++) if (a[i][j] != 4 ) f = false; for (i = 0; i < x1; i++) for (j = 0; j < n; j++) if (a[i][j] != 0 ) f = false; for (i = x2 + 1; i < n; i++) for (j = 0; j < n; j++) if (a[i][j] != 0 ) f = false; for (i = 0; i < n; i++) for (j = 0; j < y1; j++) if (a[i][j] != 0 ) f = false; for (i = 0; i < n; i++) for (j = y2 + 1; j < n; j++) if (a[i][j] != 0 ) f = false; if (f) cout << Yes << endl; else cout << No << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; int tt = 1; cin >> tt; for (int tc = 1; tc <= tt; tc++) { int a; cin >> a; if (360 % (180 - a)) cout << NO n ; else cout << YES n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007; long long dp[57 + 7][57 + 7]; long long mdp[57 + 7][57 + 7]; bool vis[57 + 7][57 + 7]; int n, K; long long ncr[57 + 7][57 + 7]; int L, R; long long func(int l, int r, int i, int j, int k, int m) { long long ret = (ncr[l][i] * ncr[r][j]) % mod; ret = (ret * ncr[L - l + i][k]) % mod; ret = (ret * ncr[R - r + j][m]) % mod; return ret; } void back(int l, int r) { if (vis[l][r]) return; mdp[l][r] = 200000007; dp[l][r] = 0; vis[l][r] = true; if (l == 0 && r == 0) { mdp[l][r] = 0; dp[l][r] = 1; return; } if (l * 50 + r * 100 <= K) { mdp[l][r] = 1; dp[l][r] = 1; return; } for (int i = 0; i <= l && i * 50 <= K; i++) { for (int j = 0; j <= r; j++) { if (i == 0 && j == 0) continue; if (i * 50 + j * 100 > K) break; for (int k = 0; k <= L - l + i; k++) { for (int m = 0; m <= R - r + j; m++) { if (k * 50 + m * 100 == 0) continue; if (k * 50 + m * 100 > K) break; if (l * 50 + r * 100 <= (l - i + k) * 50 + (r - j + m) * 100) continue; back(l - (i - k), r - (j - m)); mdp[l][r] = min(mdp[l][r], mdp[l - i + k][r - j + m] + 2); } } } } for (int i = 0; i <= l && i * 50 <= K; i++) { for (int j = 0; j <= r; j++) { if (i == 0 && j == 0) continue; if (i * 50 + j * 100 > K) break; for (int k = 0; k <= L - l + i; k++) { for (int m = 0; m <= R - r + j; m++) { if (k * 50 + m * 100 == 0) continue; if (k * 50 + m * 100 > K) break; if (l * 50 + r * 100 <= (l - i + k) * 50 + (r - j + m) * 100) continue; if (mdp[l - i + k][r - j + m] + 2 == mdp[l][r]) { dp[l][r] += (func(l, r, i, j, k, m) * dp[l - i + k][r - j + m]) % mod; dp[l][r] %= mod; } } } } } } int main() { ncr[0][0] = 1; for (int i = 1; i <= 57; i++) { ncr[i][0] = 1; ncr[i][i] = 1; ncr[i][1] = i; } for (int i = 2; i <= 57; i++) { for (int j = 2; j < i; j++) { ncr[i][j] = (ncr[i - 1][j - 1] + ncr[i - 1][j]) % mod; } } scanf( %d%d , &n, &K); int l = 0; int r = 0; for (int i = 1; i <= n; i++) { int v; scanf( %d , &v); if (v == 50) l++; else r++; } L = l; R = r; back(l, r); if (mdp[l][r] != 200000007) { printf( %d n , (int)mdp[l][r]); printf( %d n , (int)dp[l][r]); } else { printf( -1 n0 n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 410, MOD = 10007; char s[maxn]; int n, m, mat_s; typedef long long Mat[maxn][maxn]; void print(Mat A) { for (int i = 0; i < (mat_s); i++) { for (int j = 0; j < (mat_s); j++) { cout << A[i][j] << ; } cout << endl; } cout << endl; } void mat_mul(Mat A, Mat B, Mat res) { static Mat C; memset(C, 0, sizeof(C)); for (int i = 0; i < (mat_s); i++) for (int k = (i); k <= (mat_s - 1); k++) for (int j = (k); j <= (mat_s - 1); j++) { C[i][j] += A[i][k] * B[k][j]; } for (int i = 0; i < (mat_s); i++) for (int j = 0; j < (mat_s); j++) { C[i][j] %= MOD; } memcpy(res, C, sizeof(C)); } void mat_pow(Mat A, long long k, Mat res) { static Mat a, r; memcpy(a, A, sizeof(a)); memset(r, 0, sizeof(r)); for (int i = 0; i < (mat_s); i++) r[i][i] = 1; while (k) { if (k & 1) { mat_mul(r, a, r); } if (!(k >>= 1)) { break; } mat_mul(a, a, a); } memcpy(res, r, sizeof(r)); } int dp[210][210][210]; int rec(int l, int r, int n24) { int& res = dp[l][r][n24]; if (~res) { return res; } if (l == r) { return res = !n24; } if (s[l] == s[r]) { if (l + 1 == r) { return res = !n24; } return res = rec(l + 1, r - 1, n24); } else { if (n24 > 0) { return res = (rec(l + 1, r, n24 - 1) + rec(l, r - 1, n24 - 1)) % MOD; } else { return res = 0; } } } int n24, n25, n26, times; int mat_at(Mat A, int c24, int c25) { int i24 = n24 - c24; int i25 = n24 + c25 - 1; int i26 = i25 + n25; return A[i24][i26]; } int main() { scanf( %s%d , s, &n); m = strlen(s); n += m; times = (n + 1) >> 1; n24 = m - 1; n26 = n25 = (m + 1) >> 1; mat_s = n24 + n25 + n26; static Mat A, B; for (int i = 0; i < (mat_s); i++) { if (i < n24) { A[i][i] = 24; A[i][i + 1] = 1; } else if (i < n24 + n25) { A[i][i] = 25; if (i + 1 < n24 + n25) { A[i][i + 1] = 1; } A[i][i + n25] = 1; } else { A[i][i] = 26; } } mat_pow(A, times - 1, B); mat_mul(B, A, A); int ans = 0; memset(dp, -1, sizeof(dp)); for (int c24 = 0; c24 < (m); c24++) { int c25 = (m - c24 + 1) >> 1; if (times - c24 - c25 < 0) { continue; } int ways = rec(0, m - 1, c24); ans = (ans + ways * mat_at(A, c24, c25)) % MOD; if ((n & 1) && (!((m - c24) & 1))) { ans = (ans + MOD - ways * B[n24 - c24][n24 + c25 - 1] % MOD) % MOD; } } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; bool cmp(pair<long long int, long long int> pa1, pair<long long int, long long int> pa2) { return pa1.second < pa2.second; } int main() { long long int n, k, i, mn, cnt; cin >> n >> k; long long int a[5001]; for (i = 0; i < n; i++) cin >> a[i]; long long int has[5001] = {0}; for (i = 0; i < n; i++) { has[a[i]]++; } mn = *max_element(has, has + 5001); if (mn <= k && k <= n) { cout << YES n ; pair<long long int, long long int> pa[5001]; for (i = 0; i < n; i++) { pa[i].first = a[i]; pa[i].second = i; } sort(pa, pa + n); cnt = 1; for (i = 0; i < n; i++) { pa[i].first = cnt; cnt++; if (cnt == k + 1) cnt = 1; } sort(pa, pa + n, cmp); for (i = 0; i < n; i++) cout << pa[i].first << ; } else cout << NO ; } |
#include <bits/stdc++.h> using namespace std; int f[150000]; int find(int x) { if (x == f[x]) return f[x]; else { return f[x] = find(f[x]); } } int a[150000]; int num[150000]; int main() { ios::sync_with_stdio(false); int n, m; while (cin >> n >> m) { memset(a, 0, sizeof(a)); memset(num, 0, sizeof(num)); for (int i = 1; i <= n; i++) f[i] = i; for (int i = 0; i < m; i++) { int x, y; cin >> x >> y; a[x]++; a[y]++; x = find(x), y = find(y); if (x != y) f[x] = y; } for (int i = 1; i <= n; i++) { find(i); } for (int i = 1; i <= n; i++) { num[f[i]]++; } bool flag = true; for (int i = 1; i <= n; i++) { if (a[i] != num[f[i]] - 1) { flag = false; break; } } if (flag) cout << YES << endl; else cout << NO << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; struct node { int tim, a, b, id; bool operator<(const node& aa) const { return tim < aa.tim; } } a[N]; deque<node> s[5], rt[5]; int vis[N]; vector<int> ad, de; int main() { int n, m, k; scanf( %d%d%d , &n, &m, &k); for (int i = 1; i <= n; i++) scanf( %d%d%d , &a[i].tim, &a[i].a, &a[i].b), a[i].id = i; sort(a + 1, a + 1 + n); int na = 0, nb = 0, ans = 2e9; for (int i = 1; i <= n; i++) { int ne = 0; if (a[i].a) ne |= 1; if (a[i].b) ne |= 2; rt[ne].push_back(a[i]); } int sum = 0; int x = (int)rt[1].size(), y = (int)rt[2].size(); int mi = min(x, y); if ((int)rt[3].size() + min(mi, (m - (int)rt[3].size()) / 2) < k) return 0 * printf( -1 n ); while (s[3].size() + min(mi, (m - (int)s[3].size()) / 2) < k || s[3].size() + rt[1].size() + rt[2].size() + rt[0].size() < m) { s[3].push_back(rt[3].front()); sum += rt[3].front().tim; vis[rt[3].front().id] = 1; rt[3].pop_front(); } int ned = k - s[3].size(); for (int i = 1; i <= ned; i++) { s[2].push_back(rt[2].front()); sum += rt[2].front().tim; vis[rt[2].front().id] = 1; rt[2].pop_front(); s[1].push_back(rt[1].front()); sum += rt[1].front().tim; vis[rt[1].front().id] = 1; rt[1].pop_front(); } int res = m - s[3].size() - max(0, 2 * (k - (int)s[3].size())); for (int i = 1; i <= res; i++) { int add = -1; if (rt[0].size()) add = 0; if (rt[1].size() && (add == -1 || rt[add].front().tim > rt[1].front().tim)) add = 1; if (rt[2].size() && (add == -1 || rt[add].front().tim > rt[2].front().tim)) add = 2; s[add].push_back(rt[add].front()); sum += rt[add].front().tim; vis[rt[add].front().id] = 1; rt[add].pop_front(); } ans = sum; for (; rt[3].size() && s[3].size() < m;) { sum = ans; ad.clear(), de.clear(); s[3].push_back(rt[3].front()); ad.push_back(rt[3].front().id); sum += rt[3].front().tim; rt[3].pop_front(); int num = 0; if (s[2].size()) { rt[2].push_front(s[2].back()); de.push_back(s[2].back().id); sum -= s[2].back().tim; s[2].pop_back(); num++; } if (s[1].size()) { rt[1].push_front(s[1].back()); de.push_back(s[1].back().id); sum -= s[1].back().tim; s[1].pop_back(); num++; } if (s[0].size()) { rt[0].push_front(s[0].back()); de.push_back(s[0].back().id); sum -= s[0].back().tim; s[0].pop_back(); num++; } while (num > 1) { int add = -1; if (rt[0].size()) add = 0; if (rt[1].size() && (add == -1 || rt[add].front().tim > rt[1].front().tim)) add = 1; if (rt[2].size() && (add == -1 || rt[add].front().tim > rt[2].front().tim)) add = 2; s[add].push_back(rt[add].front()); sum += rt[add].front().tim; ad.push_back(rt[add].front().id); rt[add].pop_front(); num--; } if (sum < ans) { for (int i : ad) vis[i]++; for (int i : de) vis[i]--; ans = sum; } } printf( %d n , ans); for (int i = 1; i <= n; i++) if (vis[i]) printf( %d , i); printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, c, a[100005], sign[100005]; bool sign_ch[100005]; int main() { cin >> n; for (int i = 1; i <= n; ++i) cin >> a[i]; sign[n] = 1; c = a[n]; for (int i = n - 1; i >= 1; i--) { if (c >= a[i]) { c -= a[i]; sign[i] = -1; } else { c = a[i] - c; sign[i] = 1; sign_ch[i + 1] = true; } } int flip = 0; for (int i = 1; i <= n; i++) { if (sign_ch[i] == true) flip = !flip; char ch; ch = sign[i] == 1 ? + : - ; if (flip) ch = ch == + ? - : + ; putchar(ch); } putchar( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, r[1010], c[1010], rc[1010], rr[1010], tr[1010], tc[1010], rtc[1010], rtr[1010]; class portal { public: int ix, iy, ox, oy; }; vector<portal> ans; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &r[i]); rr[r[i]] = i; } for (int i = 1; i <= n; i++) { scanf( %d , &c[i]); rc[c[i]] = i; } for (int i = 1; i <= n; i++) tr[i] = tc[i] = rtr[i] = rtc[i] = i; for (int i = 1; i <= n; i++) { if (tc[i] == rc[i] && tr[i] == rr[i]) continue; ans.push_back((portal){i, rtc[rc[i]], rtr[rr[i]], i}); int t1 = tc[i], t2 = tr[i]; swap(tc[i], tc[rtc[rc[i]]]); swap(tr[i], tr[rtr[rr[i]]]); swap(rtc[rc[i]], rtc[t1]); swap(rtr[rr[i]], rtr[t2]); } printf( %d n , ans.size()); for (portal x : ans) printf( %d %d %d %d n , x.ix, x.iy, x.ox, x.oy); return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> row, col, A; vector<pair<pair<int, int>, int> > mat; int grid[111][111]; void shift_up(int c, int n, int m) { int i, temp; temp = grid[n][c]; for (i = n; i > 1; i--) grid[i][c] = grid[i - 1][c]; grid[1][c] = temp; } void shift_left(int r, int n, int m) { int i, temp; temp = grid[r][m]; for (i = m; i > 1; i--) grid[r][i] = grid[r][i - 1]; grid[r][1] = temp; } int main() { int n, q, i, m, j, type, id, r, c, x; cin >> n >> m >> q; for (i = 1; i <= n; i++) for (j = 1; j <= m; j++) grid[i][j] = 0; while (q--) { cin >> type; A.push_back(type); if (type == 2) { cin >> id; col.push_back(id); } else if (type == 1) { cin >> id; row.push_back(id); } else { cin >> r >> c >> x; mat.push_back(make_pair(make_pair(r, c), x)); } } int im = mat.size() - 1, ir = row.size() - 1, ic = col.size() - 1; for (i = A.size() - 1; i >= 0; i--) { type = A[i]; if (type == 2) { c = col[ic]; ic--; shift_up(c, n, m); } else if (type == 1) { r = row[ir]; ir--; shift_left(r, n, m); } else { r = mat[im].first.first; c = mat[im].first.second; x = mat[im].second; grid[r][c] = x; im--; } } for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) cout << grid[i][j] << ; cout << n ; } } |
#include <bits/stdc++.h> using namespace std; int main() { int n, x; cin >> n >> x; if (n == 3) { cout << >vv << endl << ^<. << endl << ^.< << endl; cout << 1 << << 3; } if (n == 5) { cout << >...v << endl << v.<.. << endl << ..^.. << endl << >.... << endl << ..^.< << endl; cout << 1 << << 1; } if (n == 100) { cout << >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>.>.>.>.>.>.>.>.>.> .>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.v << endl; for (int i = 0; i < 49; i++) { cout << ^v.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<<<<<<<<< <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< << endl; cout << ^>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>.>.>.>.>.>.>.>.> .>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.v << endl; } cout << ^<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<<<<<<<<<<< <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< << endl; cout << 1 << << 1; } } |
#include <bits/stdc++.h> using namespace std; struct sir { int val, ind; }; sir sv[200005]; int n, m, k, v[200005], part[200005], t = 0; long long sum = 0; bool B[200005]; bool comp(sir X, sir Y) { return X.val > Y.val; } int main() { cin >> n >> m >> k; for (int i = 1; i <= n; ++i) { cin >> v[i]; sv[i].val = v[i]; sv[i].ind = i; } sort(sv + 1, sv + n + 1, comp); for (int i = 1; i <= m * k; ++i) { B[sv[i].ind] = 1; sum += sv[i].val; } int nr = 0; for (int i = 1; i <= n; ++i) { if (B[i]) nr++; if (nr == m && t < k - 1) { nr = 0; part[++t] = i; } } cout << sum << n ; for (int i = 1; i <= t; ++i) cout << part[i] << ; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; for (int i = 0; i < n; ++i) { for (int x = 0; x < n; ++x) if (i == x) cout << k << ; else cout << 0 << ; cout << endl; } } |
#include <bits/stdc++.h> using namespace std; long long h[100000]; int main() { int n; cin >> n; for (int j = 0; j < n; ++j) { cin >> h[j]; } long long max = h[n - 1]; long long answer[100000]; answer[n - 1] = 0; for (int i = n - 2; i >= 0; --i) { if (h[i] > max) { max = h[i]; answer[i] = 0; } else { answer[i] = max - h[i] + 1; } } for (int i = 0; i < n; ++i) { cout << answer[i] << ; } cout << endl; } |
#include <bits/stdc++.h> using namespace std; int n, m; vector<pair<int, int>> parent[1000001], hv[1000001], vv[1000001]; vector<vector<pair<int, int>>> edges[1000001]; vector<int> vals[1000001], done[1000001]; pair<int, int> get(pair<int, int> x) { pair<int, int> k = parent[x.first][x.second]; if (parent[k.first][k.second] == k) return k; else return parent[k.first][k.second] = get(k); } void unite(pair<int, int> a, pair<int, int> c) { a = get(a), c = get(c); if (a == c) return; parent[c.first][c.second] = a; } int dp(pair<int, int> x) { x = get(x); if (edges[x.first][x.second].size() == 0) return 1; if (done[x.first][x.second]) return done[x.first][x.second]; sort(edges[x.first][x.second].begin(), edges[x.first][x.second].end()); edges[x.first][x.second].erase( unique(edges[x.first][x.second].begin(), edges[x.first][x.second].end()), edges[x.first][x.second].end()); int ans = 0; for (pair<int, int> i : edges[x.first][x.second]) ans = max(ans, dp(i)); return done[x.first][x.second] = (ans + 1); } int main() { cin >> n >> m; for (int i = 0; i < m; i++) parent[i].resize(n), edges[i].resize(n), vals[i].resize(n), done[i].resize(n); for (int j = 0; j < n; j++) for (int i = 0; i < m; i++) { pair<int, int> x = make_pair(i, j); scanf( %d , &vals[x.first][x.second]), parent[x.first][x.second] = x; vv[i].push_back(make_pair(vals[x.first][x.second], j)), hv[j].push_back(make_pair(vals[x.first][x.second], i)); } for (int i = 0; i < m; i++) { sort(vv[i].begin(), vv[i].end()); for (int j = 0; j < n - 1; j++) if (vv[i][j].first == vv[i][j + 1].first) unite(make_pair(i, vv[i][j].second), make_pair(i, vv[i][j + 1].second)); } for (int j = 0; j < n; j++) { sort(hv[j].begin(), hv[j].end()); for (int i = 0; i < m - 1; i++) if (hv[j][i].first == hv[j][i + 1].first) unite(make_pair(hv[j][i].second, j), make_pair(hv[j][i + 1].second, j)); } for (int i = 0; i < m; i++) for (int j = 0; j < n - 1; j++) if (vv[i][j].first < vv[i][j + 1].first) { pair<int, int> a = get(make_pair(i, vv[i][j + 1].second)); pair<int, int> c = get(make_pair(i, vv[i][j].second)); edges[a.first][a.second].push_back(c); } for (int j = 0; j < n; j++) for (int i = 0; i < m - 1; i++) if (hv[j][i].first < hv[j][i + 1].first) { pair<int, int> a = get(make_pair(hv[j][i + 1].second, j)); pair<int, int> c = get(make_pair(hv[j][i].second, j)); edges[a.first][a.second].push_back(c); } for (int j = 0; j < n; j++) { for (int i = 0; i < m; i++) printf( %d , dp(make_pair(i, j))); printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; const int N = 1e6 + 10; string s[101]; string x; long long dp[101]; long long n; int m; int fail[N]; struct matrix { long long v[4][4]; matrix() { for (int i = 0; i < 4; i++) for (int j = 0; j < 4; j++) v[i][j] = 0; } matrix(long long u[4][4]) { for (int i = 0; i < 4; i++) for (int j = 0; j < 4; j++) v[i][j] = u[i][j]; } matrix operator*(const matrix a) const { matrix ans; for (int i = 0; i < 4; i++) for (int j = 0; j < 4; j++) for (int k = 0; k < 4; k++) { ans.v[i][j] += (v[i][k] * a.v[k][j]); ans.v[i][j] = (ans.v[i][j] + mod) % mod; } return ans; } void setunit() { for (int i = 0; i < 4; i++) v[i][i] = 1; } }; long long mtx[4][4] = { {1, 2, -1, -1}, {1, 0, 0, 0}, {0, 1, 0, 0}, {0, 0, 1, 0}, }; matrix calc(long long i) { matrix tmp(mtx); matrix ans; ans.setunit(); while (i) { if (i & 1ll) ans = tmp * ans; tmp = tmp * tmp; i = i / 2ll; } return ans; } long long kmp(int p) { int m = x.length(), n = s[p].length(); if (m > n) return 0; for (int i = 1, j = fail[0] = -1; i < m; i++) { while (j >= 0 && x[j + 1] != x[i]) j = fail[j]; if (x[j + 1] == x[i]) j++; fail[i] = j; } int ans = 0; for (int i = 0, j = -1; i < n; i++) { while (j >= 0 && x[j + 1] != s[p][i]) j = fail[j]; if (x[j + 1] == s[p][i]) j++; if (j == m - 1) { ans++; j = fail[j]; } } return (long long)ans; } long long calc(int a, int b) { string p = s[a] + s[b]; int s1 = s[a].length(); int m = x.length(), n = p.length(); if (m > n) return 0; for (int i = 1, j = fail[0] = -1; i < m; i++) { while (j >= 0 && x[j + 1] != x[i]) j = fail[j]; if (x[j + 1] == x[i]) j++; fail[i] = j; } int ans = 0; for (int i = 0, j = -1; i < n; i++) { while (j >= 0 && x[j + 1] != p[i]) j = fail[j]; if (x[j + 1] == p[i]) j++; if (j == m - 1) { if ((i - m + 1 < s1) && (i + 1) > s1) ans++; j = fail[j]; } } return (long long)ans; } int main() { s[1] = a ; s[2] = b ; for (int i = 3; i <= 30; i++) s[i] = s[i - 1] + s[i - 2]; cin >> n >> m; while (m--) { cin >> x; if (n <= 25) { cout << kmp((int)n) << endl; continue; } int len = x.length(); int r = 1; while (s[r].length() < len) r++; long long add1 = calc(r, r), add2 = calc(r + 1, r); for (int i = 1; i <= r + 2; i++) dp[i] = kmp(i); dp[r + 3] = dp[r + 2] + dp[r + 1] + add1; dp[r + 4] = dp[r + 3] + dp[r + 2] + add2; dp[r + 5] = dp[r + 4] + dp[r + 3] + add1; dp[r + 6] = dp[r + 5] + dp[r + 4] + add2; if (n <= r + 6) { cout << dp[n] << endl; continue; } matrix mat = calc(n - r - 6); long long ans = 0; for (int i = 0; i < 4; i++) ans += mat.v[0][i] * dp[r + 6 - i]; ans = ans % mod; while (ans < 0) ans += mod; cout << ans << endl; } } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long int n; cin >> n; long long int arr[n]; for (int i = 0; i < n; i++) cin >> arr[i]; long long int pre = 0; int counter = 0; while (counter < n && arr[counter] != 0) { pre++; counter++; } long long int post = 0; counter = n - 1; while (counter >= 0 && arr[counter] != 0) { counter--; post++; } counter = 0; long long int mx = 0; for (int i = 0; i < n; i++) { if (arr[i] == 0) { if (mx < counter) mx = counter; counter = 0; } else { counter++; } } if (counter > mx) mx = counter; if (mx < pre + post) mx = pre + post; cout << mx << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using ii = pair<int, int>; using iii = tuple<int, int, int>; using vi = vector<int>; int main(void) { ios::sync_with_stdio(false), cin.tie(NULL); int n; cin >> n; vector<iii> a(n); int maxr = 0, i = 0; for (auto &[r, l, ix] : a) { cin >> l >> r; ix = i++; maxr = max(maxr, r); } sort(begin(a), end(a)); vi used(maxr + 1, 0), ans(n); for (auto [r, l, i] : a) { while (used[l]) l++; ans[i] = l; used[l] = true; } for (auto x : ans) cout << x << ; cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { size_t n, w, m; ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr), cin >> n >> w >> m; struct bottle_t { size_t amount, id; } bottle, poured; stack<bottle_t> bottles, non_empty; vector<bottle_t> cup[m]; for (bottle.amount = m, bottle.id = 1; bottle.id <= n; bottle.id++) bottles.push(bottle); for (size_t i = 0, unfilled = n; i < m; i++, unfilled = n) { while (!non_empty.empty()) bottles.push(non_empty.top()), non_empty.pop(); do { bottle = bottles.top(), bottles.pop(); if (bottle.amount > unfilled && bottle.amount < m) { cout << NO ; return 0; } poured = bottle; if (unfilled < poured.amount) poured.amount = unfilled; cup[i].push_back(poured); if ((bottle.amount -= poured.amount) > 0) non_empty.push(bottle); } while ((unfilled -= poured.amount) > 0); } cout << YES << n ; long double scale_factor = (long double)w / (long double)m; for (size_t i = 0; i < m; i++, cout << n ) for (size_t j = 0, k = cup[i].size(); j < k; j++) cout << cup[i][j].id << << fixed << setprecision(6) << scale_factor * cup[i][j].amount << ; } |
#include <bits/stdc++.h> using namespace std; int min(int s, int t) { if (s <= t) return s; return t; } int max(int s, int t) { if (s >= t) return s; return t; } int main(void) { int cases; int n, s, t, m, k; cin >> cases; while (cases--) { cin >> n >> s >> t; m = s + t; k = m - n; cout << max(s - k, t - k) + 1 << endl; } } |
#include <bits/stdc++.h> using namespace std; int main() { int x; int a[2] = {0}; char c; while (scanf( %c , &c) != -1) { a[c - x ]++; } if (a[0] > a[1]) { x = a[0] - a[1]; for (int i = 0; i < x; i++) { printf( %c , x ); } printf( n ); } else { x = a[1] - a[0]; for (int i = 0; i < x; i++) { printf( %c , y ); } printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; bool comp(int x, int y) { return x > y; } bool myComp(pair<int, int> x, pair<int, int> y) { if (x.first < y.first) return true; if (x.first > y.first) return false; return x.second > y.second; } int lucky[] = {4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777}; int main() { int n, m; cin >> n >> m; int last = m - 1; for (int i = 0; i < n; i++) { bool print = false; for (int j = 0; j < m; j++) { if (i % 2 == 0) cout << # ; else { if (j != last) { cout << . ; } else { cout << # ; } } } if (i % 2 != 0) { if (last == 0) last = m - 1; else last = 0; } cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int it; int TUX; cin >> TUX; int FOO = 0, BAR = 0, BAZ = 0, QUZ = 1; for (int i = TUX; i != 0; i--) { int PUR; cin >> PUR; FOO += PUR; BAR++; it = ((max((FOO * QUZ), (BAR * BAZ))) == (FOO * QUZ)); if (it) { BAZ = FOO; QUZ = BAR; } } cout << ((double)BAZ) / ((double)QUZ) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; bool areParanthesisBalanced(string expr) { stack<char> s; char x; for (int i = 0; i < expr.length(); i++) { if (expr[i] == ( || expr[i] == [ || expr[i] == { ) { s.push(expr[i]); continue; } if (s.empty()) return false; switch (expr[i]) { case ) : x = s.top(); s.pop(); if (x == { || x == [ ) return false; break; case } : x = s.top(); s.pop(); if (x == ( || x == [ ) return false; break; case ] : x = s.top(); s.pop(); if (x == ( || x == { ) return false; break; } } return (s.empty()); } int main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; cin.ignore(); string s; cin >> s; int op = 0; int ans = 0; int st = -1, en = -1; for (int i = 0; i < n; ++i) { if (st == -1) { st = i; } if (s[i] == ( ) { op++; } else { op--; } if (op == 0) { if (areParanthesisBalanced(s.substr(st, i - st + 1))) { } else { ans += i - st + 1; } st = -1; } } if (op == 0) { cout << ans << n ; } else { cout << -1 n ; } return 0; } |
#include <bits/stdc++.h> int main() { int n, i, j, k = 0, z, x; scanf( %d , &n); for (i = 1; i < n; i++) { for (j = i; j < n; j++) { z = i * i + j * j; x = sqrt(z); if (x * x == z && x <= n) { k++; } } } printf( %d , k); return 0; } |
#include <bits/stdc++.h> const int MAXN = 200005; int n, m, tot, a[MAXN], b[MAXN], pa[MAXN], pb[MAXN], tr[MAXN], ans[MAXN * 10]; bool tag[MAXN * 10], used[MAXN * 10]; template <typename T> inline void read(T &x) { int fl = 0, ch; while (ch = getchar(), ch < 48 || 57 < ch) fl ^= !(ch ^ 45); x = (ch & 15); while (ch = getchar(), 47 < ch && ch < 58) x = x * 10 + (ch & 15); if (fl) x = -x; } struct ASK { int opt, x, y, id; } q[MAXN * 10], qq[MAXN * 10]; void upd(int i, int x) { for (; i <= n; i += i & -i) tr[i] += x; } int qry(int i) { int res = 0; for (; i; i &= i - 1) res += tr[i]; return res; } void cdq(int l, int r) { if (l >= r) return; int mid = l + r >> 1; cdq(l, mid), cdq(mid + 1, r); int i = l, j = mid + 1; for (int k = l; k <= r; ++k) { if (i <= mid && (j > r || q[i].x <= q[j].x)) { if (q[i].opt == 2) upd(q[i].y, 1); if (q[i].opt == 3) upd(q[i].y, -1); qq[k] = q[i++], used[k] = 1; } else { if (q[j].opt == 1) ans[q[j].id] += qry(q[j].y); qq[k] = q[j++]; } } for (int k = l; k <= r; ++k) { q[k] = qq[k]; if (used[k] == 1) { if (q[k].opt == 2) upd(q[k].y, -1); else if (q[k].opt == 3) upd(q[k].y, 1); used[k] = 0; } } } int main() { read(n), read(m); for (int i = 1; i <= n; ++i) read(a[i]), pa[a[i]] = i; for (int i = 1; i <= n; ++i) read(b[i]), pb[b[i]] = i; for (int i = 1; i <= n; ++i) ++tot, q[tot] = (ASK){2, pa[i], pb[i]}; for (int i = 1; i <= m; ++i) { ++tot, read(q[tot].opt); if (q[tot].opt == 1) { int l1, r1, l2, r2; read(l1), read(r1), read(l2), read(r2); tag[tot--] = 1; ++tot, q[tot] = (ASK){1, r1, r2, tot}; ++tot, q[tot] = (ASK){1, l1 - 1, r2, tot}; ++tot, q[tot] = (ASK){1, r1, l2 - 1, tot}; ++tot, q[tot] = (ASK){1, l1 - 1, l2 - 1, tot}; } else { int x, y; read(x), read(y); --tot; ++tot, q[tot] = (ASK){3, pa[b[x]], x, 0}; ++tot, q[tot] = (ASK){3, pa[b[y]], y, 0}; ++tot, q[tot] = (ASK){2, pa[b[x]], y, 0}; ++tot, q[tot] = (ASK){2, pa[b[y]], x, 0}; std::swap(b[x], b[y]), std::swap(pb[b[x]], pb[b[y]]); } } cdq(1, tot); for (int i = 1; i <= tot; ++i) if (tag[i] == 1) printf( %d n , ans[i] - ans[i + 1] - ans[i + 2] + ans[i + 3]); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1000100; const long long MOD = 1e9 + 7; int N, M; string P; int y[MAXN], fail[MAXN]; bool good[MAXN]; int main() { ios_base::sync_with_stdio(0); cin >> N >> M >> P; for (int i = 0; i < M; i++) { cin >> y[i]; y[i]--; } fail[0] = -1; for (int i = 1; i < P.length(); i++) { int cloc = fail[i - 1]; while (cloc > -1 && P[i] != P[cloc + 1]) cloc = fail[cloc]; if (cloc == -1 && P[i] != P[0]) cloc = -2; fail[i] = cloc + 1; } for (int i = 0; i < MAXN; i++) good[i] = false; int cloc = (int)P.length() - 1; while (cloc != -1) { good[cloc] = true; cloc = fail[cloc]; } for (int i = 0; i < M - 1; i++) { int diff = (y[i + 1] - y[i]); if (diff >= P.length()) continue; if (!good[P.length() - 1 - diff]) { cout << 0 n ; return 0; } } int xloc = 0; long long res = 1; for (int i = 0; i < N; i++) { if (xloc < M - 1 && y[xloc + 1] == i) xloc++; if (xloc >= M || y[xloc] > i || y[xloc] + P.size() <= i) { res = (26 * res) % MOD; } } cout << res << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 100100; pair<long double, long double> a[N]; int n; bool f(long double mid) { long double l[n], r[n]; multiset<pair<long double, int>> xex; for (int i = 0; i < n; i++) { l[i] = 1.0 * a[i].first - a[i].second * mid; xex.insert({l[i], -1}); r[i] = 1.0 * a[i].first + a[i].second * mid; xex.insert({r[i], 1}); } int cnt = 0; for (auto it = xex.begin(); it != xex.end(); it++) { if ((*it).second == -1) { cnt++; } else { cnt--; } if (cnt == n) return true; } { bool f = true; for (int i = 0; i < n; i++) { if (l[i] <= a[0].first) { f = false; break; } } if (f) return true; } { bool f = true; for (int i = 0; i < n; i++) { if (a[n - 1].first <= r[i]) { f = false; break; } } if (f) return true; } return false; } int main() { ios_base::sync_with_stdio(0); cin >> n; for (int i = 0; i < n; i++) { cin >> a[i].first; } for (int i = 0; i < n; i++) { cin >> a[i].second; } sort(a, a + n); long double ans = 1e9; long double l = 0.0, r = 1e9; while (r - l >= 0.0000001) { long double mid = (1.0 * l + r) / 2.0; if (f(mid)) { ans = mid; r = mid; } else { l = mid; } } cout << fixed << setprecision(8) << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int a[15]; inline int read() { char ch = getchar(); int x = 0, f = 1; while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) x = x * 10 + (ch ^ 48), ch = getchar(); return x * f; } int main() { int t = read(); while (t--) { int n = read(), x = 0, y = 0, s = 0, xx = 0, yy = 0; while (n) a[++s] = n % 10, n /= 10; for (int i = s; i; i--) if (i & 1) x = x * 10 + a[i]; else y = y * 10 + a[i]; printf( %d n , (x + 1) * (y + 1) - 2); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n; int a[200007]; void input() { scanf( %d , &n); int i; for (i = 1; i <= n; i++) { scanf( %d , &a[i]); } } void solve() { int i; for (i = 1; i <= n; i++) { if ((a[i] % 2) == 1) { if (i != n && (a[i + 1] != 0)) { a[i]--; a[i + 1]--; } } } for (i = 1; i <= n; i++) { if ((a[i] % 2) != 0) { printf( NO n ); return; } } printf( YES n ); } int main() { ios::sync_with_stdio(false); cin.tie(NULL); input(); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; char s[10010]; int main() { int n; cin >> n; while (n--) { string a; cin >> a; for (int i = 0; i < a.size(); i++) { s[i] = a[i]; } sort(s, s + a.size()); if (s[0] == s[a.size() - 1]) { cout << -1 << endl; } else { for (int i = 0; i < a.size(); i++) { cout << s[i]; } cout << endl; } } } |
#include <bits/stdc++.h> using namespace std; const int mara = (int)(1e6) + 5; vector<long long> a(mara), prime(mara), v(mara), luck; map<long long, bool> flag; long long bigmod(long long a, long long b, long long m) { long long res = 1; while (b) { if (b & 1) { res = (res * a) % m; b--; } else { b /= 2; a = (a * a) % m; } } return res; } void soln() { long long a, b, sum = 0; cin >> a >> b; for (long long i = 1; i <= 10; i++) { long long as = i * b; as %= 10; sum += as; } long long vajok = 10 * b; long long div = a / vajok; long long rem = a % vajok; long long res = sum * div; for (long long i = b; i <= rem; i += b) { long long temp = i; temp %= 10; res += temp; } cout << res << endl; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long t; cin >> t; while (t--) { soln(); } return 0; } |
#include <bits/stdc++.h> int main() { int n; scanf( %d , &n); n& n - 1 ? printf( NO ) : printf( YES ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); int n, k; cin >> n >> k; vector<pair<long long, int> > c(n); vector<int> ans(n); for (int i = 0; i < n; ++i) { cin >> c[i].first; c[i].second = i; } set<pair<long long, int> > av; for (int i = 0; i < k; ++i) av.insert(c[i]); int now = k; long long cost = 0; for (int i = 0; i < n; ++i) { if (now < n) av.insert(c[now]); ans[av.rbegin()->second] = ++now; cost += av.rbegin()->first * (now - av.rbegin()->second - 1); av.erase(*av.rbegin()); } cout << cost << n ; for (int i : ans) cout << i << ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2005, maxv = 4e6 + 5; long long a, b, c, X1, X2, Y1, Y2; pair<long double, long double> va[6], vb[6]; void exgcd(long long a, long long b, long long &x, long long &y) { if (!b) { x = 1, y = 0; return; } exgcd(b, a % b, y, x); y -= a / b * x; } long double sqr(long double x) { return x * x; } int main() { scanf( %lld %lld %lld , &a, &b, &c); scanf( %lld %lld %lld %lld , &X1, &Y1, &X2, &Y2); long double ans = abs(X1 - X2) + abs(Y1 - Y2); if (a != 0 && b != 0) { va[0] = make_pair(X1, (long double)(-c - a * X1) / b); va[1] = make_pair((long double)(-c - b * Y1) / a, Y1); vb[0] = make_pair(X2, (long double)(-c - a * X2) / b); vb[1] = make_pair((long double)(-c - b * Y2) / a, Y2); for (int i = 0; i <= 1; i++) for (int j = 0; j <= 1; j++) { long double ans1 = fabs(X1 - va[i].first) + fabs(Y1 - va[i].second) + fabs(X2 - vb[j].first) + fabs(Y2 - vb[j].second); ans1 += sqrt(sqr(va[i].first - vb[j].first) + sqr(va[i].second - vb[j].second)); ans = min(ans, ans1); } } printf( %.9f n , (double)ans); } |
#include <bits/stdc++.h> using namespace std; vector<int> edges[100006]; int given[100006] = {0}; int dfs(int i, int c) { if (given[i] != 0) { if ((given[i] == 1 && c == 2) || (given[i] == 2 && c == 1)) return 0; } if (edges[i].size() != 0) given[i] = c; int fl = 1; for (int j = 0; j < edges[i].size(); j++) { int v = edges[i][j]; if (given[v] != 0) { if (given[v] == c) return 0; } else { int t; if (c == 1) t = 2; else t = 1; fl = dfs(v, t) & fl; } } return fl; } int main() { int u, v, n, m; scanf( %d , &n), scanf( %d , &m); for (int i = (0); i < (m); ++i) { scanf( %d , &u), scanf( %d , &v); edges[u].push_back(v); edges[v].push_back(u); } for (int i = (0); i < (100004); ++i) given[i] = 0; int flag = 1; for (int i = 1; i <= n && flag; i++) { if (given[i] == 0) flag = dfs(i, 1) & flag; } if (flag == 0) puts( -1 ); else { int a = 0, s = 0, tempp = 22; for (int i = 1; i <= n; i++) if (given[i] == 1) a++; else if (given[i] == 2) s++; printf( %d n , a); for (int i = 1; i <= n; i++) if (given[i] == 1) printf( %d , i); printf( n ); printf( %d n , s); for (int i = 0; i <= n; i++) if (given[i] == 2) printf( %d , i); printf( n ); } } |
#include <bits/stdc++.h> using namespace std; struct Widget { string type, name; vector<Widget *> childs; long long h, w, s, b; Widget(string _name = , string _type = , long long _h = -1, long long _w = -1) { h = _h, w = _w; type = _type; name = _name; s = 0; b = 0; } void pack(Widget *W) { childs.push_back(W); } long long getW() { if (type == normal ) return w; else if (type == VBox ) { if (childs.size() == 0) return 0; if (w != -1) return w; w = 0; for (int i = 0; i < childs.size(); ++i) w = max(w, childs[i]->getW()); return w = w + 2 * b; } else { if (childs.size() == 0) return 0; if (w != -1) return w; w = 0; for (int i = 0; i < childs.size(); ++i) w += childs[i]->getW(); return w = w + 2 * b + s * max(0LL, (long long)childs.size() - 1); } } long long getH() { if (type == normal ) return h; else if (type == HBox ) { if (childs.size() == 0) return 0; if (h != -1) return h; h = 0; for (int i = 0; i < childs.size(); ++i) h = max(h, childs[i]->getH()); return h = h + 2 * b; } else { if (childs.size() == 0) return 0; if (h != -1) return h; h = 0; for (int i = 0; i < childs.size(); ++i) h += childs[i]->getH(); return h = h + 2 * b + s * max(0LL, (long long)childs.size() - 1); } } }; map<string, Widget> M; int main() { int N; cin >> N; for (int i = 0; i < N; ++i) { string com; cin >> com; if (com == Widget ) { string name; cin >> name; int p1 = name.find( ( ); int p2 = name.find( , ); int p3 = name.find( ) ); string rname = name.substr(0, p1); string val1 = name.substr(p1 + 1, p2 - p1 - 1); string val2 = name.substr(p2 + 1, p3 - p2 - 1); int h, w; sscanf((val1 + + val2).c_str(), %d %d , &w, &h); M[rname] = Widget(name, normal , h, w); } else if (com == VBox || com == HBox ) { string name; cin >> name; M[name] = Widget(name, com); } else { string name, method, val; int p1 = com.find( . ); int p2 = com.find( ( ); int p3 = com.find( ) ); name = com.substr(0, p1); method = com.substr(p1 + 1, p2 - p1 - 1); val = com.substr(p2 + 1, p3 - p2 - 1); if (method == pack ) { M[name].pack(&M[val]); } else { int n; sscanf(val.c_str(), %d , &n); if (method == set_spacing ) M[name].s = n; else M[name].b = n; } } } for (map<string, Widget>::iterator it = M.begin(); it != M.end(); ++it) cout << (it->first) << << (it->second.getW()) << << (it->second.getH()) << endl; } |
#include <bits/stdc++.h> using namespace std; int n, m, a[1000], l[1000], r[1000], mn, mx, ans, mx2, mn2, ansi = -1, ans2; string s; int main() { ios::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL); cin >> n >> m; for (int i = 0; i < n; i++) { cin >> a[i]; if (i == 0) mn = a[i], mx = a[i]; mn = min(mn, a[i]), mx = max(a[i], mx), ans = mx - mn; } for (int j = 0; j < m; j++) cin >> l[j] >> r[j]; for (int i = 1; i <= n; i++) { for (int j = 0; j < m; j++) { if (i >= l[j] && i <= r[j]) { for (int k = l[j] - 1; k < r[j]; k++) { a[k]--; } } } for (int j = 0; j < n; j++) { if (j == 0) mn2 = a[j], mx2 = a[j]; mn2 = min(mn2, a[j]), mx2 = max(a[j], mx2); } if (ans < mx2 - mn2) ans = mx2 - mn2, ansi = i; for (int j = 0; j < m; j++) { if (i >= l[j] && i <= r[j]) { for (int k = l[j] - 1; k < r[j]; k++) { a[k]++; } } } } cout << ans << endl; for (int i = 0; i < m; i++) { if (ansi >= l[i] && ansi <= r[i]) { ans2++; } } cout << ans2 << endl; for (int i = 0; i < m; i++) { if (ansi >= l[i] && ansi <= r[i]) { cout << i + 1 << ; } } } |
#include <bits/stdc++.h> using namespace std; int main() { int n; int ans = 0; cin >> n; string arr[11] = { ABSINTH , BEER , BRANDY , CHAMPAGNE , GIN , RUM , SAKE , TEQUILA , VODKA , WHISKEY , WINE }; for (int i = 0; i < n; i++) { string a; cin >> a; if (isdigit(a[0]) != 0) { if (stoi(a) < 18) { ans++; } } else { for (int j = 0; j < 11; j++) { if (a == arr[j]) { ans++; } } } } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = 1e9; const int MOD = 1e9 + 7; const int N = 1e5 + 10; int n, p[N], h[N]; vector<int> g[N]; vector<pair<int, int> > ans; void build(int x, int y) { int m1 = g[x].size(); if (x == y) { for (auto i = 0; i < m1 - 1; i++) ans.push_back(pair<int, int>(g[x][i], g[x][i + 1])); return; } for (auto i = 0; i < g[y].size(); i++) ans.push_back(pair<int, int>(g[x][i % m1], g[y][i])); } void solve() { int m = 0; for (auto i = 1; i <= n; i++) if (!h[i]) { m++; int cur = i; while (!h[cur]) { h[cur] = 1; g[m].push_back(cur); cur = p[cur]; } } int root = 1; for (auto i = 1; i <= m; i++) if (g[i].size() < g[root].size()) root = i; if (g[root].size() > 2) { printf( NO ); return; } for (auto i = 1; i <= m; i++) if (g[i].size() % g[root].size()) { printf( NO ); return; } for (auto i = 1; i <= m; i++) build(root, i); if (ans.size() != n - 1) { printf( NO n ); return; } printf( YES n ); for (auto i : ans) printf( %d %d n , i.first, i.second); } int main() { scanf( %d , &n); for (auto i = 1; i <= n; i++) scanf( %d , p + i); solve(); } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; i++) cin >> a[i]; int pen = 0; for (int i = 0; i < n; i++) { if (pen) { if (a[i]) a[i]--; else { cout << NO ; return 0; } pen = 0; } if (a[i] % 2) pen = 1; if (i == n - 1) { if (pen) cout << NO ; else cout << YES ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; void __print(int x) { cerr << x; } void __print(long x) { cerr << x; } void __print(long long x) { cerr << x; } void __print(unsigned x) { cerr << x; } void __print(unsigned long x) { cerr << x; } void __print(unsigned long long x) { cerr << x; } void __print(float x) { cerr << x; } void __print(double x) { cerr << x; } void __print(long double x) { cerr << x; } void __print(char x) { cerr << << x << ; } void __print(const char* x) { cerr << << x << ; } void __print(const string& x) { cerr << << x << ; } void __print(bool x) { cerr << (x ? true : false ); } template <typename T, typename V> void __print(const pair<T, V>& x) { cerr << { ; __print(x.first); cerr << , ; __print(x.second); cerr << } ; } template <typename T> void __print(const T& x) { int f = 0; cerr << { ; for (auto& i : x) cerr << (f++ ? , : ), __print(i); cerr << } ; } void _print() { cerr << ] n ; } template <typename T, typename... V> void _print(T t, V... v) { __print(t); if (sizeof...(v)) cerr << , ; _print(v...); } template <class A> void read(vector<A>& v); template <class A, size_t S> void read(array<A, S>& a); template <class T> void read(T& x) { cin >> x; } void read(double& d) { string t; read(t); d = stod(t); } void read(long double& d) { string t; read(t); d = stold(t); } template <class H, class... T> void read(H& h, T&... t) { read(h); read(t...); } template <class A> void read(vector<A>& x) { for (auto& a : x) read(a); } template <class A, size_t S> void read(array<A, S>& x) { for (auto& a : x) read(a); } const int MAXN = 2e5 + 5; long long mod = 998244353; vector<pair<long long, long long> > gr[200005]; void solve() { long long n, k; cin >> n >> k; vector<long long> a(n); read(a); long long sum = 0; for (long long i = int(n); i >= int(n - k + 1); i--) { sum += i; } cout << sum << ; long long i = 0, j = n - 1; while (a[i] < n - k + 1) { i++; } while (a[j] < n - k + 1) j--; long long cnt = 0; long long ans = 1; for (long long r = int(i); r < int(j + 1); r++) { if (a[r] < (n - k + 1)) { cnt++; } else { if (cnt != 0) ans = (ans * cnt) % mod; cnt = 1; } } if (cnt != 0) ans = (ans * cnt) % mod; cout << ans % mod << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long test; test = 1; while (test--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; long long calc(int n, int k) { int c = n / k; long long ans = c; ans += (long long)(n - k) * c / 2; return ans; } int main() { int n; cin >> n; vector<long long> a; for (int i = 1; i * i <= n; i++) if (n % i == 0) { a.push_back(calc(n, i)); if (i * i != n) a.push_back(calc(n, n / i)); } sort(a.begin(), a.end()); a.erase(unique(a.begin(), a.end()), a.end()); for (long long first : a) printf( %I64d , first); return 0; } |
#include <bits/stdc++.h> using namespace std; vector<pair<long long int, long long int> > dis(100005), edge; long long int cnt[100005]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int t = 0, n, e, x, y, z, i, j, k, g, q, ans = 0, sum = 0, c = 0, h; cin >> n >> t; for (i = 1; i <= n; i++) { cin >> x; dis[i].first = x; dis[i].second = i; } sort(dis.begin() + 1, dis.begin() + n + 1); if (dis[1].first != 0) { cout << -1 n ; return 0; } if (n == 1) { cout << 0 n ; return 0; } if (dis[1].first == dis[2].first) { cout << -1 n ; return 0; } vector<long long int> v1, v2; v1.push_back(dis[1].second); i = 2; long long int next = 1; while (i <= n) { for (j = i; j <= n; j++) { if (dis[j].first != next) break; v2.push_back(dis[j].second); } i = j; long long int s1 = v1.size(); long long int s2 = v2.size(); for (j = 0, k = 0; j < s2 && k < s1;) { if (cnt[v1[k]] == t) { k++; continue; } edge.push_back(make_pair(v1[k], v2[j])); cnt[v1[k]]++; cnt[v2[j]]++; if (cnt[v1[k]] == t) k++; j++; } if (j != s2) { cout << -1 n ; return 0; } v1.clear(); next++; for (j = 0; j < s2; j++) { v1.push_back(v2[j]); } v2.clear(); } ans = edge.size(); cout << ans << n ; for (i = 0; i < edge.size(); i++) { cout << edge[i].first << << edge[i].second << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main(void) { int n, max = 0; string a[100]; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n; i++) { int count = 0; for (int j = 0; j < n; j++) { if (i != j) { if (a[i].compare(a[j]) == 0) count++; } } if (count > max) max = count; } cout << max + 1; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, as = 0; template <class T> void read(T &x) { char ch; bool ok; for (ok = 0, ch = getchar(); !isdigit(ch); ch = getchar()) if (ch == - ) ok = 1; for (x = 0; isdigit(ch); x = x * 10 + ch - 0 , ch = getchar()) ; if (ok) x = -x; } int fp(int x, int y) { int asi = 1; while (y) { if (y & 1) asi = 1ll * asi * x % 1000000007; x = 1ll * x * x % 1000000007; y >>= 1; } return asi; } int get_miu(int x) { int asi = 1; for (int i = (2), en = (x); i <= en; ++i) { if (i * i > x) break; if (x % i == 0) { asi = 1000000007 - asi; x /= i; if (x % i == 0) return 0; } } if (x != 1) asi = 1000000007 - asi; return asi; } int main() { read(n); read(m); if (m % n) { puts( 0 ); return 0; }; m /= n; for (int i = (1), en = (m); i <= en; ++i) { if (i * i > m) break; if (m % i == 0) { as = (as + 1ll * fp(2, m / i - 1) * get_miu(i) % 1000000007) % 1000000007; if (i * i != m) as = (as + 1ll * fp(2, i - 1) * get_miu(m / i) % 1000000007) % 1000000007; } } printf( %d n , as); return 0; } |
/****************************** * * * author : rion_cse * * created: 11.07.2021 * * * ******************************/ /******************************************************* * * * ***--> BISMILLAHIR RAHMANIR RAHIM <--*** * * ***--> ISLAMIC UNIVERSITY OF BANGLADESH <--*** * * ***--> COMPUTER SCIENCE AND ENGINEERING <--*** * * * *******************************************************/ #include<bits/stdc++.h> const int MOD=1e9+7; #define pf printf #define sc scanf #define s1(n) scanf( %d ,&n) #define s2(n1,n2) scanf( %d %d ,&n1,&n2) #define s3(n1,n2,n3) scanf( %d %d %d ,&n1,&n2,&n3) #define s4(n1,n2,n3,n4) scanf( %d %d %d %d ,&n1,&n2,&n3,&n4) #define ss1(n) scanf( %lld ,&n) #define ss2(n1,n2) scanf( %lld %lld ,&n1,&n2) #define ss3(n1,n2,n3) scanf( %lld %lld %lld ,&n1,&n2,&n3) #define ss4(n1,n2,n3,n4) scanf( %lld %lld %lld %lld ,&n1,&n2,&n3,&n4) #define p1(x) printf( %I64d ,x) #define p2(x,y) printf( %I64d %I64d ,x,y) #define p3(x,y,z) printf( %I64d %I64d %I64d ,x,y,z) #define fi(i,a,b) for(long long i=a;i<=b;i++) #define fm(i , a) for(long long i=1;i<=a;i++) #define fd(i,a,b) for(long long i=b;i>=a;i--) #define clr(x) memset(x,0,sizeof(x)) #define cln(x) memset(x,-1,sizeof(x)) #define fw freopen( output.txt , w ,stdout); typedef long long int ll; ///ll ar[1009],arr[1009]; using namespace std; /*ll LCM(ll a,ll b) { return (a/(__gcd(a,b)))*b; }*/ int main() { ll t; cin>>t; while(t--) { ll n,i,j; cin>>n; ll ar[n+5],br[n+5],s=0,s1=0; vector< ll > v,vc; for(i=1;i<=n;i++) { cin>>ar[i]; s+=ar[i]; } for(i=1;i<=n;i++) { cin>>br[i]; s1+=br[i]; } if(s!=s1) cout<< -1 <<endl; else { for(i=1;i<=n;i++) { if(ar[i]>br[i]){ for(j=1;j<=(ar[i]-br[i]);j++) v.push_back(i); } else if(ar[i]<br[i]){ for(j=1;j<=(br[i]-ar[i]);j++) vc.push_back(i); } } cout<<v.size()<<endl; for(i=0;i<v.size();i++) cout<<v[i]<< <<vc[i]<<endl; } } return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.