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; const int maxn = 1e5 + 5; long long n, m, s, t; long long pos[maxn], T[maxn]; long long cal(long long x) { if (s < m) s += t; else s -= t; t--; return (s % n + n) % n; } int main() { cin >> n >> m >> s >> t; s--; while (...
#include <bits/stdc++.h> using namespace std; int main() { long long t; cin >> t; while (t--) { long long n; cin >> n; for (long long i = 1; i <= n; i++) { cout << 1 << ; } cout << endl; } }
#include <bits/stdc++.h> using namespace std; bool done[1010]; int l[1010], r[1010], ans[1010]; int main() { int n, i, j, k; scanf( %d , &n); int rem = n; for (i = 0; i < n; i++) { scanf( %d , &l[i]); done[i] = 0; } for (i = 0; i < n; i++) scanf( %d , &r[i]); int maxx = n...
#include <bits/stdc++.h> using namespace std; int n; int ans; bool one, two, three; vector<int> v; int main() { scanf( %d , &n); while (one == false \|\| two == false \|\| three == false) { for (int i = 1; i <= n; i++) { if (!one) { if (i % 2 == 0) { ans++; ...
#include <bits/stdc++.h> const long long MaxN = 1e5 + 50; template <class t> inline void read(t &s) { s = 0; register long long f = 1; register char c = getchar(); while (!isdigit(c)) { if (c == - ) f = -1; c = getchar(); } while (isdigit(c)) s = (s << 3) + (s << 1) + (c ^ 48)...
//SAGAR SINGH // #pragma GCC optimize( Ofast ) // #pragma GCC target( avx,avx2,fma ) // #pragma GCC optimization( unroll-loops ) #include<bits/stdc++.h> using namespace std; #define fastio ios_base::sync_with_stdio;cin.tie(NULL);cout.tie(0); #define ll long long #define ld long double #define rep(i,...
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; long long N, K; int M; vector<long long> special; int sol = 0; int main() { scanf( %lld %d %lld , &N, &M, &K); for (int i = 0; i < M; i++) { long long v; scanf( %lld , &v); special.push_back(v); } ...
#include <bits/stdc++.h> using namespace std; template <typename t> t in(t q) { cin >> q; return q; } template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) { os << [ ; for (int i = 0; i < ((int)size(v)); ++i) { os << v[i]; if (i != ((int)size(v)) - 1) os << ...
#include <bits/stdc++.h> using namespace std; int main() { int i, a[2005], b[2005], x = 0, y = 0, n, m, sum = 0; cin >> n; for (i = 0; i < n; i++) { cin >> m; if (m % 2 == 0) { a[x] = m; x++; } else { b[y] = m; y++; } } sort(a, a + x, great...
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } const int MOD = 998244353; const int PRIMROOT = 3; int pw(int x, int n) { int ret = 1; while (true) { if (n & 1) ret = (long long)ret * x % MOD; if ((n >>= 1) == 0) ...
#include <bits/stdc++.h> using namespace std; int main() { char a[200005]; cin >> a; for (int i = 0; a[i] != 0 ; ++i) { if (i && a[i - 1] == a[i]) { if (a[i - 1] != x && a[i + 1] != x ) a[i] = x ; else if (a[i - 1] != y && a[i + 1] != y ) a[i] = y ; ...
#include <bits/stdc++.h> using namespace std; template <typename X> void MA(X& a, X b) { a = max(a, b); } template <typename X> void MI(X& a, X b) { a = min(a, b); } template <typename X> void clr(X& x, int a) { memset(x, a, sizeof(x)); }; int cond = 0, multi = 0, gcj = 0; int N; c...
#include <bits/stdc++.h> using namespace std; bool comp(const pair<int, int> &a, const pair<int, int> &b) { return (a.second < b.second); } long long gcd(long long a, long long b) { if (!b) return a; return gcd(b, a % b); } int main() { long long n, k; cin >> n >> k; long long lx[43]...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast,no-stack-protector ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) #pragma GCC optimize( unroll-loops ) #pragma GCC optimize( fast-math ) using namespace std; template <class T> ostream &operator<<(ostream &str, vector<T>...
#include <bits/stdc++.h> using namespace std; #define S size() #define EN end() #define BE begin() #define LEN length() #define endl n #define cnt count #define in insert #define er erase #define fi first #define se second #define ld double #define int long long #define gcd __gcd...
#include <bits/stdc++.h> using namespace std; long long get(long long r) { return (r + 1) * r / 2; } long long sumto(long long r, int need) { long long pw = 1; long long sum = 0; long long add = 0; for (int len = 1;; ++len) { if (pw * 10 - 1 < r) { long long cnt = pw * 10 - pw; ...
#include <bits/stdc++.h> using namespace std; int ans, b, a, f, s, k, ss; int main() { cin >> a >> b; if (a == b) { cout << infinity ; return 0; } if (a < b) { cout << 0; return 0; } for (int i = 1; i <= round(sqrt(a - b)); i++) { if ((a - b) % i == 0) ans++;...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); int n, m = 0, sum = 0; cin >> n; string s; getline(cin, s); getline(cin, s); for (int i = 0; i < n; i++) { if (s[i] == ) { m = max(m, sum); sum = 0; } if (s[i...
#include <bits/stdc++.h> using namespace std; long long a, b, n; long long vet[2000010]; bool comp(long long l, long long maior, long long meio, long long m, long long t) { if (a + ((meio - 1) * b) > t) return false; if (vet[meio] - vet[l - 1] > m * t) return false; return true; } in...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; int v[26][N]; int main() { int n; cin >> n; string s; for (int i = 0; i < n; ++i) { cin >> s; for (int j = 0; j < s.size(); j++) if (s[j] != ? ) v[s[j] - a ][j]++; } string ans = ; int pos = ...
#include <bits/stdc++.h> using namespace std; const int MOD = 998244353; long long exp(long long n, long long m, long long md) { long long a = 1; while (m > 0) { if (m & 1) a = (a * n % md) % md; m /= 2; n = (n * n) % md; } return a % md; } long long R = MOD; long long modI...
#include <bits/stdc++.h> using namespace std; const int P = 10, N = 1e5 + 10; inline int inverse(int a, int m) { if (a <= 1) return a; int ans = (1 - (long long int)inverse(m % a, a) * m) / a; return ans + m; } int fact[N], ifact[N], pot[N][P]; int sz, p[P]; inline void primes(int n) { for...
#include <bits/stdc++.h> using namespace std; int main() { deque<int> vec; int arr[200005]; int n, a; scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , &a); vec.push_back(a); arr[i] = 0; } for (int i = 0; i < n; i++) { scanf( %d , &a); int j = 0, i1...
#include <bits/stdc++.h> using namespace std; const double eps = 1e-9; template <class T> struct RMQ { const int STEP_P = 5; const int STEP = 1 << STEP_P; vector<T> data; const T INF; vector<vector<T> > small_powers; vector<vector<T> > group_powers; int N; RMQ(vector<T> data_, T ...
#include <bits/stdc++.h> using namespace std; int dfs(vector<int>* v, int n) { int cost = -1; for (int i = 1; i <= n; i++) { for (int j = i + 1; j <= n; j++) { if (binary_search(v[i].begin(), v[i].end(), j) == 0) continue; for (int k = 0; k < v[i].size(); k++) { for (int s = ...
#include <bits/stdc++.h> using namespace std; vector<int> v[100001]; long long arr[100001]; int visit[100001]; void dfs(int s, long long pos, long long neg) { visit[s] = 1; int i; long long k, maxi = 0, mini = 0, ps = 0, ng = 0; for (i = 0; i < v[s].size(); i++) { if (!visit[v[s][i]]) ...
#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; struct Sync_stdio { Sync_stdio() { cin.tie(NULL); ios_base::sync_with_stdio(false); } } _sync_stdio; long long n, k; void solve(vector<long long> &v, vector<long long> &a) { for (int i = (0); i < (n); ++i) { ...
#include <bits/stdc++.h> using namespace std; class solve { private: int n, lar, les; vector<int> val[2]; vector<int> res[2]; vector<long long> sum[2]; private: int find_first_less(int i); public: void func(); }; void solve::func() { cin >> n; val[0].resize(n + 1, ...
#include <bits/stdc++.h> using namespace std; const long long P = 1000000007; long long MOD(long long x) { return (x % P + P) % P; } long long Time(long long x, long long y) { if (x < 0) { x = MOD(x); } long long ans = 1; while (y) { if (y & 1) { ans = ans * x % P; } ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 100010; const int INF = 0x7fffffff; long long a[MAXN]; long long sum = 0; long long s1[MAXN]; set<long long> s; int main() { int n; scanf( %d , &n); s1[0] = 0; for (int i = 1; i <= n; i++) { scanf( %lld , a + i); ...
#include <bits/stdc++.h> using namespace std; int n = 10; const int ms = 100; int grid[ms][ms]; const int inf = 1e9; int f[ms]; double dp[ms]; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout << fixed << setprecision(8); for (int i = 0; i < n; i++) { for (int ...
#include <bits/stdc++.h> using namespace std; int main() { long long int n, m; cin >> n >> m; long long int x[n][m], y[n][m], a[n][m], b[n], c[m], i, j, ans = 0, ans1 = 0, d[n], e[m]; for (i = 0; i < n; i++) { long long int min = 9...
#include <bits/stdc++.h> using namespace std; void run(vector<vector<int>> &sets, int sum); pair<vector<vector<int>>, int > precalc(); const int MAXB = 5; const int MOD = 1e9 + 7; int main() { ios::sync_with_stdio(false); cout.tie(0); auto precalc_vals = precalc(); run(precalc_vals.first...
#include <bits/stdc++.h> using namespace std; struct T { int p, n; }; bool operator<(T x, T y) { return x.p < y.p; } T m[100100]; int main() { int i, n, j; for (scanf( %d , &n), i = 0; i < n; scanf( %d%d , &m[i].p, &m[i].n), i++) ; sort(m, m + n); j = m[n - 1].n; for (i = 0; i ...
#include <bits/stdc++.h> using namespace std; inline long long read() { long long x = 0; int ch = getchar(), f = 1; while (!isdigit(ch) && (ch != - ) && (ch != EOF)) ch = getchar(); if (ch == - ) { f = -1; ch = getchar(); } while (isdigit(ch)) { x = (x << 1) + (x << 3) + ...
#include <bits/stdc++.h> using namespace std; vector<pair<long long int, long long int> > v1, v2; int main() { long long int p, q, l, r, w, x, y, z, i, j, flag, tot = 0, k; scanf( %lld , &p); scanf( %lld , &q); scanf( %lld , &l); scanf( %lld , &r); for (i = 0; i < p; i++) { scanf( %l...
#include <bits/stdc++.h> int main() { int i, j, p; char a[100010]; while (~scanf( %s , a)) { p = 0; for (i = 0, j = strlen(a) - 1; i < j; i++, j--) { if (a[i] != a[j]) { p = 1; break; } } if (p == 1) printf( NO n ); else { f...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; string x; int ans = 1; vector<string> a; for (int i = 0; i < n; i++) { cin >> x; a.push_back(x); } for (int i = 0; i < n - 1; ++i) { ...
#include <bits/stdc++.h> using namespace std; vector<int> a; int n; bool check() { for (int i = 1; i < n; i++) { if (abs(a[i - 1] - a[i]) >= 2) return 1; } return 0; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; a.resize(n); for (int i = 0; i < n; i...
#include <bits/stdc++.h> const int maxn = 2e5 + 1; int fa[maxn], flg[maxn], n, m, cnt, ans; struct Edge { int u, v, w; } e[maxn]; inline bool cmp(Edge a, Edge b) { return a.w > b.w; } inline int find(int x) { return (fa[x] == x) ? x : fa[x] = find(fa[x]); } int main() { scanf( %d %d , &n, &m); ...
#include <bits/stdc++.h> using namespace std; int read() { char c; int w = 1; while ((c = getchar()) > 9 \|\| c < 0 ) if (c == - ) w = -1; int ans = c - 0 ; while ((c = getchar()) >= 0 && c <= 9 ) ans = (ans << 1) + (ans << 3) + c - 0 ; return ans * w; } const int xx =...
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; vector<long long> a(n); for (int i = (0); i < (n); ++i) cin >> a[i]; long long sum = 0; long long dynamicrank = 0; for (int i = (0); i < (n); ++i) { long long score = sum - (n - (i + 1)) * dynamicra...
#include <bits/stdc++.h> using namespace std; const int N = 100005, M = 200005, L = 20; const int INF = 1 << 30; struct node { int u, v, nxt; } edge[M]; int head[N], mcnt; void add_edge(int u, int v) { mcnt++; edge[mcnt].u = u; edge[mcnt].v = v; edge[mcnt].nxt = head[u]; head[u] = ...
#include <bits/stdc++.h> using namespace std; bool prime[101]; void SieveOfEratosthenes(int n) { memset(prime, true, sizeof(prime)); for (int p = 2; p * p <= n; p++) { if (prime[p] == true) { for (int i = p * p; i <= n; i += p) prime[i] = false; } } } int main() { long long...
#include <bits/stdc++.h> using namespace std; const int N = 2000010; inline int in() { int x; scanf( %d , &x); return x; } inline long long lin() { long long x; scanf( %I64d , &x); return x; } char s[N]; int t[4 * N]; int help[N * 4]; int limit = (int)1e6 * 2; int ki[N]; ...
#include <bits/stdc++.h> using namespace std; void solve() { long long int k; cin >> k; string s = codeforces ; long long int a[10]; long long int cnt = 1; for (int i = 0; i < 10; ++i) { a[i] = 1; } int idx = 0; while (cnt < k) { a[idx]++; cnt = 1; for (i...
#include <bits/stdc++.h> using namespace std; using LL = long long; constexpr int N = 1e5 + 5; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n, m, x, y; cin >> n >> m >> x >> y; x--; y--; string s; cin >> s; vector<vector<int>> mat(n, vector<int>(m, -1)); ...
#include <bits/stdc++.h> using namespace std; const int mx = 2e5 + 10; const int mxb = 60; long long int a[mx], b[mx], c[mx]; int cnt[mxb][2]; int bat(int idx, long long int v) { if (v & (1ll << idx)) return 1; return 0; } int main() { int n; scanf( %d , &n); long long int sm = 0; ...
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, d, e, f; cin >> a >> b >> c >> d >> e >> f; int sum = 0; bool flag = false; if (f > e) { int x = min(b, min(c, d)); sum += f * x; b -= x; c -= x; d -= x; flag = true; } else { in...
#include <bits/stdc++.h> using namespace std; inline void pisz(int n) { printf( %d n , n); } const int fx[4][2] = {{0, 1}, {-1, 0}, {0, -1}, {1, 0}}; const int fxx[9][2] = {{0, 0}, {0, 1}, {0, -1}, {1, 0}, {-1, 0}, {1, 1}, {1, -1}, {-1, 1}, {-1, -1}}; const int N = 500; const long...
#include <bits/stdc++.h> using namespace std; vector<pair<int, int>> vec; int main() { int n; cin >> n; for (int tt = 0; tt < n; tt++) { int x, y; cin >> x >> y; vec.push_back({x, y}); } sort(vec.begin(), vec.end()); int ans = -1; for (int i = 0; i < n; i++) { i...
#include <bits/stdc++.h> using namespace std; int T; string s, ans; bool exist[30]; int main() { scanf( %d , &T); for (int i = 0; i < T; i++) { cin >> s; ans.clear(); for (int j = 0; j < 26; j++) { exist[j] = false; } ans = s[0]; exist[s[0] - a ] = true; ...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; int n, first, second, a, b, m, d[(1 << 17) + 5], p[(1 << 17) + 5]; vector<int> g[(1 << 17) + 5]; bool check(int nod, int par, int del, int hg) { int kids = g[nod].size(); if (par) kids--; if (nod == del) { if (hg == ...
#include <bits/stdc++.h> const int MAXN = 2000 + 5; long long mn = 1e18; int ans[3][2], k = -1; int n, m; long long a[MAXN], b[MAXN]; inline long long mabs(long long x) { return x < 0 ? -x : x; } int main() { scanf( %d , &n); long long s1 = 0, s2 = 0; for (int i = 1; i <= n; ++i) scanf( %lld ,...
#include <bits/stdc++.h> using namespace std; int main() { long long int n; cin >> n; string l = 312931303130313130313031 ; string input = ; string s = 312831303130313130313031 ; string s1 = s + s + s; string s2 = l + s + s; string s3 = s + l + s; string s4 = s + s + l; l...
#include <bits/stdc++.h> using namespace std; const int N = 5005; const long long inf = 1e15; long long dp[2][N][2]; int a[N][2]; void load() {} void trungtt() { int n, x; scanf( %d%d , &n, &x); long long ans = 0; int l = x, r = x; for (int i = 1; i <= n; ++i) { int a, b; s...
#include <bits/stdc++.h> using namespace std; template <typename T> inline bool upmin(T &x, T y) { return y < x ? x = y, 1 : 0; } template <typename T> inline bool upmax(T &x, T y) { return x < y ? x = y, 1 : 0; } const long double eps = 1e-11; const long double pi = acos(-1); const int oo =...
#include <bits/stdc++.h> using namespace std; int main() { int n, m; scanf( %d %d , &n, &m); char A[147][10047]; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) scanf( %c , &A[i][j]); int P[147][10047]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) P[i][j] =...
#include <bits/stdc++.h> using namespace std; vector<int> mat[100010]; int vis[100010], val[100010]; int dfs(int p, int pa) { if (vis[p]) return 1; int ret = 0; vis[p] = 1; if (p != pa) val[p] += val[pa]; for (auto x : mat[p]) ret = max(ret, dfs(x, p)); return ret; } int in[100010], ...
#include <bits/stdc++.h> using namespace std; int B[300000]; pair<int, int> A[300000]; stack<pair<int, int> > s; queue<pair<pair<int, int>, int> > q; int main() { int N, l, f, i; long long ta = 0, tb = 0; scanf( %d , &N); for (i = 0; i < N; ++i) scanf( %d , &A[i].first), A[i].second = ...
#include <bits/stdc++.h> using namespace std; set<int> s[40]; set<int>::iterator it, q; int n, m, k, sol, v[40]; int main() { int i, j; scanf( %d %d , &n, &m); for (i = 1; i <= n; i++) { scanf( %d , &v[i]); v[i] %= m; } if (n == 1) { printf( %d , v[1]); return 0; ...
#include <bits/stdc++.h> using namespace std; char M[10][10]; int V[10]; int main() { int n, k; cin >> n >> k; for (int i = 0; i < n; i++) cin >> M[i]; for (int i = 0; i < k; i++) V[i] = i; long ans(1e10); do { long mx(0), mn(1e10); for (int i = 0; i < n; i++) { long ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int t = 1; cin >> t; while (t--) { int n, mx = -1; cin >> n; int arr[n]; for (int i = 0; i < n; i++) { cin >> arr[i]; mx = max(m...
#include <bits/stdc++.h> using namespace std; int min(int a, int b) { if (a < b) return a; return b; } int Abs(int a) { if (a < 0) return -a; else return a; } double Abs(double a) { if (a < 0) return -a; else return a; } unsigned long long sqr(unsigned lon...
#include <bits/stdc++.h> using namespace std; long long n, m; vector<long long> boxes; vector<int> counts; long long answer; void In() { boxes.clear(); counts.clear(); answer = 0; cin >> n >> m; boxes.resize(m); counts.resize(63); for (int i = 0; i < m; i++) cin >> boxes[i]; } ...
#include <bits/stdc++.h> int x, y, u, v, d = 1, a, b; int main() { for (scanf( %d%d , &a, &b); a; b /= 4, d = 2, --a) { if (b % 4 == 0) u = y, v = x; else if (b % 4 == 1) u = x, v = y + d; else if (b % 4 == 2) u = x + d, v = y + d; else u = 2 d - y - 1,...
#include <bits/stdc++.h> using namespace std; vector<int> v[100009]; map<int, int> mp; int main() { int n, m, x, y, index = 1; scanf( %d%d , &n, &m); for (int i = 0; i < m; i++) { scanf( %d%d , &x, &y); if (mp[x] == 0) { mp[x] = index; v[index++].push_back(y); } els...
#include <bits/stdc++.h> using namespace std; const int mxn = 2e5 + 5; long long a[1001][1001]; int main() { int t; cin >> t; while (t--) { int n, m; cin >> n >> m; for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { cin >> a[i][j]; if ((i + j)...
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3f; const int MOD = (int)1e9 + 7; const int N = (int)1e6 + 7; struct node { long long x, y, a; } a[N]; int n; long long dp[N]; struct P { long long x, y; P() {} P(long lon...
#include <bits/stdc++.h> using namespace std; const long long LINF = 1001002003004005006ll; int dx[] = {1, 0, -1, 0}; int dy[] = {0, 1, 0, -1}; long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; re...
#include <bits/stdc++.h> using namespace std; long long mypow3(long long p, long long mod) { long long rez = 1, x = 3; while (p > 0) { if (p % 2 == 1) rez = (rez * x) % mod; x = (x * x) % mod; p /= 2; } return rez; } int main() { long long n, m, ans; ios_base::sync_with...
#include <bits/stdc++.h> using namespace std; long long a, b, c[101], d[101], mx = -1e9, cnt; int main() { cin >> a >> b; for (int i = 1; i <= a; ++i) { cin >> c[i]; } for (int i = 1; i < a; ++i) { d[i] = c[i] - c[i + 1] - b; } for (int i = 1; i <= a; ++i) { mx = max(d[i]...
#include <bits/stdc++.h> using namespace std; int a[410], s[410], dp[60][410][2]; void su(int &a, int b) { if (b > a) a = b; } void lemon() { int n, m; scanf( %d%d , &n, &m); for (int i = (1); i <= (n); i++) scanf( %d , &a[i]); for (int i = (1); i <= (n); i++) s[i] = s[i - 1] + a[i]; f...
#include <bits/stdc++.h> using namespace std; using ll = long long; constexpr int inf = 1e9; using P = pair<int, int>; template <typename T> void printv(const vector<T> &v) { int sz = v.size(); for (int i = 0; i < sz; i++) { cout << v[i] << n [i == sz - 1]; } } using Graph = vector<...
#include <bits/stdc++.h> const long double pie = 3.1415926535; using namespace std; bool br1, br2, br; long long n, k, x, y, z, mini, maxi, l, ind, ini, sum, t, len, r, q, imini, w, m; string s, s1, s2; struct Point { long long X, Y; static long long getDir(Point a, Point b, Point c) { r...
#include <bits/stdc++.h> using namespace std; const long long N = 5e5 + 5, M = 65; long long n, q, d = 60, fa[N], opt, x, s[M]; double f[N][M]; void update(long long v) { long long top = 0, x = v; for (long long i = 0; i <= d; i++) { if (!x) break; s[top++] = x, x = fa[x]; } top--;...
#include <bits/stdc++.h> using namespace std; const int MaxN = 2e5 + 10; const int MOD = 1e9 + 7; const int INF = 1e9; int main() { int L, n, p, t; cin >> L >> n >> p >> t; if (n == 0) { cout << 0 << n ; exit(0); } vector<pair<int, int> > seg(n); for (int i = 0; i < n; ++...
#include <bits/stdc++.h> using namespace std; int n; vector<string> cards; map<vector<string>, bool> used; void rec(vector<string>& x) { if (x.size() == 1) { puts( YES ); exit(0); } if (used[x] == true) return; used[x] = true; int p = x.size() - 1; if (x[p][0] == x[p - 1][0...
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using pii = pair<int, int>; const int INF = (int)1e9; struct Car { int x = INF; ll time = 0; int id = -1; Car() = default; Car(int xx, ll t, int i) : x(xx), time(t), id(i) {} }; Car get_best(c...
#include <bits/stdc++.h> using namespace std; char st1[100010], st2[100010]; int a1[100010], a2[100010], b1[100010], b2[100010]; int n; int read() { int x = 0, f = 1; char ch = getchar(); while (ch < 0 \|\| 9 < ch) { if (ch == - ) f = -1; ch = getchar(); } while ( 0 <= ch &...
#include <bits/stdc++.h> const int MX = 2e6 + 7; const int N = 1e9 + 1; const int mod = 998244353; const double pi = acos(-1); double esp = 1e-13; using namespace std; long long qpow(long long a, long long b, long long MOD = mod) { for (long long ans = 1;; a = a * a % MOD, b >>= 1) { if (b & 1) ...
#include <bits/stdc++.h> using namespace std; int n, m; int R[101]; double dp[100100], sum[100100]; int main() { scanf( %d%d , &n, &m); if (m == 1) { puts( 1 ); return 0; } int score = 0; dp[0] = 1; double f = 1. / (m - 1); for (int i = 0; i < n; ++i) { scanf( %d ...
#include <bits/stdc++.h> using namespace std; int M = 998244353; int pow(int a, int b) { if (b == 0) { return 1; } if (b % 2) { return ((long long)a * pow(a, b - 1)) % M; } else { int temp = pow(a, b / 2); return ((long long)temp * temp) % M; } } int inv[3010]; in...
#include <bits/stdc++.h> using namespace std; const int N = 200010; const int MOD = 1000000007; const int INF = 0x3fffffff; typedef struct Node { long long v; int p; Node(long long v_, int p_) { v = v_; p = p_; } bool operator<(const Node& other) const { return v < other....
#include <bits/stdc++.h> using namespace std; const int N = 105; int n; int a[N]; int sum = 0; char s[N]; int main() { scanf( %d , &n); scanf( %s , s + 1); for (int i = 1; i <= n; ++i) { a[i] = s[i] - 0 ; sum += a[i]; } if (sum == 0) { puts( YES ); return 0; ...
#include <bits/stdc++.h> using namespace std; int main() { long long n; scanf( %lld , &n); long long sum[n + 5], ans[n + 5], a; cout << ? 1 2 << endl; cin >> sum[1]; cout << ? 2 3 << endl; cin >> sum[2]; cout << ? 1 3 << endl; cin >> sum[3]; ans[1] = (sum[1] + sum[3] - ...
#include <bits/stdc++.h> using namespace std; double const eps = 1e-7; struct Edge { int dest, flow, ctpt; double cost; Edge(int _dest, int _flow, double _cost, int _ctpt) : dest(_dest), flow(_flow), cost(_cost), ctpt(_ctpt) {} }; vector<Edge> edges[2004]; int source = 2002, sink = 2003,...
#include <bits/stdc++.h> using namespace std; void solve() { vector<int> v = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47}; int pos = -1, cnt = 0; for (int i = 0; i < v.size(); i++) { cout << v[i] << endl; string s; cin >> s; if (s == yes ) pos = i, cnt++; } i...
#include <bits/stdc++.h> using namespace std; const int maxn = 2010; int a[maxn], b[maxn], tot, n, m; pair<int, int> ans1, ans21, ans22; pair<long long, pair<int, int> > two[maxn * maxn]; int main(void) { long long s = 0, s2 = 1e18, s3 = 1e18; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf(...
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3fLL; const double EPS = 1e-8; const int MOD = 1000000007; const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1}; int main() { cin.tie(0); ios::sync_with_stdio(false); int n; cin...
#include <bits/stdc++.h> using namespace std; int a[100], k[100]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; int t, n; cin >> t; for (int i = 0; i < t; ++i) { cin >> n; n *= 2; for (int j = 0; j < n; ++j) cin >> a[j]; for (int j = 0; j...
#include <bits/stdc++.h> using namespace std; const int inf = 2e9; const long double eps = 0.000001; const long long mod = 1e9 + 7; const long double PI = 3.14159265359; template <class T> struct MyVector : vector<T> { MyVector() : vector<T>() {} MyVector(int n) : vector<T>(n) {} T &operator[]...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 50; int b[maxn]; int cnt; int main() { std::ios::sync_with_stdio(false); int t; cin >> t; while (t--) { string a; cin >> a; cnt = 0; bool flag = true; for (int i = 0; i < a.size(); i++) { ...
#include <bits/stdc++.h> using namespace std; const int maxn = 150 + 10; int a[maxn][maxn]; int n; int main() { scanf( %d , &n); a[0][0] = 1; a[1][1] = 1; for (int i = 2; i <= n; i++) { for (int j = 0; j <= i; j++) { if (j > 0) a[i][j] = a[i - 1][j - 1]; if (j <= i - 2) {...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10; int b[maxn]; char a[maxn]; int num[2 * maxn]; int main() { int n; scanf( %d , &n); int count0 = 0, count1 = 0; memset(num, -1, sizeof(num)); int len = 0, maxlen = 0; scanf( %s , a + 1); for (int i = 1; i <= ...
#include <bits/stdc++.h> using namespace std; int n; int h[1000010], f[1000010][2]; void Work() { int ans = 0; for (int i = 1; i <= n; i++) { int l, r; l = min(h[i - 1], h[i]); r = min(h[i], h[i + 1]); if (l <= r) f[i][1] = 1LL * f[i - 1][1] * l % 1000000007; else {...
#include <bits/stdc++.h> using namespace std; int main() { long long t, n, m, k, rem, each, x, y, i, j, ans; cin >> t; while (t--) { cin >> n >> m >> x >> y; string s[n]; long long one = 0, two = 0; for (i = 0; i < n; i++) { cin >> s[i]; } for (i = 0; i < n; i...
#include <bits/stdc++.h> using namespace std; constexpr long long mod = 1000000007; pair<long long, long long> dfs(int v, const vector<vector<int>> &children, const vector<int> &black) { long long zero = 0; long long one = 0; (black[v] ? one : zero) = 1; for (const...
#include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 7; int dp[80][80][80][2]; char c[80]; vector<int> V, K, a; int cal(int id, vector<int> vv, int pos) { int cnt = 0; for (int i = id; i < ((int)vv.size()); i++) if (vv[i] < pos) cnt++; return cnt; } int cc(int i, int j, ...
#include <bits/stdc++.h> using namespace std; int main() { long long n, m, k; cin >> n >> m >> k; long long l = 0, h = n * m + 2; while (l < h) { long long md = (l + h) / 2; long long rs = 0; for (int i = 1; i <= n; i++) rs += min(m, md / i); if (rs < k) l = md + 1; ...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 5; long long n, m, s, t; long long pos[maxn], T[maxn]; long long cal(long long x) { if (s < m) s += t; else s -= t; t--; return (s % n + n) % n; } int main() { cin >> n >> m >> s >> t; s--; while (...

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

#include <bits/stdc++.h> using namespace std; bool done[1010]; int l[1010], r[1010], ans[1010]; int main() { int n, i, j, k; scanf( %d , &n); int rem = n; for (i = 0; i < n; i++) { scanf( %d , &l[i]); done[i] = 0; } for (i = 0; i < n; i++) scanf( %d , &r[i]); int maxx = n...

#include <bits/stdc++.h> using namespace std; int n; int ans; bool one, two, three; vector<int> v; int main() { scanf( %d , &n); while (one == false || two == false || three == false) { for (int i = 1; i <= n; i++) { if (!one) { if (i % 2 == 0) { ans++; ...

#include <bits/stdc++.h> const long long MaxN = 1e5 + 50; template <class t> inline void read(t &s) { s = 0; register long long f = 1; register char c = getchar(); while (!isdigit(c)) { if (c == - ) f = -1; c = getchar(); } while (isdigit(c)) s = (s << 3) + (s << 1) + (c ^ 48)...

//SAGAR SINGH // #pragma GCC optimize( Ofast ) // #pragma GCC target( avx,avx2,fma ) // #pragma GCC optimization( unroll-loops ) #include<bits/stdc++.h> using namespace std; #define fastio ios_base::sync_with_stdio;cin.tie(NULL);cout.tie(0); #define ll long long #define ld long double #define rep(i,...

#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; long long N, K; int M; vector<long long> special; int sol = 0; int main() { scanf( %lld %d %lld , &N, &M, &K); for (int i = 0; i < M; i++) { long long v; scanf( %lld , &v); special.push_back(v); } ...

#include <bits/stdc++.h> using namespace std; template <typename t> t in(t q) { cin >> q; return q; } template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) { os << [ ; for (int i = 0; i < ((int)size(v)); ++i) { os << v[i]; if (i != ((int)size(v)) - 1) os << ...

#include <bits/stdc++.h> using namespace std; int main() { int i, a[2005], b[2005], x = 0, y = 0, n, m, sum = 0; cin >> n; for (i = 0; i < n; i++) { cin >> m; if (m % 2 == 0) { a[x] = m; x++; } else { b[y] = m; y++; } } sort(a, a + x, great...

#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } const int MOD = 998244353; const int PRIMROOT = 3; int pw(int x, int n) { int ret = 1; while (true) { if (n & 1) ret = (long long)ret * x % MOD; if ((n >>= 1) == 0) ...

#include <bits/stdc++.h> using namespace std; int main() { char a[200005]; cin >> a; for (int i = 0; a[i] != 0 ; ++i) { if (i && a[i - 1] == a[i]) { if (a[i - 1] != x && a[i + 1] != x ) a[i] = x ; else if (a[i - 1] != y && a[i + 1] != y ) a[i] = y ; ...

#include <bits/stdc++.h> using namespace std; template <typename X> void MA(X& a, X b) { a = max(a, b); } template <typename X> void MI(X& a, X b) { a = min(a, b); } template <typename X> void clr(X& x, int a) { memset(x, a, sizeof(x)); }; int cond = 0, multi = 0, gcj = 0; int N; c...

#include <bits/stdc++.h> using namespace std; bool comp(const pair<int, int> &a, const pair<int, int> &b) { return (a.second < b.second); } long long gcd(long long a, long long b) { if (!b) return a; return gcd(b, a % b); } int main() { long long n, k; cin >> n >> k; long long lx[43]...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast,no-stack-protector ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) #pragma GCC optimize( unroll-loops ) #pragma GCC optimize( fast-math ) using namespace std; template <class T> ostream &operator<<(ostream &str, vector<T>...

#include <bits/stdc++.h> using namespace std; #define S size() #define EN end() #define BE begin() #define LEN length() #define endl n #define cnt count #define in insert #define er erase #define fi first #define se second #define ld double #define int long long #define gcd __gcd...

#include <bits/stdc++.h> using namespace std; long long get(long long r) { return (r + 1) * r / 2; } long long sumto(long long r, int need) { long long pw = 1; long long sum = 0; long long add = 0; for (int len = 1;; ++len) { if (pw * 10 - 1 < r) { long long cnt = pw * 10 - pw; ...

#include <bits/stdc++.h> using namespace std; int ans, b, a, f, s, k, ss; int main() { cin >> a >> b; if (a == b) { cout << infinity ; return 0; } if (a < b) { cout << 0; return 0; } for (int i = 1; i <= round(sqrt(a - b)); i++) { if ((a - b) % i == 0) ans++;...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); int n, m = 0, sum = 0; cin >> n; string s; getline(cin, s); getline(cin, s); for (int i = 0; i < n; i++) { if (s[i] == ) { m = max(m, sum); sum = 0; } if (s[i...

#include <bits/stdc++.h> using namespace std; long long a, b, n; long long vet[2000010]; bool comp(long long l, long long maior, long long meio, long long m, long long t) { if (a + ((meio - 1) * b) > t) return false; if (vet[meio] - vet[l - 1] > m * t) return false; return true; } in...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; int v[26][N]; int main() { int n; cin >> n; string s; for (int i = 0; i < n; ++i) { cin >> s; for (int j = 0; j < s.size(); j++) if (s[j] != ? ) v[s[j] - a ][j]++; } string ans = ; int pos = ...

#include <bits/stdc++.h> using namespace std; const int MOD = 998244353; long long exp(long long n, long long m, long long md) { long long a = 1; while (m > 0) { if (m & 1) a = (a * n % md) % md; m /= 2; n = (n * n) % md; } return a % md; } long long R = MOD; long long modI...

#include <bits/stdc++.h> using namespace std; const int P = 10, N = 1e5 + 10; inline int inverse(int a, int m) { if (a <= 1) return a; int ans = (1 - (long long int)inverse(m % a, a) * m) / a; return ans + m; } int fact[N], ifact[N], pot[N][P]; int sz, p[P]; inline void primes(int n) { for...

#include <bits/stdc++.h> using namespace std; int main() { deque<int> vec; int arr[200005]; int n, a; scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , &a); vec.push_back(a); arr[i] = 0; } for (int i = 0; i < n; i++) { scanf( %d , &a); int j = 0, i1...

#include <bits/stdc++.h> using namespace std; const double eps = 1e-9; template <class T> struct RMQ { const int STEP_P = 5; const int STEP = 1 << STEP_P; vector<T> data; const T INF; vector<vector<T> > small_powers; vector<vector<T> > group_powers; int N; RMQ(vector<T> data_, T ...

#include <bits/stdc++.h> using namespace std; int dfs(vector<int>* v, int n) { int cost = -1; for (int i = 1; i <= n; i++) { for (int j = i + 1; j <= n; j++) { if (binary_search(v[i].begin(), v[i].end(), j) == 0) continue; for (int k = 0; k < v[i].size(); k++) { for (int s = ...

#include <bits/stdc++.h> using namespace std; vector<int> v[100001]; long long arr[100001]; int visit[100001]; void dfs(int s, long long *pos, long long *neg) { visit[s] = 1; int i; long long k, maxi = 0, mini = 0, ps = 0, ng = 0; for (i = 0; i < v[s].size(); i++) { if (!visit[v[s][i]]) ...

#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; struct Sync_stdio { Sync_stdio() { cin.tie(NULL); ios_base::sync_with_stdio(false); } } _sync_stdio; long long n, k; void solve(vector<long long> &v, vector<long long> &a) { for (int i = (0); i < (n); ++i) { ...

#include <bits/stdc++.h> using namespace std; class solve { private: int n, lar, les; vector<int> val[2]; vector<int> res[2]; vector<long long> sum[2]; private: int find_first_less(int i); public: void func(); }; void solve::func() { cin >> n; val[0].resize(n + 1, ...

#include <bits/stdc++.h> using namespace std; const long long P = 1000000007; long long MOD(long long x) { return (x % P + P) % P; } long long Time(long long x, long long y) { if (x < 0) { x = MOD(x); } long long ans = 1; while (y) { if (y & 1) { ans = ans * x % P; } ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 100010; const int INF = 0x7fffffff; long long a[MAXN]; long long sum = 0; long long s1[MAXN]; set<long long> s; int main() { int n; scanf( %d , &n); s1[0] = 0; for (int i = 1; i <= n; i++) { scanf( %lld , a + i); ...

#include <bits/stdc++.h> using namespace std; int n = 10; const int ms = 100; int grid[ms][ms]; const int inf = 1e9; int f[ms]; double dp[ms]; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout << fixed << setprecision(8); for (int i = 0; i < n; i++) { for (int ...

#include <bits/stdc++.h> using namespace std; int main() { long long int n, m; cin >> n >> m; long long int x[n][m], y[n][m], a[n][m], b[n], c[m], i, j, ans = 0, ans1 = 0, d[n], e[m]; for (i = 0; i < n; i++) { long long int min = 9...

#include <bits/stdc++.h> using namespace std; void run(vector<vector<int>> &sets, int **sum); pair<vector<vector<int>>, int **> precalc(); const int MAXB = 5; const int MOD = 1e9 + 7; int main() { ios::sync_with_stdio(false); cout.tie(0); auto precalc_vals = precalc(); run(precalc_vals.first...

#include <bits/stdc++.h> using namespace std; struct T { int p, n; }; bool operator<(T x, T y) { return x.p < y.p; } T m[100100]; int main() { int i, n, j; for (scanf( %d , &n), i = 0; i < n; scanf( %d%d , &m[i].p, &m[i].n), i++) ; sort(m, m + n); j = m[n - 1].n; for (i = 0; i ...

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

#include <bits/stdc++.h> using namespace std; vector<pair<long long int, long long int> > v1, v2; int main() { long long int p, q, l, r, w, x, y, z, i, j, flag, tot = 0, k; scanf( %lld , &p); scanf( %lld , &q); scanf( %lld , &l); scanf( %lld , &r); for (i = 0; i < p; i++) { scanf( %l...

#include <bits/stdc++.h> int main() { int i, j, p; char a[100010]; while (~scanf( %s , a)) { p = 0; for (i = 0, j = strlen(a) - 1; i < j; i++, j--) { if (a[i] != a[j]) { p = 1; break; } } if (p == 1) printf( NO n ); else { f...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; string x; int ans = 1; vector<string> a; for (int i = 0; i < n; i++) { cin >> x; a.push_back(x); } for (int i = 0; i < n - 1; ++i) { ...

#include <bits/stdc++.h> using namespace std; vector<int> a; int n; bool check() { for (int i = 1; i < n; i++) { if (abs(a[i - 1] - a[i]) >= 2) return 1; } return 0; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; a.resize(n); for (int i = 0; i < n; i...

#include <bits/stdc++.h> const int maxn = 2e5 + 1; int fa[maxn], flg[maxn], n, m, cnt, ans; struct Edge { int u, v, w; } e[maxn]; inline bool cmp(Edge a, Edge b) { return a.w > b.w; } inline int find(int x) { return (fa[x] == x) ? x : fa[x] = find(fa[x]); } int main() { scanf( %d %d , &n, &m); ...

#include <bits/stdc++.h> using namespace std; int read() { char c; int w = 1; while ((c = getchar()) > 9 || c < 0 ) if (c == - ) w = -1; int ans = c - 0 ; while ((c = getchar()) >= 0 && c <= 9 ) ans = (ans << 1) + (ans << 3) + c - 0 ; return ans * w; } const int xx =...

#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; vector<long long> a(n); for (int i = (0); i < (n); ++i) cin >> a[i]; long long sum = 0; long long dynamicrank = 0; for (int i = (0); i < (n); ++i) { long long score = sum - (n - (i + 1)) * dynamicra...

#include <bits/stdc++.h> using namespace std; const int N = 100005, M = 200005, L = 20; const int INF = 1 << 30; struct node { int u, v, nxt; } edge[M]; int head[N], mcnt; void add_edge(int u, int v) { mcnt++; edge[mcnt].u = u; edge[mcnt].v = v; edge[mcnt].nxt = head[u]; head[u] = ...

#include <bits/stdc++.h> using namespace std; bool prime[101]; void SieveOfEratosthenes(int n) { memset(prime, true, sizeof(prime)); for (int p = 2; p * p <= n; p++) { if (prime[p] == true) { for (int i = p * p; i <= n; i += p) prime[i] = false; } } } int main() { long long...

#include <bits/stdc++.h> using namespace std; const int N = 2000010; inline int in() { int x; scanf( %d , &x); return x; } inline long long lin() { long long x; scanf( %I64d , &x); return x; } char s[N]; int t[4 * N]; int help[N * 4]; int limit = (int)1e6 * 2; int ki[N]; ...

#include <bits/stdc++.h> using namespace std; void solve() { long long int k; cin >> k; string s = codeforces ; long long int a[10]; long long int cnt = 1; for (int i = 0; i < 10; ++i) { a[i] = 1; } int idx = 0; while (cnt < k) { a[idx]++; cnt = 1; for (i...

#include <bits/stdc++.h> using namespace std; using LL = long long; constexpr int N = 1e5 + 5; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n, m, x, y; cin >> n >> m >> x >> y; x--; y--; string s; cin >> s; vector<vector<int>> mat(n, vector<int>(m, -1)); ...

#include <bits/stdc++.h> using namespace std; const int mx = 2e5 + 10; const int mxb = 60; long long int a[mx], b[mx], c[mx]; int cnt[mxb][2]; int bat(int idx, long long int v) { if (v & (1ll << idx)) return 1; return 0; } int main() { int n; scanf( %d , &n); long long int sm = 0; ...

#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, d, e, f; cin >> a >> b >> c >> d >> e >> f; int sum = 0; bool flag = false; if (f > e) { int x = min(b, min(c, d)); sum += f * x; b -= x; c -= x; d -= x; flag = true; } else { in...

#include <bits/stdc++.h> using namespace std; inline void pisz(int n) { printf( %d n , n); } const int fx[4][2] = {{0, 1}, {-1, 0}, {0, -1}, {1, 0}}; const int fxx[9][2] = {{0, 0}, {0, 1}, {0, -1}, {1, 0}, {-1, 0}, {1, 1}, {1, -1}, {-1, 1}, {-1, -1}}; const int N = 500; const long...

#include <bits/stdc++.h> using namespace std; vector<pair<int, int>> vec; int main() { int n; cin >> n; for (int tt = 0; tt < n; tt++) { int x, y; cin >> x >> y; vec.push_back({x, y}); } sort(vec.begin(), vec.end()); int ans = -1; for (int i = 0; i < n; i++) { i...

#include <bits/stdc++.h> using namespace std; int T; string s, ans; bool exist[30]; int main() { scanf( %d , &T); for (int i = 0; i < T; i++) { cin >> s; ans.clear(); for (int j = 0; j < 26; j++) { exist[j] = false; } ans = s[0]; exist[s[0] - a ] = true; ...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; int n, first, second, a, b, m, d[(1 << 17) + 5], p[(1 << 17) + 5]; vector<int> g[(1 << 17) + 5]; bool check(int nod, int par, int del, int hg) { int kids = g[nod].size(); if (par) kids--; if (nod == del) { if (hg == ...

#include <bits/stdc++.h> const int MAXN = 2000 + 5; long long mn = 1e18; int ans[3][2], k = -1; int n, m; long long a[MAXN], b[MAXN]; inline long long mabs(long long x) { return x < 0 ? -x : x; } int main() { scanf( %d , &n); long long s1 = 0, s2 = 0; for (int i = 1; i <= n; ++i) scanf( %lld ,...

#include <bits/stdc++.h> using namespace std; int main() { long long int n; cin >> n; string l = 312931303130313130313031 ; string input = ; string s = 312831303130313130313031 ; string s1 = s + s + s; string s2 = l + s + s; string s3 = s + l + s; string s4 = s + s + l; l...

#include <bits/stdc++.h> using namespace std; const int N = 5005; const long long inf = 1e15; long long dp[2][N][2]; int a[N][2]; void load() {} void trungtt() { int n, x; scanf( %d%d , &n, &x); long long ans = 0; int l = x, r = x; for (int i = 1; i <= n; ++i) { int a, b; s...

#include <bits/stdc++.h> using namespace std; template <typename T> inline bool upmin(T &x, T y) { return y < x ? x = y, 1 : 0; } template <typename T> inline bool upmax(T &x, T y) { return x < y ? x = y, 1 : 0; } const long double eps = 1e-11; const long double pi = acos(-1); const int oo =...

#include <bits/stdc++.h> using namespace std; int main() { int n, m; scanf( %d %d , &n, &m); char A[147][10047]; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) scanf( %c , &A[i][j]); int P[147][10047]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) P[i][j] =...

#include <bits/stdc++.h> using namespace std; vector<int> mat[100010]; int vis[100010], val[100010]; int dfs(int p, int pa) { if (vis[p]) return 1; int ret = 0; vis[p] = 1; if (p != pa) val[p] += val[pa]; for (auto x : mat[p]) ret = max(ret, dfs(x, p)); return ret; } int in[100010], ...

#include <bits/stdc++.h> using namespace std; int B[300000]; pair<int, int> A[300000]; stack<pair<int, int> > s; queue<pair<pair<int, int>, int> > q; int main() { int N, l, f, i; long long ta = 0, tb = 0; scanf( %d , &N); for (i = 0; i < N; ++i) scanf( %d , &A[i].first), A[i].second = ...

#include <bits/stdc++.h> using namespace std; set<int> s[40]; set<int>::iterator it, q; int n, m, k, sol, v[40]; int main() { int i, j; scanf( %d %d , &n, &m); for (i = 1; i <= n; i++) { scanf( %d , &v[i]); v[i] %= m; } if (n == 1) { printf( %d , v[1]); return 0; ...

#include <bits/stdc++.h> using namespace std; char M[10][10]; int V[10]; int main() { int n, k; cin >> n >> k; for (int i = 0; i < n; i++) cin >> M[i]; for (int i = 0; i < k; i++) V[i] = i; long ans(1e10); do { long mx(0), mn(1e10); for (int i = 0; i < n; i++) { long ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int t = 1; cin >> t; while (t--) { int n, mx = -1; cin >> n; int arr[n]; for (int i = 0; i < n; i++) { cin >> arr[i]; mx = max(m...

#include <bits/stdc++.h> using namespace std; int min(int a, int b) { if (a < b) return a; return b; } int Abs(int a) { if (a < 0) return -a; else return a; } double Abs(double a) { if (a < 0) return -a; else return a; } unsigned long long sqr(unsigned lon...

#include <bits/stdc++.h> using namespace std; long long n, m; vector<long long> boxes; vector<int> counts; long long answer; void In() { boxes.clear(); counts.clear(); answer = 0; cin >> n >> m; boxes.resize(m); counts.resize(63); for (int i = 0; i < m; i++) cin >> boxes[i]; } ...

#include <bits/stdc++.h> int x, y, u, v, d = 1, a, b; int main() { for (scanf( %d%d , &a, &b); a; b /= 4, d *= 2, --a) { if (b % 4 == 0) u = y, v = x; else if (b % 4 == 1) u = x, v = y + d; else if (b % 4 == 2) u = x + d, v = y + d; else u = 2 * d - y - 1,...

#include <bits/stdc++.h> using namespace std; vector<int> v[100009]; map<int, int> mp; int main() { int n, m, x, y, index = 1; scanf( %d%d , &n, &m); for (int i = 0; i < m; i++) { scanf( %d%d , &x, &y); if (mp[x] == 0) { mp[x] = index; v[index++].push_back(y); } els...

#include <bits/stdc++.h> using namespace std; const int mxn = 2e5 + 5; long long a[1001][1001]; int main() { int t; cin >> t; while (t--) { int n, m; cin >> n >> m; for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { cin >> a[i][j]; if ((i + j)...

#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3f; const int MOD = (int)1e9 + 7; const int N = (int)1e6 + 7; struct node { long long x, y, a; } a[N]; int n; long long dp[N]; struct P { long long x, y; P() {} P(long lon...

#include <bits/stdc++.h> using namespace std; const long long LINF = 1001002003004005006ll; int dx[] = {1, 0, -1, 0}; int dy[] = {0, 1, 0, -1}; long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; re...

#include <bits/stdc++.h> using namespace std; long long mypow3(long long p, long long mod) { long long rez = 1, x = 3; while (p > 0) { if (p % 2 == 1) rez = (rez * x) % mod; x = (x * x) % mod; p /= 2; } return rez; } int main() { long long n, m, ans; ios_base::sync_with...

#include <bits/stdc++.h> using namespace std; long long a, b, c[101], d[101], mx = -1e9, cnt; int main() { cin >> a >> b; for (int i = 1; i <= a; ++i) { cin >> c[i]; } for (int i = 1; i < a; ++i) { d[i] = c[i] - c[i + 1] - b; } for (int i = 1; i <= a; ++i) { mx = max(d[i]...

#include <bits/stdc++.h> using namespace std; int a[410], s[410], dp[60][410][2]; void su(int &a, int b) { if (b > a) a = b; } void lemon() { int n, m; scanf( %d%d , &n, &m); for (int i = (1); i <= (n); i++) scanf( %d , &a[i]); for (int i = (1); i <= (n); i++) s[i] = s[i - 1] + a[i]; f...

#include <bits/stdc++.h> using namespace std; using ll = long long; constexpr int inf = 1e9; using P = pair<int, int>; template <typename T> void printv(const vector<T> &v) { int sz = v.size(); for (int i = 0; i < sz; i++) { cout << v[i] << n [i == sz - 1]; } } using Graph = vector<...

#include <bits/stdc++.h> const long double pie = 3.1415926535; using namespace std; bool br1, br2, br; long long n, k, x, y, z, mini, maxi, l, ind, ini, sum, t, len, r, q, imini, w, m; string s, s1, s2; struct Point { long long X, Y; static long long getDir(Point a, Point b, Point c) { r...

#include <bits/stdc++.h> using namespace std; const long long N = 5e5 + 5, M = 65; long long n, q, d = 60, fa[N], opt, x, s[M]; double f[N][M]; void update(long long v) { long long top = 0, x = v; for (long long i = 0; i <= d; i++) { if (!x) break; s[top++] = x, x = fa[x]; } top--;...

#include <bits/stdc++.h> using namespace std; const int MaxN = 2e5 + 10; const int MOD = 1e9 + 7; const int INF = 1e9; int main() { int L, n, p, t; cin >> L >> n >> p >> t; if (n == 0) { cout << 0 << n ; exit(0); } vector<pair<int, int> > seg(n); for (int i = 0; i < n; ++...

#include <bits/stdc++.h> using namespace std; int n; vector<string> cards; map<vector<string>, bool> used; void rec(vector<string>& x) { if (x.size() == 1) { puts( YES ); exit(0); } if (used[x] == true) return; used[x] = true; int p = x.size() - 1; if (x[p][0] == x[p - 1][0...

#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using pii = pair<int, int>; const int INF = (int)1e9; struct Car { int x = INF; ll time = 0; int id = -1; Car() = default; Car(int xx, ll t, int i) : x(xx), time(t), id(i) {} }; Car get_best(c...

#include <bits/stdc++.h> using namespace std; char st1[100010], st2[100010]; int a1[100010], a2[100010], b1[100010], b2[100010]; int n; int read() { int x = 0, f = 1; char ch = getchar(); while (ch < 0 || 9 < ch) { if (ch == - ) f = -1; ch = getchar(); } while ( 0 <= ch &...

#include <bits/stdc++.h> const int MX = 2e6 + 7; const int N = 1e9 + 1; const int mod = 998244353; const double pi = acos(-1); double esp = 1e-13; using namespace std; long long qpow(long long a, long long b, long long MOD = mod) { for (long long ans = 1;; a = a * a % MOD, b >>= 1) { if (b & 1) ...

#include <bits/stdc++.h> using namespace std; int n, m; int R[101]; double dp[100100], sum[100100]; int main() { scanf( %d%d , &n, &m); if (m == 1) { puts( 1 ); return 0; } int score = 0; dp[0] = 1; double f = 1. / (m - 1); for (int i = 0; i < n; ++i) { scanf( %d ...

#include <bits/stdc++.h> using namespace std; int M = 998244353; int pow(int a, int b) { if (b == 0) { return 1; } if (b % 2) { return ((long long)a * pow(a, b - 1)) % M; } else { int temp = pow(a, b / 2); return ((long long)temp * temp) % M; } } int inv[3010]; in...

#include <bits/stdc++.h> using namespace std; const int N = 200010; const int MOD = 1000000007; const int INF = 0x3fffffff; typedef struct Node { long long v; int p; Node(long long v_, int p_) { v = v_; p = p_; } bool operator<(const Node& other) const { return v < other....

#include <bits/stdc++.h> using namespace std; const int N = 105; int n; int a[N]; int sum = 0; char s[N]; int main() { scanf( %d , &n); scanf( %s , s + 1); for (int i = 1; i <= n; ++i) { a[i] = s[i] - 0 ; sum += a[i]; } if (sum == 0) { puts( YES ); return 0; ...

#include <bits/stdc++.h> using namespace std; int main() { long long n; scanf( %lld , &n); long long sum[n + 5], ans[n + 5], a; cout << ? 1 2 << endl; cin >> sum[1]; cout << ? 2 3 << endl; cin >> sum[2]; cout << ? 1 3 << endl; cin >> sum[3]; ans[1] = (sum[1] + sum[3] - ...

#include <bits/stdc++.h> using namespace std; double const eps = 1e-7; struct Edge { int dest, flow, ctpt; double cost; Edge(int _dest, int _flow, double _cost, int _ctpt) : dest(_dest), flow(_flow), cost(_cost), ctpt(_ctpt) {} }; vector<Edge> edges[2004]; int source = 2002, sink = 2003,...

#include <bits/stdc++.h> using namespace std; void solve() { vector<int> v = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47}; int pos = -1, cnt = 0; for (int i = 0; i < v.size(); i++) { cout << v[i] << endl; string s; cin >> s; if (s == yes ) pos = i, cnt++; } i...

#include <bits/stdc++.h> using namespace std; const int maxn = 2010; int a[maxn], b[maxn], tot, n, m; pair<int, int> ans1, ans21, ans22; pair<long long, pair<int, int> > two[maxn * maxn]; int main(void) { long long s = 0, s2 = 1e18, s3 = 1e18; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf(...

#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3fLL; const double EPS = 1e-8; const int MOD = 1000000007; const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1}; int main() { cin.tie(0); ios::sync_with_stdio(false); int n; cin...

#include <bits/stdc++.h> using namespace std; int a[100], k[100]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; int t, n; cin >> t; for (int i = 0; i < t; ++i) { cin >> n; n *= 2; for (int j = 0; j < n; ++j) cin >> a[j]; for (int j = 0; j...

#include <bits/stdc++.h> using namespace std; const int inf = 2e9; const long double eps = 0.000001; const long long mod = 1e9 + 7; const long double PI = 3.14159265359; template <class T> struct MyVector : vector<T> { MyVector() : vector<T>() {} MyVector(int n) : vector<T>(n) {} T &operator[]...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 50; int b[maxn]; int cnt; int main() { std::ios::sync_with_stdio(false); int t; cin >> t; while (t--) { string a; cin >> a; cnt = 0; bool flag = true; for (int i = 0; i < a.size(); i++) { ...

#include <bits/stdc++.h> using namespace std; const int maxn = 150 + 10; int a[maxn][maxn]; int n; int main() { scanf( %d , &n); a[0][0] = 1; a[1][1] = 1; for (int i = 2; i <= n; i++) { for (int j = 0; j <= i; j++) { if (j > 0) a[i][j] = a[i - 1][j - 1]; if (j <= i - 2) {...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10; int b[maxn]; char a[maxn]; int num[2 * maxn]; int main() { int n; scanf( %d , &n); int count0 = 0, count1 = 0; memset(num, -1, sizeof(num)); int len = 0, maxlen = 0; scanf( %s , a + 1); for (int i = 1; i <= ...

#include <bits/stdc++.h> using namespace std; int n; int h[1000010], f[1000010][2]; void Work() { int ans = 0; for (int i = 1; i <= n; i++) { int l, r; l = min(h[i - 1], h[i]); r = min(h[i], h[i + 1]); if (l <= r) f[i][1] = 1LL * f[i - 1][1] * l % 1000000007; else {...

#include <bits/stdc++.h> using namespace std; int main() { long long t, n, m, k, rem, each, x, y, i, j, ans; cin >> t; while (t--) { cin >> n >> m >> x >> y; string s[n]; long long one = 0, two = 0; for (i = 0; i < n; i++) { cin >> s[i]; } for (i = 0; i < n; i...

#include <bits/stdc++.h> using namespace std; constexpr long long mod = 1000000007; pair<long long, long long> dfs(int v, const vector<vector<int>> &children, const vector<int> &black) { long long zero = 0; long long one = 0; (black[v] ? one : zero) = 1; for (const...

#include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 7; int dp[80][80][80][2]; char c[80]; vector<int> V, K, a; int cal(int id, vector<int> vv, int pos) { int cnt = 0; for (int i = id; i < ((int)vv.size()); i++) if (vv[i] < pos) cnt++; return cnt; } int cc(int i, int j, ...

#include <bits/stdc++.h> using namespace std; int main() { long long n, m, k; cin >> n >> m >> k; long long l = 0, h = n * m + 2; while (l < h) { long long md = (l + h) / 2; long long rs = 0; for (int i = 1; i <= n; i++) rs += min(m, md / i); if (rs < k) l = md + 1; ...