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 = 4e5 + 5; const int MAXM = 2e5 + 5; const int MOD = 998244353; const int INF = 0x3f3f3f3f; int a[MAXN], sum[MAXN]; vector<int> v; map<int, int> mp; int main() { int n, I; scanf( %d%d , &n, &I); mp.clear(); memset(sum, 0, siz...
#include <bits/stdc++.h> using namespace std; long long a, i, high, low, mid, nstr, ninte; int main() { scanf( %lld , &a); long long ans[a], str[a], inte[a], exp[a]; for (i = 0; i < a; i++) { scanf( %lld %lld %lld , &str[i], &inte[i], &exp[i]); } for (i = 0; i < a; i++) { high = ex...
#include <bits/stdc++.h> using namespace std; int main() { int n, a1, a2, b1, b2, k = 1, f = 0, ans = 0; scanf( %d , &n); while (k <= 4) { scanf( %d%d%d%d , &a1, &a2, &b1, &b2); if (n >= a1 + b1 \|\| n >= a1 + b2) ans = a1; else if (n >= a2 + b1 \|\| n >= a2 + b2) ans = a2;...
#include <bits/stdc++.h> using namespace std; set<int> s; vector<vector<int> > v; bool ch[100005]; void go(int i) { ch[i] = true; int z = 0; for (auto it : v[i]) { if (ch[it] == false) { z++; go(it); } } if (z == 0) { s.insert(i); } } void dynamic(...
#include <bits/stdc++.h> using namespace std; bool sortbysec(const pair<int, int> &a, const pair<int, int> &b); long long int gcd(long long int a, long long int b); int prime(int n); int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int t = 1; while (t...
#include <bits/stdc++.h> using namespace std; const int D[8][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}, {1, -1}, {-1, 1}, {-1, -1}, {1, 1}}; int N, M, K, f[600005], F[3005][6005], b[600005], tot; int find(int x) { return x == f[x] ? x : f[x] = find(f[x]); } bool can(int& x, int& y) { ...
#include <bits/stdc++.h> using namespace std; int a[3] = {0, 0, 0}, s; int main() { string n; getline(cin, n); string x; getline(cin, x); s = x.size(); s = (s + 1) / 2; for (int i = 0; i < 2 * s - 1; i += 2) { if (x[i] == 1 ) a[0]++; if (x[i] == 2 ) a[1]++; if (x[i]...
#include <bits/stdc++.h> using namespace std; int main() { long long int a, b, d, p, q, s, t, r; cin >> a >> b >> d; p = a + a + b + b; q = a + d + b; s = a + d + d + a; t = b + d + d + b; r = min(p, min(q, min(s, t))); cout << r << endl; return 0; }
#include <bits/stdc++.h> using namespace std; void Print() { cout << endl; } template <typename T1, typename... T> void Print(const T1 &t1, const T &...t) { cout << t1 << ; Print(t...); } template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { os << ( ...
#include <bits/stdc++.h> using namespace std; const double eps = 1e-10; const int inf = 1000000009; int i, j, k, m, n, l; int ans; int f(int n, int m) { return n < m ? (n + (n % 2) * (m - 1)) / 2 : f(n - m, 2 * m); } int main() { cin >> n; cout << (n < 2 ? 0 : f(n - 2, 2)) << endl; retur...
#include <bits/stdc++.h> using namespace std; const long long MAX = 100005; const long long mod = 1000000007; const double PI = 2 * acos(0.0); const double EPS = 0.00000000001; int main() { long long n; cin >> n; string a, b; cin >> a >> b; long long OO = 0, II = 0, IO = 0, OI = 0; f...
#include <bits/stdc++.h> using namespace std; const long long N = 2e5 + 5; long long a[N]; long long p[N]; long long size[N]; long long n; long long root(long long v) { if (v != p[v]) { return p[v] = root(p[v]); } return v; } void fix(long long v, long long x) { if (v == n + 1) r...
#include <bits/stdc++.h> using namespace std; inline int read() { int v = 0, f = 1; char c = getchar(); while (c < 0 \|\| c > 9 ) { if (c == - ) f = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { v = v * 10 + c - 0 ; c = getchar(); } return v * f; } co...
#include <bits/stdc++.h> using namespace std; inline int read() { int s = 0; char ch = getchar(); while (!isdigit(ch)) ch = getchar(); while (isdigit(ch)) s = s * 10 + ch - 0 , ch = getchar(); return s; } inline char getch() { char ch = getchar(); while (!islower(ch)) ch = getchar()...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 10; int a[maxn], cnt[maxn], tmp[maxn]; int main(void) { int n, m; scanf( %d %d , &n, &m); for (int i = 1; i <= n; i++) { scanf( %d , a + i); if (a[i] <= m) cnt[a[i]]++; } for (int i = 1; i <= m; i++) for (...
#include <bits/stdc++.h> long long int const MOD = 1000000007; long long int const N = 1000005; long long int const LN = 20; long long int const inf = 8e18; using namespace std; long long int n, m, a[N]; vector<pair<long long int, long long int> > v[N]; struct data { long long int d, second, prev, i...
#include <bits/stdc++.h> using namespace std; int main() { int n; long long s = 0; cin >> n; for (int i = 2; i <= n / 2; i++) { for (int j = 2; j * i <= n; j++) s += 4 * j; } cout << s << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int x; cin >> x; int divisor = 1; int digits; int ans = 0; for (; divisor <= 9; divisor++) { if (x / divisor == 1 && x % divisor == 0) { digits = 1; b...
#include <bits/stdc++.h> using namespace std; set<long long> tp; long long tmp[100002], x, y, z, t; char ch; int main() { int n, k; scanf( %d %d , &n, &k); for (int i = 1; i <= n; i++) { scanf( %lld%c%lld%c%lld%c%lld , &x, &ch, &y, &ch, &z, &ch, &t); tmp[i] = t + (1 << 8) * z + (1 << 1...
#include <bits/stdc++.h> using namespace std; int main() { vector<int> child; int n, k; scanf( %d %d , &n, &k); int *A = new int[k]; for (int i = 0; i < k; ++i) { scanf( %d , &A[i]); } for (int i = 0; i < n; ++i) { child.push_back(i + 1); } int count = 0; for (int...
#include <bits/stdc++.h> char g[64][64]; int h[64][64]; void conv(long long x, long long y, long long a, long long b, long long dx, long long dy) { long long k, l; k = x - y + b * 2000000000LL; l = x + y + a * 2000000000LL; dx = k / (2 b) - 1000000000LL; dy = l / (2 a) - 10...
#include <bits/stdc++.h> long long k, m = 9, l, c, lc, n, md, tr = 1, fl, res; int main() { scanf( %lld , &k); while (1) { l++; lc += m * l; if (k - lc <= 0) { c = k - (lc - m * l); break; } m = 10; tr = 10; } n = (c + l - 1) / l; tr = tr + n...
#include <bits/stdc++.h> using namespace std; int n; inline int read() { int x = 0, f = 1; char ch = getchar(); while (ch < 0 \|\| ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar(); retu...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 100; const int inf = 0x7ffffff; int a[maxn]; long long dp[maxn]; int main(void) { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); dp[0] = 0; for (int i = 1; i <= n; i++) { dp[i] = dp[i - 1...
#include <bits/stdc++.h> using namespace std; const int N = 1000005; const int MAXN = 1e5 + 5; const int LG = 22; int dp[51][51][51][51]; int n; int a[55][55]; int get(int tli, int tlj, int rbi, int rbj) { int res = a[rbi][rbj]; if (tli > 0) res = res - a[tli - 1][rbj]; if (tlj > 0) res = re...
#include <bits/stdc++.h> using namespace std; string s; int kappa[100]; void incc(int jj) { if (kappa[jj] > 9) { kappa[jj + 1]++; kappa[jj] %= 10; incc(jj + 1); } } void get_count(int a1, int a2, int a3) { int i, j; if (a2 - a3 == 2) { j = 0; for (i = a2; i >= a...
#include <bits/stdc++.h> using namespace std; int a[1000010], n, mo = 1000000007; long long dp[1000010], ans; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , a + i); a[i]--; } dp[1] = min(a[1], a[2]); for (int i = 2; i <= n; i++) { dp[i] = ...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( avx,avx2,fma ) using namespace std; using bigint = long long int; using vi = vector<int>; using vll = vector<long long int>; int spf[2005]; void smallestFactor() { for (int i = 1; i <= 2000; i++) spf[i] = i; for (int i = ...
#include <bits/stdc++.h> using namespace std; long long int arr[123456]; map<long long int, bool> mp; int main() { int a = 0, b = 0, n, k, l, r, all, kall; cin >> n >> k >> l >> r >> all >> kall; int rest = all - kall; for (int i = 0; i < k; i++) { arr[i] = kall / k; if (kall % k != ...
#include <bits/stdc++.h> int main() { int j, n, t, i; int a[100]; scanf( %d , &t); for (i = 1; i <= t; i++) { int d = 0, b = 0; scanf( %d , &n); for (j = 1; j <= n; j++) { scanf( %d , &a[j]); if (d == 0 && a[j] == 1) d = 1; if (d == 1 && a[j] == 0) b++; ...
#include <bits/stdc++.h> using namespace std; void min_self(int& a, int b) { a = min(a, b); } void max_self(int& a, int b) { a = max(a, b); } const int NAX = (int)(2e5 + 5); int v[NAX], visited[NAX]; int component_size; void visit(int i) { if (!visited[i]) { ++component_size; visited[i] = ...
#include <bits/stdc++.h> using namespace std; int a[100]; int main() { long long n, m; cin >> n >> m; int L = 0, R = n - 1; --m; long long sum = 0; for (int i = 1; i < n; ++i) { sum <<= 1; if (m & 1) sum += 1; m >>= 1; } m = sum; for (int i = 1; i <= n; m >>= ...
#include <bits/stdc++.h> using namespace std; int n, a, b, s = 1, d = 2, q[105][105]; int main() { ios_base::sync_with_stdio(false); cin >> n >> a >> b; for (int i = 1; i <= a; ++i) { for (int j = 1; j <= b; ++j) { q[i][j] = 0; if ((i + j) % 2 == 0) { if (s <= n) { ...
#pragma GCC optimize( Ofast ) #include <iostream> #include <fstream> #include <algorithm> #include <functional> #include <array> #include <chrono> #include <random> #include <vector> #include <string> #include <sstream> #include <cmath> #include <cstring> #include <bitset> #include <list>...
#include <bits/stdc++.h> using namespace std; int a[120]; int n, m; int main() { cin >> n >> m; for (int i = 1; i <= n; i++) cin >> a[i]; sort(a + 1, a + n + 1); int s = 0; int j; for (j = 1; j < n; j++) { s += a[j]; if (s > m) break; } if (j < n) cout << NO ; ...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; vector<long long int> a(n), b(n); map<long long int, bool> mp; bool ok = false; for (int i = 0; i < n; i++) { cin >> a[i]; b[i] = a[i]; i...
#include <bits/stdc++.h> using namespace std; long long kek[102][102]; long long dp[15][102][102], a[100000], b[100000], c[100000], a1, b1, c1, n, m, x, i, j, sc, k; string s; int main() { long long i1, j1; ios_base ::sync_with_stdio(0); cin.tie(0); cin >> n >> k >> c1; c1++; for...
#include <bits/stdc++.h> using namespace std; uint64_t log4(uint64_t n) { return log2(n) / 2; } uint64_t getA(uint64_t triple) { if (triple == 0) { return 1; } uint64_t doubleBits; if (triple == 1) { doubleBits = 1; } else { doubleBits = log4(triple * 3 + 1); } uint64...
#include <bits/stdc++.h> using namespace std; const long long MOD = 1000000007; const int N = 1000010; template <class T> class BIT { T bit[N + 1]; int n; public: BIT() { n = N; memset(bit, 0, sizeof(bit)); } T sum(int i) { T s = 0; ++i; while (i > 0) { ...
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const double PI = acos(-1.0); const double E = exp(1); const int N = 1e5 + 5; int n; map<long long, long long> m; int main(void) { ios_base::sync_with_stdio(false); cin >> n; for (int i = 0; i < n; i++) { long lo...
#include <bits/stdc++.h> using namespace std; template <class T> inline void chkmax(T &a, T b) { if (a < b) a = b; } template <class T> inline void chkmin(T &a, T b) { if (a > b) a = b; } inline int read() { int sum = 0, p = 1; char ch = getchar(); while (!(( 0 <= ch && ch <= 9 ) \|...
#include <bits/stdc++.h> using namespace std; struct edge { int to, cap, cost, rev, id; }; int dist[5005], h[5005], prevv[5005], preve[5005]; int V, n, m; vector<edge> G[5005]; void add_edge(int from, int to, int cap, int cost) { G[from].push_back((edge){to, cap, cost, (int)G[to].size()}); G[t...
#include <bits/stdc++.h> using namespace std; int num[100010]; int main() { int n; cin >> n; int k = ceil(sqrt(n)); int m = ceil((double)n / (double)k); int y = m; int flag = 0, cnt = 0; for (int i = 1; i <= k; i++) { int p = 0; int j = m; while (j--) { while ...
#include <bits/stdc++.h> using namespace std; const int maxn = 1007; const int inf = INT_MAX; const long long inff = 1e18; const long long mod = 1e9 + 7; int n; int a[maxn], b[maxn]; vector<pair<pair<int, int>, pair<int, int> > > v; int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cou...
#include <bits/stdc++.h> using namespace std; struct node { long long l, r; long long mx = -1e18; long long ch = 0; }; vector<node> tree; void push(long long v) { if (tree[v].l == tree[v].r) { tree[v].ch = 0; } else { tree[v * 2].ch += tree[v].ch; tree[v * 2 + 1].ch += tr...
#include <bits/stdc++.h> using namespace std; int main() { int n = 0; int x0, y0, x1, y1; cin >> x0 >> y0 >> x1 >> y1; int m; cin >> m; map<pair<int, int>, bool> mass; for (int i = 0; i < m; i++) { int r, a, b; scanf( %d%d%d , &r, &a, &b); for (int j = a; j <= b; j++) {...
#include <bits/stdc++.h> using namespace std; map<int, int> a, b; map<int, int>::iterator it; int n, ans = 1000000, k; int main() { int i, x, y, k; cin >> n; k = n / 2 + n % 2; for (i = 1; i <= n; i++) { cin >> x >> y; a[x]++; b[x]++; if (x != y) b[y]++; } for (...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10; struct E { int to; int next; } ed[maxn * 2]; int head[maxn]; int tot; void J(int a, int b) { ed[++tot].to = b; ed[tot].next = head[a]; head[a] = tot; } int dfn[maxn]; int cnt; int deep[maxn]; int t[maxn]...
#include <bits/stdc++.h> using namespace std; int main() { int q; cin >> q; while (q--) { unsigned long long int a, b, c; cin >> a >> b >> c; unsigned long long int s = a + b + c; cout << s / 2 << endl; } }
#include <bits/stdc++.h> using namespace std; vector<long long> a; long long n; long long pos1; double ct1, ct2 = 0; long long z; long long fun(long long l, long long r, vector<vector<long long> > dpp) { if (dpp[l][r] != -1) return dpp[l][r]; long long i, j, sum = 0; for (i = l; i < r; i++) { ...
#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; long long a = 1; for (int i = 1; i <= (3 * n); i++) { a = 3; a %= 1000000007; } long long b = 1; for (int i = 1; i <= n; i++) { b = 7; b %= 1000000007; } long long ans = ((...
#include <bits/stdc++.h> using namespace std; clock_t __stt; inline void TStart() { __stt = clock(); } inline void TReport() { printf( nTaken Time : %.3lf sec n , (double)(clock() - __stt) / CLOCKS_PER_SEC); } template <typename T> T MIN(T a, T b) { return a < b ? a : b; } template...
#include <bits/stdc++.h> using namespace std; bool is_powertwo(long long n) { long long count = 0; while (n) { if ((n & 1) > 0) count++; n = n >> 1; } if (count == 1) return true; return false; } int main() { long long t; t = 1; while (t--) { long long h1, a1, c...
#include <bits/stdc++.h> using namespace std; char str[5003]; int num[5003][2]; int main() { while (~scanf( %s , str + 1)) { memset(num, 0, sizeof(num)); int len = strlen(str + 1); for (int i = 1; i <= len; i++) { num[i][0] = num[i - 1][0]; num[i][1] = num[i - 1][1]; ...
#include <bits/stdc++.h> using namespace std; template <typename T> ostream& operator<<(ostream& s, vector<T>& v) { s << { ; for (int i = 0; i < int(v.size()); i++) s << (i ? , : ) << v[i]; return s << } ; } template <typename S, typename T> ostream& operator<<(ostream& s, pair<S, T> const...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; void doin() { cin.tie(); cout.tie(); ios::sync_with_stdio(0); } template <typename X, typename Y> istream& operator>>(istream& in, pair<X, Y>& a) { in >> a.first >> a.second; return in; } template <typename T...
#include <bits/stdc++.h> using namespace std; const int N = 2505; using ll = long long; int n, m, kk, a[N][N], sum[N][N], b[2][10]; char ch[N][N]; ll ans = 0; inline int calc(int x1, int x2, int y1, int y2) { return sum[x2][y2] - sum[x1][y2] - sum[x2][y1] + sum[x1][y1]; } void solve(int x1, int x2...
#include <bits/stdc++.h> using namespace std; bool p(long long n) { for (long long i = 2; i <= sqrt(n); i++) { if (n % i == 0) return 0; } return 1; } int main() { long long m, n, i, j, k; cin >> n; if (p(n)) { cout << 1 << endl << n; } else { cout << 3 << endl << 3...
#include <bits/stdc++.h> using namespace std; long long f[55][2][2], K, d; int a[55], n; long long C(int l, int r, int x, int y) { if (l > r) return 1; long long& F = f[l][x][y]; if (~F) return F; F = 0; for (int i = 0; i <= 1; ++i) for (int j = 0; j <= 1; ++j) if (a[l] - !i &&...
#include <bits/stdc++.h> using namespace std; void solve() { long long int a, b, c; cin >> a >> b >> c; long long int x = min(a, min(b, c)); long long int z = max(a, max(b, c)); long long int y = a + b + c - x - z; long long int xi = a == x ? 1 : b == x ? 2 : 3; long long int yi = a == y...
#include <bits/stdc++.h> using namespace std; int main() { int n, m, l, d; cin >> n >> d >> m >> l; long long x = 0; long long L = -m; long long R = -m + l; for (int i = 0; i < n; i++) { L += m; R += m; if (x + d < L) break; long long o = (R - x) / d; x = x + d ...
#include <bits/stdc++.h> using namespace std; vector<int> g; int a[100005], b[100005], c[100005]; int n, k; void solve() { int i, j, m, ans, cnt; c[m = 0] = a[0]; for (i = 1; i < n; i++) if (a[i] != a[i - 1]) c[++m] = a[i]; b[a[0]]--; for (i = 1; i <= m; i++) { b[c[i]]--; ...
#include <bits/stdc++.h> using namespace std; const int N = 60; int n, m; char s[N][N]; bool vis[N][N]; int tmp; int dx[] = {-1, 0, 1, 0}; int dy[] = {0, -1, 0, 1}; inline bool in(int x, int y) { return x >= 0 && x < n && y >= 0 && y < m; } void dfs(int x, int y) { vis[x][y] = 1; tmp++; ...
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long INFF = 0x3f3f3f3f3f3f3f3fll; const long long M = 998244353; const long long maxn = 1e6 + 107; const double pi = acos(-1.0); const double eps = 0.0000000001; long long gcd(long long a, long long b) { return b ? gcd(...
#include <bits/stdc++.h> #pragma GCC optimize(2) #pragma GCC optimize(3) #pragma GCC optimize( Ofast ) #pragma GCC optimize( inline ) #pragma GCC optimize( -fgcse ) #pragma GCC optimize( -fgcse-lm ) #pragma GCC optimize( -fipa-sra ) #pragma GCC optimize( -ftree-pre ) #pragma GCC optimize( -ftree-vrp )...
#include <bits/stdc++.h> using namespace std; int main() { int x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2; int ans; int a = abs(x1 - x2); int b = abs(y1 - y2); ans = max(a, b); cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int NMAX = 335; vector<vector<int> > B(NMAX); int lastans, cnt[NMAX][100001]; int main() { int N; cin >> N; int len = (int)ceil(sqrt(N + .0)); int num = 0, up = len; for (int i = 0; i < N; i++) { int a; cin >> a; if (i =...
#include <bits/stdc++.h> using namespace std; const int MAX = 100000; vector<int> g[MAX]; int k; int main() { ios::sync_with_stdio(0); cin.tie(0); ios::sync_with_stdio(0); cin.tie(0); cin >> k; if (k % 2 == 0) cout << NO n ; else { if (k == 1) { cout << YES n ...
#include <bits/stdc++.h> using namespace std; const int INF = 1000000000; struct Point { int x, y; Point(int x_ = 0, int y_ = 0) : x(x_), y(y_) {} Point(std::istream &in) { in >> x >> y; x = 2; y = 2; } }; bool operator<(const Point &a, const Point &b) { return (a.x < b...
#include <bits/stdc++.h> using namespace std; long long a[] = { 1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8092, 16184, 32368, 64736, 129472, 258944, 517888, 103...
#include <bits/stdc++.h> using namespace std; char str[50][50]; bool test(int a, int b, int w, int h) { int i, j; for (i = 0; i <= w; i++) { for (j = 0; j <= h; j++) { if (str[i + a][j + b] == 1 ) return 0; } } return 1; } int main() { int n, m, i, j, k, r; scanf( ...
#include <bits/stdc++.h> using namespace std; int main() { int a, b; cin >> a >> b; int d = 0; if (b % a != 0) { cout << -1 ; return 0; } int c = b / a; if (c == 1) { cout << 0 ; return 0; } while (c != 0) { if (c % 2 == 0) { c = c / 2; ...
#include <bits/stdc++.h> using namespace std; int main() { int N, K; cin >> N >> K; int a[N], b[K]; int cnt = 0; for (int i = (0); i < (N); i++) { cin >> a[i]; if (a[i] == 0) cnt++; } if (cnt > K) { cout << No n ; return 0; } for (int i = (0); i < (K); i+...
#include <bits/stdc++.h> using namespace std; const long long int mod = 1e9 + 7; long long int t, n, m, a[1000005] = {0}, d[1000005], b[1000005]; stack<long long int> s; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); long long int i, j, k, x, y; cin >> n >> m; ...
#include <bits/stdc++.h> using namespace std; template <typename T> inline bool chkmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; } template <typename T> inline bool chkmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; } const int oo = 0x3f3f3f3f; const int max0 = 50, maxn = 1000; i...
#include <bits/stdc++.h> using namespace std; vector<vector<int> > g(300005); int a[300005], s1[300005], s2[300005]; int main() { ios_base::sync_with_stdio(0); int n; cin >> n; for (int i(1); i <= n; i++) { cin >> a[i]; } for (int i(0); i < n - 1; i++) { int x, y; cin >...
#include <bits/stdc++.h> using namespace std; int main() { string a, b; int ailgis, bilgis; cin >> a >> b; ailgis = a.length(); bilgis = b.length(); if (a == b) { cout << -1 ; return 0; } if (ailgis > bilgis) cout << ailgis; else cout << bilgis; }
#include <bits/stdc++.h> using namespace std; const double EPS = 1e-10; const double PI = acos(-1.0); double tick() { static clock_t oldtick; clock_t newtick = clock(); double diff = 1.0 * (newtick - oldtick) / CLOCKS_PER_SEC; oldtick = newtick; return diff; } template <typename T> T m...
#include <bits/stdc++.h> using namespace std; const long long mod = 1000000033; const long long p = 10007; string s; int n, k; int A[1000005], pref[1000005]; long long P[1000005], H[1000005]; void go(int ind, int end) { while (end <= n && s[end - ind] == s[end - 1]) end++; pref[ind] = end - ind;...
#include <bits/stdc++.h> using namespace std; int main() { int k; cin >> k; cout << + ; for (int i = 0; i < 24; i++) cout << - ; cout << + n ; int r1 = (k + 1) / 3; bool enough = 0; int passenegrs = 0; for (int i = 0; i < 27; i++) { if (i == 0 \|\| i == 23 \|\| i == 25) ...
#include <bits/stdc++.h> using namespace std; bool cmp(int a, int b) { return a > b; } int main() { long long n, m, i, j, k, t, a, b; cin >> a >> b; m = b - a; if (m == 0) { cout << 1 << endl; } else { if (m > 4) { cout << 0 << endl; } else { n = 1; fo...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; bool con = false; for (int i = 1; i < 32000; i++) { double M = 2 * n - i * (i + 1); double k = (-1.0 + sqrtl(1 + 4 * M)) / 2.0; if (k <= 0) break; if (abs((long long int)k - k) <= 1e-9) { con ...
#include <bits/stdc++.h> using namespace std; long long powmod(long long a, long long b) { long long res = 1; a %= 1000000007; for (; b; b >>= 1) { if (b & 1) res = res * a % 1000000007; a = a * a % 1000000007; } return res; } template <typename T> inline bool chkmin(T &a, cons...
#include <bits/stdc++.h> using namespace std; int main() { int n, x; cin >> n >> x; int sum = 0, y; for (int i = 0; i < n; i++) { cin >> y; sum += y; } if (sum == 0) { cout << 0 n ; return 0; } if (abs(sum) <= x) { cout << 1 n ; return 0; } e...
#include <bits/stdc++.h> using namespace std; int countDigit(long long n) { int count = 0; while (n != 0) { n = n / 10; ++count; } return count; } int main() { long long int t; cin >> t; while (t--) { int k, s; cin >> s; int n = s % 10, ans; k = co...
#include <bits/stdc++.h> using namespace std; int main() { long long i, n, m; while (cin >> n) { m = n; for (i = 1; i < n; i++) { if (m <= i) break; m = m - i; } cout << m << endl; } return 0; }
#include <bits/stdc++.h> int i, n; int main() { for (std::cin >> n; i < n; ++i) std::cout << (i ? i : n) << ; return 0; }
#include <bits/stdc++.h> using namespace std; long long n, m, a[100005]; long long dfn[100005], head[100005], idx, rev[100005], cnt, size[100005], top[100005], dep[100005], fa[100005], son[100005]; long long sum[100005 << 2], tag[100005 << 2]; void push_tag(long long p, long long l, long long r, long lo...
#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007; const long long INF = mod * mod; const long double eps = 1e-8; bitset<7001> memo[100000]; bitset<7001> for_query[7001]; bitset<7001> for_set[7001]; void init() { vector<int> v; for (int i = 2; i <= 90; i++) { v...
#include <bits/stdc++.h> using namespace std; using LL = long long; constexpr int N = 1e5 + 5; string s; int n; int f(int x, int y) { int z = x; int res = 0; for (int i = 0; i < n; i++) { if (s[i] == z) { res++; z = x + y - z; } } if (res & 1) res -= (x != y);...
#include <bits/stdc++.h> #pragma warning(disable : 4996) using namespace std; long long __gcd(long long a, long long b) { while (a != 0) { long long __t = b % a; b = a; a = __t; } return b; } class Graph { public: struct edge; private: unsigned N; vector<long...
#include <bits/stdc++.h> using namespace std; inline int Int() { int x; scanf( %d , &x); return x; } inline long long Long() { long long x; scanf( %lld , &x); return x; } void err(istream_iterator<string> it) { cout << endl; } template <typename T, typename... Args> void err(istr...
#include <bits/stdc++.h> using namespace std; template <typename T> inline bool chkmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; } template <typename T> inline bool chkmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; } const int oo = 0x3f3f3f3f; const int maxn = 200100; int n; i...
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 7; const int inf = 0x3f3f3f3f; const long long INF = 0x3f3f3f3f3f3f3f3f; const int mod = 1e9 + 7; const double eps = 1e-8; const double PI = acos(-1); template <class T, class S> inline void add(T &a, S b) { a += b; if (a >= mod...
#include <bits/stdc++.h> using namespace std; const int MAXN = 5e3 + 3; map<int, int> mapa; vector<int> v; int mw[103030]; int main() { int n, m, a, maxi = 0; scanf( %d %d , &n, &m); for (int i = (int)0; i < (int)n; i++) { scanf( %d , &a); mapa[a] = 1; mw[i] = a; if (maxi...
#include <bits/stdc++.h> using namespace std; const int MAXN = 100010; int n, U, a[MAXN]; double ans = 0; int main() { cin >> n >> U; for (int i = 1; i <= n; i++) cin >> a[i]; int now = 1; for (int i = 1; i <= n; i++) { while (now <= n && a[now] - a[i] <= U) now++; now--; if ...
#include <bits/stdc++.h> using namespace std; typedef struct node_t { string name; int h; } node_t; int n; node_t node[3010]; int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> node[i].name >> node[i].h; } for (int i = 1; i <= n; i++) { for (int j = i + 1; j <= ...
#include <bits/stdc++.h> using namespace std; int d, n, m; int i, j; vector<pair<int, int> > gas; struct cmp { bool operator()(const pair<int, int> &p1, const pair<int, int> &p2) { return p1.second > p2.second; } }; priority_queue<pair<int, int>, vector<pair<int, int> >, cmp> q; int main()...
#include <bits/stdc++.h> using namespace std; inline void read(int &num) { num = 0; char ch; int flag = 1; while ((ch = getchar()) < 0 \|\| ch > 9 ) if (ch == - ) flag = -1; while (ch >= 0 && ch <= 9 ) num = num 10 + ch - 0 , ch = getchar(); num *= flag; } const int MAXN =...
#include <bits/stdc++.h> using namespace std; long long n, a[15]; long long M[5][5]; long long s; long long check() { long long rs[5], cs[5]; memset(rs, 0, sizeof(rs)); memset(cs, 0, sizeof(cs)); long long d1 = 0, d2 = 0; for (long long i = 1; i <= n; i++) { for (long long j = 1; j <...

#include <bits/stdc++.h> using namespace std; const int MAXN = 4e5 + 5; const int MAXM = 2e5 + 5; const int MOD = 998244353; const int INF = 0x3f3f3f3f; int a[MAXN], sum[MAXN]; vector<int> v; map<int, int> mp; int main() { int n, I; scanf( %d%d , &n, &I); mp.clear(); memset(sum, 0, siz...

#include <bits/stdc++.h> using namespace std; long long a, i, high, low, mid, nstr, ninte; int main() { scanf( %lld , &a); long long ans[a], str[a], inte[a], exp[a]; for (i = 0; i < a; i++) { scanf( %lld %lld %lld , &str[i], &inte[i], &exp[i]); } for (i = 0; i < a; i++) { high = ex...

#include <bits/stdc++.h> using namespace std; int main() { int n, a1, a2, b1, b2, k = 1, f = 0, ans = 0; scanf( %d , &n); while (k <= 4) { scanf( %d%d%d%d , &a1, &a2, &b1, &b2); if (n >= a1 + b1 || n >= a1 + b2) ans = a1; else if (n >= a2 + b1 || n >= a2 + b2) ans = a2;...

#include <bits/stdc++.h> using namespace std; set<int> s; vector<vector<int> > v; bool ch[100005]; void go(int i) { ch[i] = true; int z = 0; for (auto it : v[i]) { if (ch[it] == false) { z++; go(it); } } if (z == 0) { s.insert(i); } } void dynamic(...

#include <bits/stdc++.h> using namespace std; bool sortbysec(const pair<int, int> &a, const pair<int, int> &b); long long int gcd(long long int a, long long int b); int prime(int n); int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int t = 1; while (t...

#include <bits/stdc++.h> using namespace std; const int D[8][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}, {1, -1}, {-1, 1}, {-1, -1}, {1, 1}}; int N, M, K, f[600005], F[3005][6005], b[600005], tot; int find(int x) { return x == f[x] ? x : f[x] = find(f[x]); } bool can(int& x, int& y) { ...

#include <bits/stdc++.h> using namespace std; int a[3] = {0, 0, 0}, s; int main() { string n; getline(cin, n); string x; getline(cin, x); s = x.size(); s = (s + 1) / 2; for (int i = 0; i < 2 * s - 1; i += 2) { if (x[i] == 1 ) a[0]++; if (x[i] == 2 ) a[1]++; if (x[i]...

#include <bits/stdc++.h> using namespace std; int main() { long long int a, b, d, p, q, s, t, r; cin >> a >> b >> d; p = a + a + b + b; q = a + d + b; s = a + d + d + a; t = b + d + d + b; r = min(p, min(q, min(s, t))); cout << r << endl; return 0; }

#include <bits/stdc++.h> using namespace std; void Print() { cout << endl; } template <typename T1, typename... T> void Print(const T1 &t1, const T &...t) { cout << t1 << ; Print(t...); } template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { os << ( ...

#include <bits/stdc++.h> using namespace std; const double eps = 1e-10; const int inf = 1000000009; int i, j, k, m, n, l; int ans; int f(int n, int m) { return n < m ? (n + (n % 2) * (m - 1)) / 2 : f(n - m, 2 * m); } int main() { cin >> n; cout << (n < 2 ? 0 : f(n - 2, 2)) << endl; retur...

#include <bits/stdc++.h> using namespace std; const long long MAX = 100005; const long long mod = 1000000007; const double PI = 2 * acos(0.0); const double EPS = 0.00000000001; int main() { long long n; cin >> n; string a, b; cin >> a >> b; long long OO = 0, II = 0, IO = 0, OI = 0; f...

#include <bits/stdc++.h> using namespace std; const long long N = 2e5 + 5; long long a[N]; long long p[N]; long long size[N]; long long n; long long root(long long v) { if (v != p[v]) { return p[v] = root(p[v]); } return v; } void fix(long long v, long long x) { if (v == n + 1) r...

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

#include <bits/stdc++.h> using namespace std; inline int read() { int s = 0; char ch = getchar(); while (!isdigit(ch)) ch = getchar(); while (isdigit(ch)) s = s * 10 + ch - 0 , ch = getchar(); return s; } inline char getch() { char ch = getchar(); while (!islower(ch)) ch = getchar()...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 10; int a[maxn], cnt[maxn], tmp[maxn]; int main(void) { int n, m; scanf( %d %d , &n, &m); for (int i = 1; i <= n; i++) { scanf( %d , a + i); if (a[i] <= m) cnt[a[i]]++; } for (int i = 1; i <= m; i++) for (...

#include <bits/stdc++.h> long long int const MOD = 1000000007; long long int const N = 1000005; long long int const LN = 20; long long int const inf = 8e18; using namespace std; long long int n, m, a[N]; vector<pair<long long int, long long int> > v[N]; struct data { long long int d, second, prev, i...

#include <bits/stdc++.h> using namespace std; int main() { int n; long long s = 0; cin >> n; for (int i = 2; i <= n / 2; i++) { for (int j = 2; j * i <= n; j++) s += 4 * j; } cout << s << endl; return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int x; cin >> x; int divisor = 1; int digits; int ans = 0; for (; divisor <= 9; divisor++) { if (x / divisor == 1 && x % divisor == 0) { digits = 1; b...

#include <bits/stdc++.h> using namespace std; set<long long> tp; long long tmp[100002], x, y, z, t; char ch; int main() { int n, k; scanf( %d %d , &n, &k); for (int i = 1; i <= n; i++) { scanf( %lld%c%lld%c%lld%c%lld , &x, &ch, &y, &ch, &z, &ch, &t); tmp[i] = t + (1 << 8) * z + (1 << 1...

#include <bits/stdc++.h> using namespace std; int main() { vector<int> child; int n, k; scanf( %d %d , &n, &k); int *A = new int[k]; for (int i = 0; i < k; ++i) { scanf( %d , &A[i]); } for (int i = 0; i < n; ++i) { child.push_back(i + 1); } int count = 0; for (int...

#include <bits/stdc++.h> char g[64][64]; int h[64][64]; void conv(long long x, long long y, long long a, long long b, long long *dx, long long *dy) { long long k, l; k = x - y + b * 2000000000LL; l = x + y + a * 2000000000LL; *dx = k / (2 * b) - 1000000000LL; *dy = l / (2 * a) - 10...

#include <bits/stdc++.h> long long k, m = 9, l, c, lc, n, md, tr = 1, fl, res; int main() { scanf( %lld , &k); while (1) { l++; lc += m * l; if (k - lc <= 0) { c = k - (lc - m * l); break; } m *= 10; tr *= 10; } n = (c + l - 1) / l; tr = tr + n...

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

#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 100; const int inf = 0x7ffffff; int a[maxn]; long long dp[maxn]; int main(void) { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); dp[0] = 0; for (int i = 1; i <= n; i++) { dp[i] = dp[i - 1...

#include <bits/stdc++.h> using namespace std; const int N = 1000005; const int MAXN = 1e5 + 5; const int LG = 22; int dp[51][51][51][51]; int n; int a[55][55]; int get(int tli, int tlj, int rbi, int rbj) { int res = a[rbi][rbj]; if (tli > 0) res = res - a[tli - 1][rbj]; if (tlj > 0) res = re...

#include <bits/stdc++.h> using namespace std; string s; int kappa[100]; void incc(int jj) { if (kappa[jj] > 9) { kappa[jj + 1]++; kappa[jj] %= 10; incc(jj + 1); } } void get_count(int a1, int a2, int a3) { int i, j; if (a2 - a3 == 2) { j = 0; for (i = a2; i >= a...

#include <bits/stdc++.h> using namespace std; int a[1000010], n, mo = 1000000007; long long dp[1000010], ans; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , a + i); a[i]--; } dp[1] = min(a[1], a[2]); for (int i = 2; i <= n; i++) { dp[i] = ...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( avx,avx2,fma ) using namespace std; using bigint = long long int; using vi = vector<int>; using vll = vector<long long int>; int spf[2005]; void smallestFactor() { for (int i = 1; i <= 2000; i++) spf[i] = i; for (int i = ...

#include <bits/stdc++.h> using namespace std; long long int arr[123456]; map<long long int, bool> mp; int main() { int a = 0, b = 0, n, k, l, r, all, kall; cin >> n >> k >> l >> r >> all >> kall; int rest = all - kall; for (int i = 0; i < k; i++) { arr[i] = kall / k; if (kall % k != ...

#include <bits/stdc++.h> int main() { int j, n, t, i; int a[100]; scanf( %d , &t); for (i = 1; i <= t; i++) { int d = 0, b = 0; scanf( %d , &n); for (j = 1; j <= n; j++) { scanf( %d , &a[j]); if (d == 0 && a[j] == 1) d = 1; if (d == 1 && a[j] == 0) b++; ...

#include <bits/stdc++.h> using namespace std; void min_self(int& a, int b) { a = min(a, b); } void max_self(int& a, int b) { a = max(a, b); } const int NAX = (int)(2e5 + 5); int v[NAX], visited[NAX]; int component_size; void visit(int i) { if (!visited[i]) { ++component_size; visited[i] = ...

#include <bits/stdc++.h> using namespace std; int a[100]; int main() { long long n, m; cin >> n >> m; int L = 0, R = n - 1; --m; long long sum = 0; for (int i = 1; i < n; ++i) { sum <<= 1; if (m & 1) sum += 1; m >>= 1; } m = sum; for (int i = 1; i <= n; m >>= ...

#include <bits/stdc++.h> using namespace std; int n, a, b, s = 1, d = 2, q[105][105]; int main() { ios_base::sync_with_stdio(false); cin >> n >> a >> b; for (int i = 1; i <= a; ++i) { for (int j = 1; j <= b; ++j) { q[i][j] = 0; if ((i + j) % 2 == 0) { if (s <= n) { ...

#pragma GCC optimize( Ofast ) #include <iostream> #include <fstream> #include <algorithm> #include <functional> #include <array> #include <chrono> #include <random> #include <vector> #include <string> #include <sstream> #include <cmath> #include <cstring> #include <bitset> #include <list>...

#include <bits/stdc++.h> using namespace std; int a[120]; int n, m; int main() { cin >> n >> m; for (int i = 1; i <= n; i++) cin >> a[i]; sort(a + 1, a + n + 1); int s = 0; int j; for (j = 1; j < n; j++) { s += a[j]; if (s > m) break; } if (j < n) cout << NO ; ...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; vector<long long int> a(n), b(n); map<long long int, bool> mp; bool ok = false; for (int i = 0; i < n; i++) { cin >> a[i]; b[i] = a[i]; i...

#include <bits/stdc++.h> using namespace std; long long kek[102][102]; long long dp[15][102][102], a[100000], b[100000], c[100000], a1, b1, c1, n, m, x, i, j, sc, k; string s; int main() { long long i1, j1; ios_base ::sync_with_stdio(0); cin.tie(0); cin >> n >> k >> c1; c1++; for...

#include <bits/stdc++.h> using namespace std; uint64_t log4(uint64_t n) { return log2(n) / 2; } uint64_t getA(uint64_t triple) { if (triple == 0) { return 1; } uint64_t doubleBits; if (triple == 1) { doubleBits = 1; } else { doubleBits = log4(triple * 3 + 1); } uint64...

#include <bits/stdc++.h> using namespace std; const long long MOD = 1000000007; const int N = 1000010; template <class T> class BIT { T bit[N + 1]; int n; public: BIT() { n = N; memset(bit, 0, sizeof(bit)); } T sum(int i) { T s = 0; ++i; while (i > 0) { ...

#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const double PI = acos(-1.0); const double E = exp(1); const int N = 1e5 + 5; int n; map<long long, long long> m; int main(void) { ios_base::sync_with_stdio(false); cin >> n; for (int i = 0; i < n; i++) { long lo...

#include <bits/stdc++.h> using namespace std; template <class T> inline void chkmax(T &a, T b) { if (a < b) a = b; } template <class T> inline void chkmin(T &a, T b) { if (a > b) a = b; } inline int read() { int sum = 0, p = 1; char ch = getchar(); while (!(( 0 <= ch && ch <= 9 ) |...

#include <bits/stdc++.h> using namespace std; struct edge { int to, cap, cost, rev, id; }; int dist[5005], h[5005], prevv[5005], preve[5005]; int V, n, m; vector<edge> G[5005]; void add_edge(int from, int to, int cap, int cost) { G[from].push_back((edge){to, cap, cost, (int)G[to].size()}); G[t...

#include <bits/stdc++.h> using namespace std; int num[100010]; int main() { int n; cin >> n; int k = ceil(sqrt(n)); int m = ceil((double)n / (double)k); int y = m; int flag = 0, cnt = 0; for (int i = 1; i <= k; i++) { int p = 0; int j = m; while (j--) { while ...

#include <bits/stdc++.h> using namespace std; const int maxn = 1007; const int inf = INT_MAX; const long long inff = 1e18; const long long mod = 1e9 + 7; int n; int a[maxn], b[maxn]; vector<pair<pair<int, int>, pair<int, int> > > v; int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cou...

#include <bits/stdc++.h> using namespace std; struct node { long long l, r; long long mx = -1e18; long long ch = 0; }; vector<node> tree; void push(long long v) { if (tree[v].l == tree[v].r) { tree[v].ch = 0; } else { tree[v * 2].ch += tree[v].ch; tree[v * 2 + 1].ch += tr...

#include <bits/stdc++.h> using namespace std; int main() { int n = 0; int x0, y0, x1, y1; cin >> x0 >> y0 >> x1 >> y1; int m; cin >> m; map<pair<int, int>, bool> mass; for (int i = 0; i < m; i++) { int r, a, b; scanf( %d%d%d , &r, &a, &b); for (int j = a; j <= b; j++) {...

#include <bits/stdc++.h> using namespace std; map<int, int> a, b; map<int, int>::iterator it; int n, ans = 1000000, k; int main() { int i, x, y, k; cin >> n; k = n / 2 + n % 2; for (i = 1; i <= n; i++) { cin >> x >> y; a[x]++; b[x]++; if (x != y) b[y]++; } for (...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10; struct E { int to; int next; } ed[maxn * 2]; int head[maxn]; int tot; void J(int a, int b) { ed[++tot].to = b; ed[tot].next = head[a]; head[a] = tot; } int dfn[maxn]; int cnt; int deep[maxn]; int t[maxn]...

#include <bits/stdc++.h> using namespace std; int main() { int q; cin >> q; while (q--) { unsigned long long int a, b, c; cin >> a >> b >> c; unsigned long long int s = a + b + c; cout << s / 2 << endl; } }

#include <bits/stdc++.h> using namespace std; vector<long long> a; long long n; long long pos1; double ct1, ct2 = 0; long long z; long long fun(long long l, long long r, vector<vector<long long> > dpp) { if (dpp[l][r] != -1) return dpp[l][r]; long long i, j, sum = 0; for (i = l; i < r; i++) { ...

#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; long long a = 1; for (int i = 1; i <= (3 * n); i++) { a *= 3; a %= 1000000007; } long long b = 1; for (int i = 1; i <= n; i++) { b *= 7; b %= 1000000007; } long long ans = ((...

#include <bits/stdc++.h> using namespace std; clock_t __stt; inline void TStart() { __stt = clock(); } inline void TReport() { printf( nTaken Time : %.3lf sec n , (double)(clock() - __stt) / CLOCKS_PER_SEC); } template <typename T> T MIN(T a, T b) { return a < b ? a : b; } template...

#include <bits/stdc++.h> using namespace std; bool is_powertwo(long long n) { long long count = 0; while (n) { if ((n & 1) > 0) count++; n = n >> 1; } if (count == 1) return true; return false; } int main() { long long t; t = 1; while (t--) { long long h1, a1, c...

#include <bits/stdc++.h> using namespace std; char str[5003]; int num[5003][2]; int main() { while (~scanf( %s , str + 1)) { memset(num, 0, sizeof(num)); int len = strlen(str + 1); for (int i = 1; i <= len; i++) { num[i][0] = num[i - 1][0]; num[i][1] = num[i - 1][1]; ...

#include <bits/stdc++.h> using namespace std; template <typename T> ostream& operator<<(ostream& s, vector<T>& v) { s << { ; for (int i = 0; i < int(v.size()); i++) s << (i ? , : ) << v[i]; return s << } ; } template <typename S, typename T> ostream& operator<<(ostream& s, pair<S, T> const...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; void doin() { cin.tie(); cout.tie(); ios::sync_with_stdio(0); } template <typename X, typename Y> istream& operator>>(istream& in, pair<X, Y>& a) { in >> a.first >> a.second; return in; } template <typename T...

#include <bits/stdc++.h> using namespace std; const int N = 2505; using ll = long long; int n, m, kk, a[N][N], sum[N][N], b[2][10]; char ch[N][N]; ll ans = 0; inline int calc(int x1, int x2, int y1, int y2) { return sum[x2][y2] - sum[x1][y2] - sum[x2][y1] + sum[x1][y1]; } void solve(int x1, int x2...

#include <bits/stdc++.h> using namespace std; bool p(long long n) { for (long long i = 2; i <= sqrt(n); i++) { if (n % i == 0) return 0; } return 1; } int main() { long long m, n, i, j, k; cin >> n; if (p(n)) { cout << 1 << endl << n; } else { cout << 3 << endl << 3...

#include <bits/stdc++.h> using namespace std; long long f[55][2][2], K, d; int a[55], n; long long C(int l, int r, int x, int y) { if (l > r) return 1; long long& F = f[l][x][y]; if (~F) return F; F = 0; for (int i = 0; i <= 1; ++i) for (int j = 0; j <= 1; ++j) if (a[l] - !i &&...

#include <bits/stdc++.h> using namespace std; void solve() { long long int a, b, c; cin >> a >> b >> c; long long int x = min(a, min(b, c)); long long int z = max(a, max(b, c)); long long int y = a + b + c - x - z; long long int xi = a == x ? 1 : b == x ? 2 : 3; long long int yi = a == y...

#include <bits/stdc++.h> using namespace std; int main() { int n, m, l, d; cin >> n >> d >> m >> l; long long x = 0; long long L = -m; long long R = -m + l; for (int i = 0; i < n; i++) { L += m; R += m; if (x + d < L) break; long long o = (R - x) / d; x = x + d ...

#include <bits/stdc++.h> using namespace std; vector<int> g; int a[100005], b[100005], c[100005]; int n, k; void solve() { int i, j, m, ans, cnt; c[m = 0] = a[0]; for (i = 1; i < n; i++) if (a[i] != a[i - 1]) c[++m] = a[i]; b[a[0]]--; for (i = 1; i <= m; i++) { b[c[i]]--; ...

#include <bits/stdc++.h> using namespace std; const int N = 60; int n, m; char s[N][N]; bool vis[N][N]; int tmp; int dx[] = {-1, 0, 1, 0}; int dy[] = {0, -1, 0, 1}; inline bool in(int x, int y) { return x >= 0 && x < n && y >= 0 && y < m; } void dfs(int x, int y) { vis[x][y] = 1; tmp++; ...

#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long INFF = 0x3f3f3f3f3f3f3f3fll; const long long M = 998244353; const long long maxn = 1e6 + 107; const double pi = acos(-1.0); const double eps = 0.0000000001; long long gcd(long long a, long long b) { return b ? gcd(...

#include <bits/stdc++.h> #pragma GCC optimize(2) #pragma GCC optimize(3) #pragma GCC optimize( Ofast ) #pragma GCC optimize( inline ) #pragma GCC optimize( -fgcse ) #pragma GCC optimize( -fgcse-lm ) #pragma GCC optimize( -fipa-sra ) #pragma GCC optimize( -ftree-pre ) #pragma GCC optimize( -ftree-vrp )...

#include <bits/stdc++.h> using namespace std; int main() { int x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2; int ans; int a = abs(x1 - x2); int b = abs(y1 - y2); ans = max(a, b); cout << ans << endl; return 0; }

#include <bits/stdc++.h> using namespace std; const int NMAX = 335; vector<vector<int> > B(NMAX); int lastans, cnt[NMAX][100001]; int main() { int N; cin >> N; int len = (int)ceil(sqrt(N + .0)); int num = 0, up = len; for (int i = 0; i < N; i++) { int a; cin >> a; if (i =...

#include <bits/stdc++.h> using namespace std; const int MAX = 100000; vector<int> g[MAX]; int k; int main() { ios::sync_with_stdio(0); cin.tie(0); ios::sync_with_stdio(0); cin.tie(0); cin >> k; if (k % 2 == 0) cout << NO n ; else { if (k == 1) { cout << YES n ...

#include <bits/stdc++.h> using namespace std; const int INF = 1000000000; struct Point { int x, y; Point(int x_ = 0, int y_ = 0) : x(x_), y(y_) {} Point(std::istream &in) { in >> x >> y; x *= 2; y *= 2; } }; bool operator<(const Point &a, const Point &b) { return (a.x < b...

#include <bits/stdc++.h> using namespace std; long long a[] = { 1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8092, 16184, 32368, 64736, 129472, 258944, 517888, 103...

#include <bits/stdc++.h> using namespace std; char str[50][50]; bool test(int a, int b, int w, int h) { int i, j; for (i = 0; i <= w; i++) { for (j = 0; j <= h; j++) { if (str[i + a][j + b] == 1 ) return 0; } } return 1; } int main() { int n, m, i, j, k, r; scanf( ...

#include <bits/stdc++.h> using namespace std; int main() { int a, b; cin >> a >> b; int d = 0; if (b % a != 0) { cout << -1 ; return 0; } int c = b / a; if (c == 1) { cout << 0 ; return 0; } while (c != 0) { if (c % 2 == 0) { c = c / 2; ...

#include <bits/stdc++.h> using namespace std; int main() { int N, K; cin >> N >> K; int a[N], b[K]; int cnt = 0; for (int i = (0); i < (N); i++) { cin >> a[i]; if (a[i] == 0) cnt++; } if (cnt > K) { cout << No n ; return 0; } for (int i = (0); i < (K); i+...

#include <bits/stdc++.h> using namespace std; const long long int mod = 1e9 + 7; long long int t, n, m, a[1000005] = {0}, d[1000005], b[1000005]; stack<long long int> s; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); long long int i, j, k, x, y; cin >> n >> m; ...

#include <bits/stdc++.h> using namespace std; template <typename T> inline bool chkmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; } template <typename T> inline bool chkmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; } const int oo = 0x3f3f3f3f; const int max0 = 50, maxn = 1000; i...

#include <bits/stdc++.h> using namespace std; vector<vector<int> > g(300005); int a[300005], s1[300005], s2[300005]; int main() { ios_base::sync_with_stdio(0); int n; cin >> n; for (int i(1); i <= n; i++) { cin >> a[i]; } for (int i(0); i < n - 1; i++) { int x, y; cin >...

#include <bits/stdc++.h> using namespace std; int main() { string a, b; int ailgis, bilgis; cin >> a >> b; ailgis = a.length(); bilgis = b.length(); if (a == b) { cout << -1 ; return 0; } if (ailgis > bilgis) cout << ailgis; else cout << bilgis; }

#include <bits/stdc++.h> using namespace std; const double EPS = 1e-10; const double PI = acos(-1.0); double tick() { static clock_t oldtick; clock_t newtick = clock(); double diff = 1.0 * (newtick - oldtick) / CLOCKS_PER_SEC; oldtick = newtick; return diff; } template <typename T> T m...

#include <bits/stdc++.h> using namespace std; const long long mod = 1000000033; const long long p = 10007; string s; int n, k; int A[1000005], pref[1000005]; long long P[1000005], H[1000005]; void go(int ind, int end) { while (end <= n && s[end - ind] == s[end - 1]) end++; pref[ind] = end - ind;...

#include <bits/stdc++.h> using namespace std; int main() { int k; cin >> k; cout << + ; for (int i = 0; i < 24; i++) cout << - ; cout << + n ; int r1 = (k + 1) / 3; bool enough = 0; int passenegrs = 0; for (int i = 0; i < 27; i++) { if (i == 0 || i == 23 || i == 25) ...

#include <bits/stdc++.h> using namespace std; bool cmp(int a, int b) { return a > b; } int main() { long long n, m, i, j, k, t, a, b; cin >> a >> b; m = b - a; if (m == 0) { cout << 1 << endl; } else { if (m > 4) { cout << 0 << endl; } else { n = 1; fo...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; bool con = false; for (int i = 1; i < 32000; i++) { double M = 2 * n - i * (i + 1); double k = (-1.0 + sqrtl(1 + 4 * M)) / 2.0; if (k <= 0) break; if (abs((long long int)k - k) <= 1e-9) { con ...

#include <bits/stdc++.h> using namespace std; long long powmod(long long a, long long b) { long long res = 1; a %= 1000000007; for (; b; b >>= 1) { if (b & 1) res = res * a % 1000000007; a = a * a % 1000000007; } return res; } template <typename T> inline bool chkmin(T &a, cons...

#include <bits/stdc++.h> using namespace std; int main() { int n, x; cin >> n >> x; int sum = 0, y; for (int i = 0; i < n; i++) { cin >> y; sum += y; } if (sum == 0) { cout << 0 n ; return 0; } if (abs(sum) <= x) { cout << 1 n ; return 0; } e...

#include <bits/stdc++.h> using namespace std; int countDigit(long long n) { int count = 0; while (n != 0) { n = n / 10; ++count; } return count; } int main() { long long int t; cin >> t; while (t--) { int k, s; cin >> s; int n = s % 10, ans; k = co...

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

#include <bits/stdc++.h> int i, n; int main() { for (std::cin >> n; i < n; ++i) std::cout << (i ? i : n) << ; return 0; }

#include <bits/stdc++.h> using namespace std; long long n, m, a[100005]; long long dfn[100005], head[100005], idx, rev[100005], cnt, size[100005], top[100005], dep[100005], fa[100005], son[100005]; long long sum[100005 << 2], tag[100005 << 2]; void push_tag(long long p, long long l, long long r, long lo...

#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007; const long long INF = mod * mod; const long double eps = 1e-8; bitset<7001> memo[100000]; bitset<7001> for_query[7001]; bitset<7001> for_set[7001]; void init() { vector<int> v; for (int i = 2; i <= 90; i++) { v...

#include <bits/stdc++.h> using namespace std; using LL = long long; constexpr int N = 1e5 + 5; string s; int n; int f(int x, int y) { int z = x; int res = 0; for (int i = 0; i < n; i++) { if (s[i] == z) { res++; z = x + y - z; } } if (res & 1) res -= (x != y);...

#include <bits/stdc++.h> #pragma warning(disable : 4996) using namespace std; long long __gcd(long long a, long long b) { while (a != 0) { long long __t = b % a; b = a; a = __t; } return b; } class Graph { public: struct edge; private: unsigned N; vector<long...

#include <bits/stdc++.h> using namespace std; inline int Int() { int x; scanf( %d , &x); return x; } inline long long Long() { long long x; scanf( %lld , &x); return x; } void err(istream_iterator<string> it) { cout << endl; } template <typename T, typename... Args> void err(istr...

#include <bits/stdc++.h> using namespace std; template <typename T> inline bool chkmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; } template <typename T> inline bool chkmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; } const int oo = 0x3f3f3f3f; const int maxn = 200100; int n; i...

#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 7; const int inf = 0x3f3f3f3f; const long long INF = 0x3f3f3f3f3f3f3f3f; const int mod = 1e9 + 7; const double eps = 1e-8; const double PI = acos(-1); template <class T, class S> inline void add(T &a, S b) { a += b; if (a >= mod...

#include <bits/stdc++.h> using namespace std; const int MAXN = 5e3 + 3; map<int, int> mapa; vector<int> v; int mw[103030]; int main() { int n, m, a, maxi = 0; scanf( %d %d , &n, &m); for (int i = (int)0; i < (int)n; i++) { scanf( %d , &a); mapa[a] = 1; mw[i] = a; if (maxi...

#include <bits/stdc++.h> using namespace std; const int MAXN = 100010; int n, U, a[MAXN]; double ans = 0; int main() { cin >> n >> U; for (int i = 1; i <= n; i++) cin >> a[i]; int now = 1; for (int i = 1; i <= n; i++) { while (now <= n && a[now] - a[i] <= U) now++; now--; if ...

#include <bits/stdc++.h> using namespace std; typedef struct node_t { string name; int h; } node_t; int n; node_t node[3010]; int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> node[i].name >> node[i].h; } for (int i = 1; i <= n; i++) { for (int j = i + 1; j <= ...

#include <bits/stdc++.h> using namespace std; int d, n, m; int i, j; vector<pair<int, int> > gas; struct cmp { bool operator()(const pair<int, int> &p1, const pair<int, int> &p2) { return p1.second > p2.second; } }; priority_queue<pair<int, int>, vector<pair<int, int> >, cmp> q; int main()...

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

#include <bits/stdc++.h> using namespace std; long long n, a[15]; long long M[5][5]; long long s; long long check() { long long rs[5], cs[5]; memset(rs, 0, sizeof(rs)); memset(cs, 0, sizeof(cs)); long long d1 = 0, d2 = 0; for (long long i = 1; i <= n; i++) { for (long long j = 1; j <...