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() { string s[40] = { Washington , Adams , Jefferson , Madison , Monroe , Adams , Jackson , Van Buren , Harrison , Tyler , Polk , Taylor , Fillmore , Pierce , Buchanan , Lincoln , ...
#include <bits/stdc++.h> using namespace std; template <typename T> void out(T x) { cout << x << endl; exit(0); } const int maxn = 1e6 + 5; int n, m; int a[maxn]; vector<int> g[maxn]; vector<pair<int, pair<int, int>>> edges; int par[maxn], siz[maxn]; int f(int x) { return par[x] == x ? x :...
#include <bits/stdc++.h> using namespace std; using ll = long long; class flow { private: int n; vector<int> head, d, cur; vector<tuple<int, ll, int>> edge; bool bfs(int s, int t) { d.assign(n, -1); queue<int> que; que.push(s); d[s] = 0; while (!que.empty()) { ...
#include <bits/stdc++.h> using namespace std; const int MOD = (int)1e9 + 7; const int FFTMOD = 119 << 23 \| 1; const int INF = (int)1e9 + 23111992; const long long LINF = (long long)1e18 + 23111992; const long double PI = acos((long double)-1); const long double EPS = 1e-9; inline long long gcd(long long...
#include <bits/stdc++.h> using namespace std; int main(int argc, char** argv) { int T; cin >> T; while (T--) { long long a, b, c, d; cin >> a >> b >> c >> d; d -= min(a, d / c) * c; if (d > b) puts( NO ); else puts( YES ); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { string s[10]; s[0] = O-\|-OOOO ; s[1] = O-\|O-OOO ; s[2] = O-\|OO-OO ; s[3] = O-\|OOO-O ; s[4] = O-\|OOOO- ; s[5] = -O\|-OOOO ; s[6] = -O\|O-OOO ; s[7] = -O\|OO-OO ; s[8] = -O\|OOO-O ; s[9] = -O\|OOOO- ; int n...
#include <bits/stdc++.h> using namespace std; int ROW[] = {+0, +0, -1, +1}; int COL[] = {+1, -1, +0, +0}; int X[] = {+0, +0, +1, -1, -1, +1, -1, +1}; int Y[] = {-1, +1, +0, +0, +1, +1, -1, -1}; int KX[] = {-2, -2, -1, -1, 1, 1, 2, 2}; int KY[] = {-1, 1, -2, 2, -2, 2, -1, 1}; long long calc(long long num...
#include <bits/stdc++.h> using namespace std; string s; int poz, sol; int main() { sol = INT_MAX; cin >> s; int n = s.size(); for (int c = 1; c <= 26; c++) { char ch = c + a - 1; poz = -1; int maxx = 0; for (int i = 0; i < n; i++) { if (s[i] == ch) { i...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; cout << n << ; for (int i = 1; i < n; ++i) cout << i << ; }
#include <bits/stdc++.h> int main() { int n, m; int sum = 0; int a, b; int i = 0; int x[1010] = {0}, y[1010] = {0}; scanf( %d %d , &n, &m); while (m-- > 0) { scanf( %d %d , &a, &b); y[a] = 1; x[b] = 1; } for (i = 2; i <= n - 1; i++) { if (x[i] == 0) sum++; ...
#include <bits/stdc++.h> using namespace std; int32_t main() { ios::sync_with_stdio(false); cin.tie(0); long long n, w; cin >> n >> w; vector<long long> arr(n); for (long long i = 0; i < n; ++i) cin >> arr[i]; vector<long long> runsum(n); long long min_elem = arr[0]; long long ma...
#include <bits/stdc++.h> using namespace std; void ASS(bool bb) { if (!bb) { ++(int)0; } } #pragma comment(linker, /STACK:106777216 ) int main() { int a, b, m; cin >> a >> b >> m; for (int i = 0; i < (int)(min(a + 1, m)); i++) { int x = i * (long long)1000000000 % m; x...
#include <bits/stdc++.h> using namespace std; int start, ed = 0, sz = 130000000; long long marked[(130000000 / 64) + 5]; vector<int> primes; inline bool check(int pos) { return !(marked[pos / 64] & (1LL << (pos % 64))); } int pos; bool isPrime(int n) { if (n != 2 and n % 2 == 0) return false; int ...
#include <bits/stdc++.h> using namespace std; struct node { int l, r; int num; } Treex[4000009], Treey[4000009]; map<int, int> vis; int i; int tot = 1; int Tot = 1; int x, y; char str[5]; void update_y(int ll, int rr, int c, int l, int r, int t) { if (ll <= l && r <= rr) Treey[t].n...
#include <bits/stdc++.h> using namespace std; const long long PINF = 1E9; const long long NINF = -1E9; const long long M = 1E9 + 7; const double EPS = 1E-9; const double PI = 2 * acos(0); void print_arr(const vector<long long> &a) { for (int i = 0; i < (int)a.size(); i++) cout << a[i] << ; cout...
#include <bits/stdc++.h> using namespace std; template <class T> inline T bigmod(T p, T e, T M) { long long ret = 1; for (; e > 0; e >>= 1) { if (e & 1) ret = (ret * p) % M; p = (p * p) % M; } return (T)ret; } template <class T> inline T gcd(T a, T b) { if (b == 0) return a; ...
#include <bits/stdc++.h> using namespace std; struct edge { int t, nxt; } e[600010]; int n, cnt, be[300010], mn_mx[300010], f, vid[300010], tot; void add(const int& x, const int& y) { e[++cnt].t = y, e[cnt].nxt = be[x], be[x] = cnt; } void dfs(const int& x) { if (!be[x]) return (void)(++tot, v...
#include <bits/stdc++.h> using namespace std; long long int mod = 1000000007; long long int MAX = 1e18; void solve() { long long int n; scanf( %lld , &n); long long int a[n]; vector<pair<long long int, long long int> > v(n), ans; for (long long int i = 0; i < n; i++) { long long int nu...
#include <bits/stdc++.h> using namespace std; int main() { long long int n, c = 0; cin >> n; long long int d; cin >> d; long long int s[n + 5]; for (long long int i = 0; i < n; i++) { cin >> s[i]; } sort(s, s + n); for (long long int i = 0; i < n - 1; i++) { for (long...
#include <bits/stdc++.h> using namespace std; long long power(long long x, long long y, long long p); inline int D() { int t; scanf( %d , &t); return t; } inline long long llD() { long long t; scanf( %lld , &t); return t; } const int N = 1e6 + 5; long long arr[N], cost[N]; int ...
#include <bits/stdc++.h> using namespace std; const int M = 1e6 + 20; struct Edge { int to, w, next; } edge[M]; int head[M], cnt, fa[M]; inline void add(int u, int v, int w) { edge[++cnt].to = v, edge[cnt].w = w, edge[cnt].next = head[u], head[u] = cnt; } long long mxp[M]; int val[M]; long l...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; int main() { int n; scanf( %d , &n); vector<vector<pair<int, int>>> a(n); for (int i = 0; i < n - 1; i++) { int u, v; scanf( %d %d , &u, &v); --u, --v; a[u].emplace_back(v, i); a[v].emplace_back(u, i...
#include <bits/stdc++.h> using namespace std; const int MAXN = 200010; const int MODD = 1000000007; struct Stop { int s, t; bool operator<(const Stop &ss) const { return t < ss.t; } } bus[MAXN]; int n, m, nn, dp[MAXN], sum[MAXN]; int main() { while (scanf( %d%d , &n, &m) != EOF) { map<in...
#include <bits/stdc++.h> const int N = 1e6; const long long mod = 998244353; const int INF = 0x7fffffff; const int inf = 0x3f3f3f3f; using namespace std; void exgcd(long long a, long long b, long long &x, long long &y) { if (b == 0) { x = 1; y = 0; return; } exgcd(b, a % b, y, ...
#include <bits/stdc++.h> using namespace std; int n, m, top, tot, cnt; int fir[202020], nxt[202020 << 1], to[202020 << 1]; int dfn[202020], fa[202020], st[202020]; struct evol { int v, nm; } l1[202020], l2[202020]; void add(int x, int y) { nxt[++cnt] = fir[x]; fir[x] = cnt; to[cnt] = y; ...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 10; int k, q; long long f[10], dp[maxn]; void update(long long v, long long w) { for (int i = 1000000; i >= w; i--) dp[i] = max(dp[i], dp[i - w] + v); return; } void solve(long long v, long long w) { int num = min((long long)...
#include <bits/stdc++.h> using namespace std; const int maxn = 500050; const long long inf = 1e18; int a[maxn]; vector<int> G[maxn]; int f[maxn][20], root; long long ans = 0; void dfs(int x, int par) { f[x][0] = par; long long t = inf; if (par) t = a[x] + a[par]; for (int i = 1; f[x][i -...
#include <bits/stdc++.h> using namespace std; double PI = 3.14159265358979323843; int BS(int arr[], int sz, int n) { int l = 0, r = sz - 1, mid; while (l <= r) { if (arr[mid] >= n) r = mid - 1; else l = mid + 1; } return l; } bool prime(long long x) { for (int i...
#include <bits/stdc++.h> using namespace std; int sta[10][100005]; int top[10]; int tail[10]; int a[100005][10]; int ans[10]; int main() { int n, m; int k; scanf( %d %d %d , &n, &m, &k); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { scanf( %d , &a[i][j]); ...
#include <bits/stdc++.h> using namespace std; const int imax = INT32_MAX; const int imin = INT32_MIN; const long long int inf = 1e18; const long long int MOD = 1e9 + 7; const long long int range = 1e9 + 7; vector<vector<int>> g; template <class T> T cal(T n) { return (n * 1ll * (n + 1)); } tem...
#include <bits/stdc++.h> using namespace std; int main() { string a, a2, a3; getline(cin, a); getline(cin, a2); getline(cin, a3); int lin1 = 0, lin2 = 0, lin3 = 0; for (int i = 0; i < a.size(); i++) { if (a[i] == e \|\| a[i] == a \|\| a[i] == i \|\| a[i] == o \|\| a[i] == u ...
#include <bits/stdc++.h> using namespace std; int main() { int x, t, a, b, da, db; cin >> x >> t >> a >> b >> da >> db; for (int i = 0; i < t; i++) for (int h = 0; h <= 1; h++) for (int j = 0; j < t; j++) for (int s = 0; s <= 1; s++) if (((a - (da * i)) * h) + ((b - (...
#include <bits/stdc++.h> using namespace std; void solve(); int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int times = 1; cin >> times; for (int i = 0; i < times; i++) { solve(); cout << n ; } return 0; } long long a, b, c, d, e, f, g, h; lo...
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long LL_INF = 0x3f3f3f3f3f3f3f3f; const int maxn = 3e5 + 10; const int mod = 1e9 + 7; long long a[maxn]; int main() { long long n, m; scanf( %I64d%I64d , &n, &m); for (int i = 0; i < n; i++) { scanf( %I6...
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; int a, x; long long ans = 0; map<vector<pair<int, int>>, int> mp; for (int i = 0; i < n; i++) { vector<pair<int, int>> v; cin >> a; for (int j = 2; j * j <= a; j++) { int pow = 0; ...
#include <bits/stdc++.h> using namespace std; int long long n, a, b, x = 4, y = 2, ans, m, ans1, ans2, ans3; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); cin >> m >> a >> b; while (x > 0 \|\| y > 0) { ans++; n = m; while (x > 0 && n >= a) { ...
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 1; vector<int> s[N], e[N]; int n, m, l[N], r[N], x[N], res[N]; bool vis[N]; int main() { scanf( %d%d , &n, &m); for (int i = 0; i < m; ++i) { scanf( %d%d%d , &l[i], &r[i], &x[i]); s[l[i]].push_back(i); e[r[i]].push_b...
#include <bits/stdc++.h> using namespace std; long long int i, j = 0, k, a, b; int main() { long long int n, m; cin >> n; long long int aa[n + 1]; for (i = 1; i <= n; i++) cin >> aa[i]; cin >> m; while (m--) { cin >> a >> b; if (a != 1) aa[a - 1] += b - 1; if (a != n) aa[...
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int n = s.length(); int a[n + 2][3]; for (int i = 0; i < n + 1; i++) for (int j = 0; j < 3; j++) a[i][j] = 0; for (int k = 0; k < s.length(); k++) { if (s[k] == . ) continue; else if (s[...
#include <bits/stdc++.h> using namespace std; const int N = 400010; vector<int> g[N]; int pos[N], to[N]; int kw = 0, w[N]; void dfs(int v, int pr) { pos[v] = kw; w[kw++] = v; for (int j = 0; j < (int)g[v].size(); j++) { int u = g[v][j]; if (u != pr) { dfs(u, v); } }...
#include <bits/stdc++.h> using namespace std; long long mod = 1000000007; long long max(long long a, long long b) { return a > b ? a : b; } bool r(long long p1, long long p2) { return (p2 < p1); } long long min(long long a, long long b) { return a < b ? a : b; } long long gcd(long long a, long long b) { ...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; int n; string s; while (t--) { cin >> n >> s; int x = 0, y = 0; map<pair<int, int>, int> m; int l = 0, r = n + 1; m[{0, 0}] = 1; for (int i = 0; i < n; i++) { if (s[i] == L ) ...
#include <bits/stdc++.h> using namespace std; const long long N = 3e5 + 5; long long a[N], pos[N]; long long n; int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long t = 1; cin >> t; while (t--) { cin >> n; for (long long i = 1; i <= n; i++) cin...
#include <bits/stdc++.h> using namespace std; int n; int a[100500]; int b[200500]; int c[100500]; multiset<int> pl, mnus; int addpl, addmn; int main() { cin >> n; for (int i = 0; i < n; ++i) { cin >> a[i]; c[a[i]] = i; } for (int i = 0; i < n; ++i) { cin >> b[i]; ...
#include <bits/stdc++.h> using namespace std; string s[110 * 110]; vector<string> v; char sub(string s1, string s2) { int dem[30]; memset(dem, 0, sizeof(dem)); for (int i = 0; i < s1.size(); i++) dem[s1[i] - a ]++; for (int i = 0; i < s2.size(); i++) dem[s2[i] - a ]--; for (int i = 0; i <=...
#include <bits/stdc++.h> using namespace std; bool EulerianPathExists(const map<string, pair<int, int>>& in_out_degrees) { int different_in_out_count = 0; for (auto& key_val : in_out_degrees) { if (key_val.second.first != key_val.second.second) { ++different_in_out_count; if (different...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; long long max(long long a, long long b) { if (a > b) { return a; } else { return b; } } long long min(long long a, long long b) { if (a < b) { return a; } else { return b; } } long l...
#include <bits/stdc++.h> using namespace std; const int maxn = 110000; int n, q; map<pair<int, int>, int> M; int u[maxn], v[maxn]; int s[maxn], e[maxn]; vector<int> V[maxn << 4]; struct DSU { int fa[maxn], col[maxn], sz[maxn]; stack<pair<pair<int *, int>, int>> stk; int findfa(int x, int &va...
#include <bits/stdc++.h> using namespace std; const int N = 20; char s1[N], s2[N], ans[N]; int main() { scanf( %s%s , s1, s2); int n1 = strlen(s1), cnt = 0; ans[cnt++] = s1[0]; for (int i = 1; i < n1; i++) { if (s1[i] >= s2[0]) break; ans[cnt++] = s1[i]; } ans[cnt++] = s2[0];...
#include <bits/stdc++.h> using namespace std; long long mod = 998244353; long long fast_exp(long long a, long long b) { if (b <= 0) return 1; else { long long res = 1; res = fast_exp(a, b / 2); res = (res * res) % mod; if (b % 2 == 1) res = (res * a) % mod; return res; ...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); int n; cin >> n; int sher = new int[n]; char d; for (int i = 0; i < n; i++) { cin >> d; sher[i] = d - 0 ; } int mor = new int[n]; for (int i = 0; i < n; i++) { cin >> d; ...
#include <bits/stdc++.h> using namespace std; template <typename T> int sz(const T &a) { return (int)a.size(); } const int MAXN = 2e5 + 1; int arr[MAXN]; int fir[MAXN]; priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q; int main() { cin.tie(NULL); ios_...
#include <bits/stdc++.h> int main() { int i, j, t, n, a[20000], counto, counte; scanf( %d , &t); for (i = 1; i <= t; i++) { counto = 0, counte = 0; scanf( %d , &n); for (j = 0; j < n; j++) { scanf( %d , &a[j]); if (a[j] % 2 == 0) counte++; else ...
#include <bits/stdc++.h> using namespace std; const int maxn = 1000; int fs[100], ft[100]; char c[1050], s[100], t[100]; int dp[1050][100][100]; void GetNextval(char* p, int next[]) { int pLen = strlen(p); next[0] = -1; int k = -1; int j = 0; while (j < pLen) { if (k == -1 \|\| p[j] ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e3 + 5; struct node { int l, r; } num[MAXN]; int cmp(node x, node y) { return x.r < y.r; } int main() { int N; vector<int> v; v.clear(); scanf( %d , &N); for (int i = 0; i < N; i++) { scanf( %d%d , &num[i].l, &num[...
#include <bits/stdc++.h> using namespace std; int main() { int x, i, p = 0, k = 0; cin >> x; char n[x + 1]; cin >> n; for (i = 0; i < x; i++) { if (n[i] == L ) p++; else k++; } cout << p + k + 1 << endl; }
#include <bits/stdc++.h> using namespace std; int a[2000], b[2000]; inline bool valid(int i, int j, pair<int, int> pii) { return i != pii.first && j != pii.second; } int main() { int n, m; scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d , &a[i]); scanf( %d , &m); for (int i = 0;...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 5; int sub_tree[maxn], n, T[maxn], P[maxn][22], L[maxn], par[maxn], ans[maxn], nn; set<int> adj[maxn]; void lca_dfs(int u, int p) { T[u] = p; L[u] = (p > -1) ? L[p] + 1 : 0; for (int s : adj[u]) { if (s == p) continue; ...
#include <bits/stdc++.h> using namespace std; const int maxn = 305; int n, m; inline int gi() { char c = getchar(); while (c < 0 \|\| c > 9 ) c = getchar(); int sum = 0; while ( 0 <= c && c <= 9 ) sum = sum * 10 + c - 48, c = getchar(); return sum; } const int Maxn = 605, Maxm = Maxn ...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; const long double EPS = 1e-9; const long double PI = acos(-1); const long long INF = 1e18; const long long mod = 1e9 + 7; long long factorial(long long n) { if (n == 0) return 1; long long x = 1; for (long long i = 1; ...
#include <bits/stdc++.h> using namespace std; template <class A, class B> ostream &operator<<(ostream &os, pair<A, B> p) { return os << ( << p.first << , << p.second << ) ; } template <class A> ostream &operator<<(ostream &os, vector<A> v) { os << { ; for (auto &x : v) cout << x << ; ...
#include <bits/stdc++.h> using namespace std; const int maxn = 1000010; int n, x, tot = 0, Ans = 0, prime[maxn]; bool isprime[maxn]; map<int, int> sg, st; void init() { memset(isprime, true, sizeof(isprime)); isprime[1] = false; for (int i = 2; i < maxn; i++) { if (isprime[i]) prime[++tot]...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, m, k; cin >> n >> m >> k; int i = 0; while (k--) { int j = i; for (int h = 0; h < m; h++) { int x = h < n % m ? n / m + 1 : n / m; cout << x; ...
#include <bits/stdc++.h> const int kN = 100000 + 5; int n, parent[kN], type[kN]; std::vector<int> edges[2][kN]; int left[2][kN], right[2][kN], stmp; int top[2][kN]; void dfs(int color, int u, int root) { left[color][u] = ++stmp; top[color][u] = root; for (int v : edges[color][u]) { dfs(col...
#include <bits/stdc++.h> const int MaxN = 1 << 20; using namespace std; int dp[MaxN + 5]; char s[30][30]; int a[30][30], cost[30][30]; int bit[30][30]; int n, m; int main() { while (~scanf( %d%d , &n, &m)) { for (int i = 0; i < n; i++) scanf( %s , s[i]); for (int i = 0; i < n; i++) ...
#include <bits/stdc++.h> using namespace std; int n, m, k, src, dest, dist[100001], par[100001], mark[100001], vol[100001], vis[100001]; vector<int> v[100001]; vector<pair<int, int> > edge; vector<int> g[100001]; int reachable() { memset(vis, 0, sizeof vis); vis[src] = 1; queue<int> q; ...
#include <bits/stdc++.h> using namespace std; struct node { int left, right; int time[60]; node(int left = 0, int right = 0) : left(left), right(right) {} } arb[4 * 100000 + 5]; inline void unite(node &a, node b, node &c) { for (int i = 0; i < 60; i++) a.time[i] = b.time[i] + c.time[(i + b...
#include <bits/stdc++.h> int Fa[200010]; std::vector<int> v[200010]; int Find(int x) { return Fa[x] == x ? x : Fa[x] = Find(Fa[x]); } bool vis[200010]; inline void merge(int a, int b) { int f1 = Find(a), f2 = Find(b); if (f1 != f2) { Fa[f1] = f2; } } int main() { int n, m, q; sca...
#include <bits/stdc++.h> using namespace std; int main() { int c, a, b; cin >> a >> b >> c; cout << a * b * c - (a - 1) * (b - 1) * (c - 1); return 0; }
#include <bits/stdc++.h> using namespace std; long long int mod = 1000000007; long long int vi[100000], m, n, k, p1, p2, p3, p, f, t; long long int powmod(long long int a1, long long int b1) { long long int res = 1; a1 %= mod; for (; b1; b1 >>= 1) { if (b1 & 1) res = res * a1 % mod; a1 =...
#include <bits/stdc++.h> using namespace std; int main() { int k, n1, n2, n3, t1, t2, t3; cin >> k >> n1 >> n2 >> n3 >> t1 >> t2 >> t3; multiset<int> A, B, C; for (int i = 0; i < n1; ++i) A.insert(0); for (int i = 0; i < n2; ++i) B.insert(0); for (int i = 0; i < n3; ++i) C.insert(0); for...
#include <bits/stdc++.h> using namespace std; bool comp(const pair<int, int> &a, const pair<int, int> &b) { if (a.first > b.first) return true; if (a.first == b.first) return a.second > b.second; return false; } int main() { int n; scanf( %d , &n); vector<pair<int, int> > v; for (int...
#include <bits/stdc++.h> using namespace std; signed main() { long long n; cin >> n; long long arr[n]; for (long long i = 0; i < n; i++) { cin >> arr[i]; } long long c = 0; long long d = 0; long long e = 0; long long h; long long g; for (long long i = 0; i < n; i++)...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int n, i, j = 1, j2 = 0, j3, k, h = 1; string s; cin >> s; for (i = 1; i < s.length(); ++i) { if (j < h) j = h; if (h == s.length()) break; if (s[i - 1] != ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 123456; void pre(); void post(); int n; int mas[MAXN]; int solve[MAXN]; void read() { cin >> n; for (int i = 0; i < n; i++) { scanf( %lld , &mas[i]); solve[mas[i] - 1] = i; } } int main() { pre(); read(); ...
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int streak = 0; int maxStreak = 0; char c = 2 ; for (int i = 0; i < s.length(); i++) { if (c != s[i]) { c = s[i]; streak = 0; } streak++; maxStreak = streak > maxStreak ? s...
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } long long bigmod(long long base, long long power) { if (power == 0) return 1; long long ret = bigmod(base, power / 2); ret = (ret * ret) % 1000000007; if ...
#include <bits/stdc++.h> using namespace std; void __print(int x) { cerr << x; } void __print(long x) { cerr << x; } void __print(long long x) { cerr << x; } void __print(unsigned x) { cerr << x; } void __print(unsigned long x) { cerr << x; } void __print(unsigned long long x) { cerr << x; } void __prin...
#include <bits/stdc++.h> using namespace std; template <class T> inline void Read(T &x) { int f = 1; char t = getchar(); while (t < 0 \|\| t > 9 ) { if (t == - ) f = -1; t = getchar(); } x = 0; while (t >= 0 && t <= 9 ) { x = x * 10 + t - 0 ; t = getchar(); ...
#include <bits/stdc++.h> using namespace std; int t, x, y, a, b; int main(void) { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> t; while (t--) { cin >> x >> y >> a >> b; int tmp = (y - x) / (a + b); if (x + tmp * a == y - tmp * b) cout << tmp << n ; else...
#include <bits/stdc++.h> using namespace std; int main() { set<int> a; int n, b, c; cin >> n; for (int i = 0; i < n; i++) { cin >> b; a.insert(b); } if (a.size() == 1) std::cout << 0 << endl; else if (a.size() == 2) { b = a.begin(); c = (--a.end()); ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1000 * 100 * 3 + 10; long long int mod = 998244353; long long int x[MAXN]; long long int y[MAXN]; pair<long long int, long long int> p[MAXN]; long long int f(long long int n) { long long int m = 1; for (int i = 1; i <= n; i++) { ...
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int N = 1000010; int T, n, m, flag, cnt; vector<int> e[N], E[N]; int dfn[N], idx = 0, low[N], bl[N], lb, sta[N], top; template <typename T> void gi(T &x) { x = 0; register char c = getchar(), pre = 0; for (; c < 0 ...
#include <bits/stdc++.h> using namespace std; const int N = (long long)(2 * 1e5) + 5; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); map<int, int> mp; int n; cin >> n; vector<int> a(n + 1), b(n + 1), p(n + 1); for (int i = 1; i <= n; i++) { cin >> a[i]; ...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int sum = 0; for (int i = 0; i < n; i++) { int x1, x2, y1, y2; cin >> x1 >> x2 >> y1 >> y2; sum += (max(x1, y1) - min(x1, y1) + 1) * (max(x2, y2) - min(x2, y2) + 1); } cout << sum << n ; retur...
#include <bits/stdc++.h> using namespace std; char buf[32]; int Solution() { int n, m; scanf( %d%d , &n, &m); vector<int> mas(n); for (int i = 0; i < n; ++i) scanf( %d , &mas[i]); sort(mas.begin(), mas.end()); map<string, int> fr; gets(buf); for (int i = 0; i < m; ++i) { gets...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; const int MOD = 1e9 + 7; long long dp[N][2]; void solve() { memset(dp, 0, sizeof(dp)); string a, b; cin >> a >> b; (a == b ? dp[0][1] = 1 : dp[0][0] = 1); int k; cin >> k; long long way_good = 0, way_bad = 0; ...
#include <bits/stdc++.h> using namespace std; long long a[100005]; void solve() { long long n, k; cin >> n >> k; if (n == k) { cout << -1 << endl; return; }; if (k == 0) { cout << n << ; for (__typeof((n)) i = (1); i < (n); i++) cout << i << ; return; } ...
#include <bits/stdc++.h> using namespace std; set<pair<int, int> > vis; int mx[8] = {-2, -2, -1, -1, 1, 1, 2, 2}; int my[8] = {-1, 1, -2, 2, -2, 2, -1, 1}; int main() { long long K; int N; cin >> K >> N; for (int i = 0; i < N; i++) { int x, y; cin >> x >> y; vis.insert(pair<i...
#include <bits/stdc++.h> using namespace std; void fast() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } int main() { fast(); long long n; cin >> n; if (n % 4 == 1) cout << 0 << << A << endl; else if (n % 4 == 0) cout << 1 << << A ...
#include <bits/stdc++.h> int min(int a, int b) { return a < b ? a : b; } int max(int a, int b) { return a > b ? a : b; } int oo[1 + (50 + 50 * 26 + 26) * 2], oh[1 + (50 + 50 * 26 + 26) * 2]; int link(int o, int h) { static int _ = 1; oo[_] = o, oh[_] = h; return _++; } int ii[(50 + 50 * 26 + 26)...
#include <bits/stdc++.h> using namespace std; long long t, n; long long qpow(long long a, long long b) { long long x = 1, base = a; while (b) { if (b & 1) { x = (x * base) % 1000000007; } base = (base * base) % 1000000007; b >>= 1; } return x % 1000000007; } int...
#include <bits/stdc++.h> using namespace std; bool check(int a, int b, int frst, int s) { return a * frst / (double)s >= (double)b; } int main() { int n, a, b, *arr; cin >> n >> a >> b; arr = new int[n]; for (int i = 0; i < n; i++) { cin >> arr[i]; } sort(arr + 1, arr + n); ...
#include <bits/stdc++.h> using namespace std; int dcmp(double p) { if (abs(p) < 1e-10) return 0; return p > 1e-10 ? 1 : -1; } struct Point { double x, y; Point() {} Point(double x, double y) : x(x), y(y) {} friend Point operator+(const Point &a, const Point &b) { return Point(a.x +...
#include <bits/stdc++.h> using namespace std; const int Maxn = 100020; int n, q; int a[Maxn]; int pre[Maxn], fin[Maxn], rel[Maxn]; int tree[Maxn << 2]; vector<int> V; int getid(int x) { return lower_bound(V.begin(), V.end(), x) - V.begin() + 1; } void add(int tar, int w, int l, int r, int x) { if ...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:102400000,102400000 ) using namespace std; const int INF = 0x3f3f3f3f; template <typename X> inline bool minimize(X& p, X q) { if (p <= q) return 0; p = q; return 1; } template <typename X> inline bool maximize(X& p, X q) { if (p >...
#include <bits/stdc++.h> using namespace std; int i, dp[100000], t; string s; int main() { cin >> s; for (i = 0; i < s.size(); i++) if (s[i] >= a ) { dp[i] = dp[i - 1]; t++; } else dp[i] = min(dp[i - 1] + 1, t); cout << dp[s.size() - 1] << endl; return 0; }...
#include <bits/stdc++.h> using namespace std; int nbPairs[5001][5001]; const int MOD = 1e9 + 7; int main() { char s[5001], t[5001]; scanf( %s%s , &s, &t); int ss = strlen(s), st = strlen(t); for (int is = ss - 1; is >= 0; is--) for (int it = st - 1; it >= 0; it--) { if (s[is] == t[...
#include <bits/stdc++.h> using namespace std; const long double eps = 1e-9; const int inf = (1 << 30) - 1; const long long inf64 = ((long long)1 << 62) - 1; const long double pi = 3.1415926535897932384626433832795; const string task = ; template <class T> T sqr(T first) { return first * first; }...
#include <bits/stdc++.h> using namespace std; const int MAXN = 2000005; char str[MAXN]; struct Palindromic_Tree { vector<pair<int, int>> next[MAXN]; int fail[MAXN]; int cnt[MAXN]; int num[MAXN]; int len[MAXN]; int S[MAXN]; int last; int n; int p; int newnode(int l) { ...

#include <bits/stdc++.h> using namespace std; int main() { string s[40] = { Washington , Adams , Jefferson , Madison , Monroe , Adams , Jackson , Van Buren , Harrison , Tyler , Polk , Taylor , Fillmore , Pierce , Buchanan , Lincoln , ...

#include <bits/stdc++.h> using namespace std; template <typename T> void out(T x) { cout << x << endl; exit(0); } const int maxn = 1e6 + 5; int n, m; int a[maxn]; vector<int> g[maxn]; vector<pair<int, pair<int, int>>> edges; int par[maxn], siz[maxn]; int f(int x) { return par[x] == x ? x :...

#include <bits/stdc++.h> using namespace std; using ll = long long; class flow { private: int n; vector<int> head, d, cur; vector<tuple<int, ll, int>> edge; bool bfs(int s, int t) { d.assign(n, -1); queue<int> que; que.push(s); d[s] = 0; while (!que.empty()) { ...

#include <bits/stdc++.h> using namespace std; const int MOD = (int)1e9 + 7; const int FFTMOD = 119 << 23 | 1; const int INF = (int)1e9 + 23111992; const long long LINF = (long long)1e18 + 23111992; const long double PI = acos((long double)-1); const long double EPS = 1e-9; inline long long gcd(long long...

#include <bits/stdc++.h> using namespace std; int main(int argc, char** argv) { int T; cin >> T; while (T--) { long long a, b, c, d; cin >> a >> b >> c >> d; d -= min(a, d / c) * c; if (d > b) puts( NO ); else puts( YES ); } return 0; }

#include <bits/stdc++.h> using namespace std; int main() { string s[10]; s[0] = O-|-OOOO ; s[1] = O-|O-OOO ; s[2] = O-|OO-OO ; s[3] = O-|OOO-O ; s[4] = O-|OOOO- ; s[5] = -O|-OOOO ; s[6] = -O|O-OOO ; s[7] = -O|OO-OO ; s[8] = -O|OOO-O ; s[9] = -O|OOOO- ; int n...

#include <bits/stdc++.h> using namespace std; int ROW[] = {+0, +0, -1, +1}; int COL[] = {+1, -1, +0, +0}; int X[] = {+0, +0, +1, -1, -1, +1, -1, +1}; int Y[] = {-1, +1, +0, +0, +1, +1, -1, -1}; int KX[] = {-2, -2, -1, -1, 1, 1, 2, 2}; int KY[] = {-1, 1, -2, 2, -2, 2, -1, 1}; long long calc(long long num...

#include <bits/stdc++.h> using namespace std; string s; int poz, sol; int main() { sol = INT_MAX; cin >> s; int n = s.size(); for (int c = 1; c <= 26; c++) { char ch = c + a - 1; poz = -1; int maxx = 0; for (int i = 0; i < n; i++) { if (s[i] == ch) { i...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; cout << n << ; for (int i = 1; i < n; ++i) cout << i << ; }

#include <bits/stdc++.h> int main() { int n, m; int sum = 0; int a, b; int i = 0; int x[1010] = {0}, y[1010] = {0}; scanf( %d %d , &n, &m); while (m-- > 0) { scanf( %d %d , &a, &b); y[a] = 1; x[b] = 1; } for (i = 2; i <= n - 1; i++) { if (x[i] == 0) sum++; ...

#include <bits/stdc++.h> using namespace std; int32_t main() { ios::sync_with_stdio(false); cin.tie(0); long long n, w; cin >> n >> w; vector<long long> arr(n); for (long long i = 0; i < n; ++i) cin >> arr[i]; vector<long long> runsum(n); long long min_elem = arr[0]; long long ma...

#include <bits/stdc++.h> using namespace std; void ASS(bool bb) { if (!bb) { ++*(int*)0; } } #pragma comment(linker, /STACK:106777216 ) int main() { int a, b, m; cin >> a >> b >> m; for (int i = 0; i < (int)(min(a + 1, m)); i++) { int x = i * (long long)1000000000 % m; x...

#include <bits/stdc++.h> using namespace std; int start, ed = 0, sz = 130000000; long long marked[(130000000 / 64) + 5]; vector<int> primes; inline bool check(int pos) { return !(marked[pos / 64] & (1LL << (pos % 64))); } int pos; bool isPrime(int n) { if (n != 2 and n % 2 == 0) return false; int ...

#include <bits/stdc++.h> using namespace std; struct node { int l, r; int num; } Treex[4000009], Treey[4000009]; map<int, int> vis; int i; int tot = 1; int Tot = 1; int x, y; char str[5]; void update_y(int ll, int rr, int c, int l, int r, int t) { if (ll <= l && r <= rr) Treey[t].n...

#include <bits/stdc++.h> using namespace std; const long long PINF = 1E9; const long long NINF = -1E9; const long long M = 1E9 + 7; const double EPS = 1E-9; const double PI = 2 * acos(0); void print_arr(const vector<long long> &a) { for (int i = 0; i < (int)a.size(); i++) cout << a[i] << ; cout...

#include <bits/stdc++.h> using namespace std; template <class T> inline T bigmod(T p, T e, T M) { long long ret = 1; for (; e > 0; e >>= 1) { if (e & 1) ret = (ret * p) % M; p = (p * p) % M; } return (T)ret; } template <class T> inline T gcd(T a, T b) { if (b == 0) return a; ...

#include <bits/stdc++.h> using namespace std; struct edge { int t, nxt; } e[600010]; int n, cnt, be[300010], mn_mx[300010], f, vid[300010], tot; void add(const int& x, const int& y) { e[++cnt].t = y, e[cnt].nxt = be[x], be[x] = cnt; } void dfs(const int& x) { if (!be[x]) return (void)(++tot, v...

#include <bits/stdc++.h> using namespace std; long long int mod = 1000000007; long long int MAX = 1e18; void solve() { long long int n; scanf( %lld , &n); long long int a[n]; vector<pair<long long int, long long int> > v(n), ans; for (long long int i = 0; i < n; i++) { long long int nu...

#include <bits/stdc++.h> using namespace std; int main() { long long int n, c = 0; cin >> n; long long int d; cin >> d; long long int s[n + 5]; for (long long int i = 0; i < n; i++) { cin >> s[i]; } sort(s, s + n); for (long long int i = 0; i < n - 1; i++) { for (long...

#include <bits/stdc++.h> using namespace std; long long power(long long x, long long y, long long p); inline int D() { int t; scanf( %d , &t); return t; } inline long long llD() { long long t; scanf( %lld , &t); return t; } const int N = 1e6 + 5; long long arr[N], cost[N]; int ...

#include <bits/stdc++.h> using namespace std; const int M = 1e6 + 20; struct Edge { int to, w, next; } edge[M]; int head[M], cnt, fa[M]; inline void add(int u, int v, int w) { edge[++cnt].to = v, edge[cnt].w = w, edge[cnt].next = head[u], head[u] = cnt; } long long mxp[M]; int val[M]; long l...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; int main() { int n; scanf( %d , &n); vector<vector<pair<int, int>>> a(n); for (int i = 0; i < n - 1; i++) { int u, v; scanf( %d %d , &u, &v); --u, --v; a[u].emplace_back(v, i); a[v].emplace_back(u, i...

#include <bits/stdc++.h> using namespace std; const int MAXN = 200010; const int MODD = 1000000007; struct Stop { int s, t; bool operator<(const Stop &ss) const { return t < ss.t; } } bus[MAXN]; int n, m, nn, dp[MAXN], sum[MAXN]; int main() { while (scanf( %d%d , &n, &m) != EOF) { map<in...

#include <bits/stdc++.h> const int N = 1e6; const long long mod = 998244353; const int INF = 0x7fffffff; const int inf = 0x3f3f3f3f; using namespace std; void exgcd(long long a, long long b, long long &x, long long &y) { if (b == 0) { x = 1; y = 0; return; } exgcd(b, a % b, y, ...

#include <bits/stdc++.h> using namespace std; int n, m, top, tot, cnt; int fir[202020], nxt[202020 << 1], to[202020 << 1]; int dfn[202020], fa[202020], st[202020]; struct evol { int v, nm; } l1[202020], l2[202020]; void add(int x, int y) { nxt[++cnt] = fir[x]; fir[x] = cnt; to[cnt] = y; ...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 10; int k, q; long long f[10], dp[maxn]; void update(long long v, long long w) { for (int i = 1000000; i >= w; i--) dp[i] = max(dp[i], dp[i - w] + v); return; } void solve(long long v, long long w) { int num = min((long long)...

#include <bits/stdc++.h> using namespace std; const int maxn = 500050; const long long inf = 1e18; int a[maxn]; vector<int> G[maxn]; int f[maxn][20], root; long long ans = 0; void dfs(int x, int par) { f[x][0] = par; long long t = inf; if (par) t = a[x] + a[par]; for (int i = 1; f[x][i -...

#include <bits/stdc++.h> using namespace std; double PI = 3.14159265358979323843; int BS(int arr[], int sz, int n) { int l = 0, r = sz - 1, mid; while (l <= r) { if (arr[mid] >= n) r = mid - 1; else l = mid + 1; } return l; } bool prime(long long x) { for (int i...

#include <bits/stdc++.h> using namespace std; int sta[10][100005]; int top[10]; int tail[10]; int a[100005][10]; int ans[10]; int main() { int n, m; int k; scanf( %d %d %d , &n, &m, &k); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { scanf( %d , &a[i][j]); ...

#include <bits/stdc++.h> using namespace std; const int imax = INT32_MAX; const int imin = INT32_MIN; const long long int inf = 1e18; const long long int MOD = 1e9 + 7; const long long int range = 1e9 + 7; vector<vector<int>> g; template <class T> T cal(T n) { return (n * 1ll * (n + 1)); } tem...

#include <bits/stdc++.h> using namespace std; int main() { string a, a2, a3; getline(cin, a); getline(cin, a2); getline(cin, a3); int lin1 = 0, lin2 = 0, lin3 = 0; for (int i = 0; i < a.size(); i++) { if (a[i] == e || a[i] == a || a[i] == i || a[i] == o || a[i] == u ...

#include <bits/stdc++.h> using namespace std; int main() { int x, t, a, b, da, db; cin >> x >> t >> a >> b >> da >> db; for (int i = 0; i < t; i++) for (int h = 0; h <= 1; h++) for (int j = 0; j < t; j++) for (int s = 0; s <= 1; s++) if (((a - (da * i)) * h) + ((b - (...

#include <bits/stdc++.h> using namespace std; void solve(); int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int times = 1; cin >> times; for (int i = 0; i < times; i++) { solve(); cout << n ; } return 0; } long long a, b, c, d, e, f, g, h; lo...

#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long LL_INF = 0x3f3f3f3f3f3f3f3f; const int maxn = 3e5 + 10; const int mod = 1e9 + 7; long long a[maxn]; int main() { long long n, m; scanf( %I64d%I64d , &n, &m); for (int i = 0; i < n; i++) { scanf( %I6...

#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; int a, x; long long ans = 0; map<vector<pair<int, int>>, int> mp; for (int i = 0; i < n; i++) { vector<pair<int, int>> v; cin >> a; for (int j = 2; j * j <= a; j++) { int pow = 0; ...

#include <bits/stdc++.h> using namespace std; int long long n, a, b, x = 4, y = 2, ans, m, ans1, ans2, ans3; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); cin >> m >> a >> b; while (x > 0 || y > 0) { ans++; n = m; while (x > 0 && n >= a) { ...

#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 1; vector<int> s[N], e[N]; int n, m, l[N], r[N], x[N], res[N]; bool vis[N]; int main() { scanf( %d%d , &n, &m); for (int i = 0; i < m; ++i) { scanf( %d%d%d , &l[i], &r[i], &x[i]); s[l[i]].push_back(i); e[r[i]].push_b...

#include <bits/stdc++.h> using namespace std; long long int i, j = 0, k, a, b; int main() { long long int n, m; cin >> n; long long int aa[n + 1]; for (i = 1; i <= n; i++) cin >> aa[i]; cin >> m; while (m--) { cin >> a >> b; if (a != 1) aa[a - 1] += b - 1; if (a != n) aa[...

#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int n = s.length(); int a[n + 2][3]; for (int i = 0; i < n + 1; i++) for (int j = 0; j < 3; j++) a[i][j] = 0; for (int k = 0; k < s.length(); k++) { if (s[k] == . ) continue; else if (s[...

#include <bits/stdc++.h> using namespace std; const int N = 400010; vector<int> g[N]; int pos[N], to[N]; int kw = 0, w[N]; void dfs(int v, int pr) { pos[v] = kw; w[kw++] = v; for (int j = 0; j < (int)g[v].size(); j++) { int u = g[v][j]; if (u != pr) { dfs(u, v); } }...

#include <bits/stdc++.h> using namespace std; long long mod = 1000000007; long long max(long long a, long long b) { return a > b ? a : b; } bool r(long long p1, long long p2) { return (p2 < p1); } long long min(long long a, long long b) { return a < b ? a : b; } long long gcd(long long a, long long b) { ...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; int n; string s; while (t--) { cin >> n >> s; int x = 0, y = 0; map<pair<int, int>, int> m; int l = 0, r = n + 1; m[{0, 0}] = 1; for (int i = 0; i < n; i++) { if (s[i] == L ) ...

#include <bits/stdc++.h> using namespace std; const long long N = 3e5 + 5; long long a[N], pos[N]; long long n; int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long t = 1; cin >> t; while (t--) { cin >> n; for (long long i = 1; i <= n; i++) cin...

#include <bits/stdc++.h> using namespace std; int n; int a[100500]; int b[200500]; int c[100500]; multiset<int> pl, mnus; int addpl, addmn; int main() { cin >> n; for (int i = 0; i < n; ++i) { cin >> a[i]; c[a[i]] = i; } for (int i = 0; i < n; ++i) { cin >> b[i]; ...

#include <bits/stdc++.h> using namespace std; string s[110 * 110]; vector<string> v; char sub(string s1, string s2) { int dem[30]; memset(dem, 0, sizeof(dem)); for (int i = 0; i < s1.size(); i++) dem[s1[i] - a ]++; for (int i = 0; i < s2.size(); i++) dem[s2[i] - a ]--; for (int i = 0; i <=...

#include <bits/stdc++.h> using namespace std; bool EulerianPathExists(const map<string, pair<int, int>>& in_out_degrees) { int different_in_out_count = 0; for (auto& key_val : in_out_degrees) { if (key_val.second.first != key_val.second.second) { ++different_in_out_count; if (different...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; long long max(long long a, long long b) { if (a > b) { return a; } else { return b; } } long long min(long long a, long long b) { if (a < b) { return a; } else { return b; } } long l...

#include <bits/stdc++.h> using namespace std; const int maxn = 110000; int n, q; map<pair<int, int>, int> M; int u[maxn], v[maxn]; int s[maxn], e[maxn]; vector<int> V[maxn << 4]; struct DSU { int fa[maxn], col[maxn], sz[maxn]; stack<pair<pair<int *, int>, int>> stk; int findfa(int x, int &va...

#include <bits/stdc++.h> using namespace std; const int N = 20; char s1[N], s2[N], ans[N]; int main() { scanf( %s%s , s1, s2); int n1 = strlen(s1), cnt = 0; ans[cnt++] = s1[0]; for (int i = 1; i < n1; i++) { if (s1[i] >= s2[0]) break; ans[cnt++] = s1[i]; } ans[cnt++] = s2[0];...

#include <bits/stdc++.h> using namespace std; long long mod = 998244353; long long fast_exp(long long a, long long b) { if (b <= 0) return 1; else { long long res = 1; res = fast_exp(a, b / 2); res = (res * res) % mod; if (b % 2 == 1) res = (res * a) % mod; return res; ...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); int n; cin >> n; int *sher = new int[n]; char d; for (int i = 0; i < n; i++) { cin >> d; sher[i] = d - 0 ; } int *mor = new int[n]; for (int i = 0; i < n; i++) { cin >> d; ...

#include <bits/stdc++.h> using namespace std; template <typename T> int sz(const T &a) { return (int)a.size(); } const int MAXN = 2e5 + 1; int arr[MAXN]; int fir[MAXN]; priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q; int main() { cin.tie(NULL); ios_...

#include <bits/stdc++.h> int main() { int i, j, t, n, a[20000], counto, counte; scanf( %d , &t); for (i = 1; i <= t; i++) { counto = 0, counte = 0; scanf( %d , &n); for (j = 0; j < n; j++) { scanf( %d , &a[j]); if (a[j] % 2 == 0) counte++; else ...

#include <bits/stdc++.h> using namespace std; const int maxn = 1000; int fs[100], ft[100]; char c[1050], s[100], t[100]; int dp[1050][100][100]; void GetNextval(char* p, int next[]) { int pLen = strlen(p); next[0] = -1; int k = -1; int j = 0; while (j < pLen) { if (k == -1 || p[j] ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 1e3 + 5; struct node { int l, r; } num[MAXN]; int cmp(node x, node y) { return x.r < y.r; } int main() { int N; vector<int> v; v.clear(); scanf( %d , &N); for (int i = 0; i < N; i++) { scanf( %d%d , &num[i].l, &num[...

#include <bits/stdc++.h> using namespace std; int main() { int x, i, p = 0, k = 0; cin >> x; char n[x + 1]; cin >> n; for (i = 0; i < x; i++) { if (n[i] == L ) p++; else k++; } cout << p + k + 1 << endl; }

#include <bits/stdc++.h> using namespace std; int a[2000], b[2000]; inline bool valid(int i, int j, pair<int, int> pii) { return i != pii.first && j != pii.second; } int main() { int n, m; scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d , &a[i]); scanf( %d , &m); for (int i = 0;...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 5; int sub_tree[maxn], n, T[maxn], P[maxn][22], L[maxn], par[maxn], ans[maxn], nn; set<int> adj[maxn]; void lca_dfs(int u, int p) { T[u] = p; L[u] = (p > -1) ? L[p] + 1 : 0; for (int s : adj[u]) { if (s == p) continue; ...

#include <bits/stdc++.h> using namespace std; const int maxn = 305; int n, m; inline int gi() { char c = getchar(); while (c < 0 || c > 9 ) c = getchar(); int sum = 0; while ( 0 <= c && c <= 9 ) sum = sum * 10 + c - 48, c = getchar(); return sum; } const int Maxn = 605, Maxm = Maxn ...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; const long double EPS = 1e-9; const long double PI = acos(-1); const long long INF = 1e18; const long long mod = 1e9 + 7; long long factorial(long long n) { if (n == 0) return 1; long long x = 1; for (long long i = 1; ...

#include <bits/stdc++.h> using namespace std; template <class A, class B> ostream &operator<<(ostream &os, pair<A, B> p) { return os << ( << p.first << , << p.second << ) ; } template <class A> ostream &operator<<(ostream &os, vector<A> v) { os << { ; for (auto &x : v) cout << x << ; ...

#include <bits/stdc++.h> using namespace std; const int maxn = 1000010; int n, x, tot = 0, Ans = 0, prime[maxn]; bool isprime[maxn]; map<int, int> sg, st; void init() { memset(isprime, true, sizeof(isprime)); isprime[1] = false; for (int i = 2; i < maxn; i++) { if (isprime[i]) prime[++tot]...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, m, k; cin >> n >> m >> k; int i = 0; while (k--) { int j = i; for (int h = 0; h < m; h++) { int x = h < n % m ? n / m + 1 : n / m; cout << x; ...

#include <bits/stdc++.h> const int kN = 100000 + 5; int n, parent[kN], type[kN]; std::vector<int> edges[2][kN]; int left[2][kN], right[2][kN], stmp; int top[2][kN]; void dfs(int color, int u, int root) { left[color][u] = ++stmp; top[color][u] = root; for (int v : edges[color][u]) { dfs(col...

#include <bits/stdc++.h> const int MaxN = 1 << 20; using namespace std; int dp[MaxN + 5]; char s[30][30]; int a[30][30], cost[30][30]; int bit[30][30]; int n, m; int main() { while (~scanf( %d%d , &n, &m)) { for (int i = 0; i < n; i++) scanf( %s , s[i]); for (int i = 0; i < n; i++) ...

#include <bits/stdc++.h> using namespace std; int n, m, k, src, dest, dist[100001], par[100001], mark[100001], vol[100001], vis[100001]; vector<int> v[100001]; vector<pair<int, int> > edge; vector<int> g[100001]; int reachable() { memset(vis, 0, sizeof vis); vis[src] = 1; queue<int> q; ...

#include <bits/stdc++.h> using namespace std; struct node { int left, right; int time[60]; node(int left = 0, int right = 0) : left(left), right(right) {} } arb[4 * 100000 + 5]; inline void unite(node &a, node b, node &c) { for (int i = 0; i < 60; i++) a.time[i] = b.time[i] + c.time[(i + b...

#include <bits/stdc++.h> int Fa[200010]; std::vector<int> v[200010]; int Find(int x) { return Fa[x] == x ? x : Fa[x] = Find(Fa[x]); } bool vis[200010]; inline void merge(int a, int b) { int f1 = Find(a), f2 = Find(b); if (f1 != f2) { Fa[f1] = f2; } } int main() { int n, m, q; sca...

#include <bits/stdc++.h> using namespace std; int main() { int c, a, b; cin >> a >> b >> c; cout << a * b * c - (a - 1) * (b - 1) * (c - 1); return 0; }

#include <bits/stdc++.h> using namespace std; long long int mod = 1000000007; long long int vi[100000], m, n, k, p1, p2, p3, p, f, t; long long int powmod(long long int a1, long long int b1) { long long int res = 1; a1 %= mod; for (; b1; b1 >>= 1) { if (b1 & 1) res = res * a1 % mod; a1 =...

#include <bits/stdc++.h> using namespace std; int main() { int k, n1, n2, n3, t1, t2, t3; cin >> k >> n1 >> n2 >> n3 >> t1 >> t2 >> t3; multiset<int> A, B, C; for (int i = 0; i < n1; ++i) A.insert(0); for (int i = 0; i < n2; ++i) B.insert(0); for (int i = 0; i < n3; ++i) C.insert(0); for...

#include <bits/stdc++.h> using namespace std; bool comp(const pair<int, int> &a, const pair<int, int> &b) { if (a.first > b.first) return true; if (a.first == b.first) return a.second > b.second; return false; } int main() { int n; scanf( %d , &n); vector<pair<int, int> > v; for (int...

#include <bits/stdc++.h> using namespace std; signed main() { long long n; cin >> n; long long arr[n]; for (long long i = 0; i < n; i++) { cin >> arr[i]; } long long c = 0; long long d = 0; long long e = 0; long long h; long long g; for (long long i = 0; i < n; i++)...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int n, i, j = 1, j2 = 0, j3, k, h = 1; string s; cin >> s; for (i = 1; i < s.length(); ++i) { if (j < h) j = h; if (h == s.length()) break; if (s[i - 1] != ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 123456; void pre(); void post(); int n; int mas[MAXN]; int solve[MAXN]; void read() { cin >> n; for (int i = 0; i < n; i++) { scanf( %lld , &mas[i]); solve[mas[i] - 1] = i; } } int main() { pre(); read(); ...

#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int streak = 0; int maxStreak = 0; char c = 2 ; for (int i = 0; i < s.length(); i++) { if (c != s[i]) { c = s[i]; streak = 0; } streak++; maxStreak = streak > maxStreak ? s...

#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } long long bigmod(long long base, long long power) { if (power == 0) return 1; long long ret = bigmod(base, power / 2); ret = (ret * ret) % 1000000007; if ...

#include <bits/stdc++.h> using namespace std; void __print(int x) { cerr << x; } void __print(long x) { cerr << x; } void __print(long long x) { cerr << x; } void __print(unsigned x) { cerr << x; } void __print(unsigned long x) { cerr << x; } void __print(unsigned long long x) { cerr << x; } void __prin...

#include <bits/stdc++.h> using namespace std; template <class T> inline void Read(T &x) { int f = 1; char t = getchar(); while (t < 0 || t > 9 ) { if (t == - ) f = -1; t = getchar(); } x = 0; while (t >= 0 && t <= 9 ) { x = x * 10 + t - 0 ; t = getchar(); ...

#include <bits/stdc++.h> using namespace std; int t, x, y, a, b; int main(void) { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> t; while (t--) { cin >> x >> y >> a >> b; int tmp = (y - x) / (a + b); if (x + tmp * a == y - tmp * b) cout << tmp << n ; else...

#include <bits/stdc++.h> using namespace std; int main() { set<int> a; int n, b, c; cin >> n; for (int i = 0; i < n; i++) { cin >> b; a.insert(b); } if (a.size() == 1) std::cout << 0 << endl; else if (a.size() == 2) { b = *a.begin(); c = *(--a.end()); ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 1000 * 100 * 3 + 10; long long int mod = 998244353; long long int x[MAXN]; long long int y[MAXN]; pair<long long int, long long int> p[MAXN]; long long int f(long long int n) { long long int m = 1; for (int i = 1; i <= n; i++) { ...

#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int N = 1000010; int T, n, m, flag, cnt; vector<int> e[N], E[N]; int dfn[N], idx = 0, low[N], bl[N], lb, sta[N], top; template <typename T> void gi(T &x) { x = 0; register char c = getchar(), pre = 0; for (; c < 0 ...

#include <bits/stdc++.h> using namespace std; const int N = (long long)(2 * 1e5) + 5; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); map<int, int> mp; int n; cin >> n; vector<int> a(n + 1), b(n + 1), p(n + 1); for (int i = 1; i <= n; i++) { cin >> a[i]; ...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int sum = 0; for (int i = 0; i < n; i++) { int x1, x2, y1, y2; cin >> x1 >> x2 >> y1 >> y2; sum += (max(x1, y1) - min(x1, y1) + 1) * (max(x2, y2) - min(x2, y2) + 1); } cout << sum << n ; retur...

#include <bits/stdc++.h> using namespace std; char buf[32]; int Solution() { int n, m; scanf( %d%d , &n, &m); vector<int> mas(n); for (int i = 0; i < n; ++i) scanf( %d , &mas[i]); sort(mas.begin(), mas.end()); map<string, int> fr; gets(buf); for (int i = 0; i < m; ++i) { gets...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; const int MOD = 1e9 + 7; long long dp[N][2]; void solve() { memset(dp, 0, sizeof(dp)); string a, b; cin >> a >> b; (a == b ? dp[0][1] = 1 : dp[0][0] = 1); int k; cin >> k; long long way_good = 0, way_bad = 0; ...

#include <bits/stdc++.h> using namespace std; long long a[100005]; void solve() { long long n, k; cin >> n >> k; if (n == k) { cout << -1 << endl; return; }; if (k == 0) { cout << n << ; for (__typeof((n)) i = (1); i < (n); i++) cout << i << ; return; } ...

#include <bits/stdc++.h> using namespace std; set<pair<int, int> > vis; int mx[8] = {-2, -2, -1, -1, 1, 1, 2, 2}; int my[8] = {-1, 1, -2, 2, -2, 2, -1, 1}; int main() { long long K; int N; cin >> K >> N; for (int i = 0; i < N; i++) { int x, y; cin >> x >> y; vis.insert(pair<i...

#include <bits/stdc++.h> using namespace std; void fast() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } int main() { fast(); long long n; cin >> n; if (n % 4 == 1) cout << 0 << << A << endl; else if (n % 4 == 0) cout << 1 << << A ...

#include <bits/stdc++.h> int min(int a, int b) { return a < b ? a : b; } int max(int a, int b) { return a > b ? a : b; } int oo[1 + (50 + 50 * 26 + 26) * 2], oh[1 + (50 + 50 * 26 + 26) * 2]; int link(int o, int h) { static int _ = 1; oo[_] = o, oh[_] = h; return _++; } int ii[(50 + 50 * 26 + 26)...

#include <bits/stdc++.h> using namespace std; long long t, n; long long qpow(long long a, long long b) { long long x = 1, base = a; while (b) { if (b & 1) { x = (x * base) % 1000000007; } base = (base * base) % 1000000007; b >>= 1; } return x % 1000000007; } int...

#include <bits/stdc++.h> using namespace std; bool check(int a, int b, int frst, int s) { return a * frst / (double)s >= (double)b; } int main() { int n, a, b, *arr; cin >> n >> a >> b; arr = new int[n]; for (int i = 0; i < n; i++) { cin >> arr[i]; } sort(arr + 1, arr + n); ...

#include <bits/stdc++.h> using namespace std; int dcmp(double p) { if (abs(p) < 1e-10) return 0; return p > 1e-10 ? 1 : -1; } struct Point { double x, y; Point() {} Point(double x, double y) : x(x), y(y) {} friend Point operator+(const Point &a, const Point &b) { return Point(a.x +...

#include <bits/stdc++.h> using namespace std; const int Maxn = 100020; int n, q; int a[Maxn]; int pre[Maxn], fin[Maxn], rel[Maxn]; int tree[Maxn << 2]; vector<int> V; int getid(int x) { return lower_bound(V.begin(), V.end(), x) - V.begin() + 1; } void add(int tar, int w, int l, int r, int x) { if ...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:102400000,102400000 ) using namespace std; const int INF = 0x3f3f3f3f; template <typename X> inline bool minimize(X& p, X q) { if (p <= q) return 0; p = q; return 1; } template <typename X> inline bool maximize(X& p, X q) { if (p >...

#include <bits/stdc++.h> using namespace std; int i, dp[100000], t; string s; int main() { cin >> s; for (i = 0; i < s.size(); i++) if (s[i] >= a ) { dp[i] = dp[i - 1]; t++; } else dp[i] = min(dp[i - 1] + 1, t); cout << dp[s.size() - 1] << endl; return 0; }...

#include <bits/stdc++.h> using namespace std; int nbPairs[5001][5001]; const int MOD = 1e9 + 7; int main() { char s[5001], t[5001]; scanf( %s%s , &s, &t); int ss = strlen(s), st = strlen(t); for (int is = ss - 1; is >= 0; is--) for (int it = st - 1; it >= 0; it--) { if (s[is] == t[...

#include <bits/stdc++.h> using namespace std; const long double eps = 1e-9; const int inf = (1 << 30) - 1; const long long inf64 = ((long long)1 << 62) - 1; const long double pi = 3.1415926535897932384626433832795; const string task = ; template <class T> T sqr(T first) { return first * first; }...

#include <bits/stdc++.h> using namespace std; const int MAXN = 2000005; char str[MAXN]; struct Palindromic_Tree { vector<pair<int, int>> next[MAXN]; int fail[MAXN]; int cnt[MAXN]; int num[MAXN]; int len[MAXN]; int S[MAXN]; int last; int n; int p; int newnode(int l) { ...