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; void init_code() {} int main() { init_code(); long long t; cin >> t; while (t--) { long long n, k; cin >> n >> k; long long num = 1, res = 0; while (k) { if (k & 1) { res += num; res %= 1000000000 + 7...
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { for (; b; a %= b, swap(a, b)) ; return a; } int dx[4] = {1, -1, 0, 0}; int dy[4] = {0, 0, 1, -1}; int main(void) { ios::sync_with_stdio(0); cin.tie(0), cout.tie(0); int t; cin >> t; whil...
#include <bits/stdc++.h> using namespace std; long long a[15], y, k2, k3, r1, z, k4, r, max1, k5, k1, min1, b[1005], n1, n, m, k, i, j; vector<char> f; int main() { string s, s1; cin >> k >> n; cin >> s; for (i = 0; i < n; i++) { for (j = 0; j < 10; j++) a[j] = 0; cin >> k1 >> ...
#include <bits/stdc++.h> using namespace std; const int N = 501; int a[N][N], b[N][N]; void solve() { int n, m; cin >> n >> m; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> a[i][j]; } } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) {...
#include <bits/stdc++.h> using namespace std; int mirror(int num) { int res = 0; for (int i = 0; i < 4; ++i) { res \|= (num & (1 << i)) << (7 - i - i); res \|= (num & (1 << (7 - i))) >> (7 - i - i); } return res; } int main() { int num; string s; vector<int> res; getlin...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; struct edge { int to, nxt, w; } e[N << 1]; int head[N], tot = 0; int n, m; int vis[N], mxd, id; int sum[N], dr[N], cnt = 0, pa[N], used[N]; int dp[N], a[N], b[N], siz[N], anc[N], mp[N]; void adde(int u, int v, int w) { e[+...
#include <bits/stdc++.h> using std::abs; using std::bitset; using std::cerr; using std::cin; using std::copy; using std::cout; using std::deque; using std::endl; using std::fill; using std::fixed; using std::greater; using std::iota; using std::istream; using std::lower_bound; using std::m...
#include <bits/stdc++.h> using namespace std; bool isPrime(int n) { if (n <= 1) return false; if (n <= 3) return true; if (n % 2 == 0 \|\| n % 3 == 0) return false; for (int i = 5; i * i <= n; i = i + 6) if (n % i == 0 \|\| n % (i + 2) == 0) return false; return true; } void solve() { ...
#include <bits/stdc++.h> #pragma GCC optimise( Ofast , unroll-loops) using namespace std; void solve() { int n, m, k; cin >> n >> m >> k; long long a[n][m], b[n * m + 3], c[n][m]; memset(a, 0, sizeof(a)); memset(b, 0, sizeof(b)); memset(c, 0, sizeof(c)); for (int i = 0; i < n; i++) { ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long a[14], tmp[14]; for (long long i = 0; i < 14; i++) cin >> a[i]; long long anss = 0; for (long long i = 0; i < 14; i++) { for (long long j = 0; j < 14; j++) tmp[j] = a[j...
#include <bits/stdc++.h> using namespace std; const int MAXN = 300002; int n, m, l[MAXN * 4], r[MAXN * 4], d[MAXN * 4], id[MAXN]; string s; void input() { scanf( %d%d , &n, &m); cin.ignore(1); getline(cin, s); s = 0 + s; } void init(int x, int left, int right) { l[x] = left; r[x]...
#include <bits/stdc++.h> using namespace std; long long n, m, len; long long a, b, c, l; void solve() { long long tot = ((l + 3) * (l + 2) * (l + 1)) / 6; long long i; for (i = 0; i <= l; i++) { long long x = min(a - b - c + i, l - i); if (x < 0) continue; tot -= ((x + 2) * (x + 1)...
#include <bits/stdc++.h> using namespace std; const int INF = 1000000009; const int MAXN = 100000; int n, m; vector<pair<int, int> > graph[MAXN + 3]; bool vis[MAXN + 3]; bool color[MAXN + 3]; vector<int> ans[2], curr, output; int counter; void Read() { scanf( %d %d , &n, &m); for (int i = 0;...
#include <bits/stdc++.h> using namespace std; int n; string res; map<string, int> stv; map<int, string> vts; vector<string> a, s({ 1110111 , 0010010 , 1011101 , 1011011 , 0111010 , 1101011 , 1101111 , 1010010 , 1111111 , 1111011 }); vector<vector<int>> dp; int cnt(string ...
#include <bits/stdc++.h> using namespace std; bool debug = 0; int n, m, k; int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0}; string direc = RDLU ; long long ln, lk, lm; void et(bool f = 0) { puts(f ? MAGIC : NOT MAGIC ); exit(0); } int a[2505][2505]; bitset<2505> bs[2505]; void fmain()...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 100, inf = 0x3f3f3f3f, mod = 1e9 + 7, M = 1e6 + 1000; const long long INF = 0x3f3f3f3f3f3f3f3f; long long sp(long long a, long long b, long long d) { if (!b) return 1; return b % 2 ? sp(a * a, b / 2, d) * a % d : sp(a * a, b / 2, d); } ...
#include <bits/stdc++.h> using namespace std; long long a[300005]; vector<long long> adjlist[1048585]; int main() { long long n, i; scanf( %lld , &n); for (i = 0; i < n; i++) { scanf( %lld , a + i); } for (i = 1; i < n; i++) { a[i] = a[i - 1] ^ a[i]; } adjlist[0].push_bac...
#include <bits/stdc++.h> int n, m; int d[250000]; int h[250000]; int c[250000]; int r[250000]; int diferencias[160000]; int a[401]; bool sirve(int v, int idCamion) { int litros = v; int cantRecargas = r[idCamion]; for (int i = d[idCamion] + 1; i <= h[idCamion]; i++) { if (v < a[i] - a[...
#include <bits/stdc++.h> using namespace std; int n, m, a[300010][27]; int val[300010], cost[610]; int fail[300010]; string st[610]; char s[300010], p[300010]; int main() { int T, op, len, slen, i, j, k, x; long long ans; for (scanf( %d , &T); T; --T) { scanf( %d %s , &op, s); len ...
#include <bits/stdc++.h> int n, i, x, p[1 << 20], q[1 << 20], t[1 << 20], k; int main() { scanf( %d , &n); for (i = 0; i < n && 1 == scanf( %d , &p[i]); ++i) ; for (scanf( %d , &i); i-- > 0 && 1 == scanf( %d , &x); q[x - 1] = 1) ; for (i = n; i-- > 0;) if (q[i] \|\| !k \|\| p[i] != t[k...
#include <bits/stdc++.h> using namespace std; const int N = 1234567; vector<int> rev[N]; char foo[N]; int on_cycle[N]; int digit[N], to[N]; bool found; void dfs(int v, int pos) { if (pos < 0) { found = true; } if (found) { return; } int sz = rev[v].size(); for (int j ...
#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { vector<int> v; int n; cin >> n; for (int i = 0; i < n; i++) { int t; cin >> t; v.push_back(t); } sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); v.erase(remove...
#include <bits/stdc++.h> int a[40][40], b[40][40], ta[40][40]; int ansx[1010000], ansy[1010000]; int za[1010], zb[1010]; int aaa[40][40], bbb[40][40], aaaa[40][40], bbbb[40][40]; int c[40][40]; int main(void) { int n, m, i, j, j1, j2, nm, j3, j4; int ans; int temp; int z; int x, y; i...
#include <bits/stdc++.h> using namespace std; struct node { int d, f, t; long long c; } a[100005]; int cmp(node a, node b) { return a.d < b.d; } long long INF = 0x3f3f3f3f3f3f; long long cost[100005]; int vis[100005]; int cnt1[1000006]; int cnt2[1000006]; long long sum2[1000006]; long long...
#include <bits/stdc++.h> using namespace std; const long long MAXN = 1e6; long long n, b, s[MAXN], m[MAXN], t = 0; long long i, j, d = 0; bool q[MAXN]; int main() { cin >> n >> b; fill(q, q + n, false); for (i = 0; i < n; i++) { cin >> s[i] >> m[i]; } j = 0; for (i = 0; i < n; ...
#include <bits/stdc++.h> using namespace std; const int N = 2111; const int mod = 1e9 + 7; int n; int pri[N], tot; long long a[N], b[N]; struct node { long long k, b; node(long long _k = 0, long long _b = 0) { k = _k; b = _b; } } f[N], g[N]; long long gcd(long long x, long long...
#include <bits/stdc++.h> int main() { long long u, v, a, b; scanf( %lld%lld , &u, &v); if (v == 0) printf( 0 n ); else if (u > v) printf( -1 n ); else if (u == v) { printf( 1 n ); printf( %lld n , u); } else if ((v - u) % 2 == 0) { a = u, b = (v - u) / 2; if...
#include <bits/stdc++.h> using namespace std; int main() { long long n, k = 0, c = -1, x, z; cin >> n; while (true) { c += 1; x = pow(10, c); z = 9 * x; if (n - z > 0) { n -= z; k += (z * (c + 1)); } else { n *= (c + 1); k += n; break...
#include <bits/stdc++.h> using namespace std; int n, a[27], sum, gcd; int odd; int _gcd(int x, int y) { if (x == 0 or x == y) return y; if (x > y) swap(x, y); while (y % x) { y %= x; swap(x, y); } return x; } int main() { scanf( %d , &n); for (int i = 0; i < n; i++) {...
#include<bits/stdc++.h> using namespace std; #define ll long long #define mod 1000000007 void solve() { int k,n,m; cin >> k >> n >> m; vector<int> a(n); for(auto &i:a) { cin >> i; } vector<int> b(m); for(auto &i:b) ...
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; int main() { ios::sync_with_stdio(0); cin.tie(0); ; int n; cin >> n; int odd = 0, even = 0; for (int i = 0; i < n; i++) { int val; cin >> val; if (val % 2) odd++; else even++;...
#include <bits/stdc++.h> using namespace std; struct TrieNode { TrieNode arr[2]; TrieNode() { arr[0] = arr[1] = nullptr; } }; void insert(TrieNode root, int num) { TrieNode *curr = root; for (int i = 20; i >= 0; i--) { if (curr->arr[(num >> i) & 1] == nullptr) curr->arr[(num >> i...
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; long long bp(long long x, long long y) { long long ans = 1; x %= mod; while (y) { if (y & 1) ans = ans * x % mod; x = x * x % mod; y >>= 1; } return ans; } long long mod_inverse(long long x) { re...
#include <bits/stdc++.h> using namespace std; long long int power(long long int x, long long int y, long long int p) { long long int res = 1; x = x % p; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } long long int modInverse(lon...
#include <bits/stdc++.h> using namespace std; string s[8] = { vaporeon , jolteon , flareon , espeon , umbreon , leafeon , glaceon , sylveon }; int f[8] = {0}; int main() { string x; int n, k; scanf( %d , &n); cin >> x; for (int i = 0; i < 8; i++) { if (s[i].siz...
#include <bits/stdc++.h> using namespace std; inline int next_samebit(int mask) { int lowbit = mask & -mask; int slack = lowbit + mask; return slack \| (mask ^ slack) / lowbit / 4; } int n, a[16], ans[4][4], at, row[4], col[4], zig[3], tag[2]; const int mt[] = {1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1...
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1); const double eps = 1e-9; const int inf = 2000000000; const long long infLL = 9000000000000000000; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; int n; cin >> n; string second; ci...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long int t = 1; while (t--) { long long int n, k; cin >> n >> k; long long int ans = -1; for (long long int i = 1;; i++) { long l...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int s1, s11, s12; int s2 = 0; s1 = s11 = s12 = 0; string s, c; s = c = ; for (int i = 0; i < n; i++) { int a, b; cin >> a >> b; if (i == 0) { s1 = a; s2 = 0; s = A...
#include <bits/stdc++.h> #pragma gcc optimize(O3) using namespace std; long long INF = static_cast<long long>(2e18); long long inf = static_cast<long long>(1e9 + 7); long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } vector<vector<set<long long> > > dp; int main() { ios_base::sy...
#include <bits/stdc++.h> using namespace std; double dp[2010][2010][2][2]; int a[2010]; pair<int, int> le[2010], ri[2010]; int ll[2010][2], rr[2010][2]; int h; double p, q; double go(int l, int r, int Li, int Ri) { if (l > r) return 0; if (dp[l][r][Li][Ri] > -1) { return dp[l][r][Li][Ri]; ...
#include <bits/stdc++.h> using namespace std; vector<long long> vis; vector<pair<long long, long long>> v; void dfs(long long x, long long y) { pair<long long, long long> p = v[x]; vis[x] = 1; if (x == y) return; for (long long i = 0; i < v.size(); i++) { if (vis[i]) continue; if (p....
#include <bits/stdc++.h> using namespace std; const int maxn = 1000000 + 10; const int mod = 1e9 + 7; int n, k, a[maxn], f[maxn], g[maxn]; int fast_pow(int a, int b) { int ret = 1; for (; b; b >>= 1, a = 1ll * a * a % mod) if (b & 1) ret = 1ll * ret * a % mod; return ret; } int main() { ...
#include <bits/stdc++.h> using namespace std; long long bigmod(long long a, long long p) { long long ret = 1; while (p > 0) { if ((p & 1)) ret = (ret * a) % 998244353LL; p >>= 1; a = (a * a) % 998244353LL; } return ret; } long long modinverse(long long a) { return bigmod(a, 998...
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> m >> n; char a[n][m]; int i, j, c; for (i = 0; i < n; i++) { for (j = 0; j < m; j++) { cin >> a[i][j]; } } char b[m][n]; for (i = 0; i < m; i++) { for (j = 0; j < n; j++) { b...
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; int cnt = 0, cur = 0; do { cur++; } while (cur * 5 < n); cnt = cur; cur = 0; do { cur++; } while (cur * 4 < n); cnt = max(cnt, cur); for (int i = 0; i < cnt; i++) cout << 5; ...
#include <bits/stdc++.h> using namespace std; const int N = 100000 + 5, inf = 1e9 + 7; int n, m, x, y, l, r, f[N]; struct tt { int l, r; } a[100]; int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) { scanf( %d%d , &x, &y); l = max(1, x - y), r = min(m, x + y); a[i...
#include <bits/stdc++.h> using namespace std; const long long inf = 1e18; const int N = 300005; vector<pair<int, int>> g[N]; int pre[N], vis[N], sz[N]; long long d[N]; void dfs1(int u, int fa) { pre[u] = fa; for (auto [v, w] : g[u]) { if (v != fa) { d[v] = d[u] + w; dfs1(v, u...
//doing a 800 difficulty question using dynammic programming #include<bits/stdc++.h> #define ll long long using namespace std; int main(){ int t; cin>>t; while(t--){ ll n,m,k; cin>>n>>m>>k; ll dp[n][m]; for(ll i=0;i<n;i++){ for(ll j=0;j<m;j...
#include <bits/stdc++.h> using namespace std; int n, m; vector<int> c; vector<bool> used; vector<vector<int> > e; vector<vector<int> > ices; int colors = 1; int cur = 1; int used_colors[1000000]; void dfs(int v) { if (used[v]) return; used[v] = 1; if (ices[v].size() > colors) { col...
#include <bits/stdc++.h> namespace my_std { using namespace std; inline int read() { char c = getchar(); int ans = 0, f = 1; while (c > 9 \|\| c < 0 ) { f ^= (c == - ); c = getchar(); } for (; c <= 9 && c >= 0 ; c = getchar()) ans = (ans << 1) + (ans << 3) + (c ^ 48); ...
#include <bits/stdc++.h> using namespace std; struct query { int l, r, id, rng; bool operator<(const query &tmp) const { return rng != tmp.rng ? rng < tmp.rng : r < tmp.r; } } Q[100100]; int n, q, a[100100], b[100100], c[100100], cnt[100100], ans[100100]; int D; vector<int> v; void add(i...
#include <bits/stdc++.h> using namespace std; struct Graph { struct Edge { int u, v; int cost; Edge(int _u, int _v, int _cost) : u(_u), v(_v), cost(_cost) {} }; int n, m; bool is_digraph; vector<vector<int>> g; vector<Edge> e; Graph(int _n) : n(_n), m(0) { assert(...
#include<bits/stdc++.h> using namespace std; #define N 1500009 #define INF 5e8 #define mymin(x,y) (x>=y?y:x) #define mymax(x,y) (x>=y?x:y) typedef long long int LL; map<LL, int> mp[3]; int a[4][N]; struct din{ int ap, id; }dn[4][N]; bool cmp(din af, din bf){ return af.ap < bf.ap; } ...
#include <bits/stdc++.h> using namespace std; const int di[] = {-1, -1, -1, 0, 1, 1, 1, 0, 0}, dj[] = {-1, 0, 1, 1, 1, 0, -1, -1, 0}; int st[20][20][20] = {}; bool fr[20][20][20 * 20] = {}; int n; void file_open() { freopen( input.txt , r , stdin); freopen( output.txt , w , stdout); ...
#include <bits/stdc++.h> using namespace std; long long arr1[100][10000], arr[10000]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long t, i, j, k, n, m, x, y, z, a, b, mx; cin >> t; while (t--) { cin >> n; for (i = 0; i < n; i++) { cin >> arr[i]; ...
#include <bits/stdc++.h> using namespace std; int n, a[1001][10], cnt, ans[1001]; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d%d%d%d%d , &a[i][0], &a[i][1], &a[i][2], &a[i][3], &a[i][4]); } if (n > 11) { printf( 0 ); return 0; } for (int i = 1; i...
#include <bits/stdc++.h> long long int mod = 1000000000 + 7; long long int inf = 1000000000000000000; using namespace std; int main() { iostream::sync_with_stdio(false); cin.tie(0); int t; cin >> t; while (t--) { int ans = 1, a; cin >> a; for (int i = 0; i < 31; i++) { ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 5002, NP = 1e9; int Add[MAXN], MyResult[MAXN], MyCheck[MAXN]; bool check(int n, vector<pair<int, pair<int, pair<int, int> > > > A) { for (int i = 0; i < A.size(); i++) { int t = A[i].first, s = A[i].second.first, e = A[i].second.second.fir...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t; cin >> t; for (; t; t--) { int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; i++) cin >> a[i]; vector<int> gist(3); for (int i = 0; i < n; i++) ...
#include <bits/stdc++.h> using namespace std; const double PI = 2 * acos(0.0); mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count()); const string DIGITS = 0123456789 ; const string ALPH = abcdefghijklmnopqrstuvwxyz ;...
#include <bits/stdc++.h> using namespace std; const int inf = 1000000000; long long mod = 1000000007LL; long long mod2 = 998244353LL; int n; bool mat[2005][2005]; int cntr[2005], cntc[2005]; int cnt[2005]; int main() { cin >> n; memset(mat, false, sizeof(mat)); memset(cntr, 0, sizeof(cntr)...
#include <bits/stdc++.h> using namespace std; template <typename _T> inline void _DBG(const char s, _T x) { cerr << s << = << x << n ; } template <typename _T, typename... args> void _DBG(const char s, _T x, args... a) { while (s != , ) cerr << s++; cerr << = << x << , ; _DBG...
#include <bits/stdc++.h> int N, Q; int a[300005]; int p[300005]; int oop[1100005]; int ui, uv; void update(int n, int nl, int nr) { if (nl == ui && ui + 1 == nr) { oop[n] = uv; } else { int mid = (nl + nr) / 2; if (ui < mid) update(n * 2 + 1, nl, mid); else up...
#include <bits/stdc++.h> using namespace std; using ll = long long; using ii = pair<int, int>; constexpr int MAXN = 5 + 50; constexpr ll INF = 1000000000000000002LL; namespace dsu { int f[MAXN], sz[MAXN]; void build(int n) { fill(sz, sz + n, 1); for (int i = (int)0; i < (int)n; ++i) f[i] = i; ...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:1024000000,1024000000 ) using namespace std; vector<int> a[100005]; int dp[100005], n, t; int main() { for (int i = 2; i <= 100000; i++) for (int j = 1; j * i <= 100000; j++) a[i * j].push_back(i); while (cin >> n) { memset(dp, 0, si...
#include <bits/stdc++.h> using namespace std; int main() { int n1, n2, k1, k2; cin >> n1 >> n2 >> k1 >> k2; if (n1 <= n2) cout << Second ; else cout << First ; }
#include <bits/stdc++.h> using namespace std; int n, sum, cnt[10]; bool check; void ghi() { bool check = false; for (int i = 9; i > -1; i--) { if (cnt[i] == 0) continue; if (i != 0) check = true; if (!i && !check) cnt[i] = 1; for (int j = 1; j <= cnt[i]; j++) printf( %d , i); ...
#include <bits/stdc++.h> using namespace std; int nA, nB, m, k, ans, x, y, c1, c2, cnt; int deg[1310 << 1], be[190010], w[1310], w2[1310]; int id[10005][1310], f[10005][1310]; void rv(int x, int c1, int c2) { swap(f[x][c1], f[x][c2]); swap(id[x][c1], id[x][c2]); be[id[x][c2]] = c2; if (f[x][c2...
#include <bits/stdc++.h> using namespace std; const int MAXN = 100100; int N, M; int app[MAXN]; char type[MAXN]; int P[MAXN]; bool check(int leader) { set<int> users; users.insert(leader); for (int i = 0; i < M; i++) { if (type[i] == + ) users.insert(P[i]); else us...
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int N = 1e6 + 9; int main () { int t; cin >> t; while (t--) { ll n, last; cin >> n; for (ll i = 0; i < 33; i++) { if (n & (1ll << i)) last = i; ...
#include <bits/stdc++.h> using namespace std; int main() { int total, n; cin >> total >> n; vector<int> v(n); for (int i = 0; i < n; i++) cin >> v[i]; int ans = 0; for (int i = 0; i < n - 1; i++) { ans += (total - v[i]); } cout << ans; }
#include <bits/stdc++.h> using namespace std; int main() { vector<int> v; int total, num, i, koita = 0; scanf( %d , &total); for (i = 0; i < total; i++) { scanf( %d , &num); v.push_back(num); } int maximum = v[0]; int minimum = v[0]; for (i = 1; i < total; i++) { nu...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n], b[n], c = 0, x = 0, y = 0, z = 0, s = 0; for (int i = 0; i < n; i++) { cin >> a[i]; if (a[i] == 1) { x++; } } for (int i = 0; i < n; i++) { cin >> b[i]; if (a[i] != b[i...
#include <bits/stdc++.h> using namespace std; inline long long read() { char ch = getchar(); long long nega = 1; while (!isdigit(ch)) { if (ch == - ) nega = -1; ch = getchar(); } long long ans = 0; while (isdigit(ch)) { ans = ans * 10 + ch - 48; ch = getchar(); }...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 9; long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } long long s[maxn]; int f[maxn], F[maxn], p[maxn]; int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %lld , &s[i]); ...
#include <bits/stdc++.h> using namespace std; int i, j, k, n, m; int fa[200010], an[200010]; vector<int> a[200010]; pair<int, int> f[200010]; inline void P(int &x, int y) { x = 1ll * x * y % 1000000007; } inline void merge(pair<int, int> &a, pair<int, int> b) { P(a.first, b.first); int g = (2ll * ...
#include <bits/stdc++.h> using namespace std; int n; int ans[200005]; void query(int nl, int nr) { if (nl > nr) return; printf( ? %d %d n , nl, nr); fflush(stdout); int x, f; scanf( %d%d , &x, &f); if (nr - f + 1 <= nl + f - 1) { for (int i = nr - f + 1; i <= nl + f - 1; i++) ans[i...
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int n = s.length(); for (int i = 0; i < n - 1; i++) { if (s[i] == s[i + 1]) { if (i + 2 < n) { if (s[i + 1] == z && s[i + 2] != a ) s[i + 1] = a ; else if (s[i + 1] == z ...
#include <bits/stdc++.h> using namespace std; template <class T> ostream& operator<<(ostream& cout, vector<T> V) { cout << [ ; for (auto v : V) cout << v << ; return cout << ] ; } template <class L, class R> ostream& operator<<(ostream& cout, pair<L, R> P) { return cout << ( << P.fir...
#include <bits/stdc++.h> long long n, md; void rid(int n, int m) { int i; long long sol = 1, p = 1; for (i = 0, p = n; i <= 30; i++) { if ((m & (1 << i)) == (1 << i)) { sol = (long long)sol * p; sol = (long long)sol % md; } p = (long long)p * p; p = (long long)p %...
#include <bits/stdc++.h> using namespace std; int main() { int a[11], mx, n; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); printf( %d , *max_element(a + 1, a + n + 1) ^ a[n]); return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 510; char g[maxn][maxn]; int col[maxn][maxn], v[maxn * maxn], b[maxn * maxn], cnt, n, k, sum; int dx[] = {0, 0, 1, -1}; int dy[] = {1, -1, 0, 0}; void dfs(int x, int y, int c) { col[x][y] = c; ++cnt; for (int i = 0; i < 4; ++i) { ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1000100; int N; long long K; long long arr[MAXN], anew[MAXN], tcur[MAXN], tnew[MAXN]; int main() { scanf( %d %I64d , &N, &K); arr[0] = 0; for (int i = 1; i < N; i++) { int p; long long w; scanf( %d %I64d , &p, &w); ...
#include <bits/stdc++.h> using namespace std; vector<int> by; vector<int> sl; int main() { long long int a, b, c, d, m, n, ck = 0, ans, s, r; cin >> n >> m >> r; for (int i = 0; i < n; i++) { cin >> s; by.push_back(s); } sort(by.begin(), by.end()); for (int j = 0; j < m; j++)...
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10; long long int M = 1e9 + 7; long long int MOD = 998244353; const double PI = 3.141592653589793238460; long long int power(long long int a, long long int b) { long long int res = 1; if (a == 0) return 0; if (a == 1) return 1; ...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n]; int arr[n][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) cin >> arr[i][j]; } a[0] = 0; for (int j = 1; j < n; j++) { a[0] = a[0] \| arr[0][j]; a[j] = arr[0][j]; ...
#include <bits/stdc++.h> using namespace std; long long power(long long a, long long p, long long mod) { long long ret = 1; while (p) { if (p & 1) ret = (ret * a) % mod; a = (a * a) % mod; p /= 2; } return ret; } long long DP[1000]; int A[1000]; int main() { int n; ...
#include <bits/stdc++.h> using namespace std; const int N = 1511, M = 3010100, inf = 0x7fffffff; const long long llinf = 0x7fffffff7fffffffll; long long x[N], y[N], r[N]; long long c[N]; double dist(int i, int j) { return sqrtl((x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j])); } double...
#include <bits/stdc++.h> // #include <atcoder/all> //tabaicho see https://boostjp.github.io/tips/multiprec-int.html // #include <boost/multiprecision/cpp_int.hpp> // using namespace boost::multiprecision; // cpp_int // int128_t // int256_t // int512_t // int1024_t // uint128_t // ...
#include <bits/stdc++.h> using namespace std; vector<string> prices; enum State { name, price }; double to_num(string s) { double n = 0; int dots = 0, dot = 0; bool frac = false; for (char c : s) if (c == . ) ++dots; if (s[s.size() - 3] == . ) frac = true; for (int i = 0; i < s.s...
#include <bits/stdc++.h> const int fin = 0, maxn = 400000, maxm = maxn << 1; int n, m, cent, tot; int fs[maxn], e[maxm], next[maxm]; int bel[maxn], pos[maxn], len[maxn], left[maxn]; int c[maxn], deg[maxn], b[maxn]; bool v[maxn]; struct rec { int x, y; } g[maxn]; int sum(int *a, int n, int x) { ...
#include <bits/stdc++.h> using namespace std; struct dot { int value, i, j; }; bool operator<(dot a, dot b) { return a.value < b.value; } int main() { int t; scanf( %d , &t); while (t--) { int n, m; scanf( %d %d , &n, &m); int num[n][m]; priority_queue<dot> pq; fo...
#include <bits/stdc++.h> using namespace std; int n, m, sum, ans; int cnt[1000010], pre[1000010]; char a[1000010], b[1000010]; int main() { scanf( %s%s , a + 1, b + 1); n = strlen(a + 1); m = strlen(b + 1); for (int i = 1; i < n; i++) if (a[i] != a[i + 1]) cnt[i] = 1; for (int i = 1;...
#include <bits/stdc++.h> using namespace std; int main() { int n, i, j, sum, count; cin >> n; int a[n][n]; int row[n], col[n]; for (i = 0; i < n; i++) { sum = 0; for (j = 0; j < n; j++) { cin >> a[i][j]; sum += a[i][j]; } row[i] = sum; } for (j = 0...
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const int mo = 1000000007; inline void gn(long long &x) { int sg = 1; char c; while (((c = getchar()) < 0 \|\| c > 9 ) && c != - ) ; c == - ? (sg = -1, x = 0) : (x = c - 0 ); while ((c = getchar()) >= 0 &&...
#include <bits/stdc++.h> using namespace std; int n, m, q; pair<int, int> a[400004]; long long ans[200004], d[400004], sum; int fa[400004], l[400004], r[400004], s[400004]; vector<pair<int, int> > v, ask; int F(int x) { return fa[x] == x ? x : fa[x] = F(fa[x]); } long long got(int v) { return d[r[v]] - ...
#include <bits/stdc++.h> using namespace std; int main() { unsigned int n, c, i, ans = 1, arr[100001]; cin >> n >> c; for (i = 0; i < n; i++) { cin >> arr[i]; } for (i = 1; i < n; i++) { if (arr[i] - arr[i - 1] <= c) ans++; else ans = 1; } cout << ans; ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 111 * 1000; int par[MAXN], sz[MAXN]; int find(int i) { if (par[i] == i) return i; return par[i] = find(par[i]); } void un(int a, int b) { sz[find(a)] += sz[find(b)]; par[find(b)] = find(a); } int n; int mark[MAXN]; int su...
#include <bits/stdc++.h> using namespace std; void __print(int x) { cout << x; } void __print(long x) { cout << x; } void __print(long long x) { cout << x; } void __print(unsigned x) { cout << x; } void __print(unsigned long x) { cout << x; } void __print(unsigned long long x) { cout << x; } void __prin...

#include <bits/stdc++.h> using namespace std; void init_code() {} int main() { init_code(); long long t; cin >> t; while (t--) { long long n, k; cin >> n >> k; long long num = 1, res = 0; while (k) { if (k & 1) { res += num; res %= 1000000000 + 7...

#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { for (; b; a %= b, swap(a, b)) ; return a; } int dx[4] = {1, -1, 0, 0}; int dy[4] = {0, 0, 1, -1}; int main(void) { ios::sync_with_stdio(0); cin.tie(0), cout.tie(0); int t; cin >> t; whil...

#include <bits/stdc++.h> using namespace std; long long a[15], y, k2, k3, r1, z, k4, r, max1, k5, k1, min1, b[1005], n1, n, m, k, i, j; vector<char> f; int main() { string s, s1; cin >> k >> n; cin >> s; for (i = 0; i < n; i++) { for (j = 0; j < 10; j++) a[j] = 0; cin >> k1 >> ...

#include <bits/stdc++.h> using namespace std; const int N = 501; int a[N][N], b[N][N]; void solve() { int n, m; cin >> n >> m; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> a[i][j]; } } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) {...

#include <bits/stdc++.h> using namespace std; int mirror(int num) { int res = 0; for (int i = 0; i < 4; ++i) { res |= (num & (1 << i)) << (7 - i - i); res |= (num & (1 << (7 - i))) >> (7 - i - i); } return res; } int main() { int num; string s; vector<int> res; getlin...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; struct edge { int to, nxt, w; } e[N << 1]; int head[N], tot = 0; int n, m; int vis[N], mxd, id; int sum[N], dr[N], cnt = 0, pa[N], used[N]; int dp[N], a[N], b[N], siz[N], anc[N], mp[N]; void adde(int u, int v, int w) { e[+...

#include <bits/stdc++.h> using std::abs; using std::bitset; using std::cerr; using std::cin; using std::copy; using std::cout; using std::deque; using std::endl; using std::fill; using std::fixed; using std::greater; using std::iota; using std::istream; using std::lower_bound; using std::m...

#include <bits/stdc++.h> using namespace std; bool isPrime(int n) { if (n <= 1) return false; if (n <= 3) return true; if (n % 2 == 0 || n % 3 == 0) return false; for (int i = 5; i * i <= n; i = i + 6) if (n % i == 0 || n % (i + 2) == 0) return false; return true; } void solve() { ...

#include <bits/stdc++.h> #pragma GCC optimise( Ofast , unroll-loops) using namespace std; void solve() { int n, m, k; cin >> n >> m >> k; long long a[n][m], b[n * m + 3], c[n][m]; memset(a, 0, sizeof(a)); memset(b, 0, sizeof(b)); memset(c, 0, sizeof(c)); for (int i = 0; i < n; i++) { ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long a[14], tmp[14]; for (long long i = 0; i < 14; i++) cin >> a[i]; long long anss = 0; for (long long i = 0; i < 14; i++) { for (long long j = 0; j < 14; j++) tmp[j] = a[j...

#include <bits/stdc++.h> using namespace std; const int MAXN = 300002; int n, m, l[MAXN * 4], r[MAXN * 4], d[MAXN * 4], id[MAXN]; string s; void input() { scanf( %d%d , &n, &m); cin.ignore(1); getline(cin, s); s = 0 + s; } void init(int x, int left, int right) { l[x] = left; r[x]...

#include <bits/stdc++.h> using namespace std; long long n, m, len; long long a, b, c, l; void solve() { long long tot = ((l + 3) * (l + 2) * (l + 1)) / 6; long long i; for (i = 0; i <= l; i++) { long long x = min(a - b - c + i, l - i); if (x < 0) continue; tot -= ((x + 2) * (x + 1)...

#include <bits/stdc++.h> using namespace std; const int INF = 1000000009; const int MAXN = 100000; int n, m; vector<pair<int, int> > graph[MAXN + 3]; bool vis[MAXN + 3]; bool color[MAXN + 3]; vector<int> ans[2], curr, output; int counter; void Read() { scanf( %d %d , &n, &m); for (int i = 0;...

#include <bits/stdc++.h> using namespace std; int n; string res; map<string, int> stv; map<int, string> vts; vector<string> a, s({ 1110111 , 0010010 , 1011101 , 1011011 , 0111010 , 1101011 , 1101111 , 1010010 , 1111111 , 1111011 }); vector<vector<int>> dp; int cnt(string ...

#include <bits/stdc++.h> using namespace std; bool debug = 0; int n, m, k; int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0}; string direc = RDLU ; long long ln, lk, lm; void et(bool f = 0) { puts(f ? MAGIC : NOT MAGIC ); exit(0); } int a[2505][2505]; bitset<2505> bs[2505]; void fmain()...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 100, inf = 0x3f3f3f3f, mod = 1e9 + 7, M = 1e6 + 1000; const long long INF = 0x3f3f3f3f3f3f3f3f; long long sp(long long a, long long b, long long d) { if (!b) return 1; return b % 2 ? sp(a * a, b / 2, d) * a % d : sp(a * a, b / 2, d); } ...

#include <bits/stdc++.h> using namespace std; long long a[300005]; vector<long long> adjlist[1048585]; int main() { long long n, i; scanf( %lld , &n); for (i = 0; i < n; i++) { scanf( %lld , a + i); } for (i = 1; i < n; i++) { a[i] = a[i - 1] ^ a[i]; } adjlist[0].push_bac...

#include <bits/stdc++.h> int n, m; int d[250000]; int h[250000]; int c[250000]; int r[250000]; int diferencias[160000]; int a[401]; bool sirve(int v, int idCamion) { int litros = v; int cantRecargas = r[idCamion]; for (int i = d[idCamion] + 1; i <= h[idCamion]; i++) { if (v < a[i] - a[...

#include <bits/stdc++.h> using namespace std; int n, m, a[300010][27]; int val[300010], cost[610]; int fail[300010]; string st[610]; char s[300010], p[300010]; int main() { int T, op, len, slen, i, j, k, x; long long ans; for (scanf( %d , &T); T; --T) { scanf( %d %s , &op, s); len ...

#include <bits/stdc++.h> int n, i, x, p[1 << 20], q[1 << 20], t[1 << 20], k; int main() { scanf( %d , &n); for (i = 0; i < n && 1 == scanf( %d , &p[i]); ++i) ; for (scanf( %d , &i); i-- > 0 && 1 == scanf( %d , &x); q[x - 1] = 1) ; for (i = n; i-- > 0;) if (q[i] || !k || p[i] != t[k...

#include <bits/stdc++.h> using namespace std; const int N = 1234567; vector<int> rev[N]; char foo[N]; int on_cycle[N]; int digit[N], to[N]; bool found; void dfs(int v, int pos) { if (pos < 0) { found = true; } if (found) { return; } int sz = rev[v].size(); for (int j ...

#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { vector<int> v; int n; cin >> n; for (int i = 0; i < n; i++) { int t; cin >> t; v.push_back(t); } sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); v.erase(remove...

#include <bits/stdc++.h> int a[40][40], b[40][40], ta[40][40]; int ansx[1010000], ansy[1010000]; int za[1010], zb[1010]; int aaa[40][40], bbb[40][40], aaaa[40][40], bbbb[40][40]; int c[40][40]; int main(void) { int n, m, i, j, j1, j2, nm, j3, j4; int ans; int temp; int z; int x, y; i...

#include <bits/stdc++.h> using namespace std; struct node { int d, f, t; long long c; } a[100005]; int cmp(node a, node b) { return a.d < b.d; } long long INF = 0x3f3f3f3f3f3f; long long cost[100005]; int vis[100005]; int cnt1[1000006]; int cnt2[1000006]; long long sum2[1000006]; long long...

#include <bits/stdc++.h> using namespace std; const long long MAXN = 1e6; long long n, b, s[MAXN], m[MAXN], t = 0; long long i, j, d = 0; bool q[MAXN]; int main() { cin >> n >> b; fill(q, q + n, false); for (i = 0; i < n; i++) { cin >> s[i] >> m[i]; } j = 0; for (i = 0; i < n; ...

#include <bits/stdc++.h> using namespace std; const int N = 2111; const int mod = 1e9 + 7; int n; int pri[N], tot; long long a[N], b[N]; struct node { long long k, b; node(long long _k = 0, long long _b = 0) { k = _k; b = _b; } } f[N], g[N]; long long gcd(long long x, long long...

#include <bits/stdc++.h> int main() { long long u, v, a, b; scanf( %lld%lld , &u, &v); if (v == 0) printf( 0 n ); else if (u > v) printf( -1 n ); else if (u == v) { printf( 1 n ); printf( %lld n , u); } else if ((v - u) % 2 == 0) { a = u, b = (v - u) / 2; if...

#include <bits/stdc++.h> using namespace std; int main() { long long n, k = 0, c = -1, x, z; cin >> n; while (true) { c += 1; x = pow(10, c); z = 9 * x; if (n - z > 0) { n -= z; k += (z * (c + 1)); } else { n *= (c + 1); k += n; break...

#include <bits/stdc++.h> using namespace std; int n, a[27], sum, gcd; int odd; int _gcd(int x, int y) { if (x == 0 or x == y) return y; if (x > y) swap(x, y); while (y % x) { y %= x; swap(x, y); } return x; } int main() { scanf( %d , &n); for (int i = 0; i < n; i++) {...

#include<bits/stdc++.h> using namespace std; #define ll long long #define mod 1000000007 void solve() { int k,n,m; cin >> k >> n >> m; vector<int> a(n); for(auto &i:a) { cin >> i; } vector<int> b(m); for(auto &i:b) ...

#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; int main() { ios::sync_with_stdio(0); cin.tie(0); ; int n; cin >> n; int odd = 0, even = 0; for (int i = 0; i < n; i++) { int val; cin >> val; if (val % 2) odd++; else even++;...

#include <bits/stdc++.h> using namespace std; struct TrieNode { TrieNode *arr[2]; TrieNode() { arr[0] = arr[1] = nullptr; } }; void insert(TrieNode *root, int num) { TrieNode *curr = root; for (int i = 20; i >= 0; i--) { if (curr->arr[(num >> i) & 1] == nullptr) curr->arr[(num >> i...

#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; long long bp(long long x, long long y) { long long ans = 1; x %= mod; while (y) { if (y & 1) ans = ans * x % mod; x = x * x % mod; y >>= 1; } return ans; } long long mod_inverse(long long x) { re...

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

#include <bits/stdc++.h> using namespace std; string s[8] = { vaporeon , jolteon , flareon , espeon , umbreon , leafeon , glaceon , sylveon }; int f[8] = {0}; int main() { string x; int n, k; scanf( %d , &n); cin >> x; for (int i = 0; i < 8; i++) { if (s[i].siz...

#include <bits/stdc++.h> using namespace std; inline int next_samebit(int mask) { int lowbit = mask & -mask; int slack = lowbit + mask; return slack | (mask ^ slack) / lowbit / 4; } int n, a[16], ans[4][4], at, row[4], col[4], zig[3], tag[2]; const int mt[] = {1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1...

#include <bits/stdc++.h> using namespace std; const double PI = acos(-1); const double eps = 1e-9; const int inf = 2000000000; const long long infLL = 9000000000000000000; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; int n; cin >> n; string second; ci...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long int t = 1; while (t--) { long long int n, k; cin >> n >> k; long long int ans = -1; for (long long int i = 1;; i++) { long l...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int s1, s11, s12; int s2 = 0; s1 = s11 = s12 = 0; string s, c; s = c = ; for (int i = 0; i < n; i++) { int a, b; cin >> a >> b; if (i == 0) { s1 = a; s2 = 0; s = A...

#include <bits/stdc++.h> #pragma gcc optimize(O3) using namespace std; long long INF = static_cast<long long>(2e18); long long inf = static_cast<long long>(1e9 + 7); long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } vector<vector<set<long long> > > dp; int main() { ios_base::sy...

#include <bits/stdc++.h> using namespace std; double dp[2010][2010][2][2]; int a[2010]; pair<int, int> le[2010], ri[2010]; int ll[2010][2], rr[2010][2]; int h; double p, q; double go(int l, int r, int Li, int Ri) { if (l > r) return 0; if (dp[l][r][Li][Ri] > -1) { return dp[l][r][Li][Ri]; ...

#include <bits/stdc++.h> using namespace std; vector<long long> vis; vector<pair<long long, long long>> v; void dfs(long long x, long long y) { pair<long long, long long> p = v[x]; vis[x] = 1; if (x == y) return; for (long long i = 0; i < v.size(); i++) { if (vis[i]) continue; if (p....

#include <bits/stdc++.h> using namespace std; const int maxn = 1000000 + 10; const int mod = 1e9 + 7; int n, k, a[maxn], f[maxn], g[maxn]; int fast_pow(int a, int b) { int ret = 1; for (; b; b >>= 1, a = 1ll * a * a % mod) if (b & 1) ret = 1ll * ret * a % mod; return ret; } int main() { ...

#include <bits/stdc++.h> using namespace std; long long bigmod(long long a, long long p) { long long ret = 1; while (p > 0) { if ((p & 1)) ret = (ret * a) % 998244353LL; p >>= 1; a = (a * a) % 998244353LL; } return ret; } long long modinverse(long long a) { return bigmod(a, 998...

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

#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; int cnt = 0, cur = 0; do { cur++; } while (cur * 5 < n); cnt = cur; cur = 0; do { cur++; } while (cur * 4 < n); cnt = max(cnt, cur); for (int i = 0; i < cnt; i++) cout << 5; ...

#include <bits/stdc++.h> using namespace std; const int N = 100000 + 5, inf = 1e9 + 7; int n, m, x, y, l, r, f[N]; struct tt { int l, r; } a[100]; int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) { scanf( %d%d , &x, &y); l = max(1, x - y), r = min(m, x + y); a[i...

#include <bits/stdc++.h> using namespace std; const long long inf = 1e18; const int N = 300005; vector<pair<int, int>> g[N]; int pre[N], vis[N], sz[N]; long long d[N]; void dfs1(int u, int fa) { pre[u] = fa; for (auto [v, w] : g[u]) { if (v != fa) { d[v] = d[u] + w; dfs1(v, u...

//doing a 800 difficulty question using dynammic programming #include<bits/stdc++.h> #define ll long long using namespace std; int main(){ int t; cin>>t; while(t--){ ll n,m,k; cin>>n>>m>>k; ll dp[n][m]; for(ll i=0;i<n;i++){ for(ll j=0;j<m;j...

#include <bits/stdc++.h> using namespace std; int n, m; vector<int> c; vector<bool> used; vector<vector<int> > e; vector<vector<int> > ices; int colors = 1; int cur = 1; int used_colors[1000000]; void dfs(int v) { if (used[v]) return; used[v] = 1; if (ices[v].size() > colors) { col...

#include <bits/stdc++.h> namespace my_std { using namespace std; inline int read() { char c = getchar(); int ans = 0, f = 1; while (c > 9 || c < 0 ) { f ^= (c == - ); c = getchar(); } for (; c <= 9 && c >= 0 ; c = getchar()) ans = (ans << 1) + (ans << 3) + (c ^ 48); ...

#include <bits/stdc++.h> using namespace std; struct query { int l, r, id, rng; bool operator<(const query &tmp) const { return rng != tmp.rng ? rng < tmp.rng : r < tmp.r; } } Q[100100]; int n, q, a[100100], b[100100], c[100100], cnt[100100], ans[100100]; int D; vector<int> v; void add(i...

#include <bits/stdc++.h> using namespace std; struct Graph { struct Edge { int u, v; int cost; Edge(int _u, int _v, int _cost) : u(_u), v(_v), cost(_cost) {} }; int n, m; bool is_digraph; vector<vector<int>> g; vector<Edge> e; Graph(int _n) : n(_n), m(0) { assert(...

#include<bits/stdc++.h> using namespace std; #define N 1500009 #define INF 5e8 #define mymin(x,y) (x>=y?y:x) #define mymax(x,y) (x>=y?x:y) typedef long long int LL; map<LL, int> mp[3]; int a[4][N]; struct din{ int ap, id; }dn[4][N]; bool cmp(din af, din bf){ return af.ap < bf.ap; } ...

#include <bits/stdc++.h> using namespace std; const int di[] = {-1, -1, -1, 0, 1, 1, 1, 0, 0}, dj[] = {-1, 0, 1, 1, 1, 0, -1, -1, 0}; int st[20][20][20] = {}; bool fr[20][20][20 * 20] = {}; int n; void file_open() { freopen( input.txt , r , stdin); freopen( output.txt , w , stdout); ...

#include <bits/stdc++.h> using namespace std; long long arr1[100][10000], arr[10000]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long t, i, j, k, n, m, x, y, z, a, b, mx; cin >> t; while (t--) { cin >> n; for (i = 0; i < n; i++) { cin >> arr[i]; ...

#include <bits/stdc++.h> using namespace std; int n, a[1001][10], cnt, ans[1001]; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d%d%d%d%d , &a[i][0], &a[i][1], &a[i][2], &a[i][3], &a[i][4]); } if (n > 11) { printf( 0 ); return 0; } for (int i = 1; i...

#include <bits/stdc++.h> long long int mod = 1000000000 + 7; long long int inf = 1000000000000000000; using namespace std; int main() { iostream::sync_with_stdio(false); cin.tie(0); int t; cin >> t; while (t--) { int ans = 1, a; cin >> a; for (int i = 0; i < 31; i++) { ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 5002, NP = 1e9; int Add[MAXN], MyResult[MAXN], MyCheck[MAXN]; bool check(int n, vector<pair<int, pair<int, pair<int, int> > > > A) { for (int i = 0; i < A.size(); i++) { int t = A[i].first, s = A[i].second.first, e = A[i].second.second.fir...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t; cin >> t; for (; t; t--) { int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; i++) cin >> a[i]; vector<int> gist(3); for (int i = 0; i < n; i++) ...

#include <bits/stdc++.h> using namespace std; const double PI = 2 * acos(0.0); mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count()); const string DIGITS = 0123456789 ; const string ALPH = abcdefghijklmnopqrstuvwxyz ;...

#include <bits/stdc++.h> using namespace std; const int inf = 1000000000; long long mod = 1000000007LL; long long mod2 = 998244353LL; int n; bool mat[2005][2005]; int cntr[2005], cntc[2005]; int cnt[2005]; int main() { cin >> n; memset(mat, false, sizeof(mat)); memset(cntr, 0, sizeof(cntr)...

#include <bits/stdc++.h> using namespace std; template <typename _T> inline void _DBG(const char *s, _T x) { cerr << s << = << x << n ; } template <typename _T, typename... args> void _DBG(const char *s, _T x, args... a) { while (*s != , ) cerr << *s++; cerr << = << x << , ; _DBG...

#include <bits/stdc++.h> int N, Q; int a[300005]; int p[300005]; int oop[1100005]; int ui, uv; void update(int n, int nl, int nr) { if (nl == ui && ui + 1 == nr) { oop[n] = uv; } else { int mid = (nl + nr) / 2; if (ui < mid) update(n * 2 + 1, nl, mid); else up...

#include <bits/stdc++.h> using namespace std; using ll = long long; using ii = pair<int, int>; constexpr int MAXN = 5 + 50; constexpr ll INF = 1000000000000000002LL; namespace dsu { int f[MAXN], sz[MAXN]; void build(int n) { fill(sz, sz + n, 1); for (int i = (int)0; i < (int)n; ++i) f[i] = i; ...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:1024000000,1024000000 ) using namespace std; vector<int> a[100005]; int dp[100005], n, t; int main() { for (int i = 2; i <= 100000; i++) for (int j = 1; j * i <= 100000; j++) a[i * j].push_back(i); while (cin >> n) { memset(dp, 0, si...

#include <bits/stdc++.h> using namespace std; int main() { int n1, n2, k1, k2; cin >> n1 >> n2 >> k1 >> k2; if (n1 <= n2) cout << Second ; else cout << First ; }

#include <bits/stdc++.h> using namespace std; int n, sum, cnt[10]; bool check; void ghi() { bool check = false; for (int i = 9; i > -1; i--) { if (cnt[i] == 0) continue; if (i != 0) check = true; if (!i && !check) cnt[i] = 1; for (int j = 1; j <= cnt[i]; j++) printf( %d , i); ...

#include <bits/stdc++.h> using namespace std; int nA, nB, m, k, ans, x, y, c1, c2, cnt; int deg[1310 << 1], be[190010], w[1310], w2[1310]; int id[10005][1310], f[10005][1310]; void rv(int x, int c1, int c2) { swap(f[x][c1], f[x][c2]); swap(id[x][c1], id[x][c2]); be[id[x][c2]] = c2; if (f[x][c2...

#include <bits/stdc++.h> using namespace std; const int MAXN = 100100; int N, M; int app[MAXN]; char type[MAXN]; int P[MAXN]; bool check(int leader) { set<int> users; users.insert(leader); for (int i = 0; i < M; i++) { if (type[i] == + ) users.insert(P[i]); else us...

#include <bits/stdc++.h> using namespace std; typedef long long ll; const int N = 1e6 + 9; int main () { int t; cin >> t; while (t--) { ll n, last; cin >> n; for (ll i = 0; i < 33; i++) { if (n & (1ll << i)) last = i; ...

#include <bits/stdc++.h> using namespace std; int main() { int total, n; cin >> total >> n; vector<int> v(n); for (int i = 0; i < n; i++) cin >> v[i]; int ans = 0; for (int i = 0; i < n - 1; i++) { ans += (total - v[i]); } cout << ans; }

#include <bits/stdc++.h> using namespace std; int main() { vector<int> v; int total, num, i, koita = 0; scanf( %d , &total); for (i = 0; i < total; i++) { scanf( %d , &num); v.push_back(num); } int maximum = v[0]; int minimum = v[0]; for (i = 1; i < total; i++) { nu...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n], b[n], c = 0, x = 0, y = 0, z = 0, s = 0; for (int i = 0; i < n; i++) { cin >> a[i]; if (a[i] == 1) { x++; } } for (int i = 0; i < n; i++) { cin >> b[i]; if (a[i] != b[i...

#include <bits/stdc++.h> using namespace std; inline long long read() { char ch = getchar(); long long nega = 1; while (!isdigit(ch)) { if (ch == - ) nega = -1; ch = getchar(); } long long ans = 0; while (isdigit(ch)) { ans = ans * 10 + ch - 48; ch = getchar(); }...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 9; long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } long long s[maxn]; int f[maxn], F[maxn], p[maxn]; int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %lld , &s[i]); ...

#include <bits/stdc++.h> using namespace std; int i, j, k, n, m; int fa[200010], an[200010]; vector<int> a[200010]; pair<int, int> f[200010]; inline void P(int &x, int y) { x = 1ll * x * y % 1000000007; } inline void merge(pair<int, int> &a, pair<int, int> b) { P(a.first, b.first); int g = (2ll * ...

#include <bits/stdc++.h> using namespace std; int n; int ans[200005]; void query(int nl, int nr) { if (nl > nr) return; printf( ? %d %d n , nl, nr); fflush(stdout); int x, f; scanf( %d%d , &x, &f); if (nr - f + 1 <= nl + f - 1) { for (int i = nr - f + 1; i <= nl + f - 1; i++) ans[i...

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

#include <bits/stdc++.h> using namespace std; template <class T> ostream& operator<<(ostream& cout, vector<T> V) { cout << [ ; for (auto v : V) cout << v << ; return cout << ] ; } template <class L, class R> ostream& operator<<(ostream& cout, pair<L, R> P) { return cout << ( << P.fir...

#include <bits/stdc++.h> long long n, md; void rid(int n, int m) { int i; long long sol = 1, p = 1; for (i = 0, p = n; i <= 30; i++) { if ((m & (1 << i)) == (1 << i)) { sol = (long long)sol * p; sol = (long long)sol % md; } p = (long long)p * p; p = (long long)p %...

#include <bits/stdc++.h> using namespace std; int main() { int a[11], mx, n; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); printf( %d , *max_element(a + 1, a + n + 1) ^ a[n]); return 0; }

#include <bits/stdc++.h> using namespace std; const int maxn = 510; char g[maxn][maxn]; int col[maxn][maxn], v[maxn * maxn], b[maxn * maxn], cnt, n, k, sum; int dx[] = {0, 0, 1, -1}; int dy[] = {1, -1, 0, 0}; void dfs(int x, int y, int c) { col[x][y] = c; ++cnt; for (int i = 0; i < 4; ++i) { ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 1000100; int N; long long K; long long arr[MAXN], anew[MAXN], tcur[MAXN], tnew[MAXN]; int main() { scanf( %d %I64d , &N, &K); arr[0] = 0; for (int i = 1; i < N; i++) { int p; long long w; scanf( %d %I64d , &p, &w); ...

#include <bits/stdc++.h> using namespace std; vector<int> by; vector<int> sl; int main() { long long int a, b, c, d, m, n, ck = 0, ans, s, r; cin >> n >> m >> r; for (int i = 0; i < n; i++) { cin >> s; by.push_back(s); } sort(by.begin(), by.end()); for (int j = 0; j < m; j++)...

#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10; long long int M = 1e9 + 7; long long int MOD = 998244353; const double PI = 3.141592653589793238460; long long int power(long long int a, long long int b) { long long int res = 1; if (a == 0) return 0; if (a == 1) return 1; ...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n]; int arr[n][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) cin >> arr[i][j]; } a[0] = 0; for (int j = 1; j < n; j++) { a[0] = a[0] | arr[0][j]; a[j] = arr[0][j]; ...

#include <bits/stdc++.h> using namespace std; long long power(long long a, long long p, long long mod) { long long ret = 1; while (p) { if (p & 1) ret = (ret * a) % mod; a = (a * a) % mod; p /= 2; } return ret; } long long DP[1000]; int A[1000]; int main() { int n; ...

#include <bits/stdc++.h> using namespace std; const int N = 1511, M = 3010100, inf = 0x7fffffff; const long long llinf = 0x7fffffff7fffffffll; long long x[N], y[N], r[N]; long long c[N]; double dist(int i, int j) { return sqrtl((x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j])); } double...

#include <bits/stdc++.h> // #include <atcoder/all> //tabaicho see https://boostjp.github.io/tips/multiprec-int.html // #include <boost/multiprecision/cpp_int.hpp> // using namespace boost::multiprecision; // cpp_int // int128_t // int256_t // int512_t // int1024_t // uint128_t // ...

#include <bits/stdc++.h> using namespace std; vector<string> prices; enum State { name, price }; double to_num(string s) { double n = 0; int dots = 0, dot = 0; bool frac = false; for (char c : s) if (c == . ) ++dots; if (s[s.size() - 3] == . ) frac = true; for (int i = 0; i < s.s...

#include <bits/stdc++.h> const int fin = 0, maxn = 400000, maxm = maxn << 1; int n, m, cent, tot; int fs[maxn], e[maxm], next[maxm]; int bel[maxn], pos[maxn], len[maxn], left[maxn]; int c[maxn], deg[maxn], b[maxn]; bool v[maxn]; struct rec { int x, y; } g[maxn]; int sum(int *a, int n, int x) { ...

#include <bits/stdc++.h> using namespace std; struct dot { int value, i, j; }; bool operator<(dot a, dot b) { return a.value < b.value; } int main() { int t; scanf( %d , &t); while (t--) { int n, m; scanf( %d %d , &n, &m); int num[n][m]; priority_queue<dot> pq; fo...

#include <bits/stdc++.h> using namespace std; int n, m, sum, ans; int cnt[1000010], pre[1000010]; char a[1000010], b[1000010]; int main() { scanf( %s%s , a + 1, b + 1); n = strlen(a + 1); m = strlen(b + 1); for (int i = 1; i < n; i++) if (a[i] != a[i + 1]) cnt[i] = 1; for (int i = 1;...

#include <bits/stdc++.h> using namespace std; int main() { int n, i, j, sum, count; cin >> n; int a[n][n]; int row[n], col[n]; for (i = 0; i < n; i++) { sum = 0; for (j = 0; j < n; j++) { cin >> a[i][j]; sum += a[i][j]; } row[i] = sum; } for (j = 0...

#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const int mo = 1000000007; inline void gn(long long &x) { int sg = 1; char c; while (((c = getchar()) < 0 || c > 9 ) && c != - ) ; c == - ? (sg = -1, x = 0) : (x = c - 0 ); while ((c = getchar()) >= 0 &&...

#include <bits/stdc++.h> using namespace std; int n, m, q; pair<int, int> a[400004]; long long ans[200004], d[400004], sum; int fa[400004], l[400004], r[400004], s[400004]; vector<pair<int, int> > v, ask; int F(int x) { return fa[x] == x ? x : fa[x] = F(fa[x]); } long long got(int v) { return d[r[v]] - ...

#include <bits/stdc++.h> using namespace std; int main() { unsigned int n, c, i, ans = 1, arr[100001]; cin >> n >> c; for (i = 0; i < n; i++) { cin >> arr[i]; } for (i = 1; i < n; i++) { if (arr[i] - arr[i - 1] <= c) ans++; else ans = 1; } cout << ans; ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 111 * 1000; int par[MAXN], sz[MAXN]; int find(int i) { if (par[i] == i) return i; return par[i] = find(par[i]); } void un(int a, int b) { sz[find(a)] += sz[find(b)]; par[find(b)] = find(a); } int n; int mark[MAXN]; int su...

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