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

func_code_string stringlengths 59 71.4k
#include <bits/stdc++.h> using namespace ::std; int main() { int n, m; cin >> n; int ara[2 * n + 7]; for (int i = 0; i < 2 * n; i++) { cin >> ara[i]; } sort(ara, ara + (2 * n)); if (ara[n - 1] == ara[n]) { cout << NO ; } else { cout << YES ; } }
#include <bits/stdc++.h> using namespace std; const int maxn = 200005; inline int gi() { char c = getchar(); while (c < 0 \|\| c > 9 ) c = getchar(); int sum = 0; while ( 0 <= c && c <= 9 ) sum = sum * 10 + c - 48, c = getchar(); return sum; } int n, m, q, A[maxn], B[maxn]; vector<pai...
#include <bits/stdc++.h> using namespace std; int n, m, ans, sx, sy, ex, ey, endx = -1, endy = -1; char s[1005][1006]; pair<int, int> xx[1005]; pair<int, int> yy[1005]; bool able(int x, int y) { int nx = sx, ny = sy; while (true) { int nex = nx + x + 1, ney = ny + y + 1; if (nex > endx &...
#include <bits/stdc++.h> using namespace std; const int maxn = 502; int n, k; int a[maxn], b[maxn], c[maxn]; bool check(int l, int r) { if (l == r) return true; for (int i = l + 1; i <= r; ++i) if (a[i] != a[l]) return true; return false; } bool print(int p, int r, int dir) { printf(...
#include <bits/stdc++.h> using namespace std; int M[16]; int R[16]; int N; int main() { cin >> N; for (int i = 0; i < N; i++) { cin >> M[i]; } for (int i = 0; i < N; i++) { cin >> R[i]; } int ans = 0; for (int i = 0; i < 720720; i++) { bool checker = false; ...
#include <bits/stdc++.h> using namespace std; vector<long long> v; long long a, b; int main() { ios_base::sync_with_stdio(0); cin >> a >> b; while (true) { v.push_back(b); if (b % 10 == 1) { b--; b /= 10; } else if (b % 2 == 0) { b /= 2; } else { ...
#include <bits/stdc++.h> using namespace std; int main() { int n, l; cin >> n >> l; vector<int> v = vector<int>(n); for (int i = 0; i < n; i++) cin >> v[i]; sort(v.begin(), v.end()); int vals = 1; int prev = v[0]; vector<pair<int, int>> vp; vp.push_back(make_pair(prev, 1)); f...
#include <bits/stdc++.h> using namespace std; const long long inf = 1e15; const int N = 2e5 + 10; int I[N], st[N], fn[N], par[N], h[N], sz[N], big[N], hd[N], n, m, q, timer; long long w[N]; vector<int> g[N], V[N]; struct Node { pair<long long, long long> Mn; long long Lazy = 0; } seg[N << 2]; ...
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; set<int> a, b; set<int> pre; char str[10]; int main() { int n; cin >> n; long long ans = 1; a.insert(0); b.insert(1e9 + 5); for (int i = 0; i < n; ++i) { int x; scanf( %s%d , str, &x); if (str[1]...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int prev = 0; int ans = 0; for (int i = 1; i <= n; i++) { ans += (n - i) * (i - 1) + i; prev = i; } cout << ans; }
#include <bits/stdc++.h> using namespace std; const int fx[] = {+0, +0, +1, -1, -1, +1, -1, +1}; const int fy[] = {-1, +1, +0, +0, +1, +1, -1, -1}; long long dp[1005][1005][2]; string s; int k; int ar[1026]; long long Dance_of_Death(int x, int rem, int f) { if (x == s.size()) { if (ar[rem] + 1...
#include <bits/stdc++.h> using namespace std; const int maxn = 3005; const int maxm = maxn * maxn << 1; int n, m, q; int id[maxn][maxn << 1]; int fa[maxm]; int vis[maxm]; int top = 0; stack<pair<int, int> > sta; inline int getfa(int x) { sta.push(make_pair(x, fa[x])); return fa[x] == x ? x :...
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( Ofast,unroll-loops ) #pragma GCC target( avx,avx2,sse,sse2 ) 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 ...
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); } long long Max(long long a, long long b) { return a > b ? a : b; } long long Min(long long a, long long b) { retur...
#include <bits/stdc++.h> using namespace std; unsigned long long n, k, c, a, b, d; multiset<unsigned long long> vn; multiset<unsigned long long> vk; unsigned long long mod = 1e9 + 7; unsigned long long sum = 0; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; cin >...
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; long long ans = 0; for (int i = (0); i < (n); ++i) { long long t, T, x, cost; cin >> t >> T >> x >> cost; if (t >= T) { ans += cost + m * x; continue; } long long aux1 = ...
#include <bits/stdc++.h> using namespace std; const int maxn = 1000 + 10; long long par[maxn], t[maxn], c[maxn]; const long long inf = 1000000000000ll; long long dist[maxn][maxn], dis[maxn]; bool mark[maxn]; vector<int> v[maxn], u[maxn]; set<pair<long long, int> > s; vector<long long> cost1[maxn], cos...
#include <bits/stdc++.h> using namespace std; using ll = long long; const int maxn = 1e5 + 5; string s; set<pair<int, int>> t; int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> s; int cnt = 0; for (int i = (int)s.size() - 1; i >= 0; i--) { if (s[i] == 0 ) cnt++;...
#include <bits/stdc++.h> using namespace std; const int NMAX = 50505; const int LMAX = 1600505; int N, A[NMAX]; vector<int> G[NMAX]; int currIdx; unordered_map<int, int> allValues; vector<int> newValues; int L[NMAX]; bool mark[NMAX]; vector<int> R; void read() { scanf( %d , &N); for (int...
#include <bits/stdc++.h> using namespace std; int main(void) { ios::sync_with_stdio(false); register int i; register priority_queue<int> Queue; register int N, T; cin >> N >> T; register int Ans; Ans = 0; for (i = 1; i <= N; i += 1) { while (!Queue.empty() && Queue.top() >= T -...
#include <bits/stdc++.h> using namespace std; double v[1000006], t[1000006]; int main() { int n, i; double a, d; scanf( %d , &n); scanf( %lf , &a); scanf( %lf , &d); for (i = 0; i < n; i++) { scanf( %lf , &t[i]); scanf( %lf , &v[i]); } double t0 = sqrt(2 * d / a); d...
#include <bits/stdc++.h> using namespace std; bool ch[30]; int whenlast[30]; char g[1000005]; int main() { int n, k; cin >> n >> k; for (int i = 0; i < n; i++) { scanf( %c , &g[i]); whenlast[g[i] - A ] = i; } int rlt = 0, ans = 0; for (int i = 0; i < n; i++) { ch[g[...
#include <bits/stdc++.h> long long R = 7 + 1e9, NUMTESTCASE; const int NN = 10 + 2e6; const double pi = acos(-1.0); int di[4] = {1, 0, -1, 0}, dj[4] = {0, 1, 0, -1}, DI[8] = {1, 1, 0, -1, -1, -1, 0, 1}, DJ[8] = {0, 1, 1, 1, 0, -1, -1, -1}; using namespace std; int n, ti = 1, timein[NN], timeout[NN], l...
#include <bits/stdc++.h> using namespace std; const int MAXN = 100005; int n, q; int f[MAXN]; long long t[MAXN]; set<pair<long long, int> > seta[MAXN]; unordered_map<int, long long> child_profit[MAXN]; long long child_sum[MAXN]; set<pair<long long, int> > global_seta_min, global_seta_max; long long ...
#include <bits/stdc++.h> using namespace std; long long a[501]; long long b[501]; long long dp[2][501][501]; int main() { int n, k, m = 1000000007, i, j, l; long long ans = 0; scanf( %d %d , &n, &k); a[0] = 1; for (i = 1; i <= 500; i++) a[i] = a[i - 1] * 2 % m; for (i = 1; i <= 500; i+...
#include <cmath> #include <algorithm> #include <iostream> #include <string> #include <vector> using namespace std; typedef long double ld; typedef vector<int> vi; typedef long long ll; constexpr ld EPS = numeric_limits<ld>::epsilon(); constexpr int INF = numeric_limits<int>::max() - 10; ...
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; int a[n], b[m]; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < m; i++) cin >> b[i]; int c[n]; for (int i = 0; i < n; i++) { int check = a[i]; int j = 0; for (; j < m; j++) ...
#include <bits/stdc++.h> using namespace std; const long long MOD = 1000000007; int dx[] = {1, 1, 0, -1, -1, -1, 0, 1}; int dy[] = {0, 1, 1, 1, 0, -1, -1, -1}; long long POW(long long x, long long y) { long long ans = 1; long long base = x; while (y) { if (y & 1) { ans *= base; ...
#include <bits/stdc++.h> using namespace std; const int inft = 1000000009; const int MAXN = 400005, MAXM = MAXN; int n; vector<int> adj[MAXN]; int edgx[MAXM]; int cc; int cycle[MAXM]; char used[MAXM]; int ep, sp, cur[MAXN], stackedge[MAXM]; void search(int v) { sp = 0; while (1) { wh...
#include <bits/stdc++.h> using namespace std; int main() { int b, w; cin >> w >> b; if (w == 0) cout << 0.000000000 << endl; else if (b == 0) cout << 1.000000000 << endl; else if (b == 1) printf( %.9f n , double(w) / (w + 1)); else if (b == 2) printf( %.9f n , dou...
#include <bits/stdc++.h> using namespace std; vector<int> s[100010]; bool flag[100010]; long double ans; void dfs(int now, int deep) { ans += 1.0 / (deep * 1.0); flag[now] = false; for (int i = 0; i < s[now].size(); i++) { int next = s[now][i]; if (flag[next]) dfs(next, deep + 1); ...
#include <bits/stdc++.h> using namespace std; long long int n, t, m; int vi[200010]; vector<int> v[200010]; map<int, int> mp; int main() { long long int a, b, c, r, l = 0, tt; cin >> r >> a >> b >> c; if ((b - c) <= a) { if (r >= b) { tt = (long long int)((double)(r - b) / (double)...
#include <bits/stdc++.h> using namespace std; int main() { cout << Karen ; return 0; }
#include <bits/stdc++.h> using namespace std; class UnionFind { private: public: vector<int> p, rank, setSize, minn; int numSets; UnionFind(int N) { setSize.assign(N, 1); numSets = N; rank.assign(N, 0); p.assign(N, 0); minn.resize(N); for (int i = 0; i < N; i++)...
#include <bits/stdc++.h> using namespace std; const int INF = 1 << 29; const double EPS = 1e-10; const double PI = 3.1415926535897932384626433832795; const int CLK = CLOCKS_PER_SEC; int calc(int s, int f, int t, int m) { if (s == f) return 0; s--; f--; t %= (2 * (m - 1)); int tos; in...
#include <bits/stdc++.h> const double pi = acos(-1.0); const int INF = 0x3f3f3f3f; const double eps = 1e-8; const int MAXN = 1e3 + 10; const int mod = 1e9 + 7; const int dir[][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}}; const int seed = 131; int cases = 0; char str[MAXN]; int mp[MAXN], col[MAXN], cnt[3...
#include <bits/stdc++.h> using namespace std; using namespace std::chrono; long long mod = 1000000007; const int MX = 0x3f3f3f3f; bool G[8][8]; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m; cin >> n >> m; if (n <= 6) { cout << m << endl; return ...
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10; int mod = 1e9 + 7; int a, b, c, d, n, m, x, y, z; vector<int> v; int arr[3]; int main() { cin >> a >> b >> c; for (int i = 0; i <= a; i++) { x = c - i; y = b - (a - i); if (x >= 0 && y >= 0 && x == y) { ...
#include <bits/stdc++.h> using namespace std; int a[100001]; int main() { int n, mini, temp; cin >> n; cin >> mini; int minindex = 0, maxindex = 0, flag = 1; for (int i = 1; i < n; i++) { cin >> temp; if (mini == temp) { maxindex = i; a[flag] = i; flag++; ...
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) #pragma GCC target( sse4 ) using namespace std; template <class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } template <class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } mt19937 rng(chrono::steady_clo...
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; const int inf = 1e9 + 7; int tem[N], va[N], ans; int num[N << 2], mx[N << 2], mi[N << 2]; void build(int t, int l, int r) { mx[t] = 0, mi[t] = inf; if (l == r) return; int mid = (l + r) >> 1; build(t << 1, l, mid); buil...
#include <bits/stdc++.h> using namespace std; inline char gc() { static char buf[100000], p1 = buf, p2 = buf; return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2) ? EOF : *p1++; } inline int read() { int x = 0; char ch = getchar(); boo...
#include <bits/stdc++.h> using namespace std; bool isValid(string s) { bool valid = true; if (s.length() < 1 \|\| s.length() > 16) return false; for (int i = 0; i < s.length(); i++) { if (s[i] < 48 \|\| (s[i] > 57 && s[i] < 65) \|\| (s[i] > 90 && s[i] < 95) \|\| (s[i] > 95 && s[i] < 97) \|\| s[i] ...
#include <bits/stdc++.h> using namespace std; const int N = 201000; int n, a[N], pos[N], l[N], r[N], C[N], idx[N], ans[N]; vector<int> nu[N]; void bitModify(int p) { for (int i = p; i > 0; i -= i & -i) C[i]++; } int bitQuery(int p) { int ret = 0; for (int i = p; i <= n; i += i & -i) ret += C[i...
#include <bits/stdc++.h> using namespace std; int main() { iostream::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long n, t; cin >> n >> t; vector<pair<long long, long long> > v(n); double den = 0; for (long long i = (0); i < (n); ++i) { cin >> v[i].second;...
#include <bits/stdc++.h> using namespace std; struct Rectangle { int l, d, r, u; }; const int maxn = 500000; int n; Rectangle rt[maxn]; int ans[maxn]; int main() { ios::sync_with_stdio(false); cin >> n; for (int i = 0; i < n; i++) cin >> rt[i].l >> rt[i].d >> rt[i].r >> rt[i].u; for ...
#include <bits/stdc++.h> using namespace std; void display(std::vector<int> v) { for (int i = 3; i >= 0; i--) { for (int j = 0; j < v[i]; j++) { if (i == 3) cout << 7; else if (i == 2) cout << 5; else if (i == 1) cout << 3; else if (i == 0) ...
#include <bits/stdc++.h> using namespace std; vector<long long> ans; int main() { long long n; cin >> n; for (long long i = 1; i <= sqrt(n); i++) if (n % i == 0) { ans.push_back((n + 2 - i) * n / i / 2); if (i * i != n) ans.push_back((i * n + 2 * i - n) / 2); } sort(ans...
#include <bits/stdc++.h> using namespace std; long long int dx[] = {0, 0, -1, 1, -1, -1, 1, 1}; long long int dy[] = {1, -1, 0, 0, 1, -1, -1, 1}; using namespace std; int main() { long long int n, p; cin >> n >> p; vector<bool> box(n, 0); vector<pair<long long int, long long int>> ppl(p); ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, m; cin >> n >> m; vector<vector<int>> grid(n, vector<int>(m, 0)); vector<vector<int>> up(n, vector<int>(m, 0)); vector<vector<int>> down(n, vector<int>(m, 0));...
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); set<pair<int, int> > st; for (int i = 0; i < n; ++i) { int x; scanf( %d , &x); st.insert({x, i}); } int x = -1; vector<int> ans; while (x >= -1) { auto it = st.lower_bound({x + ...
#include <bits/stdc++.h> using namespace std; const double EPS = 1e-06; const int MAXN = 25; pair<int, int> r, r2, bk, wk; int dx[] = {1, -1, 0, 0, 1, 1, -1, -1}; int dy[] = {0, 0, 1, -1, -1, 1, 1, -1}; char board[10][10]; bool valid(int x, int y) { return x >= 0 && y >= 0 && x < 8 && y < 8; } bool ok...
#include <bits/stdc++.h> using namespace std; bool a[300001]; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int i, n, tmp, ans = 1, last; cin >> n; last = n; cout << 1 << ; for (i = 0; i < n; i++) { cin >> tmp; a[tmp] = 1; ans++; whil...
#include <bits/stdc++.h> using namespace std; const int MAX_N = 20; int c[MAX_N], d[MAX_N], num[MAX_N]; int dp[MAX_N][MAX_N * 100]; int n, m, c0, d0, a, b; int main() { while (scanf( %d%d%d%d , &n, &m, &c0, &d0) != EOF) { for (int i = 1; i <= m; i++) { scanf( %d%d , &a, &b); num[i]...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int hops[n + 1]; bool vis[n + 1]; int change[n + 1]; for (int i = 1; i <= n; ++i) { cin >> hops[i]; vis[i] = 0; } int cnt = 0; int cnt1 = 0; for (int i = 1; i <= n; ++i) { cin >> cha...
#include <bits/stdc++.h> using namespace std; int N, K; long long A[100100], sol; map<long long, long long> M; long long __grundy(long long n) { if (n == 0) return 0; if (((M).find(n) != (M).end())) return M[n]; long long r = __grundy(n - 1); if (n % 2 != 0) return M[n] = ((r == 0) ? 1 : 0); ...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<long long int> s(n); for (int i = 0; i < n; ++i) cin >> s[i]; int q; cin >> q; sort(s.begin(), s.end()); int slope0 = 1; for (int i = 1; i < n; ++i) if (s[i] != s[i - 1]) ++slope0; map<lo...
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const long long linf = 0x3f3f3f3f3f3f3f3f; const int maxn = 2e5 + 11; const int maxm = 600 + 11; const int mod = 1e9 + 7; const double eps = 1e-5; inline long long rd() { long long x = 0, f = 1; char ch = getchar(); wh...
#include <bits/stdc++.h> using namespace std; int main() { double R, r, k; int tt; scanf( %d , &tt); while (tt--) { scanf( %lf%lf%lf , &R, &r, &k); double a = (R + r) / (4 * R * r), b = k * (R - r) / (2 * R * r); double t = (R - r) / (4 * R * r); double s = t / (a * a + b * b...
#include <bits/stdc++.h> using namespace std; const int maxn = 200007; string s; int fa[maxn << 1]; map<string, int> aa; int find(int x) { return fa[x] == x ? x : fa[x] = find(fa[x]); } string read() { cin >> s; return s; } int main() { int n, m, q; scanf( %d%d%d , &n, &m, &q); for...
#include <bits/stdc++.h> using namespace std; map<string, string> p; map<string, string>::iterator it = p.begin(); int main() { int q; cin >> q; while (q--) { string s1, s2; cin >> s1 >> s2; if (!p.count(s1)) p[s2] = s1; else { p[s2] = p[s1]; p.erase(s...
#include <bits/stdc++.h> using namespace std; const int N = 1e5; const long long INF = 1e18; inline int abs(int x) { return x > 0 ? x : -x; } inline long long sqr(long long x) { return x * x; } bool cmp(pair<int, int>& x, pair<int, int>& y) { return x.first < y.first; } int n; pair<int, int> p[N]; lon...
#include <bits/stdc++.h> using namespace std; int main() { int i, n; long long k, time, maks, tot, ar[10005], ans, temp, m; bool cek; scanf( %d %I64d %I64d , &n, &m, &k); for (i = 0; i < n; ++i) scanf( %I64d , &ar[i]); if ((n % 2) == 0) printf( 0 n ); else { ans = 0; ti...
#include <bits/stdc++.h> using namespace std; string str; vector<int> graph[26], rgraph[26]; bool visited[26]; bool present[26]; void dfs(int i) { visited[i] = true; if (graph[i].size() >= 1 && !visited[graph[i][0]]) dfs(graph[i][0]); str.insert(str.begin(), (char)( a + i)); } void rdfs(int...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; int n[t], sum = 0; for (int i = 0; i < t; i++) { cin >> n[i]; } for (int i = 0; i < t; i++) { if (n[i] % 2 == 0) { sum = (n[i] / 2) - 1; } else { sum = n[i] / 2; } cout <...
#include <bits/stdc++.h> namespace mem { namespace stdval { using i32 = int; using i64 = long long int; using u32 = unsigned int; using u64 = unsigned long long int; using f32 = float; using f64 = double; using f96 = long double; using i128 = __int128_t; using u128 = __uint128_t; } // namespace...
#include <bits/stdc++.h> using namespace std; const int maxn = 3e5 + 5; const int inf = 0x3f3f3f3f; const int mod = 1e9 + 7; char s[maxn]; int ans[maxn]; void solve() { int n, k; scanf( %d%d , &n, &k); scanf( %s , s + 1); memset(ans, -1, sizeof(ans)); for (int i = 1; i <= n; i++) { ...
#include <bits/stdc++.h> using namespace std; int main() { long long int i, j, k, t, n; cin >> t; while (t--) { cin >> i >> j >> k; i = i + j + k; cout << i / 2 << endl; } }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n; cin >> n; int s[n]; int m[n]; string st; cin >> st; for (int i = 0; i < n; i++) s[i] = st[i] - 0 ; cin >> st; for (int i = 0; i < n; i++) m[i] = st[i] - 0 ; ...
#include <bits/stdc++.h> using namespace std; long long mpow(long long a, long long b) { if (b == 1) return a; if (b == 0) return 1; return mpow(a, b - 1); } int main() { long long n; cin >> n; cout << (n / 2520); }
#include <bits/stdc++.h> using namespace std; long long read() { long long x = 0, f = 1; char ch = getchar(); while (ch < 0 \|\| ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = 10 * x + ch - 0 ; ch = getchar(); } return x...
#include <bits/stdc++.h> using namespace std; int dx[10] = {1, -1, 0, 0}; int dy[10] = {0, 0, 1, -1}; const long long mod = 1e9 + 7; long long cur; long long tich = 1; vector<int> G[300005]; int n, h, m; int a[105][105]; int b[105][105]; int ans; int main() { cin >> n >> m; for (int i = ...
#include <bits/stdc++.h> using namespace std; const int INF = 0x3fffffff; const int SINF = 0x7fffffff; const long long LINF = 0x3fffffffffffffff; const long long SLINF = 0x7fffffffffffffff; const int MAXN = 300007; const int MAX = 130; int n; int a[MAXN]; int ps[MAXN]; int pc[MAXN][2]; void init...
#include <bits/stdc++.h> using namespace std; const int maxn = 5e5 + 10; struct edge { int v, nxt; } e[maxn << 1]; int head[maxn], ecnt = 0; void add(int u, int v) { e[++ecnt] = (edge){v, head[u]}, head[u] = ecnt; } vector<int> p[maxn]; int pos[maxn]; int tree[maxn]; void update(int x, int v) { ...
#include <bits/stdc++.h> using namespace std; void update(int* Bit, int index) { for (; index <= 100000; index += (index & (-index))) { Bit[index] += 1; } } int query(int* Bit, int index) { int sum = 0; for (; index > 0; index -= (index & -index)) sum += Bit[index]; return sum; } i...
#include <bits/stdc++.h> using namespace std; int main() { int a[1000]; int n, k; scanf( %d , &n); scanf( %d , &k); for (int i = 0; i < 2 * n + 1; i++) { scanf( %d , &a[i]); } for (int i = 1; i < 2 * n + 1; i += 2) { if (a[i] - 1 > a[i + 1] && a[i] - 1 > a[i - 1]) { a...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; int a[N]; int main() { int i, j, k = 0, n; cin >> n; long long s = 0, t; for (i = 1; i <= n; i++) { cin >> a[i]; s += a[i]; } if (s % 2 == 1) { cout << 0 n ; return 0; } t = 0; for (...
#include <bits/stdc++.h> using namespace std; const int MAXN = 257, MOD = 1e9 + 7; int pk[MAXN * MAXN], pk1[MAXN * MAXN], n, k, f[MAXN][MAXN], C[MAXN][MAXN]; int mul(int a, int b) { return 1LL * a * b % MOD; } void add(int &a, const int &b) { a += b; if (a >= MOD) a -= MOD; } void sub(int &a, cons...
#include <bits/stdc++.h> using namespace std; const long long int N = 1e5 + 100, M = 1e14 + 10; long long int n, k, l, r, mid, x, y, f[N], p[N], a[N]; vector<long long int> v; void add(long long int v, long long int c) { if (v == 0) return; for (; v < N; v += v & -v) f[v] += c; } long long int get...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); ; string s; getline(cin, s); set<char> st; for (int i = 0; i < s.length(); i++) { if (s[i] == { \|\| s[i] == } \|\| s[i] == , \|\| s[i] == ) { continue; } el...
#include <bits/stdc++.h> using namespace std; int n, m, k; int per; int main() { cin >> n >> m >> k; per = 2; int flag = 0; int sum = 0; int ff = 0; int a = 1; for (int i = 1; i <= n; ++i) { if (!flag) { for (int j = 1; j <= m; ++j) { if (sum % 2 == 0 && a == ...
#include <bits/stdc++.h> using namespace std; const long long md = 1e9 + 7; long long ans = 0; long long st[1000000 + 5]; long long dp[1000000 + 5]; vector<long long> d[1000000 + 5]; long long n; int32_t main() { ios_base::sync_with_stdio(false); cin >> n; for (long long i = 0; i < n - 1; i+...
#include <bits/stdc++.h> using namespace std; inline long long read() { long long x = 0, f = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) f = -1; ch = getchar(); } while (isdigit(ch)) { x = (x << 1) + (x << 3) + ch - 0 ; ch = getchar(); } return ...
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, n; cin >> n >> a >> b >> c; int count = 0; for (int i = 0; i <= b; i++) { for (int j = 0; j <= c; j++) { int num = n - i - 2 * j; if (num >= 0 && 2 * num <= a) count++; } } cout << count << en...
#include <bits/stdc++.h> using namespace std; const long long maxN = 2e5 + 7; const long long segN = 8e5 + 7; const long long moD = 1e9 + 7; struct query { long long t, x, y; }; long long n; long long st[maxN], fi[maxN], sum[segN], deg[maxN], mul[segN], laz[segN], val[maxN]; vector<long long...
#include <bits/stdc++.h> using namespace std; int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int tc; cin >> tc; while (tc--) { int n; cin >> n; string s, t; cin >> s >> t; vector<int> v, c; for (int i = 1; i < n; i++) { if (s[i]...
#include <bits/stdc++.h> using namespace std; const int LIM = 5e+5 + 10; int sz[LIM]; int main() { ios_base::sync_with_stdio(false); int n; cin >> n; for (int i = 0; i < n; ++i) cin >> sz[i]; sort(sz, sz + n); int pairs = 0; int l = 0; int lb = n / 2 + (n % 2); int r = lb; ...
#include <bits/stdc++.h> using namespace std; template <typename T1, typename T2> istream &operator>>(istream &in, pair<T1, T2> &p) { in >> p.first >> p.second; return in; } template <typename T> istream &operator>>(istream &in, vector<T> &v) { for (auto &x : v) in >> x; return in; } tem...
#include <bits/stdc++.h> using namespace std; int main() { int a1, a2, k1, k2; int n; cin >> a1 >> a2 >> k1 >> k2 >> n; int n1 = n, n2 = n; n1 -= (a1 * (k1 - 1)); n1 -= (a2 * (k2 - 1)); if (n1 <= 0) cout << 0 << ; else cout << n1 << ; if (k1 > k2) { if (n2...
#include<iostream> #include<bits/stdc++.h> using namespace std; #define ll long long #define pb push_back #define mp make_pair #define ff first #define ss second #define MOD 1000000007 // void func(){ // } void solution(){ ll a,b; cin>>a>>b; ll val = abs(a-b); if(val==0)...
#include <bits/stdc++.h> using namespace std; const int nm = 100010; int n, k; long long x[nm], y[nm]; set<pair<long long, int> > ngang, doc; vector<int> xoa1, xoa2, xoa3, xoa4; int main() { scanf( %d%d , &n, &k); for (int i = 1; i <= n; ++i) { int a, b, c, d; scanf( %d%d%d%d , &a, &b,...
#include <bits/stdc++.h> using namespace std; int used[111111]; multiset<int> g[111111]; multiset<int> vertex; vector<int> ans; void dfs(int v) { used[v] = 1; vertex.erase(v); ans.push_back(v); for (auto i = g[v].begin(); i != g[v].end(); ++i) if (!used[i]) vertex.insert(i); if (...
#include <bits/stdc++.h> using namespace std; int main() { int n, t; cin >> n >> t; if (t == 10) { if (n == 1) { cout << -1 ; } else { for (int i = 0; i < n - 1; i++) { cout << 1 ; } cout << 0 ; } } else { for (int i = 0; i < n; i+...
#include <bits/stdc++.h> using namespace std; const int N = 200005; char a[N], b[N]; string arrange(string s) { int n = s.size(); if (n & 1) return s; else { int m = n / 2; string s1 = s.substr(0, m), s2 = s.substr(m, m); s1 = arrange(s1); s2 = arrange(s2); if (s1...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:16777216 ) using namespace std; int a[2 * 100010] = {0}; int check(int x, int n) { if (x == 1) return 0; int cur = 0, ans = 0; while (cur < a[n - 1]) { cur += x; int pos = lower_bound(a, a + n, cur) - a; if (pos > 0 && a[pos ...
#include <bits/stdc++.h> using namespace std; const int INF = 0x7f7f7f7f; int BigMod(long long int B, long long int P, long long int M) { long long int R = 1; while (P > 0) { if (P % 2 == 1) R = (R * B) % M; P /= 2; B = (B * B) % M; } return (int)R; } long long int maxDivide(...
#include <bits/stdc++.h> using namespace std; int main() { int h1, m1, h2, m2, s1, s2, h, m; scanf( %d:%d , &h1, &m1); scanf( %d:%d , &h2, &m2); s1 = h1 * 60 + m1; s2 = h2 * 60 + m2; m = (s1 + s2) / 2; h = m / 60; m = m % 60; printf( %02d:%02d n , h, m); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { { int s, v1, v2, t1, t2; cin >> s >> v1 >> v2 >> t1 >> t2; int time1, time2; time1 = (s * v1) + (2 * t1); time2 = (s * v2) + (2 * t2); if (time1 < time2) cout << First << endl; else if (time2 < time1) ...
#include <bits/stdc++.h> using namespace std; const long long inf = 1e18; const int N = 1e6 + 20; vector<int> v[N]; map<int, int> mp, ml, mr; long long n, m, k, a[N], b[N], f[N]; int num[N]; long long did[N]; string s; long long s1, s2, ans, flag, tot, t, sum; int cnt; int main() { ios::sync...
#include <bits/stdc++.h> using namespace std; long long n, m, q, t, x, y, b, c, d; string s1, s2; long long a[3]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; for (int i = 0; i < n; i++) { cin >> s1 >> s2; int l1 = s1.length(); int l2 = s2.length(); ...

#include <bits/stdc++.h> using namespace ::std; int main() { int n, m; cin >> n; int ara[2 * n + 7]; for (int i = 0; i < 2 * n; i++) { cin >> ara[i]; } sort(ara, ara + (2 * n)); if (ara[n - 1] == ara[n]) { cout << NO ; } else { cout << YES ; } }

#include <bits/stdc++.h> using namespace std; const int maxn = 200005; inline int gi() { char c = getchar(); while (c < 0 || c > 9 ) c = getchar(); int sum = 0; while ( 0 <= c && c <= 9 ) sum = sum * 10 + c - 48, c = getchar(); return sum; } int n, m, q, A[maxn], B[maxn]; vector<pai...

#include <bits/stdc++.h> using namespace std; int n, m, ans, sx, sy, ex, ey, endx = -1, endy = -1; char s[1005][1006]; pair<int, int> xx[1005]; pair<int, int> yy[1005]; bool able(int x, int y) { int nx = sx, ny = sy; while (true) { int nex = nx + x + 1, ney = ny + y + 1; if (nex > endx &...

#include <bits/stdc++.h> using namespace std; const int maxn = 502; int n, k; int a[maxn], b[maxn], c[maxn]; bool check(int l, int r) { if (l == r) return true; for (int i = l + 1; i <= r; ++i) if (a[i] != a[l]) return true; return false; } bool print(int p, int r, int dir) { printf(...

#include <bits/stdc++.h> using namespace std; int M[16]; int R[16]; int N; int main() { cin >> N; for (int i = 0; i < N; i++) { cin >> M[i]; } for (int i = 0; i < N; i++) { cin >> R[i]; } int ans = 0; for (int i = 0; i < 720720; i++) { bool checker = false; ...

#include <bits/stdc++.h> using namespace std; vector<long long> v; long long a, b; int main() { ios_base::sync_with_stdio(0); cin >> a >> b; while (true) { v.push_back(b); if (b % 10 == 1) { b--; b /= 10; } else if (b % 2 == 0) { b /= 2; } else { ...

#include <bits/stdc++.h> using namespace std; int main() { int n, l; cin >> n >> l; vector<int> v = vector<int>(n); for (int i = 0; i < n; i++) cin >> v[i]; sort(v.begin(), v.end()); int vals = 1; int prev = v[0]; vector<pair<int, int>> vp; vp.push_back(make_pair(prev, 1)); f...

#include <bits/stdc++.h> using namespace std; const long long inf = 1e15; const int N = 2e5 + 10; int I[N], st[N], fn[N], par[N], h[N], sz[N], big[N], hd[N], n, m, q, timer; long long w[N]; vector<int> g[N], V[N]; struct Node { pair<long long, long long> Mn; long long Lazy = 0; } seg[N << 2]; ...

#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; set<int> a, b; set<int> pre; char str[10]; int main() { int n; cin >> n; long long ans = 1; a.insert(0); b.insert(1e9 + 5); for (int i = 0; i < n; ++i) { int x; scanf( %s%d , str, &x); if (str[1]...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int prev = 0; int ans = 0; for (int i = 1; i <= n; i++) { ans += (n - i) * (i - 1) + i; prev = i; } cout << ans; }

#include <bits/stdc++.h> using namespace std; const int fx[] = {+0, +0, +1, -1, -1, +1, -1, +1}; const int fy[] = {-1, +1, +0, +0, +1, +1, -1, -1}; long long dp[1005][1005][2]; string s; int k; int ar[1026]; long long Dance_of_Death(int x, int rem, int f) { if (x == s.size()) { if (ar[rem] + 1...

#include <bits/stdc++.h> using namespace std; const int maxn = 3005; const int maxm = maxn * maxn << 1; int n, m, q; int id[maxn][maxn << 1]; int fa[maxm]; int vis[maxm]; int top = 0; stack<pair<int, int> > sta; inline int getfa(int x) { sta.push(make_pair(x, fa[x])); return fa[x] == x ? x :...

#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( Ofast,unroll-loops ) #pragma GCC target( avx,avx2,sse,sse2 ) 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 ...

#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); } long long Max(long long a, long long b) { return a > b ? a : b; } long long Min(long long a, long long b) { retur...

#include <bits/stdc++.h> using namespace std; unsigned long long n, k, c, a, b, d; multiset<unsigned long long> vn; multiset<unsigned long long> vk; unsigned long long mod = 1e9 + 7; unsigned long long sum = 0; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; cin >...

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

#include <bits/stdc++.h> using namespace std; const int maxn = 1000 + 10; long long par[maxn], t[maxn], c[maxn]; const long long inf = 1000000000000ll; long long dist[maxn][maxn], dis[maxn]; bool mark[maxn]; vector<int> v[maxn], u[maxn]; set<pair<long long, int> > s; vector<long long> cost1[maxn], cos...

#include <bits/stdc++.h> using namespace std; using ll = long long; const int maxn = 1e5 + 5; string s; set<pair<int, int>> t; int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> s; int cnt = 0; for (int i = (int)s.size() - 1; i >= 0; i--) { if (s[i] == 0 ) cnt++;...

#include <bits/stdc++.h> using namespace std; const int NMAX = 50505; const int LMAX = 1600505; int N, A[NMAX]; vector<int> G[NMAX]; int currIdx; unordered_map<int, int> allValues; vector<int> newValues; int L[NMAX]; bool mark[NMAX]; vector<int> R; void read() { scanf( %d , &N); for (int...

#include <bits/stdc++.h> using namespace std; int main(void) { ios::sync_with_stdio(false); register int i; register priority_queue<int> Queue; register int N, T; cin >> N >> T; register int Ans; Ans = 0; for (i = 1; i <= N; i += 1) { while (!Queue.empty() && Queue.top() >= T -...

#include <bits/stdc++.h> using namespace std; double v[1000006], t[1000006]; int main() { int n, i; double a, d; scanf( %d , &n); scanf( %lf , &a); scanf( %lf , &d); for (i = 0; i < n; i++) { scanf( %lf , &t[i]); scanf( %lf , &v[i]); } double t0 = sqrt(2 * d / a); d...

#include <bits/stdc++.h> using namespace std; bool ch[30]; int whenlast[30]; char g[1000005]; int main() { int n, k; cin >> n >> k; for (int i = 0; i < n; i++) { scanf( %c , &g[i]); whenlast[g[i] - A ] = i; } int rlt = 0, ans = 0; for (int i = 0; i < n; i++) { ch[g[...

#include <bits/stdc++.h> long long R = 7 + 1e9, NUMTESTCASE; const int NN = 10 + 2e6; const double pi = acos(-1.0); int di[4] = {1, 0, -1, 0}, dj[4] = {0, 1, 0, -1}, DI[8] = {1, 1, 0, -1, -1, -1, 0, 1}, DJ[8] = {0, 1, 1, 1, 0, -1, -1, -1}; using namespace std; int n, ti = 1, timein[NN], timeout[NN], l...

#include <bits/stdc++.h> using namespace std; const int MAXN = 100005; int n, q; int f[MAXN]; long long t[MAXN]; set<pair<long long, int> > seta[MAXN]; unordered_map<int, long long> child_profit[MAXN]; long long child_sum[MAXN]; set<pair<long long, int> > global_seta_min, global_seta_max; long long ...

#include <bits/stdc++.h> using namespace std; long long a[501]; long long b[501]; long long dp[2][501][501]; int main() { int n, k, m = 1000000007, i, j, l; long long ans = 0; scanf( %d %d , &n, &k); a[0] = 1; for (i = 1; i <= 500; i++) a[i] = a[i - 1] * 2 % m; for (i = 1; i <= 500; i+...

#include <cmath> #include <algorithm> #include <iostream> #include <string> #include <vector> using namespace std; typedef long double ld; typedef vector<int> vi; typedef long long ll; constexpr ld EPS = numeric_limits<ld>::epsilon(); constexpr int INF = numeric_limits<int>::max() - 10; ...

#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; int a[n], b[m]; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < m; i++) cin >> b[i]; int c[n]; for (int i = 0; i < n; i++) { int check = a[i]; int j = 0; for (; j < m; j++) ...

#include <bits/stdc++.h> using namespace std; const long long MOD = 1000000007; int dx[] = {1, 1, 0, -1, -1, -1, 0, 1}; int dy[] = {0, 1, 1, 1, 0, -1, -1, -1}; long long POW(long long x, long long y) { long long ans = 1; long long base = x; while (y) { if (y & 1) { ans *= base; ...

#include <bits/stdc++.h> using namespace std; const int inft = 1000000009; const int MAXN = 400005, MAXM = MAXN; int n; vector<int> adj[MAXN]; int edgx[MAXM]; int cc; int cycle[MAXM]; char used[MAXM]; int ep, sp, cur[MAXN], stackedge[MAXM]; void search(int v) { sp = 0; while (1) { wh...

#include <bits/stdc++.h> using namespace std; int main() { int b, w; cin >> w >> b; if (w == 0) cout << 0.000000000 << endl; else if (b == 0) cout << 1.000000000 << endl; else if (b == 1) printf( %.9f n , double(w) / (w + 1)); else if (b == 2) printf( %.9f n , dou...

#include <bits/stdc++.h> using namespace std; vector<int> s[100010]; bool flag[100010]; long double ans; void dfs(int now, int deep) { ans += 1.0 / (deep * 1.0); flag[now] = false; for (int i = 0; i < s[now].size(); i++) { int next = s[now][i]; if (flag[next]) dfs(next, deep + 1); ...

#include <bits/stdc++.h> using namespace std; long long int n, t, m; int vi[200010]; vector<int> v[200010]; map<int, int> mp; int main() { long long int a, b, c, r, l = 0, tt; cin >> r >> a >> b >> c; if ((b - c) <= a) { if (r >= b) { tt = (long long int)((double)(r - b) / (double)...

#include <bits/stdc++.h> using namespace std; int main() { cout << Karen ; return 0; }

#include <bits/stdc++.h> using namespace std; class UnionFind { private: public: vector<int> p, rank, setSize, minn; int numSets; UnionFind(int N) { setSize.assign(N, 1); numSets = N; rank.assign(N, 0); p.assign(N, 0); minn.resize(N); for (int i = 0; i < N; i++)...

#include <bits/stdc++.h> using namespace std; const int INF = 1 << 29; const double EPS = 1e-10; const double PI = 3.1415926535897932384626433832795; const int CLK = CLOCKS_PER_SEC; int calc(int s, int f, int t, int m) { if (s == f) return 0; s--; f--; t %= (2 * (m - 1)); int tos; in...

#include <bits/stdc++.h> const double pi = acos(-1.0); const int INF = 0x3f3f3f3f; const double eps = 1e-8; const int MAXN = 1e3 + 10; const int mod = 1e9 + 7; const int dir[][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}}; const int seed = 131; int cases = 0; char str[MAXN]; int mp[MAXN], col[MAXN], cnt[3...

#include <bits/stdc++.h> using namespace std; using namespace std::chrono; long long mod = 1000000007; const int MX = 0x3f3f3f3f; bool G[8][8]; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m; cin >> n >> m; if (n <= 6) { cout << m << endl; return ...

#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10; int mod = 1e9 + 7; int a, b, c, d, n, m, x, y, z; vector<int> v; int arr[3]; int main() { cin >> a >> b >> c; for (int i = 0; i <= a; i++) { x = c - i; y = b - (a - i); if (x >= 0 && y >= 0 && x == y) { ...

#include <bits/stdc++.h> using namespace std; int a[100001]; int main() { int n, mini, temp; cin >> n; cin >> mini; int minindex = 0, maxindex = 0, flag = 1; for (int i = 1; i < n; i++) { cin >> temp; if (mini == temp) { maxindex = i; a[flag] = i; flag++; ...

#include <bits/stdc++.h> #pragma GCC optimize( O3 ) #pragma GCC target( sse4 ) using namespace std; template <class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } template <class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } mt19937 rng(chrono::steady_clo...

#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; const int inf = 1e9 + 7; int tem[N], va[N], ans; int num[N << 2], mx[N << 2], mi[N << 2]; void build(int t, int l, int r) { mx[t] = 0, mi[t] = inf; if (l == r) return; int mid = (l + r) >> 1; build(t << 1, l, mid); buil...

#include <bits/stdc++.h> using namespace std; inline char gc() { static char buf[100000], *p1 = buf, *p2 = buf; return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2) ? EOF : *p1++; } inline int read() { int x = 0; char ch = getchar(); boo...

#include <bits/stdc++.h> using namespace std; bool isValid(string s) { bool valid = true; if (s.length() < 1 || s.length() > 16) return false; for (int i = 0; i < s.length(); i++) { if (s[i] < 48 || (s[i] > 57 && s[i] < 65) || (s[i] > 90 && s[i] < 95) || (s[i] > 95 && s[i] < 97) || s[i] ...

#include <bits/stdc++.h> using namespace std; const int N = 201000; int n, a[N], pos[N], l[N], r[N], C[N], idx[N], ans[N]; vector<int> nu[N]; void bitModify(int p) { for (int i = p; i > 0; i -= i & -i) C[i]++; } int bitQuery(int p) { int ret = 0; for (int i = p; i <= n; i += i & -i) ret += C[i...

#include <bits/stdc++.h> using namespace std; int main() { iostream::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long n, t; cin >> n >> t; vector<pair<long long, long long> > v(n); double den = 0; for (long long i = (0); i < (n); ++i) { cin >> v[i].second;...

#include <bits/stdc++.h> using namespace std; struct Rectangle { int l, d, r, u; }; const int maxn = 500000; int n; Rectangle rt[maxn]; int ans[maxn]; int main() { ios::sync_with_stdio(false); cin >> n; for (int i = 0; i < n; i++) cin >> rt[i].l >> rt[i].d >> rt[i].r >> rt[i].u; for ...

#include <bits/stdc++.h> using namespace std; void display(std::vector<int> v) { for (int i = 3; i >= 0; i--) { for (int j = 0; j < v[i]; j++) { if (i == 3) cout << 7; else if (i == 2) cout << 5; else if (i == 1) cout << 3; else if (i == 0) ...

#include <bits/stdc++.h> using namespace std; vector<long long> ans; int main() { long long n; cin >> n; for (long long i = 1; i <= sqrt(n); i++) if (n % i == 0) { ans.push_back((n + 2 - i) * n / i / 2); if (i * i != n) ans.push_back((i * n + 2 * i - n) / 2); } sort(ans...

#include <bits/stdc++.h> using namespace std; long long int dx[] = {0, 0, -1, 1, -1, -1, 1, 1}; long long int dy[] = {1, -1, 0, 0, 1, -1, -1, 1}; using namespace std; int main() { long long int n, p; cin >> n >> p; vector<bool> box(n, 0); vector<pair<long long int, long long int>> ppl(p); ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, m; cin >> n >> m; vector<vector<int>> grid(n, vector<int>(m, 0)); vector<vector<int>> up(n, vector<int>(m, 0)); vector<vector<int>> down(n, vector<int>(m, 0));...

#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); set<pair<int, int> > st; for (int i = 0; i < n; ++i) { int x; scanf( %d , &x); st.insert({x, i}); } int x = -1; vector<int> ans; while (x >= -1) { auto it = st.lower_bound({x + ...

#include <bits/stdc++.h> using namespace std; const double EPS = 1e-06; const int MAXN = 25; pair<int, int> r, r2, bk, wk; int dx[] = {1, -1, 0, 0, 1, 1, -1, -1}; int dy[] = {0, 0, 1, -1, -1, 1, 1, -1}; char board[10][10]; bool valid(int x, int y) { return x >= 0 && y >= 0 && x < 8 && y < 8; } bool ok...

#include <bits/stdc++.h> using namespace std; bool a[300001]; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int i, n, tmp, ans = 1, last; cin >> n; last = n; cout << 1 << ; for (i = 0; i < n; i++) { cin >> tmp; a[tmp] = 1; ans++; whil...

#include <bits/stdc++.h> using namespace std; const int MAX_N = 20; int c[MAX_N], d[MAX_N], num[MAX_N]; int dp[MAX_N][MAX_N * 100]; int n, m, c0, d0, a, b; int main() { while (scanf( %d%d%d%d , &n, &m, &c0, &d0) != EOF) { for (int i = 1; i <= m; i++) { scanf( %d%d , &a, &b); num[i]...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int hops[n + 1]; bool vis[n + 1]; int change[n + 1]; for (int i = 1; i <= n; ++i) { cin >> hops[i]; vis[i] = 0; } int cnt = 0; int cnt1 = 0; for (int i = 1; i <= n; ++i) { cin >> cha...

#include <bits/stdc++.h> using namespace std; int N, K; long long A[100100], sol; map<long long, long long> M; long long __grundy(long long n) { if (n == 0) return 0; if (((M).find(n) != (M).end())) return M[n]; long long r = __grundy(n - 1); if (n % 2 != 0) return M[n] = ((r == 0) ? 1 : 0); ...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<long long int> s(n); for (int i = 0; i < n; ++i) cin >> s[i]; int q; cin >> q; sort(s.begin(), s.end()); int slope0 = 1; for (int i = 1; i < n; ++i) if (s[i] != s[i - 1]) ++slope0; map<lo...

#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const long long linf = 0x3f3f3f3f3f3f3f3f; const int maxn = 2e5 + 11; const int maxm = 600 + 11; const int mod = 1e9 + 7; const double eps = 1e-5; inline long long rd() { long long x = 0, f = 1; char ch = getchar(); wh...

#include <bits/stdc++.h> using namespace std; int main() { double R, r, k; int tt; scanf( %d , &tt); while (tt--) { scanf( %lf%lf%lf , &R, &r, &k); double a = (R + r) / (4 * R * r), b = k * (R - r) / (2 * R * r); double t = (R - r) / (4 * R * r); double s = t / (a * a + b * b...

#include <bits/stdc++.h> using namespace std; const int maxn = 200007; string s; int fa[maxn << 1]; map<string, int> aa; int find(int x) { return fa[x] == x ? x : fa[x] = find(fa[x]); } string read() { cin >> s; return s; } int main() { int n, m, q; scanf( %d%d%d , &n, &m, &q); for...

#include <bits/stdc++.h> using namespace std; map<string, string> p; map<string, string>::iterator it = p.begin(); int main() { int q; cin >> q; while (q--) { string s1, s2; cin >> s1 >> s2; if (!p.count(s1)) p[s2] = s1; else { p[s2] = p[s1]; p.erase(s...

#include <bits/stdc++.h> using namespace std; const int N = 1e5; const long long INF = 1e18; inline int abs(int x) { return x > 0 ? x : -x; } inline long long sqr(long long x) { return x * x; } bool cmp(pair<int, int>& x, pair<int, int>& y) { return x.first < y.first; } int n; pair<int, int> p[N]; lon...

#include <bits/stdc++.h> using namespace std; int main() { int i, n; long long k, time, maks, tot, ar[10005], ans, temp, m; bool cek; scanf( %d %I64d %I64d , &n, &m, &k); for (i = 0; i < n; ++i) scanf( %I64d , &ar[i]); if ((n % 2) == 0) printf( 0 n ); else { ans = 0; ti...

#include <bits/stdc++.h> using namespace std; string str; vector<int> graph[26], rgraph[26]; bool visited[26]; bool present[26]; void dfs(int i) { visited[i] = true; if (graph[i].size() >= 1 && !visited[graph[i][0]]) dfs(graph[i][0]); str.insert(str.begin(), (char)( a + i)); } void rdfs(int...

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

#include <bits/stdc++.h> namespace mem { namespace stdval { using i32 = int; using i64 = long long int; using u32 = unsigned int; using u64 = unsigned long long int; using f32 = float; using f64 = double; using f96 = long double; using i128 = __int128_t; using u128 = __uint128_t; } // namespace...

#include <bits/stdc++.h> using namespace std; const int maxn = 3e5 + 5; const int inf = 0x3f3f3f3f; const int mod = 1e9 + 7; char s[maxn]; int ans[maxn]; void solve() { int n, k; scanf( %d%d , &n, &k); scanf( %s , s + 1); memset(ans, -1, sizeof(ans)); for (int i = 1; i <= n; i++) { ...

#include <bits/stdc++.h> using namespace std; int main() { long long int i, j, k, t, n; cin >> t; while (t--) { cin >> i >> j >> k; i = i + j + k; cout << i / 2 << endl; } }

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n; cin >> n; int s[n]; int m[n]; string st; cin >> st; for (int i = 0; i < n; i++) s[i] = st[i] - 0 ; cin >> st; for (int i = 0; i < n; i++) m[i] = st[i] - 0 ; ...

#include <bits/stdc++.h> using namespace std; long long mpow(long long a, long long b) { if (b == 1) return a; if (b == 0) return 1; return mpow(a, b - 1); } int main() { long long n; cin >> n; cout << (n / 2520); }

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

#include <bits/stdc++.h> using namespace std; int dx[10] = {1, -1, 0, 0}; int dy[10] = {0, 0, 1, -1}; const long long mod = 1e9 + 7; long long cur; long long tich = 1; vector<int> G[300005]; int n, h, m; int a[105][105]; int b[105][105]; int ans; int main() { cin >> n >> m; for (int i = ...

#include <bits/stdc++.h> using namespace std; const int INF = 0x3fffffff; const int SINF = 0x7fffffff; const long long LINF = 0x3fffffffffffffff; const long long SLINF = 0x7fffffffffffffff; const int MAXN = 300007; const int MAX = 130; int n; int a[MAXN]; int ps[MAXN]; int pc[MAXN][2]; void init...

#include <bits/stdc++.h> using namespace std; const int maxn = 5e5 + 10; struct edge { int v, nxt; } e[maxn << 1]; int head[maxn], ecnt = 0; void add(int u, int v) { e[++ecnt] = (edge){v, head[u]}, head[u] = ecnt; } vector<int> p[maxn]; int pos[maxn]; int tree[maxn]; void update(int x, int v) { ...

#include <bits/stdc++.h> using namespace std; void update(int* Bit, int index) { for (; index <= 100000; index += (index & (-index))) { Bit[index] += 1; } } int query(int* Bit, int index) { int sum = 0; for (; index > 0; index -= (index & -index)) sum += Bit[index]; return sum; } i...

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

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; int a[N]; int main() { int i, j, k = 0, n; cin >> n; long long s = 0, t; for (i = 1; i <= n; i++) { cin >> a[i]; s += a[i]; } if (s % 2 == 1) { cout << 0 n ; return 0; } t = 0; for (...

#include <bits/stdc++.h> using namespace std; const int MAXN = 257, MOD = 1e9 + 7; int pk[MAXN * MAXN], pk1[MAXN * MAXN], n, k, f[MAXN][MAXN], C[MAXN][MAXN]; int mul(int a, int b) { return 1LL * a * b % MOD; } void add(int &a, const int &b) { a += b; if (a >= MOD) a -= MOD; } void sub(int &a, cons...

#include <bits/stdc++.h> using namespace std; const long long int N = 1e5 + 100, M = 1e14 + 10; long long int n, k, l, r, mid, x, y, f[N], p[N], a[N]; vector<long long int> v; void add(long long int v, long long int c) { if (v == 0) return; for (; v < N; v += v & -v) f[v] += c; } long long int get...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); ; string s; getline(cin, s); set<char> st; for (int i = 0; i < s.length(); i++) { if (s[i] == { || s[i] == } || s[i] == , || s[i] == ) { continue; } el...

#include <bits/stdc++.h> using namespace std; int n, m, k; int per; int main() { cin >> n >> m >> k; per = 2; int flag = 0; int sum = 0; int ff = 0; int a = 1; for (int i = 1; i <= n; ++i) { if (!flag) { for (int j = 1; j <= m; ++j) { if (sum % 2 == 0 && a == ...

#include <bits/stdc++.h> using namespace std; const long long md = 1e9 + 7; long long ans = 0; long long st[1000000 + 5]; long long dp[1000000 + 5]; vector<long long> d[1000000 + 5]; long long n; int32_t main() { ios_base::sync_with_stdio(false); cin >> n; for (long long i = 0; i < n - 1; i+...

#include <bits/stdc++.h> using namespace std; inline long long read() { long long x = 0, f = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) f = -1; ch = getchar(); } while (isdigit(ch)) { x = (x << 1) + (x << 3) + ch - 0 ; ch = getchar(); } return ...

#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, n; cin >> n >> a >> b >> c; int count = 0; for (int i = 0; i <= b; i++) { for (int j = 0; j <= c; j++) { int num = n - i - 2 * j; if (num >= 0 && 2 * num <= a) count++; } } cout << count << en...

#include <bits/stdc++.h> using namespace std; const long long maxN = 2e5 + 7; const long long segN = 8e5 + 7; const long long moD = 1e9 + 7; struct query { long long t, x, y; }; long long n; long long st[maxN], fi[maxN], sum[segN], deg[maxN], mul[segN], laz[segN], val[maxN]; vector<long long...

#include <bits/stdc++.h> using namespace std; int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int tc; cin >> tc; while (tc--) { int n; cin >> n; string s, t; cin >> s >> t; vector<int> v, c; for (int i = 1; i < n; i++) { if (s[i]...

#include <bits/stdc++.h> using namespace std; const int LIM = 5e+5 + 10; int sz[LIM]; int main() { ios_base::sync_with_stdio(false); int n; cin >> n; for (int i = 0; i < n; ++i) cin >> sz[i]; sort(sz, sz + n); int pairs = 0; int l = 0; int lb = n / 2 + (n % 2); int r = lb; ...

#include <bits/stdc++.h> using namespace std; template <typename T1, typename T2> istream &operator>>(istream &in, pair<T1, T2> &p) { in >> p.first >> p.second; return in; } template <typename T> istream &operator>>(istream &in, vector<T> &v) { for (auto &x : v) in >> x; return in; } tem...

#include <bits/stdc++.h> using namespace std; int main() { int a1, a2, k1, k2; int n; cin >> a1 >> a2 >> k1 >> k2 >> n; int n1 = n, n2 = n; n1 -= (a1 * (k1 - 1)); n1 -= (a2 * (k2 - 1)); if (n1 <= 0) cout << 0 << ; else cout << n1 << ; if (k1 > k2) { if (n2...

#include<iostream> #include<bits/stdc++.h> using namespace std; #define ll long long #define pb push_back #define mp make_pair #define ff first #define ss second #define MOD 1000000007 // void func(){ // } void solution(){ ll a,b; cin>>a>>b; ll val = abs(a-b); if(val==0)...

#include <bits/stdc++.h> using namespace std; const int nm = 100010; int n, k; long long x[nm], y[nm]; set<pair<long long, int> > ngang, doc; vector<int> xoa1, xoa2, xoa3, xoa4; int main() { scanf( %d%d , &n, &k); for (int i = 1; i <= n; ++i) { int a, b, c, d; scanf( %d%d%d%d , &a, &b,...

#include <bits/stdc++.h> using namespace std; int used[111111]; multiset<int> g[111111]; multiset<int> vertex; vector<int> ans; void dfs(int v) { used[v] = 1; vertex.erase(v); ans.push_back(v); for (auto i = g[v].begin(); i != g[v].end(); ++i) if (!used[*i]) vertex.insert(*i); if (...

#include <bits/stdc++.h> using namespace std; int main() { int n, t; cin >> n >> t; if (t == 10) { if (n == 1) { cout << -1 ; } else { for (int i = 0; i < n - 1; i++) { cout << 1 ; } cout << 0 ; } } else { for (int i = 0; i < n; i+...

#include <bits/stdc++.h> using namespace std; const int N = 200005; char a[N], b[N]; string arrange(string s) { int n = s.size(); if (n & 1) return s; else { int m = n / 2; string s1 = s.substr(0, m), s2 = s.substr(m, m); s1 = arrange(s1); s2 = arrange(s2); if (s1...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:16777216 ) using namespace std; int a[2 * 100010] = {0}; int check(int x, int n) { if (x == 1) return 0; int cur = 0, ans = 0; while (cur < a[n - 1]) { cur += x; int pos = lower_bound(a, a + n, cur) - a; if (pos > 0 && a[pos ...

#include <bits/stdc++.h> using namespace std; const int INF = 0x7f7f7f7f; int BigMod(long long int B, long long int P, long long int M) { long long int R = 1; while (P > 0) { if (P % 2 == 1) R = (R * B) % M; P /= 2; B = (B * B) % M; } return (int)R; } long long int maxDivide(...

#include <bits/stdc++.h> using namespace std; int main() { int h1, m1, h2, m2, s1, s2, h, m; scanf( %d:%d , &h1, &m1); scanf( %d:%d , &h2, &m2); s1 = h1 * 60 + m1; s2 = h2 * 60 + m2; m = (s1 + s2) / 2; h = m / 60; m = m % 60; printf( %02d:%02d n , h, m); return 0; }

#include <bits/stdc++.h> using namespace std; int main() { { int s, v1, v2, t1, t2; cin >> s >> v1 >> v2 >> t1 >> t2; int time1, time2; time1 = (s * v1) + (2 * t1); time2 = (s * v2) + (2 * t2); if (time1 < time2) cout << First << endl; else if (time2 < time1) ...

#include <bits/stdc++.h> using namespace std; const long long inf = 1e18; const int N = 1e6 + 20; vector<int> v[N]; map<int, int> mp, ml, mr; long long n, m, k, a[N], b[N], f[N]; int num[N]; long long did[N]; string s; long long s1, s2, ans, flag, tot, t, sum; int cnt; int main() { ios::sync...

#include <bits/stdc++.h> using namespace std; long long n, m, q, t, x, y, b, c, d; string s1, s2; long long a[3]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; for (int i = 0; i < n; i++) { cin >> s1 >> s2; int l1 = s1.length(); int l2 = s2.length(); ...