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 n; struct edge { int v, next; } e[500100]; int head[100100], tot = 0; void Add(int u, int v) { e[tot].v = v; e[tot].next = head[u]; head[u] = tot++; } int res[100100]; int deep[100100]; int vis[100100]; void DFS(int u) { vis[u] ...
#include <bits/stdc++.h> using namespace std; vector<long long> v; long long x, y, z, a, b, c, sum, ans, total, t, cnt, n, m, k, p, kase; string s1, s2; map<long long, long long> mp; set<long long> s; map<long long, long long>::iterator itr1, ptr1; set<long long>::iterator itr, ptr; int main() { a...
#include <bits/stdc++.h> using namespace std; int read() { int num = 0; bool f = 0; char ch = getchar(); while (ch < 0 \|\| ch > 9 ) { f = (ch == - ); ch = getchar(); } while (ch >= 0 && ch <= 9 ) { num = (num << 1) + (num << 3) + ch - 0 ; ch = getchar(); } ...
#include <bits/stdc++.h> using namespace std; const int AS = 26; struct vertex { int next[AS]; bool leaf = false; multiset<int> st; int mx = 0; int p = -1; int length = 0; char pch; int link = -1; int elink = -1; int go[AS]; vertex(int p = -1, char ch = $ ) : p(p), pch...
#include <bits/stdc++.h> using namespace std; int main() { int n, b, a[200000], x[200000]; cin >> n; cin >> b; x[0] = 0; a[0] = b; for (int i = 1; i < n; i++) { cin >> b; x[i] = max(x[i - 1], a[i - 1]); a[i] = b + x[i]; } for (int i = 0; i < n; i++) cout << a[i] << ...
#include<bits/stdc++.h> using namespace std; typedef long long int ll; ll mod=1e9+7; ll get(ll x,ll y) { ll z; cout<< ? <<x<< <<y<<endl; cin>>z; return z; } int main() { #ifndef ONLINE_JUDGE freopen( input.txt , r ,stdin); freopen( output.txt , w ,std...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; template <typename T> void uin(T &a, T b) { if (b < a) a = b; } template <typename T> void uax(T &a, T b) { if (b > a) a = b; } const long long maxn = 1000 * 1000 + 228; long long n, k; long long dp[maxn], p[maxn];...
#include <bits/stdc++.h> using namespace std; const int K = 105; const int N = (int)1e4 + 100; int c[N]; long double dp[K][N]; long double C[K][K]; long double fact[K]; int main(int, char *) { fact[0] = 1; for (int i = 0; i < K; i++) { if (i != 0) fact[i] = fact[i - 1] i; C[i][0] ...
#include <bits/stdc++.h> using namespace std; int cnt1[5001] = {0}; int cnt2[5001][5001] = {0}; vector<int> p[5001]; int cnt[5001] = {0}; int solve() { int n, q; cin >> n >> q; vector<pair<int, int>> v; for (int j = 0; j < q; j++) { int l, r; cin >> l >> r; v.push_back({l, ...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 10; long long M[maxn << 2], tag[maxn << 2]; void gather(int p) { M[p] = max(M[p << 1], M[p << 1 \| 1]); } void push(int p) { if (tag[p]) { tag[p << 1] += tag[p]; tag[p << 1 \| 1] += tag[p]; M[p << 1] += tag[p]; M[p ...
#include <bits/stdc++.h> using namespace std; int n; void draw(int k) { for (int i = 0; i < n - k; i++) { cout << ; } for (int i = 0; i < k; i++) { cout << i << ; } for (int i = k; ~i; i--) { cout << i << (i ? : n ); } } int main() { cin >> n; for...
#include <bits/stdc++.h> using namespace std; const int MM = 2e4 + 5; struct Node { int l, r, lz, mx; } seg[MM * 4]; int n, m, k, dp[55][MM], a[55][MM], b[55][MM]; void build(int u, int l, int r, int i) { seg[u].l = l; seg[u].r = r; seg[u].lz = 0; if (l == r) { seg[u].mx = dp[i - 1...
#include <bits/stdc++.h> using namespace std; const int INF = 2e9, N = 101; int n, m, q, tot, a[N], b[N]; int vis[N]; bool solve(int pos) { memset(vis, 0, sizeof(vis)); for (int i = pos; i < pos + tot; i++) vis[a[i]]++; for (int i = 1; i < m + 1; i++) if (vis[i] != b[i]) return 0; return...
#include <bits/stdc++.h> using namespace std; const int maxx = 2e5 + 10; char s[maxx], t[maxx]; int l[maxx], r[maxx]; int main() { cin >> s >> t; int m = strlen(s); int n = strlen(t); int a = 0, b = 0; for (int i = 0; i < m; i++) { if (s[i] == t[a]) { l[a] = i; a++; ...
#include <bits/stdc++.h> using namespace std; constexpr int MAXWHITE = 20; constexpr int MINBLACK = 40; int64_t dp[110][MAXWHITE + 5][MINBLACK + 5]; int vis[110]; int par[110]; vector<vector<int>> adj; int N, K; int64_t MOD = (int64_t)1e9 + 7LL; int64_t Get(int u, int max_white, int min_black) { ...
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 5; const int dx[4] = {1, -1, 0, 0}; const int dy[4] = {0, 0, 1, -1}; int read() { int s = 0; char c = getchar(), lc = + ; while (c < 0 \|\| 9 < c) lc = c, c = getchar(); while ( 0 <= c && c <= 9 ) s = s * 10 + c - 0 , c = ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 212345, MAXL = 20, INF = 1123456789; vector<int> grafo[MAXN], peso[MAXN]; int dp[MAXN][MAXL], mx[MAXN][MAXL], dist[MAXN], prof[MAXN]; long long int pmst; pair<int, pair<int, int> > ar[MAXN]; int lca(int a, int b) { int resp = 0; if (pr...
#include <bits/stdc++.h> using namespace std; int tree[500005 << 2]; struct P { int x, y, z; int id; } p[500005]; bool cmp1(P a, P b) { if (a.x != b.x) return a.x > b.x; else if (a.y != b.y) return a.y > b.y; else return a.z > b.z; } bool cmp2(P a, P b) { return a.y <...
#include <bits/stdc++.h> using namespace std; const int N = 200009; int a[N], pos[N]; int main() { int n; cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= n; i++) { int x; cin >> x; pos[x] = i; } for (int i = 1; i <= n; i++) a[i] = pos[a[i]]; ...
#include <bits/stdc++.h> const int MAX = 1e6 + 105; const int INF = 1e9 + 5; const double M = 4e18; using namespace std; const int MOD = 1e9 + 7; const double eps = 0.000000001; int n, k; bool query(int x, int y) { if (x < 0 \|\| y > n) return false; string re; cout << 1 << << x << << ...
#include <bits/stdc++.h> using namespace std; const long long mod = 998244353; signed main() { cin.tie(0); std::ios_base::sync_with_stdio(0); long long n; cin >> n; long long cnt = 10; vector<long long> ans; ans.push_back(10); if (n < 2) { cout << 10; return 0; } ...
#include <bits/stdc++.h> using namespace std; inline long long read() { register long long data = 0, w = 1; char ch = 0; while (ch != - && (ch < 0 \|\| ch > 9 )) ch = getchar(); if (ch == - ) w = -1, ch = getchar(); while (ch >= 0 && ch <= 9 ) data = (data << 1) + (data << 3) + (ch ...
#include <bits/stdc++.h> using namespace std; int main() { long long n, k, i, l; cin >> n >> k; string s; cin >> s; long long max = 0; for (i = 1; i < n; i++) { long long temp = 0; for (l = 0; l < n; l++) { if (i + l < n) { if (s[i + l] == s[l]) { te...
#include <bits/stdc++.h> using namespace std; inline void speed() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } int compare(pair<long long int, long long int> a, pair<long long int, long long int> b) { return a.first > b.first; } int main() { speed();...
#include <bits/stdc++.h> using namespace std; const int N = 300005; const int MD = 1000000007; int n, a[N]; long long s[N], k; int ft[N]; long long all[N]; int gt(int first) { int res = 0; for (int i = first; i >= 0; i &= i + 1, --i) res += ft[i]; return res; } void upd(int first, int v)...
#include <bits/stdc++.h> using namespace std; bool F[2001][2001]; bool D[2001][2001]; int C[2001]; vector<int> V[2001]; int n; void f(int v, int c) { if (C[v]) return; C[v] = c; V[c].push_back(v); for (int i = 1; i <= n; ++i) if (F[v][i]) f(i, c); } int main() { ios_base::syn...
#include <bits/stdc++.h> using namespace std; int a[5010], n, s = 0, i; int main() { cin >> n >> i; for (i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); for (i = 0; i < n; i++) s += a[i] != a[(i + n / 2) % n]; cout << s << endl; for (i = 0; i < n; i++) cout << a[i] << << a[(i + n / 2) ...
#include <bits/stdc++.h> using namespace std; template <typename T1, typename T2> void chkmin(T1 &x, T2 y) { if (x > y) x = y; } template <typename T1, typename T2> void chkmax(T1 &x, T2 y) { if (x < y) x = y; } namespace fastio { char rbuf[1 << 23], p1 = rbuf, p2 = rbuf, wbuf[1 << 23], *p3 ...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> v(n); for (int i = 0; i < n; i++) cin >> v[i]; map<int, vector<pair<int, int> > > mapa; for (int i = 0; i < n; i++) { int suma = 0; for (int j = i; j < n; j++) { suma += v[j]; ...
#include <bits/stdc++.h> using namespace std; inline bool invowel(char ch) { ch = tolower(ch); return (ch == a \|\| ch == e \|\| ch == i \|\| ch == o \|\| ch == u ); } inline bool isprime(int n) { if (n < 2 \|\| (n % 2 == 0 && n != 2)) return false; for (int i = 3; i * i <= n; i += 2) if (n...
#include <bits/stdc++.h> using namespace std; int main() { long long r; cin >> r; vector<long long> ans; for (int i = 1; i < sqrt(r); i++) { long long rem = r - ((i * i) + i + 1); if (rem % 2 == 0 && rem > 0) { ans.push_back(i); ans.push_back(rem / 2); break; ...
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 10, mod = 1e9 + 7; int n, m, k, t; char a[maxn]; long long h[maxn], h1[maxn], xp[maxn]; long long get(long long h[], int pos, int len, int len1) { return (h[pos + len - 1] - h[pos - 1] * xp[len1] % mod + mod) % mod; } int cnt[maxn]...
#include <bits/stdc++.h> using namespace std; long long n, m, k; vector<vector<pair<long long, long long>>> graph; long long ok[10][10]; long long fine[10][10][10][10]; bitset<(long long)(2e5 + 5)> incoming[10][10]; long long answer = 0; vector<long long> temp; void dfs() { if (temp.size() == k) {...
#include <bits/stdc++.h> using namespace std; void fast() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } void in(long long int a, long long int n) { for (long long int i = 0; i < n; i++) { cin >> a[i]; } } void out(long long int a, long long int n) { for...
#include <bits/stdc++.h> using namespace std; int kol[10], ans = -1, ans0 = 0; vector<int> a, b; int main() { memset(kol, 0, sizeof(kol)); char c; while (cin >> c) kol[c - 0 ]++; for (int i = 1; i < 10; i++) { vector<int> c, d; int K1[10], K2[10], res = 0, nul = 0; for (int j ...
#include <bits/stdc++.h> using namespace std; int main() { int t; long n, k; cin >> t; while (t--) { cin >> n >> k; bool win = true; if (k % 3 == 0) { int np = n % (k + 1); if (np % 3 == 0 && np != k) win = false; } else { int np = n % 3; if (n...
#include <bits/stdc++.h> using namespace std; const int maxn = 1010, max_range = 1000001; int edge[maxn][3 * maxn], reached[maxn], start[3 * maxn], len[3 * maxn], vert[3 * maxn][2], n, m, res; FILE *in; int nb(int v, int e) { if (vert[e][0] == v) return vert[e][1]; else return vert[e...
#include <bits/stdc++.h> using namespace std; struct pt { int x, y; pt() {} pt(int x, int y) : x(x), y(y) {} }; int get_pos(int i, int n) { if (i >= n) i -= n; return ((i >= 0) ? i : n - i - 1); } void solve() { int n; cin >> n; vector<pt> v(n); for (int i = 0; i < n; ++i...
#include <bits/stdc++.h> using namespace std; map<long long, long long> mp1, mp2; long long n, k; long long a[200001]; int main() { ios_base::sync_with_stdio(false); cin >> n >> k; long long res = 0; for (int i = 1; i <= n; ++i) cin >> a[i]; for (int i = n; i >= 1; --i) { res += mp1[...
#include <bits/stdc++.h> using namespace std; template <typename T> inline void in(T &x) { bool f = 0; x = 0; char c = getchar(); while ((c < 0 \|\| c > 9 ) && c != - ) c = getchar(); if (c == - ) { f = 1; c = getchar(); } while (c >= 0 && c <= 9 ) { x = x * 10 ...
#include <bits/stdc++.h> int main() { int k, x, n; scanf( %d %d , &n, &k); int p = k; while (p >= 1) { x = k * n / p + p; if (n == ((x / k) * (x % k))) break; p--; } printf( %d , x); }
#include <bits/stdc++.h> inline long long read() { long long x = 0; char c = getchar(), f = 1; for (; c < 0 \|\| 9 < c; c = getchar()) if (c == - ) f = -1; for (; 0 <= c && c <= 9 ; c = getchar()) x = x * 10 + c - 0 ; return x * f; } inline void write(long long x) { static cha...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int left[n], right[n]; int leftOpen = 0, leftClose = 0, rightOpen = 0, rightClose = 0; for (int i = 0; i < n; i++) { cin >> left[i]; cin >> right[i]; if (left[i]) leftOpen += 1; else ...
#include <bits/stdc++.h> using namespace std; int a[202020], f[202020]; int s[202020]; bool br[202020]; int n, doe, ans; int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %d , &a[i]), ++f[a[i]]; doe = 1; while (f[doe] != 0) ++doe; for (int i = 1; i <= n; ++i) { if (...
#include <bits/stdc++.h> using namespace std; struct ljb { int dest, flow, cost; ljb next, other; }; int n, s, ans1, ans2, flag[10000], cost[10000], flow[10000], u[100000], hh[10000], lim[10000]; ljb p, head[10000], tail[10000], hu[10000]; string ct, cs[10000]; void push(int x, int y, ...
#include <bits/stdc++.h> using namespace std; int N; void ro(vector<string> &b) { vector<string> c(N, string(N, )); for (int i = 0; i < N; i++) { for (int j = N - 1; j >= 0; j--) { c[N - 1 - j][i] = b[i][j]; } } b = c; } void fl(vector<string> &b) { reverse(b.begin(), b....
#include <bits/stdc++.h> using namespace std; const int M = 100005; int read() { int x = 0, flag = 1; char c; while ((c = getchar()) < 0 \|\| c > 9 ) if (c == - ) flag = -1; while (c >= 0 && c <= 9 ) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar(); return x * flag; } int...
#include <bits/stdc++.h> using namespace std; template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& _p) { return os << ( << _p.first << , << _p.second << ) ; } template <typename T> ostream& operator<<(ostream& os, const vector<T>& _V) { bool f = true; os << ...
#include <bits/stdc++.h> using namespace std; template <class Int> Int MAX(Int a, Int b) { return (a > b) ? a : b; } template <class Int> Int MIN(Int a, Int b) { return (a < b) ? a : b; } const double PI = 2 * acos(0.0); const int INF = 1 << 30; int main(void) { int l, d, v, g, r; do...
#include <bits/stdc++.h> using namespace std; inline int two(int n) { return 1 << n; } inline int test(int n, int b) { return (n >> b) & 1; } inline void set_bit(int& n, int b) { n \|= two(b); } inline void unset_bit(int& n, int b) { n &= ~two(b); } inline int last_bit(int n) { return n & (-n); } inline in...
#include <bits/stdc++.h> using namespace std; using pii = pair<int, int>; using ll = long long; int kmp(string const& s) { int n = s.size(); vector<int> lps(n, 0); for (int i = 1; i < n; i++) { int j = lps[i - 1]; while (j > 0 && s[i] != s[j]) j = lps[j - 1]; if (s[i] == s[j]) j++;...
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { if (b == 0) return a; else { return gcd(b, a % b); } } int main() { multiset<long long> s; multiset<long long>::iterator it; long long n, arr[100000], i, ache = 0, Max = -1, z, churi1, chu...
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { return b == 0 ? abs(a) : gcd(b, a % b); } long long lcm(long long a, long long b) { return a / gcd(a, b) * b; } long long div_count(long long n) { long long cunt = 0; while (n > 1) { if (n % 2 == 0) { ...
#include <bits/stdc++.h> using namespace std; template <class T> inline int size(const T& c) { return c.size(); } template <class T> inline int length(const T& c) { return c.length(); } unsigned long long l, r, k, m; vector<unsigned long long> can; struct matrix { unsigned long long val[...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; string s[n]; for (int i = 0; i < n; i++) { cin >> s[i]; bool b = false; if (i == 0) { cout << NO << endl; continue; } for (int j = 0; j < i; j++) { if (s[j] == s[i]) { ...
#include <bits/stdc++.h> using namespace std; int main() { int n; long long p; cin >> n >> p; vector<pair<long long, int> > ar; vector<long long> ans(n); for (int i = 0; i < n; i++) { long long x; cin >> x; ar.push_back(make_pair(x, i)); } sort(ar.begin(), ar.end())...
#include <bits/stdc++.h> using namespace std; int main() { int t, n; cin >> t; while (t--) { int n, m, aux1, aux2; int q; cin >> q; string ans = ; vector<pair<int, int> > v; for (int i = 0; i < q; i++) { cin >> n >> m; v.push_back(make_pair(n, m)); ...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 5; const int mod = 998244353; unsigned long long p[55]; unsigned long long f[55]; int d[55], to[55], used[55]; void upd(unsigned long long &x, unsigned long long y, unsigned long long w) { if ((double)y * w > 2e18) x += 2e18; ...
#include <bits/stdc++.h> using namespace std; const int maxn = 22, maxm = (1 << 21) + 5; int n, plc[maxm]; unsigned long long a[maxm], b[maxm], c[maxn]; char s[maxm]; void FMT(unsigned long long *a, int sgn) { for (int i = 0; i < n; i++) for (int j = 0; j < (1 << n); j++) if (!(j & (1 << i...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:60000000 ) using namespace std; const int MAXN = 10 + 100000; const int INF = int(1e9); const int m = 4; int k, t, d; int a[5][5], i, j, n; void nhap() { scanf( %d , &n); for (int i = (1), _b = (m); i <= m; ++i) scanf( %d%d%d%d , &a[...
#include <bits/stdc++.h> using namespace std; int dx[8] = {-1, -1, -1, 0, 1, 1, 1, 0}; int dy[8] = {-1, 0, 1, 1, 1, 0, -1, -1}; const int N = 100005; struct mes { char c; int id; }; int n, m; bool no[N]; mes all[N]; int p[N]; int main() { scanf( %d%d , &n, &m); for (int i = 0; i < ...
#include <bits/stdc++.h> using namespace std; vector<vector<int> > c(6, vector<int>(4, 0)); bool full[6]; bool polu[6]; int main() { ios_base::sync_with_stdio(0); cin.tie(nullptr); for (int i = 0; i < 6; ++i) { bool was[7] = {}; for (int j = 0; j < 4; ++j) { cin >> c[i][j]; ...
#include <bits/stdc++.h> using namespace std; const int N = 200005; using ll = long long; struct TNode { int l, r; ll v; } t[N << 2]; inline int lc(int pos) { return pos << 1; } inline int rc(int pos) { return pos << 1 \| 1; } int a[N], n, m; ll sum[N], lazy[N << 2]; inline void pushup(int po...
#include <bits/stdc++.h> using namespace std; int n, m, a[5010], b[5010], d[110][110]; double mat[110][110], res[110], flow[110][110], c[5010], ans; bool used[110]; void input() { memset(flow, 0x7f, sizeof(flow)); cin >> n >> m; for (int i = 0; i < m; ++i) { cin >> a[i] >> b[i] >> c[i]; ...
#include <bits/stdc++.h> using namespace std; long long n, d[40005], v[4005], p[4005], cur, val, use[4005], cnt; int main() { cin >> n; for (int i = 1; i <= n; ++i) cin >> v[i] >> d[i] >> p[i]; for (int i = 1; i <= n; ++i) if (!use[i]) { cur = v[i]; for (int j = i + 1; j <= n; ++...
#include <bits/stdc++.h> using namespace std; #define inf 1e15 #define mod 1000000007 #define N 100001 #define ll long long int #define vint vector<int> #define vll vector<ll> #define vstr vector<string> #define vvint vector<...
#include <bits/stdc++.h> using namespace std; int sumdigs(int x) { int c = 0; while (x) { c += x % 10; x /= 10; } return c; } int main() { int a; cin >> a; if (sumdigs(a) % 4 == 0) cout << a; else { for (int i = a; i < 1000000; i++) { if (sumdigs(i...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e3 + 5; int n, m, k; int a[maxn], c[maxn]; int ans, tmp, cnt, rt, sum, ma; int flag; char s[maxn]; bool ok[maxn]; vector<int> vc[maxn], vv[maxn]; template <typename T> inline void read(T &X) { X = 0; int w = 0; char ch = 0...
#include <bits/stdc++.h> using namespace std; template <class T> inline void si(T &x) { register int c = getchar(); x = 0; int neg = 0; for (; ((c<48 \| c> 57) && c != - ); c = getchar()) ; if (c == - ) { neg = 1; c = getchar(); } for (; c > 47 && c < 58; c = getchar...
#include <bits/stdc++.h> using namespace std; const int INF = 0x3F3F3F3F; const long long INF_LL = 0x3F3F3F3F3F3F3F3FLL; const int N = 4e5 + 50; bool check(const string &s, const string &t) { int match = 0; for (int i = 0; i < s.size() && match < t.size(); ++i) { if (s[i] == t[match]) ++match; ...
#include <bits/stdc++.h> using namespace std; const int N = 4e5 + 10, LOG = 20; int n, q, F[N], T[N], P[N], D[N], Par[LOG][N]; pair<int, int> Q[N]; vector<int> Adj[N], Ap[N], V[N << 2]; void Pre(int v) { for (int i = 1; i < LOG; i++) Par[i][v] = Par[i - 1][Par[i - 1][v]]; for (auto X : Adj[v]) ...
#include <bits/stdc++.h> using namespace std; using ll = long long; template <class T> void chkmin(T &x, const T &y) { if (y < x) { x = y; } } template <class T> void chkmax(T &x, const T &y) { if (y > x) { x = y; } } template <class T> void sort(vector<T> &a) { sort(...
#include <bits/stdc++.h> using namespace std; int n, i, k, u, v, cnt; int head[300005], a[300005]; long long f[300005], ans; struct ff { int to, nxt; } e[2 * 300005]; int fast() { int res = 0, fl = 1; char c = getchar(); while (c < 48 \|\| c > 57) { if (c == - ) fl = -1; c = get...
#include <bits/stdc++.h> using namespace std; int main() { int n, m; bool flag = true; while (cin >> n >> m) { for (int i = 0; i < n; i++) { for (int j = 1; j <= m; j++) { if (i % 2 && j < m && flag) cout << . ; else if (i % 2 && j == m && flag) ...
#include <bits/stdc++.h> using namespace std; const int max_x = 1000, inf = 1000111222; const int max_bal = 2222; const int sd = max_bal / 2; int a; pair<int, pair<int, int>> par[max_x][max_bal]; bool dp[max_x][max_bal]; int get_sum(int x) { int sum = 0; while (x) { sum += x % 10; x ...
#include <bits/stdc++.h> using namespace std; long long int INF = 1000000000; vector<vector<int> > v; int* dist; void bfs(int ver, int n) { bool vis[n]; for (int i = 0; i < n; i++) vis[i] = false; vis[ver] = true; queue<pair<int, int> > q; q.push(make_pair(ver, 0)); while (!q.empty()) ...
#include <bits/stdc++.h> using namespace std; int n; int arr[100005]; int ans[100005][3], alen; struct node { int n, cnt; bool friend operator<(node a, node b) { return a.cnt < b.cnt; } } n1, n2, n3; priority_queue<node> qu; int blen = 0; int main() { scanf( %d , &n); int i, j; for...
#include <bits/stdc++.h> using namespace std; int main() { int n = 6; int x, f[12] = {0}; for (int i = 0; i < n; i++) { cin >> x; f[x]++; } bool res = 0; for (int i = 0; i < 10; i++) { if (f[i] >= 4) { res = 1; f[i] -= 4; for (int j = 0; j < 10; j++)...
#include <bits/stdc++.h> using namespace std; int main() { int n, m = 0, m1 = 0, l, q[1000], t; cin >> n; for (int i = 0; i < n; i++) { cin >> q[i]; } cin >> t; sort(q, q + n); for (int i = 0; i < n; i++) { l = 1; for (int j = i + 1; j < n; j++) { if (q[j] - q[i...
#include <bits/stdc++.h> using namespace std; void debug_out() { cerr << n ; } template <typename H, typename... T> void debug_out(H h, T... t) { cerr << << (h); debug_out(t...); } int n; string a, b; char flip(char ch) { return (char)( 0 + ( 1 - ch)); } char ch(int i, int cnt) { retur...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; if (n < 998) cout << n + 2; else cout << n - 2; }
#include <bits/stdc++.h> using namespace std; struct Edge { int u, v, w; }; const int N = 500005; int n, m, q; Edge edge[N]; vector<int> sorted_edge[N]; vector<pair<int, vector<int>>> query[N]; bool npos[N]; int par[N], rnk[N]; vector<int> rnk_roll, par_roll; void init() { for (int i = 1...
#include <bits/stdc++.h> using namespace std; long long points[1002][2]; long long circle[1002][3]; vector<long long> tree[1002]; bool mark[1002]; vector<long long> paths[1002]; long long inside[1002]; long long dist2(long long a, long long b, long long c, long long d) { return (a - c) * (a - c) + (...
#include <bits/stdc++.h> using namespace std; long long mod(long long x, long long MOD) { if (x > MOD) x -= MOD; return x; } long long _ceil(long long x, long long y) { return x / y + (x % y != 0); } void wrt() { cout << n ; return; } template <typename T1, typename... T2> void wrt(T1 ...
#include <bits/stdc++.h> using namespace std; template <class T> inline T INT_LEN(T v) { int len = 1; while (v /= 10) ++len; return len; } int t1, t2, x1, x2, t0; int less_than(double va, double vb) { return va <= vb + 1e-10; } int binary_found(int lt, int rt, int y2, double &pre) { int y1...
#include <bits/stdc++.h> using namespace std; template <typename T, typename U> inline void smin(T &a, U b) { if (a > b) a = b; } template <typename T, typename U> inline void smax(T &a, U b) { if (a < b) a = b; } inline void gn(long long &first) { int sg = 1; char c; while (((c = ge...
#include <bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 5; const long long MOD = 998244353; int n, k; vector<int> a, b; long long ans[MAXN][3][5]; bool found[MAXN][3][5]; long long mul(long long a, long long b) { return (a * b) % MOD; } long long dp(int pos, int last, int var) { if (p...
#include <bits/stdc++.h> using namespace std; void FastIO() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); } stack<pair<int, int> > stk; string ip; int length; int main() { FastIO(); cin >> ip; length = ip.length(); int prev[length + 10], open[length + 10]; ...
#include <bits/stdc++.h> using namespace std; int main() { int t, i; cin >> t; while (t--) { int flag = 0; string s, t, p; cin >> s >> t >> p; int a[26] = {0}; if (s.length() > t.length()) { flag = 0; } else { for (i = 0; i < min(t.length(), s.length()...
#include <bits/stdc++.h> using namespace std; struct Maxflow { static const int MAXV = 20010; long long INF = 1000000000000000ll; struct Edge { int v, r; long long c; Edge(int _v, long long _c, int _r) : v(_v), c(_c), r(_r) {} }; int s, t; vector<Edge> G[MAXV * 2]; int ...
#include <bits/stdc++.h> using namespace std; const long long M = 1e8; int main() { long long n, i, j; cin >> n; vector<long long> ara; for (i = 0; i < n; i++) { cin >> j; ara.push_back(j); } long long pre1[n + 1]; long long pre2[n + 1]; pre1[0] = 0; pre2[0] = 0; ...
#include <bits/stdc++.h> using namespace std; template <typename A, typename B> string to_string(pair<A, B> p); template <typename A, typename B, typename C> string to_string(tuple<A, B, C> p); template <typename A, typename B, typename C, typename D> string to_string(tuple<A, B, C, D> p); string to_str...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10, mod = 1e9 + 7; int k, n, sz, last; char s[N]; string ret; long long cnt[2 * N], dp[2 * N]; char inp[N]; struct state { int link, len, next[26]; }; state st[2 * N]; bool vis[2 * N]; void sa_init() { st[0].len = 0; s...
#include <bits/stdc++.h> using namespace std; int a[100010], b[100010]; map<string, bool> mark; bool word(char a) { if (a >= a and a <= z ) return true; if (a >= A and a <= Z ) return true; return false; } int main() { int n; cin >> n; string a; cin >> a; int ind = 0; ...
#include <bits/stdc++.h> using namespace std; const long long INF = 1e18; const long long MOD = 1e9 + 7; template <class T> inline void chmax(T &a, const T &b) { if ((a) < (b)) (a) = (b); } template <class T> inline void chmin(T &a, const T &b) { if ((a) > (b)) (a) = (b); } template <typenam...
#include <bits/stdc++.h> using namespace std; template <typename T, typename U> inline void smin(T &a, const U &b) { if (a > b) a = b; } template <typename T, typename U> inline void smax(T &a, const U &b) { if (a < b) a = b; } template <class T> inline void gn(T &first) { char c, sg = 0; ...
#include <bits/stdc++.h> using namespace std; struct operacion { string name; int x; operacion() {} operacion(string name, int x) : name(name), x(x) {} }; int n; priority_queue<int, vector<int>, greater<int> > q; vector<operacion> v; int main() { ios::sync_with_stdio(false); cin >>...
#include <bits/stdc++.h> using namespace std; #pragma GCC target( avx2 ) #pragma GCC optimization( O2 ) #pragma GCC optimization( unroll-loops ) const long double ERR = 1e-5; const int MOD = 1e9 + 7; bool areEqual(long double _n1, long double _n2) { return fabs(_n1 - _n2) < ERR; } long long A[] = ...
#include <bits/stdc++.h> using namespace std; const int N = 155; const int INF = 123456789; struct edge { int to, lim, pri, rev; edge() : to(0), lim(0), pri(0), rev(0){}; edge(int to, int lim, int pri, int rev) : to(to), lim(lim), pri(pri), rev(rev){}; }; vector<edge> nei[N]; char ss[1...
#include <bits/stdc++.h> using namespace std; const long long INF = 1000000000000000; bool sortCct(pair<long long, long long> a, pair<long long, long long> b) { return a.first > b.first; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long n, i, t, g, c = 0; ...

#include <bits/stdc++.h> using namespace std; int n; struct edge { int v, next; } e[500100]; int head[100100], tot = 0; void Add(int u, int v) { e[tot].v = v; e[tot].next = head[u]; head[u] = tot++; } int res[100100]; int deep[100100]; int vis[100100]; void DFS(int u) { vis[u] ...

#include <bits/stdc++.h> using namespace std; vector<long long> v; long long x, y, z, a, b, c, sum, ans, total, t, cnt, n, m, k, p, kase; string s1, s2; map<long long, long long> mp; set<long long> s; map<long long, long long>::iterator itr1, ptr1; set<long long>::iterator itr, ptr; int main() { a...

#include <bits/stdc++.h> using namespace std; int read() { int num = 0; bool f = 0; char ch = getchar(); while (ch < 0 || ch > 9 ) { f = (ch == - ); ch = getchar(); } while (ch >= 0 && ch <= 9 ) { num = (num << 1) + (num << 3) + ch - 0 ; ch = getchar(); } ...

#include <bits/stdc++.h> using namespace std; const int AS = 26; struct vertex { int next[AS]; bool leaf = false; multiset<int> st; int mx = 0; int p = -1; int length = 0; char pch; int link = -1; int elink = -1; int go[AS]; vertex(int p = -1, char ch = $ ) : p(p), pch...

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

#include<bits/stdc++.h> using namespace std; typedef long long int ll; ll mod=1e9+7; ll get(ll x,ll y) { ll z; cout<< ? <<x<< <<y<<endl; cin>>z; return z; } int main() { #ifndef ONLINE_JUDGE freopen( input.txt , r ,stdin); freopen( output.txt , w ,std...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; template <typename T> void uin(T &a, T b) { if (b < a) a = b; } template <typename T> void uax(T &a, T b) { if (b > a) a = b; } const long long maxn = 1000 * 1000 + 228; long long n, k; long long dp[maxn], p[maxn];...

#include <bits/stdc++.h> using namespace std; const int K = 105; const int N = (int)1e4 + 100; int c[N]; long double dp[K][N]; long double C[K][K]; long double fact[K]; int main(int, char **) { fact[0] = 1; for (int i = 0; i < K; i++) { if (i != 0) fact[i] = fact[i - 1] * i; C[i][0] ...

#include <bits/stdc++.h> using namespace std; int cnt1[5001] = {0}; int cnt2[5001][5001] = {0}; vector<int> p[5001]; int cnt[5001] = {0}; int solve() { int n, q; cin >> n >> q; vector<pair<int, int>> v; for (int j = 0; j < q; j++) { int l, r; cin >> l >> r; v.push_back({l, ...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 10; long long M[maxn << 2], tag[maxn << 2]; void gather(int p) { M[p] = max(M[p << 1], M[p << 1 | 1]); } void push(int p) { if (tag[p]) { tag[p << 1] += tag[p]; tag[p << 1 | 1] += tag[p]; M[p << 1] += tag[p]; M[p ...

#include <bits/stdc++.h> using namespace std; int n; void draw(int k) { for (int i = 0; i < n - k; i++) { cout << ; } for (int i = 0; i < k; i++) { cout << i << ; } for (int i = k; ~i; i--) { cout << i << (i ? : n ); } } int main() { cin >> n; for...

#include <bits/stdc++.h> using namespace std; const int MM = 2e4 + 5; struct Node { int l, r, lz, mx; } seg[MM * 4]; int n, m, k, dp[55][MM], a[55][MM], b[55][MM]; void build(int u, int l, int r, int i) { seg[u].l = l; seg[u].r = r; seg[u].lz = 0; if (l == r) { seg[u].mx = dp[i - 1...

#include <bits/stdc++.h> using namespace std; const int INF = 2e9, N = 101; int n, m, q, tot, a[N], b[N]; int vis[N]; bool solve(int pos) { memset(vis, 0, sizeof(vis)); for (int i = pos; i < pos + tot; i++) vis[a[i]]++; for (int i = 1; i < m + 1; i++) if (vis[i] != b[i]) return 0; return...

#include <bits/stdc++.h> using namespace std; const int maxx = 2e5 + 10; char s[maxx], t[maxx]; int l[maxx], r[maxx]; int main() { cin >> s >> t; int m = strlen(s); int n = strlen(t); int a = 0, b = 0; for (int i = 0; i < m; i++) { if (s[i] == t[a]) { l[a] = i; a++; ...

#include <bits/stdc++.h> using namespace std; constexpr int MAXWHITE = 20; constexpr int MINBLACK = 40; int64_t dp[110][MAXWHITE + 5][MINBLACK + 5]; int vis[110]; int par[110]; vector<vector<int>> adj; int N, K; int64_t MOD = (int64_t)1e9 + 7LL; int64_t Get(int u, int max_white, int min_black) { ...

#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 5; const int dx[4] = {1, -1, 0, 0}; const int dy[4] = {0, 0, 1, -1}; int read() { int s = 0; char c = getchar(), lc = + ; while (c < 0 || 9 < c) lc = c, c = getchar(); while ( 0 <= c && c <= 9 ) s = s * 10 + c - 0 , c = ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 212345, MAXL = 20, INF = 1123456789; vector<int> grafo[MAXN], peso[MAXN]; int dp[MAXN][MAXL], mx[MAXN][MAXL], dist[MAXN], prof[MAXN]; long long int pmst; pair<int, pair<int, int> > ar[MAXN]; int lca(int a, int b) { int resp = 0; if (pr...

#include <bits/stdc++.h> using namespace std; int tree[500005 << 2]; struct P { int x, y, z; int id; } p[500005]; bool cmp1(P a, P b) { if (a.x != b.x) return a.x > b.x; else if (a.y != b.y) return a.y > b.y; else return a.z > b.z; } bool cmp2(P a, P b) { return a.y <...

#include <bits/stdc++.h> using namespace std; const int N = 200009; int a[N], pos[N]; int main() { int n; cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= n; i++) { int x; cin >> x; pos[x] = i; } for (int i = 1; i <= n; i++) a[i] = pos[a[i]]; ...

#include <bits/stdc++.h> const int MAX = 1e6 + 105; const int INF = 1e9 + 5; const double M = 4e18; using namespace std; const int MOD = 1e9 + 7; const double eps = 0.000000001; int n, k; bool query(int x, int y) { if (x < 0 || y > n) return false; string re; cout << 1 << << x << << ...

#include <bits/stdc++.h> using namespace std; const long long mod = 998244353; signed main() { cin.tie(0); std::ios_base::sync_with_stdio(0); long long n; cin >> n; long long cnt = 10; vector<long long> ans; ans.push_back(10); if (n < 2) { cout << 10; return 0; } ...

#include <bits/stdc++.h> using namespace std; inline long long read() { register long long data = 0, w = 1; char ch = 0; while (ch != - && (ch < 0 || ch > 9 )) ch = getchar(); if (ch == - ) w = -1, ch = getchar(); while (ch >= 0 && ch <= 9 ) data = (data << 1) + (data << 3) + (ch ...

#include <bits/stdc++.h> using namespace std; int main() { long long n, k, i, l; cin >> n >> k; string s; cin >> s; long long max = 0; for (i = 1; i < n; i++) { long long temp = 0; for (l = 0; l < n; l++) { if (i + l < n) { if (s[i + l] == s[l]) { te...

#include <bits/stdc++.h> using namespace std; inline void speed() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } int compare(pair<long long int, long long int> a, pair<long long int, long long int> b) { return a.first > b.first; } int main() { speed();...

#include <bits/stdc++.h> using namespace std; const int N = 300005; const int MD = 1000000007; int n, a[N]; long long s[N], k; int ft[N]; long long all[N]; int gt(int first) { int res = 0; for (int i = first; i >= 0; i &= i + 1, --i) res += ft[i]; return res; } void upd(int first, int v)...

#include <bits/stdc++.h> using namespace std; bool F[2001][2001]; bool D[2001][2001]; int C[2001]; vector<int> V[2001]; int n; void f(int v, int c) { if (C[v]) return; C[v] = c; V[c].push_back(v); for (int i = 1; i <= n; ++i) if (F[v][i]) f(i, c); } int main() { ios_base::syn...

#include <bits/stdc++.h> using namespace std; int a[5010], n, s = 0, i; int main() { cin >> n >> i; for (i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); for (i = 0; i < n; i++) s += a[i] != a[(i + n / 2) % n]; cout << s << endl; for (i = 0; i < n; i++) cout << a[i] << << a[(i + n / 2) ...

#include <bits/stdc++.h> using namespace std; template <typename T1, typename T2> void chkmin(T1 &x, T2 y) { if (x > y) x = y; } template <typename T1, typename T2> void chkmax(T1 &x, T2 y) { if (x < y) x = y; } namespace fastio { char rbuf[1 << 23], *p1 = rbuf, *p2 = rbuf, wbuf[1 << 23], *p3 ...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> v(n); for (int i = 0; i < n; i++) cin >> v[i]; map<int, vector<pair<int, int> > > mapa; for (int i = 0; i < n; i++) { int suma = 0; for (int j = i; j < n; j++) { suma += v[j]; ...

#include <bits/stdc++.h> using namespace std; inline bool invowel(char ch) { ch = tolower(ch); return (ch == a || ch == e || ch == i || ch == o || ch == u ); } inline bool isprime(int n) { if (n < 2 || (n % 2 == 0 && n != 2)) return false; for (int i = 3; i * i <= n; i += 2) if (n...

#include <bits/stdc++.h> using namespace std; int main() { long long r; cin >> r; vector<long long> ans; for (int i = 1; i < sqrt(r); i++) { long long rem = r - ((i * i) + i + 1); if (rem % 2 == 0 && rem > 0) { ans.push_back(i); ans.push_back(rem / 2); break; ...

#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 10, mod = 1e9 + 7; int n, m, k, t; char a[maxn]; long long h[maxn], h1[maxn], xp[maxn]; long long get(long long h[], int pos, int len, int len1) { return (h[pos + len - 1] - h[pos - 1] * xp[len1] % mod + mod) % mod; } int cnt[maxn]...

#include <bits/stdc++.h> using namespace std; long long n, m, k; vector<vector<pair<long long, long long>>> graph; long long ok[10][10]; long long fine[10][10][10][10]; bitset<(long long)(2e5 + 5)> incoming[10][10]; long long answer = 0; vector<long long> temp; void dfs() { if (temp.size() == k) {...

#include <bits/stdc++.h> using namespace std; void fast() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } void in(long long int *a, long long int n) { for (long long int i = 0; i < n; i++) { cin >> a[i]; } } void out(long long int *a, long long int n) { for...

#include <bits/stdc++.h> using namespace std; int kol[10], ans = -1, ans0 = 0; vector<int> a, b; int main() { memset(kol, 0, sizeof(kol)); char c; while (cin >> c) kol[c - 0 ]++; for (int i = 1; i < 10; i++) { vector<int> c, d; int K1[10], K2[10], res = 0, nul = 0; for (int j ...

#include <bits/stdc++.h> using namespace std; int main() { int t; long n, k; cin >> t; while (t--) { cin >> n >> k; bool win = true; if (k % 3 == 0) { int np = n % (k + 1); if (np % 3 == 0 && np != k) win = false; } else { int np = n % 3; if (n...

#include <bits/stdc++.h> using namespace std; const int maxn = 1010, max_range = 1000001; int edge[maxn][3 * maxn], reached[maxn], start[3 * maxn], len[3 * maxn], vert[3 * maxn][2], n, m, res; FILE *in; int nb(int v, int e) { if (vert[e][0] == v) return vert[e][1]; else return vert[e...

#include <bits/stdc++.h> using namespace std; struct pt { int x, y; pt() {} pt(int x, int y) : x(x), y(y) {} }; int get_pos(int i, int n) { if (i >= n) i -= n; return ((i >= 0) ? i : n - i - 1); } void solve() { int n; cin >> n; vector<pt> v(n); for (int i = 0; i < n; ++i...

#include <bits/stdc++.h> using namespace std; map<long long, long long> mp1, mp2; long long n, k; long long a[200001]; int main() { ios_base::sync_with_stdio(false); cin >> n >> k; long long res = 0; for (int i = 1; i <= n; ++i) cin >> a[i]; for (int i = n; i >= 1; --i) { res += mp1[...

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

#include <bits/stdc++.h> int main() { int k, x, n; scanf( %d %d , &n, &k); int p = k; while (p >= 1) { x = k * n / p + p; if (n == ((x / k) * (x % k))) break; p--; } printf( %d , x); }

#include <bits/stdc++.h> inline long long read() { long long x = 0; char c = getchar(), f = 1; for (; c < 0 || 9 < c; c = getchar()) if (c == - ) f = -1; for (; 0 <= c && c <= 9 ; c = getchar()) x = x * 10 + c - 0 ; return x * f; } inline void write(long long x) { static cha...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int left[n], right[n]; int leftOpen = 0, leftClose = 0, rightOpen = 0, rightClose = 0; for (int i = 0; i < n; i++) { cin >> left[i]; cin >> right[i]; if (left[i]) leftOpen += 1; else ...

#include <bits/stdc++.h> using namespace std; int a[202020], f[202020]; int s[202020]; bool br[202020]; int n, doe, ans; int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %d , &a[i]), ++f[a[i]]; doe = 1; while (f[doe] != 0) ++doe; for (int i = 1; i <= n; ++i) { if (...

#include <bits/stdc++.h> using namespace std; struct ljb { int dest, flow, cost; ljb *next, *other; }; int n, s, ans1, ans2, flag[10000], cost[10000], flow[10000], u[100000], hh[10000], lim[10000]; ljb *p, *head[10000], *tail[10000], *hu[10000]; string ct, cs[10000]; void push(int x, int y, ...

#include <bits/stdc++.h> using namespace std; int N; void ro(vector<string> &b) { vector<string> c(N, string(N, )); for (int i = 0; i < N; i++) { for (int j = N - 1; j >= 0; j--) { c[N - 1 - j][i] = b[i][j]; } } b = c; } void fl(vector<string> &b) { reverse(b.begin(), b....

#include <bits/stdc++.h> using namespace std; const int M = 100005; int read() { int x = 0, flag = 1; char c; while ((c = getchar()) < 0 || c > 9 ) if (c == - ) flag = -1; while (c >= 0 && c <= 9 ) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar(); return x * flag; } int...

#include <bits/stdc++.h> using namespace std; template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& _p) { return os << ( << _p.first << , << _p.second << ) ; } template <typename T> ostream& operator<<(ostream& os, const vector<T>& _V) { bool f = true; os << ...

#include <bits/stdc++.h> using namespace std; template <class Int> Int MAX(Int a, Int b) { return (a > b) ? a : b; } template <class Int> Int MIN(Int a, Int b) { return (a < b) ? a : b; } const double PI = 2 * acos(0.0); const int INF = 1 << 30; int main(void) { int l, d, v, g, r; do...

#include <bits/stdc++.h> using namespace std; inline int two(int n) { return 1 << n; } inline int test(int n, int b) { return (n >> b) & 1; } inline void set_bit(int& n, int b) { n |= two(b); } inline void unset_bit(int& n, int b) { n &= ~two(b); } inline int last_bit(int n) { return n & (-n); } inline in...

#include <bits/stdc++.h> using namespace std; using pii = pair<int, int>; using ll = long long; int kmp(string const& s) { int n = s.size(); vector<int> lps(n, 0); for (int i = 1; i < n; i++) { int j = lps[i - 1]; while (j > 0 && s[i] != s[j]) j = lps[j - 1]; if (s[i] == s[j]) j++;...

#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { if (b == 0) return a; else { return gcd(b, a % b); } } int main() { multiset<long long> s; multiset<long long>::iterator it; long long n, arr[100000], i, ache = 0, Max = -1, z, churi1, chu...

#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { return b == 0 ? abs(a) : gcd(b, a % b); } long long lcm(long long a, long long b) { return a / gcd(a, b) * b; } long long div_count(long long n) { long long cunt = 0; while (n > 1) { if (n % 2 == 0) { ...

#include <bits/stdc++.h> using namespace std; template <class T> inline int size(const T& c) { return c.size(); } template <class T> inline int length(const T& c) { return c.length(); } unsigned long long l, r, k, m; vector<unsigned long long> can; struct matrix { unsigned long long val[...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; string s[n]; for (int i = 0; i < n; i++) { cin >> s[i]; bool b = false; if (i == 0) { cout << NO << endl; continue; } for (int j = 0; j < i; j++) { if (s[j] == s[i]) { ...

#include <bits/stdc++.h> using namespace std; int main() { int n; long long p; cin >> n >> p; vector<pair<long long, int> > ar; vector<long long> ans(n); for (int i = 0; i < n; i++) { long long x; cin >> x; ar.push_back(make_pair(x, i)); } sort(ar.begin(), ar.end())...

#include <bits/stdc++.h> using namespace std; int main() { int t, n; cin >> t; while (t--) { int n, m, aux1, aux2; int q; cin >> q; string ans = ; vector<pair<int, int> > v; for (int i = 0; i < q; i++) { cin >> n >> m; v.push_back(make_pair(n, m)); ...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 5; const int mod = 998244353; unsigned long long p[55]; unsigned long long f[55]; int d[55], to[55], used[55]; void upd(unsigned long long &x, unsigned long long y, unsigned long long w) { if ((double)y * w > 2e18) x += 2e18; ...

#include <bits/stdc++.h> using namespace std; const int maxn = 22, maxm = (1 << 21) + 5; int n, plc[maxm]; unsigned long long a[maxm], b[maxm], c[maxn]; char s[maxm]; void FMT(unsigned long long *a, int sgn) { for (int i = 0; i < n; i++) for (int j = 0; j < (1 << n); j++) if (!(j & (1 << i...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:60000000 ) using namespace std; const int MAXN = 10 + 100000; const int INF = int(1e9); const int m = 4; int k, t, d; int a[5][5], i, j, n; void nhap() { scanf( %d , &n); for (int i = (1), _b = (m); i <= m; ++i) scanf( %d%d%d%d , &a[...

#include <bits/stdc++.h> using namespace std; int dx[8] = {-1, -1, -1, 0, 1, 1, 1, 0}; int dy[8] = {-1, 0, 1, 1, 1, 0, -1, -1}; const int N = 100005; struct mes { char c; int id; }; int n, m; bool no[N]; mes all[N]; int p[N]; int main() { scanf( %d%d , &n, &m); for (int i = 0; i < ...

#include <bits/stdc++.h> using namespace std; vector<vector<int> > c(6, vector<int>(4, 0)); bool full[6]; bool polu[6]; int main() { ios_base::sync_with_stdio(0); cin.tie(nullptr); for (int i = 0; i < 6; ++i) { bool was[7] = {}; for (int j = 0; j < 4; ++j) { cin >> c[i][j]; ...

#include <bits/stdc++.h> using namespace std; const int N = 200005; using ll = long long; struct TNode { int l, r; ll v; } t[N << 2]; inline int lc(int pos) { return pos << 1; } inline int rc(int pos) { return pos << 1 | 1; } int a[N], n, m; ll sum[N], lazy[N << 2]; inline void pushup(int po...

#include <bits/stdc++.h> using namespace std; int n, m, a[5010], b[5010], d[110][110]; double mat[110][110], res[110], flow[110][110], c[5010], ans; bool used[110]; void input() { memset(flow, 0x7f, sizeof(flow)); cin >> n >> m; for (int i = 0; i < m; ++i) { cin >> a[i] >> b[i] >> c[i]; ...

#include <bits/stdc++.h> using namespace std; long long n, d[40005], v[4005], p[4005], cur, val, use[4005], cnt; int main() { cin >> n; for (int i = 1; i <= n; ++i) cin >> v[i] >> d[i] >> p[i]; for (int i = 1; i <= n; ++i) if (!use[i]) { cur = v[i]; for (int j = i + 1; j <= n; ++...

#include <bits/stdc++.h> using namespace std; #define inf 1e15 #define mod 1000000007 #define N 100001 #define ll long long int #define vint vector<int> #define vll vector<ll> #define vstr vector<string> #define vvint vector<...

#include <bits/stdc++.h> using namespace std; int sumdigs(int x) { int c = 0; while (x) { c += x % 10; x /= 10; } return c; } int main() { int a; cin >> a; if (sumdigs(a) % 4 == 0) cout << a; else { for (int i = a; i < 1000000; i++) { if (sumdigs(i...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e3 + 5; int n, m, k; int a[maxn], c[maxn]; int ans, tmp, cnt, rt, sum, ma; int flag; char s[maxn]; bool ok[maxn]; vector<int> vc[maxn], vv[maxn]; template <typename T> inline void read(T &X) { X = 0; int w = 0; char ch = 0...

#include <bits/stdc++.h> using namespace std; template <class T> inline void si(T &x) { register int c = getchar(); x = 0; int neg = 0; for (; ((c<48 | c> 57) && c != - ); c = getchar()) ; if (c == - ) { neg = 1; c = getchar(); } for (; c > 47 && c < 58; c = getchar...

#include <bits/stdc++.h> using namespace std; const int INF = 0x3F3F3F3F; const long long INF_LL = 0x3F3F3F3F3F3F3F3FLL; const int N = 4e5 + 50; bool check(const string &s, const string &t) { int match = 0; for (int i = 0; i < s.size() && match < t.size(); ++i) { if (s[i] == t[match]) ++match; ...

#include <bits/stdc++.h> using namespace std; const int N = 4e5 + 10, LOG = 20; int n, q, F[N], T[N], P[N], D[N], Par[LOG][N]; pair<int, int> Q[N]; vector<int> Adj[N], Ap[N], V[N << 2]; void Pre(int v) { for (int i = 1; i < LOG; i++) Par[i][v] = Par[i - 1][Par[i - 1][v]]; for (auto X : Adj[v]) ...

#include <bits/stdc++.h> using namespace std; using ll = long long; template <class T> void chkmin(T &x, const T &y) { if (y < x) { x = y; } } template <class T> void chkmax(T &x, const T &y) { if (y > x) { x = y; } } template <class T> void sort(vector<T> &a) { sort(...

#include <bits/stdc++.h> using namespace std; int n, i, k, u, v, cnt; int head[300005], a[300005]; long long f[300005], ans; struct ff { int to, nxt; } e[2 * 300005]; int fast() { int res = 0, fl = 1; char c = getchar(); while (c < 48 || c > 57) { if (c == - ) fl = -1; c = get...

#include <bits/stdc++.h> using namespace std; int main() { int n, m; bool flag = true; while (cin >> n >> m) { for (int i = 0; i < n; i++) { for (int j = 1; j <= m; j++) { if (i % 2 && j < m && flag) cout << . ; else if (i % 2 && j == m && flag) ...

#include <bits/stdc++.h> using namespace std; const int max_x = 1000, inf = 1000111222; const int max_bal = 2222; const int sd = max_bal / 2; int a; pair<int, pair<int, int>> par[max_x][max_bal]; bool dp[max_x][max_bal]; int get_sum(int x) { int sum = 0; while (x) { sum += x % 10; x ...

#include <bits/stdc++.h> using namespace std; long long int INF = 1000000000; vector<vector<int> > v; int* dist; void bfs(int ver, int n) { bool vis[n]; for (int i = 0; i < n; i++) vis[i] = false; vis[ver] = true; queue<pair<int, int> > q; q.push(make_pair(ver, 0)); while (!q.empty()) ...

#include <bits/stdc++.h> using namespace std; int n; int arr[100005]; int ans[100005][3], alen; struct node { int n, cnt; bool friend operator<(node a, node b) { return a.cnt < b.cnt; } } n1, n2, n3; priority_queue<node> qu; int blen = 0; int main() { scanf( %d , &n); int i, j; for...

#include <bits/stdc++.h> using namespace std; int main() { int n = 6; int x, f[12] = {0}; for (int i = 0; i < n; i++) { cin >> x; f[x]++; } bool res = 0; for (int i = 0; i < 10; i++) { if (f[i] >= 4) { res = 1; f[i] -= 4; for (int j = 0; j < 10; j++)...

#include <bits/stdc++.h> using namespace std; int main() { int n, m = 0, m1 = 0, l, q[1000], t; cin >> n; for (int i = 0; i < n; i++) { cin >> q[i]; } cin >> t; sort(q, q + n); for (int i = 0; i < n; i++) { l = 1; for (int j = i + 1; j < n; j++) { if (q[j] - q[i...

#include <bits/stdc++.h> using namespace std; void debug_out() { cerr << n ; } template <typename H, typename... T> void debug_out(H h, T... t) { cerr << << (h); debug_out(t...); } int n; string a, b; char flip(char ch) { return (char)( 0 + ( 1 - ch)); } char ch(int i, int cnt) { retur...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; if (n < 998) cout << n + 2; else cout << n - 2; }

#include <bits/stdc++.h> using namespace std; struct Edge { int u, v, w; }; const int N = 500005; int n, m, q; Edge edge[N]; vector<int> sorted_edge[N]; vector<pair<int, vector<int>>> query[N]; bool npos[N]; int par[N], rnk[N]; vector<int> rnk_roll, par_roll; void init() { for (int i = 1...

#include <bits/stdc++.h> using namespace std; long long points[1002][2]; long long circle[1002][3]; vector<long long> tree[1002]; bool mark[1002]; vector<long long> paths[1002]; long long inside[1002]; long long dist2(long long a, long long b, long long c, long long d) { return (a - c) * (a - c) + (...

#include <bits/stdc++.h> using namespace std; long long mod(long long x, long long MOD) { if (x > MOD) x -= MOD; return x; } long long _ceil(long long x, long long y) { return x / y + (x % y != 0); } void wrt() { cout << n ; return; } template <typename T1, typename... T2> void wrt(T1 ...

#include <bits/stdc++.h> using namespace std; template <class T> inline T INT_LEN(T v) { int len = 1; while (v /= 10) ++len; return len; } int t1, t2, x1, x2, t0; int less_than(double va, double vb) { return va <= vb + 1e-10; } int binary_found(int lt, int rt, int y2, double &pre) { int y1...

#include <bits/stdc++.h> using namespace std; template <typename T, typename U> inline void smin(T &a, U b) { if (a > b) a = b; } template <typename T, typename U> inline void smax(T &a, U b) { if (a < b) a = b; } inline void gn(long long &first) { int sg = 1; char c; while (((c = ge...

#include <bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 5; const long long MOD = 998244353; int n, k; vector<int> a, b; long long ans[MAXN][3][5]; bool found[MAXN][3][5]; long long mul(long long a, long long b) { return (a * b) % MOD; } long long dp(int pos, int last, int var) { if (p...

#include <bits/stdc++.h> using namespace std; void FastIO() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); } stack<pair<int, int> > stk; string ip; int length; int main() { FastIO(); cin >> ip; length = ip.length(); int prev[length + 10], open[length + 10]; ...

#include <bits/stdc++.h> using namespace std; int main() { int t, i; cin >> t; while (t--) { int flag = 0; string s, t, p; cin >> s >> t >> p; int a[26] = {0}; if (s.length() > t.length()) { flag = 0; } else { for (i = 0; i < min(t.length(), s.length()...

#include <bits/stdc++.h> using namespace std; struct Maxflow { static const int MAXV = 20010; long long INF = 1000000000000000ll; struct Edge { int v, r; long long c; Edge(int _v, long long _c, int _r) : v(_v), c(_c), r(_r) {} }; int s, t; vector<Edge> G[MAXV * 2]; int ...

#include <bits/stdc++.h> using namespace std; const long long M = 1e8; int main() { long long n, i, j; cin >> n; vector<long long> ara; for (i = 0; i < n; i++) { cin >> j; ara.push_back(j); } long long pre1[n + 1]; long long pre2[n + 1]; pre1[0] = 0; pre2[0] = 0; ...

#include <bits/stdc++.h> using namespace std; template <typename A, typename B> string to_string(pair<A, B> p); template <typename A, typename B, typename C> string to_string(tuple<A, B, C> p); template <typename A, typename B, typename C, typename D> string to_string(tuple<A, B, C, D> p); string to_str...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10, mod = 1e9 + 7; int k, n, sz, last; char s[N]; string ret; long long cnt[2 * N], dp[2 * N]; char inp[N]; struct state { int link, len, next[26]; }; state st[2 * N]; bool vis[2 * N]; void sa_init() { st[0].len = 0; s...

#include <bits/stdc++.h> using namespace std; int a[100010], b[100010]; map<string, bool> mark; bool word(char a) { if (a >= a and a <= z ) return true; if (a >= A and a <= Z ) return true; return false; } int main() { int n; cin >> n; string a; cin >> a; int ind = 0; ...

#include <bits/stdc++.h> using namespace std; const long long INF = 1e18; const long long MOD = 1e9 + 7; template <class T> inline void chmax(T &a, const T &b) { if ((a) < (b)) (a) = (b); } template <class T> inline void chmin(T &a, const T &b) { if ((a) > (b)) (a) = (b); } template <typenam...

#include <bits/stdc++.h> using namespace std; template <typename T, typename U> inline void smin(T &a, const U &b) { if (a > b) a = b; } template <typename T, typename U> inline void smax(T &a, const U &b) { if (a < b) a = b; } template <class T> inline void gn(T &first) { char c, sg = 0; ...

#include <bits/stdc++.h> using namespace std; struct operacion { string name; int x; operacion() {} operacion(string name, int x) : name(name), x(x) {} }; int n; priority_queue<int, vector<int>, greater<int> > q; vector<operacion> v; int main() { ios::sync_with_stdio(false); cin >>...

#include <bits/stdc++.h> using namespace std; #pragma GCC target( avx2 ) #pragma GCC optimization( O2 ) #pragma GCC optimization( unroll-loops ) const long double ERR = 1e-5; const int MOD = 1e9 + 7; bool areEqual(long double _n1, long double _n2) { return fabs(_n1 - _n2) < ERR; } long long A[] = ...

#include <bits/stdc++.h> using namespace std; const int N = 155; const int INF = 123456789; struct edge { int to, lim, pri, rev; edge() : to(0), lim(0), pri(0), rev(0){}; edge(int to, int lim, int pri, int rev) : to(to), lim(lim), pri(pri), rev(rev){}; }; vector<edge> nei[N]; char ss[1...

#include <bits/stdc++.h> using namespace std; const long long INF = 1000000000000000; bool sortCct(pair<long long, long long> a, pair<long long, long long> b) { return a.first > b.first; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long n, i, t, g, c = 0; ...