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 father[18000010], nRow, nCol; bool col[3010][3010 * 2]; int movex[] = {1, 1, 1, 0, 0, -1, -1, -1}; int movey[] = {-1, 0, 1, 1, -1, -1, 0, 1}; int Find(int p, int *father) { if (father[p] != p) father[p] = Find(father[p], father); return father[p]; ...
#include <bits/stdc++.h> using namespace std; int n, Q; string s[200200]; int ep[200200]; int len[200200]; struct data { int to, nxt; } mp[400400]; int head[200200], cnt; void link(int x, int y) { mp[++cnt].to = y; mp[cnt].nxt = head[x]; head[x] = cnt; } int id[200200], clk; int ...
#include <bits/stdc++.h> using namespace std; template <class T> void splitstr(const string &s, vector<T> &out) { istringstream in(s); out.clear(); copy(istream_iterator<T>(in), istream_iterator<T>(), back_inserter(out)); } template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; ...
#include <bits/stdc++.h> const double eps = 1e-10; const float epsf = 1e-6; const int mod = 1000000007; using namespace std; inline long long int __gcd(long long int a, long long int b) { if (a == 0 \|\| b == 0) { return max(a, b); } long long int tempa, tempb; while (1) { if (a % b ...
#include <bits/stdc++.h> const int MAXN = 2e5 + 10; const double eps = 1e-8; const int mod1 = 1e9 + 7; const int mod2 = 1e9 + 9; using namespace std; struct edge { int t, v; edge next; } e[MAXN << 1], h[MAXN], *o = e; void add(int x, int y, int vul) { o->t = y; o->v = vul; o->next ...
#include <bits/stdc++.h> using namespace std; template <class T> using v2d = vector<vector<T> >; template <class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; } template <class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; } mt19937 rng(chrono::system_clock:...
#include <bits/stdc++.h> using namespace std; const int N = 20; int a[N], b[N], c[N], d[N], ln[N], rn[N], lm[N], rm[N]; int main() { int n, m; cin >> n >> m; for (int i = 1; i <= n; i++) { cin >> a[i] >> b[i]; if (a[i] > b[i]) swap(a[i], b[i]); } set<int> st; for (int i = 1; ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 5; const int oo = 0x3f3f3f3f; const int LIM = 2e5; int N, a[MAXN], num[MAXN], top, f[MAXN], ans[MAXN]; vector<int> S[MAXN]; int gcd(int a, int b) { return !b ? a : gcd(b, a % b); } namespace Graph { struct edge { int y, next; }...
#include <bits/stdc++.h> int n, m; int main() { int i, j, T; long long k, total, w; while (scanf( %I64d%I64d%I64d , &k, &total, &w) != EOF) { long long ans = (1 + w) * w / 2; ans *= k; if (ans - total >= 0) printf( %I64d n , ans - total); else printf( 0 n ); }...
#include <bits/stdc++.h> using namespace std; const int maxn = 1000000 + 5; const int inf = 0x3f3f3f3f; int n; char y[maxn * 2], a[maxn * 2]; int main() { cin >> n; scanf( %s , y); scanf( %s , a); int ycnt = 0; for (int i = 0; i < n * 2; i++) { if (y[i] == 1 ) ycnt++; } in...
//Iamskk// #include <iostream> #include <iosfwd> #include <iomanip> #include <cstdio> #include <cstring> #include <cstdlib> #include <ctime> #include <cmath> #include <cassert> #include <cctype> #include <climits> #include <vector> #include <bitset> #include <set> #include <queue> #inclu...
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int maxn = 2e6 + 10; int main() { ios::sync_with_stdio(false); cin.tie(0); int n, m, k; cin >> n >> m >> k; if (n == 1 && m == 1) { cout << 0 ; return 0; } if (n * m == 2) { cout << 4 nUD...
#include <bits/stdc++.h> #pragma warning(disable : 4996) using namespace std; using namespace std; const double eps = 1e-8; const double pi = acos(-1.0); inline double sqr(double x) { return x * x; } int cmp(double x) { if (fabs(x) < eps) return 0; if (x > 0) return 1; return -1; } int n; ...
#include <bits/stdc++.h> using namespace std; int p[6005], q[6005]; bool check(int a, int b, int x) { return x > a && x < b; } bool check2(int a, int b, int x) { return x >= a && x <= b; } bool isOK(int a, int b) { return a == b; } int sx[1005], sy[1005]; int main() { int n, t, i, j, a, x, k; mems...
#include <bits/stdc++.h> using namespace std; int main() { long long int n, b; cin >> n >> b; std::vector<long long int> v(n); long long int maxp = 0, minp = 0; long long int m1, m2 = 0; for (long long int i = 0; i < n; ++i) { cin >> v[i]; if (i == 0) m1 = v[i]; if (m2 < v[...
#include <bits/stdc++.h> using namespace std; vector<int> v[20001]; struct triplet { int x, y, z, sum; }; int a, b, c; void init() { for (int i = 1; i <= 20000; ++i) { for (int j = i; j <= 20000; j += i) v[j].push_back(i); } } triplet calc(int n) { triplet res; int ans = 100000...
#include <bits/stdc++.h> using namespace std; int main(void) { int n; int answer = -1; long sum_x[2] = {0}; long sum_y[2] = {0}; int nr[2] = {0}; int i; scanf( %d n , &n); for (i = 0; i < n; i++) { int t, x, y; scanf( %d %d %d n , &t, &x, &y); if (t == 1) { ...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:102400000,102400000 ) using namespace std; int main() { int n, m; cin >> n >> m; int ret = 0; while (n--) { char str[1009]; int cnt = 0; scanf( %s , str); int flag = 1; for (int i = 0; str[i]; i++) { if ...
#include <bits/stdc++.h> using namespace std; struct query { int k, pos, ind; } queries[200005]; struct arr { int val, ind; } a[200005]; long long n, q, cnt, res[200005], fw[200005], it[4 * 200005], len, b[200005]; bool cmp(arr a, arr b) { if (a.val != b.val) return a.val > b.val; return a...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long n, i, j, a[1000005], b[1000005], p = 0, q = 0, m, temp = 0, flag = 0, ans, r = 0, s = 0; vector<long long> v; s...
#include <bits/stdc++.h> using namespace std; int main() { int n, m; scanf( %d%d , &n, &m); if (m < n - 1 \|\| m > 2 * (n + 1)) { printf( -1 n ); } else if (m == n \|\| m == n - 1) { int flg = 0; while (m \|\| n) { if (!flg) { printf( 0 ); n--; flg =...
#include <bits/stdc++.h> using namespace std; int a[10000] = {0}, b[10000] = {0}, n, k, dem = 0; int main() { cin >> n >> k; for (int i = (1), _b = (k); i <= _b; i++) { cin >> a[i]; b[a[i]] = i; } for (int i = (1), _b = (k); i <= _b; i++) { dem = 1; cout << a[i]; for ...
#include <bits/stdc++.h> using namespace std; const long long INF = 99999999999999999; long long n, value[200000], zarib[200000], LCM = 1, GCD, x = INF, ans, sum; vector<int> Tree[200000]; long long gcd(long long l, long long r) { if (!l) return r; return gcd(r % l, l); } bool dfs(int v, int last,...
#include <bits/stdc++.h> const int maxn = 100001; int n, i, u, v, top, a[maxn], spt[maxn], vt[maxn], st[maxn], l[maxn]; long long sum, ans, tmp, val[maxn], uc, bc, ss, min; std::vector<int> adj[maxn]; void dfs() { top = 1; st[1] = 1; while (top > 0) { u = st[top]; if (vt[u] < spt[u] &&...
#include <bits/stdc++.h> int value(const std::vector<int>& xs, int base, int i) { return (xs[(base + i) % xs.size()] + 10 - xs[base]) % 10; } bool lt(const std::vector<int>& xs, int a, int b) { int N = xs.size(); for (int i = 0; i < N; ++i) { int va = value(xs, a, i), vb = value(xs, b, i); ...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int long long n, a[60], mx = 2000; scanf( %lld , &n); for (int i = 0; i < n; i++) { scanf( %lld , &a[i]); } sort(a, a + n); for (int i = 1; i < n; i++) { mx = min...
#include <bits/stdc++.h> using namespace std; const int N = 1000005; long long f[N], g[N], a[N], ans; int n, F1, F2, F3, F4, F5, F6, k; inline void upd(long long &x, long long y) { if (x < y) x = y; } inline int calc(int y, int x) { if (x * 9 < y) return -1e9; if (y % 3 == 0) return y / 3; ...
#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { while (b) { int r = a % b; a = b; b = r; } return a; } int64_t lcm(int a, int b) { return 1LL * a * b / gcd(a, b); } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n; cin >...
#include <bits/stdc++.h> using namespace std; int main() { int t = 1; while (t--) { int n, k, inits[26]; char str[101]; bool poss = false, started[26] = {false}; scanf( %d%s , &k, str); n = strlen(str); if (n < k) { puts( NO ); break; } int cnt...
#include <bits/stdc++.h> using namespace std; bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) { return (a.second < b.second); } long long int gcd(long long int a, long long int b) { if (b == 0) return a; return gcd(b, a % b); } long long int lcm(long long int a, long long int b)...
#include <bits/stdc++.h> using namespace std; const int maxn = 5000; const long long MOD = 1000000007; long long D[maxn][maxn]; long long n, k; int main() { cin >> n >> k; D[0][0] = 1; --k; for (int i = 0; i < n; ++i) { int x; cin >> x; D[(1 << k)][i + 1] = D[(1 << k)][i]; ...
#include <bits/stdc++.h> using namespace std; const int N = 20; const int mod = 998244353; struct node { int sum, tot; node(){}; node(int S, int T) { sum = S; tot = T; } bool check() { return ~sum && ~tot; } } f[2][2][N][1 << 10]; int A[N], ret, pw[30], k; int lowbit(int x)...
#include <bits/stdc++.h> using namespace std; const int N = 1005; const int dx[] = {0, 0, -1, 1}; const int dy[] = {-1, 1, 0, 0}; char mat[N][N]; int dist[N][N][3]; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m; cin >> n >> m; for (int i = 0; i < n...
#include <bits/stdc++.h> using namespace std; const int N = 1100; template <class nmsl> inline void read(nmsl &x) { x = 0; char ch = getchar(), w = 0; while (!isdigit(ch)) w = (ch == - ), ch = getchar(); while (isdigit(ch)) x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar(); x = w ? -x : x...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 100; const double PI = 3.14159; vector<string> v; long long n, m, k, d, ans[101], c, sum, a[105][105]; set<string> st; string s, b; bool flag; set<string>::iterator it; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL);...
#include <bits/stdc++.h> using namespace std; const int U = 200; const int M = U + 5; int n; long double p, q; long double f[M][M], F[M][M]; long double a[M][M]; long double C[M][M]; void input() { int pp; scanf( %d %d , &n, &pp); p = pp / 1000000000.; q = p * (1 - p); } void prepa...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); long long int n, o = 0, t = 0; cin >> n; for (long long int i = 0; i < n; i++) { long long int x; cin >> x; if (x == 1) o++; else t++; } i...
#include <bits/stdc++.h> using namespace std; int n, m; string grid[101]; int nb, l = 200, r = -1, u = 200, d = -1; int main() { scanf( %d %d , &n, &m); for (int i = 0; i < n; i++) cin >> grid[i]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) if (grid[i][j] == B ) { ...
#include <bits/stdc++.h> using namespace std; const int N = (int)5e5 + 50; int n; int ans[N]; vector<int> G[N]; int q[N]; int dep[N]; vector<pair<int, int> > hist[N]; void upd(int u, int val) { q[u] = max(q[u], val); } void calc(int v, int p) { dep[v] = 0; for (int nxt : G[v]) { if (nx...
#include <bits/stdc++.h> using namespace std; const long long inf = 0x3f3f3f3f3f3f3f3f; int n, m, a[100010]; int tot[100010], Lpos = 1, Rpos = 0; long long f[100010], g[100010], MO; inline int read() { int x = 0, w = 0; char ch = 0; while (!isdigit(ch)) { w \|= ch == - ; ch = getchar...
#include <bits/stdc++.h> using namespace std; const int inf = (int)1e9; const double eps = (double)1e-8; const int mod = (int)1000000007; const int maxn = (int)2 * 1e5 + 5; int n, x, y, mx; int u[maxn], pr[maxn]; pair<int, int> t[maxn]; vector<pair<int, int> > a[maxn]; vector<int> ans; list<int> q...
#include <bits/stdc++.h> using namespace std; const int N = 1e5; int vl[N + 2], tim, st[N + 2]; int par[N + 2], level[N + 2]; int sp[N + 2][22], n, ed[N + 2]; long long seg[5 * N], lazy[5 * N]; vector<int> adj[N + 2]; void too_lazy(int node, int lo, int hi) { seg[node] += (lazy[node] * 1LL * (hi - l...
#include <bits/stdc++.h> using namespace std; string k; long long n; long long Judge(int L, int R) { int flag = 0; for (int i = L; i <= R; i++) { if (k[i] != 0 ) flag = 1; } if (flag == 1 && k[L] == 0 ) return -1; long long ans = 0; for (int i = L; i <= R; i++) { ans = (ans...
#include <bits/stdc++.h> using namespace std; const int maxN = 5000 + 5; const int lim = 1000 * 1000 * 1000; const int inf = 1000 * 1000 * 1000 + 5; int a[maxN]; vector<int> v[maxN]; int main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; for (int i = 0; i < n; i++) cin >> a...
#include <bits/stdc++.h> const int INF = 1e9 + 7; const int MAXN = 3e5 + 10; using namespace std; int main() { int a, b, c, d; cin >> a >> b >> c >> d; for (int i = a; i <= 2 * a; i++) { for (int j = b; j <= 2 * b; j++) { for (int k = c; k <= 2 * c; k++) { if (i > j && j > k ...
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const double EPS = 1e-9; int T, n; int num[1000015], p[1000015], cnt, sum[1000015]; int main() { scanf( %d , &T); while (T--) { scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %d , &p[i]); } ...
#include <algorithm> #include <iostream> #include <map> #include <vector> using namespace std; using LL = long long; #define mk make_pair const int MAX_N = 3E5 + 100; const int MAX_LOG_N = 18 + 1; int n, m; vector<int> G[MAX_N]; //================================= int log2Static[M...
#include <bits/stdc++.h> #pragma warning(disable : 4996) using namespace std; long long int a[100010]; int n; int main() { int i, j; while (scanf( %d , &n) != EOF) { for (i = 1; i <= n; i++) { scanf( %lld , &a[i]); } sort(a + 1, a + 1 + n); long long sum = a[1]; i...
#include <bits/stdc++.h> using namespace std; const int MAXN = 105; const double EPS = 1e-9; int n, k; double e; int px0, py0; int x[MAXN], y[MAXN]; double dp[MAXN][2]; double dist(int x1, int y1, int x2, int y2) { return sqrt(pow(x1 - x2, 2) + pow(y1 - y2, 2)); } double prob(int ind, double r...
#include <bits/stdc++.h> using namespace std; long long int dp[100010]; long long int sum[100010]; int main() { int n; int k; int m; cin >> m >> k; dp[0] = 1; for (int i = 1; i < k; i++) { dp[i] = 1; } for (int i = k; i <= 100002; i++) { dp[i] = (dp[i - 1] + dp[i - k]...
#include <bits/stdc++.h> using namespace std; template <typename T1, typename T2> inline T1 max(T1 a, T2 b) { return a < b ? b : a; } template <typename T1, typename T2> inline T1 min(T1 a, T2 b) { return a < b ? a : b; } const char lf = n ; namespace ae86 { const int bufl = 1 << 15; cha...
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; template <typename T> vector<T>& operator--(vector<T>& v) { for (auto& i : v) --i; return v; } template <typename T> vector<T>& operator++(vector<T>& v) { for (auto& i : v) ++i; return v; } te...
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( Ofast ) const long long maxn = 3000 + 10, N = 2e5 + 10, SQ = 320, base = 800287, mod = 1e9 + 7, INF = 1e18 + 10, lg = 22; const long double eps = 1e-4; long long n, m, q, dis[maxn][maxn], res[N]; long long V[N], U[N], r[N]...
#include <bits/stdc++.h> using namespace std; const long long MAX_N = 1e3 + 10, INF = 1e18; long long n, m, k, a[MAX_N][MAX_N], noe[MAX_N]; long long lab[MAX_N], dp[MAX_N][MAX_N]; pair<long long, long long> tar[MAX_N]; void filldp() { dp[m + n - 1][0] = 1; for (int i = m + n - 2; i >= 1; i--) { ...
#include <bits/stdc++.h> long long srf(int a, int b, int c) { std::cout << 1 << (a + 1) << << (b + 1) << << (c + 1) << std::endl; long long val; std::cin >> val; return val; } bool scl(int a, int b, int c) { std::cout << 2 << (a + 1) << << (b + 1) << << (c + 1) << std::en...
#include <bits/stdc++.h> using namespace std; vector<long long int> arr; vector<long long int> b; long long int l, f; long long int mid; long long int bin_s(long long int x) { l = 0; f = b.size() - 1; while (l <= f) { mid = (l + f) / 2; if (b[mid] > x) f = mid - 1; if (b[mid] <...
#include <bits/stdc++.h> using namespace std; using namespace std; long long powm(long long base, long long exp, long long mod = 1000000007) { long long ans = 1; while (exp) { if (exp & 1) ans = (ans * base) % mod; exp >>= 1, base = (base * base) % mod; } return ans; } long long n,...
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int h = -1, e = -1, l1 = -1, l2 = -1, o = -1; for (int i = 0; i < s.size(); i++) { if (s[i] == h ) { h = i; break; } } if (h == -1) cout << NO ; else { for (int j = h ...
#include <bits/stdc++.h> using namespace std; int h, m, n; void input() { scanf( %d%d%d , &h, &m, &n); } set<int> s; int head[200010], tail[200010], cnt[200010], idx[200010], nid; void build() { for (int i = 0; i < h; i++) s.insert(i); memset(idx, -1, sizeof(idx)); memset(tail, -1, sizeof(tail))...
#include <bits/stdc++.h> using namespace std; const int MaxN = 1005; string a[MaxN], start[MaxN], finish[MaxN], st[MaxN], Fans[MaxN]; int n, m, ind, Find; int b[MaxN]; void check() { int flag = 0, flag1 = 0, i, j; ind = 0; for (i = 1; i <= n; i++) { if (b[i] == 1) { ind++; ...
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } long long n, m, a, b, x, y; int main() { cin >> n >> m >> x >> y >> a >> b; long long k = gcd(a, b); long long kk = min(n / (a / k), m / (b / k)); a = a * kk / k, b = b * kk / ...
#include <bits/stdc++.h> using namespace std; const int N = 20005; const int len = 400; const int mod = 1e9 + 7; int n, p, q, ans[N]; struct node { int c, h, t; } a[N]; vector<int> all, in[N * 4]; vector<pair<int, int> > lazy[N]; void upd(int l, int r, int x, int v = 1, int tl = 0, int tr = all....
#include <bits/stdc++.h> using namespace std; int main() { long long int tes; cin >> tes; while (tes--) { long long int n, m; cin >> m >> n; vector<pair<long long int, long long int>> arr(n); for (long long int i = 0; i < n; i++) cin >> arr[i].first >> arr[i].second; sort(a...
#include <bits/stdc++.h> using namespace std; struct SegTree { const int INF = 1e9; vector<pair<int, int>> max_vc; vector<int> add; int h = 1; pair<int, int> combine(pair<int, int> a, pair<int, int> b) { if (a.first == b.first) return {a.first, a.second + b.second}; else ...
#include <bits/stdc++.h> using namespace std; const long long N = 1e5 + 10; const double Pi = acos(-1); inline long long read() { long long x = 0, f = 1, ch = getchar(); while (ch < 0 \|\| ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) x = x * 10 ...
#include <bits/stdc++.h> using namespace std; void solve() { long long int m; cin >> m; unsigned long long int A[m], Ap[m]; unsigned long long int B[m]; map<unsigned long long int, vector<unsigned long long int> > mp; for (long long int i = 0; i < m; i++) { cin >> B[i]; } for (...
#include <bits/stdc++.h> using namespace std; int const MAX = 200 * 1000 + 41; long double const EPS = 1e-12; bool eq(long double a, long double b) { return abs(a - b) < EPS; } bool leq(long double a, long double b) { return (a < b \|\| eq(a, b)); } int n, w; int x[MAX]; int v[MAX]; pair<long double, lo...
#include <bits/stdc++.h> using namespace std; const int nax = 1e5 + 5; vector<int> w[nax]; bool del[nax]; int legs[nax]; void dfs(int a, int par = 0) { if (w[a].size() <= 2) { del[a] = true; for (int i = 0; i < w[a].size(); i++) { int b = w[a][i]; if (b != par) dfs(b, a); ...
#include <bits/stdc++.h> using namespace std; const int intmax = 0x3f3f3f3f; const long long lldmax = 0x3f3f3f3f3f3f3f3fll; double eps = 1e-8; template <class T> inline void checkmin(T &a, T b) { if (b < a) a = b; } template <class T> inline void checkmax(T &a, T b) { if (b > a) a = b; } t...
#include <bits/stdc++.h> using namespace std; const int oo = numeric_limits<int>::max(); const long long M = 998244353, MAXN = 1e6 + 10; long long n, c[MAXN]; long long mp(long long a, long long e) { long long ret = 1; while (e) { if (e % 2) ret = ret * a % M; a = a * a % M; e /= 2; ...
#include <bits/stdc++.h> using namespace std; map<string, int> m1; map<int, string> m2; pair<long long, long long> r[128]; long long H[128], V[128], B[128], S[128]; vector<int> g1[128], g2[128]; int G[128]; int main() { memset(H, 0, sizeof H); memset(V, 0, sizeof V); memset(G, 0, sizeof G); ...
#include <bits/stdc++.h> using namespace std; const int sh = 1e6; const int ppr = 257; const long long INF = 1e18; const int inf = 1e9; const int mod = 1e9 + 7; const int N = 6e5 + 123; const long double pi = 3.141592653589793238462643; const int dx[] = {1, 0, -1, 0}; const int dy[] = {0, 1, 0, -1};...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cout.tie(NULL); cin.tie(NULL); ; int n, m; cin >> n >> m; set<long long> s; long long ans = 0; long long a[n]; long long b[m]; long long mx = 0; map<long long, long long> mp; ...
#include <bits/stdc++.h> using namespace std; int val[100005], Max[100005], Min[100005]; int n; int lef[100005], rig[100005]; void dfs(int r) { if (lef[r] == 0) { Max[r] = Min[r] = val[r]; return; } dfs(lef[r]); dfs(rig[r]); Max[r] = Max[rig[r]]; Min[r] = Min[lef[r]]; } ...
#include <bits/stdc++.h> using namespace std; int a, b, c; int f[2001 * 2001]; int _GCD[2001][2001]; int GCD(int a, int b) { if (_GCD[a][b]) return _GCD[a][b]; if (!b) return a; return _GCD[a][b] = GCD(b, a % b); } int phi(int x) { if (x & 1) return -1; return 1; } int main() { ...
#include <bits/stdc++.h> using namespace std; int ans; int father[1100]; int find(int x) { if (father[x] == x) return x; father[x] = find(father[x]); return father[x]; } bool Union(int x, int y) { int f1 = find(x); int f2 = find(y); if (f1 == f2) return false; if (f1 < f2) ...
#include<bits/stdc++.h> using namespace std; const int N=1e5+77,B=330; int n,q,a[N],t[N],b[N],l[N],r[N],m,g[N]; int nx(int x){return max(1,a[x]-t[b[x]]); } int jp(int x){if(t[b[x]]>=B)return nx(x); return g[x]; } void reb(int x) { for(int i=l[x]; i<=r[x]; i++) { int j=nx(i); if(j<l[x]) ...
#include <bits/stdc++.h> using namespace std; int main() { int n; int i, j; char s[1000]; while (gets(s)) { int l = strlen(s); n = 0; int num_jian = 0, num_jia = 1; for (i = 0; i < l; ++i) { if (s[i] == = ) { i += 2; while (i != l) { n...
#include <bits/stdc++.h> using namespace std; const int MAX = 66; int power[MAX + 10]; int between[MAX + 10]; int extra[MAX + 10]; int ende[MAX + 10]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) { long long foo; cin >> foo; int cc = 0; bool good = true; ...
#include <bits/stdc++.h> using namespace std; int const N = int(2e5) + 7; int const mod = int(1e9) + 7; int a[N]; int ra[N], le[N]; int raB[N][31], leB[N][31]; int main() { ios_base::sync_with_stdio(false); ifstream in( input.txt ); int n; cin >> n; vector<int> st; for (int i = 1; ...
#include <bits/stdc++.h> using namespace std; int n, i, buc[26], cnt = 0, ok = 0, j, m, cntt = 0, dfn = 0, pre; char a[2], s[100005]; int main() { scanf( %d , &n); pre = dfn; cntt = 26; for (i = 1; i <= n; i++) { scanf( %s%s , a, s); if (ok == 1) { if (a[0] == ! ) cnt++; ...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; long double a, b; int d; while (n > 0) { n -= 1; cin >> a >> b; if (a == b) { d = 0; } else if (a > b) { d = ceil((a - b) / 10); } else if (a < b) { d = ceil((b - a) ...
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; int gi() { int x = 0, o = 1; char ch = getchar(); while ((ch < 0 \|\| ch > 9 ) && ch != - ) ch = getchar(); if (ch == - ) o = -1, ch = getchar(); while (ch >= 0 && ch <= 9 ) x = x * 10 + ch - 0 , ch = getchar(); r...
#include <bits/stdc++.h> using namespace std; const int maxn = 100 + 10; vector<int> v[maxn]; set<int> s; int num[maxn]; bool cmp(int x, int y) { return num[x] > num[y]; } int main() { int n, m, k; cin >> n >> m >> k; for (int i = 1; i <= n; i++) cin >> num[i]; for (int i = 1; i <= n; i++)...
#include <bits/stdc++.h> using namespace std; bool f(int k, int n) { int s = k; while (k > 0) { s += k % 10; k /= 10; } return s == n; } int main() { int i, n; vector<int> ans; cin >> n; for (i = n - 100; i <= n + 100; ++i) { if (f(i, n)) { ans.push_back...
#include <bits/stdc++.h> using namespace std; const int Maxn = 100000 + 10; const double PI = M_PI; const double eps = 1e-8; int dcmp(double a) { if (fabs(a) < eps) return 0; if (a > 0) return 1; return -1; } struct Point { double x, y; Point operator+(const Point &A) { return (Point){...
#include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; int vis[26], cnt[26], h[26]; set<int> e[26]; vector<string> S[1005]; int mp[26]; bool operator<=(string a, string b) { for (int i = 0; i < min(a.size(), b.size()); i++) { if (a[i] == b[i]) continue;...
#include <bits/stdc++.h> using namespace std; int d[6][3] = {{1, 0, 0}, {-1, 0, 0}, {0, 1, 0}, {0, -1, 0}, {0, 0, 1}, {0, 0, -1}}; int main() { int k, n, m, sn, sm, ans = 0; cin >> k >> n >> m; string plate[k][n]; bool visited[k][n][m]; for (int i = 0; i < k; i++) for ...
#include <bits/stdc++.h> using namespace std; int n, a, b; int main() { int t; cin >> t; while (t--) { cin >> n >> a >> b; if (abs(a - b) > 1 \|\| a + b > n - 2) cout << -1; else { int l, r, x; x = a + b; if (a == b) { l = n, r = n - x; ...
#include <bits/stdc++.h> using namespace std; const int maxn = 1234567; int query(vector<long long> a) { int n = a.size(); for (int i = 2; i * i <= n; i++) { if (n % i == 0) { if (n % (i * i) != 0) { for (int j = 0; j < n; j += i) { long long d = a[j]; int k...
#include <bits/stdc++.h> using namespace std; const int N = 500010; int k, n, maxb, t, b[N], tot = 1, dp[N << 2], rec[N << 2]; void update(int i, int x) { while (i <= tot) { dp[i] = max(dp[i], x); i += i & -i; } } int sum(int i) { int ret = 0; while (i) { ret = max(ret, dp[...
#include <bits/stdc++.h> using namespace std; const long MAX_N = 1e3 + 1; long n, m, h; long aw[MAX_N]; long bw[MAX_N]; vector<long> g[MAX_N]; bool v[MAX_N]; vector<long> st; vector<pair<pair<long, long>, long> > ans; void add_edge(long a, long b) { g[a].push_back(b); g[b].push_back(a); } ...
#include <bits/stdc++.h> using namespace std; int main() { string str; getline(cin, str); str.erase(remove(str.begin(), str.end(), ), str.end()); int n = str.size(); if (str[n - 2] == a \|\| str[n - 2] == e \|\| str[n - 2] == i \|\| str[n - 2] == o \|\| str[n - 2] == u \|\| str[n - 2]...
#include <bits/stdc++.h> using namespace std; string s; int main() { cin >> s; long long mid; for (long long i = 0; i < s.size(); i++) { if (s[i] == ^ ) { mid = i; break; } } long long sum = 0; for (long long i = 0; i < s.size(); i++) { if (s[i] == = \|\|...
#include <bits/stdc++.h> using namespace std; const int inf = int(1e9) + 1; const long double eps = 1e-9; map<string, int> jogos; map<string, int> pontos; map<string, int> gol; map<string, int> leva; set<string> times; vector<string> falta; int x1, x2; bool menor(string x, string y) { int g1 =...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long t, a, b, c; cin >> t; while (t--) { cin >> a >> b >> c; cout << ((a + b * 2 + c * 3) & 1) << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; void swap(long long int arr[], long long int x, long long int y) { long long int temp = arr[x]; arr[x] = arr[y]; arr[y] = temp; } void print_arr(long long int arr[], long long int n) { cout << n ; for (long long int i = 0; i < n; i++) { c...
#include <bits/stdc++.h> using namespace std; int digitMask = 0; int c[20]; int factorize(int n, int pos) { int curPos = pos; c[curPos] = 0; while (n > 0) c[curPos++] = n % 10, n /= 10; curPos--; curPos = max(curPos, pos); for (int i = pos, j = curPos; i < j; i++, j--) swap(c[i], c[j]); ...
#include <bits/stdc++.h> using namespace std; const long long modn = 1000000007; inline long long mod(long long x) { return x % modn; } int n; vector<int> v[30]; int qt[30]; int main() { int i, j; string s; cin >> s; n = s.size(); for (i = 0; i < n; i++) v[s[i] - a ].push_back(i); ...
#include <bits/stdc++.h> using namespace std; template <class temp> inline void Rd(temp &p) { p = 0; char c; while (c = getchar(), c < 48) ; do p = p * 10 + (c & 15); while (c = getchar(), c > 47); } int n, k, len, m, q[200005]; int l[200005], r[200005]; int lfind(int x) { if...

#include <bits/stdc++.h> using namespace std; int father[18000010], nRow, nCol; bool col[3010][3010 * 2]; int movex[] = {1, 1, 1, 0, 0, -1, -1, -1}; int movey[] = {-1, 0, 1, 1, -1, -1, 0, 1}; int Find(int p, int *father) { if (father[p] != p) father[p] = Find(father[p], father); return father[p]; ...

#include <bits/stdc++.h> using namespace std; int n, Q; string s[200200]; int ep[200200]; int len[200200]; struct data { int to, nxt; } mp[400400]; int head[200200], cnt; void link(int x, int y) { mp[++cnt].to = y; mp[cnt].nxt = head[x]; head[x] = cnt; } int id[200200], clk; int ...

#include <bits/stdc++.h> using namespace std; template <class T> void splitstr(const string &s, vector<T> &out) { istringstream in(s); out.clear(); copy(istream_iterator<T>(in), istream_iterator<T>(), back_inserter(out)); } template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; ...

#include <bits/stdc++.h> const double eps = 1e-10; const float epsf = 1e-6; const int mod = 1000000007; using namespace std; inline long long int __gcd(long long int a, long long int b) { if (a == 0 || b == 0) { return max(a, b); } long long int tempa, tempb; while (1) { if (a % b ...

#include <bits/stdc++.h> const int MAXN = 2e5 + 10; const double eps = 1e-8; const int mod1 = 1e9 + 7; const int mod2 = 1e9 + 9; using namespace std; struct edge { int t, v; edge *next; } e[MAXN << 1], *h[MAXN], *o = e; void add(int x, int y, int vul) { o->t = y; o->v = vul; o->next ...

#include <bits/stdc++.h> using namespace std; template <class T> using v2d = vector<vector<T> >; template <class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; } template <class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; } mt19937 rng(chrono::system_clock:...

#include <bits/stdc++.h> using namespace std; const int N = 20; int a[N], b[N], c[N], d[N], ln[N], rn[N], lm[N], rm[N]; int main() { int n, m; cin >> n >> m; for (int i = 1; i <= n; i++) { cin >> a[i] >> b[i]; if (a[i] > b[i]) swap(a[i], b[i]); } set<int> st; for (int i = 1; ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 5; const int oo = 0x3f3f3f3f; const int LIM = 2e5; int N, a[MAXN], num[MAXN], top, f[MAXN], ans[MAXN]; vector<int> S[MAXN]; int gcd(int a, int b) { return !b ? a : gcd(b, a % b); } namespace Graph { struct edge { int y, next; }...

#include <bits/stdc++.h> int n, m; int main() { int i, j, T; long long k, total, w; while (scanf( %I64d%I64d%I64d , &k, &total, &w) != EOF) { long long ans = (1 + w) * w / 2; ans *= k; if (ans - total >= 0) printf( %I64d n , ans - total); else printf( 0 n ); }...

#include <bits/stdc++.h> using namespace std; const int maxn = 1000000 + 5; const int inf = 0x3f3f3f3f; int n; char y[maxn * 2], a[maxn * 2]; int main() { cin >> n; scanf( %s , y); scanf( %s , a); int ycnt = 0; for (int i = 0; i < n * 2; i++) { if (y[i] == 1 ) ycnt++; } in...

//Iamskk// #include <iostream> #include <iosfwd> #include <iomanip> #include <cstdio> #include <cstring> #include <cstdlib> #include <ctime> #include <cmath> #include <cassert> #include <cctype> #include <climits> #include <vector> #include <bitset> #include <set> #include <queue> #inclu...

#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int maxn = 2e6 + 10; int main() { ios::sync_with_stdio(false); cin.tie(0); int n, m, k; cin >> n >> m >> k; if (n == 1 && m == 1) { cout << 0 ; return 0; } if (n * m == 2) { cout << 4 nUD...

#include <bits/stdc++.h> #pragma warning(disable : 4996) using namespace std; using namespace std; const double eps = 1e-8; const double pi = acos(-1.0); inline double sqr(double x) { return x * x; } int cmp(double x) { if (fabs(x) < eps) return 0; if (x > 0) return 1; return -1; } int n; ...

#include <bits/stdc++.h> using namespace std; int p[6005], q[6005]; bool check(int a, int b, int x) { return x > a && x < b; } bool check2(int a, int b, int x) { return x >= a && x <= b; } bool isOK(int a, int b) { return a == b; } int sx[1005], sy[1005]; int main() { int n, t, i, j, a, x, k; mems...

#include <bits/stdc++.h> using namespace std; int main() { long long int n, b; cin >> n >> b; std::vector<long long int> v(n); long long int maxp = 0, minp = 0; long long int m1, m2 = 0; for (long long int i = 0; i < n; ++i) { cin >> v[i]; if (i == 0) m1 = v[i]; if (m2 < v[...

#include <bits/stdc++.h> using namespace std; vector<int> v[20001]; struct triplet { int x, y, z, sum; }; int a, b, c; void init() { for (int i = 1; i <= 20000; ++i) { for (int j = i; j <= 20000; j += i) v[j].push_back(i); } } triplet calc(int n) { triplet res; int ans = 100000...

#include <bits/stdc++.h> using namespace std; int main(void) { int n; int answer = -1; long sum_x[2] = {0}; long sum_y[2] = {0}; int nr[2] = {0}; int i; scanf( %d n , &n); for (i = 0; i < n; i++) { int t, x, y; scanf( %d %d %d n , &t, &x, &y); if (t == 1) { ...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:102400000,102400000 ) using namespace std; int main() { int n, m; cin >> n >> m; int ret = 0; while (n--) { char str[1009]; int cnt = 0; scanf( %s , str); int flag = 1; for (int i = 0; str[i]; i++) { if ...

#include <bits/stdc++.h> using namespace std; struct query { int k, pos, ind; } queries[200005]; struct arr { int val, ind; } a[200005]; long long n, q, cnt, res[200005], fw[200005], it[4 * 200005], len, b[200005]; bool cmp(arr a, arr b) { if (a.val != b.val) return a.val > b.val; return a...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long n, i, j, a[1000005], b[1000005], p = 0, q = 0, m, temp = 0, flag = 0, ans, r = 0, s = 0; vector<long long> v; s...

#include <bits/stdc++.h> using namespace std; int main() { int n, m; scanf( %d%d , &n, &m); if (m < n - 1 || m > 2 * (n + 1)) { printf( -1 n ); } else if (m == n || m == n - 1) { int flg = 0; while (m || n) { if (!flg) { printf( 0 ); n--; flg =...

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

#include <bits/stdc++.h> using namespace std; const long long INF = 99999999999999999; long long n, value[200000], zarib[200000], LCM = 1, GCD, x = INF, ans, sum; vector<int> Tree[200000]; long long gcd(long long l, long long r) { if (!l) return r; return gcd(r % l, l); } bool dfs(int v, int last,...

#include <bits/stdc++.h> const int maxn = 100001; int n, i, u, v, top, a[maxn], spt[maxn], vt[maxn], st[maxn], l[maxn]; long long sum, ans, tmp, val[maxn], uc, bc, ss, min; std::vector<int> adj[maxn]; void dfs() { top = 1; st[1] = 1; while (top > 0) { u = st[top]; if (vt[u] < spt[u] &&...

#include <bits/stdc++.h> int value(const std::vector<int>& xs, int base, int i) { return (xs[(base + i) % xs.size()] + 10 - xs[base]) % 10; } bool lt(const std::vector<int>& xs, int a, int b) { int N = xs.size(); for (int i = 0; i < N; ++i) { int va = value(xs, a, i), vb = value(xs, b, i); ...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int long long n, a[60], mx = 2000; scanf( %lld , &n); for (int i = 0; i < n; i++) { scanf( %lld , &a[i]); } sort(a, a + n); for (int i = 1; i < n; i++) { mx = min...

#include <bits/stdc++.h> using namespace std; const int N = 1000005; long long f[N], g[N], a[N], ans; int n, F1, F2, F3, F4, F5, F6, k; inline void upd(long long &x, long long y) { if (x < y) x = y; } inline int calc(int y, int x) { if (x * 9 < y) return -1e9; if (y % 3 == 0) return y / 3; ...

#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { while (b) { int r = a % b; a = b; b = r; } return a; } int64_t lcm(int a, int b) { return 1LL * a * b / gcd(a, b); } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n; cin >...

#include <bits/stdc++.h> using namespace std; int main() { int t = 1; while (t--) { int n, k, inits[26]; char str[101]; bool poss = false, started[26] = {false}; scanf( %d%s , &k, str); n = strlen(str); if (n < k) { puts( NO ); break; } int cnt...

#include <bits/stdc++.h> using namespace std; bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) { return (a.second < b.second); } long long int gcd(long long int a, long long int b) { if (b == 0) return a; return gcd(b, a % b); } long long int lcm(long long int a, long long int b)...

#include <bits/stdc++.h> using namespace std; const int maxn = 5000; const long long MOD = 1000000007; long long D[maxn][maxn]; long long n, k; int main() { cin >> n >> k; D[0][0] = 1; --k; for (int i = 0; i < n; ++i) { int x; cin >> x; D[(1 << k)][i + 1] = D[(1 << k)][i]; ...

#include <bits/stdc++.h> using namespace std; const int N = 20; const int mod = 998244353; struct node { int sum, tot; node(){}; node(int S, int T) { sum = S; tot = T; } bool check() { return ~sum && ~tot; } } f[2][2][N][1 << 10]; int A[N], ret, pw[30], k; int lowbit(int x)...

#include <bits/stdc++.h> using namespace std; const int N = 1005; const int dx[] = {0, 0, -1, 1}; const int dy[] = {-1, 1, 0, 0}; char mat[N][N]; int dist[N][N][3]; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m; cin >> n >> m; for (int i = 0; i < n...

#include <bits/stdc++.h> using namespace std; const int N = 1100; template <class nmsl> inline void read(nmsl &x) { x = 0; char ch = getchar(), w = 0; while (!isdigit(ch)) w = (ch == - ), ch = getchar(); while (isdigit(ch)) x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar(); x = w ? -x : x...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 100; const double PI = 3.14159; vector<string> v; long long n, m, k, d, ans[101], c, sum, a[105][105]; set<string> st; string s, b; bool flag; set<string>::iterator it; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL);...

#include <bits/stdc++.h> using namespace std; const int U = 200; const int M = U + 5; int n; long double p, q; long double f[M][M], F[M][M]; long double a[M][M]; long double C[M][M]; void input() { int pp; scanf( %d %d , &n, &pp); p = pp / 1000000000.; q = p * (1 - p); } void prepa...

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

#include <bits/stdc++.h> using namespace std; int n, m; string grid[101]; int nb, l = 200, r = -1, u = 200, d = -1; int main() { scanf( %d %d , &n, &m); for (int i = 0; i < n; i++) cin >> grid[i]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) if (grid[i][j] == B ) { ...

#include <bits/stdc++.h> using namespace std; const int N = (int)5e5 + 50; int n; int ans[N]; vector<int> G[N]; int q[N]; int dep[N]; vector<pair<int, int> > hist[N]; void upd(int u, int val) { q[u] = max(q[u], val); } void calc(int v, int p) { dep[v] = 0; for (int nxt : G[v]) { if (nx...

#include <bits/stdc++.h> using namespace std; const long long inf = 0x3f3f3f3f3f3f3f3f; int n, m, a[100010]; int tot[100010], Lpos = 1, Rpos = 0; long long f[100010], g[100010], MO; inline int read() { int x = 0, w = 0; char ch = 0; while (!isdigit(ch)) { w |= ch == - ; ch = getchar...

#include <bits/stdc++.h> using namespace std; const int inf = (int)1e9; const double eps = (double)1e-8; const int mod = (int)1000000007; const int maxn = (int)2 * 1e5 + 5; int n, x, y, mx; int u[maxn], pr[maxn]; pair<int, int> t[maxn]; vector<pair<int, int> > a[maxn]; vector<int> ans; list<int> q...

#include <bits/stdc++.h> using namespace std; const int N = 1e5; int vl[N + 2], tim, st[N + 2]; int par[N + 2], level[N + 2]; int sp[N + 2][22], n, ed[N + 2]; long long seg[5 * N], lazy[5 * N]; vector<int> adj[N + 2]; void too_lazy(int node, int lo, int hi) { seg[node] += (lazy[node] * 1LL * (hi - l...

#include <bits/stdc++.h> using namespace std; string k; long long n; long long Judge(int L, int R) { int flag = 0; for (int i = L; i <= R; i++) { if (k[i] != 0 ) flag = 1; } if (flag == 1 && k[L] == 0 ) return -1; long long ans = 0; for (int i = L; i <= R; i++) { ans = (ans...

#include <bits/stdc++.h> using namespace std; const int maxN = 5000 + 5; const int lim = 1000 * 1000 * 1000; const int inf = 1000 * 1000 * 1000 + 5; int a[maxN]; vector<int> v[maxN]; int main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; for (int i = 0; i < n; i++) cin >> a...

#include <bits/stdc++.h> const int INF = 1e9 + 7; const int MAXN = 3e5 + 10; using namespace std; int main() { int a, b, c, d; cin >> a >> b >> c >> d; for (int i = a; i <= 2 * a; i++) { for (int j = b; j <= 2 * b; j++) { for (int k = c; k <= 2 * c; k++) { if (i > j && j > k ...

#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const double EPS = 1e-9; int T, n; int num[1000015], p[1000015], cnt, sum[1000015]; int main() { scanf( %d , &T); while (T--) { scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %d , &p[i]); } ...

#include <algorithm> #include <iostream> #include <map> #include <vector> using namespace std; using LL = long long; #define mk make_pair const int MAX_N = 3E5 + 100; const int MAX_LOG_N = 18 + 1; int n, m; vector<int> G[MAX_N]; //================================= int log2Static[M...

#include <bits/stdc++.h> #pragma warning(disable : 4996) using namespace std; long long int a[100010]; int n; int main() { int i, j; while (scanf( %d , &n) != EOF) { for (i = 1; i <= n; i++) { scanf( %lld , &a[i]); } sort(a + 1, a + 1 + n); long long sum = a[1]; i...

#include <bits/stdc++.h> using namespace std; const int MAXN = 105; const double EPS = 1e-9; int n, k; double e; int px0, py0; int x[MAXN], y[MAXN]; double dp[MAXN][2]; double dist(int x1, int y1, int x2, int y2) { return sqrt(pow(x1 - x2, 2) + pow(y1 - y2, 2)); } double prob(int ind, double r...

#include <bits/stdc++.h> using namespace std; long long int dp[100010]; long long int sum[100010]; int main() { int n; int k; int m; cin >> m >> k; dp[0] = 1; for (int i = 1; i < k; i++) { dp[i] = 1; } for (int i = k; i <= 100002; i++) { dp[i] = (dp[i - 1] + dp[i - k]...

#include <bits/stdc++.h> using namespace std; template <typename T1, typename T2> inline T1 max(T1 a, T2 b) { return a < b ? b : a; } template <typename T1, typename T2> inline T1 min(T1 a, T2 b) { return a < b ? a : b; } const char lf = n ; namespace ae86 { const int bufl = 1 << 15; cha...

#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; template <typename T> vector<T>& operator--(vector<T>& v) { for (auto& i : v) --i; return v; } template <typename T> vector<T>& operator++(vector<T>& v) { for (auto& i : v) ++i; return v; } te...

#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( Ofast ) const long long maxn = 3000 + 10, N = 2e5 + 10, SQ = 320, base = 800287, mod = 1e9 + 7, INF = 1e18 + 10, lg = 22; const long double eps = 1e-4; long long n, m, q, dis[maxn][maxn], res[N]; long long V[N], U[N], r[N]...

#include <bits/stdc++.h> using namespace std; const long long MAX_N = 1e3 + 10, INF = 1e18; long long n, m, k, a[MAX_N][MAX_N], noe[MAX_N]; long long lab[MAX_N], dp[MAX_N][MAX_N]; pair<long long, long long> tar[MAX_N]; void filldp() { dp[m + n - 1][0] = 1; for (int i = m + n - 2; i >= 1; i--) { ...

#include <bits/stdc++.h> long long srf(int a, int b, int c) { std::cout << 1 << (a + 1) << << (b + 1) << << (c + 1) << std::endl; long long val; std::cin >> val; return val; } bool scl(int a, int b, int c) { std::cout << 2 << (a + 1) << << (b + 1) << << (c + 1) << std::en...

#include <bits/stdc++.h> using namespace std; vector<long long int> arr; vector<long long int> b; long long int l, f; long long int mid; long long int bin_s(long long int x) { l = 0; f = b.size() - 1; while (l <= f) { mid = (l + f) / 2; if (b[mid] > x) f = mid - 1; if (b[mid] <...

#include <bits/stdc++.h> using namespace std; using namespace std; long long powm(long long base, long long exp, long long mod = 1000000007) { long long ans = 1; while (exp) { if (exp & 1) ans = (ans * base) % mod; exp >>= 1, base = (base * base) % mod; } return ans; } long long n,...

#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int h = -1, e = -1, l1 = -1, l2 = -1, o = -1; for (int i = 0; i < s.size(); i++) { if (s[i] == h ) { h = i; break; } } if (h == -1) cout << NO ; else { for (int j = h ...

#include <bits/stdc++.h> using namespace std; int h, m, n; void input() { scanf( %d%d%d , &h, &m, &n); } set<int> s; int head[200010], tail[200010], cnt[200010], idx[200010], nid; void build() { for (int i = 0; i < h; i++) s.insert(i); memset(idx, -1, sizeof(idx)); memset(tail, -1, sizeof(tail))...

#include <bits/stdc++.h> using namespace std; const int MaxN = 1005; string a[MaxN], start[MaxN], finish[MaxN], st[MaxN], Fans[MaxN]; int n, m, ind, Find; int b[MaxN]; void check() { int flag = 0, flag1 = 0, i, j; ind = 0; for (i = 1; i <= n; i++) { if (b[i] == 1) { ind++; ...

#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } long long n, m, a, b, x, y; int main() { cin >> n >> m >> x >> y >> a >> b; long long k = gcd(a, b); long long kk = min(n / (a / k), m / (b / k)); a = a * kk / k, b = b * kk / ...

#include <bits/stdc++.h> using namespace std; const int N = 20005; const int len = 400; const int mod = 1e9 + 7; int n, p, q, ans[N]; struct node { int c, h, t; } a[N]; vector<int> all, in[N * 4]; vector<pair<int, int> > lazy[N]; void upd(int l, int r, int x, int v = 1, int tl = 0, int tr = all....

#include <bits/stdc++.h> using namespace std; int main() { long long int tes; cin >> tes; while (tes--) { long long int n, m; cin >> m >> n; vector<pair<long long int, long long int>> arr(n); for (long long int i = 0; i < n; i++) cin >> arr[i].first >> arr[i].second; sort(a...

#include <bits/stdc++.h> using namespace std; struct SegTree { const int INF = 1e9; vector<pair<int, int>> max_vc; vector<int> add; int h = 1; pair<int, int> combine(pair<int, int> a, pair<int, int> b) { if (a.first == b.first) return {a.first, a.second + b.second}; else ...

#include <bits/stdc++.h> using namespace std; const long long N = 1e5 + 10; const double Pi = acos(-1); inline long long read() { long long x = 0, f = 1, ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) x = x * 10 ...

#include <bits/stdc++.h> using namespace std; void solve() { long long int m; cin >> m; unsigned long long int A[m], Ap[m]; unsigned long long int B[m]; map<unsigned long long int, vector<unsigned long long int> > mp; for (long long int i = 0; i < m; i++) { cin >> B[i]; } for (...

#include <bits/stdc++.h> using namespace std; int const MAX = 200 * 1000 + 41; long double const EPS = 1e-12; bool eq(long double a, long double b) { return abs(a - b) < EPS; } bool leq(long double a, long double b) { return (a < b || eq(a, b)); } int n, w; int x[MAX]; int v[MAX]; pair<long double, lo...

#include <bits/stdc++.h> using namespace std; const int nax = 1e5 + 5; vector<int> w[nax]; bool del[nax]; int legs[nax]; void dfs(int a, int par = 0) { if (w[a].size() <= 2) { del[a] = true; for (int i = 0; i < w[a].size(); i++) { int b = w[a][i]; if (b != par) dfs(b, a); ...

#include <bits/stdc++.h> using namespace std; const int intmax = 0x3f3f3f3f; const long long lldmax = 0x3f3f3f3f3f3f3f3fll; double eps = 1e-8; template <class T> inline void checkmin(T &a, T b) { if (b < a) a = b; } template <class T> inline void checkmax(T &a, T b) { if (b > a) a = b; } t...

#include <bits/stdc++.h> using namespace std; const int oo = numeric_limits<int>::max(); const long long M = 998244353, MAXN = 1e6 + 10; long long n, c[MAXN]; long long mp(long long a, long long e) { long long ret = 1; while (e) { if (e % 2) ret = ret * a % M; a = a * a % M; e /= 2; ...

#include <bits/stdc++.h> using namespace std; map<string, int> m1; map<int, string> m2; pair<long long, long long> r[128]; long long H[128], V[128], B[128], S[128]; vector<int> g1[128], g2[128]; int G[128]; int main() { memset(H, 0, sizeof H); memset(V, 0, sizeof V); memset(G, 0, sizeof G); ...

#include <bits/stdc++.h> using namespace std; const int sh = 1e6; const int ppr = 257; const long long INF = 1e18; const int inf = 1e9; const int mod = 1e9 + 7; const int N = 6e5 + 123; const long double pi = 3.141592653589793238462643; const int dx[] = {1, 0, -1, 0}; const int dy[] = {0, 1, 0, -1};...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cout.tie(NULL); cin.tie(NULL); ; int n, m; cin >> n >> m; set<long long> s; long long ans = 0; long long a[n]; long long b[m]; long long mx = 0; map<long long, long long> mp; ...

#include <bits/stdc++.h> using namespace std; int val[100005], Max[100005], Min[100005]; int n; int lef[100005], rig[100005]; void dfs(int r) { if (lef[r] == 0) { Max[r] = Min[r] = val[r]; return; } dfs(lef[r]); dfs(rig[r]); Max[r] = Max[rig[r]]; Min[r] = Min[lef[r]]; } ...

#include <bits/stdc++.h> using namespace std; int a, b, c; int f[2001 * 2001]; int _GCD[2001][2001]; int GCD(int a, int b) { if (_GCD[a][b]) return _GCD[a][b]; if (!b) return a; return _GCD[a][b] = GCD(b, a % b); } int phi(int x) { if (x & 1) return -1; return 1; } int main() { ...

#include <bits/stdc++.h> using namespace std; int ans; int father[1100]; int find(int x) { if (father[x] == x) return x; father[x] = find(father[x]); return father[x]; } bool Union(int x, int y) { int f1 = find(x); int f2 = find(y); if (f1 == f2) return false; if (f1 < f2) ...

#include<bits/stdc++.h> using namespace std; const int N=1e5+77,B=330; int n,q,a[N],t[N],b[N],l[N],r[N],m,g[N]; int nx(int x){return max(1,a[x]-t[b[x]]); } int jp(int x){if(t[b[x]]>=B)return nx(x); return g[x]; } void reb(int x) { for(int i=l[x]; i<=r[x]; i++) { int j=nx(i); if(j<l[x]) ...

#include <bits/stdc++.h> using namespace std; int main() { int n; int i, j; char s[1000]; while (gets(s)) { int l = strlen(s); n = 0; int num_jian = 0, num_jia = 1; for (i = 0; i < l; ++i) { if (s[i] == = ) { i += 2; while (i != l) { n...

#include <bits/stdc++.h> using namespace std; const int MAX = 66; int power[MAX + 10]; int between[MAX + 10]; int extra[MAX + 10]; int ende[MAX + 10]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) { long long foo; cin >> foo; int cc = 0; bool good = true; ...

#include <bits/stdc++.h> using namespace std; int const N = int(2e5) + 7; int const mod = int(1e9) + 7; int a[N]; int ra[N], le[N]; int raB[N][31], leB[N][31]; int main() { ios_base::sync_with_stdio(false); ifstream in( input.txt ); int n; cin >> n; vector<int> st; for (int i = 1; ...

#include <bits/stdc++.h> using namespace std; int n, i, buc[26], cnt = 0, ok = 0, j, m, cntt = 0, dfn = 0, pre; char a[2], s[100005]; int main() { scanf( %d , &n); pre = dfn; cntt = 26; for (i = 1; i <= n; i++) { scanf( %s%s , a, s); if (ok == 1) { if (a[0] == ! ) cnt++; ...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; long double a, b; int d; while (n > 0) { n -= 1; cin >> a >> b; if (a == b) { d = 0; } else if (a > b) { d = ceil((a - b) / 10); } else if (a < b) { d = ceil((b - a) ...

#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; int gi() { int x = 0, o = 1; char ch = getchar(); while ((ch < 0 || ch > 9 ) && ch != - ) ch = getchar(); if (ch == - ) o = -1, ch = getchar(); while (ch >= 0 && ch <= 9 ) x = x * 10 + ch - 0 , ch = getchar(); r...

#include <bits/stdc++.h> using namespace std; const int maxn = 100 + 10; vector<int> v[maxn]; set<int> s; int num[maxn]; bool cmp(int x, int y) { return num[x] > num[y]; } int main() { int n, m, k; cin >> n >> m >> k; for (int i = 1; i <= n; i++) cin >> num[i]; for (int i = 1; i <= n; i++)...

#include <bits/stdc++.h> using namespace std; bool f(int k, int n) { int s = k; while (k > 0) { s += k % 10; k /= 10; } return s == n; } int main() { int i, n; vector<int> ans; cin >> n; for (i = n - 100; i <= n + 100; ++i) { if (f(i, n)) { ans.push_back...

#include <bits/stdc++.h> using namespace std; const int Maxn = 100000 + 10; const double PI = M_PI; const double eps = 1e-8; int dcmp(double a) { if (fabs(a) < eps) return 0; if (a > 0) return 1; return -1; } struct Point { double x, y; Point operator+(const Point &A) { return (Point){...

#include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; int vis[26], cnt[26], h[26]; set<int> e[26]; vector<string> S[1005]; int mp[26]; bool operator<=(string a, string b) { for (int i = 0; i < min(a.size(), b.size()); i++) { if (a[i] == b[i]) continue;...

#include <bits/stdc++.h> using namespace std; int d[6][3] = {{1, 0, 0}, {-1, 0, 0}, {0, 1, 0}, {0, -1, 0}, {0, 0, 1}, {0, 0, -1}}; int main() { int k, n, m, sn, sm, ans = 0; cin >> k >> n >> m; string plate[k][n]; bool visited[k][n][m]; for (int i = 0; i < k; i++) for ...

#include <bits/stdc++.h> using namespace std; int n, a, b; int main() { int t; cin >> t; while (t--) { cin >> n >> a >> b; if (abs(a - b) > 1 || a + b > n - 2) cout << -1; else { int l, r, x; x = a + b; if (a == b) { l = n, r = n - x; ...

#include <bits/stdc++.h> using namespace std; const int maxn = 1234567; int query(vector<long long> a) { int n = a.size(); for (int i = 2; i * i <= n; i++) { if (n % i == 0) { if (n % (i * i) != 0) { for (int j = 0; j < n; j += i) { long long d = a[j]; int k...

#include <bits/stdc++.h> using namespace std; const int N = 500010; int k, n, maxb, t, b[N], tot = 1, dp[N << 2], rec[N << 2]; void update(int i, int x) { while (i <= tot) { dp[i] = max(dp[i], x); i += i & -i; } } int sum(int i) { int ret = 0; while (i) { ret = max(ret, dp[...

#include <bits/stdc++.h> using namespace std; const long MAX_N = 1e3 + 1; long n, m, h; long aw[MAX_N]; long bw[MAX_N]; vector<long> g[MAX_N]; bool v[MAX_N]; vector<long> st; vector<pair<pair<long, long>, long> > ans; void add_edge(long a, long b) { g[a].push_back(b); g[b].push_back(a); } ...

#include <bits/stdc++.h> using namespace std; int main() { string str; getline(cin, str); str.erase(remove(str.begin(), str.end(), ), str.end()); int n = str.size(); if (str[n - 2] == a || str[n - 2] == e || str[n - 2] == i || str[n - 2] == o || str[n - 2] == u || str[n - 2]...

#include <bits/stdc++.h> using namespace std; string s; int main() { cin >> s; long long mid; for (long long i = 0; i < s.size(); i++) { if (s[i] == ^ ) { mid = i; break; } } long long sum = 0; for (long long i = 0; i < s.size(); i++) { if (s[i] == = ||...

#include <bits/stdc++.h> using namespace std; const int inf = int(1e9) + 1; const long double eps = 1e-9; map<string, int> jogos; map<string, int> pontos; map<string, int> gol; map<string, int> leva; set<string> times; vector<string> falta; int x1, x2; bool menor(string x, string y) { int g1 =...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long t, a, b, c; cin >> t; while (t--) { cin >> a >> b >> c; cout << ((a + b * 2 + c * 3) & 1) << n ; } return 0; }

#include <bits/stdc++.h> using namespace std; void swap(long long int arr[], long long int x, long long int y) { long long int temp = arr[x]; arr[x] = arr[y]; arr[y] = temp; } void print_arr(long long int arr[], long long int n) { cout << n ; for (long long int i = 0; i < n; i++) { c...

#include <bits/stdc++.h> using namespace std; int digitMask = 0; int c[20]; int factorize(int n, int pos) { int curPos = pos; c[curPos] = 0; while (n > 0) c[curPos++] = n % 10, n /= 10; curPos--; curPos = max(curPos, pos); for (int i = pos, j = curPos; i < j; i++, j--) swap(c[i], c[j]); ...

#include <bits/stdc++.h> using namespace std; const long long modn = 1000000007; inline long long mod(long long x) { return x % modn; } int n; vector<int> v[30]; int qt[30]; int main() { int i, j; string s; cin >> s; n = s.size(); for (i = 0; i < n; i++) v[s[i] - a ].push_back(i); ...

#include <bits/stdc++.h> using namespace std; template <class temp> inline void Rd(temp &p) { p = 0; char c; while (c = getchar(), c < 48) ; do p = p * 10 + (c & 15); while (c = getchar(), c > 47); } int n, k, len, m, q[200005]; int l[200005], r[200005]; int lfind(int x) { if...