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

func_code_string stringlengths 59 71.4k
#include <bits/stdc++.h> using namespace std; long long n, i, j, k, l, sum = 0, flag = 0, t, a[200005], ans = 0; vector<int> tree[800005]; void build(int node, int low, int high) { if (low == high) { tree[node].push_back(a[low]); return; } int mid = (low + high) / 2; build(2 * node, ...
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /stack:200000000 ) #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) const long long mod = 1e9 + 7; class matrix { public: vector<vector<long long> > v; matrix() { v = ...
#include <bits/stdc++.h> using namespace std; long long a[70]; long long b[70]; long long ans[4909]; int main() { long long x, y, l, r, u = 1, v = 1, w = 0; cin >> x >> y >> l >> r; a[0] = 1; b[0] = 1; for (int i = 1; i <= 65; i++) { if (a[u - 1] <= 1000000000000000010 / x) { ...
#include <bits/stdc++.h> using namespace std; const int N = 1e4 + 1, M = 1e9 + 7; int n, dp[N][1 << 3][2]; char s[3][N]; int calc(int r, int msk, bool f) { if (r == n) return f; int &res = dp[r][msk][f]; if (res != -1) return res; int nmsk = msk; for (int i = 0; i < 3; ++i) if (s[i][...
#include <bits/stdc++.h> using namespace std; struct p { int s, n; }; int comp(struct p a, struct p b) { return (a.s <= b.s); } int main() { vector<long long> a, sb, s, r; long long i, j, k, n, ss, sss, rrr; cin >> n; s.resize(n + 2, 0); r.resize(n + 2, 0); sb.push_back(0); for...
#include <bits/stdc++.h> using namespace std; const int MAX_N = 2000005; int n, m; int in[MAX_N]; int inv[MAX_N]; int out[MAX_N], temp[MAX_N]; int pos2bckt[MAX_N]; int bckt[MAX_N], relabel[MAX_N]; int bpos[MAX_N]; void build() { for (int i = 0; i < n; i++) out[i] = i; sort(out, out + n, [](i...
#include <bits/stdc++.h> using namespace std; long long int powr(long long a, long long b) { if (b == 0) { return 1; } if (b % 2 == 0) { return powr(((a % 1000000007) * (a % 1000000007)) % 1000000007, b / 2); } else { if (b == 1) { return a; } else { return (a...
#include <bits/stdc++.h> using llong = long long; using namespace std; set<llong> factors; void f(llong num) { factors.insert(1); llong to = sqrt(num); for (auto i = 2; i <= to; ++i) { if (num % i == 0) { factors.insert(i); factors.insert(num / i); } } factors.ins...
#include <bits/stdc++.h> using namespace std; typedef struct { int u, v, cu, cv; } Edge; const int N = 500010, M = 1000010; pair<int, int> stk[M]; int top; Edge e[N]; int cnt; int fa[M]; int co[N]; int sz[M]; int st[N]; int n, m, k; int find(int x) { if (x == fa[x]) return x; ...
#include <bits/stdc++.h> using namespace std; int mod = 1000000007; int dv[1000005]; int cnt[1000006]; inline void add(int &r, int a) { r += a; if (r >= mod) r -= mod; } int mPow(int a, int x) { int ret = 1; while (x > 0) { if (x & 1) ret = 1LL * ret * a % mod; a = 1LL * a * a ...
#include <bits/stdc++.h> using namespace std; const int INF = 0x3fffffff; const long long _INF = 0x7ffffffffffffffll; const double EPS = 1e-9; const double PI = acos(-1.0); template <class T, class INT> inline T pow(T x, INT y) { T res(1); for (T tt(x); y; y /= 2) { if (y & 1) res *= tt; ...
#include <bits/stdc++.h> using namespace std; const long long N = 1005; const long long mod = 1e9 + 7; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long n; cin >> n; cout << (n + 1) / 2 - 1; }
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( avx,avx2,fma ) using namespace std; long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } long long lcm(long long a, long long b) { return a * b / (gcd(a, b)); } void solve() { long lon...
#include <bits/stdc++.h> using namespace std; int main() { long n, e = 0, aw = 0, k = 0; cin >> n; long a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; k = max(a[i], k); e += a[i]; } aw = k * n - e; while (aw <= e) { k++; aw = k * n - e; } cout << k...
#include <bits/stdc++.h> using namespace std; long long ans, t, s, a, i, b, k; int main() { cin >> k >> a >> b; s = (0 - a) / k + 1; while (a <= 0) { a = a + s * k; b = s * k + b; } ans = b / k - (a - 1) / k; cout << ans; }
#include <bits/stdc++.h> int main() { int N; std::cin >> N; std::set<std::pair<int, int>> doubled; std::set<std::pair<int, int>> pending; int to_double = 0; int l_doubled = 0; int64_t total_damage = 0; int t; int d; for (int i = 0; i < N; i++) { std::cin >> t; std::...
#include <bits/stdc++.h> using namespace std; const int maxN = 1000000; long long a1, a2, t0, t1, t2, p1, p2, num, f, T, Tim, tot1, tot2, l, r, ans, Num; bool fl; void check1(long long my) { num = my / p1; if (num * a1 >= f) { if (t1 * f <= T) fl = 1; return; } for (long long...
#include <bits/stdc++.h> using namespace std; vector<int> e[200010]; vector<int> a; int n; int siz[200010]; int id[200010]; int d[200010]; int c[200010]; int f[200010]; int dfn; void dfs(int x, int fa) { id[x] = ++dfn; siz[x]++; for (int i = 0; i < e[x].size(); i++) { if (e[x][i]...
#include <bits/stdc++.h> using namespace std; const int dx[] = {1, 0, -1, 0}; const int dy[] = {0, 1, 0, -1}; struct Point { int x, y; } Q[2000 * 2000], P, np; int n, m; int b[2000][2000]; int mark[2000][2000], T; int L[2000 * 2000]; int flag[2000][2000]; bool out(int x, int y) { return x < 0 ...
#include <bits/stdc++.h> using namespace std; const int mn = 55; const int mm = 2505; const int mod = 1000000007; int n, m, T; int t[mm], g[mm]; int a[mn][mm]; int bc[mn][mn][mm]; int way[mn][mn][mn][3]; int cnt[3]; void init_a() { memset(a, -2, sizeof a); a[0][0] = 1; for (int k = 1; ...
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; int arr[n]; for (int i = 0; i < n; i++) { cin >> arr[i]; } sort(arr, arr + n); int i; for (i = 0; i < n && arr[i] + k <= 5; i++) ; cout << (i) / 3; }
#include <bits/stdc++.h> using namespace std; bool isPrime(int n) { for (int i = 2; (i * i) <= n; i++) { if (n % i == 0) return 0; } return 1; } int nerPr(int n) { for (int i = n;; i++) { if (isPrime(i)) return i; } } int main() { ios_base::sync_with_stdio(false); cin...
#include <bits/stdc++.h> using namespace std; const long long linf = 4000000000000000000LL; const long long inf = 1000000007; const long double pi = 3.1415926535; void pv(vector<int> a) { for (auto& x : a) cout << x << ; cout << n ; } void pv(vector<long long> a) { for (auto& x : a) cout ...
#include <bits/stdc++.h> using namespace std; const int N = 6; const int M = 10010; const int K = 510; const int LIT = 2500; const int INF = 1 << 30; int n, m[N][N], tot, need; vector<int> v, vis; int row[N], col[N], dia1, dia2; int cr[N], cc[N], cd1, cd2; void init() { memset(m, 0, sizeof(m))...
#include <bits/stdc++.h> using namespace std; int n, m, x, y, ans; int p[100010], q[100010], mn[100010]; vector<int> t[100010], v[100010]; bool flag[100010]; inline int dist(int x, int y) { return abs(p[x] - q[y]); } int main() { scanf( %d%d%d%d , &n, &m, &x, &y); memset(mn, 63, sizeof(mn)); f...
#include <bits/stdc++.h> using namespace std; void reset(int& n, int first) { n = n & ~(1 << first); } bool check(int n, int first) { return (bool)(n & (1 << first)); } set<int> ax, ay; multiset<int> bx, by; set<int>::iterator l, r; int main() { int i, j, k, n, w, h; while (scanf( %d%d%d , &w, &h,...
#include <bits/stdc++.h> int main() { int a, b, c = 0, d, e, i; scanf( %d , &a); for (i = 1; i <= a; i++) { scanf( %d , &b); if (b == 1) { c++; } } if (c > 0) { printf( HARD n ); } else { printf( EASY n ); } return 0; }
#include <bits/stdc++.h> using namespace std; int mini[10], maxi[10], dist[10]; int main() { int n, i, total; scanf( %d , &n); total = 0; for (i = 0; i < 3; ++i) { scanf( %d %d , &mini[i], &maxi[i]); total += mini[i]; dist[i] = mini[i]; } i = 0; while (n - total > 0) ...
#include <bits/stdc++.h> using namespace std; const int M = 200002; int val[M]; vector<int> vec[33]; set<int> st; struct Nod { int v; int id; bool operator<(const Nod &cmp) const { if (v == cmp.v) return id < cmp.id; return v > cmp.v; } } p[M]; int n; void init() { for ...
#include <bits/stdc++.h> using namespace std; int n, m; int a[12][2001]; int dp[2][4096]; int sos[4096]; bool use[2001]; pair<int, int> b[2001]; void solve() { cin >> n >> m; for (int j = 1; j <= m; j++) b[j].first = 0; for (int i = 0; i < n; i++) { for (int j = 1; j <= m; j++) { ...
#include <bits/stdc++.h> using namespace std; int x, y, n; int xs[30], ys[30]; int mem[16777227]; int ALL; int dt[30][30]; int calc(int mask) { if (mask == ALL) return 0; int& res = mem[mask]; if (res != -1) return res; res = ((int)1e9); int f = -1; for (int i = 0; i < n; ++i) { ...
#include <bits/stdc++.h> using namespace std; void solve() { long long int n; cin >> n; string s; cin >> s; long long int mx[n], mn[n]; for (long long int i = 0; i < n; i++) { mx[i] = i + 1, mn[i] = n - i; } long long int j = 0; for (long long int i = 0; i < n - 1; i = j) {...
#include <bits/stdc++.h> using namespace std; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n, k; cin >> n >> k; vector<vector<pair<long long, long long>>> ans(k); long long gr = k, cnt = 0; bool f = false; vector<pair<pair<long long, long long>...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; int n; cin >> n; map<int, int> m; int ma = -1; int ans = 0; for (int i = 0; i < n; i++) { int x; cin >> x; if (m[x] > ma) { ma = m...
#include <bits/stdc++.h> using namespace std; int n, m; string s; string change(string s, int l, int r, char c1, char c2) { for (int i = l - 1; i < r; i++) { if (s[i] == c1) { s[i] = c2; } } return s; } int main() { cin >> n >> m; cin >> s; for (int i = 0; i < m; ...
// #pragma GCC optimize( Ofast,unroll-loops ) // #pragma GCC target( avx,avx2,fma ) #include <bits/stdc++.h> using namespace std; #define ll long long #define ull unsigned long long #define dd double #define ld long double #define sl(n) scanf( %lld , &n) #define si(n) scanf( %d , &n) #define s...
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 10; int a[N], n, l, r, ans; bool check(int k) { for (int i = 1; i <= n; ++i) { if (1LL * k * (i - 1) > a[i]) return false; if (1LL * k * (n - i) > a[i]) return false; } return true; } int main() { scanf( %d , &n); ...
#include <bits/stdc++.h> using namespace std; const long long N = 1e5 + 5; long long v[N], mn[N]; int main() { long long n; long long ans = 0; cin >> n; for (long long i = 0; i < n; i++) cin >> v[i]; for (long long i = 0; i < n; i++) mn[i] = v[i] + 1; for (long long i = 1; i < n; i++) mn...
#include <bits/stdc++.h> using namespace std; const int P = 1e9 + 7; long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } long long qpow(long long a, long long n) { long long r = 1 % P; for (a %= P; n; a = a * a % P, n >>= 1) if (n & 1) r = r * a % P; return r; } long ...
#include <bits/stdc++.h> const long long int m = 1000000007; using namespace std; int main() { int tc; cin >> tc; while (tc--) { int x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2; if (x1 == x2 \|\| y1 == y2) cout << abs(x1 - x2) + abs(y2 - y1) << n ; else cout << ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int n, q; cin >> n >> q; long long int arr[n]; long long int aftern[n]; long long int maxi[n]; for (long long int i = 0; i < n; i++) { cin >> arr[i]; if (...
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; template <typename T> void chmin(T &a, T b) { if (a > b) a = b; } template <typename T> void chmax(T &a, T b) { if (a < b) a = b; } template <typename T> void add(T &a, T b) { a += b; if (a < 0) a += MOD; ...
#include <bits/stdc++.h> using namespace std; long long x[5003], a[5003], b[5003], c[5003], d[5003]; vector<int> path; long long weight[5003][5003]; long long edge(int i, int j) { long long ans = abs(x[i] - x[j]); if (j < i) ans += (c[i] + b[j]); if (i < j) ans += (d[i] + a[j]); return ans; ...
#include <bits/stdc++.h> using namespace std; template <typename T> inline T abs(T t) { return t < 0 ? -t : t; } const long long modn = 1000000007; inline long long mod(long long x) { return x % modn; } int main() { long long d1, d2, d3; cin >> d1 >> d2 >> d3; long long ans = min(d1 + d2 +...
#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > marks(200002); vector<pair<int, int> > marksbyy(200002); vector<vector<int> > partials(2005, vector<int>(2005)); vector<vector<int> > inpart(2005, vector<int>(2005)); int n; void fillpart() { sort(marks.begin() + 1, marks.begin() + ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1000000; int a[300005], b[300005]; class SegmentTree { public: SegmentTree* left = nullptr; SegmentTree* right = nullptr; int start, end, val = 0, lazyadd = 0; SegmentTree(int s, int e) { start = s; end = e; if (...
#include <bits/stdc++.h> using namespace std; int n, m, x, len, dir, t, y; bool fin; pair<int, int> a[210000]; int loc[210000]; int binary_right(int x, int t) { int l = x, r = n, mid; while (l < r) { mid = (l + r + 1) / 2; if (a[mid].first <= t) l = mid; else r = mi...
#include <bits/stdc++.h> using namespace std; int n, k; int main() { while (scanf( %d%d , &n, &k) != EOF) { if (k > n \|\| k > 26 \|\| (n > 1 && k == 1)) printf( -1 n ); else { for (int i = 0; i < n - max(0, (k - 2)); i++) if (i % 2 == 0) printf( a ); el...
#include <bits/stdc++.h> using namespace std; int n; int a[5000006]; int S; void go(int lf, int rg) { if (lf < 0) return; S = max(S, (rg - lf) / 2); if (a[lf] == a[rg]) { for (int i = lf; i < rg; ++i) a[i] = a[lf]; } else { for (int i = lf, j = rg; i < j; ++i, --j) { a[i] =...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx ) #pragma GCC optimize( unroll-loops ) using namespace std; template <typename T1, typename T2> inline void chkmin(T1 &first, T2 second) { if (first > second) first = second; } template...
#include <bits/stdc++.h> using namespace std; int a[30]; int main() { int n, k, i, j, m; string s; cin >> s; cin >> k; map<char, int> mp; map<char, int>::iterator it; n = s.size(); for (i = 0; i < n; i++) { ++mp[s[i]]; } multimap<int, char> mp2; multimap<int, char...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 7; int n, m, q[N], a[N]; int main() { scanf( %d , &m); for (int i = (0); i < (m); ++i) scanf( %d , &q[i]); int mn = *min_element(q, q + m); scanf( %d , &n); for (int i = (0); i < (n); ++i) scanf( %d , &a[i]); sort(a, a + n...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { int n; cin >> n; if (n <= 30) { cout << NO n ; } else if (n == 36) { cout << YES n ; cout << 5 6 10 15 ...
#include <bits/stdc++.h> using namespace std; const int N = 1e6; int d[2 * N], c[2 * N], n, k, l, p, a = N, q, w, u; string s; int main() { cin >> n >> k >> l >> s; q = 0; w = N; while (q < w) { p = (q + w) >> 1; for (int i = n - 1; i >= 0; i--) { d[i] = d[i + 1] + (s[i] > ...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { unsigned long long a, b; cin >> a >> b; if (max(a, b) % min(a, b)) { cout << -1 << endl; continue; } int dem = 0; long long p = max(a, b) / min(a, b); while...
#include <bits/stdc++.h> using namespace std; const int maxn = (int)5e5 + 9; const int maxm = (int)1e6 + 9; const long long mod = (long long)1e9 + 7; const double pi = acos(-1); const double eps = 1e-15; vector<pair<int, int> > to[maxn]; int fa[maxn]; int tobig[maxn]; int n, m; int e[maxn]; int ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 100100; int N, M; vector<int> conn[MAXN]; bool adj[10][10]; bool vis[MAXN]; int deg[10]; int ar[MAXN]; int pa[10]; int pb[10]; int numed; void prec() { for (int j = 0; j < numed; ++j) { int a = 2, b = 1; for (int k = ...
#include <bits/stdc++.h> using namespace std; int n, q; int tim[10000]; int main() { while (~scanf( %d%d , &n, &q)) { memset(tim, -1, sizeof(tim)); while (q--) { int ti, ni, di; scanf( %d%d%d , &ti, &ni, &di); int cnt = 0; for (int i = 1; i <= n; i++) { ...
#include <bits/stdc++.h> using namespace std; const int N = 2000500; int P[N]; int D[N]; multiset<int> S[N]; inline bool recalc(int x) { if (x == 1) { D[x] = S[x].rbegin() + 1; return false; } else { int nd; if (S[x].size() == 1) nd = S[x].rbegin(); else ...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n + 1]; for (int i = 1; i <= n; i++) cin >> a[i]; sort(a + 1, a + n + 1); if (n % 2) cout << a[n / 2 + 1] << endl; else cout << a[n / 2] << endl; }
#include <bits/stdc++.h> using namespace std; int n, k, ans; int a[500101], b[500101], fl[500101]; int q[500101], qn; void solve() { scanf( %d%d , &n, &k); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); for (int i = 1; i <= k; i++) { scanf( %d , &b[i]); fl[b[i]] = 1; } int fl...
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 100; int p[N]; vector<int> G[N]; int mn[N], mx[N], val[N], sum[N], s[N][2], c[N][2], fa[N], mp[N]; int head; void upd(int x) { sum[x] = sum[c[x][1]] + sum[c[x][0]] + val[x]; mn[x] = min(mn[c[x][0]], min(sum[c[x][0]] ...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 6; int n, m; int a[200]; bool check() { if (*max_element(a, a + n) != 0) { return false; } return true; } void solve() { int k; cin >> n >> k; for (int i = 0; i < n; i++) { cin >> a[i]; } if (k...
#include <bits/stdc++.h> using namespace std; long long n, k, mod = 1000000007, dp[2010][2010]; long long solve(long long num, long long x) { long long i; if (x == k) return 1; if (dp[num][x] != -1) return dp[num][x]; long long res = 0; for (i = 1; (i * num) <= n; i++) { res += solve(num...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n, k, h = 0; cin >> n >> k; vector<int> v; for (int i = 0; i < n; i++) v.push_back(i); for (int ki = 1; ki <= k; ki++) { int x; cin >> x; x = x - (x / (n)) * (n)...
#include <bits/stdc++.h> using namespace std; using ll = long long int; using ull = unsigned long long int; using ld = long double; using pii = pair<int, int>; using pll = pair<ll, ll>; const int INT_INF = (int)(2e9); const ll LL_INF = (ll)(2e18); const int NIL = -1; static mt19937 _g(time(nullptr))...
#include <bits/stdc++.h> using namespace std; long long int n, m, k, s = 0, sx, sy, num; char grid[600][600]; bool vis[600][600]; long long int dx[4] = {0, 0, -1, 1}; long long int dy[4] = {-1, 1, 0, 0}; bool check(long long int x, long long int y) { if (x >= 0 && x < n && y >= 0 && y < m && grid[x][y...
#include <bits/stdc++.h> using namespace std; const int N = 505; unordered_set<int> dp[N]; int main() { int n, k; scanf( %d%d , &n, &k); dp[0].insert(0); for (int i = 0; i < n; ++i) { int c; scanf( %d , &c); for (int j = k; j >= c; --j) { for (int l : dp[j - c]) dp[j].i...
#include <bits/stdc++.h> using namespace std; const long double eps = 1e-10; struct Tpoint { long double x, y; void input() { double _x, _y; scanf( %lf%lf , &_x, &_y); x = _x; y = _y; } } C, H, S; double t1, t2; long double T1, T2; long double ret; long double Fabs(lo...
#include <bits/stdc++.h> using ul = std::uint32_t; using ull = std::uint64_t; using li = std::int32_t; using ll = std::int64_t; using vull = std::vector<ull>; using vul = std::vector<ul>; const ul sz = 1 << 18; const ul base = 1e9 + 7; class scaler { public: ul v = 0; scaler() = default; ...
#include <bits/stdc++.h> using namespace std; int gcd(int x, int y) { while (x > 0 && y > 0) { if (x > y) { x %= y; } else { y %= x; } } return x + y; } int main() { int n, k; cin >> n >> k; vector<int> a(n + 1); vector<bool> used(n + 1); for (in...
#include <bits/stdc++.h> using namespace std; long long dp[205][6003], dp1[205][6003]; int main() { long long n, k; cin >> n >> k; long long tmp; for (int i = 0; i <= k; i++) { for (int j = 0; j <= 6000; j++) { dp1[i][j] = -2e9; } } dp1[0][0] = 0; for (int i = 0; i ...
#include <bits/stdc++.h> using namespace std; const int N = 2e3 + 10; char s[N], t[N]; int n; vector<int> G; void shift(int x) { if (x == 0) return; reverse(s, s + n); reverse(s + x, s + n); G.push_back(x); } int main() { scanf( %d%s%s , &n, s, t); for (int i = 0; i < n; i++) { ...
#include <bits/stdc++.h> using namespace std; long long n, l; string s, s1, s2; int main() { cin >> n; getline(cin, s); while (n--) { getline(cin, s); s1 = ; s2 = ; l = s.length(); for (int i = 0; i <= 4; i++) s1 += s[i]; for (int i = l - 5; i < l; i++) s2 += ...
#include <bits/stdc++.h> using namespace std; int n, nmax, nrpar, nrimpar, par, impar, i, sol; int luat[200005]; struct el { int val, poz; } a[200005]; bool rearanjare(el x, el y) { if (x.poz < y.poz) return 1; else return 0; } bool comp(el x, el y) { if (x.val < y.val) ...
#include <bits/stdc++.h> using namespace std; int main() { long long t; cin >> t; while (t--) { long long n; cin >> n; string s, t; cin >> s >> t; long long w = 0; char s1, t1, s2, t2; int q = 0; for (long long i = 0; i < n; i++) { if (s[i] != t[i]...
#include <bits/stdc++.h> int main() { int a; scanf( %d , &a); int m[a]; int p = 1, i; for (i = 0; i < a; i++) { scanf( %d , &m[i]); if (i > 0) { if (m[i] != m[i - 1]) { p++; } } } printf( %d , p); }
#include <bits/stdc++.h> using namespace std; namespace variables { struct triple { long long first, second, third; }; } // namespace variables using namespace variables; void testt(); namespace andu2006 { void debug(set<long long> _var, string _name = ) { cerr << Debug #set << _name << ...
#include <bits/stdc++.h> using namespace std; int s[101][101]; int main() { int n, a, r; cin >> n; a = 100; while (a * (a - 1) * (a - 2) / 6 > n) a--; n -= a * (a - 1) * (a - 2) / 6; r = a; for (int i = 1; i < a; i++) for (int j = i + 1; j <= a; j++) s[i][j] = s[j][i] = 1; fo...
#include <bits/stdc++.h> using namespace std; long long power(long long a, long long b, long long mod) { if (b == 0) return 1; long long val = power(a, b >> 1, mod); long long ans = ((val % mod) * (val % mod)) % mod; if (b % 2 != 0) ans = ((ans % mod) * (a % mod)) % mod; return ans; } int m[...
#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int dx[8] = {1, -1, 0, 0, -1, -1, 1, 1}; int dy[8] = {0, 0, -1, 1, -1, 1, -1, 1}; vector<int> adj[300010], val(300010, 1), vis(300010, 0), dis1(300010, 0), dis2(300010, 0); int myrandom(i...
#include <bits/stdc++.h> int main() { char a[200]; int n; bool plat[200]; scanf( %d , &n); scanf( %s , a); for (int i = 0; i < n; i++) { if (a[i] == * ) plat[i] = true; else plat[i] = false; } bool ans = false; for (int i = 0; i < n; i++) { if (!p...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, p; cin >> n >> p; vector<int> a(n); for (auto &i : a) cin >> i; int m = *max_element((a).begin(), (a).end()); vector<int> freq(m + n + 10); for (int i = 0;...
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 5; template <class T> void read(vector<T> &arr) { for (auto &x : arr) cin >> x; } template <class T> void read(T &x) { cin >> x; } template <class T> void write(vector<T> &arr) { for (auto x : arr) cout << x << ...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); int t; cin >> t; while (t--) { long long n, m; cin >> n >> m; vector<string> ar(11); for (int i = 0; i < n; i++) { cin >> ar[i]; } st...
#include <bits/stdc++.h> using namespace std; int main() { long long int n, i; cin >> n; string s; cin >> s; map<char, long long int> a; if (n > 26) { cout << -1 << endl; return 0; } long long int ans = 0; for (i = 0; i < n; i++) { if (a[s[i]] >= 1) ans++; ...
#include <bits/stdc++.h> using namespace std; long long max(long long a, long long b) { if (a > b) { return a; } else { return b; } } long long min(long long a, long long b) { if (a < b) { return a; } else { return b; } } struct P { double x, y; P() {}...
#include <bits/stdc++.h> using namespace std; void canhazfast() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); } template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; } template <typename T> T extgcd(T a, T b, T &x, T &y) { T x0 = 1, y0 = 0, ...
#include <bits/stdc++.h> #include<string> #define M 10000000000007 using namespace std; typedef long long int ll; int gcd(int a,int b) { if (a == 0) return b; return gcd(b % a, a); } int modpow(int x,int n) { int result=1; while(n>0) { if(n % 2 ==1) ...
#include <bits/stdc++.h> using namespace std; int main() { int n, cnt = 0, x, i; scanf( %d , &n); while (n--) { scanf( %d , &x); if (x == 1) cnt++; } if (cnt) cout << -1 << endl; else cout << 1 << endl; return 0; }
#include <bits/stdc++.h> int main() { double k, b, n, t; double bacteria = 1; double time = 0; scanf( %lf %lf %lf %lf , &k, &b, &n, &t); while (bacteria <= t) { bacteria = (k * bacteria + b); if (bacteria > t) { break; } else if (bacteria == t) { time++; b...
#include <bits/stdc++.h> const static long long INF = 0x3f3f3f3f; static inline void setio(void); long long dp[5002][5002]; int main(void) { setio(); memset(dp, 0, sizeof(dp)); long long n, m; std::cin >> n >> m; std::string s; for (long long i = 0; i < n; ++i) { std::cin >> s; ...
#include <bits/stdc++.h> using namespace std; using ll = long long int; using ull = unsigned long long int; using ld = long double; using pii = pair<int, int>; using pll = pair<ll, ll>; const int INT_INF = (int)(2e9); const ll LL_INF = (ll)(2e18); const ll mod = 1e9 + 7; const int NIL = -1; static...
#include <bits/stdc++.h> const double eps = (1e-10); using namespace std; int dcmp(double a, double b) { return fabs(a - b) <= eps ? 0 : (a > b) ? 1 : -1; } int getBit(int num, int idx) { return ((num >> idx) & 1) == 1; } int setBit1(int num, int idx) { return num \| (1 << idx); } int setBit0(int num, ...
#include <bits/stdc++.h> using namespace std; void fastio() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); } void one(); int main() { fastio(); int t = 1; for (int i = 0; i < t; ++i) { one(); } return 0; } void one() { long long n; cin >> n; long ...
#include <bits/stdc++.h> using namespace std; const long long INF = 1e9 + 7; const long long N = 1e6 + 10; char s[N]; long long a[N]; long long n, k; int main() { long long i, len, j; long long tmp, flag, len_q = 0; scanf( %lld%lld , &n, &k); n++; for (i = 1; i <= n; i++) { scanf...
#include <bits/stdc++.h> using namespace std; template <class T> T CMP_MIN(T a, T b) { return a < b; } template <class T> T CMP_MAX(T a, T b) { return a > b; } template <class T> T MAX(T a, T b) { return a > b ? a : b; } template <class T> T MIN(T a, T b) { return a < b ? a : b; ...
#include <bits/stdc++.h> using namespace std; int main() { int n; int xs[200000], ys[200000]; cin >> n; for (int i = 0; i < n; i++) { cin >> xs[i] >> ys[i]; } map<int, int> vert, hor; for (int i = 0; i < n; i++) { int x, y; x = xs[i]; y = ys[i]; int v = x - ...
#include <bits/stdc++.h> int main() { long long int n, m, i, c = 0; scanf( %lld %lld , &n, &m); long long int a[m]; for (i = 0; i < m; i++) { scanf( %lld , &a[i]); } for (i = 0; i < m - 1; i++) { if (a[i + 1] > a[i]) { c = c + a[i + 1] - a[i]; } else if (a[i] == a[i +...
#include <bits/stdc++.h> using namespace std; map<char, char> a; int main() { string s1, s2; cin >> s1 >> s2; int dl = s1.size(); int k = 0; for (int i = 0; i < dl; i++) { char p1 = s1[i]; char p2 = s2[i]; map<char, char>::iterator it = a.find(p1); if (it == a.end()) { ...

#include <bits/stdc++.h> using namespace std; long long n, i, j, k, l, sum = 0, flag = 0, t, a[200005], ans = 0; vector<int> tree[800005]; void build(int node, int low, int high) { if (low == high) { tree[node].push_back(a[low]); return; } int mid = (low + high) / 2; build(2 * node, ...

#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /stack:200000000 ) #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) const long long mod = 1e9 + 7; class matrix { public: vector<vector<long long> > v; matrix() { v = ...

#include <bits/stdc++.h> using namespace std; long long a[70]; long long b[70]; long long ans[4909]; int main() { long long x, y, l, r, u = 1, v = 1, w = 0; cin >> x >> y >> l >> r; a[0] = 1; b[0] = 1; for (int i = 1; i <= 65; i++) { if (a[u - 1] <= 1000000000000000010 / x) { ...

#include <bits/stdc++.h> using namespace std; const int N = 1e4 + 1, M = 1e9 + 7; int n, dp[N][1 << 3][2]; char s[3][N]; int calc(int r, int msk, bool f) { if (r == n) return f; int &res = dp[r][msk][f]; if (res != -1) return res; int nmsk = msk; for (int i = 0; i < 3; ++i) if (s[i][...

#include <bits/stdc++.h> using namespace std; struct p { int s, n; }; int comp(struct p a, struct p b) { return (a.s <= b.s); } int main() { vector<long long> a, sb, s, r; long long i, j, k, n, ss, sss, rrr; cin >> n; s.resize(n + 2, 0); r.resize(n + 2, 0); sb.push_back(0); for...

#include <bits/stdc++.h> using namespace std; const int MAX_N = 2000005; int n, m; int in[MAX_N]; int inv[MAX_N]; int out[MAX_N], temp[MAX_N]; int pos2bckt[MAX_N]; int bckt[MAX_N], relabel[MAX_N]; int bpos[MAX_N]; void build() { for (int i = 0; i < n; i++) out[i] = i; sort(out, out + n, [](i...

#include <bits/stdc++.h> using namespace std; long long int powr(long long a, long long b) { if (b == 0) { return 1; } if (b % 2 == 0) { return powr(((a % 1000000007) * (a % 1000000007)) % 1000000007, b / 2); } else { if (b == 1) { return a; } else { return (a...

#include <bits/stdc++.h> using llong = long long; using namespace std; set<llong> factors; void f(llong num) { factors.insert(1); llong to = sqrt(num); for (auto i = 2; i <= to; ++i) { if (num % i == 0) { factors.insert(i); factors.insert(num / i); } } factors.ins...

#include <bits/stdc++.h> using namespace std; typedef struct { int u, v, cu, cv; } Edge; const int N = 500010, M = 1000010; pair<int, int> stk[M]; int top; Edge e[N]; int cnt; int fa[M]; int co[N]; int sz[M]; int st[N]; int n, m, k; int find(int x) { if (x == fa[x]) return x; ...

#include <bits/stdc++.h> using namespace std; int mod = 1000000007; int dv[1000005]; int cnt[1000006]; inline void add(int &r, int a) { r += a; if (r >= mod) r -= mod; } int mPow(int a, int x) { int ret = 1; while (x > 0) { if (x & 1) ret = 1LL * ret * a % mod; a = 1LL * a * a ...

#include <bits/stdc++.h> using namespace std; const int INF = 0x3fffffff; const long long _INF = 0x7ffffffffffffffll; const double EPS = 1e-9; const double PI = acos(-1.0); template <class T, class INT> inline T pow(T x, INT y) { T res(1); for (T tt(x); y; y /= 2) { if (y & 1) res *= tt; ...

#include <bits/stdc++.h> using namespace std; const long long N = 1005; const long long mod = 1e9 + 7; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long n; cin >> n; cout << (n + 1) / 2 - 1; }

#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( avx,avx2,fma ) using namespace std; long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } long long lcm(long long a, long long b) { return a * b / (gcd(a, b)); } void solve() { long lon...

#include <bits/stdc++.h> using namespace std; int main() { long n, e = 0, aw = 0, k = 0; cin >> n; long a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; k = max(a[i], k); e += a[i]; } aw = k * n - e; while (aw <= e) { k++; aw = k * n - e; } cout << k...

#include <bits/stdc++.h> using namespace std; long long ans, t, s, a, i, b, k; int main() { cin >> k >> a >> b; s = (0 - a) / k + 1; while (a <= 0) { a = a + s * k; b = s * k + b; } ans = b / k - (a - 1) / k; cout << ans; }

#include <bits/stdc++.h> int main() { int N; std::cin >> N; std::set<std::pair<int, int>> doubled; std::set<std::pair<int, int>> pending; int to_double = 0; int l_doubled = 0; int64_t total_damage = 0; int t; int d; for (int i = 0; i < N; i++) { std::cin >> t; std::...

#include <bits/stdc++.h> using namespace std; const int maxN = 1000000; long long a1, a2, t0, t1, t2, p1, p2, num, f, T, Tim, tot1, tot2, l, r, ans, Num; bool fl; void check1(long long my) { num = my / p1; if (num * a1 >= f) { if (t1 * f <= T) fl = 1; return; } for (long long...

#include <bits/stdc++.h> using namespace std; vector<int> e[200010]; vector<int> a; int n; int siz[200010]; int id[200010]; int d[200010]; int c[200010]; int f[200010]; int dfn; void dfs(int x, int fa) { id[x] = ++dfn; siz[x]++; for (int i = 0; i < e[x].size(); i++) { if (e[x][i]...

#include <bits/stdc++.h> using namespace std; const int dx[] = {1, 0, -1, 0}; const int dy[] = {0, 1, 0, -1}; struct Point { int x, y; } Q[2000 * 2000], P, np; int n, m; int b[2000][2000]; int mark[2000][2000], T; int L[2000 * 2000]; int flag[2000][2000]; bool out(int x, int y) { return x < 0 ...

#include <bits/stdc++.h> using namespace std; const int mn = 55; const int mm = 2505; const int mod = 1000000007; int n, m, T; int t[mm], g[mm]; int a[mn][mm]; int bc[mn][mn][mm]; int way[mn][mn][mn][3]; int cnt[3]; void init_a() { memset(a, -2, sizeof a); a[0][0] = 1; for (int k = 1; ...

#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; int arr[n]; for (int i = 0; i < n; i++) { cin >> arr[i]; } sort(arr, arr + n); int i; for (i = 0; i < n && arr[i] + k <= 5; i++) ; cout << (i) / 3; }

#include <bits/stdc++.h> using namespace std; bool isPrime(int n) { for (int i = 2; (i * i) <= n; i++) { if (n % i == 0) return 0; } return 1; } int nerPr(int n) { for (int i = n;; i++) { if (isPrime(i)) return i; } } int main() { ios_base::sync_with_stdio(false); cin...

#include <bits/stdc++.h> using namespace std; const long long linf = 4000000000000000000LL; const long long inf = 1000000007; const long double pi = 3.1415926535; void pv(vector<int> a) { for (auto& x : a) cout << x << ; cout << n ; } void pv(vector<long long> a) { for (auto& x : a) cout ...

#include <bits/stdc++.h> using namespace std; const int N = 6; const int M = 10010; const int K = 510; const int LIT = 2500; const int INF = 1 << 30; int n, m[N][N], tot, need; vector<int> v, vis; int row[N], col[N], dia1, dia2; int cr[N], cc[N], cd1, cd2; void init() { memset(m, 0, sizeof(m))...

#include <bits/stdc++.h> using namespace std; int n, m, x, y, ans; int p[100010], q[100010], mn[100010]; vector<int> t[100010], v[100010]; bool flag[100010]; inline int dist(int x, int y) { return abs(p[x] - q[y]); } int main() { scanf( %d%d%d%d , &n, &m, &x, &y); memset(mn, 63, sizeof(mn)); f...

#include <bits/stdc++.h> using namespace std; void reset(int& n, int first) { n = n & ~(1 << first); } bool check(int n, int first) { return (bool)(n & (1 << first)); } set<int> ax, ay; multiset<int> bx, by; set<int>::iterator l, r; int main() { int i, j, k, n, w, h; while (scanf( %d%d%d , &w, &h,...

#include <bits/stdc++.h> int main() { int a, b, c = 0, d, e, i; scanf( %d , &a); for (i = 1; i <= a; i++) { scanf( %d , &b); if (b == 1) { c++; } } if (c > 0) { printf( HARD n ); } else { printf( EASY n ); } return 0; }

#include <bits/stdc++.h> using namespace std; int mini[10], maxi[10], dist[10]; int main() { int n, i, total; scanf( %d , &n); total = 0; for (i = 0; i < 3; ++i) { scanf( %d %d , &mini[i], &maxi[i]); total += mini[i]; dist[i] = mini[i]; } i = 0; while (n - total > 0) ...

#include <bits/stdc++.h> using namespace std; const int M = 200002; int val[M]; vector<int> vec[33]; set<int> st; struct Nod { int v; int id; bool operator<(const Nod &cmp) const { if (v == cmp.v) return id < cmp.id; return v > cmp.v; } } p[M]; int n; void init() { for ...

#include <bits/stdc++.h> using namespace std; int n, m; int a[12][2001]; int dp[2][4096]; int sos[4096]; bool use[2001]; pair<int, int> b[2001]; void solve() { cin >> n >> m; for (int j = 1; j <= m; j++) b[j].first = 0; for (int i = 0; i < n; i++) { for (int j = 1; j <= m; j++) { ...

#include <bits/stdc++.h> using namespace std; int x, y, n; int xs[30], ys[30]; int mem[16777227]; int ALL; int dt[30][30]; int calc(int mask) { if (mask == ALL) return 0; int& res = mem[mask]; if (res != -1) return res; res = ((int)1e9); int f = -1; for (int i = 0; i < n; ++i) { ...

#include <bits/stdc++.h> using namespace std; void solve() { long long int n; cin >> n; string s; cin >> s; long long int mx[n], mn[n]; for (long long int i = 0; i < n; i++) { mx[i] = i + 1, mn[i] = n - i; } long long int j = 0; for (long long int i = 0; i < n - 1; i = j) {...

#include <bits/stdc++.h> using namespace std; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n, k; cin >> n >> k; vector<vector<pair<long long, long long>>> ans(k); long long gr = k, cnt = 0; bool f = false; vector<pair<pair<long long, long long>...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; int n; cin >> n; map<int, int> m; int ma = -1; int ans = 0; for (int i = 0; i < n; i++) { int x; cin >> x; if (m[x] > ma) { ma = m...

#include <bits/stdc++.h> using namespace std; int n, m; string s; string change(string s, int l, int r, char c1, char c2) { for (int i = l - 1; i < r; i++) { if (s[i] == c1) { s[i] = c2; } } return s; } int main() { cin >> n >> m; cin >> s; for (int i = 0; i < m; ...

// #pragma GCC optimize( Ofast,unroll-loops ) // #pragma GCC target( avx,avx2,fma ) #include <bits/stdc++.h> using namespace std; #define ll long long #define ull unsigned long long #define dd double #define ld long double #define sl(n) scanf( %lld , &n) #define si(n) scanf( %d , &n) #define s...

#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 10; int a[N], n, l, r, ans; bool check(int k) { for (int i = 1; i <= n; ++i) { if (1LL * k * (i - 1) > a[i]) return false; if (1LL * k * (n - i) > a[i]) return false; } return true; } int main() { scanf( %d , &n); ...

#include <bits/stdc++.h> using namespace std; const long long N = 1e5 + 5; long long v[N], mn[N]; int main() { long long n; long long ans = 0; cin >> n; for (long long i = 0; i < n; i++) cin >> v[i]; for (long long i = 0; i < n; i++) mn[i] = v[i] + 1; for (long long i = 1; i < n; i++) mn...

#include <bits/stdc++.h> using namespace std; const int P = 1e9 + 7; long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } long long qpow(long long a, long long n) { long long r = 1 % P; for (a %= P; n; a = a * a % P, n >>= 1) if (n & 1) r = r * a % P; return r; } long ...

#include <bits/stdc++.h> const long long int m = 1000000007; using namespace std; int main() { int tc; cin >> tc; while (tc--) { int x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2; if (x1 == x2 || y1 == y2) cout << abs(x1 - x2) + abs(y2 - y1) << n ; else cout << ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int n, q; cin >> n >> q; long long int arr[n]; long long int aftern[n]; long long int maxi[n]; for (long long int i = 0; i < n; i++) { cin >> arr[i]; if (...

#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; template <typename T> void chmin(T &a, T b) { if (a > b) a = b; } template <typename T> void chmax(T &a, T b) { if (a < b) a = b; } template <typename T> void add(T &a, T b) { a += b; if (a < 0) a += MOD; ...

#include <bits/stdc++.h> using namespace std; long long x[5003], a[5003], b[5003], c[5003], d[5003]; vector<int> path; long long weight[5003][5003]; long long edge(int i, int j) { long long ans = abs(x[i] - x[j]); if (j < i) ans += (c[i] + b[j]); if (i < j) ans += (d[i] + a[j]); return ans; ...

#include <bits/stdc++.h> using namespace std; template <typename T> inline T abs(T t) { return t < 0 ? -t : t; } const long long modn = 1000000007; inline long long mod(long long x) { return x % modn; } int main() { long long d1, d2, d3; cin >> d1 >> d2 >> d3; long long ans = min(d1 + d2 +...

#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > marks(200002); vector<pair<int, int> > marksbyy(200002); vector<vector<int> > partials(2005, vector<int>(2005)); vector<vector<int> > inpart(2005, vector<int>(2005)); int n; void fillpart() { sort(marks.begin() + 1, marks.begin() + ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 1000000; int a[300005], b[300005]; class SegmentTree { public: SegmentTree* left = nullptr; SegmentTree* right = nullptr; int start, end, val = 0, lazyadd = 0; SegmentTree(int s, int e) { start = s; end = e; if (...

#include <bits/stdc++.h> using namespace std; int n, m, x, len, dir, t, y; bool fin; pair<int, int> a[210000]; int loc[210000]; int binary_right(int x, int t) { int l = x, r = n, mid; while (l < r) { mid = (l + r + 1) / 2; if (a[mid].first <= t) l = mid; else r = mi...

#include <bits/stdc++.h> using namespace std; int n, k; int main() { while (scanf( %d%d , &n, &k) != EOF) { if (k > n || k > 26 || (n > 1 && k == 1)) printf( -1 n ); else { for (int i = 0; i < n - max(0, (k - 2)); i++) if (i % 2 == 0) printf( a ); el...

#include <bits/stdc++.h> using namespace std; int n; int a[5000006]; int S; void go(int lf, int rg) { if (lf < 0) return; S = max(S, (rg - lf) / 2); if (a[lf] == a[rg]) { for (int i = lf; i < rg; ++i) a[i] = a[lf]; } else { for (int i = lf, j = rg; i < j; ++i, --j) { a[i] =...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx ) #pragma GCC optimize( unroll-loops ) using namespace std; template <typename T1, typename T2> inline void chkmin(T1 &first, T2 second) { if (first > second) first = second; } template...

#include <bits/stdc++.h> using namespace std; int a[30]; int main() { int n, k, i, j, m; string s; cin >> s; cin >> k; map<char, int> mp; map<char, int>::iterator it; n = s.size(); for (i = 0; i < n; i++) { ++mp[s[i]]; } multimap<int, char> mp2; multimap<int, char...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 7; int n, m, q[N], a[N]; int main() { scanf( %d , &m); for (int i = (0); i < (m); ++i) scanf( %d , &q[i]); int mn = *min_element(q, q + m); scanf( %d , &n); for (int i = (0); i < (n); ++i) scanf( %d , &a[i]); sort(a, a + n...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { int n; cin >> n; if (n <= 30) { cout << NO n ; } else if (n == 36) { cout << YES n ; cout << 5 6 10 15 ...

#include <bits/stdc++.h> using namespace std; const int N = 1e6; int d[2 * N], c[2 * N], n, k, l, p, a = N, q, w, u; string s; int main() { cin >> n >> k >> l >> s; q = 0; w = N; while (q < w) { p = (q + w) >> 1; for (int i = n - 1; i >= 0; i--) { d[i] = d[i + 1] + (s[i] > ...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { unsigned long long a, b; cin >> a >> b; if (max(a, b) % min(a, b)) { cout << -1 << endl; continue; } int dem = 0; long long p = max(a, b) / min(a, b); while...

#include <bits/stdc++.h> using namespace std; const int maxn = (int)5e5 + 9; const int maxm = (int)1e6 + 9; const long long mod = (long long)1e9 + 7; const double pi = acos(-1); const double eps = 1e-15; vector<pair<int, int> > to[maxn]; int fa[maxn]; int tobig[maxn]; int n, m; int e[maxn]; int ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 100100; int N, M; vector<int> conn[MAXN]; bool adj[10][10]; bool vis[MAXN]; int deg[10]; int ar[MAXN]; int pa[10]; int pb[10]; int numed; void prec() { for (int j = 0; j < numed; ++j) { int a = 2, b = 1; for (int k = ...

#include <bits/stdc++.h> using namespace std; int n, q; int tim[10000]; int main() { while (~scanf( %d%d , &n, &q)) { memset(tim, -1, sizeof(tim)); while (q--) { int ti, ni, di; scanf( %d%d%d , &ti, &ni, &di); int cnt = 0; for (int i = 1; i <= n; i++) { ...

#include <bits/stdc++.h> using namespace std; const int N = 2000500; int P[N]; int D[N]; multiset<int> S[N]; inline bool recalc(int x) { if (x == 1) { D[x] = *S[x].rbegin() + 1; return false; } else { int nd; if (S[x].size() == 1) nd = *S[x].rbegin(); else ...

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

#include <bits/stdc++.h> using namespace std; int n, k, ans; int a[500101], b[500101], fl[500101]; int q[500101], qn; void solve() { scanf( %d%d , &n, &k); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); for (int i = 1; i <= k; i++) { scanf( %d , &b[i]); fl[b[i]] = 1; } int fl...

#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 100; int p[N]; vector<int> G[N]; int mn[N], mx[N], val[N], sum[N], s[N][2], c[N][2], fa[N], mp[N]; int head; void upd(int x) { sum[x] = sum[c[x][1]] + sum[c[x][0]] + val[x]; mn[x] = min(mn[c[x][0]], min(sum[c[x][0]] ...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 6; int n, m; int a[200]; bool check() { if (*max_element(a, a + n) != 0) { return false; } return true; } void solve() { int k; cin >> n >> k; for (int i = 0; i < n; i++) { cin >> a[i]; } if (k...

#include <bits/stdc++.h> using namespace std; long long n, k, mod = 1000000007, dp[2010][2010]; long long solve(long long num, long long x) { long long i; if (x == k) return 1; if (dp[num][x] != -1) return dp[num][x]; long long res = 0; for (i = 1; (i * num) <= n; i++) { res += solve(num...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n, k, h = 0; cin >> n >> k; vector<int> v; for (int i = 0; i < n; i++) v.push_back(i); for (int ki = 1; ki <= k; ki++) { int x; cin >> x; x = x - (x / (n)) * (n)...

#include <bits/stdc++.h> using namespace std; using ll = long long int; using ull = unsigned long long int; using ld = long double; using pii = pair<int, int>; using pll = pair<ll, ll>; const int INT_INF = (int)(2e9); const ll LL_INF = (ll)(2e18); const int NIL = -1; static mt19937 _g(time(nullptr))...

#include <bits/stdc++.h> using namespace std; long long int n, m, k, s = 0, sx, sy, num; char grid[600][600]; bool vis[600][600]; long long int dx[4] = {0, 0, -1, 1}; long long int dy[4] = {-1, 1, 0, 0}; bool check(long long int x, long long int y) { if (x >= 0 && x < n && y >= 0 && y < m && grid[x][y...

#include <bits/stdc++.h> using namespace std; const int N = 505; unordered_set<int> dp[N]; int main() { int n, k; scanf( %d%d , &n, &k); dp[0].insert(0); for (int i = 0; i < n; ++i) { int c; scanf( %d , &c); for (int j = k; j >= c; --j) { for (int l : dp[j - c]) dp[j].i...

#include <bits/stdc++.h> using namespace std; const long double eps = 1e-10; struct Tpoint { long double x, y; void input() { double _x, _y; scanf( %lf%lf , &_x, &_y); x = _x; y = _y; } } C, H, S; double t1, t2; long double T1, T2; long double ret; long double Fabs(lo...

#include <bits/stdc++.h> using ul = std::uint32_t; using ull = std::uint64_t; using li = std::int32_t; using ll = std::int64_t; using vull = std::vector<ull>; using vul = std::vector<ul>; const ul sz = 1 << 18; const ul base = 1e9 + 7; class scaler { public: ul v = 0; scaler() = default; ...

#include <bits/stdc++.h> using namespace std; int gcd(int x, int y) { while (x > 0 && y > 0) { if (x > y) { x %= y; } else { y %= x; } } return x + y; } int main() { int n, k; cin >> n >> k; vector<int> a(n + 1); vector<bool> used(n + 1); for (in...

#include <bits/stdc++.h> using namespace std; long long dp[205][6003], dp1[205][6003]; int main() { long long n, k; cin >> n >> k; long long tmp; for (int i = 0; i <= k; i++) { for (int j = 0; j <= 6000; j++) { dp1[i][j] = -2e9; } } dp1[0][0] = 0; for (int i = 0; i ...

#include <bits/stdc++.h> using namespace std; const int N = 2e3 + 10; char s[N], t[N]; int n; vector<int> G; void shift(int x) { if (x == 0) return; reverse(s, s + n); reverse(s + x, s + n); G.push_back(x); } int main() { scanf( %d%s%s , &n, s, t); for (int i = 0; i < n; i++) { ...

#include <bits/stdc++.h> using namespace std; long long n, l; string s, s1, s2; int main() { cin >> n; getline(cin, s); while (n--) { getline(cin, s); s1 = ; s2 = ; l = s.length(); for (int i = 0; i <= 4; i++) s1 += s[i]; for (int i = l - 5; i < l; i++) s2 += ...

#include <bits/stdc++.h> using namespace std; int n, nmax, nrpar, nrimpar, par, impar, i, sol; int luat[200005]; struct el { int val, poz; } a[200005]; bool rearanjare(el x, el y) { if (x.poz < y.poz) return 1; else return 0; } bool comp(el x, el y) { if (x.val < y.val) ...

#include <bits/stdc++.h> using namespace std; int main() { long long t; cin >> t; while (t--) { long long n; cin >> n; string s, t; cin >> s >> t; long long w = 0; char s1, t1, s2, t2; int q = 0; for (long long i = 0; i < n; i++) { if (s[i] != t[i]...

#include <bits/stdc++.h> int main() { int a; scanf( %d , &a); int m[a]; int p = 1, i; for (i = 0; i < a; i++) { scanf( %d , &m[i]); if (i > 0) { if (m[i] != m[i - 1]) { p++; } } } printf( %d , p); }

#include <bits/stdc++.h> using namespace std; namespace variables { struct triple { long long first, second, third; }; } // namespace variables using namespace variables; void testt(); namespace andu2006 { void debug(set<long long> _var, string _name = ) { cerr << Debug #set << _name << ...

#include <bits/stdc++.h> using namespace std; int s[101][101]; int main() { int n, a, r; cin >> n; a = 100; while (a * (a - 1) * (a - 2) / 6 > n) a--; n -= a * (a - 1) * (a - 2) / 6; r = a; for (int i = 1; i < a; i++) for (int j = i + 1; j <= a; j++) s[i][j] = s[j][i] = 1; fo...

#include <bits/stdc++.h> using namespace std; long long power(long long a, long long b, long long mod) { if (b == 0) return 1; long long val = power(a, b >> 1, mod); long long ans = ((val % mod) * (val % mod)) % mod; if (b % 2 != 0) ans = ((ans % mod) * (a % mod)) % mod; return ans; } int m[...

#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int dx[8] = {1, -1, 0, 0, -1, -1, 1, 1}; int dy[8] = {0, 0, -1, 1, -1, 1, -1, 1}; vector<int> adj[300010], val(300010, 1), vis(300010, 0), dis1(300010, 0), dis2(300010, 0); int myrandom(i...

#include <bits/stdc++.h> int main() { char a[200]; int n; bool plat[200]; scanf( %d , &n); scanf( %s , a); for (int i = 0; i < n; i++) { if (a[i] == * ) plat[i] = true; else plat[i] = false; } bool ans = false; for (int i = 0; i < n; i++) { if (!p...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, p; cin >> n >> p; vector<int> a(n); for (auto &i : a) cin >> i; int m = *max_element((a).begin(), (a).end()); vector<int> freq(m + n + 10); for (int i = 0;...

#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 5; template <class T> void read(vector<T> &arr) { for (auto &x : arr) cin >> x; } template <class T> void read(T &x) { cin >> x; } template <class T> void write(vector<T> &arr) { for (auto x : arr) cout << x << ...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); int t; cin >> t; while (t--) { long long n, m; cin >> n >> m; vector<string> ar(11); for (int i = 0; i < n; i++) { cin >> ar[i]; } st...

#include <bits/stdc++.h> using namespace std; int main() { long long int n, i; cin >> n; string s; cin >> s; map<char, long long int> a; if (n > 26) { cout << -1 << endl; return 0; } long long int ans = 0; for (i = 0; i < n; i++) { if (a[s[i]] >= 1) ans++; ...

#include <bits/stdc++.h> using namespace std; long long max(long long a, long long b) { if (a > b) { return a; } else { return b; } } long long min(long long a, long long b) { if (a < b) { return a; } else { return b; } } struct P { double x, y; P() {}...

#include <bits/stdc++.h> using namespace std; void canhazfast() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); } template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; } template <typename T> T extgcd(T a, T b, T &x, T &y) { T x0 = 1, y0 = 0, ...

#include <bits/stdc++.h> #include<string> #define M 10000000000007 using namespace std; typedef long long int ll; int gcd(int a,int b) { if (a == 0) return b; return gcd(b % a, a); } int modpow(int x,int n) { int result=1; while(n>0) { if(n % 2 ==1) ...

#include <bits/stdc++.h> using namespace std; int main() { int n, cnt = 0, x, i; scanf( %d , &n); while (n--) { scanf( %d , &x); if (x == 1) cnt++; } if (cnt) cout << -1 << endl; else cout << 1 << endl; return 0; }

#include <bits/stdc++.h> int main() { double k, b, n, t; double bacteria = 1; double time = 0; scanf( %lf %lf %lf %lf , &k, &b, &n, &t); while (bacteria <= t) { bacteria = (k * bacteria + b); if (bacteria > t) { break; } else if (bacteria == t) { time++; b...

#include <bits/stdc++.h> const static long long INF = 0x3f3f3f3f; static inline void setio(void); long long dp[5002][5002]; int main(void) { setio(); memset(dp, 0, sizeof(dp)); long long n, m; std::cin >> n >> m; std::string s; for (long long i = 0; i < n; ++i) { std::cin >> s; ...

#include <bits/stdc++.h> using namespace std; using ll = long long int; using ull = unsigned long long int; using ld = long double; using pii = pair<int, int>; using pll = pair<ll, ll>; const int INT_INF = (int)(2e9); const ll LL_INF = (ll)(2e18); const ll mod = 1e9 + 7; const int NIL = -1; static...

#include <bits/stdc++.h> const double eps = (1e-10); using namespace std; int dcmp(double a, double b) { return fabs(a - b) <= eps ? 0 : (a > b) ? 1 : -1; } int getBit(int num, int idx) { return ((num >> idx) & 1) == 1; } int setBit1(int num, int idx) { return num | (1 << idx); } int setBit0(int num, ...

#include <bits/stdc++.h> using namespace std; void fastio() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); } void one(); int main() { fastio(); int t = 1; for (int i = 0; i < t; ++i) { one(); } return 0; } void one() { long long n; cin >> n; long ...

#include <bits/stdc++.h> using namespace std; const long long INF = 1e9 + 7; const long long N = 1e6 + 10; char s[N]; long long a[N]; long long n, k; int main() { long long i, len, j; long long tmp, flag, len_q = 0; scanf( %lld%lld , &n, &k); n++; for (i = 1; i <= n; i++) { scanf...

#include <bits/stdc++.h> using namespace std; template <class T> T CMP_MIN(T a, T b) { return a < b; } template <class T> T CMP_MAX(T a, T b) { return a > b; } template <class T> T MAX(T a, T b) { return a > b ? a : b; } template <class T> T MIN(T a, T b) { return a < b ? a : b; ...

#include <bits/stdc++.h> using namespace std; int main() { int n; int xs[200000], ys[200000]; cin >> n; for (int i = 0; i < n; i++) { cin >> xs[i] >> ys[i]; } map<int, int> vert, hor; for (int i = 0; i < n; i++) { int x, y; x = xs[i]; y = ys[i]; int v = x - ...

#include <bits/stdc++.h> int main() { long long int n, m, i, c = 0; scanf( %lld %lld , &n, &m); long long int a[m]; for (i = 0; i < m; i++) { scanf( %lld , &a[i]); } for (i = 0; i < m - 1; i++) { if (a[i + 1] > a[i]) { c = c + a[i + 1] - a[i]; } else if (a[i] == a[i +...

#include <bits/stdc++.h> using namespace std; map<char, char> a; int main() { string s1, s2; cin >> s1 >> s2; int dl = s1.size(); int k = 0; for (int i = 0; i < dl; i++) { char p1 = s1[i]; char p2 = s2[i]; map<char, char>::iterator it = a.find(p1); if (it == a.end()) { ...