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

func_code_string stringlengths 59 71.4k
#include <bits/stdc++.h> using namespace std; const signed long long INF = 1000000100; const long double EPS = 1e-9; const long double Pi = 2 * atanl(1.0); template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &p) { return os << ( << p.first << , << p.second << ) ; }...
#include <bits/stdc++.h> inline int Get() { char ch; while ((ch = getchar()) < 0 \|\| ch > 9 ) ; int Num = ch - 0 ; while ((ch = getchar()) >= 0 && ch <= 9 ) Num = (Num << 3) + (Num << 1) + ch - 0 ; return Num; } const int M = 3e3 + 5; const int m = 3000; int n, a[M][M], ...
#include <bits/stdc++.h> using namespace std; const double EPS = 1e-8; int t1, t2, x1, x2, t0; int main() { scanf( %d %d %d %d %d , &t1, &t2, &x1, &x2, &t0); long long k1 = t0 - t1, k2 = t2 - t0; if (k1 == 0) { printf( %d %d n , x1, t1 == t2 ? x2 : 0); } else if (k2 == 0) { printf( %...
#include <bits/stdc++.h> using namespace std; void __print(int x) { cerr << x; } void __print(long x) { cerr << x; } void __print(long long x) { cerr << x; } void __print(unsigned x) { cerr << x; } void __print(unsigned long x) { cerr << x; } void __print(unsigned long long x) { cerr << x; } void __prin...
#include <bits/stdc++.h> using namespace std; int main() { long long int n1, n2, i, j, n, ma = 0, temp, c; cin >> n1 >> n2; if (n1 < n2) { cout << 2 ; } else { cout << n1; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); unsigned long long int n, ans, i, j, k; cin >> n; if (n == 0) { cout << 1 << endl; return 0; } ans = 2 * n * n; ans = ans + ((n + 2) * (n + 1)) - 1; cout << a...
#include <bits/stdc++.h> using namespace std; vector<int> adj[200001]; int dis[200001]; int par[200001]; void addEdge(int u, int v) { adj[u].push_back(v); adj[v].push_back(u); } void dfs(int src, int parent, int dist) { dis[src] = dist; par[src] = parent; for (int child : adj[src]) { ...
#include <bits/stdc++.h> using namespace std; const int maxn = 3e3 + 10; vector<int> occ[maxn]; int dp[maxn][maxn], a[maxn]; void solve() { int n; cin >> n; int ptr = 0; for (int i = 1; i <= n; i++) { cin >> a[++ptr]; if (ptr > 1 and a[ptr] == a[ptr - 1]) ptr--; } n = ptr; ...
#include <bits/stdc++.h> using namespace std; int solve(int A, int B) { int count = 0; for (int i = 0; i < 32; i++) { if (((A >> i) & 1) != ((B >> i) & 1)) { count++; } } return count; } int main() { int n, m, k; cin >> n >> m >> k; std::vector<int> arr(m + 1); ...
#include <bits/stdc++.h> using namespace std; int a[2001]; int main() { int n, b, s = 0, m, s1, i; scanf( %d%d , &n, &b); for (i = 0; i < n; i++) scanf( %d , &a[i]); for (i = 0; i < n; i++) { if (i == n - 1) s1 = b; else { m = *max_element(a + i, a + n); s1 = (b...
#include <bits/stdc++.h> using namespace std; int main() { int n, i, j, sum, min = 1000000000; cin >> n; int k[n]; for (i = 0; i < n; i++) cin >> k[i]; for (i = 0; i < n; i++) { sum = 0; int m[k[i]]; for (j = 0; j < k[i]; j++) { cin >> m[j]; sum = sum + 5 * m[j]...
#include <bits/stdc++.h> using namespace std; int n; void work(int n) { map<int, int> v; int ans = 0; for (int i = 0; i <= n; i++) { for (int j = 0; j <= n; j++) { for (int k = 0; k <= n; k++) { for (int x = 0; x <= n; x++) { if (i + j + k + x == n) { ...
#include <bits/stdc++.h> using namespace std; int main() { long long n, k; cin >> n >> k; if (k >= 2 * n) { cout << 0; return 0; } long long q = k / 2, z; if (k <= n) z = k - 1; else z = n; if (k & 1) { long long ans = min(q - 1, z - q - 1); ans++;...
#include <bits/stdc++.h> using namespace std; int u, v; const int maxn = 5e3 + 10; vector<long long> G[maxn]; bool visited[maxn]; long long dp[maxn]; vector<long long> vc[maxn]; bool mark[maxn]; long long n; vector<long long> ans; void dfs(int x) { visited[x] = 1; for (int i = 0; i != G[x]...
#include <bits/stdc++.h> using namespace std; int main() { int t, n, m, x, y, cost, i, j; string s; cin >> t; while (t--) { cost = 0; cin >> n >> m >> x >> y; y = min(y, 2 * x); for (i = 0; i < n; i++) { cin >> s; for (j = 0; j < m; j++) { if (s[j] =...
#include <bits/stdc++.h> using namespace std; int main() { long long test; cin >> test; while (test--) { long long b, p, f, h, c; cin >> b >> p >> f >> h >> c; long long profit = 0; if (h > c) { if (b - 2 * p >= 0) { profit += p * h; b = b - 2 * p; ...
#include <bits/stdc++.h> int n, m; long long k; long long pow(int n) { if (n == 0) return 1; long long tmp = pow(n >> 1); tmp = tmp * tmp % 1000000009ll; if (n & 1) tmp = tmp * 2ll % 1000000009ll; return tmp; } int main() { scanf( %d%d%I64d , &n, &m, &k); int t = n - m; long lo...
#include <bits/stdc++.h> using namespace std; const int INF = 0x7f7f7f7f; char s[1005]; int dp[1005][2]; int main() { int n; scanf( %d , &n); scanf( %s , s); if (1 == n) { puts( 0 ); return 0; } memset(dp, 0x7f, sizeof(dp)); dp[0][s[0] - 0 ] = 0; dp[0][(s[0] - 0 )...
#include <bits/stdc++.h> using namespace std; vector<vector<pair<int, int> > > AdjList; priority_queue<pair<int, pair<int, int> > > Edgelist; int n, j, k, m, l, t, i; string s, ss; int a[1050][1050]; int main() { cin >> n; for (i = 0; i < n; i++) { for (j = 0; j < n; j++) { scanf( %d...
#include <bits/stdc++.h> using namespace std; int a[100000 + 5], nxt[100000 + 5], lst[100000 + 5], fi[100000 + 5]; int cnt, root[100000 + 5]; struct node { int sum, ls, rs; } t[100000 * 43 + 5]; int build(int l, int r) { int id = ++cnt; if (l == r) { t[id].sum = fi[l]; return id; ...
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3fll; mt19937 rng((int)chrono::steady_clock::now().time_since_epoch().count()); struct kuhn { int n, m; vector<vector<int>> g; vector<int> vis, ma, mb; kuhn(int n_, int m_) : n(n_),...
#include <bits/stdc++.h> const int mo = 998244353, N = 2005; int n, a[N][N], ia[N][N], i, j, f[N][N], bi[N], mi[N], fac[N], ans; inline void add(int x, int v = 1) { for (; x <= n; x += x & -x) bi[x] += v; } inline int ask(int x) { int ans = 0; for (; x; x -= x & -x) ans += bi[x]; return ans; ...
#include <bits/stdc++.h> using namespace std; template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << : << arg1 << n ; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, , ); ...
#include <bits/stdc++.h> using namespace std; int get(char *s) { if (s[0] == 8 && s[1] == < ) return 1; if (s[0] == [ && s[1] == ] ) return 2; if (s[0] == ( && s[1] == ) ) return 3; } int check(int a, int b) { if (a == 1 && b == 2 \|\| a == 2 && b == 3 \|\| a == 3 && b == 1) return 1; i...
#include <bits/stdc++.h> using namespace std; int main() { long long int nn, i, j, k; cin >> nn; long long int a[nn]; for (i = 0; i < nn; i++) cin >> a[i]; sort(a, a + nn); for (i = 0; i < nn; i++) { for (j = i + 1; j < nn; j++) { if (a[i] != -1 && a[j] != -1 && a[j] % a[i] == ...
#include <bits/stdc++.h> using namespace std; const int N = 100005; long long ara[N]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); long long n; cin >> n; long long mx = 0; for (long long i = 0; i < n; ++i) { cin >> ara[i]; while (ara[i] % 2 == 0) ara[i] /= 2; ...
#include <bits/stdc++.h> using namespace std; const long long int N = 100005; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); { long long int i, j, k, n, m, ans = 0, cnt = 0, sum = 0; cin >> n; vector<long long int> v; cout << n << ; ...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; int i; int a[n]; int even = 0, odd = 0; for (i = 0; i < n; i++) { cin >> a[i]; if (a[i] % 2 == 0) even++; else odd++;...
#include <bits/stdc++.h> using namespace std; long long arr[100005]; long long ans = 0; long long temp[100005]; bool is(int m, string s) { set<char> ss; map<char, int> mp; for (int i = 0; i < m; i++) { ss.insert(s[i]); mp[s[i]]++; } if (ss.size() == ans) return true; for (i...
#include <bits/stdc++.h> using namespace std; const int N = 2005; const int MOD = 1000000007; int d, n; int a[N]; int ord[N], rnk[N]; vector<int> v[N]; inline bool cmp(int x, int y) { return a[x] > a[y]; } int ans = 0; int sz[N]; inline void dfs(int x, int top) { sz[x] = 1; for (int i = 0;...
#include <bits/stdc++.h> using namespace std; template <typename T, typename U> inline void smin(T &a, const U &b) { if (a > b) a = b; } template <typename T, typename U> inline void smax(T &a, const U &b) { if (a < b) a = b; } template <typename T> inline void gn(T &first) { char c, sg = ...
#include <bits/stdc++.h> using namespace std; const int N = 1005; vector<pair<int, int>> g[N], ans[N]; long long dist[N]; priority_queue<pair<int, int>> pq; bool vis[N]; void dijkstra(int s) { fill(dist, dist + N, 1LL << 61); memset(vis, false, sizeof(vis)); dist[s] = 0; pq.push({0, s}); ...
#include <bits/stdc++.h> using namespace std; const long long inf = (long long)1e18; const long long mod = (long long)1e9 + 7; const double eps = (double)1e-9; const double pi = acos(-1.0); const int dx[] = {0, 0, 1, 0, -1}; const int dy[] = {0, 1, 0, -1, 0}; const int N = 300500; int n, l[N], r[N], a...
#include <bits/stdc++.h> template <typename T> class IntegerIterator { public: using value_type = T; using difference_type = std::ptrdiff_t; using pointer = T*; using reference = T; using iterator_category = std::input_iterator_tag; explicit IntegerIterator(T value) : value(value) {} ...
#include <bits/stdc++.h> using namespace std; const int G = 3; const int MOD = 998244353; const int N = (1 << 15) + 5; int rev[N], w[N], inv_n; int bigMod(int a, int e, int mod) { if (e == -1) e = mod - 2; int ret = 1; while (e) { if (e & 1) ret = (long long)ret * a % mod; a = (long ...
#include <bits/stdc++.h> using namespace std; int p[100003]; int n; int main() { int i; scanf( %d , &n); if (n == 1) { printf( 1 n ); return 0; } if (n == 2) { printf( -1 n ); return 0; } if (n % 2 != 0) p[n / 2 + 1] = n / 2 + 1; p[1] = 2; p[2] = n; ...
#include <bits/stdc++.h> using namespace std; void use_cio() { ios_base::sync_with_stdio(0); cin.tie(0); } template <typename... Args> void dbg(Args... args) { ((cout << args << ), ...); cout << endl; } int n; int ask(int r1, int c1, int r2, int c2) { string ans; dbg( ? , r1, ...
#include <bits/stdc++.h> using namespace std; long long dp[15][1 << 15]; int n, m, q; struct NodeLCA { int a, b, c; }; vector<pair<int, int> > path; vector<NodeLCA> LCA; void readData() { cin >> n >> m >> q; for (int i = 0; i < m; i++) { int u, v; cin >> u >> v; u--; ...
#include <bits/stdc++.h> using namespace std; signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int n, m, k, count = 0; cin >> n >> m >> k; long long int s = n * m; long long int a[s], b[s]; for (long long int i = 0; i < s; i++) cin >> a[i]; ...
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; int n, k; int arr[N]; int a, b; vector<int> v[N]; int tmp[N]; int subtree1[N]; int subtree2[N]; int sum[N]; int bst1[N]; int bst2[N]; bool ret; void dfs(int node, int parent) { subtree1[node] = 1; subtree2[node] = t...
#include <bits/stdc++.h> using namespace std; struct Bus { long long s, t; }; bool cmp(Bus &a, Bus &b) { return a.t < b.t; } long long n, m, it[4 * 111111], tmp = 1, l, r; Bus bus[111111]; vector<long long> positions; void update(int idx, int l, int r, int pos, long long val) { if (pos < l \|\| po...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 7; int n, k; string s; bool can_del(char c) { int l = N, r = -1; for (int i = 0; i < n; ++i) { if (s[i] == c) { l = min(l, i); r = max(r, i); } } return r - l + 1 <= k; } string ans1 = tokitsukaz...
#include <bits/stdc++.h> using namespace std; int main() { int n, size = 1e6 + 1; cin >> n; vector<int> prime(1e6 + 1, 1); prime[0] = 0; prime[1] = 0; for (int ri = 2; ri <= sqrt(size); ri++) { if (prime[ri]) { for (int pi = ri * ri; pi <= size; pi += ri) if (prime[pi...
#include <bits/stdc++.h> using namespace std; const int maxn = 200010; int a[maxn]; int main() { int t; cin >> t; while (t--) { string s; cin >> s; int m = s.length(); int fa = 0, fb = 0, fc = 0; for (int i = 0; i < m; i++) { if (s[i] == 1 && fa == 0) fa = i +...
#include <bits/stdc++.h> using namespace std; const int MaxLg = 25, inf = 1e9 + 100; int n; bool flag; vector<int> out, mins[2][MaxLg]; void output() { if (flag) cout << -1 << n ; else cout << out.size() << n ; for (auto i : out) cout << i << ; cout << endl; } void inp...
#include <bits/stdc++.h> const bool debugging = 1; const long long mod = 1e9 + 7; using namespace std; template <class T> ostream &operator<<(ostream &os, vector<T> V) { for (auto v : V) { os << v << ; } return os << ; } template <class T> ostream &operator<<(ostream &os, vector<v...
#include <bits/stdc++.h> const double PI = 3.141592653589793238462643383279502884197169399375105820974944; using namespace std; const int MOD = 1e9 + 7; double gcd(double a, double b) { return a < 0.01 ? b : gcd(fmod(b, a), a); } template <typename T> T mymax(T a, T b) { return (a > b) ? a : b; ...
#include <bits/stdc++.h> using namespace std; int main() { int n, x[5], y[5], i; cin >> n; for (i = 1; i <= n; i++) cin >> x[i] >> y[i]; if (n == 1) cout << -1; else if (n == 2) { if (x[1] != x[2] && y[1] != y[2]) cout << abs(x[1] - x[2]) * abs(y[1] - y[2]); else ...
#include<iostream> using namespace std; int main() { int t; cin>>t; while(t--) { int Xa,Ya,Xb,Yb,Xf,Yf,sum; cin>>Xa>>Ya>>Xb>>Yb>>Xf>>Yf; sum=abs(Xa-Xb)+abs(Ya-Yb); if(Xa==Xb&&Xb==Xf) { if(Ya<Yf&&Yb>Yf\|\|Ya>Yf&&Yb<Yf) sum+=2; ...
#include <bits/stdc++.h> using namespace std; int main() { int n, k, i, teo = 0, s = 0, a[100001], t[100001]; cin >> n >> k; for (i = 1; i <= n; i++) cin >> a[i]; for (i = 1; i <= n; i++) { cin >> t[i]; if (t[i] == 1) { teo = teo + a[i]; a[i] = 0; } a[i] = a[i...
#include <bits/stdc++.h> #pragma comment(linker, /stack:640000000 ) using namespace std; const double EPS = 1e-9; const int INF = 0x7f7f7f7f; const double PI = acos(-1.0); template <class T> inline T gcd(T a, T b) { return (b) == 0 ? (a) : gcd((b), ((a) % (b))); } template <class T> inline T lc...
#include <bits/stdc++.h> int main() { int n, k, i; scanf( %d , &n); int a[n][2]; for (i = 0; i < n; i++) { scanf( %d%d , &a[i][0], &a[i][1]); } scanf( %d , &k); for (i = 0; i < n; i++) { if (k >= a[i][0] && k <= a[i][1]) { printf( %d , n - i); break; } ...
#include <bits/stdc++.h> using namespace std; int read() { int X = 0, w = 1; char c = getchar(); while (c < 0 \|\| c > 9 ) { if (c == - ) w = -1; c = getchar(); } while (c >= 0 && c <= 9 ) X = X * 10 + c - 0 , c = getchar(); return X * w; } const int N = 1500 + 10, K = ...
#include <bits/stdc++.h> using namespace std; enum { MAXN = 4010, MAXC = 26 }; int dp[MAXN][MAXN]; char sa[MAXN], sb[MAXN]; int pra[MAXN][MAXC], prb[MAXN][MAXC]; int main() { int ci, cd, cr, cs; scanf( %d%d%d%d , &ci, &cd, &cr, &cs); scanf( %s , sa + 1); scanf( %s , sb + 1); int la = str...
#include <bits/stdc++.h> using namespace std; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long int n; cin >> n; long long int a[n]; long long int sum = 0; for (long long int i = 0; i < n; i++) { cin >> a[i]; sum += a[i]; } sor...
#include <bits/stdc++.h> using namespace std; int w, m; long long x = 1; bool f = 1; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> w >> m; while (m && f) { if ((m - 1) % w == 0 \|\| m % w == 0 \|\| (m + 1) % w == 0) { if ((m - 1) % w == 0 \|\| m % w == 0) ...
#include <bits/stdc++.h> using namespace std; const long long nax = 1e5 + 10; vector<long long> g[nax]; signed main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); ; long long n; cin >> n; long long f = 0; vector<pair<pair<long long, long long>, long long> > a(n - 2); for (long...
#include <bits/stdc++.h> int main() { int n, i, j, k; scanf( %d , &n); int a[1000]; int b[1000]; int c[6] = {0}; int d[6] = {0}; int sum = 0; for (i = 0; i < n; i++) { scanf( %d , &a[i]); c[a[i]]++; } for (i = 0; i < n; i++) { scanf( %d , &b[i]); d[b[i]]...
#include <bits/stdc++.h> using namespace std; const int LN = 18, maxn = (1 << LN); const long long mod = (long long)(998244353); int fact[maxn], inv_fact[maxn], poww_r[maxn], poww_inv_r[maxn]; int mul(long long a, long long b) { long long ret = (a * b) % mod; return (int)(ret); } int add(int a, in...
#include <bits/stdc++.h> using namespace std; char s[20005]; struct SuffixArray { int wa[20005], wb[20005], cnt[20005], wv[20005]; int rk[20005], height[20005]; int sa[20005]; bool cmp(int r[], int a, int b, int l) { return r[a] == r[b] && r[a + l] == r[b + l]; } void calcSA(char r[]...
#include <bits/stdc++.h> using namespace std; const int maxn = 100005; const int inf = 1 << 30; const long long INF = 1ll << 61; const double oo = 1 << 30; const long long zqc = 1e9 + 7; int n, k; int t, x; vector<int> a; int gcd(int a, int b) { return !b ? a : gcd(b, a % b); } int main() { sc...
#include <bits/stdc++.h> using namespace std; int main() { int n, m, d, cot = 0; cin >> n >> m >> d; int arr[10004] = {0}; int rn = n * m; for (int j = 1; j <= rn; j++) cin >> arr[j]; sort(arr, arr + rn); int ind = arr[rn / 2]; if (n * m == 1) { cout << 0; return 0; }...
#include <bits/stdc++.h> using namespace std; const int MAX_N = 2e3; vector<int> e[MAX_N], d; vector<char> flag; void dfs(int v) { if (d[v] != -1) return; d[v] = 1; for (int to : e[v]) { dfs(to); d[v] = max(d[v], d[to] + 1); } } int main() { int n; scanf( %d , &n); ...
#include <bits/stdc++.h> using namespace std; int main() { int a[100], n, temp, m, ans; scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) scanf( %d , &a[i]); for (int i = 0; i < (n - 1); i++) { for (int j = 0; j < n - i - 1; j++) { if (a[j] < a[j + 1]) { temp = a[j]; ...
#include <bits/stdc++.h> using namespace std; int n; long long arr[5005], parent[5005], ans[5005]; long long dist[5005][5005]; vector<int> v[5005], order; priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > pq[5005]; void dfs(int cur, int prev) { p...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; for (int i = 0; i < n; ++i) { int x, y; cin >> x >> y; if ((x == 1 \|\| x == 2 && 3 < y \|\| x == 3 && x < y) && x != y) { cout << NO << endl; } else cout << YES << endl; } }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int arr[n]; int x = 0; string str[n]; for (int i = 0; i < n; i++) { cin >> str[i]; if (str[i][1] == + ) { x++; } else { x--; } } cout << x; return 0; }
#include <bits/stdc++.h> using namespace std; long long b, d; string a, c; map<long long, long long> need[150]; int main() { cin >> b >> d; cin >> a >> c; string h = ; long long ans = 0; long long sizea = a.size(); long long sizec = c.size(); for (int i = 0; i < sizec; i++) { ...
#include <bits/stdc++.h> using namespace std; vector<int> adj[100100], ans; int arr[100100], cnt[100100]; bool visited[100100]; int n, m; void dfs(int v) { for (vector<int>::iterator it = adj[v].begin(); it != adj[v].end(); it++) { cnt[it]++; if (cnt[it] == arr[it]) { cnt[it]++; ...
#include <bits/stdc++.h> using namespace std; template <class T> struct vect { private: T memory = new T[0]; unsigned int length; unsigned int sz; public: vect() { length = 0; sz = 0; } inline void incsize(const int len) { T temp = new T[len]; length = le...
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; const int RLEN = 1 << 20 \| 1; inline char gc() { static char ibuf[RLEN], ib, ob; (ob == ib) && (ob = (ib = ibuf) + fread(ibuf, 1, RLEN, stdin)); return (ob == ib) ? EOF : *ib++; } inline int read() { char ch = getchar...
#include <bits/stdc++.h> using namespace std; int main() { int d1, d2, d3; cin >> d1 >> d2 >> d3; cout << min(min(d1 + d2 + d3, 2 * (d1 + d2)), min(2 * (d1 + d3), 2 * (d2 + d3))); return 0; }
#include <bits/stdc++.h> using namespace std; void solve(); int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); solve(); return 0; } const int inf = 2e9; const long long linf = 2e18; const long long mod = 998244353; const int N = 2e5 + 100; vector<int> g[N]; struc...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; int ma = INT_MIN; string ans = nah ; while (n--) { string s; int s1, s2, a, b, c, d, e; cin >> s; cin >> s1 >> s2 >> a >> b >> c >> d >> e; ...
#include <bits/stdc++.h> using namespace std; int main() { long long int k, n; cin >> n >> k; long long int half, d, c; half = (n / 2); d = (half / (k + 1)); c = (k * d); cout << d << << c << << (n - c - d); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, f, i, j; cin >> n >> f; long long ans(0), k, l, mini; vector<pair<long long, long long> > v, v1; for (i = 0; i < n; i++) { cin >> k >> l; v.push_back(make_pair(k, l)); } for (i = 0; i < n; i++) { v1.push_...
#include <bits/stdc++.h> int main() { long long a, m, c, i; scanf( %I64d %I64d , &a, &m); for (i = 0; i <= 700; i++) { c = a % m; if (c == 0) break; a = a + c; } if (c == 0) { printf( Yes ); } else printf( No ); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 2e5; const int INF = 0x3f3f3f3f; const long long LIM = 4e14; const int mod = 1e9 + 7; int n, m, ans[N + 10]; long long l[N + 10], r[N + 10]; struct Node { int idx; long long l, r; bool friend operator<(Node c, Node d) { return !(c.r...
#include <bits/stdc++.h> using namespace std; long long n, m, q, k, v[300050], ans, d; pair<long long, long long> w[300050]; string second; int32_t main() { ios::sync_with_stdio(false); cin.tie(0); cin >> q; while (q--) { cin >> d >> m; if (d <= 3) { if (d == 1) c...
#include <bits/stdc++.h> using namespace std; int k, n; bool contain_same; string s[5005], t[5005]; bool check(int x, int y) { swap(s[0][x], s[0][y]); for (int i = 1; i < k; ++i) { int dif = 0; for (int j = 0; j < n; ++j) { if (s[0][j] != s[i][j]) ++dif; } if (dif == 2 ...
#include <bits/stdc++.h> using namespace std; map<long long, bool> mp; long long b, q, l, n, x, ans; signed main() { scanf( %lld%lld%lld%lld , &b, &q, &l, &n); if (abs(b) > l) { printf( 0 ); return 0; } if (l < 0) l = -l; for (long long i = 1; i <= n; i++) { scanf( %lld , &...
#include <bits/stdc++.h> using namespace std; long long int t, n, m, k; string s; long long int dp[30][30004]; long long int frq[30]; int main() { ios::sync_with_stdio(0); cin.tie(0); long long int i, j, x; cin >> t; while (t--) { cin >> n >> m >> k; cin >> s; long long...
#include <bits/stdc++.h> using namespace std; int main() { int k, m, n1, n2; cin >> n1 >> n2 >> k >> m; vector<int> a(n1); for (int i = 0; i < a.size(); ++i) cin >> a[i]; vector<int> b(n2); for (int i = 0; i < b.size(); ++i) cin >> b[i]; if (a[k - 1] < b[n2 - m]) cout << YES n ; ...
#include <bits/stdc++.h> using namespace std; string input() { int n; string sequence; cin >> n >> sequence; return sequence; } int getMaxBalance(const string &sequence) { int balance = 0; int maxBalance = 0; for (char bracket : sequence) { balance += (bracket == [ ) - (bracke...
#include <bits/stdc++.h> using namespace std; struct SegmentTree { int l, r, val, lazy; } t[800005]; int n, q, a[200005]; void build(int l, int r, int p) { t[p].l = l; t[p].r = r; if (l == r) { t[p].val = a[l]; return; } int mid = (l + r) >> 1; build(l, mid, p << 1); ...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; string s; cin >> s; string ans = s; int k_prime = 1; for (int k = 0; k < n; k++) { string t = s; rotate(t.begin(), t.begin() + k, t.end());...
#include <bits/stdc++.h> using namespace std; template <typename T> T gcd(T a, T b) { while (b) { T c = a % b; a = b; b = c; } return a; } template <typename T> T lcm(T a, T b) { assert(a / gcd(a, b) <= numeric_limits<T>::max() / b); return a * (b / gcd(a, b)); } cl...
#include <bits/stdc++.h> using namespace std; int n, p; double l[100100], r[100100], s[100100]; long long ans; double c; int main() { cin >> n >> p; for (int i = 0; i < n; i++) { cin >> l[i] >> r[i]; s[i] = 1 - (floor(r[i] / p) - ceil(l[i] / p) + 1) / (r[i] - l[i] + 1); } for (in...
#include <bits/stdc++.h> using namespace std; string a, b; int main() { int n; while (cin >> n) { cin >> a >> b; long long ans = 0; long long x = 0, y = 0, p = 0, q = 0; for (int i = 0; i < n; i++) if (b[i] == 1 ) a[i] == 0 ? x++ : y++; for (int i = 0; i < n; i++) ...
#include <bits/stdc++.h> using namespace std; long long a, b, c, n, m, k, x, y, z, cnt, ans, tt; string s; vector<long long> v, q, t; int main() { long long c0, c1, h; cin >> tt; while (tt--) { cin >> n >> c0 >> c1 >> h >> s; cnt = 0; ans = 0; for (long long i = 0; i < s.si...
#include <bits/stdc++.h> using namespace std; const int FFF = 200005; int a[FFF], b[FFF]; int qsearch(int x, int r) { int l = 1, mid; while (l <= r) { mid = (l + r) >> 1; if (b[mid] < x) l = mid + 1; else r = mid - 1; } return r; } int main() { int n, m;...
#include <bits/stdc++.h> using namespace std; long long ans; int main() { vector<int> a(3); for (size_t i = 0; i < 3; i++) { cin >> a[i]; } sort(a.begin(), a.end()); cout << ((a[1] + a[0] > a[2]) ? 0 : (-a[1] - a[0] + a[2] + 1)); }
#include <bits/stdc++.h> using namespace std; int n, m, s, t, d[200005], v[200005], dd[200005], ma[1005][1005], ok = 1, y, ans; int main() { scanf( %d%d%d%d , &n, &m, &s, &t); for (int i = 1; i <= m; i++) { int x, y; scanf( %d...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 7; struct note { int x, id; } q[maxn]; int st[maxn][20], st1[maxn][20], a[maxn], n, dp[maxn]; int head, tail; void init(int n) { for (int i = 1; i <= n; i++) st1[i][0] = st[i][0] = a[i]; for (int j = 1; j < 20; j++) for...
#include <bits/stdc++.h> using namespace std; const double eps = 1e-8; const int MAXN = 1e2 + 5; const long long MOD = 1e9 + 7; int a[1005][3000]; int main() { int n, s, d; int maxx = 0; cin >> n; for (int i = 0; i < n; i++) { cin >> s >> d; for (int j = s; j <= 100000000; j += d...
#include <bits/stdc++.h> using namespace std; const int N = 210003; double a[N], b[N]; int n; double checkMa(double x) { for (int i = 1; i <= n; i++) b[i] = a[i] - x; double ans = 0, tpans = 0; for (int i = 1; i <= n; i++) { tpans += b[i]; if (tpans < 0) tpans = 0; ans = max(ans,...
#include <bits/stdc++.h> using namespace std; template <class T> bool remin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; } template <class T> bool remax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; } int nxt(...
#include <bits/stdc++.h> #pragma GCC optimize( O2 ) using namespace std; const int MAX = 2e6 + 5; const long long MAX2 = 11; const int MOD = 1000000000 + 7; const long long INF = 2e18; const int dr[] = {1, 0, -1, 0, 1, 1, -1, -1, 0}; const int dc[] = {0, 1, 0, -1, 1, -1, 1, -1, 0}; const double pi = a...
#include <bits/stdc++.h> using namespace std; inline long long read() { long long x = 0; char ch = getchar(); bool f = 0; for (; !isdigit(ch); ch = getchar()) if (ch == - ) f = 1; for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - 0 ; return f ? -x : x; } void write(long long ...
#include <bits/stdc++.h> using namespace std; long long a[2005], b[2005], pos; int n, m; inline long long mabs(long long x) { return x > 0 ? x : -x; } inline bool judge(long long x) { int p = 1; for (int i = 1; i <= n; i++) { while (p <= m && mabs(b[p] - a[i]) + mabs(b[p] - pos) > x) p++; ...

#include <bits/stdc++.h> using namespace std; const signed long long INF = 1000000100; const long double EPS = 1e-9; const long double Pi = 2 * atanl(1.0); template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &p) { return os << ( << p.first << , << p.second << ) ; }...

#include <bits/stdc++.h> inline int Get() { char ch; while ((ch = getchar()) < 0 || ch > 9 ) ; int Num = ch - 0 ; while ((ch = getchar()) >= 0 && ch <= 9 ) Num = (Num << 3) + (Num << 1) + ch - 0 ; return Num; } const int M = 3e3 + 5; const int m = 3000; int n, a[M][M], ...

#include <bits/stdc++.h> using namespace std; const double EPS = 1e-8; int t1, t2, x1, x2, t0; int main() { scanf( %d %d %d %d %d , &t1, &t2, &x1, &x2, &t0); long long k1 = t0 - t1, k2 = t2 - t0; if (k1 == 0) { printf( %d %d n , x1, t1 == t2 ? x2 : 0); } else if (k2 == 0) { printf( %...

#include <bits/stdc++.h> using namespace std; void __print(int x) { cerr << x; } void __print(long x) { cerr << x; } void __print(long long x) { cerr << x; } void __print(unsigned x) { cerr << x; } void __print(unsigned long x) { cerr << x; } void __print(unsigned long long x) { cerr << x; } void __prin...

#include <bits/stdc++.h> using namespace std; int main() { long long int n1, n2, i, j, n, ma = 0, temp, c; cin >> n1 >> n2; if (n1 < n2) { cout << 2 ; } else { cout << n1; } return 0; }

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); unsigned long long int n, ans, i, j, k; cin >> n; if (n == 0) { cout << 1 << endl; return 0; } ans = 2 * n * n; ans = ans + ((n + 2) * (n + 1)) - 1; cout << a...

#include <bits/stdc++.h> using namespace std; vector<int> adj[200001]; int dis[200001]; int par[200001]; void addEdge(int u, int v) { adj[u].push_back(v); adj[v].push_back(u); } void dfs(int src, int parent, int dist) { dis[src] = dist; par[src] = parent; for (int child : adj[src]) { ...

#include <bits/stdc++.h> using namespace std; const int maxn = 3e3 + 10; vector<int> occ[maxn]; int dp[maxn][maxn], a[maxn]; void solve() { int n; cin >> n; int ptr = 0; for (int i = 1; i <= n; i++) { cin >> a[++ptr]; if (ptr > 1 and a[ptr] == a[ptr - 1]) ptr--; } n = ptr; ...

#include <bits/stdc++.h> using namespace std; int solve(int A, int B) { int count = 0; for (int i = 0; i < 32; i++) { if (((A >> i) & 1) != ((B >> i) & 1)) { count++; } } return count; } int main() { int n, m, k; cin >> n >> m >> k; std::vector<int> arr(m + 1); ...

#include <bits/stdc++.h> using namespace std; int a[2001]; int main() { int n, b, s = 0, m, s1, i; scanf( %d%d , &n, &b); for (i = 0; i < n; i++) scanf( %d , &a[i]); for (i = 0; i < n; i++) { if (i == n - 1) s1 = b; else { m = *max_element(a + i, a + n); s1 = (b...

#include <bits/stdc++.h> using namespace std; int main() { int n, i, j, sum, min = 1000000000; cin >> n; int k[n]; for (i = 0; i < n; i++) cin >> k[i]; for (i = 0; i < n; i++) { sum = 0; int m[k[i]]; for (j = 0; j < k[i]; j++) { cin >> m[j]; sum = sum + 5 * m[j]...

#include <bits/stdc++.h> using namespace std; int n; void work(int n) { map<int, int> v; int ans = 0; for (int i = 0; i <= n; i++) { for (int j = 0; j <= n; j++) { for (int k = 0; k <= n; k++) { for (int x = 0; x <= n; x++) { if (i + j + k + x == n) { ...

#include <bits/stdc++.h> using namespace std; int main() { long long n, k; cin >> n >> k; if (k >= 2 * n) { cout << 0; return 0; } long long q = k / 2, z; if (k <= n) z = k - 1; else z = n; if (k & 1) { long long ans = min(q - 1, z - q - 1); ans++;...

#include <bits/stdc++.h> using namespace std; int u, v; const int maxn = 5e3 + 10; vector<long long> G[maxn]; bool visited[maxn]; long long dp[maxn]; vector<long long> vc[maxn]; bool mark[maxn]; long long n; vector<long long> ans; void dfs(int x) { visited[x] = 1; for (int i = 0; i != G[x]...

#include <bits/stdc++.h> using namespace std; int main() { int t, n, m, x, y, cost, i, j; string s; cin >> t; while (t--) { cost = 0; cin >> n >> m >> x >> y; y = min(y, 2 * x); for (i = 0; i < n; i++) { cin >> s; for (j = 0; j < m; j++) { if (s[j] =...

#include <bits/stdc++.h> using namespace std; int main() { long long test; cin >> test; while (test--) { long long b, p, f, h, c; cin >> b >> p >> f >> h >> c; long long profit = 0; if (h > c) { if (b - 2 * p >= 0) { profit += p * h; b = b - 2 * p; ...

#include <bits/stdc++.h> int n, m; long long k; long long pow(int n) { if (n == 0) return 1; long long tmp = pow(n >> 1); tmp = tmp * tmp % 1000000009ll; if (n & 1) tmp = tmp * 2ll % 1000000009ll; return tmp; } int main() { scanf( %d%d%I64d , &n, &m, &k); int t = n - m; long lo...

#include <bits/stdc++.h> using namespace std; const int INF = 0x7f7f7f7f; char s[1005]; int dp[1005][2]; int main() { int n; scanf( %d , &n); scanf( %s , s); if (1 == n) { puts( 0 ); return 0; } memset(dp, 0x7f, sizeof(dp)); dp[0][s[0] - 0 ] = 0; dp[0][(s[0] - 0 )...

#include <bits/stdc++.h> using namespace std; vector<vector<pair<int, int> > > AdjList; priority_queue<pair<int, pair<int, int> > > Edgelist; int n, j, k, m, l, t, i; string s, ss; int a[1050][1050]; int main() { cin >> n; for (i = 0; i < n; i++) { for (j = 0; j < n; j++) { scanf( %d...

#include <bits/stdc++.h> using namespace std; int a[100000 + 5], nxt[100000 + 5], lst[100000 + 5], fi[100000 + 5]; int cnt, root[100000 + 5]; struct node { int sum, ls, rs; } t[100000 * 43 + 5]; int build(int l, int r) { int id = ++cnt; if (l == r) { t[id].sum = fi[l]; return id; ...

#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3fll; mt19937 rng((int)chrono::steady_clock::now().time_since_epoch().count()); struct kuhn { int n, m; vector<vector<int>> g; vector<int> vis, ma, mb; kuhn(int n_, int m_) : n(n_),...

#include <bits/stdc++.h> const int mo = 998244353, N = 2005; int n, a[N][N], ia[N][N], i, j, f[N][N], bi[N], mi[N], fac[N], ans; inline void add(int x, int v = 1) { for (; x <= n; x += x & -x) bi[x] += v; } inline int ask(int x) { int ans = 0; for (; x; x -= x & -x) ans += bi[x]; return ans; ...

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

#include <bits/stdc++.h> using namespace std; int get(char *s) { if (s[0] == 8 && s[1] == < ) return 1; if (s[0] == [ && s[1] == ] ) return 2; if (s[0] == ( && s[1] == ) ) return 3; } int check(int a, int b) { if (a == 1 && b == 2 || a == 2 && b == 3 || a == 3 && b == 1) return 1; i...

#include <bits/stdc++.h> using namespace std; int main() { long long int nn, i, j, k; cin >> nn; long long int a[nn]; for (i = 0; i < nn; i++) cin >> a[i]; sort(a, a + nn); for (i = 0; i < nn; i++) { for (j = i + 1; j < nn; j++) { if (a[i] != -1 && a[j] != -1 && a[j] % a[i] == ...

#include <bits/stdc++.h> using namespace std; const int N = 100005; long long ara[N]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); long long n; cin >> n; long long mx = 0; for (long long i = 0; i < n; ++i) { cin >> ara[i]; while (ara[i] % 2 == 0) ara[i] /= 2; ...

#include <bits/stdc++.h> using namespace std; const long long int N = 100005; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); { long long int i, j, k, n, m, ans = 0, cnt = 0, sum = 0; cin >> n; vector<long long int> v; cout << n << ; ...

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

#include <bits/stdc++.h> using namespace std; long long arr[100005]; long long ans = 0; long long temp[100005]; bool is(int m, string s) { set<char> ss; map<char, int> mp; for (int i = 0; i < m; i++) { ss.insert(s[i]); mp[s[i]]++; } if (ss.size() == ans) return true; for (i...

#include <bits/stdc++.h> using namespace std; const int N = 2005; const int MOD = 1000000007; int d, n; int a[N]; int ord[N], rnk[N]; vector<int> v[N]; inline bool cmp(int x, int y) { return a[x] > a[y]; } int ans = 0; int sz[N]; inline void dfs(int x, int top) { sz[x] = 1; for (int i = 0;...

#include <bits/stdc++.h> using namespace std; template <typename T, typename U> inline void smin(T &a, const U &b) { if (a > b) a = b; } template <typename T, typename U> inline void smax(T &a, const U &b) { if (a < b) a = b; } template <typename T> inline void gn(T &first) { char c, sg = ...

#include <bits/stdc++.h> using namespace std; const int N = 1005; vector<pair<int, int>> g[N], ans[N]; long long dist[N]; priority_queue<pair<int, int>> pq; bool vis[N]; void dijkstra(int s) { fill(dist, dist + N, 1LL << 61); memset(vis, false, sizeof(vis)); dist[s] = 0; pq.push({0, s}); ...

#include <bits/stdc++.h> using namespace std; const long long inf = (long long)1e18; const long long mod = (long long)1e9 + 7; const double eps = (double)1e-9; const double pi = acos(-1.0); const int dx[] = {0, 0, 1, 0, -1}; const int dy[] = {0, 1, 0, -1, 0}; const int N = 300500; int n, l[N], r[N], a...

#include <bits/stdc++.h> template <typename T> class IntegerIterator { public: using value_type = T; using difference_type = std::ptrdiff_t; using pointer = T*; using reference = T; using iterator_category = std::input_iterator_tag; explicit IntegerIterator(T value) : value(value) {} ...

#include <bits/stdc++.h> using namespace std; const int G = 3; const int MOD = 998244353; const int N = (1 << 15) + 5; int rev[N], w[N], inv_n; int bigMod(int a, int e, int mod) { if (e == -1) e = mod - 2; int ret = 1; while (e) { if (e & 1) ret = (long long)ret * a % mod; a = (long ...

#include <bits/stdc++.h> using namespace std; int p[100003]; int n; int main() { int i; scanf( %d , &n); if (n == 1) { printf( 1 n ); return 0; } if (n == 2) { printf( -1 n ); return 0; } if (n % 2 != 0) p[n / 2 + 1] = n / 2 + 1; p[1] = 2; p[2] = n; ...

#include <bits/stdc++.h> using namespace std; void use_cio() { ios_base::sync_with_stdio(0); cin.tie(0); } template <typename... Args> void dbg(Args... args) { ((cout << args << ), ...); cout << endl; } int n; int ask(int r1, int c1, int r2, int c2) { string ans; dbg( ? , r1, ...

#include <bits/stdc++.h> using namespace std; long long dp[15][1 << 15]; int n, m, q; struct NodeLCA { int a, b, c; }; vector<pair<int, int> > path; vector<NodeLCA> LCA; void readData() { cin >> n >> m >> q; for (int i = 0; i < m; i++) { int u, v; cin >> u >> v; u--; ...

#include <bits/stdc++.h> using namespace std; signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int n, m, k, count = 0; cin >> n >> m >> k; long long int s = n * m; long long int a[s], b[s]; for (long long int i = 0; i < s; i++) cin >> a[i]; ...

#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; int n, k; int arr[N]; int a, b; vector<int> v[N]; int tmp[N]; int subtree1[N]; int subtree2[N]; int sum[N]; int bst1[N]; int bst2[N]; bool ret; void dfs(int node, int parent) { subtree1[node] = 1; subtree2[node] = t...

#include <bits/stdc++.h> using namespace std; struct Bus { long long s, t; }; bool cmp(Bus &a, Bus &b) { return a.t < b.t; } long long n, m, it[4 * 111111], tmp = 1, l, r; Bus bus[111111]; vector<long long> positions; void update(int idx, int l, int r, int pos, long long val) { if (pos < l || po...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 7; int n, k; string s; bool can_del(char c) { int l = N, r = -1; for (int i = 0; i < n; ++i) { if (s[i] == c) { l = min(l, i); r = max(r, i); } } return r - l + 1 <= k; } string ans1 = tokitsukaz...

#include <bits/stdc++.h> using namespace std; int main() { int n, size = 1e6 + 1; cin >> n; vector<int> prime(1e6 + 1, 1); prime[0] = 0; prime[1] = 0; for (int ri = 2; ri <= sqrt(size); ri++) { if (prime[ri]) { for (int pi = ri * ri; pi <= size; pi += ri) if (prime[pi...

#include <bits/stdc++.h> using namespace std; const int maxn = 200010; int a[maxn]; int main() { int t; cin >> t; while (t--) { string s; cin >> s; int m = s.length(); int fa = 0, fb = 0, fc = 0; for (int i = 0; i < m; i++) { if (s[i] == 1 && fa == 0) fa = i +...

#include <bits/stdc++.h> using namespace std; const int MaxLg = 25, inf = 1e9 + 100; int n; bool flag; vector<int> out, mins[2][MaxLg]; void output() { if (flag) cout << -1 << n ; else cout << out.size() << n ; for (auto i : out) cout << i << ; cout << endl; } void inp...

#include <bits/stdc++.h> const bool debugging = 1; const long long mod = 1e9 + 7; using namespace std; template <class T> ostream &operator<<(ostream &os, vector<T> V) { for (auto v : V) { os << v << ; } return os << ; } template <class T> ostream &operator<<(ostream &os, vector<v...

#include <bits/stdc++.h> const double PI = 3.141592653589793238462643383279502884197169399375105820974944; using namespace std; const int MOD = 1e9 + 7; double gcd(double a, double b) { return a < 0.01 ? b : gcd(fmod(b, a), a); } template <typename T> T mymax(T a, T b) { return (a > b) ? a : b; ...

#include <bits/stdc++.h> using namespace std; int main() { int n, x[5], y[5], i; cin >> n; for (i = 1; i <= n; i++) cin >> x[i] >> y[i]; if (n == 1) cout << -1; else if (n == 2) { if (x[1] != x[2] && y[1] != y[2]) cout << abs(x[1] - x[2]) * abs(y[1] - y[2]); else ...

#include<iostream> using namespace std; int main() { int t; cin>>t; while(t--) { int Xa,Ya,Xb,Yb,Xf,Yf,sum; cin>>Xa>>Ya>>Xb>>Yb>>Xf>>Yf; sum=abs(Xa-Xb)+abs(Ya-Yb); if(Xa==Xb&&Xb==Xf) { if(Ya<Yf&&Yb>Yf||Ya>Yf&&Yb<Yf) sum+=2; ...

#include <bits/stdc++.h> using namespace std; int main() { int n, k, i, teo = 0, s = 0, a[100001], t[100001]; cin >> n >> k; for (i = 1; i <= n; i++) cin >> a[i]; for (i = 1; i <= n; i++) { cin >> t[i]; if (t[i] == 1) { teo = teo + a[i]; a[i] = 0; } a[i] = a[i...

#include <bits/stdc++.h> #pragma comment(linker, /stack:640000000 ) using namespace std; const double EPS = 1e-9; const int INF = 0x7f7f7f7f; const double PI = acos(-1.0); template <class T> inline T gcd(T a, T b) { return (b) == 0 ? (a) : gcd((b), ((a) % (b))); } template <class T> inline T lc...

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

#include <bits/stdc++.h> using namespace std; int read() { int X = 0, w = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) w = -1; c = getchar(); } while (c >= 0 && c <= 9 ) X = X * 10 + c - 0 , c = getchar(); return X * w; } const int N = 1500 + 10, K = ...

#include <bits/stdc++.h> using namespace std; enum { MAXN = 4010, MAXC = 26 }; int dp[MAXN][MAXN]; char sa[MAXN], sb[MAXN]; int pra[MAXN][MAXC], prb[MAXN][MAXC]; int main() { int ci, cd, cr, cs; scanf( %d%d%d%d , &ci, &cd, &cr, &cs); scanf( %s , sa + 1); scanf( %s , sb + 1); int la = str...

#include <bits/stdc++.h> using namespace std; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long int n; cin >> n; long long int a[n]; long long int sum = 0; for (long long int i = 0; i < n; i++) { cin >> a[i]; sum += a[i]; } sor...

#include <bits/stdc++.h> using namespace std; int w, m; long long x = 1; bool f = 1; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> w >> m; while (m && f) { if ((m - 1) % w == 0 || m % w == 0 || (m + 1) % w == 0) { if ((m - 1) % w == 0 || m % w == 0) ...

#include <bits/stdc++.h> using namespace std; const long long nax = 1e5 + 10; vector<long long> g[nax]; signed main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); ; long long n; cin >> n; long long f = 0; vector<pair<pair<long long, long long>, long long> > a(n - 2); for (long...

#include <bits/stdc++.h> int main() { int n, i, j, k; scanf( %d , &n); int a[1000]; int b[1000]; int c[6] = {0}; int d[6] = {0}; int sum = 0; for (i = 0; i < n; i++) { scanf( %d , &a[i]); c[a[i]]++; } for (i = 0; i < n; i++) { scanf( %d , &b[i]); d[b[i]]...

#include <bits/stdc++.h> using namespace std; const int LN = 18, maxn = (1 << LN); const long long mod = (long long)(998244353); int fact[maxn], inv_fact[maxn], poww_r[maxn], poww_inv_r[maxn]; int mul(long long a, long long b) { long long ret = (a * b) % mod; return (int)(ret); } int add(int a, in...

#include <bits/stdc++.h> using namespace std; char s[20005]; struct SuffixArray { int wa[20005], wb[20005], cnt[20005], wv[20005]; int rk[20005], height[20005]; int sa[20005]; bool cmp(int r[], int a, int b, int l) { return r[a] == r[b] && r[a + l] == r[b + l]; } void calcSA(char r[]...

#include <bits/stdc++.h> using namespace std; const int maxn = 100005; const int inf = 1 << 30; const long long INF = 1ll << 61; const double oo = 1 << 30; const long long zqc = 1e9 + 7; int n, k; int t, x; vector<int> a; int gcd(int a, int b) { return !b ? a : gcd(b, a % b); } int main() { sc...

#include <bits/stdc++.h> using namespace std; int main() { int n, m, d, cot = 0; cin >> n >> m >> d; int arr[10004] = {0}; int rn = n * m; for (int j = 1; j <= rn; j++) cin >> arr[j]; sort(arr, arr + rn); int ind = arr[rn / 2]; if (n * m == 1) { cout << 0; return 0; }...

#include <bits/stdc++.h> using namespace std; const int MAX_N = 2e3; vector<int> e[MAX_N], d; vector<char> flag; void dfs(int v) { if (d[v] != -1) return; d[v] = 1; for (int to : e[v]) { dfs(to); d[v] = max(d[v], d[to] + 1); } } int main() { int n; scanf( %d , &n); ...

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

#include <bits/stdc++.h> using namespace std; int n; long long arr[5005], parent[5005], ans[5005]; long long dist[5005][5005]; vector<int> v[5005], order; priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > pq[5005]; void dfs(int cur, int prev) { p...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; for (int i = 0; i < n; ++i) { int x, y; cin >> x >> y; if ((x == 1 || x == 2 && 3 < y || x == 3 && x < y) && x != y) { cout << NO << endl; } else cout << YES << endl; } }

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int arr[n]; int x = 0; string str[n]; for (int i = 0; i < n; i++) { cin >> str[i]; if (str[i][1] == + ) { x++; } else { x--; } } cout << x; return 0; }

#include <bits/stdc++.h> using namespace std; long long b, d; string a, c; map<long long, long long> need[150]; int main() { cin >> b >> d; cin >> a >> c; string h = ; long long ans = 0; long long sizea = a.size(); long long sizec = c.size(); for (int i = 0; i < sizec; i++) { ...

#include <bits/stdc++.h> using namespace std; vector<int> adj[100100], ans; int arr[100100], cnt[100100]; bool visited[100100]; int n, m; void dfs(int v) { for (vector<int>::iterator it = adj[v].begin(); it != adj[v].end(); it++) { cnt[*it]++; if (cnt[*it] == arr[*it]) { cnt[*it]++; ...

#include <bits/stdc++.h> using namespace std; template <class T> struct vect { private: T *memory = new T[0]; unsigned int length; unsigned int sz; public: vect() { length = 0; sz = 0; } inline void incsize(const int len) { T *temp = new T[len]; length = le...

#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; const int RLEN = 1 << 20 | 1; inline char gc() { static char ibuf[RLEN], *ib, *ob; (ob == ib) && (ob = (ib = ibuf) + fread(ibuf, 1, RLEN, stdin)); return (ob == ib) ? EOF : *ib++; } inline int read() { char ch = getchar...

#include <bits/stdc++.h> using namespace std; int main() { int d1, d2, d3; cin >> d1 >> d2 >> d3; cout << min(min(d1 + d2 + d3, 2 * (d1 + d2)), min(2 * (d1 + d3), 2 * (d2 + d3))); return 0; }

#include <bits/stdc++.h> using namespace std; void solve(); int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); solve(); return 0; } const int inf = 2e9; const long long linf = 2e18; const long long mod = 998244353; const int N = 2e5 + 100; vector<int> g[N]; struc...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; int ma = INT_MIN; string ans = nah ; while (n--) { string s; int s1, s2, a, b, c, d, e; cin >> s; cin >> s1 >> s2 >> a >> b >> c >> d >> e; ...

#include <bits/stdc++.h> using namespace std; int main() { long long int k, n; cin >> n >> k; long long int half, d, c; half = (n / 2); d = (half / (k + 1)); c = (k * d); cout << d << << c << << (n - c - d); return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int n, f, i, j; cin >> n >> f; long long ans(0), k, l, mini; vector<pair<long long, long long> > v, v1; for (i = 0; i < n; i++) { cin >> k >> l; v.push_back(make_pair(k, l)); } for (i = 0; i < n; i++) { v1.push_...

#include <bits/stdc++.h> int main() { long long a, m, c, i; scanf( %I64d %I64d , &a, &m); for (i = 0; i <= 700; i++) { c = a % m; if (c == 0) break; a = a + c; } if (c == 0) { printf( Yes ); } else printf( No ); return 0; }

#include <bits/stdc++.h> using namespace std; const int N = 2e5; const int INF = 0x3f3f3f3f; const long long LIM = 4e14; const int mod = 1e9 + 7; int n, m, ans[N + 10]; long long l[N + 10], r[N + 10]; struct Node { int idx; long long l, r; bool friend operator<(Node c, Node d) { return !(c.r...

#include <bits/stdc++.h> using namespace std; long long n, m, q, k, v[300050], ans, d; pair<long long, long long> w[300050]; string second; int32_t main() { ios::sync_with_stdio(false); cin.tie(0); cin >> q; while (q--) { cin >> d >> m; if (d <= 3) { if (d == 1) c...

#include <bits/stdc++.h> using namespace std; int k, n; bool contain_same; string s[5005], t[5005]; bool check(int x, int y) { swap(s[0][x], s[0][y]); for (int i = 1; i < k; ++i) { int dif = 0; for (int j = 0; j < n; ++j) { if (s[0][j] != s[i][j]) ++dif; } if (dif == 2 ...

#include <bits/stdc++.h> using namespace std; map<long long, bool> mp; long long b, q, l, n, x, ans; signed main() { scanf( %lld%lld%lld%lld , &b, &q, &l, &n); if (abs(b) > l) { printf( 0 ); return 0; } if (l < 0) l = -l; for (long long i = 1; i <= n; i++) { scanf( %lld , &...

#include <bits/stdc++.h> using namespace std; long long int t, n, m, k; string s; long long int dp[30][30004]; long long int frq[30]; int main() { ios::sync_with_stdio(0); cin.tie(0); long long int i, j, x; cin >> t; while (t--) { cin >> n >> m >> k; cin >> s; long long...

#include <bits/stdc++.h> using namespace std; int main() { int k, m, n1, n2; cin >> n1 >> n2 >> k >> m; vector<int> a(n1); for (int i = 0; i < a.size(); ++i) cin >> a[i]; vector<int> b(n2); for (int i = 0; i < b.size(); ++i) cin >> b[i]; if (a[k - 1] < b[n2 - m]) cout << YES n ; ...

#include <bits/stdc++.h> using namespace std; string input() { int n; string sequence; cin >> n >> sequence; return sequence; } int getMaxBalance(const string &sequence) { int balance = 0; int maxBalance = 0; for (char bracket : sequence) { balance += (bracket == [ ) - (bracke...

#include <bits/stdc++.h> using namespace std; struct SegmentTree { int l, r, val, lazy; } t[800005]; int n, q, a[200005]; void build(int l, int r, int p) { t[p].l = l; t[p].r = r; if (l == r) { t[p].val = a[l]; return; } int mid = (l + r) >> 1; build(l, mid, p << 1); ...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; string s; cin >> s; string ans = s; int k_prime = 1; for (int k = 0; k < n; k++) { string t = s; rotate(t.begin(), t.begin() + k, t.end());...

#include <bits/stdc++.h> using namespace std; template <typename T> T gcd(T a, T b) { while (b) { T c = a % b; a = b; b = c; } return a; } template <typename T> T lcm(T a, T b) { assert(a / gcd(a, b) <= numeric_limits<T>::max() / b); return a * (b / gcd(a, b)); } cl...

#include <bits/stdc++.h> using namespace std; int n, p; double l[100100], r[100100], s[100100]; long long ans; double c; int main() { cin >> n >> p; for (int i = 0; i < n; i++) { cin >> l[i] >> r[i]; s[i] = 1 - (floor(r[i] / p) - ceil(l[i] / p) + 1) / (r[i] - l[i] + 1); } for (in...

#include <bits/stdc++.h> using namespace std; string a, b; int main() { int n; while (cin >> n) { cin >> a >> b; long long ans = 0; long long x = 0, y = 0, p = 0, q = 0; for (int i = 0; i < n; i++) if (b[i] == 1 ) a[i] == 0 ? x++ : y++; for (int i = 0; i < n; i++) ...

#include <bits/stdc++.h> using namespace std; long long a, b, c, n, m, k, x, y, z, cnt, ans, tt; string s; vector<long long> v, q, t; int main() { long long c0, c1, h; cin >> tt; while (tt--) { cin >> n >> c0 >> c1 >> h >> s; cnt = 0; ans = 0; for (long long i = 0; i < s.si...

#include <bits/stdc++.h> using namespace std; const int FFF = 200005; int a[FFF], b[FFF]; int qsearch(int x, int r) { int l = 1, mid; while (l <= r) { mid = (l + r) >> 1; if (b[mid] < x) l = mid + 1; else r = mid - 1; } return r; } int main() { int n, m;...

#include <bits/stdc++.h> using namespace std; long long ans; int main() { vector<int> a(3); for (size_t i = 0; i < 3; i++) { cin >> a[i]; } sort(a.begin(), a.end()); cout << ((a[1] + a[0] > a[2]) ? 0 : (-a[1] - a[0] + a[2] + 1)); }

#include <bits/stdc++.h> using namespace std; int n, m, s, t, d[200005], v[200005], dd[200005], ma[1005][1005], ok = 1, y, ans; int main() { scanf( %d%d%d%d , &n, &m, &s, &t); for (int i = 1; i <= m; i++) { int x, y; scanf( %d...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 7; struct note { int x, id; } q[maxn]; int st[maxn][20], st1[maxn][20], a[maxn], n, dp[maxn]; int head, tail; void init(int n) { for (int i = 1; i <= n; i++) st1[i][0] = st[i][0] = a[i]; for (int j = 1; j < 20; j++) for...

#include <bits/stdc++.h> using namespace std; const double eps = 1e-8; const int MAXN = 1e2 + 5; const long long MOD = 1e9 + 7; int a[1005][3000]; int main() { int n, s, d; int maxx = 0; cin >> n; for (int i = 0; i < n; i++) { cin >> s >> d; for (int j = s; j <= 100000000; j += d...

#include <bits/stdc++.h> using namespace std; const int N = 210003; double a[N], b[N]; int n; double checkMa(double x) { for (int i = 1; i <= n; i++) b[i] = a[i] - x; double ans = 0, tpans = 0; for (int i = 1; i <= n; i++) { tpans += b[i]; if (tpans < 0) tpans = 0; ans = max(ans,...

#include <bits/stdc++.h> using namespace std; template <class T> bool remin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; } template <class T> bool remax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; } int nxt(...

#include <bits/stdc++.h> #pragma GCC optimize( O2 ) using namespace std; const int MAX = 2e6 + 5; const long long MAX2 = 11; const int MOD = 1000000000 + 7; const long long INF = 2e18; const int dr[] = {1, 0, -1, 0, 1, 1, -1, -1, 0}; const int dc[] = {0, 1, 0, -1, 1, -1, 1, -1, 0}; const double pi = a...

#include <bits/stdc++.h> using namespace std; inline long long read() { long long x = 0; char ch = getchar(); bool f = 0; for (; !isdigit(ch); ch = getchar()) if (ch == - ) f = 1; for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - 0 ; return f ? -x : x; } void write(long long ...

#include <bits/stdc++.h> using namespace std; long long a[2005], b[2005], pos; int n, m; inline long long mabs(long long x) { return x > 0 ? x : -x; } inline bool judge(long long x) { int p = 1; for (int i = 1; i <= n; i++) { while (p <= m && mabs(b[p] - a[i]) + mabs(b[p] - pos) > x) p++; ...