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; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long a; cin >> a; bitset<22> b(a); long long i, j, k; long long c = 0; vector<long long> v; for (i = 0; i <= 40; i++) { long long temp = a; t...
#include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 7; vector<int> eum; int w[100005]; int Euler(int num) { int p = 2, ans = 1; while (p * p <= num) { int ct = 1; while (num % p == 0) { ct = p; num /= p; } if (ct > 1) ct = ct / p (p - 1); ...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:1000000000 ) #pragma GCC optimize( Ofast,no-stack-protector ) using namespace std; const int maxn = (int)5e5 + 10, maxlog = 19; vector<pair<int, int> > ed[maxn]; int par[maxlog][maxn]; int wup[maxn]; int h[maxn]; int pr[maxn]; int getp(int x) ...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 9, M = 998244353; int dp[2][205][2], n, a[N]; long long sum[2][205][2]; int f(int i, int x, int z) { if (a[i] > 0 && x != a[i]) return dp[i % 2][x][z] = 0; if (i == n - 1) return dp[i % 2][x][z] = z; long long ans = 0, l = 0, r = 20...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:1024000000,1024000000 ) using namespace std; const int mxn = 400005, maxnn = 100005; const int mod = 1e9 + 7; long long ans; int n, m, num, cir, r, cnt; int head[maxnn], que[maxnn]; struct edge { int to, next; long long w; } f[mxn << 2];...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n; cin >> n; vector<long long> x(n); for (long long i = 0; i < n; i++) cin >> x[i]; unordered_map<int, int> m; for (auto num : x) { m[num]++; } if ...
#include <bits/stdc++.h> using namespace std; struct pokr { double p1; double p2; double len; pokr(double _p1, double _p2, double _l) : p1(_p1), p2(_p2), len(_l) {} pokr() { p1 = p2 = len = 0; } } d[2100][2100]; int x[2100]; int c[2100][2100]; int a[2100]; int b[2100]; double p, q; ...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast,unroll-loops ) #pragma GCC target( avx,avx2,fma ) using namespace std; template <typename T> using vc = vector<T>; template <typename T> using uset = unordered_set<T>; template <typename A, typename B> using umap = unordered_map<A, B>; template <t...
#include <bits/stdc++.h> using namespace std; const int N = 26; vector<int> kmp; string txt, pattern; vector<vector<int> > nxt, dp; void build() { kmp.resize(pattern.size() + 10); kmp[0] = 0; for (int i = 1, j = 0; i < pattern.size();) { if (pattern[i] == pattern[j]) kmp[i++] = ++j...
#include <bits/stdc++.h> using namespace std; map<int, int> mp; set<int> s; int main(void) { int q; scanf( %d , &q); while (q--) { mp.clear(); int x; scanf( %d , &x); int t = x; int lim = sqrt(t); for (int i = 2; i <= lim; i++) { while (t % i == 0) { ...
#include <bits/stdc++.h> using namespace std; bool isSquare(long long n) { const long long s = (long long)ceil(sqrt(n)); return (s * s) == n; } long long calcCostToSquare(long long n) { if (isSquare(n)) return 0; const auto f1 = (long long)ceil(sqrt(n)); const auto f2 = (long long)floor(sqrt...
#include <bits/stdc++.h> using namespace std; long long num_to_sig(long long x) { vector<int> v; while (x > 0) { v.push_back((x % 10) % 2); x /= 10; } int n = v.size(); long long ret = 0; for (int i = n - 1; i >= 0; i--) { ret *= 10; ret += v[i]; } return ret;...
#include <bits/stdc++.h> using namespace std; vector<long long> sp; vector<pair<long long, long long>> bases; int main() { int s, b; cin >> s >> b; long long num, num2; for (int i = 0; i < s; i++) { cin >> num; sp.push_back(num); } for (int i = 0; i < b; i++) { cin >> n...
#include <bits/stdc++.h> using namespace std; const long long int mod = 1e9 + 7; const double pie = 3.14159265358979323846; const char nl = n ; template <typename Type> istream &operator>>(istream &in, vector<Type> &v) { long long int n = v.size(); for (int i = 0; i < n; i++) in >> v[i]; retur...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; int n, a[N], fa[N], head[N], p, deep[N]; long long Chuan1[N], Chuan2[N], Ans; queue<int> q; struct wfh { int to, last; } d[N << 1]; inline void add(int a, int b) { d[++p] = (wfh){b, head[a]}, head[a] = p; } inline long long max(l...
#include <bits/stdc++.h> using namespace std; int a[111111]; int b[111111]; int main() { int n, m, c; scanf( %d%d%d , &n, &m, &c); for (int i = 0; i < n; i++) scanf( %d , &a[i]); for (int i = 0; i < m; i++) scanf( %d , &b[i]); for (int i = 1; i < m; i++) { b[i] = (b[i] + b[i - 1]) % c;...
#include <bits/stdc++.h> using namespace std; int n, a[22][1 << 18], b[22][1 << 18], c[1 << 18], ans[1 << 18]; int M1, M2, M3, M4, N1, N2; int add(int x, int y) { return (x + y) & M1; } int mult(int x, int y) { int z = 0; int xx = x & N1; xx \|= xx << 1; z = xx & y; xx = x & N2; xx \|= x...
#include <bits/stdc++.h> using namespace std; long long score(long long a, long long b) { if (a == b) return 0; else if ((a == 3 && b == 2) \|\| (a == 2 && b == 1) \|\| (a == 1 && b == 3)) return 1; else return 0; } int main(void) { ios::sync_with_stdio(false); cin.tie(0); ...
#include <bits/stdc++.h> using namespace std; bool sortin(const pair<long long int, long long int> &e, const pair<long long int, long long int> &f) { return (e.first < f.first); } long long int i, j, k, l, m, n, c, p, q, ts, mn = 10e17; long long int a[200002], b[200002], x[200002]; int ma...
#include <bits/stdc++.h> using namespace std; const long long N = 100000 + 10; long long n, K, a[N], b[N]; struct Node { long long v, id; } p[N]; bool cmp(Node x, Node y) { return x.v > y.v; } long long get(long long x, long long v) { return -3ll * (x * x + x) + v + 1; } long long func(long long v, ...
#include <bits/stdc++.h> using namespace std; long long arr[6]; int main() { for (int i = 0; i < 6; ++i) { cin >> arr[i]; } long long res = 0; for (int i = 0; i < 3; ++i) { res += arr[i]; } res = res; for (int i = 0; i < 6; i += 2) { res -= arr[i] arr[i]; } ...
#include <bits/stdc++.h> using namespace std; signed solve(); signed main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int tests = 1; while (tests--) solve(); return 0; } signed solve() { int n, k; cin >> n >> k; if (n <= 1ll * k * (k - 1)) { ...
#include <bits/stdc++.h> using namespace std; template <typename A, typename B> ostream &operator<<(ostream &os, const pair<A, B> &p) { return os << ( << p.first << , << p.second << ) ; } template <typename T_container, typename T = typename enable_if< !is_same<...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[123456]; int avg[123456]; for (int i = 0; i < n; i++) cin >> a[i]; long long count = 0; for (int i = 0; i < n; i++) count += a[i]; int Max = count / n; int rem = count % n; long long c = 0; ...
#include <bits/stdc++.h> using std::min; const int MAXL = 3000000 + 9, MAXM = 5000 + 9, M = 4194304; int tr[M + M]; int ask(int k) { int i; for (i = 1; i < M;) if (k > tr[i + i]) { k -= tr[i + i]; i += i + 1; } else i += i; return i - M; } void change(int u, i...
#include <bits/stdc++.h> using namespace std; inline int sn() { int n = 0; int ch = getchar(); while (ch < 48) ch = getchar(); while (ch > 47) n = (n << 3) + (n << 1) + ch - 0 , ch = getchar(); return n; } double dp[2005][2005]; int main() { int i, j, n, t; double p; scanf( %d...
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; const double EPS = 1e-8; const int mod = 1e9 + 7; const int N = 3e6 + 10; const long long INF = 1e18; long long power(long long x, long long y) { long long t = 1; while (y > 0) { if (y % 2) y -= 1, t = t * x % m...
#include <bits/stdc++.h> using namespace std; inline long long read() { char ch = getchar(); long long p = 1, data = 0; while (ch < 0 \|\| ch > 9 ) { if (ch == - ) p = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { data = data * 10 + (ch ^ 48); ch = getchar(); ...
#include <bits/stdc++.h> using namespace std; const int mx = 1e6; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { long long n, h; cin >> h >> n; long long arr[n]; for (int i = 0; i < n; i++) cin >> arr[i]; lon...
#include <bits/stdc++.h> using namespace std; const int MAXN = 220000; const int MAXM = 2 * MAXN; const int MAXS = 26; struct SAM { struct Node { int nxt[MAXS], par; int len, siz; } st[MAXM]; int m, root, lst; inline int newNode(int l) { int x = ++m; memset(st[x].nxt, 0...
#include <bits/stdc++.h> using namespace std; const long long maxn = 2e6 + 100; const long long inf = 0x3f3f3f3f; const long long iinf = 1 << 30; const long long linf = 2e18; const long long mod = 998244353; const double eps = 1e-7; template <class T = long long> T chmin(T &a, T b) { return a = mi...
#include <bits/stdc++.h> using namespace std; int n, a[100005], l = -1000000000, r = 1000000000; string b; int main() { cin >> n; for (int i = 0; i < n; ++i) cin >> a[i]; cin >> b; for (int i = 4; i < n; ++i) { if (b[i] == 0 && b[i - 1] == 1 ) { int minim = a[i]; for (in...
#include <bits/stdc++.h> using namespace std; vector<vector<int>> adj; bool vis[200000 + 9]; int cntnode; map<int, int> colorcnt; int c[200000 + 9]; int mx; void dfs(int node) { if (vis[node]) { return; } cntnode++; colorcnt[c[node]]++; mx = max(mx, colorcnt[c[node]]); vis[...
#include <bits/stdc++.h> using namespace std; int main() { int m, n; cin >> m >> n; cout << min(m, n) + 1 << endl; for (int i = 0; i <= min(m, n); i++) { cout << i << << (min(m, n) - i) << endl; } }
#include <bits/stdc++.h> using namespace std; struct vertex { long long inside, edge; int size = 1; vector<int> child; }; int ans = 0; multiset<long long> st; vertex g[100009]; void dfs(int v, bool flag, long long deep) { if (flag) { for (int i = 0; i < g[v].child.size(); i++) { ...
#include <bits/stdc++.h> using namespace std; int n, a[100001], b[100001], c[100001], x; map<int, int> a1, b1, c1; int main() { srand(time(NULL)); cin >> n; for (int i = 1; i <= n; ++i) cin >> a[i], a1[a[i]]++; for (int i = 1; i < n; ++i) cin >> b[i], b1[b[i]]++, a1[b[i]]--; for (int i = 1; ...
#include <bits/stdc++.h> using namespace std; const long long MOD = 1000000007; const double pi = 3.141593; int main() { ios::sync_with_stdio(false); int n, t = 0, ans = 0; map<int, int> m; cin >> n; for (int i = 0; i < 2 * n; i++) { int x; cin >> x; m[x]++; t++; ...
#include <bits/stdc++.h> using namespace std; template <class c> struct rge { c b, e; }; template <class c> rge<c> range(c i, c j) { return rge<c>{i, j}; } template <class c> auto dud(c* x) -> decltype(cerr << *x, 0); template <class c> char dud(...); struct debug { template <class c...
#include <bits/stdc++.h> using namespace std; using ll = long long; template<typename A, typename B = A> using pr = pair<A, B>; #define vec vector #define ar array #define len(a) ((int)((a).size())) #define all(a) (a).begin(), (a).end() int q; vec<int> used; int timer; inline void merge(vec<...
#include <bits/stdc++.h> using namespace std; void solve() { int n; string s, t, ss; cin >> n >> s; ss = s; t = abacaba ; int cnt = 0; for (int i = 0; i < n - 6; i++) { int j, k = 0; for (j = i; j < i + 7; j++) { if (s[j] != t[k]) break; k++; } if...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n; cin >> n; vector<int> id(n + 1); for (int i = 0; i < n; i++) { int x; cin >> x; id[x] = i; } vector<int> dp(n + 1, 1); for (int i = 2; i <= n; i++) { ...
#include <bits/stdc++.h> using namespace std; const long long MOD = 998244353; long long dp[1010][2100][4]; int main() { int n, k; scanf( %d%d , &n, &k); dp[1][1][0] = 1, dp[1][2][1] = 1, dp[1][2][2] = 1, dp[1][1][3] = 1; for (int i = 2; i <= n; i++) { for (int j = 1; j <= k; j++) { ...
#include<bits/stdc++.h> #define fo(i,a,b) for(int i=a;i<=b;i++) #define fd(i,a,b) for(int i=a;i>=b;i--) using namespace std; typedef long long LL; typedef pair<int,int> pr; const int maxn=505; int n,m; char mp[maxn][maxn]; int T; int main() { scanf( %d ,&T); while (T--) { ...
#include <bits/stdc++.h> using namespace std; template <class T> inline T sqr(T x) { return x * x; } const double EPS = 1e-6; const int INF = 0x3fffffff; const long long LINF = INF * 1ll * INF; const double PI = acos(-1.0); using namespace std; char g[505][505]; int cnt[505]; int dp[2][505][...
#include <bits/stdc++.h> using namespace std; const int MAXN = 21; const long long MOD = 1000000007; int n; long long m; long long C[MAXN][MAXN]; long long g[MAXN], s[MAXN], ten[MAXN], eight[MAXN]; inline void update(long long& x, long long y) { y %= MOD, x += y, x %= MOD; } inline long long P(const l...
#include <bits/stdc++.h> #pragma GCC optimize(3) using namespace std; const int Mod = 1e9 + 7; const int N = 5e5 + 100; const int INF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3f; inline long long dpow(long long a, long long b) { long long r = 1, t = a; while (b) { if (b & 1) r = ...
#include <bits/stdc++.h> using namespace std; const int Maxn = 1e6 + 1; const int Mod = 1e9 + 7; const long long int MOD = 1000000007LL; const long long int MAX = 100010LL; template <typename T> T gcd(T a, T b) { if (b == 0) return a; return gcd(b, a % b); } template <typename T> T power(T x...
#include <bits/stdc++.h> using namespace std; int main() { int n, t; cin >> n; set<long long int> s; while (n--) { cin >> t; s.insert(t); } if (s.size() >= 4) cout << NO ; else { if (s.size() == 3) { auto it1 = s.begin(); auto it2 = it1; a...
#include <bits/stdc++.h> using namespace std; long long exp(long long x, long long y, long long p) { long long res = 1; while (y) { if (y % 2) res = (res * x % p) % p; x = (x * x) % p; y /= 2; } return res; } long long exp(long long x, long long y) { long long res = 1; ...
#include <bits/stdc++.h> using namespace std; int main(int argc, char const argv[]) { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, k, flag = 0; cin >> n >> k; if (3 n > k) { cout << 3 * n - k << n ; } else { cout << 0 << n ; ...
#include <bits/stdc++.h> using namespace std; struct node { int a, ord; } p[10005]; int b[10005]; bool cmp(node a, node b) { return a.a < b.a; } int main() { int n; while (~scanf( %d , &n)) { memset(b, 0, sizeof(b)); for (int i = 0; i < n; i++) { scanf( %d , &p[i].a); ...
#include <bits/stdc++.h> int check_year_age(int y1, int y2) { if (y1 - y2 > 18) return 2; if (y1 - y2 == 18) return 1; return 0; } bool check_month_day_age(int d1, int d2, int m1, int m2, int y1, int y2) { if (check_year_age(y1, y2) == 1) { if (m1 == m2) { if (d1 >= d2) return 1; ...
#include <bits/stdc++.h> using namespace std; int main() { int t; long long a, b; cin >> t; while (t--) { cin >> a >> b; long long temp = a + b; if (a - b == 1) { int flag = 0; long long i; int n = sqrt(temp); if (temp <= 1) { cout << NO ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr); ; string a; int n; cin >> a >> n; for (int i = 0; i < a.length() && n; ++i) { char x = a[i]; int y = i; for (int j = i + 1; j <= min((int)a.leng...
#include <bits/stdc++.h> using namespace std; const long long MOD = (long long)1e9 + 7; const int inf = (int)1e9 + 7; const double eps = 1e-7; const double pi = 3.14159265359; const int N = (int)1e4; const int K = 4; long long n, k; long long dp[N][K]; signed main() { scanf( %lld%lld , &n, &k); ...
#include <bits/stdc++.h> using namespace std; int n, m; bool a[1001][1001]; bool used[1001][1001]; struct T { int i, j, d; T(int i, int j, int d) : i(i), j(j), d(d) {} }; int main() { cin >> n >> m; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { char ch; ...
#include <bits/stdc++.h> using namespace std; int nod(int a, int b) { while (a && b) { int c = a % b; a = b; b = c; } return a \| b; } int Abs(int a) { return a >= 0 ? a : -a; } int main() { int n, m; cin >> n >> m; vector<vector<int> > e(n); for (int i = 0; i < m;...
#include <bits/stdc++.h> const int N = 500000; int n, k; char s[N + 1], t[N + 1]; int main() { scanf( %d%d%s%s , &n, &k, s, t); int r = 0; long long ans = 0; for (int i = 0; i < n; ++i) { if (r < k) { r *= 2; r += t[i] - s[i]; } r = std::min(r, k); ans += ...
#include<bits/stdc++.h> #define inf 2000000000 #define eb emplace_back #define pb push_back #define fi first #define se second #define fastio ios::sync_with_stdio(false);cin.tie(NULL) #define rng_23 mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()) using namespace std; typedef long l...
#include <bits/stdc++.h> using namespace std; constexpr int inf = 1e9 + 7; constexpr long long md = 1e6; void solve(int testi) { int n; cin >> n; if (n == 0) { cout << 1 << n ; ; return; } vector<int> digits = {6, 8, 4, 2}; cout << digits[n % digits.size()] << n ; ...
#include <bits/stdc++.h> using namespace std; template <class c> struct rge { c b, e; }; template <class c> rge<c> range(c i, c j) { return rge<c>{i, j}; } template <class c> auto dud(c* x) -> decltype(cerr << *x, 0); template <class c> char dud(...); struct debug { template <class c...
#include <bits/stdc++.h> using namespace std; inline bool EQ(double num4, double b) { return fabs(num4 - b) < 1e-9; } const int INF = 1 << 29; inline int two(int len) { return 1 << len; } inline int test(int len, int b) { return (len >> b) & 1; } inline void set_bit(int &len, int b) { len \|= two(b); } inl...
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1); const long long INF = 1LL << 62; const long long MINF = -(1LL << 62); template <typename T> T getint() { T val = 0; char c; bool neg = false; while ((c = getchar()) && !(c >= 0 && c <= 9 )) { neg \|= c == - ; ...
#include <bits/stdc++.h> using namespace std; const int N = 2002; int a[N][N], b[N][N], color[N / 2]; signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; cin >> n; if (n & 1) { cout << NONE << endl; return 0; } for (int j = 0; j < n; j+...
#include <bits/stdc++.h> using namespace std; int cur[100005]; int mark[100005]; int sol[400005]; int csol; int n, m; vector<int> E[100005]; inline void dfs(int u, int up) { mark[u] = 1; csol++; sol[csol] = u; cur[u] ^= 1; int last = 0; for (int i = 0; i < E[u].size(); i++) ...
#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; long long a[n], b[n], c[n]; for (long long i = 0; i < n; i++) { cin >> a[i]; } map<long long, long long> m; map<long long, long long>::iterator it; map<long long, long long>::iterator it1; for...
#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); const int N = 2e5 + 100; int t[20 * N], ls[20 * N], rs[20 * N], a[N], root[N]; int cur_size = 1; void upd(int &v, int u, int l, int r, int pos, int x) { v = cur_size++; t[v] = t[u] + x,...
#include <bits/stdc++.h> using namespace std; int main() { long long int t; cin >> t; while (t--) { long long int n; cin >> n; long long int ans; long long int f = 0; for (long long int i = 3; i <= 360; i++) { if ((n * i) % 180 == 0 && (n * i) / 180 <= i - 2) { ...
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 7; const int inf = 0x3f3f3f; char s[maxn]; char str[4] = RGB ; int main() { int q; scanf( %d , &q); while (q--) { int n, m; scanf( %d%d , &n, &m); scanf( %s , s); int minn = inf; n -= m; for...
#include <bits/stdc++.h> using namespace std; int N; int A[2000000], B[2000000]; int l[2000000], r[2000000], c[2000000]; int main() { scanf( %d , &N); int mxi = 0; for (int Ni = 0; Ni < N; Ni++) { scanf( %d , &A[Ni]); if (A[Ni] > A[mxi]) mxi = Ni; } for (int Ni = 0; Ni < N; Ni+...
#include <bits/stdc++.h> using namespace std; void start() { ios_base::sync_with_stdio(false); cin.tie(NULL); } long long ans = INT_MAX; void solve(long long a, long long b, long long k, long long steps) { if (a == 1 && b == 1) { ans = min(ans, steps); return; } if (a - b > 0) ...
#include <bits/stdc++.h> using namespace std; const long long N = 1e5 + 30, Mod = 1e9 + 7; const long long SQ = 330; const long long LOG = 20; long long n, q, Par[LOG][N], a[N], H[N], St[N], Fn[N], Lazy[N << 2], T, Fen[N], Seg[N << 2], root = 1; vector<long long> G[N]; void DFS(long long v = 1, long...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long int n, m, k; cin >> n >> m >> k; vector<pair<long long int, long long int> > F(n), S(m); long long int maxDay = 0; for (long long int i = 0; i < n; i++) { ...
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:400000000 ) int n, m; struct space { int from, to, dist; space(int f, int t) : from(f), to(t) { if (f > t) { dist = 0; } else if (f == 1 \|\| t == n) { dist = t - f + 1; } else { dist = ...
#include <bits/stdc++.h> using namespace std; using ll = long long; struct dreapta { ll a, b; ll operator()(ll x) { return a * x + b; } }; bool useless(dreapta a, dreapta b, dreapta c) { assert(a.a >= b.a && b.a >= c.a); return (double)(b.b - a.b) / (a.a - b.a) > (double)(c.b - b.b) / (b.a - c...
#include <bits/stdc++.h> using namespace std; template <typename _T, typename _T2> string to_string(pair<_T, _T2> x) { return < + to_string(x.first) + , + to_string(x.second) + > ; } template <typename _T> string to_string(vector<_T> vec) { string s = [ ; for (auto el : vec) s += to_stri...
#include <bits/stdc++.h> using namespace std; typedef pair<int, int> PII; long long qpow(long long a, long long b, long long m) { long long ans = 1; while (b) { if (b & 1) ans = ans * a % m; a = a * a % m, b >>= 1; } return ans; } long long qpow(long long a, long long b) { long...
#include <bits/stdc++.h> using namespace std; int main() { int n, m; string s; cin >> n >> m; cin >> s; int pos = 0; for (int i = 1; i < n; i++) { if (s.substr(0, i) == s.substr(n - i, i)) { pos = i; } } cout << s; for (int i = 1; i < m; i++) { cout << s...
#include <bits/stdc++.h> using namespace std; template <typename T> istream& operator>>(istream& is, vector<T>& v) { for (auto& it : v) is >> it; return is; } template <class L, class R> ostream& operator<<(ostream& os, pair<L, R> P) { return os << ( << P.first << , << P.second << ) ; } ...
#include <bits/stdc++.h> using namespace std; const int maxn = 7, n = 7, maxm = 101; int m, cntblk = maxn, f[maxn], deg[maxn]; bool used[maxm]; class ed { public: int target, id; char type; ed(int t, int i, char ty) : target(t), id(i), type(ty){}; }; class ans { public: int id; c...
#include <bits/stdc++.h> using namespace std; priority_queue<int, vector<int>, less<int> > num; int main() { int n, x; cin >> n; for (int i = 1; i <= n; i++) { cin >> x; num.push(x); } cout << ((num.top()) xor (x)) << n ; }
#include <bits/stdc++.h> using namespace std; const int maxn = 200020; int a[maxn], b[maxn], pos[maxn], ans; unsigned long long hsh, qpow[200020] = {1}, sum; int n, m; struct node { unsigned long long a, tot; } tr[maxn << 2]; void pushup(int p) { tr[p].tot = tr[p << 1].tot + tr[p << 1 \| 1].tot; ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long int n; cin >> n; if (n % 2 == 0) cout << NO << endl; else { cout << YES << endl; long long int b[(2 * n) + 1]; b[1] = 1;...
#include <bits/stdc++.h> using namespace std; const int N = 1e2 + 5; const int MOD = 1e9 + 7; long long cnt[N], x; int n, tmp; vector<vector<long long> > matMul(vector<vector<long long> > &A, vector<vector<long long> > &B) { vector<vector<long long> > C(N, vector<long...
#include <bits/stdc++.h> using namespace std; const int N = 505; const long long inf = 1e18; inline int read() { int x = 0; char c = getchar(); while (!isdigit(c)) c = getchar(); while (isdigit(c)) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar(); return x; } int n, m, now; long long ...
#include <bits/stdc++.h> using namespace std; const int mod = 1000000007; int n, fa[1200000], sf[1200000], len[1200000], f[1200000], g[1200000], diff[1200000], c[1200000][30], p, np, cnt; char s[1200000], a[1200000]; void upd(int &x, int y) { x = (x + y) % mod; } int main() { scanf( %s , s + 1); ...
#include <bits/stdc++.h> using namespace std; const int N = 5000 + 5; const int inf = 0x3f3f3f3f; const int Max = 200000; template <class T> inline void getin(T& num) { char c; bool flag = 0; num = 0; while ((c = getchar()) < 0 \|\| c > 9 ) if (c == - ) flag = 1; while (c >= 0 ...
#include <bits/stdc++.h> using namespace std; const int N = 50 + 5; const int oo = 1000000000; bool u[N][N]; int n, m; int ans = -1; int a[N][N], l[N][N]; int d[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}}; char s[N]; struct pis { int x, y; pis() {} pis(int x, int y) : x(x), y(y) {} } f[...
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const int maxn = 1e5 + 7; int n, x; int main() { cin >> n >> x; int ans = 0, num = 0; if (n == 2 && x == 0) { puts( NO ); return 0; } puts( YES ); if (n == 1) printf( %d , x); else if (n == ...
#include <bits/stdc++.h> using namespace std; mt19937 mt_rand(time(0)); const int N = 105; int t, n; char a[N], b[N], c[N]; int main() { scanf( %d , &t); while (t--) { scanf( %s%s%s , a, b, c); n = 0; while (a[n]) n++; bool ok = 1; for (int i = 0; i < n; i++) { ...
#include <bits/stdc++.h> using namespace std; string str; int memo[100005][3]; int dp(int Idx, int prev) { if (Idx == (int)str.size()) return 0; int choice1 = 1000000; if (memo[Idx][prev] != -1) return memo[Idx][prev]; if (prev == 0) { if (isupper(str[Idx])) choice1 = dp(Idx + 1, 0...
#include <bits/stdc++.h> using namespace std; using ll = long long; double p; bool in_memo[200 + 1][230 + 1][2][1 << 8]; double memo[200 + 1][230 + 1][2][1 << 8]; double E(int k, int lead_count, bool lead_parity, int mask) { double& ans = memo[k][lead_count][lead_parity][mask]; if (not in_memo[k][le...
#include <bits/stdc++.h> using namespace std; template <class S, class T> ostream& operator<<(ostream& st, pair<S, T> p) { st << ( << p.first << , << p.second << ) ; return st; } template <class T> ostream& operator<<(ostream& st, vector<T> v) { st << [ ; for (size_t i = 0; i < v.size(...
#include <bits/stdc++.h> using namespace std; const int maxx = 1e5 + 7; const int Inf = 1 << 30; const long long INF = 1ll << 60; int n; int a[maxx]; vector<int> vec; int pos[maxx]; map<int, int> mp; int ans; int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; int cnt = 0;...
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const int MAXN = 1e6 + 10; int fac[MAXN], infac[MAXN]; long long pow_mod(long long a, long long b) { long long res = 1; while (b) { if (b & 1) res = res * a % MOD; a = a * a % MOD; b >>= 1; } return res; ...
#include <bits/stdc++.h> using namespace std; int a[5000 + 10]; int main() { int n; cin >> n; for (int i = 1; i < n + 1; i++) cin >> a[i]; bool flag = false; for (int i = 1; i < n; i++) { if (a[a[a[i]]] == i) { flag = true; break; } } if (flag) cout <<...
#include <bits/stdc++.h> using namespace std; const int N = 100004; unsigned long long a, b, c = 0, x = 0, y = 0; bool f = 1; void solve() { int c = 0; for (int i = 0; i < 64; i++) { if (b >> i & 1) y \|= 1ll << i; } a -= y; for (int i = 1; i < 64; i++) { int r = a >> i & 1, s =...
#include <bits/stdc++.h> using namespace std; long long nsd(long long a, long long b) { while (b != 0) { a = a % b; swap(a, b); } return a; } long long nsk(long long a, long long b) { return a / nsd(a, b) * b; } bool cmp(long long a, long long b) { return a > b; } void sorts(string& ...
#include <bits/stdc++.h> using namespace std; int main() { long long int i, j, n; cin >> n; long long int arr[n]; vector<long long int> vec[100010]; for (i = 0; i < n; i++) { cin >> arr[i]; vec[arr[i]].push_back(i); } long long int y = 0, d; for (i = 0; i < 100010; i++) {...
#include <bits/stdc++.h> using namespace std; char s[1005]; int main() { int n, f = 1; char p, q; scanf( %s , s); n = strlen(s); p = s; q = s + n - 1; while (p <= q) { if (p == q) { p++; q--; } else { f = 0; break; } } print...

#include <bits/stdc++.h> using namespace std; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long a; cin >> a; bitset<22> b(a); long long i, j, k; long long c = 0; vector<long long> v; for (i = 0; i <= 40; i++) { long long temp = a; t...

#include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 7; vector<int> eum; int w[100005]; int Euler(int num) { int p = 2, ans = 1; while (p * p <= num) { int ct = 1; while (num % p == 0) { ct *= p; num /= p; } if (ct > 1) ct = ct / p * (p - 1); ...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:1000000000 ) #pragma GCC optimize( Ofast,no-stack-protector ) using namespace std; const int maxn = (int)5e5 + 10, maxlog = 19; vector<pair<int, int> > ed[maxn]; int par[maxlog][maxn]; int wup[maxn]; int h[maxn]; int pr[maxn]; int getp(int x) ...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 9, M = 998244353; int dp[2][205][2], n, a[N]; long long sum[2][205][2]; int f(int i, int x, int z) { if (a[i] > 0 && x != a[i]) return dp[i % 2][x][z] = 0; if (i == n - 1) return dp[i % 2][x][z] = z; long long ans = 0, l = 0, r = 20...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:1024000000,1024000000 ) using namespace std; const int mxn = 400005, maxnn = 100005; const int mod = 1e9 + 7; long long ans; int n, m, num, cir, r, cnt; int head[maxnn], que[maxnn]; struct edge { int to, next; long long w; } f[mxn << 2];...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n; cin >> n; vector<long long> x(n); for (long long i = 0; i < n; i++) cin >> x[i]; unordered_map<int, int> m; for (auto num : x) { m[num]++; } if ...

#include <bits/stdc++.h> using namespace std; struct pokr { double p1; double p2; double len; pokr(double _p1, double _p2, double _l) : p1(_p1), p2(_p2), len(_l) {} pokr() { p1 = p2 = len = 0; } } d[2100][2100]; int x[2100]; int c[2100][2100]; int a[2100]; int b[2100]; double p, q; ...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast,unroll-loops ) #pragma GCC target( avx,avx2,fma ) using namespace std; template <typename T> using vc = vector<T>; template <typename T> using uset = unordered_set<T>; template <typename A, typename B> using umap = unordered_map<A, B>; template <t...

#include <bits/stdc++.h> using namespace std; const int N = 26; vector<int> kmp; string txt, pattern; vector<vector<int> > nxt, dp; void build() { kmp.resize(pattern.size() + 10); kmp[0] = 0; for (int i = 1, j = 0; i < pattern.size();) { if (pattern[i] == pattern[j]) kmp[i++] = ++j...

#include <bits/stdc++.h> using namespace std; map<int, int> mp; set<int> s; int main(void) { int q; scanf( %d , &q); while (q--) { mp.clear(); int x; scanf( %d , &x); int t = x; int lim = sqrt(t); for (int i = 2; i <= lim; i++) { while (t % i == 0) { ...

#include <bits/stdc++.h> using namespace std; bool isSquare(long long n) { const long long s = (long long)ceil(sqrt(n)); return (s * s) == n; } long long calcCostToSquare(long long n) { if (isSquare(n)) return 0; const auto f1 = (long long)ceil(sqrt(n)); const auto f2 = (long long)floor(sqrt...

#include <bits/stdc++.h> using namespace std; long long num_to_sig(long long x) { vector<int> v; while (x > 0) { v.push_back((x % 10) % 2); x /= 10; } int n = v.size(); long long ret = 0; for (int i = n - 1; i >= 0; i--) { ret *= 10; ret += v[i]; } return ret;...

#include <bits/stdc++.h> using namespace std; vector<long long> sp; vector<pair<long long, long long>> bases; int main() { int s, b; cin >> s >> b; long long num, num2; for (int i = 0; i < s; i++) { cin >> num; sp.push_back(num); } for (int i = 0; i < b; i++) { cin >> n...

#include <bits/stdc++.h> using namespace std; const long long int mod = 1e9 + 7; const double pie = 3.14159265358979323846; const char nl = n ; template <typename Type> istream &operator>>(istream &in, vector<Type> &v) { long long int n = v.size(); for (int i = 0; i < n; i++) in >> v[i]; retur...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; int n, a[N], fa[N], head[N], p, deep[N]; long long Chuan1[N], Chuan2[N], Ans; queue<int> q; struct wfh { int to, last; } d[N << 1]; inline void add(int a, int b) { d[++p] = (wfh){b, head[a]}, head[a] = p; } inline long long max(l...

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

#include <bits/stdc++.h> using namespace std; int n, a[22][1 << 18], b[22][1 << 18], c[1 << 18], ans[1 << 18]; int M1, M2, M3, M4, N1, N2; int add(int x, int y) { return (x + y) & M1; } int mult(int x, int y) { int z = 0; int xx = x & N1; xx |= xx << 1; z = xx & y; xx = x & N2; xx |= x...

#include <bits/stdc++.h> using namespace std; long long score(long long a, long long b) { if (a == b) return 0; else if ((a == 3 && b == 2) || (a == 2 && b == 1) || (a == 1 && b == 3)) return 1; else return 0; } int main(void) { ios::sync_with_stdio(false); cin.tie(0); ...

#include <bits/stdc++.h> using namespace std; bool sortin(const pair<long long int, long long int> &e, const pair<long long int, long long int> &f) { return (e.first < f.first); } long long int i, j, k, l, m, n, c, p, q, ts, mn = 10e17; long long int a[200002], b[200002], x[200002]; int ma...

#include <bits/stdc++.h> using namespace std; const long long N = 100000 + 10; long long n, K, a[N], b[N]; struct Node { long long v, id; } p[N]; bool cmp(Node x, Node y) { return x.v > y.v; } long long get(long long x, long long v) { return -3ll * (x * x + x) + v + 1; } long long func(long long v, ...

#include <bits/stdc++.h> using namespace std; long long arr[6]; int main() { for (int i = 0; i < 6; ++i) { cin >> arr[i]; } long long res = 0; for (int i = 0; i < 3; ++i) { res += arr[i]; } res *= res; for (int i = 0; i < 6; i += 2) { res -= arr[i] * arr[i]; } ...

#include <bits/stdc++.h> using namespace std; signed solve(); signed main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int tests = 1; while (tests--) solve(); return 0; } signed solve() { int n, k; cin >> n >> k; if (n <= 1ll * k * (k - 1)) { ...

#include <bits/stdc++.h> using namespace std; template <typename A, typename B> ostream &operator<<(ostream &os, const pair<A, B> &p) { return os << ( << p.first << , << p.second << ) ; } template <typename T_container, typename T = typename enable_if< !is_same<...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[123456]; int avg[123456]; for (int i = 0; i < n; i++) cin >> a[i]; long long count = 0; for (int i = 0; i < n; i++) count += a[i]; int Max = count / n; int rem = count % n; long long c = 0; ...

#include <bits/stdc++.h> using std::min; const int MAXL = 3000000 + 9, MAXM = 5000 + 9, M = 4194304; int tr[M + M]; int ask(int k) { int i; for (i = 1; i < M;) if (k > tr[i + i]) { k -= tr[i + i]; i += i + 1; } else i += i; return i - M; } void change(int u, i...

#include <bits/stdc++.h> using namespace std; inline int sn() { int n = 0; int ch = getchar(); while (ch < 48) ch = getchar(); while (ch > 47) n = (n << 3) + (n << 1) + ch - 0 , ch = getchar(); return n; } double dp[2005][2005]; int main() { int i, j, n, t; double p; scanf( %d...

#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; const double EPS = 1e-8; const int mod = 1e9 + 7; const int N = 3e6 + 10; const long long INF = 1e18; long long power(long long x, long long y) { long long t = 1; while (y > 0) { if (y % 2) y -= 1, t = t * x % m...

#include <bits/stdc++.h> using namespace std; inline long long read() { char ch = getchar(); long long p = 1, data = 0; while (ch < 0 || ch > 9 ) { if (ch == - ) p = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { data = data * 10 + (ch ^ 48); ch = getchar(); ...

#include <bits/stdc++.h> using namespace std; const int mx = 1e6; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { long long n, h; cin >> h >> n; long long arr[n]; for (int i = 0; i < n; i++) cin >> arr[i]; lon...

#include <bits/stdc++.h> using namespace std; const int MAXN = 220000; const int MAXM = 2 * MAXN; const int MAXS = 26; struct SAM { struct Node { int nxt[MAXS], par; int len, siz; } st[MAXM]; int m, root, lst; inline int newNode(int l) { int x = ++m; memset(st[x].nxt, 0...

#include <bits/stdc++.h> using namespace std; const long long maxn = 2e6 + 100; const long long inf = 0x3f3f3f3f; const long long iinf = 1 << 30; const long long linf = 2e18; const long long mod = 998244353; const double eps = 1e-7; template <class T = long long> T chmin(T &a, T b) { return a = mi...

#include <bits/stdc++.h> using namespace std; int n, a[100005], l = -1000000000, r = 1000000000; string b; int main() { cin >> n; for (int i = 0; i < n; ++i) cin >> a[i]; cin >> b; for (int i = 4; i < n; ++i) { if (b[i] == 0 && b[i - 1] == 1 ) { int minim = a[i]; for (in...

#include <bits/stdc++.h> using namespace std; vector<vector<int>> adj; bool vis[200000 + 9]; int cntnode; map<int, int> colorcnt; int c[200000 + 9]; int mx; void dfs(int node) { if (vis[node]) { return; } cntnode++; colorcnt[c[node]]++; mx = max(mx, colorcnt[c[node]]); vis[...

#include <bits/stdc++.h> using namespace std; int main() { int m, n; cin >> m >> n; cout << min(m, n) + 1 << endl; for (int i = 0; i <= min(m, n); i++) { cout << i << << (min(m, n) - i) << endl; } }

#include <bits/stdc++.h> using namespace std; struct vertex { long long inside, edge; int size = 1; vector<int> child; }; int ans = 0; multiset<long long> st; vertex g[100009]; void dfs(int v, bool flag, long long deep) { if (flag) { for (int i = 0; i < g[v].child.size(); i++) { ...

#include <bits/stdc++.h> using namespace std; int n, a[100001], b[100001], c[100001], x; map<int, int> a1, b1, c1; int main() { srand(time(NULL)); cin >> n; for (int i = 1; i <= n; ++i) cin >> a[i], a1[a[i]]++; for (int i = 1; i < n; ++i) cin >> b[i], b1[b[i]]++, a1[b[i]]--; for (int i = 1; ...

#include <bits/stdc++.h> using namespace std; const long long MOD = 1000000007; const double pi = 3.141593; int main() { ios::sync_with_stdio(false); int n, t = 0, ans = 0; map<int, int> m; cin >> n; for (int i = 0; i < 2 * n; i++) { int x; cin >> x; m[x]++; t++; ...

#include <bits/stdc++.h> using namespace std; template <class c> struct rge { c b, e; }; template <class c> rge<c> range(c i, c j) { return rge<c>{i, j}; } template <class c> auto dud(c* x) -> decltype(cerr << *x, 0); template <class c> char dud(...); struct debug { template <class c...

#include <bits/stdc++.h> using namespace std; using ll = long long; template<typename A, typename B = A> using pr = pair<A, B>; #define vec vector #define ar array #define len(a) ((int)((a).size())) #define all(a) (a).begin(), (a).end() int q; vec<int> used; int timer; inline void merge(vec<...

#include <bits/stdc++.h> using namespace std; void solve() { int n; string s, t, ss; cin >> n >> s; ss = s; t = abacaba ; int cnt = 0; for (int i = 0; i < n - 6; i++) { int j, k = 0; for (j = i; j < i + 7; j++) { if (s[j] != t[k]) break; k++; } if...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n; cin >> n; vector<int> id(n + 1); for (int i = 0; i < n; i++) { int x; cin >> x; id[x] = i; } vector<int> dp(n + 1, 1); for (int i = 2; i <= n; i++) { ...

#include <bits/stdc++.h> using namespace std; const long long MOD = 998244353; long long dp[1010][2100][4]; int main() { int n, k; scanf( %d%d , &n, &k); dp[1][1][0] = 1, dp[1][2][1] = 1, dp[1][2][2] = 1, dp[1][1][3] = 1; for (int i = 2; i <= n; i++) { for (int j = 1; j <= k; j++) { ...

#include<bits/stdc++.h> #define fo(i,a,b) for(int i=a;i<=b;i++) #define fd(i,a,b) for(int i=a;i>=b;i--) using namespace std; typedef long long LL; typedef pair<int,int> pr; const int maxn=505; int n,m; char mp[maxn][maxn]; int T; int main() { scanf( %d ,&T); while (T--) { ...

#include <bits/stdc++.h> using namespace std; template <class T> inline T sqr(T x) { return x * x; } const double EPS = 1e-6; const int INF = 0x3fffffff; const long long LINF = INF * 1ll * INF; const double PI = acos(-1.0); using namespace std; char g[505][505]; int cnt[505]; int dp[2][505][...

#include <bits/stdc++.h> using namespace std; const int MAXN = 21; const long long MOD = 1000000007; int n; long long m; long long C[MAXN][MAXN]; long long g[MAXN], s[MAXN], ten[MAXN], eight[MAXN]; inline void update(long long& x, long long y) { y %= MOD, x += y, x %= MOD; } inline long long P(const l...

#include <bits/stdc++.h> #pragma GCC optimize(3) using namespace std; const int Mod = 1e9 + 7; const int N = 5e5 + 100; const int INF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3f; inline long long dpow(long long a, long long b) { long long r = 1, t = a; while (b) { if (b & 1) r = ...

#include <bits/stdc++.h> using namespace std; const int Maxn = 1e6 + 1; const int Mod = 1e9 + 7; const long long int MOD = 1000000007LL; const long long int MAX = 100010LL; template <typename T> T gcd(T a, T b) { if (b == 0) return a; return gcd(b, a % b); } template <typename T> T power(T x...

#include <bits/stdc++.h> using namespace std; int main() { int n, t; cin >> n; set<long long int> s; while (n--) { cin >> t; s.insert(t); } if (s.size() >= 4) cout << NO ; else { if (s.size() == 3) { auto it1 = s.begin(); auto it2 = it1; a...

#include <bits/stdc++.h> using namespace std; long long exp(long long x, long long y, long long p) { long long res = 1; while (y) { if (y % 2) res = (res * x % p) % p; x = (x * x) % p; y /= 2; } return res; } long long exp(long long x, long long y) { long long res = 1; ...

#include <bits/stdc++.h> using namespace std; int main(int argc, char const *argv[]) { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, k, flag = 0; cin >> n >> k; if (3 * n > k) { cout << 3 * n - k << n ; } else { cout << 0 << n ; ...

#include <bits/stdc++.h> using namespace std; struct node { int a, ord; } p[10005]; int b[10005]; bool cmp(node a, node b) { return a.a < b.a; } int main() { int n; while (~scanf( %d , &n)) { memset(b, 0, sizeof(b)); for (int i = 0; i < n; i++) { scanf( %d , &p[i].a); ...

#include <bits/stdc++.h> int check_year_age(int y1, int y2) { if (y1 - y2 > 18) return 2; if (y1 - y2 == 18) return 1; return 0; } bool check_month_day_age(int d1, int d2, int m1, int m2, int y1, int y2) { if (check_year_age(y1, y2) == 1) { if (m1 == m2) { if (d1 >= d2) return 1; ...

#include <bits/stdc++.h> using namespace std; int main() { int t; long long a, b; cin >> t; while (t--) { cin >> a >> b; long long temp = a + b; if (a - b == 1) { int flag = 0; long long i; int n = sqrt(temp); if (temp <= 1) { cout << NO ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr); ; string a; int n; cin >> a >> n; for (int i = 0; i < a.length() && n; ++i) { char x = a[i]; int y = i; for (int j = i + 1; j <= min((int)a.leng...

#include <bits/stdc++.h> using namespace std; const long long MOD = (long long)1e9 + 7; const int inf = (int)1e9 + 7; const double eps = 1e-7; const double pi = 3.14159265359; const int N = (int)1e4; const int K = 4; long long n, k; long long dp[N][K]; signed main() { scanf( %lld%lld , &n, &k); ...

#include <bits/stdc++.h> using namespace std; int n, m; bool a[1001][1001]; bool used[1001][1001]; struct T { int i, j, d; T(int i, int j, int d) : i(i), j(j), d(d) {} }; int main() { cin >> n >> m; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { char ch; ...

#include <bits/stdc++.h> using namespace std; int nod(int a, int b) { while (a && b) { int c = a % b; a = b; b = c; } return a | b; } int Abs(int a) { return a >= 0 ? a : -a; } int main() { int n, m; cin >> n >> m; vector<vector<int> > e(n); for (int i = 0; i < m;...

#include <bits/stdc++.h> const int N = 500000; int n, k; char s[N + 1], t[N + 1]; int main() { scanf( %d%d%s%s , &n, &k, s, t); int r = 0; long long ans = 0; for (int i = 0; i < n; ++i) { if (r < k) { r *= 2; r += t[i] - s[i]; } r = std::min(r, k); ans += ...

#include<bits/stdc++.h> #define inf 2000000000 #define eb emplace_back #define pb push_back #define fi first #define se second #define fastio ios::sync_with_stdio(false);cin.tie(NULL) #define rng_23 mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()) using namespace std; typedef long l...

#include <bits/stdc++.h> using namespace std; constexpr int inf = 1e9 + 7; constexpr long long md = 1e6; void solve(int testi) { int n; cin >> n; if (n == 0) { cout << 1 << n ; ; return; } vector<int> digits = {6, 8, 4, 2}; cout << digits[n % digits.size()] << n ; ...

#include <bits/stdc++.h> using namespace std; template <class c> struct rge { c b, e; }; template <class c> rge<c> range(c i, c j) { return rge<c>{i, j}; } template <class c> auto dud(c* x) -> decltype(cerr << *x, 0); template <class c> char dud(...); struct debug { template <class c...

#include <bits/stdc++.h> using namespace std; inline bool EQ(double num4, double b) { return fabs(num4 - b) < 1e-9; } const int INF = 1 << 29; inline int two(int len) { return 1 << len; } inline int test(int len, int b) { return (len >> b) & 1; } inline void set_bit(int &len, int b) { len |= two(b); } inl...

#include <bits/stdc++.h> using namespace std; const double PI = acos(-1); const long long INF = 1LL << 62; const long long MINF = -(1LL << 62); template <typename T> T getint() { T val = 0; char c; bool neg = false; while ((c = getchar()) && !(c >= 0 && c <= 9 )) { neg |= c == - ; ...

#include <bits/stdc++.h> using namespace std; const int N = 2002; int a[N][N], b[N][N], color[N / 2]; signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; cin >> n; if (n & 1) { cout << NONE << endl; return 0; } for (int j = 0; j < n; j+...

#include <bits/stdc++.h> using namespace std; int cur[100005]; int mark[100005]; int sol[400005]; int csol; int n, m; vector<int> E[100005]; inline void dfs(int u, int up) { mark[u] = 1; csol++; sol[csol] = u; cur[u] ^= 1; int last = 0; for (int i = 0; i < E[u].size(); i++) ...

#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; long long a[n], b[n], c[n]; for (long long i = 0; i < n; i++) { cin >> a[i]; } map<long long, long long> m; map<long long, long long>::iterator it; map<long long, long long>::iterator it1; for...

#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); const int N = 2e5 + 100; int t[20 * N], ls[20 * N], rs[20 * N], a[N], root[N]; int cur_size = 1; void upd(int &v, int u, int l, int r, int pos, int x) { v = cur_size++; t[v] = t[u] + x,...

#include <bits/stdc++.h> using namespace std; int main() { long long int t; cin >> t; while (t--) { long long int n; cin >> n; long long int ans; long long int f = 0; for (long long int i = 3; i <= 360; i++) { if ((n * i) % 180 == 0 && (n * i) / 180 <= i - 2) { ...

#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 7; const int inf = 0x3f3f3f; char s[maxn]; char str[4] = RGB ; int main() { int q; scanf( %d , &q); while (q--) { int n, m; scanf( %d%d , &n, &m); scanf( %s , s); int minn = inf; n -= m; for...

#include <bits/stdc++.h> using namespace std; int N; int A[2000000], B[2000000]; int l[2000000], r[2000000], c[2000000]; int main() { scanf( %d , &N); int mxi = 0; for (int Ni = 0; Ni < N; Ni++) { scanf( %d , &A[Ni]); if (A[Ni] > A[mxi]) mxi = Ni; } for (int Ni = 0; Ni < N; Ni+...

#include <bits/stdc++.h> using namespace std; void start() { ios_base::sync_with_stdio(false); cin.tie(NULL); } long long ans = INT_MAX; void solve(long long a, long long b, long long k, long long steps) { if (a == 1 && b == 1) { ans = min(ans, steps); return; } if (a - b > 0) ...

#include <bits/stdc++.h> using namespace std; const long long N = 1e5 + 30, Mod = 1e9 + 7; const long long SQ = 330; const long long LOG = 20; long long n, q, Par[LOG][N], a[N], H[N], St[N], Fn[N], Lazy[N << 2], T, Fen[N], Seg[N << 2], root = 1; vector<long long> G[N]; void DFS(long long v = 1, long...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long int n, m, k; cin >> n >> m >> k; vector<pair<long long int, long long int> > F(n), S(m); long long int maxDay = 0; for (long long int i = 0; i < n; i++) { ...

#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:400000000 ) int n, m; struct space { int from, to, dist; space(int f, int t) : from(f), to(t) { if (f > t) { dist = 0; } else if (f == 1 || t == n) { dist = t - f + 1; } else { dist = ...

#include <bits/stdc++.h> using namespace std; using ll = long long; struct dreapta { ll a, b; ll operator()(ll x) { return a * x + b; } }; bool useless(dreapta a, dreapta b, dreapta c) { assert(a.a >= b.a && b.a >= c.a); return (double)(b.b - a.b) / (a.a - b.a) > (double)(c.b - b.b) / (b.a - c...

#include <bits/stdc++.h> using namespace std; template <typename _T, typename _T2> string to_string(pair<_T, _T2> x) { return < + to_string(x.first) + , + to_string(x.second) + > ; } template <typename _T> string to_string(vector<_T> vec) { string s = [ ; for (auto el : vec) s += to_stri...

#include <bits/stdc++.h> using namespace std; typedef pair<int, int> PII; long long qpow(long long a, long long b, long long m) { long long ans = 1; while (b) { if (b & 1) ans = ans * a % m; a = a * a % m, b >>= 1; } return ans; } long long qpow(long long a, long long b) { long...

#include <bits/stdc++.h> using namespace std; int main() { int n, m; string s; cin >> n >> m; cin >> s; int pos = 0; for (int i = 1; i < n; i++) { if (s.substr(0, i) == s.substr(n - i, i)) { pos = i; } } cout << s; for (int i = 1; i < m; i++) { cout << s...

#include <bits/stdc++.h> using namespace std; template <typename T> istream& operator>>(istream& is, vector<T>& v) { for (auto& it : v) is >> it; return is; } template <class L, class R> ostream& operator<<(ostream& os, pair<L, R> P) { return os << ( << P.first << , << P.second << ) ; } ...

#include <bits/stdc++.h> using namespace std; const int maxn = 7, n = 7, maxm = 101; int m, cntblk = maxn, f[maxn], deg[maxn]; bool used[maxm]; class ed { public: int target, id; char type; ed(int t, int i, char ty) : target(t), id(i), type(ty){}; }; class ans { public: int id; c...

#include <bits/stdc++.h> using namespace std; priority_queue<int, vector<int>, less<int> > num; int main() { int n, x; cin >> n; for (int i = 1; i <= n; i++) { cin >> x; num.push(x); } cout << ((num.top()) xor (x)) << n ; }

#include <bits/stdc++.h> using namespace std; const int maxn = 200020; int a[maxn], b[maxn], pos[maxn], ans; unsigned long long hsh, qpow[200020] = {1}, sum; int n, m; struct node { unsigned long long a, tot; } tr[maxn << 2]; void pushup(int p) { tr[p].tot = tr[p << 1].tot + tr[p << 1 | 1].tot; ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long int n; cin >> n; if (n % 2 == 0) cout << NO << endl; else { cout << YES << endl; long long int b[(2 * n) + 1]; b[1] = 1;...

#include <bits/stdc++.h> using namespace std; const int N = 1e2 + 5; const int MOD = 1e9 + 7; long long cnt[N], x; int n, tmp; vector<vector<long long> > matMul(vector<vector<long long> > &A, vector<vector<long long> > &B) { vector<vector<long long> > C(N, vector<long...

#include <bits/stdc++.h> using namespace std; const int N = 505; const long long inf = 1e18; inline int read() { int x = 0; char c = getchar(); while (!isdigit(c)) c = getchar(); while (isdigit(c)) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar(); return x; } int n, m, now; long long ...

#include <bits/stdc++.h> using namespace std; const int mod = 1000000007; int n, fa[1200000], sf[1200000], len[1200000], f[1200000], g[1200000], diff[1200000], c[1200000][30], p, np, cnt; char s[1200000], a[1200000]; void upd(int &x, int y) { x = (x + y) % mod; } int main() { scanf( %s , s + 1); ...

#include <bits/stdc++.h> using namespace std; const int N = 5000 + 5; const int inf = 0x3f3f3f3f; const int Max = 200000; template <class T> inline void getin(T& num) { char c; bool flag = 0; num = 0; while ((c = getchar()) < 0 || c > 9 ) if (c == - ) flag = 1; while (c >= 0 ...

#include <bits/stdc++.h> using namespace std; const int N = 50 + 5; const int oo = 1000000000; bool u[N][N]; int n, m; int ans = -1; int a[N][N], l[N][N]; int d[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}}; char s[N]; struct pis { int x, y; pis() {} pis(int x, int y) : x(x), y(y) {} } f[...

#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const int maxn = 1e5 + 7; int n, x; int main() { cin >> n >> x; int ans = 0, num = 0; if (n == 2 && x == 0) { puts( NO ); return 0; } puts( YES ); if (n == 1) printf( %d , x); else if (n == ...

#include <bits/stdc++.h> using namespace std; mt19937 mt_rand(time(0)); const int N = 105; int t, n; char a[N], b[N], c[N]; int main() { scanf( %d , &t); while (t--) { scanf( %s%s%s , a, b, c); n = 0; while (a[n]) n++; bool ok = 1; for (int i = 0; i < n; i++) { ...

#include <bits/stdc++.h> using namespace std; string str; int memo[100005][3]; int dp(int Idx, int prev) { if (Idx == (int)str.size()) return 0; int choice1 = 1000000; if (memo[Idx][prev] != -1) return memo[Idx][prev]; if (prev == 0) { if (isupper(str[Idx])) choice1 = dp(Idx + 1, 0...

#include <bits/stdc++.h> using namespace std; using ll = long long; double p; bool in_memo[200 + 1][230 + 1][2][1 << 8]; double memo[200 + 1][230 + 1][2][1 << 8]; double E(int k, int lead_count, bool lead_parity, int mask) { double& ans = memo[k][lead_count][lead_parity][mask]; if (not in_memo[k][le...

#include <bits/stdc++.h> using namespace std; template <class S, class T> ostream& operator<<(ostream& st, pair<S, T> p) { st << ( << p.first << , << p.second << ) ; return st; } template <class T> ostream& operator<<(ostream& st, vector<T> v) { st << [ ; for (size_t i = 0; i < v.size(...

#include <bits/stdc++.h> using namespace std; const int maxx = 1e5 + 7; const int Inf = 1 << 30; const long long INF = 1ll << 60; int n; int a[maxx]; vector<int> vec; int pos[maxx]; map<int, int> mp; int ans; int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; int cnt = 0;...

#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const int MAXN = 1e6 + 10; int fac[MAXN], infac[MAXN]; long long pow_mod(long long a, long long b) { long long res = 1; while (b) { if (b & 1) res = res * a % MOD; a = a * a % MOD; b >>= 1; } return res; ...

#include <bits/stdc++.h> using namespace std; int a[5000 + 10]; int main() { int n; cin >> n; for (int i = 1; i < n + 1; i++) cin >> a[i]; bool flag = false; for (int i = 1; i < n; i++) { if (a[a[a[i]]] == i) { flag = true; break; } } if (flag) cout <<...

#include <bits/stdc++.h> using namespace std; const int N = 100004; unsigned long long a, b, c = 0, x = 0, y = 0; bool f = 1; void solve() { int c = 0; for (int i = 0; i < 64; i++) { if (b >> i & 1) y |= 1ll << i; } a -= y; for (int i = 1; i < 64; i++) { int r = a >> i & 1, s =...

#include <bits/stdc++.h> using namespace std; long long nsd(long long a, long long b) { while (b != 0) { a = a % b; swap(a, b); } return a; } long long nsk(long long a, long long b) { return a / nsd(a, b) * b; } bool cmp(long long a, long long b) { return a > b; } void sorts(string& ...

#include <bits/stdc++.h> using namespace std; int main() { long long int i, j, n; cin >> n; long long int arr[n]; vector<long long int> vec[100010]; for (i = 0; i < n; i++) { cin >> arr[i]; vec[arr[i]].push_back(i); } long long int y = 0, d; for (i = 0; i < 100010; i++) {...

#include <bits/stdc++.h> using namespace std; char s[1005]; int main() { int n, f = 1; char *p, *q; scanf( %s , s); n = strlen(s); p = s; q = s + n - 1; while (p <= q) { if (*p == *q) { p++; q--; } else { f = 0; break; } } print...