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

func_code_string stringlengths 59 71.4k
#include <bits/stdc++.h> const int mod = 998244353; using namespace std; int a[200010], b[200010]; void solve() { int n; cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; int x; for (int i = 1; i <= n; i++) cin >> x, b[i] = a[i] - x; sort(b + 1, b + n + 1); long long ans = 0; f...
#include <bits/stdc++.h> using namespace std; void swapll(long long a, long long b) { long long tmp = a; a = b; b = tmp; } void swapc(char a, char b) { char tmp = a; a = b; b = tmp; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long...
#include <bits/stdc++.h> using namespace std; int main() { int n, x = 0, y; int a[100]; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; } for (int i = 0; i < n; i++) { x = max(x, a[i]); } y = a[n - 1]; printf( %d , y ^ x); }
#include <bits/stdc++.h> using namespace std; const int N = 250; int t, a[N]; void read_input() { for (int i = 0; i < N; i++) cin >> a[i]; } void solve() { int sum = 0; for (int i = 0; i < N; i++) sum += a[i] * a[i]; double P = sqrt(1. * sum / N); for (int i = 0; i < N; i++) if (ab...
#include <bits/stdc++.h> using namespace std; int main() { long long t; cin >> t; while (t--) { long long n, m; cin >> n >> m; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { if (j == 1 \|\| i == 1) cout << B ; else { cou...
#include <bits/stdc++.h> using namespace std; int n, q; long long s[101000], d[101000], ad[101000]; int find(int l, int r, long long v) { int re = 0; while (l <= r) { int mid = (l + r) / 2; if (d[mid] <= v) { re = max(re, mid); l = mid + 1; } else { r = mid - 1;...
#include <bits/stdc++.h> using namespace std; const int maxn = 1E6 + 10; int n, a[maxn][20], b[maxn][20], c[maxn], LOG[maxn]; bool Judge(int l, int r) { int len = LOG[r - l + 1]; int A = 100 * max(a[l][len], a[r - (1 << len) + 1][len]); int B = min(b[l][len], b[r - (1 << len) + 1][len]); return ...
#include <bits/stdc++.h> using namespace std; bool found; int n, x, nums[1000], smaller, larger, eq; void Naive() { int median = ((n + 1) / 2); sort(nums, nums + n); if (nums[--median] == x) { printf( 0 ); return; } if (found) { for (int i = 0; i < n && nums[i] <= x; i++) ...
#include <bits/stdc++.h> using namespace std; const int NN = 5050; const int MM = 27272; int a[MM], b[MM]; vector<int> adj[NN]; int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 1; i <= m; i++) { scanf( %d%d , a + i, b + i); adj[a[i]].push_back(b[i]); } int mx = 0; ...
#include <bits/stdc++.h> using namespace std; long long f(long long x) { long long ans = x; while (ans) { x *= 10; x += (ans % 10); ans /= 10; } return x; } int main() { long long k, p; cin >> k; cin >> p; long long sum = 0; for (long long i = 1; i <= k; i++...
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; int a[25][50005]; const int MOD = 998244353; int add(int a, int b){ a += b; if(a >= MOD) a -= MOD; return a; } int mul(int a, int b){ return (1LLab)%MOD; } int p...
#include <bits/stdc++.h> using namespace std; long long n, x, cnt; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(0); cin >> n >> x; for (int i = 1; i <= n; i++) { if (x % i == 0 && x / i <= n) { cnt++; } } cout << cnt; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int num; cin >> num; if (num <= 9) { cout << num << endl; } else if (10 < num && num <= 189) { num = num - 9; int tmp = num / 2; tmp = 9 + tmp + num % 2; if (num % 2) cout << tmp / 10 << endl; else...
#include <bits/stdc++.h> using namespace std; int main() { int n, a, b, ans1 = 0, ans2 = 0; cin >> n; vector<int> c(n); for (int i = 0; i < n; i++) cin >> c[i]; cin >> a >> b; if (a > b) swap(a, b); a--; b--; for (int i = a; i < b; i++) { ans1 += c[i]; } for (int i ...
#include <bits/stdc++.h> using namespace std; const int N = 1e3 + 5; const int MOD = 1e9 + 7; vector<int> g[N + N]; int mat[N][N], p[N + N], sub[N + N], vis[N + N]; int ans[N + N], instack[N + N], go = true, ct = 0; vector<pair<int, int>> extime; void putNumbers(int node) { vis[node] = 1; instac...
#include<iostream> #include<string> #include<cstring> #include<cmath> #include<algorithm> #include<queue> #include<iomanip> #include<map> #include<cstdio> #include<stack> #include<set> using namespace std; #define endl n #define IOS ios::sync_with_stdio(false),cin.tie(0), cout.tie(0) typ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 5; const int LOGN = 31; int fwt[MAXN]; int P[MAXN] = {0}; int n; void update(int v, int d) { v++; for (; v <= n; v += v & -v) fwt[v] += d; } int query(int v) { int sum = 0; for (; v > 0; v -= v & -v) sum += fwt[v]; ...
#include <bits/stdc++.h> using namespace std; int main() { int count = 0, size; cin >> size; char c; vector<char> num; for (int i = 0; i < size; i++) { cin >> c; num.push_back(c); } for (int i = 0; i < num.size(); i++) { if (num[i] == 8 ) count++; if ((size / 11)...
#include <bits/stdc++.h> using namespace std; const int MAXN = 3000; vector<int> E[MAXN]; long long dp[MAXN][MAXN]; int P[MAXN][MAXN]; int T[MAXN][MAXN]; int n; bool cmp(int a, int b) { return dp[a] > dp[b]; } void dfs(int x, int p, int r) { P[r][x] = p; int d = 1; for (int i = 0; i < E[x]...
#include <bits/stdc++.h> using namespace std; class ReverseBit { public: ReverseBit(int size) : bit_(size + 1, 0) {} void Add(int pos, int num); int GetMax(int pos) const; private: static int Lsb(int num) { return num & -num; } vector<int> bit_; }; void ReverseBit::Add(int pos, int ...
#include <bits/stdc++.h> using namespace std; char s[1000010]; int main() { int k; cin >> k; scanf( %s , s); int n = strlen(s); int a[n + 1]; a[0] = 0; for (int i = 1; i < n + 1; i++) { a[i] = a[i - 1] + ((s[i - 1] == 1 ) ? 1 : 0); } long long int ans = 0; for (int i...
#include <bits/stdc++.h> using namespace std; void __print(long long x) { cerr << x; } void __print(long x) { cerr << x; } void __print(unsigned x) { cerr << x; } void __print(unsigned long x) { cerr << x; } void __print(unsigned long long x) { cerr << x; } void __print(float x) { cerr << x; } void __pr...
#include <bits/stdc++.h> using namespace std; const long long maxx = 1e6 + 7; const long long maxn = 1e6 + 7; const long long mod = 998244353; const long long maxs = 500000 + 7; const long long maxm = 400000 + 7; const long long maxk = 1008 + 7; const long long maxw = 100 + 7; const long long maxh = 1...
#include <bits/stdc++.h> using namespace std; string int_to_string(int a) { stringstream ss; ss << a; return ss.str(); } string double_to_string(double a) { stringstream ss; ss << a; return ss.str(); } string float_to_string(float a) { stringstream ss; ss << a; return ss....
#include <bits/stdc++.h> using namespace std; const int N = 2e6 + 1, INF = 1e9 + 1; int n, q, a, b, p, t; pair<long double, long double> st[N], lf, rg; pair<long double, long double> merge(pair<long double, long double> a, pair<long double, long double> b) { long dou...
#include <bits/stdc++.h> using namespace std; inline int read() { register int num = 0; register char ch = getchar(); while (ch > 9 \|\| ch < 0 ) ch = getchar(); while (ch <= 9 && ch >= 0 ) num = num * 10 + ch - 0 , ch = getchar(); return num; } int num[10]; inline void write(int x) {...
#include <bits/stdc++.h> using namespace std; inline int read() { char ch = getchar(); int ret = 0, f = 1; while (ch > 9 \|\| ch < 0 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) ret = ret * 10 + ch - 0 , ch = getchar(); return ret * f; } const...
#include <bits/stdc++.h> using namespace std; const int MOD = (int)7 + (int)1e9; const int N = 1000005; const double PI = 4 * atan(1); const double eps = 1e-10; const long long oo = 1e10; const int K = 26; struct query { int a, t, x; query() { a = -1, t = -1, x = -1; } query(int _a, int _t, ...
#include <bits/stdc++.h> using namespace std; bool comp(pair<int, int> a, pair<int, int> b) { return (a.first == b.first) ? a.second < b.second : a.first < b.first; } long long int modInverse(long long int a) { long long int m = 1000000007; long long int y = 0, x = 1; while (a > 1) { long ...
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 2; long long fact[N]; void factorial() { fact[0] = fact[1] = 1; for (long long i = 2; i < N; i++) fact[i] = (fact[i - 1] * i) % 1000000007; } long long power(long long a, long long b, long long mod) { long long x = 1, y = a; w...
#include <bits/stdc++.h> using namespace std; const int N = 200010; int n, m; char s[2020][2020]; int dp[2020][2020], a[2020][2020][2], dp1[2020][2020]; int main() { scanf( %d%d , &n, &m); for (int i = 0; i < n; ++i) { scanf( %s , s[i]); for (int j = 0; j < m; ++j) { if (j == 0) ...
#include <bits/stdc++.h> using namespace std; const long long max_N = 100003; const long long max_M = 200003; vector<pair<long long, long long> > briaunos[max_N]; bool nepavyko_uzdavinys = false; struct reiskinys { long long skaicius, a; long double a_reiksme; bool isreikstas; bool isvestas;...
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int i, l = s.length(); char max = s[0]; for (i = 1; i < l; i++) { if (s[i] > max) max = s[i]; } for (i = 0; i < l; i++) { if (max == s[i]) cout << max; } }
#include <bits/stdc++.h> using namespace std; int used[200001]; int socks[200001]; bool used2[200001]; map<pair<int, int>, int> colors; map<pair<int, int>, int>::iterator it; int Stage = 0; vector<vector<int> > V; pair<int, int> P; int MaXS = 0; int countOfSocks = 0; void Dfs(int v) { countO...
#include <bits/stdc++.h> using namespace std; typedef struct { int i; int j; } AXIS; AXIS D[] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}}; bool DFS(char maze[][505], AXIS S, int &k, int &n, int &m) { maze[S.i][S.j] = * ; for (int i = 0; i < 4; i++) { AXIS next; next.i = S.i + D[i].i; ...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; vector<int> ans[N]; int a[N], b[N], c[N]; int n, k, p; int main() { scanf( %d%d%d , &n, &k, &p); int s = 0; int _x = 0, _y = 0; for (int i = 0; i < n; ++i) { scanf( %d , &a[i]); s += a[i]; if (a[i] & 1) ...
#include <bits/stdc++.h> using namespace std; template <class T1, class T2, class T3 = hash<T1>> using umap = unordered_map<T1, T2, T3>; template <class T> using uset = unordered_set<T>; template <class T> using vec = vector<T>; const long long infll = numeric_limits<long long>::max() >> 1; const int ...
#include <bits/stdc++.h> using namespace std; int n, x, y, sum, mbit; int Ask(vector<int> vec) { int ret = 0; printf( ? %d , vec.size()); for (int i = 0; i < vec.size(); i++) printf( %d , vec[i]); puts( ); fflush(stdout); scanf( %d , &ret); return ret; } int Solve(vector<int> a)...
#include <bits/stdc++.h> using namespace std; string s, s1; int a[1000]; set<string> l; void fun() { memset(a, 0, sizeof(a)); int len = s.length(); int j = 0; for (int i = len - 1; i >= 0; i--) { a[j++] = s[i] - 0 ; } a[0]++; for (int i = 0; i < len; i++) { if (a[i] >=...
#include <bits/stdc++.h> using namespace std; using ll = long long; using ull = long unsigned long; using ld = double long; template <class T, int N, int B> struct asym_ra { T a[N + 1]; T b[N / B + 2]; T get(int r) { if (r <= 0) return T(); if (r > N) r = N; return a[r] + b[r /...
#include <bits/stdc++.h> using namespace std; void solve() { int n, cnt = 0; cin >> n; string s; cin >> s; for (int i = 0; i < n; i++) if (s[i] == 2 ) cnt++; if (cnt == 0) { cout << YES << n ; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { ...
#include <bits/stdc++.h> using namespace std; int main() { int T; T = 1; while (T--) { int n; cin >> n; vector<int> v; int c = 0; for (int i = 0; i < n; i++) { int in; cin >> in; if (in == 5) { c++; } v.push_back(in); ...
#include <bits/stdc++.h> using namespace std; int main() { int n, m, i, j, c = 0; char a; cin >> n >> m; for (i = 0; i < n; i++) { for (j = 0; j < m; j++) { cin >> a; if (a == C \|\| a == M \|\| a == Y ) c++; } } if (c == 0) cout << #Black&White << endl; ...
#include <bits/stdc++.h> using namespace std; vector<vector<int> > g; int even[1 << 17]; bool used[1 << 17]; vector<int> path; void addV(int v) { path.push_back(v + 1); even[v] ^= 1; } void dfs(int v, int p) { used[v] = true; addV(v); for (int i(0); i <= ((long long)(((int)g[v].size(...
#include <bits/stdc++.h> using namespace std; const int N = 5e5 + 10; const int mod7 = 1e9 + 7; const int mod = 1e9 + 7; void read(int &a) { a = 0; int d = 1; char ch; while (ch = getchar(), ch > 9 \|\| ch < 0 ) if (ch == - ) d = -1; a = ch ^ 48; while (ch = getchar(), ch >= 0...
#include <bits/stdc++.h> using namespace std; int m, n, x, y; int ABS(int x) { return (x < 0) ? (-x) : (x); } int main() { scanf( %d%d%d%d , &m, &x, &n, &y); if (m > n) { swap(m, n); swap(x, y); } int d = ABS(x - y); long long ans = 1 + m + n; for (int i = 1; i <= m; i++) { ...
#include <bits/stdc++.h> using namespace std; int main() { int n, m, w; cin >> n >> m >> w; vector<long long> A(n); for (int x = 0; x < n; x++) cin >> A[x]; long long low = 1, high = (long long)1e9 + m; long long ans = low, mid; while (high >= low) { mid = (low + high) / 2; l...
#include <bits/stdc++.h> using namespace std; int nextInt() { int x; scanf( %d , &x); return x; } const int MAX_N = 1e5 + 100; int arr[MAX_N]; int main() { int n = nextInt(); for (int i = 0; i < n; ++i) arr[i] = nextInt(); sort(arr, arr + n); for (int i = 1; i < n; ++i) { i...
#include <bits/stdc++.h> using namespace std; int main() { map<int, bool> ma; char ch[100][100]; int n, m, answer = 0; cin >> n >> m; for (int i = 0; i < n; ++i) for (int j = 0; j < m; cin >> ch[i][j++]) ; for (int i = 0; i < m; ++i) { char Max = NULL; for (int j = ...
#include <bits/stdc++.h> using namespace std; const int maxN = 200010; int a[maxN]; long long presum[maxN]; int n; set<long long> st; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); presum[i] = presum[i - 1] + a[i]; } for (int i = 1; i <= n; i++...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int sum = n; sum += n / 2; cout << sum << endl; for (int i = 2; i <= n; i += 2) { cout << i << ; } for (int i = 1; i <= n; i += 2) { cout << i << ; } for (int i = 2; i <= n; i += 2) ...
#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0, f = 1, c = getchar(); for (; !isdigit(c); c = getchar()) if (c == - ) f ^= 1; for (; isdigit(c); c = getchar()) x = x * 10 + c - 0 ; return f ? x : -x; } int tar; int val[26]; int tp[26]; int ans; char c...
#include <bits/stdc++.h> using namespace std; int n, i, l, k, a[100005], x = 1; int main() { cin >> n; for (i = 0; i < n; i++) { cin >> a[i]; } for (i = 0; i < n; i++) { if (a[i] == 25) { l++; } else if (a[i] == 50) { if (l < 1) { x = 0; break;...
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 10; bool f; int col[N]; long long p1 = 0, p2 = 0; const long long mod = 998244353; vector<int> E[N]; void dfs(int u) { if (col[u] == 1) p1++; else p2++; for (int i = 0; i < E[u].size(); i++) { int v = E[u][i]...
#include <bits/stdc++.h> using namespace std; int dp[52][15][4][15][4][15][4]; map<int, int> mp; int check(char a, char b, int n) { if (n == 0) return 1; if (n > 1) { if (dp[n][mp[a[n]]][mp[b[n]]][mp[a[n - 1]]][mp[b[n - 1]]][mp[a[n - 2]]] [mp[b[n - 2]]]) return dp[n][mp[a[n]]...
#include <bits/stdc++.h> using namespace std; const int N = 5001; bool dp1[N][N], dp2[N][N]; int main() { { ios_base::sync_with_stdio(false); cin.tie(NULL); } string s; memset(dp1, false, sizeof dp1); memset(dp2, false, sizeof dp2); cin >> s; long long n = s.length(); ...
#include <bits/stdc++.h> using namespace std; const int mod = 998244353; int gcd(int a, int b) { if (b == 0) return a; a %= b; return gcd(b, a); } bool sortbysec(const pair<char, int> &a, const pair<char, int> &b) { return (a.second < b.second); } bool checkParity(long long int a, long lon...
#include <bits/stdc++.h> using namespace std; int Max() { return -1000000007; } int Min() { return 1000000007; } template <typename... Args> int Max(int a, Args... args) { return max(a, Max(args...)); } template <typename... Args> int Min(int a, Args... args) { return min(a, Min(args...)); } ...
#include <bits/stdc++.h> using namespace std; int n; vector<int> ans[1000]; int main() { cin >> n; int k = 2; while ((k * (k + 1)) / 2 <= n) k++; int cnt = 1; for (int i = 1; i <= k; i++) for (int j = 1; j < i; j++) { ans[i].push_back(cnt); ans[j].push_back(cnt); ...
#include <bits/stdc++.h> using namespace std; void openfile() { freopen( input.txt , r , stdin); freopen( output.txt , w , stdout); } const int nmax = 1 << 16; int n, k; int a[nmax]; vector<string> name; map<string, int> num; vector<vector<int> > g; int main() { cin >> n >> k; g.re...
#include <bits/stdc++.h> using namespace std; int main() { char s[400005]; int n, k; char c = a ; int T[26]; memset(T, 0, sizeof(T)); cin >> n >> k; for (int i = 0; i < n; i++) { scanf( %c , &s[i]); T[s[i] - a ]++; } int maxx; for (int i = 0; i < 26; i++) { ...
#include <bits/stdc++.h> using namespace std; int n, m; int sum[1010][1010]; char mp[1010][1010]; int getsum(int x1, int y1, int x2, int y2) { return sum[x1][y1] - sum[x2 + 1][y1] - sum[x1][y2 + 1] + sum[x2 + 1][y2 + 1]; } bool check(int a, int b, int x, int y) { while (1) { if (x + a - 1 > ...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; string s; cin >> s; int c = 1, flag = 0, flag1 = 0, flag2 = 0, flag3 = 0; for (int i = 0; i < n; i++) { if (s[i] == U ) { if (flag1 == 1) { c++; flag2 = 0, flag3 = 0, flag1 = 0; ...
#include <bits/stdc++.h> int n, k, s; int main() { scanf( %d%d , &k, &n); while (n > k && n % k == 0) { s++; n /= k; } if (n != k) printf( NO n ); else printf( YES n%d n , s); }
#include <bits/stdc++.h> using namespace std; template <class __Ty> bool minimize(__Ty& a, __Ty b) { if (a > b) { a = b; return true; } return false; } template <class __Ty> bool maximize(__Ty& a, __Ty b) { if (a < b) { a = b; return true; } return false; } ...
#include <bits/stdc++.h> using namespace std; using int64 = long long; template <class T> struct Matrix { vector<vector<T> > A; Matrix() {} Matrix(size_t n, size_t m) : A(n, vector<T>(m, 0)) {} Matrix(size_t n) : A(n, vector<T>(n, 0)){}; size_t height() const { return (A.size()); } size_...
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; struct Matrix { int n; vector<vector<long long>> a; Matrix(int _n) { n = _n; a = vector<vector<long long>>(n, vector<long long>(n, 0)); } Matrix operator+(Matrix o) { Matrix ans(n); for (int i ...
#include <bits/stdc++.h> using namespace std; int a[1000010]; int main() { char str; int i, n, x, maxn = 0, num = 0; cin >> n; while (n--) { cin >> str >> x; if (str == + ) { num++; a[x] = 1; maxn = max(maxn, num); } else { if (a[x]) { n...
#include <bits/stdc++.h> using namespace std; template <class T> inline void chkmin(T &a, T b) { if (a > b) a = b; } template <class T> inline void chkmax(T &a, T b) { if (a < b) a = b; } int n; double q0, a0, b0; double y_best[6000], x[6000], chain[6000]; double quad_min(double a, double ...
#include <bits/stdc++.h> using namespace std; int nxt[500010 << 1], to[500010 << 1], head[500010], cnt; int n, m; struct LCT { int ch[500010][2], fa[500010], cnt; long long val[500010], sum[500010], s[500010]; void init(int n) { for (int i = 1; i <= n; i++) s[i] = 1; } bool is_root(int...
#include <bits/stdc++.h> using namespace std; long long f(long long n) { if (n < 10) return n; long long last_digit = n % 10; long long ret = n / 10 + 9; long long tmp = n; while (tmp >= 10) tmp = tmp / 10; if (tmp > last_digit) ret--; return ret; } int main() { long long i, j, k...
#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; char s[100005]; long long dp[100005], bit[100005], ans[100005], bit2[100005], gbit2[100005], B[100005], GB[100005], gbit[100005], T, len, i, j, A, o; struct node { int x, y, z; } a[100005]; int cmp(node i, node j) { return...
#include <bits/stdc++.h> using namespace std; const long long maxn = 400010, inf = 1e18; long long q, lastans, cnt = 1, w[maxn]; long long fa[maxn][21], sum[maxn][21]; void add(long long x, long long v) { w[++cnt] = v; if (w[cnt] <= w[x]) fa[cnt][0] = x; else { int y = x; for (in...
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; vector<bool> sub(n, false); int c = 0; for (int i = 0; i < n; i++) { int t; cin >> t; if (t < 0) { sub[i] = true; c++; } } if (c > k) { cout << -1 n ; ...
#include <bits/stdc++.h> using namespace std; int n; int p[8505]; int wh[8505]; int ans[8505]; int level[8505]; int nxt[9][8505]; int prv[9][8505]; pair<int, int> bros[9][8505]; int svd, lsz, l; inline void go(int &f) { int id = f, t = 0; f = nxt[l][f]; if (wh[f] < wh[id]) id = f, t = ...
#include <bits/stdc++.h> using namespace std; int main() { int n, m; scanf( %d %d , &n, &m); char s[n + 5]; scanf( %s , s); vector<int>* vp[30]; for (int i = 0; i <= 25; i++) vp[i] = new vector<int>(); for (int i = 0; s[i]; i++) { int now = s[i] - a ; vp[now]->push_back(i); ...
#include <bits/stdc++.h> using namespace std; constexpr long long INF = (sizeof(long long) == 4 ? 1e9 : 2e18) + 1e5; constexpr long long MOD = 1e9 + 7; constexpr long long MAXN = 2e5 + 3; void solve() { long long n; cin >> n; string s; cin >> s; long long w = 0; queue<long long> arr; ...
#include <bits/stdc++.h> using namespace std; struct info { int d, f, t, cst; } inp[100006]; int forw[1000005]; int forw2[1000005]; long long cforw[1000005]; long long cforw2[1000005]; int ok[1000006]; int ok2[1000006]; bool cmp(info a, info b) { return a.d < b.d; } void process1(int prev, int...
#include <bits/stdc++.h> using namespace std; int n, m, a = -1; int main() { while (cin >> n >> m) a += n + m > 0; cout << a; }
#include <bits/stdc++.h> using namespace std; const int maxn = 1000005; struct tr { int l, r, c, p; } a[maxn], b[maxn]; int n, k, m, maxr = 0; long long ans = 0, num[maxn << 2], sum[maxn << 2]; bool cmpl(tr a, tr b) { return a.l < b.l; } bool cmpr(tr a, tr b) { return a.r < b.r; } void update(int ...
#include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 10; int main() { ios_base ::sync_with_stdio(false); cin.tie(0); int x[4], y[4]; for (int i = 1; i <= 3; i++) { cin >> x[i] >> y[i]; } pair<int, pair<int, int> > e = make_pair(INF, make_pair(INF, INF)); for (int i...
#include <bits/stdc++.h> using namespace std; long long n, a[100010]; int main() { cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; unsigned long long ans = 0; for (int i = 0; i < n; i++) { unsigned long long j, k = 0; for (j = i; j < n; j++) { if (a[i] != a[j]) break; ...
#include <bits/stdc++.h> using namespace std; double dp[5][5005]; double p[5005], subp[5005]; int t[5005]; double qpow(double a, int k) { double res = 1; while (k) { if (k & 1) res = a; a = a; k >>= 1; } return res; } int main(int argc, const char* argv[]) { int n, ...
#include <bits/stdc++.h> using namespace std; const int N = 110000; vector<int> adj[N]; long long p[N], s[N]; int main() { ios::sync_with_stdio(0); int n; cin >> n; for (int i = 2; i <= n; i++) cin >> p[i]; for (int i = 1; i <= n; i++) cin >> s[i]; for (int i = 1; i <= n; i++) { ...
#include <bits/stdc++.h> using namespace std; const long long MAX_N = 200 * 1000 + 24, INF = (1 << 30); int n; int a[MAX_N], cnt[MAX_N], mark[MAX_N]; vector<int> G[MAX_N], vec, avb; int main() { cin.tie(0), cout.tie(0), ios_base::sync_with_stdio(false); cin >> n; for (int i = 0; i < n; i++) cin ...
#include <bits/stdc++.h> using namespace std; void sublime() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); } int main() { sublime(); long long n, i, j; cin >> n; long long arr[n]; for (i = 0; i < n; i++) cin >> arr[i]; if (n <= 2) { cout << 0 << n ; ...
#include <bits/stdc++.h> using namespace std; template <class T> inline T modinv(T a, T n) { T i = n, v = 0, d = 1; while (a > 0) { T t = i / a, x = a; a = i % x; i = x; x = d; d = v - t * x; v = x; } return (v + n) % n; } long long modpow(long long n, long ...
#include <bits/stdc++.h> using namespace std; long long int dp[205][205][205]; long long int recur(string &a, string &b, long long int index, long long int k, long long int curr) { if (index == a.size()) { return 0; } if (dp[index][k][curr] != -1) { return dp[index][k...
#include <bits/stdc++.h> using namespace std; const int MAXN = 70 + 10; int n, dist[MAXN * MAXN * MAXN], u[3]; char arr[MAXN][MAXN]; int a[MAXN * MAXN * MAXN], b[MAXN * MAXN * MAXN]; struct node { int v[3] = {-1, -1, -1}; int A = -1, B = -1; node(int v1 = -1, int v2 = -1, int v3 = -1, int A_ = -...
#include <bits/stdc++.h> using namespace std; vector<int> prime; int y; int checker(int n) { for (int i = 0; i < y && i < n; i++) { if (prime[i] + prime[i + 1] + 1 == n) return 1; if (prime[i] + prime[i + 1] + 1 > n) return 0; } } int isprime(int n) { int x = sqrt(n); for (int i ...
#include <bits/stdc++.h> using namespace std; long long t, n, m, r, l, h, i, ii, j, x[1000001], y[1000001], z, g, a, b, c, d, k, mod = 1e9 + 7, q; vector<long long> v; vector<pair<long long, long long> > vv; queue<pair<long long, long long> > qq; pair<long long, long long> p[1000001]; map<long long,...
#include <bits/stdc++.h> using namespace std; bool comp1(int& a, int& b); int64_t gcd(int64_t a, int64_t b); bool comp2(int& a, int& b); bool comp3(pair<int, int>& a, pair<int, int>& b); bool comp4(pair<int, int>& a, pair<int, int>& b); bool isPrime(int& x); void input(vector<int>& v, int& n) { for ...
#include <bits/stdc++.h> using namespace std; long long n, ara[500005], k, ara2[500005]; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); long long l, h, i, j, m, z, t, o, a, b; cin >> n >> k; a = 0; for (i = 0; i < n; i++) cin >> ara[i]; l = 1; h = 10000000000; z...
#include <bits/stdc++.h> using namespace std; const long long inf = 1e9 + 7; const long long mxN = 1e5 + 1; vector<long long> dat; long long arr[4000], n; bool dp[2001]; void solve() { cin >> n; n *= 2; long long p = 0, temp = 0; for (long long i = 0; i < n; i++) { cin >> arr[i]; ...
#include <bits/stdc++.h> using namespace std; int a[10000], b[10000], f[10000000]; int main() { int n, ans = 0; scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , &a[i]); f[a[i]] = 1; } for (int i = 0; i < n; i++) { scanf( %d , &a[i]); f[b[i]] = 1; } for...
#include <bits/stdc++.h> using namespace std; const long double CHANGE = 1e-8; template <class c> struct rge { c b, e; }; template <class c> rge<c> range(c i, c j) { return rge<c>{i, j}; } template <class c> auto dud(c* x) -> decltype(cerr << *x, 0); template <class c> char dud(...); s...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; if (n % 2 == 0) { cout << NO << n ; return 0; } int arr[200005] = {0}; deque<int> d; for (int i = 0; i < 2 * n; i++) d.push_back(i + 1); for (i...
#include <bits/stdc++.h> using namespace std; const int maxn = 100010; int n; int fa[maxn]; bool vis[maxn]; int cnt_loop = 0; vector<int> loop[maxn]; void get(int x, int id) { vis[x] = 1; loop[id].push_back(x); if (vis[fa[x]]) return; get(fa[x], id); } bool num[maxn]; int rid[maxn]...
#include <bits/stdc++.h> using namespace std; const long long MOD = 1000000007; template <typename T> inline T Bigmod(T base, T power, T MOD) { T ret = 1; while (power) { if (power & 1) ret = (ret * base) % MOD; base = (base * base) % MOD; power >>= 1; } return ret; } bool ...
#include <bits/stdc++.h> int n, m[20], r[20], c; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d , &m[i]); for (int i = 0; i < n; i++) scanf( %d , &r[i]); for (int i = 0; i < 720720; i++) { bool you = false; for (int j = 0; j < n; j++) if (i % m[j] == r[j]) yo...

#include <bits/stdc++.h> const int mod = 998244353; using namespace std; int a[200010], b[200010]; void solve() { int n; cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; int x; for (int i = 1; i <= n; i++) cin >> x, b[i] = a[i] - x; sort(b + 1, b + n + 1); long long ans = 0; f...

#include <bits/stdc++.h> using namespace std; void swapll(long long *a, long long *b) { long long tmp = *a; *a = *b; *b = tmp; } void swapc(char *a, char *b) { char tmp = *a; *a = *b; *b = tmp; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long...

#include <bits/stdc++.h> using namespace std; int main() { int n, x = 0, y; int a[100]; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; } for (int i = 0; i < n; i++) { x = max(x, a[i]); } y = a[n - 1]; printf( %d , y ^ x); }

#include <bits/stdc++.h> using namespace std; const int N = 250; int t, a[N]; void read_input() { for (int i = 0; i < N; i++) cin >> a[i]; } void solve() { int sum = 0; for (int i = 0; i < N; i++) sum += a[i] * a[i]; double P = sqrt(1. * sum / N); for (int i = 0; i < N; i++) if (ab...

#include <bits/stdc++.h> using namespace std; int main() { long long t; cin >> t; while (t--) { long long n, m; cin >> n >> m; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { if (j == 1 || i == 1) cout << B ; else { cou...

#include <bits/stdc++.h> using namespace std; int n, q; long long s[101000], d[101000], ad[101000]; int find(int l, int r, long long v) { int re = 0; while (l <= r) { int mid = (l + r) / 2; if (d[mid] <= v) { re = max(re, mid); l = mid + 1; } else { r = mid - 1;...

#include <bits/stdc++.h> using namespace std; const int maxn = 1E6 + 10; int n, a[maxn][20], b[maxn][20], c[maxn], LOG[maxn]; bool Judge(int l, int r) { int len = LOG[r - l + 1]; int A = 100 * max(a[l][len], a[r - (1 << len) + 1][len]); int B = min(b[l][len], b[r - (1 << len) + 1][len]); return ...

#include <bits/stdc++.h> using namespace std; bool found; int n, x, nums[1000], smaller, larger, eq; void Naive() { int median = ((n + 1) / 2); sort(nums, nums + n); if (nums[--median] == x) { printf( 0 ); return; } if (found) { for (int i = 0; i < n && nums[i] <= x; i++) ...

#include <bits/stdc++.h> using namespace std; const int NN = 5050; const int MM = 27272; int a[MM], b[MM]; vector<int> adj[NN]; int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 1; i <= m; i++) { scanf( %d%d , a + i, b + i); adj[a[i]].push_back(b[i]); } int mx = 0; ...

#include <bits/stdc++.h> using namespace std; long long f(long long x) { long long ans = x; while (ans) { x *= 10; x += (ans % 10); ans /= 10; } return x; } int main() { long long k, p; cin >> k; cin >> p; long long sum = 0; for (long long i = 1; i <= k; i++...

#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; int a[25][50005]; const int MOD = 998244353; int add(int a, int b){ a += b; if(a >= MOD) a -= MOD; return a; } int mul(int a, int b){ return (1LL*a*b)%MOD; } int p...

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

#include <bits/stdc++.h> using namespace std; int main() { int num; cin >> num; if (num <= 9) { cout << num << endl; } else if (10 < num && num <= 189) { num = num - 9; int tmp = num / 2; tmp = 9 + tmp + num % 2; if (num % 2) cout << tmp / 10 << endl; else...

#include <bits/stdc++.h> using namespace std; int main() { int n, a, b, ans1 = 0, ans2 = 0; cin >> n; vector<int> c(n); for (int i = 0; i < n; i++) cin >> c[i]; cin >> a >> b; if (a > b) swap(a, b); a--; b--; for (int i = a; i < b; i++) { ans1 += c[i]; } for (int i ...

#include <bits/stdc++.h> using namespace std; const int N = 1e3 + 5; const int MOD = 1e9 + 7; vector<int> g[N + N]; int mat[N][N], p[N + N], sub[N + N], vis[N + N]; int ans[N + N], instack[N + N], go = true, ct = 0; vector<pair<int, int>> extime; void putNumbers(int node) { vis[node] = 1; instac...

#include<iostream> #include<string> #include<cstring> #include<cmath> #include<algorithm> #include<queue> #include<iomanip> #include<map> #include<cstdio> #include<stack> #include<set> using namespace std; #define endl n #define IOS ios::sync_with_stdio(false),cin.tie(0), cout.tie(0) typ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 5; const int LOGN = 31; int fwt[MAXN]; int P[MAXN] = {0}; int n; void update(int v, int d) { v++; for (; v <= n; v += v & -v) fwt[v] += d; } int query(int v) { int sum = 0; for (; v > 0; v -= v & -v) sum += fwt[v]; ...

#include <bits/stdc++.h> using namespace std; int main() { int count = 0, size; cin >> size; char c; vector<char> num; for (int i = 0; i < size; i++) { cin >> c; num.push_back(c); } for (int i = 0; i < num.size(); i++) { if (num[i] == 8 ) count++; if ((size / 11)...

#include <bits/stdc++.h> using namespace std; const int MAXN = 3000; vector<int> E[MAXN]; long long dp[MAXN][MAXN]; int P[MAXN][MAXN]; int T[MAXN][MAXN]; int n; bool cmp(int a, int b) { return dp[a] > dp[b]; } void dfs(int x, int p, int r) { P[r][x] = p; int d = 1; for (int i = 0; i < E[x]...

#include <bits/stdc++.h> using namespace std; class ReverseBit { public: ReverseBit(int size) : bit_(size + 1, 0) {} void Add(int pos, int num); int GetMax(int pos) const; private: static int Lsb(int num) { return num & -num; } vector<int> bit_; }; void ReverseBit::Add(int pos, int ...

#include <bits/stdc++.h> using namespace std; char s[1000010]; int main() { int k; cin >> k; scanf( %s , s); int n = strlen(s); int a[n + 1]; a[0] = 0; for (int i = 1; i < n + 1; i++) { a[i] = a[i - 1] + ((s[i - 1] == 1 ) ? 1 : 0); } long long int ans = 0; for (int i...

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

#include <bits/stdc++.h> using namespace std; const long long maxx = 1e6 + 7; const long long maxn = 1e6 + 7; const long long mod = 998244353; const long long maxs = 500000 + 7; const long long maxm = 400000 + 7; const long long maxk = 1008 + 7; const long long maxw = 100 + 7; const long long maxh = 1...

#include <bits/stdc++.h> using namespace std; string int_to_string(int a) { stringstream ss; ss << a; return ss.str(); } string double_to_string(double a) { stringstream ss; ss << a; return ss.str(); } string float_to_string(float a) { stringstream ss; ss << a; return ss....

#include <bits/stdc++.h> using namespace std; const int N = 2e6 + 1, INF = 1e9 + 1; int n, q, a, b, p, t; pair<long double, long double> st[N], lf, rg; pair<long double, long double> merge(pair<long double, long double> a, pair<long double, long double> b) { long dou...

#include <bits/stdc++.h> using namespace std; inline int read() { register int num = 0; register char ch = getchar(); while (ch > 9 || ch < 0 ) ch = getchar(); while (ch <= 9 && ch >= 0 ) num = num * 10 + ch - 0 , ch = getchar(); return num; } int num[10]; inline void write(int x) {...

#include <bits/stdc++.h> using namespace std; inline int read() { char ch = getchar(); int ret = 0, f = 1; while (ch > 9 || ch < 0 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) ret = ret * 10 + ch - 0 , ch = getchar(); return ret * f; } const...

#include <bits/stdc++.h> using namespace std; const int MOD = (int)7 + (int)1e9; const int N = 1000005; const double PI = 4 * atan(1); const double eps = 1e-10; const long long oo = 1e10; const int K = 26; struct query { int a, t, x; query() { a = -1, t = -1, x = -1; } query(int _a, int _t, ...

#include <bits/stdc++.h> using namespace std; bool comp(pair<int, int> a, pair<int, int> b) { return (a.first == b.first) ? a.second < b.second : a.first < b.first; } long long int modInverse(long long int a) { long long int m = 1000000007; long long int y = 0, x = 1; while (a > 1) { long ...

#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 2; long long fact[N]; void factorial() { fact[0] = fact[1] = 1; for (long long i = 2; i < N; i++) fact[i] = (fact[i - 1] * i) % 1000000007; } long long power(long long a, long long b, long long mod) { long long x = 1, y = a; w...

#include <bits/stdc++.h> using namespace std; const int N = 200010; int n, m; char s[2020][2020]; int dp[2020][2020], a[2020][2020][2], dp1[2020][2020]; int main() { scanf( %d%d , &n, &m); for (int i = 0; i < n; ++i) { scanf( %s , s[i]); for (int j = 0; j < m; ++j) { if (j == 0) ...

#include <bits/stdc++.h> using namespace std; const long long max_N = 100003; const long long max_M = 200003; vector<pair<long long, long long> > briaunos[max_N]; bool nepavyko_uzdavinys = false; struct reiskinys { long long skaicius, a; long double a_reiksme; bool isreikstas; bool isvestas;...

#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int i, l = s.length(); char max = s[0]; for (i = 1; i < l; i++) { if (s[i] > max) max = s[i]; } for (i = 0; i < l; i++) { if (max == s[i]) cout << max; } }

#include <bits/stdc++.h> using namespace std; int used[200001]; int socks[200001]; bool used2[200001]; map<pair<int, int>, int> colors; map<pair<int, int>, int>::iterator it; int Stage = 0; vector<vector<int> > V; pair<int, int> P; int MaXS = 0; int countOfSocks = 0; void Dfs(int v) { countO...

#include <bits/stdc++.h> using namespace std; typedef struct { int i; int j; } AXIS; AXIS D[] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}}; bool DFS(char maze[][505], AXIS S, int &k, int &n, int &m) { maze[S.i][S.j] = * ; for (int i = 0; i < 4; i++) { AXIS next; next.i = S.i + D[i].i; ...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; vector<int> ans[N]; int a[N], b[N], c[N]; int n, k, p; int main() { scanf( %d%d%d , &n, &k, &p); int s = 0; int _x = 0, _y = 0; for (int i = 0; i < n; ++i) { scanf( %d , &a[i]); s += a[i]; if (a[i] & 1) ...

#include <bits/stdc++.h> using namespace std; template <class T1, class T2, class T3 = hash<T1>> using umap = unordered_map<T1, T2, T3>; template <class T> using uset = unordered_set<T>; template <class T> using vec = vector<T>; const long long infll = numeric_limits<long long>::max() >> 1; const int ...

#include <bits/stdc++.h> using namespace std; int n, x, y, sum, mbit; int Ask(vector<int> vec) { int ret = 0; printf( ? %d , vec.size()); for (int i = 0; i < vec.size(); i++) printf( %d , vec[i]); puts( ); fflush(stdout); scanf( %d , &ret); return ret; } int Solve(vector<int> a)...

#include <bits/stdc++.h> using namespace std; string s, s1; int a[1000]; set<string> l; void fun() { memset(a, 0, sizeof(a)); int len = s.length(); int j = 0; for (int i = len - 1; i >= 0; i--) { a[j++] = s[i] - 0 ; } a[0]++; for (int i = 0; i < len; i++) { if (a[i] >=...

#include <bits/stdc++.h> using namespace std; using ll = long long; using ull = long unsigned long; using ld = double long; template <class T, int N, int B> struct asym_ra { T a[N + 1]; T b[N / B + 2]; T get(int r) { if (r <= 0) return T(); if (r > N) r = N; return a[r] + b[r /...

#include <bits/stdc++.h> using namespace std; void solve() { int n, cnt = 0; cin >> n; string s; cin >> s; for (int i = 0; i < n; i++) if (s[i] == 2 ) cnt++; if (cnt == 0) { cout << YES << n ; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { ...

#include <bits/stdc++.h> using namespace std; int main() { int T; T = 1; while (T--) { int n; cin >> n; vector<int> v; int c = 0; for (int i = 0; i < n; i++) { int in; cin >> in; if (in == 5) { c++; } v.push_back(in); ...

#include <bits/stdc++.h> using namespace std; int main() { int n, m, i, j, c = 0; char a; cin >> n >> m; for (i = 0; i < n; i++) { for (j = 0; j < m; j++) { cin >> a; if (a == C || a == M || a == Y ) c++; } } if (c == 0) cout << #Black&White << endl; ...

#include <bits/stdc++.h> using namespace std; vector<vector<int> > g; int even[1 << 17]; bool used[1 << 17]; vector<int> path; void addV(int v) { path.push_back(v + 1); even[v] ^= 1; } void dfs(int v, int p) { used[v] = true; addV(v); for (int i(0); i <= ((long long)(((int)g[v].size(...

#include <bits/stdc++.h> using namespace std; const int N = 5e5 + 10; const int mod7 = 1e9 + 7; const int mod = 1e9 + 7; void read(int &a) { a = 0; int d = 1; char ch; while (ch = getchar(), ch > 9 || ch < 0 ) if (ch == - ) d = -1; a = ch ^ 48; while (ch = getchar(), ch >= 0...

#include <bits/stdc++.h> using namespace std; int m, n, x, y; int ABS(int x) { return (x < 0) ? (-x) : (x); } int main() { scanf( %d%d%d%d , &m, &x, &n, &y); if (m > n) { swap(m, n); swap(x, y); } int d = ABS(x - y); long long ans = 1 + m + n; for (int i = 1; i <= m; i++) { ...

#include <bits/stdc++.h> using namespace std; int main() { int n, m, w; cin >> n >> m >> w; vector<long long> A(n); for (int x = 0; x < n; x++) cin >> A[x]; long long low = 1, high = (long long)1e9 + m; long long ans = low, mid; while (high >= low) { mid = (low + high) / 2; l...

#include <bits/stdc++.h> using namespace std; int nextInt() { int x; scanf( %d , &x); return x; } const int MAX_N = 1e5 + 100; int arr[MAX_N]; int main() { int n = nextInt(); for (int i = 0; i < n; ++i) arr[i] = nextInt(); sort(arr, arr + n); for (int i = 1; i < n; ++i) { i...

#include <bits/stdc++.h> using namespace std; int main() { map<int, bool> ma; char ch[100][100]; int n, m, answer = 0; cin >> n >> m; for (int i = 0; i < n; ++i) for (int j = 0; j < m; cin >> ch[i][j++]) ; for (int i = 0; i < m; ++i) { char Max = NULL; for (int j = ...

#include <bits/stdc++.h> using namespace std; const int maxN = 200010; int a[maxN]; long long presum[maxN]; int n; set<long long> st; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); presum[i] = presum[i - 1] + a[i]; } for (int i = 1; i <= n; i++...

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

#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0, f = 1, c = getchar(); for (; !isdigit(c); c = getchar()) if (c == - ) f ^= 1; for (; isdigit(c); c = getchar()) x = x * 10 + c - 0 ; return f ? x : -x; } int tar; int val[26]; int tp[26]; int ans; char c...

#include <bits/stdc++.h> using namespace std; int n, i, l, k, a[100005], x = 1; int main() { cin >> n; for (i = 0; i < n; i++) { cin >> a[i]; } for (i = 0; i < n; i++) { if (a[i] == 25) { l++; } else if (a[i] == 50) { if (l < 1) { x = 0; break;...

#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 10; bool f; int col[N]; long long p1 = 0, p2 = 0; const long long mod = 998244353; vector<int> E[N]; void dfs(int u) { if (col[u] == 1) p1++; else p2++; for (int i = 0; i < E[u].size(); i++) { int v = E[u][i]...

#include <bits/stdc++.h> using namespace std; int dp[52][15][4][15][4][15][4]; map<int, int> mp; int check(char *a, char *b, int n) { if (n == 0) return 1; if (n > 1) { if (dp[n][mp[a[n]]][mp[b[n]]][mp[a[n - 1]]][mp[b[n - 1]]][mp[a[n - 2]]] [mp[b[n - 2]]]) return dp[n][mp[a[n]]...

#include <bits/stdc++.h> using namespace std; const int N = 5001; bool dp1[N][N], dp2[N][N]; int main() { { ios_base::sync_with_stdio(false); cin.tie(NULL); } string s; memset(dp1, false, sizeof dp1); memset(dp2, false, sizeof dp2); cin >> s; long long n = s.length(); ...

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

#include <bits/stdc++.h> using namespace std; int Max() { return -1000000007; } int Min() { return 1000000007; } template <typename... Args> int Max(int a, Args... args) { return max(a, Max(args...)); } template <typename... Args> int Min(int a, Args... args) { return min(a, Min(args...)); } ...

#include <bits/stdc++.h> using namespace std; int n; vector<int> ans[1000]; int main() { cin >> n; int k = 2; while ((k * (k + 1)) / 2 <= n) k++; int cnt = 1; for (int i = 1; i <= k; i++) for (int j = 1; j < i; j++) { ans[i].push_back(cnt); ans[j].push_back(cnt); ...

#include <bits/stdc++.h> using namespace std; void openfile() { freopen( input.txt , r , stdin); freopen( output.txt , w , stdout); } const int nmax = 1 << 16; int n, k; int a[nmax]; vector<string> name; map<string, int> num; vector<vector<int> > g; int main() { cin >> n >> k; g.re...

#include <bits/stdc++.h> using namespace std; int main() { char s[400005]; int n, k; char c = a ; int T[26]; memset(T, 0, sizeof(T)); cin >> n >> k; for (int i = 0; i < n; i++) { scanf( %c , &s[i]); T[s[i] - a ]++; } int maxx; for (int i = 0; i < 26; i++) { ...

#include <bits/stdc++.h> using namespace std; int n, m; int sum[1010][1010]; char mp[1010][1010]; int getsum(int x1, int y1, int x2, int y2) { return sum[x1][y1] - sum[x2 + 1][y1] - sum[x1][y2 + 1] + sum[x2 + 1][y2 + 1]; } bool check(int a, int b, int x, int y) { while (1) { if (x + a - 1 > ...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; string s; cin >> s; int c = 1, flag = 0, flag1 = 0, flag2 = 0, flag3 = 0; for (int i = 0; i < n; i++) { if (s[i] == U ) { if (flag1 == 1) { c++; flag2 = 0, flag3 = 0, flag1 = 0; ...

#include <bits/stdc++.h> int n, k, s; int main() { scanf( %d%d , &k, &n); while (n > k && n % k == 0) { s++; n /= k; } if (n != k) printf( NO n ); else printf( YES n%d n , s); }

#include <bits/stdc++.h> using namespace std; template <class __Ty> bool minimize(__Ty& a, __Ty b) { if (a > b) { a = b; return true; } return false; } template <class __Ty> bool maximize(__Ty& a, __Ty b) { if (a < b) { a = b; return true; } return false; } ...

#include <bits/stdc++.h> using namespace std; using int64 = long long; template <class T> struct Matrix { vector<vector<T> > A; Matrix() {} Matrix(size_t n, size_t m) : A(n, vector<T>(m, 0)) {} Matrix(size_t n) : A(n, vector<T>(n, 0)){}; size_t height() const { return (A.size()); } size_...

#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; struct Matrix { int n; vector<vector<long long>> a; Matrix(int _n) { n = _n; a = vector<vector<long long>>(n, vector<long long>(n, 0)); } Matrix operator+(Matrix o) { Matrix ans(n); for (int i ...

#include <bits/stdc++.h> using namespace std; int a[1000010]; int main() { char str; int i, n, x, maxn = 0, num = 0; cin >> n; while (n--) { cin >> str >> x; if (str == + ) { num++; a[x] = 1; maxn = max(maxn, num); } else { if (a[x]) { n...

#include <bits/stdc++.h> using namespace std; template <class T> inline void chkmin(T &a, T b) { if (a > b) a = b; } template <class T> inline void chkmax(T &a, T b) { if (a < b) a = b; } int n; double q0, a0, b0; double y_best[6000], x[6000], chain[6000]; double quad_min(double a, double ...

#include <bits/stdc++.h> using namespace std; int nxt[500010 << 1], to[500010 << 1], head[500010], cnt; int n, m; struct LCT { int ch[500010][2], fa[500010], cnt; long long val[500010], sum[500010], s[500010]; void init(int n) { for (int i = 1; i <= n; i++) s[i] = 1; } bool is_root(int...

#include <bits/stdc++.h> using namespace std; long long f(long long n) { if (n < 10) return n; long long last_digit = n % 10; long long ret = n / 10 + 9; long long tmp = n; while (tmp >= 10) tmp = tmp / 10; if (tmp > last_digit) ret--; return ret; } int main() { long long i, j, k...

#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; char s[100005]; long long dp[100005], bit[100005], ans[100005], bit2[100005], gbit2[100005], B[100005], GB[100005], gbit[100005], T, len, i, j, A, o; struct node { int x, y, z; } a[100005]; int cmp(node i, node j) { return...

#include <bits/stdc++.h> using namespace std; const long long maxn = 400010, inf = 1e18; long long q, lastans, cnt = 1, w[maxn]; long long fa[maxn][21], sum[maxn][21]; void add(long long x, long long v) { w[++cnt] = v; if (w[cnt] <= w[x]) fa[cnt][0] = x; else { int y = x; for (in...

#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; vector<bool> sub(n, false); int c = 0; for (int i = 0; i < n; i++) { int t; cin >> t; if (t < 0) { sub[i] = true; c++; } } if (c > k) { cout << -1 n ; ...

#include <bits/stdc++.h> using namespace std; int n; int p[8505]; int wh[8505]; int ans[8505]; int level[8505]; int nxt[9][8505]; int prv[9][8505]; pair<int, int> bros[9][8505]; int svd, lsz, l; inline void go(int &f) { int id = f, t = 0; f = nxt[l][f]; if (wh[f] < wh[id]) id = f, t = ...

#include <bits/stdc++.h> using namespace std; int main() { int n, m; scanf( %d %d , &n, &m); char s[n + 5]; scanf( %s , s); vector<int>* vp[30]; for (int i = 0; i <= 25; i++) vp[i] = new vector<int>(); for (int i = 0; s[i]; i++) { int now = s[i] - a ; vp[now]->push_back(i); ...

#include <bits/stdc++.h> using namespace std; constexpr long long INF = (sizeof(long long) == 4 ? 1e9 : 2e18) + 1e5; constexpr long long MOD = 1e9 + 7; constexpr long long MAXN = 2e5 + 3; void solve() { long long n; cin >> n; string s; cin >> s; long long w = 0; queue<long long> arr; ...

#include <bits/stdc++.h> using namespace std; struct info { int d, f, t, cst; } inp[100006]; int forw[1000005]; int forw2[1000005]; long long cforw[1000005]; long long cforw2[1000005]; int ok[1000006]; int ok2[1000006]; bool cmp(info a, info b) { return a.d < b.d; } void process1(int prev, int...

#include <bits/stdc++.h> using namespace std; int n, m, a = -1; int main() { while (cin >> n >> m) a += n + m > 0; cout << a; }

#include <bits/stdc++.h> using namespace std; const int maxn = 1000005; struct tr { int l, r, c, p; } a[maxn], b[maxn]; int n, k, m, maxr = 0; long long ans = 0, num[maxn << 2], sum[maxn << 2]; bool cmpl(tr a, tr b) { return a.l < b.l; } bool cmpr(tr a, tr b) { return a.r < b.r; } void update(int ...

#include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 10; int main() { ios_base ::sync_with_stdio(false); cin.tie(0); int x[4], y[4]; for (int i = 1; i <= 3; i++) { cin >> x[i] >> y[i]; } pair<int, pair<int, int> > e = make_pair(INF, make_pair(INF, INF)); for (int i...

#include <bits/stdc++.h> using namespace std; long long n, a[100010]; int main() { cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; unsigned long long ans = 0; for (int i = 0; i < n; i++) { unsigned long long j, k = 0; for (j = i; j < n; j++) { if (a[i] != a[j]) break; ...

#include <bits/stdc++.h> using namespace std; double dp[5][5005]; double p[5005], subp[5005]; int t[5005]; double qpow(double a, int k) { double res = 1; while (k) { if (k & 1) res *= a; a *= a; k >>= 1; } return res; } int main(int argc, const char* argv[]) { int n, ...

#include <bits/stdc++.h> using namespace std; const int N = 110000; vector<int> adj[N]; long long p[N], s[N]; int main() { ios::sync_with_stdio(0); int n; cin >> n; for (int i = 2; i <= n; i++) cin >> p[i]; for (int i = 1; i <= n; i++) cin >> s[i]; for (int i = 1; i <= n; i++) { ...

#include <bits/stdc++.h> using namespace std; const long long MAX_N = 200 * 1000 + 24, INF = (1 << 30); int n; int a[MAX_N], cnt[MAX_N], mark[MAX_N]; vector<int> G[MAX_N], vec, avb; int main() { cin.tie(0), cout.tie(0), ios_base::sync_with_stdio(false); cin >> n; for (int i = 0; i < n; i++) cin ...

#include <bits/stdc++.h> using namespace std; void sublime() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); } int main() { sublime(); long long n, i, j; cin >> n; long long arr[n]; for (i = 0; i < n; i++) cin >> arr[i]; if (n <= 2) { cout << 0 << n ; ...

#include <bits/stdc++.h> using namespace std; template <class T> inline T modinv(T a, T n) { T i = n, v = 0, d = 1; while (a > 0) { T t = i / a, x = a; a = i % x; i = x; x = d; d = v - t * x; v = x; } return (v + n) % n; } long long modpow(long long n, long ...

#include <bits/stdc++.h> using namespace std; long long int dp[205][205][205]; long long int recur(string &a, string &b, long long int index, long long int k, long long int curr) { if (index == a.size()) { return 0; } if (dp[index][k][curr] != -1) { return dp[index][k...

#include <bits/stdc++.h> using namespace std; const int MAXN = 70 + 10; int n, dist[MAXN * MAXN * MAXN], u[3]; char arr[MAXN][MAXN]; int a[MAXN * MAXN * MAXN], b[MAXN * MAXN * MAXN]; struct node { int v[3] = {-1, -1, -1}; int A = -1, B = -1; node(int v1 = -1, int v2 = -1, int v3 = -1, int A_ = -...

#include <bits/stdc++.h> using namespace std; vector<int> prime; int y; int checker(int n) { for (int i = 0; i < y && i < n; i++) { if (prime[i] + prime[i + 1] + 1 == n) return 1; if (prime[i] + prime[i + 1] + 1 > n) return 0; } } int isprime(int n) { int x = sqrt(n); for (int i ...

#include <bits/stdc++.h> using namespace std; long long t, n, m, r, l, h, i, ii, j, x[1000001], y[1000001], z, g, a, b, c, d, k, mod = 1e9 + 7, q; vector<long long> v; vector<pair<long long, long long> > vv; queue<pair<long long, long long> > qq; pair<long long, long long> p[1000001]; map<long long,...

#include <bits/stdc++.h> using namespace std; bool comp1(int& a, int& b); int64_t gcd(int64_t a, int64_t b); bool comp2(int& a, int& b); bool comp3(pair<int, int>& a, pair<int, int>& b); bool comp4(pair<int, int>& a, pair<int, int>& b); bool isPrime(int& x); void input(vector<int>& v, int& n) { for ...

#include <bits/stdc++.h> using namespace std; long long n, ara[500005], k, ara2[500005]; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); long long l, h, i, j, m, z, t, o, a, b; cin >> n >> k; a = 0; for (i = 0; i < n; i++) cin >> ara[i]; l = 1; h = 10000000000; z...

#include <bits/stdc++.h> using namespace std; const long long inf = 1e9 + 7; const long long mxN = 1e5 + 1; vector<long long> dat; long long arr[4000], n; bool dp[2001]; void solve() { cin >> n; n *= 2; long long p = 0, temp = 0; for (long long i = 0; i < n; i++) { cin >> arr[i]; ...

#include <bits/stdc++.h> using namespace std; int a[10000], b[10000], f[10000000]; int main() { int n, ans = 0; scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , &a[i]); f[a[i]] = 1; } for (int i = 0; i < n; i++) { scanf( %d , &a[i]); f[b[i]] = 1; } for...

#include <bits/stdc++.h> using namespace std; const long double CHANGE = 1e-8; template <class c> struct rge { c b, e; }; template <class c> rge<c> range(c i, c j) { return rge<c>{i, j}; } template <class c> auto dud(c* x) -> decltype(cerr << *x, 0); template <class c> char dud(...); s...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; if (n % 2 == 0) { cout << NO << n ; return 0; } int arr[200005] = {0}; deque<int> d; for (int i = 0; i < 2 * n; i++) d.push_back(i + 1); for (i...

#include <bits/stdc++.h> using namespace std; const int maxn = 100010; int n; int fa[maxn]; bool vis[maxn]; int cnt_loop = 0; vector<int> loop[maxn]; void get(int x, int id) { vis[x] = 1; loop[id].push_back(x); if (vis[fa[x]]) return; get(fa[x], id); } bool num[maxn]; int rid[maxn]...

#include <bits/stdc++.h> using namespace std; const long long MOD = 1000000007; template <typename T> inline T Bigmod(T base, T power, T MOD) { T ret = 1; while (power) { if (power & 1) ret = (ret * base) % MOD; base = (base * base) % MOD; power >>= 1; } return ret; } bool ...

#include <bits/stdc++.h> int n, m[20], r[20], c; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d , &m[i]); for (int i = 0; i < n; i++) scanf( %d , &r[i]); for (int i = 0; i < 720720; i++) { bool you = false; for (int j = 0; j < n; j++) if (i % m[j] == r[j]) yo...