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

func_code_string stringlengths 59 71.4k
#include <bits/stdc++.h> const int MOD = 1000000007; const int MAX = 10000005; using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(0); long long n; cin >> n; long long b, d; long long max = -1; long long y = 0; vector<pair<long long, lo...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; const long long N = 2e5 + 10, alp = 26; const long double pi = 3.14159265358979; void solve() { long long n, m; cin >> n >> m; vector<vector<long long> > g1(n), rg1(n), g2(n), rg2(n); for (long long i = 0; i < m; ++i) ...
#include <bits/stdc++.h> using namespace std; const long long mod = 998244353; const int maxn = 212345; int n, a[maxn], f[maxn], pre[maxn]; vector<int> b; int F(int x) { return x == f[x] ? x : f[x] = F(f[x]); } inline void U(int a, int b) { f[min(F(a), F(b))] = max(F(a), F(b)); } inline void go(int l, i...
#include <bits/stdc++.h> using namespace std; int n, y, a[(int)1e5 + 4]; unsigned long long x, sum; void error() { puts( -1 ); exit(0); } int main() { scanf( %d%I64d%d , &n, &x, &y); sum = (unsigned long long)n; if (n > y \|\| (n == y && sum < x)) error(); for (int i = 0; i < n; i++) a...
#include <bits/stdc++.h> using namespace std; long long counter; long long n, r, l, x; vector<long long> a; long long sum, rr; bool cheake(long long mask) { long long nmax = -1; long long nmin = 10000000000; long long i = 0; rr = 0; sum = 0; while ((mask >> i) != 0) { if ((mask...
#include<iostream> #include<cstdio> #include<cstring> #include<cmath> #include<algorithm> #include<vector> #include<stack> #include<queue> #include<set> #include<map> //#include<bits/stdc++.h> using namespace std; typedef long long ll; const int maxn = 1e5+5; const int inf = 0x3f3f3f3f; co...
#include <bits/stdc++.h> using namespace std; int n, p, s; vector<int> v1, v2; pair<int, pair<int, int>> arr[3005]; bool cmp(pair<int, pair<int, int>> a, pair<int, pair<int, int>> b) { if (a.second.first == b.second.first) return a.second.second < b.second.second; return a.second.first > b.secon...
#include <bits/stdc++.h> using namespace std; const int maxN = (int)1e5 + 100; const int MAX = (int)1e5 + 1; int l[maxN], d[maxN], cnt[maxN], q[maxN]; vector<int> pool[maxN]; multiset<int> p; void solveTask() { int n; cin >> n; for (int i = 1; i <= n; ++i) cin >> l[i]; for (int i = 1; i <=...
#include <bits/stdc++.h> using namespace std; long long get(long long n) { for (long long i = 2; i * i <= n; ++i) if (n % i == 0) return i; return n; } int main() { long long n; scanf( %lld , &n); long long cnt = 0; if (n % 2 != 0) { n -= get(n); ++cnt; } printf...
#include <bits/stdc++.h> using namespace std; int main() { int n, i, x, m = 0; char a[1000]; int s[26]; cin >> n; while (n--) { cin >> a; m = 0; int mi = 1000, mx = -1; for (i = 0; i < 26; i++) { s[i] = 0; } x = strlen(a); for (i = 0; i < x; i++)...
#include <bits/stdc++.h> using namespace std; long long int ar[500009], br[500009]; int main() { long long int a, b, c, i, j = 0, k = 9999999999999; string s; cin >> a; getchar(); cin >> s; for (i = 0; i < a; i++) { cin >> ar[i]; } for (i = 0; i < a - 1; i++) { if (s[i]...
#include <bits/stdc++.h> #pragma diag_suppress 177 using namespace std; const int MM = 220000; int m, n, k, p1, p2, p3, f, a[MM], pr[MM], af[MM], tree[4 * MM]; string s, s1, s2; int MINN = 0; int func(int aa, int bb) { return (aa \| bb); } void build(int node, int start, int end) { if (start == end) ...
#include <bits/stdc++.h> using namespace std; const int N = 3e5; const int INF = 1e9 + 9; const int B = 1e9 + 7; long long n; int main() { ios_base ::sync_with_stdio(0); cin.tie(0); cin >> n; long long pwr = 1; for (;;) { long long x = (n + (pwr - 1)) / pwr; if (n % pwr != 0)...
#include <bits/stdc++.h> using namespace std; int main() { long long t; cin >> t; while (t--) { int n; long long a = 0, b; cin >> n; b = pow(2, n); for (int i = 1; i < n / 2; i++) b += pow(2, i); for (int i = n / 2; i < n; i++) a += pow(2, i); cout << abs(b - a)...
#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { if (a == 0) return b; if (b == 0) return a; if (a == b) return a; if (a > b) return gcd(a - b, b); return gcd(a, b - a); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t = 1; while (t--...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; int i, arr[n]; for (i = 0; i < n; i++) cin >> arr[i]; int ap{0}, bp{n}, asize{arr[0]}, bsize{}, moves{1}, left = n - 1; bool a = 1; while (left != 0) { ...
#include <bits/stdc++.h> using namespace std; using ll = long long int; ll hell = 998244353; int main() { ll n; cin >> n; vector<ll> v[n]; for (ll i = 0; i < n; ++i) { ll x; cin >> x; for (ll j = 0; j < x; ++j) { ll y; cin >> y; v[i].push_back(y); ...
#include <bits/stdc++.h> using namespace std; template <typename T> void read(T &x) { x = 0; bool f = 0; char c = getchar(); for (; !isdigit(c); c = getchar()) if (c == - ) f = 1; for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48); if (f) x = -x; } template <typename F> i...
#include <bits/stdc++.h> using namespace std; int main() { int n, a, ns[10005] = {}; cin >> n; for (int i = 0; i < n; i++) { cin >> a; ns[a]++; } int ans = 0; for (int i = 0; i < 10000; i++) { int j = i + 1; while (ns[i] > 1) { for (; j < 10000 && ns[j] != 0; ...
#include <bits/stdc++.h> using namespace std; int main() { string c = ; string t = ; cin >> t >> c; char lt = t[0]; int nt = int(t[1]) - 48; char lc = c[0]; int nc = int(c[1]) - 48; int cnt = 16; vector<pair<char, int> > torre; vector<pair<char, int> > caballo; for (i...
#include <bits/stdc++.h> using namespace std; inline int read(int f = 1, int x = 0, char ch = ) { while (!isdigit(ch = getchar())) if (ch == - ) f = -1; while (isdigit(ch)) x = x * 10 + ch - 0 , ch = getchar(); return f * x; } const int N = 1e5 + 5, oo = 1e9 + 7; int n, m, a[N], ans[N],...
#include <bits/stdc++.h> using namespace std; void solve() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; int n, k; cin >> n >> k; string second; cin >> second; if (k > 2) { int c = 0; for (int i = 1; i < n; i++) { if (second[i] == second[i - 1]) { ...
#include <bits/stdc++.h> using namespace std; struct Event { int type; int p; int x; }; int main() { ios_base::sync_with_stdio(0); int n; cin >> n; vector<int> v(n); for (auto& el : v) { cin >> el; } int q; cin >> q; vector<Event> evs(q); for (auto& ev :...
#include <bits/stdc++.h> using namespace std; typedef int ll; const ll MAX = 5e5 + 100; const ll inf = 1e9; const ll mod = 1e9 + 7; bool go[MAX]; ll p[MAX], dsu[MAX], n, m; pair<ll, ll> e[MAX]; vector<pair<ll, ll> > Querie; ll ans[MAX]; ll vertex; vector<ll> adj[MAX]; vector<ll> querys_on_grap...
#include <bits/stdc++.h> using namespace std; int main() { int n; vector<int> one; vector<int> two; cin >> n; for (int i = 0; i < n; i++) { int t, w; cin >> t >> w; if (t == 1) one.push_back(w); else two.push_back(w); } sort(one.begin(), one.end())...
#include <bits/stdc++.h> using namespace std; long long Mypow(long long X, long long Y) { if (Y < 0) return 0; if (Y == 0) return 1; if (Y == 1) { return X; } else { long long x = Mypow(X, Y / 2); x = x; if (Y % 2) return (x X); else return x; } ...
#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007, dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; const double eps = 1e-8; void read(int &k) { k = 0; char x = getchar(); while (x < 0 \|\| x > 9 ) x = getchar(); while (x >= 0 && x <= 9 ) { k = k * 10 - 48 + x; ...
#include <bits/stdc++.h> using namespace std; int main() { int n, a, b, dist1, dist2, i, blank; string s, t; for (i = 0; i < 300; i++) cout << a ; cout << endl; cin >> dist1; if (dist1 == 0) return 0; for (i = 0; i < 300; i++) cout << b ; cout << endl; cin >> dist2; if (dis...
#include <bits/stdc++.h> using namespace std; struct tp { int l, r; }; int n; vector<tp> t; bool comp(tp a, tp b) { return a.l < b.l or a.l == b.l and a.r < b.r; } int main() { cout.sync_with_stdio(false); cin >> n; for (int i = 1; i <= n; i++) { int l, r; cin >> l >> r; ...
#include <bits/stdc++.h> using namespace std; const int MAX = 140000; int sx[MAX + 10], ex[MAX], sy[MAX + 10], ey[MAX]; int main() { int n; scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d %d %d %d , &sx[i], &sy[i], &ex[i], &ey[i]); vector<pair<int, int> > px, py; for (int i = 0;...
#include <bits/stdc++.h> using namespace std; const int N = 13 * 16, M = 1e9 + 7; int n, m, k; struct zz { int a[N][N]; } A; inline zz cf(zz x, zz y) { zz z; memset(z.a, 0, sizeof z.a); for (int i = 0; i < (1 << m) * (k + 1); i++) for (int j = 0; j < (1 << m) * (k + 1); j++) fo...
#include <bits/stdc++.h> using namespace std; set<int> b[127]; set<int>::iterator it, itt; int n, m, l, r, c[200005]; char s, ch[2], a[200005]; void upd(int v, int d) { while (v <= n) { c[v] += d; v += v & -v; } } int find(int x) { int cur = 0, ans = 0; for (int i = 20; i >= ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1 << 17; const int INF = 7 << 28; struct T { int maxa, minr; T() : maxa(0), minr(INF) {} T(int a, int b) : maxa(a), minr(b) {} T operator+(T t) const { return T(max(maxa, t.maxa), min(minr, t.minr)); } }; T a[MAXN * 2]; int del...
#include <bits/stdc++.h> using namespace std; int main() { int q; cin >> q; for (int i = 0; i < q; ++i) { long long n; cin >> n; int a = 0; int b = 0; int c = 0; while (n % 2 == 0) { n /= 2; ++a; } while (n % 3 == 0) { n /= 3; ...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; int n, cnt, Max, head[N]; struct Edge { int to, nxt, val; } e[N << 1]; int read() { int x = 0, flg = 1; char c = getchar(); for (; !isdigit(c); c = getchar()) if (c == - ) flg = -1; for (; isdigit(c); c = getchar...
#include <bits/stdc++.h> using namespace std; void solve() { int n; std::cin >> n; std::vector<int> v(101); for (int i = 0; i < n; ++i) { int temp; std::cin >> temp; v[temp]++; } int mex_A = -1; int mex_B = -1; bool flag1 = 1; for (int i = 0; i < n; ++i) { ...
#include <bits/stdc++.h> using namespace std; struct compare { bool operator()(const pair<int, int>& a, const pair<int, int>& b) { return true; } }; int main() { cin.tie(0); ios_base::sync_with_stdio(0); int t; cin >> t; while (t--) { int n, x, y; cin >> n >> x >> y...
#include <bits/stdc++.h> #pragma warning(disable : 4996) using namespace std; const int p = 257; const long long mods = 1610612741; const int maxn = 200010; long long hash1[maxn][2]; int cntzero[maxn]; char s[maxn]; int N; long long pp[maxn]; void gethash(char s[]) { hash1[0][0] = 0; hash1...
#include <bits/stdc++.h> using namespace std; int binary_search(vector<int> a, int korol) { if (a[a.size() - 1] < korol) return a.size() - 1; if (a[0] > korol) return -1; int max = a.size() - 1, min = 0, mid; if (min + max >= 0) mid = (int)((min + max) / 2); else mid = (int)((min + m...
#include <bits/stdc++.h> using namespace std; inline void boost() { ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0); } const long long maxn = 1e5 + 123; const long long inf = 1e9 + 123; const long long mod = 1e9 + 7; const double infm = 1e-9; const double pi = acos(-1); map<char, int>...
#include <bits/stdc++.h> using namespace std; inline void readInt(int &num) { num = 0; int c = getchar(); int s = 1; if (c == - ) { s = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { num = num * 10 + (c - 0 ); c = getchar(); } num *= s; } inline voi...
#include <bits/stdc++.h> using namespace std; int fa[100020], sz[100020]; vector<int> g[100020]; int n, m, q; int find(int x) { if (fa[x] != x) fa[x] = find(fa[x]); return fa[x]; } int dp[100020][3], G[100020], mx[100020]; vector<int> d[100020]; vector<long long> sum[100020]; bool cmp(int i,...
#include <bits/stdc++.h> using namespace std; int l[1000000]; int one_line[5001][5001] = {0}; int summ[5001][5001] = {0}; int fac[5001]; int main() { int n, m, p; scanf( %d %d %d , &n, &m, &p); for (int i = 0; i < n; i++) scanf( %d , &l[i]); fac[0] = 1; for (int i = 1; i <= 5000; i++) fa...
#include <bits/stdc++.h> const int N = (1 << 19) - 1; using namespace std; int n; double dp[N + 1], a[20][20]; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) scanf( %lf , &a[i][j]); } dp[(1 << n) - 1] = 1; for (int s = ((1 << n) - 1); s > 0; s...
#include <bits/stdc++.h> using namespace std; long long int pwr(long long int base, long long int p) { long long int ans = 1; while (p) { if (p & 1) ans = (ans * base) % 1000000007; base = (base * base) % 1000000007; p /= 2; } return ans; } long long int gcd(long long int a, lo...
#include <bits/stdc++.h> using namespace std; int N; vector<pair<int, int> > v; vector<int> query; int ans; struct SEG { SEG(int l, int r, int sum) : l(l), r(r), sum(sum) {} int l, r; int sum; }; vector<SEG> seg; void init(int idx, int s, int e) { if (s == e) return; seg[idx].l = s...
#include <bits/stdc++.h> const int MAX_LEN = 1010; using namespace std; template <typename U, typename V> string to_string(pair<U, V>); string to_string(const string& e_) { return + e_ + ; } string to_string(char e_) { return + string(1, e_) + ; } string to_string(bool e_) { return e_ ? t...
#include <bits/stdc++.h> using namespace std; int main() { int r, c; char s[15][15]; int cake = 0; int row = 0; scanf( %d %d , &r, &c); for (int i = 1; i <= r; i++) { scanf( %s , s[i]); } for (int i = 1; i <= r; i++) { for (int j = 0; j < c; j++) { if (s[i][j] == ...
#include <bits/stdc++.h> using namespace std; using ll = long long; char str[105]; ll best[105]; ll memo[105][105][105]; ll dp(int l, int r, int p) { if (l >= r) return 0; if (memo[l][r][p] != -1) return memo[l][r][p]; int ptr = l; while (ptr < r && str[ptr] == str[l]) ptr++; ll ret = be...
#include <bits/stdc++.h> using namespace std; double eps = 1e-9; const int INF = 1e9 + 7; const int MAXN = int(3e5 + 7); vector<pair<int, int> > v[MAXN]; int n, p, a[MAXN]; long long ans[MAXN], dp[MAXN]; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , a + i); scanf( %d...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 16; string s; long long string_int(string s) { long long num = 0; for (int i = 0; i < s.size(); i++) { num += s[i] - 0 ; num *= 10; } return num / 10; } int main() { ios_base::sync_with_stdio(false); ci...
#include <bits/stdc++.h> using namespace std; int main() { int n, m; while (cin >> n) { vector<int> v; int x; for (int i = 0; i < n; i++) { cin >> x; v.push_back(x); } bool in = false; int cnt = 0; bool f = true; bool s = false, l = false; ...
#include <bits/stdc++.h> using namespace std; int a[300005]; int rev[300005]; int b[300005]; int main() { int n, m; long long ans = 0; scanf( %d %d , &n, &m); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); rev[a[i]] = i; } for (int i = 0; i < m; i++) { int x, y; ...
#include <bits/stdc++.h> using namespace std; const int N = 505, mod = 1e9 + 7; int n, m, e[N][N], f[N][N], g[N][N]; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n; for (int i = (1); i <= (n); i++) for (int j = (1); j <= (n); j++) cin >> e[i][j]; for (i...
#include <bits/stdc++.h> using namespace std; const int MAXN = 100010; const int MAXM = 100010; const int INF = 1000000000; int dist[MAXN], dp[MAXN]; pair<int, int> par[MAXN]; bool marked[MAXM]; vector<pair<int, int> > edges[MAXN]; queue<int> q; vector<pair<int, int> > v; int x[MAXM], y[MAXM], z[M...
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long inf = 0x3f3f3f3f3f3f3f3f; const long long mod = 998244353; const int N = 2e5 + 10; mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count()); int n; int z[100][2]; int qry(int i, int j) { cout << ...
#include <bits/stdc++.h> using namespace std; int n, T; double dp[5001][5001]; int p[5001], t[5001]; double quickpow(double x, int y) { double res = 1; while (y) { if (y & 1) res = x; x = x; y >>= 1; } return res; } int main() { cin >> n >> T; dp[0][0] = 1; ...
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 2; int n, l; long long a[N], f[N]; int main() { scanf( %d %d , &n, &l); for (int i = 1; i < n; ++i) scanf( %lld , &a[i]), a[i] += a[i - 1]; long long ans = LLONG_MAX; for (int i = l; i < n; ++i) ans = min(ans, a[i] - a[i - l]); ...
#include <bits/stdc++.h> using namespace std; long long n, i, j, ans = 0; long long a, b; const long long M = (long long)1E9 + 7; long long power(long long x, long long y) { long long res = 1; x %= M; while (y) { if (y % 2) res = (res * x) % M; y = y >> 1; x = (x * x) % M; } ...
#include <bits/stdc++.h> using namespace std; int a[100005]; map<long long, int> ma; int main() { long long b1, q, m, l; cin >> b1 >> q >> l >> m; while (m--) { long long x; cin >> x; ma[x] = 1; } int ans = 0, i; for (i = 1; i < 100; i++) { if (abs(b1) > l) break;...
#include <bits/stdc++.h> using namespace std; int main() { int nuts, divis, maxsec, capacity, boxees = 0; cin >> maxsec >> nuts >> divis >> capacity; while (nuts > 0) { boxees++; nuts -= ((min(maxsec, divis + 1)) * capacity); divis -= ((min(maxsec, divis + 1)) - 1); } cout << b...
#include <bits/stdc++.h> using namespace std; int n, m; int vis[100010], h[100100]; vector<int> res; set<int> q, off; int a[100100]; char s[100010][2]; int main() { int i, j, z, T, d; while (cin >> n >> m) { q.clear(); res.clear(); off.clear(); memset(vis, 0, sizeof(vis))...
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 5; long long fac[N], infac[N]; int n, m; long long poww(long long b, long long p) { if (p == 0) return 1; if (p & 1) return (b * poww(b, p - 1)) % m; return poww((b * b) % m, p / 2); } long long npk(int n, int k) { return (fac[n...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); int result; string input; cin >> input; set<string> sinput; sinput.insert(input); for (int i = input.size() - 1; i >= 0; --i) { input = input[input.size() - 1] + input; input.pop_back...
#include <bits/stdc++.h> using namespace std; const int N = 100100; long long n, m, A, cf, cm, maxForce = -1, minSkill, minIdx, i, a[N], b[N]; pair<long long, int> sum[N]; inline long long query(long long money, int limit) { long long l = sum[1].first, r = A, mid; if (limit <= 1) { return A; ...
#include <bits/stdc++.h> #define dumb ios_base::sync_with_stdio(false);cin.tie(NULL); typedef long long ll; using namespace std; #define modulo 1000000007; bool isprime(long long n) { for(long long int i=2;i*i<=n;i++) { if(n%i==0) return 0; ...
#include <bits/stdc++.h> using namespace std; template <typename T, size_t N> void PRINT_ARRAY(const T (&a)[N], int n = -1) { if (!n) n = N; for (int i = 0; i < n; i++) cout << a[i] << ; cout << n ; } template <typename T, size_t N, size_t M> void PRINT_ARRAY(const T (&a)[N][M], int n, int ...
#include <bits/stdc++.h> using namespace std; int N, M; bitset<2020> mat[2020]; int main() { int T; scanf( %d , &T); while (T--) { scanf( %d%d , &N, &M); vector<pair<int, int> > E; int deg[2020] = {}; for (int i = 1; i <= M; i++) { int x, y; scanf( %d%d , &x, ...
#include <bits/stdc++.h> using namespace std; const int INF = 1000000007; const long long MOD = 1000000007; void solve_test() { int n; cin >> n; vector<int> arr(n); vector<int> ct(101); for (int i = 0; i < n; i++) { cin >> arr[i]; ct[arr[i]]++; } int max_val = -1; int...
#include <bits/stdc++.h> using namespace std; int N, T; char str[15], temp[15]; int main() { int i, j, k; scanf( %s%s , str, temp); i = strlen(str); sort(str, str + i); if (str[0] == 0 ) { do { if (str[0] != 0 ) break; } while (next_permutation(str, str + i)); } ...
#include <bits/stdc++.h> using namespace std; void init() {} const int N = (int)1e6 + 34; const long long INF = (long long)1e9 + 34; int n, m; int a[555][555]; int c[555], r[555]; int main() { init(); int mxr = -N, mnr = N, mxc = -N, mnc = N; cin >> n >> m; int sum = 0; for (int i = ...
#include <bits/stdc++.h> using namespace std; int main() { int n, m, v; scanf( %d%d%d , &n, &m, &v); int spec = 1; if (m < n - 1 \|\| m > (n - 1) * (n - 2) / 2 + 1) { printf( -1 n ); return 0; } if (spec == v) spec++; printf( %d %d n , v, spec); m--; for (int i = 1; i <...
#include <bits/stdc++.h> using namespace std; string str[1005]; int tim[1005][1005]; int n, m, t; int fx[] = {-1, +1, 0, 0}; int fy[] = {0, 0, -1, +1}; vector<pair<int, int> > cur; bool okay(int x, int y) { return (x >= 0 && x < n && y >= 0 && y < m); } void dfs(int x, int y, int curr) { tim[x][y]...
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const int maxn = 100005; int a[3], d; void Solve() { cin >> a[0] >> a[1] >> a[2] >> d; sort(a, a + 3); long long res = 0; if (a[2] < a[1] + d) res += a[1] + d - a[2]; if (a[0] > a[1] - d) res += a[0] - a[1] + d; cou...
#include <bits/stdc++.h> struct circle { double r, x, y; circle(void) : r(0), x(0), y(0) {} bool contains(const circle& o) const { double dx, dy; dx = o.x - x; dy = o.y - y; return (dx * dx + dy * dy <= r * r) && o.r < r; } }; circle fences[1024]; circle control[1024]; ...
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; int logb(int base, int x) { return (log(x) / log(base)); } int occurs(vector<long long> v, int n) { auto it = lower_bound(((v)).begin(), ((v)).end(), (n)); auto it1 = upper_bound(((v)).begin(), ((v)).end(), (n)); int x = it...
#include <bits/stdc++.h> using namespace std; int n, V, A[64], B[64]; bool canCook(double x) { double tot = 0.0; for (int i = 0; i < n; i++) if (A[i] * x > B[i]) return 0; else tot += A[i] * x; return tot <= V; } double totalAmount(double x) { double tot = 0.0; ...
#include <bits/stdc++.h> using namespace std; map<long long, int> mp; long long n, k, i, v[500005], val[500005], x, sum[500005], fr[500005], frec[500005], fr3[500005], nr, sum2[500005], bucket, val1, m, st, dr, s, stcur, drcur, sol[500005], fr2[500005], val2, b[500005]; struct wow { long long st...
#include <bits/stdc++.h> using namespace std; long long n, a[200005], sum, cnt, ans; int main() { cin >> n; for (int i = 1; i <= n; i++) { scanf( %lld , &a[i]); sum += a[i]; } for (int i = 1; i <= n; i += 2) cnt += a[i]; ans = cnt; for (int i = 1; i < n; i++) { cnt = sum ...
#include <bits/stdc++.h> using namespace std; long long m; long long p(long long x) { long long kmx = 0; while ((kmx * kmx * kmx) <= x) kmx++; kmx--; long long ret = 0; for (long long i = 2; i <= kmx; i++) ret += x / (i * i * i); return ret; } int main() { ios_base::sync_with_stdio...
#include <bits/stdc++.h> using namespace std; const int maxx = 200010; unsigned long long t, n; unsigned long long ans = 0, total = 0, sum = 0; unsigned long long a[maxx], b[maxx], bj[maxx]; int main() { scanf( %lld , &t); while (t--) { scanf( %lld , &n); ans = 0, total = 0, sum = 1; ...
#include <bits/stdc++.h> using namespace std; const int maxn = 3e5 + 5; const long long inf = 1e18 + 9; int n, m, k, q; vector<pair<int, int> > g[maxn]; pair<long long, pair<int, int> > edges[maxn]; pair<int, int> query[maxn]; struct data { int id; long long val; bool operator<(const data& o...
#include <bits/stdc++.h> using namespace std; bool in_range(long long l, long long v, long long r) { return (l <= v && v <= r); } int main() { long long x; cin >> x; x = ((-x) % 360 + 360) % 360; int ans = 0; if (x >= 225 && x < 315) ans = 1; else if (x >= 135 && x < 225) ...
#include <bits/stdc++.h> using namespace std; inline pair<int, int> best(pair<int, int> a, pair<int, int> b) { if ((a.first > b.first) \|\| ((a.first == b.first) && (a.second < b.second))) return a; return b; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n...
#include <bits/stdc++.h> using namespace std; class Solution { public: void solve(std::istream& in, std::ostream& out) { long long n, k, b, c, a, d; in >> n >> k >> b >> c; b = min(b, 5 * c); vector<pair<long long, long long>> x(n); for (int i = 0; i < n; i++) { in >> a;...
#include <bits/stdc++.h> using namespace std; int main() { int n, a[100000], s = 0, nz = 0; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); for (int i = 0; i < n; i++) { if (a[i] == a[i + 1] && a[i] != 0) s++; if (a[i] == 0) nz++; } cout << n - s - nz << en...
#include <bits/stdc++.h> using namespace std; string now, st; vector<int> num[26]; int main(void) { int n, k; cin >> n >> k; cin >> st; for (int i = 0; i < (k); i++) { num[st[i] - a ].push_back(i); } for (int Case = 0; Case < (n); Case++) { cin >> now; long long res = ...
#include <bits/stdc++.h> using namespace std; const int mn = 500005; int n, fp, ln; pair<double, double> inp[mn]; bool f(double mid) { double ma = -(int)1e9; for (int i = fp; i < ln + 1; i++) { double pos = inp[i].first + mid * inp[i].second; if (inp[i].second < 0) { if (pos <= ma)...
#include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; using pll = pair<ll, ll>; using ld = long double; const int mod = 1e9 + 7; const ll inf = 2e9; const ll INF = 2e18; const ld EPS = 1e-7; const int N = 1e5 + 55; ll sx[N], sy[N]; void solve() { int...
#include <bits/stdc++.h> using namespace std; const int N = 1e6, M = 1e9 + 7; int gcd(int a, int b) { if (!b) return a; return gcd(b, a % b); } int n, x[N], y[N]; map<pair<long double, long double>, int> mp; int t(int i, int j) { long double dX = x[i] - x[j]; long double dY = y[i] - y[j]; ...
#include <bits/stdc++.h> using namespace std; long long n, a, b; int main() { cin >> n; a = (n + 2) * (n + 1) / 2 * n / 3; b = (n + 4) * (n + 3) / 2 * (n + 2) / 3 * (n + 1) / 4 * n / 5; cout << a * b; }
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 5; const int MOD = 1e9 + 7; vector<pair<long long int, long long int> > vp; map<long long int, long long int> mp, mpp; vector<long long int> v, v1, v2; long long int dp[N], visit[N]; template <typename Arg1> void __f(const char* name, A...
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &(n)); static long long a[int(5e3 + 5)]; set<int> s; for (int i = 1, __R = n; i <= __R; i++) { scanf( %lld , &(a[i])); s.insert(a[i]); } static long long b[int(5e3 + 5)], k = 0; for (long long x...
#include <bits/stdc++.h> using namespace std; int count1[100005], count2[100005], count3[100005]; bool can_be_palin(int a, int size) { int i, no_of_odd = 0; for (i = 0; i < size; i++) no_of_odd += a[i] % 2; return (no_of_odd <= 1); } bool is_palin(int a, int l, int r) { for (int i = l; i <= ...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC optimization( unroll-loops ) std::pair<int, int> DR[] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}, {-1, 1}, {-1, -1}, {1, 1}, {1, -1}}; using namespace std; template <class c> struct rge { c b, e; }; template ...
#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); inline int rand(int x, int y) { ++y; return (rng() % (y - x)) + x; } string to_string(char c) { string second(1, c); return second; } string to_string(bool b) { return (b ? t...
#include <bits/stdc++.h> int f[100005]; int g[100005]; int h[1000005]; int v[100005]; int main() { int n, m = 0; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &f[i]); } for (int i = 1; i <= n; i++) { if (v[i] == 0) { if (f[i] == i) { m++; ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 100005; int a[MAXN], b[MAXN], c[MAXN]; int tb[MAXN]; int d, n; long long x; long long getNextX() { x = (x * 37 + 10007) % 1000000007; return x; } void initAB() { for (int i = 0; i < n; i = i + 1) { a[i] = i + 1; } ...
#include <bits/stdc++.h> using namespace std; int main() { long long int t; cin >> t; while (t--) { long long int n; cin >> n; string s; cin >> s; long long int i = 0; string ans = s; string w; string temp; long long int k = 1; while (i != n) {...
#include <bits/stdc++.h> const double PI = acos(-1.0); const double EPS = 1e-9; using namespace std; template <typename F, typename S> ostream &operator<<(ostream &os, const pair<F, S> &p) { return os << ( << p.first << , << p.second << ) ; } template <typename T> ostream &operator<<(ostream &...

#include <bits/stdc++.h> const int MOD = 1000000007; const int MAX = 10000005; using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(0); long long n; cin >> n; long long b, d; long long max = -1; long long y = 0; vector<pair<long long, lo...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; const long long N = 2e5 + 10, alp = 26; const long double pi = 3.14159265358979; void solve() { long long n, m; cin >> n >> m; vector<vector<long long> > g1(n), rg1(n), g2(n), rg2(n); for (long long i = 0; i < m; ++i) ...

#include <bits/stdc++.h> using namespace std; const long long mod = 998244353; const int maxn = 212345; int n, a[maxn], f[maxn], pre[maxn]; vector<int> b; int F(int x) { return x == f[x] ? x : f[x] = F(f[x]); } inline void U(int a, int b) { f[min(F(a), F(b))] = max(F(a), F(b)); } inline void go(int l, i...

#include <bits/stdc++.h> using namespace std; int n, y, a[(int)1e5 + 4]; unsigned long long x, sum; void error() { puts( -1 ); exit(0); } int main() { scanf( %d%I64d%d , &n, &x, &y); sum = (unsigned long long)n; if (n > y || (n == y && sum < x)) error(); for (int i = 0; i < n; i++) a...

#include <bits/stdc++.h> using namespace std; long long counter; long long n, r, l, x; vector<long long> a; long long sum, rr; bool cheake(long long mask) { long long nmax = -1; long long nmin = 10000000000; long long i = 0; rr = 0; sum = 0; while ((mask >> i) != 0) { if ((mask...

#include<iostream> #include<cstdio> #include<cstring> #include<cmath> #include<algorithm> #include<vector> #include<stack> #include<queue> #include<set> #include<map> //#include<bits/stdc++.h> using namespace std; typedef long long ll; const int maxn = 1e5+5; const int inf = 0x3f3f3f3f; co...

#include <bits/stdc++.h> using namespace std; int n, p, s; vector<int> v1, v2; pair<int, pair<int, int>> arr[3005]; bool cmp(pair<int, pair<int, int>> a, pair<int, pair<int, int>> b) { if (a.second.first == b.second.first) return a.second.second < b.second.second; return a.second.first > b.secon...

#include <bits/stdc++.h> using namespace std; const int maxN = (int)1e5 + 100; const int MAX = (int)1e5 + 1; int l[maxN], d[maxN], cnt[maxN], q[maxN]; vector<int> pool[maxN]; multiset<int> p; void solveTask() { int n; cin >> n; for (int i = 1; i <= n; ++i) cin >> l[i]; for (int i = 1; i <=...

#include <bits/stdc++.h> using namespace std; long long get(long long n) { for (long long i = 2; i * i <= n; ++i) if (n % i == 0) return i; return n; } int main() { long long n; scanf( %lld , &n); long long cnt = 0; if (n % 2 != 0) { n -= get(n); ++cnt; } printf...

#include <bits/stdc++.h> using namespace std; int main() { int n, i, x, m = 0; char a[1000]; int s[26]; cin >> n; while (n--) { cin >> a; m = 0; int mi = 1000, mx = -1; for (i = 0; i < 26; i++) { s[i] = 0; } x = strlen(a); for (i = 0; i < x; i++)...

#include <bits/stdc++.h> using namespace std; long long int ar[500009], br[500009]; int main() { long long int a, b, c, i, j = 0, k = 9999999999999; string s; cin >> a; getchar(); cin >> s; for (i = 0; i < a; i++) { cin >> ar[i]; } for (i = 0; i < a - 1; i++) { if (s[i]...

#include <bits/stdc++.h> #pragma diag_suppress 177 using namespace std; const int MM = 220000; int m, n, k, p1, p2, p3, f, a[MM], pr[MM], af[MM], tree[4 * MM]; string s, s1, s2; int MINN = 0; int func(int aa, int bb) { return (aa | bb); } void build(int node, int start, int end) { if (start == end) ...

#include <bits/stdc++.h> using namespace std; const int N = 3e5; const int INF = 1e9 + 9; const int B = 1e9 + 7; long long n; int main() { ios_base ::sync_with_stdio(0); cin.tie(0); cin >> n; long long pwr = 1; for (;;) { long long x = (n + (pwr - 1)) / pwr; if (n % pwr != 0)...

#include <bits/stdc++.h> using namespace std; int main() { long long t; cin >> t; while (t--) { int n; long long a = 0, b; cin >> n; b = pow(2, n); for (int i = 1; i < n / 2; i++) b += pow(2, i); for (int i = n / 2; i < n; i++) a += pow(2, i); cout << abs(b - a)...

#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { if (a == 0) return b; if (b == 0) return a; if (a == b) return a; if (a > b) return gcd(a - b, b); return gcd(a, b - a); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t = 1; while (t--...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; int i, arr[n]; for (i = 0; i < n; i++) cin >> arr[i]; int ap{0}, bp{n}, asize{arr[0]}, bsize{}, moves{1}, left = n - 1; bool a = 1; while (left != 0) { ...

#include <bits/stdc++.h> using namespace std; using ll = long long int; ll hell = 998244353; int main() { ll n; cin >> n; vector<ll> v[n]; for (ll i = 0; i < n; ++i) { ll x; cin >> x; for (ll j = 0; j < x; ++j) { ll y; cin >> y; v[i].push_back(y); ...

#include <bits/stdc++.h> using namespace std; template <typename T> void read(T &x) { x = 0; bool f = 0; char c = getchar(); for (; !isdigit(c); c = getchar()) if (c == - ) f = 1; for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48); if (f) x = -x; } template <typename F> i...

#include <bits/stdc++.h> using namespace std; int main() { int n, a, ns[10005] = {}; cin >> n; for (int i = 0; i < n; i++) { cin >> a; ns[a]++; } int ans = 0; for (int i = 0; i < 10000; i++) { int j = i + 1; while (ns[i] > 1) { for (; j < 10000 && ns[j] != 0; ...

#include <bits/stdc++.h> using namespace std; int main() { string c = ; string t = ; cin >> t >> c; char lt = t[0]; int nt = int(t[1]) - 48; char lc = c[0]; int nc = int(c[1]) - 48; int cnt = 16; vector<pair<char, int> > torre; vector<pair<char, int> > caballo; for (i...

#include <bits/stdc++.h> using namespace std; inline int read(int f = 1, int x = 0, char ch = ) { while (!isdigit(ch = getchar())) if (ch == - ) f = -1; while (isdigit(ch)) x = x * 10 + ch - 0 , ch = getchar(); return f * x; } const int N = 1e5 + 5, oo = 1e9 + 7; int n, m, a[N], ans[N],...

#include <bits/stdc++.h> using namespace std; void solve() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; int n, k; cin >> n >> k; string second; cin >> second; if (k > 2) { int c = 0; for (int i = 1; i < n; i++) { if (second[i] == second[i - 1]) { ...

#include <bits/stdc++.h> using namespace std; struct Event { int type; int p; int x; }; int main() { ios_base::sync_with_stdio(0); int n; cin >> n; vector<int> v(n); for (auto& el : v) { cin >> el; } int q; cin >> q; vector<Event> evs(q); for (auto& ev :...

#include <bits/stdc++.h> using namespace std; typedef int ll; const ll MAX = 5e5 + 100; const ll inf = 1e9; const ll mod = 1e9 + 7; bool go[MAX]; ll p[MAX], dsu[MAX], n, m; pair<ll, ll> e[MAX]; vector<pair<ll, ll> > Querie; ll ans[MAX]; ll vertex; vector<ll> adj[MAX]; vector<ll> querys_on_grap...

#include <bits/stdc++.h> using namespace std; int main() { int n; vector<int> one; vector<int> two; cin >> n; for (int i = 0; i < n; i++) { int t, w; cin >> t >> w; if (t == 1) one.push_back(w); else two.push_back(w); } sort(one.begin(), one.end())...

#include <bits/stdc++.h> using namespace std; long long Mypow(long long X, long long Y) { if (Y < 0) return 0; if (Y == 0) return 1; if (Y == 1) { return X; } else { long long x = Mypow(X, Y / 2); x *= x; if (Y % 2) return (x * X); else return x; } ...

#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007, dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; const double eps = 1e-8; void read(int &k) { k = 0; char x = getchar(); while (x < 0 || x > 9 ) x = getchar(); while (x >= 0 && x <= 9 ) { k = k * 10 - 48 + x; ...

#include <bits/stdc++.h> using namespace std; int main() { int n, a, b, dist1, dist2, i, blank; string s, t; for (i = 0; i < 300; i++) cout << a ; cout << endl; cin >> dist1; if (dist1 == 0) return 0; for (i = 0; i < 300; i++) cout << b ; cout << endl; cin >> dist2; if (dis...

#include <bits/stdc++.h> using namespace std; struct tp { int l, r; }; int n; vector<tp> t; bool comp(tp a, tp b) { return a.l < b.l or a.l == b.l and a.r < b.r; } int main() { cout.sync_with_stdio(false); cin >> n; for (int i = 1; i <= n; i++) { int l, r; cin >> l >> r; ...

#include <bits/stdc++.h> using namespace std; const int MAX = 140000; int sx[MAX + 10], ex[MAX], sy[MAX + 10], ey[MAX]; int main() { int n; scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d %d %d %d , &sx[i], &sy[i], &ex[i], &ey[i]); vector<pair<int, int> > px, py; for (int i = 0;...

#include <bits/stdc++.h> using namespace std; const int N = 13 * 16, M = 1e9 + 7; int n, m, k; struct zz { int a[N][N]; } A; inline zz cf(zz x, zz y) { zz z; memset(z.a, 0, sizeof z.a); for (int i = 0; i < (1 << m) * (k + 1); i++) for (int j = 0; j < (1 << m) * (k + 1); j++) fo...

#include <bits/stdc++.h> using namespace std; set<int> b[127]; set<int>::iterator it, itt; int n, m, l, r, c[200005]; char s, ch[2], a[200005]; void upd(int v, int d) { while (v <= n) { c[v] += d; v += v & -v; } } int find(int x) { int cur = 0, ans = 0; for (int i = 20; i >= ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 1 << 17; const int INF = 7 << 28; struct T { int maxa, minr; T() : maxa(0), minr(INF) {} T(int a, int b) : maxa(a), minr(b) {} T operator+(T t) const { return T(max(maxa, t.maxa), min(minr, t.minr)); } }; T a[MAXN * 2]; int del...

#include <bits/stdc++.h> using namespace std; int main() { int q; cin >> q; for (int i = 0; i < q; ++i) { long long n; cin >> n; int a = 0; int b = 0; int c = 0; while (n % 2 == 0) { n /= 2; ++a; } while (n % 3 == 0) { n /= 3; ...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; int n, cnt, Max, head[N]; struct Edge { int to, nxt, val; } e[N << 1]; int read() { int x = 0, flg = 1; char c = getchar(); for (; !isdigit(c); c = getchar()) if (c == - ) flg = -1; for (; isdigit(c); c = getchar...

#include <bits/stdc++.h> using namespace std; void solve() { int n; std::cin >> n; std::vector<int> v(101); for (int i = 0; i < n; ++i) { int temp; std::cin >> temp; v[temp]++; } int mex_A = -1; int mex_B = -1; bool flag1 = 1; for (int i = 0; i < n; ++i) { ...

#include <bits/stdc++.h> using namespace std; struct compare { bool operator()(const pair<int, int>& a, const pair<int, int>& b) { return true; } }; int main() { cin.tie(0); ios_base::sync_with_stdio(0); int t; cin >> t; while (t--) { int n, x, y; cin >> n >> x >> y...

#include <bits/stdc++.h> #pragma warning(disable : 4996) using namespace std; const int p = 257; const long long mods = 1610612741; const int maxn = 200010; long long hash1[maxn][2]; int cntzero[maxn]; char s[maxn]; int N; long long pp[maxn]; void gethash(char s[]) { hash1[0][0] = 0; hash1...

#include <bits/stdc++.h> using namespace std; int binary_search(vector<int> a, int korol) { if (a[a.size() - 1] < korol) return a.size() - 1; if (a[0] > korol) return -1; int max = a.size() - 1, min = 0, mid; if (min + max >= 0) mid = (int)((min + max) / 2); else mid = (int)((min + m...

#include <bits/stdc++.h> using namespace std; inline void boost() { ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0); } const long long maxn = 1e5 + 123; const long long inf = 1e9 + 123; const long long mod = 1e9 + 7; const double infm = 1e-9; const double pi = acos(-1); map<char, int>...

#include <bits/stdc++.h> using namespace std; inline void readInt(int &num) { num = 0; int c = getchar(); int s = 1; if (c == - ) { s = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { num = num * 10 + (c - 0 ); c = getchar(); } num *= s; } inline voi...

#include <bits/stdc++.h> using namespace std; int fa[100020], sz[100020]; vector<int> g[100020]; int n, m, q; int find(int x) { if (fa[x] != x) fa[x] = find(fa[x]); return fa[x]; } int dp[100020][3], G[100020], mx[100020]; vector<int> d[100020]; vector<long long> sum[100020]; bool cmp(int i,...

#include <bits/stdc++.h> using namespace std; int l[1000000]; int one_line[5001][5001] = {0}; int summ[5001][5001] = {0}; int fac[5001]; int main() { int n, m, p; scanf( %d %d %d , &n, &m, &p); for (int i = 0; i < n; i++) scanf( %d , &l[i]); fac[0] = 1; for (int i = 1; i <= 5000; i++) fa...

#include <bits/stdc++.h> const int N = (1 << 19) - 1; using namespace std; int n; double dp[N + 1], a[20][20]; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) scanf( %lf , &a[i][j]); } dp[(1 << n) - 1] = 1; for (int s = ((1 << n) - 1); s > 0; s...

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

#include <bits/stdc++.h> using namespace std; int N; vector<pair<int, int> > v; vector<int> query; int ans; struct SEG { SEG(int l, int r, int sum) : l(l), r(r), sum(sum) {} int l, r; int sum; }; vector<SEG> seg; void init(int idx, int s, int e) { if (s == e) return; seg[idx].l = s...

#include <bits/stdc++.h> const int MAX_LEN = 1010; using namespace std; template <typename U, typename V> string to_string(pair<U, V>); string to_string(const string& e_) { return + e_ + ; } string to_string(char e_) { return + string(1, e_) + ; } string to_string(bool e_) { return e_ ? t...

#include <bits/stdc++.h> using namespace std; int main() { int r, c; char s[15][15]; int cake = 0; int row = 0; scanf( %d %d , &r, &c); for (int i = 1; i <= r; i++) { scanf( %s , s[i]); } for (int i = 1; i <= r; i++) { for (int j = 0; j < c; j++) { if (s[i][j] == ...

#include <bits/stdc++.h> using namespace std; using ll = long long; char str[105]; ll best[105]; ll memo[105][105][105]; ll dp(int l, int r, int p) { if (l >= r) return 0; if (memo[l][r][p] != -1) return memo[l][r][p]; int ptr = l; while (ptr < r && str[ptr] == str[l]) ptr++; ll ret = be...

#include <bits/stdc++.h> using namespace std; double eps = 1e-9; const int INF = 1e9 + 7; const int MAXN = int(3e5 + 7); vector<pair<int, int> > v[MAXN]; int n, p, a[MAXN]; long long ans[MAXN], dp[MAXN]; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , a + i); scanf( %d...

#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 16; string s; long long string_int(string s) { long long num = 0; for (int i = 0; i < s.size(); i++) { num += s[i] - 0 ; num *= 10; } return num / 10; } int main() { ios_base::sync_with_stdio(false); ci...

#include <bits/stdc++.h> using namespace std; int main() { int n, m; while (cin >> n) { vector<int> v; int x; for (int i = 0; i < n; i++) { cin >> x; v.push_back(x); } bool in = false; int cnt = 0; bool f = true; bool s = false, l = false; ...

#include <bits/stdc++.h> using namespace std; int a[300005]; int rev[300005]; int b[300005]; int main() { int n, m; long long ans = 0; scanf( %d %d , &n, &m); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); rev[a[i]] = i; } for (int i = 0; i < m; i++) { int x, y; ...

#include <bits/stdc++.h> using namespace std; const int N = 505, mod = 1e9 + 7; int n, m, e[N][N], f[N][N], g[N][N]; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n; for (int i = (1); i <= (n); i++) for (int j = (1); j <= (n); j++) cin >> e[i][j]; for (i...

#include <bits/stdc++.h> using namespace std; const int MAXN = 100010; const int MAXM = 100010; const int INF = 1000000000; int dist[MAXN], dp[MAXN]; pair<int, int> par[MAXN]; bool marked[MAXM]; vector<pair<int, int> > edges[MAXN]; queue<int> q; vector<pair<int, int> > v; int x[MAXM], y[MAXM], z[M...

#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long inf = 0x3f3f3f3f3f3f3f3f; const long long mod = 998244353; const int N = 2e5 + 10; mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count()); int n; int z[100][2]; int qry(int i, int j) { cout << ...

#include <bits/stdc++.h> using namespace std; int n, T; double dp[5001][5001]; int p[5001], t[5001]; double quickpow(double x, int y) { double res = 1; while (y) { if (y & 1) res *= x; x *= x; y >>= 1; } return res; } int main() { cin >> n >> T; dp[0][0] = 1; ...

#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 2; int n, l; long long a[N], f[N]; int main() { scanf( %d %d , &n, &l); for (int i = 1; i < n; ++i) scanf( %lld , &a[i]), a[i] += a[i - 1]; long long ans = LLONG_MAX; for (int i = l; i < n; ++i) ans = min(ans, a[i] - a[i - l]); ...

#include <bits/stdc++.h> using namespace std; long long n, i, j, ans = 0; long long a, b; const long long M = (long long)1E9 + 7; long long power(long long x, long long y) { long long res = 1; x %= M; while (y) { if (y % 2) res = (res * x) % M; y = y >> 1; x = (x * x) % M; } ...

#include <bits/stdc++.h> using namespace std; int a[100005]; map<long long, int> ma; int main() { long long b1, q, m, l; cin >> b1 >> q >> l >> m; while (m--) { long long x; cin >> x; ma[x] = 1; } int ans = 0, i; for (i = 1; i < 100; i++) { if (abs(b1) > l) break;...

#include <bits/stdc++.h> using namespace std; int main() { int nuts, divis, maxsec, capacity, boxees = 0; cin >> maxsec >> nuts >> divis >> capacity; while (nuts > 0) { boxees++; nuts -= ((min(maxsec, divis + 1)) * capacity); divis -= ((min(maxsec, divis + 1)) - 1); } cout << b...

#include <bits/stdc++.h> using namespace std; int n, m; int vis[100010], h[100100]; vector<int> res; set<int> q, off; int a[100100]; char s[100010][2]; int main() { int i, j, z, T, d; while (cin >> n >> m) { q.clear(); res.clear(); off.clear(); memset(vis, 0, sizeof(vis))...

#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 5; long long fac[N], infac[N]; int n, m; long long poww(long long b, long long p) { if (p == 0) return 1; if (p & 1) return (b * poww(b, p - 1)) % m; return poww((b * b) % m, p / 2); } long long npk(int n, int k) { return (fac[n...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); int result; string input; cin >> input; set<string> sinput; sinput.insert(input); for (int i = input.size() - 1; i >= 0; --i) { input = input[input.size() - 1] + input; input.pop_back...

#include <bits/stdc++.h> using namespace std; const int N = 100100; long long n, m, A, cf, cm, maxForce = -1, minSkill, minIdx, i, a[N], b[N]; pair<long long, int> sum[N]; inline long long query(long long money, int limit) { long long l = sum[1].first, r = A, mid; if (limit <= 1) { return A; ...

#include <bits/stdc++.h> #define dumb ios_base::sync_with_stdio(false);cin.tie(NULL); typedef long long ll; using namespace std; #define modulo 1000000007; bool isprime(long long n) { for(long long int i=2;i*i<=n;i++) { if(n%i==0) return 0; ...

#include <bits/stdc++.h> using namespace std; template <typename T, size_t N> void PRINT_ARRAY(const T (&a)[N], int n = -1) { if (!n) n = N; for (int i = 0; i < n; i++) cout << a[i] << ; cout << n ; } template <typename T, size_t N, size_t M> void PRINT_ARRAY(const T (&a)[N][M], int n, int ...

#include <bits/stdc++.h> using namespace std; int N, M; bitset<2020> mat[2020]; int main() { int T; scanf( %d , &T); while (T--) { scanf( %d%d , &N, &M); vector<pair<int, int> > E; int deg[2020] = {}; for (int i = 1; i <= M; i++) { int x, y; scanf( %d%d , &x, ...

#include <bits/stdc++.h> using namespace std; const int INF = 1000000007; const long long MOD = 1000000007; void solve_test() { int n; cin >> n; vector<int> arr(n); vector<int> ct(101); for (int i = 0; i < n; i++) { cin >> arr[i]; ct[arr[i]]++; } int max_val = -1; int...

#include <bits/stdc++.h> using namespace std; int N, T; char str[15], temp[15]; int main() { int i, j, k; scanf( %s%s , str, temp); i = strlen(str); sort(str, str + i); if (str[0] == 0 ) { do { if (str[0] != 0 ) break; } while (next_permutation(str, str + i)); } ...

#include <bits/stdc++.h> using namespace std; void init() {} const int N = (int)1e6 + 34; const long long INF = (long long)1e9 + 34; int n, m; int a[555][555]; int c[555], r[555]; int main() { init(); int mxr = -N, mnr = N, mxc = -N, mnc = N; cin >> n >> m; int sum = 0; for (int i = ...

#include <bits/stdc++.h> using namespace std; int main() { int n, m, v; scanf( %d%d%d , &n, &m, &v); int spec = 1; if (m < n - 1 || m > (n - 1) * (n - 2) / 2 + 1) { printf( -1 n ); return 0; } if (spec == v) spec++; printf( %d %d n , v, spec); m--; for (int i = 1; i <...

#include <bits/stdc++.h> using namespace std; string str[1005]; int tim[1005][1005]; int n, m, t; int fx[] = {-1, +1, 0, 0}; int fy[] = {0, 0, -1, +1}; vector<pair<int, int> > cur; bool okay(int x, int y) { return (x >= 0 && x < n && y >= 0 && y < m); } void dfs(int x, int y, int curr) { tim[x][y]...

#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const int maxn = 100005; int a[3], d; void Solve() { cin >> a[0] >> a[1] >> a[2] >> d; sort(a, a + 3); long long res = 0; if (a[2] < a[1] + d) res += a[1] + d - a[2]; if (a[0] > a[1] - d) res += a[0] - a[1] + d; cou...

#include <bits/stdc++.h> struct circle { double r, x, y; circle(void) : r(0), x(0), y(0) {} bool contains(const circle& o) const { double dx, dy; dx = o.x - x; dy = o.y - y; return (dx * dx + dy * dy <= r * r) && o.r < r; } }; circle fences[1024]; circle control[1024]; ...

#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; int logb(int base, int x) { return (log(x) / log(base)); } int occurs(vector<long long> v, int n) { auto it = lower_bound(((v)).begin(), ((v)).end(), (n)); auto it1 = upper_bound(((v)).begin(), ((v)).end(), (n)); int x = it...

#include <bits/stdc++.h> using namespace std; int n, V, A[64], B[64]; bool canCook(double x) { double tot = 0.0; for (int i = 0; i < n; i++) if (A[i] * x > B[i]) return 0; else tot += A[i] * x; return tot <= V; } double totalAmount(double x) { double tot = 0.0; ...

#include <bits/stdc++.h> using namespace std; map<long long, int> mp; long long n, k, i, v[500005], val[500005], x, sum[500005], fr[500005], frec[500005], fr3[500005], nr, sum2[500005], bucket, val1, m, st, dr, s, stcur, drcur, sol[500005], fr2[500005], val2, b[500005]; struct wow { long long st...

#include <bits/stdc++.h> using namespace std; long long n, a[200005], sum, cnt, ans; int main() { cin >> n; for (int i = 1; i <= n; i++) { scanf( %lld , &a[i]); sum += a[i]; } for (int i = 1; i <= n; i += 2) cnt += a[i]; ans = cnt; for (int i = 1; i < n; i++) { cnt = sum ...

#include <bits/stdc++.h> using namespace std; long long m; long long p(long long x) { long long kmx = 0; while ((kmx * kmx * kmx) <= x) kmx++; kmx--; long long ret = 0; for (long long i = 2; i <= kmx; i++) ret += x / (i * i * i); return ret; } int main() { ios_base::sync_with_stdio...

#include <bits/stdc++.h> using namespace std; const int maxx = 200010; unsigned long long t, n; unsigned long long ans = 0, total = 0, sum = 0; unsigned long long a[maxx], b[maxx], bj[maxx]; int main() { scanf( %lld , &t); while (t--) { scanf( %lld , &n); ans = 0, total = 0, sum = 1; ...

#include <bits/stdc++.h> using namespace std; const int maxn = 3e5 + 5; const long long inf = 1e18 + 9; int n, m, k, q; vector<pair<int, int> > g[maxn]; pair<long long, pair<int, int> > edges[maxn]; pair<int, int> query[maxn]; struct data { int id; long long val; bool operator<(const data& o...

#include <bits/stdc++.h> using namespace std; bool in_range(long long l, long long v, long long r) { return (l <= v && v <= r); } int main() { long long x; cin >> x; x = ((-x) % 360 + 360) % 360; int ans = 0; if (x >= 225 && x < 315) ans = 1; else if (x >= 135 && x < 225) ...

#include <bits/stdc++.h> using namespace std; inline pair<int, int> best(pair<int, int> a, pair<int, int> b) { if ((a.first > b.first) || ((a.first == b.first) && (a.second < b.second))) return a; return b; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n...

#include <bits/stdc++.h> using namespace std; class Solution { public: void solve(std::istream& in, std::ostream& out) { long long n, k, b, c, a, d; in >> n >> k >> b >> c; b = min(b, 5 * c); vector<pair<long long, long long>> x(n); for (int i = 0; i < n; i++) { in >> a;...

#include <bits/stdc++.h> using namespace std; int main() { int n, a[100000], s = 0, nz = 0; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); for (int i = 0; i < n; i++) { if (a[i] == a[i + 1] && a[i] != 0) s++; if (a[i] == 0) nz++; } cout << n - s - nz << en...

#include <bits/stdc++.h> using namespace std; string now, st; vector<int> num[26]; int main(void) { int n, k; cin >> n >> k; cin >> st; for (int i = 0; i < (k); i++) { num[st[i] - a ].push_back(i); } for (int Case = 0; Case < (n); Case++) { cin >> now; long long res = ...

#include <bits/stdc++.h> using namespace std; const int mn = 500005; int n, fp, ln; pair<double, double> inp[mn]; bool f(double mid) { double ma = -(int)1e9; for (int i = fp; i < ln + 1; i++) { double pos = inp[i].first + mid * inp[i].second; if (inp[i].second < 0) { if (pos <= ma)...

#include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; using pll = pair<ll, ll>; using ld = long double; const int mod = 1e9 + 7; const ll inf = 2e9; const ll INF = 2e18; const ld EPS = 1e-7; const int N = 1e5 + 55; ll sx[N], sy[N]; void solve() { int...

#include <bits/stdc++.h> using namespace std; const int N = 1e6, M = 1e9 + 7; int gcd(int a, int b) { if (!b) return a; return gcd(b, a % b); } int n, x[N], y[N]; map<pair<long double, long double>, int> mp; int t(int i, int j) { long double dX = x[i] - x[j]; long double dY = y[i] - y[j]; ...

#include <bits/stdc++.h> using namespace std; long long n, a, b; int main() { cin >> n; a = (n + 2) * (n + 1) / 2 * n / 3; b = (n + 4) * (n + 3) / 2 * (n + 2) / 3 * (n + 1) / 4 * n / 5; cout << a * b; }

#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 5; const int MOD = 1e9 + 7; vector<pair<long long int, long long int> > vp; map<long long int, long long int> mp, mpp; vector<long long int> v, v1, v2; long long int dp[N], visit[N]; template <typename Arg1> void __f(const char* name, A...

#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &(n)); static long long a[int(5e3 + 5)]; set<int> s; for (int i = 1, __R = n; i <= __R; i++) { scanf( %lld , &(a[i])); s.insert(a[i]); } static long long b[int(5e3 + 5)], k = 0; for (long long x...

#include <bits/stdc++.h> using namespace std; int count1[100005], count2[100005], count3[100005]; bool can_be_palin(int *a, int size) { int i, no_of_odd = 0; for (i = 0; i < size; i++) no_of_odd += a[i] % 2; return (no_of_odd <= 1); } bool is_palin(int *a, int l, int r) { for (int i = l; i <= ...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC optimization( unroll-loops ) std::pair<int, int> DR[] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}, {-1, 1}, {-1, -1}, {1, 1}, {1, -1}}; using namespace std; template <class c> struct rge { c b, e; }; template ...

#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); inline int rand(int x, int y) { ++y; return (rng() % (y - x)) + x; } string to_string(char c) { string second(1, c); return second; } string to_string(bool b) { return (b ? t...

#include <bits/stdc++.h> int f[100005]; int g[100005]; int h[1000005]; int v[100005]; int main() { int n, m = 0; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &f[i]); } for (int i = 1; i <= n; i++) { if (v[i] == 0) { if (f[i] == i) { m++; ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 100005; int a[MAXN], b[MAXN], c[MAXN]; int tb[MAXN]; int d, n; long long x; long long getNextX() { x = (x * 37 + 10007) % 1000000007; return x; } void initAB() { for (int i = 0; i < n; i = i + 1) { a[i] = i + 1; } ...

#include <bits/stdc++.h> using namespace std; int main() { long long int t; cin >> t; while (t--) { long long int n; cin >> n; string s; cin >> s; long long int i = 0; string ans = s; string w; string temp; long long int k = 1; while (i != n) {...

#include <bits/stdc++.h> const double PI = acos(-1.0); const double EPS = 1e-9; using namespace std; template <typename F, typename S> ostream &operator<<(ostream &os, const pair<F, S> &p) { return os << ( << p.first << , << p.second << ) ; } template <typename T> ostream &operator<<(ostream &...