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

func_code_string stringlengths 59 71.4k
#include <bits/stdc++.h> using namespace std; const int inf = 2000000005; const int maxt = (1 << 20) + 5; int all[maxt], dp[2][maxt]; int best[30], a[30][30]; int mask[30][30], cost[30][30]; char str[30][30]; int n, m; int main() { scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) scanf( %s ,...
#include <bits/stdc++.h> using namespace std; int n, m, a[111], maxx; int main() { cin >> n >> m; for (int i = 0; i < n; ++i) cin >> a[i]; maxx = a[0]; for (int i = 1; i < n; ++i) maxx = max(maxx, a[i]); int tot = 0; for (int i = 0; i < n; ++i) tot += maxx - a[i]; int res2 = maxx + m; ...
#include <bits/stdc++.h> using namespace std; const long long int N = 1e5 + 5; const long long int M = 1e9 + 7; queue<pair<long long int, long long int> > pq; vector<long long int> v; map<long long int, long long int> mpp; set<pair<long long int, long long int> > st; long long int a[N], h[N], indx[N][2]...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast,no-stack-protector,unroll-loops ) #pragma GCC optimize( no-stack-protector,fast-math ) using namespace std; const long long N = 2e5 + 100, OO = 1e9 + 7, T = 1e6 + 10, M = 1e9 + 7, P = 6151, SQ = 280, lg = 20; long long n; long long pw(lo...
#include <bits/stdc++.h> using namespace std; int main() { int n, q = 0, s = 0, t = 0; cin >> n; for (int k = 1; k <= n; k++) { cin >> q; if (q == 1) { if (t == 1) s++; else { t++; s++; } } else { if (t == 1) { t--...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( avx,avx2,fma ) using namespace std; const int mod1 = 1000000007; long long gcd(long long a, long long b) { long long c = a % b; while (c != 0) { a = b; b = c; c = a % b; } return b; } long long iss...
#include <bits/stdc++.h> using namespace std; const int inf = 1e9 + 9; const int Mod = 1e9 + 7; inline int dcmp(double x) { if (fabs(x) <= 1e-9) return 0; return x < 0 ? -1 : 1; } inline int scan() { int x = 0, f = 1; char ch = getchar(); while (ch < 0 \|\| ch > 9 ) { if (ch == -...
#include <bits/stdc++.h> using namespace std; int n; long long int dp[3005][3005]; int a[3005]; int tree[3005 * 3005][2]; int cnt = 0; long long int check(int t) { return !((a[t - 3] == 0 && a[t - 2] == 0 && a[t - 1] == 1 && a[t] == 1) \|\| (a[t - 3] == 0 && a[t - 2] == 1 && a[t - 1] == 0 &...
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( O2,no-stack-protector,unroll-loops,fast-math ) const long long maxn = 1e5 + 10, maxm = 5e2 + 10, lg = 21, mod = 1e9 + 7, inf = 1e18; long long n, m, s; long double dp[101][maxn], ps[maxn]; int main() { ios_base::sync_w...
#include <bits/stdc++.h> using namespace std; int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long n, p; cin >> n >> p; long long ans = 5 * 5000000; for (long long i = 1; i <= 5000000; i++) { long long left = n - p * i; if (left < 1) cont...
#include <bits/stdc++.h> using namespace std; const long long N = 1e5 + 7; long long n, a[N], cnt[N]; int32_t main() { cin >> n; for (long long i = 0; i < n; i++) cin >> a[i], cnt[a[i]]++; for (long long i = 1; i < N; i++) if (cnt[i] > 0) { if (cnt[i] > n / 2) cout << Bob ; ...
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int N = 410; int cnt[N]; int temp[N]; long long cost[N][N]; long long dp[N][N]; long long n, m, k; const long long INF = (1LL) << 60; vector<int> v[200]; int main() { while (cin >> n >> m >> k) { memset(dp, 0, s...
#include <bits/stdc++.h> using namespace std; template <class T> void print(T& x) { cout << x; } template <class T, class U> void print(pair<T, U>& p) { cout << ( ; print(p.first); cout << , ; print(p.second); cout << ) ; } template <class T> void print(vector<T>& v) { ...
#include <bits/stdc++.h> using namespace std; int dp[1005]; long long ncr[1005][1005]; int ones(int n); void calc_ncr(); int main() { string n; int k; cin >> n; cin >> k; calc_ncr(); dp[1] = 0; for (int i(2); i < (1001); i++) { dp[i] = dp[ones(i)] + 1; } long long r...
#include<bits/stdc++.h> using namespace std; vector<int> vec[200001]; int ans[200001],arr[200001]; struct data { int l,r,mini,maxi,d; }; data tree[1000001]; void pushup(int x) { tree[x].maxi=max(tree[x<<1].maxi,tree[(x<<1)+1].maxi); tree[x].mini=min(tree[x<<1].mini,tree[(x<<1)+1].mini);...
#include <bits/stdc++.h> using namespace std; const long long INF(0x3f3f3f3f3f3f3f3fll); const long long inf(0x3f3f3f3f); template <typename T> void read(T &res) { bool flag = false; char ch; while (!isdigit(ch = getchar())) (ch == - ) && (flag = true); for (res = ch - 48; isdigit(ch = getcha...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:1024000000,1024000000 ) using namespace std; int const maxn = 3000005; string st[maxn]; int ab[200], ac[200], ad[200]; char b[maxn], c[maxn], d[maxn]; int main() { cin >> b >> c; int lenc = strlen(c); for (int i = 0; i < lenc; i++) { ...
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 7; int a[N], n; double f(double x) { double sum = 0, mn = 0, mx = 0, ans = 0; for (int i = 0; i < n; i++) { mn = min(mn, sum); mx = max(mx, sum); sum += a[i] - x; ans = max(ans, abs(sum - mn)); ans = max(ans,...
#include <bits/stdc++.h> using namespace std; int n, ans; int a[6][6]; int convert(char c) { if (c == R ) return 1; if (c == G ) return 2; if (c == B ) return 3; if (c == Y ) return 4; if (c == W ) return 5; } void xuly(int state) { int i, j, dem, c1, c2; bool val[10], col[1...
#include <bits/stdc++.h> using namespace std; int main(int argc, char const *argv[]) { int a; int b; int dado[] = {1, 2, 3, 4, 5, 6}; cin >> a >> b; int r1, r2, r3; r1 = r2 = r3 = 0; for (int i = 0; i < 6; ++i) abs(dado[i] - a)<abs(dado[i] - b) ? r1++ : abs(dado[i] - a)> abs(dado[i...
#include <bits/stdc++.h> using namespace std; long unsigned int combi(long unsigned int a) { if (a == 0 \|\| a == 1) return 0; return ((a * (a - 1)) / 2); } int main() { int n = 0; cin >> n; char arr[n]; int letras[26]; char temp = 0; long unsigned int res = 0; for (int i = 0; ...
#include <bits/stdc++.h> using namespace std; template <typename T, typename U> bool ckmin(T &a, U b) { return b < a ? a = b, true : false; } template <typename T, typename U> bool ckmax(T &a, U b) { return b > a ? a = b, true : false; } int tt; int main() { ios_base::sync_with_stdio(false...
#include <bits/stdc++.h> using namespace std; const int inf = (int)1e9 * 2; int n, m, ind; long long L[55], M[55], R[55], A[55], ans = -inf, un; bool all = 1; vector<int> a[55]; void calc() { for (int i = 0; i < n; i++) { R[i] = M[i] = L[i] = -inf; for (int j = 0; j < a[i].size(); j++) { ...
#include <bits/stdc++.h> using namespace std; double calc(pair<double, double> v1, pair<double, double> v2) { double dx = v1.first - v2.first; double dy = v1.second - v2.second; return sqrt(dx * dx + dy * dy); } int main() { int a, b, c; scanf( %d%d%d , &a, &b, &c); double x1, y1, x2, y2...
#include <bits/stdc++.h> using namespace std; bool isPrime(int n) { for (int i = 2; i < int(sqrt(n) + 1); i++) if (n % i == 0) return 0; return 1; } int main() { int n; cin >> n; if (isPrime(n)) return !(cout << 1 << n ); if (n & 1) { if (isPrime(n - 2)) cout << 2 <...
#include <bits/stdc++.h> const int MAXN = 1000000007; const int z = 0; using namespace std; int main() { int k, l, m, n, d, ans = 0; cin >> k >> l >> m >> n >> d; for (int i = 1; i <= d; i++) { if (i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0) { ans++; } } cout <<...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int tt, c = 0; cin >> tt; while (tt) { int n = tt; set<int> data; while (n % 2 == 0) { data.insert(2); n = n / 2; } for (i...
#include <bits/stdc++.h> using namespace std; using ll = long long; using P = pair<int, int>; constexpr int INF = 1001001001; constexpr int mod = 1000000007; template <class T> inline bool chmax(T& x, T y) { if (x < y) { x = y; return true; } return false; } template <class T> ...
#include <bits/stdc++.h> using namespace std; int main() { int n, a[1000]; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; } long int answer = 0; for (int i = 0; i < (n - 1); i++) { if (a[i] == 1 && a[i + 1] == 2) { answer += 3; } else if (a[i] == 1 && a[i + 1]...
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int a = (s.size() + 1) / 2 - 1; int b = s.size() / 2 - 1; bool f00 = false, f01 = false, f10 = false, f11 = false; int cq = 0, c0 = 0, c1 = 0; for (int i = 0; i < s.size(); i++) { if (s[i] == 0 ) ...
#include <bits/stdc++.h> using namespace std; int main() { int t; double a, b, Zero = 0.5, One = 1.0; scanf( %d , &t); while (t--) { scanf( %lf%lf , &a, &b); if (a == 0 && b == 0) printf( %.10lf n , One); else if (a == 0) printf( %.10lf n , Zero); else if (b =...
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; const int N = 1e5 + 5, M = 100 + 5, OO = 0x3f3f3f3f, mod = 1e9 + 7, base = 131, MOD2 = 1000136437; const double EPS = 1e-9; long double w, h, theta; complex<double> rotate(complex<double> &p, double a) { return p * pola...
#include <bits/stdc++.h> using namespace std; char buf[1 << 21], p1 = buf, p2 = buf; int read() { int w = 0, f = 1; char c = ; while (c < 0 \|\| c > 9 ) c = (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 21, stdin), p1 == p2) ? EOF : *p1++), f = c ==...
#include <bits/stdc++.h> using namespace std; char s[601000]; long long m; long long ans = 0; long long len; long long ll; long long mod = 1; long long reget(long long x) { long long reans = (10 * (ll - ((long long)(s[x] - 0 ) * mod) % m + m) % m + (long long)(s[x] - 0 ) + m...
#include <bits/stdc++.h> const long long int N = 2e5 + 10; using namespace std; int main() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); long long int n; cin >> n; string second; cin >> second; set<char> x; if (n > 26) { cout << -1 << endl; return 0; ...
#include <bits/stdc++.h> using namespace std; string s; struct substring { int f, b; bool operator>(const substring &o) const { int cmp = s.compare(f, b - f + 1, s, o.f, o.b - o.f + 1); return cmp != 0 ? cmp > 0 : f > o.f; } }; string kthSubstring(int k) { priority_queue<substring,...
#include <bits/stdc++.h> using namespace std; const int maxn = 1000005; map<long long, pair<int, int> > mm; int a[maxn]; int b[maxn]; long long s[maxn], s1[maxn]; int main() { int i, j, n; cin >> n; for (i = 1; i <= n; i++) { scanf( %d , &a[i]); s[i] = s[i - 1] + a[i]; } fo...
#include <bits/stdc++.h> using namespace std; const int N = 4e5 + 5; int n; int fa[N], r[N]; int rt[N], ls[N * 30], rs[N * 30], siz[N * 30], tot; long long sum[N * 30], ans; void update(int &rt, int l, int r, int p) { if (!rt) rt = ++tot; if (l == r) { siz[rt] = 1, sum[rt] = p; return;...
#include <bits/stdc++.h> int d[1005][1005][15][2]; char a[1005], b[1005]; int max(int a, int b) { if (a < b) return b; return a; } int main() { int n, m, k, i, j, l; scanf( %d %d %d , &n, &m, &k); for (i = 1; i <= n; i++) scanf( %c , &a[i]); for (i = 1; i <= m; i++) scanf( %c , &b[i]...
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, d; scanf( %d%d%d%d , &a, &b, &c, &d); double r = (1 - 1.0 * a / b) * (1 - 1.0 * c / d); r = 1.0 / (1 - r); printf( %.10f n , r * a / b); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, p, v, t, no = 0; cin >> n; for (int i = 0; i < n; i++) { cin >> p >> v >> t; if (p + v + t >= 2) { no++; } } cout << no << n ; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int x, t, a, b, da, db; scanf( %d%d%d%d%d%d , &x, &t, &a, &b, &da, &db); if (x == 0 \|\| (x <= a && x > a - da * t && (a - x) % da == 0) \|\| (x <= b && x > b - db * t && (b - x) % db == 0)) { cout << YES << endl; return 0; ...
#include <bits/stdc++.h> using namespace std; const int NMAX = 100005; int n, k; char s[NMAX]; int sum[NMAX]; int get(int l, int r) { l = max(1, l); r = min(r, n); return sum[r] - sum[l - 1]; } int main() { cin.sync_with_stdio(false); cin >> n >> k; cin >> (s + 1); for (int i...
#include <bits/stdc++.h> using namespace std; inline int read() { register int x = 0, f = 1; register char ch = getchar(); while (ch < 0 \|\| ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) x = x * 10 + (ch ^ 48), ch = getchar(); return x * f; ...
#include <bits/stdc++.h> using namespace std; char ans[300][300]; string s; int cnt[300]; int bal[300]; int n, m; void f(int l, int r, int ll, int rr) { if (l + 1 == r) { for (int i = 0; i < n / 2 - bal[r]; ++i) { ans[n / 2 + i][ll] = \| ; ans[n / 2 - i][ll] = \| ; ans[n ...
#include <bits/stdc++.h> using namespace std; mt19937 rnd(time(0)); bool isPrime(long long a) { long long i; for (i = 2; i * i <= a; i++) { if (a % i == 0) { return 0; } } return (a != 1); } bool isPalindrom(const string &s, int l, int r) { for (int i = 0; i < (r - l + ...
#include <bits/stdc++.h> using namespace std; int main() { long long int n, m, k, t, sum = 0, a, b, p; cin >> t; while (t--) { bool fg = 0; p = 0; k = 0; sum = 0; cin >> a >> b; string s; cin >> s; n = s.size(); for (long long int i = 0; i <= n - 1; ...
#include <bits/stdc++.h> using namespace std; int n, m, a; int main() { scanf( %d%d , &n, &m); if (n == 1) printf( 1 n ); else { if (m > n / 2) printf( %d n , m - 1); else printf( %d n , m + 1); } return 0; }
#include <bits/stdc++.h> using namespace std; int n, a, b, res; int main() { cin >> n >> a >> b; for (int i = 1; i <= min(a, b); i++) { if (a / i + b / i >= n) { res = i; } } cout << res; return 0; }
#include <bits/stdc++.h> using namespace std; const string ALICE = Alice , BOB = Bob ; void solve_case() { int N, K; cin >> N >> K; if (K % 3 != 0) { cout << (N % 3 != 0 ? ALICE : BOB) << n ; return; } N %= K + 1; cout << (N % 3 == 0 && N < K ? BOB : ALICE) << n ; } i...
#include <bits/stdc++.h> using namespace std; int a[105][105], u[105], v[105]; int main() { int n, m, k; scanf( %d%d%d , &n, &m, &k); for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) scanf( %d , &a[i][j]); for (int j = 0; j < m; j++) { int cnt[105] = {}; for (int i = 0; i ...
#include <bits/stdc++.h> using namespace std; int main() { long long n, m; cin >> n >> m; if (2 * m >= n) cout << 0; else cout << n - 2 * m; cout << ; for (long long i = 0; i <= n; i++) { if ((i * (i - 1)) / 2 >= m) { cout << n - i; break; } } ...
#include <bits/stdc++.h> using namespace std; const int P = 1e9 + 7, INF = 0x3f3f3f3f; long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } long long qpow(long long a, long long n) { long long r = 1 % P; for (a %= P; n; a = a * a % P, n >>= 1) if (n & 1) r = r * a % P; ret...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; const int M = 22; int n, a[N]; long long f[N][M][2]; vector<int> v[N]; long long ans = 0; void dfs(int x, int tr) { ans += a[x]; for (int i = 0; i < M; i++) { f[x][i][(a[x] >> i) & 1]++; } for (auto u : v[x]) ...
#include <bits/stdc++.h> using namespace std; const int DIM = 1005; bitset<DIM> oki; int val[DIM], nxt[DIM]; int main(void) { ios ::sync_with_stdio(false); cin.tie(); cout.tie(); int n, m, ans = 0; cin >> n >> m; for (int i = 1; i <= n; ++i) cin >> val[i], nxt[i] = -1; for (int i =...
// Author: wlzhouzhuan #pragma GCC optimize( Ofast ) #pragma GCC target( avx ) #include <bits/stdc++.h> using namespace std; #define ull unsigned long long namespace IO { const int SIZE = 1 << 23; char ibuf[SIZE], iS, iT; char obuf[SIZE], oS = obuf, oT = oS + SIZE - 1; bool flush(...
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; if (n > m) swap(m, n); long long cc = 0; for (int i = 1; i <= n; i++) { cc += (m + i) / 5 - i / 5; } cout << cc << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { char c[101]; int count = 0; int sum = 0; while (cin.getline(c, 101)) { if (c[0] == + ) { count++; continue; } if (c[0] == - ) { count--; continue; } int x = 0; for (; c[x]...
#include <bits/stdc++.h> using namespace std; void __print(int x) { cerr << x; } void __print(long x) { cerr << x; } void __print(long long x) { cerr << x; } void __print(unsigned x) { cerr << x; } void __print(unsigned long x) { cerr << x; } void __print(unsigned long long x) { cerr << x; } void __prin...
#include <bits/stdc++.h> using namespace std; long long n, k; int log2(long long x) { int ret = 0; while (x > 0) { x /= 2; ret++; } return ret; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); clock_t ck; ck = clock(); cin >> n >> k; ...
#include<bits/stdc++.h> using namespace std; int n; inline int lst(int i){return i==1?n:i-1;} inline int nxt(int i){return i==n?1:i+1;} inline int lst(int i,int d){return (((i-d-1)%n+n)%n+1);} inline int nxt(int i,int d){return ((i+d-1)%n+1);} inline int getval(){ fflush(stdout); int val; s...
#include <bits/stdc++.h> using namespace std; const int N = 100000 + 77; int n, q; long long a[N]; vector<long long> V, Ps; int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %lld , a + i); if (n == 1) { int q; scanf( %d , &q); long long x, y; while (q--) {...
#include <bits/stdc++.h> using namespace std; vector<int> prefix_function(string s) { int n = (int)s.length(); vector<int> pi(n); for (int i = 1; i < n; ++i) { int j = pi[i - 1]; while (j > 0 && s[i] != s[j]) j = pi[j - 1]; if (s[i] == s[j]) ++j; pi[i] = j; } return pi; ...
#include <bits/stdc++.h> using namespace std; int main() { long long a, b; cin >> a >> b; long long d = abs(a - b); long long p1 = (d + 1) / 2, p2 = d / 2; long long s1 = (p1 * (p1 + 1)) / 2, s2 = (p2 * (p2 + 1)) / 2; cout << s1 + s2; }
#include <bits/stdc++.h> using namespace std; int n, q; int a[200010]; int last[200010]; int x = -1, y = -1, z = -1; stack<int> t; int main() { scanf( %d%d , &n, &q); for (int i = 0; i < n; i++) { scanf( %d , &a[i]); if (a[i] == 0) { z = i; if (i) a[i] = a[i - 1]; ...
#include <bits/stdc++.h> char c[99]; int i, x; int main() { for (;;) { scanf( %s , c); fflush(stdout); ; if (*c == e ) break; for (i = 2; i <= 1 << 30; i <<= 1) { printf( ? %d %d n , i, i >> 1); fflush(stdout); ; scanf( %s , c); fflush(std...
#include <bits/stdc++.h> const int maxn = 1e5 + 500; const int mod = 1e9 + 7; const int inf = 123456789; using namespace std; int n, t, a, b, c; vector<int> v[maxn], ans2[maxn]; vector<int> ans; set<int> st[maxn]; int vis[maxn]; map<tuple<int, int>, int> mp; void add(int a, int b, int i) { if ...
#include <bits/stdc++.h> using namespace std; int main() { int Tn; cin >> Tn; while (Tn--) { int n, x; cin >> n >> x; int mx = 0, flag = 0; while (n--) { int t; cin >> t; if (t == x) flag = 1; mx = max(mx, t); } if (!flag) print...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1010; long long c[2][2][MAXN][MAXN] = {0}; int n, m; long long val; int lowbit(int x) { return x & -x; } void add(int a, int b) { for (int i = a; i <= n; i += lowbit(i)) for (int j = b; j <= n; j += lowbit(j)) c[a & 1][b & 1][i][j] ^...
#include <bits/stdc++.h> using namespace std; constexpr int maxn = 1010; constexpr int dx[5] = {0, 0, 1, -1}; constexpr int dy[5] = {1, -1, 0, 0}; using Node = struct { int x, y, v; }; char G[maxn][maxn]; bool vis[maxn][maxn]; int n, m; vector<Node> p, ret; inline bool ok(int x, int y) { return x >=...
#include <bits/stdc++.h> using namespace std; int dp[1003][1003][11][2]; string s, t; int n, m; int k; int rec(int i, int j, int how_k, int op) { if (how_k > k) return -1e9; if (i >= n \|\| j >= m) { if (how_k == k && !op) return 0; return -1e9; } if (s[i] != t[j] && op) return -1e...
#include <bits/stdc++.h> using namespace std; const int maxn = 200500; int mapp[maxn], num[maxn], ans[maxn]; int main() { int n, a, b, k; while (cin >> n >> a >> b >> k) { memset(ans, 0, sizeof(ans)); char c; for (int i = 0; i < n; i++) { cin >> c; mapp[i] = c - 0 ; ...
#include <bits/stdc++.h> using namespace std; long long n, n1, n2, a[111111], sum1 = 0, sum2 = 0; int main() { cin >> n >> n1 >> n2; for (int i = 0; i < n; i++) cin >> a[i]; if (n1 > n2) swap(n1, n2); sort(a, a + n); reverse(a, a + n); int i = 0; int m1 = n1; int m2 = n2; while...
#include <bits/stdc++.h> using namespace std; const int N = 110000; int s1, s2; int n, a[N]; int mi[17][N * 2], ma[17][N * 2]; int BB[N * 2]; int getmi(int l, int r) { return min(mi[BB[r - l + 1]][l], mi[BB[r - l + 1]][r - (1 << BB[r - l + 1]) + 1]); } int getma(int l, int r) { ...
#pragma GCC diagnostic ignored -Wunused-parameter #define _USE_MATH_DEFINES #include <bits/stdc++.h> using namespace std; #define INP solve #define OUT solve const long long INF_LL = 8e18; const int INF = 1e9 + 100; const int MOD = 1e9 + 7; //const int Base = 311;9 const long double E...
#include <bits/stdc++.h> #define int long long #define boost ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL) using namespace std; #define MOD 1000000007 #define nline n #define pb push_back #define mp make_pair #define fi first #d...
#include <bits/stdc++.h> using namespace std; const int N = 503; int m, n, vis[N][N]; vector<int> adj[N * N]; void init() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); } int id(int x, int y) { return (x - 1) * n + y; } struct ds { char c; int x, y; }; vector<ds> V; void p...
#include <bits/stdc++.h> using namespace std; queue<int> q; const int maxn = 40007; const int maxm = 800007; const int inf = 0x7f7f7f7f; struct E { int u, v, w, cf; } e[maxm]; int first[maxn], nt[maxm], ES = 1; bool acc[maxm]; inline void addE(int u, int v, int w, int cf) { e[++ES] = (E){u, ...
#include <bits/stdc++.h> using namespace std; const int N = 1e6; int Left[N], Right[N]; void pre(int node) { if (node == -1) return; pre(Left[node]); printf( %d n , node + 1); pre(Right[node]); } int main() { memset(Left, -1, sizeof Left); memset(Right, -1, sizeof Right); string ...
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 10; const int maxm = 1e3 + 5; const int mod = 1e9 + 7; const int inf = 0x3f3f3f3f; int a[maxn], ans[maxn], l[maxn][6], r[maxn][6]; inline void solve() { int n; scanf( %d , &n); for (int i = 1; i < n + 1; i++) scanf( %d , &a[i...
#include <bits/stdc++.h> using namespace std; struct Edge { int v, next; } edge[2050]; int e, ft[2050]; int a, n, m; bool rain[2050]; int x[2050], p[2050]; long long dp[2050][2050]; long long opt[2050]; int main() { int l, r; while (cin >> a >> n >> m) { e = 0; for (int i = 0...
#include <bits/stdc++.h> using namespace std; void fastIO(void); void decimal(int); long long int modmulti(long long int, long long int, long long int); long long int modadd(long long int, long long int, long long int); long long int modpower(long long int, long long int, long long int); long long int gcd...
#include <bits/stdc++.h> using namespace std; const static int maxN = 1000; struct { int r, c; } tooth[maxN]; int toothrow[maxN + 1]; int main() { int n, m, k; int i; int ans; while (scanf( %d%d%d , &n, &m, &k) != EOF) { for (i = 0; i < n; i++) { scanf( %d%d , &tooth[i].r, ...
#include <bits/stdc++.h> using namespace std; namespace { using namespace std; template <typename flow_t = long long> struct PushRelabel { struct Edge { int to, rev; flow_t f, c; }; vector<vector<Edge>> g; vector<flow_t> ec; vector<Edge*> cur; vector<vector<int>> hs; ve...
#include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 5; int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } void solve() { vector<long long> v(14); long long curr_score = 0; long long o = 0; for (int i = 0; i < 14; i++) { cin >> v[i]; } for (int i = 0; i < 14; i+...
#include <bits/stdc++.h> using namespace std; struct edge { long long a, b, cost; edge(long long x, long long y, long long z) : a(x), b(y), cost(z){}; }; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long n, k, p; cin >> n >> k >> p; vector<long long> v(n), a(k);...
#include <bits/stdc++.h> using namespace std; unsigned long long ans; int n, i, j, k, u, v; int size[80011], fa[80011]; vector<int> e[80011]; void dfs(int now) { unsigned long long o = 0; size[now] = 1; for (int i = 0; i < e[now].size(); i++) if (e[now][i] != fa[now]) { fa[e[now][i...
#include <bits/stdc++.h> using namespace std; long long ans = 0; string str; int n; int main() { ios::sync_with_stdio(false); cin >> n; cin >> str; for (int i = 0; i < n; ++i) ans += (str[i] - 0 ) & 1 ? 0 : i + 1; cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; } inline void normal(long long int &a) { a %= 1000000007; (a < 0) && (a += 1000000007); } inline long long int modMul(long long int a, long long int b) { a %= 1000000007, b %= 1000000007; ...
#include <bits/stdc++.h> using namespace std; long long test(vector<long long>& h, int l, int r) { long long ret = 0; for (int i = l; i < r; i++) { long long tmp = 0; for (int j = i + 1; j < r; j++) { tmp = max(tmp, abs(h[j] - h[j - 1])); ret += tmp; } } return ret;...
#include <bits/stdc++.h> using namespace std; long long cont = 0; template <typename T, typename F> struct AHO_CORASICK { const long long ALPHA = 26; long long cv(F c) { return c - 0 ; } vector<map<long long, long long>> tgo; vector<long long> link; vector<long long> ch; vector<long lon...
#include <bits/stdc++.h> using namespace std; int main() { char name[5][10] = { Sheldon , Leonard , Penny , Rajesh , Howard }; int n, c = 5; scanf( %d , &n); while (n > c) { n -= c; c *= 2; } printf( %s n , name[(n - 1) / (c / 5)]); return 0; }
#include <bits/stdc++.h> using namespace std; void solve() { map<string, pair<string, long long>> best; long long n; cin >> n; for (long long i = 0; i < n; i++) { string name; long long score; cin >> name >> score; best[name].second = max(best[name].second, score); } ...
#include <bits/stdc++.h> using namespace std; void run_case() { string A, B, C, D; cin >> A; cin >> B; C = (A + B); sort(C.begin(), C.end()); cin >> D; sort(D.begin(), D.end()); if (C == D) cout << YES n ; else cout << NO n ; } int main() { ios_base::sync_wi...
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:200000000 ) const double EPS = 1E-9; const int INF = 1000000000; const long long INF64 = (long long)1E18; const double PI = 3.1415926535897932384626433832795; char s[2100][2100]; int ans[2100]; int main() { int n, m, k; ...
#include <bits/stdc++.h> using namespace std; inline int in() { int32_t x; scanf( %d , &x); return x; } inline long long lin() { long long x; scanf( %lld , &x); return x; } inline string get() { char ch[2000010]; scanf( %s , ch); return ch; } const int MAX_LG = 21; ...
#include <bits/stdc++.h> using namespace std; int f[100005], b[100005], fn[100005], bn[100005], fm, bm; int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 0; i < n; ++i) { scanf( %d , f + i); ++fn[f[i]]; fm = max(fm, f[i]); } for (int i = 0; i < m; ++i) { scanf(...
#include <bits/stdc++.h> using namespace std; int k; int n[3], t[3]; multiset<int> f[3]; int main() { cin >> k; cin >> n[0] >> n[1] >> n[2]; cin >> t[0] >> t[1] >> t[2]; for (int i = 0; i < 3; i++) for (int j = 0; j < n[i]; j++) f[i].insert(0); int ans = 0; for (int i = 0; i < k;...
#include <bits/stdc++.h> using namespace std; inline void read(int &x) { x = 0; char ch = getchar(), flag = 0; while ((ch > 9 \|\| ch < 0 ) && ch != - ) ch = getchar(); if (ch == - ) flag = 1, ch = getchar(); while (ch >= 0 && ch <= 9 ) x = x * 10 + ch - 0 , ch = getchar(); if (flag) ...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; if (n < 3) { cout << -1; return 0; } if (n == 3) { cout << 210; return 0; } int A[] = {50, 80, 170, 20, 200, 110}; int nA[] = {2, 2, 3, 2, 3, 3}; int j = 0; for (int i = 4; i <...

#include <bits/stdc++.h> using namespace std; const int inf = 2000000005; const int maxt = (1 << 20) + 5; int all[maxt], dp[2][maxt]; int best[30], a[30][30]; int mask[30][30], cost[30][30]; char str[30][30]; int n, m; int main() { scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) scanf( %s ,...

#include <bits/stdc++.h> using namespace std; int n, m, a[111], maxx; int main() { cin >> n >> m; for (int i = 0; i < n; ++i) cin >> a[i]; maxx = a[0]; for (int i = 1; i < n; ++i) maxx = max(maxx, a[i]); int tot = 0; for (int i = 0; i < n; ++i) tot += maxx - a[i]; int res2 = maxx + m; ...

#include <bits/stdc++.h> using namespace std; const long long int N = 1e5 + 5; const long long int M = 1e9 + 7; queue<pair<long long int, long long int> > pq; vector<long long int> v; map<long long int, long long int> mpp; set<pair<long long int, long long int> > st; long long int a[N], h[N], indx[N][2]...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast,no-stack-protector,unroll-loops ) #pragma GCC optimize( no-stack-protector,fast-math ) using namespace std; const long long N = 2e5 + 100, OO = 1e9 + 7, T = 1e6 + 10, M = 1e9 + 7, P = 6151, SQ = 280, lg = 20; long long n; long long pw(lo...

#include <bits/stdc++.h> using namespace std; int main() { int n, q = 0, s = 0, t = 0; cin >> n; for (int k = 1; k <= n; k++) { cin >> q; if (q == 1) { if (t == 1) s++; else { t++; s++; } } else { if (t == 1) { t--...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( avx,avx2,fma ) using namespace std; const int mod1 = 1000000007; long long gcd(long long a, long long b) { long long c = a % b; while (c != 0) { a = b; b = c; c = a % b; } return b; } long long iss...

#include <bits/stdc++.h> using namespace std; const int inf = 1e9 + 9; const int Mod = 1e9 + 7; inline int dcmp(double x) { if (fabs(x) <= 1e-9) return 0; return x < 0 ? -1 : 1; } inline int scan() { int x = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == -...

#include <bits/stdc++.h> using namespace std; int n; long long int dp[3005][3005]; int a[3005]; int tree[3005 * 3005][2]; int cnt = 0; long long int check(int t) { return !((a[t - 3] == 0 && a[t - 2] == 0 && a[t - 1] == 1 && a[t] == 1) || (a[t - 3] == 0 && a[t - 2] == 1 && a[t - 1] == 0 &...

#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( O2,no-stack-protector,unroll-loops,fast-math ) const long long maxn = 1e5 + 10, maxm = 5e2 + 10, lg = 21, mod = 1e9 + 7, inf = 1e18; long long n, m, s; long double dp[101][maxn], ps[maxn]; int main() { ios_base::sync_w...

#include <bits/stdc++.h> using namespace std; int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long n, p; cin >> n >> p; long long ans = 5 * 5000000; for (long long i = 1; i <= 5000000; i++) { long long left = n - p * i; if (left < 1) cont...

#include <bits/stdc++.h> using namespace std; const long long N = 1e5 + 7; long long n, a[N], cnt[N]; int32_t main() { cin >> n; for (long long i = 0; i < n; i++) cin >> a[i], cnt[a[i]]++; for (long long i = 1; i < N; i++) if (cnt[i] > 0) { if (cnt[i] > n / 2) cout << Bob ; ...

#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int N = 410; int cnt[N]; int temp[N]; long long cost[N][N]; long long dp[N][N]; long long n, m, k; const long long INF = (1LL) << 60; vector<int> v[200]; int main() { while (cin >> n >> m >> k) { memset(dp, 0, s...

#include <bits/stdc++.h> using namespace std; template <class T> void print(T& x) { cout << x; } template <class T, class U> void print(pair<T, U>& p) { cout << ( ; print(p.first); cout << , ; print(p.second); cout << ) ; } template <class T> void print(vector<T>& v) { ...

#include <bits/stdc++.h> using namespace std; int dp[1005]; long long ncr[1005][1005]; int ones(int n); void calc_ncr(); int main() { string n; int k; cin >> n; cin >> k; calc_ncr(); dp[1] = 0; for (int i(2); i < (1001); i++) { dp[i] = dp[ones(i)] + 1; } long long r...

#include<bits/stdc++.h> using namespace std; vector<int> vec[200001]; int ans[200001],arr[200001]; struct data { int l,r,mini,maxi,d; }; data tree[1000001]; void pushup(int x) { tree[x].maxi=max(tree[x<<1].maxi,tree[(x<<1)+1].maxi); tree[x].mini=min(tree[x<<1].mini,tree[(x<<1)+1].mini);...

#include <bits/stdc++.h> using namespace std; const long long INF(0x3f3f3f3f3f3f3f3fll); const long long inf(0x3f3f3f3f); template <typename T> void read(T &res) { bool flag = false; char ch; while (!isdigit(ch = getchar())) (ch == - ) && (flag = true); for (res = ch - 48; isdigit(ch = getcha...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:1024000000,1024000000 ) using namespace std; int const maxn = 3000005; string st[maxn]; int ab[200], ac[200], ad[200]; char b[maxn], c[maxn], d[maxn]; int main() { cin >> b >> c; int lenc = strlen(c); for (int i = 0; i < lenc; i++) { ...

#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 7; int a[N], n; double f(double x) { double sum = 0, mn = 0, mx = 0, ans = 0; for (int i = 0; i < n; i++) { mn = min(mn, sum); mx = max(mx, sum); sum += a[i] - x; ans = max(ans, abs(sum - mn)); ans = max(ans,...

#include <bits/stdc++.h> using namespace std; int n, ans; int a[6][6]; int convert(char c) { if (c == R ) return 1; if (c == G ) return 2; if (c == B ) return 3; if (c == Y ) return 4; if (c == W ) return 5; } void xuly(int state) { int i, j, dem, c1, c2; bool val[10], col[1...

#include <bits/stdc++.h> using namespace std; int main(int argc, char const *argv[]) { int a; int b; int dado[] = {1, 2, 3, 4, 5, 6}; cin >> a >> b; int r1, r2, r3; r1 = r2 = r3 = 0; for (int i = 0; i < 6; ++i) abs(dado[i] - a)<abs(dado[i] - b) ? r1++ : abs(dado[i] - a)> abs(dado[i...

#include <bits/stdc++.h> using namespace std; long unsigned int combi(long unsigned int a) { if (a == 0 || a == 1) return 0; return ((a * (a - 1)) / 2); } int main() { int n = 0; cin >> n; char arr[n]; int letras[26]; char temp = 0; long unsigned int res = 0; for (int i = 0; ...

#include <bits/stdc++.h> using namespace std; template <typename T, typename U> bool ckmin(T &a, U b) { return b < a ? a = b, true : false; } template <typename T, typename U> bool ckmax(T &a, U b) { return b > a ? a = b, true : false; } int tt; int main() { ios_base::sync_with_stdio(false...

#include <bits/stdc++.h> using namespace std; const int inf = (int)1e9 * 2; int n, m, ind; long long L[55], M[55], R[55], A[55], ans = -inf, un; bool all = 1; vector<int> a[55]; void calc() { for (int i = 0; i < n; i++) { R[i] = M[i] = L[i] = -inf; for (int j = 0; j < a[i].size(); j++) { ...

#include <bits/stdc++.h> using namespace std; double calc(pair<double, double> v1, pair<double, double> v2) { double dx = v1.first - v2.first; double dy = v1.second - v2.second; return sqrt(dx * dx + dy * dy); } int main() { int a, b, c; scanf( %d%d%d , &a, &b, &c); double x1, y1, x2, y2...

#include <bits/stdc++.h> using namespace std; bool isPrime(int n) { for (int i = 2; i < int(sqrt(n) + 1); i++) if (n % i == 0) return 0; return 1; } int main() { int n; cin >> n; if (isPrime(n)) return !(cout << 1 << n ); if (n & 1) { if (isPrime(n - 2)) cout << 2 <...

#include <bits/stdc++.h> const int MAXN = 1000000007; const int z = 0; using namespace std; int main() { int k, l, m, n, d, ans = 0; cin >> k >> l >> m >> n >> d; for (int i = 1; i <= d; i++) { if (i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0) { ans++; } } cout <<...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int tt, c = 0; cin >> tt; while (tt) { int n = tt; set<int> data; while (n % 2 == 0) { data.insert(2); n = n / 2; } for (i...

#include <bits/stdc++.h> using namespace std; using ll = long long; using P = pair<int, int>; constexpr int INF = 1001001001; constexpr int mod = 1000000007; template <class T> inline bool chmax(T& x, T y) { if (x < y) { x = y; return true; } return false; } template <class T> ...

#include <bits/stdc++.h> using namespace std; int main() { int n, a[1000]; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; } long int answer = 0; for (int i = 0; i < (n - 1); i++) { if (a[i] == 1 && a[i + 1] == 2) { answer += 3; } else if (a[i] == 1 && a[i + 1]...

#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int a = (s.size() + 1) / 2 - 1; int b = s.size() / 2 - 1; bool f00 = false, f01 = false, f10 = false, f11 = false; int cq = 0, c0 = 0, c1 = 0; for (int i = 0; i < s.size(); i++) { if (s[i] == 0 ) ...

#include <bits/stdc++.h> using namespace std; int main() { int t; double a, b, Zero = 0.5, One = 1.0; scanf( %d , &t); while (t--) { scanf( %lf%lf , &a, &b); if (a == 0 && b == 0) printf( %.10lf n , One); else if (a == 0) printf( %.10lf n , Zero); else if (b =...

#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; const int N = 1e5 + 5, M = 100 + 5, OO = 0x3f3f3f3f, mod = 1e9 + 7, base = 131, MOD2 = 1000136437; const double EPS = 1e-9; long double w, h, theta; complex<double> rotate(complex<double> &p, double a) { return p * pola...

#include <bits/stdc++.h> using namespace std; char buf[1 << 21], *p1 = buf, *p2 = buf; int read() { int w = 0, f = 1; char c = ; while (c < 0 || c > 9 ) c = (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 21, stdin), p1 == p2) ? EOF : *p1++), f = c ==...

#include <bits/stdc++.h> using namespace std; char s[601000]; long long m; long long ans = 0; long long len; long long ll; long long mod = 1; long long reget(long long x) { long long reans = (10 * (ll - ((long long)(s[x] - 0 ) * mod) % m + m) % m + (long long)(s[x] - 0 ) + m...

#include <bits/stdc++.h> const long long int N = 2e5 + 10; using namespace std; int main() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); long long int n; cin >> n; string second; cin >> second; set<char> x; if (n > 26) { cout << -1 << endl; return 0; ...

#include <bits/stdc++.h> using namespace std; string s; struct substring { int f, b; bool operator>(const substring &o) const { int cmp = s.compare(f, b - f + 1, s, o.f, o.b - o.f + 1); return cmp != 0 ? cmp > 0 : f > o.f; } }; string kthSubstring(int k) { priority_queue<substring,...

#include <bits/stdc++.h> using namespace std; const int maxn = 1000005; map<long long, pair<int, int> > mm; int a[maxn]; int b[maxn]; long long s[maxn], s1[maxn]; int main() { int i, j, n; cin >> n; for (i = 1; i <= n; i++) { scanf( %d , &a[i]); s[i] = s[i - 1] + a[i]; } fo...

#include <bits/stdc++.h> using namespace std; const int N = 4e5 + 5; int n; int fa[N], r[N]; int rt[N], ls[N * 30], rs[N * 30], siz[N * 30], tot; long long sum[N * 30], ans; void update(int &rt, int l, int r, int p) { if (!rt) rt = ++tot; if (l == r) { siz[rt] = 1, sum[rt] = p; return;...

#include <bits/stdc++.h> int d[1005][1005][15][2]; char a[1005], b[1005]; int max(int a, int b) { if (a < b) return b; return a; } int main() { int n, m, k, i, j, l; scanf( %d %d %d , &n, &m, &k); for (i = 1; i <= n; i++) scanf( %c , &a[i]); for (i = 1; i <= m; i++) scanf( %c , &b[i]...

#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, d; scanf( %d%d%d%d , &a, &b, &c, &d); double r = (1 - 1.0 * a / b) * (1 - 1.0 * c / d); r = 1.0 / (1 - r); printf( %.10f n , r * a / b); return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int n, p, v, t, no = 0; cin >> n; for (int i = 0; i < n; i++) { cin >> p >> v >> t; if (p + v + t >= 2) { no++; } } cout << no << n ; return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int x, t, a, b, da, db; scanf( %d%d%d%d%d%d , &x, &t, &a, &b, &da, &db); if (x == 0 || (x <= a && x > a - da * t && (a - x) % da == 0) || (x <= b && x > b - db * t && (b - x) % db == 0)) { cout << YES << endl; return 0; ...

#include <bits/stdc++.h> using namespace std; const int NMAX = 100005; int n, k; char s[NMAX]; int sum[NMAX]; int get(int l, int r) { l = max(1, l); r = min(r, n); return sum[r] - sum[l - 1]; } int main() { cin.sync_with_stdio(false); cin >> n >> k; cin >> (s + 1); for (int i...

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

#include <bits/stdc++.h> using namespace std; char ans[300][300]; string s; int cnt[300]; int bal[300]; int n, m; void f(int l, int r, int ll, int rr) { if (l + 1 == r) { for (int i = 0; i < n / 2 - bal[r]; ++i) { ans[n / 2 + i][ll] = | ; ans[n / 2 - i][ll] = | ; ans[n ...

#include <bits/stdc++.h> using namespace std; mt19937 rnd(time(0)); bool isPrime(long long a) { long long i; for (i = 2; i * i <= a; i++) { if (a % i == 0) { return 0; } } return (a != 1); } bool isPalindrom(const string &s, int l, int r) { for (int i = 0; i < (r - l + ...

#include <bits/stdc++.h> using namespace std; int main() { long long int n, m, k, t, sum = 0, a, b, p; cin >> t; while (t--) { bool fg = 0; p = 0; k = 0; sum = 0; cin >> a >> b; string s; cin >> s; n = s.size(); for (long long int i = 0; i <= n - 1; ...

#include <bits/stdc++.h> using namespace std; int n, m, a; int main() { scanf( %d%d , &n, &m); if (n == 1) printf( 1 n ); else { if (m > n / 2) printf( %d n , m - 1); else printf( %d n , m + 1); } return 0; }

#include <bits/stdc++.h> using namespace std; int n, a, b, res; int main() { cin >> n >> a >> b; for (int i = 1; i <= min(a, b); i++) { if (a / i + b / i >= n) { res = i; } } cout << res; return 0; }

#include <bits/stdc++.h> using namespace std; const string ALICE = Alice , BOB = Bob ; void solve_case() { int N, K; cin >> N >> K; if (K % 3 != 0) { cout << (N % 3 != 0 ? ALICE : BOB) << n ; return; } N %= K + 1; cout << (N % 3 == 0 && N < K ? BOB : ALICE) << n ; } i...

#include <bits/stdc++.h> using namespace std; int a[105][105], u[105], v[105]; int main() { int n, m, k; scanf( %d%d%d , &n, &m, &k); for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) scanf( %d , &a[i][j]); for (int j = 0; j < m; j++) { int cnt[105] = {}; for (int i = 0; i ...

#include <bits/stdc++.h> using namespace std; int main() { long long n, m; cin >> n >> m; if (2 * m >= n) cout << 0; else cout << n - 2 * m; cout << ; for (long long i = 0; i <= n; i++) { if ((i * (i - 1)) / 2 >= m) { cout << n - i; break; } } ...

#include <bits/stdc++.h> using namespace std; const int P = 1e9 + 7, INF = 0x3f3f3f3f; long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } long long qpow(long long a, long long n) { long long r = 1 % P; for (a %= P; n; a = a * a % P, n >>= 1) if (n & 1) r = r * a % P; ret...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; const int M = 22; int n, a[N]; long long f[N][M][2]; vector<int> v[N]; long long ans = 0; void dfs(int x, int tr) { ans += a[x]; for (int i = 0; i < M; i++) { f[x][i][(a[x] >> i) & 1]++; } for (auto u : v[x]) ...

#include <bits/stdc++.h> using namespace std; const int DIM = 1005; bitset<DIM> oki; int val[DIM], nxt[DIM]; int main(void) { ios ::sync_with_stdio(false); cin.tie(); cout.tie(); int n, m, ans = 0; cin >> n >> m; for (int i = 1; i <= n; ++i) cin >> val[i], nxt[i] = -1; for (int i =...

// Author: wlzhouzhuan #pragma GCC optimize( Ofast ) #pragma GCC target( avx ) #include <bits/stdc++.h> using namespace std; #define ull unsigned long long namespace IO { const int SIZE = 1 << 23; char ibuf[SIZE], *iS, *iT; char obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1; bool flush(...

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

#include <bits/stdc++.h> using namespace std; int main() { char c[101]; int count = 0; int sum = 0; while (cin.getline(c, 101)) { if (c[0] == + ) { count++; continue; } if (c[0] == - ) { count--; continue; } int x = 0; for (; c[x]...

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

#include <bits/stdc++.h> using namespace std; long long n, k; int log2(long long x) { int ret = 0; while (x > 0) { x /= 2; ret++; } return ret; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); clock_t ck; ck = clock(); cin >> n >> k; ...

#include<bits/stdc++.h> using namespace std; int n; inline int lst(int i){return i==1?n:i-1;} inline int nxt(int i){return i==n?1:i+1;} inline int lst(int i,int d){return (((i-d-1)%n+n)%n+1);} inline int nxt(int i,int d){return ((i+d-1)%n+1);} inline int getval(){ fflush(stdout); int val; s...

#include <bits/stdc++.h> using namespace std; const int N = 100000 + 77; int n, q; long long a[N]; vector<long long> V, Ps; int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %lld , a + i); if (n == 1) { int q; scanf( %d , &q); long long x, y; while (q--) {...

#include <bits/stdc++.h> using namespace std; vector<int> prefix_function(string s) { int n = (int)s.length(); vector<int> pi(n); for (int i = 1; i < n; ++i) { int j = pi[i - 1]; while (j > 0 && s[i] != s[j]) j = pi[j - 1]; if (s[i] == s[j]) ++j; pi[i] = j; } return pi; ...

#include <bits/stdc++.h> using namespace std; int main() { long long a, b; cin >> a >> b; long long d = abs(a - b); long long p1 = (d + 1) / 2, p2 = d / 2; long long s1 = (p1 * (p1 + 1)) / 2, s2 = (p2 * (p2 + 1)) / 2; cout << s1 + s2; }

#include <bits/stdc++.h> using namespace std; int n, q; int a[200010]; int last[200010]; int x = -1, y = -1, z = -1; stack<int> t; int main() { scanf( %d%d , &n, &q); for (int i = 0; i < n; i++) { scanf( %d , &a[i]); if (a[i] == 0) { z = i; if (i) a[i] = a[i - 1]; ...

#include <bits/stdc++.h> char c[99]; int i, x; int main() { for (;;) { scanf( %s , c); fflush(stdout); ; if (*c == e ) break; for (i = 2; i <= 1 << 30; i <<= 1) { printf( ? %d %d n , i, i >> 1); fflush(stdout); ; scanf( %s , c); fflush(std...

#include <bits/stdc++.h> const int maxn = 1e5 + 500; const int mod = 1e9 + 7; const int inf = 123456789; using namespace std; int n, t, a, b, c; vector<int> v[maxn], ans2[maxn]; vector<int> ans; set<int> st[maxn]; int vis[maxn]; map<tuple<int, int>, int> mp; void add(int a, int b, int i) { if ...

#include <bits/stdc++.h> using namespace std; int main() { int Tn; cin >> Tn; while (Tn--) { int n, x; cin >> n >> x; int mx = 0, flag = 0; while (n--) { int t; cin >> t; if (t == x) flag = 1; mx = max(mx, t); } if (!flag) print...

#include <bits/stdc++.h> using namespace std; const int MAXN = 1010; long long c[2][2][MAXN][MAXN] = {0}; int n, m; long long val; int lowbit(int x) { return x & -x; } void add(int a, int b) { for (int i = a; i <= n; i += lowbit(i)) for (int j = b; j <= n; j += lowbit(j)) c[a & 1][b & 1][i][j] ^...

#include <bits/stdc++.h> using namespace std; constexpr int maxn = 1010; constexpr int dx[5] = {0, 0, 1, -1}; constexpr int dy[5] = {1, -1, 0, 0}; using Node = struct { int x, y, v; }; char G[maxn][maxn]; bool vis[maxn][maxn]; int n, m; vector<Node> p, ret; inline bool ok(int x, int y) { return x >=...

#include <bits/stdc++.h> using namespace std; int dp[1003][1003][11][2]; string s, t; int n, m; int k; int rec(int i, int j, int how_k, int op) { if (how_k > k) return -1e9; if (i >= n || j >= m) { if (how_k == k && !op) return 0; return -1e9; } if (s[i] != t[j] && op) return -1e...

#include <bits/stdc++.h> using namespace std; const int maxn = 200500; int mapp[maxn], num[maxn], ans[maxn]; int main() { int n, a, b, k; while (cin >> n >> a >> b >> k) { memset(ans, 0, sizeof(ans)); char c; for (int i = 0; i < n; i++) { cin >> c; mapp[i] = c - 0 ; ...

#include <bits/stdc++.h> using namespace std; long long n, n1, n2, a[111111], sum1 = 0, sum2 = 0; int main() { cin >> n >> n1 >> n2; for (int i = 0; i < n; i++) cin >> a[i]; if (n1 > n2) swap(n1, n2); sort(a, a + n); reverse(a, a + n); int i = 0; int m1 = n1; int m2 = n2; while...

#include <bits/stdc++.h> using namespace std; const int N = 110000; int s1, s2; int n, a[N]; int mi[17][N * 2], ma[17][N * 2]; int BB[N * 2]; int getmi(int l, int r) { return min(mi[BB[r - l + 1]][l], mi[BB[r - l + 1]][r - (1 << BB[r - l + 1]) + 1]); } int getma(int l, int r) { ...

#pragma GCC diagnostic ignored -Wunused-parameter #define _USE_MATH_DEFINES #include <bits/stdc++.h> using namespace std; #define INP solve #define OUT solve const long long INF_LL = 8e18; const int INF = 1e9 + 100; const int MOD = 1e9 + 7; //const int Base = 311;9 const long double E...

#include <bits/stdc++.h> #define int long long #define boost ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL) using namespace std; #define MOD 1000000007 #define nline n #define pb push_back #define mp make_pair #define fi first #d...

#include <bits/stdc++.h> using namespace std; const int N = 503; int m, n, vis[N][N]; vector<int> adj[N * N]; void init() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); } int id(int x, int y) { return (x - 1) * n + y; } struct ds { char c; int x, y; }; vector<ds> V; void p...

#include <bits/stdc++.h> using namespace std; queue<int> q; const int maxn = 40007; const int maxm = 800007; const int inf = 0x7f7f7f7f; struct E { int u, v, w, cf; } e[maxm]; int first[maxn], nt[maxm], ES = 1; bool acc[maxm]; inline void addE(int u, int v, int w, int cf) { e[++ES] = (E){u, ...

#include <bits/stdc++.h> using namespace std; const int N = 1e6; int Left[N], Right[N]; void pre(int node) { if (node == -1) return; pre(Left[node]); printf( %d n , node + 1); pre(Right[node]); } int main() { memset(Left, -1, sizeof Left); memset(Right, -1, sizeof Right); string ...

#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 10; const int maxm = 1e3 + 5; const int mod = 1e9 + 7; const int inf = 0x3f3f3f3f; int a[maxn], ans[maxn], l[maxn][6], r[maxn][6]; inline void solve() { int n; scanf( %d , &n); for (int i = 1; i < n + 1; i++) scanf( %d , &a[i...

#include <bits/stdc++.h> using namespace std; struct Edge { int v, next; } edge[2050]; int e, ft[2050]; int a, n, m; bool rain[2050]; int x[2050], p[2050]; long long dp[2050][2050]; long long opt[2050]; int main() { int l, r; while (cin >> a >> n >> m) { e = 0; for (int i = 0...

#include <bits/stdc++.h> using namespace std; void fastIO(void); void decimal(int); long long int modmulti(long long int, long long int, long long int); long long int modadd(long long int, long long int, long long int); long long int modpower(long long int, long long int, long long int); long long int gcd...

#include <bits/stdc++.h> using namespace std; const static int maxN = 1000; struct { int r, c; } tooth[maxN]; int toothrow[maxN + 1]; int main() { int n, m, k; int i; int ans; while (scanf( %d%d%d , &n, &m, &k) != EOF) { for (i = 0; i < n; i++) { scanf( %d%d , &tooth[i].r, ...

#include <bits/stdc++.h> using namespace std; namespace { using namespace std; template <typename flow_t = long long> struct PushRelabel { struct Edge { int to, rev; flow_t f, c; }; vector<vector<Edge>> g; vector<flow_t> ec; vector<Edge*> cur; vector<vector<int>> hs; ve...

#include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 5; int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } void solve() { vector<long long> v(14); long long curr_score = 0; long long o = 0; for (int i = 0; i < 14; i++) { cin >> v[i]; } for (int i = 0; i < 14; i+...

#include <bits/stdc++.h> using namespace std; struct edge { long long a, b, cost; edge(long long x, long long y, long long z) : a(x), b(y), cost(z){}; }; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long n, k, p; cin >> n >> k >> p; vector<long long> v(n), a(k);...

#include <bits/stdc++.h> using namespace std; unsigned long long ans; int n, i, j, k, u, v; int size[80011], fa[80011]; vector<int> e[80011]; void dfs(int now) { unsigned long long o = 0; size[now] = 1; for (int i = 0; i < e[now].size(); i++) if (e[now][i] != fa[now]) { fa[e[now][i...

#include <bits/stdc++.h> using namespace std; long long ans = 0; string str; int n; int main() { ios::sync_with_stdio(false); cin >> n; cin >> str; for (int i = 0; i < n; ++i) ans += (str[i] - 0 ) & 1 ? 0 : i + 1; cout << ans << endl; return 0; }

#include <bits/stdc++.h> using namespace std; inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; } inline void normal(long long int &a) { a %= 1000000007; (a < 0) && (a += 1000000007); } inline long long int modMul(long long int a, long long int b) { a %= 1000000007, b %= 1000000007; ...

#include <bits/stdc++.h> using namespace std; long long test(vector<long long>& h, int l, int r) { long long ret = 0; for (int i = l; i < r; i++) { long long tmp = 0; for (int j = i + 1; j < r; j++) { tmp = max(tmp, abs(h[j] - h[j - 1])); ret += tmp; } } return ret;...

#include <bits/stdc++.h> using namespace std; long long cont = 0; template <typename T, typename F> struct AHO_CORASICK { const long long ALPHA = 26; long long cv(F c) { return c - 0 ; } vector<map<long long, long long>> tgo; vector<long long> link; vector<long long> ch; vector<long lon...

#include <bits/stdc++.h> using namespace std; int main() { char name[5][10] = { Sheldon , Leonard , Penny , Rajesh , Howard }; int n, c = 5; scanf( %d , &n); while (n > c) { n -= c; c *= 2; } printf( %s n , name[(n - 1) / (c / 5)]); return 0; }

#include <bits/stdc++.h> using namespace std; void solve() { map<string, pair<string, long long>> best; long long n; cin >> n; for (long long i = 0; i < n; i++) { string name; long long score; cin >> name >> score; best[name].second = max(best[name].second, score); } ...

#include <bits/stdc++.h> using namespace std; void run_case() { string A, B, C, D; cin >> A; cin >> B; C = (A + B); sort(C.begin(), C.end()); cin >> D; sort(D.begin(), D.end()); if (C == D) cout << YES n ; else cout << NO n ; } int main() { ios_base::sync_wi...

#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:200000000 ) const double EPS = 1E-9; const int INF = 1000000000; const long long INF64 = (long long)1E18; const double PI = 3.1415926535897932384626433832795; char s[2100][2100]; int ans[2100]; int main() { int n, m, k; ...

#include <bits/stdc++.h> using namespace std; inline int in() { int32_t x; scanf( %d , &x); return x; } inline long long lin() { long long x; scanf( %lld , &x); return x; } inline string get() { char ch[2000010]; scanf( %s , ch); return ch; } const int MAX_LG = 21; ...

#include <bits/stdc++.h> using namespace std; int f[100005], b[100005], fn[100005], bn[100005], fm, bm; int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 0; i < n; ++i) { scanf( %d , f + i); ++fn[f[i]]; fm = max(fm, f[i]); } for (int i = 0; i < m; ++i) { scanf(...

#include <bits/stdc++.h> using namespace std; int k; int n[3], t[3]; multiset<int> f[3]; int main() { cin >> k; cin >> n[0] >> n[1] >> n[2]; cin >> t[0] >> t[1] >> t[2]; for (int i = 0; i < 3; i++) for (int j = 0; j < n[i]; j++) f[i].insert(0); int ans = 0; for (int i = 0; i < k;...

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

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; if (n < 3) { cout << -1; return 0; } if (n == 3) { cout << 210; return 0; } int A[] = {50, 80, 170, 20, 200, 110}; int nA[] = {2, 2, 3, 2, 3, 3}; int j = 0; for (int i = 4; i <...