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

func_code_string stringlengths 59 71.4k
#include <bits/stdc++.h> using namespace std; const int MAXN = 100000; int prime[MAXN + 1]; void getPrime() { memset(prime, 0, sizeof(prime)); for (int i = 2; i <= MAXN; i++) { if (!prime[i]) prime[++prime[0]] = i; for (int j = 1; j <= prime[0] && prime[j] <= MAXN / i; j++) { prime[p...
#include <bits/stdc++.h> using namespace std; int main() { int n, m, k; cin >> n >> m >> k; vector<vector<int>> v; vector<int> cur; if ((n * m) % k == 0) { int div = (n * m) / k; for (int i = 0; i < n; i++) { if (!(i & 1)) { for (int j = 0; j < m; j++) { ...
#include <bits/stdc++.h> using namespace std; const int N = (int)1e5 + 7; int n; int v[N], f[N]; bool e[N]; int st, dr; bool ok(int l, int r) { for (int i = 1; i <= n; i++) { e[i] = 0; f[i] = 0; } for (int i = l; i <= r; i++) { e[i] = 1; f[v[i]]++; } for (int i ...
#include <bits/stdc++.h> using namespace std; long long a1, a2, b1, b2, c1, c2; void rec(long long p, long long q) { long long mod = c1 * c1 + c2 * c2; if ((p * c1 + q * c2) % mod == 0 && (q * c1 - p * c2) % mod == 0) { puts( YES ); exit(0); } } int main() { scanf( %I64d%I64d%I64d%...
#include <bits/stdc++.h> using namespace std; int main() { int l, r, x, y; double k; cin >> l >> r >> x >> y >> k; bool flag = false; double value; while (x <= y) { value = (double)x * k; if (value >= l && value <= r) { flag = true; break; } x++; }...
#include <bits/stdc++.h> using namespace std; const int N = 500005; const int inf = 1000 * 1000 * 1000; const int mod = 998244353; int n; vector<int> g[N]; int dp[N][3]; int sz[N][3]; void dfs(int v, int p) { dp[v][0] = dp[v][1] = 0; sz[v][0] = 1; sz[v][1] = 0; for (int i = 0; i < (int...
#include <bits/stdc++.h> using namespace std; struct Tpoint { double x, y; } v[200], pg[200]; struct Tline { Tpoint a, b; } ls[200]; int n, tot, q[200], ord[200]; double at2[200]; double getdouble() { double d = 0, d2, d3; char ch = ; bool flag = false; while (!isdigit(ch = ge...
#include <bits/stdc++.h> using namespace std; int a[200005]; int b[200005]; int c[200005]; char str1[200005]; char str2[200005]; int main() { int n; while (scanf( %d , &n) != EOF) { cin >> str1 >> str2; int i; for (i = 0; i < n; i++) { a[i] = str1[i] - a ; b[i] =...
#include <iostream> #include <string> #include <algorithm> #include <map> #include <vector> #include <cmath> #include <queue> #include <set> #include <bitset> using namespace std; typedef long long ll; ll MOD = 1000000007; void solve(int testCase) { ll n; cin >> n; for (int i...
#include <bits/stdc++.h> using namespace std; template <typename T> inline void chkmin(T &a, const T &b) { a = a < b ? a : b; } template <typename T> inline void chkmax(T &a, const T &b) { a = a > b ? a : b; } const int MAXN = 150005, MAXT = 300005; int sz[MAXN], val[MAXN], vis[MAXN], n, tot; ...
#include <bits/stdc++.h> using namespace std; int arr[200007]; int brr[200007]; int main() { int t; cin >> t; while (t--) { int n, x; cin >> n >> x; map<int, int> mpp; for (int i = 0; i < n; i++) { cin >> arr[i]; mpp[arr[i]]++; } int cnt = 0; ...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 1; int mark[N], t[N], n; long long res; int main() { ios::sync_with_stdio(0); cin.tie(0); ; cin >> n; for (int i = (1); i <= (n); i += (1)) cin >> mark[i]; int cur = 0; for (int i = (n); i >= (1); i -= (1)) { c...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { int n; cin >> n; int arr[n]; for (int i = 0; i < n; i++) { cin >> arr[i]; } sort(arr, arr + n); int ans = 1...
#include <bits/stdc++.h> using namespace std; namespace Base { const int inf = 0x3f3f3f3f, INF = 0x7fffffff; const long long infll = 0x3f3f3f3f3f3f3f3fll, INFll = 0x7fffffffffffffffll; template <typename T> void read(T &x) { x = 0; int fh = 1; double num = 1.0; char ch = getchar(); while...
#include <bits/stdc++.h> using namespace std; int main() { int n, a[100000], p[100000]; cin >> n; for (int i = 0; i < n; ++i) cin >> a[i] >> p[i]; for (int i = 1; i < n; ++i) p[i] = min(p[i], p[i - 1]); int ans = 0; for (int i = 0; i < n; ++i) ans += p[i] * a[i]; cout << ans << endl; }...
#include <bits/stdc++.h> using namespace ::std; const long long maxn = 52; const long long mod = 1e9 + 7; const long long inf = 1e9 + 500; long long dp[2][maxn][maxn][maxn][maxn]; long long d[maxn]; bool bit; long long kv; void add(long long a, long long b, long long c, long long d, long long z) { ...
#include <bits/stdc++.h> using namespace std; int main() { int n, k, m = 1e9 + 7; cin >> n >> k; int a[100005]; a[0] = 1; for (int i = 1; i < 100005; ++i) { if (i >= k) { a[i] = (a[i - k] + a[i - 1]) % m; } else { a[i] = a[i - 1]; } } for (int i = 1; i <...
#include <bits/stdc++.h> using namespace std; void write(vector<int> &v) { for (auto i : v) cout << i << ; cout << n ; } void read(vector<int> &v) { for (auto &i : v) cin >> i; } const int INF = 1e9; const int64_t INFF = 1e18; const int N = 1e6 + 69; void solve() { int n; cin ...
#include <bits/stdc++.h> using namespace std; const long long p = 1e9 + 7; inline long long read() { long long neg = 1, num = 0; char c = getchar(); for (; !isdigit(c); c = getchar()) if (c == - ) neg = -1; for (; isdigit(c); c = getchar()) num = (num << 1) + (num << 3) + c - 0 ; retur...
#include <bits/stdc++.h> using namespace std; int num[100020], nxt[100020]; struct point { int st, en, num; } pnt[100020 * 4]; int max1(int a, int b) { if (a > b) return a; return b; } int main() { int n, sum = 0, cnt = 0, besti, min1 = 1 << 25, tmp, i; scanf( %d , &n); num[n + 1] ...
#include <bits/stdc++.h> using namespace std; map<string, int> mp; map<int, string> g; int n, k, cnt; char name1[10100][30], name2[10100][30]; int mark[1010][1010]; int x[10100], y[10100], tt[10100]; int ans[10100], num; struct Node { int l, r; } node[10100]; struct Mark { int l, r; Ma...
#include <bits/stdc++.h> using namespace std; const int N = 100010; const int LG_N = 20; struct node { int l, r, cnt; node left, right; node(int _l, int _r, int _c = 0) : l(_l), r(_r), cnt(_c) {} }; node init(int l, int r) { node p = new node(l, r); if (l < r) { int mid = (l + ...
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 5; int a[maxn], n, s, b[maxn], num[maxn], len; int ufs[maxn], meme[maxn]; inline int find(int u) { if (ufs[u] == u) return u; else return ufs[u] = find(ufs[u]); } inline void join(int u, int v, int e) { u = find(u...
#include <bits/stdc++.h> using namespace std; const int N = 2005; struct poke { double p, q; } srt[N]; inline bool cmp1(poke a, poke b) { return a.p > b.p \|\| a.p == b.p && a.q > b.q; } inline bool cmp2(poke a, poke b) { return a.p - a.p * a.q > b.p - b.p * b.q; } double f[N]; int n, a, b; do...
#include <bits/stdc++.h> using namespace std; signed main() { long long t; cin >> t; while (t--) { long long n; cin >> n; char c; cin >> c; string str; cin >> str; long long ctr = 0; long long k = 0; for (long long i = 0; i < n; i++) { if (st...
#include <bits/stdc++.h> using namespace std; int a[105], b[105]; long long tinh(long long x, int n, int nc) { long long i, cnt = 0; for ((i) = (1); (i) <= (n); (i)++) { cnt += (((long long)a[i] * x) / b[i]) + 1; if (cnt > nc) return 1001001001; } return cnt; } void input() { i...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:1000000000 ) using namespace std; const bool db = false; int n, m, x, y; int a[1010][1010], b[1010][1010]; long long s[1010][1010], cs[1010][1010]; vector<pair<int, int> > ans; char mark[1010][1010]; pair<long long, pair<int, int> > st[1010 * 10...
#include <bits/stdc++.h> using namespace std; template <class T> void _p(T a) { cout << a << n ; } template <class T> void _pa(T a) { cout << a << ; } template <class T1, class T2> void _p(T1 a, T2 b) { cout << a << << b << n ; } template <class T1, class T2, class T3> voi...
#include <bits/stdc++.h> using namespace std; bool pd[5005][5005]; char str[5005]; int n; bool vis[5050]; bool dfs(int u, int lst) { vis[u] = 1; for (int i = 1; i <= n; ++i) { if (!pd[u][i]) continue; if (lst != -1 && pd[i][lst]) { printf( %d %d %d n , lst, u, i); return ...
#include <bits/stdc++.h> int main() { int i, n, m, count = 0; scanf( %d%d , &n, &m); while (n > 0 && m > 0) { if (n > m && n >= 2) { n -= 2; m--; count++; } else if (m > n && m >= 2) { m -= 2; n--; count++; } else if (n == m && m >= 2) { ...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); long long n, m, k; cin >> n >> m >> k; long long s = 2 * n * m; if (s % k != 0) { cout << NO ; return 0; } s /= k; long long x2, x3, y2, y3; x2 = n; if (s % n ...
#include <bits/stdc++.h> using namespace std; void prepare() {} void solve() { string s; cin >> s; set<int> ss[26]; for (int i = 0; i < s.size(); ++i) ss[s[i] - a ].insert(i); int i = 25; int cur = -1; while (i != -1) { if (ss[i].empty()) { --i; continue; }...
#include <bits/stdc++.h> using namespace std; const int M = 200005; const int N = 900005; struct node { int son[27]; int fa; } a[N]; int sz; char s[N]; int mat[M]; vector<int> over[N]; inline int new_id() { ++sz; over[sz].clear(); for (int i = (1); i <= (26); i++) a[sz].son[i] = ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); double s, x, y, z; cin >> s >> x >> y >> z; if ((x == y) && (y == z) && (z == 0.0)) { cout << 0 0 << s << endl; return 0; } double k = x + y + z,...
#include <bits/stdc++.h> using namespace std; double xx[10], yy[10]; int main() { double px, py, vx, vy, a, b, c, d; cin >> px >> py >> vx >> vy >> a >> b >> c >> d; double x = vx / sqrt(vx * vx + vy * vy); double y = vy / sqrt(vx * vx + vy * vy); xx[1] = b * x + px; yy[1] = b * y + py; ...
#include <bits/stdc++.h> using namespace std; int main() { int b, l, k = 0, p, m; cin >> b >> l; int n[l]; for (int i = 0; i < l; i++) { n[i] = 0; } for (int i = 0; i < b; i++) { cin >> p; for (int j = 0; j < p; j++) { cin >> m; n[m - 1]++; } } ...
#include <bits/stdc++.h> using namespace std; long long int pwr(long long int base, long long int p, long long int mod) { long long int ans = 1; while (p) { if (p & 1) ans = (ans * base) % mod; base = (base * base) % mod; p /= 2; } return ans; } long long int gcd(long long int ...
#include <bits/stdc++.h> using namespace std; const int N = 22; int d, p, q; int c[N][N], s[5555]; int a[N][N], b[N][N], f[N]; int fpow(int x, int y = p - 2) { if (!y) return 1; long long z = fpow(x, y >> 1); z = z * z % p; if (y & 1) z = z * x % p; return z; } int w; void pr(int x...
#include <bits/stdc++.h> using namespace std; const long long inf = 1ll << 18; long long a, b, top, now; queue<long long> q; map<long long, int> mp; long long rev(long long x) { long long y = 0; while (x != 0) { y = (y << 1) \| (x & 1); x >>= 1; } return y; } void push(long lo...
#include <bits/stdc++.h> using namespace std; template <class T1, class T2> ostream& operator<<(ostream& os, const pair<T1, T2>& v) { os << ( << v.first << << v.second << ) ; return os; } template <typename T, typename U = typename T::value_type, typename = typename enable_if<!is_sa...
#include <bits/stdc++.h> using namespace std; struct par { int x, y, label; par(int _x, int _y, int _label) { x = _x; y = _y; label = _label; } par() {} }; bool operator<(par p1, par p2) { if (p1.x != p2.x) return p1.x < p2.x; return p1.y < p2.y; } int main() { ...
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; inline int read() { int w = 1, s = 0; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) w = -1; ch = getchar(); } while (isdigit(ch)) { s = s * 10 + ch - 0 ; ch = getchar(); } retur...
#include <bits/stdc++.h> using namespace std; const int MAXN = 4e5 + 10; int n, m, k, t; bool vis[MAXN], ans[MAXN]; int v[MAXN]; set<int> p[MAXN]; priority_queue<pair<int, int> > pq; int main() { cin >> n >> m; memset(vis, false, sizeof(vis)); memset(ans, false, sizeof(ans)); for (int i ...
#include <bits/stdc++.h> using namespace std; inline int gi() { int w = 0, q = 0; char c = getchar(); while ((c < 0 \|\| c > 9 ) && (c != - )) c = getchar(); if (c == - ) q = 1, c = getchar(); while (c >= 0 && c <= 9 ) w = w * 10 + c - 0 , c = getchar(); return q ? -w : w; } int n...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> b[5001]; for (int i = 0; i < n; i++) { string s; int a, b1, c; cin >> s >> a >> b1; if (s[0] == M ) c = 0; else c = 1; b[i].push_back(c); b[i].push_back(...
#include <bits/stdc++.h> using namespace std; long long int n, m, ar[1000005], sum, t, ar2[1000005]; vector<int> ans; vector<pair<int, char> > res; int main() { cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(false); cin >> n; for (long long int i = 1; i <= n; i++) cin >> ar[i]; cin...
#include <bits/stdc++.h> const int N = 100010; const long long INF = 1ll << 60; const int inf = 0x3f3f3f3f; int t; int n, m, k; int a[N]; int b[N]; std::vector<int> row[N]; std::vector<int> col[N]; int cur; int r, c; long long ans; int main() { scanf( %d%d%d , &n, &m, &k); for (int i =...
#include <bits/stdc++.h> using namespace std; void solve() { int n; cin >> n; cout << n / 2 + 1 << n ; } int main() { int tc, cse = 0; cin >> tc; while (tc--) solve(); }
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 7; int ans[maxn]; int lowbit(int x) { return x & -x; } bool is_two(int x) { return x == lowbit(x); } bool dfs(int n, int k, int id) { if (k == 1) { printf( %d %d %d n , n, k, id); if (is_two(n)) { return false; ...
#include <bits/stdc++.h> using namespace std; const long long N = 1e6 + 1, inf = 1e18; vector<pair<long long, long long> > a, b; vector<pair<pair<long long, long long>, long long> > z; long long add[4 * N], t[4 * N]; void push(long long v, long long l, long long r) { t[v] += add[v]; if (l != r - 1) ...
#include <bits/stdc++.h> using namespace std; string s; string rev(string s) { string p; for (auto i : s) p.insert(0, 1, i); return p; } int main() { cin >> s; int n = s.size(); for (int i = 0; i <= s.size(); i++) for (int j = 0; j < 26; j++) { string p = s; p.ins...
#include <bits/stdc++.h> struct PP { int l, r, sum, lv, rv, cover; int mid() { return (l + r) >> 1; } void doit() { sum = lv = rv = cover ? 0 : dis(); } int dis() { return r - l; } } q[100005 * 3]; int max(int a, int b) { return a > b ? a : b; } void Build(int l, int r, int x) { q[x].l = l; ...
#include <bits/stdc++.h> using namespace std; const int mxN = 200000; int n, m, t, tin[mxN]; vector<int> adj[mxN], e[mxN]; vector<array<int, 3>> ans; void dfs(int u, int p = -1) { tin[u] = ++t; if (p ^ -1) e[u].push_back(p); for (int v : adj[u]) { if (v == p) continue; if (!tin[v]) {...
#include <bits/stdc++.h> using namespace std; template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cerr << name << : << arg1 << std::endl; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long n; cin >> n; if (n == 47 \|\| n == 74 \|\| n == 477 \|\| n == 477) cout << YES ; else if (n % 4 == 0 \|\| n % 7 == 0 \|\| n % 47 == 0) cout << YES ; ...
#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { if (a == 0) return b; return gcd(b % a, a); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; int n, arr[105]; cin >> n; for (int i = 0; i < n; i++) cin >> arr[i]; int an...
#include <bits/stdc++.h> using namespace std; int main() { int n, m, r; cin >> n >> m >> r; vector<int> v(n); vector<int> v1(m); for (int i = 0; i < n; i++) { cin >> v[i]; } for (int i = 0; i < m; i++) { cin >> v1[i]; } sort(v.begin(), v.end()); sort(v1.rbegin(), ...
#include <bits/stdc++.h> using namespace std; int ured() { int re = 0, ch; do { ch = getchar(); } while ( 9 < ch \|\| ch < 0 ); do { re = re * 10 + (ch ^ 0 ); } while ( 0 <= (ch = getchar()) && ch <= 9 ); return re; } void uwit(int da) { int cn = 0, ch[21]; do { ...
#include <bits/stdc++.h> using namespace std; long long n, k, res = 1; long long a[100005]; long long b[100005]; long long d = 1, ans; int main() { cin >> n >> k; for (int i = 0; i < k; i++) d *= 10; for (int i = 0; i < n / k; i++) cin >> a[i]; for (int i = 0; i < n / k; i++) cin >> b[i]; ...
#include <bits/stdc++.h> using namespace std; inline long long read() { long long X = 0, w = 1; char c = getchar(); while (c < 0 \|\| c > 9 ) { if (c == - ) w = -1; c = getchar(); } while (c >= 0 && c <= 9 ) X = X * 10 + c - 0 , c = getchar(); return X * w; } const long...
#include <bits/stdc++.h> using namespace std; long double PI = acosl(-1); bool compare_int(int a, int b) { return (a > b); } bool compare_string(string a, string b) { return a.size() < b.size(); } bool compare_pair(const pair<int, int> &a, const pair<int, int> &b) { if (a.second == b.second) return ...
#include <bits/stdc++.h> using namespace std; void abc() { cout << endl; } template <typename T, typename... U> void abc(T a, U... b) { cout << a << , abc(b...); } template <typename T> void printv(T l, T r) { while (l != r) cout << *l << n [++l == r]; } template <typename A, typename B>...
#include <bits/stdc++.h> int main() { int t, res = 0; long x, y, n; std::cin >> t; for (int i = 0; i < t; i++) { std::cin >> x >> y >> n; if (n > 0) { res = (n - y) % x; std::cout << n - res << n ; } else { std::cout << 0 << n ; } } }
#include <bits/stdc++.h> using namespace std; int N, i, j; string S, R; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> N >> S; for (i = N - 2; i >= 0; i -= 2) { R = R + S[i]; } if (N % 2 == 0) i = 1; else i = 0; for (i = i; i < N;...
#include <bits/stdc++.h> template <typename T> inline void read(T &x) { x = 0; char c = getchar(); bool flag = false; while (!isdigit(c)) { if (c == - ) flag = true; c = getchar(); } while (isdigit(c)) x = x * 10 + (c ^ 48), c = getchar(); if (flag) x = -x; } using names...
#include <bits/stdc++.h> using namespace std; long long i, j, t, n, k, a, b; double v; string line; char s[4]; int main() { while (cin >> n >> a >> b) { if (b < 0) b = n + b; a = a + b; a = a % n; if (a == 0) a = n; else if (a < 0) a = n + a; cout << a...
#include <bits/stdc++.h> using namespace std; const int N = 300005; pair<int, int> p[N]; int main() { int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); int i = 0, j = 0; while (j < n) { if (a[i] < a[j]) i++; j++; } cout << i << en...
#include <bits/stdc++.h> const int INF = (int)1e9; using namespace std; const int MAX = 1e3 + 5; int n, xa, ya, xb, yb; pair<pair<int, int>, int> arr[MAX]; vector<pair<int, int> > vec; bool covered(int x1, int y1, int x2, int y2, int R) { double dist = sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2...
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 5; int n, m, fa[N], f[N], d[N], head[N], xx, yy, ww, fr[N]; int ans; bool in[N], c[N]; struct nd { int x, y, w, id; } a[N]; bool operator<(nd a, nd b) { return a.w < b.w \|\| (a.w == b.w && a.id < b.id); } struct ndd { int ne, to,...
#include <bits/stdc++.h> using namespace std; struct point { long long x, y, z; point() {} point(long long a, long long b, long long c) : x(a), y(b), z(c) {} double operator()(point y) { return sqrt((this->x - y.x) * (this->x - y.x) + (this->y - y.y) * (this->y - y.y) + ...
#include <bits/stdc++.h> using namespace std; int N, M; int d[300010]; int h[300010]; pair<long long, int> L[8 * 300010]; pair<long long, int> R[8 * 300010]; void aggL(int nodo, int left, int right, int pos, long long val) { if (left == right) { L[nodo] = pair<long long, int>(val, pos); re...
#include <bits/stdc++.h> using namespace std; const long long N = 200005, INF = 2000000000000000000; long double pi = 3.1415926535897932; long long powere(long long a, long long b, long long p) { if (a == 0) return 0; long long res = 1; a %= p; while (b > 0) { if (b & 1) res = (res * a) % ...
#include <bits/stdc++.h> using namespace std; void fun(long long int a, long long int b, long long int u, vector<long long int> &t) { long long int i, j, k, n; for (i = 1; i < b; i++) { if (u) t[i]++; } u = 1 - u; i = b; while (i < 1000) { for (j = 0; j < a; j++) { ...
#include <bits/stdc++.h> using namespace std; int n, q, x, y; char type; map<int, pair<char, int> > Data; int solve() { auto fi = Data.lower_bound(x); if (fi->first == x) return 0; if (type == L ) fi--; int ans = abs(x - fi->first); if (fi->second.first == type) ans += fi->second.second; ...
#include <bits/stdc++.h> using namespace std; const int M = 15, N = 15; int m, n; pair<int, int> a[M], b[N]; vector<int> tot, cur; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cin >> m >> n; for (int i = 1; i <= m; i++) { cin >> a[i].first >> a[i].second; } ...
#include <bits/stdc++.h> using namespace std; int main() { int a, b, t, i; cin >> t; for (i = 0; i < t; i++) { cin >> a >> b; cout << a + b; cout << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; long long k, b, n, t, ans, cur; int main() { ios_base::sync_with_stdio(0); cin >> k >> b >> n >> t; ans = n; cur = k + b; while (cur <= t) { cur = cur * k + b; --ans; } if (ans < 0) ans = 0; cout << ans << endl; cin.get(...
#include <bits/stdc++.h> using namespace std; const int maxn = 100010; int n, q, L[maxn << 2], R[maxn << 2]; double sum[maxn << 2], add[maxn << 2], mul[maxn << 2]; void pushup(int o) { sum[o] = sum[o * 2] + sum[o * 2 + 1]; } void pushdown(int o) { sum[o * 2] = sum[o * 2] * mul[o] + add[o] * (R[o * 2] - ...
#include <bits/stdc++.h> using namespace std; void connected(vector<vector<bool> > chu, vector<bool>& v, int s) { v[s] = 1; for (int i = 0; i < chu.size(); i++) { if (chu[s][i] && !v[i]) { connected(chu, v, i); } } } int main() { int n, m; while (cin >> n >> m) { if...
#include <bits/stdc++.h> int n, m, op, det; int dir[2]; long long mv[2]; int ans[1111111]; int main() { scanf( %d%d , &n, &m); dir[1] = 1; dir[0] = -1; mv[1] = mv[0] = 0LL; for (int i = 0; i < m; i++) { scanf( %d , &op); if (op == 1) { scanf( %d , &det); mv[1] +...
#include <bits/stdc++.h> using namespace std; mt19937 Rand(time(0)); const int maxn = 1e5 + 5; const long long maxc = 1e9 + 7; int n, m, d, a[maxn]; long long sum[maxn]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> d >> m; for (int i = (1); i <= (n); ...
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; const long long inf = 0x3f3f3f3f; const long long llinf = 1e18; const long long nax = 0; int n, m, batas; vector<pair<int, int>> shift; set<char> simpen; map<char, bool> sabi; int main() { ios_base::sync_with_stdio(0); ...
#include <bits/stdc++.h> using namespace std; const int N = 55, mod = 1LL * 1000 * 1000 * 1000 + 7; int dp[N][N][2], ans[N][N][2], n, cnt50, cnt100, W, c[N][N], seen[N][N]; bool vis[N][N][2], vis2[N][N][2]; int C(int r, int n) { if (r == 0 \|\| r == n) return 1; if (r > n) return 0; if (seen[r][n]) ...
#include <bits/stdc++.h> using namespace std; const int maxN = 100005; const int inf = 2147483647; long long f[maxN], s[maxN], ans[maxN]; int n, m, c, g, r, l[maxN], a[maxN], sa[maxN]; int t[maxN * 8], b[maxN], h, mm; int query(int l, int r) { l = lower_bound(b + 1, b + 1 + c, l) - b; r = upper_bo...
#include <bits/stdc++.h> using namespace std; long long n, m, k; int main() { cin >> n >> m >> k; if (k > n + m - 2) { cout << -1 << endl; return 0; } long long ans1, ans2; if (k >= m) { ans1 = n / (k - m + 2); } else { ans1 = (m / (k + 1)) * n; } if (k >= n...
#include <bits/stdc++.h> using namespace std; int N, M, dbg[100005]; pair<int, int> A[100005]; map<int, int> mp; int main() { scanf( %d , &N); for (int i = 0; i < N; i++) { int a; scanf( %d , &a); mp[a]++; } for (map<int, int>::iterator it = mp.begin(); it != mp.end(); it++) ...
#include <bits/stdc++.h> int aa[120][5], kk[5]; int solve(int bb, int n) { int k, sum1, sum2, j, bad; sum1 = sum2 = 0; for (j = 0; j < 5; j++) { if (aa[0][j] != -1) sum1 += (bb[j] + 1) (250 - aa[0][j]) * 2; if (aa[1][j] != -1) sum2 += (bb[j] + 1) * (250 - aa[1][j]) * 2; } if (sum1...
#include <bits/stdc++.h> using namespace std; char s[1000010]; int n; bool check(int len) { int now = 0, lft = 0; bool flag = 1; for (int i = 0; i < n; i++) { if (s[i] == R ) { flag = 0; if (now + 1 != len) now++; } else now--; if (now < lft) { lft ...
#include <bits/stdc++.h> using namespace std; int n, m, cnt, flag; vector<int> graph[100005]; bool vis[100005]; void dfs(int node, int parent) { vis[node] = 1; int x, u, v, i; cnt++; for (i = 0; i < graph[node].size(); i++) { v = graph[node][i]; if (v == parent) continue; if ...
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; vector<int> g(n); int mm = 99999; for (int i = 0; i < n; i++) { cin >> g[i]; mm = min(mm, abs(g[i])); } sort(g.begin(), g.end()); int rest = k; for (int i = 0; i < k; i++) { if (...
#include <bits/stdc++.h> using namespace std; vector<pair<int, int>> g[500010]; int rad[2][500010], tata[500010], niv[500010]; char in[500010], vaz[500010], tip[500010]; struct edge { int x, y, c; }; edge v[500010]; int radacina(int x, int t) { int y = x; while (y != rad[t][y]) y = rad[t][y]...
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; long long rot = 0; long long last = 0; long long ans; for (int i = 0; i < m; i++) { long long t; cin >> t; if (last > t) { rot++; } last = t; } ans = rot * n + la...
#include <bits/stdc++.h> using namespace std; int f(int y) { return y % 400 == 0 ? 2 : y % 100 == 0 ? 1 : y % 4 == 0 ? 2 : 1; } int main() { int n, r = 0, t; scanf( %d , &n); t = f(n); while (r % 7 != 0 \|\| r == 0 \|\| t != f(n)) { r += f(n); n++; } printf( %d n , n); re...
#include <bits/stdc++.h> using namespace std; long long binSearch(long long n, long long pow2) { long long L = 0, R = (n / pow2) + 10, M; while (R - L > 1) { M = (L + R) / 2; double dM = M + 0.0; if ((2.0 * dM + 1.0) * (pow2 + dM - 1.0) < n + 0.0) L = M; else R = M; ...
#include <bits/stdc++.h> using namespace std; int max(int a, int b) { return a > b ? a : b; } pair<int, int> a[100], ans[1000], p; vector<pair<int, int>> v; int main() { int n, k; cin >> n >> k; for (int i = 0; i < n; i++) { cin >> a[i].first; a[i].second = i + 1; } sort(a, a +...
#include <bits/stdc++.h> using namespace std; vector<double> E[100010]; int color[100010]; int seen[100010]; set<int> sets[100010]; void dfs(int u) { for (int i = 0; i < E[u].size(); ++i) { int v = E[u][i]; if (color[u] != color[v]) sets[color[u]].insert(color[v]); if (!seen[v]) { ...
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, d, e, f; cin >> a >> b >> c >> d >> e >> f; cout << (a + b + c) * (a + b + c) - (a * a + c * c + e * e); return 0; }
#include <bits/stdc++.h> using namespace std; using ll = long long; const ll N = 1e6 + 100; ll n; ll m; ll arr() { ll res = new ll [n + 2]; for (ll i = 0; i < n + 2; ++i) { res[i] = new ll[m + 2]; fill_n(res[i], m + 2, 0); } return res; } ll inp; ll *ans; void pre...
#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0, f = 1; char ch = getchar(); while (ch < 0 \|\| ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = (x << 1) + (x << 3) + (ch ^ 48); ch = getchar(); } ...
#include <bits/stdc++.h> using namespace std; const int MOD = 998244353; const int INF = 2000000000; const long long BIG = 1446803456761533460LL; const int maxn = 5010; int n, m, k, dp[maxn][maxn]; int poww(int a, int b) { int r = 1; while (b) { if (b & 1) r = (1LL * (r) * (a)) % MOD; ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 100000; int prime[MAXN + 1]; void getPrime() { memset(prime, 0, sizeof(prime)); for (int i = 2; i <= MAXN; i++) { if (!prime[i]) prime[++prime[0]] = i; for (int j = 1; j <= prime[0] && prime[j] <= MAXN / i; j++) { prime[p...

#include <bits/stdc++.h> using namespace std; int main() { int n, m, k; cin >> n >> m >> k; vector<vector<int>> v; vector<int> cur; if ((n * m) % k == 0) { int div = (n * m) / k; for (int i = 0; i < n; i++) { if (!(i & 1)) { for (int j = 0; j < m; j++) { ...

#include <bits/stdc++.h> using namespace std; const int N = (int)1e5 + 7; int n; int v[N], f[N]; bool e[N]; int st, dr; bool ok(int l, int r) { for (int i = 1; i <= n; i++) { e[i] = 0; f[i] = 0; } for (int i = l; i <= r; i++) { e[i] = 1; f[v[i]]++; } for (int i ...

#include <bits/stdc++.h> using namespace std; long long a1, a2, b1, b2, c1, c2; void rec(long long p, long long q) { long long mod = c1 * c1 + c2 * c2; if ((p * c1 + q * c2) % mod == 0 && (q * c1 - p * c2) % mod == 0) { puts( YES ); exit(0); } } int main() { scanf( %I64d%I64d%I64d%...

#include <bits/stdc++.h> using namespace std; int main() { int l, r, x, y; double k; cin >> l >> r >> x >> y >> k; bool flag = false; double value; while (x <= y) { value = (double)x * k; if (value >= l && value <= r) { flag = true; break; } x++; }...

#include <bits/stdc++.h> using namespace std; const int N = 500005; const int inf = 1000 * 1000 * 1000; const int mod = 998244353; int n; vector<int> g[N]; int dp[N][3]; int sz[N][3]; void dfs(int v, int p) { dp[v][0] = dp[v][1] = 0; sz[v][0] = 1; sz[v][1] = 0; for (int i = 0; i < (int...

#include <bits/stdc++.h> using namespace std; struct Tpoint { double x, y; } v[200], pg[200]; struct Tline { Tpoint a, b; } ls[200]; int n, tot, q[200], ord[200]; double at2[200]; double getdouble() { double d = 0, d2, d3; char ch = ; bool flag = false; while (!isdigit(ch = ge...

#include <bits/stdc++.h> using namespace std; int a[200005]; int b[200005]; int c[200005]; char str1[200005]; char str2[200005]; int main() { int n; while (scanf( %d , &n) != EOF) { cin >> str1 >> str2; int i; for (i = 0; i < n; i++) { a[i] = str1[i] - a ; b[i] =...

#include <iostream> #include <string> #include <algorithm> #include <map> #include <vector> #include <cmath> #include <queue> #include <set> #include <bitset> using namespace std; typedef long long ll; ll MOD = 1000000007; void solve(int testCase) { ll n; cin >> n; for (int i...

#include <bits/stdc++.h> using namespace std; template <typename T> inline void chkmin(T &a, const T &b) { a = a < b ? a : b; } template <typename T> inline void chkmax(T &a, const T &b) { a = a > b ? a : b; } const int MAXN = 150005, MAXT = 300005; int sz[MAXN], val[MAXN], vis[MAXN], n, tot; ...

#include <bits/stdc++.h> using namespace std; int arr[200007]; int brr[200007]; int main() { int t; cin >> t; while (t--) { int n, x; cin >> n >> x; map<int, int> mpp; for (int i = 0; i < n; i++) { cin >> arr[i]; mpp[arr[i]]++; } int cnt = 0; ...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 1; int mark[N], t[N], n; long long res; int main() { ios::sync_with_stdio(0); cin.tie(0); ; cin >> n; for (int i = (1); i <= (n); i += (1)) cin >> mark[i]; int cur = 0; for (int i = (n); i >= (1); i -= (1)) { c...

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

#include <bits/stdc++.h> using namespace std; namespace Base { const int inf = 0x3f3f3f3f, INF = 0x7fffffff; const long long infll = 0x3f3f3f3f3f3f3f3fll, INFll = 0x7fffffffffffffffll; template <typename T> void read(T &x) { x = 0; int fh = 1; double num = 1.0; char ch = getchar(); while...

#include <bits/stdc++.h> using namespace std; int main() { int n, a[100000], p[100000]; cin >> n; for (int i = 0; i < n; ++i) cin >> a[i] >> p[i]; for (int i = 1; i < n; ++i) p[i] = min(p[i], p[i - 1]); int ans = 0; for (int i = 0; i < n; ++i) ans += p[i] * a[i]; cout << ans << endl; }...

#include <bits/stdc++.h> using namespace ::std; const long long maxn = 52; const long long mod = 1e9 + 7; const long long inf = 1e9 + 500; long long dp[2][maxn][maxn][maxn][maxn]; long long d[maxn]; bool bit; long long kv; void add(long long a, long long b, long long c, long long d, long long z) { ...

#include <bits/stdc++.h> using namespace std; int main() { int n, k, m = 1e9 + 7; cin >> n >> k; int a[100005]; a[0] = 1; for (int i = 1; i < 100005; ++i) { if (i >= k) { a[i] = (a[i - k] + a[i - 1]) % m; } else { a[i] = a[i - 1]; } } for (int i = 1; i <...

#include <bits/stdc++.h> using namespace std; void write(vector<int> &v) { for (auto i : v) cout << i << ; cout << n ; } void read(vector<int> &v) { for (auto &i : v) cin >> i; } const int INF = 1e9; const int64_t INFF = 1e18; const int N = 1e6 + 69; void solve() { int n; cin ...

#include <bits/stdc++.h> using namespace std; const long long p = 1e9 + 7; inline long long read() { long long neg = 1, num = 0; char c = getchar(); for (; !isdigit(c); c = getchar()) if (c == - ) neg = -1; for (; isdigit(c); c = getchar()) num = (num << 1) + (num << 3) + c - 0 ; retur...

#include <bits/stdc++.h> using namespace std; int num[100020], nxt[100020]; struct point { int st, en, num; } pnt[100020 * 4]; int max1(int a, int b) { if (a > b) return a; return b; } int main() { int n, sum = 0, cnt = 0, besti, min1 = 1 << 25, tmp, i; scanf( %d , &n); num[n + 1] ...

#include <bits/stdc++.h> using namespace std; map<string, int> mp; map<int, string> g; int n, k, cnt; char name1[10100][30], name2[10100][30]; int mark[1010][1010]; int x[10100], y[10100], tt[10100]; int ans[10100], num; struct Node { int l, r; } node[10100]; struct Mark { int l, r; Ma...

#include <bits/stdc++.h> using namespace std; const int N = 100010; const int LG_N = 20; struct node { int l, r, cnt; node *left, *right; node(int _l, int _r, int _c = 0) : l(_l), r(_r), cnt(_c) {} }; node *init(int l, int r) { node *p = new node(l, r); if (l < r) { int mid = (l + ...

#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 5; int a[maxn], n, s, b[maxn], num[maxn], len; int ufs[maxn], meme[maxn]; inline int find(int u) { if (ufs[u] == u) return u; else return ufs[u] = find(ufs[u]); } inline void join(int u, int v, int e) { u = find(u...

#include <bits/stdc++.h> using namespace std; const int N = 2005; struct poke { double p, q; } srt[N]; inline bool cmp1(poke a, poke b) { return a.p > b.p || a.p == b.p && a.q > b.q; } inline bool cmp2(poke a, poke b) { return a.p - a.p * a.q > b.p - b.p * b.q; } double f[N]; int n, a, b; do...

#include <bits/stdc++.h> using namespace std; signed main() { long long t; cin >> t; while (t--) { long long n; cin >> n; char c; cin >> c; string str; cin >> str; long long ctr = 0; long long k = 0; for (long long i = 0; i < n; i++) { if (st...

#include <bits/stdc++.h> using namespace std; int a[105], b[105]; long long tinh(long long x, int n, int nc) { long long i, cnt = 0; for ((i) = (1); (i) <= (n); (i)++) { cnt += (((long long)a[i] * x) / b[i]) + 1; if (cnt > nc) return 1001001001; } return cnt; } void input() { i...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:1000000000 ) using namespace std; const bool db = false; int n, m, x, y; int a[1010][1010], b[1010][1010]; long long s[1010][1010], cs[1010][1010]; vector<pair<int, int> > ans; char mark[1010][1010]; pair<long long, pair<int, int> > st[1010 * 10...

#include <bits/stdc++.h> using namespace std; template <class T> void _p(T a) { cout << a << n ; } template <class T> void _pa(T a) { cout << a << ; } template <class T1, class T2> void _p(T1 a, T2 b) { cout << a << << b << n ; } template <class T1, class T2, class T3> voi...

#include <bits/stdc++.h> using namespace std; bool pd[5005][5005]; char str[5005]; int n; bool vis[5050]; bool dfs(int u, int lst) { vis[u] = 1; for (int i = 1; i <= n; ++i) { if (!pd[u][i]) continue; if (lst != -1 && pd[i][lst]) { printf( %d %d %d n , lst, u, i); return ...

#include <bits/stdc++.h> int main() { int i, n, m, count = 0; scanf( %d%d , &n, &m); while (n > 0 && m > 0) { if (n > m && n >= 2) { n -= 2; m--; count++; } else if (m > n && m >= 2) { m -= 2; n--; count++; } else if (n == m && m >= 2) { ...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); long long n, m, k; cin >> n >> m >> k; long long s = 2 * n * m; if (s % k != 0) { cout << NO ; return 0; } s /= k; long long x2, x3, y2, y3; x2 = n; if (s % n ...

#include <bits/stdc++.h> using namespace std; void prepare() {} void solve() { string s; cin >> s; set<int> ss[26]; for (int i = 0; i < s.size(); ++i) ss[s[i] - a ].insert(i); int i = 25; int cur = -1; while (i != -1) { if (ss[i].empty()) { --i; continue; }...

#include <bits/stdc++.h> using namespace std; const int M = 200005; const int N = 900005; struct node { int son[27]; int fa; } a[N]; int sz; char s[N]; int mat[M]; vector<int> over[N]; inline int new_id() { ++sz; over[sz].clear(); for (int i = (1); i <= (26); i++) a[sz].son[i] = ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); double s, x, y, z; cin >> s >> x >> y >> z; if ((x == y) && (y == z) && (z == 0.0)) { cout << 0 0 << s << endl; return 0; } double k = x + y + z,...

#include <bits/stdc++.h> using namespace std; double xx[10], yy[10]; int main() { double px, py, vx, vy, a, b, c, d; cin >> px >> py >> vx >> vy >> a >> b >> c >> d; double x = vx / sqrt(vx * vx + vy * vy); double y = vy / sqrt(vx * vx + vy * vy); xx[1] = b * x + px; yy[1] = b * y + py; ...

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

#include <bits/stdc++.h> using namespace std; long long int pwr(long long int base, long long int p, long long int mod) { long long int ans = 1; while (p) { if (p & 1) ans = (ans * base) % mod; base = (base * base) % mod; p /= 2; } return ans; } long long int gcd(long long int ...

#include <bits/stdc++.h> using namespace std; const int N = 22; int d, p, q; int c[N][N], s[5555]; int a[N][N], b[N][N], f[N]; int fpow(int x, int y = p - 2) { if (!y) return 1; long long z = fpow(x, y >> 1); z = z * z % p; if (y & 1) z = z * x % p; return z; } int w; void pr(int x...

#include <bits/stdc++.h> using namespace std; const long long inf = 1ll << 18; long long a, b, top, now; queue<long long> q; map<long long, int> mp; long long rev(long long x) { long long y = 0; while (x != 0) { y = (y << 1) | (x & 1); x >>= 1; } return y; } void push(long lo...

#include <bits/stdc++.h> using namespace std; template <class T1, class T2> ostream& operator<<(ostream& os, const pair<T1, T2>& v) { os << ( << v.first << << v.second << ) ; return os; } template <typename T, typename U = typename T::value_type, typename = typename enable_if<!is_sa...

#include <bits/stdc++.h> using namespace std; struct par { int x, y, label; par(int _x, int _y, int _label) { x = _x; y = _y; label = _label; } par() {} }; bool operator<(par p1, par p2) { if (p1.x != p2.x) return p1.x < p2.x; return p1.y < p2.y; } int main() { ...

#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; inline int read() { int w = 1, s = 0; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) w = -1; ch = getchar(); } while (isdigit(ch)) { s = s * 10 + ch - 0 ; ch = getchar(); } retur...

#include <bits/stdc++.h> using namespace std; const int MAXN = 4e5 + 10; int n, m, k, t; bool vis[MAXN], ans[MAXN]; int v[MAXN]; set<int> p[MAXN]; priority_queue<pair<int, int> > pq; int main() { cin >> n >> m; memset(vis, false, sizeof(vis)); memset(ans, false, sizeof(ans)); for (int i ...

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

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> b[5001]; for (int i = 0; i < n; i++) { string s; int a, b1, c; cin >> s >> a >> b1; if (s[0] == M ) c = 0; else c = 1; b[i].push_back(c); b[i].push_back(...

#include <bits/stdc++.h> using namespace std; long long int n, m, ar[1000005], sum, t, ar2[1000005]; vector<int> ans; vector<pair<int, char> > res; int main() { cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(false); cin >> n; for (long long int i = 1; i <= n; i++) cin >> ar[i]; cin...

#include <bits/stdc++.h> const int N = 100010; const long long INF = 1ll << 60; const int inf = 0x3f3f3f3f; int t; int n, m, k; int a[N]; int b[N]; std::vector<int> row[N]; std::vector<int> col[N]; int cur; int r, c; long long ans; int main() { scanf( %d%d%d , &n, &m, &k); for (int i =...

#include <bits/stdc++.h> using namespace std; void solve() { int n; cin >> n; cout << n / 2 + 1 << n ; } int main() { int tc, cse = 0; cin >> tc; while (tc--) solve(); }

#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 7; int ans[maxn]; int lowbit(int x) { return x & -x; } bool is_two(int x) { return x == lowbit(x); } bool dfs(int n, int k, int id) { if (k == 1) { printf( %d %d %d n , n, k, id); if (is_two(n)) { return false; ...

#include <bits/stdc++.h> using namespace std; const long long N = 1e6 + 1, inf = 1e18; vector<pair<long long, long long> > a, b; vector<pair<pair<long long, long long>, long long> > z; long long add[4 * N], t[4 * N]; void push(long long v, long long l, long long r) { t[v] += add[v]; if (l != r - 1) ...

#include <bits/stdc++.h> using namespace std; string s; string rev(string s) { string p; for (auto i : s) p.insert(0, 1, i); return p; } int main() { cin >> s; int n = s.size(); for (int i = 0; i <= s.size(); i++) for (int j = 0; j < 26; j++) { string p = s; p.ins...

#include <bits/stdc++.h> struct PP { int l, r, sum, lv, rv, cover; int mid() { return (l + r) >> 1; } void doit() { sum = lv = rv = cover ? 0 : dis(); } int dis() { return r - l; } } q[100005 * 3]; int max(int a, int b) { return a > b ? a : b; } void Build(int l, int r, int x) { q[x].l = l; ...

#include <bits/stdc++.h> using namespace std; const int mxN = 200000; int n, m, t, tin[mxN]; vector<int> adj[mxN], e[mxN]; vector<array<int, 3>> ans; void dfs(int u, int p = -1) { tin[u] = ++t; if (p ^ -1) e[u].push_back(p); for (int v : adj[u]) { if (v == p) continue; if (!tin[v]) {...

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

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long n; cin >> n; if (n == 47 || n == 74 || n == 477 || n == 477) cout << YES ; else if (n % 4 == 0 || n % 7 == 0 || n % 47 == 0) cout << YES ; ...

#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { if (a == 0) return b; return gcd(b % a, a); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; int n, arr[105]; cin >> n; for (int i = 0; i < n; i++) cin >> arr[i]; int an...

#include <bits/stdc++.h> using namespace std; int main() { int n, m, r; cin >> n >> m >> r; vector<int> v(n); vector<int> v1(m); for (int i = 0; i < n; i++) { cin >> v[i]; } for (int i = 0; i < m; i++) { cin >> v1[i]; } sort(v.begin(), v.end()); sort(v1.rbegin(), ...

#include <bits/stdc++.h> using namespace std; int ured() { int re = 0, ch; do { ch = getchar(); } while ( 9 < ch || ch < 0 ); do { re = re * 10 + (ch ^ 0 ); } while ( 0 <= (ch = getchar()) && ch <= 9 ); return re; } void uwit(int da) { int cn = 0, ch[21]; do { ...

#include <bits/stdc++.h> using namespace std; long long n, k, res = 1; long long a[100005]; long long b[100005]; long long d = 1, ans; int main() { cin >> n >> k; for (int i = 0; i < k; i++) d *= 10; for (int i = 0; i < n / k; i++) cin >> a[i]; for (int i = 0; i < n / k; i++) cin >> b[i]; ...

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

#include <bits/stdc++.h> using namespace std; long double PI = acosl(-1); bool compare_int(int a, int b) { return (a > b); } bool compare_string(string a, string b) { return a.size() < b.size(); } bool compare_pair(const pair<int, int> &a, const pair<int, int> &b) { if (a.second == b.second) return ...

#include <bits/stdc++.h> using namespace std; void abc() { cout << endl; } template <typename T, typename... U> void abc(T a, U... b) { cout << a << , abc(b...); } template <typename T> void printv(T l, T r) { while (l != r) cout << *l << n [++l == r]; } template <typename A, typename B>...

#include <bits/stdc++.h> int main() { int t, res = 0; long x, y, n; std::cin >> t; for (int i = 0; i < t; i++) { std::cin >> x >> y >> n; if (n > 0) { res = (n - y) % x; std::cout << n - res << n ; } else { std::cout << 0 << n ; } } }

#include <bits/stdc++.h> using namespace std; int N, i, j; string S, R; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> N >> S; for (i = N - 2; i >= 0; i -= 2) { R = R + S[i]; } if (N % 2 == 0) i = 1; else i = 0; for (i = i; i < N;...

#include <bits/stdc++.h> template <typename T> inline void read(T &x) { x = 0; char c = getchar(); bool flag = false; while (!isdigit(c)) { if (c == - ) flag = true; c = getchar(); } while (isdigit(c)) x = x * 10 + (c ^ 48), c = getchar(); if (flag) x = -x; } using names...

#include <bits/stdc++.h> using namespace std; long long i, j, t, n, k, a, b; double v; string line; char s[4]; int main() { while (cin >> n >> a >> b) { if (b < 0) b = n + b; a = a + b; a = a % n; if (a == 0) a = n; else if (a < 0) a = n + a; cout << a...

#include <bits/stdc++.h> using namespace std; const int N = 300005; pair<int, int> p[N]; int main() { int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); int i = 0, j = 0; while (j < n) { if (a[i] < a[j]) i++; j++; } cout << i << en...

#include <bits/stdc++.h> const int INF = (int)1e9; using namespace std; const int MAX = 1e3 + 5; int n, xa, ya, xb, yb; pair<pair<int, int>, int> arr[MAX]; vector<pair<int, int> > vec; bool covered(int x1, int y1, int x2, int y2, int R) { double dist = sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2...

#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 5; int n, m, fa[N], f[N], d[N], head[N], xx, yy, ww, fr[N]; int ans; bool in[N], c[N]; struct nd { int x, y, w, id; } a[N]; bool operator<(nd a, nd b) { return a.w < b.w || (a.w == b.w && a.id < b.id); } struct ndd { int ne, to,...

#include <bits/stdc++.h> using namespace std; struct point { long long x, y, z; point() {} point(long long a, long long b, long long c) : x(a), y(b), z(c) {} double operator()(point y) { return sqrt((this->x - y.x) * (this->x - y.x) + (this->y - y.y) * (this->y - y.y) + ...

#include <bits/stdc++.h> using namespace std; int N, M; int d[300010]; int h[300010]; pair<long long, int> L[8 * 300010]; pair<long long, int> R[8 * 300010]; void aggL(int nodo, int left, int right, int pos, long long val) { if (left == right) { L[nodo] = pair<long long, int>(val, pos); re...

#include <bits/stdc++.h> using namespace std; const long long N = 200005, INF = 2000000000000000000; long double pi = 3.1415926535897932; long long powere(long long a, long long b, long long p) { if (a == 0) return 0; long long res = 1; a %= p; while (b > 0) { if (b & 1) res = (res * a) % ...

#include <bits/stdc++.h> using namespace std; void fun(long long int a, long long int b, long long int u, vector<long long int> &t) { long long int i, j, k, n; for (i = 1; i < b; i++) { if (u) t[i]++; } u = 1 - u; i = b; while (i < 1000) { for (j = 0; j < a; j++) { ...

#include <bits/stdc++.h> using namespace std; int n, q, x, y; char type; map<int, pair<char, int> > Data; int solve() { auto fi = Data.lower_bound(x); if (fi->first == x) return 0; if (type == L ) fi--; int ans = abs(x - fi->first); if (fi->second.first == type) ans += fi->second.second; ...

#include <bits/stdc++.h> using namespace std; const int M = 15, N = 15; int m, n; pair<int, int> a[M], b[N]; vector<int> tot, cur; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cin >> m >> n; for (int i = 1; i <= m; i++) { cin >> a[i].first >> a[i].second; } ...

#include <bits/stdc++.h> using namespace std; int main() { int a, b, t, i; cin >> t; for (i = 0; i < t; i++) { cin >> a >> b; cout << a + b; cout << endl; } return 0; }

#include <bits/stdc++.h> using namespace std; long long k, b, n, t, ans, cur; int main() { ios_base::sync_with_stdio(0); cin >> k >> b >> n >> t; ans = n; cur = k + b; while (cur <= t) { cur = cur * k + b; --ans; } if (ans < 0) ans = 0; cout << ans << endl; cin.get(...

#include <bits/stdc++.h> using namespace std; const int maxn = 100010; int n, q, L[maxn << 2], R[maxn << 2]; double sum[maxn << 2], add[maxn << 2], mul[maxn << 2]; void pushup(int o) { sum[o] = sum[o * 2] + sum[o * 2 + 1]; } void pushdown(int o) { sum[o * 2] = sum[o * 2] * mul[o] + add[o] * (R[o * 2] - ...

#include <bits/stdc++.h> using namespace std; void connected(vector<vector<bool> > chu, vector<bool>& v, int s) { v[s] = 1; for (int i = 0; i < chu.size(); i++) { if (chu[s][i] && !v[i]) { connected(chu, v, i); } } } int main() { int n, m; while (cin >> n >> m) { if...

#include <bits/stdc++.h> int n, m, op, det; int dir[2]; long long mv[2]; int ans[1111111]; int main() { scanf( %d%d , &n, &m); dir[1] = 1; dir[0] = -1; mv[1] = mv[0] = 0LL; for (int i = 0; i < m; i++) { scanf( %d , &op); if (op == 1) { scanf( %d , &det); mv[1] +...

#include <bits/stdc++.h> using namespace std; mt19937 Rand(time(0)); const int maxn = 1e5 + 5; const long long maxc = 1e9 + 7; int n, m, d, a[maxn]; long long sum[maxn]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> d >> m; for (int i = (1); i <= (n); ...

#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; const long long inf = 0x3f3f3f3f; const long long llinf = 1e18; const long long nax = 0; int n, m, batas; vector<pair<int, int>> shift; set<char> simpen; map<char, bool> sabi; int main() { ios_base::sync_with_stdio(0); ...

#include <bits/stdc++.h> using namespace std; const int N = 55, mod = 1LL * 1000 * 1000 * 1000 + 7; int dp[N][N][2], ans[N][N][2], n, cnt50, cnt100, W, c[N][N], seen[N][N]; bool vis[N][N][2], vis2[N][N][2]; int C(int r, int n) { if (r == 0 || r == n) return 1; if (r > n) return 0; if (seen[r][n]) ...

#include <bits/stdc++.h> using namespace std; const int maxN = 100005; const int inf = 2147483647; long long f[maxN], s[maxN], ans[maxN]; int n, m, c, g, r, l[maxN], a[maxN], sa[maxN]; int t[maxN * 8], b[maxN], h, mm; int query(int l, int r) { l = lower_bound(b + 1, b + 1 + c, l) - b; r = upper_bo...

#include <bits/stdc++.h> using namespace std; long long n, m, k; int main() { cin >> n >> m >> k; if (k > n + m - 2) { cout << -1 << endl; return 0; } long long ans1, ans2; if (k >= m) { ans1 = n / (k - m + 2); } else { ans1 = (m / (k + 1)) * n; } if (k >= n...

#include <bits/stdc++.h> using namespace std; int N, M, dbg[100005]; pair<int, int> A[100005]; map<int, int> mp; int main() { scanf( %d , &N); for (int i = 0; i < N; i++) { int a; scanf( %d , &a); mp[a]++; } for (map<int, int>::iterator it = mp.begin(); it != mp.end(); it++) ...

#include <bits/stdc++.h> int aa[120][5], kk[5]; int solve(int *bb, int n) { int k, sum1, sum2, j, bad; sum1 = sum2 = 0; for (j = 0; j < 5; j++) { if (aa[0][j] != -1) sum1 += (bb[j] + 1) * (250 - aa[0][j]) * 2; if (aa[1][j] != -1) sum2 += (bb[j] + 1) * (250 - aa[1][j]) * 2; } if (sum1...

#include <bits/stdc++.h> using namespace std; char s[1000010]; int n; bool check(int len) { int now = 0, lft = 0; bool flag = 1; for (int i = 0; i < n; i++) { if (s[i] == R ) { flag = 0; if (now + 1 != len) now++; } else now--; if (now < lft) { lft ...

#include <bits/stdc++.h> using namespace std; int n, m, cnt, flag; vector<int> graph[100005]; bool vis[100005]; void dfs(int node, int parent) { vis[node] = 1; int x, u, v, i; cnt++; for (i = 0; i < graph[node].size(); i++) { v = graph[node][i]; if (v == parent) continue; if ...

#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; vector<int> g(n); int mm = 99999; for (int i = 0; i < n; i++) { cin >> g[i]; mm = min(mm, abs(g[i])); } sort(g.begin(), g.end()); int rest = k; for (int i = 0; i < k; i++) { if (...

#include <bits/stdc++.h> using namespace std; vector<pair<int, int>> g[500010]; int rad[2][500010], tata[500010], niv[500010]; char in[500010], vaz[500010], tip[500010]; struct edge { int x, y, c; }; edge v[500010]; int radacina(int x, int t) { int y = x; while (y != rad[t][y]) y = rad[t][y]...

#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; long long rot = 0; long long last = 0; long long ans; for (int i = 0; i < m; i++) { long long t; cin >> t; if (last > t) { rot++; } last = t; } ans = rot * n + la...

#include <bits/stdc++.h> using namespace std; int f(int y) { return y % 400 == 0 ? 2 : y % 100 == 0 ? 1 : y % 4 == 0 ? 2 : 1; } int main() { int n, r = 0, t; scanf( %d , &n); t = f(n); while (r % 7 != 0 || r == 0 || t != f(n)) { r += f(n); n++; } printf( %d n , n); re...

#include <bits/stdc++.h> using namespace std; long long binSearch(long long n, long long pow2) { long long L = 0, R = (n / pow2) + 10, M; while (R - L > 1) { M = (L + R) / 2; double dM = M + 0.0; if ((2.0 * dM + 1.0) * (pow2 + dM - 1.0) < n + 0.0) L = M; else R = M; ...

#include <bits/stdc++.h> using namespace std; int max(int a, int b) { return a > b ? a : b; } pair<int, int> a[100], ans[1000], p; vector<pair<int, int>> v; int main() { int n, k; cin >> n >> k; for (int i = 0; i < n; i++) { cin >> a[i].first; a[i].second = i + 1; } sort(a, a +...

#include <bits/stdc++.h> using namespace std; vector<double> E[100010]; int color[100010]; int seen[100010]; set<int> sets[100010]; void dfs(int u) { for (int i = 0; i < E[u].size(); ++i) { int v = E[u][i]; if (color[u] != color[v]) sets[color[u]].insert(color[v]); if (!seen[v]) { ...

#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, d, e, f; cin >> a >> b >> c >> d >> e >> f; cout << (a + b + c) * (a + b + c) - (a * a + c * c + e * e); return 0; }

#include <bits/stdc++.h> using namespace std; using ll = long long; const ll N = 1e6 + 100; ll n; ll m; ll **arr() { ll **res = new ll *[n + 2]; for (ll i = 0; i < n + 2; ++i) { res[i] = new ll[m + 2]; fill_n(res[i], m + 2, 0); } return res; } ll **inp; ll **ans; void pre...

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

#include <bits/stdc++.h> using namespace std; const int MOD = 998244353; const int INF = 2000000000; const long long BIG = 1446803456761533460LL; const int maxn = 5010; int n, m, k, dp[maxn][maxn]; int poww(int a, int b) { int r = 1; while (b) { if (b & 1) r = (1LL * (r) * (a)) % MOD; ...