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 main() { ios_base::sync_with_stdio(false); cin.tie(0); int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; ++i) cin >> a[i]; multiset<int> s; for (int v : a) s.insert(v); int ans = 0; for (int i = 0; i < n; ++i) { ...
#include <bits/stdc++.h> using namespace std; long long a[100010]; int main() { long long n, k; cin >> n >> k; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); long long x = a[0], ans = 0; for (int i = 1; i < n; i++) { if ((a[i] - x) % k != 0) { cout << -1 << endl; ...
#include <bits/stdc++.h> using namespace std; void solve(); int main() { ios::sync_with_stdio(0); solve(); return 0; } int a[1000001]; void solve() { int n, m; cin >> n >> m; for (int i = 0; i < n; ++i) { int v; cin >> v; a[v]++; } for (int i = 0; i < m; ++i...
#include <bits/stdc++.h> using namespace std; char s[100000]; int col[100000], dp[21][1 << 20]; int main() { int n, m; scanf( %d %d , &n, &m); for (int i = 0; i < n; i++) { scanf( %s , s); for (int j = 0; j < m; j++) col[j] \|= (s[j] - 0 ) << i; } for (int i = 0; i < m; i++) dp[...
#include <bits/stdc++.h> using namespace std; const long long INF = 1e11; const int M = 1e5 + 5; vector<pair<long long, int> > adj[M]; vector<int> ans; long long d[M], vis[M], pre[M]; int n, m; void Dijkstra() { for (int i = 1; i <= n; ++i) d[i] = INF; d[1] = 0; priority_queue<pair<long long...
#include <bits/stdc++.h> using namespace std; int main() { long long n, x; cin >> n; vector<long long> a; for (int i = 0; i < n; i++) { cin >> x; a.push_back(x); } for (int i = 0; i < n - 1; i++) { cout << a[i] + a[i + 1] << ; } cout << a[n - 1] << endl; retu...
#include <bits/stdc++.h> using namespace std; template <typename T> void read(T &x) { x = 0; char c = getchar(); int f = 0; for (; !isdigit(c); c = getchar()) f \|= c == - ; for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + (c ^ 0 ); if (f) x = -x; } template <typename T> ...
#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int dx[8] = {1, -1, 0, 0, -1, -1, 1, 1}; int dy[8] = {0, 0, -1, 1, -1, 1, -1, 1}; vector<int> adj[300010], val(300010, 1), vis(300010, 0), dis1(300010, 0), dis2(300010, 0); int myrandom(i...
#include <bits/stdc++.h> using namespace std; struct st { int t, p, g; char s[30]; } a[100]; int x[3]; int y[6]; int main() { int n, m, i, j, k; scanf( %d , &n); for (i = 0; i < n; i++) { scanf( %d%s , &m, a[i].s); for (j = 0; j < m; j++) { scanf( %d-%d-%d , &x[0], &x...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); long long n, x, sum(0), cnt(0), prev(INT_MAX); cin >> n; for (int i = 0; i < n; i++) { cin >> x; if (i && x == prev) cnt++; else cnt = 1; ...
#include <bits/stdc++.h> using namespace std; map<pair<int, int>, bool> mp; bool check(int x, int y, int z) { if (y < x) swap(x, y); if (z < y) swap(z, y); if (y < x) swap(x, y); if (x + y > z && z > y && mp.count({x, y}) == 0) { mp[{x, y}] = 1; return 1; } else return 0; }...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; int n; while (t--) { int n; string s; cin >> n; cin >> s; int flag = 1, start = 0, end = n - 1; while (start <= end) { char ssp = s[start] + 1; char sep = s[end] + 1; ...
#include <bits/stdc++.h> using namespace std; int arr[111]; int main() { int n; scanf( %d , &n); for (int i = (0); i < (n); ++i) scanf( %d , &arr[i]); sort(arr, arr + n); int t = 10; int ans = 0; int qts = 0; for (int i = (0); i < (n); ++i) { t += arr[i]; if (t > 720) b...
#include <bits/stdc++.h> using namespace std; int main() { int h, m, ti; scanf( %d:%d , &h, &m); scanf( %d , &ti); int realh = ti / 60, realmin = ti % 60; while (realh--) { if (h == 23) h = 0; else h++; } while (realmin--) { if (m == 59) { m = 0;...
#include <bits/stdc++.h> using i64 = long long; template <typename _Tp> inline void chkMax(_Tp &x, const _Tp &y) { (x < y) and (x = y); } namespace IOManager { constexpr int FILESZ = 131072; char buf[FILESZ]; const char ibuf = buf, tbuf = buf; struct IOManager { inline char gc() { retu...
#include <bits/stdc++.h> using namespace std; long long a[200005]; long long k1[200005]; long long k2[200005]; string ss = first ; string sp = second ; int main() { int n; cin >> n; int r1 = 0; int r2 = 0; long long s1 = 0; long long s2 = 0; int l1 = 0; int l2 = 0; fo...
#include <bits/stdc++.h> using namespace std; int input() { int res = 0, m = 1; char c = ; while (c < 0 && c != - ) c = getchar(); if (c == - ) m = -1, c = getchar(); while (c >= 0 ) res = res * 10 + (c - 0 ), c = getchar(); return res * m; } const int N = 501; int n, k, lft[N...
#include <bits/stdc++.h> int main() { int t, a, b, c, d, k, i, pen, pencil; scanf( %d , &t); for (i = 0; i < t; i++) { scanf( %d %d %d %d %d , &a, &b, &c, &d, &k); if (a % c != 0) { pen = (a / c) + 1; } if (a % c == 0) { pen = (a / c); } if (b % d != 0) ...
#include <bits/stdc++.h> using namespace std; long long int countInversions(long long int a[], long long int temp[], long long int l, long long int r) { if (l >= r) { return 0; } long long int count1 = countInversions(a, temp, l, (l + r) / 2); long long int coun...
#include <bits/stdc++.h> using namespace std; int main() { string s, t; cin >> s; bool ok = false; for (int i = 0; i < s.size(); i++) { if (s.size() - i < 26) break; int j = i; vector<int> f(26); int qq = 0; while (j < s.size() && j - i + 1 <= 26) { if (s[j] != ...
#include <bits/stdc++.h> using namespace std; int a[400005]; int q, x; int main() { int aux, cnt = 0, maxim = 0; cin >> q >> x; for (int i = 1; i <= q; i++) { cin >> aux; a[aux % x]++; while (a[cnt] > maxim) { cnt++; if (cnt == x) { cnt = 0; maxi...
#include <bits/stdc++.h> using namespace std; int dx[4] = {-1, 0, 0, 1}; int dy[4] = {0, -1, 1, 0}; bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) { if (a.first == b.first) return a.second < b.second; return (a.first < b.first); } int main() { ios_base::sync_with_stdio(false); ...
#include <bits/stdc++.h> using namespace std; int a[6], b[6]; int getMinWin(int idx) { if (idx == 3) return a[0] + a[1] + a[2]; int ret = INT_MAX; int bIdx = idx; int bIdxPrev = (idx - 1 + 3) % 3; int minIdxbIdx = min(a[idx], b[bIdx]); a[idx] -= minIdxbIdx; b[bIdx] -= minIdxbIdx; i...
#include <bits/stdc++.h> int n, d, m, t[200005][2], l, p, r, b; long long ans; std::pair<int, int> s[200005]; bool a = true; int main() { scanf( %d %d %d , &d, &n, &m); for (int i = 0; i < m; i++) scanf( %d %d , &s[i].first, &s[i].second); std::sort(s, s + m); t[l][0] = 0; t[l++][1] = n; ...
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { if ((a == 0) \|\| (b == 0)) return a + b; return gcd(b, a % b); } long long pow_mod(long long a, long long b) { long long res = 1; while (b) { if (b & 1) res = (res * a) % 1000000007; a = (a * a) % ...
#include <bits/stdc++.h> using namespace std; int n, i; int p[200011]; int aib[200011]; int ord[2][200011]; int ans[200011]; int zrs(int x) { return (x & (x - 1)) ^ x; } void add(int x, int v) { while (x <= n) { aib[x] += v; x += zrs(x); } } int sum(int x) { int ans = 0; ...
#include <bits/stdc++.h> using namespace std; int main() { int N = 0, p = 0, q = 0; int k = 0; cin >> N; for (int i = 0; i < N; i++) { cin >> p >> q; if (q - p >= 2) k++; } cout << k; return 0; }
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const int nax = 1e6 + 10; vector<int> tree(4 * nax); long long i, j, x, y, k; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long n, t; cin >> t; while (t--) { cin >> n; ...
#include <bits/stdc++.h> using namespace std; vector<long long> lucky; void backtrack(long long x) { if (x > 1e10) return; lucky.push_back(x); backtrack(x * 10 + 4); backtrack(x * 10 + 7); } int main() { long long ans = 0; backtrack(0); sort(lucky.begin(), lucky.end()); int a, ...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; int n; cin >> n; vector<pair<int, int>> vp(n); for (int i = 0; i < n; i++) cin >> vp[i].first >> vp[i].second; sort(vp.begin(), vp.end()); long long res = 1; pai...
#include <bits/stdc++.h> using namespace std; int main() { int t; int m, c; int mc = 0, cc = 0; cin >> t; while (t--) { cin >> m >> c; if (m > c) mc++; else if (m < c) cc++; } if (mc == cc) cout << Friendship is magic!^^ ; else if (mc < cc) ...
#include <bits/stdc++.h> using namespace std; int N; struct node { int val, pos; } A[2005]; int res[2005]; int cmp1(node a, node b) { return a.val > b.val; } int main() { A[0].val = 0x7fffffff; cin >> N; for (int i = 1; i <= N; i++) { scanf( %d , &A[i].val); A[i].pos = i; }...
#include <bits/stdc++.h> using namespace std; const long long N = 5e5 + 10; const long long M = 1e6 + 11; const long long big = 1e17; const long long hsh2 = 1964325029; const long long mod = 1e9 + 7; const double EPS = 1e-9; const long long block = 1e14; const long long shift = 2e3; const double pi ...
#include <bits/stdc++.h> using namespace std; int n, arr[100005]; int main() { cin >> n; for (int i = 0; i < n; i++) cin >> arr[i]; int cur = min(2, n); int best = min(2, n); for (int i = 2; i < n; i++) { if (arr[i - 2] + arr[i - 1] == arr[i]) cur++; else cur = 2; ...
#include <bits/stdc++.h> using namespace std; int main() { int n, l; cin >> n; string s; for (int i = 0; i < n; i++) { cin >> l; cin >> s; int ans = 0; bool lol = false; int tmp = 0; for (int j = 0; j < l; j++) { if (s[j] == A ) { lol = true; ...
#include <bits/stdc++.h> using namespace std; int main() { int x, y, z; int sol; int s[100009]; cin >> x >> y; s[0] = 0; for (int i = 1; i < x; i++) { cin >> z; s[i] = z + s[i - 1]; } sol = s[y]; for (int i = y + 1; i < x; i++) { sol = min(sol, s[i] - s[i - y]);...
#include <bits/stdc++.h> const int N = 1010; double f[N][N]; bool vis[N][N]; inline double F(int m, int n) { if (!m) return 1. / (n + 1); if (!n) return 1; if (vis[m][n]) return f[m][n]; vis[m][n] = true; double p = 1 / (1 + (1. / ((n + 1) * F(n, m - 1)))); return f[m][n] = p * n / (n + ...
#include <bits/stdc++.h> using namespace std; const int maxn = 100005; int n, len, ct; int a[maxn], tot[maxn], cur[maxn]; long long ans; void solve() { for (int i = 1; i <= n; i++) tot[i] = cur[i] = 0; for (int i = 1; i <= n; i++) tot[a[i]]++; int r = 1; for (int i = 1; i <= (n - 1) / 2; i++...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int a, b, c; cin >> a >> b >> c; int ans = 0; if (a >= 1) { a--; ans++; } if (b >= 1) { b--; ans++; } if (c >= 1) { c--; ...
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10; int a[N]; long long ans[N]; int main() { int n; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; } if (n == 1) { cout << 1 << << 1 << n ; cout << 0 << n ; cout << 1 << << 1 << n...
#include <bits/stdc++.h> using namespace std; const int N = 1100000; const long long M = 1000000007; long long i, j, k, l, m, n, o, p, K, w, F[N], ni[N]; inline long long fastmi(long long x, long long m) { long long ans = 1; while (m) { if (m & 1) ans = (ans * x) % M; x = (x * x) % M; ...
#include <bits/stdc++.h> using namespace std; const int N = 300000 + 5; const int MOD = 1000000009; int s[N * 4], f[N], a[N], taga[N * 4], tagb[N * 4]; int read() { int x = 0, f = 1; char ch = getchar(); for (; ch < 0 \|\| ch > 9 ; ch = getchar()) if (ch == - ) f = -1; for (; ch >= 0 ...
#include <bits/stdc++.h> using namespace std; int n, q, fa[50005], ff[50005], h[50005], tot, e[50005 << 1], nxt[50005 << 1], mx[50005][256], cnt[50005][256], Ans[50005][256], ans, val[50005], dep[50005]; template <class T> inline void read(T &x) { x = 0; bool emm = 1; char c; for (c ...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:67108864 ) const int MOD = 1000000007; const long long INF = 3000000000000000001; const double EPS = 1e-6; const int HASH_POW = 29; const double PI = acos(-1.0); using namespace std; double workTime() { return double(clock()) / CLOCKS_PER_SEC; } ...
#include <bits/stdc++.h> using namespace std; using point_t = pair<int, int>; int main() { size_t n; cin >> n; vector<point_t> obelisks(n), clues(n); for (point_t &p : obelisks) cin >> p.first >> p.second; for (point_t &p : clues) cin >> p.first >> p.second; point_t treasure; map<point...
#include <bits/stdc++.h> using namespace std; int main() { int n, m, mini, c = 0; scanf( %d %d %d , &n, &m, &mini); for (int i = m; i < mini + 1; i += m) { if (i % n == 0) c++; } printf( %d n , c); return 0; }
#include <bits/stdc++.h> using namespace std; long long num[20]; int cnt; int main() { int n; long long k, x; long long ans = 0LL; scanf( %d , &n); for (int i = 1; i <= n; i++) { cnt = 0; scanf( %I64d%I64d , &x, &k); long long r = x + k - 1LL; long long l = x; w...
#include <bits/stdc++.h> using namespace std; long long a[100005]; int main() { long long n; scanf( %lld , &n); for (long long i = 0; i < n; i++) scanf( %lld , &a[i]); sort(a, a + n); long long sm = 0; for (long long i = 0; i < n / 2; i++) { sm = ((sm % 10007) + ((a[i] % 10007) * (a[...
#include <bits/stdc++.h> using namespace std; const int N = 1000110; string str[7] = { monday , tuesday , wednesday , thursday , friday , saturday , sunday }; int main() { string s, s1; while (cin >> s >> s1) { int i; int a, b; for (i = 0; i < 7; i++) { ...
#include <bits/stdc++.h> using namespace std; #define ll long long #define mp make_pair #define rep(i,a,b) for( i=a;i<b;++i) #define repr(i,a,b) for( i=a;i>=b;i--) #define up upper_bound #define lb lower_bound #define ...
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; int MM[500], FF[500]; int main() { ios::sync_with_stdio(0); int N; cin >> N; for (int i = 0; i < N; i++) { char g; int from, to; cin >> g >> from >> to; int *v; if (g == M ) for (i...
#include <bits/stdc++.h> using namespace std; int input() { int x = 0, f = 0; char ch = getchar(); while (ch < 0 \|\| ch > 9 ) f \|= ch == 0 , ch = getchar(); while (ch >= 0 && ch <= 9 ) x = x * 10 + ch - 0 , ch = getchar(); return f ? -x : x; } int n, m, du[2100]; bool Check() { ...
#include <bits/stdc++.h> using namespace std; int n; int ans[100000 + 1]; void reverseAns(int l, int r) { if (l > r) return; int mid = (l + r) >> 1; for (int i = 1; i <= mid - l + 1; ++i) { swap(ans[i + l - 1], ans[r - i + 1]); } } int main() { ios::sync_with_stdio(false); cin ...
#include <bits/stdc++.h> using namespace std; int n, q, j, x[300000 + 10], a, b, sum, t, o[300000 + 10], p[300000 + 10], h = 1; int main() { cin >> n >> q; for (int i = 0; i < q; i++) { cin >> a >> b; if (a == 1) { j++; x[j] = b; o[b]++; p[b]++; su...
#include <bits/stdc++.h> long long mod(long long x) { if (x < 0) return -x; return x; } long long expo(long long x, long long y) { long long res = 1; while (y > 0) { if (y % 2 == 1) res = (res * x); y = y >> 1; x = x * x; } return res; } using namespace std; const i...
#include <bits/stdc++.h> using namespace std; const int dx[4] = {0, 0, -1, 1}; const int dy[4] = {-1, 1, 0, 0}; int main() { int i, j, k, n; long int mx, mn, sm = 0; int t; cin >> t; while (t--) { int f = 0; cin >> n; vector<pair<int, int>> v(n); for (i = 0; i < n; i+...
#include <bits/stdc++.h> using namespace std; const int maxn = 100005; const int maxm = 100005; typedef int arr[maxn]; arr head, dfn, low, col, st; int top, depth, color, tot, cnt; pair<int, int> e[maxm * 2], bridge[maxn]; int euler[maxn * 2], d[maxn * 2][30], pos; void add(int x, int y) { e[tot] ...
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); int zuo = 0, you = 0; for (int i = 0; i < n; i++) { int x, y; scanf( %d %d , &x, &y); zuo += x; you += y; } printf( %d n , min(n - zuo, zuo) + min(n - you, you)); return 0; }
#include <bits/stdc++.h> using namespace std; const int maxk = 20; const int maxn = 3e5 + 17; int N, Q; int sub[maxn], ans[maxn]; vector<int> graph[maxn]; set<pair<int, int> > DFS(int u) { sub[u] = 1; set<pair<int, int> > cur; for (int v : graph[u]) { set<pair<int, int> > next = DFS(v); ...
#include <bits/stdc++.h> using namespace std; inline long long rd() { long long x = 0; int ch = getchar(), f = 1; while (!isdigit(ch) && (ch != - ) && (ch != EOF)) ch = getchar(); if (ch == - ) { f = -1; ch = getchar(); } while (isdigit(ch)) { x = (x << 1) + (x << 3) + ch...
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( unroll-loops ) #pragma GCC optimize( Ofast ) #pragma GCC optimize( O3 ) const long long inf = 1e18; long long i, j, k, m, n, qq, t, it, ma = -inf, mi = inf, x, y, col, md = 998244353; string cmp(strin...
#include <bits/stdc++.h> char B[1 << 26], S = B, C; int X; inline int read() { while ((C = S++) < 0 \|\| C > 9 ) ; for (X = C - 0 ; (C = *S++) >= 0 && C <= 9 ;) X = (X << 3) + (X << 1) + C - 0 ; return X; } int f[1000000 + 5], r[1000000 + 5], u[1000000 + 5]; int gf(int k) { r...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; string s; cin >> s; int rc = 0, uc = 0, c = 0; for (int i = 0; i < n; i++) { if (s[i] == R ) rc++; else uc++; if (rc == uc && s[i] == s[i + 1]) c++; } cout << c << n ; ...
#include <bits/stdc++.h> using namespace std; int M = 1e9 + 7; int main() { ios::sync_with_stdio(false); cin.tie(0); cerr.tie(0); int n, a[100005], sum = 0; cin >> n; for (int i = 0; i < n; i++) cin >> a[i], sum += a[i]; sort(a, a + n); int p[] = {0, -1, -1}, ct = 0, f = 0; for...
#include <bits/stdc++.h> using namespace std; int main() { int h1, h2, m1, m2, h3, m3; char s1, s2; cin >> h1 >> s1 >> m1 >> h2 >> s2 >> m2; if (h1 == 0) h1 = 24; if (h2 == 0) h2 = 24; if (m1 < m2) { h1--; m3 = m1 + 60 - m2; } else m3 = m1 - m2; if (h1 < h2) { ...
#include <bits/stdc++.h> using namespace std; const double PI = 3.141592653589793238462643383279502884197169399375105820974944; long long dist(long long a, long long b, long long c, long long d) { return abs(a - c) + abs(b - d); } signed main() { ios_base::sync_with_stdio(false); cin.tie(0);...
#include <bits/stdc++.h> using namespace std; int n, tb[100], w1, w2, l = 1; int main() { scanf( %d , &n); for (int i = 0; i < n / 2; i++) scanf( %d , &tb[i]); sort(tb, tb + n / 2); for (int i = 0; i < n / 2; i++) { w1 += abs(tb[i] - l); l += 2; } l = 2; for (int i = 0; i <...
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const long long infl = 1LL << 60; mt19937 rnd(time(0)); inline int myrand(int l, int r) { return rnd() % (r - l + 1) + l; } inline int read() { int x = 0, f = 1; char c = getchar(); while (!isdigit(c)) { if (c == - ...
#include <bits/stdc++.h> using namespace std; const double v = 1.41421356237; int main() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); int t = 1; cin >> t; while (t--) { long long int x1, y1, z1, x2, y2, z2; cin >> x1 >> y1 >> z1 >> x2 >> y2 >> z2; long long ...
#include <bits/stdc++.h> using namespace std; const int N = 50005; const unsigned long long MOD = 1e8 + 7; const unsigned long long MAX = 1e15; int X[N], Y[N], T[N], K[N]; int n; double P[N], dp[N], ans = 0; bool cmp(int a, int b) { return T[a] < T[b]; } double dist(int i, int j) { double ans = sq...
#include <bits/stdc++.h> using namespace std; int n, k, a[10010]; bool vs[3000][3000]; int main() { cin >> n >> k; for (int i = n + 1; i <= n + k; i++) { a[i] = i - n; } for (int i = 1; i <= n; i++) a[i] = i; for (int i = 1; i <= n; i++) { for (int j = i + 1; j <= i + k; j++) { ...
#include <bits/stdc++.h> using namespace std; long long int n, t; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> t; while (t--) { cin >> n; long long int a[n], x = 0; vector<long long int> ans; for (int i = 0; i < n; i++) { cin >> a[i]; ...
#include <bits/stdc++.h> using namespace std; bool bin(unsigned long long a, unsigned long long b) { return a > b; } int main() { int n, k; scanf( %d %d , &n, &k); long inp; queue<long> seg; map<long, long> cnt; set<long> once; for (int y = 0; y < k; y++) { scanf( %ld , &inp); ...
#include <bits/stdc++.h> using namespace std; int n, in[200005], a[200005], sta[200005], top, now, root, ans, flag; bool vis[200005], mark[200005]; int read() { int x, f = 1; char ch; while (!(isdigit(ch = getchar()))) ch == - ? f = -1 : f; x = ch - 48; while ((isdigit(ch = getchar()))) x ...
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; int u[5005][10005]; int n, m, a[5005], b[5005] = {1}, c[5005] = {1}, d[5005] = {1}, e[5005]; int expmod(int a, int b, int mod) { int res = 1; for (; b; b >>= 1) { if (b & 1) res = 1ll * res * a % mod; a = 1ll * a * a % ...
#include <bits/stdc++.h> #include <sys/types.h> #include <stdio.h> #include <unistd.h> #define _USE_MATH_DEFINES #define ll long long int #ifndef ONLINE_JUDGE #define debug(x...) cerr << [ << #x << ] = [ ; _print(x) #else #define debug(x...) #endif using namespace std; //mp.reserve(1024); /...
#include <bits/stdc++.h> using namespace std; void err() { cout << n ; } template <class T, class... Ts> void err(const T& arg, const Ts&... args) { cout << arg << ; err(args...); } inline int read() { int s = 0, w = 1; char ch = getchar(); while (ch < 0 \|\| ch > 9 ) { if (c...
#include <bits/stdc++.h> using namespace std; const int maxn = (3e5) + 10, mod = 1e9 + 7; int n, a[maxn]; map<int, int> mark; int32_t main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; int ans = 0; int num = 0; ...
#include <bits/stdc++.h> using namespace std; int f[200005]; int main() { string str; cin >> str; f[0] = 1; for (int i = 1; i < str.length(); i++) { if (str[i] == str[i - 1]) f[i] = f[i - 1] + 1; else f[i] = 1; } int last = 0, plast = 0; cout << str[0]; ...
#include <bits/stdc++.h> using namespace std; void FastIO() { ios_base::sync_with_stdio(false); cin.tie(0); cout.precision(20); } int main() { FastIO(); int N; int A[200][200]; cin >> N; int Count = 0; int Cars[1000] = {0}; for (int i = 0; i < N; i++) { for (int j =...
#include <bits/stdc++.h> using namespace std; void fastio() { ios_base::sync_with_stdio(0); cin.tie(0); } int main() { fastio(); long long int n; cin >> n; long long int ans = 0; long long int a[n]; for (int i = 0; i < n; i++) cin >> a[i]; for (long long int i = 0; i < n; i +...
#include <bits/stdc++.h> using namespace std; long long power(long long a, long long b) { long long ans = 1; while (b > 0) { if (b & 1) { ans = (ans * a) % 1000000007; } a = (a * a) % 1000000007; b >>= 1; } return ans; } bool prime(long long n) { for (long lon...
#include <bits/stdc++.h> using namespace std; long long int mod = 998244353; long long int hmaxii = 0; vector<long long int> values[2 * 100000 + 1]; long long int MAXN = 2 * 100000 + 1; long long int spf[2 * 100000 + 1]; long long int diff, x, y, z; long long int flag = 1; long long int price[1001][10...
#include <bits/stdc++.h> using namespace std; int main() { int n, s; while (cin >> n >> s) { int ans = s; for (int i = 0; i < n; ++i) { int f, t; cin >> f >> t; if (ans < f + t) { ans = f + t; } } cout << ans << endl; } return 0; } ...
#include <bits/stdc++.h> int m[6]; int w[6]; int x[6] = {0, 500, 1000, 1500, 2000, 2500}; double max(int i) { double a = 0.3 * x[i]; double b = (1 - m[i] * 1.0 / 250) * x[i] - 1.0 * 50 * w[i]; if (a > b) return a; return b; } int main() { int i, u, v; while (~scanf( %d%d%d%d%d , &m[1...
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; const long long inf = 4e18; const long double pai = acos(-1); int n, q, ans; set<pair<pair<int, int>, int> > s; int main() { scanf( %d%d , &n, &q); ans = n; s.insert({{1, n}, 1}); while (q--) { int l, r, x; ...
#include <bits/stdc++.h> using namespace std; int main() { int n, d, l; int ans[101]; int s = 0; cin >> n >> d >> l; for (int i = 0; i < n; ++i) { ans[i] = (i & 1) ? -1 : 1; s += ans[i]; } bool sw = false; while (true) { if (s == d) break; sw = false; if...
#include <bits/stdc++.h> using namespace std; long long fp(long long b, long long p) { long long res = 1; while (p) { if (p % 2) res = (res * b) % 1000000007; b = (b * b) % 1000000007; p /= 2; } return res; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); lo...
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 5; char b_[N], n_[N]; long long mod, b, n; int prime[N]; inline void get_phi() { int x = mod; int sx = sqrt(mod); for (int i = 2; i <= sx; ++i) { if (x == 1) break; if (x % i) continue; while (x % i == 0) x /= i;...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int arr[n]; for (int i = 0; i < n; i++) cin >> arr[i]; sort(arr, arr + n, greater<int>()); deque<int> d; d.push_front(arr[0]); int i; for (i = 1; i < n; i++) { if (arr[i] != arr[0]) break; } ...
#include <bits/stdc++.h> using namespace std; const int maxc = 22; const int maxn = (int)5e5; int tin[maxn], tout[maxn], _t = 0, ver[maxn], n; vector<int> g[maxn]; int deep[maxn], maxh[1 << maxc]; unsigned mask[maxn]; int sz[maxn], ans[maxn]; unsigned char s[maxn]; int dfs_size(int v, unsigned m) { ...
#include <bits/stdc++.h> using namespace std; void fast() { ios_base::sync_with_stdio(false); cin.tie(NULL); } bool isSubSequence(string str1, string str2, int m, int n) { if (m == 0) return true; if (n == 0) return false; if (str1[m - 1] == str2[n - 1]) return isSubSequence(str1, str2...
#include <bits/stdc++.h> using namespace std; int input() { int res = 0; char c = ; while (c < 0 && c != - ) c = getchar(); while (c >= 0 ) res = res * 10 + (c - 0 ), c = getchar(); return res; } const int N = 1e5 + 1; string to_str(int x) { string res; while (x) res += 0 ...
#include <bits/stdc++.h> using namespace std; int T, n; char Ls[400000 + 5], ps[400000 + 5]; long long ans; long long read() { long long x = 0, F = 1; char c = getchar(); while (c < 0 \|\| c > 9 ) { if (c == - ) F = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { x ...
#include <bits/stdc++.h> const int maxn = 5205; using namespace std; int n, a[maxn][maxn], m; int cnt, sum[maxn][maxn], x[maxn]; bool check(int x) { int now; for (int i = x; i <= n; i += x) { for (int j = x; j <= n; j += x) { now = sum[i][j] - sum[i - x][j] - sum[i][j - x] + sum[i - x][j...
#include <bits/stdc++.h> using namespace std; const int maxN = 1000 * 1000 + 100; int nex[maxN]; int st[maxN]; int en[maxN]; vector<int> c[maxN]; int ind; void dfs(int s) { st[s] = ind++; for (auto x : c[s]) dfs(x); en[s] = ind; } int main() { int n, m; string s; cin >> n >> ...
#include <bits/stdc++.h> using namespace std; const int mod = 1000000007; const vector<int> mods = {998244353, 1000000007, 1000000009}; const long long inf = 3e18; const double pi = acos(-1.0); const double eps = 0.0000001; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); template <c...
#include <bits/stdc++.h> using namespace std; int N, K; string s; bool dp[1010][1010]; bool dfs(int i, int j) { if (i == N && abs(j) == K) return true; if (i != N && abs(j) == K) return false; if (i == N && abs(j) != K) return false; if (dp[i][j] == 1) return false; dp[i][j] = 1; if (s...
#include <bits/stdc++.h> using namespace std; vector<vector<int>> adj; vector<int> a, b, t; vector<int> dep, sz; void dfs(int v, int p) { dep[v] = dep[p] + 1; for (auto c : adj[v]) { if (c != p) { dfs(c, v); sz[v] += sz[c]; } } } int main() { ios_base::sync_with...
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const int MAXN = 5e5 + 10; bool bio[MAXN]; int n; int a[MAXN], b[MAXN], aa[MAXN], bb[MAXN]; int deg[1 << 20]; map<pair<int, int>, vector<int>> id; vector<pair<int, int>> e[1 << 20]; stack<int> path; bool euler(int x, bool print...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; ++i) cin >> a[i]; multiset<int> s; for (int v : a) s.insert(v); int ans = 0; for (int i = 0; i < n; ++i) { ...

#include <bits/stdc++.h> using namespace std; long long a[100010]; int main() { long long n, k; cin >> n >> k; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); long long x = a[0], ans = 0; for (int i = 1; i < n; i++) { if ((a[i] - x) % k != 0) { cout << -1 << endl; ...

#include <bits/stdc++.h> using namespace std; void solve(); int main() { ios::sync_with_stdio(0); solve(); return 0; } int a[1000001]; void solve() { int n, m; cin >> n >> m; for (int i = 0; i < n; ++i) { int v; cin >> v; a[v]++; } for (int i = 0; i < m; ++i...

#include <bits/stdc++.h> using namespace std; char s[100000]; int col[100000], dp[21][1 << 20]; int main() { int n, m; scanf( %d %d , &n, &m); for (int i = 0; i < n; i++) { scanf( %s , s); for (int j = 0; j < m; j++) col[j] |= (s[j] - 0 ) << i; } for (int i = 0; i < m; i++) dp[...

#include <bits/stdc++.h> using namespace std; const long long INF = 1e11; const int M = 1e5 + 5; vector<pair<long long, int> > adj[M]; vector<int> ans; long long d[M], vis[M], pre[M]; int n, m; void Dijkstra() { for (int i = 1; i <= n; ++i) d[i] = INF; d[1] = 0; priority_queue<pair<long long...

#include <bits/stdc++.h> using namespace std; int main() { long long n, x; cin >> n; vector<long long> a; for (int i = 0; i < n; i++) { cin >> x; a.push_back(x); } for (int i = 0; i < n - 1; i++) { cout << a[i] + a[i + 1] << ; } cout << a[n - 1] << endl; retu...

#include <bits/stdc++.h> using namespace std; template <typename T> void read(T &x) { x = 0; char c = getchar(); int f = 0; for (; !isdigit(c); c = getchar()) f |= c == - ; for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + (c ^ 0 ); if (f) x = -x; } template <typename T> ...

#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int dx[8] = {1, -1, 0, 0, -1, -1, 1, 1}; int dy[8] = {0, 0, -1, 1, -1, 1, -1, 1}; vector<int> adj[300010], val(300010, 1), vis(300010, 0), dis1(300010, 0), dis2(300010, 0); int myrandom(i...

#include <bits/stdc++.h> using namespace std; struct st { int t, p, g; char s[30]; } a[100]; int x[3]; int y[6]; int main() { int n, m, i, j, k; scanf( %d , &n); for (i = 0; i < n; i++) { scanf( %d%s , &m, a[i].s); for (j = 0; j < m; j++) { scanf( %d-%d-%d , &x[0], &x...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); long long n, x, sum(0), cnt(0), prev(INT_MAX); cin >> n; for (int i = 0; i < n; i++) { cin >> x; if (i && x == prev) cnt++; else cnt = 1; ...

#include <bits/stdc++.h> using namespace std; map<pair<int, int>, bool> mp; bool check(int x, int y, int z) { if (y < x) swap(x, y); if (z < y) swap(z, y); if (y < x) swap(x, y); if (x + y > z && z > y && mp.count({x, y}) == 0) { mp[{x, y}] = 1; return 1; } else return 0; }...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; int n; while (t--) { int n; string s; cin >> n; cin >> s; int flag = 1, start = 0, end = n - 1; while (start <= end) { char ssp = s[start] + 1; char sep = s[end] + 1; ...

#include <bits/stdc++.h> using namespace std; int arr[111]; int main() { int n; scanf( %d , &n); for (int i = (0); i < (n); ++i) scanf( %d , &arr[i]); sort(arr, arr + n); int t = 10; int ans = 0; int qts = 0; for (int i = (0); i < (n); ++i) { t += arr[i]; if (t > 720) b...

#include <bits/stdc++.h> using namespace std; int main() { int h, m, ti; scanf( %d:%d , &h, &m); scanf( %d , &ti); int realh = ti / 60, realmin = ti % 60; while (realh--) { if (h == 23) h = 0; else h++; } while (realmin--) { if (m == 59) { m = 0;...

#include <bits/stdc++.h> using i64 = long long; template <typename _Tp> inline void chkMax(_Tp &x, const _Tp &y) { (x < y) and (x = y); } namespace IOManager { constexpr int FILESZ = 131072; char buf[FILESZ]; const char *ibuf = buf, *tbuf = buf; struct IOManager { inline char gc() { retu...

#include <bits/stdc++.h> using namespace std; long long a[200005]; long long k1[200005]; long long k2[200005]; string ss = first ; string sp = second ; int main() { int n; cin >> n; int r1 = 0; int r2 = 0; long long s1 = 0; long long s2 = 0; int l1 = 0; int l2 = 0; fo...

#include <bits/stdc++.h> using namespace std; int input() { int res = 0, m = 1; char c = ; while (c < 0 && c != - ) c = getchar(); if (c == - ) m = -1, c = getchar(); while (c >= 0 ) res = res * 10 + (c - 0 ), c = getchar(); return res * m; } const int N = 501; int n, k, lft[N...

#include <bits/stdc++.h> int main() { int t, a, b, c, d, k, i, pen, pencil; scanf( %d , &t); for (i = 0; i < t; i++) { scanf( %d %d %d %d %d , &a, &b, &c, &d, &k); if (a % c != 0) { pen = (a / c) + 1; } if (a % c == 0) { pen = (a / c); } if (b % d != 0) ...

#include <bits/stdc++.h> using namespace std; long long int countInversions(long long int a[], long long int temp[], long long int l, long long int r) { if (l >= r) { return 0; } long long int count1 = countInversions(a, temp, l, (l + r) / 2); long long int coun...

#include <bits/stdc++.h> using namespace std; int main() { string s, t; cin >> s; bool ok = false; for (int i = 0; i < s.size(); i++) { if (s.size() - i < 26) break; int j = i; vector<int> f(26); int qq = 0; while (j < s.size() && j - i + 1 <= 26) { if (s[j] != ...

#include <bits/stdc++.h> using namespace std; int a[400005]; int q, x; int main() { int aux, cnt = 0, maxim = 0; cin >> q >> x; for (int i = 1; i <= q; i++) { cin >> aux; a[aux % x]++; while (a[cnt] > maxim) { cnt++; if (cnt == x) { cnt = 0; maxi...

#include <bits/stdc++.h> using namespace std; int dx[4] = {-1, 0, 0, 1}; int dy[4] = {0, -1, 1, 0}; bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) { if (a.first == b.first) return a.second < b.second; return (a.first < b.first); } int main() { ios_base::sync_with_stdio(false); ...

#include <bits/stdc++.h> using namespace std; int a[6], b[6]; int getMinWin(int idx) { if (idx == 3) return a[0] + a[1] + a[2]; int ret = INT_MAX; int bIdx = idx; int bIdxPrev = (idx - 1 + 3) % 3; int minIdxbIdx = min(a[idx], b[bIdx]); a[idx] -= minIdxbIdx; b[bIdx] -= minIdxbIdx; i...

#include <bits/stdc++.h> int n, d, m, t[200005][2], l, p, r, b; long long ans; std::pair<int, int> s[200005]; bool a = true; int main() { scanf( %d %d %d , &d, &n, &m); for (int i = 0; i < m; i++) scanf( %d %d , &s[i].first, &s[i].second); std::sort(s, s + m); t[l][0] = 0; t[l++][1] = n; ...

#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { if ((a == 0) || (b == 0)) return a + b; return gcd(b, a % b); } long long pow_mod(long long a, long long b) { long long res = 1; while (b) { if (b & 1) res = (res * a) % 1000000007; a = (a * a) % ...

#include <bits/stdc++.h> using namespace std; int n, i; int p[200011]; int aib[200011]; int ord[2][200011]; int ans[200011]; int zrs(int x) { return (x & (x - 1)) ^ x; } void add(int x, int v) { while (x <= n) { aib[x] += v; x += zrs(x); } } int sum(int x) { int ans = 0; ...

#include <bits/stdc++.h> using namespace std; int main() { int N = 0, p = 0, q = 0; int k = 0; cin >> N; for (int i = 0; i < N; i++) { cin >> p >> q; if (q - p >= 2) k++; } cout << k; return 0; }

#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const int nax = 1e6 + 10; vector<int> tree(4 * nax); long long i, j, x, y, k; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long n, t; cin >> t; while (t--) { cin >> n; ...

#include <bits/stdc++.h> using namespace std; vector<long long> lucky; void backtrack(long long x) { if (x > 1e10) return; lucky.push_back(x); backtrack(x * 10 + 4); backtrack(x * 10 + 7); } int main() { long long ans = 0; backtrack(0); sort(lucky.begin(), lucky.end()); int a, ...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; int n; cin >> n; vector<pair<int, int>> vp(n); for (int i = 0; i < n; i++) cin >> vp[i].first >> vp[i].second; sort(vp.begin(), vp.end()); long long res = 1; pai...

#include <bits/stdc++.h> using namespace std; int main() { int t; int m, c; int mc = 0, cc = 0; cin >> t; while (t--) { cin >> m >> c; if (m > c) mc++; else if (m < c) cc++; } if (mc == cc) cout << Friendship is magic!^^ ; else if (mc < cc) ...

#include <bits/stdc++.h> using namespace std; int N; struct node { int val, pos; } A[2005]; int res[2005]; int cmp1(node a, node b) { return a.val > b.val; } int main() { A[0].val = 0x7fffffff; cin >> N; for (int i = 1; i <= N; i++) { scanf( %d , &A[i].val); A[i].pos = i; }...

#include <bits/stdc++.h> using namespace std; const long long N = 5e5 + 10; const long long M = 1e6 + 11; const long long big = 1e17; const long long hsh2 = 1964325029; const long long mod = 1e9 + 7; const double EPS = 1e-9; const long long block = 1e14; const long long shift = 2e3; const double pi ...

#include <bits/stdc++.h> using namespace std; int n, arr[100005]; int main() { cin >> n; for (int i = 0; i < n; i++) cin >> arr[i]; int cur = min(2, n); int best = min(2, n); for (int i = 2; i < n; i++) { if (arr[i - 2] + arr[i - 1] == arr[i]) cur++; else cur = 2; ...

#include <bits/stdc++.h> using namespace std; int main() { int n, l; cin >> n; string s; for (int i = 0; i < n; i++) { cin >> l; cin >> s; int ans = 0; bool lol = false; int tmp = 0; for (int j = 0; j < l; j++) { if (s[j] == A ) { lol = true; ...

#include <bits/stdc++.h> using namespace std; int main() { int x, y, z; int sol; int s[100009]; cin >> x >> y; s[0] = 0; for (int i = 1; i < x; i++) { cin >> z; s[i] = z + s[i - 1]; } sol = s[y]; for (int i = y + 1; i < x; i++) { sol = min(sol, s[i] - s[i - y]);...

#include <bits/stdc++.h> const int N = 1010; double f[N][N]; bool vis[N][N]; inline double F(int m, int n) { if (!m) return 1. / (n + 1); if (!n) return 1; if (vis[m][n]) return f[m][n]; vis[m][n] = true; double p = 1 / (1 + (1. / ((n + 1) * F(n, m - 1)))); return f[m][n] = p * n / (n + ...

#include <bits/stdc++.h> using namespace std; const int maxn = 100005; int n, len, ct; int a[maxn], tot[maxn], cur[maxn]; long long ans; void solve() { for (int i = 1; i <= n; i++) tot[i] = cur[i] = 0; for (int i = 1; i <= n; i++) tot[a[i]]++; int r = 1; for (int i = 1; i <= (n - 1) / 2; i++...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int a, b, c; cin >> a >> b >> c; int ans = 0; if (a >= 1) { a--; ans++; } if (b >= 1) { b--; ans++; } if (c >= 1) { c--; ...

#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10; int a[N]; long long ans[N]; int main() { int n; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; } if (n == 1) { cout << 1 << << 1 << n ; cout << 0 << n ; cout << 1 << << 1 << n...

#include <bits/stdc++.h> using namespace std; const int N = 1100000; const long long M = 1000000007; long long i, j, k, l, m, n, o, p, K, w, F[N], ni[N]; inline long long fastmi(long long x, long long m) { long long ans = 1; while (m) { if (m & 1) ans = (ans * x) % M; x = (x * x) % M; ...

#include <bits/stdc++.h> using namespace std; const int N = 300000 + 5; const int MOD = 1000000009; int s[N * 4], f[N], a[N], taga[N * 4], tagb[N * 4]; int read() { int x = 0, f = 1; char ch = getchar(); for (; ch < 0 || ch > 9 ; ch = getchar()) if (ch == - ) f = -1; for (; ch >= 0 ...

#include <bits/stdc++.h> using namespace std; int n, q, fa[50005], ff[50005], h[50005], tot, e[50005 << 1], nxt[50005 << 1], mx[50005][256], cnt[50005][256], Ans[50005][256], ans, val[50005], dep[50005]; template <class T> inline void read(T &x) { x = 0; bool emm = 1; char c; for (c ...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:67108864 ) const int MOD = 1000000007; const long long INF = 3000000000000000001; const double EPS = 1e-6; const int HASH_POW = 29; const double PI = acos(-1.0); using namespace std; double workTime() { return double(clock()) / CLOCKS_PER_SEC; } ...

#include <bits/stdc++.h> using namespace std; using point_t = pair<int, int>; int main() { size_t n; cin >> n; vector<point_t> obelisks(n), clues(n); for (point_t &p : obelisks) cin >> p.first >> p.second; for (point_t &p : clues) cin >> p.first >> p.second; point_t treasure; map<point...

#include <bits/stdc++.h> using namespace std; int main() { int n, m, mini, c = 0; scanf( %d %d %d , &n, &m, &mini); for (int i = m; i < mini + 1; i += m) { if (i % n == 0) c++; } printf( %d n , c); return 0; }

#include <bits/stdc++.h> using namespace std; long long num[20]; int cnt; int main() { int n; long long k, x; long long ans = 0LL; scanf( %d , &n); for (int i = 1; i <= n; i++) { cnt = 0; scanf( %I64d%I64d , &x, &k); long long r = x + k - 1LL; long long l = x; w...

#include <bits/stdc++.h> using namespace std; long long a[100005]; int main() { long long n; scanf( %lld , &n); for (long long i = 0; i < n; i++) scanf( %lld , &a[i]); sort(a, a + n); long long sm = 0; for (long long i = 0; i < n / 2; i++) { sm = ((sm % 10007) + ((a[i] % 10007) * (a[...

#include <bits/stdc++.h> using namespace std; const int N = 1000110; string str[7] = { monday , tuesday , wednesday , thursday , friday , saturday , sunday }; int main() { string s, s1; while (cin >> s >> s1) { int i; int a, b; for (i = 0; i < 7; i++) { ...

#include <bits/stdc++.h> using namespace std; #define ll long long #define mp make_pair #define rep(i,a,b) for( i=a;i<b;++i) #define repr(i,a,b) for( i=a;i>=b;i--) #define up upper_bound #define lb lower_bound #define ...

#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; int MM[500], FF[500]; int main() { ios::sync_with_stdio(0); int N; cin >> N; for (int i = 0; i < N; i++) { char g; int from, to; cin >> g >> from >> to; int *v; if (g == M ) for (i...

#include <bits/stdc++.h> using namespace std; int input() { int x = 0, f = 0; char ch = getchar(); while (ch < 0 || ch > 9 ) f |= ch == 0 , ch = getchar(); while (ch >= 0 && ch <= 9 ) x = x * 10 + ch - 0 , ch = getchar(); return f ? -x : x; } int n, m, du[2100]; bool Check() { ...

#include <bits/stdc++.h> using namespace std; int n; int ans[100000 + 1]; void reverseAns(int l, int r) { if (l > r) return; int mid = (l + r) >> 1; for (int i = 1; i <= mid - l + 1; ++i) { swap(ans[i + l - 1], ans[r - i + 1]); } } int main() { ios::sync_with_stdio(false); cin ...

#include <bits/stdc++.h> using namespace std; int n, q, j, x[300000 + 10], a, b, sum, t, o[300000 + 10], p[300000 + 10], h = 1; int main() { cin >> n >> q; for (int i = 0; i < q; i++) { cin >> a >> b; if (a == 1) { j++; x[j] = b; o[b]++; p[b]++; su...

#include <bits/stdc++.h> long long mod(long long x) { if (x < 0) return -x; return x; } long long expo(long long x, long long y) { long long res = 1; while (y > 0) { if (y % 2 == 1) res = (res * x); y = y >> 1; x = x * x; } return res; } using namespace std; const i...

#include <bits/stdc++.h> using namespace std; const int dx[4] = {0, 0, -1, 1}; const int dy[4] = {-1, 1, 0, 0}; int main() { int i, j, k, n; long int mx, mn, sm = 0; int t; cin >> t; while (t--) { int f = 0; cin >> n; vector<pair<int, int>> v(n); for (i = 0; i < n; i+...

#include <bits/stdc++.h> using namespace std; const int maxn = 100005; const int maxm = 100005; typedef int arr[maxn]; arr head, dfn, low, col, st; int top, depth, color, tot, cnt; pair<int, int> e[maxm * 2], bridge[maxn]; int euler[maxn * 2], d[maxn * 2][30], pos; void add(int x, int y) { e[tot] ...

#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); int zuo = 0, you = 0; for (int i = 0; i < n; i++) { int x, y; scanf( %d %d , &x, &y); zuo += x; you += y; } printf( %d n , min(n - zuo, zuo) + min(n - you, you)); return 0; }

#include <bits/stdc++.h> using namespace std; const int maxk = 20; const int maxn = 3e5 + 17; int N, Q; int sub[maxn], ans[maxn]; vector<int> graph[maxn]; set<pair<int, int> > DFS(int u) { sub[u] = 1; set<pair<int, int> > cur; for (int v : graph[u]) { set<pair<int, int> > next = DFS(v); ...

#include <bits/stdc++.h> using namespace std; inline long long rd() { long long x = 0; int ch = getchar(), f = 1; while (!isdigit(ch) && (ch != - ) && (ch != EOF)) ch = getchar(); if (ch == - ) { f = -1; ch = getchar(); } while (isdigit(ch)) { x = (x << 1) + (x << 3) + ch...

#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( unroll-loops ) #pragma GCC optimize( Ofast ) #pragma GCC optimize( O3 ) const long long inf = 1e18; long long i, j, k, m, n, qq, t, it, ma = -inf, mi = inf, x, y, col, md = 998244353; string cmp(strin...

#include <bits/stdc++.h> char B[1 << 26], *S = B, C; int X; inline int read() { while ((C = *S++) < 0 || C > 9 ) ; for (X = C - 0 ; (C = *S++) >= 0 && C <= 9 ;) X = (X << 3) + (X << 1) + C - 0 ; return X; } int f[1000000 + 5], r[1000000 + 5], u[1000000 + 5]; int gf(int k) { r...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; string s; cin >> s; int rc = 0, uc = 0, c = 0; for (int i = 0; i < n; i++) { if (s[i] == R ) rc++; else uc++; if (rc == uc && s[i] == s[i + 1]) c++; } cout << c << n ; ...

#include <bits/stdc++.h> using namespace std; int M = 1e9 + 7; int main() { ios::sync_with_stdio(false); cin.tie(0); cerr.tie(0); int n, a[100005], sum = 0; cin >> n; for (int i = 0; i < n; i++) cin >> a[i], sum += a[i]; sort(a, a + n); int p[] = {0, -1, -1}, ct = 0, f = 0; for...

#include <bits/stdc++.h> using namespace std; int main() { int h1, h2, m1, m2, h3, m3; char s1, s2; cin >> h1 >> s1 >> m1 >> h2 >> s2 >> m2; if (h1 == 0) h1 = 24; if (h2 == 0) h2 = 24; if (m1 < m2) { h1--; m3 = m1 + 60 - m2; } else m3 = m1 - m2; if (h1 < h2) { ...

#include <bits/stdc++.h> using namespace std; const double PI = 3.141592653589793238462643383279502884197169399375105820974944; long long dist(long long a, long long b, long long c, long long d) { return abs(a - c) + abs(b - d); } signed main() { ios_base::sync_with_stdio(false); cin.tie(0);...

#include <bits/stdc++.h> using namespace std; int n, tb[100], w1, w2, l = 1; int main() { scanf( %d , &n); for (int i = 0; i < n / 2; i++) scanf( %d , &tb[i]); sort(tb, tb + n / 2); for (int i = 0; i < n / 2; i++) { w1 += abs(tb[i] - l); l += 2; } l = 2; for (int i = 0; i <...

#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const long long infl = 1LL << 60; mt19937 rnd(time(0)); inline int myrand(int l, int r) { return rnd() % (r - l + 1) + l; } inline int read() { int x = 0, f = 1; char c = getchar(); while (!isdigit(c)) { if (c == - ...

#include <bits/stdc++.h> using namespace std; const double v = 1.41421356237; int main() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); int t = 1; cin >> t; while (t--) { long long int x1, y1, z1, x2, y2, z2; cin >> x1 >> y1 >> z1 >> x2 >> y2 >> z2; long long ...

#include <bits/stdc++.h> using namespace std; const int N = 50005; const unsigned long long MOD = 1e8 + 7; const unsigned long long MAX = 1e15; int X[N], Y[N], T[N], K[N]; int n; double P[N], dp[N], ans = 0; bool cmp(int a, int b) { return T[a] < T[b]; } double dist(int i, int j) { double ans = sq...

#include <bits/stdc++.h> using namespace std; int n, k, a[10010]; bool vs[3000][3000]; int main() { cin >> n >> k; for (int i = n + 1; i <= n + k; i++) { a[i] = i - n; } for (int i = 1; i <= n; i++) a[i] = i; for (int i = 1; i <= n; i++) { for (int j = i + 1; j <= i + k; j++) { ...

#include <bits/stdc++.h> using namespace std; long long int n, t; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> t; while (t--) { cin >> n; long long int a[n], x = 0; vector<long long int> ans; for (int i = 0; i < n; i++) { cin >> a[i]; ...

#include <bits/stdc++.h> using namespace std; bool bin(unsigned long long a, unsigned long long b) { return a > b; } int main() { int n, k; scanf( %d %d , &n, &k); long inp; queue<long> seg; map<long, long> cnt; set<long> once; for (int y = 0; y < k; y++) { scanf( %ld , &inp); ...

#include <bits/stdc++.h> using namespace std; int n, in[200005], a[200005], sta[200005], top, now, root, ans, flag; bool vis[200005], mark[200005]; int read() { int x, f = 1; char ch; while (!(isdigit(ch = getchar()))) ch == - ? f = -1 : f; x = ch - 48; while ((isdigit(ch = getchar()))) x ...

#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; int u[5005][10005]; int n, m, a[5005], b[5005] = {1}, c[5005] = {1}, d[5005] = {1}, e[5005]; int expmod(int a, int b, int mod) { int res = 1; for (; b; b >>= 1) { if (b & 1) res = 1ll * res * a % mod; a = 1ll * a * a % ...

#include <bits/stdc++.h> #include <sys/types.h> #include <stdio.h> #include <unistd.h> #define _USE_MATH_DEFINES #define ll long long int #ifndef ONLINE_JUDGE #define debug(x...) cerr << [ << #x << ] = [ ; _print(x) #else #define debug(x...) #endif using namespace std; //mp.reserve(1024); /...

#include <bits/stdc++.h> using namespace std; void err() { cout << n ; } template <class T, class... Ts> void err(const T& arg, const Ts&... args) { cout << arg << ; err(args...); } inline int read() { int s = 0, w = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (c...

#include <bits/stdc++.h> using namespace std; const int maxn = (3e5) + 10, mod = 1e9 + 7; int n, a[maxn]; map<int, int> mark; int32_t main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; int ans = 0; int num = 0; ...

#include <bits/stdc++.h> using namespace std; int f[200005]; int main() { string str; cin >> str; f[0] = 1; for (int i = 1; i < str.length(); i++) { if (str[i] == str[i - 1]) f[i] = f[i - 1] + 1; else f[i] = 1; } int last = 0, plast = 0; cout << str[0]; ...

#include <bits/stdc++.h> using namespace std; void FastIO() { ios_base::sync_with_stdio(false); cin.tie(0); cout.precision(20); } int main() { FastIO(); int N; int A[200][200]; cin >> N; int Count = 0; int Cars[1000] = {0}; for (int i = 0; i < N; i++) { for (int j =...

#include <bits/stdc++.h> using namespace std; void fastio() { ios_base::sync_with_stdio(0); cin.tie(0); } int main() { fastio(); long long int n; cin >> n; long long int ans = 0; long long int a[n]; for (int i = 0; i < n; i++) cin >> a[i]; for (long long int i = 0; i < n; i +...

#include <bits/stdc++.h> using namespace std; long long power(long long a, long long b) { long long ans = 1; while (b > 0) { if (b & 1) { ans = (ans * a) % 1000000007; } a = (a * a) % 1000000007; b >>= 1; } return ans; } bool prime(long long n) { for (long lon...

#include <bits/stdc++.h> using namespace std; long long int mod = 998244353; long long int hmaxii = 0; vector<long long int> values[2 * 100000 + 1]; long long int MAXN = 2 * 100000 + 1; long long int spf[2 * 100000 + 1]; long long int diff, x, y, z; long long int flag = 1; long long int price[1001][10...

#include <bits/stdc++.h> using namespace std; int main() { int n, s; while (cin >> n >> s) { int ans = s; for (int i = 0; i < n; ++i) { int f, t; cin >> f >> t; if (ans < f + t) { ans = f + t; } } cout << ans << endl; } return 0; } ...

#include <bits/stdc++.h> int m[6]; int w[6]; int x[6] = {0, 500, 1000, 1500, 2000, 2500}; double max(int i) { double a = 0.3 * x[i]; double b = (1 - m[i] * 1.0 / 250) * x[i] - 1.0 * 50 * w[i]; if (a > b) return a; return b; } int main() { int i, u, v; while (~scanf( %d%d%d%d%d , &m[1...

#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; const long long inf = 4e18; const long double pai = acos(-1); int n, q, ans; set<pair<pair<int, int>, int> > s; int main() { scanf( %d%d , &n, &q); ans = n; s.insert({{1, n}, 1}); while (q--) { int l, r, x; ...

#include <bits/stdc++.h> using namespace std; int main() { int n, d, l; int ans[101]; int s = 0; cin >> n >> d >> l; for (int i = 0; i < n; ++i) { ans[i] = (i & 1) ? -1 : 1; s += ans[i]; } bool sw = false; while (true) { if (s == d) break; sw = false; if...

#include <bits/stdc++.h> using namespace std; long long fp(long long b, long long p) { long long res = 1; while (p) { if (p % 2) res = (res * b) % 1000000007; b = (b * b) % 1000000007; p /= 2; } return res; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); lo...

#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 5; char b_[N], n_[N]; long long mod, b, n; int prime[N]; inline void get_phi() { int x = mod; int sx = sqrt(mod); for (int i = 2; i <= sx; ++i) { if (x == 1) break; if (x % i) continue; while (x % i == 0) x /= i;...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int arr[n]; for (int i = 0; i < n; i++) cin >> arr[i]; sort(arr, arr + n, greater<int>()); deque<int> d; d.push_front(arr[0]); int i; for (i = 1; i < n; i++) { if (arr[i] != arr[0]) break; } ...

#include <bits/stdc++.h> using namespace std; const int maxc = 22; const int maxn = (int)5e5; int tin[maxn], tout[maxn], _t = 0, ver[maxn], n; vector<int> g[maxn]; int deep[maxn], maxh[1 << maxc]; unsigned mask[maxn]; int sz[maxn], ans[maxn]; unsigned char s[maxn]; int dfs_size(int v, unsigned m) { ...

#include <bits/stdc++.h> using namespace std; void fast() { ios_base::sync_with_stdio(false); cin.tie(NULL); } bool isSubSequence(string str1, string str2, int m, int n) { if (m == 0) return true; if (n == 0) return false; if (str1[m - 1] == str2[n - 1]) return isSubSequence(str1, str2...

#include <bits/stdc++.h> using namespace std; int input() { int res = 0; char c = ; while (c < 0 && c != - ) c = getchar(); while (c >= 0 ) res = res * 10 + (c - 0 ), c = getchar(); return res; } const int N = 1e5 + 1; string to_str(int x) { string res; while (x) res += 0 ...

#include <bits/stdc++.h> using namespace std; int T, n; char Ls[400000 + 5], ps[400000 + 5]; long long ans; long long read() { long long x = 0, F = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) F = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { x ...

#include <bits/stdc++.h> const int maxn = 5205; using namespace std; int n, a[maxn][maxn], m; int cnt, sum[maxn][maxn], x[maxn]; bool check(int x) { int now; for (int i = x; i <= n; i += x) { for (int j = x; j <= n; j += x) { now = sum[i][j] - sum[i - x][j] - sum[i][j - x] + sum[i - x][j...

#include <bits/stdc++.h> using namespace std; const int maxN = 1000 * 1000 + 100; int nex[maxN]; int st[maxN]; int en[maxN]; vector<int> c[maxN]; int ind; void dfs(int s) { st[s] = ind++; for (auto x : c[s]) dfs(x); en[s] = ind; } int main() { int n, m; string s; cin >> n >> ...

#include <bits/stdc++.h> using namespace std; const int mod = 1000000007; const vector<int> mods = {998244353, 1000000007, 1000000009}; const long long inf = 3e18; const double pi = acos(-1.0); const double eps = 0.0000001; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); template <c...

#include <bits/stdc++.h> using namespace std; int N, K; string s; bool dp[1010][1010]; bool dfs(int i, int j) { if (i == N && abs(j) == K) return true; if (i != N && abs(j) == K) return false; if (i == N && abs(j) != K) return false; if (dp[i][j] == 1) return false; dp[i][j] = 1; if (s...

#include <bits/stdc++.h> using namespace std; vector<vector<int>> adj; vector<int> a, b, t; vector<int> dep, sz; void dfs(int v, int p) { dep[v] = dep[p] + 1; for (auto c : adj[v]) { if (c != p) { dfs(c, v); sz[v] += sz[c]; } } } int main() { ios_base::sync_with...

#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const int MAXN = 5e5 + 10; bool bio[MAXN]; int n; int a[MAXN], b[MAXN], aa[MAXN], bb[MAXN]; int deg[1 << 20]; map<pair<int, int>, vector<int>> id; vector<pair<int, int>> e[1 << 20]; stack<int> path; bool euler(int x, bool print...