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; long long t, d, ct, q, ans, l, m, r, n, mx, mn, i, j, k, x, y, z, s; char ch; string ss = , str = ; long long a[200003], b[200003]; long long pref[200003]; int main() { ios_base::sync_with_stdio(false), cin.tie(nullptr); s = k = d = l = mx = m = mn...
#include <bits/stdc++.h> using namespace std; long long maps[105][105]; int main() { long long a, b, c, d, i, j, k, l, t, n, m; scanf( %lld , &t); while (t--) { scanf( %lld , &a); for (i = 2; i * i <= a; i++) { if (a % i) { b = a % i; c = a - b; break;...
#include <bits/stdc++.h> int main() { int64_t n; std::cin >> n; int64_t total(0), smallestOdd(0); while (n--) { int64_t x; std::cin >> x; total += x; if ((x % 2) && (smallestOdd == 0 \|\| x < smallestOdd)) { smallestOdd = x; } } if (total % 2) { total ...
#include <bits/stdc++.h> using namespace std; const long double pi = acos(-1.0); long long int inf = 0x3f3f3f3f3f3f3f3f; const long long int mod = 1e9 + 7; const long long int mx = 5 * 1000000; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int t; cin >> t; w...
#include <bits/stdc++.h> using namespace std; vector<long long> D0, D1; vector<vector<pair<long long, long long> > > G; bool comp(pair<long long, long long> a, pair<long long, long long> b) { return a.second - a.first > b.second - b.first; } void dfs(int x, int k, int p = -1) { vector<pair<long long...
#include <bits/stdc++.h> using namespace std; struct line { long long int a, b, c; }; int main() { long long int x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2; long long int n; cin >> n; vector<line> data(n); for (auto &p : data) { cin >> p.a >> p.b >> p.c; } vector<bool>...
#include <bits/stdc++.h> using namespace std; long long n, m, k; long long a[100005]; bool moze(long long x) { long long st[100005]; long long curr = 0; for (long long i = 0; i < n; i++) { long long t = x - a[i]; if (t < 0) t = 0; if (i >= k) curr -= st[i - k]; st[i] = t - cu...
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const long long INF = 1e18; const int MAXN = 2e5 + 5; const int MAXM = 9e4 + 500; const int N = 300 + 10; const double EPS = 1e-5; int i, j, d; int n, k, m, p; int a[N][N], dp[2][N][N], last[N][N]; vector<pair<int, int> > grid[...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:1024000000,1024000000 ) using namespace std; struct edge { int v, next; } e[200010]; int ecnt = 0, head[100010]; int n; int d[100010]; int leg[100010]; void addedge(int a, int b) { e[++ecnt].v = b; e[ecnt].next = head[a]; head[a]...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 9; int n, a[N]; struct pp { int val, id; } p[N]; bool cmp(pp x, pp y) { return x.val < y.val; } int f[N], siz[N], vis[N]; int find(int x) { return x == f[x] ? x : (f[x] = find(f[x])); } bool merge(int u, int v) { if (!vis[u] \|\| ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 5; template <typename T> void chkmax(T &x, T y) { x = max(x, y); } template <typename T> void chkmin(T &x, T y) { x = min(x, y); } template <typename T> void read(T &x) { x = 0; int f = 1; char c = getchar(); ...
#include <bits/stdc++.h> using namespace std; const int maxn = 250005; int n, m, k, dep[maxn], fa[maxn]; bool leaf[maxn], vis[maxn]; vector<int> e[maxn]; void dfs(int p) { leaf[p] = vis[p] = 1; for (int i = 0, v; i < e[p].size(); ++i) { if (vis[v = e[p][i]]) continue; leaf[p] = 0; ...
#include <bits/stdc++.h> using namespace std; using i64 = long long; const int N = 2e5 + 5; struct Nod { i64 sum; int max_pos, max_pos2; }; Nod pom[N * 4]; int v[N]; int n, q, update_pos, update_val, current_pos; i64 query_sum, peak_sum; static void pom_build(int nod, int l, int r) { if ...
#include <bits/stdc++.h> using namespace std; template <typename A, typename B> string to_string(pair<A, B> p); template <typename A, typename B, typename C> string to_string(tuple<A, B, C> p); template <typename A, typename B, typename C, typename D> string to_string(tuple<A, B, C, D> p); string to_str...
#include <bits/stdc++.h> using namespace std; const long long inf = 1e18; const long long mod = 1e9 + 7; long long ExtendedEuclid(long long a, long long b, long long &x, long long &y) { if (b == 0) { x = 1; y = 0; return a; } long long g = ExtendedEuclid(b, a % b, x, y); long l...
#include <bits/stdc++.h> using namespace std; #pragma GCC diagnostic ignored -Wmissing-declarations inline int safe_mul(const int x, const int y) __attribute__((warn_unused_result)); int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n, k; cin >> n >> k; int c = (n - k) /...
#include <bits/stdc++.h> using namespace std; const int N = 123456; const int mod = 1e9 + 7; class table { public: int id; int size; }; class group { public: int id; int size; int income; }; bool byIncome(const group &r1, const group &r2) { return r1.income > r2.income; }...
#include <bits/stdc++.h> using namespace std; int main() { int n, limak; cin >> n; int len = n - 1; cin >> limak; int array[n - 1]; for (int i = 0; i < len; i++) cin >> array[i]; sort(array, array + len); int cnt = 0; while (array[len - 1] >= limak) { cnt++; limak++; ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int tc; cin >> tc; while (tc--) { long long int n, k; cin >> n >> k; long long int a[n], m = INT_MIN; for (long long int i = 0; i < n; i++) { ...
#include <bits/stdc++.h> using namespace std; template <typename T1, typename T2> inline ostream& operator<<(ostream& os, const pair<T1, T2>& p) { return os << ( << p.first << , << p.se << ) ; } template <typename T1, typename T2> inline ostream& operator<<(ostream& os, const map<T1, T2>& c) { ...
#include <bits/stdc++.h> using namespace std; int main() { int n, m; scanf( %d , &n); scanf( %d , &m); int mat[n + 1][m + 1]; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { scanf( %d , &mat[i][j]); } } vector<int> dp(n + 1, 0); for (int j = 1; j <= ...
#include <bits/stdc++.h> using namespace std; inline int max(int a, int b) { return a > b ? a : b; } map<int, int> mp; int a[200005], id; inline int read(int x) { if (mp.count(x) > 0) return mp[x]; mp[x] = ++id; return id; } int main() { int n; scanf( %d , &n); int x; for (int ...
#include <bits/stdc++.h> using namespace std; int main() { string a, b; cin >> a >> b; int p = max(a.size(), b.size()); cout << (a == b ? -1 : p) << endl; }
#include <bits/stdc++.h> using namespace std; int main() { int a, b; cin >> a >> b; int ans = b / a; if (b % a) { cout << -1 << endl; return 0; } int cnt = 0; while (ans % 2 == 0) { ans = ans / 2; cnt++; } while (ans % 3 == 0) { ans = ans / 3; ...
#include <bits/stdc++.h> using namespace std; const int inf = 1e9; const int MOD = 1e9 + 7; const int N = 2e2 + 10, M = 1e6 + 10; const int alp = 10; vector<pair<int, int> > pos; pair<int, int> s[M]; int n, m, q, a[N][N], f[N][N], h[N][N], len[N][N], dx[10], dy[10], deg[N][N], g[M]; string str; ...
#include <bits/stdc++.h> using namespace std; int main() { int i, j, n, arr[26]; string s; memset(&arr, -1, sizeof(arr)); cin >> s; int l = s.length(); if (l < 26) { cout << -1; return 0; } i = 0; j = 0; while (j < l) { if (j - i == 26) break; if (s[j]...
#include <bits/stdc++.h> using namespace std; double a, v, l, d, w, ans, L, t1, t2, v_2; int main() { scanf( %lf%lf%lf%lf%lf , &a, &v, &l, &d, &w); L = l - d; double A = w * w; if (v <= w \|\| A >= 2 * a * d) { if (2 * a * l >= v * v) { ans = v / a; ans += (l - v * v / 2 / a) /...
// shirley smokes weed #include <bits/stdc++.h> #define sz(v) ((int)(v).size()) #define all(v) (v).begin(), (v).end() using namespace std; using lint = long long; using pi = pair<int, int>; const int MAXN = 400; int n, m, s[MAXN], e[MAXN], x[MAXN]; int dp[1 << 18], indep[1 << 18], w[1 << 18], tk[1 ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long int n; cin >> n; string s; cin >> s; long long int p = 0, q = 0, t = 0, r = 0, l = 0; for (long long int i = 0; s[i] != 0 ; i++) { if (s[i] ==...
#include <bits/stdc++.h> using namespace std; int N, M; char A[2020][2020]; int B[2020][2020]; int D[2020][2020]; queue<int> qx; queue<int> qy; int dx[4] = {1, 0, -1, 0}; int dy[4] = {0, 1, 0, -1}; long long ans; int main() { scanf( %d%d , &N, &M); for (int i = 1; i <= N; i++) { scan...
#include <bits/stdc++.h> using namespace std; vector<vector<int> > lang(105); vector<vector<int> > emp(105); vector<int> visited(105, false); int n, m; void dfs(int i) { if (!visited[i]) { visited[i] = true; int n_lang = emp[i].size(); for (int k = 0; k < n_lang; k++) { int lg ...
#include <bits/stdc++.h> using namespace std; const int N = 505; int x[N]; int n, m; int main() { cin >> n >> m; for (int i = 0; i < n; i++) cin >> x[i]; double ret = 0; while (m--) { int u, v, c; cin >> u >> v >> c; u--, v--; ret = max(1.0 * (x[u] + x[v]) / c, ret); ...
#include <bits/stdc++.h> using namespace std; int n, a[205], cnt[105], used[105], ans[205], sz[3]; int push(int x) { if (x) { sz[x]++; return x; } else if (sz[1] < sz[2]) { sz[1]++; return 1; } else { sz[2]++; return 2; } } int main() { cin >> n; for...
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 5; int A[maxn][2]; bool vis[maxn]; vector<int> v[maxn]; int main() { int T; cin >> T; while (T--) { int n; cin >> n; for (int i = 1; i <= n; i++) { v[i].clear(); } for (int i = 1; i <= n; i...
#include <bits/stdc++.h> using namespace std; int parent[100010]; int Rank[100010]; int cnt; int st[100010]; int st_cnt = 0; void rollback(int id) { if (id < 0) Rank[-id - 1]--; else { parent[id] = id; cnt++; } } int find(int cur) { if (parent[cur] == cur) return cur;...
#include <bits/stdc++.h> using namespace std; namespace input { const int InputBufferSize = (1 << 24) + 5; char buffer[InputBufferSize], s, eof; inline void init() { assert(stdin != NULL); s = buffer; eof = s + fread(buffer, 1, InputBufferSize, stdin); } inline bool read(int& x) { x = 0;...
#include <bits/stdc++.h> using namespace std; const long long OO = (long long)1e9 + 7; using namespace std; long long inv(long long a, long long b) { return 1 < a ? b - inv(b % a, a) * b / a : 1; } long long Pow(long long B, long long P) { long long R = 1; while (P > 0) { if (P & 1) R = (R...
#include <bits/stdc++.h> int main() { int n, m, i, j, s; char a[12][11]; scanf( %d%d , &n, &m); for (i = 0; i < n; i++) scanf( %s , a[i]); s = 0; for (i = 0; i < n; i++) for (j = 0; j < m; j++) if (a[i][j] == W ) { if (a[i - 1][j] == P ) { s++; ...
#include <bits/stdc++.h> using namespace std; vector<pair<int, pair<int, int> > > V; const int maxn = 1010; int n, N; int a[maxn][maxn], r[maxn], c[maxn]; void sr(int x, int y) { if (x == y) return; V.push_back(make_pair(1, pair<int, int>(x, y))); for (int i = 1; i <= N; ++i) swap(a[x][i], a[y][...
#include <bits/stdc++.h> using namespace std; const int mxn = 100000; long long n, k; int a[2][mxn], first[mxn]; vector<pair<int, int> > v; void sol() { cout << k << n ; for (pair<int, int> i : v) cout << (i.first + 1) << << i.second << n ; exit(0); } void add(int x, int y) { if ...
#include <bits/stdc++.h> using namespace std; bool dbg = 0; int main() { int N, K; cin >> N >> K; long long Count = 0; int x, y; for (int n = 0; n < N; ++n) { scanf( %d%d , &x, &y); Count += (long long)(y - x + 1); } cout << (K - Count % K) % K << endl; return 0; }
#include <bits/stdc++.h> using namespace std; long long n, s, s1, m, k, sum = 0, l, r, a, a1, p; const int N = 1e5 + 1; int main() { int q; cin >> q; while (q--) { cin >> l >> r; if (l % 2) { if (r % 2) { p = (r / 2) - (l / 2) + 1; s = (l + r) * p; s...
#include <bits/stdc++.h> struct Swap { int i; int j; }; std::vector<Swap> swaps; void solve4(int a, int b, int c, int d, bool firstLast) { if (firstLast) swaps.push_back(Swap{a, b}); swaps.push_back(Swap{a, c}); swaps.push_back(Swap{b, d}); swaps.push_back(Swap{a, d}); swaps.push_bac...
#include <bits/stdc++.h> using namespace std; int n, m, k, res, xx, yy; int main() { scanf( %d%d%d , &n, &m, &k); while (k--) { scanf( %d%d , &xx, &yy); int mn = xx - 1; mn = min(mn, n - xx); mn = min(mn, yy - 1); mn = min(mn, m - yy); res = max(res, (int)(mn <= 4)); ...
#include <bits/stdc++.h> using namespace std; int N, ap[3009], dp[3009], how[3009]; char sir[3009]; bool cons(char c) { if (c == a \|\| c == e \|\| c == i \|\| c == o \|\| c == u ) return 0; return 1; } int main() { gets(sir + 1), N = strlen(sir + 1); dp[0] = 0; for (int i = 1; i <= N; ...
#include <bits/stdc++.h> using namespace std; char s[1000002]; int n, m, dp[3][22][1000002] = {0}, ml[100005], mr[100005]; int main(int argc, char **argv) { std::ios::sync_with_stdio(false); cin >> (s + 1); cin >> m; for (int i = 1; i <= m; i++) cin >> ml[i] >> mr[i]; n = strlen(s + 1); ...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; int n, m, a[N], p, q[5], nq[5]; long long f[N][10]; char s[N]; int main() { scanf( %d%d%s , &n, &m, s + 1); for (int i = 1; i <= n; i++) a[i] = s[i] - a + 1; for (int i = 1; i <= m; i++) { p = 1; if (i == a[1]) p...
#include <bits/stdc++.h> using namespace std; long long n, x, a[5005], uc, sum, mux = 0; vector<long long> myvec; int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= n; i++) { sum = 0; for (int j = i; j <= n; j++) { sum += a[j]; if ((j - ...
#include <bits/stdc++.h> using namespace std; int X; vector<int> E[100010]; int all, all2; int v[800 + 10]; int dp[800 + 10], dp2[800 + 10]; void calc(int x) { for (int i = 0; i <= 800 - 1; ++i) v[i] = 0; for (int i = 0; i < E[x].size(); ++i) v[E[x][i]] = 1; for (int i = 0; i <= 800 - 1; ++i) ...
#include <bits/stdc++.h> using namespace std; int N, K; void init() { scanf( %d%d , &N, &K); } void work() { if (K == 1 && N > 1) { printf( -1 ); return; } if (K == 1 && N == 1) { printf( a ); return; } if (N < K) { printf( -1 ); return; } if (N ==...
#include <bits/stdc++.h> using namespace std; long long p = 998244353; int gcd(int a, int b, int& x, int& y) { if (a == 1) { x = 1; y = 0; return 1; } if (b == 1) { x = 0; y = 1; return 1; } if (b == 0) { x = 1; y = 0; return a; } i...
#include <bits/stdc++.h> using namespace std; struct pp { long long nu, we; } c; struct Info { long long l, r, ta, nu; pp a; } a[1000010]; long long b[100010], n, ansn, m, l, r, opt, x, sum; pp mi(pp a, pp b) { if (a.nu < b.nu) return b; return a; } pp ga(long long nu, long long l,...
#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; long long MOD = 998244353; double eps = 1e-12; long long mpow(long long a, long long b) { if (a == 0) return 0; ...
#include <bits/stdc++.h> using namespace std; int main() { int t, m, num = 1; string com; int arg; vector<pair<pair<int, int>, int> > d; cin >> t >> m; for (int _n((t)-1), q(0); q <= _n; q++) { sort((d).begin(), (d).end()); cin >> com; if (com == defragment ) { if ...
#include <bits/stdc++.h> using namespace std; const int N = 100050; struct str { int pre[26], suf[26], mx[26], len; str() {} void Build(char s[], int n) { len = n; for (int i = 0; i < 26; i++) pre[i] = suf[i] = mx[i] = 0; int len = 0; for (int i = 1; i <= n; i++) { if (...
#include <bits/stdc++.h> using namespace std; const double PI = 2.0 * acos(0.0); const double EPS = 1e-6; int dp[100005]; static int topp; void LIS(int x) { if (topp == 0) dp[topp++] = x; else if (x > dp[topp - 1]) dp[topp++] = x; else { int left = 0, right = topp; while ...
#include <bits/stdc++.h> using namespace std; int n, k; long long a, b, sum, ans, summ; char s[100010]; long long powe(long long x, int r) { long long ret = 1; while (r) { if (r & 1) ret = (ret * x) % 1000000009; x = x * x % 1000000009; r >>= 1; } return ret; } int main()...
#include <bits/stdc++.h> using namespace std; vector<int> x[100100], y[100100]; vector<int> p[100100], q[100100], v[100100], w[100100]; int a[100100], b[100100], c[100100]; map<pair<int, int>, int> mp; void solve() { mp.clear(); int n, m; scanf( %d%d , &n, &m); for (int i = 0; i < m; i++) { ...
#include <bits/stdc++.h> using namespace std; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; long long n; cin >> n; string s, t; cin >> s >> t; long long sa = 0, sb = 0, ta = 0, tb = 0; for (long long i = 0; i < n; i++) { if (s[i] == a ) ...
#include <bits/stdc++.h> using namespace std; template <typename T> inline T abs(T a) { return ((a < 0) ? -a : a); } template <typename T> inline T sqr(T a) { return a * a; } const int INF = (int)1E9 + 7; const long double EPS = 1E-9; const long double PI = 3.1415926535897932384626433832795;...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( avx,avx2,fma ) #pragma GCC optimization( unroll-loops ) using namespace std; const long long MOD = 998244353; const long long INF = 0x7f7f7f7f7f7f7f7f; const int INFi = 0x7f7f7f7f; const long long N = 150001; vector<long long> ...
#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { while (b) { a %= b; swap(a, b); } return a; } int check(vector<int> v) { int k = 0; for (int i = 0; i < v.size(); ++i) k += (gcd(i + 1, v[i]) > 1); return k; } int main() { int n, k; cin >> n >>...
#include <bits/stdc++.h> using namespace std; int main() { long long n, m, i, j, k, x, y, z, t; long long hh, mm, h, d, c, N; cin >> hh >> mm; cin >> h >> d >> c >> N; if (hh >= 20) { double cc = 0.8 * c; k = (h + N - 1) / N; double ans = 1.0 * k * cc; cout << fixed << se...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 7; const long long MOD = 1e9 + 7; long long f[N << 2], lazy[N << 2], a[N], b[N], c[N]; void up(int x, int l, int r, long long y) { f[x] = (f[x] + y * (r - l + 1)) % MOD; lazy[x] = (lazy[x] + y) % MOD; } void push_down(int x, int l, ...
#include <bits/stdc++.h> using namespace std; long long const N = 2e5 + 20, MOD = 1e9 + 7; long long n, x, dp[N][2]; bool vis[N], col[N]; vector<long long> child[N]; void dfs(int v = 0) { for (auto u : child[v]) dfs(u); vector<long long> preChild, sufChild; preChild.push_back(1), sufChild.push_b...
#include <bits/stdc++.h> int n, t1, t2; int num = 0; int dfs(int l, int r) { int k = (l + r) / 2; num++; if (t1 <= k && t2 > k) { return num; } if (t1 <= k && t2 <= k) { return dfs(l, k); } else { return dfs(k, r); } } int FastLog2(int x) { float fx; unsig...
#include <bits/stdc++.h> using namespace std; int get(int n, int p) { int res = 0; while (n >= p) res += n / p, n /= p; return res; } template <class T> T power(T N, T P) { return (P == 0) ? 1 : N * power(N, P - 1); } void VC(vector<long long int>& v) { for (int i = 0; i < v.size(); i+...
#include <bits/stdc++.h> using namespace std; class Data { public: long long lazy, val; Data() { lazy = -1; val = 0; } }; long long pr = 107; long long c_pr[100010]; Data tree[4 * 100010]; long long ara[100010]; void updval(int node, int le_ran, int ri_ran, long long lazy) { ...
#include <bits/stdc++.h> using namespace std; int main() { int n, i, mx = 2, j; cin >> n; int a[n]; for (i = 0; i < n; i++) cin >> a[i]; if (n == 1) cout << 1 ; else if (n == 2) cout << 2 ; else { for (i = 2; i < n;) { int x = 0; for (j = i; j < n; j++...
#include <bits/stdc++.h> using namespace std; int n, top; long long N; struct str { int x1, y1, x2, y2; void print() { printf( %d %d %d %d n , x1, y1, x2, y2); } } ans[310]; void print(int x1, int y1, int x2, int y2) { if (x1 > n \|\| y1 > n \|\| x2 > n \|\| y2 > n) return; if (x1 < 1 \|\| y1 < 1 \|\|...
#include <bits/stdc++.h> using namespace std; const int N = 2e6 + 1; const int INF = 1e9 + 9; const int B = 1e9 + 7; int n, b[N], d[N]; long long a[N]; int main() { ios_base ::sync_with_stdio(0); cin.tie(0); cin >> n; int ans = n; for (int i = int(1); i <= int(n); ++i) { cin >> a...
#include <bits/stdc++.h> using namespace std; int main() { string s1, s2; cin >> s1 >> s2; int n = s1.length(), k = 0, s; for (int i = 0; i < n; i++) if (s1[i] != s2[i]) k++; if (k % 2 == 1) printf( impossible ); else { int s = k / 2; string ans; for (int i = 0;...
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const int MOD2 = 1e9 + 9; const int PR = 727; const int INF = INT_MAX; const long long LINF = LLONG_MAX; const int N = 1e5 + 20; vector<int> G[N], p; int n, m, k, f[N], tmp; bool visited[N]; int main() { ios::sync_with_stdi...
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( O3 ) #pragma GCC target( avx ) #pragma GCC optimize( Ofast ) #pragma GCC optimize( unroll-loops ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) long long int dx[] = {0, 1, 0, -1, -1, 1, -1, 1}; long long ...
#include <bits/stdc++.h> using namespace std; const int MAX = 500000; int a[MAX], last[MAX], prv[MAX], inSet[MAX], current[MAX]; int n, k; int main() { ios_base::sync_with_stdio(false); cin >> n >> k; memset(last, -1, sizeof(last)); memset(prv, -1, sizeof(prv)); for (int i = 0; i < n; i++)...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, k; cin >> n >> k; vector<int> v(n + 1, 0); for (int i = 1; i <= n; i++) { cin >> v[i]; } sort(v.begin() + 1, v.end()); v[0] = v[1]; aut...
#include <bits/stdc++.h> using namespace std; void solve() { long long int n, k; cin >> n >> k; if (k > n) cout << -1 << n ; else if (n != 1 && k == 1) cout << -1 << n ; else if (k == n) { char x = a ; for (long long int i = 1; i <= (long long int)n; i++) { c...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); int n, s, k, a[55], dp[55][2505]; cin >> n >> s >> k; for (int i = 0; i < n; i++) cin >> a[i]; string s1; cin >> s1; priority_queue<pair<int, pair<int, int> > > q; s--; for (int i = 0; i < 55...
#include <bits/stdc++.h> using namespace std; int main() { int x, cnt = 0; cin >> x; int arr1[x], arr2[x]; for (int i = 0; i < x; i++) { cin >> arr1[i] >> arr2[i]; } for (int i = 0; i < x; i++) { for (int j = 0; j < x; j++) { if (i == j) { continue; } ...
#include <bits/stdc++.h> using namespace std; void IO() { mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } int main() { IO(); int t; cin >> t; while (t--) { long long int n; cin >> n; l...
#include <bits/stdc++.h> using namespace std; int main(int argc, char** argv) { long long r, x1, y1, x2, y2; while (cin >> r >> x1 >> y1 >> x2 >> y2) { double dis = sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2) + 0.0); cout << ceil(dis / 2 / r) << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; using LL = long long; const int N = 400005; const int mod = 998244353; int n, m; int fact[N], infact[N]; int qmi(int a, int k, int p) { int res = 1; while (k) { if (k & 1) res = (LL)res * a % p; a = (LL)a * a % p; k >>= 1; } r...
#include <bits/stdc++.h> using namespace std; int main() { const int maxn = 1005; char a[2 * maxn], b[maxn]; scanf( %s , a); scanf( %s , b); int lenA = strlen(a); int lenB = strlen(b); int cntA = 0, cntB = 0; int i; for (i = 0; i < lenA; i++) if (a[i] == 1 ) cntA++; fo...
#include <bits/stdc++.h> using namespace std; const int H = 1000000; template <typename Key, typename Val> struct Hash { char used; Key key; Val *val; Hash() { used = new char[H]; key = new Key[H]; val = new Val[H]; memset(used, 0, sizeof(used)); } int hash_func...
#include <bits/stdc++.h> using namespace std; bool sortmd(pair<long long, long long> &a, pair<long long, long long> &b) { if (a.first != b.first) return a.first < b.first; else return a.second < b.second; } int main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); srand...
#include <bits/stdc++.h> const int MAX = (int)1e5 + 5; int a[MAX], b[MAX], n, m, c; int main() { scanf( %d%d%d , &n, &m, &c); for (int i = 1; i <= n; i++) scanf( %d , a + i); for (int i = 1; i <= m; i++) { scanf( %d , b + i); b[i] = (b[i] + b[i - 1]) % c; } for (int i = 1; i <= n; ...
#include <bits/stdc++.h> using namespace std; inline int read() { char c = getchar(); int x = 0; bool f = 0; for (; !isdigit(c); c = getchar()) f ^= !(c ^ 45); for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48); if (f) x = -x; return x; } int mod; struct modint { ...
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; int n, l, m; const int MAXN = 1e6 + 5; long long cini[MAXN], cfin[MAXN]; vector<vector<long long>> owo; vector<vector<long long>> mul(vector<vector<long long>> A, vector<vector<long long>> B) { ...
#include <bits/stdc++.h> using namespace std; const long long MOD = 1000000007; const int INF = 1034567890; const long long LL_INF = 1234567890123456789ll; const double PI = acos(-1); const long double ERR = 1E-10; int main() { ios::sync_with_stdio(false); cin.tie(0); int t; cin >> t; ...
#include <bits/stdc++.h> using namespace std; int main() { long long int n, sum = 0; vector<int> ans; cin >> n; cout << (n * (n + 1) / 2) % 2 << n ; sum = n * (n + 1) / 4; while (sum) { if (n <= sum) { sum -= n; ans.emplace_back(n); } n--; } cout <...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<long long> s(n); for (int(i) = (int)(0); (i) < (int)(n); ++(i)) cin >> s[i]; long long a, b, c, d, e; cin >> a >> b >> c >> d >> e; long long r = 0; vector<long long> t(5, 0); for (int(i) = (int)(0...
#include <bits/stdc++.h> using namespace std; const int maxn = 2000 + 5; vector<int> g[maxn]; bool used[maxn][maxn]; int v[maxn], stk[maxn]; void dfs(int z, int m, int x, bool eq) { stk[z] = x; if (z == m) { if (eq) return; for (int i = 0; i < m + 1; ++i) printf( %d , stk[i] + 1); ...
#include <bits/stdc++.h> using namespace std; const long long MAGIC = 777777777; struct point { long long x, y, z; point() {} point(long long val) { x = y = z = val; } }; vector<point> arr; struct equation { pair<long long, long long> S; pair<long long, long long> a; pair<long long, ...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; map<int, vector<int> > m; int e; for (int i = 2; i <= n; i++) { cin >> e; m[e].push_back(i); } vector<bool> leaf(n + 1, true); leaf[1] = false; for (int i = 1; i <= n; i++) { if (m.count...
#include <bits/stdc++.h> using namespace std; double dp[2005][2005]; int main() { ios::sync_with_stdio(0); a: int n, t; double p; cin >> n >> p >> t; dp[0][0] = 1.0; for (int i = 1; i <= t; i++) dp[i][0] = dp[i - 1][0] * (1.0 - p); for (int j = 1; j <= n; j++) dp[0][j] = 0.0; for...
#include <bits/stdc++.h> using namespace std; int arr[1100]; int main() { int n, a, b, c, t, ans = 0, sum = 0; cin >> n >> a >> b >> c >> t; for (int i = 0; i < n; i++) { cin >> arr[i]; sum += t - arr[i]; } ans = n * a; if (b >= c) { cout << ans << endl; } else { ...
#include <bits/stdc++.h> using namespace std; const int maxn = 4005; int f[maxn][maxn], prea[maxn][26], preb[maxn][26]; char a[maxn], b[maxn]; int n, m, ti, td, tr, te; int main() { int i, j, x, y; scanf( %d%d%d%d , &ti, &td, &tr, &te); scanf( %s%s , a + 1, b + 1); n = strlen(a + 1); m =...
#include <bits/stdc++.h> void read(long long &t) { char c; while ((c = getchar()) < 0 \|\| c > 9 ) ; t = c - 0 ; while ((c = getchar()) >= 0 && c <= 9 ) (t *= 10) += c - 0 ; } static const long long N = 100010; long long a[N], cnt[45]; bool is_power(long long t) { return !(t - (t &...
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 5; const int Mod = 1000000007; const int INF = 0x3f3f3f3f; const long long LL_INF = 0x3f3f3f3f3f3f3f3f; const double e = exp(1); const double PI = acos(-1); const double ERR = 1e-10; int head[maxn], cnt, n, tot, mstnum; int dfn[max...
#include <bits/stdc++.h> using namespace std; char __buf[1 << 20], __p1, __p2; int read() { int s = 0, w = 1; char ch = getchar(); while (ch < 0 \|\| ch > 9 ) { if (ch == - ) w = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) s = (s << 3) + (s << 1) + (ch ^ 48), ch ...

#include <bits/stdc++.h> using namespace std; long long t, d, ct, q, ans, l, m, r, n, mx, mn, i, j, k, x, y, z, s; char ch; string ss = , str = ; long long a[200003], b[200003]; long long pref[200003]; int main() { ios_base::sync_with_stdio(false), cin.tie(nullptr); s = k = d = l = mx = m = mn...

#include <bits/stdc++.h> using namespace std; long long maps[105][105]; int main() { long long a, b, c, d, i, j, k, l, t, n, m; scanf( %lld , &t); while (t--) { scanf( %lld , &a); for (i = 2; i * i <= a; i++) { if (a % i) { b = a % i; c = a - b; break;...

#include <bits/stdc++.h> int main() { int64_t n; std::cin >> n; int64_t total(0), smallestOdd(0); while (n--) { int64_t x; std::cin >> x; total += x; if ((x % 2) && (smallestOdd == 0 || x < smallestOdd)) { smallestOdd = x; } } if (total % 2) { total ...

#include <bits/stdc++.h> using namespace std; const long double pi = acos(-1.0); long long int inf = 0x3f3f3f3f3f3f3f3f; const long long int mod = 1e9 + 7; const long long int mx = 5 * 1000000; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int t; cin >> t; w...

#include <bits/stdc++.h> using namespace std; vector<long long> D0, D1; vector<vector<pair<long long, long long> > > G; bool comp(pair<long long, long long> a, pair<long long, long long> b) { return a.second - a.first > b.second - b.first; } void dfs(int x, int k, int p = -1) { vector<pair<long long...

#include <bits/stdc++.h> using namespace std; struct line { long long int a, b, c; }; int main() { long long int x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2; long long int n; cin >> n; vector<line> data(n); for (auto &p : data) { cin >> p.a >> p.b >> p.c; } vector<bool>...

#include <bits/stdc++.h> using namespace std; long long n, m, k; long long a[100005]; bool moze(long long x) { long long st[100005]; long long curr = 0; for (long long i = 0; i < n; i++) { long long t = x - a[i]; if (t < 0) t = 0; if (i >= k) curr -= st[i - k]; st[i] = t - cu...

#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const long long INF = 1e18; const int MAXN = 2e5 + 5; const int MAXM = 9e4 + 500; const int N = 300 + 10; const double EPS = 1e-5; int i, j, d; int n, k, m, p; int a[N][N], dp[2][N][N], last[N][N]; vector<pair<int, int> > grid[...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:1024000000,1024000000 ) using namespace std; struct edge { int v, next; } e[200010]; int ecnt = 0, head[100010]; int n; int d[100010]; int leg[100010]; void addedge(int a, int b) { e[++ecnt].v = b; e[ecnt].next = head[a]; head[a]...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 9; int n, a[N]; struct pp { int val, id; } p[N]; bool cmp(pp x, pp y) { return x.val < y.val; } int f[N], siz[N], vis[N]; int find(int x) { return x == f[x] ? x : (f[x] = find(f[x])); } bool merge(int u, int v) { if (!vis[u] || ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 5; template <typename T> void chkmax(T &x, T y) { x = max(x, y); } template <typename T> void chkmin(T &x, T y) { x = min(x, y); } template <typename T> void read(T &x) { x = 0; int f = 1; char c = getchar(); ...

#include <bits/stdc++.h> using namespace std; const int maxn = 250005; int n, m, k, dep[maxn], fa[maxn]; bool leaf[maxn], vis[maxn]; vector<int> e[maxn]; void dfs(int p) { leaf[p] = vis[p] = 1; for (int i = 0, v; i < e[p].size(); ++i) { if (vis[v = e[p][i]]) continue; leaf[p] = 0; ...

#include <bits/stdc++.h> using namespace std; using i64 = long long; const int N = 2e5 + 5; struct Nod { i64 sum; int max_pos, max_pos2; }; Nod pom[N * 4]; int v[N]; int n, q, update_pos, update_val, current_pos; i64 query_sum, peak_sum; static void pom_build(int nod, int l, int r) { if ...

#include <bits/stdc++.h> using namespace std; template <typename A, typename B> string to_string(pair<A, B> p); template <typename A, typename B, typename C> string to_string(tuple<A, B, C> p); template <typename A, typename B, typename C, typename D> string to_string(tuple<A, B, C, D> p); string to_str...

#include <bits/stdc++.h> using namespace std; const long long inf = 1e18; const long long mod = 1e9 + 7; long long ExtendedEuclid(long long a, long long b, long long &x, long long &y) { if (b == 0) { x = 1; y = 0; return a; } long long g = ExtendedEuclid(b, a % b, x, y); long l...

#include <bits/stdc++.h> using namespace std; #pragma GCC diagnostic ignored -Wmissing-declarations inline int safe_mul(const int x, const int y) __attribute__((warn_unused_result)); int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n, k; cin >> n >> k; int c = (n - k) /...

#include <bits/stdc++.h> using namespace std; const int N = 123456; const int mod = 1e9 + 7; class table { public: int id; int size; }; class group { public: int id; int size; int income; }; bool byIncome(const group &r1, const group &r2) { return r1.income > r2.income; }...

#include <bits/stdc++.h> using namespace std; int main() { int n, limak; cin >> n; int len = n - 1; cin >> limak; int array[n - 1]; for (int i = 0; i < len; i++) cin >> array[i]; sort(array, array + len); int cnt = 0; while (array[len - 1] >= limak) { cnt++; limak++; ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int tc; cin >> tc; while (tc--) { long long int n, k; cin >> n >> k; long long int a[n], m = INT_MIN; for (long long int i = 0; i < n; i++) { ...

#include <bits/stdc++.h> using namespace std; template <typename T1, typename T2> inline ostream& operator<<(ostream& os, const pair<T1, T2>& p) { return os << ( << p.first << , << p.se << ) ; } template <typename T1, typename T2> inline ostream& operator<<(ostream& os, const map<T1, T2>& c) { ...

#include <bits/stdc++.h> using namespace std; int main() { int n, m; scanf( %d , &n); scanf( %d , &m); int mat[n + 1][m + 1]; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { scanf( %d , &mat[i][j]); } } vector<int> dp(n + 1, 0); for (int j = 1; j <= ...

#include <bits/stdc++.h> using namespace std; inline int max(int a, int b) { return a > b ? a : b; } map<int, int> mp; int a[200005], id; inline int read(int x) { if (mp.count(x) > 0) return mp[x]; mp[x] = ++id; return id; } int main() { int n; scanf( %d , &n); int x; for (int ...

#include <bits/stdc++.h> using namespace std; int main() { string a, b; cin >> a >> b; int p = max(a.size(), b.size()); cout << (a == b ? -1 : p) << endl; }

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

#include <bits/stdc++.h> using namespace std; const int inf = 1e9; const int MOD = 1e9 + 7; const int N = 2e2 + 10, M = 1e6 + 10; const int alp = 10; vector<pair<int, int> > pos; pair<int, int> s[M]; int n, m, q, a[N][N], f[N][N], h[N][N], len[N][N], dx[10], dy[10], deg[N][N], g[M]; string str; ...

#include <bits/stdc++.h> using namespace std; int main() { int i, j, n, arr[26]; string s; memset(&arr, -1, sizeof(arr)); cin >> s; int l = s.length(); if (l < 26) { cout << -1; return 0; } i = 0; j = 0; while (j < l) { if (j - i == 26) break; if (s[j]...

#include <bits/stdc++.h> using namespace std; double a, v, l, d, w, ans, L, t1, t2, v_2; int main() { scanf( %lf%lf%lf%lf%lf , &a, &v, &l, &d, &w); L = l - d; double A = w * w; if (v <= w || A >= 2 * a * d) { if (2 * a * l >= v * v) { ans = v / a; ans += (l - v * v / 2 / a) /...

// shirley smokes weed #include <bits/stdc++.h> #define sz(v) ((int)(v).size()) #define all(v) (v).begin(), (v).end() using namespace std; using lint = long long; using pi = pair<int, int>; const int MAXN = 400; int n, m, s[MAXN], e[MAXN], x[MAXN]; int dp[1 << 18], indep[1 << 18], w[1 << 18], tk[1 ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long int n; cin >> n; string s; cin >> s; long long int p = 0, q = 0, t = 0, r = 0, l = 0; for (long long int i = 0; s[i] != 0 ; i++) { if (s[i] ==...

#include <bits/stdc++.h> using namespace std; int N, M; char A[2020][2020]; int B[2020][2020]; int D[2020][2020]; queue<int> qx; queue<int> qy; int dx[4] = {1, 0, -1, 0}; int dy[4] = {0, 1, 0, -1}; long long ans; int main() { scanf( %d%d , &N, &M); for (int i = 1; i <= N; i++) { scan...

#include <bits/stdc++.h> using namespace std; vector<vector<int> > lang(105); vector<vector<int> > emp(105); vector<int> visited(105, false); int n, m; void dfs(int i) { if (!visited[i]) { visited[i] = true; int n_lang = emp[i].size(); for (int k = 0; k < n_lang; k++) { int lg ...

#include <bits/stdc++.h> using namespace std; const int N = 505; int x[N]; int n, m; int main() { cin >> n >> m; for (int i = 0; i < n; i++) cin >> x[i]; double ret = 0; while (m--) { int u, v, c; cin >> u >> v >> c; u--, v--; ret = max(1.0 * (x[u] + x[v]) / c, ret); ...

#include <bits/stdc++.h> using namespace std; int n, a[205], cnt[105], used[105], ans[205], sz[3]; int push(int x) { if (x) { sz[x]++; return x; } else if (sz[1] < sz[2]) { sz[1]++; return 1; } else { sz[2]++; return 2; } } int main() { cin >> n; for...

#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 5; int A[maxn][2]; bool vis[maxn]; vector<int> v[maxn]; int main() { int T; cin >> T; while (T--) { int n; cin >> n; for (int i = 1; i <= n; i++) { v[i].clear(); } for (int i = 1; i <= n; i...

#include <bits/stdc++.h> using namespace std; int parent[100010]; int Rank[100010]; int cnt; int st[100010]; int st_cnt = 0; void rollback(int id) { if (id < 0) Rank[-id - 1]--; else { parent[id] = id; cnt++; } } int find(int cur) { if (parent[cur] == cur) return cur;...

#include <bits/stdc++.h> using namespace std; namespace input { const int InputBufferSize = (1 << 24) + 5; char buffer[InputBufferSize], *s, *eof; inline void init() { assert(stdin != NULL); s = buffer; eof = s + fread(buffer, 1, InputBufferSize, stdin); } inline bool read(int& x) { x = 0;...

#include <bits/stdc++.h> using namespace std; const long long OO = (long long)1e9 + 7; using namespace std; long long inv(long long a, long long b) { return 1 < a ? b - inv(b % a, a) * b / a : 1; } long long Pow(long long B, long long P) { long long R = 1; while (P > 0) { if (P & 1) R = (R...

#include <bits/stdc++.h> int main() { int n, m, i, j, s; char a[12][11]; scanf( %d%d , &n, &m); for (i = 0; i < n; i++) scanf( %s , a[i]); s = 0; for (i = 0; i < n; i++) for (j = 0; j < m; j++) if (a[i][j] == W ) { if (a[i - 1][j] == P ) { s++; ...

#include <bits/stdc++.h> using namespace std; vector<pair<int, pair<int, int> > > V; const int maxn = 1010; int n, N; int a[maxn][maxn], r[maxn], c[maxn]; void sr(int x, int y) { if (x == y) return; V.push_back(make_pair(1, pair<int, int>(x, y))); for (int i = 1; i <= N; ++i) swap(a[x][i], a[y][...

#include <bits/stdc++.h> using namespace std; const int mxn = 100000; long long n, k; int a[2][mxn], first[mxn]; vector<pair<int, int> > v; void sol() { cout << k << n ; for (pair<int, int> i : v) cout << (i.first + 1) << << i.second << n ; exit(0); } void add(int x, int y) { if ...

#include <bits/stdc++.h> using namespace std; bool dbg = 0; int main() { int N, K; cin >> N >> K; long long Count = 0; int x, y; for (int n = 0; n < N; ++n) { scanf( %d%d , &x, &y); Count += (long long)(y - x + 1); } cout << (K - Count % K) % K << endl; return 0; }

#include <bits/stdc++.h> using namespace std; long long n, s, s1, m, k, sum = 0, l, r, a, a1, p; const int N = 1e5 + 1; int main() { int q; cin >> q; while (q--) { cin >> l >> r; if (l % 2) { if (r % 2) { p = (r / 2) - (l / 2) + 1; s = (l + r) * p; s...

#include <bits/stdc++.h> struct Swap { int i; int j; }; std::vector<Swap> swaps; void solve4(int a, int b, int c, int d, bool firstLast) { if (firstLast) swaps.push_back(Swap{a, b}); swaps.push_back(Swap{a, c}); swaps.push_back(Swap{b, d}); swaps.push_back(Swap{a, d}); swaps.push_bac...

#include <bits/stdc++.h> using namespace std; int n, m, k, res, xx, yy; int main() { scanf( %d%d%d , &n, &m, &k); while (k--) { scanf( %d%d , &xx, &yy); int mn = xx - 1; mn = min(mn, n - xx); mn = min(mn, yy - 1); mn = min(mn, m - yy); res = max(res, (int)(mn <= 4)); ...

#include <bits/stdc++.h> using namespace std; int N, ap[3009], dp[3009], how[3009]; char sir[3009]; bool cons(char c) { if (c == a || c == e || c == i || c == o || c == u ) return 0; return 1; } int main() { gets(sir + 1), N = strlen(sir + 1); dp[0] = 0; for (int i = 1; i <= N; ...

#include <bits/stdc++.h> using namespace std; char s[1000002]; int n, m, dp[3][22][1000002] = {0}, ml[100005], mr[100005]; int main(int argc, char **argv) { std::ios::sync_with_stdio(false); cin >> (s + 1); cin >> m; for (int i = 1; i <= m; i++) cin >> ml[i] >> mr[i]; n = strlen(s + 1); ...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; int n, m, a[N], p, q[5], nq[5]; long long f[N][10]; char s[N]; int main() { scanf( %d%d%s , &n, &m, s + 1); for (int i = 1; i <= n; i++) a[i] = s[i] - a + 1; for (int i = 1; i <= m; i++) { p = 1; if (i == a[1]) p...

#include <bits/stdc++.h> using namespace std; long long n, x, a[5005], uc, sum, mux = 0; vector<long long> myvec; int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= n; i++) { sum = 0; for (int j = i; j <= n; j++) { sum += a[j]; if ((j - ...

#include <bits/stdc++.h> using namespace std; int X; vector<int> E[100010]; int all, all2; int v[800 + 10]; int dp[800 + 10], dp2[800 + 10]; void calc(int x) { for (int i = 0; i <= 800 - 1; ++i) v[i] = 0; for (int i = 0; i < E[x].size(); ++i) v[E[x][i]] = 1; for (int i = 0; i <= 800 - 1; ++i) ...

#include <bits/stdc++.h> using namespace std; int N, K; void init() { scanf( %d%d , &N, &K); } void work() { if (K == 1 && N > 1) { printf( -1 ); return; } if (K == 1 && N == 1) { printf( a ); return; } if (N < K) { printf( -1 ); return; } if (N ==...

#include <bits/stdc++.h> using namespace std; long long p = 998244353; int gcd(int a, int b, int& x, int& y) { if (a == 1) { x = 1; y = 0; return 1; } if (b == 1) { x = 0; y = 1; return 1; } if (b == 0) { x = 1; y = 0; return a; } i...

#include <bits/stdc++.h> using namespace std; struct pp { long long nu, we; } c; struct Info { long long l, r, ta, nu; pp a; } a[1000010]; long long b[100010], n, ansn, m, l, r, opt, x, sum; pp mi(pp a, pp b) { if (a.nu < b.nu) return b; return a; } pp ga(long long nu, long long l,...

#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; long long MOD = 998244353; double eps = 1e-12; long long mpow(long long a, long long b) { if (a == 0) return 0; ...

#include <bits/stdc++.h> using namespace std; int main() { int t, m, num = 1; string com; int arg; vector<pair<pair<int, int>, int> > d; cin >> t >> m; for (int _n((t)-1), q(0); q <= _n; q++) { sort((d).begin(), (d).end()); cin >> com; if (com == defragment ) { if ...

#include <bits/stdc++.h> using namespace std; const int N = 100050; struct str { int pre[26], suf[26], mx[26], len; str() {} void Build(char s[], int n) { len = n; for (int i = 0; i < 26; i++) pre[i] = suf[i] = mx[i] = 0; int len = 0; for (int i = 1; i <= n; i++) { if (...

#include <bits/stdc++.h> using namespace std; const double PI = 2.0 * acos(0.0); const double EPS = 1e-6; int dp[100005]; static int topp; void LIS(int x) { if (topp == 0) dp[topp++] = x; else if (x > dp[topp - 1]) dp[topp++] = x; else { int left = 0, right = topp; while ...

#include <bits/stdc++.h> using namespace std; int n, k; long long a, b, sum, ans, summ; char s[100010]; long long powe(long long x, int r) { long long ret = 1; while (r) { if (r & 1) ret = (ret * x) % 1000000009; x = x * x % 1000000009; r >>= 1; } return ret; } int main()...

#include <bits/stdc++.h> using namespace std; vector<int> x[100100], y[100100]; vector<int> p[100100], q[100100], v[100100], w[100100]; int a[100100], b[100100], c[100100]; map<pair<int, int>, int> mp; void solve() { mp.clear(); int n, m; scanf( %d%d , &n, &m); for (int i = 0; i < m; i++) { ...

#include <bits/stdc++.h> using namespace std; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; long long n; cin >> n; string s, t; cin >> s >> t; long long sa = 0, sb = 0, ta = 0, tb = 0; for (long long i = 0; i < n; i++) { if (s[i] == a ) ...

#include <bits/stdc++.h> using namespace std; template <typename T> inline T abs(T a) { return ((a < 0) ? -a : a); } template <typename T> inline T sqr(T a) { return a * a; } const int INF = (int)1E9 + 7; const long double EPS = 1E-9; const long double PI = 3.1415926535897932384626433832795;...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( avx,avx2,fma ) #pragma GCC optimization( unroll-loops ) using namespace std; const long long MOD = 998244353; const long long INF = 0x7f7f7f7f7f7f7f7f; const int INFi = 0x7f7f7f7f; const long long N = 150001; vector<long long> ...

#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { while (b) { a %= b; swap(a, b); } return a; } int check(vector<int> v) { int k = 0; for (int i = 0; i < v.size(); ++i) k += (gcd(i + 1, v[i]) > 1); return k; } int main() { int n, k; cin >> n >>...

#include <bits/stdc++.h> using namespace std; int main() { long long n, m, i, j, k, x, y, z, t; long long hh, mm, h, d, c, N; cin >> hh >> mm; cin >> h >> d >> c >> N; if (hh >= 20) { double cc = 0.8 * c; k = (h + N - 1) / N; double ans = 1.0 * k * cc; cout << fixed << se...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 7; const long long MOD = 1e9 + 7; long long f[N << 2], lazy[N << 2], a[N], b[N], c[N]; void up(int x, int l, int r, long long y) { f[x] = (f[x] + y * (r - l + 1)) % MOD; lazy[x] = (lazy[x] + y) % MOD; } void push_down(int x, int l, ...

#include <bits/stdc++.h> using namespace std; long long const N = 2e5 + 20, MOD = 1e9 + 7; long long n, x, dp[N][2]; bool vis[N], col[N]; vector<long long> child[N]; void dfs(int v = 0) { for (auto u : child[v]) dfs(u); vector<long long> preChild, sufChild; preChild.push_back(1), sufChild.push_b...

#include <bits/stdc++.h> int n, t1, t2; int num = 0; int dfs(int l, int r) { int k = (l + r) / 2; num++; if (t1 <= k && t2 > k) { return num; } if (t1 <= k && t2 <= k) { return dfs(l, k); } else { return dfs(k, r); } } int FastLog2(int x) { float fx; unsig...

#include <bits/stdc++.h> using namespace std; int get(int n, int p) { int res = 0; while (n >= p) res += n / p, n /= p; return res; } template <class T> T power(T N, T P) { return (P == 0) ? 1 : N * power(N, P - 1); } void VC(vector<long long int>& v) { for (int i = 0; i < v.size(); i+...

#include <bits/stdc++.h> using namespace std; class Data { public: long long lazy, val; Data() { lazy = -1; val = 0; } }; long long pr = 107; long long c_pr[100010]; Data tree[4 * 100010]; long long ara[100010]; void updval(int node, int le_ran, int ri_ran, long long lazy) { ...

#include <bits/stdc++.h> using namespace std; int main() { int n, i, mx = 2, j; cin >> n; int a[n]; for (i = 0; i < n; i++) cin >> a[i]; if (n == 1) cout << 1 ; else if (n == 2) cout << 2 ; else { for (i = 2; i < n;) { int x = 0; for (j = i; j < n; j++...

#include <bits/stdc++.h> using namespace std; int n, top; long long N; struct str { int x1, y1, x2, y2; void print() { printf( %d %d %d %d n , x1, y1, x2, y2); } } ans[310]; void print(int x1, int y1, int x2, int y2) { if (x1 > n || y1 > n || x2 > n || y2 > n) return; if (x1 < 1 || y1 < 1 ||...

#include <bits/stdc++.h> using namespace std; const int N = 2e6 + 1; const int INF = 1e9 + 9; const int B = 1e9 + 7; int n, b[N], d[N]; long long a[N]; int main() { ios_base ::sync_with_stdio(0); cin.tie(0); cin >> n; int ans = n; for (int i = int(1); i <= int(n); ++i) { cin >> a...

#include <bits/stdc++.h> using namespace std; int main() { string s1, s2; cin >> s1 >> s2; int n = s1.length(), k = 0, s; for (int i = 0; i < n; i++) if (s1[i] != s2[i]) k++; if (k % 2 == 1) printf( impossible ); else { int s = k / 2; string ans; for (int i = 0;...

#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const int MOD2 = 1e9 + 9; const int PR = 727; const int INF = INT_MAX; const long long LINF = LLONG_MAX; const int N = 1e5 + 20; vector<int> G[N], p; int n, m, k, f[N], tmp; bool visited[N]; int main() { ios::sync_with_stdi...

#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( O3 ) #pragma GCC target( avx ) #pragma GCC optimize( Ofast ) #pragma GCC optimize( unroll-loops ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) long long int dx[] = {0, 1, 0, -1, -1, 1, -1, 1}; long long ...

#include <bits/stdc++.h> using namespace std; const int MAX = 500000; int a[MAX], last[MAX], prv[MAX], inSet[MAX], current[MAX]; int n, k; int main() { ios_base::sync_with_stdio(false); cin >> n >> k; memset(last, -1, sizeof(last)); memset(prv, -1, sizeof(prv)); for (int i = 0; i < n; i++)...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, k; cin >> n >> k; vector<int> v(n + 1, 0); for (int i = 1; i <= n; i++) { cin >> v[i]; } sort(v.begin() + 1, v.end()); v[0] = v[1]; aut...

#include <bits/stdc++.h> using namespace std; void solve() { long long int n, k; cin >> n >> k; if (k > n) cout << -1 << n ; else if (n != 1 && k == 1) cout << -1 << n ; else if (k == n) { char x = a ; for (long long int i = 1; i <= (long long int)n; i++) { c...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); int n, s, k, a[55], dp[55][2505]; cin >> n >> s >> k; for (int i = 0; i < n; i++) cin >> a[i]; string s1; cin >> s1; priority_queue<pair<int, pair<int, int> > > q; s--; for (int i = 0; i < 55...

#include <bits/stdc++.h> using namespace std; int main() { int x, cnt = 0; cin >> x; int arr1[x], arr2[x]; for (int i = 0; i < x; i++) { cin >> arr1[i] >> arr2[i]; } for (int i = 0; i < x; i++) { for (int j = 0; j < x; j++) { if (i == j) { continue; } ...

#include <bits/stdc++.h> using namespace std; void IO() { mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } int main() { IO(); int t; cin >> t; while (t--) { long long int n; cin >> n; l...

#include <bits/stdc++.h> using namespace std; int main(int argc, char** argv) { long long r, x1, y1, x2, y2; while (cin >> r >> x1 >> y1 >> x2 >> y2) { double dis = sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2) + 0.0); cout << ceil(dis / 2 / r) << endl; } return 0; }

#include <bits/stdc++.h> using namespace std; using LL = long long; const int N = 400005; const int mod = 998244353; int n, m; int fact[N], infact[N]; int qmi(int a, int k, int p) { int res = 1; while (k) { if (k & 1) res = (LL)res * a % p; a = (LL)a * a % p; k >>= 1; } r...

#include <bits/stdc++.h> using namespace std; int main() { const int maxn = 1005; char a[2 * maxn], b[maxn]; scanf( %s , a); scanf( %s , b); int lenA = strlen(a); int lenB = strlen(b); int cntA = 0, cntB = 0; int i; for (i = 0; i < lenA; i++) if (a[i] == 1 ) cntA++; fo...

#include <bits/stdc++.h> using namespace std; const int H = 1000000; template <typename Key, typename Val> struct Hash { char *used; Key *key; Val *val; Hash() { used = new char[H]; key = new Key[H]; val = new Val[H]; memset(used, 0, sizeof(used)); } int hash_func...

#include <bits/stdc++.h> using namespace std; bool sortmd(pair<long long, long long> &a, pair<long long, long long> &b) { if (a.first != b.first) return a.first < b.first; else return a.second < b.second; } int main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); srand...

#include <bits/stdc++.h> const int MAX = (int)1e5 + 5; int a[MAX], b[MAX], n, m, c; int main() { scanf( %d%d%d , &n, &m, &c); for (int i = 1; i <= n; i++) scanf( %d , a + i); for (int i = 1; i <= m; i++) { scanf( %d , b + i); b[i] = (b[i] + b[i - 1]) % c; } for (int i = 1; i <= n; ...

#include <bits/stdc++.h> using namespace std; inline int read() { char c = getchar(); int x = 0; bool f = 0; for (; !isdigit(c); c = getchar()) f ^= !(c ^ 45); for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48); if (f) x = -x; return x; } int mod; struct modint { ...

#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; int n, l, m; const int MAXN = 1e6 + 5; long long cini[MAXN], cfin[MAXN]; vector<vector<long long>> owo; vector<vector<long long>> mul(vector<vector<long long>> A, vector<vector<long long>> B) { ...

#include <bits/stdc++.h> using namespace std; const long long MOD = 1000000007; const int INF = 1034567890; const long long LL_INF = 1234567890123456789ll; const double PI = acos(-1); const long double ERR = 1E-10; int main() { ios::sync_with_stdio(false); cin.tie(0); int t; cin >> t; ...

#include <bits/stdc++.h> using namespace std; int main() { long long int n, sum = 0; vector<int> ans; cin >> n; cout << (n * (n + 1) / 2) % 2 << n ; sum = n * (n + 1) / 4; while (sum) { if (n <= sum) { sum -= n; ans.emplace_back(n); } n--; } cout <...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<long long> s(n); for (int(i) = (int)(0); (i) < (int)(n); ++(i)) cin >> s[i]; long long a, b, c, d, e; cin >> a >> b >> c >> d >> e; long long r = 0; vector<long long> t(5, 0); for (int(i) = (int)(0...

#include <bits/stdc++.h> using namespace std; const int maxn = 2000 + 5; vector<int> g[maxn]; bool used[maxn][maxn]; int v[maxn], stk[maxn]; void dfs(int z, int m, int x, bool eq) { stk[z] = x; if (z == m) { if (eq) return; for (int i = 0; i < m + 1; ++i) printf( %d , stk[i] + 1); ...

#include <bits/stdc++.h> using namespace std; const long long MAGIC = 777777777; struct point { long long x, y, z; point() {} point(long long val) { x = y = z = val; } }; vector<point> arr; struct equation { pair<long long, long long> S; pair<long long, long long> a; pair<long long, ...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; map<int, vector<int> > m; int e; for (int i = 2; i <= n; i++) { cin >> e; m[e].push_back(i); } vector<bool> leaf(n + 1, true); leaf[1] = false; for (int i = 1; i <= n; i++) { if (m.count...

#include <bits/stdc++.h> using namespace std; double dp[2005][2005]; int main() { ios::sync_with_stdio(0); a: int n, t; double p; cin >> n >> p >> t; dp[0][0] = 1.0; for (int i = 1; i <= t; i++) dp[i][0] = dp[i - 1][0] * (1.0 - p); for (int j = 1; j <= n; j++) dp[0][j] = 0.0; for...

#include <bits/stdc++.h> using namespace std; int arr[1100]; int main() { int n, a, b, c, t, ans = 0, sum = 0; cin >> n >> a >> b >> c >> t; for (int i = 0; i < n; i++) { cin >> arr[i]; sum += t - arr[i]; } ans = n * a; if (b >= c) { cout << ans << endl; } else { ...

#include <bits/stdc++.h> using namespace std; const int maxn = 4005; int f[maxn][maxn], prea[maxn][26], preb[maxn][26]; char a[maxn], b[maxn]; int n, m, ti, td, tr, te; int main() { int i, j, x, y; scanf( %d%d%d%d , &ti, &td, &tr, &te); scanf( %s%s , a + 1, b + 1); n = strlen(a + 1); m =...

#include <bits/stdc++.h> void read(long long &t) { char c; while ((c = getchar()) < 0 || c > 9 ) ; t = c - 0 ; while ((c = getchar()) >= 0 && c <= 9 ) (t *= 10) += c - 0 ; } static const long long N = 100010; long long a[N], cnt[45]; bool is_power(long long t) { return !(t - (t &...

#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 5; const int Mod = 1000000007; const int INF = 0x3f3f3f3f; const long long LL_INF = 0x3f3f3f3f3f3f3f3f; const double e = exp(1); const double PI = acos(-1); const double ERR = 1e-10; int head[maxn], cnt, n, tot, mstnum; int dfn[max...

#include <bits/stdc++.h> using namespace std; char __buf[1 << 20], *__p1, *__p2; int read() { int s = 0, w = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) w = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) s = (s << 3) + (s << 1) + (ch ^ 48), ch ...