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 N = int(1e5) + 10; const int K = 11; const int MOD = int(1e9) + 7; const int INF = int(2e9) + 5; const long long INF64 = 1e18; int dp[N]; void solve() { string s; cin >> s; stack<int> st; int n = s.length(); for (int i = 0; i < ...
#include <bits/stdc++.h> using namespace std; int a[200005]; int main() { int n; int i; while (scanf( %d , &n) != EOF) { for (i = 0; i < n; i++) { scanf( %d , &a[i]); } sort(a, a + n); int p = (n - 2) / 2; int ans = 1e9; for (i = 0; i < n - p - 1; i++) { ...
#include <bits/stdc++.h> using namespace std; const int N = 2e3 + 10; const int B = 1e3 + 10; bool vis[N], inque[2 * N]; int n, k; vector<int> v; int main() { scanf( %d%d , &n, &k); for (int i = 0; i < k; i++) { int t; scanf( %d , &t); if (!vis[t]) { vis[t] = true; ...
#include <bits/stdc++.h> using namespace std; long long a[100005]; long long req = 1e18; long long steps(long long n) { long long c = 1; if (n == 1) return 1e6; while (req > 1) { req /= n; c++; } req = 1e18; return c; } long long pow_exp(long long a, long long n) { lo...
#include <bits/stdc++.h> using namespace std; struct matrix { long long a[100][100]; void init() { memset(a, 0, sizeof(a)); } friend matrix operator*(matrix x, matrix y) { matrix ans; ans.init(); for (int i = 0; i < 100; i++) for (int j = 0; j < 100; j++) { for (int k...
#include <bits/stdc++.h> using namespace std; int N; bool indegree[200010]; int a[200010]; bool visited[200010]; vector<pair<int, int> > ans; int main() { int i, j, k; scanf( %d , &N); for (i = (0); i < (N); i++) scanf( %d , a + i); for (i = (0); i < (N); i++) a[i]--; memset((visited),...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); string base, s; cin >> base >> s; int n = base.size(), m = s.size(); base = * + base; s = * + s; int f[m + 2][n + 2]; memset(f, 0, sizeof(f)); for (int i ...
#include <bits/stdc++.h> using namespace std; int color[30]; int colornow[30]; int op0[10][10] = {{2, 4, 6, 8, 10, 12, 23, 21}, {3, 4, 17, 19, 10, 9, 16, 14}, {13, 14, 5, 6, 17, 18, 21, 22}}; int op1[10][10] = {{6, 8, 10, 12, 23, 21, 2, 4}, {17, 1...
#include <bits/stdc++.h> using namespace std; int main() { long long n, q; scanf( %lld %lld , &n, &q); while (q--) { long long x; scanf( %lld , &x); while (x % 2 == 0) { x += (n - x / 2); } printf( %lld n , x / 2 + 1); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long n, k, x; while (cin >> n >> k) { long long sum = 0; x = n * (k - 1) / k - 10; if (x <= 0) { x = 1; } long long c = x; sum = x; while (sum < n) { c /= k; sum += c; if...
#include <bits/stdc++.h> using namespace std; const int maxn = 100005, inf = 1e9 + 7; int fa[maxn]; long long n, m, dp[maxn]; int sz[maxn], costs[maxn]; vector<int> fas; bool vis[maxn]; int findfa(int x) { if (fa[x] == x) return x; else return fa[x] = findfa(fa[x]); } void bag(in...
#include <bits/stdc++.h> using namespace std; const int MAX = 1e6 + 10; const int INF = 1e9 + 7; int prime[MAX]; int main() { int x2; scanf( %d , &x2); for (int i = 2; i <= x2; i++) { if (!prime[i]) { for (int j = i * 2; j <= x2; j += i) prime[j] = i; } } int ans = INF;...
#include <bits/stdc++.h> using namespace std; long long x; long long n, f = 1; int main() { cin >> n; if (n < 0) { f = -1; n = -n; } x = (n % 360) * f * (-1); long long a0 = x, a1 = x + 90, a2 = x + 180, a3 = x + 270; a0 = min(abs(a0), (360 + a0) % 360); if (a0 > 180) a0 ...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> A(n); vector<int> B(n, 1); for (int i = 0; i < n; i++) { cin >> A[i]; } int max1 = B[0]; for (int i = 1; i < n; i++) { if (A[i] >= A[i - 1]) { B[i] = B[i - 1] + 1; } ...
#include <bits/stdc++.h> using namespace std; int a[1000100], b[5010]; string second[10]; int main() { int n, sm = 0; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; } sort(a + 1, a + n); for (;;) { if (a[0] <= a[n - 1]) { a[n - 1]--; a[0]++; sm++...
#include <bits/stdc++.h> using namespace std; template <typename tp> inline void read(tp &x) { x = 0; char c = getchar(); int f = 0; for (; c < 0 \|\| c > 9 ; f \|= c == - , c = getchar()) ; for (; c >= 0 && c <= 9 ; x = (x << 3) + (x << 1) + c - 0 , c = getchar()) ; if (f...
#include <bits/stdc++.h> using namespace std; int color[10010], c[10010], d[10010], f[10010], N, t, x; int main() { scanf( %d , &N); for (int i = 1; i <= N; i++) { scanf( %d , color + i); if (!f[color[i]]) f[color[i]] = i; } int m, col; for (int i = 1; i <= N; i++) { m = 1; ...
#include <bits/stdc++.h> using namespace std; const long long maxn = 2e5 + 10, inf = 4e18, mod = 1e9 + 7; const long double pi = 3.14159265359, eps = 1e-9; long long n, m; vector<long long> g[maxn], jj[3]; long long mk[maxn]; bool dfs(long long v, long long p = -1, long long dep = 1) { mk[v] = dep; ...
#include <bits/stdc++.h> using namespace std; vector<int> s[222222], ss[222222]; int n, m, cnt, cnt2, h; int up[222222][22], fa[222222], deep[211111], q[211111], dfn[211111], low[211111]; void tarjan(int x) { int c, i, y; dfn[x] = low[x] = ++cnt; q[h] = x; h++; c = s[x].size(); f...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, x; cin >> n >> x; int arr[n + 5], brr[n + 5]; for (int i = 0; i < n; i++) { cin >> arr[i]; } for (int i = 0; i < n; i++) { cin >> brr[i]; } sor...
#include <bits/stdc++.h> using namespace std; vector<long long> st; long long n, q; vector<int> swp(20, false); vector<long long> arr; void build(long long ind, long long l, long long r) { if (l == r) { st[ind] = arr[l]; return; } long long mid = (l + r) >> 1; build(2 * ind, l, m...
#include <bits/stdc++.h> inline long long read() { long long x = 0, f = 1; char c = getchar(); for (; c > 9 \|\| c < 0 ; c = getchar()) { if (c == - ) f = -1; } for (; c >= 0 && c <= 9 ; c = getchar()) { x = x * 10 + c - 0 ; } return x * f; } int a[100005]; std::vec...
#include <bits/stdc++.h> using namespace std; const long long maxn = 100005; const int mod = 1e9 + 9; const int pp = 31; const int ppp = 56; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; int i, j, k, n; string s, t; cin >> s >> t >> k; n = s.length(); v...
#include <bits/stdc++.h> using namespace std; const int maxn = (int)(1e5) + 123; const int INF = (int)(1e9); int n, a[maxn], t[4 * maxn], tt; pair<int, int> b[maxn]; int gcd(int a, int b) { while (a > 0 && b > 0) { if (a > b) a %= b; else b %= a; } return a + b; } ...
#include <bits/stdc++.h> using namespace std; inline long long read() { long long f = 1, x = 0; char ch = getchar(); while (ch < 0 \|\| ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } r...
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const double eps = 1e-6; const int maxn = 3e5 + 10; const int maxm = 1e6 + 10; const long long mod = 998244353; int a[maxn], b[maxn]; bool judge(int mid, int h) { int temph = h; for (int i = 0; i < mid; i++) b[i] = a[i]; ...
#include <bits/stdc++.h> using namespace std; int p_arr[200005]; int main() { int n, in, cnt, x, arr[200005]; std::cin >> n; queue<int> q; for (int i = 1; i <= n; i++) { std::cin >> in; q.push(in); } for (int i = 1; i <= n; i++) { std::cin >> arr[i]; } cnt = 0; ...
#include <bits/stdc++.h> using namespace std; char g[21][21]; int n, m, id[21][21], cv, cb, var[(1 << 8)], dr[] = {1, 0, -1, 0}, dc[] = {0, 1, 0, -1}, d[21][21][(1 << 8)]; bool inq[21][21][(1 << 8)]; struct node { int r, c, msk; }; queue<node> q; vector<node> b; void input() { scanf( %d%...
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); ; vector<int> v(n); for (int i = 0; i < n; i++) scanf( %d , &v[i]); ; int diff = 0; int ans = v[0]; for (int i = 0; i < n - 1; i++) { diff += (v[i] - v[i + 1]); if (diff < 0) { ...
#include <bits/stdc++.h> using namespace std; int n, k; int x; int a[1000]; int main() { scanf( %d%d , &n, &k); for (int i = 0; i < 2 * n + 1; i++) { scanf( %d , &a[i]); } for (int i = 0; i < 2 * n + 1; i++) { if (i % 2 == 1 && k > 0 && a[i] > a[i - 1] + 1 && a[i] > a[i + 1] + 1) {...
#include <bits/stdc++.h> using namespace std; int n, a[100005], mi, mid, ma; long long m, sum; bool b[100005], flag; bool check() { long long sum = 0; for (int i = 0; i < n; i++) sum += min(a[i], mid); return sum <= m; } int main() { cin >> n >> m; sum = 0; for (int i = 0; i < n; i...
#include <bits/stdc++.h> using namespace std; const int N = 2000005; int lp[N + 1]; vector<int> pr, adj[100005]; vector<int> v[N]; int a[N], ans[100005], depth[100005]; void seive() { for (int i = 2; i <= N; ++i) { if (lp[i] == 0) { lp[i] = i; pr.push_back(i); } for (...
#include <bits/stdc++.h> using namespace std; const int MAX_N = 1e5 + 5; const long long MOD = 1e9 + 7; const long long INF = 1e9 + 7; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, x, y; cin >> n >> x >> y; set<double> s; int count = 0; while (n--) ...
#include <bits/stdc++.h> using namespace std; mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); const int nmax = 2e5 + 5; int t, n, a[nmax], b[nmax], f[nmax], L[nmax], R[nmax], d[nmax]; long long ans; vector<int> v1[nmax], v2[nmax]; int main() { srand(time(NULL)); ios::sync_w...
#include <bits/stdc++.h> using namespace std; const int nMAX = 20; long long comb[nMAX][nMAX]; long long mem[10][20]; int cnt[10]; long long nCr(int n, int k) { if (n < k) return 0; if (k == 0 \|\| n == 0) return 1; if (~comb[n][k]) return comb[n][k]; if (n - k < k) return comb[n][k] = nCr(n, ...
#include <bits/stdc++.h> using namespace std; int coolness[6001]; int main() { int n; while (scanf( %d , &n) != EOF) { fill(coolness, coolness + 6001, 0); for (int i = 0; i < n; i++) { int temp; scanf( %d , &temp); coolness[temp]++; } int cost = 0; for...
#include <bits/stdc++.h> using namespace std; int t[1000006], c[1000006]; int main() { int n, a, i, x; scanf( %d , &n); scanf( %d , &a); t[a] = 1; for (i = 0; i < n; i++) { scanf( %d , &x); if (x == a) { c[x]++; } else { c[x]++; if (c[x] <= c[a]) { ...
#include <bits/stdc++.h> int main() { const int N = 3 * 3; bool buttons[N] = {0}; int k(0); while (k < N) { char temp; scanf( %c , &temp); if (temp == X ) { buttons[k++] = 1; } else if (temp == . ) { buttons[k++] = 0; } } bool symmetric(1); f...
#include <bits/stdc++.h> int main() { int n; scanf( %d , &n); int ans; ans = n / 2 + 1; printf( %d n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 7; int main() { int n, k; scanf( %d%d , &n, &k); vector<int> ans; int a = (n - k) / 2; while (ans.size() < n) { for (int i = 0; i < a; i++) ans.push_back(0); ans.push_back(1); } for (int i = 0; i < n; i++)...
#include <bits/stdc++.h> long long mod = 1000000007; using namespace std; long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } void solve() { long long n; cin >> n; long long odd = 0, even = 0; string s = to_string(n); for (int i = 0; i < s.size()...
#include <bits/stdc++.h> int n, a[100001], i; int d[100001], k = 1; int main() { scanf( %d , &n); for (i = 0; i < n; i++) { scanf( %d , &a[i]); d[a[i]]++; } for (i = 0; i < n; i++) { if (d[a[i]] == 1 && a[i] <= n) { printf( %d , a[i]); } else { while (d[k])...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector<int> a(n); { for (auto &e : (a)) cin >> e; } sort((a).begin(), (a).end()); vector<int> used(1, a[0]); for (auto e : a) { b...
#include <bits/stdc++.h> using namespace std; int n, m, seed, vmax; const int mod = 1e9 + 7; int rnd() { int rlt = seed; seed = (1ll * seed * 7 + 13) % mod; return rlt; } int expmod(int a, int b, int P) { int rlt = 1; while (b) { if (b & 1) rlt = 1ll * a * rlt % P; a = 1ll * ...
#include <bits/stdc++.h> using namespace std; int main() { double v1, v2, s1, s2, t, f, c; double m; int co; while (cin >> v1 >> v2 >> t >> f >> c) { if (v2 <= v1) cout << 0 << endl; else { s1 = t * v1; s2 = 0; m = v2 - v1; co = 0; while (s...
#include <bits/stdc++.h> using namespace std; const int inf = (1 << 30); const long long llinf = (1ll << 60); const double eps = (1e-10); const int xx[8] = {1, 0, -1, 0, 1, -1, 1, -1}; const int yy[8] = {0, 1, 0, -1, -1, 1, -1, 1}; int main() { int n; scanf( %d , &n); int cnt[10] = {0}; bo...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; const long long L = 1e9; int n, m, p, r, par[N]; long long size[N]; vector<int> adj[N]; vector<pair<long long, int> > ans; priority_queue<pair<long long, int> > q; int find_par(int v) { return par[v] == v ? v : par[v] = find_par(par[...
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; struct custom_hash { static uint64_t splitmix64(uint64_t x) { x += 0x9e3779b97f4a7c15; x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9; x = (x ^ (x >> 27)) * 0x94d049bb133111eb; return x ^ (x >> 31); } size_t...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1000000 + 10; const int MAXM = 600000 + 10; int a[64][64]; int ans, n, m; inline int sg(int x) { return 1 - 2 * x; } inline int sg(int s, int x) { return sg(s >> x & 1); } int main() { ios::sync_with_stdio(false); cin >> n; m = n...
#include <bits/stdc++.h> using namespace std; void solve() { int n, ans = 0; cin >> n; long long int ar[n]; for (int i = 0; i < n; i++) { cin >> ar[i]; } sort(ar, ar + n); long long int s = 0; for (int i = 0; i < n; i++) { if (s <= ar[i]) { s += ar[i]; ans...
#include <bits/stdc++.h> int arr[1000]; int main() { int count, i, j, n; scanf( %d , &n); for (i = 0; i < n; i++) scanf( %d , &arr[i]); count = 0; i = 0; while (i < n) { j = i; while ((j < n) && (arr[j] == 1)) j++; if (j > i) count += j - i + 1; i = j + 1; } i...
#include <bits/stdc++.h> long long arr[10000001]; using namespace std; int main() { long long n, k, m = 0; cin >> n >> k; m = (2 * n) + 1; for (int i = 1; i <= m; i++) { cin >> arr[i]; } for (int i = 2; i <= m; i += 2) { if (k == 0) { break; } if (arr[i] > a...
#include <bits/stdc++.h> using namespace std; vector<long long> g[100000 + 10]; map<pair<long long, long long>, long long> mp; map<long long, pair<long long, long long> > road; long long cnt[100000 + 10]; long long ans = 0; int visited[100000 + 10]; int L[100000 + 100]; long long n; void dfs(long lo...
#include <bits/stdc++.h> using namespace std; const double inf = 1e9; const double eps = 1e-7; int main() { int n, width, height, begin0, begin1; cin >> n >> width >> height >> begin0 >> begin1; vector<pair<int, pair<double, double>>> a(n + 1); a[0] = make_pair(0, make_pair(1, begin1 - begin0));...
#include <bits/stdc++.h> int vv[(1 << 16) + 1], ff[(1 << 16) + 1], gg[(1 << 16) + 1], bcnt[(1 << 16)]; void init() { int i; ff[0] = gg[0] = 1; for (i = 1; i <= (1 << 16); i++) { vv[i] = i == 1 ? 1 : (long long)vv[i - 998244353 % i] * (998244353 / i + 1) % ...
#include <bits/stdc++.h> using namespace std; struct node { int num; long long x; } tmp; bool cmp(node a, node b) { return a.x > b.x; } int main() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); int t; vector<node> v; cin >> t; while (t--) { v.clear(); long long...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; string s; cin >> s; bool neg = false; for (int i = 1; i <= n / 4 && !neg; i++) { for (int k = 0; k <= n - 1 - 4 * i; k++) if (s[k] == * && s[k + i] == * && s[k + 2 * i] == * && s[k + 3...
#include <bits/stdc++.h> using namespace std; const long long INF = sizeof(long long) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f; const long long MOD = (long long)(1e9) + 7; const double PI = acos(-1); const double EPS = 1e-9; using pii = pair<long long, long long>; template <typename ...
#include <bits/stdc++.h> using namespace std; const long long int N = 2e3 + 20; const long long int mod = 998244353; long long int dp[5050][5050]; bool mark[N * N + 10]; int32_t main() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); for (int i = 0; i <= 5000; ++i) for (int j...
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 5; int n, T, A[N], ch[N][26], son[N], fa[N], sz[N], m, tail[N], tg[N], ans[N], dfn[N], idx, top[N]; int MN[N], out[N]; struct smt { int t[N << 2], tag[N << 2]; void build(int l, int r, int p) { if (l == r) { t[p] = 0...
#include <bits/stdc++.h> using namespace std; const int mxN = 1e5; int n, l[17][17][mxN], r[17][17][mxN]; pair<int, int> qry(int i, int l2, int r2) { int b = 31 - __builtin_clz(r2 - l2 + 1); return {max(l[i][b][l2], l[i][b][(r2 - (1 << b) + 1) % n] - (r2 - (1 << b) + 1 - l2)), ...
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); vector<int> h(n), res(n); for (int i = 0; i < (int)(n); i++) { scanf( %d , &h[i]); } int bad = 0; int ans = 0; for (int i = 0; i < (int)(n); i++) { bad = min(bad, h[i] - i - 1); res[i...
#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > arr[111]; int vis[111], maxs; void dfs(int now, int wei) { if (vis[now]) return; vis[now] = 1; maxs = max(maxs, wei); for (int e = 0; e < arr[now].size(); e++) { int next = arr[now][e].first, n_wei = wei + arr[now][e].se...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC optimize( unroll-loops ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; const long long N = 1 << 20 \| 1, M = 998244353; long long a[N], Ans[N], n, m, x, cnt[N], b[N], Q, wn[N], rev[N], w[N]...
#include <bits/stdc++.h> using namespace std; int n, m, hd[100010], x, y, cnt, sta[600010], tp, d[100010], la; struct node { int to, next, la, fro; } e[600010]; void addedge(int x, int y) { e[++cnt] = (node){y, hd[x], 0, x}, e[hd[x]].la = cnt, hd[x] = cnt; e[++cnt] = (node){x, hd[y], 0, y}, e[hd[y...
#include <bits/stdc++.h> namespace FastIO { bool IOerror = 0; inline char nc() { static char buf[100000], p1 = buf + 100000, pend = buf + 100000; if (p1 == pend) { p1 = buf; pend = buf + fread(buf, 1, 100000, stdin); if (pend == p1) { IOerror = 1; return -1; } ...
#include <bits/stdc++.h> using namespace std; struct edge { int y, next, id; }; const int maxn = 100010, maxk = 20; int n, m, num, head[maxn], depth[maxn], f[maxn][maxk], pre[maxn], ans[maxn], s[maxn]; edge e[maxn << 1]; inline void add(int a, int b, int id) { num++; e[num].next = head[a...
#include <bits/stdc++.h> using namespace std; int n, m, ans, du[2010], d[2010], mx, sz, dp[2010]; int num, k, now, a[2010], dfn[2010], low[2010], st[2010], b[2010]; bool in[2010]; int cnt, head[2010], to[200010], nxt[200010]; vector<int> v[2010]; void add(int x, int y) { cnt++; to[cnt] = y; nx...
#include <bits/stdc++.h> using namespace std; template <class T> inline T sqr(T x) { return x * x; } const double EPS = 1e-6; const int INF = 0x3fffffff; const long long LINF = INF * 1ll * INF; const double PI = acos(-1.0); using namespace std; struct PointSet { char val; int num; } ps...
#include <bits/stdc++.h> using namespace std; long long n, m, l, r; vector<long long> A[200001]; set<pair<int, int> > se; void add(long long y) { for (auto b : A[y]) se.insert({b, y}); } void del(long long y) { for (auto b : A[y]) se.erase({b, y}); } int main() { ios_base::sync_with_stdio(...
#include <bits/stdc++.h> bool visit[201]; int main() { int n, k, a[201], i; scanf( %d%d , &n, &k); for (i = 0; i < n * 2 + 1; i++) scanf( %d , &a[i]); for (i = 0; i < n && k; i++) if (a[i * 2 + 1] > a[i * 2] + 1 && a[i * 2 + 1] > a[i * 2 + 2] + 1) { a[i * 2 + 1]--; k--; }...
#include <bits/stdc++.h> using namespace std; struct jdb { int x, y; friend long long operator^(const jdb &a, const jdb &b) { return 1ll * a.x * b.y - 1ll * a.y * b.x; } friend long long operator(const jdb &a, const jdb &b) { return 1ll a.x * b.x + 1ll * a.y * b.y; } friend bo...
#include <bits/stdc++.h> using namespace std; template <typename T> using min_pq = priority_queue<T, vector<T>, greater<T>>; template <typename T> using max_pq = priority_queue<T>; const int inf = 2e9 + 5; const long long l_inf = 2e18 + 5; const int mod_v = 1e9 + 7; const int max_n = 1e5 + 5; const ...
#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } int main() { int x, y, a, b; cin >> x >> y >> a >> b; int t = gcd(a, b); a /= t; b /= t; x /= a; y /= b; cout << a * min(x, y) << << b * min(x, y); cin >> a; return 0; ...
#include <bits/stdc++.h> using namespace std; long long mod = 1e9 + 7; long long inf = 1e18; double eps = 1e-8; double pi = acos(-1); ifstream in( input.txt ); ofstream out( output.txt ); int main() { int n; cin >> n; vector<int> a; for (int i = 0; i < n; i++) { int t; cin >>...
#include <bits/stdc++.h> using namespace std; vector<long long int> a, v, val; long long int n, x; long long int eval(long long int d, long long int i) { if ((d + x - 1) <= a[i]) { long long int ans = ((d + x - 1) * (d + x)) / 2 - ((d - 1) * (d)) / 2; return ans; } else { long long int...
#include <bits/stdc++.h> using namespace std; template <class T> inline void maxi(T &x, T y) { if (y > x) x = y; } template <class T> inline void mini(T &x, T y) { if (y < x) x = y; } const int N = 2e5, B = 0x7fffffff; int t; int main() { scanf( %d , &t); for (int tt = 1; tt <= t; tt...
#include <bits/stdc++.h> using namespace std; const long long N = 5e5 + 1, mod = 1e9 + 7, base = 17; int n, m, d, c, up; int f[N]; int sum[N]; int it[N * 4]; int common[N]; int small[N * 2]; int tmp[N]; int flag[N * 2][30]; unsigned long long hashes[N]; long long pw[N]; string srr; vector<in...
#include <bits/stdc++.h> using namespace std; int main() { long long test; test = 1; while (test--) { long long n; cin >> n; long long a[n], b[n]; for (long long i = 0; i < n; i++) cin >> a[i]; for (long long i = 0; i < n; i++) cin >> b[i]; long long aalone = 0, balon...
#include <bits/stdc++.h> using namespace std; template <class T1> void deb(T1 e1) { cout << e1 << endl; } template <class T1, class T2> void deb(T1 e1, T2 e2) { cout << e1 << << e2 << endl; } template <class T1, class T2, class T3> void deb(T1 e1, T2 e2, T3 e3) { cout << e1 << << e...
#include <bits/stdc++.h> using namespace std; struct node { int a; string type; node() {} node(int x, const char *s) { a = x; type = s; } }; map<string, node> h; char str[100]; int main() { int n; scanf( %d , &n); char a[100], b[100]; int x, y; h[ void ] =...
#include <bits/stdc++.h> int luckyDigits(long long int a) { int count1 = 0, dig; while (a != 0) { dig = a % 10; if (dig == 4 \|\| dig == 7) { count1++; } a = *a / 10; } return count1; } int main() { long long int i, j, k, n, a, count = 0; scanf( %lld%lld ,...
#include <bits/stdc++.h> using namespace std; static const int INF = 500000000; template <class T> void debug(T a, T b) { for (; a != b; ++a) cerr << *a << ; cerr << endl; } template <class T> void chmin(T& a, const T& b) { if (a > b) a = b; } template <class T> void chmax(T& a, const...
#include <bits/stdc++.h> using namespace std; int main() { int a[200010], s[200010], b[200010]; int n; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; s[a[i]] = i; } int j = 0; for (int i = 1; i <= n; i++) { cin >> b[i]; int ans = s[b[i]] - j; if (ans ...
#include <bits/stdc++.h> using namespace std; int main() { long long int n, m; cin >> n >> m; vector<string> v, l, b; for (long long int i = 0; i < n; i++) { string s; cin >> s; v.push_back(s); } long long int c = -1; for (long long int i = 0; i < n; i++) { for (l...
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> m >> n; vector<string> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } string s = ; for (int i = 0; i < n; i++) s += ; vector<string> ans(m, s); for (int i = 0; i < n; i++) for (int j ...
#include <bits/stdc++.h> using namespace std; int main() { long long x = 8 * 9 * 7 * 5; long long n; cin >> n; cout << n / x << n ; return 0; }
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int N = 1000; const int MAX_WEIGHT = 20000; const ll INF =10000000000000; int n, m; vector<int> b[2], a[2]; vector<int> suff[2]; map<int,bool> exist; int get(int i, int j, int c) { int result = 0; int value = b[i...
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const int maxn = 1e5 + 15; const int maxm = 1e6 + 15; const int mod = 1e9 + 7; struct Edge { int to, next; } edge[maxm]; int head[maxn], dfn[maxn], bccno[maxn], low[maxn]; int ecnt, cnt, bcnt; void add(int u, int v) { ...
#include <bits/stdc++.h> using namespace std; const int maxn = 55; int n; int xi[maxn], yi[maxn]; int ans1 = 0, ans2 = 0; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &xi[i]), ans1 += xi[i]; for (int i = 1; i <= n; i++) scanf( %d , &yi[i]), ans2 += yi[i]; if (ans1 <...
#include <bits/stdc++.h> #pragma GCC target( avx2 ) #pragma GCC optimization( O3 ) #pragma GCC optimization( unroll-loops ) using namespace std; template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { os << { << p.first << , << p.second << } ; return os; } co...
#include <bits/stdc++.h> using namespace std; const int maxn = 502; vector<int> adj[maxn]; bool vis[maxn]; bool fin[maxn]; vector<pair<int, int> > edgesInCycle; int n; bool dfs(int node) { vis[node] = 1; for (int ch : adj[node]) { edgesInCycle.push_back({node, ch}); if (!vis[ch]) { ...
#include <bits/stdc++.h> using namespace std; int main() { int n, t; cin >> n >> t; if (n == 1 && t == 10) { cout << -1 << endl; return 0; } cout << ((t == 10) ? 1 : t); while (n-- > 1) { cout << 0 ; } return 0; }
#include <iostream> #include <algorithm> #include <cstdio> #include <vector> #include <stack> #include <string> #include <cstring> #include <queue> #include <map> #include <set> #include <cmath> #include <climits> #include <functional> typedef long long ll; using namespace std; in...
#include <bits/stdc++.h> using namespace std; int main() { static char data[100015]; static int a[100015]; static int b[100015]; memset(a, 0, sizeof(a)); memset(b, 0, sizeof(b)); int i, j, N, len; N = 0; scanf( %s n , data); len = strlen(data); if (len > N) N = len; for (...
#include <bits/stdc++.h> using namespace std; long long powr(long long a, long long b) { long long res = 1; while (b) { if (b % 2 == 1) res = res * a % 1000000007; a = a * a % 1000000007; b /= 2; } return res; } int main() { int p, k; cin >> p >> k; vector<int> g[p]...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 5; int n, m, k; int main() { cin >> n >> m >> k; cout << m * (m - 1) / 2 << endl; for (int i = 1; i <= m; i++) { for (int j = i + 1; j <= m; j++) { if (k) cout << j << << i << endl; else ...
#include <bits/stdc++.h> using namespace std; using ll = long long; using uint = unsigned int; using rl = double; using pii = pair<int, int>; const int MAXN = 3 * 100009; int n, m; struct Vert { vector<int> to; vector<pair<int, int>> qlist; int depth; ll vsum; } v[MAXN]; ll psum[2 * ...
#include <bits/stdc++.h> using namespace std; const int N = 1010; int C[N][N], dp[N][N]; int main() { int m, x[110], y[110], sum[110]; sum[0] = 0; scanf( %d , &m); for (int i = 1; i <= m; i++) { scanf( %d , x + i); sum[i] = sum[i - 1] + x[i]; } for (int i = 1; i <= m; i++) { ...
#include <bits/stdc++.h> using namespace std; char a[100005]; int b[100005]; map<pair<int, int>, int> maps; int main() { int nx, ny, x, y, x1, y1, n; scanf( %d%d%d%d , &nx, &ny, &x, &y); scanf( %s , a); for (int i = 0; i < 100005; i++) b[i] = 0; b[0] = 1; maps[make_pair(x, y)] = 1; ...

#include <bits/stdc++.h> using namespace std; const int N = int(1e5) + 10; const int K = 11; const int MOD = int(1e9) + 7; const int INF = int(2e9) + 5; const long long INF64 = 1e18; int dp[N]; void solve() { string s; cin >> s; stack<int> st; int n = s.length(); for (int i = 0; i < ...

#include <bits/stdc++.h> using namespace std; int a[200005]; int main() { int n; int i; while (scanf( %d , &n) != EOF) { for (i = 0; i < n; i++) { scanf( %d , &a[i]); } sort(a, a + n); int p = (n - 2) / 2; int ans = 1e9; for (i = 0; i < n - p - 1; i++) { ...

#include <bits/stdc++.h> using namespace std; const int N = 2e3 + 10; const int B = 1e3 + 10; bool vis[N], inque[2 * N]; int n, k; vector<int> v; int main() { scanf( %d%d , &n, &k); for (int i = 0; i < k; i++) { int t; scanf( %d , &t); if (!vis[t]) { vis[t] = true; ...

#include <bits/stdc++.h> using namespace std; long long a[100005]; long long req = 1e18; long long steps(long long n) { long long c = 1; if (n == 1) return 1e6; while (req > 1) { req /= n; c++; } req = 1e18; return c; } long long pow_exp(long long a, long long n) { lo...

#include <bits/stdc++.h> using namespace std; struct matrix { long long a[100][100]; void init() { memset(a, 0, sizeof(a)); } friend matrix operator*(matrix x, matrix y) { matrix ans; ans.init(); for (int i = 0; i < 100; i++) for (int j = 0; j < 100; j++) { for (int k...

#include <bits/stdc++.h> using namespace std; int N; bool indegree[200010]; int a[200010]; bool visited[200010]; vector<pair<int, int> > ans; int main() { int i, j, k; scanf( %d , &N); for (i = (0); i < (N); i++) scanf( %d , a + i); for (i = (0); i < (N); i++) a[i]--; memset((visited),...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); string base, s; cin >> base >> s; int n = base.size(), m = s.size(); base = * + base; s = * + s; int f[m + 2][n + 2]; memset(f, 0, sizeof(f)); for (int i ...

#include <bits/stdc++.h> using namespace std; int color[30]; int colornow[30]; int op0[10][10] = {{2, 4, 6, 8, 10, 12, 23, 21}, {3, 4, 17, 19, 10, 9, 16, 14}, {13, 14, 5, 6, 17, 18, 21, 22}}; int op1[10][10] = {{6, 8, 10, 12, 23, 21, 2, 4}, {17, 1...

#include <bits/stdc++.h> using namespace std; int main() { long long n, q; scanf( %lld %lld , &n, &q); while (q--) { long long x; scanf( %lld , &x); while (x % 2 == 0) { x += (n - x / 2); } printf( %lld n , x / 2 + 1); } return 0; }

#include <bits/stdc++.h> using namespace std; int main() { long long n, k, x; while (cin >> n >> k) { long long sum = 0; x = n * (k - 1) / k - 10; if (x <= 0) { x = 1; } long long c = x; sum = x; while (sum < n) { c /= k; sum += c; if...

#include <bits/stdc++.h> using namespace std; const int maxn = 100005, inf = 1e9 + 7; int fa[maxn]; long long n, m, dp[maxn]; int sz[maxn], costs[maxn]; vector<int> fas; bool vis[maxn]; int findfa(int x) { if (fa[x] == x) return x; else return fa[x] = findfa(fa[x]); } void bag(in...

#include <bits/stdc++.h> using namespace std; const int MAX = 1e6 + 10; const int INF = 1e9 + 7; int prime[MAX]; int main() { int x2; scanf( %d , &x2); for (int i = 2; i <= x2; i++) { if (!prime[i]) { for (int j = i * 2; j <= x2; j += i) prime[j] = i; } } int ans = INF;...

#include <bits/stdc++.h> using namespace std; long long x; long long n, f = 1; int main() { cin >> n; if (n < 0) { f = -1; n = -n; } x = (n % 360) * f * (-1); long long a0 = x, a1 = x + 90, a2 = x + 180, a3 = x + 270; a0 = min(abs(a0), (360 + a0) % 360); if (a0 > 180) a0 ...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> A(n); vector<int> B(n, 1); for (int i = 0; i < n; i++) { cin >> A[i]; } int max1 = B[0]; for (int i = 1; i < n; i++) { if (A[i] >= A[i - 1]) { B[i] = B[i - 1] + 1; } ...

#include <bits/stdc++.h> using namespace std; int a[1000100], b[5010]; string second[10]; int main() { int n, sm = 0; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; } sort(a + 1, a + n); for (;;) { if (a[0] <= a[n - 1]) { a[n - 1]--; a[0]++; sm++...

#include <bits/stdc++.h> using namespace std; template <typename tp> inline void read(tp &x) { x = 0; char c = getchar(); int f = 0; for (; c < 0 || c > 9 ; f |= c == - , c = getchar()) ; for (; c >= 0 && c <= 9 ; x = (x << 3) + (x << 1) + c - 0 , c = getchar()) ; if (f...

#include <bits/stdc++.h> using namespace std; int color[10010], c[10010], d[10010], f[10010], N, t, x; int main() { scanf( %d , &N); for (int i = 1; i <= N; i++) { scanf( %d , color + i); if (!f[color[i]]) f[color[i]] = i; } int m, col; for (int i = 1; i <= N; i++) { m = 1; ...

#include <bits/stdc++.h> using namespace std; const long long maxn = 2e5 + 10, inf = 4e18, mod = 1e9 + 7; const long double pi = 3.14159265359, eps = 1e-9; long long n, m; vector<long long> g[maxn], jj[3]; long long mk[maxn]; bool dfs(long long v, long long p = -1, long long dep = 1) { mk[v] = dep; ...

#include <bits/stdc++.h> using namespace std; vector<int> s[222222], ss[222222]; int n, m, cnt, cnt2, h; int up[222222][22], fa[222222], deep[211111], q[211111], dfn[211111], low[211111]; void tarjan(int x) { int c, i, y; dfn[x] = low[x] = ++cnt; q[h] = x; h++; c = s[x].size(); f...

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

#include <bits/stdc++.h> using namespace std; vector<long long> st; long long n, q; vector<int> swp(20, false); vector<long long> arr; void build(long long ind, long long l, long long r) { if (l == r) { st[ind] = arr[l]; return; } long long mid = (l + r) >> 1; build(2 * ind, l, m...

#include <bits/stdc++.h> inline long long read() { long long x = 0, f = 1; char c = getchar(); for (; c > 9 || c < 0 ; c = getchar()) { if (c == - ) f = -1; } for (; c >= 0 && c <= 9 ; c = getchar()) { x = x * 10 + c - 0 ; } return x * f; } int a[100005]; std::vec...

#include <bits/stdc++.h> using namespace std; const long long maxn = 100005; const int mod = 1e9 + 9; const int pp = 31; const int ppp = 56; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; int i, j, k, n; string s, t; cin >> s >> t >> k; n = s.length(); v...

#include <bits/stdc++.h> using namespace std; const int maxn = (int)(1e5) + 123; const int INF = (int)(1e9); int n, a[maxn], t[4 * maxn], tt; pair<int, int> b[maxn]; int gcd(int a, int b) { while (a > 0 && b > 0) { if (a > b) a %= b; else b %= a; } return a + b; } ...

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

#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const double eps = 1e-6; const int maxn = 3e5 + 10; const int maxm = 1e6 + 10; const long long mod = 998244353; int a[maxn], b[maxn]; bool judge(int mid, int h) { int temph = h; for (int i = 0; i < mid; i++) b[i] = a[i]; ...

#include <bits/stdc++.h> using namespace std; int p_arr[200005]; int main() { int n, in, cnt, x, arr[200005]; std::cin >> n; queue<int> q; for (int i = 1; i <= n; i++) { std::cin >> in; q.push(in); } for (int i = 1; i <= n; i++) { std::cin >> arr[i]; } cnt = 0; ...

#include <bits/stdc++.h> using namespace std; char g[21][21]; int n, m, id[21][21], cv, cb, var[(1 << 8)], dr[] = {1, 0, -1, 0}, dc[] = {0, 1, 0, -1}, d[21][21][(1 << 8)]; bool inq[21][21][(1 << 8)]; struct node { int r, c, msk; }; queue<node> q; vector<node> b; void input() { scanf( %d%...

#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); ; vector<int> v(n); for (int i = 0; i < n; i++) scanf( %d , &v[i]); ; int diff = 0; int ans = v[0]; for (int i = 0; i < n - 1; i++) { diff += (v[i] - v[i + 1]); if (diff < 0) { ...

#include <bits/stdc++.h> using namespace std; int n, k; int x; int a[1000]; int main() { scanf( %d%d , &n, &k); for (int i = 0; i < 2 * n + 1; i++) { scanf( %d , &a[i]); } for (int i = 0; i < 2 * n + 1; i++) { if (i % 2 == 1 && k > 0 && a[i] > a[i - 1] + 1 && a[i] > a[i + 1] + 1) {...

#include <bits/stdc++.h> using namespace std; int n, a[100005], mi, mid, ma; long long m, sum; bool b[100005], flag; bool check() { long long sum = 0; for (int i = 0; i < n; i++) sum += min(a[i], mid); return sum <= m; } int main() { cin >> n >> m; sum = 0; for (int i = 0; i < n; i...

#include <bits/stdc++.h> using namespace std; const int N = 2000005; int lp[N + 1]; vector<int> pr, adj[100005]; vector<int> v[N]; int a[N], ans[100005], depth[100005]; void seive() { for (int i = 2; i <= N; ++i) { if (lp[i] == 0) { lp[i] = i; pr.push_back(i); } for (...

#include <bits/stdc++.h> using namespace std; const int MAX_N = 1e5 + 5; const long long MOD = 1e9 + 7; const long long INF = 1e9 + 7; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, x, y; cin >> n >> x >> y; set<double> s; int count = 0; while (n--) ...

#include <bits/stdc++.h> using namespace std; mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); const int nmax = 2e5 + 5; int t, n, a[nmax], b[nmax], f[nmax], L[nmax], R[nmax], d[nmax]; long long ans; vector<int> v1[nmax], v2[nmax]; int main() { srand(time(NULL)); ios::sync_w...

#include <bits/stdc++.h> using namespace std; const int nMAX = 20; long long comb[nMAX][nMAX]; long long mem[10][20]; int cnt[10]; long long nCr(int n, int k) { if (n < k) return 0; if (k == 0 || n == 0) return 1; if (~comb[n][k]) return comb[n][k]; if (n - k < k) return comb[n][k] = nCr(n, ...

#include <bits/stdc++.h> using namespace std; int coolness[6001]; int main() { int n; while (scanf( %d , &n) != EOF) { fill(coolness, coolness + 6001, 0); for (int i = 0; i < n; i++) { int temp; scanf( %d , &temp); coolness[temp]++; } int cost = 0; for...

#include <bits/stdc++.h> using namespace std; int t[1000006], c[1000006]; int main() { int n, a, i, x; scanf( %d , &n); scanf( %d , &a); t[a] = 1; for (i = 0; i < n; i++) { scanf( %d , &x); if (x == a) { c[x]++; } else { c[x]++; if (c[x] <= c[a]) { ...

#include <bits/stdc++.h> int main() { const int N = 3 * 3; bool buttons[N] = {0}; int k(0); while (k < N) { char temp; scanf( %c , &temp); if (temp == X ) { buttons[k++] = 1; } else if (temp == . ) { buttons[k++] = 0; } } bool symmetric(1); f...

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

#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 7; int main() { int n, k; scanf( %d%d , &n, &k); vector<int> ans; int a = (n - k) / 2; while (ans.size() < n) { for (int i = 0; i < a; i++) ans.push_back(0); ans.push_back(1); } for (int i = 0; i < n; i++)...

#include <bits/stdc++.h> long long mod = 1000000007; using namespace std; long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } void solve() { long long n; cin >> n; long long odd = 0, even = 0; string s = to_string(n); for (int i = 0; i < s.size()...

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

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector<int> a(n); { for (auto &e : (a)) cin >> e; } sort((a).begin(), (a).end()); vector<int> used(1, a[0]); for (auto e : a) { b...

#include <bits/stdc++.h> using namespace std; int n, m, seed, vmax; const int mod = 1e9 + 7; int rnd() { int rlt = seed; seed = (1ll * seed * 7 + 13) % mod; return rlt; } int expmod(int a, int b, int P) { int rlt = 1; while (b) { if (b & 1) rlt = 1ll * a * rlt % P; a = 1ll * ...

#include <bits/stdc++.h> using namespace std; int main() { double v1, v2, s1, s2, t, f, c; double m; int co; while (cin >> v1 >> v2 >> t >> f >> c) { if (v2 <= v1) cout << 0 << endl; else { s1 = t * v1; s2 = 0; m = v2 - v1; co = 0; while (s...

#include <bits/stdc++.h> using namespace std; const int inf = (1 << 30); const long long llinf = (1ll << 60); const double eps = (1e-10); const int xx[8] = {1, 0, -1, 0, 1, -1, 1, -1}; const int yy[8] = {0, 1, 0, -1, -1, 1, -1, 1}; int main() { int n; scanf( %d , &n); int cnt[10] = {0}; bo...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; const long long L = 1e9; int n, m, p, r, par[N]; long long size[N]; vector<int> adj[N]; vector<pair<long long, int> > ans; priority_queue<pair<long long, int> > q; int find_par(int v) { return par[v] == v ? v : par[v] = find_par(par[...

#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; struct custom_hash { static uint64_t splitmix64(uint64_t x) { x += 0x9e3779b97f4a7c15; x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9; x = (x ^ (x >> 27)) * 0x94d049bb133111eb; return x ^ (x >> 31); } size_t...

#include <bits/stdc++.h> using namespace std; const int MAXN = 1000000 + 10; const int MAXM = 600000 + 10; int a[64][64]; int ans, n, m; inline int sg(int x) { return 1 - 2 * x; } inline int sg(int s, int x) { return sg(s >> x & 1); } int main() { ios::sync_with_stdio(false); cin >> n; m = n...

#include <bits/stdc++.h> using namespace std; void solve() { int n, ans = 0; cin >> n; long long int ar[n]; for (int i = 0; i < n; i++) { cin >> ar[i]; } sort(ar, ar + n); long long int s = 0; for (int i = 0; i < n; i++) { if (s <= ar[i]) { s += ar[i]; ans...

#include <bits/stdc++.h> int arr[1000]; int main() { int count, i, j, n; scanf( %d , &n); for (i = 0; i < n; i++) scanf( %d , &arr[i]); count = 0; i = 0; while (i < n) { j = i; while ((j < n) && (arr[j] == 1)) j++; if (j > i) count += j - i + 1; i = j + 1; } i...

#include <bits/stdc++.h> long long arr[10000001]; using namespace std; int main() { long long n, k, m = 0; cin >> n >> k; m = (2 * n) + 1; for (int i = 1; i <= m; i++) { cin >> arr[i]; } for (int i = 2; i <= m; i += 2) { if (k == 0) { break; } if (arr[i] > a...

#include <bits/stdc++.h> using namespace std; vector<long long> g[100000 + 10]; map<pair<long long, long long>, long long> mp; map<long long, pair<long long, long long> > road; long long cnt[100000 + 10]; long long ans = 0; int visited[100000 + 10]; int L[100000 + 100]; long long n; void dfs(long lo...

#include <bits/stdc++.h> using namespace std; const double inf = 1e9; const double eps = 1e-7; int main() { int n, width, height, begin0, begin1; cin >> n >> width >> height >> begin0 >> begin1; vector<pair<int, pair<double, double>>> a(n + 1); a[0] = make_pair(0, make_pair(1, begin1 - begin0));...

#include <bits/stdc++.h> int vv[(1 << 16) + 1], ff[(1 << 16) + 1], gg[(1 << 16) + 1], bcnt[(1 << 16)]; void init() { int i; ff[0] = gg[0] = 1; for (i = 1; i <= (1 << 16); i++) { vv[i] = i == 1 ? 1 : (long long)vv[i - 998244353 % i] * (998244353 / i + 1) % ...

#include <bits/stdc++.h> using namespace std; struct node { int num; long long x; } tmp; bool cmp(node a, node b) { return a.x > b.x; } int main() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); int t; vector<node> v; cin >> t; while (t--) { v.clear(); long long...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; string s; cin >> s; bool neg = false; for (int i = 1; i <= n / 4 && !neg; i++) { for (int k = 0; k <= n - 1 - 4 * i; k++) if (s[k] == * && s[k + i] == * && s[k + 2 * i] == * && s[k + 3...

#include <bits/stdc++.h> using namespace std; const long long INF = sizeof(long long) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f; const long long MOD = (long long)(1e9) + 7; const double PI = acos(-1); const double EPS = 1e-9; using pii = pair<long long, long long>; template <typename ...

#include <bits/stdc++.h> using namespace std; const long long int N = 2e3 + 20; const long long int mod = 998244353; long long int dp[5050][5050]; bool mark[N * N + 10]; int32_t main() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); for (int i = 0; i <= 5000; ++i) for (int j...

#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 5; int n, T, A[N], ch[N][26], son[N], fa[N], sz[N], m, tail[N], tg[N], ans[N], dfn[N], idx, top[N]; int MN[N], out[N]; struct smt { int t[N << 2], tag[N << 2]; void build(int l, int r, int p) { if (l == r) { t[p] = 0...

#include <bits/stdc++.h> using namespace std; const int mxN = 1e5; int n, l[17][17][mxN], r[17][17][mxN]; pair<int, int> qry(int i, int l2, int r2) { int b = 31 - __builtin_clz(r2 - l2 + 1); return {max(l[i][b][l2], l[i][b][(r2 - (1 << b) + 1) % n] - (r2 - (1 << b) + 1 - l2)), ...

#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); vector<int> h(n), res(n); for (int i = 0; i < (int)(n); i++) { scanf( %d , &h[i]); } int bad = 0; int ans = 0; for (int i = 0; i < (int)(n); i++) { bad = min(bad, h[i] - i - 1); res[i...

#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > arr[111]; int vis[111], maxs; void dfs(int now, int wei) { if (vis[now]) return; vis[now] = 1; maxs = max(maxs, wei); for (int e = 0; e < arr[now].size(); e++) { int next = arr[now][e].first, n_wei = wei + arr[now][e].se...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC optimize( unroll-loops ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; const long long N = 1 << 20 | 1, M = 998244353; long long a[N], Ans[N], n, m, x, cnt[N], b[N], Q, wn[N], rev[N], w[N]...

#include <bits/stdc++.h> using namespace std; int n, m, hd[100010], x, y, cnt, sta[600010], tp, d[100010], la; struct node { int to, next, la, fro; } e[600010]; void addedge(int x, int y) { e[++cnt] = (node){y, hd[x], 0, x}, e[hd[x]].la = cnt, hd[x] = cnt; e[++cnt] = (node){x, hd[y], 0, y}, e[hd[y...

#include <bits/stdc++.h> namespace FastIO { bool IOerror = 0; inline char nc() { static char buf[100000], *p1 = buf + 100000, *pend = buf + 100000; if (p1 == pend) { p1 = buf; pend = buf + fread(buf, 1, 100000, stdin); if (pend == p1) { IOerror = 1; return -1; } ...

#include <bits/stdc++.h> using namespace std; struct edge { int y, next, id; }; const int maxn = 100010, maxk = 20; int n, m, num, head[maxn], depth[maxn], f[maxn][maxk], pre[maxn], ans[maxn], s[maxn]; edge e[maxn << 1]; inline void add(int a, int b, int id) { num++; e[num].next = head[a...

#include <bits/stdc++.h> using namespace std; int n, m, ans, du[2010], d[2010], mx, sz, dp[2010]; int num, k, now, a[2010], dfn[2010], low[2010], st[2010], b[2010]; bool in[2010]; int cnt, head[2010], to[200010], nxt[200010]; vector<int> v[2010]; void add(int x, int y) { cnt++; to[cnt] = y; nx...

#include <bits/stdc++.h> using namespace std; template <class T> inline T sqr(T x) { return x * x; } const double EPS = 1e-6; const int INF = 0x3fffffff; const long long LINF = INF * 1ll * INF; const double PI = acos(-1.0); using namespace std; struct PointSet { char val; int num; } ps...

#include <bits/stdc++.h> using namespace std; long long n, m, l, r; vector<long long> A[200001]; set<pair<int, int> > se; void add(long long y) { for (auto b : A[y]) se.insert({b, y}); } void del(long long y) { for (auto b : A[y]) se.erase({b, y}); } int main() { ios_base::sync_with_stdio(...

#include <bits/stdc++.h> bool visit[201]; int main() { int n, k, a[201], i; scanf( %d%d , &n, &k); for (i = 0; i < n * 2 + 1; i++) scanf( %d , &a[i]); for (i = 0; i < n && k; i++) if (a[i * 2 + 1] > a[i * 2] + 1 && a[i * 2 + 1] > a[i * 2 + 2] + 1) { a[i * 2 + 1]--; k--; }...

#include <bits/stdc++.h> using namespace std; struct jdb { int x, y; friend long long operator^(const jdb &a, const jdb &b) { return 1ll * a.x * b.y - 1ll * a.y * b.x; } friend long long operator*(const jdb &a, const jdb &b) { return 1ll * a.x * b.x + 1ll * a.y * b.y; } friend bo...

#include <bits/stdc++.h> using namespace std; template <typename T> using min_pq = priority_queue<T, vector<T>, greater<T>>; template <typename T> using max_pq = priority_queue<T>; const int inf = 2e9 + 5; const long long l_inf = 2e18 + 5; const int mod_v = 1e9 + 7; const int max_n = 1e5 + 5; const ...

#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } int main() { int x, y, a, b; cin >> x >> y >> a >> b; int t = gcd(a, b); a /= t; b /= t; x /= a; y /= b; cout << a * min(x, y) << << b * min(x, y); cin >> a; return 0; ...

#include <bits/stdc++.h> using namespace std; long long mod = 1e9 + 7; long long inf = 1e18; double eps = 1e-8; double pi = acos(-1); ifstream in( input.txt ); ofstream out( output.txt ); int main() { int n; cin >> n; vector<int> a; for (int i = 0; i < n; i++) { int t; cin >>...

#include <bits/stdc++.h> using namespace std; vector<long long int> a, v, val; long long int n, x; long long int eval(long long int d, long long int i) { if ((d + x - 1) <= a[i]) { long long int ans = ((d + x - 1) * (d + x)) / 2 - ((d - 1) * (d)) / 2; return ans; } else { long long int...

#include <bits/stdc++.h> using namespace std; template <class T> inline void maxi(T &x, T y) { if (y > x) x = y; } template <class T> inline void mini(T &x, T y) { if (y < x) x = y; } const int N = 2e5, B = 0x7fffffff; int t; int main() { scanf( %d , &t); for (int tt = 1; tt <= t; tt...

#include <bits/stdc++.h> using namespace std; const long long N = 5e5 + 1, mod = 1e9 + 7, base = 17; int n, m, d, c, up; int f[N]; int sum[N]; int it[N * 4]; int common[N]; int small[N * 2]; int tmp[N]; int flag[N * 2][30]; unsigned long long hashes[N]; long long pw[N]; string srr; vector<in...

#include <bits/stdc++.h> using namespace std; int main() { long long test; test = 1; while (test--) { long long n; cin >> n; long long a[n], b[n]; for (long long i = 0; i < n; i++) cin >> a[i]; for (long long i = 0; i < n; i++) cin >> b[i]; long long aalone = 0, balon...

#include <bits/stdc++.h> using namespace std; template <class T1> void deb(T1 e1) { cout << e1 << endl; } template <class T1, class T2> void deb(T1 e1, T2 e2) { cout << e1 << << e2 << endl; } template <class T1, class T2, class T3> void deb(T1 e1, T2 e2, T3 e3) { cout << e1 << << e...

#include <bits/stdc++.h> using namespace std; struct node { int a; string type; node() {} node(int x, const char *s) { a = x; type = s; } }; map<string, node> h; char str[100]; int main() { int n; scanf( %d , &n); char a[100], b[100]; int x, y; h[ void ] =...

#include <bits/stdc++.h> int luckyDigits(long long int *a) { int count1 = 0, dig; while (*a != 0) { dig = *a % 10; if (dig == 4 || dig == 7) { count1++; } *a = *a / 10; } return count1; } int main() { long long int i, j, k, n, a, count = 0; scanf( %lld%lld ,...

#include <bits/stdc++.h> using namespace std; static const int INF = 500000000; template <class T> void debug(T a, T b) { for (; a != b; ++a) cerr << *a << ; cerr << endl; } template <class T> void chmin(T& a, const T& b) { if (a > b) a = b; } template <class T> void chmax(T& a, const...

#include <bits/stdc++.h> using namespace std; int main() { int a[200010], s[200010], b[200010]; int n; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; s[a[i]] = i; } int j = 0; for (int i = 1; i <= n; i++) { cin >> b[i]; int ans = s[b[i]] - j; if (ans ...

#include <bits/stdc++.h> using namespace std; int main() { long long int n, m; cin >> n >> m; vector<string> v, l, b; for (long long int i = 0; i < n; i++) { string s; cin >> s; v.push_back(s); } long long int c = -1; for (long long int i = 0; i < n; i++) { for (l...

#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> m >> n; vector<string> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } string s = ; for (int i = 0; i < n; i++) s += ; vector<string> ans(m, s); for (int i = 0; i < n; i++) for (int j ...

#include <bits/stdc++.h> using namespace std; int main() { long long x = 8 * 9 * 7 * 5; long long n; cin >> n; cout << n / x << n ; return 0; }

#include <bits/stdc++.h> using namespace std; typedef long long ll; const int N = 1000; const int MAX_WEIGHT = 20000; const ll INF =10000000000000; int n, m; vector<int> b[2], a[2]; vector<int> suff[2]; map<int,bool> exist; int get(int i, int j, int c) { int result = 0; int value = b[i...

#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const int maxn = 1e5 + 15; const int maxm = 1e6 + 15; const int mod = 1e9 + 7; struct Edge { int to, next; } edge[maxm]; int head[maxn], dfn[maxn], bccno[maxn], low[maxn]; int ecnt, cnt, bcnt; void add(int u, int v) { ...

#include <bits/stdc++.h> using namespace std; const int maxn = 55; int n; int xi[maxn], yi[maxn]; int ans1 = 0, ans2 = 0; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &xi[i]), ans1 += xi[i]; for (int i = 1; i <= n; i++) scanf( %d , &yi[i]), ans2 += yi[i]; if (ans1 <...

#include <bits/stdc++.h> #pragma GCC target( avx2 ) #pragma GCC optimization( O3 ) #pragma GCC optimization( unroll-loops ) using namespace std; template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { os << { << p.first << , << p.second << } ; return os; } co...

#include <bits/stdc++.h> using namespace std; const int maxn = 502; vector<int> adj[maxn]; bool vis[maxn]; bool fin[maxn]; vector<pair<int, int> > edgesInCycle; int n; bool dfs(int node) { vis[node] = 1; for (int ch : adj[node]) { edgesInCycle.push_back({node, ch}); if (!vis[ch]) { ...

#include <bits/stdc++.h> using namespace std; int main() { int n, t; cin >> n >> t; if (n == 1 && t == 10) { cout << -1 << endl; return 0; } cout << ((t == 10) ? 1 : t); while (n-- > 1) { cout << 0 ; } return 0; }

#include <iostream> #include <algorithm> #include <cstdio> #include <vector> #include <stack> #include <string> #include <cstring> #include <queue> #include <map> #include <set> #include <cmath> #include <climits> #include <functional> typedef long long ll; using namespace std; in...

#include <bits/stdc++.h> using namespace std; int main() { static char data[100015]; static int a[100015]; static int b[100015]; memset(a, 0, sizeof(a)); memset(b, 0, sizeof(b)); int i, j, N, len; N = 0; scanf( %s n , data); len = strlen(data); if (len > N) N = len; for (...

#include <bits/stdc++.h> using namespace std; long long powr(long long a, long long b) { long long res = 1; while (b) { if (b % 2 == 1) res = res * a % 1000000007; a = a * a % 1000000007; b /= 2; } return res; } int main() { int p, k; cin >> p >> k; vector<int> g[p]...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 5; int n, m, k; int main() { cin >> n >> m >> k; cout << m * (m - 1) / 2 << endl; for (int i = 1; i <= m; i++) { for (int j = i + 1; j <= m; j++) { if (k) cout << j << << i << endl; else ...

#include <bits/stdc++.h> using namespace std; using ll = long long; using uint = unsigned int; using rl = double; using pii = pair<int, int>; const int MAXN = 3 * 100009; int n, m; struct Vert { vector<int> to; vector<pair<int, int>> qlist; int depth; ll vsum; } v[MAXN]; ll psum[2 * ...

#include <bits/stdc++.h> using namespace std; const int N = 1010; int C[N][N], dp[N][N]; int main() { int m, x[110], y[110], sum[110]; sum[0] = 0; scanf( %d , &m); for (int i = 1; i <= m; i++) { scanf( %d , x + i); sum[i] = sum[i - 1] + x[i]; } for (int i = 1; i <= m; i++) { ...

#include <bits/stdc++.h> using namespace std; char a[100005]; int b[100005]; map<pair<int, int>, int> maps; int main() { int nx, ny, x, y, x1, y1, n; scanf( %d%d%d%d , &nx, &ny, &x, &y); scanf( %s , a); for (int i = 0; i < 100005; i++) b[i] = 0; b[0] = 1; maps[make_pair(x, y)] = 1; ...