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

func_code_string stringlengths 59 71.4k
#include <bits/stdc++.h> #pragma comment(linker, /STACK:16777216 ) using namespace std; int n, m, jm; long long ans; int main() { cin >> n >> m >> jm; ans = ceil(1.0 * n / jm) * ceil(1.0 * m / jm) * ((n - 1) % jm + 1) * ((m - 1) % jm + 1); cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; const int mod = 998244353; const int N = 2e5 + 10, M = 1e6 + 10; long long f(long long x) { long long y = x + 1; if (x & 2) y /= 2; else x /= 2; return x * y; } void solve() { long long n; scanf( %lld , &n); long long x = ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, k; cin >> n >> k; string s[n]; set<string> store; for (int i = 0; i < n; i++) { cin >> s[i]; store.insert(s[i]); } int cnt = 0; for (int i ...
#include <bits/stdc++.h> using namespace std; bool debug; const int inf = 1e9 + 5; const long long INF = (long long)inf * inf; const int nax = 1e6 + 5; const int D = 2; const long long MM = 1000 * 1000 * 1000; const long long m[5] = {MM + 7, MM + 9, MM + 21, MM + 33, 333333361LL}; char sl[nax]; long...
#include <bits/stdc++.h> inline int read() { int x = 0, f = 0; register char ch = getchar(); for (; ch < 48 \|\| ch > 57; ch = getchar()) f \|= ch == - ; for (; ch > 47 && ch < 58; ch = getchar()) x = (x << 1) + (x << 3) + (ch ^ 48); return f ? ~x + 1 : x; } using namespace std; int t[70...
#include <bits/stdc++.h> using namespace std; typedef struct { long long loc; long long num; } amar; bool operator<(amar x, amar y) { if (x.num >= y.num) return false; else return true; } int main() { long long n, k, c[40]; char s[100005]; memset(c, 0, sizeof c); ...
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7, inv = 5e8 + 4; long long n, m, k; long long pow(long long base, long long exp) { long long res = 1; while (exp) { if (exp & 1) (res = base) %= mod; exp >>= 1; (base = base) %= mod; } return res; } ...
#include <bits/stdc++.h> using namespace std; vector<bool> flag_pr(10001000, 0), flag_pal(10001000, 0); vector<long long> prime_upto(10001000, 0), palin_upto(10001000, 0); int gcd(int a, int b) { if (a % b == 0) return b; else return gcd(b, a % b); } bool isPalin(int num) { int ret =...
#include <bits/stdc++.h> using namespace std; int main() { long long a, b; cin >> a >> b; int count = 0; for (int i = 0; (1LL << i) / 2 <= b; i++) { for (int j = 0; j < i - 1; j++) { long long n = (1LL << i) - 1 - (1LL << j); if (a <= n && n <= b) count++; } } cou...
#include <bits/stdc++.h> using namespace std; long long int func(vector<vector<long long int>> &d, vector<int> &v, int i, int k) { if (d[k][i - 1] != 0) return d[k][i - 1]; if (k && (i + v[i - 1] <= d[0].size())) { d[k][i - 1] = -1; long long int y = func(d, v, i + v[i - 1],...
#include <bits/stdc++.h> using namespace std; template <typename T> void maxtt(T& t1, T t2) { t1 = max(t1, t2); } template <typename T> void mintt(T& t1, T t2) { t1 = min(t1, t2); } bool debug = 0; int n, m, k; int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0}; string direc = RDLU ; long...
#include <bits/stdc++.h> using namespace std; int x, y, q; void exgcd(int a, int b) { int temp; if (b == 0) { x = 1; y = 0; q = a; } else { exgcd(b, a % b); temp = x; x = y; y = temp - a / b * y; } } int c3, c4, c5; int k3, k4, k5; int f, x0, Why_C...
#include <bits/stdc++.h> using namespace std; map<long long int, long long int> mp; int main() { int n, c = 0, x = 0, a[200], i, j; cin >> n; for (i = 0; i < n; i++) { cin >> a[i]; c += a[i]; } if (n == 1) x = 1; if (n == 2 && a[0] == a[1]) x = 1; if (x == 1) cout << ...
#include <bits/stdc++.h> using namespace std; const int mxN = 5e4 + 7; const int inf = 1e5 + 7; const long long mod = 1e5 + 7; const long long infll = 1e18 + 7; long long a[mxN], b[mxN]; map<long long, bool> mp; int n; bool check = false; bool ok(long long x) { for (int i = 1; i <= n; i++) a[i] ...
#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0, f = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) f = -1; ch = getchar(); } while (isdigit(ch)) x = x * 10 + ch - 0 , ch = getchar(); return x * f; } int n, a[300100], q; struct no...
#include <bits/stdc++.h> using namespace std; const int N = 1000051; long long n; string c; struct btree { int chnum; int child[2]; int num; int typ; int id; } tre[N]; int dfx[N][2]; int tot = 0; int has[N]; void predfs(int x) { if (tre[x].typ == 0) return; if (tre[x].typ...
#include <bits/stdc++.h> using namespace std; const long long maxn = 2e5 + 15; inline long long read() { long long x = 0, f = 1; char c = getchar(); while (c < 0 \|\| c > 9 ) { if (c == - ) f = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { x = (x << 1) + (x << 3) + c ...
#include <bits/stdc++.h> using namespace std; struct poi { int x, y; poi operator-(poi p) { return (poi){x - p.x, y - p.y}; } long long operator(poi p) { return 1ll x * p.y - 1ll * y * p.x; } } A[205], a[205]; bool cmp(poi x, poi y) { return x * y > 0; } bool turn(int x, int y, int z) { return ...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int a, b, c, d; cin >> a >> b >> c >> d; cout << max(a + b, c + d) << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; int n, m, sz; int par[4000005]; int findpar(int x) { if (par[x] == x) return par[x]; par[x] = findpar(par[x]); return par[x]; } int cr, cc; int pr, pc; void decode(int x) { if (x < m) { cr = 0; cc = x; } else if (x < m + n - 1...
#include <bits/stdc++.h> using namespace std; signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long r; cin >> r; if ((r - 1) % 2 == 0 && r > 3) cout << 1 << << (r - 3) / 2; else cout << NO ; }
#include <bits/stdc++.h> using namespace std; using ll = long long; int const nmax = 3000; int const modulo = 1000000007; char v[1 + nmax][1 + nmax]; int dp[1 + nmax][1 + nmax]; int solve(int x, int y, int x2, int y2) { for (int i = 1; i <= x2; i++) for (int j = 1; j <= y2; j++) dp[i][j] = 0; ...
#include <bits/stdc++.h> using namespace std; int fastpow(int a, int b) { int ans = 1; for (; b; b >>= 1, a = a * a) if (b & 1) ans = ans * a; return ans; } int num; int main() { int n; scanf( %d , &n); string a; cin >> a; for (int i = 0; i < a.length(); i++) n += (a[i] -...
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); for (int z = 0; z < n; z++) { long long a, b, c; cin >> a >> b; while ((c = a \| a + 1) <= b) a = (a \| a + 1); cout << a << endl; } return 0; }
#include <bits/stdc++.h> #pragma GCC optimize( O2 ) using namespace std; const double PI = atan(1.0) * 4; const int di[4] = {-1, 0, 1, 0}; const int dj[4] = {0, -1, 0, 1}; const long long INF = (long long)2e18 + 50; const int maximum = numeric_limits<int>::min(); const int minimum = numeric_limits<int>:...
#include <bits/stdc++.h> using namespace std; int n, k; const int N = 5050; int a[N]; int dp[N][N]; int cnt[N]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cerr.setstate(ios_base::failbit); cin >> n >> k; for (int i = 1; i < (n + 1); i++) cin >> a[i]; sort(a + 1, a +...
#include bits/stdc++.h using namespace std; #define ll long long #define llu unsigned long long #define PB push_back #define F first #define S second #define sz(a) ((ll)a.size()) const ll MOD = 1000000007; const ll INF = 1000000000000000007; #ifdef ONLINE_JUDGE #define ck(x...) #endif voi...
#include <bits/stdc++.h> using namespace std; const double eps = 0.001; const int mod = 1000000007; int main() { int n, pos, l, r, ans; scanf( %d%d%d%d , &n, &pos, &l, &r); if (l == 1 && r == n) ans = 0; else if (l == 1) ans = abs(pos - r) + 1; else if (r == n) ans = abs(po...
#include <bits/stdc++.h> using namespace std; int main() { long long int q, s1, s2, s3, w, m, e; vector<long long int> v; cin >> q; long long int n; for (int i = 0; i < q; i++) { cin >> n; long long int a[n]; s1 = 0; s2 = 0; s3 = 0; for (int j = 0; j < n; j++)...
#include <bits/stdc++.h> using namespace std; const int maxn = 5e5 + 10; const int inf = 1e9; struct node { int s, ind; } f[maxn]; int sum[maxn]; int cmp(node a, node b) { if (a.s == b.s) return a.ind < b.ind; return a.s < b.s; } int main() { int i, n, c, re = 0, value; scanf( %d%d...
#include <bits/stdc++.h> using namespace std; void print_err() { cerr << n ; } template <class T, class... Arg> void print_err(T x, Arg &&...args) { cerr << x << ; print_err(args...); } template <class T> void print_container(T &cont) { for (auto iter : cont) { cerr << iter << ; ...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; bool impr = false; bool taken[n + 1]; for (int i = 0; i <= n; i++) { taken[i] = false; } int notTaken = -1; for (int i = 0; i < n; i++) { ...
#include <bits/stdc++.h> using namespace std; long long int N, T; void solve() { cin >> N; vector<long long int> cnt(N + 1); long long int x; for (long long int i = 0; i < N; i++) { cin >> x; cnt[x]++; } long long int ans = 0; for (long long int s = 2; s <= 2 * N; s++) { ...
#include <bits/stdc++.h> using namespace std; char s[200001], out[20]; int len[200001]; int ans1[2000001], ans2[2000001]; vector<int> v[2000001]; int digit[6]; bool solve(int n, int i, int sum) { if (!i) { if (ans1[sum] >= 10) return false; ans2[n] = sum; return true; } for (...
#include <bits/stdc++.h> using namespace std; int main() { long long a, b, c; cin >> a >> b >> c; long long Min = min(a, b); Min = min(Min, c); long long day = 0; while (a + b + c >= 7 && a >= 3 && b >= 2 && c >= 2) { a -= 3; b -= 2; c -= 2; day += 7; } long l...
#include <bits/stdc++.h> using namespace std; template <typename Arg1> void ZZ(const char* name, Arg1&& arg1) { std::cerr << name << = << arg1 << endl; } template <typename Arg1, typename... Args> void ZZ(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, , ...
#include <bits/stdc++.h> #pragma GCC optimize(2) #pragma GCC optimize(3) using namespace std; int a[200011], b[200011]; struct song { int t; int id; bool operator<(song other) const { if (t != other.t) return t < other.t; return id < other.id; } }; struct oriSet { int tol =...
#include <bits/stdc++.h> using namespace std; long n, k, ar[200000]; long long reach[777777]; long long q; long long ans[777777]; multiset<long long> bst; multiset<long long>::iterator it; int main() { ios_base::sync_with_stdio(0); cin >> n >> k; for (int i = 1; i <= n; i++) cin >> ar[i]; ...
#include <bits/stdc++.h> using namespace std; int N, C; int A[1001]; vector<int> V; int main() { cin >> N; for (int i = 0; i < N; ++i) cin >> A[i]; for (int i = 0; i < N; ++i) { C = 1; for (int j = i; j < N - 1; ++j) { if (A[j] >= A[j + 1]) ++C; else ...
#include <bits/stdc++.h> using namespace std; const int nsz = 5e5; int n, rt = 1, t, l[nsz + 5], r[nsz + 5]; vector<int> g[nsz + 5]; void dfs(int u = rt, int p = rt) { for (int i = 0; i < g[u].size(); ++i) { int v = g[u][i]; if (v == p) continue; l[v] = ++t; } r[u] = ++t; for...
#include <bits/stdc++.h> using namespace std; inline long long Qmul(const long long &x, const long long &y, const long long &X) { long long k = (long long)((1.0L * x * y) / (1.0L * X)), t = x * y - k * X; t -= X; while (t < 0) t += X; return t; } class MillerRabin { pr...
#include <bits/stdc++.h> using namespace std; const int N = int(5e5) + 3; const int MOD = 998244353; const double PI = 4 * atan(1); const double eps = 1e-10; const long long oo = 1e10; const int K = 26; int n, m; int a[N], b[N], c[N], d[N], k[N]; vector<int> actors[N]; vector<int> pitch[N]; set<...
#include <bits/stdc++.h> using namespace std; const int TOUR = 1 << 18, INF = 0x3f3f3f3f; struct strq { int r1, r2, s1, s2, ind; strq() {} } q[TOUR]; struct event { int st, red, stup; strq qq; event(int st, int red, int stup, strq qq) : st(st), red(red), stup(stup), qq(qq) {} e...
#include <bits/stdc++.h> using namespace std; int nextt[200007], c[200007], vis[200007]; long long ans, n; template <class T> void read(T &x) { int f = 0; x = 0; char ch = getchar(); while (ch < 0 \|\| ch > 9 ) { f \|= (ch == - ); ch = getchar(); } while (ch >= 0 && ch <...
#include <bits/stdc++.h> using namespace std; int n, a[200015], i, n1; bool doit() { n1 = n - 1; for (i = 0; n1; ++i) { if (a[i] == a[i + 1]) { printf( :( ); return 0; } a[i] += n1; --n1; } for (i = 0; i < n; ++i) printf( %d , a[i]); } int main() { ...
#include <bits/stdc++.h> using namespace std; int main() { int n, m, a, b; while (cin >> n >> m >> a >> b) { a--; b--; int r1 = a / m, r2 = b / m; int c1 = a % m, c2 = b % m; if (r1 == r2) cout << 1 << endl; else if (c1 == 0 && c2 == m - 1) cout << 1 << en...
#include <bits/stdc++.h> using namespace std; struct IP { string nm; int a, b, c, d; }; int n, m; int test(IP a[], IP x) { for (int i = 0; i < n; i++) { if (a[i].a == x.a && a[i].b == x.b && a[i].c == x.c && a[i].d == x.d) return i; } return -1; } IP a[1000], b[1000]; i...
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) #pragma GCC target( sse4 ) using namespace std; template <class c> struct rge { c b, e; }; template <class c> rge<c> range(c i, c j) { return rge<c>{i, j}; } template <class c> auto dud(c* x) -> decltype(cerr << *x, 0); template <class ...
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; long long ans = 1; for (int i = k + 1; i <= n; i++) ans = (ans * (n - k)) % 1000000007; ans = (ans * (k)) % 1000000007; if (k - 1 > 0) { long long prod = 0; vector<int> v(k + 2); int loopval...
#include <bits/stdc++.h> using namespace std; int main() { int w; w = 1; while (w--) { int n, maxi = -1, b = 0; vector<int> s, t[10]; bool f1 = true, f = false; cin >> n; while (n > 0) { int x = n % 10; s.push_back(x); maxi = max(maxi, x); n ...
#include <bits/stdc++.h> using namespace std; const int N = 500010; long long x, y, m; int main() { ios_base::sync_with_stdio(false); cin >> x >> y >> m; if (x >= m \|\| y >= m) { cout << 0 n ; return 0; } if (x <= 0 && y <= 0) { cout << -1 n ; return 0; } if ...
#include <bits/stdc++.h> using namespace std; struct Point { double x, y; Point() : x(0), y(0) {} Point(double x, double y) : x(x), y(y) {} Point(const Point &p) : x(p.x), y(p.y) {} int operator<(const Point &rhs) const { return make_pair(y, x) < make_pair(rhs.y, rhs.x); } int oper...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); ; int n, w; cin >> n >> w; vector<long long> v(n); for (int i = 0; i < n; i++) cin >> v[i]; long long tot = 0, al = 0; long long minimum = 1e18, maximum = 0; for (int i = 0; i...
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; int n; double res; double x[60006], v[60006]; bool ok(double t) { double l, r; l = 1e-9; r = 1e9; for (int i = 1; i <= n; ++i) { double m = t * v[i]; l = max(l, x[i] - m); r = min(r, x[i] + m); } ...
#include <bits/stdc++.h> using namespace std; const int MAX = 500004, inf = 0x3f3f3f3f; int a[MAX]; int no[102]; int nex[MAX][102]; int f[102][102 * 102]; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, k, p; cin >> n >> k >> p; for (int i = 1; i <= n; i++) { ...
#include <bits/stdc++.h> using namespace std; long double F(int A, int B) { long double S = 1; for (int i = 0; i < B; i++) S = S * (A - i) / (i + 1); return S; } int main() { int N; scanf( %d , &N); static int C[100000], Max[100000]; static long double P[100000][101]; memset(P, 0...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int t; cin >> t; while (t--) { int n; cin >> n; int input[n]; for (int i = (0); i < (n); i++) cin >> input[i]; sort(input, input + n); vector<int> ans(n); ...
#include <bits/stdc++.h> using namespace std; int main() { char cell; short r, c, rr, cc, e; int res = 0, i, cat[100], cnt = 0; cin >> r >> c; rr = r; cc = c; for (i = 0; i < r; i++) { e = 0; for (int I = 0; I < c; I++) { cin >> cell; if (cell == S ) { ...
#include <bits/stdc++.h> using namespace std; int main() { int a, b; cin >> a >> b; int answer1, answer2; answer1 = min(a, b); a -= answer1; b -= answer1; answer2 = (max(a, b)) / 2; cout << answer1 << << answer2; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 5e5 + 3, M = 1e6 + 3, O = 2e6 + 3; int c[N], a[N], b[N], id[O], tp; bool f[N]; struct P { int f, sz; } d[M], st[O]; int gf(int x) { return d[x].f == x ? x : gf(d[x].f); } void mg(int x, int y) { int u = gf(x), v = gf(y); if (d[u].sz...
#include <bits/stdc++.h> using namespace std; int main() { int n, sum = 0; string s; cin >> n; for (int i = 0; i < n; ++i) { cin >> s; if (s == Tetrahedron ) sum += 4; if (s == Cube ) sum += 6; if (s == Octahedron ) sum += 8; if (s == Dodecahedron ) sum += 12; ...
#include <bits/stdc++.h> using namespace std; int main() { int m, n; cin >> m >> n; char d[m][n]; int ub = m, lb = 0, lfb = n, rb = 0; for (int r = 0; r < m; r++) { for (int c = 0; c < n; c++) { cin >> d[r][c]; if (d[r][c] == * ) { if (ub > r) ub = r; i...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(NULL); ; long long t, i, j, r, k, x, y, n, m, l, a, b, c, d = 0; cin >> t; string s, cm = abacaba ; while (t--) { cin >> l >> r; if (2 * l <= r) { cout << l << << 2 * ...
#include <bits/stdc++.h> using namespace std; vector<string> s; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; s.resize(n); for (int i = 0; i < n; i++) { cin >> s[i]; } int ans = 0; for (int i = 0; i < 7; i++) { int cnt = 0;...
#include <bits/stdc++.h> using namespace std; int main(int argc, char const *argv[]) { long long val; cin >> val; if (val & 1) cout << 1 << endl; else cout << 2 << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int arr[12], k, c = 0, a = 0; cin >> k; for (int i = 0; i < 12; i++) { cin >> arr[i]; } sort(arr, arr + 12); for (int i = 11; i >= 0; i--) { if (c < k) { c += arr[i]; a++; } } if (c < k) ...
#include <bits/stdc++.h> const int maxn = 1e6 + 5; const int maxm = 1e5 + 5; using namespace std; int rd() { int x = 0; char c = getchar(); while (!isdigit(c)) c = getchar(); while (isdigit(c)) x = (x << 3) + (x << 1) + c - 0 , c = getchar(); return x; } int n, head[maxn], tot, a, b, c,...
#include <bits/stdc++.h> using namespace std; int a[100005]; int main() { int n, i; long long sum = 0, x = 0; cin >> n; for (i = 0; i < n; i++) { cin >> a[i]; sum += a[i]; } sort(a, a + n); for (i = 0; i < (n / 2); i++) { x += a[i]; } cout << x * x + (sum - x)...
#include <bits/stdc++.h> const int inf = 2 * 1e9; const int mod = 1e9 + 7; const long long infll = (long long)1e18; const long double eps = 1e-9; const int dx[] = {1, 0, -1, 0}; const int dy[] = {0, -1, 0, 1}; const int MAXY = 1005000; using namespace std; int n, m; vector<vector<pair<int, int>>> g;...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int tt; cin >> tt; while (tt--) { int n, k; cin >> n >> k; vector<int> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } int d = unique(a.begin(), a.en...
#include <bits/stdc++.h> using namespace std; int dx[] = {-1, 1, 0, 0, -1, -1, 1, 1}; int dy[] = {0, 0, 1, -1, -1, 1, -1, 1}; int a[500], c[500]; int main() { int t = 0, z = 0, len; int n, k = 0, m = 0, bam = 0, dan = 0, ans = 0; scanf( %d %d , &n, &m); for (int l = 1; l < n + 1; l++) { ...
#include <bits/stdc++.h> using namespace std; using INT = long long; int edge[2222][2222]; int deg[2222]; int n; char s[2222]; int id[2222]; int ok() { for (int i = 1; i <= n; i++) id[i] = i; sort(id + 1, id + n + 1, [&](int u, int v) { return deg[u] < deg[v]; }); for (int i = 1, sum = 0; i ...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; const long long linf = 1e18 + 5; long long int gcd(long long int a, long long int b) { return (b == 0 ? a : gcd(b, a % b)); } long long int lcm(int a, int b) { return (a * (b / gcd(a, b))); } long long int max(long long int a, long l...
#include <bits/stdc++.h> using namespace std; int n, m, k, s, arr[4005][4005] = {}, x = 2000, ex[9][4], song[100005], res = 0; int main() { cin >> n >> m >> k >> s; for (int i = 0; i < 9; i++) { ex[i][0] = -999999999; ex[i][1] = 999999999; ex[i][2] = -999999999; ex[i][3] = 99999999...
#include <bits/stdc++.h> using namespace std; const long long MOD = 1000000007; const long long MAX = 200005; bool prime[MAX]; void sieve() { memset(prime, true, sizeof(prime)); prime[0] = prime[1] = false; for (long long p = 2; p * p <= MAX; p++) { if (prime[p] == true) { for (long ...
#include <bits/stdc++.h> using namespace std; vector<long long> v; int main() { long long a, b, f, k; cin >> a >> b >> f >> k; if (b / a >= k) { cout << 0 << endl; return 0; } v.push_back(f); for (long long i = 2;; i += 2) { long long r1 = i * a - f; long long r2 = ...
#include <bits/stdc++.h> using namespace std; int a[1000005]; int main() { int n; long long sum = 0; cin >> n; memset(a, -1, sizeof(a)); for (int i = n; i >= 0; i--) { if (a[i] != -1) continue; else { for (int tt = 1;; tt *= 2) { if (tt - 1 >= i) { ...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a; map<int, int> mp; int mx = 0; for (int i = 0; i < n; i++) { cin >> a; mp[a]++; } for (auto it : mp) { mx = max(mx, it.second); } cout << n - mx; }
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1); const int LIM = 15e5; struct Vector { int x, y; Vector operator+(Vector v) { return {x + v.x, y + v.y}; } Vector operator-(Vector v) { return {x - v.x, y - v.y}; } long long operator%(Vector v) { return 1LL * x * v.y - 1LL...
#include <bits/stdc++.h> using namespace std; long long a[200005]; int func(long a, long long x, long long f) { if (a - x > 0) { int tem; tem = (a - x) / (f + x); if (tem * (f + x) == (a - x)) return (a - x) / (f + x); else return (a - x) / (f + x) + 1; } else ...
#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); void rset(); void init_test(); void solve(); signed main() { ios::sync_with_stdio(false); cin.tie(0); cout << fixed; cout.precision(20); init_test(); return 0; } tem...
#include <bits/stdc++.h> using namespace std; const int MAXN = 500100; long long n, m, de, dt, h; int main() { int a, b, c; int x, y, z; cin >> a >> b >> c; cin >> x >> y >> z; int m1 = -(x - a); int m2 = -(y - b); int m3 = -(z - c); int neg = 0, pos = 0; if (m1 < 0) ne...
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 10; vector<int> g[N]; int c[N], val[N], ans[N]; void merge(vector<int> &vc, vector<int> &tmp) { for (auto u : tmp) vc.push_back(u); } vector<int> dfs(int u) { vector<int> vc, tmp; for (auto v : g[u]) { tmp = dfs(v); ...
#include <bits/stdc++.h> using namespace std; const long long INF = 1e9, SIZE = 1e5 * 2; vector<long long> vec; long long dp[100][SIZE], tree[SIZE * 8], pushing[SIZE * 8], prevPos[SIZE], last[SIZE]; void push(int v) { tree[v] += pushing[v]; pushing[v * 2 + 1] += pushing[v]; pushing[v * 2 + 2...
#include <bits/stdc++.h> using namespace std; int main() { long long k; string n; cin >> k >> n; long long sum = 0; vector<long long> arr; for (int(i) = 0; (i) < ((int)(n).size()); (i)++) { sum += int(n[i] - 0 ); arr.push_back(int(n[i] - 0 )); } if (sum >= k) { pr...
#include <bits/stdc++.h> const int INF = 0x3f3f3f3f; const int maxn = 1e5 + 5; const int mod = 1e9 + 7; const double eps = 1e-7; using namespace std; long long ans, n, s, a[maxn], b[maxn], num1, num2; priority_queue<pair<long long, long long>, vector<pair<long long, long long> >, greater<...
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:102400000,102400000 ) long long n, k, m, d; int main() { cin >> n >> k >> m >> d; long long ans = min(n, m); for (long long i = 1; i <= d; i++) { long long tmp = (i - 1) * k + 1; if (tmp <= 0) continue; l...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; long long a[n]; for (int i = 0; i < n; ++i) { cin >> a[i]; while (a[i] % 2 == 0) a[i] /= 2; while (a[i] % 3 == 0) a[i] /= 3; } int flag = 0; for (int i = 1; i < n; ++i) { if (a[i] != a[0])...
#include <bits/stdc++.h> using namespace std; const int mx = 2e5 + 10; int a[mx]; vector<int> g[mx]; vector<int> lyr[mx]; bool cmp(int i, int j) { return g[i].size() < g[j].size(); } int main() { int n, t, k; scanf( %d %d %d , &n, &t, &k); a[0] = 1; for (int i = 1; i <= t; i++) scanf( %d ,...
#include <bits/stdc++.h> using namespace std; int main() { string a, b; cin >> a >> b; int res = -1, pos = -1, j = 0; for (int i = 0; i < b.size(); i++) { if (a[j] != b[i]) { pos = j; if (res != -1 \|\| a[j + 1] != b[i]) { res = 0; break; } res...
#include <bits/stdc++.h> using namespace std; int main() { vector<int> v; int n, A, B; cin >> n >> A >> B; int msum = 0; for (int i = 0; i < n; i++) { int x; cin >> x; v.push_back(x); msum += x; } int one = v[0]; v[0] = INT_MAX; sort(v.begin(), v.end()); ...
#include <bits/stdc++.h> using namespace std; int n, m, nex[2000000], hea[2000000], wen[2000000], val[2000000], aid[2000000], root2, root1, len, maxx; struct segment_tree { int a[2000000][2], lazy[2000000], fa[1000000], dep[1000000], in[1000000], out[1000000], m; void pushdown(int k) { ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int a = 0, b = 1023, c, n; char op; cin >> n; for (int i = 0; i < n; ++i) { cin >> op >> c; switch (op) { case \| : a \|= c; b \|= c; br...
#include <bits/stdc++.h> int main() { std::ios_base::sync_with_stdio(false); std::string s; std::cin >> s; int n = s.length(); std::vector<int> prefix_fun(n, 0); for (int i = 1; i < n; i++) { int j = prefix_fun[i - 1]; while (j > 0 && s[i] != s[j]) { j = prefix_fun[j - 1]; ...
#include <bits/stdc++.h> using namespace std; const int N = 1e3 + 7, M = 1e6 + 7; int row[N], col[N]; long long dpc[M], dpr[M]; int main() { priority_queue<int> pqc, pqr; int n, m, k, p; scanf( %d %d %d %d , &n, &m, &k, &p); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { ...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { long long int n, x; cin >> n >> x; long long int arr[n]; for (int i = 0; i < n; i++) cin >> arr[i]; sort(arr, arr + n); long double rich_sum = 0; long long int poor_idx = -...
#include <bits/stdc++.h> using namespace std; const int N = 200005; const int INF = (int)2e9 + 10; typedef struct vocationn { int min_cost[N]; vector<pair<int, int> > left[N]; vector<pair<int, int> > right[N]; } vocation; int n, x, cost, l, r, ans = INF; vocation voc; int main() { ios_ba...
#include <bits/stdc++.h> using namespace std; template <class T> void readi(T &x) { T input = 0; bool negative = false; char c = ; while (c < - ) { c = getchar(); } if (c == - ) { negative = true; c = getchar(); } while (c >= 0 ) { input = input * 10 +...
#include <bits/stdc++.h> using namespace std; const int maxn = 200000 + 10; vector<int> G[maxn]; vector<int> inv[maxn]; int n, m; int vis[2][maxn]; int in[maxn]; inline int topo_sort(vector<int>* G, int* in) { stack<int> S; for (auto i = (0); i < (n); ++i) { if (in[i] == 0) S.push(i); ...
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1); template <typename T> T getint() { T val = 0; char c; while ((c = getchar()) && !(c >= 0 && c <= 9 )) ; do { val = (val * 10) + c - 0 ; } while ((c = getchar()) && (c >= 0 && c <= 9 )); return va...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:16777216 ) using namespace std; int n, m, jm; long long ans; int main() { cin >> n >> m >> jm; ans = ceil(1.0 * n / jm) * ceil(1.0 * m / jm) * ((n - 1) % jm + 1) * ((m - 1) % jm + 1); cout << ans; return 0; }

#include <bits/stdc++.h> using namespace std; const int mod = 998244353; const int N = 2e5 + 10, M = 1e6 + 10; long long f(long long x) { long long y = x + 1; if (x & 2) y /= 2; else x /= 2; return x * y; } void solve() { long long n; scanf( %lld , &n); long long x = ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, k; cin >> n >> k; string s[n]; set<string> store; for (int i = 0; i < n; i++) { cin >> s[i]; store.insert(s[i]); } int cnt = 0; for (int i ...

#include <bits/stdc++.h> using namespace std; bool debug; const int inf = 1e9 + 5; const long long INF = (long long)inf * inf; const int nax = 1e6 + 5; const int D = 2; const long long MM = 1000 * 1000 * 1000; const long long m[5] = {MM + 7, MM + 9, MM + 21, MM + 33, 333333361LL}; char sl[nax]; long...

#include <bits/stdc++.h> inline int read() { int x = 0, f = 0; register char ch = getchar(); for (; ch < 48 || ch > 57; ch = getchar()) f |= ch == - ; for (; ch > 47 && ch < 58; ch = getchar()) x = (x << 1) + (x << 3) + (ch ^ 48); return f ? ~x + 1 : x; } using namespace std; int t[70...

#include <bits/stdc++.h> using namespace std; typedef struct { long long loc; long long num; } amar; bool operator<(amar x, amar y) { if (x.num >= y.num) return false; else return true; } int main() { long long n, k, c[40]; char s[100005]; memset(c, 0, sizeof c); ...

#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7, inv = 5e8 + 4; long long n, m, k; long long pow(long long base, long long exp) { long long res = 1; while (exp) { if (exp & 1) (res *= base) %= mod; exp >>= 1; (base *= base) %= mod; } return res; } ...

#include <bits/stdc++.h> using namespace std; vector<bool> flag_pr(10001000, 0), flag_pal(10001000, 0); vector<long long> prime_upto(10001000, 0), palin_upto(10001000, 0); int gcd(int a, int b) { if (a % b == 0) return b; else return gcd(b, a % b); } bool isPalin(int num) { int ret =...

#include <bits/stdc++.h> using namespace std; int main() { long long a, b; cin >> a >> b; int count = 0; for (int i = 0; (1LL << i) / 2 <= b; i++) { for (int j = 0; j < i - 1; j++) { long long n = (1LL << i) - 1 - (1LL << j); if (a <= n && n <= b) count++; } } cou...

#include <bits/stdc++.h> using namespace std; long long int func(vector<vector<long long int>> &d, vector<int> &v, int i, int k) { if (d[k][i - 1] != 0) return d[k][i - 1]; if (k && (i + v[i - 1] <= d[0].size())) { d[k][i - 1] = -1; long long int y = func(d, v, i + v[i - 1],...

#include <bits/stdc++.h> using namespace std; template <typename T> void maxtt(T& t1, T t2) { t1 = max(t1, t2); } template <typename T> void mintt(T& t1, T t2) { t1 = min(t1, t2); } bool debug = 0; int n, m, k; int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0}; string direc = RDLU ; long...

#include <bits/stdc++.h> using namespace std; int x, y, q; void exgcd(int a, int b) { int temp; if (b == 0) { x = 1; y = 0; q = a; } else { exgcd(b, a % b); temp = x; x = y; y = temp - a / b * y; } } int c3, c4, c5; int k3, k4, k5; int f, x0, Why_C...

#include <bits/stdc++.h> using namespace std; map<long long int, long long int> mp; int main() { int n, c = 0, x = 0, a[200], i, j; cin >> n; for (i = 0; i < n; i++) { cin >> a[i]; c += a[i]; } if (n == 1) x = 1; if (n == 2 && a[0] == a[1]) x = 1; if (x == 1) cout << ...

#include <bits/stdc++.h> using namespace std; const int mxN = 5e4 + 7; const int inf = 1e5 + 7; const long long mod = 1e5 + 7; const long long infll = 1e18 + 7; long long a[mxN], b[mxN]; map<long long, bool> mp; int n; bool check = false; bool ok(long long x) { for (int i = 1; i <= n; i++) a[i] ...

#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0, f = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) f = -1; ch = getchar(); } while (isdigit(ch)) x = x * 10 + ch - 0 , ch = getchar(); return x * f; } int n, a[300100], q; struct no...

#include <bits/stdc++.h> using namespace std; const int N = 1000051; long long n; string c; struct btree { int chnum; int child[2]; int num; int typ; int id; } tre[N]; int dfx[N][2]; int tot = 0; int has[N]; void predfs(int x) { if (tre[x].typ == 0) return; if (tre[x].typ...

#include <bits/stdc++.h> using namespace std; const long long maxn = 2e5 + 15; inline long long read() { long long x = 0, f = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) f = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { x = (x << 1) + (x << 3) + c ...

#include <bits/stdc++.h> using namespace std; struct poi { int x, y; poi operator-(poi p) { return (poi){x - p.x, y - p.y}; } long long operator*(poi p) { return 1ll * x * p.y - 1ll * y * p.x; } } A[205], a[205]; bool cmp(poi x, poi y) { return x * y > 0; } bool turn(int x, int y, int z) { return ...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int a, b, c, d; cin >> a >> b >> c >> d; cout << max(a + b, c + d) << n ; } return 0; }

#include <bits/stdc++.h> using namespace std; int n, m, sz; int par[4000005]; int findpar(int x) { if (par[x] == x) return par[x]; par[x] = findpar(par[x]); return par[x]; } int cr, cc; int pr, pc; void decode(int x) { if (x < m) { cr = 0; cc = x; } else if (x < m + n - 1...

#include <bits/stdc++.h> using namespace std; signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long r; cin >> r; if ((r - 1) % 2 == 0 && r > 3) cout << 1 << << (r - 3) / 2; else cout << NO ; }

#include <bits/stdc++.h> using namespace std; using ll = long long; int const nmax = 3000; int const modulo = 1000000007; char v[1 + nmax][1 + nmax]; int dp[1 + nmax][1 + nmax]; int solve(int x, int y, int x2, int y2) { for (int i = 1; i <= x2; i++) for (int j = 1; j <= y2; j++) dp[i][j] = 0; ...

#include <bits/stdc++.h> using namespace std; int fastpow(int a, int b) { int ans = 1; for (; b; b >>= 1, a = a * a) if (b & 1) ans = ans * a; return ans; } int num; int main() { int n; scanf( %d , &n); string a; cin >> a; for (int i = 0; i < a.length(); i++) n += (a[i] -...

#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); for (int z = 0; z < n; z++) { long long a, b, c; cin >> a >> b; while ((c = a | a + 1) <= b) a = (a | a + 1); cout << a << endl; } return 0; }

#include <bits/stdc++.h> #pragma GCC optimize( O2 ) using namespace std; const double PI = atan(1.0) * 4; const int di[4] = {-1, 0, 1, 0}; const int dj[4] = {0, -1, 0, 1}; const long long INF = (long long)2e18 + 50; const int maximum = numeric_limits<int>::min(); const int minimum = numeric_limits<int>:...

#include <bits/stdc++.h> using namespace std; int n, k; const int N = 5050; int a[N]; int dp[N][N]; int cnt[N]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cerr.setstate(ios_base::failbit); cin >> n >> k; for (int i = 1; i < (n + 1); i++) cin >> a[i]; sort(a + 1, a +...

#include bits/stdc++.h using namespace std; #define ll long long #define llu unsigned long long #define PB push_back #define F first #define S second #define sz(a) ((ll)a.size()) const ll MOD = 1000000007; const ll INF = 1000000000000000007; #ifdef ONLINE_JUDGE #define ck(x...) #endif voi...

#include <bits/stdc++.h> using namespace std; const double eps = 0.001; const int mod = 1000000007; int main() { int n, pos, l, r, ans; scanf( %d%d%d%d , &n, &pos, &l, &r); if (l == 1 && r == n) ans = 0; else if (l == 1) ans = abs(pos - r) + 1; else if (r == n) ans = abs(po...

#include <bits/stdc++.h> using namespace std; int main() { long long int q, s1, s2, s3, w, m, e; vector<long long int> v; cin >> q; long long int n; for (int i = 0; i < q; i++) { cin >> n; long long int a[n]; s1 = 0; s2 = 0; s3 = 0; for (int j = 0; j < n; j++)...

#include <bits/stdc++.h> using namespace std; const int maxn = 5e5 + 10; const int inf = 1e9; struct node { int s, ind; } f[maxn]; int sum[maxn]; int cmp(node a, node b) { if (a.s == b.s) return a.ind < b.ind; return a.s < b.s; } int main() { int i, n, c, re = 0, value; scanf( %d%d...

#include <bits/stdc++.h> using namespace std; void print_err() { cerr << n ; } template <class T, class... Arg> void print_err(T x, Arg &&...args) { cerr << x << ; print_err(args...); } template <class T> void print_container(T &cont) { for (auto iter : cont) { cerr << iter << ; ...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; bool impr = false; bool taken[n + 1]; for (int i = 0; i <= n; i++) { taken[i] = false; } int notTaken = -1; for (int i = 0; i < n; i++) { ...

#include <bits/stdc++.h> using namespace std; long long int N, T; void solve() { cin >> N; vector<long long int> cnt(N + 1); long long int x; for (long long int i = 0; i < N; i++) { cin >> x; cnt[x]++; } long long int ans = 0; for (long long int s = 2; s <= 2 * N; s++) { ...

#include <bits/stdc++.h> using namespace std; char s[200001], out[20]; int len[200001]; int ans1[2000001], ans2[2000001]; vector<int> v[2000001]; int digit[6]; bool solve(int n, int i, int sum) { if (!i) { if (ans1[sum] >= 10) return false; ans2[n] = sum; return true; } for (...

#include <bits/stdc++.h> using namespace std; int main() { long long a, b, c; cin >> a >> b >> c; long long Min = min(a, b); Min = min(Min, c); long long day = 0; while (a + b + c >= 7 && a >= 3 && b >= 2 && c >= 2) { a -= 3; b -= 2; c -= 2; day += 7; } long l...

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

#include <bits/stdc++.h> #pragma GCC optimize(2) #pragma GCC optimize(3) using namespace std; int a[200011], b[200011]; struct song { int t; int id; bool operator<(song other) const { if (t != other.t) return t < other.t; return id < other.id; } }; struct oriSet { int tol =...

#include <bits/stdc++.h> using namespace std; long n, k, ar[200000]; long long reach[777777]; long long q; long long ans[777777]; multiset<long long> bst; multiset<long long>::iterator it; int main() { ios_base::sync_with_stdio(0); cin >> n >> k; for (int i = 1; i <= n; i++) cin >> ar[i]; ...

#include <bits/stdc++.h> using namespace std; int N, C; int A[1001]; vector<int> V; int main() { cin >> N; for (int i = 0; i < N; ++i) cin >> A[i]; for (int i = 0; i < N; ++i) { C = 1; for (int j = i; j < N - 1; ++j) { if (A[j] >= A[j + 1]) ++C; else ...

#include <bits/stdc++.h> using namespace std; const int nsz = 5e5; int n, rt = 1, t, l[nsz + 5], r[nsz + 5]; vector<int> g[nsz + 5]; void dfs(int u = rt, int p = rt) { for (int i = 0; i < g[u].size(); ++i) { int v = g[u][i]; if (v == p) continue; l[v] = ++t; } r[u] = ++t; for...

#include <bits/stdc++.h> using namespace std; inline long long Qmul(const long long &x, const long long &y, const long long &X) { long long k = (long long)((1.0L * x * y) / (1.0L * X)), t = x * y - k * X; t -= X; while (t < 0) t += X; return t; } class MillerRabin { pr...

#include <bits/stdc++.h> using namespace std; const int N = int(5e5) + 3; const int MOD = 998244353; const double PI = 4 * atan(1); const double eps = 1e-10; const long long oo = 1e10; const int K = 26; int n, m; int a[N], b[N], c[N], d[N], k[N]; vector<int> actors[N]; vector<int> pitch[N]; set<...

#include <bits/stdc++.h> using namespace std; const int TOUR = 1 << 18, INF = 0x3f3f3f3f; struct strq { int r1, r2, s1, s2, ind; strq() {} } q[TOUR]; struct event { int st, red, stup; strq qq; event(int st, int red, int stup, strq qq) : st(st), red(red), stup(stup), qq(qq) {} e...

#include <bits/stdc++.h> using namespace std; int nextt[200007], c[200007], vis[200007]; long long ans, n; template <class T> void read(T &x) { int f = 0; x = 0; char ch = getchar(); while (ch < 0 || ch > 9 ) { f |= (ch == - ); ch = getchar(); } while (ch >= 0 && ch <...

#include <bits/stdc++.h> using namespace std; int n, a[200015], i, n1; bool doit() { n1 = n - 1; for (i = 0; n1; ++i) { if (a[i] == a[i + 1]) { printf( :( ); return 0; } a[i] += n1; --n1; } for (i = 0; i < n; ++i) printf( %d , a[i]); } int main() { ...

#include <bits/stdc++.h> using namespace std; int main() { int n, m, a, b; while (cin >> n >> m >> a >> b) { a--; b--; int r1 = a / m, r2 = b / m; int c1 = a % m, c2 = b % m; if (r1 == r2) cout << 1 << endl; else if (c1 == 0 && c2 == m - 1) cout << 1 << en...

#include <bits/stdc++.h> using namespace std; struct IP { string nm; int a, b, c, d; }; int n, m; int test(IP a[], IP x) { for (int i = 0; i < n; i++) { if (a[i].a == x.a && a[i].b == x.b && a[i].c == x.c && a[i].d == x.d) return i; } return -1; } IP a[1000], b[1000]; i...

#include <bits/stdc++.h> #pragma GCC optimize( O3 ) #pragma GCC target( sse4 ) using namespace std; template <class c> struct rge { c b, e; }; template <class c> rge<c> range(c i, c j) { return rge<c>{i, j}; } template <class c> auto dud(c* x) -> decltype(cerr << *x, 0); template <class ...

#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; long long ans = 1; for (int i = k + 1; i <= n; i++) ans = (ans * (n - k)) % 1000000007; ans = (ans * (k)) % 1000000007; if (k - 1 > 0) { long long prod = 0; vector<int> v(k + 2); int loopval...

#include <bits/stdc++.h> using namespace std; int main() { int w; w = 1; while (w--) { int n, maxi = -1, b = 0; vector<int> s, t[10]; bool f1 = true, f = false; cin >> n; while (n > 0) { int x = n % 10; s.push_back(x); maxi = max(maxi, x); n ...

#include <bits/stdc++.h> using namespace std; const int N = 500010; long long x, y, m; int main() { ios_base::sync_with_stdio(false); cin >> x >> y >> m; if (x >= m || y >= m) { cout << 0 n ; return 0; } if (x <= 0 && y <= 0) { cout << -1 n ; return 0; } if ...

#include <bits/stdc++.h> using namespace std; struct Point { double x, y; Point() : x(0), y(0) {} Point(double x, double y) : x(x), y(y) {} Point(const Point &p) : x(p.x), y(p.y) {} int operator<(const Point &rhs) const { return make_pair(y, x) < make_pair(rhs.y, rhs.x); } int oper...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); ; int n, w; cin >> n >> w; vector<long long> v(n); for (int i = 0; i < n; i++) cin >> v[i]; long long tot = 0, al = 0; long long minimum = 1e18, maximum = 0; for (int i = 0; i...

#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; int n; double res; double x[60006], v[60006]; bool ok(double t) { double l, r; l = 1e-9; r = 1e9; for (int i = 1; i <= n; ++i) { double m = t * v[i]; l = max(l, x[i] - m); r = min(r, x[i] + m); } ...

#include <bits/stdc++.h> using namespace std; const int MAX = 500004, inf = 0x3f3f3f3f; int a[MAX]; int no[102]; int nex[MAX][102]; int f[102][102 * 102]; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, k, p; cin >> n >> k >> p; for (int i = 1; i <= n; i++) { ...

#include <bits/stdc++.h> using namespace std; long double F(int A, int B) { long double S = 1; for (int i = 0; i < B; i++) S = S * (A - i) / (i + 1); return S; } int main() { int N; scanf( %d , &N); static int C[100000], Max[100000]; static long double P[100000][101]; memset(P, 0...

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

#include <bits/stdc++.h> using namespace std; int main() { char cell; short r, c, rr, cc, e; int res = 0, i, cat[100], cnt = 0; cin >> r >> c; rr = r; cc = c; for (i = 0; i < r; i++) { e = 0; for (int I = 0; I < c; I++) { cin >> cell; if (cell == S ) { ...

#include <bits/stdc++.h> using namespace std; int main() { int a, b; cin >> a >> b; int answer1, answer2; answer1 = min(a, b); a -= answer1; b -= answer1; answer2 = (max(a, b)) / 2; cout << answer1 << << answer2; return 0; }

#include <bits/stdc++.h> using namespace std; const int N = 5e5 + 3, M = 1e6 + 3, O = 2e6 + 3; int c[N], a[N], b[N], id[O], tp; bool f[N]; struct P { int f, sz; } d[M], st[O]; int gf(int x) { return d[x].f == x ? x : gf(d[x].f); } void mg(int x, int y) { int u = gf(x), v = gf(y); if (d[u].sz...

#include <bits/stdc++.h> using namespace std; int main() { int n, sum = 0; string s; cin >> n; for (int i = 0; i < n; ++i) { cin >> s; if (s == Tetrahedron ) sum += 4; if (s == Cube ) sum += 6; if (s == Octahedron ) sum += 8; if (s == Dodecahedron ) sum += 12; ...

#include <bits/stdc++.h> using namespace std; int main() { int m, n; cin >> m >> n; char d[m][n]; int ub = m, lb = 0, lfb = n, rb = 0; for (int r = 0; r < m; r++) { for (int c = 0; c < n; c++) { cin >> d[r][c]; if (d[r][c] == * ) { if (ub > r) ub = r; i...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(NULL); ; long long t, i, j, r, k, x, y, n, m, l, a, b, c, d = 0; cin >> t; string s, cm = abacaba ; while (t--) { cin >> l >> r; if (2 * l <= r) { cout << l << << 2 * ...

#include <bits/stdc++.h> using namespace std; vector<string> s; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; s.resize(n); for (int i = 0; i < n; i++) { cin >> s[i]; } int ans = 0; for (int i = 0; i < 7; i++) { int cnt = 0;...

#include <bits/stdc++.h> using namespace std; int main(int argc, char const *argv[]) { long long val; cin >> val; if (val & 1) cout << 1 << endl; else cout << 2 << endl; return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int arr[12], k, c = 0, a = 0; cin >> k; for (int i = 0; i < 12; i++) { cin >> arr[i]; } sort(arr, arr + 12); for (int i = 11; i >= 0; i--) { if (c < k) { c += arr[i]; a++; } } if (c < k) ...

#include <bits/stdc++.h> const int maxn = 1e6 + 5; const int maxm = 1e5 + 5; using namespace std; int rd() { int x = 0; char c = getchar(); while (!isdigit(c)) c = getchar(); while (isdigit(c)) x = (x << 3) + (x << 1) + c - 0 , c = getchar(); return x; } int n, head[maxn], tot, a, b, c,...

#include <bits/stdc++.h> using namespace std; int a[100005]; int main() { int n, i; long long sum = 0, x = 0; cin >> n; for (i = 0; i < n; i++) { cin >> a[i]; sum += a[i]; } sort(a, a + n); for (i = 0; i < (n / 2); i++) { x += a[i]; } cout << x * x + (sum - x)...

#include <bits/stdc++.h> const int inf = 2 * 1e9; const int mod = 1e9 + 7; const long long infll = (long long)1e18; const long double eps = 1e-9; const int dx[] = {1, 0, -1, 0}; const int dy[] = {0, -1, 0, 1}; const int MAXY = 1005000; using namespace std; int n, m; vector<vector<pair<int, int>>> g;...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int tt; cin >> tt; while (tt--) { int n, k; cin >> n >> k; vector<int> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } int d = unique(a.begin(), a.en...

#include <bits/stdc++.h> using namespace std; int dx[] = {-1, 1, 0, 0, -1, -1, 1, 1}; int dy[] = {0, 0, 1, -1, -1, 1, -1, 1}; int a[500], c[500]; int main() { int t = 0, z = 0, len; int n, k = 0, m = 0, bam = 0, dan = 0, ans = 0; scanf( %d %d , &n, &m); for (int l = 1; l < n + 1; l++) { ...

#include <bits/stdc++.h> using namespace std; using INT = long long; int edge[2222][2222]; int deg[2222]; int n; char s[2222]; int id[2222]; int ok() { for (int i = 1; i <= n; i++) id[i] = i; sort(id + 1, id + n + 1, [&](int u, int v) { return deg[u] < deg[v]; }); for (int i = 1, sum = 0; i ...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; const long long linf = 1e18 + 5; long long int gcd(long long int a, long long int b) { return (b == 0 ? a : gcd(b, a % b)); } long long int lcm(int a, int b) { return (a * (b / gcd(a, b))); } long long int max(long long int a, long l...

#include <bits/stdc++.h> using namespace std; int n, m, k, s, arr[4005][4005] = {}, x = 2000, ex[9][4], song[100005], res = 0; int main() { cin >> n >> m >> k >> s; for (int i = 0; i < 9; i++) { ex[i][0] = -999999999; ex[i][1] = 999999999; ex[i][2] = -999999999; ex[i][3] = 99999999...

#include <bits/stdc++.h> using namespace std; const long long MOD = 1000000007; const long long MAX = 200005; bool prime[MAX]; void sieve() { memset(prime, true, sizeof(prime)); prime[0] = prime[1] = false; for (long long p = 2; p * p <= MAX; p++) { if (prime[p] == true) { for (long ...

#include <bits/stdc++.h> using namespace std; vector<long long> v; int main() { long long a, b, f, k; cin >> a >> b >> f >> k; if (b / a >= k) { cout << 0 << endl; return 0; } v.push_back(f); for (long long i = 2;; i += 2) { long long r1 = i * a - f; long long r2 = ...

#include <bits/stdc++.h> using namespace std; int a[1000005]; int main() { int n; long long sum = 0; cin >> n; memset(a, -1, sizeof(a)); for (int i = n; i >= 0; i--) { if (a[i] != -1) continue; else { for (int tt = 1;; tt *= 2) { if (tt - 1 >= i) { ...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a; map<int, int> mp; int mx = 0; for (int i = 0; i < n; i++) { cin >> a; mp[a]++; } for (auto it : mp) { mx = max(mx, it.second); } cout << n - mx; }

#include <bits/stdc++.h> using namespace std; const double PI = acos(-1); const int LIM = 15e5; struct Vector { int x, y; Vector operator+(Vector v) { return {x + v.x, y + v.y}; } Vector operator-(Vector v) { return {x - v.x, y - v.y}; } long long operator%(Vector v) { return 1LL * x * v.y - 1LL...

#include <bits/stdc++.h> using namespace std; long long a[200005]; int func(long a, long long x, long long f) { if (a - x > 0) { int tem; tem = (a - x) / (f + x); if (tem * (f + x) == (a - x)) return (a - x) / (f + x); else return (a - x) / (f + x) + 1; } else ...

#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); void rset(); void init_test(); void solve(); signed main() { ios::sync_with_stdio(false); cin.tie(0); cout << fixed; cout.precision(20); init_test(); return 0; } tem...

#include <bits/stdc++.h> using namespace std; const int MAXN = 500100; long long n, m, de, dt, h; int main() { int a, b, c; int x, y, z; cin >> a >> b >> c; cin >> x >> y >> z; int m1 = -(x - a); int m2 = -(y - b); int m3 = -(z - c); int neg = 0, pos = 0; if (m1 < 0) ne...

#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 10; vector<int> g[N]; int c[N], val[N], ans[N]; void merge(vector<int> &vc, vector<int> &tmp) { for (auto u : tmp) vc.push_back(u); } vector<int> dfs(int u) { vector<int> vc, tmp; for (auto v : g[u]) { tmp = dfs(v); ...

#include <bits/stdc++.h> using namespace std; const long long INF = 1e9, SIZE = 1e5 * 2; vector<long long> vec; long long dp[100][SIZE], tree[SIZE * 8], pushing[SIZE * 8], prevPos[SIZE], last[SIZE]; void push(int v) { tree[v] += pushing[v]; pushing[v * 2 + 1] += pushing[v]; pushing[v * 2 + 2...

#include <bits/stdc++.h> using namespace std; int main() { long long k; string n; cin >> k >> n; long long sum = 0; vector<long long> arr; for (int(i) = 0; (i) < ((int)(n).size()); (i)++) { sum += int(n[i] - 0 ); arr.push_back(int(n[i] - 0 )); } if (sum >= k) { pr...

#include <bits/stdc++.h> const int INF = 0x3f3f3f3f; const int maxn = 1e5 + 5; const int mod = 1e9 + 7; const double eps = 1e-7; using namespace std; long long ans, n, s, a[maxn], b[maxn], num1, num2; priority_queue<pair<long long, long long>, vector<pair<long long, long long> >, greater<...

#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:102400000,102400000 ) long long n, k, m, d; int main() { cin >> n >> k >> m >> d; long long ans = min(n, m); for (long long i = 1; i <= d; i++) { long long tmp = (i - 1) * k + 1; if (tmp <= 0) continue; l...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; long long a[n]; for (int i = 0; i < n; ++i) { cin >> a[i]; while (a[i] % 2 == 0) a[i] /= 2; while (a[i] % 3 == 0) a[i] /= 3; } int flag = 0; for (int i = 1; i < n; ++i) { if (a[i] != a[0])...

#include <bits/stdc++.h> using namespace std; const int mx = 2e5 + 10; int a[mx]; vector<int> g[mx]; vector<int> lyr[mx]; bool cmp(int i, int j) { return g[i].size() < g[j].size(); } int main() { int n, t, k; scanf( %d %d %d , &n, &t, &k); a[0] = 1; for (int i = 1; i <= t; i++) scanf( %d ,...

#include <bits/stdc++.h> using namespace std; int main() { string a, b; cin >> a >> b; int res = -1, pos = -1, j = 0; for (int i = 0; i < b.size(); i++) { if (a[j] != b[i]) { pos = j; if (res != -1 || a[j + 1] != b[i]) { res = 0; break; } res...

#include <bits/stdc++.h> using namespace std; int main() { vector<int> v; int n, A, B; cin >> n >> A >> B; int msum = 0; for (int i = 0; i < n; i++) { int x; cin >> x; v.push_back(x); msum += x; } int one = v[0]; v[0] = INT_MAX; sort(v.begin(), v.end()); ...

#include <bits/stdc++.h> using namespace std; int n, m, nex[2000000], hea[2000000], wen[2000000], val[2000000], aid[2000000], root2, root1, len, maxx; struct segment_tree { int a[2000000][2], lazy[2000000], fa[1000000], dep[1000000], in[1000000], out[1000000], m; void pushdown(int k) { ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int a = 0, b = 1023, c, n; char op; cin >> n; for (int i = 0; i < n; ++i) { cin >> op >> c; switch (op) { case | : a |= c; b |= c; br...

#include <bits/stdc++.h> int main() { std::ios_base::sync_with_stdio(false); std::string s; std::cin >> s; int n = s.length(); std::vector<int> prefix_fun(n, 0); for (int i = 1; i < n; i++) { int j = prefix_fun[i - 1]; while (j > 0 && s[i] != s[j]) { j = prefix_fun[j - 1]; ...

#include <bits/stdc++.h> using namespace std; const int N = 1e3 + 7, M = 1e6 + 7; int row[N], col[N]; long long dpc[M], dpr[M]; int main() { priority_queue<int> pqc, pqr; int n, m, k, p; scanf( %d %d %d %d , &n, &m, &k, &p); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { ...

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

#include <bits/stdc++.h> using namespace std; const int N = 200005; const int INF = (int)2e9 + 10; typedef struct vocationn { int min_cost[N]; vector<pair<int, int> > left[N]; vector<pair<int, int> > right[N]; } vocation; int n, x, cost, l, r, ans = INF; vocation voc; int main() { ios_ba...

#include <bits/stdc++.h> using namespace std; template <class T> void readi(T &x) { T input = 0; bool negative = false; char c = ; while (c < - ) { c = getchar(); } if (c == - ) { negative = true; c = getchar(); } while (c >= 0 ) { input = input * 10 +...

#include <bits/stdc++.h> using namespace std; const int maxn = 200000 + 10; vector<int> G[maxn]; vector<int> inv[maxn]; int n, m; int vis[2][maxn]; int in[maxn]; inline int topo_sort(vector<int>* G, int* in) { stack<int> S; for (auto i = (0); i < (n); ++i) { if (in[i] == 0) S.push(i); ...

#include <bits/stdc++.h> using namespace std; const double PI = acos(-1); template <typename T> T getint() { T val = 0; char c; while ((c = getchar()) && !(c >= 0 && c <= 9 )) ; do { val = (val * 10) + c - 0 ; } while ((c = getchar()) && (c >= 0 && c <= 9 )); return va...