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; vector<int> v1, v2, v3; int n, flag; int main() { cin >> n; int t = 0; string s1, s2; cin >> s1 >> s2; for (int i = 0; i < n; i++) { if (s1[i] == 1 && s2[i] == 0 ) v1.push_back(i + 1); if (s1[i] == 0 && s2[i] == 1 ) v1.push_back...
#include <bits/stdc++.h> using namespace std; vector<string> ans; int main() { char c; string ss = ; while ((c = getchar()) != n ) { if ( a <= c && z >= c) { ss += c; continue; } else if (c == ) { if (!ss.empty()) { ans.push_back(ss); s...
#include <bits/stdc++.h> using namespace std; using ll = long long; class SegTree { private: const ll NEUT = 4 * (ll)1e18; vector<ll> seg, tag; int h = 1; void apply(int i, ll v) { seg[i] += v; if (i < h) tag[i] += v; } void push(int i) { if (tag[i] == 0) return; ...
#include <bits/stdc++.h> using namespace std; const int64_t MAXN = 1000005; const int64_t MAXINT = 2147483098; const int64_t MAXLL = 9223372036854775258LL; const int64_t MOD = 1e9 + 7; void solve() { int64_t n; cin >> n; vector<int64_t> a(n + 2); for (int64_t i = 1; i < n + 1; ++i) cin >> a[...
#include <bits/stdc++.h> //#include <ext/pb_ds/assoc_container.hpp> //using namespace __gnu_pbds; using namespace std; typedef long long ll; typedef long double ld; //typedef tree<int,null_type,less<int >,rb_tree_tag,tree_order_statistics_node_update>indexed_set; template<class T1, class T2> ostream &op...
#include <bits/stdc++.h> using namespace std; template <typename T, typename U> ostream& operator<<(ostream& o, const pair<T, U>& x) { o << ( << x.first << , << x.second << ) ; return o; } template <typename T> ostream& operator<<(ostream& o, const vector<T>& x) { o << [ ; int b = 0; ...
#include <bits/stdc++.h> using namespace std; int n, k; char line[100010]; vector<int> cua; int main(int argc, char *argv[]) { scanf( %d%d , &n, &k); scanf( %c , &line[0]); for (int i = 1; i <= n; i++) { scanf( %c , &line[i]); if (line[i] == 7 && line[i - 1] == 4 ) { cua.pus...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:256000000 ) using namespace std; const int INF = (int)(1e9 + 1337); const long long LINF = (long long)(4e18); const double EPS = 1e-11; const int MOD = 1000000007; const int HBASE = 1003; const int MAXN = 200500; int n, m; char s[MAXN]; pair...
#include <bits/stdc++.h> using namespace std; int k, d; char n[100005]; int a[100005]; int main() { scanf( %d , &k); d = 0; scanf( %s , &n); for (int i = 0; i < strlen(n); i++) { d += n[i] - 0 ; a[i + 1] = n[i] - 0 ; } if (d >= k) { cout << 0; return 0; }...
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1); const long long mod = 1e9 + 7; const long long N = 1e5 + 5, K = 105; const int si = (1 << 20); const long long add = 1e4; const long long M = 100 + 5; const double INFdb = 1e10; int n; vector<int> v[N]; bool check[N]; int ...
#include <bits/stdc++.h> using namespace std; int N; int main() { cin >> N; if (!(N % 2)) puts( home ); else puts( contest ); return 0; }
#include <bits/stdc++.h> using namespace std; vector<vector<short>> g; vector<vector<short>> dp; short rec(int l, int r) { if (l > r) return 0; if (dp[l][r] != -1) return dp[l][r]; short whole = binary_search(begin(g[l]), end(g[l]), r); short ret = whole + rec(l + 1, r); for (auto p : g[l]) ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 5; char str[MAXN]; class Value { public: char c1, c2, last_c1, last_c2; int pos, l1, sz; Value() { c1 = 0; c2 = 0; pos = 0; l1 = 0; last_c1 = 0; last_c2 = 0; } void push_front(char c) ...
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; long long int mypow(long long int a, int b) { if (b < 0) return 0; long long int ans = 1; for (; b; b >>= 1, a = a * a % mod) { if (b & 1) ans = ans * a % mod; } return ans; } void add(long long int &a, long...
#include <bits/stdc++.h> using namespace std; double pi = acos(-1); int n; bool initial[2000][2000]; bool blur[2000][2000]; pair<int, int> direction[8] = { make_pair(1, 0), make_pair(1, 1), make_pair(0, 1), make_pair(-1, 1), make_pair(-1, 0), make_pair(-1, -1), make_pair(0, -1), make_pair(1,...
#include <bits/stdc++.h> using namespace std; const char NL = n ; long long int n; vector<long long int> a, dp; long long int s(long long int i, long long int j) { if (a[i] > a[j]) return dp[j] + 1; return 1; } void solve() { for (long long int i = 2; i < n + 1; i++) { long long int m ...
#include <bits/stdc++.h> using namespace std; bool debug = 0; int n, m, k; int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0}; string direc = RDLU ; long long ln, lk, lm; void etp(bool f = 0) { puts(f ? YES : NO ); exit(0); } void addmod(int &x, int y, int mod = 1000000007) { x += y; ...
#include <bits/stdc++.h> int main() { int N; std::cin >> N; std::vector<int> array(N); for (int i = 0; i < N; ++i) std::cin >> array[i]; std::sort(array.begin(), array.end()); if (1 == array.back()) array[N - 1] = 2; else array[N - 1] = 1; std::sort(array.begin(), array.end...
#include <bits/stdc++.h> using namespace std; long long tree[4 * 1000005]; void update(int v, int l, int r, int ind) { if (l > r \|\| l > ind \|\| ind > r) return; if (l == r) { tree[v] = 1; return; } int mid = (l + r) / 2; update(2 * v, l, mid, ind); update(2 * v + 1, mid + 1, r, ...
#include <bits/stdc++.h> using namespace std; const long long iinf = 1e9 + 10; const long long inf = 1ll << 60; const long long mod = 1e9 + 87; void GG() { cout << 0 n ; exit(0); } long long mpow(long long a, long long n, long long mo = mod) { long long re = 1; while (n > 0) { if (n...
#include <bits/stdc++.h> using namespace std; string ans; map<pair<string, int>, int> dp; bool check(string second) { int mul = 1; int num = 0; int i = second.size() - 1; num = num + ((second[i] - 0 ) * 1) % 8; i--; if (second.size() > 1) { num = num + ((second[i] - 0 ) * 10) % 8...
#include <bits/stdc++.h> using namespace std; char s[5010]; int main() { scanf( %s , s); int n = (int)strlen(s); int res = 0; for (int i = 0; i < n; i++) { int mn = 0, mx = 0; for (int j = i; j < n; j++) { if (s[j] == ( ) { mn++, mx++; } else if (s[j] == ) )...
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( Ofast ) #pragma GCC optimize( unroll-loops ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) template <class S, class T> ostream& operator<<(ostream& os, const pair<S, T>& p) { return os << ( << p.first <...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5, INF = 1e9; struct T { int l, r, d[3], mn[3], mx[3]; } t[N]; int n, m, q, a, b, c, lx, rx, ly, ry, lz, rz, rt, h[N], D; inline bool cmp(int a, int b) { return t[a].d[D] < t[b].d[D]; } inline void update(int x) { int l = t[x].l, r ...
#include <bits/stdc++.h> using namespace std; int a[200005], n, m, k, ans; queue<int> que; inline int gi() { register int x = 0, q = 1; register char ch = getchar(); while ((ch < 0 \|\| ch > 9 ) && ch != - ) ch = getchar(); if (ch == - ) q = -1, ch = getchar(); while (ch >= 0 && ch <= ...
#include <bits/stdc++.h> using namespace std; vector<vector<pair<int, int>>> G; int main() { int n, m; scanf( %d%d , &n, &m); G.resize(n + 1); for (int i = 1; i <= n; i++) G[i].push_back(make_pair(i, i)); for (int i = 0; i < m; i++) { int a, b; scanf( %d%d , &a, &b); G[a].pus...
#include <bits/stdc++.h> int main() { int n, m, t; scanf( %d %d , &n, &m); t = (n / 2); t -= (t & 1); for (int i = 1; i < n; i++) { if (i == 1) printf( > ); else printf( ^ ); if (i & 1) { for (int j = 2; j <= (n - t < n - 2 ? n - t : n - 2); j++) printf( >...
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:36777216 ) #pragma GCC optimize( O2 ) template <class T> inline void RD(T &); template <class T> inline void OT(const T &); inline int RD() { int x; RD(x); return x; } template <class T> inline T &_RD(T &x) {...
#include <bits/stdc++.h> using namespace std; long long int power(long long int x, long long int y) { long long int res = 1; x %= 1000000007; while (y > 0) { if (y & 1) res = (res * x) % 1000000007; y = y >> 1; x = (x * x) % 1000000007; } return res % 1000000007; } int32_t ...
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const int maxn = 2e5 + 5; long long x[maxn]; long long y[maxn]; int main() { long long x0, y0, ax, ay, bx, by; cin >> x[0] >> y[0] >> ax >> ay >> bx >> by; long long xs, ys, t; cin >> xs >> ys >> t; if (x[0] == y[0...
#include <bits/stdc++.h> using namespace std; long long int sub2(long long int n) { return (n + 3 * n * n) / 2; } int main() { long long int t; cin >> t; vector<long long int> ans; while (t--) { long long int k; cin >> k; long long int m = 0; while (k >= 2) { long l...
#include <bits/stdc++.h> int main() { int t; scanf( %d , &t); while (t--) { long long a, b, k; scanf( %lld %lld %lld , &a, &b, &k); printf( %lld n , (k / 2) * (a - b) + a * (k % 2)); } return 0; }
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) const double PI = acos(-1); using namespace std; const int MAX = 100 * 1000 + 10; int A[MAX], B[MAX], n, pos[MAX]; int diff[MAX << 1]; int mx[MAX], mn[MAX]; deque<int> dq; const int oo = 1 << 28; int main() { scanf( %d , &n); for (int i = 0...
#include <bits/stdc++.h> using namespace std; template <typename T> ostream &operator<<(ostream &out, const vector<T> &v) { out << { ; for (const T &a : v) out << a << , ; out << } ; return out; } template <typename S, typename T> ostream &operator<<(ostream &out, const pair<S, T> &p) { ...
#include <bits/stdc++.h> using namespace std; long long power(long long x, unsigned long long y, unsigned long long m) { if (y == 0) return 1; long long p = power(x, y / 2, m) % m; p = (p * p) % m; return (y % 2 == 0) ? p : (x * p) % m; } int32_t main() { ios_base::sync_with_stdio(false); ...
#include <bits/stdc++.h> using namespace std; const long long N = 4000010, oo = 1e9; long long x, y, c, n; bool ok(long long t) { long long ans = 2ll * t * (t + 1ll) - 4ll * t + 1l; if (t > x) { ans -= (t - x) * (t - x); } if (t > n - x + 1) { ans -= (t - n + x - 1) * (t - n + x - 1)...
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); } template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); } template <typename T> T inf; template <> con...
#include <bits/stdc++.h> using namespace std; const long long int MOD = 1e6 + 3; const long double PI = 2 * acos(0.0); const vector<long long int> dx = {1, -1, 0, 0}; const vector<long long int> dy = {0, 0, 1, -1}; template <typename T = long long int> vector<T> ga(long long int n, bool oneIndexed = false...
#include <bits/stdc++.h> using namespace std; int main(int argc, char **argv) { int n; scanf( %d , &n); vector<int> f(n + 1, -1); vector<int> g(n + 1, -1); vector<int> h(1); int m = 0; vector<bool> b(n + 1, false); for (int i = 1; i <= n; i++) { scanf( %d , &f[i]); if (f[...
#include <bits/stdc++.h> using namespace std; const long long int mod = 1000000007; const long long int mymax = 1e18; const long long int mymin = -1e18; const double PIE = 3.1415926536; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t, n, m, d, k, ti, lef, rit; bool ans; vect...
#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; const double eps = 1e-8; const int nm = 1100005; int n, k, m, t; long long res; int cnt[nm], f[nm][23]; int POW(int x, int z) { if (z == 0) return 1; if (z == 1) return x % MOD; int u = POW(x, z >> 1); u = ((long l...
#include <bits/stdc++.h> using namespace std; struct edge { int u, v; }; int n, m, k, f[1000000 + 1], ans[1000000 + 1], q[1000000 + 1], lq = 0, rq = -1, cur; edge b[1000000 + 1]; vector<int> a[1000000 + 1], e[1000000 + 1]; bool remoed[10...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; string s; cin >> s; for (int k = 0; k < n - 1; k++) { if (s[k] > s[k + 1]) { cout << YES << endl; cout << k + 1 << << k + 2; return 0; } } cout << NO ; return 0; }...
#include <bits/stdc++.h> using namespace std; const int maxn = 1000 + 10; int main() { int c, d, n, m, k; while (scanf( %d %d , &c, &d) != EOF) { scanf( %d %d , &n, &m); scanf( %d , &k); int t = n * m - k; if (t <= 0) { printf( 0 n ); continue; } int res...
#include <bits/stdc++.h> using namespace std; int n, m; long long a[100005], k; map<long long, long long> tr; long long getans(const long long k) { long long t1 = 1, t2 = 0, t3 = 0, t4 = 1, ans = 0; while (t2 < n) { ans += (a[t1] - a[t2]) * t3; ++t3; t2 = t1; t1 += t4 * k; ...
#include <bits/stdc++.h> using namespace std; vector<int> cities[100000]; vector<bool> visited(100000); vector<int> t(100000), low(100000); map<pair<int, int>, int> b; int c = 0, ans = 0; void dfs(int v, int p = -1) { visited[v] = true; t[v] = low[v] = c++; for (int dest : cities[v]) { i...
#include <bits/stdc++.h> using namespace std; int main() { int y, w, x, counter = 0; cin >> y >> w; x = max(y, w); for (int i = x; i <= 6; i++) { counter++; } if (counter == 0) cout << 0/1 ; else if (counter == 1) cout << 1/6 ; else if (counter == 2) cout <<...
#include <bits/stdc++.h> using namespace std; int main() { int n, sum = 0, a[101]; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; sum += (i - 1) * 4 * a[i]; } cout << sum; }
#include <bits/stdc++.h> using namespace std; inline long long read() { long long x = 0, f = 1; char c = getchar(); while ((c < 0 \|\| c > 9 ) && (c != - )) c = getchar(); if (c == - ) f = -1, c = getchar(); while (c >= 0 && c <= 9 ) x = x * 10 + c - 0 , c = getchar(); return x * f; ...
#include <bits/stdc++.h> using namespace std; long long ma, n, i, j, temp; long long mi = 1000LL * 1000LL * 1000LL * 1000LL * 1000LL * 1000LL; int main() { cin >> n; for (i = 1; i * i * i <= n; i++) if (n % i == 0) for (j = i; j * j <= n / i; j++) if ((n / i) % j == 0) { ...
#include <bits/stdc++.h> int main() { int n; scanf( %d , &n); int i = sqrt(n); for (int i = 0; i <= 10; i++) { if (pow(2, i) == n) { printf( YES ); return 0; } } printf( NO ); return 0; }
#include <bits/stdc++.h> using namespace std; using ll = long long; using vi = vector<int>; using ii = pair<int, int>; template <typename A, typename B> ostream& operator<<(ostream& os, pair<A, B> p) { return os << { << p.first << , << p.second << } ; } const int oo = 0x3f3f3f3f; const ll OO...
#include <bits/stdc++.h> int a[5005]; int solve(int i, int j) { int k, vans, hans, mini, s, t; vans = j - i + 1; mini = a[i]; for (k = i + 1; k <= j; k++) if (mini > a[k]) mini = a[k]; hans = mini; for (k = i; k <= j; k++) a[k] -= mini; hans = mini; for (k = i; k <= j;) { ...
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( unroll-loops ) #pragma GCC optimize( Ofast ) #pragma GCC optimize( O3 ) const long long inf = 1e17; void bfs(int a, vector<vector<int> > &g, vector<int> &da) { int n = g.size(); queue<int> q; q.push(a); vector<bool> u(n, fal...
#include <bits/stdc++.h> using namespace std; int cache[1005][20][2]; int ret[1005]; int n; vector<int> ans(1005, INT_MAX); void query(vector<int> &arr) { if (!arr.empty()) { printf( %lu n , arr.size()); for (auto &x : arr) printf( %i , x); printf( n ); fflush(stdout); fo...
#include <bits/stdc++.h> using namespace std; const int N = 110000; int a[N], wei[N], r1, r2; bool can[N], ans[N]; int n, m; int main() { int t; scanf( %d , &t); while (t--) { scanf( %d%d , &n, &m); n--; for (int i = (1); i <= (int)m; i++) { scanf( %d , &a[i]); ...
#include <bits/stdc++.h> using namespace std; vector<pair<long long, long long> > A, B; void getDivisors(long long x, vector<pair<long long, long long> > &X) { for (long long i = 1; i * i <= x; i++) { if (x % i) continue; X.push_back({i, x / i}); } } int main() { ios::sync_with_stdio(0...
#include <bits/stdc++.h> using namespace std; const int maxn = 60; vector<int> adj[maxn]; int n, m; void read() { scanf( %d%d , &n, &m); for (int i = 0; i < m; i++) { int a, b; scanf( %d%d , &a, &b); a--, b--; adj[a].push_back(b); adj[b].push_back(a); } } bool vis...
#include <bits/stdc++.h> using namespace std; vector<int> ed[2000]; int sho[1200][1200]; int col[1200]; int n, m; int makk[1200]; int sp[1200]; void dfs(int v, int ccc) { sp[v] = ccc; for (int a = 0; a < ed[v].size(); a++) { if (sp[ed[v][a]] == -1) dfs(ed[v][a], ccc); } } void gets...
#include <bits/stdc++.h> using namespace std; const int N = 300 * 1000 + 20; int n, a[N]; multiset<int> e; long long ans; int main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n; i++) { if (e.size(...
#include <bits/stdc++.h> using namespace std; 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...
#include<iostream> #include<algorithm> #include<vector> #include<bitset> #include<time.h> using namespace std; #define R register int bitset<200000>S[60]; bool c[60]; int main(){ srand(time(0)); int n,m,p,q; cin>>n>>m>>p; q=n-1>>1; string s; for(R i=0;i!=n;i++){ cin>>s; for(R...
#include <bits/stdc++.h> using namespace std; const long long MOD = 998244353; const long long INF = 1000000000; void solve() { long long n; string s; cin >> n; vector<long long> p(n); vector<long long> ans(n); for (int i = 0; i < n; i++) { long long x; cin >> x; p[--x]...
#include <bits/stdc++.h> using namespace std; #define send {ios_base::sync_with_stdio(false);} #define help {cin.tie(NULL);} #define f first #define s second #define pb push_back #define vi vector<long long> #define vii vector<pair<long long,long long>> #define dict unordered_map<long long, long l...
#include <bits/stdc++.h> int main() { int n, k, s = 0; scanf( %d%d , &n, &k); int a[n]; for (int i = 0; i < n; i++) { scanf( %d , &a[i]); } for (int j = 0; j < n; j++) { if (n == k && a[j] >= a[k - 1] && a[j] > 0) s++; else if (a[j] >= a[k - 1] && a[j] > 0) s+...
#include <bits/stdc++.h> using namespace std; int a, b, m[1000]; int s = 0; int main() { int n; cin >> n; int z = n; while (n > 0) { s = 0; cin >> a >> b; while (a > 0 && b > 0) { if (a >= b) { int t = a / b; a = a % b; s += t; } el...
#include <bits/stdc++.h> using namespace std; void doRoutine() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); srand(322179); } const int C = 5010; int tr[C * 8]; bool cross(pair<pair<int, int>, int> hor, pair<int, pair<int, int> > vert) { return (vert.second.fir...
#include <bits/stdc++.h> using namespace std; #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) #pragma GCC optimize( unroll-loops ) #pragma GCC optimize( Ofast ) #pragma GCC optimize( O3 ) #pragma GCC target( avx ) const long long INF = numeric_limits<long long>::max(); cons...
#include <bits/stdc++.h> using namespace std; char str[11][11]; int f[8][20][20]; int dx[] = {0, 1, -1, -1, 1, 1, 0, -1}, dy[] = {-1, -1, -1, 0, 0, 1, 1, 1}; bool check() { memset(f, 0, sizeof f); for (int i = 1; i <= 10; i++) for (int j = 1; j <= 10; j++) { if (str[i][j] != X ) continu...
#include <bits/stdc++.h> using namespace std; int n, k, l, r, mid, a; int main() { cin >> n >> k; a = 240 - k; l = 0; r = n + 1; while (r - l > 1) { mid = (r + l) / 2; if (5 * (mid * (mid + 1) / 2) > a) { r = mid; } else { l = mid; } } cout << l ...
//Saptak_Roy_Turja #include<bits/stdc++.h> #define ll long long int using namespace std; int main() { int t; cin>>t; while(t--){ ll n,a,b,c=1,i; string s; cin>>n>>a>>b>>s; for(i=1;i<n;i++){ if(s[i]!=s[i-1]){ c++; ...
#include <bits/stdc++.h> using namespace std; long long n, k, l, r, mid, ans; long long a[200100]; bool check(long long x) { long long p, q; double sum = 0, s; for (long long i = 1; i <= n; i++) { if (a[i] == 0) continue; s = a[i]; if (a[i] >= k) return 1; p = x - 1; q ...
#include <bits/stdc++.h> using namespace std; const string yno[2] = { NO n , YES n }; int dem(vector<int> &a, int k) { return upper_bound(a.begin(), a.end(), k) - lower_bound(a.begin(), a.end(), k); } int dem(long long k) { int ans = 0; while (k) { ans += k & 1; k >>= 1; ...
#include <bits/stdc++.h> using namespace std; const int N = 252; int dis(int x1, int y1, int x2, int y2) { return abs(x1 - x2) + abs(y1 - y2); } bool Gao(int x1, int y1, int x2, int y2) { if (dis(0, 0, x1, y1) <= max(x2, y2)) return true; for (int i = 1; i <= min(x2, y2); ++i) { if (dis(x2 - i, y2...
#include <bits/stdc++.h> using namespace std; int n, p[1005]; vector<int> T; bool ok; inline void enter() { cin >> n; for (int i = 1; i <= n; i++) cin >> p[i]; } void dfs(int u) { while (T[u] != 1) { T[u]++; u = p[u]; } cout << u << ; } inline void solve() { for ...
#include <bits/stdc++.h> using namespace std; int n, t; string s; int puc(int k, int t) { vector<int> v(n + 1, 0); v[n - 1] = (s[n - 1] == H ); for (int i = n - 2; i >= 0; --i) v[i] = v[i + 1] + (s[i] == H ); int nh = 0, ns = 0; for (int i = 0; i < int(n); ++i) { if (s[i] == H ) ...
#include <bits/stdc++.h> using namespace std; const string YES = Yes ; const string NO = No ; string solve() { int N; cin >> N; vector<int> p(N); for (int i = 0; i < (N); ++i) { cin >> p[i]; } for (int i = 0; i < (N - 1); ++i) { if (p[i] + 1 == p[i + 1]) { continue;...
#include <bits/stdc++.h> using namespace std; int main() { int arr[6], i, sum = 0; for (i = 0; i < 5; i++) { scanf( %d , &arr[i]); sum = sum + arr[i]; } if (sum == 0) { printf( -1 n ); } else if (sum % 5 == 0) { printf( %d , sum / 5); } else { printf( -1 ); ...
#include <bits/stdc++.h> using namespace std; int main() { long long n, a, b, c, ans, boby, apu; cin >> n; while (n--) { cin >> a >> b >> c >> ans; boby = b - a; apu = c + ans; if (boby % apu == 0) { cout << boby / apu << endl; } else cout << -1 << endl; ...
#include <bits/stdc++.h> using namespace std; const int oo = 1e9; const int N = 5001; const int maxxor = (1 << 13); int f[2][maxxor]; vector<int> a[N]; int cnp(int l, int r, int pos, int id) { if (l > r) return oo; int mid = (l + r) / 2; if (a[id][mid] > pos) return min(a[id][mid], cnp(l, mid ...
#include <bits/stdc++.h> using namespace std; inline int add(int a, int b) { return (a + b >= 1000000007) ? a + b - 1000000007 : a + b; } inline void inc(int &a, int b) { a = add(a, b); } inline int sub(int a, int b) { return (a - b < 0) ? a - b + 1000000007 : a - b; } inline void dec(int &a, int ...
#include <bits/stdc++.h> using namespace std; int read() { int f = 1, x = 0; char s = getchar(); while (s < 0 \|\| s > 9 ) { if (s == - ) f = -1; s = getchar(); } while (s >= 0 && s <= 9 ) { x = x * 10 + s - 0 ; s = getchar(); } return x * f; } int len[3...
#include <bits/stdc++.h> using namespace std; const long long INF = 1e18, MAXN = 1e5 + 128, MOD = 998244353; long long binpow(long long a, long long n) { long long res = 1; while (n) { if (n & 1) res = a; a = a; n >>= 1; } return res; } long long NOD(long long NOD1, long lo...
#include <bits/stdc++.h> using namespace std; const int maxint = 0x7fffffff; const int minint = 0x80000000; const double eps = 1e-6; int gcd(int a, int b) { if (b == 0) return a; return gcd(b, a % b); } int max(int a, int b) { return a > b ? a : b; } int main() { int sum, d, n, a; scanf(...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t, n; cin >> t; while (t--) { string A, B; cin >> n; cin >> A >> B; int f = 1; for (int i = 0; i < n; ++i) { if (A[i] > B[i]) f = 0; ...
#include <bits/stdc++.h> using namespace std; const int M = 1e5 + 5; int n, k; vector<pair<int, int> > g[M]; int ans; int dp[M][2]; void dfs(int u, int Pa) { vector<pair<int, int> > ch; for (auto p : g[u]) { int v = p.first, w = p.second; if (v == Pa) continue; dfs(v, u); c...
#include <bits/stdc++.h> using namespace std; const int N = 100002; int arr[N], n, inc[N], decr[N]; int tree[4 * N]; int update(int pos, int l, int r, int x, int v) { if (l > x \|\| r < x) return tree[pos]; if (l == r) return tree[pos] = max(tree[pos], v); int mid = (l + r) / 2; return tree[pos]...
#include <bits/stdc++.h> int main() { char s[50]; scanf( %s , s); int i, l = strlen(s), flag = 0; for (i = 0; i < l; i++) { if (s[i] != s[l - i - 1]) flag++; } if (flag == 2) printf( YES ); else if (flag == 0 && strlen(s) % 2 == 1) printf( YES ); else printf( NO...
#include <bits/stdc++.h> using namespace std; long long l, r, f[100]; bool check(string s, int x, int y) { if (s.size() % x != 0) return false; for (int i = 0; i + x < s.size() and i + x < y + 1; i++) if (s[i] != s[i + x]) return false; return true; } long long p(int x) { long long ans =...
#include <bits/stdc++.h> long long z; int l, r, i, j, k, ans; short p; std::vector<short> prm; std::vector<int> to; short dp[3000111]; bool done[3000111]; void dfs(long long now, char cnt) { to.push_back(now); for (; cnt < prm.size() && now * prm[cnt] <= r; ++cnt) dfs(now * prm[cnt], cnt);...
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; long long N; long long fac(long long x) { long long res = 1; for (int i = 1; i <= x; ++i) res = res * i % mod; return res; } long long qpow(long long x, long long y) { long long res = 1; for (; y; x = x * x % mod, y >...
#include <bits/stdc++.h> using namespace std; vector<vector<long long int> > dp; vector<long long int> a; long long int check(long long int l, long long int r) { if (l >= r) return 0; if (dp[l][r]) return dp[l][r]; if (l + 1 == r) { dp[l][r] = a[r]; return a[r]; } dp[l][r] = -1; ...
#include <bits/stdc++.h> using namespace std; int main() { long long n, k, B, c; cin >> n >> k >> B >> c; long long a[n]; for (int i = 0; i < n; i++) cin >> a[i]; long long x = min_element(a, a + n); for (int i = 0; i < n; i++) a[i] = a[i] - x; B = min(B, 5 c); long long ans = 1e1...
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) #pragma GCC optimize( Ofast,no-stack-protector ) using namespace std; function<void(void)> ____ = []() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); }; template <typename T> vector<T> &operator<<(vector<T> &__container, T x) { ...
#include <bits/stdc++.h> using namespace std; inline int in() { int x, y; y = scanf( %d , &x); return x; } const int N = -1; int main() { int X = in(), d = in(); vector<long long> v; v.push_back(0); int b = 0; while (X) { if (X % 2) { v.push_back(v.back() + d); ...
#include <bits/stdc++.h> const int maxN = 2000; const unsigned int mod = 998244353; constexpr int inf = INT_MAX; class Array { public: inline const int begin() const { return data; } inline const int end() const { return endPtr; } inline void push_back(const int x) { *(endPtr++) = x; } inli...
#include <bits/stdc++.h> using namespace std; int n, branch[10001], total; int main() { cin >> n; for (int i = 0; i < n - 1; i++) { int a, b; cin >> a >> b; branch[a]++, branch[b]++; } for (int i = 1; i <= n; i++) total += branch[i] * (branch[i] - 1) / 2; cout << total << end...
#include <bits/stdc++.h> using namespace std; int main() { int n, ans = -1; cin >> n; int a[n], l[n], r[n]; for (int i = 0; i < n; ++i) cin >> a[i]; for (int i = 0, des = 0; i < n; ++i) { ++des; l[i] = des = min(des, a[i]); } for (int i = n - 1, des = 0; i >= 0; --i) { ...
#include <bits/stdc++.h> using namespace std; inline long long add(long long a, long long b) { return ((a % 1000000007LL) + (b % 1000000007LL)) % 1000000007LL; } inline long long mul(long long a, long long b) { return ((a % 1000000007LL) * (b % 1000000007LL)) % 1000000007LL; } inline long long sub(l...
#include <bits/stdc++.h> #define int long long using namespace std; pair<int, int> extgcd(int a, int b) { if(!b) return {1, 0}; pair<int, int> val = extgcd(b, a % b); return {val.second, val.first - (a / b) * val.second}; } signed main(){ ios_base::sync_with_stdio(false); c...

#include <bits/stdc++.h> using namespace std; vector<int> v1, v2, v3; int n, flag; int main() { cin >> n; int t = 0; string s1, s2; cin >> s1 >> s2; for (int i = 0; i < n; i++) { if (s1[i] == 1 && s2[i] == 0 ) v1.push_back(i + 1); if (s1[i] == 0 && s2[i] == 1 ) v1.push_back...

#include <bits/stdc++.h> using namespace std; vector<string> ans; int main() { char c; string ss = ; while ((c = getchar()) != n ) { if ( a <= c && z >= c) { ss += c; continue; } else if (c == ) { if (!ss.empty()) { ans.push_back(ss); s...

#include <bits/stdc++.h> using namespace std; using ll = long long; class SegTree { private: const ll NEUT = 4 * (ll)1e18; vector<ll> seg, tag; int h = 1; void apply(int i, ll v) { seg[i] += v; if (i < h) tag[i] += v; } void push(int i) { if (tag[i] == 0) return; ...

#include <bits/stdc++.h> using namespace std; const int64_t MAXN = 1000005; const int64_t MAXINT = 2147483098; const int64_t MAXLL = 9223372036854775258LL; const int64_t MOD = 1e9 + 7; void solve() { int64_t n; cin >> n; vector<int64_t> a(n + 2); for (int64_t i = 1; i < n + 1; ++i) cin >> a[...

#include <bits/stdc++.h> //#include <ext/pb_ds/assoc_container.hpp> //using namespace __gnu_pbds; using namespace std; typedef long long ll; typedef long double ld; //typedef tree<int,null_type,less<int >,rb_tree_tag,tree_order_statistics_node_update>indexed_set; template<class T1, class T2> ostream &op...

#include <bits/stdc++.h> using namespace std; template <typename T, typename U> ostream& operator<<(ostream& o, const pair<T, U>& x) { o << ( << x.first << , << x.second << ) ; return o; } template <typename T> ostream& operator<<(ostream& o, const vector<T>& x) { o << [ ; int b = 0; ...

#include <bits/stdc++.h> using namespace std; int n, k; char line[100010]; vector<int> cua; int main(int argc, char *argv[]) { scanf( %d%d , &n, &k); scanf( %c , &line[0]); for (int i = 1; i <= n; i++) { scanf( %c , &line[i]); if (line[i] == 7 && line[i - 1] == 4 ) { cua.pus...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:256000000 ) using namespace std; const int INF = (int)(1e9 + 1337); const long long LINF = (long long)(4e18); const double EPS = 1e-11; const int MOD = 1000000007; const int HBASE = 1003; const int MAXN = 200500; int n, m; char s[MAXN]; pair...

#include <bits/stdc++.h> using namespace std; int k, d; char n[100005]; int a[100005]; int main() { scanf( %d , &k); d = 0; scanf( %s , &n); for (int i = 0; i < strlen(n); i++) { d += n[i] - 0 ; a[i + 1] = n[i] - 0 ; } if (d >= k) { cout << 0; return 0; }...

#include <bits/stdc++.h> using namespace std; const double PI = acos(-1); const long long mod = 1e9 + 7; const long long N = 1e5 + 5, K = 105; const int si = (1 << 20); const long long add = 1e4; const long long M = 100 + 5; const double INFdb = 1e10; int n; vector<int> v[N]; bool check[N]; int ...

#include <bits/stdc++.h> using namespace std; int N; int main() { cin >> N; if (!(N % 2)) puts( home ); else puts( contest ); return 0; }

#include <bits/stdc++.h> using namespace std; vector<vector<short>> g; vector<vector<short>> dp; short rec(int l, int r) { if (l > r) return 0; if (dp[l][r] != -1) return dp[l][r]; short whole = binary_search(begin(g[l]), end(g[l]), r); short ret = whole + rec(l + 1, r); for (auto p : g[l]) ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 5; char str[MAXN]; class Value { public: char c1, c2, last_c1, last_c2; int pos, l1, sz; Value() { c1 = 0; c2 = 0; pos = 0; l1 = 0; last_c1 = 0; last_c2 = 0; } void push_front(char c) ...

#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; long long int mypow(long long int a, int b) { if (b < 0) return 0; long long int ans = 1; for (; b; b >>= 1, a = a * a % mod) { if (b & 1) ans = ans * a % mod; } return ans; } void add(long long int &a, long...

#include <bits/stdc++.h> using namespace std; double pi = acos(-1); int n; bool initial[2000][2000]; bool blur[2000][2000]; pair<int, int> direction[8] = { make_pair(1, 0), make_pair(1, 1), make_pair(0, 1), make_pair(-1, 1), make_pair(-1, 0), make_pair(-1, -1), make_pair(0, -1), make_pair(1,...

#include <bits/stdc++.h> using namespace std; const char NL = n ; long long int n; vector<long long int> a, dp; long long int s(long long int i, long long int j) { if (a[i] > a[j]) return dp[j] + 1; return 1; } void solve() { for (long long int i = 2; i < n + 1; i++) { long long int m ...

#include <bits/stdc++.h> using namespace std; bool debug = 0; int n, m, k; int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0}; string direc = RDLU ; long long ln, lk, lm; void etp(bool f = 0) { puts(f ? YES : NO ); exit(0); } void addmod(int &x, int y, int mod = 1000000007) { x += y; ...

#include <bits/stdc++.h> int main() { int N; std::cin >> N; std::vector<int> array(N); for (int i = 0; i < N; ++i) std::cin >> array[i]; std::sort(array.begin(), array.end()); if (1 == array.back()) array[N - 1] = 2; else array[N - 1] = 1; std::sort(array.begin(), array.end...

#include <bits/stdc++.h> using namespace std; long long tree[4 * 1000005]; void update(int v, int l, int r, int ind) { if (l > r || l > ind || ind > r) return; if (l == r) { tree[v] = 1; return; } int mid = (l + r) / 2; update(2 * v, l, mid, ind); update(2 * v + 1, mid + 1, r, ...

#include <bits/stdc++.h> using namespace std; const long long iinf = 1e9 + 10; const long long inf = 1ll << 60; const long long mod = 1e9 + 87; void GG() { cout << 0 n ; exit(0); } long long mpow(long long a, long long n, long long mo = mod) { long long re = 1; while (n > 0) { if (n...

#include <bits/stdc++.h> using namespace std; string ans; map<pair<string, int>, int> dp; bool check(string second) { int mul = 1; int num = 0; int i = second.size() - 1; num = num + ((second[i] - 0 ) * 1) % 8; i--; if (second.size() > 1) { num = num + ((second[i] - 0 ) * 10) % 8...

#include <bits/stdc++.h> using namespace std; char s[5010]; int main() { scanf( %s , s); int n = (int)strlen(s); int res = 0; for (int i = 0; i < n; i++) { int mn = 0, mx = 0; for (int j = i; j < n; j++) { if (s[j] == ( ) { mn++, mx++; } else if (s[j] == ) )...

#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( Ofast ) #pragma GCC optimize( unroll-loops ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) template <class S, class T> ostream& operator<<(ostream& os, const pair<S, T>& p) { return os << ( << p.first <...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5, INF = 1e9; struct T { int l, r, d[3], mn[3], mx[3]; } t[N]; int n, m, q, a, b, c, lx, rx, ly, ry, lz, rz, rt, h[N], D; inline bool cmp(int a, int b) { return t[a].d[D] < t[b].d[D]; } inline void update(int x) { int l = t[x].l, r ...

#include <bits/stdc++.h> using namespace std; int a[200005], n, m, k, ans; queue<int> que; inline int gi() { register int x = 0, q = 1; register char ch = getchar(); while ((ch < 0 || ch > 9 ) && ch != - ) ch = getchar(); if (ch == - ) q = -1, ch = getchar(); while (ch >= 0 && ch <= ...

#include <bits/stdc++.h> using namespace std; vector<vector<pair<int, int>>> G; int main() { int n, m; scanf( %d%d , &n, &m); G.resize(n + 1); for (int i = 1; i <= n; i++) G[i].push_back(make_pair(i, i)); for (int i = 0; i < m; i++) { int a, b; scanf( %d%d , &a, &b); G[a].pus...

#include <bits/stdc++.h> int main() { int n, m, t; scanf( %d %d , &n, &m); t = (n / 2); t -= (t & 1); for (int i = 1; i < n; i++) { if (i == 1) printf( > ); else printf( ^ ); if (i & 1) { for (int j = 2; j <= (n - t < n - 2 ? n - t : n - 2); j++) printf( >...

#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:36777216 ) #pragma GCC optimize( O2 ) template <class T> inline void RD(T &); template <class T> inline void OT(const T &); inline int RD() { int x; RD(x); return x; } template <class T> inline T &_RD(T &x) {...

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

#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const int maxn = 2e5 + 5; long long x[maxn]; long long y[maxn]; int main() { long long x0, y0, ax, ay, bx, by; cin >> x[0] >> y[0] >> ax >> ay >> bx >> by; long long xs, ys, t; cin >> xs >> ys >> t; if (x[0] == y[0...

#include <bits/stdc++.h> using namespace std; long long int sub2(long long int n) { return (n + 3 * n * n) / 2; } int main() { long long int t; cin >> t; vector<long long int> ans; while (t--) { long long int k; cin >> k; long long int m = 0; while (k >= 2) { long l...

#include <bits/stdc++.h> int main() { int t; scanf( %d , &t); while (t--) { long long a, b, k; scanf( %lld %lld %lld , &a, &b, &k); printf( %lld n , (k / 2) * (a - b) + a * (k % 2)); } return 0; }

#include <bits/stdc++.h> #pragma GCC optimize( O3 ) const double PI = acos(-1); using namespace std; const int MAX = 100 * 1000 + 10; int A[MAX], B[MAX], n, pos[MAX]; int diff[MAX << 1]; int mx[MAX], mn[MAX]; deque<int> dq; const int oo = 1 << 28; int main() { scanf( %d , &n); for (int i = 0...

#include <bits/stdc++.h> using namespace std; template <typename T> ostream &operator<<(ostream &out, const vector<T> &v) { out << { ; for (const T &a : v) out << a << , ; out << } ; return out; } template <typename S, typename T> ostream &operator<<(ostream &out, const pair<S, T> &p) { ...

#include <bits/stdc++.h> using namespace std; long long power(long long x, unsigned long long y, unsigned long long m) { if (y == 0) return 1; long long p = power(x, y / 2, m) % m; p = (p * p) % m; return (y % 2 == 0) ? p : (x * p) % m; } int32_t main() { ios_base::sync_with_stdio(false); ...

#include <bits/stdc++.h> using namespace std; const long long N = 4000010, oo = 1e9; long long x, y, c, n; bool ok(long long t) { long long ans = 2ll * t * (t + 1ll) - 4ll * t + 1l; if (t > x) { ans -= (t - x) * (t - x); } if (t > n - x + 1) { ans -= (t - n + x - 1) * (t - n + x - 1)...

#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); } template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); } template <typename T> T inf; template <> con...

#include <bits/stdc++.h> using namespace std; const long long int MOD = 1e6 + 3; const long double PI = 2 * acos(0.0); const vector<long long int> dx = {1, -1, 0, 0}; const vector<long long int> dy = {0, 0, 1, -1}; template <typename T = long long int> vector<T> ga(long long int n, bool oneIndexed = false...

#include <bits/stdc++.h> using namespace std; int main(int argc, char **argv) { int n; scanf( %d , &n); vector<int> f(n + 1, -1); vector<int> g(n + 1, -1); vector<int> h(1); int m = 0; vector<bool> b(n + 1, false); for (int i = 1; i <= n; i++) { scanf( %d , &f[i]); if (f[...

#include <bits/stdc++.h> using namespace std; const long long int mod = 1000000007; const long long int mymax = 1e18; const long long int mymin = -1e18; const double PIE = 3.1415926536; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t, n, m, d, k, ti, lef, rit; bool ans; vect...

#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; const double eps = 1e-8; const int nm = 1100005; int n, k, m, t; long long res; int cnt[nm], f[nm][23]; int POW(int x, int z) { if (z == 0) return 1; if (z == 1) return x % MOD; int u = POW(x, z >> 1); u = ((long l...

#include <bits/stdc++.h> using namespace std; struct edge { int u, v; }; int n, m, k, f[1000000 + 1], ans[1000000 + 1], q[1000000 + 1], lq = 0, rq = -1, cur; edge b[1000000 + 1]; vector<int> a[1000000 + 1], e[1000000 + 1]; bool remoed[10...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; string s; cin >> s; for (int k = 0; k < n - 1; k++) { if (s[k] > s[k + 1]) { cout << YES << endl; cout << k + 1 << << k + 2; return 0; } } cout << NO ; return 0; }...

#include <bits/stdc++.h> using namespace std; const int maxn = 1000 + 10; int main() { int c, d, n, m, k; while (scanf( %d %d , &c, &d) != EOF) { scanf( %d %d , &n, &m); scanf( %d , &k); int t = n * m - k; if (t <= 0) { printf( 0 n ); continue; } int res...

#include <bits/stdc++.h> using namespace std; int n, m; long long a[100005], k; map<long long, long long> tr; long long getans(const long long k) { long long t1 = 1, t2 = 0, t3 = 0, t4 = 1, ans = 0; while (t2 < n) { ans += (a[t1] - a[t2]) * t3; ++t3; t2 = t1; t1 += t4 * k; ...

#include <bits/stdc++.h> using namespace std; vector<int> cities[100000]; vector<bool> visited(100000); vector<int> t(100000), low(100000); map<pair<int, int>, int> b; int c = 0, ans = 0; void dfs(int v, int p = -1) { visited[v] = true; t[v] = low[v] = c++; for (int dest : cities[v]) { i...

#include <bits/stdc++.h> using namespace std; int main() { int y, w, x, counter = 0; cin >> y >> w; x = max(y, w); for (int i = x; i <= 6; i++) { counter++; } if (counter == 0) cout << 0/1 ; else if (counter == 1) cout << 1/6 ; else if (counter == 2) cout <<...

#include <bits/stdc++.h> using namespace std; int main() { int n, sum = 0, a[101]; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; sum += (i - 1) * 4 * a[i]; } cout << sum; }

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

#include <bits/stdc++.h> using namespace std; long long ma, n, i, j, temp; long long mi = 1000LL * 1000LL * 1000LL * 1000LL * 1000LL * 1000LL; int main() { cin >> n; for (i = 1; i * i * i <= n; i++) if (n % i == 0) for (j = i; j * j <= n / i; j++) if ((n / i) % j == 0) { ...

#include <bits/stdc++.h> int main() { int n; scanf( %d , &n); int i = sqrt(n); for (int i = 0; i <= 10; i++) { if (pow(2, i) == n) { printf( YES ); return 0; } } printf( NO ); return 0; }

#include <bits/stdc++.h> using namespace std; using ll = long long; using vi = vector<int>; using ii = pair<int, int>; template <typename A, typename B> ostream& operator<<(ostream& os, pair<A, B> p) { return os << { << p.first << , << p.second << } ; } const int oo = 0x3f3f3f3f; const ll OO...

#include <bits/stdc++.h> int a[5005]; int solve(int i, int j) { int k, vans, hans, mini, s, t; vans = j - i + 1; mini = a[i]; for (k = i + 1; k <= j; k++) if (mini > a[k]) mini = a[k]; hans = mini; for (k = i; k <= j; k++) a[k] -= mini; hans = mini; for (k = i; k <= j;) { ...

#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( unroll-loops ) #pragma GCC optimize( Ofast ) #pragma GCC optimize( O3 ) const long long inf = 1e17; void bfs(int a, vector<vector<int> > &g, vector<int> &da) { int n = g.size(); queue<int> q; q.push(a); vector<bool> u(n, fal...

#include <bits/stdc++.h> using namespace std; int cache[1005][20][2]; int ret[1005]; int n; vector<int> ans(1005, INT_MAX); void query(vector<int> &arr) { if (!arr.empty()) { printf( %lu n , arr.size()); for (auto &x : arr) printf( %i , x); printf( n ); fflush(stdout); fo...

#include <bits/stdc++.h> using namespace std; const int N = 110000; int a[N], wei[N], r1, r2; bool can[N], ans[N]; int n, m; int main() { int t; scanf( %d , &t); while (t--) { scanf( %d%d , &n, &m); n--; for (int i = (1); i <= (int)m; i++) { scanf( %d , &a[i]); ...

#include <bits/stdc++.h> using namespace std; vector<pair<long long, long long> > A, B; void getDivisors(long long x, vector<pair<long long, long long> > &X) { for (long long i = 1; i * i <= x; i++) { if (x % i) continue; X.push_back({i, x / i}); } } int main() { ios::sync_with_stdio(0...

#include <bits/stdc++.h> using namespace std; const int maxn = 60; vector<int> adj[maxn]; int n, m; void read() { scanf( %d%d , &n, &m); for (int i = 0; i < m; i++) { int a, b; scanf( %d%d , &a, &b); a--, b--; adj[a].push_back(b); adj[b].push_back(a); } } bool vis...

#include <bits/stdc++.h> using namespace std; vector<int> ed[2000]; int sho[1200][1200]; int col[1200]; int n, m; int makk[1200]; int sp[1200]; void dfs(int v, int ccc) { sp[v] = ccc; for (int a = 0; a < ed[v].size(); a++) { if (sp[ed[v][a]] == -1) dfs(ed[v][a], ccc); } } void gets...

#include <bits/stdc++.h> using namespace std; const int N = 300 * 1000 + 20; int n, a[N]; multiset<int> e; long long ans; int main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n; i++) { if (e.size(...

#include <bits/stdc++.h> using namespace std; 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...

#include<iostream> #include<algorithm> #include<vector> #include<bitset> #include<time.h> using namespace std; #define R register int bitset<200000>S[60]; bool c[60]; int main(){ srand(time(0)); int n,m,p,q; cin>>n>>m>>p; q=n-1>>1; string s; for(R i=0;i!=n;i++){ cin>>s; for(R...

#include <bits/stdc++.h> using namespace std; const long long MOD = 998244353; const long long INF = 1000000000; void solve() { long long n; string s; cin >> n; vector<long long> p(n); vector<long long> ans(n); for (int i = 0; i < n; i++) { long long x; cin >> x; p[--x]...

#include <bits/stdc++.h> using namespace std; #define send {ios_base::sync_with_stdio(false);} #define help {cin.tie(NULL);} #define f first #define s second #define pb push_back #define vi vector<long long> #define vii vector<pair<long long,long long>> #define dict unordered_map<long long, long l...

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

#include <bits/stdc++.h> using namespace std; int a, b, m[1000]; int s = 0; int main() { int n; cin >> n; int z = n; while (n > 0) { s = 0; cin >> a >> b; while (a > 0 && b > 0) { if (a >= b) { int t = a / b; a = a % b; s += t; } el...

#include <bits/stdc++.h> using namespace std; void doRoutine() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); srand(322179); } const int C = 5010; int tr[C * 8]; bool cross(pair<pair<int, int>, int> hor, pair<int, pair<int, int> > vert) { return (vert.second.fir...

#include <bits/stdc++.h> using namespace std; #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) #pragma GCC optimize( unroll-loops ) #pragma GCC optimize( Ofast ) #pragma GCC optimize( O3 ) #pragma GCC target( avx ) const long long INF = numeric_limits<long long>::max(); cons...

#include <bits/stdc++.h> using namespace std; char str[11][11]; int f[8][20][20]; int dx[] = {0, 1, -1, -1, 1, 1, 0, -1}, dy[] = {-1, -1, -1, 0, 0, 1, 1, 1}; bool check() { memset(f, 0, sizeof f); for (int i = 1; i <= 10; i++) for (int j = 1; j <= 10; j++) { if (str[i][j] != X ) continu...

#include <bits/stdc++.h> using namespace std; int n, k, l, r, mid, a; int main() { cin >> n >> k; a = 240 - k; l = 0; r = n + 1; while (r - l > 1) { mid = (r + l) / 2; if (5 * (mid * (mid + 1) / 2) > a) { r = mid; } else { l = mid; } } cout << l ...

//Saptak_Roy_Turja #include<bits/stdc++.h> #define ll long long int using namespace std; int main() { int t; cin>>t; while(t--){ ll n,a,b,c=1,i; string s; cin>>n>>a>>b>>s; for(i=1;i<n;i++){ if(s[i]!=s[i-1]){ c++; ...

#include <bits/stdc++.h> using namespace std; long long n, k, l, r, mid, ans; long long a[200100]; bool check(long long x) { long long p, q; double sum = 0, s; for (long long i = 1; i <= n; i++) { if (a[i] == 0) continue; s = a[i]; if (a[i] >= k) return 1; p = x - 1; q ...

#include <bits/stdc++.h> using namespace std; const string yno[2] = { NO n , YES n }; int dem(vector<int> &a, int k) { return upper_bound(a.begin(), a.end(), k) - lower_bound(a.begin(), a.end(), k); } int dem(long long k) { int ans = 0; while (k) { ans += k & 1; k >>= 1; ...

#include <bits/stdc++.h> using namespace std; const int N = 252; int dis(int x1, int y1, int x2, int y2) { return abs(x1 - x2) + abs(y1 - y2); } bool Gao(int x1, int y1, int x2, int y2) { if (dis(0, 0, x1, y1) <= max(x2, y2)) return true; for (int i = 1; i <= min(x2, y2); ++i) { if (dis(x2 - i, y2...

#include <bits/stdc++.h> using namespace std; int n, p[1005]; vector<int> T; bool ok; inline void enter() { cin >> n; for (int i = 1; i <= n; i++) cin >> p[i]; } void dfs(int u) { while (T[u] != 1) { T[u]++; u = p[u]; } cout << u << ; } inline void solve() { for ...

#include <bits/stdc++.h> using namespace std; int n, t; string s; int puc(int k, int t) { vector<int> v(n + 1, 0); v[n - 1] = (s[n - 1] == H ); for (int i = n - 2; i >= 0; --i) v[i] = v[i + 1] + (s[i] == H ); int nh = 0, ns = 0; for (int i = 0; i < int(n); ++i) { if (s[i] == H ) ...

#include <bits/stdc++.h> using namespace std; const string YES = Yes ; const string NO = No ; string solve() { int N; cin >> N; vector<int> p(N); for (int i = 0; i < (N); ++i) { cin >> p[i]; } for (int i = 0; i < (N - 1); ++i) { if (p[i] + 1 == p[i + 1]) { continue;...

#include <bits/stdc++.h> using namespace std; int main() { int arr[6], i, sum = 0; for (i = 0; i < 5; i++) { scanf( %d , &arr[i]); sum = sum + arr[i]; } if (sum == 0) { printf( -1 n ); } else if (sum % 5 == 0) { printf( %d , sum / 5); } else { printf( -1 ); ...

#include <bits/stdc++.h> using namespace std; int main() { long long n, a, b, c, ans, boby, apu; cin >> n; while (n--) { cin >> a >> b >> c >> ans; boby = b - a; apu = c + ans; if (boby % apu == 0) { cout << boby / apu << endl; } else cout << -1 << endl; ...

#include <bits/stdc++.h> using namespace std; const int oo = 1e9; const int N = 5001; const int maxxor = (1 << 13); int f[2][maxxor]; vector<int> a[N]; int cnp(int l, int r, int pos, int id) { if (l > r) return oo; int mid = (l + r) / 2; if (a[id][mid] > pos) return min(a[id][mid], cnp(l, mid ...

#include <bits/stdc++.h> using namespace std; inline int add(int a, int b) { return (a + b >= 1000000007) ? a + b - 1000000007 : a + b; } inline void inc(int &a, int b) { a = add(a, b); } inline int sub(int a, int b) { return (a - b < 0) ? a - b + 1000000007 : a - b; } inline void dec(int &a, int ...

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

#include <bits/stdc++.h> using namespace std; const long long INF = 1e18, MAXN = 1e5 + 128, MOD = 998244353; long long binpow(long long a, long long n) { long long res = 1; while (n) { if (n & 1) res *= a; a *= a; n >>= 1; } return res; } long long NOD(long long NOD1, long lo...

#include <bits/stdc++.h> using namespace std; const int maxint = 0x7fffffff; const int minint = 0x80000000; const double eps = 1e-6; int gcd(int a, int b) { if (b == 0) return a; return gcd(b, a % b); } int max(int a, int b) { return a > b ? a : b; } int main() { int sum, d, n, a; scanf(...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t, n; cin >> t; while (t--) { string A, B; cin >> n; cin >> A >> B; int f = 1; for (int i = 0; i < n; ++i) { if (A[i] > B[i]) f = 0; ...

#include <bits/stdc++.h> using namespace std; const int M = 1e5 + 5; int n, k; vector<pair<int, int> > g[M]; int ans; int dp[M][2]; void dfs(int u, int Pa) { vector<pair<int, int> > ch; for (auto p : g[u]) { int v = p.first, w = p.second; if (v == Pa) continue; dfs(v, u); c...

#include <bits/stdc++.h> using namespace std; const int N = 100002; int arr[N], n, inc[N], decr[N]; int tree[4 * N]; int update(int pos, int l, int r, int x, int v) { if (l > x || r < x) return tree[pos]; if (l == r) return tree[pos] = max(tree[pos], v); int mid = (l + r) / 2; return tree[pos]...

#include <bits/stdc++.h> int main() { char s[50]; scanf( %s , s); int i, l = strlen(s), flag = 0; for (i = 0; i < l; i++) { if (s[i] != s[l - i - 1]) flag++; } if (flag == 2) printf( YES ); else if (flag == 0 && strlen(s) % 2 == 1) printf( YES ); else printf( NO...

#include <bits/stdc++.h> using namespace std; long long l, r, f[100]; bool check(string s, int x, int y) { if (s.size() % x != 0) return false; for (int i = 0; i + x < s.size() and i + x < y + 1; i++) if (s[i] != s[i + x]) return false; return true; } long long p(int x) { long long ans =...

#include <bits/stdc++.h> long long z; int l, r, i, j, k, ans; short p; std::vector<short> prm; std::vector<int> to; short dp[3000111]; bool done[3000111]; void dfs(long long now, char cnt) { to.push_back(now); for (; cnt < prm.size() && now * prm[cnt] <= r; ++cnt) dfs(now * prm[cnt], cnt);...

#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; long long N; long long fac(long long x) { long long res = 1; for (int i = 1; i <= x; ++i) res = res * i % mod; return res; } long long qpow(long long x, long long y) { long long res = 1; for (; y; x = x * x % mod, y >...

#include <bits/stdc++.h> using namespace std; vector<vector<long long int> > dp; vector<long long int> a; long long int check(long long int l, long long int r) { if (l >= r) return 0; if (dp[l][r]) return dp[l][r]; if (l + 1 == r) { dp[l][r] = a[r]; return a[r]; } dp[l][r] = -1; ...

#include <bits/stdc++.h> using namespace std; int main() { long long n, k, B, c; cin >> n >> k >> B >> c; long long a[n]; for (int i = 0; i < n; i++) cin >> a[i]; long long x = *min_element(a, a + n); for (int i = 0; i < n; i++) a[i] = a[i] - x; B = min(B, 5 * c); long long ans = 1e1...

#include <bits/stdc++.h> #pragma GCC optimize( O3 ) #pragma GCC optimize( Ofast,no-stack-protector ) using namespace std; function<void(void)> ____ = []() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); }; template <typename T> vector<T> &operator<<(vector<T> &__container, T x) { ...

#include <bits/stdc++.h> using namespace std; inline int in() { int x, y; y = scanf( %d , &x); return x; } const int N = -1; int main() { int X = in(), d = in(); vector<long long> v; v.push_back(0); int b = 0; while (X) { if (X % 2) { v.push_back(v.back() + d); ...

#include <bits/stdc++.h> const int maxN = 2000; const unsigned int mod = 998244353; constexpr int inf = INT_MAX; class Array { public: inline const int *begin() const { return data; } inline const int *end() const { return endPtr; } inline void push_back(const int x) { *(endPtr++) = x; } inli...

#include <bits/stdc++.h> using namespace std; int n, branch[10001], total; int main() { cin >> n; for (int i = 0; i < n - 1; i++) { int a, b; cin >> a >> b; branch[a]++, branch[b]++; } for (int i = 1; i <= n; i++) total += branch[i] * (branch[i] - 1) / 2; cout << total << end...

#include <bits/stdc++.h> using namespace std; int main() { int n, ans = -1; cin >> n; int a[n], l[n], r[n]; for (int i = 0; i < n; ++i) cin >> a[i]; for (int i = 0, des = 0; i < n; ++i) { ++des; l[i] = des = min(des, a[i]); } for (int i = n - 1, des = 0; i >= 0; --i) { ...

#include <bits/stdc++.h> using namespace std; inline long long add(long long a, long long b) { return ((a % 1000000007LL) + (b % 1000000007LL)) % 1000000007LL; } inline long long mul(long long a, long long b) { return ((a % 1000000007LL) * (b % 1000000007LL)) % 1000000007LL; } inline long long sub(l...

#include <bits/stdc++.h> #define int long long using namespace std; pair<int, int> extgcd(int a, int b) { if(!b) return {1, 0}; pair<int, int> val = extgcd(b, a % b); return {val.second, val.first - (a / b) * val.second}; } signed main(){ ios_base::sync_with_stdio(false); c...