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

func_code_string stringlengths 59 71.4k
#include <bits/stdc++.h> using namespace std; int a[4000000]; int f[4000000]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; } int s, t; cin >> s >> t; s--; t--; long long ans = 0; for (int i = s; i < t; i++) ans += a[i]; long long num ...
#include <bits/stdc++.h> inline long long MAX2(long long a, long long int b) { return (a) > (b) ? (a) : (b); } inline long long MAX3(long long a, long long b, long long c) { return (a) > (b) ? ((a) > (c) ? (a) : (c)) : ((b) > (c) ? (b) : (c)); } inline long long MIN2(long long a, long long b) { re...
#include <bits/stdc++.h> using namespace std; int main() { long long n, sum = 0; cin >> n; sum = n; for (int i = 2; i <= n; i++) { while (n % i == 0) { sum += n / i; n /= i; } } cout << sum << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1e4 + 5; int a[N], b[N]; long long check(long long x, int n, int c) { long long ans = 0; for (int i = 1; i <= n; ++i) { ans += x * a[i] / b[i] + 1; if (ans > c) ans = c + 1; } return ans; } int main() { int n, c; ...
#include <bits/stdc++.h> using namespace std; template <class T> T abs(T x) { return x > 0 ? x : -x; } int m; int n; map<int, int> id; int rev[100500]; int a[2]; int w[100500], ans[100500]; set<int> s; set<int> ss; void go(int x) { w[x] = 1; x = rev[x]; s.insert(x); for (in...
#include <bits/stdc++.h> using namespace std; int main() { int tc; cin >> tc; while (tc-- > 0) { int arr[7]; for (int i = 0; i < 7; i++) { cin >> arr[i]; } cout << arr[0] << << arr[1] << << arr[6] - arr[0] - arr[1] << endl; } }
#include <bits/stdc++.h> using namespace std; long long int gcd(long long int a, long long int b) { return b == 0 ? a : gcd(b, a % b); } long long int power(long long int x, long long int n) { long long int result = 1; while (n > 0) { if (n % 2 == 1) result = (result * x) % 1000000007; x...
#include <bits/stdc++.h> using namespace std; int main() { long long n, arr[100000], arr1[100000]; cin >> n; string s = ; for (int x = 0; x < n; x++) cin >> arr[x], arr1[x] = arr[x]; sort(arr1, arr1 + n); for (int x = 0; x <= arr1[n - 1]; x++) { for (int y = 0; y < n - 1; y++) { ...
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using pii = pair<int, int>; const int maxn = 1e5 + 10; const int mod = 1e9 + 7; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); ll pwr(ll a, ll pw) { ll ret = 1; while (pw > 0) { ...
#include <bits/stdc++.h> using namespace std; using LL = long long; constexpr int N = 2e5 + 5; vector<int> E[N]; LL Size[N], Dep[N]; int ord[N]; int tourism[N]; void dfs(int x, int p, int lvl) { Size[x] = 1; Dep[x] = lvl; for (const int &to : E[x]) { if (to == p) continue; dfs(to...
#include <bits/stdc++.h> using namespace std; const int N = 200009; const long long mod = 1e9 + 7; char s[N]{}; long long prea[N]; long long pref[N]; long long sac[N]; long long saf[N]; long long ksm(int n, int y) { if (y < 1) return 1; long long x = n; long long ret = 1; while (y) { ...
#include <bits/stdc++.h> using namespace std; long long n, cr; bool f = 0; pair<long long, long long> a[25], b[25], c[25]; void gen(long long i, long long s1, long long s2) { if (i == n) { if (s1 != s2) cr++; } else { gen(i + 1, s1 + a[i].first, s2 + c[i].first); gen(i + 1, s1, s2); ...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { long long a, b, x, y, n; cin >> a >> b >> x >> y >> n; long long a1 = a, b1 = b, n1 = n; long long an = a - x, bn = b - y; b -= min(bn, n); n -= min(bn, n); a -= min(an, n)...
#include <bits/stdc++.h> template <class T> inline void read(T &x) { x = 0; register char c = getchar(); register bool f = 0; while (!isdigit(c)) f ^= c == - , c = getchar(); while (isdigit(c)) x = x * 10 + c - 0 , c = getchar(); if (f) x = -x; } template <class T> inline void print(...
#include <bits/stdc++.h> using namespace std; long long int cost(long long int x[], long long int a, long long int n, long long int r, long long int m, long long int val) { long long int pos = 0; long long int neg = 0; for (int i = 0; i < n; i++) { if (x[i] > val) pos ...
#include <bits/stdc++.h> using namespace std; template <typename TYPE> inline void chkmax(TYPE &first, TYPE second) { first < second ? first = second : 0; } template <typename TYPE> inline void chkmin(TYPE &first, TYPE second) { second < first ? first = second : 0; } template <typename TYPE> v...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 5; const int inf = 0x3f3f3f3f; int t, n; int a[200]; int main() { int n, q, t, k, d; int cnt; int sum; memset(a, 0, sizeof a); cin >> n >> q; for (int i = 0; i < q; i++) { cnt = 0; sum = 0; cin >> ...
#include <bits/stdc++.h> using namespace std; int a[110]; int b[110]; int main() { string s; getline(cin, s); int num = 0, ten = 1; for (int i = s.size() - 1; i >= 0; i--) { if (s[i] == = ) break; if (s[i] <= 9 && s[i] >= 0 ) { int x = s[i] - 0 ; num += x * ten; ...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); int n, x; cin >> n >> x; long long sum = 0; for (int i = 0; i < n; i++) { long long a; cin >> a; sum += a; } if (sum + n - 1 == x) return 0 * puts( YES ); puts( NO ); return ...
#include <bits/stdc++.h> #pragma GCC target( avx2 ) #pragma GCC optimize( O3 ) #pragma GCC optimize( unroll-loops ) using namespace std; using ll = long long; using lld = long double; using vll = int64_t; int main() { map<int, pair<int, int> > hm; int a[] = {4, 8, 15, 16, 23, 42}; for (int i...
#include <bits/stdc++.h> using namespace std; int n; string s; int dp[111][55][222][3]; int res; void dfs(int pos, int left, int x, int dx) { if (dp[pos][left][x + 100][dx + 1]) return; dp[pos][left][x + 100][dx + 1] = 1; if (pos == s.size()) { if (left == 0) res = max(res, abs(x)); ...
#include <bits/stdc++.h> using namespace std; int hv[5]; map<string, int> dys; string dyi[5] = { S , M , L , XL , XXL }; int order[5][5] = {{0, 1, 2, 3, 4}, {1, 2, 0, 3, 4}, {2, 3, 1, 4, 0}, {3, 4, 2, 1, 0}, {4, 3, 2, 1, 0...
#include <bits/stdc++.h> using namespace std; int main() { int n, i, a, k = 0; vector<int> v; cin >> n; for (i = 0; i < n; i++) { cin >> a; v.push_back(a); } sort(v.begin(), v.end(), greater<int>()); for (i = 0; i <= n - 3; i++) { if (v[i] < v[i + 1] + v[i + 2]) k++; ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); double l, p, q; cin >> l >> p >> q; cout << setprecision(9) << (p * l) / (p + q); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; vector<int> result; for (int i = 0; i < t; i++) { int b, p, f, h, c; cin >> b >> p >> f >> h >> c; int res = 0; b /= 2; if (h > c) { if (b - p > 0) { res += p * h; b ...
#include <bits/stdc++.h> using namespace std; int main() { int t, n; cin >> t; while (t--) { cin >> n; cout << n / 2 << endl; } }
#include <bits/stdc++.h> using namespace std; long long x; int getAdded(long long n) { int lo = 1, hi = 10000000; while (lo < hi) { long long mid = (lo + hi) / 2 + (lo + hi) % 2; long long temp = (mid * mid + mid) / 2; if (temp == n) return mid; else if (temp < n) l...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:100000000000,100000000000 ) using namespace std; const long long inf = 1e18 + 7; const long long mod = 1e9 + 7; const double eps = 1e-12; const double PI = 2 * acos(0.0); const double E = 2.71828; int n; long long a[1000005]; long long d[10000...
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using u32 = unsigned int; using u64 = unsigned long long; char buf[10]; void NO() { puts( Impossible ); exit(0); } ll update(ll x, ll c) { if (x == LLONG_MAX \|\| x == LLONG_MIN) return x; return ...
#include <bits/stdc++.h> using namespace std; vector<int> g[300005]; int cnt[300005]; int vis[300005]; int ans[300001][26]; int res = 0; int main() { queue<int> q; int n, m; cin >> n >> m; string s; cin >> s; int x, y; while (m--) { scanf( %d%d , &x, &y); x--, y--; ...
#include <bits/stdc++.h> using namespace std; int c[4100]; int s[4100]; vector<long long> g; string str; int main() { long long a; cin >> a; cin >> str; int len = str.length(); for (int i = 0; str[i]; i++) c[i + 1] = str[i] - 0 ; for (int i = 1; i <= len; i++) { s[i] = s[i - 1...
#include <bits/stdc++.h> using namespace std; int n, m; int l[100005], r[100005], q[100005]; struct node { int v, add; }; node t[4 * 100005]; const int MX = (1LL << 31) - 1; void Push(int v, int tl, int tm, int tr) { if (t[v].add != 0) { t[2 * v].add \|= t[v].add; t[2 * v].v \|= t[v].a...
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int n = s.length(), cur = 1, best = 1; s += s; for (size_t i = 1; i < s.size(); i++) if (s[i] != s[i - 1]) cur++; else { best = max(best, cur); cur = 1; } best = max(best,...
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 10; struct Segment { int left, right; } seg[N / 2 + 5]; map<int, bool> m; int a[N]; int n, ans; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); m.clear(); ans = 1; seg[ans].left = 1; ...
#include <bits/stdc++.h> using namespace std; string CHECK(long long n) { long long t, temp = n, zero = 0, ans = 0, flag = 0; while (temp != 0) { t = temp % 10; if (t == 0 && flag == 0) zero++; else { flag = 1; ans *= 10; ans += t; } temp /= 10; ...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int ans = 0; string str; cin >> str; for (int s = 2; s <= n; s++) { for (int i = 0; i < n - s + 1; i++) { int u = 0, d = 0, l = 0, r = 0; for (int j = i; j < i + s; j++) { if (str[j] =...
#include <bits/stdc++.h> using namespace std; long long a[1000050]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; } sort(a, a + n); long long rec = 0; long long num = a[0]; long long have = 0; long long can = 0; for (int i = 0; i < n; i++) {...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, m; cin >> n >> m; vector<vector<int>> p(n + 1, vector<int>(m + 1, 0)); vector<int> ma(m + 1); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { cin >...
#include <bits/stdc++.h> using namespace std; using ll = long long; bool dfs(int x, const vector<vector<int>> &g, vector<char> &used, vector<int> &match, vector<int> &rev_match) { if (used[x]) return false; used[x] = 1; for (int dest : g[x]) { if (match[dest] == -1 \|\| dfs(match[dest],...
#include <bits/stdc++.h> using namespace std; const long long MOD = (long long)(1000000007); const double eps = 1e-9; const double pi = 3.1415926535897932384626; long long gcd(long long a, long long b) { return (b ? gcd(b, a % b) : a); } bool isprime(int n) { if (n == 1) return false; for (long long...
#include <bits/stdc++.h> using namespace std; long long t, n, i, j, k, x, y, z, ans, l, r, mid, s, q; long long a[100005], b[100005], c[100005], d[100005], p[100005], dp[100005][20]; vector<long long> v[100005], u[100005]; map<pair<int, int>, int> m; void dfs(int x, int y, int z) { dp[x][0] = y; d[x...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int mi[n]; for (int i = (0); i < (n); i++) mi[i] = 1e9; int t = 1; int z[1000]; do { t *= 2; vector<int> v; int x = 0; while (x < n) { int f = 0; for (int i = (0); i < (t /...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); int t; cin >> t; while (t--) { int n; cin >> n; int sze = n * 2; int arr[sze]; for (int i = 0; i < sze; i++) cin >> arr[i]; sort(arr, arr + sze); cout << arr[n] - ar...
#include <bits/stdc++.h> int n, m; int a[202], b[202]; int main() { scanf( %d %d , &n, &m); for (int i = 0; i < n; ++i) { scanf( %d , &a[i]); } for (int i = 0; i < m; ++i) { scanf( %d , &b[i]); } for (int w = 0; w <= 1 << 9; ++w) { int o = 0; for (int i = 0; i < n; ...
#include <bits/stdc++.h> using namespace std; const long long is_query = -(1LL << 62); struct line { long long m, b; mutable function<const line()> succ; bool operator<(const line& rhs) const { if (rhs.b != is_query) return m < rhs.m; const line s = succ(); if (!s) return 0; ...
#include <bits/stdc++.h> using namespace std; template <class T> inline void read(T& x) { bool fu = 0; char c; for (c = getchar(); c <= 32; c = getchar()) ; if (c == - ) fu = 1, c = getchar(); for (x = 0; c > 32; c = getchar()) x = x * 10 + c - 0 ; if (fu) x = -x; }; template <...
#include <bits/stdc++.h> using namespace std; const int MAX_N = 1e5 + 1; const long long MOD = 1e9 + 7; const long long INF = 1e9; void solve(long long a, long long b) { if (a == 0 and b == 0) { cout << 0 << endl; } else if (a == b) { cout << 1 << endl; } else if (abs(a - b) % 2 ==...
#include <bits/stdc++.h> using namespace std; int main() { int a[1001], i, n, sum = 0, max = 0; int b[1001] = {0}; cin >> n; for (i = 0; i < n; i++) cin >> a[i]; for (i = 0; i < n; i++) { b[a[i]]++; } for (i = 0; i < 1001; i++) { if (b[i] > max) max = b[i]; if (b[i]) su...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); int tt; cin >> tt; while (tt--) { int a, b, c, saveb = 0; string st, md, en; st = md = en = ; cin >> a >> b >> c; bool ub = false; while (b) { if (!ub) { ...
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; cout << s; reverse(s.begin(), s.end()); cout << s; }
#include <bits/stdc++.h> using namespace std; void CountTriangles(vector<int> A) { int n = A.size(); sort(A.begin(), A.end()); int count = 0; for (int i = n - 1; i >= 1; i--) { int l = 0, r = i - 1; while (l < r) { if (A[l] + A[r] > A[i]) { count += r - l; r--...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:64000000 ) using namespace std; int n, b[110], l, r, c, t, q[110], m; int main() { cin >> m >> n; for (int i = 1; i <= m; i++) b[i] = 1 << 30; for (int i = 0; i < n; i++) { cin >> l >> r >> t >> c; for (int j = l; j <= r; j++) { ...
#include <bits/stdc++.h> #define pb push_back #define mp make_pair #define sz(a) ((int)a.size()) #define re return #define all(a) a.begin(),a.end() #define int long long #define ld long double #define rept(i,a,b) for(int i=(a);i<(b);i++) #define rep(i,a) rept(i,0,a) using namespace std; void fail(...
#include <bits/stdc++.h> using namespace std; void read(int& x) { bool fu = 0; char c; for (c = getchar(); c <= 32; c = getchar()) ; if (c == - ) fu = 1, c = getchar(); for (x = 0; c > 32; c = getchar()) x = x * 10 + c - 0 ; if (fu) x = -x; }; char getc() { char c; for (c...
#include <bits/stdc++.h> using namespace std; struct com { int l, r; long long c; friend bool operator<(const com &a, const com &b) { return a.r < b.r; } } a[100010]; int n, m, K; long long cost[310][310], dp[310][310]; const long long inf = 0x3F3F3F3F3F3F3F3FLL; int main() { scanf( %d%d%d...
#include <bits/stdc++.h> using namespace std; int a[107], b[107]; int ans[10000007]; int n, nMax, nMaxid, times, nMin, aol, aMin, aMax, aL; void init() { memset(a, 0, sizeof(a)); memset(ans, 0, sizeof(ans)); memset(b, 0, sizeof(b)); aol = 0; aL = 0; } int check(int x) { nMax = 0; ...
#include <bits/stdc++.h> #pragma warning(disable : 4996) using namespace std; namespace Bigcat { template <typename T> inline void max_s(T& a, const T& b) { a = max(a, b); } template <typename T> inline void min_s(T& a, const T& b) { a = min(a, b); } template <typename T> void sort_v(T& x)...
#include <bits/stdc++.h> using namespace std; int main() { string s, s1; int count1 = 0, count2 = 0; cin >> s >> s1; for (int i = 0; i < s.size(); i++) { if (s[i] != s1[i]) { if (s[i] == 4 ) count1++; else count2++; } } if (count1 <= count2) ...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; for (int i = 0; i < t; i++) { int n; cin >> n; map<int, int> m; long long int a[n]; for (int j = 0; j < n; j++) { cin >> a[j]; m[a[j] % 3]++; } long long int res = m[0]; ...
#include <bits/stdc++.h> using namespace std; int n, ans, flag; int a[100005], b[100005], xb[100005]; void solve() { int i, j, ma; ans = -1; b[1] = xb[1] = 0; for (i = 2; i <= n; i++) { ma = 0; flag = 0; j = i - 1; while (a[j] < a[i] && j) { if (!b[j]) { ...
#include <bits/stdc++.h> using namespace std; const int SIZE = 1 << 20; int INF = 1000000001; int a[SIZE], ops[SIZE]; int h, g; int qq[24], qn; int pull(int id) { int tmp = a[id]; a[id] = 0; qn = 0; qq[qn++] = id; while (id * 2 < (1 << h) && a[id] < max(a[id << 1], a[(id << 1) \| 1])) {...
#include <bits/stdc++.h> using namespace std; int main() { int n, a, b; cin >> a >> b; cout << (a * b) / 2; return 0; }
#include <bits/stdc++.h> using namespace std; const long long mox = 1e6 + 9; long long ha[mox]; long long mod = 1e9 + 7; long long d[mox]; bool visit[mox]; long long ma[mox]; bool visit2[mox]; long long ta(long long a, long long b) { long long ans = 1; long long c = a; while (b) { if...
#include <bits/stdc++.h> using namespace std; void solve_test() { string s; cin >> s; int n = int(s.length()); int total = 0; long long ans = 0; for (int i = 0; i < n; i++) { if (s[i] == + ) total++; else total--; if (total < 0) { total++; a...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 10; int sum[maxn], op[maxn]; int main() { int n, l = 0, r = 0, ans = 0, minn = 100; string s; cin >> n >> s; for (int i = 0; i < n; i++) { if (s[i] == ( ) { op[i + 1] = 1; sum[i + 1] = sum[i] + 1; ...
#include <bits/stdc++.h> using namespace std; int n, k; int fr[200002]; int arr[200002]; bool check(int cati) { int qq = 0; for (int i = 1; i <= 200000; ++i) qq += fr[i] / cati; if (qq >= k) return 1; return 0; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin...
#include <bits/stdc++.h> using namespace std; vector<int> v; map<int, long long> dp; long long power(int a, long long b) { long long res = 1, base = a; while (b > 0) { if (b % 2) { res = base; res %= (1000 1000 * 1000 + 7); } base = base; base %= (1000 1000 ...
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { long long r; while (b != 0) { r = a % b; a = b; b = r; } return a; } long long lcm(long long a, long long b) { return a / gcd(a, b) * b; } int n, m; vector<int> v[4000000]; char g[4000...
#include <bits/stdc++.h> using namespace std; int main() { vector<int> v = {1, 3, 9, 27, 81, 243, 729, 2187, 6561, 19683}; vector<int> vis; for (int i = 0; i < (1 << 10); i++) { int sum = 0; for (int j = 0; j < 10; j++) { if (i & (1 << j)) { sum += v[j]; } } ...
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 7; int main() { int T; scanf( %d , &T); while (T--) { int l, r; scanf( %d%d , &l, &r); if (l * 2 > r) { printf( YES n ); } else { printf( NO n ); } } return 0; }
#include <bits/stdc++.h> using namespace std; long long n, m, k, a[100000], b[1000000], i, s, j, x, y; int main() { cin >> n >> m; if (n == m) { cout << 0 << endl; return 0; } while (n > 0) { a[i] = n % 2; n = n / 2; i++; } while (m > 0) { b[x] = m % 2...
#include<bits/stdc++.h> #define LL long long using namespace std; int n,m,edge_t=0,sum=0,rt_t=0; bool tyl_jyy=0; LL t,ans=0; int rt[200002]={}; vector<int> vec[200002]; set<int> s; struct aaa { int x,y,val,u; }e[200002]; template<class T>void read(T &x) { x=0;int f=0;char ch=getcha...
#include <bits/stdc++.h> using namespace std; long int a[5001], b[5001]; long long ans[5001]; int main(void) { int n; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; a[i] -= i; b[i] = a[i]; } sort(b + 1, b + n + 1); for (int i = 1; i <= n; i++) for (int j = ...
#include <bits/stdc++.h> int main() { long n, a, b; scanf( %ld %ld %ld , &n, &a, &b); std::vector<long> v(n, 1); long current(1), sum(1); for (long p = 1; p < n; p++) { if (b > 0) { current = sum + 1; --b; } else if ((p > 1) && (a > 0)) { ++current, --a; }...
#include <bits/stdc++.h> using namespace std; bool debug = false; int n, m, k; int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1}; long long ln, lk, lm; long long dp[35][1005], tmp[1005]; int cnt = 0; void init() { dp[0][0] = 1; tmp[0] = 1; for (int i = 1; i <= 30; i++) { dp[i][0] = 1; ...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) cin >> a[i]; if (a[0] + a[1] <= a[n - 1]) { cout << 1 2 << n << endl; } else cout << -1 << endl; } ...
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 100; void ask(int r1, int c1, int r2, int c2) { cout << ? << r1 << << c1 << << r2 << << c2 << n ; cout.flush(); } bool ans() { string ans; cin >> ans; return ans == YES ; } int main() { ios::sync_wi...
#include <bits/stdc++.h> using namespace std; template <class A> void read(vector<A>& v); template <class A, size_t S> void read(array<A, S>& a); template <class T> void read(T& x) { cin >> x; } void read(double& d) { string t; read(t); d = stod(t); } void read(long double& d) { ...
#include <bits/stdc++.h> using namespace std; int a, b, c, d, e, n, m, t, kk, tt = 0, l[5007], r[5007], fa[5007], type[5007], ind[5007]; int y[5007] = {0}, qw[5007], tree[1000007], a1[5007], a2[5007], a3[5007], a4[5007]; vector<int> q[5007]; vector<short> w[5007]; voi...
#include <bits/stdc++.h> using namespace std; char x[15]; int main() { scanf( %s , x); int lenx = strlen(x); for (int i = lenx - 1; i >= 0; i--) { int dig = x[i] - 0 ; if (dig == 0) printf( O-\|-OOOO n ); else if (dig == 1) printf( O-\|O-OOO n ); else if (dig == ...
#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; if (n == 1 \|\| n == 2) { cout << -1 ; return 0; } else if (n % 2 == 1) { long long k = (n - 1) / 2; cout << 2 * k * k + 2 * k << << 2 * k * k + 2 * k + 1; } else { long long k = n ...
#include <bits/stdc++.h> using namespace std; const double eps = 1e-6, pi = acos(-1); const int N = 1e2 + 5, M = 1e9 + 7, SEGM = 4 * N, OO = 0x3f3f3f3f; int t, n, m, v1, v2; int mem[105][2005]; int main() { scanf( %d%d%d%d , &v1, &v2, &n, &m); if (v1 > v2) swap(v1, v2); memset(mem, -OO, sizeof m...
#include <bits/stdc++.h> using namespace std; const long long oo = 2e9, MOD = 998244353; int dx[] = {1, 0, -1, 0, 1, 1, -1, -1}; int dy[] = {0, -1, 0, 1, 1, -1, 1, -1}; int main() { int n, k; string s; cin >> n >> k >> s; for (int i = 0; i < (int)s.size() - 1 && k; i++) { if (s[i] == 4 ...
#include <bits/stdc++.h> using namespace std; void flanther_fakadi() { string s; cin >> s; long long n = s.length(); long long ct = 0; for (long long i = 0; i < s.length(); i++) { if (ct && s[i] == B ) { n -= 2; ct--; } else { ct++; } } cout << ...
#include <bits/stdc++.h> using namespace std; void solve() { long long int n, k; cin >> n >> k; string s; cin >> s; vector<pair<long long int, long long int>> ans; string des = ; for (long long int i = 1; i < k; i++) { des += () ; } long long int maxx = (n / 2); for ...
#include <bits/stdc++.h> using namespace std; const int maxv = 1.5e7; const int bit = 29; int cnt[maxv] = {}; int go[maxv][2] = {}; int tot = 1; void add(int v, int d, int val) { cnt[v]++; if (d == -1) return; if (!go[v][(val >> d) & 1]) go[v][(val >> d) & 1] = ++tot; add(go[v][(val >> d) ...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 7; int head[N], nxt[N << 1], ver[N << 1], tot; int n, d[N], out[N], f[N], ji[N], ou[N]; vector<int> v[N]; bool flag; void add(int x, int y) { ver[++tot] = y; nxt[tot] = head[x], head[x] = tot; out[x]++; } void dfs(int x, int...
#include <bits/stdc++.h> using namespace std; int cnt[3], ans; vector<int> c; vector<vector<int>> sum; vector<vector<int>> arr; void dfs(int x, int p) { for (auto i : arr[x]) { if (i != p) { dfs(i, x); sum[x][0] += sum[i][0]; sum[x][1] += sum[i][1]; sum[x][2] += sum...
#include <bits/stdc++.h> using namespace std; int n, m, i, j, k, res[200500], st1[200500][20], st2[200500][20]; int l2(int n) { int r = 0; while (n - 1) { r++; n >>= 1; } return r; } int chk1(int l, int r) { int k = l2(r - l + 1); return max(st1[l][k], st1[r - (1 << k) + 1]...
#include <bits/stdc++.h> using namespace std; const int M = 1e3 + 5; long long int dp[M][12][M], inv[M], n, d, mod; long long int pw(long long int a, long long int b) { if (b == 0) return 1ll; long long int p = pw(a, b / 2ll); if (b % 2ll) return p * p % mod * a % mod; else return p ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); long long n, m; cin >> n >> m; vector<vector<long long>> dist((size_t)n, vector<long long>((size_t)n, (long long)1e16)); for (long long i = 0; i <...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; int x, y; cin >> x >> y; string s; cin >> s; bool flag = false; int cnt = 0; for (int i = 0; i < n; ++i) { if (s[i] == 0 ) { flag = tr...
#include <bits/stdc++.h> using namespace std; int main() { string cad; int cnt = 0, ans = 0; cin >> cnt >> cad; cnt = 0; for (int i = 0; i < cad.size(); i++) { if (cad[i] == x ) { cnt++; } else { ans += max(0, cnt - 2); cnt = 0; } } ans += max(0...
#include <bits/stdc++.h> using namespace std; int main() { long long int x, y, a, b, c; cin >> x >> y >> a >> b >> c; long long int t = a * 2; long long int r = c * 3; cout << max(t + b - x, 0ll) + max(r + b - y, 0ll); return 0; }
#include <bits/stdc++.h> const int kInf = 0x3f3f3f3f; int len, n; int msk[200010]; int mem[21][1 << 20]; int f[200010], s[200010]; int conv(char *s) { int res = 0; for (int i = 0; i < len; i++) res = (res << 1) + (s[i] - 0 ); return res; } int g(int i, int j) { int p = msk[i], q = msk[j...
#include <bits/stdc++.h> using namespace std; long long int n; long long int a[100001]; vector<pair<long long int, long long int> > g[100001]; long long int dis[100001]; long long int rem[100001]; long long int dp[100001]; long long int child[100001]; long long int ct = 1; void simpledfs(long long i...
#include <bits/stdc++.h> using namespace std; const int N = 1e4 + 5, mod = 1e9 + 9, bit = 61, sq = 1000; const int T = (100001 + sq - 1) / sq; vector<int> lucky; bool isl[N] = {0}; int bid[100005], a[100005], beg[T], en[T], lazy[T] = {0}; int fq[T][N]; void create() { for (int d = 1; d <= 4; d++) { ...
#include <bits/stdc++.h> using namespace std; long long int inf = 1e9 + 7; int main() { long long int n; cin >> n; vector<pair<long long int, long long int> > arr(n + 1); for (long long int i = 1; i < n + 1; i++) { long long int a, b; cin >> a >> b; arr[i].first = a; arr[i]...
#include <bits/stdc++.h> using namespace std; long long a[100020], b[100020]; int main() { int m, n; scanf( %d%d , &m, &n); long long sum1 = 0, sum2 = 0, s1 = 0, s2 = 0, Max1 = 0, Max2 = 0; for (int i = 1; i <= m; i++) { scanf( %I64d , &a[i]); sum1 += a[i]; if (a[i] > Max1) { ...
#include <bits/stdc++.h> using namespace std; const int maxn = 2005; char mpt[2005][2005]; int dp[maxn][maxn]; int col[maxn]; int main() { int n, m, k; scanf( %d%d%d , &n, &m, &k); for (int i = 1; i <= n; i++) scanf( %s , mpt[i] + 1); for (int i = 1; i <= n; i++) { for (int j = 1; j <=...

#include <bits/stdc++.h> using namespace std; int a[4000000]; int f[4000000]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; } int s, t; cin >> s >> t; s--; t--; long long ans = 0; for (int i = s; i < t; i++) ans += a[i]; long long num ...

#include <bits/stdc++.h> inline long long MAX2(long long a, long long int b) { return (a) > (b) ? (a) : (b); } inline long long MAX3(long long a, long long b, long long c) { return (a) > (b) ? ((a) > (c) ? (a) : (c)) : ((b) > (c) ? (b) : (c)); } inline long long MIN2(long long a, long long b) { re...

#include <bits/stdc++.h> using namespace std; int main() { long long n, sum = 0; cin >> n; sum = n; for (int i = 2; i <= n; i++) { while (n % i == 0) { sum += n / i; n /= i; } } cout << sum << endl; return 0; }

#include <bits/stdc++.h> using namespace std; const int N = 1e4 + 5; int a[N], b[N]; long long check(long long x, int n, int c) { long long ans = 0; for (int i = 1; i <= n; ++i) { ans += x * a[i] / b[i] + 1; if (ans > c) ans = c + 1; } return ans; } int main() { int n, c; ...

#include <bits/stdc++.h> using namespace std; template <class T> T abs(T x) { return x > 0 ? x : -x; } int m; int n; map<int, int> id; int rev[100500]; int a[2]; int w[100500], ans[100500]; set<int> s; set<int> ss; void go(int x) { w[x] = 1; x = rev[x]; s.insert(x); for (in...

#include <bits/stdc++.h> using namespace std; int main() { int tc; cin >> tc; while (tc-- > 0) { int arr[7]; for (int i = 0; i < 7; i++) { cin >> arr[i]; } cout << arr[0] << << arr[1] << << arr[6] - arr[0] - arr[1] << endl; } }

#include <bits/stdc++.h> using namespace std; long long int gcd(long long int a, long long int b) { return b == 0 ? a : gcd(b, a % b); } long long int power(long long int x, long long int n) { long long int result = 1; while (n > 0) { if (n % 2 == 1) result = (result * x) % 1000000007; x...

#include <bits/stdc++.h> using namespace std; int main() { long long n, arr[100000], arr1[100000]; cin >> n; string s = ; for (int x = 0; x < n; x++) cin >> arr[x], arr1[x] = arr[x]; sort(arr1, arr1 + n); for (int x = 0; x <= arr1[n - 1]; x++) { for (int y = 0; y < n - 1; y++) { ...

#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using pii = pair<int, int>; const int maxn = 1e5 + 10; const int mod = 1e9 + 7; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); ll pwr(ll a, ll pw) { ll ret = 1; while (pw > 0) { ...

#include <bits/stdc++.h> using namespace std; using LL = long long; constexpr int N = 2e5 + 5; vector<int> E[N]; LL Size[N], Dep[N]; int ord[N]; int tourism[N]; void dfs(int x, int p, int lvl) { Size[x] = 1; Dep[x] = lvl; for (const int &to : E[x]) { if (to == p) continue; dfs(to...

#include <bits/stdc++.h> using namespace std; const int N = 200009; const long long mod = 1e9 + 7; char s[N]{}; long long prea[N]; long long pref[N]; long long sac[N]; long long saf[N]; long long ksm(int n, int y) { if (y < 1) return 1; long long x = n; long long ret = 1; while (y) { ...

#include <bits/stdc++.h> using namespace std; long long n, cr; bool f = 0; pair<long long, long long> a[25], b[25], c[25]; void gen(long long i, long long s1, long long s2) { if (i == n) { if (s1 != s2) cr++; } else { gen(i + 1, s1 + a[i].first, s2 + c[i].first); gen(i + 1, s1, s2); ...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { long long a, b, x, y, n; cin >> a >> b >> x >> y >> n; long long a1 = a, b1 = b, n1 = n; long long an = a - x, bn = b - y; b -= min(bn, n); n -= min(bn, n); a -= min(an, n)...

#include <bits/stdc++.h> template <class T> inline void read(T &x) { x = 0; register char c = getchar(); register bool f = 0; while (!isdigit(c)) f ^= c == - , c = getchar(); while (isdigit(c)) x = x * 10 + c - 0 , c = getchar(); if (f) x = -x; } template <class T> inline void print(...

#include <bits/stdc++.h> using namespace std; long long int cost(long long int x[], long long int a, long long int n, long long int r, long long int m, long long int val) { long long int pos = 0; long long int neg = 0; for (int i = 0; i < n; i++) { if (x[i] > val) pos ...

#include <bits/stdc++.h> using namespace std; template <typename TYPE> inline void chkmax(TYPE &first, TYPE second) { first < second ? first = second : 0; } template <typename TYPE> inline void chkmin(TYPE &first, TYPE second) { second < first ? first = second : 0; } template <typename TYPE> v...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 5; const int inf = 0x3f3f3f3f; int t, n; int a[200]; int main() { int n, q, t, k, d; int cnt; int sum; memset(a, 0, sizeof a); cin >> n >> q; for (int i = 0; i < q; i++) { cnt = 0; sum = 0; cin >> ...

#include <bits/stdc++.h> using namespace std; int a[110]; int b[110]; int main() { string s; getline(cin, s); int num = 0, ten = 1; for (int i = s.size() - 1; i >= 0; i--) { if (s[i] == = ) break; if (s[i] <= 9 && s[i] >= 0 ) { int x = s[i] - 0 ; num += x * ten; ...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); int n, x; cin >> n >> x; long long sum = 0; for (int i = 0; i < n; i++) { long long a; cin >> a; sum += a; } if (sum + n - 1 == x) return 0 * puts( YES ); puts( NO ); return ...

#include <bits/stdc++.h> #pragma GCC target( avx2 ) #pragma GCC optimize( O3 ) #pragma GCC optimize( unroll-loops ) using namespace std; using ll = long long; using lld = long double; using vll = int64_t; int main() { map<int, pair<int, int> > hm; int a[] = {4, 8, 15, 16, 23, 42}; for (int i...

#include <bits/stdc++.h> using namespace std; int n; string s; int dp[111][55][222][3]; int res; void dfs(int pos, int left, int x, int dx) { if (dp[pos][left][x + 100][dx + 1]) return; dp[pos][left][x + 100][dx + 1] = 1; if (pos == s.size()) { if (left == 0) res = max(res, abs(x)); ...

#include <bits/stdc++.h> using namespace std; int hv[5]; map<string, int> dys; string dyi[5] = { S , M , L , XL , XXL }; int order[5][5] = {{0, 1, 2, 3, 4}, {1, 2, 0, 3, 4}, {2, 3, 1, 4, 0}, {3, 4, 2, 1, 0}, {4, 3, 2, 1, 0...

#include <bits/stdc++.h> using namespace std; int main() { int n, i, a, k = 0; vector<int> v; cin >> n; for (i = 0; i < n; i++) { cin >> a; v.push_back(a); } sort(v.begin(), v.end(), greater<int>()); for (i = 0; i <= n - 3; i++) { if (v[i] < v[i + 1] + v[i + 2]) k++; ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); double l, p, q; cin >> l >> p >> q; cout << setprecision(9) << (p * l) / (p + q); return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; vector<int> result; for (int i = 0; i < t; i++) { int b, p, f, h, c; cin >> b >> p >> f >> h >> c; int res = 0; b /= 2; if (h > c) { if (b - p > 0) { res += p * h; b ...

#include <bits/stdc++.h> using namespace std; int main() { int t, n; cin >> t; while (t--) { cin >> n; cout << n / 2 << endl; } }

#include <bits/stdc++.h> using namespace std; long long x; int getAdded(long long n) { int lo = 1, hi = 10000000; while (lo < hi) { long long mid = (lo + hi) / 2 + (lo + hi) % 2; long long temp = (mid * mid + mid) / 2; if (temp == n) return mid; else if (temp < n) l...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:100000000000,100000000000 ) using namespace std; const long long inf = 1e18 + 7; const long long mod = 1e9 + 7; const double eps = 1e-12; const double PI = 2 * acos(0.0); const double E = 2.71828; int n; long long a[1000005]; long long d[10000...

#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using u32 = unsigned int; using u64 = unsigned long long; char buf[10]; void NO() { puts( Impossible ); exit(0); } ll update(ll x, ll c) { if (x == LLONG_MAX || x == LLONG_MIN) return x; return ...

#include <bits/stdc++.h> using namespace std; vector<int> g[300005]; int cnt[300005]; int vis[300005]; int ans[300001][26]; int res = 0; int main() { queue<int> q; int n, m; cin >> n >> m; string s; cin >> s; int x, y; while (m--) { scanf( %d%d , &x, &y); x--, y--; ...

#include <bits/stdc++.h> using namespace std; int c[4100]; int s[4100]; vector<long long> g; string str; int main() { long long a; cin >> a; cin >> str; int len = str.length(); for (int i = 0; str[i]; i++) c[i + 1] = str[i] - 0 ; for (int i = 1; i <= len; i++) { s[i] = s[i - 1...

#include <bits/stdc++.h> using namespace std; int n, m; int l[100005], r[100005], q[100005]; struct node { int v, add; }; node t[4 * 100005]; const int MX = (1LL << 31) - 1; void Push(int v, int tl, int tm, int tr) { if (t[v].add != 0) { t[2 * v].add |= t[v].add; t[2 * v].v |= t[v].a...

#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int n = s.length(), cur = 1, best = 1; s += s; for (size_t i = 1; i < s.size(); i++) if (s[i] != s[i - 1]) cur++; else { best = max(best, cur); cur = 1; } best = max(best,...

#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 10; struct Segment { int left, right; } seg[N / 2 + 5]; map<int, bool> m; int a[N]; int n, ans; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); m.clear(); ans = 1; seg[ans].left = 1; ...

#include <bits/stdc++.h> using namespace std; string CHECK(long long n) { long long t, temp = n, zero = 0, ans = 0, flag = 0; while (temp != 0) { t = temp % 10; if (t == 0 && flag == 0) zero++; else { flag = 1; ans *= 10; ans += t; } temp /= 10; ...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int ans = 0; string str; cin >> str; for (int s = 2; s <= n; s++) { for (int i = 0; i < n - s + 1; i++) { int u = 0, d = 0, l = 0, r = 0; for (int j = i; j < i + s; j++) { if (str[j] =...

#include <bits/stdc++.h> using namespace std; long long a[1000050]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; } sort(a, a + n); long long rec = 0; long long num = a[0]; long long have = 0; long long can = 0; for (int i = 0; i < n; i++) {...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, m; cin >> n >> m; vector<vector<int>> p(n + 1, vector<int>(m + 1, 0)); vector<int> ma(m + 1); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { cin >...

#include <bits/stdc++.h> using namespace std; using ll = long long; bool dfs(int x, const vector<vector<int>> &g, vector<char> &used, vector<int> &match, vector<int> &rev_match) { if (used[x]) return false; used[x] = 1; for (int dest : g[x]) { if (match[dest] == -1 || dfs(match[dest],...

#include <bits/stdc++.h> using namespace std; const long long MOD = (long long)(1000000007); const double eps = 1e-9; const double pi = 3.1415926535897932384626; long long gcd(long long a, long long b) { return (b ? gcd(b, a % b) : a); } bool isprime(int n) { if (n == 1) return false; for (long long...

#include <bits/stdc++.h> using namespace std; long long t, n, i, j, k, x, y, z, ans, l, r, mid, s, q; long long a[100005], b[100005], c[100005], d[100005], p[100005], dp[100005][20]; vector<long long> v[100005], u[100005]; map<pair<int, int>, int> m; void dfs(int x, int y, int z) { dp[x][0] = y; d[x...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int mi[n]; for (int i = (0); i < (n); i++) mi[i] = 1e9; int t = 1; int z[1000]; do { t *= 2; vector<int> v; int x = 0; while (x < n) { int f = 0; for (int i = (0); i < (t /...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); int t; cin >> t; while (t--) { int n; cin >> n; int sze = n * 2; int arr[sze]; for (int i = 0; i < sze; i++) cin >> arr[i]; sort(arr, arr + sze); cout << arr[n] - ar...

#include <bits/stdc++.h> int n, m; int a[202], b[202]; int main() { scanf( %d %d , &n, &m); for (int i = 0; i < n; ++i) { scanf( %d , &a[i]); } for (int i = 0; i < m; ++i) { scanf( %d , &b[i]); } for (int w = 0; w <= 1 << 9; ++w) { int o = 0; for (int i = 0; i < n; ...

#include <bits/stdc++.h> using namespace std; const long long is_query = -(1LL << 62); struct line { long long m, b; mutable function<const line*()> succ; bool operator<(const line& rhs) const { if (rhs.b != is_query) return m < rhs.m; const line* s = succ(); if (!s) return 0; ...

#include <bits/stdc++.h> using namespace std; template <class T> inline void read(T& x) { bool fu = 0; char c; for (c = getchar(); c <= 32; c = getchar()) ; if (c == - ) fu = 1, c = getchar(); for (x = 0; c > 32; c = getchar()) x = x * 10 + c - 0 ; if (fu) x = -x; }; template <...

#include <bits/stdc++.h> using namespace std; const int MAX_N = 1e5 + 1; const long long MOD = 1e9 + 7; const long long INF = 1e9; void solve(long long a, long long b) { if (a == 0 and b == 0) { cout << 0 << endl; } else if (a == b) { cout << 1 << endl; } else if (abs(a - b) % 2 ==...

#include <bits/stdc++.h> using namespace std; int main() { int a[1001], i, n, sum = 0, max = 0; int b[1001] = {0}; cin >> n; for (i = 0; i < n; i++) cin >> a[i]; for (i = 0; i < n; i++) { b[a[i]]++; } for (i = 0; i < 1001; i++) { if (b[i] > max) max = b[i]; if (b[i]) su...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); int tt; cin >> tt; while (tt--) { int a, b, c, saveb = 0; string st, md, en; st = md = en = ; cin >> a >> b >> c; bool ub = false; while (b) { if (!ub) { ...

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

#include <bits/stdc++.h> using namespace std; void CountTriangles(vector<int> A) { int n = A.size(); sort(A.begin(), A.end()); int count = 0; for (int i = n - 1; i >= 1; i--) { int l = 0, r = i - 1; while (l < r) { if (A[l] + A[r] > A[i]) { count += r - l; r--...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:64000000 ) using namespace std; int n, b[110], l, r, c, t, q[110], m; int main() { cin >> m >> n; for (int i = 1; i <= m; i++) b[i] = 1 << 30; for (int i = 0; i < n; i++) { cin >> l >> r >> t >> c; for (int j = l; j <= r; j++) { ...

#include <bits/stdc++.h> #define pb push_back #define mp make_pair #define sz(a) ((int)a.size()) #define re return #define all(a) a.begin(),a.end() #define int long long #define ld long double #define rept(i,a,b) for(int i=(a);i<(b);i++) #define rep(i,a) rept(i,0,a) using namespace std; void fail(...

#include <bits/stdc++.h> using namespace std; void read(int& x) { bool fu = 0; char c; for (c = getchar(); c <= 32; c = getchar()) ; if (c == - ) fu = 1, c = getchar(); for (x = 0; c > 32; c = getchar()) x = x * 10 + c - 0 ; if (fu) x = -x; }; char getc() { char c; for (c...

#include <bits/stdc++.h> using namespace std; struct com { int l, r; long long c; friend bool operator<(const com &a, const com &b) { return a.r < b.r; } } a[100010]; int n, m, K; long long cost[310][310], dp[310][310]; const long long inf = 0x3F3F3F3F3F3F3F3FLL; int main() { scanf( %d%d%d...

#include <bits/stdc++.h> using namespace std; int a[107], b[107]; int ans[10000007]; int n, nMax, nMaxid, times, nMin, aol, aMin, aMax, aL; void init() { memset(a, 0, sizeof(a)); memset(ans, 0, sizeof(ans)); memset(b, 0, sizeof(b)); aol = 0; aL = 0; } int check(int x) { nMax = 0; ...

#include <bits/stdc++.h> #pragma warning(disable : 4996) using namespace std; namespace Bigcat { template <typename T> inline void max_s(T& a, const T& b) { a = max(a, b); } template <typename T> inline void min_s(T& a, const T& b) { a = min(a, b); } template <typename T> void sort_v(T& x)...

#include <bits/stdc++.h> using namespace std; int main() { string s, s1; int count1 = 0, count2 = 0; cin >> s >> s1; for (int i = 0; i < s.size(); i++) { if (s[i] != s1[i]) { if (s[i] == 4 ) count1++; else count2++; } } if (count1 <= count2) ...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; for (int i = 0; i < t; i++) { int n; cin >> n; map<int, int> m; long long int a[n]; for (int j = 0; j < n; j++) { cin >> a[j]; m[a[j] % 3]++; } long long int res = m[0]; ...

#include <bits/stdc++.h> using namespace std; int n, ans, flag; int a[100005], b[100005], xb[100005]; void solve() { int i, j, ma; ans = -1; b[1] = xb[1] = 0; for (i = 2; i <= n; i++) { ma = 0; flag = 0; j = i - 1; while (a[j] < a[i] && j) { if (!b[j]) { ...

#include <bits/stdc++.h> using namespace std; const int SIZE = 1 << 20; int INF = 1000000001; int a[SIZE], ops[SIZE]; int h, g; int qq[24], qn; int pull(int id) { int tmp = a[id]; a[id] = 0; qn = 0; qq[qn++] = id; while (id * 2 < (1 << h) && a[id] < max(a[id << 1], a[(id << 1) | 1])) {...

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

#include <bits/stdc++.h> using namespace std; const long long mox = 1e6 + 9; long long ha[mox]; long long mod = 1e9 + 7; long long d[mox]; bool visit[mox]; long long ma[mox]; bool visit2[mox]; long long ta(long long a, long long b) { long long ans = 1; long long c = a; while (b) { if...

#include <bits/stdc++.h> using namespace std; void solve_test() { string s; cin >> s; int n = int(s.length()); int total = 0; long long ans = 0; for (int i = 0; i < n; i++) { if (s[i] == + ) total++; else total--; if (total < 0) { total++; a...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 10; int sum[maxn], op[maxn]; int main() { int n, l = 0, r = 0, ans = 0, minn = 100; string s; cin >> n >> s; for (int i = 0; i < n; i++) { if (s[i] == ( ) { op[i + 1] = 1; sum[i + 1] = sum[i] + 1; ...

#include <bits/stdc++.h> using namespace std; int n, k; int fr[200002]; int arr[200002]; bool check(int cati) { int qq = 0; for (int i = 1; i <= 200000; ++i) qq += fr[i] / cati; if (qq >= k) return 1; return 0; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin...

#include <bits/stdc++.h> using namespace std; vector<int> v; map<int, long long> dp; long long power(int a, long long b) { long long res = 1, base = a; while (b > 0) { if (b % 2) { res *= base; res %= (1000 * 1000 * 1000 + 7); } base *= base; base %= (1000 * 1000 ...

#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { long long r; while (b != 0) { r = a % b; a = b; b = r; } return a; } long long lcm(long long a, long long b) { return a / gcd(a, b) * b; } int n, m; vector<int> v[4000000]; char g[4000...

#include <bits/stdc++.h> using namespace std; int main() { vector<int> v = {1, 3, 9, 27, 81, 243, 729, 2187, 6561, 19683}; vector<int> vis; for (int i = 0; i < (1 << 10); i++) { int sum = 0; for (int j = 0; j < 10; j++) { if (i & (1 << j)) { sum += v[j]; } } ...

#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 7; int main() { int T; scanf( %d , &T); while (T--) { int l, r; scanf( %d%d , &l, &r); if (l * 2 > r) { printf( YES n ); } else { printf( NO n ); } } return 0; }

#include <bits/stdc++.h> using namespace std; long long n, m, k, a[100000], b[1000000], i, s, j, x, y; int main() { cin >> n >> m; if (n == m) { cout << 0 << endl; return 0; } while (n > 0) { a[i] = n % 2; n = n / 2; i++; } while (m > 0) { b[x] = m % 2...

#include<bits/stdc++.h> #define LL long long using namespace std; int n,m,edge_t=0,sum=0,rt_t=0; bool tyl_jyy=0; LL t,ans=0; int rt[200002]={}; vector<int> vec[200002]; set<int> s; struct aaa { int x,y,val,u; }e[200002]; template<class T>void read(T &x) { x=0;int f=0;char ch=getcha...

#include <bits/stdc++.h> using namespace std; long int a[5001], b[5001]; long long ans[5001]; int main(void) { int n; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; a[i] -= i; b[i] = a[i]; } sort(b + 1, b + n + 1); for (int i = 1; i <= n; i++) for (int j = ...

#include <bits/stdc++.h> int main() { long n, a, b; scanf( %ld %ld %ld , &n, &a, &b); std::vector<long> v(n, 1); long current(1), sum(1); for (long p = 1; p < n; p++) { if (b > 0) { current = sum + 1; --b; } else if ((p > 1) && (a > 0)) { ++current, --a; }...

#include <bits/stdc++.h> using namespace std; bool debug = false; int n, m, k; int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1}; long long ln, lk, lm; long long dp[35][1005], tmp[1005]; int cnt = 0; void init() { dp[0][0] = 1; tmp[0] = 1; for (int i = 1; i <= 30; i++) { dp[i][0] = 1; ...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) cin >> a[i]; if (a[0] + a[1] <= a[n - 1]) { cout << 1 2 << n << endl; } else cout << -1 << endl; } ...

#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 100; void ask(int r1, int c1, int r2, int c2) { cout << ? << r1 << << c1 << << r2 << << c2 << n ; cout.flush(); } bool ans() { string ans; cin >> ans; return ans == YES ; } int main() { ios::sync_wi...

#include <bits/stdc++.h> using namespace std; template <class A> void read(vector<A>& v); template <class A, size_t S> void read(array<A, S>& a); template <class T> void read(T& x) { cin >> x; } void read(double& d) { string t; read(t); d = stod(t); } void read(long double& d) { ...

#include <bits/stdc++.h> using namespace std; int a, b, c, d, e, n, m, t, kk, tt = 0, l[5007], r[5007], fa[5007], type[5007], ind[5007]; int y[5007] = {0}, qw[5007], tree[1000007], a1[5007], a2[5007], a3[5007], a4[5007]; vector<int> q[5007]; vector<short> w[5007]; voi...

#include <bits/stdc++.h> using namespace std; char x[15]; int main() { scanf( %s , x); int lenx = strlen(x); for (int i = lenx - 1; i >= 0; i--) { int dig = x[i] - 0 ; if (dig == 0) printf( O-|-OOOO n ); else if (dig == 1) printf( O-|O-OOO n ); else if (dig == ...

#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; if (n == 1 || n == 2) { cout << -1 ; return 0; } else if (n % 2 == 1) { long long k = (n - 1) / 2; cout << 2 * k * k + 2 * k << << 2 * k * k + 2 * k + 1; } else { long long k = n ...

#include <bits/stdc++.h> using namespace std; const double eps = 1e-6, pi = acos(-1); const int N = 1e2 + 5, M = 1e9 + 7, SEGM = 4 * N, OO = 0x3f3f3f3f; int t, n, m, v1, v2; int mem[105][2005]; int main() { scanf( %d%d%d%d , &v1, &v2, &n, &m); if (v1 > v2) swap(v1, v2); memset(mem, -OO, sizeof m...

#include <bits/stdc++.h> using namespace std; const long long oo = 2e9, MOD = 998244353; int dx[] = {1, 0, -1, 0, 1, 1, -1, -1}; int dy[] = {0, -1, 0, 1, 1, -1, 1, -1}; int main() { int n, k; string s; cin >> n >> k >> s; for (int i = 0; i < (int)s.size() - 1 && k; i++) { if (s[i] == 4 ...

#include <bits/stdc++.h> using namespace std; void flanther_fakadi() { string s; cin >> s; long long n = s.length(); long long ct = 0; for (long long i = 0; i < s.length(); i++) { if (ct && s[i] == B ) { n -= 2; ct--; } else { ct++; } } cout << ...

#include <bits/stdc++.h> using namespace std; void solve() { long long int n, k; cin >> n >> k; string s; cin >> s; vector<pair<long long int, long long int>> ans; string des = ; for (long long int i = 1; i < k; i++) { des += () ; } long long int maxx = (n / 2); for ...

#include <bits/stdc++.h> using namespace std; const int maxv = 1.5e7; const int bit = 29; int cnt[maxv] = {}; int go[maxv][2] = {}; int tot = 1; void add(int v, int d, int val) { cnt[v]++; if (d == -1) return; if (!go[v][(val >> d) & 1]) go[v][(val >> d) & 1] = ++tot; add(go[v][(val >> d) ...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 7; int head[N], nxt[N << 1], ver[N << 1], tot; int n, d[N], out[N], f[N], ji[N], ou[N]; vector<int> v[N]; bool flag; void add(int x, int y) { ver[++tot] = y; nxt[tot] = head[x], head[x] = tot; out[x]++; } void dfs(int x, int...

#include <bits/stdc++.h> using namespace std; int cnt[3], ans; vector<int> c; vector<vector<int>> sum; vector<vector<int>> arr; void dfs(int x, int p) { for (auto i : arr[x]) { if (i != p) { dfs(i, x); sum[x][0] += sum[i][0]; sum[x][1] += sum[i][1]; sum[x][2] += sum...

#include <bits/stdc++.h> using namespace std; int n, m, i, j, k, res[200500], st1[200500][20], st2[200500][20]; int l2(int n) { int r = 0; while (n - 1) { r++; n >>= 1; } return r; } int chk1(int l, int r) { int k = l2(r - l + 1); return max(st1[l][k], st1[r - (1 << k) + 1]...

#include <bits/stdc++.h> using namespace std; const int M = 1e3 + 5; long long int dp[M][12][M], inv[M], n, d, mod; long long int pw(long long int a, long long int b) { if (b == 0) return 1ll; long long int p = pw(a, b / 2ll); if (b % 2ll) return p * p % mod * a % mod; else return p ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); long long n, m; cin >> n >> m; vector<vector<long long>> dist((size_t)n, vector<long long>((size_t)n, (long long)1e16)); for (long long i = 0; i <...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; int x, y; cin >> x >> y; string s; cin >> s; bool flag = false; int cnt = 0; for (int i = 0; i < n; ++i) { if (s[i] == 0 ) { flag = tr...

#include <bits/stdc++.h> using namespace std; int main() { string cad; int cnt = 0, ans = 0; cin >> cnt >> cad; cnt = 0; for (int i = 0; i < cad.size(); i++) { if (cad[i] == x ) { cnt++; } else { ans += max(0, cnt - 2); cnt = 0; } } ans += max(0...

#include <bits/stdc++.h> using namespace std; int main() { long long int x, y, a, b, c; cin >> x >> y >> a >> b >> c; long long int t = a * 2; long long int r = c * 3; cout << max(t + b - x, 0ll) + max(r + b - y, 0ll); return 0; }

#include <bits/stdc++.h> const int kInf = 0x3f3f3f3f; int len, n; int msk[200010]; int mem[21][1 << 20]; int f[200010], s[200010]; int conv(char *s) { int res = 0; for (int i = 0; i < len; i++) res = (res << 1) + (s[i] - 0 ); return res; } int g(int i, int j) { int p = msk[i], q = msk[j...

#include <bits/stdc++.h> using namespace std; long long int n; long long int a[100001]; vector<pair<long long int, long long int> > g[100001]; long long int dis[100001]; long long int rem[100001]; long long int dp[100001]; long long int child[100001]; long long int ct = 1; void simpledfs(long long i...

#include <bits/stdc++.h> using namespace std; const int N = 1e4 + 5, mod = 1e9 + 9, bit = 61, sq = 1000; const int T = (100001 + sq - 1) / sq; vector<int> lucky; bool isl[N] = {0}; int bid[100005], a[100005], beg[T], en[T], lazy[T] = {0}; int fq[T][N]; void create() { for (int d = 1; d <= 4; d++) { ...

#include <bits/stdc++.h> using namespace std; long long int inf = 1e9 + 7; int main() { long long int n; cin >> n; vector<pair<long long int, long long int> > arr(n + 1); for (long long int i = 1; i < n + 1; i++) { long long int a, b; cin >> a >> b; arr[i].first = a; arr[i]...

#include <bits/stdc++.h> using namespace std; long long a[100020], b[100020]; int main() { int m, n; scanf( %d%d , &m, &n); long long sum1 = 0, sum2 = 0, s1 = 0, s2 = 0, Max1 = 0, Max2 = 0; for (int i = 1; i <= m; i++) { scanf( %I64d , &a[i]); sum1 += a[i]; if (a[i] > Max1) { ...

#include <bits/stdc++.h> using namespace std; const int maxn = 2005; char mpt[2005][2005]; int dp[maxn][maxn]; int col[maxn]; int main() { int n, m, k; scanf( %d%d%d , &n, &m, &k); for (int i = 1; i <= n; i++) scanf( %s , mpt[i] + 1); for (int i = 1; i <= n; i++) { for (int j = 1; j <=...