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

func_code_string stringlengths 59 71.4k
#include <bits/stdc++.h> using namespace std; int arr[10][10]; double me[10][10]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n = 10; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { cin >> arr[i][j]; } } me[0][0] = 0.; me[0][1] = ...
#include <bits/stdc++.h> using namespace std; const int MX = 1000006; const long long inf = 1e18; long long n, m, p, a[MX], ca[MX], b[MX], cb[MX], mn[MX]; long long x[MX], y[MX], z[MX]; long long st[4 * MX + 20], lz[4 * MX + 20], res = -inf; vector<int> pos[MX]; void push(int i, int j, int pos) { if...
#include <bits/stdc++.h> using namespace std; const int INF = 2e9; const long long INFL = 2e18; const int N = 1e6, M = N; int n, m, G = 0; vector<int> adj[N + 5]; int gr[N + 5], p[N + 5]; vector<int> pth[N + 5]; vector<int> PTH_myEndlessLove; int Pos[N + 5]; void dfs(int u) { gr[u] = G; PT...
#include <bits/stdc++.h> using namespace std; char a[10005]; char b[1000005]; vector<int> poj[10005]; int alen, blen; long long total; int pos; vector<int>::iterator it; int main() { scanf( %s , a); scanf( %s , b); alen = strlen(a), blen = strlen(b); pos = 0; total = 1; for (in...
#include <bits/stdc++.h> using namespace std; int main() { long long int n{0}, a{0}, m{0}, s{0}; cin >> n; for (long long int i = 1; i <= n; i++) { cin >> a; s += a; m = max(m, a); } if (s % 2 == 1 \|\| s < 2 * m) { cout << NO ; return 0; } cout << YES ; ...
#include <bits/stdc++.h> using namespace std; const int inf = 0xffffff; int LEN; class Mcmf { public: struct T { int from, to, val; int next, cost; } edge[200001]; int len; int visit[200001], pre[200001], dist[200001], que[200001], vis[200001], pos[200001]; void init()...
#include <bits/stdc++.h> using namespace std; unsigned int dp[100010][400]; vector<int> nima[100010]; int a[100010], b[100010]; int n, m, s, e; int solve(int all = s, int c = e) { unsigned int INF = -1; vector<int> vt[100010]; int cur = 0; memset(dp, -1, sizeof(dp)); int cnt = (all + c -...
#include <bits/stdc++.h> using namespace std; int a[11][5]; bool ok(int l, int j, int k) { int i, an = 0; for (i = 0; i < 5; i++) { an = an + (a[j][i] - a[l][i]) * (a[k][i] - a[l][i]); } if (an > 0) return false; return true; } int main() { ios::sync_with_stdio(false); int i,...
#include <bits/stdc++.h> using namespace std; const int N = 2505; int n, m, K, a[2][N][N], L[N][8], R[N][8], Lc[N][8], Rc[N][8]; char s[N]; long long ans; void work(int x1, int x2, int y1, int y2, int d) { if (y2 - y1 > x2 - x1) { swap(x1, y1), swap(x2, y2), d ^= 1; } if (x1 + 1 == x2) { ...
#include <bits/stdc++.h> using namespace std; const long long int mx = 70, Mod = 1e9 + 7, mxx = 350000; int n; int get(int x, int y, int z) { if (x > y) swap(x, y); if (x > z) swap(x, z); if (y > z) swap(y, z); return x * mx * mx + y * mx + z; } bool mark[mxx]; vector<int> e[mxx]; int dp...
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 100; long long a[maxn]; long long fac[maxn], inv[maxn]; const int mod = 1e9 + 7; long long Pow(long long x, long long y) { long long res = 1; while (y) { if (y & 1) res = res * x % mod; x = x * x % mod; y >>= 1; ...
#include <bits/stdc++.h> using namespace std; template <class T> ostream &operator<<(ostream &os, vector<T> &vec) { os << { ; for (int i = (0), __i = (((int)(vec).size())); i < __i; i++) { os << vec[i]; if (i + 1 != ((int)(vec).size())) os << , ; } os << } ; return os; } tem...
#include <bits/stdc++.h> using namespace std; int df[26]; int main() { ios::sync_with_stdio(false); cin.tie(NULL); int n, k; cin >> n >> k; string s; cin >> s; int mini = s.length(); for (int i = 0; i < s.length(); i++) { df[s[i] - A ]++; } for (int i = 0; i < k; i++...
#include <bits/stdc++.h> using namespace std; void solve() { int n, i; cin >> n; int a[n], b[n + 1]; for (i = 0; i < n; i++) { cin >> a[i]; b[a[i]] = i; } int l, r, ans[n + 1]; l = b[1]; r = b[1]; for (i = 2; i <= n; i++) { l = min(l, b[i]); r = max(r, b[i...
#include <bits/stdc++.h> using namespace std; namespace FGF { int n, m; const int N = 2e6 + 5; const int mo = 1e9 + 7; char s[N]; long long a[N], pw[N], cnt[N]; long long ans; void FWTxor(long long *y, int op) { for (int i = 1; i <= n; i++) for (int j = 0; j < (1 << n); j += (1 << i)) ...
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int N = 2e4 + 5; int sum[55][N], a[55][N]; int lazy[N << 2], tree[N << 2]; int dp[55][N]; void pushdown(int root) { if (lazy[root]) { tree[root << 1] += lazy[root]; tree[root << 1 \| 1] += lazy[root]; lazy[ro...
#include <bits/stdc++.h> using namespace std; const long long inf = 707406378; const int maxn = 1.5e7 + 10; void read(long long &x) { char ch; bool flag = 0; for (ch = getchar(); !isdigit(ch) && ((flag \|= (ch == - )) \|\| 1); ch = getchar()) ; for (x = 0; isdigit(ch); x = (x << 1) ...
#include <bits/stdc++.h> const int p = 998244353; const int inv2 = 499122177; const int MAXN = 140000; inline long long read() { long long x = 0, f = 1; char ch = getchar(); while (ch > 9 \|\| ch < 0 ) { if (ch == - ) f = -1; ch = getchar(); } do x = (x * 10 + ch - 48) % p, ch ...
#include <bits/stdc++.h> using namespace std; long long int gcd(long long int x, long long int y) { if (y > x) { return gcd(y, x); } if (y == 0) { return x; } return gcd(y, x % y); } bool prime(long long int x) { for (long long int i = 2; i <= sqrt(x); i++) { if (x % i ...
#include <bits/stdc++.h> using namespace std; int n; int dp[10][310]; int nex[1010][10][1010]; int ai[1010]; int up; void init(void) { memset(dp, -1, sizeof(dp)); int i, j; int cnt[10]; for (i = 1; i <= n; i++) { memset(cnt, 0, sizeof(cnt)); for (j = 1; j <= 8; j++) for...
#include <bits/stdc++.h> using namespace std; int n, m; int num[105]; int a[105][105], sum[105][105], mx[105][105]; int f[105][10005]; int main() { cin >> n >> m; for (int i = 1; i <= n; i++) { cin >> num[i]; for (int j = 1; j <= num[i]; j++) { cin >> a[i][j]; sum[i][j] =...
#include <bits/stdc++.h> int main() { long long a, b, c, flag = 0; scanf( %lld , &a); if (a == 1 \|\| a == 2) { printf( -1 ); return 0; } if (a % 2 == 0) { flag = 1; } if (flag != 1) { b = (a * a + 1) / 2; c = (a * a - 1) / 2; printf( %lld %lld , c, b); ...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> v(n); for (int i = 0; i < n; i++) cin >> v[i]; sort(v.begin(), v.end()); vector<int> w(n, 0); w[0] = v[0]; for (int i = 1; i < n; i++) w[i] = w[i - 1] + v[i]; int score = 0, penalty = 0; f...
#include <bits/stdc++.h> using namespace std; int freq[200005]; int arr[1005]; int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); int n; cin >> n; for (int i = 1; i <= n; i++) cin >> arr[i]; for (int i = 1; i <= n; i++) for (int j = i + 1; j <= n; j++) freq[arr[i] + ar...
#include <bits/stdc++.h> using namespace std; struct __timestamper {}; struct change { int s, t, u; }; vector<long long> solve(vector<int> a, vector<change> b) { long long sum = 0; for (auto x : a) sum += x; vector<long long> ans; int n = a.size(); vector<int> cntr(n); auto change_...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int x, y = 0, z = 0; for (int i = 0; i < n; i++) { cin >> x; if (x != y) { z++; } y = x; } cout << z; return 0; }
#include <bits/stdc++.h> using namespace std; long long n, t[100001], ans; double w; long long lowbit(long long x) { return x & (-x); } struct rua { double x, v; long long id; } _[100001]; void change(long long x) { while (x <= n) t[x]++, x += lowbit(x); } int sum(long long k) { long l...
#include<cstdio> #include<cstring> #include<algorithm> using namespace std; char ch; int t,n,k,h[110],pos; void read(int &x) { x=0; ch=getchar(); while(ch< 0 \|\|ch> 9 ) ch=getchar(); while(ch>= 0 &&ch<= 9 ) { x=x*10+ch- 0 ; ch=getchar(); } } int main() { read(t); whil...
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); vector<long long> X(n + 1), Y(n + 1); for (int i = (1); i <= (n); ++i) scanf( %lld%lld , &X[i], &Y[i]); long long S = 0; for (int k = (1); k <= (n); ++k) { vector<double> V; for (int i = (1); i <= ...
#include <bits/stdc++.h> using namespace std; int sum, len; string s; int cnt[26][5010][26]; int main() { cin >> s; sum = 0; len = s.length(); s += s; memset(cnt, 0, sizeof(cnt)); for (int i = 0; i < len; i++) { for (int j = 1; j < len; j++) { cnt[s[i] - a ][j][s[i + j] ...
#include <bits/stdc++.h> using namespace std; int main() { int A1, B1, C1, A2, B2, C2; cin >> A1 >> B1 >> C1 >> A2 >> B2 >> C2; if (A1 * B2 != A2 * B1) cout << 1 << endl; else { if (A1 != 0 && A2 != 0 && A2 * C1 == A1 * C2) cout << -1 << endl; else if (A1 != 0 && A2 != 0) ...
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 5; bool vis[N]; vector<int> prime; void sieve() { for (int i = 2; i * i < N; i++) { if (vis[i]) continue; for (int j = 2; j * i < N; j++) { vis[i * j] = 1; } } for (int i = 2; i < N; i++) { if (vis[i]...
#include <bits/stdc++.h> using namespace std; const int Inf = (1 << 30) - 1; const long long lInf = (1LL << 62) - 1; const int mInf = 0x7f7f7f7f; const int Maxn = 200010; vector<int> a[Maxn]; pair<int, int> S[Maxn << 1]; int f[Maxn]; int t[Maxn]; int n, m, ans; void solve(int k) { map<int, int...
#include <bits/stdc++.h> using namespace std; int main() { int n, m, s, f, add = 0, rund = 1; cin >> n >> m >> s >> f; if (s < f) add = 1; else add = -1; for (int i = 0; i < m; i++) { int t, l, r; cin >> t >> l >> r; while (rund < t) { if (s == f) break; ...
#include <bits/stdc++.h> using namespace std; const int Nmax = 1e5 + 5, lg = 16; struct updates { int l, x, y, id; bool operator<(const updates &other) const { if (l != other.l) return l > other.l; return id < other.id; } }; vector<updates> upd; vector<int> v[Nmax]; struct Node { ...
#include <bits/stdc++.h> using namespace std; int main() { int(n); scanf( %d , &(n)); int val[100001][2]; double arr[100001]; for (int i = 1; i <= n; i++) cin >> arr[i]; int sum = 0; for (int i = 1; i <= n; i++) { int t = arr[i]; if (arr[i] - t != 0) { if (t > 0) { ...
#include <bits/stdc++.h> long long i, j, m, n, s, t, x, y, z, ma; long long a[100][100], b[100][100]; long long mi(long long a, long long b) { if (a < b) return a; else return b; } void ss(long long x, long long y, long long shu) { long long i, j, t; z++; if (z > 8000000) retur...
#include <bits/stdc++.h> using namespace std; int c[100001]; int w[100001]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, m; cin >> n >> m; for (int i = 0; i < n; i++) { cin >> c[i]; } for (int i = 0; i < n; i++) { cin >> w[i]; } int ch = m; se...
#include <bits/stdc++.h> using namespace std; int main() { pair<int, int> p[100]; int n; cin >> n; for (int i = 0; i < n; i++) { cin >> p[i].first; p[i].second = i + 1; } sort(p, p + n); for (int i = 0; i < n; i++) cout << p[i].second << ; }
#include <bits/stdc++.h> int main() { int ans = 0; int count; scanf( %d , &count); for (int i = 0; i < count; i++) { int prize; scanf( %d , &prize); int minTimeToPrize = std::min(prize - 1, 1000000 - prize); ans = std::max(ans, minTimeToPrize); } printf( %d , ans); ...
#include <bits/stdc++.h> using namespace std; const int N = 100005; struct Point { int x, y; void read() { int a, b; scanf( %d%d , &a, &b); x = a + b; y = a - b; } bool operator<(const Point p) const { return x != p.x ? x < p.x : y < p.y; } } p[N]; int n; int pre_min[...
#include <bits/stdc++.h> using namespace std; const int NMax = 40, MMax = 200; int N, nn, A[NMax][NMax], B[NMax]; int get(int a, int b) { return (a ^ b); } int P(int a, int b) { if (b) return a * -1; else return a; } int main() { scanf( %d , &N); nn = (N + 1) >> 1; for (int...
#include <bits/stdc++.h> using namespace std; signed main() { long long t; cin >> t; while (t--) { long long a, b, c, d; cin >> a >> b >> c >> d; long long s1 = a + b; long long s2 = c + d; if (s1 > s2) cout << s1 << endl; else cout << s2 << endl; ...
#include <bits/stdc++.h> using namespace std; int main() { int n, i, flag = 0, j; cin >> n; while (n--) { int x; cin >> x; flag = 0; for (i = 0; i <= 33; i++) { for (j = 0; j <= 14; j++) { if (i * 3 + j * 7 == x) { cout << YES << endl; ...
#include <bits/stdc++.h> using namespace std; int N; bool valid(int P, int d, vector<int> guess) { if (P >= N) { return true; } if (P == 0) { if (valid(P + 1, d, guess)) return true; guess[P] -= d; if (valid(P + 1, d, guess)) return true; guess[P] += d; guess[P] += ...
#include <bits/stdc++.h> using namespace std; signed main() { int64_t n; cin >> n; int64_t a[n]; for (int64_t i = 0; i < n; i++) cin >> a[i]; map<int64_t, int64_t> first; map<int64_t, int64_t> second; first[a[0]] = 1; int64_t sum = 0; for (int64_t i = 0; i < n; i++) sum += a[i]; ...
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; int n, m, q; int a[1110][810]; char s[1100]; int ni[5] = {0, 1, 3, 2, 4}; long long pow_mod(long long a, long long e) { long long res = 1; for (; e; a = a * a % mod, e >>= 1) if (e & 1) res = res * a % mod; retu...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, a; cin >> n >> a; map<int, int> my; set<int> rem; int ca = 0; for (int i = 0; i < n; ++i) { int x; cin >> x; if (x == a) { ++ca; } else {...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); int64_t n, l, d; cin >> n >> d >> l; int a[25001]; for (int i = 1; i <= n; i++) { if (d > 0) { a[i] = l; } else { a[i] = 1; } d = a[i] - d; } a[n] = a[n] -...
#include <bits/stdc++.h> const int INF = 0x3f3f3f3f; const long long int INFLL = 0x3f3f3f3f3f3f3f3fll; long long int getint() { long long int ret = 0; bool f = 0; char c; while ((c = getchar()) < 0 \|\| c > 9 ) if (c == - ) f ^= 1; while (c >= 0 && c <= 9 ) { ret = ret * 10 + ...
#include <bits/stdc++.h> using namespace std; long long valor[100456], solapacion[100456][320], posheavy[100456], resp[100456], arrupd[100456]; vector<long long> v[100456], colaheavy; bool light[100456], existe[100456]; void init() { for (int i = 0; i < 100456; ++i) { existe[i] = false; } ...
#include <bits/stdc++.h> using namespace std; const int maxn = 201; int a[maxn], N, L, K; double f[maxn][maxn][maxn * 2], p[maxn]; int main() { scanf( %d%d%d , &N, &L, &K); for (int i = 0; i < N; ++i) { scanf( %lf , &p[i]); p[i] /= 100; } for (int i = 0; i < N; ++i) scanf( %d , &a[...
#include <bits/stdc++.h> using namespace std; set<int> s[100005]; int color[100005]; int main() { int n, m; while (~scanf( %d%d , &n, &m)) { int i, j, tmp = 0; int u, v, ans; for (i = 1; i <= n; i++) scanf( %d , &color[i]); for (j = 0; j < m; j++) { scanf( %d%d , &u, &v);...
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) const long long INF = 0x3f3f3f3f3f3f3f3f; const long long llinf = (1LL << 61); const int inf = (1 << 30); const int nmax = 4e5 + 50; const int mod = 1e9 + 7; using namespace std; string s; long long n, a[nmax], st[4 * nmax], i, lzy[4 * nmax], x, q, s...
#include <bits/stdc++.h> using namespace std; int n, m, l; long long dp[250005]; short big_arr[250005], small_arr[5001]; long long pre[51], sum[51], suf[51], mx[51], maxx = -1e5; long long solve(int indx, long long curSum) { if (indx == m + 1) return -2000; short &i = big_arr[indx]; long long &r...
#include <bits/stdc++.h> using namespace std; const int mod = 9901; template <class T> int countbit(T n) { int t = 0; while (n) n &= n - 1, ++t; return t; } template <class T> T lowbit(T n) { return n & (-n); } const double eps = 1e-8; const double pi = acos(-1.0); const int INF = ...
#include <bits/stdc++.h> struct Point { int x, y; Point* next; bool operator<(const Point& p) const { return 1ll * p.x * y < 1ll * x * p.y; } } P[200010], np = P; std::map<long long, Point> fir; std::map<Point, int> M; int main() { int q, s = 0; scanf( %d , &q); while (q--) { i...
#include <bits/stdc++.h> using namespace std; long long expo(long long x, long long n, long long m) { if (n == 0) return 1; else if (n % 2 == 0) return expo((x * x) % m, n / 2, m); else return (x * expo((x * x) % m, (n - 1) / 2, m)) % m; } string DtoB(int j) { string s = ; ...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:320000000 ) using namespace std; const double EPS = 1e-9; const int INF = 0x7f7f7f7f; const double PI = acos(-1.0); template <class T> inline T Abs(T n) { return ((n) < 0 ? -(n) : (n)); } template <class T> inline T Max(T x, T y) { ret...
#include <bits/stdc++.h> using namespace std; int Q, m, n, a[10001], c[100001], ans, f[5001][101], d[1001]; char b[500001][13]; void dfs(int x, int now, int zong, int he) { if (x > n) { if (zong <= 100) f[he][zong] += c[now]; return; } dfs(x + 1, now * 2 + 1, zong + (d[x] == 1 ? a[x] : 0...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int t; cin >> t; while (t--) { long long n, g, b; cin >> n >> g >> b; if (g >= b) { cout << n << endl; continue; } long long good_need = n / 2; ...
#include <bits/stdc++.h> using namespace std; int main() { int n, a, b, c, d; while (scanf( %d , &n) != EOF) { int j, x, y, flag = 0; for (int i = 1; i <= 4; i++) { scanf( %d%d%d%d , &a, &b, &c, &d); a = min(a, b); b = min(c, d); if (a + b <= n) { x = a;...
#include <bits/stdc++.h> using namespace std; int main() { int c0, c1, c2, c3; cin >> c0 >> c1 >> c2 >> c3; if (c1 - c0 == c2 - c1 && c2 - c1 == c3 - c2) { cout << c3 + c1 - c0 << endl; } else if (c1 * c1 == c0 * c2 && c2 * c2 == c1 * c3 && !((c3 * c3) % c2)) { cout << c3 * c1 / c0 << en...
#include <bits/stdc++.h> using namespace std; int w[1501000], cnt[1501000]; int main() { int N, i; int po, ans; scanf( %d , &N); for (int i = (0); i < (N); i++) scanf( %d , w + i); sort(w, w + N); memset(cnt, 0, sizeof(cnt)); for (int i = (0); i < (N); i++) cnt[w[i]]++; po = 0; ...
#include <bits/stdc++.h> using namespace std; int a[510][510]; int d[1010][510]; int d2[1010][510]; int x, y, nr[1010], nr2[1010]; int n, m, i, j, ok; int main() { scanf( %d%d , &n, &m); for (i = 1; i <= n; i++) for (j = 1; j <= m; j++) scanf( %d , &a[i][j]); for (i = 1; i <= n; i++) { ...
#include <bits/stdc++.h> using namespace std; int h, m, n, vn; map<int, pair<int, int> > M; int group[222222], pos[222222], host[222222]; vector<int> v[222222], first[222222]; inline void add(int i, int x, int d) { int m = first[i].size(); while (x < m) { first[i][x] += d; x = x \| (x + 1...
#include <bits/stdc++.h> using namespace std; int n, Max, reg; int TIME = 0; vector<int> T, W; bool used[1010]; int p[1010], dmg[1010]; int main() { int i, j, k, l, x, y; cin >> n >> Max >> reg; for (i = 0; i < n; ++i) cin >> p[i] >> dmg[i]; int ch = Max, cd = 0; while (1) { ch -...
#include <bits/stdc++.h> const int maxn = 1e5 + 10; const int N = 2e5; using namespace std; long long gcd(long long p, long long q) { return q == 0 ? p : gcd(q, p % q); } long long qmul(long long p, long long q, long long mo) { long long f = 0; while (q) { if (q & 1) f = (f + p) % mo; p = ...
#include <bits/stdc++.h> using namespace std; const int N = 65; long long S, L, ans; long long P[N] = {1}; long long f[N][N * 2][2]; int main() { scanf( %lld , &S); L = log2(S + 1); for (int i = 1; i < N; ++i) P[i] = P[i - 1] << 1; for (int h = 1; h <= L; ++h) { long long x = S % (P[h]...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; if (n & 1) { cout << -1; return 0; } if (n < 3) { cout << bb nww n nbb nww ; return 0; } string s1, s2; for (int i = 0; i < 110; i++) s1 += (i % 4 < 2) ? w : b ; s2 = s1.substr...
#include <bits/stdc++.h> using namespace std; int a[4], i, j, s; int main() { for (i = 0; i < 4; i++) { scanf( %d , &a[i]); s += a[i]; } for (i = 0; i < 4; i++) { if (a[i] == s - a[i]) { puts( YES ); return 0; } for (j = i + 1; j < 4; j++) if (a[i]...
#include <bits/stdc++.h> using namespace std; static inline void amin(int &a, int b) { if (a > b) a = b; } int main() { int N, M; scanf( %d%d , &N, &M); int A[N]; for (int i = 0; i < N; ++i) { scanf( %d , &A[i]); } pair<int, int> Q[M]; for (int i = 0; i < M; ++i) { sc...
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( Ofast ) #pragma GCC optimize( unroll-loops ) template <class T, class U> istream &operator>>(istream &in, pair<T, U> &p) { in >> p.first >> p.second; return in; } template <class T, class U> ostream &operator<<(ostream &out, con...
#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); long long n; long long len[1000005]; long long pai[1000005]; string s; long long find(long long x) { if (pai[x] == x) return x; return pai[x] = find(pai[x]); } void merge(long lon...
#include <bits/stdc++.h> using namespace std; int const bound = 2e6 + 2, N = 5e5 + 2; long long OO = 1e18; double eps = 1e-6; int oo = 1e9, mod = oo + 7; pair<int, int> can[101]; bool cmp(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) { if (a.first.first != b.first.first) return a.first.fir...
#include <bits/stdc++.h> using namespace std; int z[26][200001], w[26]; int main() { int n, m, i, j, a, le; char str[200001]; scanf( %d %d , &n, &m); scanf( %s , str); for (i = 0; str[i]; i++) { z[str[i] - a ][w[str[i] - a ]] = i; w[str[i] - a ]++; } long long ans; i...
#include <bits/stdc++.h> using namespace std; const int inf = (int)1e9 + 100; const long double eps = 1e-11; const long double pi = acos(-1.0L); int myrand() { return rand(); } unsigned rdtsc() { unsigned ans; asm( rdtsc : =a (ans)); return ans; } int rnd(int x) { return myrand() % x; } ...
#include <bits/stdc++.h> using namespace std; int main() { string a, b; cin >> a >> b; cout << a[0]; for (int e = 1; e < a.size(); e++) if (a[e] < b[0]) cout << a[e]; else break; cout << b[0] << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } map<int, int> m; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (i != j) { ++m[a[i] + a[j]]; } } ...
#include <bits/stdc++.h> using namespace std; int main() { int n, t; string In; vector<char> Que; cin >> n >> t >> In; for (char x : In) { Que.push_back(x); } for (int i = 0; i < t; i++) { for (int x = 0; x < n; x++) { if (Que[x] == B && Que[x + 1] == G ) { ...
#include <bits/stdc++.h> using namespace std; const int SIZE = 100011; const int MAX = 1e9; int mi[SIZE << 2], a[SIZE]; void init(int L, int R, int id) { mi[id] = MAX; if (L == R) return; int mm = (L + R) >> 1; init(L, mm, id << 1); init(mm + 1, R, (id << 1) + 1); } void ins(int L, int...
#include <bits/stdc++.h> using namespace std; int n, start, x; pair<int, int> ask(int v) { printf( ? %d n , v); fflush(stdout); int value, nxt; scanf( %d %d , &value, &nxt); return pair<int, int>(value, nxt); } const int RANDOM_Q = 1000; int main() { srand(time(NULL)); scanf( %d ...
#include <bits/stdc++.h> using namespace std; int a[4][4], kk; bool ok; int main() { for (int i = 0; i < 3; ++i) for (int j = 0; j < 3; ++j) scanf( %d , &a[i][j]); kk = max(a[0][1] + a[0][2], max(a[1][0] + a[1][2], a[2][0] + a[2][1])) + 100000; for (int i = a[0][1] + a[0][2] + 1; i <=...
#include <bits/stdc++.h> #define ll long long using namespace std; int main() { ios_base::sync_with_stdio(0) ; cin.tie(0) ; cout.tie(0) ; int t; cin>>t; while(t--) { ll n,x,s=0,a=1; cin>>n>>x; ll arr[n]; for(int i=0; i<n; i++) ...
#include <bits/stdc++.h> using namespace std; int main() { string str; cin >> str; int c = 0; for (int j = 0; j < str.length(); j++) { if (str[j] == @ ) { c = c + 1; } } if (c == 0) { cout << No solution << endl; } else if (c > 0) { int c1 = 1; in...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> h(n); for (int i = 0; i < n; i++) cin >> h[i]; vector<pair<int, int> > v(n); for (int i = 0; i < n; i++) { v[i] = make_pair(h[i], i); } sort(v.begin(), v.end()); sort(h.begin(), h.end())...
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 1; int a[N]; int main() { long long ans = 0, ones = 0, k; string s; cin >> k >> s; a[0] = -1; for (int i = 0; i < s.size(); i++) { if (s[i] == 1 ) ones++, a[ones] = i; if (ones >= k) { if (k != 0) ...
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10, p = 1e9 + 7; int n, cnt[26], inv[N], fac[N], finv[N]; char a[N], b[N]; inline int solve(char *s) { int ans = 0, noans = fac[n]; memset(cnt, 0, sizeof cnt); for (int i = 1; i <= n; ++i) ++cnt[a[i] - a ]; for (int i = 0; i < ...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long t; cin >> t; while (t--) { long long n, m; cin >> n >> m; vector<long long> vis(n); for (int i = 0, ggdem = m; i < ggdem; ++i) { long long a,...
#include <bits/stdc++.h> int main() { unsigned long long int n, sum = 0, sum1 = 0, i, MAX = 0, temp; scanf( %llu , &n); int a[n]; for (i = 0; i < n; ++i) { scanf( %llu , &a[i]); } for (i = 0; i < n; ++i) { sum = sum + a[i]; } for (i = 0; i < n; ++i) { if (a[i] > MAX) ...
#include <bits/stdc++.h> using namespace std; int main() { long long int n, x, y; cin >> n >> x >> y; int a[n]; int c = 0; for (int i = 0; i < n; i++) { cin >> a[i]; if (a[i] <= x) c++; } if (x > y) cout << n << endl; else { if (c % 2 == 0) cout << c /...
#include <bits/stdc++.h> using namespace std; int block[101]; int nuclea[101]; int inst[101][101]; int main() { ios_base::sync_with_stdio(0); int n, m, k; cin >> n >> m >> k; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> inst[j][i]; } } for (int...
#include <bits/stdc++.h> using namespace std; const int N = 3 * 100 * 1000 + 1000; const int N1 = 5100; long long A[N], n, k; unsigned long long dp[N1][N1]; void read() { cin >> n >> k; for (int i = 0; i < n; i++) cin >> A[i]; sort(A, A + n); for (int i = 0; i < N1; i++) for (int j = 0...
#include <bits/stdc++.h> using namespace std; static const double EPS = 1e-10; template <typename T, typename S> vector<T>& operator<<(vector<T>& a, S b) { a.push_back(b); return a; } template <typename T> void operator>>(vector<T>& a, int b) { while (b--) if (!a.empty()) a.pop_back(); ...
#include <bits/stdc++.h> using namespace std; const int N = 100005; const int mod = 998244353; int a[N], s[N], f[N][105], b[N][105]; inline void add(int &x, int y) { x += y; if (x >= mod) x -= mod; return; } template <typename T> inline void chkmax(T &x, T y) { x = max(x, y); } templ...
#include <bits/stdc++.h> using namespace std; const int N = 100005; int head[N], Next[N], ver[N], tot; inline void add(int u, int v) { ver[++tot] = v, Next[tot] = head[u], head[u] = tot; } int pa[N][25], top[N], son[N], dep[N], ans, n, L; long long sum[N], w[N], S; inline void init(int u) { for ...
#include <bits/stdc++.h> using namespace std; const int N = 5e5 + 9; vector<pair<int, int> > barr[N]; int n, q, arr[N], a, b; long long t[N], ans[N]; int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> arr[i]; scanf( %d , &q); int kok = sqrt(n); for (int i = 1; i <= q; i++) { ...
#include <bits/stdc++.h> using namespace std; using ll = long long; const int maxN = 5e5 + 5; int m, k, n, s; vector<int> a; int c[maxN], h[maxN]; int main(int argc, char *argv[]) { cin >> m >> k >> n >> s; a.resize(m + 1); for (int i = 1; i <= m; ++i) cin >> a[i]; int total = 0; for (...
#include <bits/stdc++.h> using namespace std; int main() { long long a; cin >> a; cout << (a + a / 2) << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const char nl = n ; const long long mod = 1e9 + 7; long long bigmod(long long a, long long b) { if (b == 0) return 1; long long ans = bigmod(a, b / 2); ans = (ans * ans) % mod; if (b & 1) ans *= a; return ans % mod; } void solve() { lon...

#include <bits/stdc++.h> using namespace std; int arr[10][10]; double me[10][10]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n = 10; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { cin >> arr[i][j]; } } me[0][0] = 0.; me[0][1] = ...

#include <bits/stdc++.h> using namespace std; const int MX = 1000006; const long long inf = 1e18; long long n, m, p, a[MX], ca[MX], b[MX], cb[MX], mn[MX]; long long x[MX], y[MX], z[MX]; long long st[4 * MX + 20], lz[4 * MX + 20], res = -inf; vector<int> pos[MX]; void push(int i, int j, int pos) { if...

#include <bits/stdc++.h> using namespace std; const int INF = 2e9; const long long INFL = 2e18; const int N = 1e6, M = N; int n, m, G = 0; vector<int> adj[N + 5]; int gr[N + 5], p[N + 5]; vector<int> pth[N + 5]; vector<int> PTH_myEndlessLove; int Pos[N + 5]; void dfs(int u) { gr[u] = G; PT...

#include <bits/stdc++.h> using namespace std; char a[10005]; char b[1000005]; vector<int> poj[10005]; int alen, blen; long long total; int pos; vector<int>::iterator it; int main() { scanf( %s , a); scanf( %s , b); alen = strlen(a), blen = strlen(b); pos = 0; total = 1; for (in...

#include <bits/stdc++.h> using namespace std; int main() { long long int n{0}, a{0}, m{0}, s{0}; cin >> n; for (long long int i = 1; i <= n; i++) { cin >> a; s += a; m = max(m, a); } if (s % 2 == 1 || s < 2 * m) { cout << NO ; return 0; } cout << YES ; ...

#include <bits/stdc++.h> using namespace std; const int inf = 0xffffff; int LEN; class Mcmf { public: struct T { int from, to, val; int next, cost; } edge[200001]; int len; int visit[200001], pre[200001], dist[200001], que[200001], vis[200001], pos[200001]; void init()...

#include <bits/stdc++.h> using namespace std; unsigned int dp[100010][400]; vector<int> nima[100010]; int a[100010], b[100010]; int n, m, s, e; int solve(int all = s, int c = e) { unsigned int INF = -1; vector<int> vt[100010]; int cur = 0; memset(dp, -1, sizeof(dp)); int cnt = (all + c -...

#include <bits/stdc++.h> using namespace std; int a[11][5]; bool ok(int l, int j, int k) { int i, an = 0; for (i = 0; i < 5; i++) { an = an + (a[j][i] - a[l][i]) * (a[k][i] - a[l][i]); } if (an > 0) return false; return true; } int main() { ios::sync_with_stdio(false); int i,...

#include <bits/stdc++.h> using namespace std; const int N = 2505; int n, m, K, a[2][N][N], L[N][8], R[N][8], Lc[N][8], Rc[N][8]; char s[N]; long long ans; void work(int x1, int x2, int y1, int y2, int d) { if (y2 - y1 > x2 - x1) { swap(x1, y1), swap(x2, y2), d ^= 1; } if (x1 + 1 == x2) { ...

#include <bits/stdc++.h> using namespace std; const long long int mx = 70, Mod = 1e9 + 7, mxx = 350000; int n; int get(int x, int y, int z) { if (x > y) swap(x, y); if (x > z) swap(x, z); if (y > z) swap(y, z); return x * mx * mx + y * mx + z; } bool mark[mxx]; vector<int> e[mxx]; int dp...

#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 100; long long a[maxn]; long long fac[maxn], inv[maxn]; const int mod = 1e9 + 7; long long Pow(long long x, long long y) { long long res = 1; while (y) { if (y & 1) res = res * x % mod; x = x * x % mod; y >>= 1; ...

#include <bits/stdc++.h> using namespace std; template <class T> ostream &operator<<(ostream &os, vector<T> &vec) { os << { ; for (int i = (0), __i = (((int)(vec).size())); i < __i; i++) { os << vec[i]; if (i + 1 != ((int)(vec).size())) os << , ; } os << } ; return os; } tem...

#include <bits/stdc++.h> using namespace std; int df[26]; int main() { ios::sync_with_stdio(false); cin.tie(NULL); int n, k; cin >> n >> k; string s; cin >> s; int mini = s.length(); for (int i = 0; i < s.length(); i++) { df[s[i] - A ]++; } for (int i = 0; i < k; i++...

#include <bits/stdc++.h> using namespace std; void solve() { int n, i; cin >> n; int a[n], b[n + 1]; for (i = 0; i < n; i++) { cin >> a[i]; b[a[i]] = i; } int l, r, ans[n + 1]; l = b[1]; r = b[1]; for (i = 2; i <= n; i++) { l = min(l, b[i]); r = max(r, b[i...

#include <bits/stdc++.h> using namespace std; namespace FGF { int n, m; const int N = 2e6 + 5; const int mo = 1e9 + 7; char s[N]; long long a[N], pw[N], cnt[N]; long long ans; void FWTxor(long long *y, int op) { for (int i = 1; i <= n; i++) for (int j = 0; j < (1 << n); j += (1 << i)) ...

#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int N = 2e4 + 5; int sum[55][N], a[55][N]; int lazy[N << 2], tree[N << 2]; int dp[55][N]; void pushdown(int root) { if (lazy[root]) { tree[root << 1] += lazy[root]; tree[root << 1 | 1] += lazy[root]; lazy[ro...

#include <bits/stdc++.h> using namespace std; const long long inf = 707406378; const int maxn = 1.5e7 + 10; void read(long long &x) { char ch; bool flag = 0; for (ch = getchar(); !isdigit(ch) && ((flag |= (ch == - )) || 1); ch = getchar()) ; for (x = 0; isdigit(ch); x = (x << 1) ...

#include <bits/stdc++.h> const int p = 998244353; const int inv2 = 499122177; const int MAXN = 140000; inline long long read() { long long x = 0, f = 1; char ch = getchar(); while (ch > 9 || ch < 0 ) { if (ch == - ) f = -1; ch = getchar(); } do x = (x * 10 + ch - 48) % p, ch ...

#include <bits/stdc++.h> using namespace std; long long int gcd(long long int x, long long int y) { if (y > x) { return gcd(y, x); } if (y == 0) { return x; } return gcd(y, x % y); } bool prime(long long int x) { for (long long int i = 2; i <= sqrt(x); i++) { if (x % i ...

#include <bits/stdc++.h> using namespace std; int n; int dp[10][310]; int nex[1010][10][1010]; int ai[1010]; int up; void init(void) { memset(dp, -1, sizeof(dp)); int i, j; int cnt[10]; for (i = 1; i <= n; i++) { memset(cnt, 0, sizeof(cnt)); for (j = 1; j <= 8; j++) for...

#include <bits/stdc++.h> using namespace std; int n, m; int num[105]; int a[105][105], sum[105][105], mx[105][105]; int f[105][10005]; int main() { cin >> n >> m; for (int i = 1; i <= n; i++) { cin >> num[i]; for (int j = 1; j <= num[i]; j++) { cin >> a[i][j]; sum[i][j] =...

#include <bits/stdc++.h> int main() { long long a, b, c, flag = 0; scanf( %lld , &a); if (a == 1 || a == 2) { printf( -1 ); return 0; } if (a % 2 == 0) { flag = 1; } if (flag != 1) { b = (a * a + 1) / 2; c = (a * a - 1) / 2; printf( %lld %lld , c, b); ...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> v(n); for (int i = 0; i < n; i++) cin >> v[i]; sort(v.begin(), v.end()); vector<int> w(n, 0); w[0] = v[0]; for (int i = 1; i < n; i++) w[i] = w[i - 1] + v[i]; int score = 0, penalty = 0; f...

#include <bits/stdc++.h> using namespace std; int freq[200005]; int arr[1005]; int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); int n; cin >> n; for (int i = 1; i <= n; i++) cin >> arr[i]; for (int i = 1; i <= n; i++) for (int j = i + 1; j <= n; j++) freq[arr[i] + ar...

#include <bits/stdc++.h> using namespace std; struct __timestamper {}; struct change { int s, t, u; }; vector<long long> solve(vector<int> a, vector<change> b) { long long sum = 0; for (auto x : a) sum += x; vector<long long> ans; int n = a.size(); vector<int> cntr(n); auto change_...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int x, y = 0, z = 0; for (int i = 0; i < n; i++) { cin >> x; if (x != y) { z++; } y = x; } cout << z; return 0; }

#include <bits/stdc++.h> using namespace std; long long n, t[100001], ans; double w; long long lowbit(long long x) { return x & (-x); } struct rua { double x, v; long long id; } _[100001]; void change(long long x) { while (x <= n) t[x]++, x += lowbit(x); } int sum(long long k) { long l...

#include<cstdio> #include<cstring> #include<algorithm> using namespace std; char ch; int t,n,k,h[110],pos; void read(int &x) { x=0; ch=getchar(); while(ch< 0 ||ch> 9 ) ch=getchar(); while(ch>= 0 &&ch<= 9 ) { x=x*10+ch- 0 ; ch=getchar(); } } int main() { read(t); whil...

#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); vector<long long> X(n + 1), Y(n + 1); for (int i = (1); i <= (n); ++i) scanf( %lld%lld , &X[i], &Y[i]); long long S = 0; for (int k = (1); k <= (n); ++k) { vector<double> V; for (int i = (1); i <= ...

#include <bits/stdc++.h> using namespace std; int sum, len; string s; int cnt[26][5010][26]; int main() { cin >> s; sum = 0; len = s.length(); s += s; memset(cnt, 0, sizeof(cnt)); for (int i = 0; i < len; i++) { for (int j = 1; j < len; j++) { cnt[s[i] - a ][j][s[i + j] ...

#include <bits/stdc++.h> using namespace std; int main() { int A1, B1, C1, A2, B2, C2; cin >> A1 >> B1 >> C1 >> A2 >> B2 >> C2; if (A1 * B2 != A2 * B1) cout << 1 << endl; else { if (A1 != 0 && A2 != 0 && A2 * C1 == A1 * C2) cout << -1 << endl; else if (A1 != 0 && A2 != 0) ...

#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 5; bool vis[N]; vector<int> prime; void sieve() { for (int i = 2; i * i < N; i++) { if (vis[i]) continue; for (int j = 2; j * i < N; j++) { vis[i * j] = 1; } } for (int i = 2; i < N; i++) { if (vis[i]...

#include <bits/stdc++.h> using namespace std; const int Inf = (1 << 30) - 1; const long long lInf = (1LL << 62) - 1; const int mInf = 0x7f7f7f7f; const int Maxn = 200010; vector<int> a[Maxn]; pair<int, int> S[Maxn << 1]; int f[Maxn]; int t[Maxn]; int n, m, ans; void solve(int k) { map<int, int...

#include <bits/stdc++.h> using namespace std; int main() { int n, m, s, f, add = 0, rund = 1; cin >> n >> m >> s >> f; if (s < f) add = 1; else add = -1; for (int i = 0; i < m; i++) { int t, l, r; cin >> t >> l >> r; while (rund < t) { if (s == f) break; ...

#include <bits/stdc++.h> using namespace std; const int Nmax = 1e5 + 5, lg = 16; struct updates { int l, x, y, id; bool operator<(const updates &other) const { if (l != other.l) return l > other.l; return id < other.id; } }; vector<updates> upd; vector<int> v[Nmax]; struct Node { ...

#include <bits/stdc++.h> using namespace std; int main() { int(n); scanf( %d , &(n)); int val[100001][2]; double arr[100001]; for (int i = 1; i <= n; i++) cin >> arr[i]; int sum = 0; for (int i = 1; i <= n; i++) { int t = arr[i]; if (arr[i] - t != 0) { if (t > 0) { ...

#include <bits/stdc++.h> long long i, j, m, n, s, t, x, y, z, ma; long long a[100][100], b[100][100]; long long mi(long long a, long long b) { if (a < b) return a; else return b; } void ss(long long x, long long y, long long shu) { long long i, j, t; z++; if (z > 8000000) retur...

#include <bits/stdc++.h> using namespace std; int c[100001]; int w[100001]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, m; cin >> n >> m; for (int i = 0; i < n; i++) { cin >> c[i]; } for (int i = 0; i < n; i++) { cin >> w[i]; } int ch = m; se...

#include <bits/stdc++.h> using namespace std; int main() { pair<int, int> p[100]; int n; cin >> n; for (int i = 0; i < n; i++) { cin >> p[i].first; p[i].second = i + 1; } sort(p, p + n); for (int i = 0; i < n; i++) cout << p[i].second << ; }

#include <bits/stdc++.h> int main() { int ans = 0; int count; scanf( %d , &count); for (int i = 0; i < count; i++) { int prize; scanf( %d , &prize); int minTimeToPrize = std::min(prize - 1, 1000000 - prize); ans = std::max(ans, minTimeToPrize); } printf( %d , ans); ...

#include <bits/stdc++.h> using namespace std; const int N = 100005; struct Point { int x, y; void read() { int a, b; scanf( %d%d , &a, &b); x = a + b; y = a - b; } bool operator<(const Point p) const { return x != p.x ? x < p.x : y < p.y; } } p[N]; int n; int pre_min[...

#include <bits/stdc++.h> using namespace std; const int NMax = 40, MMax = 200; int N, nn, A[NMax][NMax], B[NMax]; int get(int a, int b) { return (a ^ b); } int P(int a, int b) { if (b) return a * -1; else return a; } int main() { scanf( %d , &N); nn = (N + 1) >> 1; for (int...

#include <bits/stdc++.h> using namespace std; signed main() { long long t; cin >> t; while (t--) { long long a, b, c, d; cin >> a >> b >> c >> d; long long s1 = a + b; long long s2 = c + d; if (s1 > s2) cout << s1 << endl; else cout << s2 << endl; ...

#include <bits/stdc++.h> using namespace std; int main() { int n, i, flag = 0, j; cin >> n; while (n--) { int x; cin >> x; flag = 0; for (i = 0; i <= 33; i++) { for (j = 0; j <= 14; j++) { if (i * 3 + j * 7 == x) { cout << YES << endl; ...

#include <bits/stdc++.h> using namespace std; int N; bool valid(int P, int d, vector<int> guess) { if (P >= N) { return true; } if (P == 0) { if (valid(P + 1, d, guess)) return true; guess[P] -= d; if (valid(P + 1, d, guess)) return true; guess[P] += d; guess[P] += ...

#include <bits/stdc++.h> using namespace std; signed main() { int64_t n; cin >> n; int64_t a[n]; for (int64_t i = 0; i < n; i++) cin >> a[i]; map<int64_t, int64_t> first; map<int64_t, int64_t> second; first[a[0]] = 1; int64_t sum = 0; for (int64_t i = 0; i < n; i++) sum += a[i]; ...

#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; int n, m, q; int a[1110][810]; char s[1100]; int ni[5] = {0, 1, 3, 2, 4}; long long pow_mod(long long a, long long e) { long long res = 1; for (; e; a = a * a % mod, e >>= 1) if (e & 1) res = res * a % mod; retu...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, a; cin >> n >> a; map<int, int> my; set<int> rem; int ca = 0; for (int i = 0; i < n; ++i) { int x; cin >> x; if (x == a) { ++ca; } else {...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); int64_t n, l, d; cin >> n >> d >> l; int a[25001]; for (int i = 1; i <= n; i++) { if (d > 0) { a[i] = l; } else { a[i] = 1; } d = a[i] - d; } a[n] = a[n] -...

#include <bits/stdc++.h> const int INF = 0x3f3f3f3f; const long long int INFLL = 0x3f3f3f3f3f3f3f3fll; long long int getint() { long long int ret = 0; bool f = 0; char c; while ((c = getchar()) < 0 || c > 9 ) if (c == - ) f ^= 1; while (c >= 0 && c <= 9 ) { ret = ret * 10 + ...

#include <bits/stdc++.h> using namespace std; long long valor[100456], solapacion[100456][320], posheavy[100456], resp[100456], arrupd[100456]; vector<long long> v[100456], colaheavy; bool light[100456], existe[100456]; void init() { for (int i = 0; i < 100456; ++i) { existe[i] = false; } ...

#include <bits/stdc++.h> using namespace std; const int maxn = 201; int a[maxn], N, L, K; double f[maxn][maxn][maxn * 2], p[maxn]; int main() { scanf( %d%d%d , &N, &L, &K); for (int i = 0; i < N; ++i) { scanf( %lf , &p[i]); p[i] /= 100; } for (int i = 0; i < N; ++i) scanf( %d , &a[...

#include <bits/stdc++.h> using namespace std; set<int> s[100005]; int color[100005]; int main() { int n, m; while (~scanf( %d%d , &n, &m)) { int i, j, tmp = 0; int u, v, ans; for (i = 1; i <= n; i++) scanf( %d , &color[i]); for (j = 0; j < m; j++) { scanf( %d%d , &u, &v);...

#include <bits/stdc++.h> #pragma GCC optimize( O3 ) const long long INF = 0x3f3f3f3f3f3f3f3f; const long long llinf = (1LL << 61); const int inf = (1 << 30); const int nmax = 4e5 + 50; const int mod = 1e9 + 7; using namespace std; string s; long long n, a[nmax], st[4 * nmax], i, lzy[4 * nmax], x, q, s...

#include <bits/stdc++.h> using namespace std; int n, m, l; long long dp[250005]; short big_arr[250005], small_arr[5001]; long long pre[51], sum[51], suf[51], mx[51], maxx = -1e5; long long solve(int indx, long long curSum) { if (indx == m + 1) return -2000; short &i = big_arr[indx]; long long &r...

#include <bits/stdc++.h> using namespace std; const int mod = 9901; template <class T> int countbit(T n) { int t = 0; while (n) n &= n - 1, ++t; return t; } template <class T> T lowbit(T n) { return n & (-n); } const double eps = 1e-8; const double pi = acos(-1.0); const int INF = ...

#include <bits/stdc++.h> struct Point { int x, y; Point* next; bool operator<(const Point& p) const { return 1ll * p.x * y < 1ll * x * p.y; } } P[200010], *np = P; std::map<long long, Point*> fir; std::map<Point, int> M; int main() { int q, s = 0; scanf( %d , &q); while (q--) { i...

#include <bits/stdc++.h> using namespace std; long long expo(long long x, long long n, long long m) { if (n == 0) return 1; else if (n % 2 == 0) return expo((x * x) % m, n / 2, m); else return (x * expo((x * x) % m, (n - 1) / 2, m)) % m; } string DtoB(int j) { string s = ; ...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:320000000 ) using namespace std; const double EPS = 1e-9; const int INF = 0x7f7f7f7f; const double PI = acos(-1.0); template <class T> inline T Abs(T n) { return ((n) < 0 ? -(n) : (n)); } template <class T> inline T Max(T x, T y) { ret...

#include <bits/stdc++.h> using namespace std; int Q, m, n, a[10001], c[100001], ans, f[5001][101], d[1001]; char b[500001][13]; void dfs(int x, int now, int zong, int he) { if (x > n) { if (zong <= 100) f[he][zong] += c[now]; return; } dfs(x + 1, now * 2 + 1, zong + (d[x] == 1 ? a[x] : 0...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int t; cin >> t; while (t--) { long long n, g, b; cin >> n >> g >> b; if (g >= b) { cout << n << endl; continue; } long long good_need = n / 2; ...

#include <bits/stdc++.h> using namespace std; int main() { int n, a, b, c, d; while (scanf( %d , &n) != EOF) { int j, x, y, flag = 0; for (int i = 1; i <= 4; i++) { scanf( %d%d%d%d , &a, &b, &c, &d); a = min(a, b); b = min(c, d); if (a + b <= n) { x = a;...

#include <bits/stdc++.h> using namespace std; int main() { int c0, c1, c2, c3; cin >> c0 >> c1 >> c2 >> c3; if (c1 - c0 == c2 - c1 && c2 - c1 == c3 - c2) { cout << c3 + c1 - c0 << endl; } else if (c1 * c1 == c0 * c2 && c2 * c2 == c1 * c3 && !((c3 * c3) % c2)) { cout << c3 * c1 / c0 << en...

#include <bits/stdc++.h> using namespace std; int w[1501000], cnt[1501000]; int main() { int N, i; int po, ans; scanf( %d , &N); for (int i = (0); i < (N); i++) scanf( %d , w + i); sort(w, w + N); memset(cnt, 0, sizeof(cnt)); for (int i = (0); i < (N); i++) cnt[w[i]]++; po = 0; ...

#include <bits/stdc++.h> using namespace std; int a[510][510]; int d[1010][510]; int d2[1010][510]; int x, y, nr[1010], nr2[1010]; int n, m, i, j, ok; int main() { scanf( %d%d , &n, &m); for (i = 1; i <= n; i++) for (j = 1; j <= m; j++) scanf( %d , &a[i][j]); for (i = 1; i <= n; i++) { ...

#include <bits/stdc++.h> using namespace std; int h, m, n, vn; map<int, pair<int, int> > M; int group[222222], pos[222222], host[222222]; vector<int> v[222222], first[222222]; inline void add(int i, int x, int d) { int m = first[i].size(); while (x < m) { first[i][x] += d; x = x | (x + 1...

#include <bits/stdc++.h> using namespace std; int n, Max, reg; int TIME = 0; vector<int> T, W; bool used[1010]; int p[1010], dmg[1010]; int main() { int i, j, k, l, x, y; cin >> n >> Max >> reg; for (i = 0; i < n; ++i) cin >> p[i] >> dmg[i]; int ch = Max, cd = 0; while (1) { ch -...

#include <bits/stdc++.h> const int maxn = 1e5 + 10; const int N = 2e5; using namespace std; long long gcd(long long p, long long q) { return q == 0 ? p : gcd(q, p % q); } long long qmul(long long p, long long q, long long mo) { long long f = 0; while (q) { if (q & 1) f = (f + p) % mo; p = ...

#include <bits/stdc++.h> using namespace std; const int N = 65; long long S, L, ans; long long P[N] = {1}; long long f[N][N * 2][2]; int main() { scanf( %lld , &S); L = log2(S + 1); for (int i = 1; i < N; ++i) P[i] = P[i - 1] << 1; for (int h = 1; h <= L; ++h) { long long x = S % (P[h]...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; if (n & 1) { cout << -1; return 0; } if (n < 3) { cout << bb nww n nbb nww ; return 0; } string s1, s2; for (int i = 0; i < 110; i++) s1 += (i % 4 < 2) ? w : b ; s2 = s1.substr...

#include <bits/stdc++.h> using namespace std; int a[4], i, j, s; int main() { for (i = 0; i < 4; i++) { scanf( %d , &a[i]); s += a[i]; } for (i = 0; i < 4; i++) { if (a[i] == s - a[i]) { puts( YES ); return 0; } for (j = i + 1; j < 4; j++) if (a[i]...

#include <bits/stdc++.h> using namespace std; static inline void amin(int &a, int b) { if (a > b) a = b; } int main() { int N, M; scanf( %d%d , &N, &M); int A[N]; for (int i = 0; i < N; ++i) { scanf( %d , &A[i]); } pair<int, int> Q[M]; for (int i = 0; i < M; ++i) { sc...

#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( Ofast ) #pragma GCC optimize( unroll-loops ) template <class T, class U> istream &operator>>(istream &in, pair<T, U> &p) { in >> p.first >> p.second; return in; } template <class T, class U> ostream &operator<<(ostream &out, con...

#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); long long n; long long len[1000005]; long long pai[1000005]; string s; long long find(long long x) { if (pai[x] == x) return x; return pai[x] = find(pai[x]); } void merge(long lon...

#include <bits/stdc++.h> using namespace std; int const bound = 2e6 + 2, N = 5e5 + 2; long long OO = 1e18; double eps = 1e-6; int oo = 1e9, mod = oo + 7; pair<int, int> can[101]; bool cmp(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) { if (a.first.first != b.first.first) return a.first.fir...

#include <bits/stdc++.h> using namespace std; int z[26][200001], w[26]; int main() { int n, m, i, j, a, le; char str[200001]; scanf( %d %d , &n, &m); scanf( %s , str); for (i = 0; str[i]; i++) { z[str[i] - a ][w[str[i] - a ]] = i; w[str[i] - a ]++; } long long ans; i...

#include <bits/stdc++.h> using namespace std; const int inf = (int)1e9 + 100; const long double eps = 1e-11; const long double pi = acos(-1.0L); int myrand() { return rand(); } unsigned rdtsc() { unsigned ans; asm( rdtsc : =a (ans)); return ans; } int rnd(int x) { return myrand() % x; } ...

#include <bits/stdc++.h> using namespace std; int main() { string a, b; cin >> a >> b; cout << a[0]; for (int e = 1; e < a.size(); e++) if (a[e] < b[0]) cout << a[e]; else break; cout << b[0] << endl; return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } map<int, int> m; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (i != j) { ++m[a[i] + a[j]]; } } ...

#include <bits/stdc++.h> using namespace std; int main() { int n, t; string In; vector<char> Que; cin >> n >> t >> In; for (char x : In) { Que.push_back(x); } for (int i = 0; i < t; i++) { for (int x = 0; x < n; x++) { if (Que[x] == B && Que[x + 1] == G ) { ...

#include <bits/stdc++.h> using namespace std; const int SIZE = 100011; const int MAX = 1e9; int mi[SIZE << 2], a[SIZE]; void init(int L, int R, int id) { mi[id] = MAX; if (L == R) return; int mm = (L + R) >> 1; init(L, mm, id << 1); init(mm + 1, R, (id << 1) + 1); } void ins(int L, int...

#include <bits/stdc++.h> using namespace std; int n, start, x; pair<int, int> ask(int v) { printf( ? %d n , v); fflush(stdout); int value, nxt; scanf( %d %d , &value, &nxt); return pair<int, int>(value, nxt); } const int RANDOM_Q = 1000; int main() { srand(time(NULL)); scanf( %d ...

#include <bits/stdc++.h> using namespace std; int a[4][4], kk; bool ok; int main() { for (int i = 0; i < 3; ++i) for (int j = 0; j < 3; ++j) scanf( %d , &a[i][j]); kk = max(a[0][1] + a[0][2], max(a[1][0] + a[1][2], a[2][0] + a[2][1])) + 100000; for (int i = a[0][1] + a[0][2] + 1; i <=...

#include <bits/stdc++.h> #define ll long long using namespace std; int main() { ios_base::sync_with_stdio(0) ; cin.tie(0) ; cout.tie(0) ; int t; cin>>t; while(t--) { ll n,x,s=0,a=1; cin>>n>>x; ll arr[n]; for(int i=0; i<n; i++) ...

#include <bits/stdc++.h> using namespace std; int main() { string str; cin >> str; int c = 0; for (int j = 0; j < str.length(); j++) { if (str[j] == @ ) { c = c + 1; } } if (c == 0) { cout << No solution << endl; } else if (c > 0) { int c1 = 1; in...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> h(n); for (int i = 0; i < n; i++) cin >> h[i]; vector<pair<int, int> > v(n); for (int i = 0; i < n; i++) { v[i] = make_pair(h[i], i); } sort(v.begin(), v.end()); sort(h.begin(), h.end())...

#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 1; int a[N]; int main() { long long ans = 0, ones = 0, k; string s; cin >> k >> s; a[0] = -1; for (int i = 0; i < s.size(); i++) { if (s[i] == 1 ) ones++, a[ones] = i; if (ones >= k) { if (k != 0) ...

#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10, p = 1e9 + 7; int n, cnt[26], inv[N], fac[N], finv[N]; char a[N], b[N]; inline int solve(char *s) { int ans = 0, noans = fac[n]; memset(cnt, 0, sizeof cnt); for (int i = 1; i <= n; ++i) ++cnt[a[i] - a ]; for (int i = 0; i < ...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long t; cin >> t; while (t--) { long long n, m; cin >> n >> m; vector<long long> vis(n); for (int i = 0, ggdem = m; i < ggdem; ++i) { long long a,...

#include <bits/stdc++.h> int main() { unsigned long long int n, sum = 0, sum1 = 0, i, MAX = 0, temp; scanf( %llu , &n); int a[n]; for (i = 0; i < n; ++i) { scanf( %llu , &a[i]); } for (i = 0; i < n; ++i) { sum = sum + a[i]; } for (i = 0; i < n; ++i) { if (a[i] > MAX) ...

#include <bits/stdc++.h> using namespace std; int main() { long long int n, x, y; cin >> n >> x >> y; int a[n]; int c = 0; for (int i = 0; i < n; i++) { cin >> a[i]; if (a[i] <= x) c++; } if (x > y) cout << n << endl; else { if (c % 2 == 0) cout << c /...

#include <bits/stdc++.h> using namespace std; int block[101]; int nuclea[101]; int inst[101][101]; int main() { ios_base::sync_with_stdio(0); int n, m, k; cin >> n >> m >> k; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> inst[j][i]; } } for (int...

#include <bits/stdc++.h> using namespace std; const int N = 3 * 100 * 1000 + 1000; const int N1 = 5100; long long A[N], n, k; unsigned long long dp[N1][N1]; void read() { cin >> n >> k; for (int i = 0; i < n; i++) cin >> A[i]; sort(A, A + n); for (int i = 0; i < N1; i++) for (int j = 0...

#include <bits/stdc++.h> using namespace std; static const double EPS = 1e-10; template <typename T, typename S> vector<T>& operator<<(vector<T>& a, S b) { a.push_back(b); return a; } template <typename T> void operator>>(vector<T>& a, int b) { while (b--) if (!a.empty()) a.pop_back(); ...

#include <bits/stdc++.h> using namespace std; const int N = 100005; const int mod = 998244353; int a[N], s[N], f[N][105], b[N][105]; inline void add(int &x, int y) { x += y; if (x >= mod) x -= mod; return; } template <typename T> inline void chkmax(T &x, T y) { x = max(x, y); } templ...

#include <bits/stdc++.h> using namespace std; const int N = 100005; int head[N], Next[N], ver[N], tot; inline void add(int u, int v) { ver[++tot] = v, Next[tot] = head[u], head[u] = tot; } int pa[N][25], top[N], son[N], dep[N], ans, n, L; long long sum[N], w[N], S; inline void init(int u) { for ...

#include <bits/stdc++.h> using namespace std; const int N = 5e5 + 9; vector<pair<int, int> > barr[N]; int n, q, arr[N], a, b; long long t[N], ans[N]; int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> arr[i]; scanf( %d , &q); int kok = sqrt(n); for (int i = 1; i <= q; i++) { ...

#include <bits/stdc++.h> using namespace std; using ll = long long; const int maxN = 5e5 + 5; int m, k, n, s; vector<int> a; int c[maxN], h[maxN]; int main(int argc, char *argv[]) { cin >> m >> k >> n >> s; a.resize(m + 1); for (int i = 1; i <= m; ++i) cin >> a[i]; int total = 0; for (...

#include <bits/stdc++.h> using namespace std; int main() { long long a; cin >> a; cout << (a + a / 2) << endl; return 0; }

#include <bits/stdc++.h> using namespace std; const char nl = n ; const long long mod = 1e9 + 7; long long bigmod(long long a, long long b) { if (b == 0) return 1; long long ans = bigmod(a, b / 2); ans = (ans * ans) % mod; if (b & 1) ans *= a; return ans % mod; } void solve() { lon...