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

func_code_string stringlengths 59 71.4k
#include <bits/stdc++.h> void sc(int &x) { scanf( %d , &x); } void sc(int &x, int &y) { scanf( %d%d , &x, &y); } void sc(int &x, int &y, int &z) { scanf( %d%d%d , &x, &y, &z); } void sc(long long &x) { scanf( %lld , &x); } void sc(long long &x, long long &y) { scanf( %lld%lld , &x, &y); } void sc(long long ...
#include <bits/stdc++.h> using namespace std; int n, q, cnt, k, m, r, ans; int fa[21][100010], dep[100010], st[100010], ed[100010], h[100010]; int f[100010][310]; int t[100010]; bool vis[100010]; struct node { int id, num; bool operator<(const node &T) const { return num < T.num; } } s[100010]; ...
#include <bits/stdc++.h> #pragma GCC target( avx2 ) #pragma GCC optimization( O3 ) #pragma GCC optimization( unroll-loops ) #pragma GCC optimize( Ofast ) #pragma GCC target( avx,avx2,fma ) using namespace std; long long binpow(long long base, long long exp, int mod) { long long res = 1; while (exp...
#include <bits/stdc++.h> const double PI = 3.141592653589793238460; using namespace std; vector<int> d; vector<int> l; vector<int> r; vector<int> u; bool isPossibleL(string st) { for (char ch : st) { for (int n : l) if (ch - 0 == n) return false; } return true; } bool isPos...
#include <bits/stdc++.h> using namespace std; vector<vector<int>> statues(8); vector<vector<char>> MAT(8, vector<char>(8)); vector<vector<vector<bool>>> VIS(8, vector<vector<bool>>(8, vector<bool>(10, false))); vector<p...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:102400000,102400000 ) using namespace std; const double eps = 10e-10; const int mod = 1000000007; const int maxn = 300005; const int maxm = 10005; pair<int, int> ans[maxn]; int main() { int n, m, a; while (~scanf( %d%d , &n, &m)) { p...
#include <bits/stdc++.h> using namespace std; int N, M, neg, nsus; int ar[100002]; int cnt[100002]; int sus[100002]; int main() { scanf( %d%d , &N, &M); for (int i = 1; i <= N; i++) { scanf( %d , &ar[i]); if (ar[i] > 0) cnt[ar[i]]++; else { cnt[-ar[i]]--; ne...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, m; cin >> n >> m; long long a = 0; for (int i = 0; i < n; i++) { int k; cin >> k; a += k; } if (a == m) cout << YES ; else c...
#include <bits/stdc++.h> using namespace std; int main() { int fib; cin >> fib; cout << fib << << 0 << << 0; return 0; }
#include <bits/stdc++.h> using namespace std; const int mx = 1e2 + 10; const long long mod = 1e9 + 31; mt19937 mtrand(time(0)); int n, m; char s[2][1 << 12]; int mp[2][1 << 14]; int f[1 << 15], ans, pr[1 << 15]; int unfd(int x) { int r = x; while (r != f[r]) r = f[r]; int t; while (f[x...
#include <bits/stdc++.h> using namespace std; const long long maxn = 2e5 + 10; const long long INF = 1e18; const long long mod = 1e9 + 7; long long poww(long long a, long long b) { if (b == 0) return 1; long long x = poww(a, b / 2) % mod; if (b & 1) return (((x * x) % mod) * a) % mod; el...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int a, b, c, d; cin >> a >> b >> c >> d; if (a == 0 \|\| b == 0 \|\| c == 0) { int cnt = 0; if (a % 2 == 1) cnt++; if (b % 2 == 1) cnt++; if (c % 2 == 1) cnt++; ...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, sum = 0; long long ans = 0; cin >> n; char s[n]; cin >> (s + 1); map<int, int> f; f[0] = 1; for (int i = 1; i <= n; i++) { int tmp = s[i] - 0 ; ...
#include <bits/stdc++.h> using namespace std; long long n, a[300005], b1[500005], b2[500005], cnt = 0, pl[300005], c[300005], ans = 0, plc[300005], m, d, can[300005], r, ne[300005]; pair<int, int> p; pair<int, int> p1; pair<int, int> p2; map<pair<int, int>, int> m1; string s; int main() { ...
#include <bits/stdc++.h> using namespace std; template <typename T> struct BIT { int n; vector<T> dat; BIT(int n = 0) { initialize(n); } void initialize(int nin) { n = nin; dat.resize(n, 0); } T sum(int i) { T s = 0; while (i >= 0) { s += dat[i]; i =...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int arr[n]; int orig[n]; int product = 1; int counter = 0; for (int i = 0; i < n; i++) { cin >> arr[i]; orig[i] = arr[i]; if (arr[i] >= 0) { arr[i] = -arr[i] - 1; } if (arr[i...
#include <bits/stdc++.h> using namespace std; const int N = 200005; struct node { int index, val, team; }; node ni[N]; int divi[N], rest[N]; int main() { int n; scanf( %d , &n); for (int i = 0; i < n; ++i) { ni[i].index = i; scanf( %d , &ni[i].val); } sort(ni, ni + n, [...
#include <bits/stdc++.h> using namespace std; bool a[5][5]; int main() { for (int i = 1; i < 4; ++i) { for (int j = 1, x; j < 4; ++j) { a[i][j] ^= 1; cin >> x; a[i][j] ^= (x & 1); a[i + 1][j] ^= (x & 1); a[i - 1][j] ^= (x & 1); a[i][j + 1] ^= (x & 1); ...
#include <bits/stdc++.h> int main() { int n, m, i; float x, max = 0.0; scanf( %d%d , &n, &m); int s[n][2]; for (i = 0; i < n; i++) { scanf( %d%d , &s[i][0], &s[i][1]); x = (float)(s[i][0]) / s[i][1]; if (max == 0.0) { max = x; } if (max > x) { max = x;...
#include <bits/stdc++.h> using namespace std; struct node { int t, next; } a[800010]; struct hhhh { int l, r; } h[200010]; vector<pair<int, int> > v[400010]; vector<int> g[400010]; long long ans[400010]; int fa[400010], son[400010], dep[400010], top[400010], size[400010]; int fat[400010][20]...
#include <bits/stdc++.h> using namespace std; vector<int> h; vector<vector<int> > g; int h0, v0; vector<int> val; int it = 0; vector<bool> used; vector<int> treesum, par; vector<int> treemin; void update(int v, int l, int r, int ind, int d) { if (l == r) { treesum[v] += d; treemin[v]...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> l(n), r(n); for (int i = 0; i < n; i++) { cin >> l[i] >> r[i]; } int a = -1, b = -1; bool ok = true; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (!((l[i] <= ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int s = 0; for (int i = 0; i < 5; i++) { int x; cin >> x; s += x; } if (s % 5 \|\| !s) cout << -1 ; else cout << s / 5; }
#include <bits/stdc++.h> using namespace std; const int MAXN = 100000 + 3; int N, Q, K; long long a[MAXN], sum[MAXN], save[MAXN]; int main() { scanf( %d , &N); memset((save), (-1), sizeof(save)); for (int i = 1; i <= N; ++i) scanf( %lld , &a[i]); sort(a + 1, a + 1 + N); for (int i = 1; i <...
#include <bits/stdc++.h> using namespace std; int cnt; string s; stack<int> st; int main() { cin >> s; for (int i = 0; i < s.size(); ++i) { if (s[i] == ( \|\| s[i] == [ \|\| s[i] == { \|\| s[i] == < ) { st.push(int(s[i])); } else { if (st.empty()) { cout << Impo...
#include <bits/stdc++.h> using namespace std; int la, lb, cnt[20], ans[25]; char a[25], b[25]; void find(int v, bool flag) { if (v > lb) { for (int i = 1; i <= lb; i++) printf( %d , ans[i]); exit(0); } if (flag && cnt[b[v] - 0 ]) { cnt[b[v] - 0 ]--; ans[v] = b[v] - 0 ; ...
#include <bits/stdc++.h> using namespace std; long long n, ans, fact[200005]; long long pangkat(long long a, long long b) { if (b == 0) return 1; long long temp = pangkat(a, b / 2); if (b % 2 == 0) return (temp * temp) % 1000000007; return (((temp * temp) % 1000000007) * a) % 1000000007; } lon...
#include <bits/stdc++.h> using namespace std; const int MAXN = 48; long long s, x, xCopy, sCopy, pos[MAXN][2], result; int n, bitS, bitX; int main() { cin >> s >> x; pos[0][0] = 1; pos[0][1] = 0; n = 0; xCopy = x; sCopy = s; while (x \|\| s) { n++; bitS = s % 2; bit...
#include <bits/stdc++.h> using namespace std; const int MAXN = 500100; const int root = 800; long long lazy[root]; unordered_set<long long> s[root]; long long v[MAXN]; signed main() { memset(lazy, 0, sizeof lazy); long long n, m; scanf( %lld %lld , &n, &m); for (long long i = 0; i < n; i++...
#include <bits/stdc++.h> using namespace std; int main() { int i = 0; char a; char A[] = hello ; while (cin >> a && a != n ) { if (a == A[i]) i++; } if (i == 5) cout << YES << endl; else cout << NO << endl; }
#include <bits/stdc++.h> using namespace std; int dx[] = {0, 0, 1, -1, 1, 1, -1, -1}; int dy[] = {1, -1, 0, 0, -1, 1, 1, -1}; const int mod = 1e9 + 7; int dcmp(long double x, long double y) { return fabs(x - y) <= 1e-12 ? 0 : x < y ? -1 : 1; } void fast() { std::ios_base::sync_with_stdio(0); c...
#include <bits/stdc++.h> using namespace std; struct fenwick { int N; vector<int> sum; void init(int n) { N = n + 1; sum.assign(N, 0); } void add(int i, int x) { for (i++; i < N; i += i & -i) { sum[i] += x; } } int get(int i) { int tot = 0; for...
#include <bits/stdc++.h> using namespace std; const int maxn = 510000; int f[maxn]; int n, d, up; int c[66]; int b[66]; int main() { cin >> n >> d; f[0] = 1; for (int i = 1; i <= n; i++) { int x; cin >> x; for (int j = (up += x); j >= x; j--) if (f[j - x]) f[j] = 1; ...
#include <bits/stdc++.h> using namespace std; using namespace std; const int MaxN = 100005, NA = -1, MaxC = 0x3F3F3F3F; int a[MaxN]; int n; multiset<int, greater<int> > s; deque<int> d; int main(void) { int i, v; multiset<int>::iterator it; while (scanf( %d , &n) != EOF) { for (i = 0;...
#include <bits/stdc++.h> using namespace std; template <typename T, typename U> std::pair<T, U> operator+(const std::pair<T, U>& l, const std::pair<T, U>& r) { return {l.first + r.first, l.second + r.second}; } typedef void (*callback_function)(void); const long long ZERO = 0LL; const long long INF64 ...
#include <bits/stdc++.h> using namespace std; template <class A, class B> inline bool mina(A &first, B second) { return (first > second) ? (first = second, 1) : 0; } template <class A, class B> inline bool maxa(A &first, B second) { return (first < second) ? (first = second, 1) : 0; } const int ...
#include <bits/stdc++.h> char s[1000000]; char ans[1000000]; int main() { int i, len, cnt; char max = 0; while (scanf( %s , s) != EOF) { max = 0; cnt = 1000000 - 1; len = strlen(s); for (i = len - 1; i >= 0; i--) { if (s[i] >= max) { max = s[i]; ans[...
#include <bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 228; vector<int> g[MAXN]; vector<bool> vis(MAXN); int n, m; int p[MAXN]; int col[MAXN], help[MAXN]; int t[4 * MAXN], lazy[4 * MAXN]; int tin[MAXN], tout[MAXN]; int timer; void dfs(int v) { vis[v] = 1; tin[v] = timer++; ...
#include <bits/stdc++.h> int main() { int num; int count = 0, i; int digitos[10]; scanf( %d , &num); int aux = num; for (i = 0; i < 10; i++) digitos[i] = 0; while (aux != 0) { digitos[aux % 10] = 1; aux = aux / 10; } if (num == 1) { printf( 1 n ); return 0; ...
#include <bits/stdc++.h> using namespace std; void solve() { int n, cnt = 0; scanf( %d , &n); for (int i = 1; i <= n; i++) { int x; scanf( %d , &x); cnt += x; } if (cnt * 2 <= n) { printf( %d n , n / 2); for (int i = 1; i <= n / 2; i++) printf( 0 ); printf( ...
#include <bits/stdc++.h> using namespace std; struct candy { candy(int t, int h, int m) { this->type = t; this->height = h; this->mass = m; } int type; int height; int mass; bool operator<(const candy &c) const { return this->mass < c.mass; } bool operator>(const candy ...
#include <bits/stdc++.h> using namespace std; int main() { int n, i; vector<char> v; string s; cin >> s; n = s.size(); char c[n], ch; i = n; ch = s[n - 1]; while (i--) { if (s[i] == ch) v.push_back(s[i]); else if (s[i] > ch) { v.push_back(s[i]); ...
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( Ofast ) #pragma GCC target( avx,avx2,fma ) bool iseven(long long int n) { if ((n & 1) == 0) return true; return false; } void print(long long int t) { cout << t; } void print(int t) { cout << t; } void print(string t) { cout << ...
#include <bits/stdc++.h> int SequenceValue(char seq[], int min_val) { int value = 0; min_val = 0; char it = seq; while (it != 0 && it != n ) { value += (it == ( ) ? 1 : -1; if (value < min_val) { min_val = value; } it += 1; } return value; } ch...
#include <bits/stdc++.h> using namespace std; int main() { long long i; long long n, m, k, l; cin >> n >> m >> k >> l; long long no = 0; long long yes = 0; long long j = (l + k); long long ans = ((j - 1) / m) + 1; if (((ans * m)) > n) no = 1; if (no) cout << -1 ; else ...
#include <bits/stdc++.h> using namespace std; long long MOD(long long, long long); void doublesetprecision(double, int); bool isEven(long long); int gcd(int, int); int n, m, o, ans, k; int a[1000000]; void solve() { string s, t; cin >> s >> t; if (s == t) { cout << yes ; return;...
#include <bits/stdc++.h> using namespace std; vector<int> E[1 << 18]; pair<int, int> R[1 << 18]; int dfs(int a, int p, int d) { int cnt = 1; for (auto it = (E[a]).begin(); it != (E[a]).end(); ++it) { int b = *it; if (b == p) continue; cnt += dfs(b, a, d + 1); } R[a] = pair<int,...
#include <bits/stdc++.h> using namespace std; const int NMAX = 1e5 + 2; int n, last[NMAX], x, y; int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n; for (int query = 1; query <= n; query++) { cin >> x >> y; int ans = 0, autre; for (int d = 1; d * d <= x; d++) { ...
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7, LIM = 1e5; unsigned long long int fact[2 * LIM + 1]; unsigned long long int binpow(long long int x, int y) { unsigned long long int res = 1; while (y > 0) { if (y & 1) res = (res * x) % MOD; y >>= 1; x = (x * x) % M...
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; int n; int a[N]; int fa(int x) { for (int i = 0;; i++) if ((1 << i) >= x) return (1 << i) - x; } int dis(int x, int y) { int sum = 0; while (x != y) x > y ? x = fa(x) : y = fa(y), sum++; return sum; } int get(i...
#include <bits/stdc++.h> using namespace std; int main() { int n, x; cin >> n >> x; int cnt = 0; for (int j = 1; j * j <= x; j++) { if (x % j == 0) { if (j <= n && x / j <= n) { if (j * j == x) cnt++; else cnt += 2; } } } ...
#include <bits/stdc++.h> void printResult() {} int main(int argc, const char* argv[]) { std::ios::sync_with_stdio(false); int rows; bool possible = false; scanf( %d n , &rows); std::shared_ptr<std::vector<char>> bus = std::make_shared<std::vector<char>>(); if (rows > 0) { for...
#include <bits/stdc++.h> using namespace std; int main() { double d, h, v, e; cin >> d >> h >> v >> e; double pi = 2 * acos(0.0); double he = (4 * v) / (pi * d * d); if (he > e) { cout << YES n ; cout << setprecision(12) << (h) / (he - e); } else cout << NO ; return 0...
#include <bits/stdc++.h> using namespace std; char s[1000010]; int c[20]; int main() { int k; scanf( %d , &k); scanf( %s , s + 1); int n = strlen(s + 1); int sum = 0; int i; memset(c, 0, sizeof c); int ans = 0; for (i = 1; i <= n; i++) { c[s[i] - 0 ]++; sum += s[...
#include <bits/stdc++.h> using namespace std; char s[2505][5005]; int a[5000]; int c1[30], c2[30]; int dif[2505]; int main() { int k, n; scanf( %d%d , &k, &n); scanf( %s , s[0]); bool flag = false; for (int i = 0; i < n; ++i) { c1[s[0][i] - a ]++; if (c1[s[0][i] - a ] > 1) ...
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const int maxn = 200011; const int INF = 1 << 25; const int logN = 18; int n; int a[maxn]; bool p[maxn]; int b[maxn]; bool used[maxn]; int main(int argc, char const *argv[]) { scanf( %d , &(n)); for (int(i) = 0; i < (in...
#include <bits/stdc++.h> int main() { int n, s, i, sum = 0, max = 0; scanf( %d %d , &n, &s); int arr[n]; for (i = 0; i < n; i++) { scanf( %d , &arr[i]); sum = sum + arr[i]; if (arr[i] > max) max = arr[i]; } if (sum - max > s) printf( NO ); else printf( YES ); ...
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 7; int n, m, len, cnt1 = 0, cnt2 = 0, cnt3 = 0, fail[maxn]; long long ans = 0; struct Node { long long c; char ch; } s[maxn], str[maxn], _str[maxn]; bool ok(int i, int j) { if (_str[i].c != _str[j].c) return false; if (_s...
#include <bits/stdc++.h> #pragma GCC optimize(2) using namespace std; const int inf = 0x3f3f3f3f; const int mod = 998244353; using ll = long long; using vi = vector<int>; using pii = pair<int, int>; inline int read() { int x = 0, f = 1, c = getchar(); for (; !isdigit(c); c = getchar()) if ...
#include <bits/stdc++.h> using namespace std; int d[(1 << 17) + 20][100], par[(1 << 17) + 20][100]; int prime[20] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53}; int sum[70], a[100]; int ret, temp; int ans = 10000000; void pre() { for (int i = 1; i < 59; i++) { for (int j = 0; j ...
#include <bits/stdc++.h> using namespace std; const int N = 100005, inf = 2e9, n = 100000; struct seg { int fl[N << 2], m1[N << 2], m2[N << 2], sz[N << 2], tg[N << 2], c[N << 2]; long long tr[N << 2]; void build(int k, int l, int r) { fl[k] = 0; m1[k] = inf; m2[k] = 0; sz[k] = ...
#include <bits/stdc++.h> using namespace std; int main() { int n = 1, i, j = 0; string s, t; getline(cin, s); getline(cin, t); for (i = 0; i < t.length(); i++) { if (s[j] == t[i]) { n++; j++; } } cout << n; }
#include <bits/stdc++.h> using namespace std; int n, ma, a1; long long ans; char ch; struct point { int a, b; } s[1000005]; struct node { int l, r; long long add, sum, ma; node ch[2]; } nil, *root; long long gets() { long long v = 0; bool f = 0; char ch; while (!isdi...
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; n--; k--; int arr[n]; for (int i = 0; i < n; i++) cin >> arr[i]; int count = 0; int flag = 0; while (count <= k) { if (count == k) { flag = 1; break; } count += a...
#include <bits/stdc++.h> int main() { int team1, team2; std::string s; std::cin >> s; team1 = s.find( 1111111 ); team2 = s.find( 0000000 ); if (team1 >= 0 \|\| team2 >= 0) { std::cout << YES ; } else std::cout << NO ; }
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 7; const int M = 1 << 18; int n, m; string s; set<int> S[256]; int sub[2 * M]; void insert(int a) { a += M - 1; while (a) { --sub[a]; a /= 2; } } int kth(int k, int v = 1, int l = 1, int r = M) { if (l == r...
#include <bits/stdc++.h> int main() { char a[100009], c; int j = 0, i; while ((c = getchar()) != n ) { if (j == 0) { a[j] = c; j++; } else { if (a[j - 1] == c) { j--; } else { a[j] = c; j++; } } } if (j == 0)...
#include <bits/stdc++.h> using namespace std; int ans = 123422412; int n, a, b, x, y; void dfs(int r, int x, int y, int ret) { if (x < 0 \|\| y < 0) return; if (r < 0) return; if (x == 0 && y == 0) { ans = min(ans, ret); return; } dfs(r - a, x - 1, y, ret); dfs(n - a, x - 1, y,...
#include <bits/stdc++.h> using namespace std; const int MAXN = 200005; const int mod = 1e9 + 7; struct Node { int x, y, z; Node() {} Node(int _x, int _y, int _z) { x = _x; y = _y; z = _z; if (x < y) swap(x, y); if (x < z) swap(x, z); if (y < z) swap(y, z); } ...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); long long n, p, w, d; cin >> n >> p >> w >> d; bool been[int(1e5)] = {}, can = 0; long long cnt = p / w, dif = 0; while (cnt >= 0) { dif = p - cnt * w; if (been[dif % d]) break; ...
#include<bits/stdc++.h> #define maxn 20010 using namespace std; int n, m, a[maxn]; int lg[maxn], mx[maxn][21], f[maxn][35][21], s[35], t[35]; int mxx(int x,int y){return x+a[x]>y+a[y]?x:y;} int qry(int x,int y){return mxx(mx[x][lg[y-x+1]],mx[y-(1<<lg[y-x+1])+1][lg[y-x+1]]);} int main() { lg[0]...
#include <bits/stdc++.h> using namespace std; long long a[100001]; long long b[100001]; int main() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); int n; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; map<int, int> cnt; vector<int> q; int loc = 0; for (int ...
#include <bits/stdc++.h> using namespace std; int cal(int a, int b, int ba) { int x[100], xl, y[100], yl, i, z[100]; memset(x, 0, sizeof x); memset(y, 0, sizeof y); memset(z, 0, sizeof z); xl = yl = 0; while (a > 0) { x[xl++] = a % 10; a /= 10; } while (b > 0) { y[y...
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 50; const long long oo = 1e18; const long long mod = 1e9 + 7; int a[N], sum[2 * N]; int main() { int n, m; cin >> n >> m; for (int i = 0; i < n; i++) cin >> a[i]; int cur = n; long long ans = 0; sum[cur] = 1; long ...
#include <bits/stdc++.h> using namespace std; template <class T> bool umin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } template <class T> bool umax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } int arr[300009], b[300009]; vector<p...
#include <bits/stdc++.h> using namespace std; const int mod = 998244353; int main() { int n, k, sol = 0; cin >> n >> k; vector<int> a(n); for (int i = 0; i < n; i++) cin >> a[i]; sort(a.begin(), a.end()); int maxB = (a[n - 1] - a[0]) / (k - 1); vector<int> ble(maxB + 2); vector<vec...
#include <bits/stdc++.h> using namespace std; long long ans; long long arr[300005][8]; long long a, b; bool ok(long long mid, long long n, long long m) { long long mx = (1LL << m) - 1; long long cnt[mx + 1]; for (int i = 0; i <= mx; i++) cnt[i] = 0; for (int i = 0; i < n; i++) { long lon...
#include <bits/stdc++.h> using namespace std; long long best; int n, m, k; int main() { cin >> n >> m >> k; if (k > n + m - 2) cout << -1 << endl; else { for (int area = 1; area <= (int)sqrt(n); area++) { int x = n / area; if (n / x == area) { int cut = min(k, x...
#include <bits/stdc++.h> #pragma warning(disable : 4996) using namespace std; long long dyn[5001][5001]; int A[300000]; int main() { int n, k; scanf( %d , &(n)); scanf( %d , &(k)); for (int(i) = 0; (i) < n; (i)++) scanf( %d , &(A[i])); sort(A, A + n); int rem = n % k; int q = n / k...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; const int MAX = 1e9 + 5; long long i, j, k, n, m, RIGHT[N], LEFT[N], ans, a[N]; long long _RIGHT[N], _LEFT[N]; int main() { scanf( %lld , &n); for (int i = 1; i <= n - 1; i++) scanf( %lld , &a[i]); for (int i = n; i >= 1; i--) ...
#include <bits/stdc++.h> using namespace std; int main() { long long n, m, c0, d0; cin >> n >> m >> c0 >> d0; long long a[m + 4], b[m + 5], c[m + 5], d[m + 5]; for (int i = 1; i <= m; i++) { cin >> a[i] >> b[i] >> c[i] >> d[i]; a[i] /= b[i]; } c[0] = c0; a[0] = 1005; long...
#include <bits/stdc++.h> using namespace std; int main() { int mohin, a, b, c; cin >> a >> b >> c; mohin = 0; for (int i = 1; i <= c; i++) { mohin += 2 * ((a - 4 * (i - 1)) + (b - 4 * (i - 1))) - 4; } cout << mohin << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int a, b, c, l; long long Ans; int main() { cin >> a >> b >> c >> l; for (int i = 0; i <= l; i++) { long long lim = (a + b + c + i - 1) / 2; if (a <= lim && b <= lim && c <= lim) { Ans += (long long)(i + 2) * (i + 1) / 2; if (a + ...
#include <bits/stdc++.h> using namespace std; char n[1000100]; char b[1000100]; int main() { long long result, last, i, B, c, BB[10]; int re, C; while (scanf( %s %s %d , b, n, &C) != EOF) { c = C; B = 0; for (i = 0; b[i]; i++) B = (B * 10 + b[i] - 0 ) % c; if (B == 0) B = c;...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; const int N = 100005; int i, n, k, x, y, lvl[N]; vector<int> g[N]; queue<int> q; int main() { ios_base::sync_with_stdio(0); memset(lvl, -1, si...
#include <bits/stdc++.h> using namespace std; double ans = 0.0F; int n, d, m[101] = {0}, r[101] = {0}; int tmp = 0; int main(int argc, char argv, char env) { cin >> n; for (int i = 1; i <= n; ++i) { cin >> m[i]; } for (int i = 1; i <= n; ++i) { cin >> r[i]; } for (int i...
#include <bits/stdc++.h> using namespace std; int n, m, x[200001], y[200001], tag[200001], fi[200001 << 1], nt[200001 << 1], go[200001 << 1], root; int cnt, top, low[200001], dfn[200001], id[200001], deg[200001], st[200001], ans, cntx, sum, maxx; void add(int u, int v) { nt[++cnt] = fi[u]; f...
#include <bits/stdc++.h> using namespace std; template <typename T> inline bool cmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; } template <typename T> inline bool cmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } const int MaxN = 205; unsigned int n, d, M, c[MaxN][MaxN], f[MaxN][M...
#include <bits/stdc++.h> using namespace std; int main() { long long n, a, b, i, j; cin >> n >> a >> b; for (i = 0; i <= 10000000; i++) { if (n - a * i >= 0) { if ((n - a * i) % b == 0) { cout << YES << n ; cout << i << << (n - a * i) / b; ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 3e5 + 5; int N, M, K; int A[MAXN]; long long P, H; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> N; for (int i = 1; i <= N; i++) { cin >> P; A[i] = A[i - 1] + __builtin_popcountll(P); ...
#include <bits/stdc++.h> using namespace std; bool exceed(long long x, long long y, long long m) { return x >= m / y + 1; } long long n, k; string s; long long dp[1005][2005]; int zero = 1002; int main(void) { ios::sync_with_stdio(0); cin >> n >> k >> s; s = # + s; for (long long(i) = (0...
#include <bits/stdc++.h> using namespace std; const int N = 200005; int n, log2n, q, C[N], L[N], R[N], tot = 0, f[N][25], up[N], de2[N]; long long de[N]; struct node { long long min, sign; } a[N * 4]; pair<int, int> E[2 * N]; vector<pair<int, int> > e[N]; void add1(int x, int k) { for (; x <= ...
#include <bits/stdc++.h> const long long pinf = ((long long)2e18); const long long ninf = ((long long)-2e18); const long long mod = 1000000007; using namespace std; long long power(long long x, long long n, long long M) { if (n == 0) return 1; else if (n % 2 == 0) return power((x * x) % M,...
#include <bits/stdc++.h> #pragma comment(linker, /stack:256000000 ) #pragma gcc optimize( O3 ) #pragma gcc target( sse4 ) using namespace std; mt19937 rng(2391); mt19937 gnr(chrono::high_resolution_clock::now().time_since_epoch().count()); template <typename A> istream& operator>>(istream& fin, vector<...
#include <bits/stdc++.h> using namespace std; int n, m, Magic, md, pd; int a[99], b[99], cnt[99], row[99], col[99]; int t[99][99]; void giveans() { printf( %d n , Magic); for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) printf( %d%c , t[i][j], n [j + 1 == n]); exit(0); } void d...
#include <bits/stdc++.h> using namespace std; const int INF = 0x0FFFFFFF; const long long INFLL = 0x0FFFFFFFFFFFFFFFll; const int MAXN = 300005; int n, m, x, y; vector<int> g[MAXN]; int ans[MAXN]; int getenemies(int i) { int c = 0; for (size_t j = 0; j < g[i].size(); j++) if (ans[g[i][j]] ...
#include <bits/stdc++.h> using namespace std; const int N = 300010; map<pair<int, int>, int> mp; struct point { int first, second; int l, r; point() {} point(int first, int second, int l, int r) : first(first), second(second), l(l), r(r) {} }; long long ans[N << 1]; long long sum; ...
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const int maxn = 10105; int n, b, q, st, ed; int First[maxn], cnt, dis[maxn]; struct edge { int to, Next, flow, c; } Tree[maxn * 100]; void init() { cnt = 0; memset(First, -1, sizeof(First)); } void addedge(int fro...
#include <bits/stdc++.h> using namespace std; long long arr[10000001]; int main() { long long d = 1; arr[0] = 0; for (int i = 1; i < 10000001; i++) { arr[i] = arr[i - 1] + d; d += 2; } int t; cin >> t; for (int i = 0; i < t; i++) { int n, k; cin >> n >> k; ...
#include <bits/stdc++.h> using namespace std; int main() { string s; long long i; long long n; cin >> n; cin >> s; long long arr[27]; for (i = 0; i < 26; i++) { arr[i] = 0; } for (i = 0; i < s.length(); i++) { arr[s[i] - a ]++; } long long cnt = 0; if (n ...

#include <bits/stdc++.h> void sc(int &x) { scanf( %d , &x); } void sc(int &x, int &y) { scanf( %d%d , &x, &y); } void sc(int &x, int &y, int &z) { scanf( %d%d%d , &x, &y, &z); } void sc(long long &x) { scanf( %lld , &x); } void sc(long long &x, long long &y) { scanf( %lld%lld , &x, &y); } void sc(long long ...

#include <bits/stdc++.h> using namespace std; int n, q, cnt, k, m, r, ans; int fa[21][100010], dep[100010], st[100010], ed[100010], h[100010]; int f[100010][310]; int t[100010]; bool vis[100010]; struct node { int id, num; bool operator<(const node &T) const { return num < T.num; } } s[100010]; ...

#include <bits/stdc++.h> #pragma GCC target( avx2 ) #pragma GCC optimization( O3 ) #pragma GCC optimization( unroll-loops ) #pragma GCC optimize( Ofast ) #pragma GCC target( avx,avx2,fma ) using namespace std; long long binpow(long long base, long long exp, int mod) { long long res = 1; while (exp...

#include <bits/stdc++.h> const double PI = 3.141592653589793238460; using namespace std; vector<int> d; vector<int> l; vector<int> r; vector<int> u; bool isPossibleL(string st) { for (char ch : st) { for (int n : l) if (ch - 0 == n) return false; } return true; } bool isPos...

#include <bits/stdc++.h> using namespace std; vector<vector<int>> statues(8); vector<vector<char>> MAT(8, vector<char>(8)); vector<vector<vector<bool>>> VIS(8, vector<vector<bool>>(8, vector<bool>(10, false))); vector<p...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:102400000,102400000 ) using namespace std; const double eps = 10e-10; const int mod = 1000000007; const int maxn = 300005; const int maxm = 10005; pair<int, int> ans[maxn]; int main() { int n, m, a; while (~scanf( %d%d , &n, &m)) { p...

#include <bits/stdc++.h> using namespace std; int N, M, neg, nsus; int ar[100002]; int cnt[100002]; int sus[100002]; int main() { scanf( %d%d , &N, &M); for (int i = 1; i <= N; i++) { scanf( %d , &ar[i]); if (ar[i] > 0) cnt[ar[i]]++; else { cnt[-ar[i]]--; ne...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, m; cin >> n >> m; long long a = 0; for (int i = 0; i < n; i++) { int k; cin >> k; a += k; } if (a == m) cout << YES ; else c...

#include <bits/stdc++.h> using namespace std; int main() { int fib; cin >> fib; cout << fib << << 0 << << 0; return 0; }

#include <bits/stdc++.h> using namespace std; const int mx = 1e2 + 10; const long long mod = 1e9 + 31; mt19937 mtrand(time(0)); int n, m; char s[2][1 << 12]; int mp[2][1 << 14]; int f[1 << 15], ans, pr[1 << 15]; int unfd(int x) { int r = x; while (r != f[r]) r = f[r]; int t; while (f[x...

#include <bits/stdc++.h> using namespace std; const long long maxn = 2e5 + 10; const long long INF = 1e18; const long long mod = 1e9 + 7; long long poww(long long a, long long b) { if (b == 0) return 1; long long x = poww(a, b / 2) % mod; if (b & 1) return (((x * x) % mod) * a) % mod; el...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int a, b, c, d; cin >> a >> b >> c >> d; if (a == 0 || b == 0 || c == 0) { int cnt = 0; if (a % 2 == 1) cnt++; if (b % 2 == 1) cnt++; if (c % 2 == 1) cnt++; ...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, sum = 0; long long ans = 0; cin >> n; char s[n]; cin >> (s + 1); map<int, int> f; f[0] = 1; for (int i = 1; i <= n; i++) { int tmp = s[i] - 0 ; ...

#include <bits/stdc++.h> using namespace std; long long n, a[300005], b1[500005], b2[500005], cnt = 0, pl[300005], c[300005], ans = 0, plc[300005], m, d, can[300005], r, ne[300005]; pair<int, int> p; pair<int, int> p1; pair<int, int> p2; map<pair<int, int>, int> m1; string s; int main() { ...

#include <bits/stdc++.h> using namespace std; template <typename T> struct BIT { int n; vector<T> dat; BIT(int n = 0) { initialize(n); } void initialize(int nin) { n = nin; dat.resize(n, 0); } T sum(int i) { T s = 0; while (i >= 0) { s += dat[i]; i =...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int arr[n]; int orig[n]; int product = 1; int counter = 0; for (int i = 0; i < n; i++) { cin >> arr[i]; orig[i] = arr[i]; if (arr[i] >= 0) { arr[i] = -arr[i] - 1; } if (arr[i...

#include <bits/stdc++.h> using namespace std; const int N = 200005; struct node { int index, val, team; }; node ni[N]; int divi[N], rest[N]; int main() { int n; scanf( %d , &n); for (int i = 0; i < n; ++i) { ni[i].index = i; scanf( %d , &ni[i].val); } sort(ni, ni + n, [...

#include <bits/stdc++.h> using namespace std; bool a[5][5]; int main() { for (int i = 1; i < 4; ++i) { for (int j = 1, x; j < 4; ++j) { a[i][j] ^= 1; cin >> x; a[i][j] ^= (x & 1); a[i + 1][j] ^= (x & 1); a[i - 1][j] ^= (x & 1); a[i][j + 1] ^= (x & 1); ...

#include <bits/stdc++.h> int main() { int n, m, i; float x, max = 0.0; scanf( %d%d , &n, &m); int s[n][2]; for (i = 0; i < n; i++) { scanf( %d%d , &s[i][0], &s[i][1]); x = (float)(s[i][0]) / s[i][1]; if (max == 0.0) { max = x; } if (max > x) { max = x;...

#include <bits/stdc++.h> using namespace std; struct node { int t, next; } a[800010]; struct hhhh { int l, r; } h[200010]; vector<pair<int, int> > v[400010]; vector<int> g[400010]; long long ans[400010]; int fa[400010], son[400010], dep[400010], top[400010], size[400010]; int fat[400010][20]...

#include <bits/stdc++.h> using namespace std; vector<int> h; vector<vector<int> > g; int h0, v0; vector<int> val; int it = 0; vector<bool> used; vector<int> treesum, par; vector<int> treemin; void update(int v, int l, int r, int ind, int d) { if (l == r) { treesum[v] += d; treemin[v]...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> l(n), r(n); for (int i = 0; i < n; i++) { cin >> l[i] >> r[i]; } int a = -1, b = -1; bool ok = true; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (!((l[i] <= ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int s = 0; for (int i = 0; i < 5; i++) { int x; cin >> x; s += x; } if (s % 5 || !s) cout << -1 ; else cout << s / 5; }

#include <bits/stdc++.h> using namespace std; const int MAXN = 100000 + 3; int N, Q, K; long long a[MAXN], sum[MAXN], save[MAXN]; int main() { scanf( %d , &N); memset((save), (-1), sizeof(save)); for (int i = 1; i <= N; ++i) scanf( %lld , &a[i]); sort(a + 1, a + 1 + N); for (int i = 1; i <...

#include <bits/stdc++.h> using namespace std; int cnt; string s; stack<int> st; int main() { cin >> s; for (int i = 0; i < s.size(); ++i) { if (s[i] == ( || s[i] == [ || s[i] == { || s[i] == < ) { st.push(int(s[i])); } else { if (st.empty()) { cout << Impo...

#include <bits/stdc++.h> using namespace std; int la, lb, cnt[20], ans[25]; char a[25], b[25]; void find(int v, bool flag) { if (v > lb) { for (int i = 1; i <= lb; i++) printf( %d , ans[i]); exit(0); } if (flag && cnt[b[v] - 0 ]) { cnt[b[v] - 0 ]--; ans[v] = b[v] - 0 ; ...

#include <bits/stdc++.h> using namespace std; long long n, ans, fact[200005]; long long pangkat(long long a, long long b) { if (b == 0) return 1; long long temp = pangkat(a, b / 2); if (b % 2 == 0) return (temp * temp) % 1000000007; return (((temp * temp) % 1000000007) * a) % 1000000007; } lon...

#include <bits/stdc++.h> using namespace std; const int MAXN = 48; long long s, x, xCopy, sCopy, pos[MAXN][2], result; int n, bitS, bitX; int main() { cin >> s >> x; pos[0][0] = 1; pos[0][1] = 0; n = 0; xCopy = x; sCopy = s; while (x || s) { n++; bitS = s % 2; bit...

#include <bits/stdc++.h> using namespace std; const int MAXN = 500100; const int root = 800; long long lazy[root]; unordered_set<long long> s[root]; long long v[MAXN]; signed main() { memset(lazy, 0, sizeof lazy); long long n, m; scanf( %lld %lld , &n, &m); for (long long i = 0; i < n; i++...

#include <bits/stdc++.h> using namespace std; int main() { int i = 0; char a; char A[] = hello ; while (cin >> a && a != n ) { if (a == A[i]) i++; } if (i == 5) cout << YES << endl; else cout << NO << endl; }

#include <bits/stdc++.h> using namespace std; int dx[] = {0, 0, 1, -1, 1, 1, -1, -1}; int dy[] = {1, -1, 0, 0, -1, 1, 1, -1}; const int mod = 1e9 + 7; int dcmp(long double x, long double y) { return fabs(x - y) <= 1e-12 ? 0 : x < y ? -1 : 1; } void fast() { std::ios_base::sync_with_stdio(0); c...

#include <bits/stdc++.h> using namespace std; struct fenwick { int N; vector<int> sum; void init(int n) { N = n + 1; sum.assign(N, 0); } void add(int i, int x) { for (i++; i < N; i += i & -i) { sum[i] += x; } } int get(int i) { int tot = 0; for...

#include <bits/stdc++.h> using namespace std; const int maxn = 510000; int f[maxn]; int n, d, up; int c[66]; int b[66]; int main() { cin >> n >> d; f[0] = 1; for (int i = 1; i <= n; i++) { int x; cin >> x; for (int j = (up += x); j >= x; j--) if (f[j - x]) f[j] = 1; ...

#include <bits/stdc++.h> using namespace std; using namespace std; const int MaxN = 100005, NA = -1, MaxC = 0x3F3F3F3F; int a[MaxN]; int n; multiset<int, greater<int> > s; deque<int> d; int main(void) { int i, v; multiset<int>::iterator it; while (scanf( %d , &n) != EOF) { for (i = 0;...

#include <bits/stdc++.h> using namespace std; template <typename T, typename U> std::pair<T, U> operator+(const std::pair<T, U>& l, const std::pair<T, U>& r) { return {l.first + r.first, l.second + r.second}; } typedef void (*callback_function)(void); const long long ZERO = 0LL; const long long INF64 ...

#include <bits/stdc++.h> using namespace std; template <class A, class B> inline bool mina(A &first, B second) { return (first > second) ? (first = second, 1) : 0; } template <class A, class B> inline bool maxa(A &first, B second) { return (first < second) ? (first = second, 1) : 0; } const int ...

#include <bits/stdc++.h> char s[1000000]; char ans[1000000]; int main() { int i, len, cnt; char max = 0; while (scanf( %s , s) != EOF) { max = 0; cnt = 1000000 - 1; len = strlen(s); for (i = len - 1; i >= 0; i--) { if (s[i] >= max) { max = s[i]; ans[...

#include <bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 228; vector<int> g[MAXN]; vector<bool> vis(MAXN); int n, m; int p[MAXN]; int col[MAXN], help[MAXN]; int t[4 * MAXN], lazy[4 * MAXN]; int tin[MAXN], tout[MAXN]; int timer; void dfs(int v) { vis[v] = 1; tin[v] = timer++; ...

#include <bits/stdc++.h> int main() { int num; int count = 0, i; int digitos[10]; scanf( %d , &num); int aux = num; for (i = 0; i < 10; i++) digitos[i] = 0; while (aux != 0) { digitos[aux % 10] = 1; aux = aux / 10; } if (num == 1) { printf( 1 n ); return 0; ...

#include <bits/stdc++.h> using namespace std; void solve() { int n, cnt = 0; scanf( %d , &n); for (int i = 1; i <= n; i++) { int x; scanf( %d , &x); cnt += x; } if (cnt * 2 <= n) { printf( %d n , n / 2); for (int i = 1; i <= n / 2; i++) printf( 0 ); printf( ...

#include <bits/stdc++.h> using namespace std; struct candy { candy(int t, int h, int m) { this->type = t; this->height = h; this->mass = m; } int type; int height; int mass; bool operator<(const candy &c) const { return this->mass < c.mass; } bool operator>(const candy ...

#include <bits/stdc++.h> using namespace std; int main() { int n, i; vector<char> v; string s; cin >> s; n = s.size(); char c[n], ch; i = n; ch = s[n - 1]; while (i--) { if (s[i] == ch) v.push_back(s[i]); else if (s[i] > ch) { v.push_back(s[i]); ...

#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( Ofast ) #pragma GCC target( avx,avx2,fma ) bool iseven(long long int n) { if ((n & 1) == 0) return true; return false; } void print(long long int t) { cout << t; } void print(int t) { cout << t; } void print(string t) { cout << ...

#include <bits/stdc++.h> int SequenceValue(char seq[], int *min_val) { int value = 0; *min_val = 0; char *it = seq; while (*it != 0 && *it != n ) { value += (*it == ( ) ? 1 : -1; if (value < *min_val) { *min_val = value; } it += 1; } return value; } ch...

#include <bits/stdc++.h> using namespace std; int main() { long long i; long long n, m, k, l; cin >> n >> m >> k >> l; long long no = 0; long long yes = 0; long long j = (l + k); long long ans = ((j - 1) / m) + 1; if (((ans * m)) > n) no = 1; if (no) cout << -1 ; else ...

#include <bits/stdc++.h> using namespace std; long long MOD(long long, long long); void doublesetprecision(double, int); bool isEven(long long); int gcd(int, int); int n, m, o, ans, k; int a[1000000]; void solve() { string s, t; cin >> s >> t; if (s == t) { cout << yes ; return;...

#include <bits/stdc++.h> using namespace std; vector<int> E[1 << 18]; pair<int, int> R[1 << 18]; int dfs(int a, int p, int d) { int cnt = 1; for (auto it = (E[a]).begin(); it != (E[a]).end(); ++it) { int b = *it; if (b == p) continue; cnt += dfs(b, a, d + 1); } R[a] = pair<int,...

#include <bits/stdc++.h> using namespace std; const int NMAX = 1e5 + 2; int n, last[NMAX], x, y; int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n; for (int query = 1; query <= n; query++) { cin >> x >> y; int ans = 0, autre; for (int d = 1; d * d <= x; d++) { ...

#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7, LIM = 1e5; unsigned long long int fact[2 * LIM + 1]; unsigned long long int binpow(long long int x, int y) { unsigned long long int res = 1; while (y > 0) { if (y & 1) res = (res * x) % MOD; y >>= 1; x = (x * x) % M...

#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; int n; int a[N]; int fa(int x) { for (int i = 0;; i++) if ((1 << i) >= x) return (1 << i) - x; } int dis(int x, int y) { int sum = 0; while (x != y) x > y ? x = fa(x) : y = fa(y), sum++; return sum; } int get(i...

#include <bits/stdc++.h> using namespace std; int main() { int n, x; cin >> n >> x; int cnt = 0; for (int j = 1; j * j <= x; j++) { if (x % j == 0) { if (j <= n && x / j <= n) { if (j * j == x) cnt++; else cnt += 2; } } } ...

#include <bits/stdc++.h> void printResult() {} int main(int argc, const char* argv[]) { std::ios::sync_with_stdio(false); int rows; bool possible = false; scanf( %d n , &rows); std::shared_ptr<std::vector<char*>> bus = std::make_shared<std::vector<char*>>(); if (rows > 0) { for...

#include <bits/stdc++.h> using namespace std; int main() { double d, h, v, e; cin >> d >> h >> v >> e; double pi = 2 * acos(0.0); double he = (4 * v) / (pi * d * d); if (he > e) { cout << YES n ; cout << setprecision(12) << (h) / (he - e); } else cout << NO ; return 0...

#include <bits/stdc++.h> using namespace std; char s[1000010]; int c[20]; int main() { int k; scanf( %d , &k); scanf( %s , s + 1); int n = strlen(s + 1); int sum = 0; int i; memset(c, 0, sizeof c); int ans = 0; for (i = 1; i <= n; i++) { c[s[i] - 0 ]++; sum += s[...

#include <bits/stdc++.h> using namespace std; char s[2505][5005]; int a[5000]; int c1[30], c2[30]; int dif[2505]; int main() { int k, n; scanf( %d%d , &k, &n); scanf( %s , s[0]); bool flag = false; for (int i = 0; i < n; ++i) { c1[s[0][i] - a ]++; if (c1[s[0][i] - a ] > 1) ...

#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const int maxn = 200011; const int INF = 1 << 25; const int logN = 18; int n; int a[maxn]; bool p[maxn]; int b[maxn]; bool used[maxn]; int main(int argc, char const *argv[]) { scanf( %d , &(n)); for (int(i) = 0; i < (in...

#include <bits/stdc++.h> int main() { int n, s, i, sum = 0, max = 0; scanf( %d %d , &n, &s); int arr[n]; for (i = 0; i < n; i++) { scanf( %d , &arr[i]); sum = sum + arr[i]; if (arr[i] > max) max = arr[i]; } if (sum - max > s) printf( NO ); else printf( YES ); ...

#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 7; int n, m, len, cnt1 = 0, cnt2 = 0, cnt3 = 0, fail[maxn]; long long ans = 0; struct Node { long long c; char ch; } s[maxn], str[maxn], _str[maxn]; bool ok(int i, int j) { if (_str[i].c != _str[j].c) return false; if (_s...

#include <bits/stdc++.h> #pragma GCC optimize(2) using namespace std; const int inf = 0x3f3f3f3f; const int mod = 998244353; using ll = long long; using vi = vector<int>; using pii = pair<int, int>; inline int read() { int x = 0, f = 1, c = getchar(); for (; !isdigit(c); c = getchar()) if ...

#include <bits/stdc++.h> using namespace std; int d[(1 << 17) + 20][100], par[(1 << 17) + 20][100]; int prime[20] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53}; int sum[70], a[100]; int ret, temp; int ans = 10000000; void pre() { for (int i = 1; i < 59; i++) { for (int j = 0; j ...

#include <bits/stdc++.h> using namespace std; const int N = 100005, inf = 2e9, n = 100000; struct seg { int fl[N << 2], m1[N << 2], m2[N << 2], sz[N << 2], tg[N << 2], c[N << 2]; long long tr[N << 2]; void build(int k, int l, int r) { fl[k] = 0; m1[k] = inf; m2[k] = 0; sz[k] = ...

#include <bits/stdc++.h> using namespace std; int main() { int n = 1, i, j = 0; string s, t; getline(cin, s); getline(cin, t); for (i = 0; i < t.length(); i++) { if (s[j] == t[i]) { n++; j++; } } cout << n; }

#include <bits/stdc++.h> using namespace std; int n, ma, a1; long long ans; char ch; struct point { int a, b; } s[1000005]; struct node { int l, r; long long add, sum, ma; node *ch[2]; } * nil, *root; long long gets() { long long v = 0; bool f = 0; char ch; while (!isdi...

#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; n--; k--; int arr[n]; for (int i = 0; i < n; i++) cin >> arr[i]; int count = 0; int flag = 0; while (count <= k) { if (count == k) { flag = 1; break; } count += a...

#include <bits/stdc++.h> int main() { int team1, team2; std::string s; std::cin >> s; team1 = s.find( 1111111 ); team2 = s.find( 0000000 ); if (team1 >= 0 || team2 >= 0) { std::cout << YES ; } else std::cout << NO ; }

#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 7; const int M = 1 << 18; int n, m; string s; set<int> S[256]; int sub[2 * M]; void insert(int a) { a += M - 1; while (a) { --sub[a]; a /= 2; } } int kth(int k, int v = 1, int l = 1, int r = M) { if (l == r...

#include <bits/stdc++.h> int main() { char a[100009], c; int j = 0, i; while ((c = getchar()) != n ) { if (j == 0) { a[j] = c; j++; } else { if (a[j - 1] == c) { j--; } else { a[j] = c; j++; } } } if (j == 0)...

#include <bits/stdc++.h> using namespace std; int ans = 123422412; int n, a, b, x, y; void dfs(int r, int x, int y, int ret) { if (x < 0 || y < 0) return; if (r < 0) return; if (x == 0 && y == 0) { ans = min(ans, ret); return; } dfs(r - a, x - 1, y, ret); dfs(n - a, x - 1, y,...

#include <bits/stdc++.h> using namespace std; const int MAXN = 200005; const int mod = 1e9 + 7; struct Node { int x, y, z; Node() {} Node(int _x, int _y, int _z) { x = _x; y = _y; z = _z; if (x < y) swap(x, y); if (x < z) swap(x, z); if (y < z) swap(y, z); } ...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); long long n, p, w, d; cin >> n >> p >> w >> d; bool been[int(1e5)] = {}, can = 0; long long cnt = p / w, dif = 0; while (cnt >= 0) { dif = p - cnt * w; if (been[dif % d]) break; ...

#include<bits/stdc++.h> #define maxn 20010 using namespace std; int n, m, a[maxn]; int lg[maxn], mx[maxn][21], f[maxn][35][21], s[35], t[35]; int mxx(int x,int y){return x+a[x]>y+a[y]?x:y;} int qry(int x,int y){return mxx(mx[x][lg[y-x+1]],mx[y-(1<<lg[y-x+1])+1][lg[y-x+1]]);} int main() { lg[0]...

#include <bits/stdc++.h> using namespace std; long long a[100001]; long long b[100001]; int main() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); int n; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; map<int, int> cnt; vector<int> q; int loc = 0; for (int ...

#include <bits/stdc++.h> using namespace std; int cal(int a, int b, int ba) { int x[100], xl, y[100], yl, i, z[100]; memset(x, 0, sizeof x); memset(y, 0, sizeof y); memset(z, 0, sizeof z); xl = yl = 0; while (a > 0) { x[xl++] = a % 10; a /= 10; } while (b > 0) { y[y...

#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 50; const long long oo = 1e18; const long long mod = 1e9 + 7; int a[N], sum[2 * N]; int main() { int n, m; cin >> n >> m; for (int i = 0; i < n; i++) cin >> a[i]; int cur = n; long long ans = 0; sum[cur] = 1; long ...

#include <bits/stdc++.h> using namespace std; template <class T> bool umin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } template <class T> bool umax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } int arr[300009], b[300009]; vector<p...

#include <bits/stdc++.h> using namespace std; const int mod = 998244353; int main() { int n, k, sol = 0; cin >> n >> k; vector<int> a(n); for (int i = 0; i < n; i++) cin >> a[i]; sort(a.begin(), a.end()); int maxB = (a[n - 1] - a[0]) / (k - 1); vector<int> ble(maxB + 2); vector<vec...

#include <bits/stdc++.h> using namespace std; long long ans; long long arr[300005][8]; long long a, b; bool ok(long long mid, long long n, long long m) { long long mx = (1LL << m) - 1; long long cnt[mx + 1]; for (int i = 0; i <= mx; i++) cnt[i] = 0; for (int i = 0; i < n; i++) { long lon...

#include <bits/stdc++.h> using namespace std; long long best; int n, m, k; int main() { cin >> n >> m >> k; if (k > n + m - 2) cout << -1 << endl; else { for (int area = 1; area <= (int)sqrt(n); area++) { int x = n / area; if (n / x == area) { int cut = min(k, x...

#include <bits/stdc++.h> #pragma warning(disable : 4996) using namespace std; long long dyn[5001][5001]; int A[300000]; int main() { int n, k; scanf( %d , &(n)); scanf( %d , &(k)); for (int(i) = 0; (i) < n; (i)++) scanf( %d , &(A[i])); sort(A, A + n); int rem = n % k; int q = n / k...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; const int MAX = 1e9 + 5; long long i, j, k, n, m, RIGHT[N], LEFT[N], ans, a[N]; long long _RIGHT[N], _LEFT[N]; int main() { scanf( %lld , &n); for (int i = 1; i <= n - 1; i++) scanf( %lld , &a[i]); for (int i = n; i >= 1; i--) ...

#include <bits/stdc++.h> using namespace std; int main() { long long n, m, c0, d0; cin >> n >> m >> c0 >> d0; long long a[m + 4], b[m + 5], c[m + 5], d[m + 5]; for (int i = 1; i <= m; i++) { cin >> a[i] >> b[i] >> c[i] >> d[i]; a[i] /= b[i]; } c[0] = c0; a[0] = 1005; long...

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

#include <bits/stdc++.h> using namespace std; int a, b, c, l; long long Ans; int main() { cin >> a >> b >> c >> l; for (int i = 0; i <= l; i++) { long long lim = (a + b + c + i - 1) / 2; if (a <= lim && b <= lim && c <= lim) { Ans += (long long)(i + 2) * (i + 1) / 2; if (a + ...

#include <bits/stdc++.h> using namespace std; char n[1000100]; char b[1000100]; int main() { long long result, last, i, B, c, BB[10]; int re, C; while (scanf( %s %s %d , b, n, &C) != EOF) { c = C; B = 0; for (i = 0; b[i]; i++) B = (B * 10 + b[i] - 0 ) % c; if (B == 0) B = c;...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; const int N = 100005; int i, n, k, x, y, lvl[N]; vector<int> g[N]; queue<int> q; int main() { ios_base::sync_with_stdio(0); memset(lvl, -1, si...

#include <bits/stdc++.h> using namespace std; double ans = 0.0F; int n, d, m[101] = {0}, r[101] = {0}; int tmp = 0; int main(int argc, char** argv, char** env) { cin >> n; for (int i = 1; i <= n; ++i) { cin >> m[i]; } for (int i = 1; i <= n; ++i) { cin >> r[i]; } for (int i...

#include <bits/stdc++.h> using namespace std; int n, m, x[200001], y[200001], tag[200001], fi[200001 << 1], nt[200001 << 1], go[200001 << 1], root; int cnt, top, low[200001], dfn[200001], id[200001], deg[200001], st[200001], ans, cntx, sum, maxx; void add(int u, int v) { nt[++cnt] = fi[u]; f...

#include <bits/stdc++.h> using namespace std; template <typename T> inline bool cmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; } template <typename T> inline bool cmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } const int MaxN = 205; unsigned int n, d, M, c[MaxN][MaxN], f[MaxN][M...

#include <bits/stdc++.h> using namespace std; int main() { long long n, a, b, i, j; cin >> n >> a >> b; for (i = 0; i <= 10000000; i++) { if (n - a * i >= 0) { if ((n - a * i) % b == 0) { cout << YES << n ; cout << i << << (n - a * i) / b; ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 3e5 + 5; int N, M, K; int A[MAXN]; long long P, H; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> N; for (int i = 1; i <= N; i++) { cin >> P; A[i] = A[i - 1] + __builtin_popcountll(P); ...

#include <bits/stdc++.h> using namespace std; bool exceed(long long x, long long y, long long m) { return x >= m / y + 1; } long long n, k; string s; long long dp[1005][2005]; int zero = 1002; int main(void) { ios::sync_with_stdio(0); cin >> n >> k >> s; s = # + s; for (long long(i) = (0...

#include <bits/stdc++.h> using namespace std; const int N = 200005; int n, log2n, q, C[N], L[N], R[N], tot = 0, f[N][25], up[N], de2[N]; long long de[N]; struct node { long long min, sign; } a[N * 4]; pair<int, int> E[2 * N]; vector<pair<int, int> > e[N]; void add1(int x, int k) { for (; x <= ...

#include <bits/stdc++.h> const long long pinf = ((long long)2e18); const long long ninf = ((long long)-2e18); const long long mod = 1000000007; using namespace std; long long power(long long x, long long n, long long M) { if (n == 0) return 1; else if (n % 2 == 0) return power((x * x) % M,...

#include <bits/stdc++.h> #pragma comment(linker, /stack:256000000 ) #pragma gcc optimize( O3 ) #pragma gcc target( sse4 ) using namespace std; mt19937 rng(2391); mt19937 gnr(chrono::high_resolution_clock::now().time_since_epoch().count()); template <typename A> istream& operator>>(istream& fin, vector<...

#include <bits/stdc++.h> using namespace std; int n, m, Magic, md, pd; int a[99], b[99], cnt[99], row[99], col[99]; int t[99][99]; void giveans() { printf( %d n , Magic); for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) printf( %d%c , t[i][j], n [j + 1 == n]); exit(0); } void d...

#include <bits/stdc++.h> using namespace std; const int INF = 0x0FFFFFFF; const long long INFLL = 0x0FFFFFFFFFFFFFFFll; const int MAXN = 300005; int n, m, x, y; vector<int> g[MAXN]; int ans[MAXN]; int getenemies(int i) { int c = 0; for (size_t j = 0; j < g[i].size(); j++) if (ans[g[i][j]] ...

#include <bits/stdc++.h> using namespace std; const int N = 300010; map<pair<int, int>, int> mp; struct point { int first, second; int l, r; point() {} point(int first, int second, int l, int r) : first(first), second(second), l(l), r(r) {} }; long long ans[N << 1]; long long sum; ...

#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const int maxn = 10105; int n, b, q, st, ed; int First[maxn], cnt, dis[maxn]; struct edge { int to, Next, flow, c; } Tree[maxn * 100]; void init() { cnt = 0; memset(First, -1, sizeof(First)); } void addedge(int fro...

#include <bits/stdc++.h> using namespace std; long long arr[10000001]; int main() { long long d = 1; arr[0] = 0; for (int i = 1; i < 10000001; i++) { arr[i] = arr[i - 1] + d; d += 2; } int t; cin >> t; for (int i = 0; i < t; i++) { int n, k; cin >> n >> k; ...

#include <bits/stdc++.h> using namespace std; int main() { string s; long long i; long long n; cin >> n; cin >> s; long long arr[27]; for (i = 0; i < 26; i++) { arr[i] = 0; } for (i = 0; i < s.length(); i++) { arr[s[i] - a ]++; } long long cnt = 0; if (n ...