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 N = 200005; const int M = 1000000007; int n, m, i, j, t, k, tot, a[505][505], b[505][505], c[505][505], d[505][505], q, ans[505][505], u, v, x, y; char e[505][505]; int s[255][505][505]; int main() { scanf( %d %d %d , &n, &m, &q); for (...
#include <bits/stdc++.h> using namespace std; const int N = 2e3 + 5; char g1[N][N]; int dp1[N][N]; int main() { ios::sync_with_stdio(false); cin.tie(nullptr), cout.tie(nullptr); int n = 0, m = 0, ans1 = 0; cin >> n >> m; for (int i = 1; i <= n; ++i) cin >> g1[i]; for (int i = 1; i <= n...
#include <bits/stdc++.h> using namespace std; const int N = 5e3 + 3; int sz, mn, o, rt, s[N], s2[N], fa[N], ch[N][2], lf[N], cnt; bool vis[N]; void findrt(int u) { if (vis[u]) { s[u] = 0; return; } int mx; if (ch[u][0]) { int x = ch[u][0], y = ch[u][1]; findrt(x), findr...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { string s; cin >> s; long long tot = 0; long long cont = 0; for (int i = 0; i < s.size(); i++) { if (s[i] == - && cont == 0) { tot += i + 1; } else if (s[i] ...
#include <bits/stdc++.h> using namespace std; const int N = 100500; int n, m; char s[N]; int dp[N]; void solve() { scanf( %d%d%s , &n, &m, s); long long ans = (m - 1) * n; for (int i = 0; i < n; i++) { if (i - 1 >= 0 && s[i] != s[i - 1]) ans += (m - 1) * i; if (i + 1 < n && s[i] != s...
#include <bits/stdc++.h> using namespace std; int main() { long long t, n, g, b; cin >> t; while (t--) { cin >> n >> g >> b; long long val = (n + 1) / 2; long long total = val / g; long long sum = total * g; if (val % g) { total++; } total--; sum +...
#include <bits/stdc++.h> using namespace std; using namespace std; using ll = long long; using ld = long double; const int MOD = 1e9 + 7, inf = 1e9, N = 2e5 + 1; const ll INF = 1e18; ld tic, tac; void solve() { string str, ans = ; cin >> str; int cr = 0, cs = 0, cp = 0; for (int i = 0;...
#include <bits/stdc++.h> using namespace std; const double PI = 3.1415926535; double cot(double x) { return cos(x) / sin(x); } int main() { double r, n; cin >> n >> r; cout << fixed << setprecision(9) << n * r * r * sin(PI / n) / (1 + 2 * cos(PI / n)); return 0; }
#include <bits/stdc++.h> const double PI = 3.14159265358979323846; using namespace std; int main() { std::map<int, long long> pairs; std::set<long long> positive; int n; std::cin >> n; std::vector<int> nums(n); for (int i = 0; i < n; ++i) { std::cin >> nums[i]; if (nums[i] > 0)...
#include <bits/stdc++.h> #pragma warning(disable : 4244 4267 4018 4996 4800) using namespace std; istream& in = std::cin; ostream& out = std::cout; int n, m, total; int xstart = -1, ystart; vector<vector<char>> p; int res = -1; bool ones(int x1, int y1, int x2, int y2) { for (int i = x1; i <= x2; ...
#include <bits/stdc++.h> using namespace std; #define int long long #define pii pair<int, int> int32_t mod = 1e9 + 7; void solveCase() { int n = 0, m = 0; cin >> n >> m; vector<vector<int>> mp(m, vector<int>(26, 0)); for (int i = 0; i < n; i++) { string s; ...
#include <bits/stdc++.h> using namespace std; int32_t main() { long long int n; std::cin >> n; long long int ans[n]; for (long long int i = 0; i < n; i++) { std::cin >> ans[i]; } long long int count[n]; memset(count, 0, sizeof(count)); for (long long int i = 0; i < n; i++) { ...
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10; int sz[N]; struct Edge { long long from, to, val, nex; } edge[N]; int h[N], idx; void add(long long u, long long v, long long w) { Edge E = {u, v, w, h[u]}; edge[idx] = E; h[u] = idx++; } void init() { memset(h, ...
#include <bits/stdc++.h> using namespace std; int main() { string s; int l, i, j, k; cin >> s; for (i = 1; i < s.size() - 1; i++) { if (s[i] == A && ((s[i + 1] == B && s[i - 1] == C ) \|\| (s[i - 1] == B && s[i + 1] == C ))) { printf( YES n ); re...
#include <bits/stdc++.h> using namespace std; const int N = 10100; int i, j, k, n, m, ch, c; int s[N], t[N]; long long ans, f[N]; void R(int &x) { x = 0; ch = getchar(); while (ch < 0 \|\| 9 < ch) ch = getchar(); while ( 0 <= ch && ch <= 9 ) x = x * 10 + ch - 0 , ch = getchar(); } v...
#include <bits/stdc++.h> using namespace std; int color[100005]; vector<int> DSK[100005]; int num = 0, block_size; int S[100005], E[100005], c[100005]; struct query { int l, r, k, id; } Q[100005]; void DFS(int u, int pre) { S[u] = ++num; c[num] = color[u]; for (int i = 0; i < DSK[u].size...
#include <bits/stdc++.h> using namespace std; int main() { long long int n, i, count, flag, j, x; cin >> n; long long int h[n], a[n], c[n], maxc, no2, task[n], temp, tasknumber[n][n], flaggy; flaggy = 0; for (i = 0; i < n; i++) { cin >> h[i]; } for (i = 0; i < n; i++) { ...
#include <bits/stdc++.h> using namespace std; const int N = 6; const int M = 10010; const int K = 510; const int LIT = 2500; const int INF = 1 << 30; int n, m[N][N], tot, need; vector<int> v, vis; int row[N], col[N], dia1, dia2; int cr[N], cc[N], cd1, cd2; void init() { memset(m, 0, sizeof(m))...
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; cout << s << (reverse(s.begin(), s.end()), s) << endl; return 0; }
#include <bits/stdc++.h> using namespace std; void file_put() { freopen( filename.in , r , stdin); freopen( filename.out , w , stdout); } long long Pow(long long x, long long k, long long _p) { long long ans = 1; for (; k; k >>= 1, x = x * x % _p) if (k & 1) (ans *= x) %= _p; return ...
#include <bits/stdc++.h> using namespace std; bool can(int x, int y, int a, int b) { cout << ? << x << << y << << a << << b << endl; string ans; cin >> ans; if (ans == BAD ) exit(0); return ans == YES ; } int main() { ios::sync_with_stdio(false); cin.tie(0); int ...
#include <bits/stdc++.h> using namespace std; const int Maxn = 507; int n, m; int E[Maxn][Maxn]; vector<int> V[Maxn]; int ans[Maxn]; bool mark[Maxn]; void dfs(int v) { mark[v] = true; for (int i = 0; i < V[v].size(); i++) { int u = V[v][i]; if (!mark[u]) ans[u] = 2 - ans[v], ...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, m; string s; cin >> n >> m >> s; vector<int> pref(n); for (int i = 0; i < m; ++i) { int p; cin >> p; ++pref[p - 1]; } for (int i = n - 1; i >...
#include <bits/stdc++.h> using namespace std; const int MAX_N = 2e5 + 4; int main() { vector<pair<long long, char> > ans; long long n, st[MAX_N], pr[MAX_N] = { 0, }; long long sum = 0; scanf( %lld , &n); for (int i = 0; i < n; i++) { scanf( %lld , &st[i]); ...
#include <bits/stdc++.h> using namespace std; long long gcd(long long x, long long y) { return x ? gcd(y % x, x) : y; } int N; int a[2010], b[2010], c[2010]; vector<pair<long long, long long> > v; long long func(void) { int i, j; int ans = 0; i = 0; while (i < v.size()) { for (j = i; j...
#include <bits/stdc++.h> using namespace std; int main() { int test, n, i, j, a, b; cin >> test; for (i = 0; i < test; i++) { cin >> n; for (a = 2; a < n; a++) { for (b = n - 1; b > a; b--) { if (n % a == n % b) { break; } } if (n % a =...
#include <iostream> #include <vector> #include <cstring> #include <algorithm> #include <cassert> #include <deque> #include <map> #include <queue> #include <climits> #include <set> #include <stack> #include <cmath> #include <array> #include <unordered_map> #include <unordered_set> using ...
#include <bits/stdc++.h> using namespace std; const int N = 1000 + 5; struct stu { int id, sc; } a[N]; int main() { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; int i, j; for (i = 1; i <= n; i++) { a[i].id = i; a[i].sc = 0; int x; for (j = 0; j ...
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int n = s.size(); int l[n]; for (int i = 0; i < n; ++i) { l[i] = n; } for (int i = 0; i < n; ++i) { for (int j = 1; j <= min(n - i - 1, i); ++j) { if (s[i - j] == s[i] && s[i] == s[i + j]) ...
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { return (b == 0 ? a : gcd(b, a % b)); } long long lcm(long long a, long long b) { return (a * (b / gcd(a, b))); } long long POWER(long long x, long long y, long long m) { if (y == 0) return 1; if (y % 2 == 0) { ...
#include <bits/stdc++.h> using namespace std; struct segment { int l, r; }; segment s[1010]; int n, ans[1010], m, pi[1010], d[1010]; bool operator<(const segment &a, const segment &b) { return a.r < b.r; } int main() { int i, j; cin >> n; for (i = 1; i <= n; i++) { cin >> s[i].l >> s...
#include <bits/stdc++.h> using namespace std; const int N = 4e5 + 10; const int INF = 1e9; map<int, int> cnt; vector<int> ind[N]; vector<int> pos(N, 0); int main() { int n, k; cin >> n >> k; vector<int> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; ind[a[i]].push_back(i); ...
#include <bits/stdc++.h> using namespace std; int main() { int n, a, b, c = 0; cin >> n; while (n) { cin >> a >> b; if (b > a + 1) c += 1; n--; } cout << c; }
#include <bits/stdc++.h> using namespace std; long long a[100001]; int main() { long long n, s = 0, i, k, j; string m; cin >> n; for (i = 1; i <= n; i++) { cin >> m; k = 0; for (j = 0; j < n; j++) if (m[j] == C ) k++, a[j + 1]++; s += ((k - 1) * k) / 2; } f...
#include <bits/stdc++.h> int dr[] = {2, 2, -2, -2, 1, -1, 1, -1}; int dc[] = {1, -1, 1, -1, 2, 2, -2, -2}; int dr1[] = {0, 0, 1, 1, 1, -1, -1, -1}; int dc1[] = {1, -1, 1, 0, -1, 0, 1, -1}; int dr2[] = {0, 0, 1, -1}; int dc2[] = {1, -1, 0, 0}; using namespace std; long long sum(long long x) { return (x *...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { long long a, b, n, m; cin >> a >> b >> n >> m; if (m <= min(a, b) && n + m <= a + b) cout << Yes << endl; else cout << No << endl; } return 0; }
#include <bits/stdc++.h> #pragma comment(linker, /STACK:20000000 ) using namespace std; int ri() { int x; scanf( %d , &x); return x; } long long rll() { long long x; scanf( %lld , &x); return x; } void solve() { long long x; cin >> x; set<pair<long long, long long> > r...
#include <bits/stdc++.h> using namespace std; int main() { string s, t; cin >> s >> t; for (long i = s.size() - 1; i >= 0; i--) { if (s[i] == z ) { s[i] = a ; } else { s[i]++; break; } } if (s == t) { cout << No such string ; } else { ...
#include <bits/stdc++.h> using namespace std; int n; char a[1000005]; int q; struct node { int optimal; int open; int close; node(int op = 0, int cl = 0, int o = 0) { optimal = op; open = o; close = cl; } }; node t[4 * 1000005]; node operator+(const node &left, cons...
#include <bits/stdc++.h> using namespace std; long long mod = 1e9 + 7; int maxn = 1e9, minn = -1e9; long long modpow(long long base, long long exp, int modulus) { base %= modulus; long long result = 1; while (exp > 0) { if (exp & 1) result = (result * base) % modulus; base = (base * base...
#include <bits/stdc++.h> using namespace std; const int maxn(1e5 + 5); struct circle { int a, b; long long h; circle(){}; circle(int x) : a(0), b(x), h(0) {} inline void input() { cin >> a >> b >> h; } bool operator<(const circle &t) const { return b == t.b ? (a < t.a) : b < t.b; ...
#include <bits/stdc++.h> using namespace std; template <class S, class T> ostream& operator<<(ostream& o, const pair<S, T>& p) { return o << ( << p.first << , << p.second << ) ; } template <class T> ostream& operator<<(ostream& o, const vector<T>& vc) { o << { ; for (const T& v : vc) o << ...
#include <bits/stdc++.h> using namespace std; long long find_seat(char c) { if (c == a ) return 4; if (c == b ) return 5; if (c == c ) return 6; if (c == d ) return 3; if (c == e ) return 2; if (c == f ) return 1; } int main() { long long one, two, a, b, d, n, i, res; char ...
#include <bits/stdc++.h> using namespace std; const int maxN = 1e5 + 5; int lover[maxN], unlover[maxN]; int speak[maxN]; int N, M; bool iscrime[maxN]; int totnocommit, totcommit; int main() { scanf( %d%d , &N, &M); for (int i = (1), _ = (N); i <= _; ++i) { scanf( %d , &speak[i]); if ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int n; cin >> n; long long int h[n]; long long int d[n]; long long int sum = 0; for (long long int i = 0; i < n; i++) { cin >> h[i]; d[i] = h[i] - i; ...
#include <bits/stdc++.h> using namespace std; int ns[(1 << 6)]; int s[(1 << 6)]; char str[100005]; int p[100005]; void solve() { int n; scanf( %s , str + 1); n = strlen(str + 1); for (int i = n; i; --i) { int al = str[i] - a ; for (int bit = 0; bit < (1 << 6); ++bit) { ...
#include <bits/stdc++.h> int a[50][50], b[50], n, m; int work(int st) { int res = 0; for (int i = 1, s = st; i <= m; i++, s /= 2) res += a[i][m] * ((b[i] = (s & 1)) ? -1 : 1); for (int i = 1; i < m; i++) res += a[i + m][m] * ((b[i] ^ b[m]) ? -1 : 1); for (int i = 1; i < m; i++) { int t1 ...
#include <bits/stdc++.h> using namespace std; const int inf = 1e9 + 7; inline void rvi(vector<int>& v, int n) { int temp; for (int i = 0; i < n; i++) { cin >> temp; v.push_back(temp); } } inline void rvll(vector<long long int>& v, int n) { long long int temp; for (int i = 0; i ...
#include <bits/stdc++.h> using namespace std; int a[111111]; map<int, int> cnt; map<int, int> m; int main() { int n; scanf( %d , &n); m.clear(); cnt.clear(); for (int i = 0; i < n; i++) scanf( %d , &a[i]); sort(a, a + n); int ma = INT_MIN; for (int i = 0; i < n; i++) { m[...
#include <bits/stdc++.h> using namespace std; void Read(int &n) { int sign = 1; n = 0; char c; do { c = getchar(); } while (!isdigit(c) && c != - ); if (c == - ) { c = getchar(); sign = -1; } do { n = n * 10 + c - 48; c = getchar(); } while (isdigi...
#include <bits/stdc++.h> using namespace std; long long int n, t; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n; long long int f[26] = {0}, x = 0; while (n > 1) { int j = 0, sum = 0; while (sum + j + 2 <= n) j = j + 2, sum += j; f[x++] = (j - 2) / 2 +...
#include <bits/stdc++.h> using namespace std; using ll = long long; using lli = long long int; using str = string; const ll MOD = 1e9 + 7; void solve() { ll a, b, c; cin >> a >> b >> c; cout << a + b + c - 1 << n ; return; } int main() { ios_base::sync_with_stdio(false); cin.ti...
#include <bits/stdc++.h> using namespace std; const int64_t MAXN = 1000000007LL; int n; vector<int64_t> a(5), b(5), c(5), s(5); int64_t maxscore(int64_t s, int64_t n) { if (s * 2 > n) return 500; if (s * 4 > n) return 1000; if (s * 8 > n) return 1500; if (s * 16 > n) return 2000; if (s * 3...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; long double temp; temp = log2(n + 1); if (temp == (int)temp) { cout << temp << endl; } else { cout << (int)(temp) + 1 << endl; } }
#include <bits/stdc++.h> using namespace std; int main() { double r1, r2, p1, p2; double A, B; int n; scanf( %d , &n); double x; r1 = 0; for (int i = 0; i < n; i++) { scanf( %lf , &x); if (x > r1) r1 = x; } int m; scanf( %d , &m); p1 = 0; for (int i = 0; i...
#include <bits/stdc++.h> using namespace std; int main() { int n = 4; int a[4]; for (int i = 0; i < 4; i++) { cin >> a[i]; } sort(a, a + n); for (int i = 0; i < 3; i++) { cout << a[3] - a[i] << ; } }
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; char s[int(3e5 + 5)]; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; int t; cin >> t; while (t--) { int n, m; cin >> n >> m; cin >> (s + 1); bool flag = true; ...
#include <bits/stdc++.h> using namespace std; const int maxn = 30; int a[maxn]; int num[maxn] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1}; int ans; void dfs(string s, int v, int cnt) { int n = s.length(); if (v == n) { ans += cnt; return; } if (v < n - 2 && (s[v]...
#include <bits/stdc++.h> using namespace std; void c_p_c() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } int32_t main() { c_p_c(); long long int t; cin >> t; while (t--) { long long int n, k; cin >> n >> k; vector<long long int> a(n), b(k); for (l...
#include <bits/stdc++.h> using namespace std; const int maxN = 2e5 + 9, MOD = 1e9 + 7; int n; long long arr[maxN], ot[maxN]; long long maxsub(long long *arr, int n) { long long cr = LLONG_MIN / 4, maxi = LLONG_MIN / 4; for (int i = 0; i < n; i++) { cr = max(arr[i], cr + arr[i]); maxi = max...
#include <bits/stdc++.h> using namespace std; const long long N = 3e5 + 5; const long long mod = 1e9 + 7; const long long INF = 0x7f7f7f7f7f7f7f7f; const int INFi = 0x7f7f7f7f; long long n, m, vis[N]; void solve() { cin >> n >> m; for (int i = 1; i <= 3 * n; i++) vis[i] = 0; vector<long long> ...
#include <bits/stdc++.h> using namespace std; const int MAX = 5005, MOD = (int)1e9 + 7; int dp[MAX][MAX], pref[MAX]; int main() { int n, k, poc, kraj, i, j, raz; scanf( %d%d%d%d , &n, &poc, &kraj, &k); for (i = 1; i <= n; i++) dp[0][i] = 1; for (i = 1; i <= k; i++) { for (j = 1; j <= n; j+...
#include <bits/stdc++.h> using namespace std; int n, m, K; long long dp[1005]; long long quick_sqr(long long g, int K) { long long ret = 1; while (K) { if (K & 1) ret = ret * g % 1000000007; g = g * g % 1000000007; K >>= 1; } return ret; } long long sum[1000050], psum[10000...
#include <bits/stdc++.h> using namespace std; long long n, m, b, mod, a[509], dp[509][509], ans; int main() { cin >> n >> m >> b >> mod; dp[0][0] = 1; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n; i++) { for (int j = 1; j <= m; j++) { for (int k = 0; k <= b - a[i]; ...
#include <bits/stdc++.h> using namespace std; int main() { pair<int, int> p[10]; int i, j, w1, w2, cnt2; for (i = 0; i < 4; i++) scanf( %d%d , &p[i].first, &p[i].second); for (i = cnt2 = 0; i < 2; i++) { w1 = w2 = 0; for (j = 0; j < 2; j++) { if (p[0].first > p[2].second && p[1]....
#include <bits/stdc++.h> using namespace std; int main() { long long int j, t; cin >> t; for (j = 0; j < t; j++) { long long int n; cin >> n; long long int a[n], i; for (i = 0; i < n; i++) cin >> a[i]; long long int p = a[0], sum = a[0]; for (i = 1; i < n; i++) { ...
#include <bits/stdc++.h> using namespace std; int n; int a[200005]; long long oddpref[200005]; long long evenpref[200005]; long long evensuff[200005]; long long oddsuff[200005]; int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; } for (int i = 1; i <= n; i++) { ...
#include <bits/stdc++.h> using namespace std; int a[501102]; int ans, cnt, sum, d; void solve() { ans = 0; cnt = 0; sum = 0; d = 0; int n; cin >> n; for (int i = 1; n >= i; i++) { cin >> a[i]; if (a[i] % 2 == 1) { ans++; if (a[i] * n % 2 == 1) d = 1; ...
#include <bits/stdc++.h> #pragma comment(linker, stack:200000000 ) #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; long long freq[3000005], mul[3000005], n, q, x; int main() { ios_base::sync_with_stdio(0); cin.tie(0); ...
#include <bits/stdc++.h> using namespace std; long long N, M, nn; long long a[300002]; long long suma[300002]; long long f[300002]; long long sumf[300002]; struct data { long long a, b; long long tot; } seg[1200002]; long long s, e; bool cross(long long x1, long long y1, long long x2, long l...
#include <bits/stdc++.h> using namespace std; #define fore(i, a, b) for(int i = a; i <= b; i++) #define Fore(i, a, b) for(int i = a; i < b; i++) #define pii pair<int, int> #define fi first #define se second #define MP make_pair #define EP emplace_back #define li long long const int MAXN = 2100, m...
#include <bits/stdc++.h> using namespace std; void solve() { long long n, x; cin >> n; long long a[n + 1]; for (long long i = 0; i < n; i++) { cin >> a[i + 1]; } long long dp[n + 2]; dp[0] = 0; dp[n + 1] = 0; for (long long i = 1; i <= n; i++) dp[i] = min(dp[i - 1] + 1, a[i...
#include <bits/stdc++.h> using namespace std; long long n, ans, u, v, i, root_u, root_v, arr[100001], len[100001], c[100001], k; vector<pair<long long, long long> > in; long long find(long long x) { if (arr[x] == x) return x; return arr[x] = find(arr[x]); } int main() { cin >> n >> k; ...
#include <bits/stdc++.h> using namespace std; using ll = long long; const int maxn = 3e5 + 5; int n, a, b; string s; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int q; cin >> q; while (q--) { int a, b; cin >> a >> b; cin >> s; n = s.size(); ...
#include <bits/stdc++.h> using namespace std; int ans1[300003], ans2[300003], l[300003]; vector<int> t[2400024]; vector<int> a, q; void build(int v, int tl, int tr) { if (tl == tr) { t[v].push_back(a[tl]); return; } int mid = (tl + tr) / 2; build(v * 2, tl, mid); build(v * 2 + ...
#include <bits/stdc++.h> using namespace std; int n, a[(1 << 20)]; vector<int> odd, ev; int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; } for (int s = 0, f = n - 1; s < f; s++, f--) { if (s % 2 == 0) { swap(a[s], a[f]); } } for (int i = 0; i < ...
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 5; vector<int> v1[maxn], v2[maxn]; int n, lazy[maxn << 2], minnode[maxn << 2], maxnode[maxn << 2]; long long sumnode[maxn << 2]; void modify(int rt, int l, int r, int c) { lazy[rt] = c; minnode[rt] = maxnode[rt] = c; sumnode[rt...
#include <bits/stdc++.h> using namespace std; long long int t[4000005]; void update(long long int v, long long int tl, long long int tr, long long int pos) { if (tl == tr) { t[v]++; return; } long long int tm = (tl + tr) / 2; if (pos <= tm) update(2 * v, tl, tm, pos...
#include <bits/stdc++.h> using namespace std; template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; } template <class T> bool chmin(T &a, const T &b) { if (a > b) { a = b; return 1; } return 0; } template <class T> o...
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 5; int tim; int t[maxn]; int sum[maxn], sum2[maxn]; int in[maxn], ou[maxn], dfn[maxn]; vector<int> G[maxn]; void dfs(int rt, int fa) { in[rt] = ++tim; dfn[tim] = rt; for (int i = 0; i < G[rt].size(); i++) { int to = G...
#include <bits/stdc++.h> using namespace std; const int maxn = 200007; string s; int q, n, cnt[maxn][26]; void Solve() { int l, r; cin >> l >> r; if (l == r) { cout << Yes << n ; return; } if (s[l] != s[r]) { cout << Yes << n ; return; } int cnt = 0;...
#include <bits/stdc++.h> using namespace std; int n; int a[300010]; int p[300010]; struct node { int next[2] = {}; int cnt = 0; int par; }; node t[31 * 300010]; int root = 1; int E = 2; int main() { ios_base::sync_with_stdio(false); cin >> n; for (int i = 0; i < n; i++) cin >...
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 9; const int mod1 = 999999937; const int inf = 2e9; const double eps = 1e-7; int d[101][101]; int main() { int n, m; cin >> n >> m; for (int i = 0; i < m; i++) { int a, b, c; cin >> a >> b >> c; d[a - 1][b - ...
#include <bits/stdc++.h> using namespace std; char s[5000010]; int f[5000010]; int main() { scanf( %s , s); int l = 0, r = 0, e = 1, ans = 0; for (int i = 0; s[i]; i++) { l = l * 103 + s[i]; r = r + s[i] * e; e *= 103; if (l == r) f[i + 1] = f[(i + 1) / 2] + 1; ans += f...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:1024000000,1024000000 ) using namespace std; const int maxn = 1e6 + 7; const int INF = 1e9 + 7; int n, k; int a[maxn]; vector<int> fac[maxn]; int sum[maxn]; int L[maxn], R[maxn]; long long ans; void ini() { stack<int> st; a[n + 1] = ...
#include <bits/stdc++.h> using namespace std; template <class T> inline T sqr(const T& x) { return x * x; } template <class T> inline string tostr(const T& a) { ostringstream os( ); os << a; return os.str(); } const int inf = 1999999999; const double pi = acos(-1.0); const double ep...
#include <bits/stdc++.h> long long n, ans; int main() { scanf( %lld , &n); for (long long i = 2; i / 2 <= n; i = 2) { ans += (n + i / 2 - 1) / i (i / 2); } printf( %lld n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long k; cin >> k; getchar(); char s[1000001]; cin >> s; int a[strlen(s)]; long long sum = 0; for (int i = 0; i < strlen(s); i++) { sum += s[i] - 48; a[i] = s[i] - 48; } k = k - sum; sort(a, a + st...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; long long l, a; cin >> n >> l >> a; long long arr[n][2]; long long ans = 0; for (int i = 0; i < n; i++) { cin >> arr[i][0] >> arr[i][1]; if (i == 0) { ...
#include <bits/stdc++.h> using namespace std; bitset<50000000> arr; int primes[100100], pr = 0; int n; unsigned int A, B, C, D; int main() { cin >> n >> A >> B >> C >> D; for (int i = 2; i <= 18000; i++) { arr[i] = 1; } for (int i = 2; i <= 18000; i++) { if (arr[i] == 0) continue...
#include <bits/stdc++.h> using namespace std; struct node { int l; int r; } a[200005], b[2000005]; int cmpl(struct node n, struct node m) { return n.l < m.l; } int cmpr(struct node n, struct node m) { return n.r < m.r; } int main() { int n, m; while (~scanf( %d , &n)) { int sum = 0; ...
#include <bits/stdc++.h> using namespace std; const string FILENAME = ; const bool FILE_IO = 1; const int INF = 1000000000; void init() { if (!FILENAME.empty()) { freopen((FILENAME + .in ).c_str(), r , stdin); freopen((FILENAME + .out ).c_str(), w , stdout); } } int main() { ...
#include <bits/stdc++.h> using namespace std; const int N = 100005, M = 100005; inline int read() { int x = 0; char ch = getchar(); bool positive = 1; for (; !isdigit(ch); ch = getchar()) if (ch == - ) positive = 0; for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - 0 ; return p...
#include <bits/stdc++.h> using namespace std; long long int MOD; long long int mod(long long int a) { a %= MOD; if (a < 0) a += MOD; return a; } struct matrix { int n, m; long long int a[6][6]; matrix() {} matrix(int n_, int m_) { n = n_, m = m_; for (int i = 0; i < n; ...
#include <bits/stdc++.h> using namespace std; char pal[111]; int nn, L; int dp[101][55][2]; bool calc[101][55][2]; pair<int, int> pai[101][55][2]; int go(int ini, int n, bool pos) { int r1; if (ini == L) { pai[ini][n][pos] = make_pair(n, pos); return (n % 2 != 0) * (-0x3f3f3f3f); }...
#include <bits/stdc++.h> using namespace std; const int oo = 1e9 + 9; const long long inf = 1e18 + 18; const int max6 = 1e6 + 6; const int modx = 1e9 + 7; const int mody = 997; const int base = 137; int n, m; int cnt[max6], a[max6], tmp[max6]; int f[3][1005][1005]; int b[3][1005][1005]; int Pow(...
#include <bits/stdc++.h> const int N = 1000005; int fa[N], h[N], nxt[N], adj[N], a[N], u, v, t, id[N], Id, ans[N], f[N], n, tot, m; inline int fd(register int x) { return fa[x] == x ? x : fa[x] = fd(fa[x]); } inline void add() { nxt[++t] = h[u], h[u] = t, adj[t] = v, id[t] = Id, nxt[++t] = h[v], h[v] ...
#include <bits/stdc++.h> using namespace std; string a; string s; int main() { cin >> a >> s; sort(s.rbegin(), s.rend()); for (int i = 0, j = 0; i < a.size(); i++) { int ins = s[j] - 0 ; int ina = a[i] - 0 ; if (ina < ins && j < s.size()) { a[i] = s[j++]; } } ...
#include <bits/stdc++.h> using namespace std; void ga(int N, int *A) { for (int i(0); i < N; i++) scanf( %d , A + i); } struct lt { char c; long long T; bool operator<(const lt &r) const { return c != r.c ? T < r.T : c < r.c; } bool operator==(const lt &r) const { return c == r.c && T == r.T...
#include <bits/stdc++.h> using namespace std; int main() { long long x; cin >> x; if (!x) cout << 0 << endl; else { if (x < 0) x = -1 * x; long long ans = 1, temp = 0; while (temp < x) { temp = temp + ans; ans++; } ans--; long long res = ans ...

#include <bits/stdc++.h> using namespace std; const int N = 200005; const int M = 1000000007; int n, m, i, j, t, k, tot, a[505][505], b[505][505], c[505][505], d[505][505], q, ans[505][505], u, v, x, y; char e[505][505]; int s[255][505][505]; int main() { scanf( %d %d %d , &n, &m, &q); for (...

#include <bits/stdc++.h> using namespace std; const int N = 2e3 + 5; char g1[N][N]; int dp1[N][N]; int main() { ios::sync_with_stdio(false); cin.tie(nullptr), cout.tie(nullptr); int n = 0, m = 0, ans1 = 0; cin >> n >> m; for (int i = 1; i <= n; ++i) cin >> g1[i]; for (int i = 1; i <= n...

#include <bits/stdc++.h> using namespace std; const int N = 5e3 + 3; int sz, mn, o, rt, s[N], s2[N], fa[N], ch[N][2], lf[N], cnt; bool vis[N]; void findrt(int u) { if (vis[u]) { s[u] = 0; return; } int mx; if (ch[u][0]) { int x = ch[u][0], y = ch[u][1]; findrt(x), findr...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { string s; cin >> s; long long tot = 0; long long cont = 0; for (int i = 0; i < s.size(); i++) { if (s[i] == - && cont == 0) { tot += i + 1; } else if (s[i] ...

#include <bits/stdc++.h> using namespace std; const int N = 100500; int n, m; char s[N]; int dp[N]; void solve() { scanf( %d%d%s , &n, &m, s); long long ans = (m - 1) * n; for (int i = 0; i < n; i++) { if (i - 1 >= 0 && s[i] != s[i - 1]) ans += (m - 1) * i; if (i + 1 < n && s[i] != s...

#include <bits/stdc++.h> using namespace std; int main() { long long t, n, g, b; cin >> t; while (t--) { cin >> n >> g >> b; long long val = (n + 1) / 2; long long total = val / g; long long sum = total * g; if (val % g) { total++; } total--; sum +...

#include <bits/stdc++.h> using namespace std; using namespace std; using ll = long long; using ld = long double; const int MOD = 1e9 + 7, inf = 1e9, N = 2e5 + 1; const ll INF = 1e18; ld tic, tac; void solve() { string str, ans = ; cin >> str; int cr = 0, cs = 0, cp = 0; for (int i = 0;...

#include <bits/stdc++.h> using namespace std; const double PI = 3.1415926535; double cot(double x) { return cos(x) / sin(x); } int main() { double r, n; cin >> n >> r; cout << fixed << setprecision(9) << n * r * r * sin(PI / n) / (1 + 2 * cos(PI / n)); return 0; }

#include <bits/stdc++.h> const double PI = 3.14159265358979323846; using namespace std; int main() { std::map<int, long long> pairs; std::set<long long> positive; int n; std::cin >> n; std::vector<int> nums(n); for (int i = 0; i < n; ++i) { std::cin >> nums[i]; if (nums[i] > 0)...

#include <bits/stdc++.h> #pragma warning(disable : 4244 4267 4018 4996 4800) using namespace std; istream& in = std::cin; ostream& out = std::cout; int n, m, total; int xstart = -1, ystart; vector<vector<char>> p; int res = -1; bool ones(int x1, int y1, int x2, int y2) { for (int i = x1; i <= x2; ...

#include <bits/stdc++.h> using namespace std; #define int long long #define pii pair<int, int> int32_t mod = 1e9 + 7; void solveCase() { int n = 0, m = 0; cin >> n >> m; vector<vector<int>> mp(m, vector<int>(26, 0)); for (int i = 0; i < n; i++) { string s; ...

#include <bits/stdc++.h> using namespace std; int32_t main() { long long int n; std::cin >> n; long long int ans[n]; for (long long int i = 0; i < n; i++) { std::cin >> ans[i]; } long long int count[n]; memset(count, 0, sizeof(count)); for (long long int i = 0; i < n; i++) { ...

#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10; int sz[N]; struct Edge { long long from, to, val, nex; } edge[N]; int h[N], idx; void add(long long u, long long v, long long w) { Edge E = {u, v, w, h[u]}; edge[idx] = E; h[u] = idx++; } void init() { memset(h, ...

#include <bits/stdc++.h> using namespace std; int main() { string s; int l, i, j, k; cin >> s; for (i = 1; i < s.size() - 1; i++) { if (s[i] == A && ((s[i + 1] == B && s[i - 1] == C ) || (s[i - 1] == B && s[i + 1] == C ))) { printf( YES n ); re...

#include <bits/stdc++.h> using namespace std; const int N = 10100; int i, j, k, n, m, ch, c; int s[N], t[N]; long long ans, f[N]; void R(int &x) { x = 0; ch = getchar(); while (ch < 0 || 9 < ch) ch = getchar(); while ( 0 <= ch && ch <= 9 ) x = x * 10 + ch - 0 , ch = getchar(); } v...

#include <bits/stdc++.h> using namespace std; int color[100005]; vector<int> DSK[100005]; int num = 0, block_size; int S[100005], E[100005], c[100005]; struct query { int l, r, k, id; } Q[100005]; void DFS(int u, int pre) { S[u] = ++num; c[num] = color[u]; for (int i = 0; i < DSK[u].size...

#include <bits/stdc++.h> using namespace std; int main() { long long int n, i, count, flag, j, x; cin >> n; long long int h[n], a[n], c[n], maxc, no2, task[n], temp, tasknumber[n][n], flaggy; flaggy = 0; for (i = 0; i < n; i++) { cin >> h[i]; } for (i = 0; i < n; i++) { ...

#include <bits/stdc++.h> using namespace std; const int N = 6; const int M = 10010; const int K = 510; const int LIT = 2500; const int INF = 1 << 30; int n, m[N][N], tot, need; vector<int> v, vis; int row[N], col[N], dia1, dia2; int cr[N], cc[N], cd1, cd2; void init() { memset(m, 0, sizeof(m))...

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

#include <bits/stdc++.h> using namespace std; void file_put() { freopen( filename.in , r , stdin); freopen( filename.out , w , stdout); } long long Pow(long long x, long long k, long long _p) { long long ans = 1; for (; k; k >>= 1, x = x * x % _p) if (k & 1) (ans *= x) %= _p; return ...

#include <bits/stdc++.h> using namespace std; bool can(int x, int y, int a, int b) { cout << ? << x << << y << << a << << b << endl; string ans; cin >> ans; if (ans == BAD ) exit(0); return ans == YES ; } int main() { ios::sync_with_stdio(false); cin.tie(0); int ...

#include <bits/stdc++.h> using namespace std; const int Maxn = 507; int n, m; int E[Maxn][Maxn]; vector<int> V[Maxn]; int ans[Maxn]; bool mark[Maxn]; void dfs(int v) { mark[v] = true; for (int i = 0; i < V[v].size(); i++) { int u = V[v][i]; if (!mark[u]) ans[u] = 2 - ans[v], ...

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

#include <bits/stdc++.h> using namespace std; const int MAX_N = 2e5 + 4; int main() { vector<pair<long long, char> > ans; long long n, st[MAX_N], pr[MAX_N] = { 0, }; long long sum = 0; scanf( %lld , &n); for (int i = 0; i < n; i++) { scanf( %lld , &st[i]); ...

#include <bits/stdc++.h> using namespace std; long long gcd(long long x, long long y) { return x ? gcd(y % x, x) : y; } int N; int a[2010], b[2010], c[2010]; vector<pair<long long, long long> > v; long long func(void) { int i, j; int ans = 0; i = 0; while (i < v.size()) { for (j = i; j...

#include <bits/stdc++.h> using namespace std; int main() { int test, n, i, j, a, b; cin >> test; for (i = 0; i < test; i++) { cin >> n; for (a = 2; a < n; a++) { for (b = n - 1; b > a; b--) { if (n % a == n % b) { break; } } if (n % a =...

#include <iostream> #include <vector> #include <cstring> #include <algorithm> #include <cassert> #include <deque> #include <map> #include <queue> #include <climits> #include <set> #include <stack> #include <cmath> #include <array> #include <unordered_map> #include <unordered_set> using ...

#include <bits/stdc++.h> using namespace std; const int N = 1000 + 5; struct stu { int id, sc; } a[N]; int main() { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; int i, j; for (i = 1; i <= n; i++) { a[i].id = i; a[i].sc = 0; int x; for (j = 0; j ...

#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int n = s.size(); int l[n]; for (int i = 0; i < n; ++i) { l[i] = n; } for (int i = 0; i < n; ++i) { for (int j = 1; j <= min(n - i - 1, i); ++j) { if (s[i - j] == s[i] && s[i] == s[i + j]) ...

#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { return (b == 0 ? a : gcd(b, a % b)); } long long lcm(long long a, long long b) { return (a * (b / gcd(a, b))); } long long POWER(long long x, long long y, long long m) { if (y == 0) return 1; if (y % 2 == 0) { ...

#include <bits/stdc++.h> using namespace std; struct segment { int l, r; }; segment s[1010]; int n, ans[1010], m, pi[1010], d[1010]; bool operator<(const segment &a, const segment &b) { return a.r < b.r; } int main() { int i, j; cin >> n; for (i = 1; i <= n; i++) { cin >> s[i].l >> s...

#include <bits/stdc++.h> using namespace std; const int N = 4e5 + 10; const int INF = 1e9; map<int, int> cnt; vector<int> ind[N]; vector<int> pos(N, 0); int main() { int n, k; cin >> n >> k; vector<int> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; ind[a[i]].push_back(i); ...

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

#include <bits/stdc++.h> using namespace std; long long a[100001]; int main() { long long n, s = 0, i, k, j; string m; cin >> n; for (i = 1; i <= n; i++) { cin >> m; k = 0; for (j = 0; j < n; j++) if (m[j] == C ) k++, a[j + 1]++; s += ((k - 1) * k) / 2; } f...

#include <bits/stdc++.h> int dr[] = {2, 2, -2, -2, 1, -1, 1, -1}; int dc[] = {1, -1, 1, -1, 2, 2, -2, -2}; int dr1[] = {0, 0, 1, 1, 1, -1, -1, -1}; int dc1[] = {1, -1, 1, 0, -1, 0, 1, -1}; int dr2[] = {0, 0, 1, -1}; int dc2[] = {1, -1, 0, 0}; using namespace std; long long sum(long long x) { return (x *...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { long long a, b, n, m; cin >> a >> b >> n >> m; if (m <= min(a, b) && n + m <= a + b) cout << Yes << endl; else cout << No << endl; } return 0; }

#include <bits/stdc++.h> #pragma comment(linker, /STACK:20000000 ) using namespace std; int ri() { int x; scanf( %d , &x); return x; } long long rll() { long long x; scanf( %lld , &x); return x; } void solve() { long long x; cin >> x; set<pair<long long, long long> > r...

#include <bits/stdc++.h> using namespace std; int main() { string s, t; cin >> s >> t; for (long i = s.size() - 1; i >= 0; i--) { if (s[i] == z ) { s[i] = a ; } else { s[i]++; break; } } if (s == t) { cout << No such string ; } else { ...

#include <bits/stdc++.h> using namespace std; int n; char a[1000005]; int q; struct node { int optimal; int open; int close; node(int op = 0, int cl = 0, int o = 0) { optimal = op; open = o; close = cl; } }; node t[4 * 1000005]; node operator+(const node &left, cons...

#include <bits/stdc++.h> using namespace std; long long mod = 1e9 + 7; int maxn = 1e9, minn = -1e9; long long modpow(long long base, long long exp, int modulus) { base %= modulus; long long result = 1; while (exp > 0) { if (exp & 1) result = (result * base) % modulus; base = (base * base...

#include <bits/stdc++.h> using namespace std; const int maxn(1e5 + 5); struct circle { int a, b; long long h; circle(){}; circle(int x) : a(0), b(x), h(0) {} inline void input() { cin >> a >> b >> h; } bool operator<(const circle &t) const { return b == t.b ? (a < t.a) : b < t.b; ...

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

#include <bits/stdc++.h> using namespace std; long long find_seat(char c) { if (c == a ) return 4; if (c == b ) return 5; if (c == c ) return 6; if (c == d ) return 3; if (c == e ) return 2; if (c == f ) return 1; } int main() { long long one, two, a, b, d, n, i, res; char ...

#include <bits/stdc++.h> using namespace std; const int maxN = 1e5 + 5; int lover[maxN], unlover[maxN]; int speak[maxN]; int N, M; bool iscrime[maxN]; int totnocommit, totcommit; int main() { scanf( %d%d , &N, &M); for (int i = (1), _ = (N); i <= _; ++i) { scanf( %d , &speak[i]); if ...

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

#include <bits/stdc++.h> using namespace std; int ns[(1 << 6)]; int s[(1 << 6)]; char str[100005]; int p[100005]; void solve() { int n; scanf( %s , str + 1); n = strlen(str + 1); for (int i = n; i; --i) { int al = str[i] - a ; for (int bit = 0; bit < (1 << 6); ++bit) { ...

#include <bits/stdc++.h> int a[50][50], b[50], n, m; int work(int st) { int res = 0; for (int i = 1, s = st; i <= m; i++, s /= 2) res += a[i][m] * ((b[i] = (s & 1)) ? -1 : 1); for (int i = 1; i < m; i++) res += a[i + m][m] * ((b[i] ^ b[m]) ? -1 : 1); for (int i = 1; i < m; i++) { int t1 ...

#include <bits/stdc++.h> using namespace std; const int inf = 1e9 + 7; inline void rvi(vector<int>& v, int n) { int temp; for (int i = 0; i < n; i++) { cin >> temp; v.push_back(temp); } } inline void rvll(vector<long long int>& v, int n) { long long int temp; for (int i = 0; i ...

#include <bits/stdc++.h> using namespace std; int a[111111]; map<int, int> cnt; map<int, int> m; int main() { int n; scanf( %d , &n); m.clear(); cnt.clear(); for (int i = 0; i < n; i++) scanf( %d , &a[i]); sort(a, a + n); int ma = INT_MIN; for (int i = 0; i < n; i++) { m[...

#include <bits/stdc++.h> using namespace std; void Read(int &n) { int sign = 1; n = 0; char c; do { c = getchar(); } while (!isdigit(c) && c != - ); if (c == - ) { c = getchar(); sign = -1; } do { n = n * 10 + c - 48; c = getchar(); } while (isdigi...

#include <bits/stdc++.h> using namespace std; long long int n, t; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n; long long int f[26] = {0}, x = 0; while (n > 1) { int j = 0, sum = 0; while (sum + j + 2 <= n) j = j + 2, sum += j; f[x++] = (j - 2) / 2 +...

#include <bits/stdc++.h> using namespace std; using ll = long long; using lli = long long int; using str = string; const ll MOD = 1e9 + 7; void solve() { ll a, b, c; cin >> a >> b >> c; cout << a + b + c - 1 << n ; return; } int main() { ios_base::sync_with_stdio(false); cin.ti...

#include <bits/stdc++.h> using namespace std; const int64_t MAXN = 1000000007LL; int n; vector<int64_t> a(5), b(5), c(5), s(5); int64_t maxscore(int64_t s, int64_t n) { if (s * 2 > n) return 500; if (s * 4 > n) return 1000; if (s * 8 > n) return 1500; if (s * 16 > n) return 2000; if (s * 3...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; long double temp; temp = log2(n + 1); if (temp == (int)temp) { cout << temp << endl; } else { cout << (int)(temp) + 1 << endl; } }

#include <bits/stdc++.h> using namespace std; int main() { double r1, r2, p1, p2; double A, B; int n; scanf( %d , &n); double x; r1 = 0; for (int i = 0; i < n; i++) { scanf( %lf , &x); if (x > r1) r1 = x; } int m; scanf( %d , &m); p1 = 0; for (int i = 0; i...

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

#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; char s[int(3e5 + 5)]; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; int t; cin >> t; while (t--) { int n, m; cin >> n >> m; cin >> (s + 1); bool flag = true; ...

#include <bits/stdc++.h> using namespace std; const int maxn = 30; int a[maxn]; int num[maxn] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1}; int ans; void dfs(string s, int v, int cnt) { int n = s.length(); if (v == n) { ans += cnt; return; } if (v < n - 2 && (s[v]...

#include <bits/stdc++.h> using namespace std; void c_p_c() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } int32_t main() { c_p_c(); long long int t; cin >> t; while (t--) { long long int n, k; cin >> n >> k; vector<long long int> a(n), b(k); for (l...

#include <bits/stdc++.h> using namespace std; const int maxN = 2e5 + 9, MOD = 1e9 + 7; int n; long long arr[maxN], ot[maxN]; long long maxsub(long long *arr, int n) { long long cr = LLONG_MIN / 4, maxi = LLONG_MIN / 4; for (int i = 0; i < n; i++) { cr = max(arr[i], cr + arr[i]); maxi = max...

#include <bits/stdc++.h> using namespace std; const long long N = 3e5 + 5; const long long mod = 1e9 + 7; const long long INF = 0x7f7f7f7f7f7f7f7f; const int INFi = 0x7f7f7f7f; long long n, m, vis[N]; void solve() { cin >> n >> m; for (int i = 1; i <= 3 * n; i++) vis[i] = 0; vector<long long> ...

#include <bits/stdc++.h> using namespace std; const int MAX = 5005, MOD = (int)1e9 + 7; int dp[MAX][MAX], pref[MAX]; int main() { int n, k, poc, kraj, i, j, raz; scanf( %d%d%d%d , &n, &poc, &kraj, &k); for (i = 1; i <= n; i++) dp[0][i] = 1; for (i = 1; i <= k; i++) { for (j = 1; j <= n; j+...

#include <bits/stdc++.h> using namespace std; int n, m, K; long long dp[1005]; long long quick_sqr(long long g, int K) { long long ret = 1; while (K) { if (K & 1) ret = ret * g % 1000000007; g = g * g % 1000000007; K >>= 1; } return ret; } long long sum[1000050], psum[10000...

#include <bits/stdc++.h> using namespace std; long long n, m, b, mod, a[509], dp[509][509], ans; int main() { cin >> n >> m >> b >> mod; dp[0][0] = 1; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n; i++) { for (int j = 1; j <= m; j++) { for (int k = 0; k <= b - a[i]; ...

#include <bits/stdc++.h> using namespace std; int main() { pair<int, int> p[10]; int i, j, w1, w2, cnt2; for (i = 0; i < 4; i++) scanf( %d%d , &p[i].first, &p[i].second); for (i = cnt2 = 0; i < 2; i++) { w1 = w2 = 0; for (j = 0; j < 2; j++) { if (p[0].first > p[2].second && p[1]....

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

#include <bits/stdc++.h> using namespace std; int n; int a[200005]; long long oddpref[200005]; long long evenpref[200005]; long long evensuff[200005]; long long oddsuff[200005]; int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; } for (int i = 1; i <= n; i++) { ...

#include <bits/stdc++.h> using namespace std; int a[501102]; int ans, cnt, sum, d; void solve() { ans = 0; cnt = 0; sum = 0; d = 0; int n; cin >> n; for (int i = 1; n >= i; i++) { cin >> a[i]; if (a[i] % 2 == 1) { ans++; if (a[i] * n % 2 == 1) d = 1; ...

#include <bits/stdc++.h> #pragma comment(linker, stack:200000000 ) #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; long long freq[3000005], mul[3000005], n, q, x; int main() { ios_base::sync_with_stdio(0); cin.tie(0); ...

#include <bits/stdc++.h> using namespace std; long long N, M, nn; long long a[300002]; long long suma[300002]; long long f[300002]; long long sumf[300002]; struct data { long long a, b; long long tot; } seg[1200002]; long long s, e; bool cross(long long x1, long long y1, long long x2, long l...

#include <bits/stdc++.h> using namespace std; #define fore(i, a, b) for(int i = a; i <= b; i++) #define Fore(i, a, b) for(int i = a; i < b; i++) #define pii pair<int, int> #define fi first #define se second #define MP make_pair #define EP emplace_back #define li long long const int MAXN = 2100, m...

#include <bits/stdc++.h> using namespace std; void solve() { long long n, x; cin >> n; long long a[n + 1]; for (long long i = 0; i < n; i++) { cin >> a[i + 1]; } long long dp[n + 2]; dp[0] = 0; dp[n + 1] = 0; for (long long i = 1; i <= n; i++) dp[i] = min(dp[i - 1] + 1, a[i...

#include <bits/stdc++.h> using namespace std; long long n, ans, u, v, i, root_u, root_v, arr[100001], len[100001], c[100001], k; vector<pair<long long, long long> > in; long long find(long long x) { if (arr[x] == x) return x; return arr[x] = find(arr[x]); } int main() { cin >> n >> k; ...

#include <bits/stdc++.h> using namespace std; using ll = long long; const int maxn = 3e5 + 5; int n, a, b; string s; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int q; cin >> q; while (q--) { int a, b; cin >> a >> b; cin >> s; n = s.size(); ...

#include <bits/stdc++.h> using namespace std; int ans1[300003], ans2[300003], l[300003]; vector<int> t[2400024]; vector<int> a, q; void build(int v, int tl, int tr) { if (tl == tr) { t[v].push_back(a[tl]); return; } int mid = (tl + tr) / 2; build(v * 2, tl, mid); build(v * 2 + ...

#include <bits/stdc++.h> using namespace std; int n, a[(1 << 20)]; vector<int> odd, ev; int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; } for (int s = 0, f = n - 1; s < f; s++, f--) { if (s % 2 == 0) { swap(a[s], a[f]); } } for (int i = 0; i < ...

#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 5; vector<int> v1[maxn], v2[maxn]; int n, lazy[maxn << 2], minnode[maxn << 2], maxnode[maxn << 2]; long long sumnode[maxn << 2]; void modify(int rt, int l, int r, int c) { lazy[rt] = c; minnode[rt] = maxnode[rt] = c; sumnode[rt...

#include <bits/stdc++.h> using namespace std; long long int t[4000005]; void update(long long int v, long long int tl, long long int tr, long long int pos) { if (tl == tr) { t[v]++; return; } long long int tm = (tl + tr) / 2; if (pos <= tm) update(2 * v, tl, tm, pos...

#include <bits/stdc++.h> using namespace std; template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; } template <class T> bool chmin(T &a, const T &b) { if (a > b) { a = b; return 1; } return 0; } template <class T> o...

#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 5; int tim; int t[maxn]; int sum[maxn], sum2[maxn]; int in[maxn], ou[maxn], dfn[maxn]; vector<int> G[maxn]; void dfs(int rt, int fa) { in[rt] = ++tim; dfn[tim] = rt; for (int i = 0; i < G[rt].size(); i++) { int to = G...

#include <bits/stdc++.h> using namespace std; const int maxn = 200007; string s; int q, n, cnt[maxn][26]; void Solve() { int l, r; cin >> l >> r; if (l == r) { cout << Yes << n ; return; } if (s[l] != s[r]) { cout << Yes << n ; return; } int cnt = 0;...

#include <bits/stdc++.h> using namespace std; int n; int a[300010]; int p[300010]; struct node { int next[2] = {}; int cnt = 0; int par; }; node t[31 * 300010]; int root = 1; int E = 2; int main() { ios_base::sync_with_stdio(false); cin >> n; for (int i = 0; i < n; i++) cin >...

#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 9; const int mod1 = 999999937; const int inf = 2e9; const double eps = 1e-7; int d[101][101]; int main() { int n, m; cin >> n >> m; for (int i = 0; i < m; i++) { int a, b, c; cin >> a >> b >> c; d[a - 1][b - ...

#include <bits/stdc++.h> using namespace std; char s[5000010]; int f[5000010]; int main() { scanf( %s , s); int l = 0, r = 0, e = 1, ans = 0; for (int i = 0; s[i]; i++) { l = l * 103 + s[i]; r = r + s[i] * e; e *= 103; if (l == r) f[i + 1] = f[(i + 1) / 2] + 1; ans += f...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:1024000000,1024000000 ) using namespace std; const int maxn = 1e6 + 7; const int INF = 1e9 + 7; int n, k; int a[maxn]; vector<int> fac[maxn]; int sum[maxn]; int L[maxn], R[maxn]; long long ans; void ini() { stack<int> st; a[n + 1] = ...

#include <bits/stdc++.h> using namespace std; template <class T> inline T sqr(const T& x) { return x * x; } template <class T> inline string tostr(const T& a) { ostringstream os( ); os << a; return os.str(); } const int inf = 1999999999; const double pi = acos(-1.0); const double ep...

#include <bits/stdc++.h> long long n, ans; int main() { scanf( %lld , &n); for (long long i = 2; i / 2 <= n; i *= 2) { ans += (n + i / 2 - 1) / i * (i / 2); } printf( %lld n , ans); return 0; }

#include <bits/stdc++.h> using namespace std; int main() { long long k; cin >> k; getchar(); char s[1000001]; cin >> s; int a[strlen(s)]; long long sum = 0; for (int i = 0; i < strlen(s); i++) { sum += s[i] - 48; a[i] = s[i] - 48; } k = k - sum; sort(a, a + st...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; long long l, a; cin >> n >> l >> a; long long arr[n][2]; long long ans = 0; for (int i = 0; i < n; i++) { cin >> arr[i][0] >> arr[i][1]; if (i == 0) { ...

#include <bits/stdc++.h> using namespace std; bitset<50000000> arr; int primes[100100], pr = 0; int n; unsigned int A, B, C, D; int main() { cin >> n >> A >> B >> C >> D; for (int i = 2; i <= 18000; i++) { arr[i] = 1; } for (int i = 2; i <= 18000; i++) { if (arr[i] == 0) continue...

#include <bits/stdc++.h> using namespace std; struct node { int l; int r; } a[200005], b[2000005]; int cmpl(struct node n, struct node m) { return n.l < m.l; } int cmpr(struct node n, struct node m) { return n.r < m.r; } int main() { int n, m; while (~scanf( %d , &n)) { int sum = 0; ...

#include <bits/stdc++.h> using namespace std; const string FILENAME = ; const bool FILE_IO = 1; const int INF = 1000000000; void init() { if (!FILENAME.empty()) { freopen((FILENAME + .in ).c_str(), r , stdin); freopen((FILENAME + .out ).c_str(), w , stdout); } } int main() { ...

#include <bits/stdc++.h> using namespace std; const int N = 100005, M = 100005; inline int read() { int x = 0; char ch = getchar(); bool positive = 1; for (; !isdigit(ch); ch = getchar()) if (ch == - ) positive = 0; for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - 0 ; return p...

#include <bits/stdc++.h> using namespace std; long long int MOD; long long int mod(long long int a) { a %= MOD; if (a < 0) a += MOD; return a; } struct matrix { int n, m; long long int a[6][6]; matrix() {} matrix(int n_, int m_) { n = n_, m = m_; for (int i = 0; i < n; ...

#include <bits/stdc++.h> using namespace std; char pal[111]; int nn, L; int dp[101][55][2]; bool calc[101][55][2]; pair<int, int> pai[101][55][2]; int go(int ini, int n, bool pos) { int r1; if (ini == L) { pai[ini][n][pos] = make_pair(n, pos); return (n % 2 != 0) * (-0x3f3f3f3f); }...

#include <bits/stdc++.h> using namespace std; const int oo = 1e9 + 9; const long long inf = 1e18 + 18; const int max6 = 1e6 + 6; const int modx = 1e9 + 7; const int mody = 997; const int base = 137; int n, m; int cnt[max6], a[max6], tmp[max6]; int f[3][1005][1005]; int b[3][1005][1005]; int Pow(...

#include <bits/stdc++.h> const int N = 1000005; int fa[N], h[N], nxt[N], adj[N], a[N], u, v, t, id[N], Id, ans[N], f[N], n, tot, m; inline int fd(register int x) { return fa[x] == x ? x : fa[x] = fd(fa[x]); } inline void add() { nxt[++t] = h[u], h[u] = t, adj[t] = v, id[t] = Id, nxt[++t] = h[v], h[v] ...

#include <bits/stdc++.h> using namespace std; string a; string s; int main() { cin >> a >> s; sort(s.rbegin(), s.rend()); for (int i = 0, j = 0; i < a.size(); i++) { int ins = s[j] - 0 ; int ina = a[i] - 0 ; if (ina < ins && j < s.size()) { a[i] = s[j++]; } } ...

#include <bits/stdc++.h> using namespace std; void ga(int N, int *A) { for (int i(0); i < N; i++) scanf( %d , A + i); } struct lt { char c; long long T; bool operator<(const lt &r) const { return c != r.c ? T < r.T : c < r.c; } bool operator==(const lt &r) const { return c == r.c && T == r.T...

#include <bits/stdc++.h> using namespace std; int main() { long long x; cin >> x; if (!x) cout << 0 << endl; else { if (x < 0) x = -1 * x; long long ans = 1, temp = 0; while (temp < x) { temp = temp + ans; ans++; } ans--; long long res = ans ...