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

func_code_string stringlengths 59 71.4k
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; void cmin(long long& x, long long y) { if (x > y) { x = y; } } int n, a[N]; long long f[N][2]; bool best[N][2]; vector<int> adj[N], answer; void dfs1(int u, int p) { long long min_diff = 0; bool go = false; ...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:256000000 ) using namespace std; const int INF = (int)(1e9 + 1e6); const long long LINF = (long long)(4e18); const double EPS = 1e-9; const long long mod = 1e9 + 7; mt19937 ggen; void solve(); int main() { iostream::sync_with_stdio(false); ...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); int x, y; cin >> x >> y; int tx = x - y; int ty = x + y; x = tx; y = ty; if (x < 0) cout << -1 n ; else { int l = 1, r = 1e9 + 5; while (r - l > 1) { int mid = (l + ...
#include <bits/stdc++.h> using namespace std; int nxt() { int res; scanf( %d , &res); return res; } bool is_perm(int *p, int n) { char used[n]; memset(used, 0, sizeof(used)); for (int i = 0; i < n; ++i) { used[p[i]] = 1; } for (int i = 0; i < n; ++i) { if (!used[i]) {...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a, b, i, c = 0; a = 8 * n; b = 9 * n; c = b - a; cout << b << << a << endl; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); std::string data; cin >> data; long long int counter = 0; char ch; for (int i = 0; i < data.length(); i++) { if (data[i] == 0 ) counter++; else counter...
#include <bits/stdc++.h> using namespace std; int f[20]; bool ischange[300000]; int main() { memset(ischange, 0, sizeof ischange); int n; scanf( %d , &n); string a; cin >> a; for (int i = 1; i <= 9; i++) { scanf( %d , &f[i]); } int ff = 0; for (int i = 0; i < a.length()...
#include <bits/stdc++.h> using namespace std; template <class T> void show(T a, int n) { for (int i = 0; i < n; i++) cout << a[i] << ; puts( ); } template <class T> void queue_clear(T a, int n) { for (int i = 0; i < n; i++) { while (!a->empty()) a->pop(); } } template <class...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); string s; int i = 0; cin >> s; int z = 0, o = 0; while (s[i] == 0 ) { i++; } for (; i < s.length(); i++) { if (s[i] == 0 ) { z++; ...
#include <bits/stdc++.h> using namespace std; const int N = 5e3 + 1; char a[N], b[N]; int f[N][N]; int res; int n, m; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> m; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= m; i++) cin >> b[i]...
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; int dp[1501][1501], sum[1501], tsum[1501], pro, ex[2][100001], c[100001], P[1501]; int sp[1501], gp[1501], inv[1501]; int power(int a, int n) { if (n == 0) return 1; int res = power(a, n / 2); res = (int)((long long)res *...
#include <bits/stdc++.h> using namespace std; long long INF; int n; long long v[100005]; int c[100005]; long long mx[100005]; pair<long long, int> st[2]; int q; long long a, b; void solve(long long a, long long b) { long long ans = 0; st[0].first = 0; st[0].second = -2; st[1].first =...
#include <bits/stdc++.h> const int N = 500; using namespace std; int n, yh, yhuo = 0, huo = 0, yu, x = 0, y; char pd; int main() { y = 1023; x = 0; scanf( %d , &n); for (int i = 1; i <= n; i++) { cin >> pd >> yh; if (pd == & ) x &= yh, y &= yh; if (pd == \| ) x \|= yh, y \|= y...
#include <bits/stdc++.h> using namespace std; void solve() { string ss, tt; cin >> ss >> tt; int l = ss.size(); vector<int> s(30); vector<int> t(30); for (int i = 0; i < l; i++) { s[ss[i] - a ]++; t[tt[i] - a ]++; } bool ok = false; for (int i = 0; i < s.size(); i++...
#include <bits/stdc++.h> using namespace std; const int maxn = 2000; int pre[maxn]; int countlen(int i) { int ans = 0, p; for (p = i; p != -2; p = pre[p]) ans++; return ans; } int main() { int i, n; cin >> n; for (i = 0; i < n; i++) cin >> pre[i], pre[i]--; int ans = 0; for (...
#include <bits/stdc++.h> using namespace std; const int MAXN = 100004; long long int a[MAXN]; long long int k, n; vector<long long int> b(MAXN, 0); long long int f(double num) { long long int res = 0; for (int i = 0; i < n; i++) { if (num > a[i] + 0.25) { b[i] = 0; continue; ...
#include <bits/stdc++.h> using namespace std; const int bl = 400, sz = 4e5 + 10; int pr[sz], bor[sz][26], cnt[sz], an[sz], q = 1; char prsy[sz]; vector<pair<int, int> > sp[sz]; vector<int> sv[sz]; void dfs(int v) { int u = v, s = 0; for (int a = 0; (a < bl and u != 0 and s != -1); a++) { s =...
#include <bits/stdc++.h> using namespace std; bool vis[101]; vector<int> a[101]; void dfs(int x) { vis[x] = true; for (int i = 0; i < a[x].size(); i++) if (!vis[a[x][i]]) dfs(a[x][i]); } int main() { int n, m; cin >> n >> m; for (int i = 0; i < m; i++) { int x, y; cin >...
#include <bits/stdc++.h> const int MOD = 1000000007; const int Inv2 = 500000004; inline int mul(int x, int y) { return (long long)x * (long long)y % MOD; } inline int add(int x, int y) { int r = x + y; if (r >= MOD) r -= MOD; return r; } inline int qpow(int a, int p) { int x = a, ans = 1; ...
#include <bits/stdc++.h> using namespace std; int32_t main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long int t, n, m, i, j, k, sum = 0; long long int p, w, d; cin >> n >> p >> w >> d; long long int l = 0; long long int r = n; for (i = 0; i <= w; i++) { ...
#include <bits/stdc++.h> int main() { int q; int a[510][2]; int m = 0; int l1, r1, l2, r2; int flag; scanf( %d , &q); for (int i = 0; i < q; i++) { scanf( %d%d%d%d , &l1, &r1, &l2, &r2); flag = 0; for (int j = l1; j <= r1; j++) { a[m][0] = j; for (int k = ...
#include <bits/stdc++.h> using namespace std; long long modpow(long long a, long long b, long long mod = (long long)(1e9 + 7)) { if (!b) return 1; a %= mod; return modpow(a * a % mod, b / 2, mod) * (b & 1 ? a : 1) % mod; } mt19937 rng(chrono::steady_clock::now().time_since_epoch()...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { int k; string s; cin >> k >> s; s += A ; vector<int> a; for (int i = 0; i < s.size(); i++) { if (s[i] == A ) a.push_...
#include <bits/stdc++.h> using namespace std; const long long int mod = 1e9 + 7; long long x, k; long long qow(long long a, long long b) { long long ans = 1; a = a % mod; while (b) { if (b % 2 == 1) { ans = (ans * a) % mod; } a = (a * a) % mod; b /= 2; } retur...
#include <bits/stdc++.h> using namespace std; int n; struct node { long long x, y; } s, t, dist[100005]; int dx[4] = {0, 0, -1, 1}; int dy[4] = {1, -1, 0, 0}; char wind[100005]; string mov = UDLR ; long long pos, l, r, mid; bool check(long long mid) { long long zq = mid / n, sy = mid % n; ...
#include <bits/stdc++.h> using namespace std; template <typename T> inline void read(T &x) { x = 0; char c = getchar(); bool flag = false; while (!isdigit(c)) { if (c == - ) flag = true; c = getchar(); } while (isdigit(c)) { x = (x << 1) + (x << 3) + (c ^ 48); c = ...
#include <bits/stdc++.h> using namespace std; const long long maxn = 1e5 + 69; const long long Inf = 1e13; long long n, newa[maxn], ans[maxn], newb[maxn]; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; for (long long i = 2; i <= n; i += 2) cin >> ans[i]; for (long lon...
#include <bits/stdc++.h> using namespace std; int la, lb; int a[2000000]; int b[2000000]; int bpos[1000001]; void deb(int* x, int xlow, int xhigh) { cout << [ ; for (int i = xlow; i < xhigh; i++) { cout << << x[i]; } cout << ] ; } int seen[1000001]; int solve() { fill(...
#include <bits/stdc++.h> using namespace std; struct data { string name; int score; data() {} data(string name, int score) : name(name), score(score) {} const bool operator<(const data& other) const { if (score != other.score) return score > other.score; return name < other.name; ...
#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; vector<vector<vector<int> > > dp; vector<vector<int> > tmp; vector<vector<int> > base; int get_dig(int pos, int k) { return (pos < k) ? pos : (get_dig(pos / k, k) + pos % k) % k; } inline int get_val(const vector<vector<int> >...
#include <bits/stdc++.h> using namespace std; const int MAXN = 10001; long long a[MAXN]; int f[MAXN]; long long c[MAXN], b[MAXN]; int n; int main() { cin >> n; for (int i = 0; i < n; ++i) cin >> a[i]; for (int i = 0; i < n; ++i) { long long X = a[i], cnt = 0; while (!(X & 1)) { ...
#include <bits/stdc++.h> using namespace std; int inf = (1 << 30) - 1, n, X, x, y, z, f[510][510], c[510], R, g[510][510], size[510], h[2][510], H[2][510][510], q[510], L[510]; int Lng[510]; double a[510][510]; vector<int> E[510]; void read(int &x) { char ch = getchar(); int mark = 1; for ...
#include <iostream> #include <vector> #include <numeric> #include <algorithm> using namespace std; int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int t; cin >> t; while(t--){ int n; cin >> n; vector<long lon...
#include <bits/stdc++.h> using namespace std; struct line { int l, r; } p[510], q[510]; struct Point { long double x, y; } Q[10], tmp[10]; int vis[10]; long double A, B, C; int n, H, F, tot, cnt; void read(int &x) { char ch = getchar(); int mark = 1; for (; ch != - && (ch < 0 \|...
#include <bits/stdc++.h> using namespace std; int i, j, k, n, t, f[4], ans, a[2048], l1[2048], r2[2048]; int main() { scanf( %d , &n); for (i = 1; i <= n; ++i) { scanf( %d , a + i); l1[i] = l1[i - 1] + (a[i] == 1); for (j = a[i]; ~j; --j) if (f[j] + 1 > f[a[i]]) f[a[i]] = f[j] + ...
#include <bits/stdc++.h> using namespace std; int n, m1, q; int m[102][102]; struct query { int t; int a; int b; int c; }; void rote(int type, int val) { if (type == 1) { int aux = m[val][m1]; for (int i = m1 - 1; i >= 1; i--) m[val][i + 1] = m[val][i]; m[val][1] = aux;...
#include <bits/stdc++.h> const int maxn = 1005; int n, m; int a[maxn], b[maxn]; bool solve(double v) { for (int i = 0; i < n; i++) { if ((m + v) / a[i] <= v) v -= (m + v) / a[i]; else return false; if ((m + v) / b[i] <= v) v -= (m + v) / b[i]; else ret...
#include <bits/stdc++.h> using namespace std; struct info { long long int val, in; }; long long int arr[100010]; info tree[100010 * 4], temp; void init(long long int node, long long int b, long long int e) { if (b == e) { tree[node].val = arr[b]; tree[node].in = b; return; } ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 5e3 + 3; const int INF = 2000000000; inline long long ab(long long x) { return x < 0 ? -x : x; } long long a[MAXN]; int c_a[MAXN]; int l[MAXN], r[MAXN], x[MAXN], t[MAXN]; int main() { int n, m; cin >> n >> m; for (int i = 0; i < ...
#include <bits/stdc++.h> using namespace std; const long long INF = 2000000000000000000LL; const int inf = 0x3f3f3f3f; const long double EPS = 1e-9; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; long long x, i, j, n = 0, t; cin >> x; while (x / 2 != 0) {...
#include <bits/stdc++.h> using namespace std; const int N = 105; long long g[N][N], f[N][N], a[N], d; int n; pair<int, int> p[N]; void FloydWarshall() { for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) f[i][j] = g[i][j]; f[i][i] = 0; } for (int k = 1; k <= n; k++) { ...
#include <bits/stdc++.h> using namespace std; int main() { long long t, s, a, b, c; cin >> t; for (int i = 0; i < t; i++) { cin >> s >> a >> b >> c; cout << s / c + ((s / c) / a) * b << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int lpd(int n) { int ans = -1; for (int i = 2; i * i <= n; i++) { if (n % i == 0) { ans = i; while (n % i == 0) n /= i; } } if (n > 1) ans = n; return ans; } int x, p[1000006], pd, t, ans; int main() { ios::sync_...
#include <bits/stdc++.h> using namespace std; long long int dp[4011][4011]; long long int b[2000000]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int n; cin >> n; long long int a[n]; set<long long int> st; for (int i = 0; i < n; i++) { cin >> a[i]; ...
#include <bits/stdc++.h> using namespace std; int main() { int a = 1, b, c = 0, d = 0, e = 0, f, i = 0, k = 0, j = 0, n = 0, t = 0, l = 0, m = 0, h[3000] = {0}; string s, x; cin >> t; n = 1000000; for (i = 0; i < t; i++) { cin >> b; j = max(j, min(b - 1, 1000000 - b)); } ...
#include <bits/stdc++.h> using namespace std; long long n, m, k; long long cp1[102]; long long cp2[102]; long long dp[102][10002]; long long comb[102][102]; bool mark[102][10002]; long long Calculate_Pow(long long x, long long y) { long long val = 1; for (long long i = 1, t = x; i <= y; i <<= 1,...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 5; const int mod = 1e9 + 7; vector<int> G[maxn]; char s[maxn]; int vis[maxn]; map<string, int> mp; long long a[maxn], n, L, R, t; void solve1() { L = 0, R = n; for (int i = 0; i <= n - 2; i++) { if (s[i] == < ) ...
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const int C = 26; void add(int &x, int y) { x += y; while (x >= MOD) x -= MOD; while (x < 0) x += MOD; } int fix(int x) { while (x >= MOD) x -= MOD; while (x < 0) x += MOD; return x; } int pw(int a, int b) { ...
#include <bits/stdc++.h> using namespace std; int n; vector<int> a[2002]; int b[2002]; vector<int> ans[4]; void Work() { int l; int maxT = 0; int specialNum = -1; for (int i = 0; i < n; i++) { cin >> l; a[l].push_back(i + 1); if (l > maxT) maxT = l; b[l]++; if (...
#include <bits/stdc++.h> int main() { uint64_t a, b, x; std::cin >> a >> b; a < b \| a - b & 1 ? std::cout << -1 : (x = a - b >> 1, x ^ a - x ^ b ? std::cout << -1 : std::cout << x << << a - x); }
#include <bits/stdc++.h> using namespace std; int read() { char ch = getchar(); int w = 1, c = 0; for (; !isdigit(ch); ch = getchar()) if (ch == - ) w = -1; for (; isdigit(ch); ch = getchar()) c = (c << 3) + (c << 1) + (ch ^ 48); return w * c; } const int mod = 998244353, M = 1e6 + 10...
#include <bits/stdc++.h> using namespace std; const int N = 1000010; int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } int lcm(int a, int b) { return a * b / gcd(a, b); } int main(void) { int c, d, n, m, k, i, j, ans = 10000; scanf( %d %d %d %d %d , &c, &d, &n, &m, &k); for (i = 0; i <= 1000...
#include <bits/stdc++.h> using namespace std; static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL; const int lim = 2001; int A[lim]; int main() { int n; scanf( %d , &n); for (int i = 0; i < n; ++i) scanf( %d , &A[i]); long long int total = 0ll; for (int ...
#include <bits/stdc++.h> using namespace std; int p[105][105]; char s[105][105]; int n, m; long long k; void color(int x, int y, char c) { while (x < n && y >= 0) { s[x][y] = c; x++; y--; } } vector<pair<pair<int, int>, pair<int, int> > > v; vector<int> vals; long long mem[...
#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } int lcm(int a, int b) { return a / gcd(a, b) * b; } long long powmod(long long a, long long b, long long MOD) { long long ans = 1; while (b) { if (b % 2) ans = ans * a % MOD; a = a * a % MOD...
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const int mod = 1e9 + 7; const double eps = 1e-6; const int maxn = 1 << 17; int a[maxn]; void merge(int l, int r, int from, int to, int& res) { if (res <= 0 \|\| l + 1 == r) { for (int i = l, j = from; i <= r; i++, j++) a[i]...
#include <bits/stdc++.h> using namespace std; const long long maxn = 1e4 + 9; long long a[maxn]; long long n; void solve() { cin >> n; long long sum = 0; for (long long i = 0; i < n; i++) { cin >> a[i]; sum += a[i]; } if (sum % n != 0) { cout << -1 n ; return; ...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int k[n][n]; for (int j = 0; j < n; j++) for (int i = 0; i < n; i++) k[i][j] = (i)*n + j + 1; for (int i = 0; i < n; i += 2) reverse(k[i], k[i] + n); for (int j = n - 1; j >= 0; j--) { for (int i = 0; i <...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); srand(time(NULL)); ; long long t = 1; while (t--) { long long n; cin >> n; long long a[n], b[n]; for (long long i = 0; i < n; i++) cin >> a[i]; mult...
#include <bits/stdc++.h> using namespace std; int ans = 9999; string s, t; int main() { cin >> s >> t; for (int i = 0; i < t.size(); i++) s = . + s + . ; for (int i = 0; i + t.size() - 1 < s.size(); i++) { int temp = 0; for (int j = 0; j < t.size(); j++) temp += (s[i + j] != t[j]); ...
#include <bits/stdc++.h> using namespace std; long long int a[200005]; vector<long long int> g[200005]; vector<long long int> c[200005]; multiset<long long int> st[200005]; long long int idx[200005], toAdd[200005], ans[200005]; void mergeTree(long long int id1, long long int id2) { multiset<long long ...
#include <bits/stdc++.h> using namespace std; int mas[100500]; int main() { int n, k, p = 1, t; bool cur = false; char q; string s = , s1; cin >> n >> k; mas[1] = 1; for (int i = 2; i <= n; i++) { if (p < k) { if (!cur) mas[i] = n - mas[i - 1] + 1; els...
#include <bits/stdc++.h> using namespace std; int gr[1000005]; int was[1000005]; long long GetPow(long long val, int deg) { long long ret = 1; for (int i = 0; i < deg; ++i) { ret *= val; } return ret; } long long arr[100000]; int main() { long long sq4 = 2, sq2 = 2, val4 = 16, va...
#include <bits/stdc++.h> using namespace std; const long long INF = 1e18; const int32_t M = 1e9 + 7; const int32_t MM = 998244353; long long m, n; void solve() { cin >> n >> m; bool visited[n + 5]; memset(visited, 0, sizeof(visited)); for (long long i = 0; i < m; i++) { long long a, b,...
#include <bits/stdc++.h> using namespace std; long long solve(long long n, string str1, string str2) { long long t1 = 0, t2 = 0; for (long long i = 0; i < n; i++) { if (str1[i] != str2[i]) { if (str1[i] == 1 ) t1++; else t2++; } } if (t1 != t2) ...
#include <bits/stdc++.h> using namespace std; double PI = acos(-1); vector<int> adj[100005]; bool vis[100005]; map<pair<int, int>, long long> edge; map<pair<int, int>, pair<long long, int>> weight; long long mod = 1e9 + 7; int n, k; long long dfs(int node) { vis[node] = 1; long long ans = 1; ...
#include <bits/stdc++.h> using namespace std; long long min(long long x, long long y) { return (x < y) ? x : y; } long long max(long long x, long long y) { return (x > y) ? x : y; } const int N = 1000009; const int E = 1000000; int x, y, n, m, e, i, u, w, mx, z, sum, l, r, best, cnt, g, j, k, t; int a[N],...
#include <bits/stdc++.h> using namespace std; long long int ma = -1, mi = 1000000000000000; inline long long int gcd(long long int a, long long int b) { return b ? gcd(b, a % b) : a; } inline long long int lcm(long long int a, long long int b, long long int MOD) { return a / gcd(a, b) * b % MOD; } ...
#include <bits/stdc++.h> using namespace std; void rr(vector<vector<long long>> &m, long long r, long long nr, long long nc) { long long t = m[r - 1][nc - 1]; for (long long i = nc - 2; i >= 0; i--) m[r - 1][i + 1] = m[r - 1][i]; m[r - 1][0] = t; return; } void rc(vector<vector<long long>> &m, l...
#include <bits/stdc++.h> using namespace std; const int N = 10004; long long a[N], b[N], c, sa = 0, mb = 0, M; int n; bool ok1(long long x) { long long s = 0; for (int i = 1; i <= n; i++) { if (a[i] > 0 && x / b[i] > c / a[i]) return 0; s += a[i] * x / b[i] + 1; if (s >= c) return 0;...
#include <bits/stdc++.h> using namespace std; const int N = 1005; long long ara[N]; int main() { long long n, m; cin >> n >> m; for (long long i = 0; i < m; ++i) { long long x; cin >> x; ++ara[x]; } vector<long long> v; for (long long i = 1; i <= 100; ++i) { if (a...
#include <bits/stdc++.h> using namespace std; const int maxn = 100; int main() { long long a[maxn], b[maxn]; int n, m; while (cin >> n >> m) { for (int i = 1; i <= n; ++i) { cin >> a[i]; } for (int i = 1; i <= m; ++i) { cin >> b[i]; } sort(a + 1, a + n + 1...
#include <bits/stdc++.h> using namespace std; bool debug = true; long long n, m, a, b; int main(int argc, char* argv[]) { cin >> n >> m >> a >> b; long long r = n % m; cout << min(r * b, (m - r) * a); while (clock() <= 300) { } return 0; }
#include <bits/stdc++.h> using namespace std; struct seq { int num; char color; }; int main() { string s; cin >> s; int i = 1, N = 0, j; seq temp; vector<seq> arr; temp.num = 1; temp.color = s[0]; while (s[i] != 0 ) { if (s[i] == temp.color) { temp.num++; ...
#include <bits/stdc++.h> using namespace std; int main(void) { char tramp; cin >> tramp; string rank = 6789TJQKA ; char c1_s, c1_r; cin >> c1_r >> c1_s; char c2_s, c2_r; cin >> c2_r >> c2_s; if (c1_s == tramp && c2_s != tramp) { cout << YES << endl; return 0; } ...
#include <bits/stdc++.h> using namespace std; int true_mod(int A, int N) { A %= N; if (A < 0) A += N; return A; } const long long MOD = 1000LL * 1000LL * 1000LL + 7LL; const int MX = 109; struct matrix { long long A[MX][MX]; }; int x; void output(const matrix& A) { for (int i = 0; ...
#include <bits/stdc++.h> using namespace std; long long int n, m; char arr[2004][2004]; pair<int, int> v[2004][2004]; long long int dist[8000003]; const long long int oo = 1000000007; const int dx[] = {1, -1, 0, 0}; const int dy[] = {0, 0, 1, -1}; int get_node(int x, int y) { return x * m + y; } voi...
#include <bits/stdc++.h> using namespace std; const int maxmn = 505; long long a[maxmn][maxmn]; long long luu1[maxmn][maxmn]; bool k[1000005]; long long maxx = 1e9; void readquick() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } int main() { readquick(); vector<long lon...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; vector<vector<int> > v(N); int col[N]; int par[N]; int n; int in[N], out[N]; int timer; bool all_same[N]; bool can[N]; int euler[2 * N]; int tree[8 * N]; int answer = -1; void dfs(int node) { all_same[node] = true; ...
#include <bits/stdc++.h> using namespace std; clock_t time_p = clock(); void ktj() { time_p = clock() - time_p; cerr << Time elapsed : << (float)(time_p) / CLOCKS_PER_SEC << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long n, i, j, k; ...
#include <bits/stdc++.h> using namespace std; int n, a, b, x, y, f[1000001]; void make(int l, int r) { for (int i = l; i < r; i++) f[i] = i + 1; f[r] = l; } int main() { scanf( %d%d%d , &n, &a, &b); for (x = 0; x * a <= n; x++) if ((n - x * a) % b == 0) { y = (n - x * a) / b; ...
#include <bits/stdc++.h> using namespace std; const int mx[] = {0, 2, 3, 1}; long long get_base(long long n) { long long b = 4; for (;;) { if (b > n) return b / 4; b <<= 2; } return 0; } long long func1(long long n) { long long b = get_base(n); return (n - b) / 3 + b; } ...
#include <bits/stdc++.h> using namespace std; const int maxn = 3 * 1e5 + 10, D = 313, mod = 1e9 + 7; long long hsh[maxn], n, ht, ans, tz, p[maxn]; string t, s[maxn]; vector<pair<int, int> > nei[maxn]; void find_p() { p[0] = 1; for (int i = 1; i < maxn; i++) p[i] = (p[i - 1] * D) % mod; } long lo...
#include <bits/stdc++.h> using namespace std; int main() { long long int t, n; cin >> t; while (t--) { cin >> n; long long int c = 0; string s = ; cin >> s; string h = s; sort(h.begin(), h.end()); for (int j = 0; j < n; j++) if (h.at(j) != s.at(j)) c++...
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 3; int n, m, i, j, k, l, r, s, t, d, u, ii, jj, x, y, z, lz[4 * N], h[N]; char c[100]; pair<pair<int, int>, pair<int, int> > first[4 * N]; void init(int root, int bas, int son) { if (bas == son) { if (h[bas] == 4) first[root...
#include <bits/stdc++.h> int n, k; int count; int x; std::vector<int> negTemps; std::priority_queue<int, std::vector<int>, std::greater<int> > intervals; int main(void) { scanf( %d %d , &n, &k); for (int i = 0; i <= n - 1; ++i) { scanf( %d , &x); if (x < 0) { negTemps.push_back...
#include <bits/stdc++.h> using namespace std; const int maxn = 3e6 + 10; long long a[maxn], sum[maxn], n, m, big = 0, tmp; int main() { scanf( %lld , &n); for (int i = 0; i < n; i++) { scanf( %lld , &m); a[m]++; big = max(big, m); } for (int i = 0; i <= big; i++) { for (i...
#include <bits/stdc++.h> using namespace std; const int M = 2e6 + 2e5; const int N = M >> 1; const int MX = 2e6; const int D = 1e6; double L[M], R[M]; int g[M]; struct pnt { int x, y; void input() { scanf( %d %d , &x, &y); } } p[N]; int n; double ans; int main() { scanf( %d , &n); ...
#include <bits/stdc++.h> static int v1[100001]; static int v2[100001]; int comp(const void elem1, const void elem2) { return ((const int )elem2) - ((const int )elem1); } int main(void) { int k, r, n; scanf( %d %d %d , &n, &k, &r); k--; r--; for (int i = 0; i < n; ++i) { int...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int r, g, b, w; cin >> r >> g >> b >> w; int e = 0; if (r % 2 == 0) e++; if (g % 2 == 0) e++; if (b % 2 == 0) e++; if (e == 3) { cout << YES n ; continue; ...
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; long long powm(long long a, long long n) { long long base = 1; a %= MOD; while (n) { if (n & 1) base = base * a % MOD; a = a * a % MOD; n >>= 1; } return base; } int main() { long long a, b, ...
#include <bits/stdc++.h> using namespace std; long long int modpow(long long int a, long long int n, long long int temp) { long long int res = 1; while (n > 0) { res = (res * res) % temp; if (n & 1) res = (res * a) % temp; n /= 2; } return res; } long long int gcd(long long int...
#include <bits/stdc++.h> using namespace std; const int M = 998244353; struct modint { int val = 0; modint() {} modint(int a) : val(a) { while (val < 0) { val += M; } while (val >= M) { val -= M; } } modint(long long a) : val(a % M) { if (val < 0) ...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; while (n--) { string s; cin >> s; int len = s.size(); int ok = 1; for (int i = 0; i < len; i++) { if (i == len) { if (s[i - 1] != a ) s[i] = a ; else if (s[...
#include <bits/stdc++.h> using namespace std; int main() { int n, k; while (scanf( %d%d , &n, &k) != EOF) { int i; for (i = 0; i <= n; i++) { if (i * 2 + (n - i) * 5 >= k && i * 2 + (n - i) * 3 <= k) break; } printf( %d n , i); } return 0; }
#include <bits/stdc++.h> using namespace std; using ll = long long; vector<bool> used; vector<vector<int>> g; int dfs(int v) { if (used[v]) return 0; used[v] = true; int size = 1; for (int i = 0; i < g[v].size(); i++) size += dfs(g[v][i]); return size; } void Solve() { int n, m, k;...
#include <bits/stdc++.h> using namespace std; int main() { int t, n, p; cin >> t; while (t--) { cin >> n; string s; cin >> s; int c = 0; for (int i = 0; i < n; i++) { if (s[i] == s[i + 1]) c++; } if (c == 1) cout << c << endl; else if (c % ...
#include <bits/stdc++.h> using namespace std; bool diverse(string x) { sort(x.begin(), x.end()); for (int i = 1; i < x.size(); i++) if (x[i] - x[i - 1] != 1) return 0; return 1; } int main() { cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0); int n; cin >> n; cin.i...
#include <bits/stdc++.h> using namespace std; set<int> inchat; set<int> inchat2; bool leaders[100005]; int id[100005]; char in[100005]; int main() { int N, M; scanf( %d %d , &N, &M); for (int i = 1; i <= N; i++) leaders[i] = true; for (int i = 0; i < M; i++) { scanf( %c %d n , &in[i...
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; int n; pair<int, int> a[N]; pair<int, int> ra[N]; int ans[N]; pair<int, int> cross(pair<int, int> a, pair<int, int> b) { if (a > b) swap(a, b); return pair<int, int>(b.first, min(a.second, b.second)); } void solve() { ra...

#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; void cmin(long long& x, long long y) { if (x > y) { x = y; } } int n, a[N]; long long f[N][2]; bool best[N][2]; vector<int> adj[N], answer; void dfs1(int u, int p) { long long min_diff = 0; bool go = false; ...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:256000000 ) using namespace std; const int INF = (int)(1e9 + 1e6); const long long LINF = (long long)(4e18); const double EPS = 1e-9; const long long mod = 1e9 + 7; mt19937 ggen; void solve(); int main() { iostream::sync_with_stdio(false); ...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); int x, y; cin >> x >> y; int tx = x - y; int ty = x + y; x = tx; y = ty; if (x < 0) cout << -1 n ; else { int l = 1, r = 1e9 + 5; while (r - l > 1) { int mid = (l + ...

#include <bits/stdc++.h> using namespace std; int nxt() { int res; scanf( %d , &res); return res; } bool is_perm(int *p, int n) { char used[n]; memset(used, 0, sizeof(used)); for (int i = 0; i < n; ++i) { used[p[i]] = 1; } for (int i = 0; i < n; ++i) { if (!used[i]) {...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a, b, i, c = 0; a = 8 * n; b = 9 * n; c = b - a; cout << b << << a << endl; }

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); std::string data; cin >> data; long long int counter = 0; char ch; for (int i = 0; i < data.length(); i++) { if (data[i] == 0 ) counter++; else counter...

#include <bits/stdc++.h> using namespace std; int f[20]; bool ischange[300000]; int main() { memset(ischange, 0, sizeof ischange); int n; scanf( %d , &n); string a; cin >> a; for (int i = 1; i <= 9; i++) { scanf( %d , &f[i]); } int ff = 0; for (int i = 0; i < a.length()...

#include <bits/stdc++.h> using namespace std; template <class T> void show(T *a, int n) { for (int i = 0; i < n; i++) cout << a[i] << ; puts( ); } template <class T> void queue_clear(T *a, int n) { for (int i = 0; i < n; i++) { while (!a->empty()) a->pop(); } } template <class...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); string s; int i = 0; cin >> s; int z = 0, o = 0; while (s[i] == 0 ) { i++; } for (; i < s.length(); i++) { if (s[i] == 0 ) { z++; ...

#include <bits/stdc++.h> using namespace std; const int N = 5e3 + 1; char a[N], b[N]; int f[N][N]; int res; int n, m; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> m; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= m; i++) cin >> b[i]...

#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; int dp[1501][1501], sum[1501], tsum[1501], pro, ex[2][100001], c[100001], P[1501]; int sp[1501], gp[1501], inv[1501]; int power(int a, int n) { if (n == 0) return 1; int res = power(a, n / 2); res = (int)((long long)res *...

#include <bits/stdc++.h> using namespace std; long long INF; int n; long long v[100005]; int c[100005]; long long mx[100005]; pair<long long, int> st[2]; int q; long long a, b; void solve(long long a, long long b) { long long ans = 0; st[0].first = 0; st[0].second = -2; st[1].first =...

#include <bits/stdc++.h> const int N = 500; using namespace std; int n, yh, yhuo = 0, huo = 0, yu, x = 0, y; char pd; int main() { y = 1023; x = 0; scanf( %d , &n); for (int i = 1; i <= n; i++) { cin >> pd >> yh; if (pd == & ) x &= yh, y &= yh; if (pd == | ) x |= yh, y |= y...

#include <bits/stdc++.h> using namespace std; void solve() { string ss, tt; cin >> ss >> tt; int l = ss.size(); vector<int> s(30); vector<int> t(30); for (int i = 0; i < l; i++) { s[ss[i] - a ]++; t[tt[i] - a ]++; } bool ok = false; for (int i = 0; i < s.size(); i++...

#include <bits/stdc++.h> using namespace std; const int maxn = 2000; int pre[maxn]; int countlen(int i) { int ans = 0, p; for (p = i; p != -2; p = pre[p]) ans++; return ans; } int main() { int i, n; cin >> n; for (i = 0; i < n; i++) cin >> pre[i], pre[i]--; int ans = 0; for (...

#include <bits/stdc++.h> using namespace std; const int MAXN = 100004; long long int a[MAXN]; long long int k, n; vector<long long int> b(MAXN, 0); long long int f(double num) { long long int res = 0; for (int i = 0; i < n; i++) { if (num > a[i] + 0.25) { b[i] = 0; continue; ...

#include <bits/stdc++.h> using namespace std; const int bl = 400, sz = 4e5 + 10; int pr[sz], bor[sz][26], cnt[sz], an[sz], q = 1; char prsy[sz]; vector<pair<int, int> > sp[sz]; vector<int> sv[sz]; void dfs(int v) { int u = v, s = 0; for (int a = 0; (a < bl and u != 0 and s != -1); a++) { s =...

#include <bits/stdc++.h> using namespace std; bool vis[101]; vector<int> a[101]; void dfs(int x) { vis[x] = true; for (int i = 0; i < a[x].size(); i++) if (!vis[a[x][i]]) dfs(a[x][i]); } int main() { int n, m; cin >> n >> m; for (int i = 0; i < m; i++) { int x, y; cin >...

#include <bits/stdc++.h> const int MOD = 1000000007; const int Inv2 = 500000004; inline int mul(int x, int y) { return (long long)x * (long long)y % MOD; } inline int add(int x, int y) { int r = x + y; if (r >= MOD) r -= MOD; return r; } inline int qpow(int a, int p) { int x = a, ans = 1; ...

#include <bits/stdc++.h> using namespace std; int32_t main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long int t, n, m, i, j, k, sum = 0; long long int p, w, d; cin >> n >> p >> w >> d; long long int l = 0; long long int r = n; for (i = 0; i <= w; i++) { ...

#include <bits/stdc++.h> int main() { int q; int a[510][2]; int m = 0; int l1, r1, l2, r2; int flag; scanf( %d , &q); for (int i = 0; i < q; i++) { scanf( %d%d%d%d , &l1, &r1, &l2, &r2); flag = 0; for (int j = l1; j <= r1; j++) { a[m][0] = j; for (int k = ...

#include <bits/stdc++.h> using namespace std; long long modpow(long long a, long long b, long long mod = (long long)(1e9 + 7)) { if (!b) return 1; a %= mod; return modpow(a * a % mod, b / 2, mod) * (b & 1 ? a : 1) % mod; } mt19937 rng(chrono::steady_clock::now().time_since_epoch()...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { int k; string s; cin >> k >> s; s += A ; vector<int> a; for (int i = 0; i < s.size(); i++) { if (s[i] == A ) a.push_...

#include <bits/stdc++.h> using namespace std; const long long int mod = 1e9 + 7; long long x, k; long long qow(long long a, long long b) { long long ans = 1; a = a % mod; while (b) { if (b % 2 == 1) { ans = (ans * a) % mod; } a = (a * a) % mod; b /= 2; } retur...

#include <bits/stdc++.h> using namespace std; int n; struct node { long long x, y; } s, t, dist[100005]; int dx[4] = {0, 0, -1, 1}; int dy[4] = {1, -1, 0, 0}; char wind[100005]; string mov = UDLR ; long long pos, l, r, mid; bool check(long long mid) { long long zq = mid / n, sy = mid % n; ...

#include <bits/stdc++.h> using namespace std; template <typename T> inline void read(T &x) { x = 0; char c = getchar(); bool flag = false; while (!isdigit(c)) { if (c == - ) flag = true; c = getchar(); } while (isdigit(c)) { x = (x << 1) + (x << 3) + (c ^ 48); c = ...

#include <bits/stdc++.h> using namespace std; const long long maxn = 1e5 + 69; const long long Inf = 1e13; long long n, newa[maxn], ans[maxn], newb[maxn]; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; for (long long i = 2; i <= n; i += 2) cin >> ans[i]; for (long lon...

#include <bits/stdc++.h> using namespace std; int la, lb; int a[2000000]; int b[2000000]; int bpos[1000001]; void deb(int* x, int xlow, int xhigh) { cout << [ ; for (int i = xlow; i < xhigh; i++) { cout << << x[i]; } cout << ] ; } int seen[1000001]; int solve() { fill(...

#include <bits/stdc++.h> using namespace std; struct data { string name; int score; data() {} data(string name, int score) : name(name), score(score) {} const bool operator<(const data& other) const { if (score != other.score) return score > other.score; return name < other.name; ...

#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; vector<vector<vector<int> > > dp; vector<vector<int> > tmp; vector<vector<int> > base; int get_dig(int pos, int k) { return (pos < k) ? pos : (get_dig(pos / k, k) + pos % k) % k; } inline int get_val(const vector<vector<int> >...

#include <bits/stdc++.h> using namespace std; const int MAXN = 10001; long long a[MAXN]; int f[MAXN]; long long c[MAXN], b[MAXN]; int n; int main() { cin >> n; for (int i = 0; i < n; ++i) cin >> a[i]; for (int i = 0; i < n; ++i) { long long X = a[i], cnt = 0; while (!(X & 1)) { ...

#include <bits/stdc++.h> using namespace std; int inf = (1 << 30) - 1, n, X, x, y, z, f[510][510], c[510], R, g[510][510], size[510], h[2][510], H[2][510][510], q[510], L[510]; int Lng[510]; double a[510][510]; vector<int> E[510]; void read(int &x) { char ch = getchar(); int mark = 1; for ...

#include <iostream> #include <vector> #include <numeric> #include <algorithm> using namespace std; int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int t; cin >> t; while(t--){ int n; cin >> n; vector<long lon...

#include <bits/stdc++.h> using namespace std; struct line { int l, r; } p[510], q[510]; struct Point { long double x, y; } Q[10], tmp[10]; int vis[10]; long double A, B, C; int n, H, F, tot, cnt; void read(int &x) { char ch = getchar(); int mark = 1; for (; ch != - && (ch < 0 |...

#include <bits/stdc++.h> using namespace std; int i, j, k, n, t, f[4], ans, a[2048], l1[2048], r2[2048]; int main() { scanf( %d , &n); for (i = 1; i <= n; ++i) { scanf( %d , a + i); l1[i] = l1[i - 1] + (a[i] == 1); for (j = a[i]; ~j; --j) if (f[j] + 1 > f[a[i]]) f[a[i]] = f[j] + ...

#include <bits/stdc++.h> using namespace std; int n, m1, q; int m[102][102]; struct query { int t; int a; int b; int c; }; void rote(int type, int val) { if (type == 1) { int aux = m[val][m1]; for (int i = m1 - 1; i >= 1; i--) m[val][i + 1] = m[val][i]; m[val][1] = aux;...

#include <bits/stdc++.h> const int maxn = 1005; int n, m; int a[maxn], b[maxn]; bool solve(double v) { for (int i = 0; i < n; i++) { if ((m + v) / a[i] <= v) v -= (m + v) / a[i]; else return false; if ((m + v) / b[i] <= v) v -= (m + v) / b[i]; else ret...

#include <bits/stdc++.h> using namespace std; struct info { long long int val, in; }; long long int arr[100010]; info tree[100010 * 4], temp; void init(long long int node, long long int b, long long int e) { if (b == e) { tree[node].val = arr[b]; tree[node].in = b; return; } ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 5e3 + 3; const int INF = 2000000000; inline long long ab(long long x) { return x < 0 ? -x : x; } long long a[MAXN]; int c_a[MAXN]; int l[MAXN], r[MAXN], x[MAXN], t[MAXN]; int main() { int n, m; cin >> n >> m; for (int i = 0; i < ...

#include <bits/stdc++.h> using namespace std; const long long INF = 2000000000000000000LL; const int inf = 0x3f3f3f3f; const long double EPS = 1e-9; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; long long x, i, j, n = 0, t; cin >> x; while (x / 2 != 0) {...

#include <bits/stdc++.h> using namespace std; const int N = 105; long long g[N][N], f[N][N], a[N], d; int n; pair<int, int> p[N]; void FloydWarshall() { for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) f[i][j] = g[i][j]; f[i][i] = 0; } for (int k = 1; k <= n; k++) { ...

#include <bits/stdc++.h> using namespace std; int main() { long long t, s, a, b, c; cin >> t; for (int i = 0; i < t; i++) { cin >> s >> a >> b >> c; cout << s / c + ((s / c) / a) * b << endl; } return 0; }

#include <bits/stdc++.h> using namespace std; int lpd(int n) { int ans = -1; for (int i = 2; i * i <= n; i++) { if (n % i == 0) { ans = i; while (n % i == 0) n /= i; } } if (n > 1) ans = n; return ans; } int x, p[1000006], pd, t, ans; int main() { ios::sync_...

#include <bits/stdc++.h> using namespace std; long long int dp[4011][4011]; long long int b[2000000]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int n; cin >> n; long long int a[n]; set<long long int> st; for (int i = 0; i < n; i++) { cin >> a[i]; ...

#include <bits/stdc++.h> using namespace std; int main() { int a = 1, b, c = 0, d = 0, e = 0, f, i = 0, k = 0, j = 0, n = 0, t = 0, l = 0, m = 0, h[3000] = {0}; string s, x; cin >> t; n = 1000000; for (i = 0; i < t; i++) { cin >> b; j = max(j, min(b - 1, 1000000 - b)); } ...

#include <bits/stdc++.h> using namespace std; long long n, m, k; long long cp1[102]; long long cp2[102]; long long dp[102][10002]; long long comb[102][102]; bool mark[102][10002]; long long Calculate_Pow(long long x, long long y) { long long val = 1; for (long long i = 1, t = x; i <= y; i <<= 1,...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 5; const int mod = 1e9 + 7; vector<int> G[maxn]; char s[maxn]; int vis[maxn]; map<string, int> mp; long long a[maxn], n, L, R, t; void solve1() { L = 0, R = n; for (int i = 0; i <= n - 2; i++) { if (s[i] == < ) ...

#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const int C = 26; void add(int &x, int y) { x += y; while (x >= MOD) x -= MOD; while (x < 0) x += MOD; } int fix(int x) { while (x >= MOD) x -= MOD; while (x < 0) x += MOD; return x; } int pw(int a, int b) { ...

#include <bits/stdc++.h> using namespace std; int n; vector<int> a[2002]; int b[2002]; vector<int> ans[4]; void Work() { int l; int maxT = 0; int specialNum = -1; for (int i = 0; i < n; i++) { cin >> l; a[l].push_back(i + 1); if (l > maxT) maxT = l; b[l]++; if (...

#include <bits/stdc++.h> int main() { uint64_t a, b, x; std::cin >> a >> b; a < b | a - b & 1 ? std::cout << -1 : (x = a - b >> 1, x ^ a - x ^ b ? std::cout << -1 : std::cout << x << << a - x); }

#include <bits/stdc++.h> using namespace std; int read() { char ch = getchar(); int w = 1, c = 0; for (; !isdigit(ch); ch = getchar()) if (ch == - ) w = -1; for (; isdigit(ch); ch = getchar()) c = (c << 3) + (c << 1) + (ch ^ 48); return w * c; } const int mod = 998244353, M = 1e6 + 10...

#include <bits/stdc++.h> using namespace std; const int N = 1000010; int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } int lcm(int a, int b) { return a * b / gcd(a, b); } int main(void) { int c, d, n, m, k, i, j, ans = 10000; scanf( %d %d %d %d %d , &c, &d, &n, &m, &k); for (i = 0; i <= 1000...

#include <bits/stdc++.h> using namespace std; static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL; const int lim = 2001; int A[lim]; int main() { int n; scanf( %d , &n); for (int i = 0; i < n; ++i) scanf( %d , &A[i]); long long int total = 0ll; for (int ...

#include <bits/stdc++.h> using namespace std; int p[105][105]; char s[105][105]; int n, m; long long k; void color(int x, int y, char c) { while (x < n && y >= 0) { s[x][y] = c; x++; y--; } } vector<pair<pair<int, int>, pair<int, int> > > v; vector<int> vals; long long mem[...

#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } int lcm(int a, int b) { return a / gcd(a, b) * b; } long long powmod(long long a, long long b, long long MOD) { long long ans = 1; while (b) { if (b % 2) ans = ans * a % MOD; a = a * a % MOD...

#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const int mod = 1e9 + 7; const double eps = 1e-6; const int maxn = 1 << 17; int a[maxn]; void merge(int l, int r, int from, int to, int& res) { if (res <= 0 || l + 1 == r) { for (int i = l, j = from; i <= r; i++, j++) a[i]...

#include <bits/stdc++.h> using namespace std; const long long maxn = 1e4 + 9; long long a[maxn]; long long n; void solve() { cin >> n; long long sum = 0; for (long long i = 0; i < n; i++) { cin >> a[i]; sum += a[i]; } if (sum % n != 0) { cout << -1 n ; return; ...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int k[n][n]; for (int j = 0; j < n; j++) for (int i = 0; i < n; i++) k[i][j] = (i)*n + j + 1; for (int i = 0; i < n; i += 2) reverse(k[i], k[i] + n); for (int j = n - 1; j >= 0; j--) { for (int i = 0; i <...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); srand(time(NULL)); ; long long t = 1; while (t--) { long long n; cin >> n; long long a[n], b[n]; for (long long i = 0; i < n; i++) cin >> a[i]; mult...

#include <bits/stdc++.h> using namespace std; int ans = 9999; string s, t; int main() { cin >> s >> t; for (int i = 0; i < t.size(); i++) s = . + s + . ; for (int i = 0; i + t.size() - 1 < s.size(); i++) { int temp = 0; for (int j = 0; j < t.size(); j++) temp += (s[i + j] != t[j]); ...

#include <bits/stdc++.h> using namespace std; long long int a[200005]; vector<long long int> g[200005]; vector<long long int> c[200005]; multiset<long long int> st[200005]; long long int idx[200005], toAdd[200005], ans[200005]; void mergeTree(long long int id1, long long int id2) { multiset<long long ...

#include <bits/stdc++.h> using namespace std; int mas[100500]; int main() { int n, k, p = 1, t; bool cur = false; char q; string s = , s1; cin >> n >> k; mas[1] = 1; for (int i = 2; i <= n; i++) { if (p < k) { if (!cur) mas[i] = n - mas[i - 1] + 1; els...

#include <bits/stdc++.h> using namespace std; int gr[1000005]; int was[1000005]; long long GetPow(long long val, int deg) { long long ret = 1; for (int i = 0; i < deg; ++i) { ret *= val; } return ret; } long long arr[100000]; int main() { long long sq4 = 2, sq2 = 2, val4 = 16, va...

#include <bits/stdc++.h> using namespace std; const long long INF = 1e18; const int32_t M = 1e9 + 7; const int32_t MM = 998244353; long long m, n; void solve() { cin >> n >> m; bool visited[n + 5]; memset(visited, 0, sizeof(visited)); for (long long i = 0; i < m; i++) { long long a, b,...

#include <bits/stdc++.h> using namespace std; long long solve(long long n, string str1, string str2) { long long t1 = 0, t2 = 0; for (long long i = 0; i < n; i++) { if (str1[i] != str2[i]) { if (str1[i] == 1 ) t1++; else t2++; } } if (t1 != t2) ...

#include <bits/stdc++.h> using namespace std; double PI = acos(-1); vector<int> adj[100005]; bool vis[100005]; map<pair<int, int>, long long> edge; map<pair<int, int>, pair<long long, int>> weight; long long mod = 1e9 + 7; int n, k; long long dfs(int node) { vis[node] = 1; long long ans = 1; ...

#include <bits/stdc++.h> using namespace std; long long min(long long x, long long y) { return (x < y) ? x : y; } long long max(long long x, long long y) { return (x > y) ? x : y; } const int N = 1000009; const int E = 1000000; int x, y, n, m, e, i, u, w, mx, z, sum, l, r, best, cnt, g, j, k, t; int a[N],...

#include <bits/stdc++.h> using namespace std; long long int ma = -1, mi = 1000000000000000; inline long long int gcd(long long int a, long long int b) { return b ? gcd(b, a % b) : a; } inline long long int lcm(long long int a, long long int b, long long int MOD) { return a / gcd(a, b) * b % MOD; } ...

#include <bits/stdc++.h> using namespace std; void rr(vector<vector<long long>> &m, long long r, long long nr, long long nc) { long long t = m[r - 1][nc - 1]; for (long long i = nc - 2; i >= 0; i--) m[r - 1][i + 1] = m[r - 1][i]; m[r - 1][0] = t; return; } void rc(vector<vector<long long>> &m, l...

#include <bits/stdc++.h> using namespace std; const int N = 10004; long long a[N], b[N], c, sa = 0, mb = 0, M; int n; bool ok1(long long x) { long long s = 0; for (int i = 1; i <= n; i++) { if (a[i] > 0 && x / b[i] > c / a[i]) return 0; s += a[i] * x / b[i] + 1; if (s >= c) return 0;...

#include <bits/stdc++.h> using namespace std; const int N = 1005; long long ara[N]; int main() { long long n, m; cin >> n >> m; for (long long i = 0; i < m; ++i) { long long x; cin >> x; ++ara[x]; } vector<long long> v; for (long long i = 1; i <= 100; ++i) { if (a...

#include <bits/stdc++.h> using namespace std; const int maxn = 100; int main() { long long a[maxn], b[maxn]; int n, m; while (cin >> n >> m) { for (int i = 1; i <= n; ++i) { cin >> a[i]; } for (int i = 1; i <= m; ++i) { cin >> b[i]; } sort(a + 1, a + n + 1...

#include <bits/stdc++.h> using namespace std; bool debug = true; long long n, m, a, b; int main(int argc, char* argv[]) { cin >> n >> m >> a >> b; long long r = n % m; cout << min(r * b, (m - r) * a); while (clock() <= 300) { } return 0; }

#include <bits/stdc++.h> using namespace std; struct seq { int num; char color; }; int main() { string s; cin >> s; int i = 1, N = 0, j; seq temp; vector<seq> arr; temp.num = 1; temp.color = s[0]; while (s[i] != 0 ) { if (s[i] == temp.color) { temp.num++; ...

#include <bits/stdc++.h> using namespace std; int main(void) { char tramp; cin >> tramp; string rank = 6789TJQKA ; char c1_s, c1_r; cin >> c1_r >> c1_s; char c2_s, c2_r; cin >> c2_r >> c2_s; if (c1_s == tramp && c2_s != tramp) { cout << YES << endl; return 0; } ...

#include <bits/stdc++.h> using namespace std; int true_mod(int A, int N) { A %= N; if (A < 0) A += N; return A; } const long long MOD = 1000LL * 1000LL * 1000LL + 7LL; const int MX = 109; struct matrix { long long A[MX][MX]; }; int x; void output(const matrix& A) { for (int i = 0; ...

#include <bits/stdc++.h> using namespace std; long long int n, m; char arr[2004][2004]; pair<int, int> v[2004][2004]; long long int dist[8000003]; const long long int oo = 1000000007; const int dx[] = {1, -1, 0, 0}; const int dy[] = {0, 0, 1, -1}; int get_node(int x, int y) { return x * m + y; } voi...

#include <bits/stdc++.h> using namespace std; const int maxmn = 505; long long a[maxmn][maxmn]; long long luu1[maxmn][maxmn]; bool k[1000005]; long long maxx = 1e9; void readquick() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } int main() { readquick(); vector<long lon...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; vector<vector<int> > v(N); int col[N]; int par[N]; int n; int in[N], out[N]; int timer; bool all_same[N]; bool can[N]; int euler[2 * N]; int tree[8 * N]; int answer = -1; void dfs(int node) { all_same[node] = true; ...

#include <bits/stdc++.h> using namespace std; clock_t time_p = clock(); void ktj() { time_p = clock() - time_p; cerr << Time elapsed : << (float)(time_p) / CLOCKS_PER_SEC << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long n, i, j, k; ...

#include <bits/stdc++.h> using namespace std; int n, a, b, x, y, f[1000001]; void make(int l, int r) { for (int i = l; i < r; i++) f[i] = i + 1; f[r] = l; } int main() { scanf( %d%d%d , &n, &a, &b); for (x = 0; x * a <= n; x++) if ((n - x * a) % b == 0) { y = (n - x * a) / b; ...

#include <bits/stdc++.h> using namespace std; const int mx[] = {0, 2, 3, 1}; long long get_base(long long n) { long long b = 4; for (;;) { if (b > n) return b / 4; b <<= 2; } return 0; } long long func1(long long n) { long long b = get_base(n); return (n - b) / 3 + b; } ...

#include <bits/stdc++.h> using namespace std; const int maxn = 3 * 1e5 + 10, D = 313, mod = 1e9 + 7; long long hsh[maxn], n, ht, ans, tz, p[maxn]; string t, s[maxn]; vector<pair<int, int> > nei[maxn]; void find_p() { p[0] = 1; for (int i = 1; i < maxn; i++) p[i] = (p[i - 1] * D) % mod; } long lo...

#include <bits/stdc++.h> using namespace std; int main() { long long int t, n; cin >> t; while (t--) { cin >> n; long long int c = 0; string s = ; cin >> s; string h = s; sort(h.begin(), h.end()); for (int j = 0; j < n; j++) if (h.at(j) != s.at(j)) c++...

#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 3; int n, m, i, j, k, l, r, s, t, d, u, ii, jj, x, y, z, lz[4 * N], h[N]; char c[100]; pair<pair<int, int>, pair<int, int> > first[4 * N]; void init(int root, int bas, int son) { if (bas == son) { if (h[bas] == 4) first[root...

#include <bits/stdc++.h> int n, k; int count; int x; std::vector<int> negTemps; std::priority_queue<int, std::vector<int>, std::greater<int> > intervals; int main(void) { scanf( %d %d , &n, &k); for (int i = 0; i <= n - 1; ++i) { scanf( %d , &x); if (x < 0) { negTemps.push_back...

#include <bits/stdc++.h> using namespace std; const int maxn = 3e6 + 10; long long a[maxn], sum[maxn], n, m, big = 0, tmp; int main() { scanf( %lld , &n); for (int i = 0; i < n; i++) { scanf( %lld , &m); a[m]++; big = max(big, m); } for (int i = 0; i <= big; i++) { for (i...

#include <bits/stdc++.h> using namespace std; const int M = 2e6 + 2e5; const int N = M >> 1; const int MX = 2e6; const int D = 1e6; double L[M], R[M]; int g[M]; struct pnt { int x, y; void input() { scanf( %d %d , &x, &y); } } p[N]; int n; double ans; int main() { scanf( %d , &n); ...

#include <bits/stdc++.h> static int v1[100001]; static int v2[100001]; int comp(const void *elem1, const void *elem2) { return *((const int *)elem2) - *((const int *)elem1); } int main(void) { int k, r, n; scanf( %d %d %d , &n, &k, &r); k--; r--; for (int i = 0; i < n; ++i) { int...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int r, g, b, w; cin >> r >> g >> b >> w; int e = 0; if (r % 2 == 0) e++; if (g % 2 == 0) e++; if (b % 2 == 0) e++; if (e == 3) { cout << YES n ; continue; ...

#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; long long powm(long long a, long long n) { long long base = 1; a %= MOD; while (n) { if (n & 1) base = base * a % MOD; a = a * a % MOD; n >>= 1; } return base; } int main() { long long a, b, ...

#include <bits/stdc++.h> using namespace std; long long int modpow(long long int a, long long int n, long long int temp) { long long int res = 1; while (n > 0) { res = (res * res) % temp; if (n & 1) res = (res * a) % temp; n /= 2; } return res; } long long int gcd(long long int...

#include <bits/stdc++.h> using namespace std; const int M = 998244353; struct modint { int val = 0; modint() {} modint(int a) : val(a) { while (val < 0) { val += M; } while (val >= M) { val -= M; } } modint(long long a) : val(a % M) { if (val < 0) ...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; while (n--) { string s; cin >> s; int len = s.size(); int ok = 1; for (int i = 0; i < len; i++) { if (i == len) { if (s[i - 1] != a ) s[i] = a ; else if (s[...

#include <bits/stdc++.h> using namespace std; int main() { int n, k; while (scanf( %d%d , &n, &k) != EOF) { int i; for (i = 0; i <= n; i++) { if (i * 2 + (n - i) * 5 >= k && i * 2 + (n - i) * 3 <= k) break; } printf( %d n , i); } return 0; }

#include <bits/stdc++.h> using namespace std; using ll = long long; vector<bool> used; vector<vector<int>> g; int dfs(int v) { if (used[v]) return 0; used[v] = true; int size = 1; for (int i = 0; i < g[v].size(); i++) size += dfs(g[v][i]); return size; } void Solve() { int n, m, k;...

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

#include <bits/stdc++.h> using namespace std; bool diverse(string x) { sort(x.begin(), x.end()); for (int i = 1; i < x.size(); i++) if (x[i] - x[i - 1] != 1) return 0; return 1; } int main() { cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0); int n; cin >> n; cin.i...

#include <bits/stdc++.h> using namespace std; set<int> inchat; set<int> inchat2; bool leaders[100005]; int id[100005]; char in[100005]; int main() { int N, M; scanf( %d %d , &N, &M); for (int i = 1; i <= N; i++) leaders[i] = true; for (int i = 0; i < M; i++) { scanf( %c %d n , &in[i...

#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; int n; pair<int, int> a[N]; pair<int, int> ra[N]; int ans[N]; pair<int, int> cross(pair<int, int> a, pair<int, int> b) { if (a > b) swap(a, b); return pair<int, int>(b.first, min(a.second, b.second)); } void solve() { ra...