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

func_code_string stringlengths 59 71.4k
#include <bits/stdc++.h> using namespace std; int n, ans, q; int main() { cin >> n; int i = 1; while (q < n) { if (i % 2) q++, ans++; else if (q < n - 1) q += 2, ans++; else break; i++; } cout << ans << endl; return 0; }
#include<bits/stdc++.h> #define pb push_back #define x first #define y second #define all(a) (a).begin(), (a).end() using namespace std; typedef long long ll; typedef pair<int, int> ii; const int maxn = 3e5 + 5; int n, m, X; ll A[maxn]; int par[maxn]; set<pair<ll, ii>> adj[maxn]; ...
#include <bits/stdc++.h> using namespace std; const int maxn = 200100; struct seat { int w, id; bool operator<(const seat& st) const { return w < st.w; } bool operator>(const seat& st) const { return w > st.w; } }; seat st[maxn]; int n; char tp[maxn * 2]; int main() { while (scanf( %d , ...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 9; int arr[maxn]; int vis[maxn]; int n; int mu; long long re[111]; long long gcd(long long a, long long b) { long long c = 1; while (b) { c = a % b; a = b; b = c; } return a; } int sol(int a) { ...
#include <bits/stdc++.h> using namespace std; long long int ar[500009], br[500009]; int main() { long long int a, b, c, i, j = 999999999999, k, e, f, g, w, h, i1, j1; string s, d; cin >> a >> b >> c; e = a; c = c * 5; j = a; for (i = 1;; i++) { a = e; if (a - (i * b) < 0) {...
#include <bits/stdc++.h> using namespace std; template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << ; cerr << endl; } int main() { for (long long N, M; cin >> N >> M;) { for (int i = 0; i < (int)(N); ++i) { long long S, F, T; cin >> S >> F >> T; ...
#include <bits/stdc++.h> using namespace std; int a[300001], d[300001]; long long b[300001], c[300001]; map<int, int> mp; int main() { int n, i, l, r, j, k; long long s, _s; for (scanf( %d , &n), i = 1; i <= n; i++) { scanf( %d , &a[i]); b[i] = b[i - 1] + a[i]; c[i] = c[i - 1] + ...
#include <bits/stdc++.h> using namespace std; vector<int> x_coord, y_coord; vector<vector<int>> adj; vector<bool> used; int n; void dfs(int v) { used[v] = true; for (auto u : adj[v]) { if (!used[u]) { used[u] = true; dfs(u); } } } int main() { scanf( %d , &n);...
#include <bits/stdc++.h> using namespace std; const double eps = 1e-8; const int mod = 1e9 + 7; const int N = 1e6 + 10; const int inf = 1e9; int t, n, a[N], b[N]; int gao(int x) { int res = b[1] - x; for (int i = 2; i <= n; i++) { res = b[i] - max(a[i] - res, 0); if (res < 0) return -1...
#include <bits/stdc++.h> using namespace std; int n, mini = 0, maxi = 0; int x[200005]; bool o[200005]; int main() { cin >> n; for (int i = 0; i < (n); i++) { int a; cin >> a; x[a]++; } for (int i = 0; i < (n + 1); i++) { while (i < n + 1 && x[i] == 0) i++; if (i ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; char ar[n]; for (int i = 0; i < n; ++i) { cin >> ar[i]; } int co = 0; vector<int> po; for (int i = 0; i < n - 1; ++i) { if (ar[i] == W ) {...
#include <bits/stdc++.h> using namespace std; inline void fast() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } const long long int mod = 1e9 + 7; long long int pmod(long long int x, long long int n) { long long int r = 1; while (n) { if (n & 1LL) r = (r * x) % mod; ...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; if (n <= 2) cout << -1; if (n == 3) cout << 210; if (n >= 4) { string s = 1 ; int sign; int z = 0; if (n % 3 == 0) z = 100; if (n % 3 == 1) z = 1; if (n % 3 == 2) z = 10; if (((...
#include <bits/stdc++.h> using namespace std; const long long mod = 998244353; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; long long k; cin >> n >> k; if (!k) { cout << 0 n ; return 0; } vector<int> h(n); for (int i = 0; i < n; i++...
#include <bits/stdc++.h> using namespace std; int main() { int n, k, x, i, p; char y; string ch = ; cin >> n >> k; for (i = 0; i < k; i++) { p = 97 + i; y = (char)p; ch += y; } if (n == k) cout << ch; else { x = n - k; i = 0; while (x--) { ...
#include <bits/stdc++.h> using namespace std; mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count()); const long long inf = 1e15 + 7; bool check(long long n) { return __builtin_popcount(n + 1) == 1; } vector<long long> res; bool solve(long long n, long long k, long long par) { if (...
#include <bits/stdc++.h> using namespace std; int n, m, a[1001], x; int main() { scanf( %d %d , &n, &m); for (int i = 1; i <= m; i++) { scanf( %d , &x); a[x]++; } sort(a + 1, a + n + 1); printf( %d n , a[1]); return 0; }
#include <bits/stdc++.h> using namespace std; long long int binary_exp(long long int a, long long int n) { long long int i = 1; while (n > 0) { if (n % 2 == 1) i = (i * a) % 1000000007; a = (a * a) % 1000000007; n /= 2; } return i; } long long int IsPrime(long long int n) { ...
#include <bits/stdc++.h> using namespace std; const long long int N = 3e5 + 5, inf = 1e9 + 7; long long int bigmod(long long int b, long long int p, long long int m) { long long int rt = 1; while (p) { if (p & 1) rt = (rt * b) % m; b = (b * b) % m; p >>= 1; } return rt; } int...
#include <bits/stdc++.h> using namespace std; long long rdtsc() { long long tmp; asm( rdtsc : =A (tmp)); return tmp; } inline int myrand() { return abs((rand() << 15) ^ rand()); } inline int rnd(int x) { return myrand() % x; } const int INF = (int)1e9 + 1; const long double EPS = 1e-9; voi...
#include <bits/stdc++.h> int main() { int a[6]; for (int i = 0; i < 6; i++) scanf( %d , &a[i]); int tot = a[0] + a[1] + a[2]; int ans = tot * tot - a[0] * a[0] - a[2] * a[2] - a[4] * a[4]; printf( %d n , ans); }
#include <bits/stdc++.h> using namespace std; const unsigned long long hash1 = 201326611; const unsigned long long hash2 = 50331653; const int N = 200000 + 10; const int M = 20; vector<int> g[N]; int n, vis[N]; int main() { ios::sync_with_stdio(false); cin.tie(0), cout.tie(0); cin >> n; ...
#include <bits/stdc++.h> using namespace std; int n, root; int val[100000], maxl[100000], maxr[100000]; vector<int> fo[100000]; void dfs(int vr) { if (fo[vr].size() == 0) { maxl[vr] = maxr[vr] = val[vr]; return; } dfs(fo[vr][0]); dfs(fo[vr][1]); maxl[vr] = maxl[fo[vr][0]]; ...
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; inline void umax(long long &a, long long b) { a = max(a, b); } inline void umin(long long &a, long long b) { a = min(a, b); } inline pair<long long, long long> rv(pair<long long, long long> a) { return make_pair(a.second, a.first); ...
#include <bits/stdc++.h> using namespace std; int main() { long long int n, t; cin >> n >> t; string s; cin >> s; char temp; while (t--) { for (int i = 0; i < n - 1; i++) { if (s[i] != s[i + 1] && s[i] == B ) { temp = s[i + 1]; s[i + 1] = s[i]; s[...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, m; cin >> n >> m; vector<string> g(n); for (int i = 0; i < n; i++) cin >> g[i]; auto flip = [&](int i, int...
#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); const long long maxn = 3e6; const long long mod = 1e9 + 7; const long double PI = acos((long double)-1); long long pw(long long a, long long b, long long md = mod) { long long res = 1; ...
#include <bits/stdc++.h> using namespace std; vector<int> dx = {-1, 0, 0, 1}; vector<int> dy = {0, -1, 1, 0}; const int Mod = (int)((int)1e9 + 7); void solve() { int n, k; cin >> n >> k; vector<int> a(n); int ans = 0; for (int i = 0; i < n; i++) { cin >> a[i]; } sort(a.begin(...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int game[2]; int m, c; m = c = 0; for (int i = 0; i < n; i++) { cin >> game[0] >> game[1]; if (game[0] > game[1]) { m++; } else if (game[0] < game[1]) { c++; } } if (m ...
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10; int nxt[N]; map<int, vector<int>> w; int extendA[N], extendB[N], l[N], r[N]; char s[N], t[N]; int n, m, k; void pre_EKMP(char x[], int m, int nxt[]) { nxt[0] = m; int j = 0; while (j + 1 < m && x[j] == x[j + 1]) j++; n...
#include <bits/stdc++.h> using namespace std; int n; int b[3100]; int a[3100]; int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %d , &b[i]); int bb = b[i] - b[i - 1], l; if (bb > 0) { youginzi: l = 1; while (bb) { while (a[l] == 9) l...
#include <bits/stdc++.h> using namespace std; inline void read(int &x) { int v = 0, f = 1; char c = getchar(); while (!isdigit(c) && c != - ) c = getchar(); if (c == - ) f = -1; else v = (c & 15); while (isdigit(c = getchar())) v = (v << 1) + (v << 3) + (c & 15); x = v * f;...
#include <bits/stdc++.h> using namespace std; const double pi = acos(-1.0); int main() { int t; scanf( %d , &t); while (t--) { int n; scanf( %d , &n); long k; scanf( %ld , &k); int d; scanf( %d , &d); long arr[n]; for (int i = 0; i < n; i++) { ci...
#include <bits/stdc++.h> using namespace std; int main() { int T; cin >> T; while (T--) { long long a, b, n, m; scanf( %lld%lld%lld%lld , &a, &b, &n, &m); if (a < m \|\| b < m) { printf( No n ); continue; } if ((a + b) < (m + n)) { printf( No n ); ...
#include <bits/stdc++.h> using namespace std; const int N = 1e4 + 10; char scn[N][2]; int l, x, mem; string s; int main() { l = 1; x = 25; cin >> s; for (int i = 1; i <= 10000; i++) { scn[i][1] = . ; } mem = 0; l = 1; for (int i = 0; i < s.size(); i++) { while (m...
#include <bits/stdc++.h> using namespace std; int t; int n, r; int main() { scanf( %d , &t); while (t--) { scanf( %d %d , &n, &r); r--; int sum = 0; for (int i = 0; i < n - 1; i++) { int a; scanf( %d , &a); a--; sum = (sum + a) % n; } i...
#include <bits/stdc++.h> using namespace std; int i, j, k, l, n, m, s; int a[1000], b[1000]; int main() { cin >> n >> m; for (i = 1; i <= n; i++) { cin >> l; a[l]++; } for (i = 1; i <= 110; i++) { s = 0; for (j = i; j <= i + m; j++) s = s + a[j]; k = max(k, s); ...
#include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 7; const int N = 1e5 + 5; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; long long int n; cin >> n; long long int brstr = 0; brstr += (n - 3) * (n - 4); brstr += 3 * (n - 3); cout <<...
#include <bits/stdc++.h> using namespace std; vector<long long> seive() { long long n = 2; vector<long long> pr(200000, -1); for (int i = n; i < 200000; i++) { if (pr[i] == -1) pr[i] = 1; else continue; for (int j = 2 * i; j < 200000; j += i) pr[j] = 0; } return...
#include <bits/stdc++.h> using namespace std; const int N = 1e2 + 5, M = 2e4 + 5; int a[105], b[300]; int dp[105][M]; int main() { int t; cin >> t; while (t--) { memset(dp, 0, sizeof(dp)); int n, k, l; scanf( %d %d %d , &n, &k, &l); for (int i = 1; i <= n; i++) cin >> a[i];...
#include <bits/stdc++.h> using namespace std; int a[24], n, Z[24]; bool DP[24][(1 << 23) + 5]; vector<int> X; map<int, int> Memo; int main() { std: ios::sync_with_stdio(false); cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; Memo[a[i]] = i + 1; } Z[0] = 1; DP[0][0]...
#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; int v = 3 - n % 3, ans = 0; for (int i = v;; i += 3) { if (1LL * i * (i + 1) / 2 > (n + i) / 3) break; ++ans; } cout << ans; return 0; }
#include <bits/stdc++.h> const int mod = 1e9 + 7, maxn = 1e6, maxm = 6; int n, a[maxn], b[maxn], c[maxn], g[maxn], pw2[maxn], pw10[maxm]; long long ans; int main() { scanf( %d , &n); while (n--) { int x; scanf( %d , &x); ++a[x]; (b[x] += x) %= mod; c[x] = (1ll * x * x + c[x...
/* -> Written by <- ----------- \|K_A_Z_A_M_A\| \|___________\| \| ___ \| \| (^_^) \| \| /( \| ) \| \|____\|_\|____\| H O A N G */ #include <bits/stdc++.h> #define Task running #define F first #define S second #define pb ...
#include <bits/stdc++.h> using namespace std; long long int min(long long int a, long long int b) { return a < b ? a : b; } int getMedian(int ai[100001], int n) { map<int, int> m; for (int i = 0; i < n; i++) { if (m.find(ai[i]) != m.end()) { m[ai[i]] = m[ai[i]] + 1; } else m[ai...
#include <bits/stdc++.h> using namespace std; int main() { int v, e; cin >> v >> e; vector<set<int> > g(v); int a, b; for (int i = 0; i < e; i++) { cin >> a >> b; g[a - 1].insert(b - 1); g[b - 1].insert(a - 1); } int ans = 0; while (1) { vector<int> ve; ...
#include <bits/stdc++.h> using namespace std; int A[100010]; int B[100010]; int C[100010]; int main() { int n; scanf( %d , &n); int m, k; scanf( %d%d , &m, &k); for (int i = 0; i < m; i++) { scanf( %d%d%d , A + i, B + i, C + i); } long long sum = 0; for (int i = 0; i < k;...
#include <bits/stdc++.h> using namespace std; int main() { int n, temp, sum = 0; cin >> n; int arr[n]; memset(arr, 0, sizeof(arr)); for (int i = 0; i < n; i++) { cin >> arr[i]; sum += arr[i]; if (i == 0) temp = arr[0]; else if (arr[i] > temp) temp = arr[i]...
#include <bits/stdc++.h> using namespace std; const int MAXN = 10000; const int MAXM = 100000; const int INF = 0x3f3f3f3f; pair<int, int> nxt[3][3]; int cot[3][3]; map<pair<int, int>, pair<long long, long long> > ma; int main() { long long k; int a, b; scanf( %I64d%d%d , &k, &a, &b); a--...
#include <bits/stdc++.h> using namespace std; template <class T> inline T GCD(T a, T b) { return b ? GCD(b, a % b) : a; } template <class T> inline T LCM(T a, T b) { if (a < 0) return LCM(-a, b); if (b < 0) return LCM(a, -b); return a * (b / GCD(a, b)); } int main() { int n, s; c...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1000100; int bit[MAXN]; int main() { ios::sync_with_stdio(false); int n; cin >> n; for (int i = 0; i < n; ++i) { int w; cin >> w; bit[w]++; } int step = 0; for (int i = 0; i < MAXN - 1; ++i) { bit[...
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10, mod = 1e9 + 7; int ans[N], a[N]; vector<pair<int, int> > v; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, m; cin >> n >> m; long long sum = 0; for (int i = 0; i < m; i++) { ...
#include <bits/stdc++.h> using namespace std; const long long maxn = 1e5 + 5; const long long mod = 1e9 + 7; const double eps = 1e-9; const double pi = acos(-1.0); const long long inf = 0x3f3f3f3f; long long n, m; long long a[maxn]; long long s1[maxn], s2[maxn]; long long sum1[maxn], sum2[maxn]; i...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( avx,avx2,fma ) #pragma GCC optimization( unroll-loops ) using namespace std; void solve() { long long n; cin >> n; vector<long long> a(n); for (auto &x : a) cin >> x; if (*min_element(a.begin(), a.end()) == 1) { ...
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 10; set<int> s; int n, t; char a[maxn]; int pos; int main() { register int i, tail, g; scanf( %d%d , &n, &t); scanf( %s , a + 1); for (i = 1; i <= n; i++) if (a[i] == . ) { pos = i; break; } ...
#include <bits/stdc++.h> using namespace std; template <typename T, typename U> inline void smin(T &a, const U &b) { if (a > b) a = b; } template <typename T, typename U> inline void smax(T &a, const U &b) { if (a < b) a = b; } int a[2020]; struct Dinic { int V, E, src, tar; int head[2...
#include <bits/stdc++.h> using namespace std; const double eps = 0.000001; const long double pi = acos(-1); const int maxn = 1e7 + 9; const int mod = 1e9 + 7; const long long MOD = 1e18 + 9; const long long INF = 1e18 + 123; const int inf = 2e9 + 11; const int mxn = 1e6 + 9; const int N = 1e6 + 123;...
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const int maxn = 100005; int a[maxn], lefts[maxn], rights[maxn]; int main() { int n, l, r, q1, q2; cin >> n >> l >> r >> q1 >> q2; memset(lefts, 0, sizeof(lefts)); memset(rights, 0, sizeof(rights)); for (int i = 0; i...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma ) #pragma GCC optimize( unroll-loops ) using namespace std; double eps = 1e-12; long long hcf(long long p, long long q) { if (p > q) return hcf(q, p); if (!p) return q; ...
#include <bits/stdc++.h> using namespace std; long long a[100005], b[100005]; const long long INF = 1000000009; int main() { int n, x, y; cin >> n >> x >> y; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n; i++) b[i] = INF; for (int i = 0; i < n; i++) for (int j = i - y;...
#include <bits/stdc++.h> using namespace std; int w1, h1, w2, h2, s; int main() { cin >> w1 >> h1 >> w2 >> h2; s = 2 * (h1 + h2 + w1 + 2); cout << s << endl; }
#include <bits/stdc++.h> int main() { int n, m, i, a; int f[105] = {0}; scanf( %d%d , &n, &m); while (m--) { scanf( %d , &a); for (i = a; i <= n; i++) if (f[i] == 0) f[i] = a; } for (i = 1; i < n; i++) printf( %d , f[i]); printf( %d n , f[n]); return 0; }
#include <bits/stdc++.h> using namespace std; string s, p; vector<int> a, b, x, y; int main() { cin >> s >> p; a.push_back(0); b.push_back(0); x.push_back(0); y.push_back(0); for (int i = 0; i < s.size(); i++) { a.push_back(a[a.size() - 1]); x.push_back(x[x.size() - 1]); ...
#include <bits/stdc++.h> using namespace std; const int N = 200005; const int mod = 1e9 + 7; const double eps = 1e-8; const double PI = acos(-1.0); int a[N], l[N], r[N], d[N], cha[N]; int m, n, k, t; bool check(int x) { if (!x) return true; for (int i = 0; i <= n + 1; i++) cha[i] = 0; int g ...
#include <bits/stdc++.h> using namespace std; int n, k, Count = 0, a[2005], Free[2005]; vector<int> V; int main() { cin >> n >> k; for (int i = 1; i <= n; i++) { cin >> a[i]; if (a[i] <= k) Free[a[i]]++; else V.push_back(i); } for (int i = 1; i <= k; i++) ...
#include <bits/stdc++.h> using namespace std; const int N = 35; const int MOD = 1e9 + 7; long long n; int K, c, res; struct mat { int d[N][N]; mat() { memset(d, 0, sizeof d); } } F[N * 2][N], P[N * 2][N], Q[N * 2][N], G; int lst[N * 2]; mat operator*(mat a, mat b) { mat c; for (int i =...
#include <bits/stdc++.h> using namespace std; long long aabs(long long a) { if (a < 0) return -a; else return a; } struct node { long long num; int id; bool operator<(const node &a) const { return aabs(num) > aabs(a.num); } }; long long a[200005]; long long n, k, x; int m...
#include <bits/stdc++.h> struct Node { int d[10]; }; Node a[401][401]; char p[401][401]; int main() { int i, j, n, m, res; while (scanf( %d%d , &n, &m) != EOF) { res = 0; for (i = 0; i < n; i++) scanf( %s , p[i]); for (i = 0; i < n; i++) { for (j = 0; j < m; j++) { ...
#include <bits/stdc++.h> using namespace std; long long const N = 1e5 + 100, INF = 1ll * 1e9 * 1e9 + 100; long long n, m, s, t; long long h[N], d[N], dis[2][N], ans[N]; pair<pair<long long, long long>, long long> e[N]; vector<long long> f[N], g[N]; set<pair<long long, long long> > st; bool vis[N]; voi...
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, d; cin >> a >> b >> c >> d; if (abs(a + c - b - d) > 1) { cout << NO n ; } else { vector<int> v(a + b + c + d); if (a + c > b + d) { for (int i = 0; i < v.size(); i += 2) { if (a) { ...
#include <bits/stdc++.h> const int N = 200005; int n, m, b[N]; char a[N], A[N]; int main() { scanf( %d%d%s , &n, &m, a); memset(b, 0x3f, sizeof(b)); for (int i = 0; i < n; i++) { int l = (i - 1 + n) % n, r = (i + 1) % n; if (a[i] == a[r]) { for (int j = l, k = 1; a[j...
#include <bits/stdc++.h> using namespace std; string S; vector<vector<vector<int> > > cc; int dp(int idx, int d, int s) { int &ret = cc[idx][d][s]; if (ret != -1) return ret; if (idx == S.size() / 2) { if (S.size() % 2) { int x = S[idx] - 0 ; if ((10 * d + x - s) < 0 \|\| (x - s...
#include <bits/stdc++.h> using namespace std; const int N = 100105; const double eps = 1e-6; long double x1, y1_, x2, y2, mx, my, vx, vy, d, L, ans = 1e16; vector<pair<long double, int> > V; int X[N], Y[N], R[N], n, s = 0; long double check(int k, long double t, int op) { return ((sqrt(d * d + t * t) ...
#include <bits/stdc++.h> using namespace std; const int inf = 1 << 30; const double eps = 1e-8; const double pi = acos(-1.0); int n, m; char a[110], b[110], c[110]; int d[26]; int main() { srand(time(NULL)); scanf( %d%d%s%s , &n, &m, a, b); int la = strlen(a), lb = strlen(b); int flag = ...
#include <bits/stdc++.h> long long a[1001]; using namespace std; int main() { long long n, cnt = 0; cin >> n; for (long long i = 0; i < n; i++) { cin >> a[i]; if (a[i] == 0) { cnt++; } if (n == 1) { if (a[i] == 0) { cout << NO ; return 0; ...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> p(n / 2); for (int i = 0; i < n / 2; i++) { cin >> p[i]; } sort(p.begin(), p.end()); int sum1 = 0, sum2 = 0; for (int i = 0; i < n / 2; i++) { sum1 += abs(p[i] - i * 2 - 1); sum2...
#include <bits/stdc++.h> using namespace std; int gi() { int x = 0, c = getchar(); bool f = 0; for (; !isdigit(c); c = getchar()) if (c == - ) f = 1; for (; isdigit(c); c = getchar()) x = x * 10 + (c & 15); return f ? -x : x; } const int N = 300005; const int mod = 998244353; int ...
#include <bits/stdc++.h> using namespace std; int min(int a, int b) { return a < b ? a : b; } long long max(long long a, long long b) { return a > b ? a : b; } int read() { int x = 0, w = 1; char ch = getchar(); while (ch > 9 \|\| ch < 0 ) { if (ch == - ) w = -1; ch = getchar(); } ...
#include <bits/stdc++.h> using namespace std; long long int c[1005][1005], quadratic = 0, single_x = 0, single_y = 0, cnstnt = 0; void calc_time_function(long long int n, long long int m) { long long int i, j, centr_x, centr_y; for (i = 0; i < n; i++) { for (j = 0; j <...
#include <bits/stdc++.h> using namespace std; const long long MOD = 1000000000 + 7; const long long MOD1 = 998244353; long long mod(long long x) { return (x % MOD + MOD) % MOD; } long long mul(long long a, long long b) { return mod(mod(a) * mod(b)); } string itos(long long s) { string str = to_string(s)...
#include <bits/stdc++.h> typedef long long ll; typedef unsigned long long ull; typedef long double ld; using namespace std; const int INF = 1e9 + 5; void failure () { cout << 0 << endl; exit(0); } namespace Lib { #define ran(i, a, b) for (auto i = (a); i < (b); i++) str...
#include <bits/stdc++.h> const int INFI = (1 << 29); const long long INFL = (1LL << 62); using namespace std; void solve() { long long a, n, m; cin >> a >> n >> m; bitset<2010> rain; vector<long long> v(m + 1); vector<pair<long long, long long> > umb(a + 1, {INFL, 0}); for (long long i =...
#include <bits/stdc++.h> using namespace std; int c1, c2, c3, c4, n, m, bus[1009], tre[1009], x, z1, z, l, l1, y; int main() { cin >> c1 >> c2 >> c3 >> c4; cin >> n >> m; for (int i = 1; i <= n; i++) { cin >> bus[i]; if (l == 0) { if (x + bus[i] * c1 < x + c2) x += bus[i]...
#include <bits/stdc++.h> using namespace std; vector<long long> tree[1 << 20]; long long a[1 << 20], goal[1 << 20]; vector<long long> ans; void dfs(long long v, long long cnt1 = 0, long long cnt2 = 0, long long par = -1) { for (long long i = 0; i < cnt1; i++) { a[v] = !a[v]; } if ...
#include <bits/stdc++.h> using namespace std; int n, m; int ara[100005]; int pri[100005]; vector<int> jog[2 * 100005], biyog[2 * 100005]; map<pair<int, int>, int> dp1, dp2; int cnt1(int x, int y) { if (y == m + 1) return x; if (dp1.find({x, y}) != dp1.end()) return dp1[{x, y}]; int val = x - y...
#include <bits/stdc++.h> using namespace std; const int N = 1e6, inf = 1e9 + 2; pair<int, int> a[N + 2], b[N + 2], aa[N + 2], bb[N + 2]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, c, d; cin >> n >> c >> d; int p = 0, q = 0; for (int i = 1; i <= n; i++) { int x, y...
#include <bits/stdc++.h> using namespace std; char mp[5500][5500]; int sum[5500][5500]; const int INF = 0x3f3f3f3f; int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 1; i <= n; ++i) scanf( %s , mp[i] + 1); for (int i = 1; i <= n; ++i) { int tot = 0; for (int j = 1; j <= m;...
#include <bits/stdc++.h> using namespace std; vector<int> g[5000]; vector<int> r[5000]; vector<int8_t> vis(5000); int n, m, s; void dfs(int src) { vis[src] = true; for (auto v : g[src]) { if (!vis[v]) { dfs(v); } } } int root(int src, vector<bool> &df) { df[src] = tru...
#include <bits/stdc++.h> int main() { int n; scanf( %d , &n); if (n % 5 == 0) printf( %d , n / 5); else printf( %d , (n / 5) + 1); return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 100005; const long long inf = 0x3f3f3f3f3f3f; long long a[3][maxn], dp[3][maxn]; int main() { std::ios::sync_with_stdio(false); std::cin.tie(0); int n; cin >> n; for (int j = (1); j < (3); j++) for (int i = (1); i < (n + ...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; int a[N], b[N], len; bool vis[N]; int xx(int x) { if (x & 1) return x / 2; else return x / 2 - 1; } int main() { int t; cin >> t; while (t--) { len = 0; memset(vis, 0, sizeof vis); int n...
#include <bits/stdc++.h> using namespace std; template <typename T> inline T sqr(T t) { return t * t; } inline void files() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } int n, a[100100]; int main() { files(); int l = 0, r = 0; int ans = 0; cin >> n; for ...
#include <bits/stdc++.h> using namespace std; long long n, m, k; void nhap() { cin >> n >> m >> k; } long long tinh(long long x) { if (x > k) return -1e19 + 10; long long r = n / (x + 1); long long h = k - x; long long d = m / (h + 1); return r * d; } void xuli() { if (n - 1 + m - 1 ...
#include <bits/stdc++.h> using namespace std; const long long N = 2e5 + 5; long long n, k, sum, l, x, m, i, a, b[N]; vector<long long> ans; int main() { cin >> n; if (n == 1) { cin >> a; cout << a; return 0; } for (long long i = 0; i < n; i++) { cin >> a; b[i] = a...
#include <bits/stdc++.h> using namespace std; int main() { char str[200005]; gets(str); vector<char> v; if (strlen(str) > 1) { v.push_back(str[0]); v.push_back(str[1]); } else { cout << str; return 0; } int l = strlen(str); int len; for (int i = 2; i < l; ...
#include <bits/stdc++.h> using namespace std; int a[100500]; int v[100500]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; v[0] = -1; int ans = 0; for (int i = 0; i < n; i++) { int l = 0, r = ans + 1; while (r - l > 1) { int j = (l + r) / 2; ...
#include <bits/stdc++.h> using namespace std; int a[1500004]; int main() { int t, c; string s; cin >> t; for (int l = 0; l < t; l++) { cin >> s; c = 0; for (int i = 0; i < s.size(); i++) { if (s[i] == o && s[i + 1] == n && s[i + 2] == e \|\| s[i - 1] == t...
#include <bits/stdc++.h> using namespace std; template <class T> T sq(T n) { return n * n; } template <class T> T gcd(T a, T b) { return (b != 0 ? gcd<T>(b, a % b) : a); } template <class T> T lcm(T a, T b) { return (a / gcd<T>(a, b) * b); } template <class T> T power(T N, T P) { ...
#include <bits/stdc++.h> using namespace std; long long n, m; long long a[10001], f[10001]; int main() { int d, x, y; scanf( %I64d %I64d , &n, &m); f[0] = f[1] = 1; for (int i = 2; i <= n; i++) f[i] = f[i - 1] + f[i - 2], f[i] %= 1000000000LL; for (int i = 1; i <= n; i++) scanf( %I64d , &a[i...
#include <bits/stdc++.h> FILE in = stdin, out = stdout; using namespace std; int n; vector<int> son[5005]; int tot; vector<int> edge[5005]; int dy[5005][2][5005]; int leaf[5005]; int visit[5005]; void input() { fscanf(in, %d , &n); for (int i = (1); i <= (n - 1); i++) { int x, y; ...

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

#include<bits/stdc++.h> #define pb push_back #define x first #define y second #define all(a) (a).begin(), (a).end() using namespace std; typedef long long ll; typedef pair<int, int> ii; const int maxn = 3e5 + 5; int n, m, X; ll A[maxn]; int par[maxn]; set<pair<ll, ii>> adj[maxn]; ...

#include <bits/stdc++.h> using namespace std; const int maxn = 200100; struct seat { int w, id; bool operator<(const seat& st) const { return w < st.w; } bool operator>(const seat& st) const { return w > st.w; } }; seat st[maxn]; int n; char tp[maxn * 2]; int main() { while (scanf( %d , ...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 9; int arr[maxn]; int vis[maxn]; int n; int mu; long long re[111]; long long gcd(long long a, long long b) { long long c = 1; while (b) { c = a % b; a = b; b = c; } return a; } int sol(int a) { ...

#include <bits/stdc++.h> using namespace std; long long int ar[500009], br[500009]; int main() { long long int a, b, c, i, j = 999999999999, k, e, f, g, w, h, i1, j1; string s, d; cin >> a >> b >> c; e = a; c = c * 5; j = a; for (i = 1;; i++) { a = e; if (a - (i * b) < 0) {...

#include <bits/stdc++.h> using namespace std; template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << ; cerr << endl; } int main() { for (long long N, M; cin >> N >> M;) { for (int i = 0; i < (int)(N); ++i) { long long S, F, T; cin >> S >> F >> T; ...

#include <bits/stdc++.h> using namespace std; int a[300001], d[300001]; long long b[300001], c[300001]; map<int, int> mp; int main() { int n, i, l, r, j, k; long long s, _s; for (scanf( %d , &n), i = 1; i <= n; i++) { scanf( %d , &a[i]); b[i] = b[i - 1] + a[i]; c[i] = c[i - 1] + ...

#include <bits/stdc++.h> using namespace std; vector<int> x_coord, y_coord; vector<vector<int>> adj; vector<bool> used; int n; void dfs(int v) { used[v] = true; for (auto u : adj[v]) { if (!used[u]) { used[u] = true; dfs(u); } } } int main() { scanf( %d , &n);...

#include <bits/stdc++.h> using namespace std; const double eps = 1e-8; const int mod = 1e9 + 7; const int N = 1e6 + 10; const int inf = 1e9; int t, n, a[N], b[N]; int gao(int x) { int res = b[1] - x; for (int i = 2; i <= n; i++) { res = b[i] - max(a[i] - res, 0); if (res < 0) return -1...

#include <bits/stdc++.h> using namespace std; int n, mini = 0, maxi = 0; int x[200005]; bool o[200005]; int main() { cin >> n; for (int i = 0; i < (n); i++) { int a; cin >> a; x[a]++; } for (int i = 0; i < (n + 1); i++) { while (i < n + 1 && x[i] == 0) i++; if (i ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; char ar[n]; for (int i = 0; i < n; ++i) { cin >> ar[i]; } int co = 0; vector<int> po; for (int i = 0; i < n - 1; ++i) { if (ar[i] == W ) {...

#include <bits/stdc++.h> using namespace std; inline void fast() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } const long long int mod = 1e9 + 7; long long int pmod(long long int x, long long int n) { long long int r = 1; while (n) { if (n & 1LL) r = (r * x) % mod; ...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; if (n <= 2) cout << -1; if (n == 3) cout << 210; if (n >= 4) { string s = 1 ; int sign; int z = 0; if (n % 3 == 0) z = 100; if (n % 3 == 1) z = 1; if (n % 3 == 2) z = 10; if (((...

#include <bits/stdc++.h> using namespace std; const long long mod = 998244353; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; long long k; cin >> n >> k; if (!k) { cout << 0 n ; return 0; } vector<int> h(n); for (int i = 0; i < n; i++...

#include <bits/stdc++.h> using namespace std; int main() { int n, k, x, i, p; char y; string ch = ; cin >> n >> k; for (i = 0; i < k; i++) { p = 97 + i; y = (char)p; ch += y; } if (n == k) cout << ch; else { x = n - k; i = 0; while (x--) { ...

#include <bits/stdc++.h> using namespace std; mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count()); const long long inf = 1e15 + 7; bool check(long long n) { return __builtin_popcount(n + 1) == 1; } vector<long long> res; bool solve(long long n, long long k, long long par) { if (...

#include <bits/stdc++.h> using namespace std; int n, m, a[1001], x; int main() { scanf( %d %d , &n, &m); for (int i = 1; i <= m; i++) { scanf( %d , &x); a[x]++; } sort(a + 1, a + n + 1); printf( %d n , a[1]); return 0; }

#include <bits/stdc++.h> using namespace std; long long int binary_exp(long long int a, long long int n) { long long int i = 1; while (n > 0) { if (n % 2 == 1) i = (i * a) % 1000000007; a = (a * a) % 1000000007; n /= 2; } return i; } long long int IsPrime(long long int n) { ...

#include <bits/stdc++.h> using namespace std; const long long int N = 3e5 + 5, inf = 1e9 + 7; long long int bigmod(long long int b, long long int p, long long int m) { long long int rt = 1; while (p) { if (p & 1) rt = (rt * b) % m; b = (b * b) % m; p >>= 1; } return rt; } int...

#include <bits/stdc++.h> using namespace std; long long rdtsc() { long long tmp; asm( rdtsc : =A (tmp)); return tmp; } inline int myrand() { return abs((rand() << 15) ^ rand()); } inline int rnd(int x) { return myrand() % x; } const int INF = (int)1e9 + 1; const long double EPS = 1e-9; voi...

#include <bits/stdc++.h> int main() { int a[6]; for (int i = 0; i < 6; i++) scanf( %d , &a[i]); int tot = a[0] + a[1] + a[2]; int ans = tot * tot - a[0] * a[0] - a[2] * a[2] - a[4] * a[4]; printf( %d n , ans); }

#include <bits/stdc++.h> using namespace std; const unsigned long long hash1 = 201326611; const unsigned long long hash2 = 50331653; const int N = 200000 + 10; const int M = 20; vector<int> g[N]; int n, vis[N]; int main() { ios::sync_with_stdio(false); cin.tie(0), cout.tie(0); cin >> n; ...

#include <bits/stdc++.h> using namespace std; int n, root; int val[100000], maxl[100000], maxr[100000]; vector<int> fo[100000]; void dfs(int vr) { if (fo[vr].size() == 0) { maxl[vr] = maxr[vr] = val[vr]; return; } dfs(fo[vr][0]); dfs(fo[vr][1]); maxl[vr] = maxl[fo[vr][0]]; ...

#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; inline void umax(long long &a, long long b) { a = max(a, b); } inline void umin(long long &a, long long b) { a = min(a, b); } inline pair<long long, long long> rv(pair<long long, long long> a) { return make_pair(a.second, a.first); ...

#include <bits/stdc++.h> using namespace std; int main() { long long int n, t; cin >> n >> t; string s; cin >> s; char temp; while (t--) { for (int i = 0; i < n - 1; i++) { if (s[i] != s[i + 1] && s[i] == B ) { temp = s[i + 1]; s[i + 1] = s[i]; s[...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, m; cin >> n >> m; vector<string> g(n); for (int i = 0; i < n; i++) cin >> g[i]; auto flip = [&](int i, int...

#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); const long long maxn = 3e6; const long long mod = 1e9 + 7; const long double PI = acos((long double)-1); long long pw(long long a, long long b, long long md = mod) { long long res = 1; ...

#include <bits/stdc++.h> using namespace std; vector<int> dx = {-1, 0, 0, 1}; vector<int> dy = {0, -1, 1, 0}; const int Mod = (int)((int)1e9 + 7); void solve() { int n, k; cin >> n >> k; vector<int> a(n); int ans = 0; for (int i = 0; i < n; i++) { cin >> a[i]; } sort(a.begin(...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int game[2]; int m, c; m = c = 0; for (int i = 0; i < n; i++) { cin >> game[0] >> game[1]; if (game[0] > game[1]) { m++; } else if (game[0] < game[1]) { c++; } } if (m ...

#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10; int nxt[N]; map<int, vector<int>> w; int extendA[N], extendB[N], l[N], r[N]; char s[N], t[N]; int n, m, k; void pre_EKMP(char x[], int m, int nxt[]) { nxt[0] = m; int j = 0; while (j + 1 < m && x[j] == x[j + 1]) j++; n...

#include <bits/stdc++.h> using namespace std; int n; int b[3100]; int a[3100]; int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %d , &b[i]); int bb = b[i] - b[i - 1], l; if (bb > 0) { youginzi: l = 1; while (bb) { while (a[l] == 9) l...

#include <bits/stdc++.h> using namespace std; inline void read(int &x) { int v = 0, f = 1; char c = getchar(); while (!isdigit(c) && c != - ) c = getchar(); if (c == - ) f = -1; else v = (c & 15); while (isdigit(c = getchar())) v = (v << 1) + (v << 3) + (c & 15); x = v * f;...

#include <bits/stdc++.h> using namespace std; const double pi = acos(-1.0); int main() { int t; scanf( %d , &t); while (t--) { int n; scanf( %d , &n); long k; scanf( %ld , &k); int d; scanf( %d , &d); long arr[n]; for (int i = 0; i < n; i++) { ci...

#include <bits/stdc++.h> using namespace std; int main() { int T; cin >> T; while (T--) { long long a, b, n, m; scanf( %lld%lld%lld%lld , &a, &b, &n, &m); if (a < m || b < m) { printf( No n ); continue; } if ((a + b) < (m + n)) { printf( No n ); ...

#include <bits/stdc++.h> using namespace std; const int N = 1e4 + 10; char scn[N][2]; int l, x, mem; string s; int main() { l = 1; x = 25; cin >> s; for (int i = 1; i <= 10000; i++) { scn[i][1] = . ; } mem = 0; l = 1; for (int i = 0; i < s.size(); i++) { while (m...

#include <bits/stdc++.h> using namespace std; int t; int n, r; int main() { scanf( %d , &t); while (t--) { scanf( %d %d , &n, &r); r--; int sum = 0; for (int i = 0; i < n - 1; i++) { int a; scanf( %d , &a); a--; sum = (sum + a) % n; } i...

#include <bits/stdc++.h> using namespace std; int i, j, k, l, n, m, s; int a[1000], b[1000]; int main() { cin >> n >> m; for (i = 1; i <= n; i++) { cin >> l; a[l]++; } for (i = 1; i <= 110; i++) { s = 0; for (j = i; j <= i + m; j++) s = s + a[j]; k = max(k, s); ...

#include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 7; const int N = 1e5 + 5; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; long long int n; cin >> n; long long int brstr = 0; brstr += (n - 3) * (n - 4); brstr += 3 * (n - 3); cout <<...

#include <bits/stdc++.h> using namespace std; vector<long long> seive() { long long n = 2; vector<long long> pr(200000, -1); for (int i = n; i < 200000; i++) { if (pr[i] == -1) pr[i] = 1; else continue; for (int j = 2 * i; j < 200000; j += i) pr[j] = 0; } return...

#include <bits/stdc++.h> using namespace std; const int N = 1e2 + 5, M = 2e4 + 5; int a[105], b[300]; int dp[105][M]; int main() { int t; cin >> t; while (t--) { memset(dp, 0, sizeof(dp)); int n, k, l; scanf( %d %d %d , &n, &k, &l); for (int i = 1; i <= n; i++) cin >> a[i];...

#include <bits/stdc++.h> using namespace std; int a[24], n, Z[24]; bool DP[24][(1 << 23) + 5]; vector<int> X; map<int, int> Memo; int main() { std: ios::sync_with_stdio(false); cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; Memo[a[i]] = i + 1; } Z[0] = 1; DP[0][0]...

#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; int v = 3 - n % 3, ans = 0; for (int i = v;; i += 3) { if (1LL * i * (i + 1) / 2 > (n + i) / 3) break; ++ans; } cout << ans; return 0; }

#include <bits/stdc++.h> const int mod = 1e9 + 7, maxn = 1e6, maxm = 6; int n, a[maxn], b[maxn], c[maxn], g[maxn], pw2[maxn], pw10[maxm]; long long ans; int main() { scanf( %d , &n); while (n--) { int x; scanf( %d , &x); ++a[x]; (b[x] += x) %= mod; c[x] = (1ll * x * x + c[x...

/* -> Written by <- ----------- |K_A_Z_A_M_A| |___________| | ___ | | (^_^) | | /( | ) | |____|_|____| H O A N G */ #include <bits/stdc++.h> #define Task running #define F first #define S second #define pb ...

#include <bits/stdc++.h> using namespace std; long long int min(long long int a, long long int b) { return a < b ? a : b; } int getMedian(int ai[100001], int n) { map<int, int> m; for (int i = 0; i < n; i++) { if (m.find(ai[i]) != m.end()) { m[ai[i]] = m[ai[i]] + 1; } else m[ai...

#include <bits/stdc++.h> using namespace std; int main() { int v, e; cin >> v >> e; vector<set<int> > g(v); int a, b; for (int i = 0; i < e; i++) { cin >> a >> b; g[a - 1].insert(b - 1); g[b - 1].insert(a - 1); } int ans = 0; while (1) { vector<int> ve; ...

#include <bits/stdc++.h> using namespace std; int A[100010]; int B[100010]; int C[100010]; int main() { int n; scanf( %d , &n); int m, k; scanf( %d%d , &m, &k); for (int i = 0; i < m; i++) { scanf( %d%d%d , A + i, B + i, C + i); } long long sum = 0; for (int i = 0; i < k;...

#include <bits/stdc++.h> using namespace std; int main() { int n, temp, sum = 0; cin >> n; int arr[n]; memset(arr, 0, sizeof(arr)); for (int i = 0; i < n; i++) { cin >> arr[i]; sum += arr[i]; if (i == 0) temp = arr[0]; else if (arr[i] > temp) temp = arr[i]...

#include <bits/stdc++.h> using namespace std; const int MAXN = 10000; const int MAXM = 100000; const int INF = 0x3f3f3f3f; pair<int, int> nxt[3][3]; int cot[3][3]; map<pair<int, int>, pair<long long, long long> > ma; int main() { long long k; int a, b; scanf( %I64d%d%d , &k, &a, &b); a--...

#include <bits/stdc++.h> using namespace std; template <class T> inline T GCD(T a, T b) { return b ? GCD(b, a % b) : a; } template <class T> inline T LCM(T a, T b) { if (a < 0) return LCM(-a, b); if (b < 0) return LCM(a, -b); return a * (b / GCD(a, b)); } int main() { int n, s; c...

#include <bits/stdc++.h> using namespace std; const int MAXN = 1000100; int bit[MAXN]; int main() { ios::sync_with_stdio(false); int n; cin >> n; for (int i = 0; i < n; ++i) { int w; cin >> w; bit[w]++; } int step = 0; for (int i = 0; i < MAXN - 1; ++i) { bit[...

#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10, mod = 1e9 + 7; int ans[N], a[N]; vector<pair<int, int> > v; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, m; cin >> n >> m; long long sum = 0; for (int i = 0; i < m; i++) { ...

#include <bits/stdc++.h> using namespace std; const long long maxn = 1e5 + 5; const long long mod = 1e9 + 7; const double eps = 1e-9; const double pi = acos(-1.0); const long long inf = 0x3f3f3f3f; long long n, m; long long a[maxn]; long long s1[maxn], s2[maxn]; long long sum1[maxn], sum2[maxn]; i...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( avx,avx2,fma ) #pragma GCC optimization( unroll-loops ) using namespace std; void solve() { long long n; cin >> n; vector<long long> a(n); for (auto &x : a) cin >> x; if (*min_element(a.begin(), a.end()) == 1) { ...

#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 10; set<int> s; int n, t; char a[maxn]; int pos; int main() { register int i, tail, g; scanf( %d%d , &n, &t); scanf( %s , a + 1); for (i = 1; i <= n; i++) if (a[i] == . ) { pos = i; break; } ...

#include <bits/stdc++.h> using namespace std; template <typename T, typename U> inline void smin(T &a, const U &b) { if (a > b) a = b; } template <typename T, typename U> inline void smax(T &a, const U &b) { if (a < b) a = b; } int a[2020]; struct Dinic { int V, E, src, tar; int head[2...

#include <bits/stdc++.h> using namespace std; const double eps = 0.000001; const long double pi = acos(-1); const int maxn = 1e7 + 9; const int mod = 1e9 + 7; const long long MOD = 1e18 + 9; const long long INF = 1e18 + 123; const int inf = 2e9 + 11; const int mxn = 1e6 + 9; const int N = 1e6 + 123;...

#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const int maxn = 100005; int a[maxn], lefts[maxn], rights[maxn]; int main() { int n, l, r, q1, q2; cin >> n >> l >> r >> q1 >> q2; memset(lefts, 0, sizeof(lefts)); memset(rights, 0, sizeof(rights)); for (int i = 0; i...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma ) #pragma GCC optimize( unroll-loops ) using namespace std; double eps = 1e-12; long long hcf(long long p, long long q) { if (p > q) return hcf(q, p); if (!p) return q; ...

#include <bits/stdc++.h> using namespace std; long long a[100005], b[100005]; const long long INF = 1000000009; int main() { int n, x, y; cin >> n >> x >> y; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n; i++) b[i] = INF; for (int i = 0; i < n; i++) for (int j = i - y;...

#include <bits/stdc++.h> using namespace std; int w1, h1, w2, h2, s; int main() { cin >> w1 >> h1 >> w2 >> h2; s = 2 * (h1 + h2 + w1 + 2); cout << s << endl; }

#include <bits/stdc++.h> int main() { int n, m, i, a; int f[105] = {0}; scanf( %d%d , &n, &m); while (m--) { scanf( %d , &a); for (i = a; i <= n; i++) if (f[i] == 0) f[i] = a; } for (i = 1; i < n; i++) printf( %d , f[i]); printf( %d n , f[n]); return 0; }

#include <bits/stdc++.h> using namespace std; string s, p; vector<int> a, b, x, y; int main() { cin >> s >> p; a.push_back(0); b.push_back(0); x.push_back(0); y.push_back(0); for (int i = 0; i < s.size(); i++) { a.push_back(a[a.size() - 1]); x.push_back(x[x.size() - 1]); ...

#include <bits/stdc++.h> using namespace std; const int N = 200005; const int mod = 1e9 + 7; const double eps = 1e-8; const double PI = acos(-1.0); int a[N], l[N], r[N], d[N], cha[N]; int m, n, k, t; bool check(int x) { if (!x) return true; for (int i = 0; i <= n + 1; i++) cha[i] = 0; int g ...

#include <bits/stdc++.h> using namespace std; int n, k, Count = 0, a[2005], Free[2005]; vector<int> V; int main() { cin >> n >> k; for (int i = 1; i <= n; i++) { cin >> a[i]; if (a[i] <= k) Free[a[i]]++; else V.push_back(i); } for (int i = 1; i <= k; i++) ...

#include <bits/stdc++.h> using namespace std; const int N = 35; const int MOD = 1e9 + 7; long long n; int K, c, res; struct mat { int d[N][N]; mat() { memset(d, 0, sizeof d); } } F[N * 2][N], P[N * 2][N], Q[N * 2][N], G; int lst[N * 2]; mat operator*(mat a, mat b) { mat c; for (int i =...

#include <bits/stdc++.h> using namespace std; long long aabs(long long a) { if (a < 0) return -a; else return a; } struct node { long long num; int id; bool operator<(const node &a) const { return aabs(num) > aabs(a.num); } }; long long a[200005]; long long n, k, x; int m...

#include <bits/stdc++.h> struct Node { int d[10]; }; Node a[401][401]; char p[401][401]; int main() { int i, j, n, m, res; while (scanf( %d%d , &n, &m) != EOF) { res = 0; for (i = 0; i < n; i++) scanf( %s , p[i]); for (i = 0; i < n; i++) { for (j = 0; j < m; j++) { ...

#include <bits/stdc++.h> using namespace std; long long const N = 1e5 + 100, INF = 1ll * 1e9 * 1e9 + 100; long long n, m, s, t; long long h[N], d[N], dis[2][N], ans[N]; pair<pair<long long, long long>, long long> e[N]; vector<long long> f[N], g[N]; set<pair<long long, long long> > st; bool vis[N]; voi...

#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, d; cin >> a >> b >> c >> d; if (abs(a + c - b - d) > 1) { cout << NO n ; } else { vector<int> v(a + b + c + d); if (a + c > b + d) { for (int i = 0; i < v.size(); i += 2) { if (a) { ...

#include <bits/stdc++.h> const int N = 200005; int n, m, b[N]; char a[N], A[N]; int main() { scanf( %d%d%s , &n, &m, a); memset(b, 0x3f, sizeof(b)); for (int i = 0; i < n; i++) { int l = (i - 1 + n) % n, r = (i + 1) % n; if (a[i] == a[r]) { for (int j = l, k = 1; a[j...

#include <bits/stdc++.h> using namespace std; string S; vector<vector<vector<int> > > cc; int dp(int idx, int d, int s) { int &ret = cc[idx][d][s]; if (ret != -1) return ret; if (idx == S.size() / 2) { if (S.size() % 2) { int x = S[idx] - 0 ; if ((10 * d + x - s) < 0 || (x - s...

#include <bits/stdc++.h> using namespace std; const int N = 100105; const double eps = 1e-6; long double x1, y1_, x2, y2, mx, my, vx, vy, d, L, ans = 1e16; vector<pair<long double, int> > V; int X[N], Y[N], R[N], n, s = 0; long double check(int k, long double t, int op) { return ((sqrt(d * d + t * t) ...

#include <bits/stdc++.h> using namespace std; const int inf = 1 << 30; const double eps = 1e-8; const double pi = acos(-1.0); int n, m; char a[110], b[110], c[110]; int d[26]; int main() { srand(time(NULL)); scanf( %d%d%s%s , &n, &m, a, b); int la = strlen(a), lb = strlen(b); int flag = ...

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

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> p(n / 2); for (int i = 0; i < n / 2; i++) { cin >> p[i]; } sort(p.begin(), p.end()); int sum1 = 0, sum2 = 0; for (int i = 0; i < n / 2; i++) { sum1 += abs(p[i] - i * 2 - 1); sum2...

#include <bits/stdc++.h> using namespace std; int gi() { int x = 0, c = getchar(); bool f = 0; for (; !isdigit(c); c = getchar()) if (c == - ) f = 1; for (; isdigit(c); c = getchar()) x = x * 10 + (c & 15); return f ? -x : x; } const int N = 300005; const int mod = 998244353; int ...

#include <bits/stdc++.h> using namespace std; int min(int a, int b) { return a < b ? a : b; } long long max(long long a, long long b) { return a > b ? a : b; } int read() { int x = 0, w = 1; char ch = getchar(); while (ch > 9 || ch < 0 ) { if (ch == - ) w = -1; ch = getchar(); } ...

#include <bits/stdc++.h> using namespace std; long long int c[1005][1005], quadratic = 0, single_x = 0, single_y = 0, cnstnt = 0; void calc_time_function(long long int n, long long int m) { long long int i, j, centr_x, centr_y; for (i = 0; i < n; i++) { for (j = 0; j <...

#include <bits/stdc++.h> using namespace std; const long long MOD = 1000000000 + 7; const long long MOD1 = 998244353; long long mod(long long x) { return (x % MOD + MOD) % MOD; } long long mul(long long a, long long b) { return mod(mod(a) * mod(b)); } string itos(long long s) { string str = to_string(s)...

#include <bits/stdc++.h> typedef long long ll; typedef unsigned long long ull; typedef long double ld; using namespace std; const int INF = 1e9 + 5; void failure () { cout << 0 << endl; exit(0); } namespace Lib { #define ran(i, a, b) for (auto i = (a); i < (b); i++) str...

#include <bits/stdc++.h> const int INFI = (1 << 29); const long long INFL = (1LL << 62); using namespace std; void solve() { long long a, n, m; cin >> a >> n >> m; bitset<2010> rain; vector<long long> v(m + 1); vector<pair<long long, long long> > umb(a + 1, {INFL, 0}); for (long long i =...

#include <bits/stdc++.h> using namespace std; int c1, c2, c3, c4, n, m, bus[1009], tre[1009], x, z1, z, l, l1, y; int main() { cin >> c1 >> c2 >> c3 >> c4; cin >> n >> m; for (int i = 1; i <= n; i++) { cin >> bus[i]; if (l == 0) { if (x + bus[i] * c1 < x + c2) x += bus[i]...

#include <bits/stdc++.h> using namespace std; vector<long long> tree[1 << 20]; long long a[1 << 20], goal[1 << 20]; vector<long long> ans; void dfs(long long v, long long cnt1 = 0, long long cnt2 = 0, long long par = -1) { for (long long i = 0; i < cnt1; i++) { a[v] = !a[v]; } if ...

#include <bits/stdc++.h> using namespace std; int n, m; int ara[100005]; int pri[100005]; vector<int> jog[2 * 100005], biyog[2 * 100005]; map<pair<int, int>, int> dp1, dp2; int cnt1(int x, int y) { if (y == m + 1) return x; if (dp1.find({x, y}) != dp1.end()) return dp1[{x, y}]; int val = x - y...

#include <bits/stdc++.h> using namespace std; const int N = 1e6, inf = 1e9 + 2; pair<int, int> a[N + 2], b[N + 2], aa[N + 2], bb[N + 2]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, c, d; cin >> n >> c >> d; int p = 0, q = 0; for (int i = 1; i <= n; i++) { int x, y...

#include <bits/stdc++.h> using namespace std; char mp[5500][5500]; int sum[5500][5500]; const int INF = 0x3f3f3f3f; int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 1; i <= n; ++i) scanf( %s , mp[i] + 1); for (int i = 1; i <= n; ++i) { int tot = 0; for (int j = 1; j <= m;...

#include <bits/stdc++.h> using namespace std; vector<int> g[5000]; vector<int> r[5000]; vector<int8_t> vis(5000); int n, m, s; void dfs(int src) { vis[src] = true; for (auto v : g[src]) { if (!vis[v]) { dfs(v); } } } int root(int src, vector<bool> &df) { df[src] = tru...

#include <bits/stdc++.h> int main() { int n; scanf( %d , &n); if (n % 5 == 0) printf( %d , n / 5); else printf( %d , (n / 5) + 1); return 0; }

#include <bits/stdc++.h> using namespace std; const int maxn = 100005; const long long inf = 0x3f3f3f3f3f3f; long long a[3][maxn], dp[3][maxn]; int main() { std::ios::sync_with_stdio(false); std::cin.tie(0); int n; cin >> n; for (int j = (1); j < (3); j++) for (int i = (1); i < (n + ...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; int a[N], b[N], len; bool vis[N]; int xx(int x) { if (x & 1) return x / 2; else return x / 2 - 1; } int main() { int t; cin >> t; while (t--) { len = 0; memset(vis, 0, sizeof vis); int n...

#include <bits/stdc++.h> using namespace std; template <typename T> inline T sqr(T t) { return t * t; } inline void files() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } int n, a[100100]; int main() { files(); int l = 0, r = 0; int ans = 0; cin >> n; for ...

#include <bits/stdc++.h> using namespace std; long long n, m, k; void nhap() { cin >> n >> m >> k; } long long tinh(long long x) { if (x > k) return -1e19 + 10; long long r = n / (x + 1); long long h = k - x; long long d = m / (h + 1); return r * d; } void xuli() { if (n - 1 + m - 1 ...

#include <bits/stdc++.h> using namespace std; const long long N = 2e5 + 5; long long n, k, sum, l, x, m, i, a, b[N]; vector<long long> ans; int main() { cin >> n; if (n == 1) { cin >> a; cout << a; return 0; } for (long long i = 0; i < n; i++) { cin >> a; b[i] = a...

#include <bits/stdc++.h> using namespace std; int main() { char str[200005]; gets(str); vector<char> v; if (strlen(str) > 1) { v.push_back(str[0]); v.push_back(str[1]); } else { cout << str; return 0; } int l = strlen(str); int len; for (int i = 2; i < l; ...

#include <bits/stdc++.h> using namespace std; int a[100500]; int v[100500]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; v[0] = -1; int ans = 0; for (int i = 0; i < n; i++) { int l = 0, r = ans + 1; while (r - l > 1) { int j = (l + r) / 2; ...

#include <bits/stdc++.h> using namespace std; int a[1500004]; int main() { int t, c; string s; cin >> t; for (int l = 0; l < t; l++) { cin >> s; c = 0; for (int i = 0; i < s.size(); i++) { if (s[i] == o && s[i + 1] == n && s[i + 2] == e || s[i - 1] == t...

#include <bits/stdc++.h> using namespace std; template <class T> T sq(T n) { return n * n; } template <class T> T gcd(T a, T b) { return (b != 0 ? gcd<T>(b, a % b) : a); } template <class T> T lcm(T a, T b) { return (a / gcd<T>(a, b) * b); } template <class T> T power(T N, T P) { ...

#include <bits/stdc++.h> using namespace std; long long n, m; long long a[10001], f[10001]; int main() { int d, x, y; scanf( %I64d %I64d , &n, &m); f[0] = f[1] = 1; for (int i = 2; i <= n; i++) f[i] = f[i - 1] + f[i - 2], f[i] %= 1000000000LL; for (int i = 1; i <= n; i++) scanf( %I64d , &a[i...

#include <bits/stdc++.h> FILE *in = stdin, *out = stdout; using namespace std; int n; vector<int> son[5005]; int tot; vector<int> edge[5005]; int dy[5005][2][5005]; int leaf[5005]; int visit[5005]; void input() { fscanf(in, %d , &n); for (int i = (1); i <= (n - 1); i++) { int x, y; ...