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 = 2000; const int MAXE = 30001; const int INF = 2000000002; struct edge { int to; int w; int id; edge() {} edge(int to, int w, int id) : to(to), w(w), id(id) {} bool operator==(const edge& e) const { return to == e.to &...
#include <bits/stdc++.h> using namespace std; const long long maxn = 4e5 + 1; struct dak { long long val, pos; }; long long l[maxn], r[maxn]; long long pre[maxn], pre2[maxn]; vector<dak> p; vector<pair<long long, long long> > v; vector<pair<long long, long long> > qr; long long n, m, q; long l...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; for (int i = 1; i <= n; i++) if (n == i * (i + 1) / 2) { cout << YES ; return 0; } cout << NO ; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 2; int n, m, a[N], cnt[N], nxt[N]; bool vis[N]; int main() { int test; cin >> test; while (test--) { cin >> n >> m; for (int i = 0; i <= n; ++i) cnt[i] = 0; for (int i = 1; i <= n; ++i) { cin >> a[i]; ...
#include <bits/stdc++.h> using namespace std; const long long K = 10000000000LL; vector<long long> L; void init(long long crr) { if (crr > K) return; if (crr != 0) L.push_back(crr); init(crr * 10 + 4); init(crr * 10 + 7); } bool is_lucky(long long x) { if (x == 0) return false; while...
#include <bits/stdc++.h> using namespace std; namespace my_template { const long double PI = 3.14159265358979323846264338327950288419716939937510582097494L; template <typename T> pair<T, T> operator+(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.first + b.first, a.second + b.second...
#include <bits/stdc++.h> using namespace std; void solve() { long long n, m; cin >> n >> m; vector<vector<long long> > a(m, vector<long long>(n)); for (long long i = 0; i <= n - 1; i++) { for (long long j = 0; j <= m - 1; j++) { cin >> a[j][i]; a[j][i]--; } } long...
#include <bits/stdc++.h> using namespace std; const long long SIZE = 1e5; long long n, a[SIZE], dp[SIZE][2][2]; void Max(long long &a, long long b) { a = max(a, b); } signed main() { cin >> n; for (long long i = 0; i < n; i++) { cin >> a[i]; } for (long long i = 0; i < n; i++) { fo...
#include <bits/stdc++.h> using namespace std; typedef struct { int op, l, r, x, y; } query; int n, m, seed, vmax, a[100000]; query qs[100000]; int rnd() { int ret = seed; seed = (1LL * seed * 7LL + 13LL) % 1000000007LL; return ret; } long long get_num(map<int, long long>& mp, int i) { ...
#include <bits/stdc++.h> using namespace std; long long leader[110000], p[110000]; long long n, m, i, j, k; bool can(long long cost) { for (i = 0, j = 0; i < n && j < m; ++i) { long long summ = cost; if (leader[i] == p[j] && j < m) ++j; if (j >= m) break; summ -= abs(leader[i] - p[j]...
#include <iostream> using namespace std; int main() { ios::sync_with_stdio(0); int t; cin >> t; while(t--) { int x,y; cin >> x >> y; cout << 2*max(x,y) - (min(x,y) != max(x,y)) << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; int mod = (int)1e9 + 7; template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << : << arg1 << n ; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args) { const char* comma ...
#include <bits/stdc++.h> using namespace std; void build(int ss, int se, int si); long long query(int ss, int se, int si, int qs, int qe); set<pair<long long, int> > s; set<pair<long long, int> >::iterator it, last; long long A[100001], st[400005], dp[100001]; int main(void) { int i, n, c; long lo...
#include <bits/stdc++.h> using namespace std; int main() { int i, N, bitl, bitr; long long l, r; scanf( %d , &N); while (N--) { scanf( %lld%lld , &l, &r); bitl = bitr = 0; if (l == r) { printf( %lld n , l); continue; } while ((1LL << bitl) <= l) ++bitl; ...
#include <bits/stdc++.h> using namespace std; void cmax(long long int &a, long long int b) { if (a < b) a = b; } const int mod = 1000000007; bool comp(int x, int y) { return x > y; } void printarr(int arr[], int n) { for (int i = 0; i < n; ++i) std::cout << arr[i] << (i < n - 1 ? : n ); } ...
#include <bits/stdc++.h> using namespace std; const long long inf = 4e18; const long long N = 2e5 + 10; void testCase() { long long n; cin >> n; long long a[n + 1]; for (long long i = 1; i <= n; i++) cin >> a[i]; vector<long long> sma(n + 2), suf(n + 2); for (long long i = n; i >= 1; i--...
#include <bits/stdc++.h> using namespace std; int const N = 200001; int main() { int t; scanf( %d , &t); while (t--) { int n; string s, t; scanf( %d , &n); cin >> s >> t; set<int> msA[200], msB[200]; map<char, int> f; for (int i = 0; i < n; ++i) { msA[...
#include <bits/stdc++.h> using namespace std; const int n = 5000; const long long mod = 998244353; long long f[n + 10][n + 10]; int main() { int a, b, c; for (int i = 1; i < n + 10; i++) { for (int j = 1; j < n + 10; j++) { if (i == 1) f[i][j] = j + 1; else if (j < i) ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1000055; const int inf = 0x3f3f3f3f; const double pi = acos(-1.0); const int mod = 1e9 + 7; long long pow_mod(long long a, long long b) { long long ans = 1 % mod; for (; b; b >>= 1) { if (b & 1) ans = (long long)ans * a % mod; ...
#include <bits/stdc++.h> using namespace std; int main() { int k; cin >> k; if (k == 2) puts( 1 1 ); if (k == 3) puts( 1 0 1 ); if (k == 4) puts( 0 0 1 1 ); if (k == 5) puts( 1 1 1 0 1 ); if (k == 6) puts( 1 0 0 1 1 1 ); if (k == 7) puts( 1 1 1 0 1 1 1 ); if (k == 8) puts( 1 0 0 ...
#include <bits/stdc++.h> using namespace std; template <typename T> void chmin(T &x, const T &y) { if (x > y) x = y; } template <typename T> void chmax(T &x, const T &y) { if (x < y) x = y; } int read() { char c; while ((c = getchar()) < - ) ; if (c == - ) { int x = (c ...
#include <bits/stdc++.h> using namespace std; const double EPS = 1e-8; const long long SZ = 1010, SSZ = 100010, APB = 26, one = 93, INF = 0x3f3f3f3f3f3f3f3f, mod = 1000000007; long long n, m, bg, fn, cnt; long long to[SSZ], wt[SSZ], head[SZ]; long long nex[SSZ], mk[SSZ]; long long dfn[SZ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); int x; cin >> x; vector<int> first(x); vector<int> second(x); int sum_f = 0; for (int i = 0; i < x; i++) { cin >> first[i]; sum_f += first[i]; } int sum_s = 0; for (int i = 0;...
#include <bits/stdc++.h> using namespace std; int tavan(int a, int n, int mod) { int res = 1; while (n) res = (n & 1) ? a : 1, res %= mod, n /= 2, a = a, a %= mod; return res; } const int MOD = ((int)81671); const int N = ((int)40); const int M = ((int)12); const int X = ((int)2e6); int n,...
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; int main() { int T, t1 = 0, t2, maxn = 0, flag = 1, sum = 0, sum1 = 0; scanf( %d , &T); while (T--) { scanf( %d , &t2); if (flag && t2 == 0) { maxn = max(maxn, sum); sum1 = sum; sum = 0; ...
#include <bits/stdc++.h> using namespace std; int n, k, a[(int)2e5]; long long sum; double d, res; int main() { cin >> n >> k; for (int i = 0; i < n; ++i) { cin >> a[i]; if (i < k) sum += a[i]; } d = n - k + 1; res += sum / d; for (int i = k; i < n; ++i) { sum -= a[i ...
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int a = 0; for (int i = 0; i < s.size(); i++) { if (s[i] == a ) a++; } for (int i = s.size(); i >= a; i--) { if (a > (i / 2)) { cout << i << endl; exit(0); } } }
#include <bits/stdc++.h> using namespace std; int ABS(int a) { if (a < 0) return (-a); return a; } vector<int> v[50005]; int main() { int n, r1, r2, i; scanf( %d , &n); scanf( %d , &r1); scanf( %d , &r2); for (i = (1); i < (n + 1); ++i) { if (r1 == i) continue; int x; ...
#include <bits/stdc++.h> using namespace std; function<void(void)> ____ = []() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); }; const int MAXN = 555; int n, m, match[MAXN]; bool mp[MAXN][MAXN], vis[MAXN]; vector<int> G[MAXN]; bool dfs(int u, int c) { vis[u] = true; for...
#include <bits/stdc++.h> using namespace std; const int MaxN = 110; const double EPS = 1E-10; struct TTriangle { double x[3], y[3]; } a[MaxN]; struct TSeg { double x[2], y[2]; } Seg[MaxN * 3]; int n, Total; double Ans; pair<double, int> s[MaxN * 3 * 2]; inline double Cross(const double x1,...
#include <bits/stdc++.h> const int maxn = 1e6 + 10; using namespace std; int pre[maxn]; int main() { string a, b; cin >> a; cin >> b; int LA = a.size(); int LB = b.size(); int flag = 0, ans = 0; for (int i = 0; i < LB; i++) { if (b[i] == 1 ) flag++; } flag %= 2; if...
#include <bits/stdc++.h> using namespace std; int main() { int n, m, a, b, sum = 0, sum1 = 0; cin >> n >> m >> a >> b; sum = n / m; sum1 = n - (sum * m); if (sum * b < n * a) { cout << min((sum * b + sum1 * a), ((sum + 1) * b)); } if (sum * b >= n * a) { cout << n * a; } ...
#include <bits/stdc++.h> using namespace std; const int N = 5e5 + 5; unordered_map<long long, long long> m1, mp; long long m, k, n, s; bool check() { for (auto it : mp) { if (it.second > m1[it.first]) return false; } return true; } int main() { ios::sync_with_stdio(0); cin.tie(0)...
#include <bits/stdc++.h> using namespace std; long long n, s, a[100005], p, w[100005], ans; multiset<long long> st; int main() { cin >> n >> s; for (int k = 1; k <= n; k++) cin >> a[k]; cin >> p; for (int k = 1; k <= n; k++) cin >> w[k]; for (int k = 1; k <= n; k++) { st.insert(w[k]); ...
#include <bits/stdc++.h> using namespace std; const int limite = 1000000; int n; long long int a[limite]; long long int suma[limite]; map<long long int, int> cuantos; int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; a[i + n] = a[i]; } for (int i = 1; i <= 2 * ...
#include <bits/stdc++.h> using namespace std; int main(int argc, char* argv[]) { int n, m, k; vector<double> r1, p1, p2; cin >> n; while (n--) { int hlp; cin >> hlp; r1.push_back(hlp); } cin >> m; while (m--) { int hlp; cin >> hlp; p1.push_back(hlp); ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1000000; const int INF = 1000000001; vector<int> G[MAXN + 1]; bool vis[MAXN + 1]; vector<int> CC; int n, m, k; int dfs(int v) { vis[v] = true; int ret = 1; for (__typeof((G[v]).begin()) u = (G[v]).begin(); u != (G[v]).end(); ++u)...
#include <bits/stdc++.h> using namespace std; int main() { long long int a, b, x, y, n, ans, t; cin >> t; while (t--) { ans = LLONG_MAX; cin >> a >> b >> x >> y >> n; if (n >= (a - x + b - y)) cout << x * y << n ; else { if ((a - n) >= x) ans = (a - n)...
#include <bits/stdc++.h> using namespace std; int n, m, l[2001], s[2001], c[4001]; int f[4001][2001]; int main() { scanf( %d%d , &n, &m); m += n; for (int i = n; i >= 1; i -= 1) scanf( %d , &l[i]); for (int i = n; i >= 1; i -= 1) scanf( %d , &s[i]); for (int i = 1; i <= m; i += 1) scanf( %d ...
#include <bits/stdc++.h> int main() { long long int a, b = 1, i; scanf( %I64d , &a); for (i = 1; i <= a; i++) { b += 12 * (1 + i - 2); } if (a == 1) printf( 1 ); else printf( %I64d , b); return 0; }
#include <bits/stdc++.h> using namespace std; pair<long long int, long long int> rec(long long int n) { long long int mini = 1e18, maxi = -1; while (n) { mini = min(mini, n % 10); maxi = max(maxi, n % 10); n /= 10; } return {mini, maxi}; } int main() { long long int t; ...
#include <bits/stdc++.h> using namespace std; int const maxn = 1e6 + 5; int a[maxn], b[maxn]; pair<int, int> c[maxn]; int all_elem[2 * maxn]; int cur, inf = 1e9 + 7; int f[2 * maxn]; int psh[8 * maxn]; pair<int, int> imin[4 * maxn]; inline pair<int, int> unions(pair<int, int> c, pair<int, int> d) { ...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; int n, m, same; string s; int main() { cin >> n >> m >> s; long long ans = 1LL * n * (m - 1); for (int i = 1; i < n; i++) { if (s[i] == s[i - 2]) { same++; } else { same = 0; } if (s[i] != ...
#include <bits/stdc++.h> int main() { int i, m, j; char a[1000], b[1000]; scanf( %s %s , &a, &b); if (strlen(a) != strlen(b)) { printf( NO ); return 0; } j = strlen(b) - 1; for (i = 0; i < strlen(a); i++) { if (a[i] != b[j]) { printf( NO ); return 0; ...
#include <bits/stdc++.h> using namespace std; const long long MAX = 105; const long long MAXV = 2e5 + 1; const long long INF = 1e9; bool prime[MAXV]; void sieve() { memset(prime, true, sizeof(prime)); prime[0] = prime[1] = false; for (long long i = 2; i * i < MAXV; i++) { if (prime[i]) { ...
#include <bits/stdc++.h> using namespace std; template <typename T> inline T fetch() { T ret; cin >> ret; return ret; } template <typename T> inline vector<T> fetch_vec(long long sz) { vector<T> ret(sz); for (auto& it : ret) cin >> it; return ret; } template <typename T> inline...
#include <bits/stdc++.h> using namespace std; int n, cnt, x, y, mx, tot; int head[200005], bin[200005], V[200005 * 5], T[200005 * 5]; struct pl { int v, nex; } e[2 * 200005]; void add(int a, int b) { cnt++; e[cnt].v = b; e[cnt].nex = head[a]; head[a] = cnt; bin[a]++; } void dfs(i...
#include <bits/stdc++.h> using namespace std; int n, k, t; char a[3][200]; bool vis[3][200]; bool check(int x, int y) { return (x >= 0 && y >= 0 && x < 3 && y < 200); } void solve(int cx, int cy) { if (vis[cx][cy]) { return; } vis[cx][cy] = true; if (check(cx, cy + 3) && a[cx][cy + 1] ...
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } long long lcm(long long a, long long b) { return (a / gcd(a, b) * b); } bool sorta(const pair<int, int> &a, const pair<int, int> &b) { return (a.second < b.second);...
#include <bits/stdc++.h> using namespace std; const int N = 3 + 2e5; int root[N], ls[N << 5], rs[N << 5], id; int sum[N << 5]; int n, q, p[N]; void update(int &u, int v, int l, int r, int p) { sum[u = ++id] = sum[v] + 1; if (l == r) return; int mid = l + r >> 1; if (p <= mid) rs[u] = r...
#include <bits/stdc++.h> using namespace std; int main() { long long int n, k, p; cin >> n >> k; int l = log2(n) + 1; for (long int i = 1; i <= 30; i++) { if (n - i * k > 0) { p = n - i * k; bitset<30> b(p); if (i > b.count() && p != 1 && p >= i) { cout << i; ...
#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > sol[1 << 9]; vector<pair<int, int> > gs(int t, int x) { static int fm[1 << 19]; static pair<int, int> fs[1 << 19]; queue<int> q; vector<pair<pair<int, int>, int> > sb; for (int i = 0; i < (1 << t); ++i) fm[i] = -1; for (...
#include <bits/stdc++.h> using namespace std; inline int read() { int s = 0, w = 1; char ch = getchar(); while (ch < 0 \|\| ch > 9 ) { if (ch == - ) w = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { s = s * 10 + ch - 0 ; ch = getchar(); } return s * w;...
#include <bits/stdc++.h> using namespace std; int main() { long long i, j, m, n, k, x, y, sum = 0; cin >> n >> k; vector<long long> sura; vector<pair<long long, long long> > dada; vector<pair<long long, long long> > dada2; vector<long long> su; long long arr[n]; priority_queue<long l...
#include <bits/stdc++.h> using namespace std; template <typename T1, typename T2> void chkmin(T1 &x, T2 y) { if (x > y) x = y; } template <typename T1, typename T2> void chkmax(T1 &x, T2 y) { if (x < y) x = y; } inline void debug(int x) { fprintf(stderr, ycx has aked ioi %d times n , x); } na...
#include <bits/stdc++.h> using namespace std; int main() { string s; bool neg = false; cin >> s; int n = s.length(); if (s[0] == - ) { neg = true; n--; } int cur = 0; if (n < 3) cur = 1; else if (n == 3) if ((!neg && s <= 127 ) \|\| (neg && s <= -128 )) ...
#include <bits/stdc++.h> using namespace std; long long mp[2005]; int main() { memset(mp, 0, sizeof mp); long long key[2001], a[2001], n, k, p, i, j; cin >> n >> k >> p; for (i = 0; i < n; i++) { scanf( %lld , a + i); } for (i = 0; i < k; i++) { scanf( %lld , key + i); } ...
#include <bits/stdc++.h> using namespace std; long long n, N, m, op, w, ax, ay, bx, by, cx, cy, ix, iy, bit[4][505][505]; long long v(long long x) { if (x & 1) return (x >> 1) + 1; else return x >> 1; } long long P(long long x, long long y) { if ((x & 1) && (y & 1)) return 0; if ((...
#include <bits/stdc++.h> using namespace std; long long poww(long long a, long long b, long long md) { return (!b ? 1 : (b & 1 ? a * poww(a * a % md, b / 2, md) % md : poww(a * a % md, b / 2, md) % md)); } const long long MAXN = 1e5 + 10; const long long INF = 8e18; ...
#include <bits/stdc++.h> using namespace std; int main() { long long i, a[3333]; int t, n; cin >> t; while (t--) { cin >> n; for (i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); long long x; x = a[0] * a[n - 1]; int flag = 1, ans = 0; for (i = 0; i < n; i++)...
#include <bits/stdc++.h> using namespace std; pair<int, int> cost[111111]; bool okay[111111]; int main(void) { int n = 0; int k = 0; scanf( %d %d , &n, &k); long long b = 0; scanf( %I64d , &b); for (int i = 0; i < n; i++) { scanf( %d , &cost[i].first); cost[i].second = i; ...
#include <bits/stdc++.h> using namespace std; const int MAXSZ = 100000; int req[MAXSZ]; int prob[MAXSZ]; int main(int argc, const char* argv[]) { int n, m, k; scanf( %d%d , &n, &m); int count = 1; for (int i = 0; i < m; i++) { scanf( %d , &k); prob[k]++; req[prob[k]]++; ...
#include <bits/stdc++.h> using namespace std; map<long long int, long long int> m; int main() { long long int t; cin >> t; while (t--) { long long int n; cin >> n; long long int a[n]; for (long long int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); long long int x...
#include<iostream> #include<bits/stdc++.h> using namespace std; typedef long long int ll; ll max(ll a,ll b){ if(a>b)return a; return b; } int main(){ int T; cin>>T; while(T--){ int n,k; cin>>n>>k; string s1,s2; cin>>s1; cin>>s2;...
#include <bits/stdc++.h> using namespace std; int read() { char c = getchar(); int d = 0, f = 1; for (; c < 0 \|\| c > 9 ; c = getchar()) if (c == - ) f = -1; for (; c >= 0 && c <= 9 ; d = d * 10 + c - 48, c = getchar()) ; return d * f; } const int mod = 1e9 + 7; const int...
#include <bits/stdc++.h> using namespace std; inline int mini(int a, int b) { return a < b ? a : b; } inline int maxi(int a, int b) { return a > b ? a : b; } int main() { int n; scanf( %d , &n); int *a = new int[n]; int najm = 1000000010; for (int i = 0; i < n; i++) { scanf( %d , &a[i]...
#include <bits/stdc++.h> using namespace std; mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); void setIO(string name) { ios_base::sync_with_stdio(false); cin.tie(nullptr); cin.exceptions(istream::failbit); } const int inf = 0x3f3f3f3f, mod = 1e9 + 7; int main() { ...
#include <bits/stdc++.h> int main() { int i, j, l = 0, a, A[6], n[6], m = 0; for (i = 0; i < 6; i++) { scanf( %d , &a); for (j = 0; j < l; j++) { if (A[j] == a) break; } if (j == l) { n[l] = 1; A[l++] = a; } else n[j]++; } for (i = 0; i < l...
#include <bits/stdc++.h> using namespace std; int main() { int n, i; cin >> n; long a[n + 1], b[n + 1]; for (i = 0; i < n; i++) cin >> a[i]; a[n] = 1; b[0] = 1; for (i = 1; i <= n; i++) { b[i] = (2 * b[i - 1] - b[a[i - 1] - 1] + 2) % 1000000007; if (b[i] < 0) b[i] += 10000000...
#include <bits/stdc++.h> using namespace std; const int inf = 80009; unsigned long long n; vector<int> adj[inf]; unsigned long long low[inf]; unsigned long long sl[inf]; unsigned long long sz[inf]; unsigned long long als; unsigned long long ans = 0; void dfs(int x, int p) { unsigned long long s ...
#include <bits/stdc++.h> using namespace std; vector<int> graph[200000]; int color[200000], black, white, maxDist, farNode; void solve(int node, int par, int dis) { if (dis > maxDist) farNode = node, maxDist = dis; for (auto &v : graph[node]) { if (v == par) continue; solve(v, node, dis + (c...
#include <bits/stdc++.h> const int INF = 0x3f3f3f3f; const int maxn = 3e3 + 50; const int Mod = 1000000007; const double PI = acos(-1); using namespace std; struct Ans { int id, x; string ret; }; Ans ans[maxn]; string v[maxn]; int cnt; bool full; int n; inline bool cmpById(const Ans &a...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[100010]; for (int i = 0; i < n; i++) { cin >> a[i]; } sort(a, a + n); int ans = 0; int re = 0; for (int i = 0; i < n; i++) { int t = 1; while (a[i + 1] == a[i] && (i < n - 1)) { ...
#include <bits/stdc++.h> int main() { int n, m, z; std::cin >> n >> m >> z; int counter = 0; for (int i = 1; i * n <= z; i++) { if ((i * n) % m == 0) counter++; } std::cout << counter; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 105; const double eps = 1e-6; int n, k, q, m; int a[N], b[N], used[N]; double MinAns = 100.0, MaxAns = 0.0; double max(double x, double y) { return x - eps >= y ? x : y; } double min(double x, double y) { return x + eps <= y ? x : y; } void i...
#include <bits/stdc++.h> int i, n, k, a, s, j; int main() { for (std::cin >> n >> k; i < k; i++) std::cin >> a, a % 2 ? a++, j++ : 0, s += a; std::cout << (s > 8 * n \|\| s == 8 * n && k == 4 * n && j < n ? NO : YES ); }
#include <bits/stdc++.h> using namespace std; int main() { int n, sum = 0, i; cin >> n; string s; cin >> s; int k = 1; for (i = 0; i < n; i++) { if (s[i] == 1 && k == 1) { sum++; } else if (s[i] == 0 && k == 1) { sum++; k = 0; } } cout <<...
#include <bits/stdc++.h> using namespace std; inline void read(int &x) { short negative = 1; x = 0; char c = getchar(); while (c < 0 \|\| c > 9 ) { if (c == - ) negative = -1; c = getchar(); } while (c >= 0 && c <= 9 ) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();...
#include <bits/stdc++.h> using namespace std; long long int n, a, b, signo, dist, centro; vector<pair<long long int, long long int> > distancias; vector<long long int> izq, der; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n; a = 1; b = 2; for (int i = (3); i <=...
#include <bits/stdc++.h> using namespace std; inline int read() { char x = 0 ; int fh = 1, sum = 0; for (x = getchar(); x < 0 \|\| x > 9 ; x = getchar()) if (x == - ) fh = -1; for (; x >= 0 && x <= 9 ; x = getchar()) sum = sum * 10 + x - 0 ; return fh * sum; } const int N = 1e5...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, k, a; scanf( %d , &n); vector<int> nums; unordered_map<int, int> hashmap, sizes, parent, inp; for (int i = 0; i < n; i++) { scanf( %d , &a); ...
#include <bits/stdc++.h> int main() { char str[100][100] = { January , February , March , April , May , June , July , August , September , October , November , December }; char month[100]; scanf( %[^ n] , month); int n...
#include <bits/stdc++.h> inline int read() { char c = getchar(); while (c != - && (c < 0 \|\| c > 9 )) c = getchar(); int k = 0, kk = 1; if (c == - ) c = getchar(), kk = -1; while (c >= 0 && c <= 9 ) k = k * 10 + c - 0 , c = getchar(); return kk * k; } using namespace std; void w...
#include <bits/stdc++.h> using namespace std; priority_queue<int> Q[200]; int main() { int n, k; cin >> n >> k; unsigned long long pr[200000]; for (int i = 0; i < n; i++) { cin >> pr[i]; } string str; vector<unsigned long> vec[200]; unsigned long long sum = 0; cin >> str;...
#include <bits/stdc++.h> using namespace std; int a[10][10], b[10][10]; struct per { int x, y; }; int k; queue<per> q, q2; void bf2() { while (!q2.empty()) { per aux; aux = q2.front(); q2.pop(); int xx = aux.x - 1, yy = aux.y - 1; if (b[xx][yy] == 0) { b[xx][y...
#include <bits/stdc++.h> using namespace std; const int MAX = 1005; int N, K, D[MAX], S[MAX]; int main() { scanf( %d%d , &N, &K); for (int i = 0; i < (int)N; i++) scanf( %d , &D[i]); for (int i = 0; i < (int)N; i++) scanf( %d , &S[i]); int res = 0; int lho = S[0]; int pos = 0; int fu...
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3fLL; const int MAX = 5e3 + 10; const int MOD = 998244353; long long fat[MAX], ifat[MAX]; long long choose(int a, int b) { if (a < b) return 0; return fat[a] * ifat[b] % MOD * ifat[a - ...
#include <bits/stdc++.h> using namespace std; int get() { int f = 0, v = 0; char ch; while (!isdigit(ch = getchar())) if (ch == - ) break; if (ch == - ) f = 1; else v = ch - 0 ; while (isdigit(ch = getchar())) v = v * 10 + ch - 0 ; if (f) return -v; else ...
#include <bits/stdc++.h> using namespace std; int a[1153][1153]; int n, m; unsigned long long int b[1153][1153]; bool pos(int minval) { memset(b, 0, sizeof(b)); int i, j, k; for (i = 0; i < n; i++) { int ccnt = 0; for (j = 0; j < 1024; j += 63) { unsigned long long int blk = 0;...
#include <bits/stdc++.h> using namespace std; const int N = 100500; int n, q; int len[N]; vector<pair<int, int>> g[N]; double prob[N]; double sum; int dfs(int v, int p) { int size = 1; for (auto e : g[v]) { int to = e.first; int ind = e.second; int w = len[ind]; if (to ==...
#include <bits/stdc++.h> using namespace std; int main() { int ts; cin >> ts; while (ts--) { int n; cin >> n; vector<int> v(n); vector<int> pos[2]; for (int i = 0; i < n; i++) { cin >> v[i]; pos[v[i]].push_back(i); } int x = 0; if (pos[0].s...
#include <bits/stdc++.h> using namespace std; int a[200007], b[200007]; bool check[200007]; int main() { string s; getline(cin, s); int res = 0; for (auto i = (0); i <= ((int)s.size() - 1); ++i) { int tmp = s[i]; int ans = 0; for (auto i = (1); i <= (8); ++i) { ans = 2 ...
#include <bits/stdc++.h> using namespace std; const int maxn = 1 << 20; int pos[maxn]; int n, m; long long k, ans[maxn]; int val[maxn]; struct query { int l, r, id; } Q[maxn]; long long now = 0; long long M[maxn]; bool cmp(query a, query b) { if (pos[a.l] == pos[b.l]) return a.r < b.r; ...
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10; const int mod = 998244353; int n; long long a[N]; long long p[N]; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %lld , &a[i]); long long m = 1; p[0] = 1; p[1] = 3; for (int i = 2; i < n; i++) {...
#include <bits/stdc++.h> using namespace std; const int N = 400010; const int P = 1000000007; int m, n, mi[N], l[N], r[N]; char a[N], ans[N]; bool Check(int t, int x) { if (++t < x) return 0; return ((r[t] - r[t - x] * mi[x]) * mi[t - x] == l[t] - l[t - x]); } bool Dfs(int k, bool has) { if ...
#include <bits/stdc++.h> using namespace std; const int S = (int)1e6; int dp[S]; string txt, pat; vector<int> ans; void kmp() { int i = 0, j = -1, n = ((int)(txt.size())), m = ((int)(pat.size())); dp[0] = -1; while (i < m) { while (j >= 0 and pat[i] != pat[j]) j = dp[j]; i++, j++; ...
#include <bits/stdc++.h> using namespace std; const int MAX = 1100100; long long N, l, r; long long L[MAX], R[MAX], d, sol; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> N; for (int I = 0; I < N; I++) { cin >> L[I] >> R[I]; l += L[I]; r += R[I]; } d = ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); long long p = 1234567, q = 123456, r = 1234, n; cin >> n; long long x = n; for (int a = 0; a <= n; a += 1234567) for (int b = 0; b <= n - a; b += 123456) { if ((n - a - b) % 123...
#include <bits/stdc++.h> using namespace std; int main() { long long n, m; cin >> n >> m; if (n > m) swap(n, m); if (n == 2) { if (m % 4 == 0) cout << m; else if (m % 4 == 1) cout << m + 1; else cout << (m / 4) * 4 + 4; } else if ((m < 2) \|\| (n < 2) \|\| (...
#include <bits/stdc++.h> using namespace std; int main() { int size; cin >> size; while (size--) { int nums; cin >> nums; while (nums--) cout << 1 << ; cout << n ; } return 0; }

#include <bits/stdc++.h> using namespace std; const int MAXN = 2000; const int MAXE = 30001; const int INF = 2000000002; struct edge { int to; int w; int id; edge() {} edge(int to, int w, int id) : to(to), w(w), id(id) {} bool operator==(const edge& e) const { return to == e.to &...

#include <bits/stdc++.h> using namespace std; const long long maxn = 4e5 + 1; struct dak { long long val, pos; }; long long l[maxn], r[maxn]; long long pre[maxn], pre2[maxn]; vector<dak> p; vector<pair<long long, long long> > v; vector<pair<long long, long long> > qr; long long n, m, q; long l...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; for (int i = 1; i <= n; i++) if (n == i * (i + 1) / 2) { cout << YES ; return 0; } cout << NO ; return 0; }

#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 2; int n, m, a[N], cnt[N], nxt[N]; bool vis[N]; int main() { int test; cin >> test; while (test--) { cin >> n >> m; for (int i = 0; i <= n; ++i) cnt[i] = 0; for (int i = 1; i <= n; ++i) { cin >> a[i]; ...

#include <bits/stdc++.h> using namespace std; const long long K = 10000000000LL; vector<long long> L; void init(long long crr) { if (crr > K) return; if (crr != 0) L.push_back(crr); init(crr * 10 + 4); init(crr * 10 + 7); } bool is_lucky(long long x) { if (x == 0) return false; while...

#include <bits/stdc++.h> using namespace std; namespace my_template { const long double PI = 3.14159265358979323846264338327950288419716939937510582097494L; template <typename T> pair<T, T> operator+(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.first + b.first, a.second + b.second...

#include <bits/stdc++.h> using namespace std; void solve() { long long n, m; cin >> n >> m; vector<vector<long long> > a(m, vector<long long>(n)); for (long long i = 0; i <= n - 1; i++) { for (long long j = 0; j <= m - 1; j++) { cin >> a[j][i]; a[j][i]--; } } long...

#include <bits/stdc++.h> using namespace std; const long long SIZE = 1e5; long long n, a[SIZE], dp[SIZE][2][2]; void Max(long long &a, long long b) { a = max(a, b); } signed main() { cin >> n; for (long long i = 0; i < n; i++) { cin >> a[i]; } for (long long i = 0; i < n; i++) { fo...

#include <bits/stdc++.h> using namespace std; typedef struct { int op, l, r, x, y; } query; int n, m, seed, vmax, a[100000]; query qs[100000]; int rnd() { int ret = seed; seed = (1LL * seed * 7LL + 13LL) % 1000000007LL; return ret; } long long get_num(map<int, long long>& mp, int i) { ...

#include <bits/stdc++.h> using namespace std; long long leader[110000], p[110000]; long long n, m, i, j, k; bool can(long long cost) { for (i = 0, j = 0; i < n && j < m; ++i) { long long summ = cost; if (leader[i] == p[j] && j < m) ++j; if (j >= m) break; summ -= abs(leader[i] - p[j]...

#include <iostream> using namespace std; int main() { ios::sync_with_stdio(0); int t; cin >> t; while(t--) { int x,y; cin >> x >> y; cout << 2*max(x,y) - (min(x,y) != max(x,y)) << n ; } return 0; }

#include <bits/stdc++.h> using namespace std; int mod = (int)1e9 + 7; template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << : << arg1 << n ; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args) { const char* comma ...

#include <bits/stdc++.h> using namespace std; void build(int ss, int se, int si); long long query(int ss, int se, int si, int qs, int qe); set<pair<long long, int> > s; set<pair<long long, int> >::iterator it, last; long long A[100001], st[400005], dp[100001]; int main(void) { int i, n, c; long lo...

#include <bits/stdc++.h> using namespace std; int main() { int i, N, bitl, bitr; long long l, r; scanf( %d , &N); while (N--) { scanf( %lld%lld , &l, &r); bitl = bitr = 0; if (l == r) { printf( %lld n , l); continue; } while ((1LL << bitl) <= l) ++bitl; ...

#include <bits/stdc++.h> using namespace std; void cmax(long long int &a, long long int b) { if (a < b) a = b; } const int mod = 1000000007; bool comp(int x, int y) { return x > y; } void printarr(int arr[], int n) { for (int i = 0; i < n; ++i) std::cout << arr[i] << (i < n - 1 ? : n ); } ...

#include <bits/stdc++.h> using namespace std; const long long inf = 4e18; const long long N = 2e5 + 10; void testCase() { long long n; cin >> n; long long a[n + 1]; for (long long i = 1; i <= n; i++) cin >> a[i]; vector<long long> sma(n + 2), suf(n + 2); for (long long i = n; i >= 1; i--...

#include <bits/stdc++.h> using namespace std; int const N = 200001; int main() { int t; scanf( %d , &t); while (t--) { int n; string s, t; scanf( %d , &n); cin >> s >> t; set<int> msA[200], msB[200]; map<char, int> f; for (int i = 0; i < n; ++i) { msA[...

#include <bits/stdc++.h> using namespace std; const int n = 5000; const long long mod = 998244353; long long f[n + 10][n + 10]; int main() { int a, b, c; for (int i = 1; i < n + 10; i++) { for (int j = 1; j < n + 10; j++) { if (i == 1) f[i][j] = j + 1; else if (j < i) ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 1000055; const int inf = 0x3f3f3f3f; const double pi = acos(-1.0); const int mod = 1e9 + 7; long long pow_mod(long long a, long long b) { long long ans = 1 % mod; for (; b; b >>= 1) { if (b & 1) ans = (long long)ans * a % mod; ...

#include <bits/stdc++.h> using namespace std; int main() { int k; cin >> k; if (k == 2) puts( 1 1 ); if (k == 3) puts( 1 0 1 ); if (k == 4) puts( 0 0 1 1 ); if (k == 5) puts( 1 1 1 0 1 ); if (k == 6) puts( 1 0 0 1 1 1 ); if (k == 7) puts( 1 1 1 0 1 1 1 ); if (k == 8) puts( 1 0 0 ...

#include <bits/stdc++.h> using namespace std; template <typename T> void chmin(T &x, const T &y) { if (x > y) x = y; } template <typename T> void chmax(T &x, const T &y) { if (x < y) x = y; } int read() { char c; while ((c = getchar()) < - ) ; if (c == - ) { int x = (c ...

#include <bits/stdc++.h> using namespace std; const double EPS = 1e-8; const long long SZ = 1010, SSZ = 100010, APB = 26, one = 93, INF = 0x3f3f3f3f3f3f3f3f, mod = 1000000007; long long n, m, bg, fn, cnt; long long to[SSZ], wt[SSZ], head[SZ]; long long nex[SSZ], mk[SSZ]; long long dfn[SZ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); int x; cin >> x; vector<int> first(x); vector<int> second(x); int sum_f = 0; for (int i = 0; i < x; i++) { cin >> first[i]; sum_f += first[i]; } int sum_s = 0; for (int i = 0;...

#include <bits/stdc++.h> using namespace std; int tavan(int a, int n, int mod) { int res = 1; while (n) res *= (n & 1) ? a : 1, res %= mod, n /= 2, a *= a, a %= mod; return res; } const int MOD = ((int)81671); const int N = ((int)40); const int M = ((int)12); const int X = ((int)2e6); int n,...

#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; int main() { int T, t1 = 0, t2, maxn = 0, flag = 1, sum = 0, sum1 = 0; scanf( %d , &T); while (T--) { scanf( %d , &t2); if (flag && t2 == 0) { maxn = max(maxn, sum); sum1 = sum; sum = 0; ...

#include <bits/stdc++.h> using namespace std; int n, k, a[(int)2e5]; long long sum; double d, res; int main() { cin >> n >> k; for (int i = 0; i < n; ++i) { cin >> a[i]; if (i < k) sum += a[i]; } d = n - k + 1; res += sum / d; for (int i = k; i < n; ++i) { sum -= a[i ...

#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int a = 0; for (int i = 0; i < s.size(); i++) { if (s[i] == a ) a++; } for (int i = s.size(); i >= a; i--) { if (a > (i / 2)) { cout << i << endl; exit(0); } } }

#include <bits/stdc++.h> using namespace std; int ABS(int a) { if (a < 0) return (-a); return a; } vector<int> v[50005]; int main() { int n, r1, r2, i; scanf( %d , &n); scanf( %d , &r1); scanf( %d , &r2); for (i = (1); i < (n + 1); ++i) { if (r1 == i) continue; int x; ...

#include <bits/stdc++.h> using namespace std; function<void(void)> ____ = []() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); }; const int MAXN = 555; int n, m, match[MAXN]; bool mp[MAXN][MAXN], vis[MAXN]; vector<int> G[MAXN]; bool dfs(int u, int c) { vis[u] = true; for...

#include <bits/stdc++.h> using namespace std; const int MaxN = 110; const double EPS = 1E-10; struct TTriangle { double x[3], y[3]; } a[MaxN]; struct TSeg { double x[2], y[2]; } Seg[MaxN * 3]; int n, Total; double Ans; pair<double, int> s[MaxN * 3 * 2]; inline double Cross(const double x1,...

#include <bits/stdc++.h> const int maxn = 1e6 + 10; using namespace std; int pre[maxn]; int main() { string a, b; cin >> a; cin >> b; int LA = a.size(); int LB = b.size(); int flag = 0, ans = 0; for (int i = 0; i < LB; i++) { if (b[i] == 1 ) flag++; } flag %= 2; if...

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

#include <bits/stdc++.h> using namespace std; const int N = 5e5 + 5; unordered_map<long long, long long> m1, mp; long long m, k, n, s; bool check() { for (auto it : mp) { if (it.second > m1[it.first]) return false; } return true; } int main() { ios::sync_with_stdio(0); cin.tie(0)...

#include <bits/stdc++.h> using namespace std; long long n, s, a[100005], p, w[100005], ans; multiset<long long> st; int main() { cin >> n >> s; for (int k = 1; k <= n; k++) cin >> a[k]; cin >> p; for (int k = 1; k <= n; k++) cin >> w[k]; for (int k = 1; k <= n; k++) { st.insert(w[k]); ...

#include <bits/stdc++.h> using namespace std; const int limite = 1000000; int n; long long int a[limite]; long long int suma[limite]; map<long long int, int> cuantos; int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; a[i + n] = a[i]; } for (int i = 1; i <= 2 * ...

#include <bits/stdc++.h> using namespace std; int main(int argc, char* argv[]) { int n, m, k; vector<double> r1, p1, p2; cin >> n; while (n--) { int hlp; cin >> hlp; r1.push_back(hlp); } cin >> m; while (m--) { int hlp; cin >> hlp; p1.push_back(hlp); ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 1000000; const int INF = 1000000001; vector<int> G[MAXN + 1]; bool vis[MAXN + 1]; vector<int> CC; int n, m, k; int dfs(int v) { vis[v] = true; int ret = 1; for (__typeof((G[v]).begin()) u = (G[v]).begin(); u != (G[v]).end(); ++u)...

#include <bits/stdc++.h> using namespace std; int main() { long long int a, b, x, y, n, ans, t; cin >> t; while (t--) { ans = LLONG_MAX; cin >> a >> b >> x >> y >> n; if (n >= (a - x + b - y)) cout << x * y << n ; else { if ((a - n) >= x) ans = (a - n)...

#include <bits/stdc++.h> using namespace std; int n, m, l[2001], s[2001], c[4001]; int f[4001][2001]; int main() { scanf( %d%d , &n, &m); m += n; for (int i = n; i >= 1; i -= 1) scanf( %d , &l[i]); for (int i = n; i >= 1; i -= 1) scanf( %d , &s[i]); for (int i = 1; i <= m; i += 1) scanf( %d ...

#include <bits/stdc++.h> int main() { long long int a, b = 1, i; scanf( %I64d , &a); for (i = 1; i <= a; i++) { b += 12 * (1 + i - 2); } if (a == 1) printf( 1 ); else printf( %I64d , b); return 0; }

#include <bits/stdc++.h> using namespace std; pair<long long int, long long int> rec(long long int n) { long long int mini = 1e18, maxi = -1; while (n) { mini = min(mini, n % 10); maxi = max(maxi, n % 10); n /= 10; } return {mini, maxi}; } int main() { long long int t; ...

#include <bits/stdc++.h> using namespace std; int const maxn = 1e6 + 5; int a[maxn], b[maxn]; pair<int, int> c[maxn]; int all_elem[2 * maxn]; int cur, inf = 1e9 + 7; int f[2 * maxn]; int psh[8 * maxn]; pair<int, int> imin[4 * maxn]; inline pair<int, int> unions(pair<int, int> c, pair<int, int> d) { ...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; int n, m, same; string s; int main() { cin >> n >> m >> s; long long ans = 1LL * n * (m - 1); for (int i = 1; i < n; i++) { if (s[i] == s[i - 2]) { same++; } else { same = 0; } if (s[i] != ...

#include <bits/stdc++.h> int main() { int i, m, j; char a[1000], b[1000]; scanf( %s %s , &a, &b); if (strlen(a) != strlen(b)) { printf( NO ); return 0; } j = strlen(b) - 1; for (i = 0; i < strlen(a); i++) { if (a[i] != b[j]) { printf( NO ); return 0; ...

#include <bits/stdc++.h> using namespace std; const long long MAX = 105; const long long MAXV = 2e5 + 1; const long long INF = 1e9; bool prime[MAXV]; void sieve() { memset(prime, true, sizeof(prime)); prime[0] = prime[1] = false; for (long long i = 2; i * i < MAXV; i++) { if (prime[i]) { ...

#include <bits/stdc++.h> using namespace std; template <typename T> inline T fetch() { T ret; cin >> ret; return ret; } template <typename T> inline vector<T> fetch_vec(long long sz) { vector<T> ret(sz); for (auto& it : ret) cin >> it; return ret; } template <typename T> inline...

#include <bits/stdc++.h> using namespace std; int n, cnt, x, y, mx, tot; int head[200005], bin[200005], V[200005 * 5], T[200005 * 5]; struct pl { int v, nex; } e[2 * 200005]; void add(int a, int b) { cnt++; e[cnt].v = b; e[cnt].nex = head[a]; head[a] = cnt; bin[a]++; } void dfs(i...

#include <bits/stdc++.h> using namespace std; int n, k, t; char a[3][200]; bool vis[3][200]; bool check(int x, int y) { return (x >= 0 && y >= 0 && x < 3 && y < 200); } void solve(int cx, int cy) { if (vis[cx][cy]) { return; } vis[cx][cy] = true; if (check(cx, cy + 3) && a[cx][cy + 1] ...

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

#include <bits/stdc++.h> using namespace std; const int N = 3 + 2e5; int root[N], ls[N << 5], rs[N << 5], id; int sum[N << 5]; int n, q, p[N]; void update(int &u, int v, int l, int r, int p) { sum[u = ++id] = sum[v] + 1; if (l == r) return; int mid = l + r >> 1; if (p <= mid) rs[u] = r...

#include <bits/stdc++.h> using namespace std; int main() { long long int n, k, p; cin >> n >> k; int l = log2(n) + 1; for (long int i = 1; i <= 30; i++) { if (n - i * k > 0) { p = n - i * k; bitset<30> b(p); if (i > b.count() && p != 1 && p >= i) { cout << i; ...

#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > sol[1 << 9]; vector<pair<int, int> > gs(int t, int x) { static int fm[1 << 19]; static pair<int, int> fs[1 << 19]; queue<int> q; vector<pair<pair<int, int>, int> > sb; for (int i = 0; i < (1 << t); ++i) fm[i] = -1; for (...

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

#include <bits/stdc++.h> using namespace std; int main() { long long i, j, m, n, k, x, y, sum = 0; cin >> n >> k; vector<long long> sura; vector<pair<long long, long long> > dada; vector<pair<long long, long long> > dada2; vector<long long> su; long long arr[n]; priority_queue<long l...

#include <bits/stdc++.h> using namespace std; template <typename T1, typename T2> void chkmin(T1 &x, T2 y) { if (x > y) x = y; } template <typename T1, typename T2> void chkmax(T1 &x, T2 y) { if (x < y) x = y; } inline void debug(int x) { fprintf(stderr, ycx has aked ioi %d times n , x); } na...

#include <bits/stdc++.h> using namespace std; int main() { string s; bool neg = false; cin >> s; int n = s.length(); if (s[0] == - ) { neg = true; n--; } int cur = 0; if (n < 3) cur = 1; else if (n == 3) if ((!neg && s <= 127 ) || (neg && s <= -128 )) ...

#include <bits/stdc++.h> using namespace std; long long mp[2005]; int main() { memset(mp, 0, sizeof mp); long long key[2001], a[2001], n, k, p, i, j; cin >> n >> k >> p; for (i = 0; i < n; i++) { scanf( %lld , a + i); } for (i = 0; i < k; i++) { scanf( %lld , key + i); } ...

#include <bits/stdc++.h> using namespace std; long long n, N, m, op, w, ax, ay, bx, by, cx, cy, ix, iy, bit[4][505][505]; long long v(long long x) { if (x & 1) return (x >> 1) + 1; else return x >> 1; } long long P(long long x, long long y) { if ((x & 1) && (y & 1)) return 0; if ((...

#include <bits/stdc++.h> using namespace std; long long poww(long long a, long long b, long long md) { return (!b ? 1 : (b & 1 ? a * poww(a * a % md, b / 2, md) % md : poww(a * a % md, b / 2, md) % md)); } const long long MAXN = 1e5 + 10; const long long INF = 8e18; ...

#include <bits/stdc++.h> using namespace std; int main() { long long i, a[3333]; int t, n; cin >> t; while (t--) { cin >> n; for (i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); long long x; x = a[0] * a[n - 1]; int flag = 1, ans = 0; for (i = 0; i < n; i++)...

#include <bits/stdc++.h> using namespace std; pair<int, int> cost[111111]; bool okay[111111]; int main(void) { int n = 0; int k = 0; scanf( %d %d , &n, &k); long long b = 0; scanf( %I64d , &b); for (int i = 0; i < n; i++) { scanf( %d , &cost[i].first); cost[i].second = i; ...

#include <bits/stdc++.h> using namespace std; const int MAXSZ = 100000; int req[MAXSZ]; int prob[MAXSZ]; int main(int argc, const char* argv[]) { int n, m, k; scanf( %d%d , &n, &m); int count = 1; for (int i = 0; i < m; i++) { scanf( %d , &k); prob[k]++; req[prob[k]]++; ...

#include <bits/stdc++.h> using namespace std; map<long long int, long long int> m; int main() { long long int t; cin >> t; while (t--) { long long int n; cin >> n; long long int a[n]; for (long long int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); long long int x...

#include<iostream> #include<bits/stdc++.h> using namespace std; typedef long long int ll; ll max(ll a,ll b){ if(a>b)return a; return b; } int main(){ int T; cin>>T; while(T--){ int n,k; cin>>n>>k; string s1,s2; cin>>s1; cin>>s2;...

#include <bits/stdc++.h> using namespace std; int read() { char c = getchar(); int d = 0, f = 1; for (; c < 0 || c > 9 ; c = getchar()) if (c == - ) f = -1; for (; c >= 0 && c <= 9 ; d = d * 10 + c - 48, c = getchar()) ; return d * f; } const int mod = 1e9 + 7; const int...

#include <bits/stdc++.h> using namespace std; inline int mini(int a, int b) { return a < b ? a : b; } inline int maxi(int a, int b) { return a > b ? a : b; } int main() { int n; scanf( %d , &n); int *a = new int[n]; int najm = 1000000010; for (int i = 0; i < n; i++) { scanf( %d , &a[i]...

#include <bits/stdc++.h> using namespace std; mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); void setIO(string name) { ios_base::sync_with_stdio(false); cin.tie(nullptr); cin.exceptions(istream::failbit); } const int inf = 0x3f3f3f3f, mod = 1e9 + 7; int main() { ...

#include <bits/stdc++.h> int main() { int i, j, l = 0, a, A[6], n[6], m = 0; for (i = 0; i < 6; i++) { scanf( %d , &a); for (j = 0; j < l; j++) { if (A[j] == a) break; } if (j == l) { n[l] = 1; A[l++] = a; } else n[j]++; } for (i = 0; i < l...

#include <bits/stdc++.h> using namespace std; int main() { int n, i; cin >> n; long a[n + 1], b[n + 1]; for (i = 0; i < n; i++) cin >> a[i]; a[n] = 1; b[0] = 1; for (i = 1; i <= n; i++) { b[i] = (2 * b[i - 1] - b[a[i - 1] - 1] + 2) % 1000000007; if (b[i] < 0) b[i] += 10000000...

#include <bits/stdc++.h> using namespace std; const int inf = 80009; unsigned long long n; vector<int> adj[inf]; unsigned long long low[inf]; unsigned long long sl[inf]; unsigned long long sz[inf]; unsigned long long als; unsigned long long ans = 0; void dfs(int x, int p) { unsigned long long s ...

#include <bits/stdc++.h> using namespace std; vector<int> graph[200000]; int color[200000], black, white, maxDist, farNode; void solve(int node, int par, int dis) { if (dis > maxDist) farNode = node, maxDist = dis; for (auto &v : graph[node]) { if (v == par) continue; solve(v, node, dis + (c...

#include <bits/stdc++.h> const int INF = 0x3f3f3f3f; const int maxn = 3e3 + 50; const int Mod = 1000000007; const double PI = acos(-1); using namespace std; struct Ans { int id, x; string ret; }; Ans ans[maxn]; string v[maxn]; int cnt; bool full; int n; inline bool cmpById(const Ans &a...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[100010]; for (int i = 0; i < n; i++) { cin >> a[i]; } sort(a, a + n); int ans = 0; int re = 0; for (int i = 0; i < n; i++) { int t = 1; while (a[i + 1] == a[i] && (i < n - 1)) { ...

#include <bits/stdc++.h> int main() { int n, m, z; std::cin >> n >> m >> z; int counter = 0; for (int i = 1; i * n <= z; i++) { if ((i * n) % m == 0) counter++; } std::cout << counter; return 0; }

#include <bits/stdc++.h> using namespace std; const int N = 105; const double eps = 1e-6; int n, k, q, m; int a[N], b[N], used[N]; double MinAns = 100.0, MaxAns = 0.0; double max(double x, double y) { return x - eps >= y ? x : y; } double min(double x, double y) { return x + eps <= y ? x : y; } void i...

#include <bits/stdc++.h> int i, n, k, a, s, j; int main() { for (std::cin >> n >> k; i < k; i++) std::cin >> a, a % 2 ? a++, j++ : 0, s += a; std::cout << (s > 8 * n || s == 8 * n && k == 4 * n && j < n ? NO : YES ); }

#include <bits/stdc++.h> using namespace std; int main() { int n, sum = 0, i; cin >> n; string s; cin >> s; int k = 1; for (i = 0; i < n; i++) { if (s[i] == 1 && k == 1) { sum++; } else if (s[i] == 0 && k == 1) { sum++; k = 0; } } cout <<...

#include <bits/stdc++.h> using namespace std; inline void read(int &x) { short negative = 1; x = 0; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) negative = -1; c = getchar(); } while (c >= 0 && c <= 9 ) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();...

#include <bits/stdc++.h> using namespace std; long long int n, a, b, signo, dist, centro; vector<pair<long long int, long long int> > distancias; vector<long long int> izq, der; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n; a = 1; b = 2; for (int i = (3); i <=...

#include <bits/stdc++.h> using namespace std; inline int read() { char x = 0 ; int fh = 1, sum = 0; for (x = getchar(); x < 0 || x > 9 ; x = getchar()) if (x == - ) fh = -1; for (; x >= 0 && x <= 9 ; x = getchar()) sum = sum * 10 + x - 0 ; return fh * sum; } const int N = 1e5...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, k, a; scanf( %d , &n); vector<int> nums; unordered_map<int, int> hashmap, sizes, parent, inp; for (int i = 0; i < n; i++) { scanf( %d , &a); ...

#include <bits/stdc++.h> int main() { char str[100][100] = { January , February , March , April , May , June , July , August , September , October , November , December }; char month[100]; scanf( %[^ n] , month); int n...

#include <bits/stdc++.h> inline int read() { char c = getchar(); while (c != - && (c < 0 || c > 9 )) c = getchar(); int k = 0, kk = 1; if (c == - ) c = getchar(), kk = -1; while (c >= 0 && c <= 9 ) k = k * 10 + c - 0 , c = getchar(); return kk * k; } using namespace std; void w...

#include <bits/stdc++.h> using namespace std; priority_queue<int> Q[200]; int main() { int n, k; cin >> n >> k; unsigned long long pr[200000]; for (int i = 0; i < n; i++) { cin >> pr[i]; } string str; vector<unsigned long> vec[200]; unsigned long long sum = 0; cin >> str;...

#include <bits/stdc++.h> using namespace std; int a[10][10], b[10][10]; struct per { int x, y; }; int k; queue<per> q, q2; void bf2() { while (!q2.empty()) { per aux; aux = q2.front(); q2.pop(); int xx = aux.x - 1, yy = aux.y - 1; if (b[xx][yy] == 0) { b[xx][y...

#include <bits/stdc++.h> using namespace std; const int MAX = 1005; int N, K, D[MAX], S[MAX]; int main() { scanf( %d%d , &N, &K); for (int i = 0; i < (int)N; i++) scanf( %d , &D[i]); for (int i = 0; i < (int)N; i++) scanf( %d , &S[i]); int res = 0; int lho = S[0]; int pos = 0; int fu...

#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3fLL; const int MAX = 5e3 + 10; const int MOD = 998244353; long long fat[MAX], ifat[MAX]; long long choose(int a, int b) { if (a < b) return 0; return fat[a] * ifat[b] % MOD * ifat[a - ...

#include <bits/stdc++.h> using namespace std; int get() { int f = 0, v = 0; char ch; while (!isdigit(ch = getchar())) if (ch == - ) break; if (ch == - ) f = 1; else v = ch - 0 ; while (isdigit(ch = getchar())) v = v * 10 + ch - 0 ; if (f) return -v; else ...

#include <bits/stdc++.h> using namespace std; int a[1153][1153]; int n, m; unsigned long long int b[1153][1153]; bool pos(int minval) { memset(b, 0, sizeof(b)); int i, j, k; for (i = 0; i < n; i++) { int ccnt = 0; for (j = 0; j < 1024; j += 63) { unsigned long long int blk = 0;...

#include <bits/stdc++.h> using namespace std; const int N = 100500; int n, q; int len[N]; vector<pair<int, int>> g[N]; double prob[N]; double sum; int dfs(int v, int p) { int size = 1; for (auto e : g[v]) { int to = e.first; int ind = e.second; int w = len[ind]; if (to ==...

#include <bits/stdc++.h> using namespace std; int main() { int ts; cin >> ts; while (ts--) { int n; cin >> n; vector<int> v(n); vector<int> pos[2]; for (int i = 0; i < n; i++) { cin >> v[i]; pos[v[i]].push_back(i); } int x = 0; if (pos[0].s...

#include <bits/stdc++.h> using namespace std; int a[200007], b[200007]; bool check[200007]; int main() { string s; getline(cin, s); int res = 0; for (auto i = (0); i <= ((int)s.size() - 1); ++i) { int tmp = s[i]; int ans = 0; for (auto i = (1); i <= (8); ++i) { ans = 2 ...

#include <bits/stdc++.h> using namespace std; const int maxn = 1 << 20; int pos[maxn]; int n, m; long long k, ans[maxn]; int val[maxn]; struct query { int l, r, id; } Q[maxn]; long long now = 0; long long M[maxn]; bool cmp(query a, query b) { if (pos[a.l] == pos[b.l]) return a.r < b.r; ...

#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10; const int mod = 998244353; int n; long long a[N]; long long p[N]; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %lld , &a[i]); long long m = 1; p[0] = 1; p[1] = 3; for (int i = 2; i < n; i++) {...

#include <bits/stdc++.h> using namespace std; const int N = 400010; const int P = 1000000007; int m, n, mi[N], l[N], r[N]; char a[N], ans[N]; bool Check(int t, int x) { if (++t < x) return 0; return ((r[t] - r[t - x] * mi[x]) * mi[t - x] == l[t] - l[t - x]); } bool Dfs(int k, bool has) { if ...

#include <bits/stdc++.h> using namespace std; const int S = (int)1e6; int dp[S]; string txt, pat; vector<int> ans; void kmp() { int i = 0, j = -1, n = ((int)(txt.size())), m = ((int)(pat.size())); dp[0] = -1; while (i < m) { while (j >= 0 and pat[i] != pat[j]) j = dp[j]; i++, j++; ...

#include <bits/stdc++.h> using namespace std; const int MAX = 1100100; long long N, l, r; long long L[MAX], R[MAX], d, sol; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> N; for (int I = 0; I < N; I++) { cin >> L[I] >> R[I]; l += L[I]; r += R[I]; } d = ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); long long p = 1234567, q = 123456, r = 1234, n; cin >> n; long long x = n; for (int a = 0; a <= n; a += 1234567) for (int b = 0; b <= n - a; b += 123456) { if ((n - a - b) % 123...

#include <bits/stdc++.h> using namespace std; int main() { long long n, m; cin >> n >> m; if (n > m) swap(n, m); if (n == 2) { if (m % 4 == 0) cout << m; else if (m % 4 == 1) cout << m + 1; else cout << (m / 4) * 4 + 4; } else if ((m < 2) || (n < 2) || (...

#include <bits/stdc++.h> using namespace std; int main() { int size; cin >> size; while (size--) { int nums; cin >> nums; while (nums--) cout << 1 << ; cout << n ; } return 0; }