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

func_code_string stringlengths 59 71.4k
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int T; cin >> T; while (T--) { long long n, k; cin >> n >> k; if (k % 3) { if (n % 3) cout << Alice n ; else cout << ...
#include <bits/stdc++.h> using namespace std; int fu[2003]; int jar[2003]; int main() { int n, refresh; cin >> n >> refresh; for (int(i) = 0; (i) < (n); ++(i)) { cin >> jar[i]; } for (int(i) = 0; (i) < (n); ++(i)) { cin >> fu[i]; } int best = fu[0]; int res = 0; i...
#include <bits/stdc++.h> using namespace std; long long cas; long long a; long long b; long long c; long long d[] = {0, 1, -1}; int main() { scanf( %lld , &cas); while (cas--) { scanf( %lld %lld %lld , &a, &b, &c); long long ans = 21413524368453; for (long long i = 0; i < 3; ++i)...
#include <bits/stdc++.h> using namespace std; template <typename TYPE> void readint(TYPE &x) { x = 0; int f = 1; char c; for (c = getchar(); !isdigit(c); c = getchar()) if (c == - ) f = -1; for (; isdigit(c); c = getchar()) x = x * 10 + c - 0 ; x *= f; } void err(istream_iterat...
#include <bits/stdc++.h> using namespace std; map<long long int, long long int> mymap, mymap1; long long int cum[200010], a[200010]; int main() { long long int n, i, j, k; scanf( %lld , &n); ; scanf( %lld , &k); ; cum[0] = 0; mymap[0]++; for (i = 1; i <= n; i++) { scanf( %l...
#include <bits/stdc++.h> using namespace std; template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << ; cout << endl; } int ans[100000 + 10]; int main() { for (int N; ~scanf( %d , &N);) { memset(ans, 0, sizeof(ans)); vector<int> a(N), b(N); for (int i...
#include <bits/stdc++.h> using namespace std; int val[60]; int n; int grid[2][60]; int mask1[25][1200008 + 1], mask2[25][1200008 + 1]; void solve(int l, int r, int mask[][1200008 + 1]) { memset(mask, -1, sizeof mask); for (int i = 0; i <= 24; i++) for (int j = 0; j < 1200008 + 1; j++) mask[i][...
#include <bits/stdc++.h> using namespace std; const long long N = 2e5 + 5; const long long NN = 1e9 + 5; char a[150][150]; map<char, bool> mp, mp1; bool used[150][150]; long long n, m; vector<char> v; int main() { cin >> n >> m; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++)...
#include <bits/stdc++.h> using namespace std; long long t, n, m, k, x, y, z, a[500005], ans, val; int main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); cin >> n; string s; cin >> s; for (long long i = 0; i < n; i++) { if (s[i] == ( ) x++; else x--...
#include <bits/stdc++.h> using namespace std; const double pi = acos(-1.0); int pal(string s) { int i = 0, j = s.length() - 1; while (i < j) { if (s[i] != s[j]) return 0; i++; j--; } return 1; } int main() { ios_base::sync_with_stdio(false); string str, tp, s; cin...
#include <bits/stdc++.h> using namespace std; const int N_MAX = 51000; int X[N_MAX], Y[N_MAX], Z[N_MAX]; bool vis[N_MAX]; bool ff(int i, int j) { if (X[i] != X[j]) return X[i] < X[j]; if (Y[i] != Y[j]) return Y[i] < Y[j]; return Z[i] < Z[j]; } int main() { int n; cin >> n; vector<i...
#include <bits/stdc++.h> int main() { int n; scanf( %d , &n); int B1, B2; int count1 = 0; int count2 = 0; while (n--) { scanf( %d %d , &B1, &B2); if (B1 > B2) { count1++; } if (B2 > B1) { count2++; } } if (count1 > count2) { printf( M...
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; int n, m, s, t, ds, dt, cnt, f; vector<pair<int, int>> ans; vector<int> G[N]; pair<int, int> xx[N], yy[N]; bool vi[N]; void dfs(int u) { vi[u] = true; for (int v : G[u]) if (!vi[v]) { ans.push_back({u, v}); ...
#include <bits/stdc++.h> const int mod = 1000000007; int A[13][13], B[13][13], C[13][13]; int ID[4][4]; int L, R, r1, r2; void mul(int A[][13], int B[][13]) { for (int i = 0; i < 13; i++) for (int j = 0; j < 13; j++) C[i][j] = 0; for (int k = 0; k < 13; k++) for (int i = 0; i < 13; i++) ...
#include <bits/stdc++.h> using namespace std; const long long N = 2e5 + 30, Mod = 1e9 + 7; const long long SQ = 330; int main() { ios::sync_with_stdio(0), cin.tie(0); long long a, b; cin >> a >> b; long long ans = 0; while (a > 0 && b > 0) { if (a <= b) a++, b -= 2; else ...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout << 2001 n ; for (int i = 1; i <= 1000; i++) { cout << i << 1 << i << 2 n ; } cout << 1 1 1 2 n ; for (int i = 1; i <= 1000; i++) { cout << i << 1 << i << 2 n ; ...
#include <bits/stdc++.h> using namespace std; const int Max = 1e6 + 100; int pa[Max << 1], son[Max << 1][27]; int deep[Max << 1], sum[Max << 1], tp[Max << 1], S[Max << 1], cnt, root, last; char str[Max << 1]; inline int Newnode(int _deep) { deep[++cnt] = _deep; return cnt; } inline void SAM(int ...
#include <bits/stdc++.h> using namespace std; const int kN = 2e5 + 10; const long long kInf = 1e18 + 10; int n, q; long long a[kN], b[kN]; vector<int> g[kN]; int in[kN], out[kN], dfs_clock; pair<long long, long long> p1[kN], p2[kN]; void dfs(int u) { in[u] = ++dfs_clock; for (int v : g[u]) { ...
#include <bits/stdc++.h> using namespace std; unsigned long long pow_of_two[10000]; int create() { unsigned long long i = 0; unsigned long long num = 1; while (num <= INT_MAX and num >= 0) { num = pow(2, i); pow_of_two[i] = num; i++; } } int main() { int n; cin >> n; ...
#include <bits/stdc++.h> using namespace std; int main() { int n; string s; cin >> n >> s; sort(s.begin(), s.end()); cout << s; }
#include <bits/stdc++.h> using namespace std; int main() { string a = , b = ; int n, m; cin >> n >> m; for (int i = 0; i < 2220; i++) { if (i % 2 == 0) { a += 5 ; b += 4 ; } else { a += 4 ; b += 5 ; } } a += 5 ; b += 5 ; cou...
#include <bits/stdc++.h> using namespace std; ifstream Cin( input.txt ); ofstream Cout( output.txt ); int main() { long long n, x, i, num = 0, m[100001], m1[100001]; m[0] = m1[0] = 0; cin >> n; for (i = 1; i <= n; i++) { cin >> m[i]; m1[i] = m[i]; } sort(m, m + n + 1); fo...
#include <bits/stdc++.h> using namespace std; long long int power(long long int x, unsigned long long int y) { long long int res = 1; while (y > 0) { if (y & 1) { res = res * x; } y = y >> 1; x = x * x; } return res; } long long int powermod(long long int x, unsig...
#include <bits/stdc++.h> using namespace std; const int N = 100005 * 2; struct SegmentTree { int l, r; int sum, lmx, rmn, ansl, ansr, ans, Ans; } t[N << 2]; int s[N]; char ss[N]; void merge(int p) { t[p].sum = t[p * 2].sum + t[p * 2 + 1].sum; t[p].lmx = max(t[p * 2].lmx, t[p * 2].sum + t[p...
#include <bits/stdc++.h> using namespace std; long long a[300005]; long long s[300005]; int main() { ios::sync_with_stdio(0); cin.tie(NULL); int n, p, k; cin >> n >> p >> k; for (int i = 1; i <= n; i++) { cin >> a[i]; a[i] %= p; } map<long long, long long> cnt; for (i...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); string s; cin >> s; vector<string> splitted; stringstream ss(s); string item; while (getline(ss, item, , )) { splitted.push_back(item); } int MAX = 1001; vecto...
#include <bits/stdc++.h> using ul = std::uint32_t; using li = std::int32_t; using ll = std::int64_t; using ull = std::uint64_t; using vul = std::vector<ul>; using vvul = std::vector<vul>; using pulul = std::pair<ul, ul>; using lf = long double; ul n, m; const lf pi = std::acos(lf(-1)); const lf ep...
#include <bits/stdc++.h> using namespace std; struct node { int l, r; } ar[300000]; bool compare(node a, node b) { if (a.r != b.r) return a.r < b.r; else return a.l < b.l; } vector<pair<int, int> > vectl, vectn, temp; int main() { int n, i, m, flag = 0; scanf( %d%d , &n, &m...
#include <bits/stdc++.h> using namespace std; int n, v[100002], nr; int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> v[i]; } sort(v + 1, v + n + 1); for (int i = 1; i <= n - 2; i++) { if (v[i] + v[i + 1] > v[i + 2]) nr++; } if (nr == 0) cout << NO n ; ...
#include <bits/stdc++.h> using namespace std; int N, M, T; char str[1005]; int main() { int i, j, k; scanf( %d , &N); scanf( %s , str); for (i = 0; i < N; i++) if (str[i] == H ) M++; int Mc = 1005; k = 0; for (i = 0; i < M; i++) if (str[i] != H ) k++; int st = 0; ...
#include <bits/stdc++.h> using namespace std; int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long n; cin >> n; long long store[100005] = {}; for (long long i = 1; i <= n; i++) { long long x, y; cin >> x >> y; y = i - y; long long ct ...
#include <bits/stdc++.h> using namespace std; template <typename T> T in() { char ch; T n = 0; bool ng = false; while (1) { ch = getchar(); if (ch == - ) { ng = true; ch = getchar(); break; } if (ch >= 0 && ch <= 9 ) break; } while (1) { ...
#include <bits/stdc++.h> using namespace std; int n, A; int level[10], loyal[10]; double maxP; void backtrack(int p, int k) { if (p == n \|\| k == 0) { double x = 0; for (int mask = 0; mask < (1 << n); mask++) { int cnt = 0, B = 0; double prob = 1.0; for (int i = 0; i < n...
#include <bits/stdc++.h> using namespace std; template <class T, class U> void Max(T &a, U b) { if (a < b) a = b; } template <class T, class U> void Min(T &a, U b) { if (a > b) a = b; } template <class T, class U> void add(T &a, U b) { a += b; if (a >= 1000000007) a -= 1000000007; } ...
#include <bits/stdc++.h> using namespace std; int n, A[5001], B[5001], S[5001], ma, man; int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> A[i]; for (int i = 1; i <= n; i++) { for (int j = i; j <= n; j++) { S[A[j]]++; if (S[A[j]] > ma \|\| (S[A[j]] == ma && A[j] < man)) { ...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; for (int tt = 1; tt <= t; tt++) { int r[100005], g[100005], b[100005]; int nr, ng, nb; cin >> nr >> ng >> nb; for (int i = 0; i < nr; i++) cin >> r[i]; for (int i = 0; i < ng; i++) cin >> g[i]; ...
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const int maxn = 132222; const long long mod = 1000000007; char s[maxn]; int main() { int n; cin >> n; cin >> s + 1; int len = strlen(s + 1); int l = -1, r = -1; for (int i = (1); i < (len + 1); i++) { if...
#include <bits/stdc++.h> using namespace std; const int MaxN = 5e2 + 10; const int P = 239017; const int INF = 1e9; const int MOD = 1e9 + 7; int dp[MaxN][MaxN][2], n, m, q; char s[MaxN][MaxN]; int get(int xl, int yl, int xr, int yr, int c) { if (c == 0 && xl > xr) { return 0; } if (c =...
#include <bits/stdc++.h> using namespace std; template <class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; } template <class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; } const int maxn = 210000; vector<int> e[maxn]; int h[maxn]; void dfsh(int v, int p)...
#include <bits/stdc++.h> using namespace std; const int maxn = 510; const int MOD = 1e9 + 7; long long dp[2][maxn][maxn]; int N, M; char s[maxn][maxn]; void add(long long &x, long long y) { x += y; if (x >= MOD) x -= MOD; } int main() { scanf( %d%d , &N, &M); for (int i = 1; i <= N; i+...
#include <bits/stdc++.h> using namespace std; vector<int> v1[3010], v2[3010]; int dista[3010][3010], distb[3010][3010]; pair<int, int> besta[3010][3], bestb[3010][3]; int n, m; void dijkstra(int x) { for (int i = 1; i <= n; i++) dista[x][i] = 1000000009; dista[x][x] = 0; priority_queue<pair<int,...
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10, mod = 1e9 + 7; const long long infl = LLONG_MAX / 2; int n, ans, h[N]; vector<int> g[N], L; void dfs(int u = 0, int p = -1) { bool leaf = 1; for (int x : g[u]) if (x - p) { h[x] = h[u] + 1; dfs(x, u); ...
#include <bits/stdc++.h> using namespace std; int main() { string x, y, z; int a = 0, c = 0; cin >> x; cin >> y; cin >> z; for (int i = 0; i < x.length(); i++) { for (int j = 0; j < z.length(); j++) { if (x[i] == z[j]) { c += 1; z[j] = 1 ; break; ...
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( Ofast,no-stack-protector,unroll-loops,fast-math ) long long comb(long long n, long long r) { if (r < 0 \|\| r > n) return 0; if ((n - r) < r) r = n - r; long long vec = 1; for (long long i = n; i > n - r; --i) { vec = vec * i;...
#include <bits/stdc++.h> using namespace std; char s1[200010], s2[200010]; long long cal[200010][26], cal2[200010][26]; int main() { int i, j, k, n; long long qq = 0; scanf( %d%s%s , &n, s1, s2); for (i = 1; i <= n; i++) qq += (long long)i * i; cal[0][s2[0] - A ] = 1; for (i = 1; i < n;...
#include <bits/stdc++.h> using namespace std; int n; bool a[20][2][1 << 17]; int ans = 1234, ami, apl; void solve(int ind, int mx, int mi, int pl, int res) { if (ind > 18) { return; } if (mx == 0) { if (res < ans) { ans = res; ami = mi; apl = pl; } r...
#include <bits/stdc++.h> const int oo = 1073741819; using namespace std; int f[200][500], n, t[500], w[500]; int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> t[i] >> w[i]; memset(f, 61, sizeof(f)); f[0][0] = 0; for (int i = 1; i <= n; i++) for (int j = 0; j <= i * 2; j++) { ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 5; const int cipher = -1e9; template <typename T> void chkmax(T &x, T y) { x = max(x, y); } template <typename T> void chkmin(T &x, T y) { x = min(x, y); } template <typename T> void read(T &x) { x = 0; int f = 1;...
#include <bits/stdc++.h> using namespace std; template <class T> T sqr(T x) { return x * x; } template <class T> T gcd(T a, T b) { return (b != 0 ? gcd<T>(b, a % b) : a); } template <class T> T lcm(T a, T b) { return (a / gcd<T>(a, b) * b); } template <class T> inline T bigmod(T p, T...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; int t; int n; string a, b; int op[N]; int opb[N]; int bp = 0; int ans = 0; int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> t; while (t--) { cin >> n; ans = 0; cin >> a; cin >> b;...
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; long long arr[n]; for (int i = 0; i < n; i++) cin >> arr[i]; if (n > 5 * m) { cout << YES ; return 0; } bool dp[n][m + 1]; for (int i = 0; i <= m; i++) dp[0][i] = false; for (int i = ...
#include <bits/stdc++.h> #pragma warning(disable : 4996) using namespace std; long long __gcd(long long a, long long b) { while (a != 0) { long long __t = b % a; b = a; a = __t; } return b; } bool isSimple(unsigned x) { for (unsigned i = 2; i < x; i++) if (x % i == 0) r...
#include <bits/stdc++.h> using namespace std; int main() { int n, b; while (~scanf( %d%d , &n, &b)) { int a[2050]; int m = -999; for (int i = 0; i < n; i++) scanf( %d , a + i); for (int i = 0; i < n - 1; i++) { int z = b / a[i]; for (int j = i + 1; j < n; j++) { ...
#include <bits/stdc++.h> using namespace std; int get(int a, int b) { if (a < b) return get(b, a); if (a % b == 0) { return a / b; } int c = a / b; return get(b, a % b) + c; } int main() { int N; scanf( %d , &N); for (int i = 0; i < N; i++) { int a, b; scanf( %d...
#include <bits/stdc++.h> using namespace std; char s[200001]; long long a[26]; long long cnt = 0; int main() { long long i, j, k, l, m, n, t; cin >> t; cin >> s; l = strlen(s); for (i = 0; i < 26; i++) a[i] = 0; for (i = 1; i < l; i = i + 2) { if ((s[i - 1] - 97) != (s[i] - 65)) ...
#include <bits/stdc++.h> #pragma GCC optimize( -O3 ) using namespace std; const long long mod = 998244353; struct edge { int u, v, cap; edge() {} edge(int _u, int _v, int _cap) : u(_u), v(_v), cap(_cap) {} int get(int t) { return t ^ u ^ v; } }; const int inf = 1e9; struct edkarp { vec...
#include <bits/stdc++.h> using namespace std; int n; int a[101]; int res = 0; void solve() { for (int i = 2; i < n; ++i) { if (a[i] == 0) { if (a[i - 1] == 1 && a[i + 1] == 1 && a[i + 2] == 0 && a[i + 3] == 1 && i - 1 > 0) { a[i + 1] = 0; ++res; i +=...
#include <bits/stdc++.h> using namespace std; int n, ans[1010][1010]; pair<int, int> a[1010]; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i].first), a[i].second = i; sort(a + 1, a + n + 1); for (int i = 1; i <= n; i++) { int j = i; while (a[i].first--) a...
#include <bits/stdc++.h> using namespace std; const int MAXN = 5040; double dp[MAXN][3], fail[MAXN]; double p[MAXN], f[MAXN]; int t[MAXN]; int main() { int n, T; scanf( %d%d , &n, &T); for (int i = 1; i <= n; i++) { int x; scanf( %d%d , &x, &t[i]); p[i] = x * 1.0 / 100; } ...
#include <bits/stdc++.h> using namespace std; int main() { int n, a, b; cin >> n >> a >> b; string arr; cin >> arr; if (arr[a - 1] == arr[b - 1]) cout << 0 << n ; else cout << 1 << n ; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { char str[510]; int n, i; bool rec[27]; while (cin >> str) { int flag = 0, faill = 0; memset(rec, 0, sizeof(rec)); int t = strlen(str); if (str[0] != a ) faill = 1; rec[1] = 1; rec[0] = 1; int sum = ...
#include <bits/stdc++.h> using namespace std; const long long INF = 0x3fffffff; double a, b, c, d; int main() { while (cin >> a >> b >> c >> d) { double l = 0, r = 2000000000.0; double a1, a2, b1, b2, c1, c2, d1, d2; double m1, m2, min1, min2; for (int i = 0; i < 10000; i++) { ...
#include <bits/stdc++.h> using namespace std; int min(int a, int b) { if (a > b) { return b; } else { return a; } } int max(int a, int b) { if (a > b) { return a; } else { return b; } } int main() { int n, x0; int a, b; int d, f; cin >> n >> x0...
#include <bits/stdc++.h> using namespace std; int n, leaf, po; vector<int> v[100005]; int main() { scanf( %d , &n); for (int i = (2); i <= (n); i++) { int a, b; scanf( %d %d , &a, &b); v[a].push_back(b); v[b].push_back(a); } for (int i = (1); i <= (n); i++) if (v[i]...
#include <bits/stdc++.h> using namespace std; int main() { int n, t, x, y; int ar = 0; int al = 0; int br = 0; int bl = 0; cin >> n; for (int i = 0; n > i; i++) { cin >> t; cin >> x; cin >> y; if (t == 1) { ar += x; al += y; } else { ...
#include <bits/stdc++.h> using namespace std; int n, a[2 * 2005], pos[2 * 2005], dp[2 * 2005][2 * 2005]; int call(int p, int len) { if (p > 2 * n) return len == n; if (len < n) return 0; int &ret = dp[p][len]; if (~ret) return ret; ret = call(p + pos[p], len); ret += call(p + pos[p], len -...
#include <bits/stdc++.h> using namespace std; const int inf = 1e9 + 7; const long long INF = 4 * (long long)1e18 + 7; const long double eps = 1e-9; signed main() { if (false) { freopen( output.txt , w , stdout); freopen( input.txt , r , stdin); } ios_base::sync_with_stdio(false); ...
#include <bits/stdc++.h> using namespace std; void solve() { int n; cin >> n; string s; cin >> s; map<char, vector<int>> ma; for (int i = 0; i < n; i++) { ma[s[i]].push_back(i + 1); } int m; cin >> m; vector<int> ans; while (m--) { string s1; cin >> s1; ...
#include <bits/stdc++.h> using namespace std; pair<long long, long long> t[4 * 200009]; long long a[200009], lazy[4 * 200009], ans[200009]; void build(long long v, long long tl, long long tr) { if (tl == tr) { t[v] = {a[tl], tl}; } else { long long tm = (tl + tr) / 2; build(v * 2, tl, ...
#include <bits/stdc++.h> using namespace std; inline void read(int &x) { x = 0; int f = 1; char ch = getchar(); while (ch != 45 && (ch > 9 \|\| ch < 0 )) ch = getchar(); if (ch == 45) { f = -1, ch = getchar(); } while (ch <= 9 && ch >= 0 ) { x = x * 10 + ch - 48; ch...
#include <bits/stdc++.h> using namespace std; bool lambs[101]; int main() { int n, m; cin >> n >> m; while (n--) { int x; cin >> x; while (x--) { int y; cin >> y; lambs[y] = true; } } for (int i = 1; i < m + 1; i++) if (lambs[i] == false) {...
#include <bits/stdc++.h> const long long seed = 131; const int N = 1000010; char ac[N], bc[N]; int main() { int n; scanf( %d%s%s , &n, ac, bc), n--; for (int i = 0; i < n; i++) { if (bc[i] == N ) bc[i] = S ; else if (bc[i] == S ) bc[i] = N ; else if (bc[i] == E...
#include <bits/stdc++.h> int n, m; int table[(1 << 20) + 10]; int lowbit[(1 << 20) + 10]; int ba[35][35]; int cost[35][35]; int same[35][35]; char st[35][35]; int min(int x, int y) { if (x < y) return x; else return y; } int main() { int i, a, j; scanf( %d%d n , &n, &m); ...
#include <bits/stdc++.h> using namespace std; const int N = 702, M = 4900005; int main() { int n, m, a[55], b, i, j, ans, cnt; while (scanf( %d , &n) == 1) { for (i = 1; i <= n; i++) scanf( %d , a + i); scanf( %d , &m); for (i = 1, ans = 0; i <= m; i++) { scanf( %d , &b); ...
#include <bits/stdc++.h> using namespace std; const int MAX = (int)1e5 + 55; const int INF = (int)1e9 + 77; const int MOD = (int)1e9 + 7; const double PI = 2 * acos(0.0); const double EPS = 1e-7; const int N = (int)1e5 + 5; vector<vector<int>> adj; pair<int, int> cost[N]; int mn; bool vis[N]; lo...
#include <bits/stdc++.h> using namespace std; struct node { int a, b, c, ty; } a[100010]; struct Tnode { int x, f, tag, ls, rs; } t[3000000]; int n, m, k, K, ans, rt, tot; bool cmp(node x, node y) { return x.a < y.a; } int getfull(int l, int r) { int s = 0; l--; for (int j = 1; j <= ...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 * 4; inline int get() { int x; cin >> x; return x; } inline long long getlong() { long long x; cin >> x; return x; } inline string getString() { string s; cin >> s; return s; } template <typename T> ...
#include <bits/stdc++.h> using namespace std; const int MAX_N = 1000, INDEX = 1; int n, type[MAX_N + INDEX]; string team[MAX_N + INDEX], city[MAX_N + INDEX]; bool isUsed[MAX_N + INDEX]; void get(int ind) { isUsed[ind] = true; for (int i = 1; i <= n; i++) { if (i != ind) { if (team[i][0...
#include <bits/stdc++.h> using namespace std; int N; bool check(int k) { int p = (int)ceil(sqrt(k)); for (int i = 2; i <= p; ++i) if (k % i == 0) return 1; return 0; } int main() { cin >> N; int x = 200, y = x + N; for (;; ++x, ++y) if (check(x) && check(y)) return printf( ...
#include <bits/stdc++.h> using namespace std; int n, m; int R[101]; double dp[100100], sum[100100]; int main() { scanf( %d%d , &n, &m); if (m == 1) { puts( 1 ); return 0; } int score = 0; dp[0] = 1; double f = 1. / (m - 1); for (int i = 0; i < n; ++i) { scanf( %d ...
#include <bits/stdc++.h> #pragma warning(disable : 4996) using namespace std; int T; int main() { cin >> T; while (T--) { int a, b, c; cin >> c >> b >> a; string s; if (a > 0) { s += 1 ; for (int i = 0; i < a; i++) s += 1 ; if (b > 0 && b % 2 == 1) { ...
#include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 7; const int MOD = 1e9 + 7; const int di[4] = {1, 0, -1, 0}; const int dj[4] = {0, 1, 0, -1}; mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count()); int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout...
#include <bits/stdc++.h> using namespace std; bool secdes(const pair<long long, long long>& a, const pair<long long, long long>& b) { if (a.second == b.second) { return a.first > b.first; } else { return a.second > b.second; } } signed main() { ios::sync_with_stdio(fals...
#include <bits/stdc++.h> using namespace std; int f[10000050], pre[10000050], used[10000050], edge[105]; vector<int> vec; int main() { int n, m, i, j, x, y, maxi, size, news; scanf( %d%d , &n, &m); for (i = 1; i <= m; i++) { scanf( %d%d , &x, &y); edge[x] \|= 1 << y; edge[y] \|= 1 <<...
#include <bits/stdc++.h> const int maxn = 50; using namespace std; long long n, k, M; int a[maxn + 5], b[maxn * maxn]; void ok() { long long ans = 0, cot = 0, tot = 0, cnt = 0, sum = 0; sort(a + 1, a + k + 1); for (int i = 1; i <= k; i++) cot += a[i]; for (int i = 0; i <= n; i++) { tot =...
#include <bits/stdc++.h> using namespace std; const int N = 10; int mx = 0; vector<int> g[N]; int n; int col[N]; int cnt[N][N]; void gen(int v) { if (v == n) { for (int i = 0; i < n; i++) for (int u : g[i]) { int t = col[i]; int z = col[u]; cnt[min(t, z)][...
#include <bits/stdc++.h> using namespace std; inline long long rd() { long long x = 0; bool f = 0; char c = getchar(); while (!isdigit(c)) { if (c == - ) f = 1; c = getchar(); } while (isdigit(c)) { x = (x << 1) + (x << 3) + (c ^ 48); c = getchar(); } return ...
#include <bits/stdc++.h> using namespace std; vector<pair<long long, long long> > v, par; long long QN, cmd, nums = 0; map<long long, long long> ans; long long solve(long long l, long long r, long long x) { long long st = l, en = r; while (st <= en) { long long mid = (st + en) / 2; if (x <...
#include <bits/stdc++.h> using namespace std; void imp() { cout << -1; exit(0); } double mn = 0, mx = 2e9; void solve(int x, int vx, int x1, int x2) { if (vx == 0) { if (x1 < x && x < x2) return; imp(); } if (vx < 0) { mn = std::max(mn, (x2 - x) / (double)vx); mx = ...
#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; vector<long long> arr(n + 1); for (long long i = 0; i < n; i++) cin >> arr[i]; long long minute; long long mn = 100000000000; long long ans = 0; long long x; for (long long i = 0; i < n; i++) { ...
#include <bits/stdc++.h> using namespace std; int main() { int k1, k2, k3, count[6], min_elt = INT_MAX; memset(count, 0, sizeof(count)); scanf( %d%d%d , &k1, &k2, &k3); count[k1 >= 5 ? 5 : k1]++; count[k2 >= 5 ? 5 : k2]++; count[k3 >= 5 ? 5 : k3]++; min_elt = min(k3, min(k1, k2)); if...
#include <bits/stdc++.h> using namespace std; int main() { long a, b, c, r, d, t, x1 = 0, x2 = 0; cin >> t; while (t--) { cin >> a >> b >> c >> r; d = 0; if (a > b) { swap(a, b); } x1 = c - r; x2 = c + r; if (x2 < a \|\| x1 > b) { d = b - a; ...
#include <bits/stdc++.h> using namespace std; const int N = 100005, M = 50 * N + 5; int n, m, k, ans, X[N], Y[N]; int cnt = 0, hed[M], to[M], nxt[M]; bool vis[M]; char s[55]; int f[M]; int dfn[M], low[M], bl[M], lb = 0, sum[M]; int sta[M], top = 0, idx = 0; inline int g(int u, int d) { return u + d ...
#include <bits/stdc++.h> using namespace std; const int maxN = 100000 + 5, inf = 2005120699; const long long INF = 9200512069999999999ll; int reads() { int ans = 0; bool fu = 0; char ch = getchar(); while ((ch > 9 \|\| ch < 0 ) && ch != - ) ch = getchar(); if (ch == - ) fu = 1, ch = getch...
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; int n; int a[105]; int main() { ios::sync_with_stdio(false); cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; } int mx = 0; for (int i = 1; i <= n; i++) { int tmp = 0; for (int j = i; j <= ...
#include <bits/stdc++.h> using namespace std; struct Node { Node ch[26]; Node() { for (int i = 0; i < 26; i++) ch[i] = NULL; } } Root; struct Trie { void init() { Root = new Node(); } void ins(Node *t, string s) { for (int i = 0; i < s.size(); i++) { int id = s[i] - a...
#include <bits/stdc++.h> using namespace std; const int Maxn = 5555, Inf = 1e9; int n, m; vector<int> G[Maxn]; vector<pair<int, int> > V1[Maxn], V2[Maxn]; int d[Maxn][Maxn]; void bfs(int idx) { for (int i = 1; i <= n; i++) d[idx][i] = i == idx ? 0 : Inf; queue<int> q; q.push(idx); while (!...
#include<bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using pint = pair<int, int>; using pll = pair<ll, ll>; int main(){ int t; cin >> t; while(t--){ int k, n, m; cin >> k >> n >> m; queue<int> a, b; int size = k; fo...
#include <bits/stdc++.h> using namespace std; using namespace std::chrono; template <typename A> ostream &operator<<(ostream &cout, vector<A> const &v); template <typename A, typename B> ostream &operator<<(ostream &cout, pair<A, B> const &p) { return cout << ( << p.first << , << p.second << ) ; ...
#include <bits/stdc++.h> long long s, x; int sba[150], xba[150]; long long bab[150]; int main(int argc, char** argv) { int i, j; int num; int n, m; int flag; long long tmp; long long ans; bab[0] = 1; for (i = 1; i < 60; i++) bab[i] = bab[i - 1] * 2; while (~scanf( %I64d%I64d ...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int T; cin >> T; while (T--) { long long n, k; cin >> n >> k; if (k % 3) { if (n % 3) cout << Alice n ; else cout << ...

#include <bits/stdc++.h> using namespace std; int fu[2003]; int jar[2003]; int main() { int n, refresh; cin >> n >> refresh; for (int(i) = 0; (i) < (n); ++(i)) { cin >> jar[i]; } for (int(i) = 0; (i) < (n); ++(i)) { cin >> fu[i]; } int best = fu[0]; int res = 0; i...

#include <bits/stdc++.h> using namespace std; long long cas; long long a; long long b; long long c; long long d[] = {0, 1, -1}; int main() { scanf( %lld , &cas); while (cas--) { scanf( %lld %lld %lld , &a, &b, &c); long long ans = 21413524368453; for (long long i = 0; i < 3; ++i)...

#include <bits/stdc++.h> using namespace std; template <typename TYPE> void readint(TYPE &x) { x = 0; int f = 1; char c; for (c = getchar(); !isdigit(c); c = getchar()) if (c == - ) f = -1; for (; isdigit(c); c = getchar()) x = x * 10 + c - 0 ; x *= f; } void err(istream_iterat...

#include <bits/stdc++.h> using namespace std; map<long long int, long long int> mymap, mymap1; long long int cum[200010], a[200010]; int main() { long long int n, i, j, k; scanf( %lld , &n); ; scanf( %lld , &k); ; cum[0] = 0; mymap[0]++; for (i = 1; i <= n; i++) { scanf( %l...

#include <bits/stdc++.h> using namespace std; template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << ; cout << endl; } int ans[100000 + 10]; int main() { for (int N; ~scanf( %d , &N);) { memset(ans, 0, sizeof(ans)); vector<int> a(N), b(N); for (int i...

#include <bits/stdc++.h> using namespace std; int val[60]; int n; int grid[2][60]; int mask1[25][1200008 + 1], mask2[25][1200008 + 1]; void solve(int l, int r, int mask[][1200008 + 1]) { memset(mask, -1, sizeof mask); for (int i = 0; i <= 24; i++) for (int j = 0; j < 1200008 + 1; j++) mask[i][...

#include <bits/stdc++.h> using namespace std; const long long N = 2e5 + 5; const long long NN = 1e9 + 5; char a[150][150]; map<char, bool> mp, mp1; bool used[150][150]; long long n, m; vector<char> v; int main() { cin >> n >> m; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++)...

#include <bits/stdc++.h> using namespace std; long long t, n, m, k, x, y, z, a[500005], ans, val; int main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); cin >> n; string s; cin >> s; for (long long i = 0; i < n; i++) { if (s[i] == ( ) x++; else x--...

#include <bits/stdc++.h> using namespace std; const double pi = acos(-1.0); int pal(string s) { int i = 0, j = s.length() - 1; while (i < j) { if (s[i] != s[j]) return 0; i++; j--; } return 1; } int main() { ios_base::sync_with_stdio(false); string str, tp, s; cin...

#include <bits/stdc++.h> using namespace std; const int N_MAX = 51000; int X[N_MAX], Y[N_MAX], Z[N_MAX]; bool vis[N_MAX]; bool ff(int i, int j) { if (X[i] != X[j]) return X[i] < X[j]; if (Y[i] != Y[j]) return Y[i] < Y[j]; return Z[i] < Z[j]; } int main() { int n; cin >> n; vector<i...

#include <bits/stdc++.h> int main() { int n; scanf( %d , &n); int B1, B2; int count1 = 0; int count2 = 0; while (n--) { scanf( %d %d , &B1, &B2); if (B1 > B2) { count1++; } if (B2 > B1) { count2++; } } if (count1 > count2) { printf( M...

#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; int n, m, s, t, ds, dt, cnt, f; vector<pair<int, int>> ans; vector<int> G[N]; pair<int, int> xx[N], yy[N]; bool vi[N]; void dfs(int u) { vi[u] = true; for (int v : G[u]) if (!vi[v]) { ans.push_back({u, v}); ...

#include <bits/stdc++.h> const int mod = 1000000007; int A[13][13], B[13][13], C[13][13]; int ID[4][4]; int L, R, r1, r2; void mul(int A[][13], int B[][13]) { for (int i = 0; i < 13; i++) for (int j = 0; j < 13; j++) C[i][j] = 0; for (int k = 0; k < 13; k++) for (int i = 0; i < 13; i++) ...

#include <bits/stdc++.h> using namespace std; const long long N = 2e5 + 30, Mod = 1e9 + 7; const long long SQ = 330; int main() { ios::sync_with_stdio(0), cin.tie(0); long long a, b; cin >> a >> b; long long ans = 0; while (a > 0 && b > 0) { if (a <= b) a++, b -= 2; else ...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout << 2001 n ; for (int i = 1; i <= 1000; i++) { cout << i << 1 << i << 2 n ; } cout << 1 1 1 2 n ; for (int i = 1; i <= 1000; i++) { cout << i << 1 << i << 2 n ; ...

#include <bits/stdc++.h> using namespace std; const int Max = 1e6 + 100; int pa[Max << 1], son[Max << 1][27]; int deep[Max << 1], sum[Max << 1], tp[Max << 1], S[Max << 1], cnt, root, last; char str[Max << 1]; inline int Newnode(int _deep) { deep[++cnt] = _deep; return cnt; } inline void SAM(int ...

#include <bits/stdc++.h> using namespace std; const int kN = 2e5 + 10; const long long kInf = 1e18 + 10; int n, q; long long a[kN], b[kN]; vector<int> g[kN]; int in[kN], out[kN], dfs_clock; pair<long long, long long> p1[kN], p2[kN]; void dfs(int u) { in[u] = ++dfs_clock; for (int v : g[u]) { ...

#include <bits/stdc++.h> using namespace std; unsigned long long pow_of_two[10000]; int create() { unsigned long long i = 0; unsigned long long num = 1; while (num <= INT_MAX and num >= 0) { num = pow(2, i); pow_of_two[i] = num; i++; } } int main() { int n; cin >> n; ...

#include <bits/stdc++.h> using namespace std; int main() { int n; string s; cin >> n >> s; sort(s.begin(), s.end()); cout << s; }

#include <bits/stdc++.h> using namespace std; int main() { string a = , b = ; int n, m; cin >> n >> m; for (int i = 0; i < 2220; i++) { if (i % 2 == 0) { a += 5 ; b += 4 ; } else { a += 4 ; b += 5 ; } } a += 5 ; b += 5 ; cou...

#include <bits/stdc++.h> using namespace std; ifstream Cin( input.txt ); ofstream Cout( output.txt ); int main() { long long n, x, i, num = 0, m[100001], m1[100001]; m[0] = m1[0] = 0; cin >> n; for (i = 1; i <= n; i++) { cin >> m[i]; m1[i] = m[i]; } sort(m, m + n + 1); fo...

#include <bits/stdc++.h> using namespace std; long long int power(long long int x, unsigned long long int y) { long long int res = 1; while (y > 0) { if (y & 1) { res = res * x; } y = y >> 1; x = x * x; } return res; } long long int powermod(long long int x, unsig...

#include <bits/stdc++.h> using namespace std; const int N = 100005 * 2; struct SegmentTree { int l, r; int sum, lmx, rmn, ansl, ansr, ans, Ans; } t[N << 2]; int s[N]; char ss[N]; void merge(int p) { t[p].sum = t[p * 2].sum + t[p * 2 + 1].sum; t[p].lmx = max(t[p * 2].lmx, t[p * 2].sum + t[p...

#include <bits/stdc++.h> using namespace std; long long a[300005]; long long s[300005]; int main() { ios::sync_with_stdio(0); cin.tie(NULL); int n, p, k; cin >> n >> p >> k; for (int i = 1; i <= n; i++) { cin >> a[i]; a[i] %= p; } map<long long, long long> cnt; for (i...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); string s; cin >> s; vector<string> splitted; stringstream ss(s); string item; while (getline(ss, item, , )) { splitted.push_back(item); } int MAX = 1001; vecto...

#include <bits/stdc++.h> using ul = std::uint32_t; using li = std::int32_t; using ll = std::int64_t; using ull = std::uint64_t; using vul = std::vector<ul>; using vvul = std::vector<vul>; using pulul = std::pair<ul, ul>; using lf = long double; ul n, m; const lf pi = std::acos(lf(-1)); const lf ep...

#include <bits/stdc++.h> using namespace std; struct node { int l, r; } ar[300000]; bool compare(node a, node b) { if (a.r != b.r) return a.r < b.r; else return a.l < b.l; } vector<pair<int, int> > vectl, vectn, temp; int main() { int n, i, m, flag = 0; scanf( %d%d , &n, &m...

#include <bits/stdc++.h> using namespace std; int n, v[100002], nr; int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> v[i]; } sort(v + 1, v + n + 1); for (int i = 1; i <= n - 2; i++) { if (v[i] + v[i + 1] > v[i + 2]) nr++; } if (nr == 0) cout << NO n ; ...

#include <bits/stdc++.h> using namespace std; int N, M, T; char str[1005]; int main() { int i, j, k; scanf( %d , &N); scanf( %s , str); for (i = 0; i < N; i++) if (str[i] == H ) M++; int Mc = 1005; k = 0; for (i = 0; i < M; i++) if (str[i] != H ) k++; int st = 0; ...

#include <bits/stdc++.h> using namespace std; int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long n; cin >> n; long long store[100005] = {}; for (long long i = 1; i <= n; i++) { long long x, y; cin >> x >> y; y = i - y; long long ct ...

#include <bits/stdc++.h> using namespace std; template <typename T> T in() { char ch; T n = 0; bool ng = false; while (1) { ch = getchar(); if (ch == - ) { ng = true; ch = getchar(); break; } if (ch >= 0 && ch <= 9 ) break; } while (1) { ...

#include <bits/stdc++.h> using namespace std; int n, A; int level[10], loyal[10]; double maxP; void backtrack(int p, int k) { if (p == n || k == 0) { double x = 0; for (int mask = 0; mask < (1 << n); mask++) { int cnt = 0, B = 0; double prob = 1.0; for (int i = 0; i < n...

#include <bits/stdc++.h> using namespace std; template <class T, class U> void Max(T &a, U b) { if (a < b) a = b; } template <class T, class U> void Min(T &a, U b) { if (a > b) a = b; } template <class T, class U> void add(T &a, U b) { a += b; if (a >= 1000000007) a -= 1000000007; } ...

#include <bits/stdc++.h> using namespace std; int n, A[5001], B[5001], S[5001], ma, man; int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> A[i]; for (int i = 1; i <= n; i++) { for (int j = i; j <= n; j++) { S[A[j]]++; if (S[A[j]] > ma || (S[A[j]] == ma && A[j] < man)) { ...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; for (int tt = 1; tt <= t; tt++) { int r[100005], g[100005], b[100005]; int nr, ng, nb; cin >> nr >> ng >> nb; for (int i = 0; i < nr; i++) cin >> r[i]; for (int i = 0; i < ng; i++) cin >> g[i]; ...

#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const int maxn = 132222; const long long mod = 1000000007; char s[maxn]; int main() { int n; cin >> n; cin >> s + 1; int len = strlen(s + 1); int l = -1, r = -1; for (int i = (1); i < (len + 1); i++) { if...

#include <bits/stdc++.h> using namespace std; const int MaxN = 5e2 + 10; const int P = 239017; const int INF = 1e9; const int MOD = 1e9 + 7; int dp[MaxN][MaxN][2], n, m, q; char s[MaxN][MaxN]; int get(int xl, int yl, int xr, int yr, int c) { if (c == 0 && xl > xr) { return 0; } if (c =...

#include <bits/stdc++.h> using namespace std; template <class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; } template <class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; } const int maxn = 210000; vector<int> e[maxn]; int h[maxn]; void dfsh(int v, int p)...

#include <bits/stdc++.h> using namespace std; const int maxn = 510; const int MOD = 1e9 + 7; long long dp[2][maxn][maxn]; int N, M; char s[maxn][maxn]; void add(long long &x, long long y) { x += y; if (x >= MOD) x -= MOD; } int main() { scanf( %d%d , &N, &M); for (int i = 1; i <= N; i+...

#include <bits/stdc++.h> using namespace std; vector<int> v1[3010], v2[3010]; int dista[3010][3010], distb[3010][3010]; pair<int, int> besta[3010][3], bestb[3010][3]; int n, m; void dijkstra(int x) { for (int i = 1; i <= n; i++) dista[x][i] = 1000000009; dista[x][x] = 0; priority_queue<pair<int,...

#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10, mod = 1e9 + 7; const long long infl = LLONG_MAX / 2; int n, ans, h[N]; vector<int> g[N], L; void dfs(int u = 0, int p = -1) { bool leaf = 1; for (int x : g[u]) if (x - p) { h[x] = h[u] + 1; dfs(x, u); ...

#include <bits/stdc++.h> using namespace std; int main() { string x, y, z; int a = 0, c = 0; cin >> x; cin >> y; cin >> z; for (int i = 0; i < x.length(); i++) { for (int j = 0; j < z.length(); j++) { if (x[i] == z[j]) { c += 1; z[j] = 1 ; break; ...

#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( Ofast,no-stack-protector,unroll-loops,fast-math ) long long comb(long long n, long long r) { if (r < 0 || r > n) return 0; if ((n - r) < r) r = n - r; long long vec = 1; for (long long i = n; i > n - r; --i) { vec = vec * i;...

#include <bits/stdc++.h> using namespace std; char s1[200010], s2[200010]; long long cal[200010][26], cal2[200010][26]; int main() { int i, j, k, n; long long qq = 0; scanf( %d%s%s , &n, s1, s2); for (i = 1; i <= n; i++) qq += (long long)i * i; cal[0][s2[0] - A ] = 1; for (i = 1; i < n;...

#include <bits/stdc++.h> using namespace std; int n; bool a[20][2][1 << 17]; int ans = 1234, ami, apl; void solve(int ind, int mx, int mi, int pl, int res) { if (ind > 18) { return; } if (mx == 0) { if (res < ans) { ans = res; ami = mi; apl = pl; } r...

#include <bits/stdc++.h> const int oo = 1073741819; using namespace std; int f[200][500], n, t[500], w[500]; int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> t[i] >> w[i]; memset(f, 61, sizeof(f)); f[0][0] = 0; for (int i = 1; i <= n; i++) for (int j = 0; j <= i * 2; j++) { ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 5; const int cipher = -1e9; template <typename T> void chkmax(T &x, T y) { x = max(x, y); } template <typename T> void chkmin(T &x, T y) { x = min(x, y); } template <typename T> void read(T &x) { x = 0; int f = 1;...

#include <bits/stdc++.h> using namespace std; template <class T> T sqr(T x) { return x * x; } template <class T> T gcd(T a, T b) { return (b != 0 ? gcd<T>(b, a % b) : a); } template <class T> T lcm(T a, T b) { return (a / gcd<T>(a, b) * b); } template <class T> inline T bigmod(T p, T...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; int t; int n; string a, b; int op[N]; int opb[N]; int bp = 0; int ans = 0; int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> t; while (t--) { cin >> n; ans = 0; cin >> a; cin >> b;...

#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; long long arr[n]; for (int i = 0; i < n; i++) cin >> arr[i]; if (n > 5 * m) { cout << YES ; return 0; } bool dp[n][m + 1]; for (int i = 0; i <= m; i++) dp[0][i] = false; for (int i = ...

#include <bits/stdc++.h> #pragma warning(disable : 4996) using namespace std; long long __gcd(long long a, long long b) { while (a != 0) { long long __t = b % a; b = a; a = __t; } return b; } bool isSimple(unsigned x) { for (unsigned i = 2; i < x; i++) if (x % i == 0) r...

#include <bits/stdc++.h> using namespace std; int main() { int n, b; while (~scanf( %d%d , &n, &b)) { int a[2050]; int m = -999; for (int i = 0; i < n; i++) scanf( %d , a + i); for (int i = 0; i < n - 1; i++) { int z = b / a[i]; for (int j = i + 1; j < n; j++) { ...

#include <bits/stdc++.h> using namespace std; int get(int a, int b) { if (a < b) return get(b, a); if (a % b == 0) { return a / b; } int c = a / b; return get(b, a % b) + c; } int main() { int N; scanf( %d , &N); for (int i = 0; i < N; i++) { int a, b; scanf( %d...

#include <bits/stdc++.h> using namespace std; char s[200001]; long long a[26]; long long cnt = 0; int main() { long long i, j, k, l, m, n, t; cin >> t; cin >> s; l = strlen(s); for (i = 0; i < 26; i++) a[i] = 0; for (i = 1; i < l; i = i + 2) { if ((s[i - 1] - 97) != (s[i] - 65)) ...

#include <bits/stdc++.h> #pragma GCC optimize( -O3 ) using namespace std; const long long mod = 998244353; struct edge { int u, v, cap; edge() {} edge(int _u, int _v, int _cap) : u(_u), v(_v), cap(_cap) {} int get(int t) { return t ^ u ^ v; } }; const int inf = 1e9; struct edkarp { vec...

#include <bits/stdc++.h> using namespace std; int n; int a[101]; int res = 0; void solve() { for (int i = 2; i < n; ++i) { if (a[i] == 0) { if (a[i - 1] == 1 && a[i + 1] == 1 && a[i + 2] == 0 && a[i + 3] == 1 && i - 1 > 0) { a[i + 1] = 0; ++res; i +=...

#include <bits/stdc++.h> using namespace std; int n, ans[1010][1010]; pair<int, int> a[1010]; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i].first), a[i].second = i; sort(a + 1, a + n + 1); for (int i = 1; i <= n; i++) { int j = i; while (a[i].first--) a...

#include <bits/stdc++.h> using namespace std; const int MAXN = 5040; double dp[MAXN][3], fail[MAXN]; double p[MAXN], f[MAXN]; int t[MAXN]; int main() { int n, T; scanf( %d%d , &n, &T); for (int i = 1; i <= n; i++) { int x; scanf( %d%d , &x, &t[i]); p[i] = x * 1.0 / 100; } ...

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

#include <bits/stdc++.h> using namespace std; int main() { char str[510]; int n, i; bool rec[27]; while (cin >> str) { int flag = 0, faill = 0; memset(rec, 0, sizeof(rec)); int t = strlen(str); if (str[0] != a ) faill = 1; rec[1] = 1; rec[0] = 1; int sum = ...

#include <bits/stdc++.h> using namespace std; const long long INF = 0x3fffffff; double a, b, c, d; int main() { while (cin >> a >> b >> c >> d) { double l = 0, r = 2000000000.0; double a1, a2, b1, b2, c1, c2, d1, d2; double m1, m2, min1, min2; for (int i = 0; i < 10000; i++) { ...

#include <bits/stdc++.h> using namespace std; int min(int a, int b) { if (a > b) { return b; } else { return a; } } int max(int a, int b) { if (a > b) { return a; } else { return b; } } int main() { int n, x0; int a, b; int d, f; cin >> n >> x0...

#include <bits/stdc++.h> using namespace std; int n, leaf, po; vector<int> v[100005]; int main() { scanf( %d , &n); for (int i = (2); i <= (n); i++) { int a, b; scanf( %d %d , &a, &b); v[a].push_back(b); v[b].push_back(a); } for (int i = (1); i <= (n); i++) if (v[i]...

#include <bits/stdc++.h> using namespace std; int main() { int n, t, x, y; int ar = 0; int al = 0; int br = 0; int bl = 0; cin >> n; for (int i = 0; n > i; i++) { cin >> t; cin >> x; cin >> y; if (t == 1) { ar += x; al += y; } else { ...

#include <bits/stdc++.h> using namespace std; int n, a[2 * 2005], pos[2 * 2005], dp[2 * 2005][2 * 2005]; int call(int p, int len) { if (p > 2 * n) return len == n; if (len < n) return 0; int &ret = dp[p][len]; if (~ret) return ret; ret = call(p + pos[p], len); ret += call(p + pos[p], len -...

#include <bits/stdc++.h> using namespace std; const int inf = 1e9 + 7; const long long INF = 4 * (long long)1e18 + 7; const long double eps = 1e-9; signed main() { if (false) { freopen( output.txt , w , stdout); freopen( input.txt , r , stdin); } ios_base::sync_with_stdio(false); ...

#include <bits/stdc++.h> using namespace std; void solve() { int n; cin >> n; string s; cin >> s; map<char, vector<int>> ma; for (int i = 0; i < n; i++) { ma[s[i]].push_back(i + 1); } int m; cin >> m; vector<int> ans; while (m--) { string s1; cin >> s1; ...

#include <bits/stdc++.h> using namespace std; pair<long long, long long> t[4 * 200009]; long long a[200009], lazy[4 * 200009], ans[200009]; void build(long long v, long long tl, long long tr) { if (tl == tr) { t[v] = {a[tl], tl}; } else { long long tm = (tl + tr) / 2; build(v * 2, tl, ...

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

#include <bits/stdc++.h> using namespace std; bool lambs[101]; int main() { int n, m; cin >> n >> m; while (n--) { int x; cin >> x; while (x--) { int y; cin >> y; lambs[y] = true; } } for (int i = 1; i < m + 1; i++) if (lambs[i] == false) {...

#include <bits/stdc++.h> const long long seed = 131; const int N = 1000010; char ac[N], bc[N]; int main() { int n; scanf( %d%s%s , &n, ac, bc), n--; for (int i = 0; i < n; i++) { if (bc[i] == N ) bc[i] = S ; else if (bc[i] == S ) bc[i] = N ; else if (bc[i] == E...

#include <bits/stdc++.h> int n, m; int table[(1 << 20) + 10]; int lowbit[(1 << 20) + 10]; int ba[35][35]; int cost[35][35]; int same[35][35]; char st[35][35]; int min(int x, int y) { if (x < y) return x; else return y; } int main() { int i, a, j; scanf( %d%d n , &n, &m); ...

#include <bits/stdc++.h> using namespace std; const int N = 702, M = 4900005; int main() { int n, m, a[55], b, i, j, ans, cnt; while (scanf( %d , &n) == 1) { for (i = 1; i <= n; i++) scanf( %d , a + i); scanf( %d , &m); for (i = 1, ans = 0; i <= m; i++) { scanf( %d , &b); ...

#include <bits/stdc++.h> using namespace std; const int MAX = (int)1e5 + 55; const int INF = (int)1e9 + 77; const int MOD = (int)1e9 + 7; const double PI = 2 * acos(0.0); const double EPS = 1e-7; const int N = (int)1e5 + 5; vector<vector<int>> adj; pair<int, int> cost[N]; int mn; bool vis[N]; lo...

#include <bits/stdc++.h> using namespace std; struct node { int a, b, c, ty; } a[100010]; struct Tnode { int x, f, tag, ls, rs; } t[3000000]; int n, m, k, K, ans, rt, tot; bool cmp(node x, node y) { return x.a < y.a; } int getfull(int l, int r) { int s = 0; l--; for (int j = 1; j <= ...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 * 4; inline int get() { int x; cin >> x; return x; } inline long long getlong() { long long x; cin >> x; return x; } inline string getString() { string s; cin >> s; return s; } template <typename T> ...

#include <bits/stdc++.h> using namespace std; const int MAX_N = 1000, INDEX = 1; int n, type[MAX_N + INDEX]; string team[MAX_N + INDEX], city[MAX_N + INDEX]; bool isUsed[MAX_N + INDEX]; void get(int ind) { isUsed[ind] = true; for (int i = 1; i <= n; i++) { if (i != ind) { if (team[i][0...

#include <bits/stdc++.h> using namespace std; int N; bool check(int k) { int p = (int)ceil(sqrt(k)); for (int i = 2; i <= p; ++i) if (k % i == 0) return 1; return 0; } int main() { cin >> N; int x = 200, y = x + N; for (;; ++x, ++y) if (check(x) && check(y)) return printf( ...

#include <bits/stdc++.h> using namespace std; int n, m; int R[101]; double dp[100100], sum[100100]; int main() { scanf( %d%d , &n, &m); if (m == 1) { puts( 1 ); return 0; } int score = 0; dp[0] = 1; double f = 1. / (m - 1); for (int i = 0; i < n; ++i) { scanf( %d ...

#include <bits/stdc++.h> #pragma warning(disable : 4996) using namespace std; int T; int main() { cin >> T; while (T--) { int a, b, c; cin >> c >> b >> a; string s; if (a > 0) { s += 1 ; for (int i = 0; i < a; i++) s += 1 ; if (b > 0 && b % 2 == 1) { ...

#include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 7; const int MOD = 1e9 + 7; const int di[4] = {1, 0, -1, 0}; const int dj[4] = {0, 1, 0, -1}; mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count()); int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout...

#include <bits/stdc++.h> using namespace std; bool secdes(const pair<long long, long long>& a, const pair<long long, long long>& b) { if (a.second == b.second) { return a.first > b.first; } else { return a.second > b.second; } } signed main() { ios::sync_with_stdio(fals...

#include <bits/stdc++.h> using namespace std; int f[10000050], pre[10000050], used[10000050], edge[105]; vector<int> vec; int main() { int n, m, i, j, x, y, maxi, size, news; scanf( %d%d , &n, &m); for (i = 1; i <= m; i++) { scanf( %d%d , &x, &y); edge[x] |= 1 << y; edge[y] |= 1 <<...

#include <bits/stdc++.h> const int maxn = 50; using namespace std; long long n, k, M; int a[maxn + 5], b[maxn * maxn]; void ok() { long long ans = 0, cot = 0, tot = 0, cnt = 0, sum = 0; sort(a + 1, a + k + 1); for (int i = 1; i <= k; i++) cot += a[i]; for (int i = 0; i <= n; i++) { tot =...

#include <bits/stdc++.h> using namespace std; const int N = 10; int mx = 0; vector<int> g[N]; int n; int col[N]; int cnt[N][N]; void gen(int v) { if (v == n) { for (int i = 0; i < n; i++) for (int u : g[i]) { int t = col[i]; int z = col[u]; cnt[min(t, z)][...

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

#include <bits/stdc++.h> using namespace std; vector<pair<long long, long long> > v, par; long long QN, cmd, nums = 0; map<long long, long long> ans; long long solve(long long l, long long r, long long x) { long long st = l, en = r; while (st <= en) { long long mid = (st + en) / 2; if (x <...

#include <bits/stdc++.h> using namespace std; void imp() { cout << -1; exit(0); } double mn = 0, mx = 2e9; void solve(int x, int vx, int x1, int x2) { if (vx == 0) { if (x1 < x && x < x2) return; imp(); } if (vx < 0) { mn = std::max(mn, (x2 - x) / (double)vx); mx = ...

#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; vector<long long> arr(n + 1); for (long long i = 0; i < n; i++) cin >> arr[i]; long long minute; long long mn = 100000000000; long long ans = 0; long long x; for (long long i = 0; i < n; i++) { ...

#include <bits/stdc++.h> using namespace std; int main() { int k1, k2, k3, count[6], min_elt = INT_MAX; memset(count, 0, sizeof(count)); scanf( %d%d%d , &k1, &k2, &k3); count[k1 >= 5 ? 5 : k1]++; count[k2 >= 5 ? 5 : k2]++; count[k3 >= 5 ? 5 : k3]++; min_elt = min(k3, min(k1, k2)); if...

#include <bits/stdc++.h> using namespace std; int main() { long a, b, c, r, d, t, x1 = 0, x2 = 0; cin >> t; while (t--) { cin >> a >> b >> c >> r; d = 0; if (a > b) { swap(a, b); } x1 = c - r; x2 = c + r; if (x2 < a || x1 > b) { d = b - a; ...

#include <bits/stdc++.h> using namespace std; const int N = 100005, M = 50 * N + 5; int n, m, k, ans, X[N], Y[N]; int cnt = 0, hed[M], to[M], nxt[M]; bool vis[M]; char s[55]; int f[M]; int dfn[M], low[M], bl[M], lb = 0, sum[M]; int sta[M], top = 0, idx = 0; inline int g(int u, int d) { return u + d ...

#include <bits/stdc++.h> using namespace std; const int maxN = 100000 + 5, inf = 2005120699; const long long INF = 9200512069999999999ll; int reads() { int ans = 0; bool fu = 0; char ch = getchar(); while ((ch > 9 || ch < 0 ) && ch != - ) ch = getchar(); if (ch == - ) fu = 1, ch = getch...

#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; int n; int a[105]; int main() { ios::sync_with_stdio(false); cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; } int mx = 0; for (int i = 1; i <= n; i++) { int tmp = 0; for (int j = i; j <= ...

#include <bits/stdc++.h> using namespace std; struct Node { Node *ch[26]; Node() { for (int i = 0; i < 26; i++) ch[i] = NULL; } } * Root; struct Trie { void init() { Root = new Node(); } void ins(Node *t, string s) { for (int i = 0; i < s.size(); i++) { int id = s[i] - a...

#include <bits/stdc++.h> using namespace std; const int Maxn = 5555, Inf = 1e9; int n, m; vector<int> G[Maxn]; vector<pair<int, int> > V1[Maxn], V2[Maxn]; int d[Maxn][Maxn]; void bfs(int idx) { for (int i = 1; i <= n; i++) d[idx][i] = i == idx ? 0 : Inf; queue<int> q; q.push(idx); while (!...

#include<bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using pint = pair<int, int>; using pll = pair<ll, ll>; int main(){ int t; cin >> t; while(t--){ int k, n, m; cin >> k >> n >> m; queue<int> a, b; int size = k; fo...

#include <bits/stdc++.h> using namespace std; using namespace std::chrono; template <typename A> ostream &operator<<(ostream &cout, vector<A> const &v); template <typename A, typename B> ostream &operator<<(ostream &cout, pair<A, B> const &p) { return cout << ( << p.first << , << p.second << ) ; ...

#include <bits/stdc++.h> long long s, x; int sba[150], xba[150]; long long bab[150]; int main(int argc, char** argv) { int i, j; int num; int n, m; int flag; long long tmp; long long ans; bab[0] = 1; for (i = 1; i < 60; i++) bab[i] = bab[i - 1] * 2; while (~scanf( %I64d%I64d ...