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

func_code_string stringlengths 59 71.4k
#include <bits/stdc++.h> using namespace std; const int maxn = 1000010; int ro[maxn]; int up(int u) { return (ro[u] == u) ? u : ro[u] = up(ro[u]); } int me[maxn]; vector<int> no[maxn]; vector<pair<int, int> > q; int o[maxn]; queue<int> s[2]; int main() { int n, m, t, k; scanf( %d%d , &n, &m)...
#include <bits/stdc++.h> using namespace std; long long n, x, y, m, ans, f[5000], q[5000]; pair<int, int> t[200000]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n; cout << n << ; for (int i = 1; i < n; i++) { cout << i << ; } }
#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0, f = 1; char ch; while (ch < 0 \|\| ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return f * x; } inlin...
#include <bits/stdc++.h> using namespace std; int X1[500010], Y1[500010], X2[500010], Y2[500010]; int main() { int n, i; scanf( %d , &n); for (i = 1; i <= n; i++) scanf( %d %d %d %d , &X1[i], &Y1[i], &X2[i], &Y2[i]); printf( YES n ); for (i = 1; i <= n; i++) { if (X1[i] % 2 == 0) { ...
#include <bits/stdc++.h> using namespace std; int fastMax(int x, int y) { return (((y - x) >> (32 - 1)) & (x ^ y)) ^ y; } int fastMin(int x, int y) { return (((y - x) >> (32 - 1)) & (x ^ y)) ^ x; } const long long int MAXN = 1e5 + 3; long long int dp[20][2][10][10]; vector<long long int> digits; void conv...
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int N = (int)2 * 1e5 + 10; void solve() { long long n, m; cin >> n >> m; vector<long long> arr(n); for (long long i = 0; i < n; i += 1) { cin >> arr[i]; } sort((arr).begin(), (arr).end()); long long su...
#include<bits/stdc++.h> using namespace std; const int P=1e9+7,N=209,iv=P+1>>1; int f[N][N],ans[N][N],d[N],sz[N],fa[N]; basic_string<int>g[N]; void dfs(int x,int y){ sz[x]=1,fa[x]=y; for(int i:g[x])if(i!=y)d[i]=d[x]+1,dfs(i,x),sz[x]+=sz[i]; } int qp(int a,int b){ int r=1; for(;b;b>>=1,a=a1ll...
#include <bits/stdc++.h> using namespace std; const int MAX = 1e6 + 9, N = 1e3 + 9; const int qwer[] = {-1, 0, 1, 0}, asdf[] = {0, 1, 0, -1}; int n, m, a[N][N], arr[MAX], sizee[MAX], number, c[N][N], vv, cnt; long long k; struct node { int id, x, y; } b[MAX]; int root(int x) { return x == arr[x] ? x...
#include <bits/stdc++.h> using namespace std; inline long long Readint() { long long ret = 0; int f = 1; char ch; do { ch = getchar(); if (ch == - ) f = -1; } while (ch >= 0 && (ch < 0 \|\| ch > 9 )); while ( 0 <= ch && ch <= 9 ) { ret = ret 10 + ch - 0 ; ch =...
#include <bits/stdc++.h> using namespace std; int n; long long k, a[500005]; int chack1(int x) { long long k1 = 0, c = 0; for (int i = 0; i < n; i++) { if (a[i] > x) k1 += (a[i] - x); else c += (x - a[i]); } if (k1 <= k && c >= k1) return 1; else retur...
#include <bits/stdc++.h> using namespace std; const int MAXM = 101000; pair<int, int> a[MAXM]; vector<pair<int, int> > b[MAXM << 1]; vector<int> c[MAXM << 1], d[MAXM << 1]; int main() { int n, m, i, j, k, x, y; int f, l, r, top; while (scanf( %d%d , &n, &m) != EOF) { for (i = 0; i < m; i++...
#include <bits/stdc++.h> using namespace std; const int MOD = 1000000000 + 7; int n, bas, lim; int go[210][22]; int trie[210][22], tn; int upper[210], lower[210], val[210], str[210]; int fail[210]; int bound[210]; int f[2][210][210][510]; queue<int> q; inline int min(int a, int b) { return a < b ?...
#include <bits/stdc++.h> using namespace std; template <typename T> inline ostream &operator<<(ostream &_out, const vector<T> &_v) { if (_v.empty()) return _out; _out << _v.front(); for (auto _it = ++_v.begin(); _it != _v.end(); ++_it) _out << << *_it; return _out; } template <typename T> ...
#include <bits/stdc++.h> using namespace std; int n, k; char s[1000111]; pair<int, int> q[33]; int a[33]; int main() { scanf( %d%d n , &n, &k); gets(s); int l = strlen(s); for (int i = 0; i < k; i++) q[i].second = i; long long sum = 1; for (int i = 0; i < l; i++) { int u = s[i]...
#include <bits/stdc++.h> const int N = 500005, M = 105, INF = 0x3f3f3f3f; int n, K, p, sum[N], f[M][N], t[105], g[N]; void solveC2() { for (int i = 1; i <= n; i++) f[0][i] = INF; for (int i = 1; i <= K; i++) { for (int j = 0; j < p; j++) t[j] = INF; if (i == 1) t[0] = 0; for (int j = 1; ...
#include <bits/stdc++.h> const int oo = 0x7fffffff; const long long OO = 0x7fffffffffffffff; template <class T> std::ostream& operator<<(std::ostream& O, const std::vector<T>& V) { for (const T& x : V) O << x << ; O << n ; return O; } template <class T1, class T2> std::ostream& operator<<...
#include <bits/stdc++.h> using namespace std; char s1[100002], s2[100002]; int diff[100002] = {0}; int main() { scanf( %s , s1); scanf( %s , s2); int i, len = strlen(s1), count = 0, temp; for (i = 0; i < len; i++) { if (s1[i] != s2[i]) { diff[i] = 1; count++; } } ...
#include <bits/stdc++.h> using namespace std; const int maxn = 151; const int inf = 0x7f7f7f7f; const int mod = (int)(1e9 + 7); const long long INF = 0x7f7f7f7f7f7f7f7fLL; const double eps = 1e-8; const double pi = acos(-1.0); const int mask = 65535; int a[maxn]; int b[maxn]; void handle(int a[], ...
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const int N = 4e2 + 5; int n, f[N][N]; int main() { scanf( %d , &n); f[1][0] = f[1][1] = 1; for (int top = 1; top < n; ++top) { for (int i = 0; i <= n; ++i) { for (int j = 0; j <= n - i + 1; ++j) { int t...
#include <bits/stdc++.h> using namespace std; const int maxn = 200005; int n, m; char s[maxn]; long long ans[maxn]; int sz[maxn]; int cnt[1 << 20]; vector<int> g[maxn]; bool die[maxn]; int getsz(int x, int f) { sz[x] = 1; for (int y : g[x]) if (y != f && !die[y]) sz[x] += getsz(y, x); ...
#include <bits/stdc++.h> using namespace std; int main() { int T; scanf( %d , &T); while (T--) { int n, a, o; vector<pair<pair<int, int>, int> > M; scanf( %d , &n); M.push_back(make_pair(make_pair(0, 0), 0)); for (int i = 1; i <= n * 2 - 1; i++) { scanf( %d%d , &a, ...
#include <bits/stdc++.h> using namespace std; const double eps = 1e-9; const int N = (int)2e6 + 5; int n, q, a[N], l[N], r[N]; int main() { for (scanf( %d , &q); q--;) { scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %d , a + i); for (int i = 1; i <= n; ++i) l[i] = n + 1, r[i] = -1...
#include <bits/stdc++.h> using namespace std; inline int rit() { int f = 0, key = 1; char ch; do { ch = getchar(); if (ch == - ) key = -1; } while (ch < 0 \|\| ch > 9 ); do { f = f * 10 + ch - 0 ; ch = getchar(); } while (ch >= 0 && ch <= 9 ); return f * key...
#include <bits/stdc++.h> using namespace std; long long modPower(long long num, long long r) { if (r == 0) return 1; if (r == 1) return num % 1000000007; long long ans = modPower(num, r / 2) % 1000000007; if (r % 2 == 0) { return (ans * ans) % 1000000007; } return (((ans * ans) % 10000...
#include <bits/stdc++.h> using namespace std; int main() { int n; string s; cin >> n; cin >> s; int count = 0; for (int i = 0; i < n; i++) { if (s[i] == 8 ) { count++; } } int a = n / 11; if (count >= a) { cout << a; } else { cout << count; ...
#include <bits/stdc++.h> int n, m, sol; int D[100005]; int main() { scanf( %d %d , &n, &m); int p = 1; for (int i = 1; i <= m; ++i) { p = p + p; if (p >= 1000000009) p -= 1000000009; } D[1] = p - 1; for (int i = 2; i <= n; ++i) { int now = p - i; if (now < 0) now +=...
#include <bits/stdc++.h> using namespace std; const long long p = 1e9 + 7; const long double pi = 3.1415926535898; int main() { int s, n; cin >> s >> n; vector<pair<int, int> > a(n); for (int i = 0; i < n; i++) cin >> a[i].first >> a[i].second; sort(a.begin(), a.end()); for (int i = 0; i...
#include <bits/stdc++.h> using namespace std; template <class T> T abs(T x) { return x > 0 ? x : (-x); } template <class T> T sqr(T x) { return x * x; } int a[100000][2]; void save() { printf( -1 n ); exit(0); } const int n = 65536; int tree[57000 * 4 + 10]; int delta[57000 * 4...
#include <bits/stdc++.h> using namespace std; using ull = unsigned long long; using ll = long long; const int mod = 1e9 + 7; const int inf = 2e9 + 5; const int N = 501; int n, m, a[N][N], b[N]; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); cin >> n >> m; ...
#include <bits/stdc++.h> struct node { node() { zuo = you = he = 0; } int zuo, you, he; } a[1000002]; char s[1000002]; int sum(int l, int r) { int ans = 0, you = 0; while (r >= l) { while (r && r - l + 1 >= (r & -r)) { ans += a[r].he; if (a[r].zuo >= you) { ans +=...
#include <bits/stdc++.h> using namespace std; struct node { long long s, mn, mx; }; node T[303030]; node operator+(node l, node r) { node x; x.s = l.s + r.s; x.mn = min(l.mn, l.s + r.mn); x.mx = max(l.mx, l.s + r.mx); return x; } int A[100009]; void init(int idx, int s, int e) { ...
#include <bits/stdc++.h> using namespace std; int main() { int w, h, k, sum = 0; cin >> w >> h >> k; while (k != 0) { sum = sum + ((2 * w) + (2 * h) - 4); w = w - 4; h = h - 4; k = k - 1; } cout << sum; }
#include <bits/stdc++.h> using namespace std; template <typename T> T gcd(T a, T b) { if (a == 0) return b; return gcd(b % a, a); } template <typename T> T pow(T a, T b, long long m) { T ans = 1; while (b > 0) { if (b % 2 == 1) ans = (ans * a) % m; b /= 2; a = (a * a) % m; ...
#include <bits/stdc++.h> using namespace std; int nn, mm; struct Dinic { struct edge { int to, flow, cap; }; const static int N = 20007; vector<edge> e; vector<int> g[N + 7]; int dp[N + 7]; int ptr[N + 7]; void clear() { for (int i = 0; i < N + 7; i++) g[i].clear(); ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; int n; long long m; cin >> n >> m; long long arr[n], sum = 0; for (int i = 0; i < n; i++) { cin >> arr[i]; sum += arr[i]; } sort(arr, ...
#include <bits/stdc++.h> using namespace std; int cnt[100500]; int bestAns, start, len; int longest[100500]; inline void updAns(int L, int R) { int val = cnt[R + 1] - cnt[L]; if (val > bestAns) { bestAns = val; start = L; len = R - L + 1; } } int main() { stack<pair<char,...
#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; long long a[n + 1]; memset(a, 0, sizeof(a)); for (long long i = 1; i <= n; i++) cin >> a[i]; sort(a, a + n + 1); long long sum[n + 1]; memset(sum, 0, sizeof(sum)); sum[1] = a[1]; for (int i = 2;...
#include <bits/stdc++.h> using namespace std; template <class T1, class T2> ostream& operator<<(ostream& out, const pair<T1, T2> p) { out << ( << p.first << , << p.second << ) ; return out; } template <class T1, class T2> istream& operator>>(istream& in, pair<T1, T2>& p) { in >> p.first >> ...
#include <bits/stdc++.h> int a[100][100]; int d[2][100]; long long c[2][100]; int main() { int n, m, i, j, k; double max = 1; scanf( %d %d , &n, &m); for (i = 0; i < m; i++) { int x, y; scanf( %d %d , &x, &y); x--; y--; a[x][y] = a[y][x] = 1; } for (i = 0; i...
#include <bits/stdc++.h> using namespace std; unsigned long long int MOD = 1000000007; unsigned long long int B = 13331; bool cmp(const int &a, const int &b) { return a < b; } int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); } int lcm(int a, int b) { return a * (b / gcd(a, b)); } double func(dou...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 15; const int mod = 1e9 + 7; const int inf = 1e9 + 3; int t, n; string a[3], s; int flag; int conv(string q) { int ans = 0; for (int i = 0; i < q.size(); i++) { ans *= 10; ans += q[i] - 0 ; } return ans; ...
#include <bits/stdc++.h> using namespace std; template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) { os << { ; string sep; for (const auto &x : v) os << sep << x, sep = , ; return os << } ; } template <typename T, size_t size> ostream &operator<<(ostream &os, const ...
#include <bits/stdc++.h> int main() { int n, b; scanf( %d%d , &n, &b); int a[100], s = b; for (int i = 0; i < n; i++) { scanf( %d , &a[i]); s += a[i]; } for (int i = 0; i < n; i++) if (s < a[i] * n) { puts( -1 ); return 0; } for (int i = 0; i < n; i+...
#include <bits/stdc++.h> using namespace std; const int mo = 1e9 + 7; const int N = 1000010; const int inf = 0x3f3f3f3f; using namespace std; int n, m, q, tot, ans[N], fa[N], mark[N], pa[N], tmp; struct node { int a, b, c; bool operator<(const node &x) const { return c < x.c; } } e[N], ed[N]; ...
#include <iostream> #include <algorithm> using namespace std; int main() { int64_t k; int64_t n, x, t; cin >> k; while(k--) { cin >> n >> x >> t; int64_t zero = 0; int64_t ans = max(zero, n - t/x) * (t / x) + min(t/x, n) * min(t/x - 1, n - 1) / 2; ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1010; int q1[MAXN], q2[MAXN], r1, r2; int n, c, m; int a[MAXN]; bool check() { for (int i = 1; i <= n; i++) if (!a[i] \|\| (a[i] < a[i - 1])) return false; return true; } int main() { cin >> n >> m >> c; while (!check()) ...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:100000000 ) using namespace std; const long double pi = acos(-1.0); const long long inf = (long long)1e18; const int N = (int)1e6; int n, m; long long need[N], start[N]; bool check(long long x) { int lowest = 0; for (int i = 0; (i < n) && ...
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3fll; int main() { int n, k; scanf( %d , &n), scanf( %d , &k); if (k % 2 == 0) { int ans = 0; while (n--) { int x; scanf( %d , &x); if (x == 1) ans ^= ...
#include <bits/stdc++.h> using namespace std; int n, k, i, a[100010]; set<int> r; int main() { scanf( %d%d , &n, &k); for (i = 0; i < n; i++) scanf( %d , &a[i]); sort(a, a + n); for (i = 0; i < n; i++) { if (a[i] % k == 0 && r.count(a[i] / k)) continue; r.insert(a[i]); } prin...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:16777216 ) using namespace std; int n, k; int d[2][10000]; void solution() { scanf( %d %d , &n, &k); for (int i = 0, _n = (n - 1); i < _n; ++i) d[0][i] = 1; int cur = 0, nxt = 1; for (int it = 0, _n = (k); it < _n; ++it) { for (int...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int sum = 0; bool ok = false; for (int i = 1; i <= n; i++) { sum = i + sum; if (n == 1 \|\| n == sum) { cout << YES << endl; break; } if (sum > n) { ok = true; brea...
#include <bits/stdc++.h> #pragma GCC optimize( O2 ) using namespace std; inline long long int input() { long long int n; cin >> n; return n; } long long int pw(long long int a, long long int b) { return (!b ? 1 : (b & 1 ? a * pw(a * a, b / 2) : pw(a * a, b / 2))); } const long long int MAX...
#include <bits/stdc++.h> using namespace std; const int N = 1e6; int n; int m; int t[4 * N]; void upd(int l, int r, int v = 1, int tl = 1, int tr = N) { if (l > r) return; if (l <= tl && tr <= r) { t[v]++; return; } int tm = (tl + tr) / 2; upd(l, min(tm, r), v * 2, tl, tm); ...
#include <bits/stdc++.h> using namespace std; char s[2000010], t[2000010]; int main(void) { int n; scanf( %d , &n); scanf( %s , s); scanf( %s , t); int count_s, count_t, count_com; count_s = count_t = count_com = 0; for (int i = 0; i < 2 * n; ++i) { if (s[i] == 1 && t[i] == 1 ...
#include <bits/stdc++.h> using namespace std; template <class T> void cmax(T& a, T b) { a = max(a, b); } template <class T> void cmin(T& a, T b) { a = min(a, b); } void _BG(const char* s) {} template <class T, class... TT> void _BG(const char* s, T a, TT... b) { for (int c = 0; *s && (c ...
#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; int _t[6]; int main() { for (int i = 0; i < 6; ++i) { scanf( %d , &_t[i]); } long long a, b, x1, y1, x2, y2; a = 2 * _t[0]; b = 2 * _t[1]; x1 = _t[2] - _t[3]; y1 = _t[2] + _t[3]; x2 = _t[4] - _t[5]; ...
#include <bits/stdc++.h> using namespace std; long long r[1003], c[1003], g[1003][1003]; int main() { long long w, h; scanf( %lld %lld , &h, &w); for (int i = 0; i < h; i++) scanf( %lld , &r[i]); for (int i = 0; i < w; i++) scanf( %lld , &c[i]); memset(g, -1, sizeof g); for (int i = 0; i <...
#include <bits/stdc++.h> using namespace std; #define ll long long #define fi first #define se second const int MAX = 2 * 1e5 + 10; const int MOD = 1e9 + 7; ll t; ll n, m, k; ll a, b, x, y, x2, y2; ll bio[MAX]; ll arr[MAX]; vector <ll> v; string s; int main() { cin >> t; ...
#include <bits/stdc++.h> using namespace std; const long long inf = 0x3f3f3f3f; const long long INF = 0x3f3f3f3f3f3f3f3fLL; const long long mod = 1e9 + 7; long long powmod(long long a, long long b) { long long res = 1; a %= mod; assert(b >= 0); for (; b; b >>= 1) { if (b & 1) res = res *...
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1.0); int n, c[1011], vao[1011], save[1011]; vector<int> ke[1011]; bool mark[1011]; int get(int start) { for (int i = (1), _b = (n); i <= _b; i++) vao[i] = save[i]; int done = 0, res = 0; memset(mark, false, sizeof mark); ...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(NULL); int n, k, p, x, y; cin >> n >> k >> p >> x >> y; vector<int> a(n); int sum = 0; for (int i = 0; i < k; i++) { cin >> a[i]; sum += a[i]; } if (sum + n - k > x) { ...
#include <bits/stdc++.h> using namespace std; long long mod = (1000000007LL); inline long long mult(long long a, long long b) { return (a * b) % mod; } inline long long poww(long long a, long long b) { long long res = 1; while (b > 0) { if (b & 1) res = (res * a) % mod; a = (a * a) % mod; ...
#include <bits/stdc++.h> using namespace std; struct node { int val; int type; } N[500000]; int main() { long long n, a, b, c, d, start, len; cin >> n >> a >> b >> c >> d >> start >> len; for (int i = 1; i <= n; i++) { cin >> N[i].val >> N[i].type; } long long s = 1, t = 1, sum...
#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007; const long long INF = 4e18 + 10; long long n; long long a[55]; vector<vector<long long> > ans; long long findpos(long long x) { for (long long i = 0; i < n; i++) if (a[i] == x) return i; } void p1(long long x) { ...
#include <bits/stdc++.h> using namespace std; int n, m; char s[4][12]; char t[12][25][12]; int num[12]; int main() { int i, j; int ans = 0, p = 0; scanf( %d , &n); for (i = 0; i < n; i++) scanf( %s , s[i]); scanf( %d , &m); for (i = 0; i < m; i++) { scanf( %d , &num[i]); ...
#include <bits/stdc++.h> int n, arr[1005][3], sum, cnt; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d %d %d , &arr[i][0], &arr[i][1], &arr[i][2]); for (int i = 0; i < n; i++) { for (int j = 0; j < 3; j++) sum += arr[i][j]; if (sum >= 2) cnt++; sum = 0; }...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> a(n), pmx(n, -1), smx(n, -1); cin >> a[0]; pmx[0] = 0; int c = 1; for (int j = 1; j < n; j++) { cin >> a[j]; pmx[j] = pmx[j - 1]; smx[j] = (j == 1) + (j != 1) * smx[j - 1]; if ...
#include <bits/stdc++.h> using namespace std; const int maxn = 3e3 + 5; int n, m; vector<int> g[maxn]; long long dis[maxn][maxn]; vector<pair<long long, long long> > from[maxn], to[maxn]; void bfs(int x) { queue<int> q; q.push(x); dis[x][x] = 0; while (!q.empty()) { int now = q.front...
#include <bits/stdc++.h> using namespace std; int main() { long long t; cin >> t; while (t--) { string p, h; int w = 0; cin >> p >> h; sort(p.begin(), p.end()); if (h.size() >= p.size()) { for (int i = 0; i < (h.size() - p.size() + 1); i++) { string sub = ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int k; cin >> k; int n, m; n = 2; m = 3; int z = (1 << 17); cout << n << << m << n ; cout << z + k << << z << << k << n ; cout << k << << z + k ...
#include <bits/stdc++.h> using namespace std; set<int> s; int ans[1000000]; int main() { int n, m; scanf( %d %d , &n, &m); int i, j, l, r, w; for (i = 1; i <= n; i++) s.insert(i); for (i = 0; i < m; i++) { scanf( %d %d %d , &l, &r, &w); auto idx1 = s.lower_bound(l); auto id...
#include <bits/stdc++.h> using namespace std; int a[25][25], n, m, dp[1 << 22]; char s[25][222]; int main() { scanf( %d%d , &n, &m); for (int i = 0; i < n; ++i) scanf( %s , s[i]); for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) scanf( %d , &a[i][j]); memset(dp, 63, sizeof(dp)), dp[...
#include <bits/stdc++.h> using namespace std; long long ans[200005]; vector<vector<pair<long long, long long> > > G(200005); int main() { long long i, j, n, m, a, b, c; priority_queue<pair<long long, long long> > pq; scanf( %lld %lld , &n, &m); for (i = 0; i < m; i++) { scanf( %lld %lld %l...
#include <bits/stdc++.h> using namespace std; void k_007() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } bool sortbysec(const pair<long long, long long> &a, const pair<long long, long long> &b) { return (a.second < b.second); } long long gcd(long long a, long lo...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; for (int i{0}; i < n; i++) { int found{0}; int num{}; cin >> num; int res{}; for (int j{0}; j < num; j++) { int numI; cin >> numI; if (numI % 2 == 0) { found = 1; ...
#include <bits/stdc++.h> using namespace std; long long n, k, l, r, st; map<pair<long long, long long>, long long> M[2]; long long Count(long long len, long long t, bool w) { if (M[w].count({len, t})) return (M[w][{len, t}]); if (t > len) return (M[w][{len, t}] = 0); if (len == t) return (M[w][{len,...
#include <bits/stdc++.h> using namespace std; struct algo { int n; map<pair<int, int>, int> v1; vector<vector<int> > drogi; vector<pair<int, int> > tab; vector<pair<int, int> > wy; algo() { cin >> n; string s; int li = 0; tab.push_back({}); for (long long a, b, ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); int n, ans = 0, i, temp; vector<int> a; cin >> n; for (i = 0; i < n; i++) { cin >> temp; a.push_back(temp); } sort(a.begin(), a.end()); for (i = 0; i < n; i = i + 2) { if (a...
#include <bits/stdc++.h> int main(void) { int i, w; char s[3][10]; char res[4] = { F , M , S , ? }; while (scanf( %s %s %s , s[0], s[1], s[2]) != EOF) { w = 3; for (i = 0; i < 3; i++) { if (s[i][0] == r && s[(i + 1) % 3][0] == s && s[(i + 2) % 3][0] == s ) ...
#include <bits/stdc++.h> int A[2][155] = {{1}, {0, 1}}; int main() { int n; std::cin >> n; for (int i = 2; i <= n; ++i) for (int j = i - 1; ~j; --j) A[i & 1][j + 1] = (A[i & 1][j + 1] + A[~i & 1][j]) & 1; printf( %d n , n); for (int i = 0; i <= n; ++i) printf(i == n ? %d n : %d ...
#include <bits/stdc++.h> using namespace std; bool isluck() { unsigned long long n, s1 = 0, s2 = 0; string s; cin >> n >> s; for (int register i = 0; i < n / 2; i++) { int x = (s[i] - 0 ) % 10; if (x != 4 && x != 7) return false; s1 += x; } for (int register i = n / 2; i <...
#include <bits/stdc++.h> using namespace std; int a, b; int sum; int main() { cin >> a >> b; while (a >= b) { sum += a / b * b; a = a / b + a % b; } cout << sum + a; return 0; }
#include <bits/stdc++.h> using namespace std; int n, j; std::vector<char> v; int main() { std::ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; cin >> n; int i = 0; while (i < n) { j = 0; while (j < 2 && i < n) { cout << a ; j++; ...
#include <bits/stdc++.h> using namespace std; const int N = 3000; char a[N][N]; int n, m, k, vis[N][N]; long long ans = 0; int main() { while (~scanf( %d%d%d , &n, &m, &k)) { ans = 0; for (register int i = 0; i <= n - 1; ++i) scanf( %s , a[i]); for (register int i = 0; i <= n - 1; ++i)...
#include <bits/stdc++.h> using namespace std; inline int getint() { int res = 0, fh = 1; char ch = getchar(); while ((ch < 0 \|\| ch > 9 ) && ch != - ) ch = getchar(); if (ch == - ) fh = -1, ch = getchar(); while (ch <= 9 && ch >= 0 ) res = res * 10 + ch - 0 , ch = getchar(); return r...
#include <bits/stdc++.h> using namespace std; int mark[1000009]; int main() { long long n, m = 0, i, j, t; long long sum; cin >> n; long long a[n]; for (i = 0; i < n; i++) { scanf( %lld , &a[i]); } t = a[n - 1]; sum = t; for (j = n - 1; j > 0; j--) { if (a[j - 1] < ...
#include <bits/stdc++.h> using namespace std; inline char nc() { static char buf[100000], l = buf, r = buf; return l == r && (r = (l = buf) + fread(buf, 1, 100000, stdin), l == r) ? EOF : *l++; } template <class T> void read(T &x) { x = 0; int f = 1, ch = nc(); ...
#include <bits/stdc++.h> using namespace std; const int maxn = 200000; const long long maxp = 1000000007; int n, m; struct data { int adj, p, p_; }; vector<data> e[maxn]; bool v[maxn]; long long f[maxn][2][2][2]; int con[maxn][2]; void dfs(int x) { v[x] = false; bool flag = false; ...
#include <bits/stdc++.h> using namespace std; inline long long read() { long long f = 1, x = 0; char s = getchar(); while (s < 0 \|\| s > 9 ) { if (s == - ) f = -1; s = getchar(); } while (s >= 0 && s <= 9 ) { x = x * 10 + (s - 0 ); s = getchar(); } return x...
#include <bits/stdc++.h> using namespace std; void setIO(string name) { ios_base::sync_with_stdio(0); cin.tie(0); freopen((name + .in ).c_str(), r , stdin); freopen((name + .out ).c_str(), w , stdout); } void fast() { ios_base::sync_with_stdio(false); cin.tie(NULL); } int main() ...
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const long long INF = 0x3f3f3f3f3f3f3f3f; const int MAXN = 1e5 + 10; const int N = 102; const long long mod = 1e9 + 7; inline int read() { int x = 0, f = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ...
#include <bits/stdc++.h> using namespace std; long long n, m, a, b, g[3005 * 3005], x, y, z, A[3005][3005], ans; deque<long long> q; vector<long long> v; vector<vector<long long> > V; vector<long long> fun(vector<long long> v, long long n, long long b) { vector<long long> ans; q.clear(); for (__...
#include <bits/stdc++.h> using namespace std; const int maxn = 100005; const int inf = 0x3f3f3f3f; int n, e[2][maxn], tot, rd[maxn]; int net[maxn], tail[maxn]; inline int read(void) { int num, sign = 1; char c; while (!isdigit(c = getchar())) if (c == - ) sign = 0; num = c - 0 ; ...
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; int main() { ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0); int q; cin >> q; for (int i = 0; i < q; i++) { ll k, n, a, b; cin >> k >> n >> a >> b; if (k - n * b <= 0) { ...
#include <bits/stdc++.h> using namespace std; int main() { int q, v; cin >> q; for (int i = 0; i < q; i++) { cin >> v; if (v == 2) cout << 2 << n ; else { if (v % 2) cout << 1 << n ; else cout << 0 ...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10, mod = 1e9 + 7; const long long inf = 1e18; unsigned int dp[maxn]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(); int n, cnt = 0; cin >> n; string s; cin >> s; if (n & 1) return cout...
#include <bits/stdc++.h> using namespace std; int main() { vector<int> v; int n, i, j, k, len, x, y, c, a[1020] = {0}; cin >> n; if (n == 1) { cout << 0 << endl; return 0; } a[1] = 1; for (i = 2; i <= 1000; i++) { c = 2; for (j = i * c; j <= 1000; j = i * c) { ...
#include <bits/stdc++.h> using namespace std; int n, t; int visited[30009]; bool ok = false; vector<int> C[30009]; void dfs(int u) { if (u == t) { ok = true; return; } visited[u] = 1; if (C[u].size()) for (int i = 0; i <= C[u].size() - 1; i++) { int v = C[u][i]; ...
#include <bits/stdc++.h> using namespace std; vector<int> G[((int)2e5 + 10)]; int dis[((int)2e5 + 10)]; int n; int ans = 0; void dfs(int f, int son, int d) { int flag = 0; dis[son] = d; for (int i = 0; i < G[son].size(); i++) { if (G[son][i] == f) continue; dfs(son, G[son][i], d + 1)...
#include <bits/stdc++.h> using namespace std; const int MAXN = 100005, MAXT = 500, INF = 0x3f3f3f3f; int mx[MAXT], add[MAXT], sz[MAXT], num[MAXT][MAXT], A[MAXN]; int N, T = 314; void upd(int p) { if (add[p]) { for (int i = 0; i < sz[p]; ++i) num[p][i] += add[p]; add[p] = 0; } } void in...

#include <bits/stdc++.h> using namespace std; const int maxn = 1000010; int ro[maxn]; int up(int u) { return (ro[u] == u) ? u : ro[u] = up(ro[u]); } int me[maxn]; vector<int> no[maxn]; vector<pair<int, int> > q; int o[maxn]; queue<int> s[2]; int main() { int n, m, t, k; scanf( %d%d , &n, &m)...

#include <bits/stdc++.h> using namespace std; long long n, x, y, m, ans, f[5000], q[5000]; pair<int, int> t[200000]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n; cout << n << ; for (int i = 1; i < n; i++) { cout << i << ; } }

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

#include <bits/stdc++.h> using namespace std; int X1[500010], Y1[500010], X2[500010], Y2[500010]; int main() { int n, i; scanf( %d , &n); for (i = 1; i <= n; i++) scanf( %d %d %d %d , &X1[i], &Y1[i], &X2[i], &Y2[i]); printf( YES n ); for (i = 1; i <= n; i++) { if (X1[i] % 2 == 0) { ...

#include <bits/stdc++.h> using namespace std; int fastMax(int x, int y) { return (((y - x) >> (32 - 1)) & (x ^ y)) ^ y; } int fastMin(int x, int y) { return (((y - x) >> (32 - 1)) & (x ^ y)) ^ x; } const long long int MAXN = 1e5 + 3; long long int dp[20][2][10][10]; vector<long long int> digits; void conv...

#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int N = (int)2 * 1e5 + 10; void solve() { long long n, m; cin >> n >> m; vector<long long> arr(n); for (long long i = 0; i < n; i += 1) { cin >> arr[i]; } sort((arr).begin(), (arr).end()); long long su...

#include<bits/stdc++.h> using namespace std; const int P=1e9+7,N=209,iv=P+1>>1; int f[N][N],ans[N][N],d[N],sz[N],fa[N]; basic_string<int>g[N]; void dfs(int x,int y){ sz[x]=1,fa[x]=y; for(int i:g[x])if(i!=y)d[i]=d[x]+1,dfs(i,x),sz[x]+=sz[i]; } int qp(int a,int b){ int r=1; for(;b;b>>=1,a=a*1ll*...

#include <bits/stdc++.h> using namespace std; const int MAX = 1e6 + 9, N = 1e3 + 9; const int qwer[] = {-1, 0, 1, 0}, asdf[] = {0, 1, 0, -1}; int n, m, a[N][N], arr[MAX], sizee[MAX], number, c[N][N], vv, cnt; long long k; struct node { int id, x, y; } b[MAX]; int root(int x) { return x == arr[x] ? x...

#include <bits/stdc++.h> using namespace std; inline long long Readint() { long long ret = 0; int f = 1; char ch; do { ch = getchar(); if (ch == - ) f *= -1; } while (ch >= 0 && (ch < 0 || ch > 9 )); while ( 0 <= ch && ch <= 9 ) { ret = ret * 10 + ch - 0 ; ch =...

#include <bits/stdc++.h> using namespace std; int n; long long k, a[500005]; int chack1(int x) { long long k1 = 0, c = 0; for (int i = 0; i < n; i++) { if (a[i] > x) k1 += (a[i] - x); else c += (x - a[i]); } if (k1 <= k && c >= k1) return 1; else retur...

#include <bits/stdc++.h> using namespace std; const int MAXM = 101000; pair<int, int> a[MAXM]; vector<pair<int, int> > b[MAXM << 1]; vector<int> c[MAXM << 1], d[MAXM << 1]; int main() { int n, m, i, j, k, x, y; int f, l, r, top; while (scanf( %d%d , &n, &m) != EOF) { for (i = 0; i < m; i++...

#include <bits/stdc++.h> using namespace std; const int MOD = 1000000000 + 7; int n, bas, lim; int go[210][22]; int trie[210][22], tn; int upper[210], lower[210], val[210], str[210]; int fail[210]; int bound[210]; int f[2][210][210][510]; queue<int> q; inline int min(int a, int b) { return a < b ?...

#include <bits/stdc++.h> using namespace std; template <typename T> inline ostream &operator<<(ostream &_out, const vector<T> &_v) { if (_v.empty()) return _out; _out << _v.front(); for (auto _it = ++_v.begin(); _it != _v.end(); ++_it) _out << << *_it; return _out; } template <typename T> ...

#include <bits/stdc++.h> using namespace std; int n, k; char s[1000111]; pair<int, int> q[33]; int a[33]; int main() { scanf( %d%d n , &n, &k); gets(s); int l = strlen(s); for (int i = 0; i < k; i++) q[i].second = i; long long sum = 1; for (int i = 0; i < l; i++) { int u = s[i]...

#include <bits/stdc++.h> const int N = 500005, M = 105, INF = 0x3f3f3f3f; int n, K, p, sum[N], f[M][N], t[105], g[N]; void solveC2() { for (int i = 1; i <= n; i++) f[0][i] = INF; for (int i = 1; i <= K; i++) { for (int j = 0; j < p; j++) t[j] = INF; if (i == 1) t[0] = 0; for (int j = 1; ...

#include <bits/stdc++.h> const int oo = 0x7fffffff; const long long OO = 0x7fffffffffffffff; template <class T> std::ostream& operator<<(std::ostream& O, const std::vector<T>& V) { for (const T& x : V) O << x << ; O << n ; return O; } template <class T1, class T2> std::ostream& operator<<...

#include <bits/stdc++.h> using namespace std; char s1[100002], s2[100002]; int diff[100002] = {0}; int main() { scanf( %s , s1); scanf( %s , s2); int i, len = strlen(s1), count = 0, temp; for (i = 0; i < len; i++) { if (s1[i] != s2[i]) { diff[i] = 1; count++; } } ...

#include <bits/stdc++.h> using namespace std; const int maxn = 151; const int inf = 0x7f7f7f7f; const int mod = (int)(1e9 + 7); const long long INF = 0x7f7f7f7f7f7f7f7fLL; const double eps = 1e-8; const double pi = acos(-1.0); const int mask = 65535; int a[maxn]; int b[maxn]; void handle(int a[], ...

#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const int N = 4e2 + 5; int n, f[N][N]; int main() { scanf( %d , &n); f[1][0] = f[1][1] = 1; for (int top = 1; top < n; ++top) { for (int i = 0; i <= n; ++i) { for (int j = 0; j <= n - i + 1; ++j) { int t...

#include <bits/stdc++.h> using namespace std; const int maxn = 200005; int n, m; char s[maxn]; long long ans[maxn]; int sz[maxn]; int cnt[1 << 20]; vector<int> g[maxn]; bool die[maxn]; int getsz(int x, int f) { sz[x] = 1; for (int y : g[x]) if (y != f && !die[y]) sz[x] += getsz(y, x); ...

#include <bits/stdc++.h> using namespace std; int main() { int T; scanf( %d , &T); while (T--) { int n, a, o; vector<pair<pair<int, int>, int> > M; scanf( %d , &n); M.push_back(make_pair(make_pair(0, 0), 0)); for (int i = 1; i <= n * 2 - 1; i++) { scanf( %d%d , &a, ...

#include <bits/stdc++.h> using namespace std; const double eps = 1e-9; const int N = (int)2e6 + 5; int n, q, a[N], l[N], r[N]; int main() { for (scanf( %d , &q); q--;) { scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %d , a + i); for (int i = 1; i <= n; ++i) l[i] = n + 1, r[i] = -1...

#include <bits/stdc++.h> using namespace std; inline int rit() { int f = 0, key = 1; char ch; do { ch = getchar(); if (ch == - ) key = -1; } while (ch < 0 || ch > 9 ); do { f = f * 10 + ch - 0 ; ch = getchar(); } while (ch >= 0 && ch <= 9 ); return f * key...

#include <bits/stdc++.h> using namespace std; long long modPower(long long num, long long r) { if (r == 0) return 1; if (r == 1) return num % 1000000007; long long ans = modPower(num, r / 2) % 1000000007; if (r % 2 == 0) { return (ans * ans) % 1000000007; } return (((ans * ans) % 10000...

#include <bits/stdc++.h> using namespace std; int main() { int n; string s; cin >> n; cin >> s; int count = 0; for (int i = 0; i < n; i++) { if (s[i] == 8 ) { count++; } } int a = n / 11; if (count >= a) { cout << a; } else { cout << count; ...

#include <bits/stdc++.h> int n, m, sol; int D[100005]; int main() { scanf( %d %d , &n, &m); int p = 1; for (int i = 1; i <= m; ++i) { p = p + p; if (p >= 1000000009) p -= 1000000009; } D[1] = p - 1; for (int i = 2; i <= n; ++i) { int now = p - i; if (now < 0) now +=...

#include <bits/stdc++.h> using namespace std; const long long p = 1e9 + 7; const long double pi = 3.1415926535898; int main() { int s, n; cin >> s >> n; vector<pair<int, int> > a(n); for (int i = 0; i < n; i++) cin >> a[i].first >> a[i].second; sort(a.begin(), a.end()); for (int i = 0; i...

#include <bits/stdc++.h> using namespace std; template <class T> T abs(T x) { return x > 0 ? x : (-x); } template <class T> T sqr(T x) { return x * x; } int a[100000][2]; void save() { printf( -1 n ); exit(0); } const int n = 65536; int tree[57000 * 4 + 10]; int delta[57000 * 4...

#include <bits/stdc++.h> using namespace std; using ull = unsigned long long; using ll = long long; const int mod = 1e9 + 7; const int inf = 2e9 + 5; const int N = 501; int n, m, a[N][N], b[N]; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); cin >> n >> m; ...

#include <bits/stdc++.h> struct node { node() { zuo = you = he = 0; } int zuo, you, he; } a[1000002]; char s[1000002]; int sum(int l, int r) { int ans = 0, you = 0; while (r >= l) { while (r && r - l + 1 >= (r & -r)) { ans += a[r].he; if (a[r].zuo >= you) { ans +=...

#include <bits/stdc++.h> using namespace std; struct node { long long s, mn, mx; }; node T[303030]; node operator+(node l, node r) { node x; x.s = l.s + r.s; x.mn = min(l.mn, l.s + r.mn); x.mx = max(l.mx, l.s + r.mx); return x; } int A[100009]; void init(int idx, int s, int e) { ...

#include <bits/stdc++.h> using namespace std; int main() { int w, h, k, sum = 0; cin >> w >> h >> k; while (k != 0) { sum = sum + ((2 * w) + (2 * h) - 4); w = w - 4; h = h - 4; k = k - 1; } cout << sum; }

#include <bits/stdc++.h> using namespace std; template <typename T> T gcd(T a, T b) { if (a == 0) return b; return gcd(b % a, a); } template <typename T> T pow(T a, T b, long long m) { T ans = 1; while (b > 0) { if (b % 2 == 1) ans = (ans * a) % m; b /= 2; a = (a * a) % m; ...

#include <bits/stdc++.h> using namespace std; int nn, mm; struct Dinic { struct edge { int to, flow, cap; }; const static int N = 20007; vector<edge> e; vector<int> g[N + 7]; int dp[N + 7]; int ptr[N + 7]; void clear() { for (int i = 0; i < N + 7; i++) g[i].clear(); ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; int n; long long m; cin >> n >> m; long long arr[n], sum = 0; for (int i = 0; i < n; i++) { cin >> arr[i]; sum += arr[i]; } sort(arr, ...

#include <bits/stdc++.h> using namespace std; int cnt[100500]; int bestAns, start, len; int longest[100500]; inline void updAns(int L, int R) { int val = cnt[R + 1] - cnt[L]; if (val > bestAns) { bestAns = val; start = L; len = R - L + 1; } } int main() { stack<pair<char,...

#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; long long a[n + 1]; memset(a, 0, sizeof(a)); for (long long i = 1; i <= n; i++) cin >> a[i]; sort(a, a + n + 1); long long sum[n + 1]; memset(sum, 0, sizeof(sum)); sum[1] = a[1]; for (int i = 2;...

#include <bits/stdc++.h> using namespace std; template <class T1, class T2> ostream& operator<<(ostream& out, const pair<T1, T2> p) { out << ( << p.first << , << p.second << ) ; return out; } template <class T1, class T2> istream& operator>>(istream& in, pair<T1, T2>& p) { in >> p.first >> ...

#include <bits/stdc++.h> int a[100][100]; int d[2][100]; long long c[2][100]; int main() { int n, m, i, j, k; double max = 1; scanf( %d %d , &n, &m); for (i = 0; i < m; i++) { int x, y; scanf( %d %d , &x, &y); x--; y--; a[x][y] = a[y][x] = 1; } for (i = 0; i...

#include <bits/stdc++.h> using namespace std; unsigned long long int MOD = 1000000007; unsigned long long int B = 13331; bool cmp(const int &a, const int &b) { return a < b; } int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); } int lcm(int a, int b) { return a * (b / gcd(a, b)); } double func(dou...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 15; const int mod = 1e9 + 7; const int inf = 1e9 + 3; int t, n; string a[3], s; int flag; int conv(string q) { int ans = 0; for (int i = 0; i < q.size(); i++) { ans *= 10; ans += q[i] - 0 ; } return ans; ...

#include <bits/stdc++.h> using namespace std; template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) { os << { ; string sep; for (const auto &x : v) os << sep << x, sep = , ; return os << } ; } template <typename T, size_t size> ostream &operator<<(ostream &os, const ...

#include <bits/stdc++.h> int main() { int n, b; scanf( %d%d , &n, &b); int a[100], s = b; for (int i = 0; i < n; i++) { scanf( %d , &a[i]); s += a[i]; } for (int i = 0; i < n; i++) if (s < a[i] * n) { puts( -1 ); return 0; } for (int i = 0; i < n; i+...

#include <bits/stdc++.h> using namespace std; const int mo = 1e9 + 7; const int N = 1000010; const int inf = 0x3f3f3f3f; using namespace std; int n, m, q, tot, ans[N], fa[N], mark[N], pa[N], tmp; struct node { int a, b, c; bool operator<(const node &x) const { return c < x.c; } } e[N], ed[N]; ...

#include <iostream> #include <algorithm> using namespace std; int main() { int64_t k; int64_t n, x, t; cin >> k; while(k--) { cin >> n >> x >> t; int64_t zero = 0; int64_t ans = max(zero, n - t/x) * (t / x) + min(t/x, n) * min(t/x - 1, n - 1) / 2; ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 1010; int q1[MAXN], q2[MAXN], r1, r2; int n, c, m; int a[MAXN]; bool check() { for (int i = 1; i <= n; i++) if (!a[i] || (a[i] < a[i - 1])) return false; return true; } int main() { cin >> n >> m >> c; while (!check()) ...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:100000000 ) using namespace std; const long double pi = acos(-1.0); const long long inf = (long long)1e18; const int N = (int)1e6; int n, m; long long need[N], start[N]; bool check(long long x) { int lowest = 0; for (int i = 0; (i < n) && ...

#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3fll; int main() { int n, k; scanf( %d , &n), scanf( %d , &k); if (k % 2 == 0) { int ans = 0; while (n--) { int x; scanf( %d , &x); if (x == 1) ans ^= ...

#include <bits/stdc++.h> using namespace std; int n, k, i, a[100010]; set<int> r; int main() { scanf( %d%d , &n, &k); for (i = 0; i < n; i++) scanf( %d , &a[i]); sort(a, a + n); for (i = 0; i < n; i++) { if (a[i] % k == 0 && r.count(a[i] / k)) continue; r.insert(a[i]); } prin...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:16777216 ) using namespace std; int n, k; int d[2][10000]; void solution() { scanf( %d %d , &n, &k); for (int i = 0, _n = (n - 1); i < _n; ++i) d[0][i] = 1; int cur = 0, nxt = 1; for (int it = 0, _n = (k); it < _n; ++it) { for (int...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int sum = 0; bool ok = false; for (int i = 1; i <= n; i++) { sum = i + sum; if (n == 1 || n == sum) { cout << YES << endl; break; } if (sum > n) { ok = true; brea...

#include <bits/stdc++.h> #pragma GCC optimize( O2 ) using namespace std; inline long long int input() { long long int n; cin >> n; return n; } long long int pw(long long int a, long long int b) { return (!b ? 1 : (b & 1 ? a * pw(a * a, b / 2) : pw(a * a, b / 2))); } const long long int MAX...

#include <bits/stdc++.h> using namespace std; const int N = 1e6; int n; int m; int t[4 * N]; void upd(int l, int r, int v = 1, int tl = 1, int tr = N) { if (l > r) return; if (l <= tl && tr <= r) { t[v]++; return; } int tm = (tl + tr) / 2; upd(l, min(tm, r), v * 2, tl, tm); ...

#include <bits/stdc++.h> using namespace std; char s[2000010], t[2000010]; int main(void) { int n; scanf( %d , &n); scanf( %s , s); scanf( %s , t); int count_s, count_t, count_com; count_s = count_t = count_com = 0; for (int i = 0; i < 2 * n; ++i) { if (s[i] == 1 && t[i] == 1 ...

#include <bits/stdc++.h> using namespace std; template <class T> void cmax(T& a, T b) { a = max(a, b); } template <class T> void cmin(T& a, T b) { a = min(a, b); } void _BG(const char* s) {} template <class T, class... TT> void _BG(const char* s, T a, TT... b) { for (int c = 0; *s && (c ...

#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; int _t[6]; int main() { for (int i = 0; i < 6; ++i) { scanf( %d , &_t[i]); } long long a, b, x1, y1, x2, y2; a = 2 * _t[0]; b = 2 * _t[1]; x1 = _t[2] - _t[3]; y1 = _t[2] + _t[3]; x2 = _t[4] - _t[5]; ...

#include <bits/stdc++.h> using namespace std; long long r[1003], c[1003], g[1003][1003]; int main() { long long w, h; scanf( %lld %lld , &h, &w); for (int i = 0; i < h; i++) scanf( %lld , &r[i]); for (int i = 0; i < w; i++) scanf( %lld , &c[i]); memset(g, -1, sizeof g); for (int i = 0; i <...

#include <bits/stdc++.h> using namespace std; #define ll long long #define fi first #define se second const int MAX = 2 * 1e5 + 10; const int MOD = 1e9 + 7; ll t; ll n, m, k; ll a, b, x, y, x2, y2; ll bio[MAX]; ll arr[MAX]; vector <ll> v; string s; int main() { cin >> t; ...

#include <bits/stdc++.h> using namespace std; const long long inf = 0x3f3f3f3f; const long long INF = 0x3f3f3f3f3f3f3f3fLL; const long long mod = 1e9 + 7; long long powmod(long long a, long long b) { long long res = 1; a %= mod; assert(b >= 0); for (; b; b >>= 1) { if (b & 1) res = res *...

#include <bits/stdc++.h> using namespace std; const double PI = acos(-1.0); int n, c[1011], vao[1011], save[1011]; vector<int> ke[1011]; bool mark[1011]; int get(int start) { for (int i = (1), _b = (n); i <= _b; i++) vao[i] = save[i]; int done = 0, res = 0; memset(mark, false, sizeof mark); ...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(NULL); int n, k, p, x, y; cin >> n >> k >> p >> x >> y; vector<int> a(n); int sum = 0; for (int i = 0; i < k; i++) { cin >> a[i]; sum += a[i]; } if (sum + n - k > x) { ...

#include <bits/stdc++.h> using namespace std; long long mod = (1000000007LL); inline long long mult(long long a, long long b) { return (a * b) % mod; } inline long long poww(long long a, long long b) { long long res = 1; while (b > 0) { if (b & 1) res = (res * a) % mod; a = (a * a) % mod; ...

#include <bits/stdc++.h> using namespace std; struct node { int val; int type; } N[500000]; int main() { long long n, a, b, c, d, start, len; cin >> n >> a >> b >> c >> d >> start >> len; for (int i = 1; i <= n; i++) { cin >> N[i].val >> N[i].type; } long long s = 1, t = 1, sum...

#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007; const long long INF = 4e18 + 10; long long n; long long a[55]; vector<vector<long long> > ans; long long findpos(long long x) { for (long long i = 0; i < n; i++) if (a[i] == x) return i; } void p1(long long x) { ...

#include <bits/stdc++.h> using namespace std; int n, m; char s[4][12]; char t[12][25][12]; int num[12]; int main() { int i, j; int ans = 0, p = 0; scanf( %d , &n); for (i = 0; i < n; i++) scanf( %s , s[i]); scanf( %d , &m); for (i = 0; i < m; i++) { scanf( %d , &num[i]); ...

#include <bits/stdc++.h> int n, arr[1005][3], sum, cnt; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d %d %d , &arr[i][0], &arr[i][1], &arr[i][2]); for (int i = 0; i < n; i++) { for (int j = 0; j < 3; j++) sum += arr[i][j]; if (sum >= 2) cnt++; sum = 0; }...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> a(n), pmx(n, -1), smx(n, -1); cin >> a[0]; pmx[0] = 0; int c = 1; for (int j = 1; j < n; j++) { cin >> a[j]; pmx[j] = pmx[j - 1]; smx[j] = (j == 1) + (j != 1) * smx[j - 1]; if ...

#include <bits/stdc++.h> using namespace std; const int maxn = 3e3 + 5; int n, m; vector<int> g[maxn]; long long dis[maxn][maxn]; vector<pair<long long, long long> > from[maxn], to[maxn]; void bfs(int x) { queue<int> q; q.push(x); dis[x][x] = 0; while (!q.empty()) { int now = q.front...

#include <bits/stdc++.h> using namespace std; int main() { long long t; cin >> t; while (t--) { string p, h; int w = 0; cin >> p >> h; sort(p.begin(), p.end()); if (h.size() >= p.size()) { for (int i = 0; i < (h.size() - p.size() + 1); i++) { string sub = ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int k; cin >> k; int n, m; n = 2; m = 3; int z = (1 << 17); cout << n << << m << n ; cout << z + k << << z << << k << n ; cout << k << << z + k ...

#include <bits/stdc++.h> using namespace std; set<int> s; int ans[1000000]; int main() { int n, m; scanf( %d %d , &n, &m); int i, j, l, r, w; for (i = 1; i <= n; i++) s.insert(i); for (i = 0; i < m; i++) { scanf( %d %d %d , &l, &r, &w); auto idx1 = s.lower_bound(l); auto id...

#include <bits/stdc++.h> using namespace std; int a[25][25], n, m, dp[1 << 22]; char s[25][222]; int main() { scanf( %d%d , &n, &m); for (int i = 0; i < n; ++i) scanf( %s , s[i]); for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) scanf( %d , &a[i][j]); memset(dp, 63, sizeof(dp)), dp[...

#include <bits/stdc++.h> using namespace std; long long ans[200005]; vector<vector<pair<long long, long long> > > G(200005); int main() { long long i, j, n, m, a, b, c; priority_queue<pair<long long, long long> > pq; scanf( %lld %lld , &n, &m); for (i = 0; i < m; i++) { scanf( %lld %lld %l...

#include <bits/stdc++.h> using namespace std; void k_007() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } bool sortbysec(const pair<long long, long long> &a, const pair<long long, long long> &b) { return (a.second < b.second); } long long gcd(long long a, long lo...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; for (int i{0}; i < n; i++) { int found{0}; int num{}; cin >> num; int res{}; for (int j{0}; j < num; j++) { int numI; cin >> numI; if (numI % 2 == 0) { found = 1; ...

#include <bits/stdc++.h> using namespace std; long long n, k, l, r, st; map<pair<long long, long long>, long long> M[2]; long long Count(long long len, long long t, bool w) { if (M[w].count({len, t})) return (M[w][{len, t}]); if (t > len) return (M[w][{len, t}] = 0); if (len == t) return (M[w][{len,...

#include <bits/stdc++.h> using namespace std; struct algo { int n; map<pair<int, int>, int> v1; vector<vector<int> > drogi; vector<pair<int, int> > tab; vector<pair<int, int> > wy; algo() { cin >> n; string s; int li = 0; tab.push_back({}); for (long long a, b, ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); int n, ans = 0, i, temp; vector<int> a; cin >> n; for (i = 0; i < n; i++) { cin >> temp; a.push_back(temp); } sort(a.begin(), a.end()); for (i = 0; i < n; i = i + 2) { if (a...

#include <bits/stdc++.h> int main(void) { int i, w; char s[3][10]; char res[4] = { F , M , S , ? }; while (scanf( %s %s %s , s[0], s[1], s[2]) != EOF) { w = 3; for (i = 0; i < 3; i++) { if (s[i][0] == r && s[(i + 1) % 3][0] == s && s[(i + 2) % 3][0] == s ) ...

#include <bits/stdc++.h> int A[2][155] = {{1}, {0, 1}}; int main() { int n; std::cin >> n; for (int i = 2; i <= n; ++i) for (int j = i - 1; ~j; --j) A[i & 1][j + 1] = (A[i & 1][j + 1] + A[~i & 1][j]) & 1; printf( %d n , n); for (int i = 0; i <= n; ++i) printf(i == n ? %d n : %d ...

#include <bits/stdc++.h> using namespace std; bool isluck() { unsigned long long n, s1 = 0, s2 = 0; string s; cin >> n >> s; for (int register i = 0; i < n / 2; i++) { int x = (s[i] - 0 ) % 10; if (x != 4 && x != 7) return false; s1 += x; } for (int register i = n / 2; i <...

#include <bits/stdc++.h> using namespace std; int a, b; int sum; int main() { cin >> a >> b; while (a >= b) { sum += a / b * b; a = a / b + a % b; } cout << sum + a; return 0; }

#include <bits/stdc++.h> using namespace std; int n, j; std::vector<char> v; int main() { std::ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; cin >> n; int i = 0; while (i < n) { j = 0; while (j < 2 && i < n) { cout << a ; j++; ...

#include <bits/stdc++.h> using namespace std; const int N = 3000; char a[N][N]; int n, m, k, vis[N][N]; long long ans = 0; int main() { while (~scanf( %d%d%d , &n, &m, &k)) { ans = 0; for (register int i = 0; i <= n - 1; ++i) scanf( %s , a[i]); for (register int i = 0; i <= n - 1; ++i)...

#include <bits/stdc++.h> using namespace std; inline int getint() { int res = 0, fh = 1; char ch = getchar(); while ((ch < 0 || ch > 9 ) && ch != - ) ch = getchar(); if (ch == - ) fh = -1, ch = getchar(); while (ch <= 9 && ch >= 0 ) res = res * 10 + ch - 0 , ch = getchar(); return r...

#include <bits/stdc++.h> using namespace std; int mark[1000009]; int main() { long long n, m = 0, i, j, t; long long sum; cin >> n; long long a[n]; for (i = 0; i < n; i++) { scanf( %lld , &a[i]); } t = a[n - 1]; sum = t; for (j = n - 1; j > 0; j--) { if (a[j - 1] < ...

#include <bits/stdc++.h> using namespace std; inline char nc() { static char buf[100000], *l = buf, *r = buf; return l == r && (r = (l = buf) + fread(buf, 1, 100000, stdin), l == r) ? EOF : *l++; } template <class T> void read(T &x) { x = 0; int f = 1, ch = nc(); ...

#include <bits/stdc++.h> using namespace std; const int maxn = 200000; const long long maxp = 1000000007; int n, m; struct data { int adj, p, p_; }; vector<data> e[maxn]; bool v[maxn]; long long f[maxn][2][2][2]; int con[maxn][2]; void dfs(int x) { v[x] = false; bool flag = false; ...

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

#include <bits/stdc++.h> using namespace std; void setIO(string name) { ios_base::sync_with_stdio(0); cin.tie(0); freopen((name + .in ).c_str(), r , stdin); freopen((name + .out ).c_str(), w , stdout); } void fast() { ios_base::sync_with_stdio(false); cin.tie(NULL); } int main() ...

#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const long long INF = 0x3f3f3f3f3f3f3f3f; const int MAXN = 1e5 + 10; const int N = 102; const long long mod = 1e9 + 7; inline int read() { int x = 0, f = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ...

#include <bits/stdc++.h> using namespace std; long long n, m, a, b, g[3005 * 3005], x, y, z, A[3005][3005], ans; deque<long long> q; vector<long long> v; vector<vector<long long> > V; vector<long long> fun(vector<long long> v, long long n, long long b) { vector<long long> ans; q.clear(); for (__...

#include <bits/stdc++.h> using namespace std; const int maxn = 100005; const int inf = 0x3f3f3f3f; int n, e[2][maxn], tot, rd[maxn]; int net[maxn], tail[maxn]; inline int read(void) { int num, sign = 1; char c; while (!isdigit(c = getchar())) if (c == - ) sign = 0; num = c - 0 ; ...

#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; int main() { ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0); int q; cin >> q; for (int i = 0; i < q; i++) { ll k, n, a, b; cin >> k >> n >> a >> b; if (k - n * b <= 0) { ...

#include <bits/stdc++.h> using namespace std; int main() { int q, v; cin >> q; for (int i = 0; i < q; i++) { cin >> v; if (v == 2) cout << 2 << n ; else { if (v % 2) cout << 1 << n ; else cout << 0 ...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10, mod = 1e9 + 7; const long long inf = 1e18; unsigned int dp[maxn]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(); int n, cnt = 0; cin >> n; string s; cin >> s; if (n & 1) return cout...

#include <bits/stdc++.h> using namespace std; int main() { vector<int> v; int n, i, j, k, len, x, y, c, a[1020] = {0}; cin >> n; if (n == 1) { cout << 0 << endl; return 0; } a[1] = 1; for (i = 2; i <= 1000; i++) { c = 2; for (j = i * c; j <= 1000; j = i * c) { ...

#include <bits/stdc++.h> using namespace std; int n, t; int visited[30009]; bool ok = false; vector<int> C[30009]; void dfs(int u) { if (u == t) { ok = true; return; } visited[u] = 1; if (C[u].size()) for (int i = 0; i <= C[u].size() - 1; i++) { int v = C[u][i]; ...

#include <bits/stdc++.h> using namespace std; vector<int> G[((int)2e5 + 10)]; int dis[((int)2e5 + 10)]; int n; int ans = 0; void dfs(int f, int son, int d) { int flag = 0; dis[son] = d; for (int i = 0; i < G[son].size(); i++) { if (G[son][i] == f) continue; dfs(son, G[son][i], d + 1)...

#include <bits/stdc++.h> using namespace std; const int MAXN = 100005, MAXT = 500, INF = 0x3f3f3f3f; int mx[MAXT], add[MAXT], sz[MAXT], num[MAXT][MAXT], A[MAXN]; int N, T = 314; void upd(int p) { if (add[p]) { for (int i = 0; i < sz[p]; ++i) num[p][i] += add[p]; add[p] = 0; } } void in...