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 long long MAXN = 1e6, mod = 1000000007; long long n, m, x, k, d, p, z, sum; vector<long long> v, ans; set<long long> st; int main() { cin >> n >> k; for (long long i = 1; i <= 2 * n; i *= 2) v.push_back(i - 1); if (k == 1) { cout << n; ...
#include <bits/stdc++.h> using namespace std; template <class T> string toStr(const T &x) { stringstream s; s << x; return s.str(); } template <class T> int toInt(const T &x) { stringstream s; s << x; int r; s >> r; return r; } vector<string> pals; bool check(string s) ...
#include <bits/stdc++.h> using namespace std; const long long N = 1e5 + 5, MX = 2e5, MN = 0; struct node; extern node* empty; struct node { int mx; node LF, RT; node() : mx(0), LF(this), RT(this) {} node(int val, node* lf = empty, node* rt = empty) : mx(val), LF(lf), RT(rt) {} }; node* e...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); int n; cin >> n; int arr[n + 5][n + 5], a, b; map<int, int> mp, mp2; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { arr[i][j] = 0; } ...
#include <bits/stdc++.h> using namespace std; long long res, rec, d, h, v, e, p = 3.1415926535; int main() { cin >> d >> h; if (d == 1 && h == 1) { cout << 0; return 0; } while (d != 0 && h != 0) { if (d <= h) { d++; h -= 2; } else if (d > h) { d -= ...
#include <bits/stdc++.h> using namespace std; const int t = 1111; bitset<t> a[t], q[t]; int x[t], y[t]; char s[t]; void cl(int l, int r, int u, int d) { int i; for (i = l; i <= r; i++) q[i][u] = q[i][d] = 1; for (i = u; i <= d; i++) q[l][i] = q[r][i] = 1; } int main() { int n, m, i, j, c...
#include <bits/stdc++.h> using namespace std; int main() { int kocka[25] = {}; for (int i = 1; i <= 24; i++) cin >> kocka[i]; if (kocka[1] == kocka[2] && kocka[2] == kocka[3] && kocka[3] == kocka[4] && kocka[17] == kocka[18] && kocka[18] == kocka[7] && kocka[7] == kocka[8] && kocka[21] =...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 5; const double eps = 1e-14; char buf[1 << 12], pp1 = buf, pp2 = buf, nc; int ny; inline char gc() { return getchar(); } inline long long read() { long long x = 0; for (ny = 1; nc = gc(), (nc < 48 \|\| nc > 57) && nc != EOF;) ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 100005; const long long INF = 1e18; const long long MOD = 1000000007; long double A[100005], B[100005]; int main() { int n, p; cin >> n >> p; for (int i = 0; i < n; i++) { int x, y; cin >> x >> y; A[i] = y / p; ...
#include <bits/stdc++.h> using namespace std; const long long mxn = 105; const long long mxm = 1; const long long INF = 0x3f3f3f3f; const long long mod = 1e9 + 7; const double eps = 1e-7; long long a[mxn]; signed main(void) { long long q; cin >> q; while (q--) { long long n; cin ...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n]; vector<int> v; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); v.push_back(1); int flag = 0; for (int i = 1; i < n; i++) { flag = 0; for (int j = 0; j < v.size(); j++) { ...
#include <bits/stdc++.h> using namespace std; const int N = 2e5; const int M = N + 7; const int MOD = 1e9 + 7; const long long INF = 1e16 + 17; const int K = 5; void ex() { printf( -1 n ); exit(0); } int a[M]; int l[M], r[M], len[M]; int an[M]; bool dp[M][K + 3]; pair<int, int> par[M][...
#include <bits/stdc++.h> using namespace std; const int mxN = 302; bool ar[mxN]; int p, n; void solve() { cin >> p >> n; for (int i = 0; i < n; i++) { int a; cin >> a; int temp = a % p; if (ar[temp] == 0) { ar[temp] = 1; } else { cout << i + 1; ret...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1.01E6; vector<int> ans[MAXN]; char C[MAXN]; int A[MAXN]; int B[MAXN]; int n, top1, top2; int main(void) { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> (C + 1), n = strlen(C + 1); for (int i = 1; i <= n; ++i) { ...
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) #pragma GCC optimize( unroll-loops ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; const long long mod = 1000000007; const int mxN = 100010; vector<int> g[mxN]; int main(int argc, char** argv) { ...
#include <bits/stdc++.h> using namespace std; int n, sz[100005], msz[100005], xsz[100005], lsz[100005], son[100005], ans[100005]; vector<int> G[100005]; void dfs(int u) { sz[u] = 1; lsz[u] = n; son[u] = -1; for (int v : G[u]) { dfs(v), sz[u] += sz[v]; if (son[u] == -1 \|\| sz[v] ...
#include <bits/stdc++.h> using namespace std; long long gcd(long long first, long long second) { return !second ? first : gcd(second, first % second); } long long x, y, z; deque<long long> q, p; int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); ; cin >> x; for (int i = 1; i ...
#include <bits/stdc++.h> using namespace std; long long ans, cr[40002], ar[40005], br[40005], nd[40005]; void build(int id, int l, int r) { if (l == r) { nd[id] = cr[l]; return; } int md = (l + r) >> 1; build(id * 2, l, md); build(id * 2 + 1, md + 1, r); nd[id] = min(nd[2 * id]...
#include <bits/stdc++.h> using namespace std; const int N = 1002020, mod = 1e9 + 7; int m, tot, ans = 1, mu[N], iv[N], pr[N]; bool vis[N]; void prework(int mx) { iv[1] = mu[1] = 1; for (int i = 2; i <= mx; i++) { iv[i] = 1ll * iv[mod % i] * (mod - mod / i) % mod; if (!vis[i]) pr[++tot] = i...
#include <bits/stdc++.h> int main() { int HPY, ATKY, DEFY, HPM, ATKM, DEFM, h, a, d; while (scanf( %d %d %d , &HPY, &ATKY, &DEFY) == 3) { scanf( %d %d %d , &HPM, &ATKM, &DEFM); scanf( %d %d %d , &h, &a, &d); int mini = 1000000000; for (int i = ATKY; i <= 301; i++) for (int j = ...
#include <bits/stdc++.h> using namespace std; double EPS = 1e-9; int INF = 2000000000; long long INFF = 8000000000000000000LL; double PI = acos(-1); int dirx[8] = {-1, 0, 0, 1, -1, -1, 1, 1}; int diry[8] = {0, 1, -1, 0, -1, 1, -1, 1}; inline string IntToString(int a) { char x[100]; sprintf(x, %...
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; int n, tot, u, v; int c[N], head[N], last[N * 2], ver[N * 2]; void add(int x, int y) { ver[++tot] = y; last[tot] = head[x]; head[x] = tot; } void dfs(int x, int fa) { cout << x << ; for (int i = head[x]; i; i = la...
#include <bits/stdc++.h> using namespace std; long long power_mod(long long num, long long g) { if (g == 0) return 1; if (g % 2 == 1) return (num * power_mod((num * num) % 1000000007, g / 2)) % 1000000007; return power_mod((num * num) % 1000000007, g / 2); } long long power(long long num, long...
#include <bits/stdc++.h> using namespace std; char board[2048][2048]; int rows[2][2048]; int cols[2][2048]; int main() { int N; scanf( %d , &N); for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) scanf( %c , &board[i][j]); int ans = 0; for (int x = 0; x < 2; x++) { for (i...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; char a[n][5]; for (int i = 0; i < n; i++) { for (int j = 0; j < 5; j++) cin >> a[i][j]; } int flag = 0; for (int i = 0; i < n; i++) { if ((a[i][0] == O && a[i][1] == O )) { a[i][0] = + ; ...
#include <bits/stdc++.h> using namespace std; int n; double l; int x[1005], b[1005]; const double eps = 1e-8; double dp[1005]; double check(double mid) { for (int i = 1; i <= n; i++) dp[i] = -1e10; dp[0] = 0; for (int i = 1; i <= n; i++) { for (int j = 0; j < i; j++) { dp[i] = ma...
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; const int N = 200031; int n, m, a[N], b[N]; vector<int> g[N]; int used[N]; int dep[N]; vector<int> this_comp; vector<pair<int, int> > order; vector<pair<int, pair<int, int> > > solution; int par[N]; int in_st[N]; int used...
#include <bits/stdc++.h> using namespace std; int t, n, m, k, a, b, ans; int maxl = 1e9; int num[300005]; int main() { scanf( %d , &t); while (t--) { scanf( %d%d%d , &n, &m, &k); if (m <= k) k = m - 1; a = n - m + 1; b = n - k; for (int i = 1; i <= n; i++) { scanf...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, c0, c1, h; cin >> n >> c0 >> c1 >> h; string s; cin >> s; int ans = 0; int cnt = 0; int mini = min(c0, c1); for (int i = 0; i < n; i++) { if (s[i] == ...
#include <bits/stdc++.h> using namespace std; const long long N = 1e5 + 10; long long n, Mx, B[N], S[N]; struct Node { int32_t l, r, c; Node() { l = r = c = 0; } }; struct BST { long long L = 32; vector<Node> A; BST(long long _L = 32) { L = _L, A.clear(); A.push_back(Node());...
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( O3 ) mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int get_random() { static uniform_int_distribution<int> dist(0, 1e9 + 6); return dist(rng); } template <class T> void make_unique(T& v) { sort(v.begin()...
#include <bits/stdc++.h> using namespace std; unsigned long long k, n, d = 0, ans; string s; unsigned long long int sol1(int k); int main() { cin >> s; n = s.size(); cin >> k; ans = max(0ULL, min(2 * k, n + k - ((n + k) % 2))); ans = max(ans, sol1(k)); cout << ans << endl; const cl...
#include <bits/stdc++.h> using namespace std; int main() { long long int n; while (cin >> n) { int flag = 0; long long int i; for (int sx = 1; sx < 100; sx++) { long long int x = (sqrt(sx * sx + 4 * n) - sx) / 2; if (x * x + sx * x == n) { int tem = x; i...
#include <bits/stdc++.h> using namespace std; struct Block { long long l, r, c; Block(long long l, long long r, long long c) : l(l), r(r), c(c) {} }; bool operator<(Block a, Block b) { if (a.l != b.l) return a.l < b.l; if (a.r != b.r) return a.r < b.r; return a.c < b.c; } const int maxn ...
#include <bits/stdc++.h> using namespace std; long long fib[100001]; void fibonacci() { fib[0] = 1; fib[1] = 1; fib[2] = 2; for (long long i = 3; i <= 100000; i++) { fib[i] = fib[i - 1] + fib[i - 2]; fib[i] = fib[i] % 1000000007; } } double dist(double x, double y, double a, do...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e3 + 5; int n, a[maxn], belong[maxn], bn = 1; int ans[maxn][maxn]; struct node { int l, r; } block[maxn]; bool cmp(node x, node y) { return (x.r - x.l) > (y.r - y.l); } int main() { int l, r, flag; cin >> n; for (int i = 1; ...
#include <bits/stdc++.h> using namespace std; const int MAX_N = 1505; const int dx[] = {-1, 0, 1, 0}; const int dy[] = {0, 1, 0, -1}; int visx[MAX_N][MAX_N]; int visy[MAX_N][MAX_N]; char A[MAX_N][MAX_N]; int sx, sy; int n, m; queue<pair<int, int> > q; bool in(int x, int y) { return x >= 0 && x < n...
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } long long fac(long long n) { if (n == 1) return 1; return n * fac(n - 1); } long long power(long long x, long long y) { long long res = 1; for (long l...
#include <bits/stdc++.h> using namespace std; long long n, k, a, b, ans; int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n >> k >> a >> b; if (k == 1) { cout << (n - 1) * a; return 0; } while (n > 1) { if (n % k != 0 && n < k) { ans += (n - 1) * a; ...
#include <bits/stdc++.h> using namespace std; const long double PI = 3.14159265358979323846L; const long double E = 2.71828182845904523536L; const int INF = (1 << 30) - 1; const long long LINF = 1e18; const long double eps = 1e-7; const long long mod = 1e9 + 7; unordered_map<long long, long long> u[65][...
#include <bits/stdc++.h> using namespace std; bool isPrime(long long n) { if (n <= 1) return false; for (int i = 2; i <= sqrt(n); i++) if (n % i == 0) return false; return true; } long long mod = 1000000007; int main() { long long i, j, k = 0, n, m = 0, a[300001], b[300001], t = 0, ans =...
#include <bits/stdc++.h> using namespace std; int lim = 1e6; int inf = 1e9 + 7; bool ispal(string s) { int n = s.size(); bool ans = true; for (int i = 0; i < n / 2; i++) { if (s[i] != s[n - i - 1]) { ans = false; break; } } return ans; } int main() { ios_b...
#include <bits/stdc++.h> using namespace std; int main() { long long a, b; cin >> a >> b; int ans = 1; for (int i = 1; i <= min(a, b); i++) ans *= i; cout << ans; }
#include <bits/stdc++.h> using namespace std; long long int n; int main() { scanf( %lld , &n); if (n == 1 \|\| n == 3 \|\| n == 4 \|\| n == 6 \|\| n == 9 \|\| n == 12) { cout << 0 << endl; return 0; } int mod = n % 3, mx; if (mod == 2) { for (long long i = 1e7; i >= 1; i -= 3) { ...
#include <bits/stdc++.h> using namespace std; vector<int> P[2]; int n; int mark[100011]; int cnt[100011]; int cor(int p, int n) { return 2 * n + p; } int main() { int k, x; cin >> n; for (int i = 0; i < 2; i++) { cin >> k; for (int j = 0; j < k; j++) { cin >> x; P[i...
#include <bits/stdc++.h> using namespace std; const long long INF = 1e18; struct custom_hash { static uint64_t splitmix64(uint64_t x) { x += 0x9e3779b97f4a7c15; x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9; x = (x ^ (x >> 27)) * 0x94d049bb133111eb; return x ^ (x >> 31); } size_t op...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; char last, f; cin >> last; int ans = 0; f = last; for (int i = 1; i < n; i++) { char a; cin >> a; if (a != last) ans++; last = a; } if ...
#include <bits/stdc++.h> using namespace std; deque<int> a[355]; int n, m, S, Q, z, L, R, k, l, r, x, c[355][100005]; int ans; void deal(int &x) { x = (x + ans - 1) % n + 1; } int main() { scanf( %d , &n); S = int(sqrt(n)), m = n / S + 1; for (int i = 0; i < n; i++) { scanf( %d , &x); ...
#include <bits/stdc++.h> using namespace std; long long int a[500001], pref[500001], valv[500001]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); long long int t, i, j, k, l, m = 0, n, o, p, q, r, s, x; cin >> n >> x; pref[0] = 0; valv[0] = 0; for (i = 0; i < n; i++) { ...
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 10; const long long mod = 998244353; long long qpow(long long a, long long b) { long long ans = 1; while (b) { if (b & 1) ans = ans * a % mod; a = a * a % mod; b /= 2; } return ans; } long long b[maxn], in...
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; int q, x_1, y_1, x_2, y_2, k, len, a[35], b[35], c[35]; pair<int, int> dp[35][2][2][2]; int Add(int a, int b) { return a + b >= mod ? a + b - mod : a + b; } int Minus(int a, int b) { return a < b ? a - b + mod : a - b; } pair<int, int>...
#include <bits/stdc++.h> using namespace std; bool visited[100005]; vector<long long> arr[100005]; int main() { std::ios::sync_with_stdio(false); long long n, x; cin >> n; vector<pair<long long, long long> > ans; for (long long i = 0; i < n; i++) { cin >> x; arr[x].push_back(i); ...
#include <bits/stdc++.h> using namespace std; long long modI(long long a, long long m); long long gcd(long long a, long long b); long long powM(long long x, long long y, long long m); long long swap(long long a, long long b); void swap(long long& a, long long& b) { long long tp = a; a = b; b = t...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector<long long> a(n + 1); for (int i = 1; i <= n; i++) { cin >> a[i]; } int m; cin >> m; long long ans = 0; long long wt = 0, ht = 0; ...
#include <bits/stdc++.h> using namespace std; int main() { cin.tie(0); ios_base::sync_with_stdio(0); string x, y; cin >> x >> y; char ans[200]; for (int i = 0; i < x.size(); i++) { if (y[i] == x[i]) { ans[i] = x[i]; } else if (y[i] < x[i]) { ans[i] = y[i]; }...
#include <bits/stdc++.h> using namespace std; int main() { int n, a[4] = {}; cin >> n; for (int i = 0; i < n; i++) { char c; cin >> c; a[0] += c == U ; a[1] += c == D ; a[2] += c == L ; a[3] += c == R ; } long res = min(a[0], a[1]) * 2 + min(a[2], a[3]) * ...
#include <bits/stdc++.h> using namespace std; const long long INF = LLONG_MAX; bool check(char a, char b) { return a == _ \|\| a == b; } long long foo(string s, string tail) { if (!check(s[s.size() - 2], tail[0]) \|\| !check(s.back(), tail[1])) return 0; s[s.size() - 2] = tail[0]; s[s.size() - 1] = ta...
#include <bits/stdc++.h> using namespace std; const int N = 200; int n, a[N], m; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d , &a[i]); scanf( %d , &m); for (int i = 0; i < m; i++) { int x, y; scanf( %d%d , &x, &y); x--; if (x - 1 >= 0) a[x - 1] += ...
#include <bits/stdc++.h> bool sev(int h, int m); using namespace std; int main() { int snooze; cin >> snooze; int h; int m; int n = 0; cin >> h >> m; if (sev(h, m)) { cout << 0 << endl; } else { while (sev(h, m) == false) { if (m >= snooze) { m = m -...
#include <bits/stdc++.h> using namespace std; int main() { int x, ans, sum = 0; cin >> x; x = abs(x); for (int i = 0;; i++) { sum += i; if (sum >= x && (sum - x) % 2 == 0) { ans = i; break; } } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; vector<long long int> g[200001]; vector<long long int> g1[200001]; vector<long long int> vec; bool vis[200001]; void fun(long long int u) { vis[u] = 1; for (long long int i = 0; i < g[u].size(); i++) { long long int v = g[u][i]; if (!vis[v]) ...
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 10; int ans[maxn]; vector<int> xs[maxn], ys[maxn]; struct query { int l, r, d, u, id; query(int aa, int bb, int cc, int dd, int ee) { l = aa; r = bb; d = cc; u = dd; id = ee; } query() {} }; ...
#include <bits/stdc++.h> using namespace std; int main() { int n, k; scanf( %d %d , &n, &k); if (n == 5 && k == 2) { puts( YES ); for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (i & 1) printf( L ); else printf( S ); ...
#include <bits/stdc++.h> using namespace std; int main(void) { int t; cin >> t; while (t--) { long long n, p, k; cin >> n >> p >> k; long long ans = 0, pre = 0; vector<long long> a(n, -1); for (long long i = 0; i < n; ++i) { cin >> a[i]; } sort(a.begin()...
#include <bits/stdc++.h> using namespace std; void fast() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); } int main() { fast(); long long i, j, n, t, su = 0, k; cin >> t; vector<long long> v[t], s[t]; vector<pair<long long, pair<long long, long long>>> p; for (i...
#include <bits/stdc++.h> using namespace std; unsigned int dp[(int)1e3 + 7], mn[(int)1e3 + 7], n; int a[(int)1e3 + 7], b[26], ml = 0; char aa[(int)1e3 + 7]; void dpi() { dp[0] = 1; mn[0] = 1; ml = 1; for (int i = 1; i < n; i++) { int mm = a[i]; dp[i] = dp[i - 1]; mn[i] = mn[i...
#include <bits/stdc++.h> using namespace std; double l[10], b[10]; vector<int> kk(10, -1); vector<vector<int> > v; int k, n; void abc(int i, int sum) { if (i == 0 && sum == 0) { v.push_back(kk); return; } if (i == 0) { return; } for (int j = 0; j <= k; j++) { if (...
#include <bits/stdc++.h> template <class T> T abs(T x) { return (x > 0) ? x : (-x); } template <class T> T ceil(T a, T b) { return a / b + (a % b != 0); } int n, t[125][5], cnt[5], l, r, mid; int a[6] = {1, 2, 4, 8, 16, 32}; std::set<int> s; int score(int x, int y) { int s = y / x, i; ...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); long long n, k; cin >> n >> k; long long r = max(n - 2 * k, 0LL); cout << n * (n - 1) / 2 - r * (r - 1) / 2; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int r, b, y; cin >> y >> b >> r; int ans = min(y, b - 1); ans = min(ans, r - 2); ans = ans * 3 + 3; cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10, mod = 998244353, M = 3e3 + 10; int ksm(int x, int y) { int ans = 1; while (y) { if (y & 1) ans = (long long)ans * x % mod; x = (long long)x * x % mod; y >>= 1; } return ans; } int a[N], w[N], f[M][M], g[M][...
#include <bits/stdc++.h> using namespace std; int main() { string n; cin >> n; if (n[0] != - ) { cout << n; } else { char max = 0 ; int mem; for (int i = n.length() - 2; i < n.length(); ++i) { if (n[i] >= max) { max = n[i]; mem = i; } ...
#include <bits/stdc++.h> using namespace std; long long inv[100010], fac[100010], p[100010], t[100010][20]; int n, l, r, P, tot, Phi; int phi(int k) { int i, s; s = k; for (i = 2; i * i <= k; i++) { if (k % i == 0) s = s / i * (i - 1); while (k % i == 0) k /= i; } if (k > 1) s = ...
#include <bits/stdc++.h> using namespace std; const int maxn = 100100; int n; long long a[maxn]; map<long long, long long> mp; long long mul(long long x, long long n) { long long ret = 1; while (n) { if (n & 1) ret = x; x = x; n >>= 1; } return ret; } int main() { ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; cin >> n; multiset<long long> heros; for (int i = 0; i < n; i++) { long long temp; cin >> temp; heros.insert(temp); } long long sum = acc...
#include <bits/stdc++.h> using namespace std; long long int base(int a, int b) { int ret = 0; vector<int> v; while (a > 0) { v.push_back(a % b); a /= b; } for (int i = 0; i < v.size(); i++) { ret += v[i]; } return ret; } int main() { long long int a; cin >> ...
#include <bits/stdc++.h> using namespace std; long long lmin(long long a, long long b) { if (a < b) return a; return b; } long long lmax(long long a, long long b) { if (a > b) return a; return b; } int main() { long long t1, t2, x1, x2, t0; scanf( %lld %lld %lld %lld %lld , &t1, &t2...
#include <bits/stdc++.h> using namespace std; int main() { int x, y, z; cin >> x >> y >> z; if (abs(x - y) > z) { if (x > y) { cout << + n ; } else { cout << - n ; } } else { if (abs(x - y) == 0 && z == 0) { cout << 0 n ; } else { cout...
#include <bits/stdc++.h> using namespace std; const int MN = 1e4 + 5; int N, K, i, x, y, sz[MN], mx[MN], ct, c[MN], dp[MN]; vector<int> adj[MN], elem[2]; vector<pair<int, int> > ans; int dfs(int n, int p) { sz[n] = 1; mx[n] = 0; for (auto v : adj[n]) { if (v == p \|\| c[v]) continue; s...
#include <bits/stdc++.h> using namespace std; int main() { long n; cin >> n; long long int ans = 0, ans1, k, a1, a2, x, y, m, s = 0; vector<pair<long, pair<long, long>>> r; for (int i = 0; i < n; ++i) { cin >> k; s += k; cin >> a1 >> x >> y >> m; ans1 = 0; r.push_ba...
#include<bits/stdc++.h> using namespace std; typedef long long ll; const int N=2e5+10,mod=1e9+7; ll a[N]; #define PII pair<int,int> #define x first #define y second #define PB push_back void solve() { int n; cin>>n; int sum=0; map<ll,int> mp; for(int i=1;i<=n;i++){ ...
#include <bits/stdc++.h> using namespace std; int main() { int n, m, a; scanf( %d%d , &n, &m); if (n == 1) a = 1; else if (m == 1) a = 2; else if (m == n) a = n - 1; else if (m - 1 < n - m) a = m + 1; else a = m - 1; printf( %d , a); return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 5; set<pair<int, int> > topo[2]; vector<int> G[maxn], R[maxn]; int n, m, code[maxn], in[maxn], out[maxn]; bool seen[maxn]; void dfs(int node) { seen[node] = 1; for (int son : G[node]) if (!seen[son]) dfs(son); topo[code...
#include <bits/stdc++.h> using namespace std; signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long int a, b, c, n; cin >> a >> b >> c >> n; if ((min(min(a, b), c) >= n) \|\| (n - (a + b - c) < 1) \|\| (min(a, b) < c)) return cout << -1, 0; co...
#include <bits/stdc++.h> using namespace std; map<string, int> ma; int main() { string s; int n; cin >> n; ma.clear(); while (n--) { cin >> s; if (ma[s] == 0) printf( NO n ); else printf( YES n ); ma[s]++; } return 0; }
#include <bits/stdc++.h> int main() { int n, w, cnt1, cnt2; scanf( %d , &n); cnt1 = cnt2 = 0; while (n-- > 0) { scanf( %d , &w); if (w == 100) cnt1++; else cnt2++; } printf( %s n , cnt1 % 2 == 0 && (cnt2 % 2 == 0 \|\| cnt1 >= 2) ? YES : NO ); return 0; ...
#include <bits/stdc++.h> using namespace std; const int N = 20005; const int INF = -1; int n, m, p; int a[N]; int b[N]; int F[2][N]; int Ra[N]; int Rb[N]; string Path; inline void checkmax(int &t, const int x) { if (x > t) t = x; } inline int w(int i, int j) { int ret = a[i] + b[j]; ...
#include <bits/stdc++.h> using namespace std; const int INFint = 2e9; const long long INF = 1e18; const long long MOD = 1000000007ll; int main() { ios_base::sync_with_stdio(0); int n; cin >> n; vector<long long> a(n), b; for (auto &x : a) cin >> x; b = a; sort(b.begin(), b.end()); ...
#include <bits/stdc++.h> using namespace std; const int N = 4e5 + 10, INF = 1e9; int l[N], r[N], ps[N]; map<int, int> mp; int cnt, seg[4 * N], lazy[4 * N]; inline void shift(int id) { seg[2 * id] += lazy[id]; lazy[2 * id] += lazy[id]; seg[2 * id + 1] += lazy[id]; lazy[2 * id + 1] += lazy[id]...
#include <bits/stdc++.h> using namespace std; const int MAX_N = 1500 + 10; const int INF = 1e9; int ans[MAX_N][26]; int main() { ios::sync_with_stdio(0); int n; cin >> n; string s; cin >> s; for (int it = 0; it < 26; ++it) { char c = char(it + a ); for (int i = 0; i < n; +...
#include <bits/stdc++.h> using namespace std; int main() { long long w, m; cin >> w >> m; vector<int> a; long long z = m; while (z) { a.push_back(z % w); z /= w; } a.push_back(0); int flag = 1; for (int i = 0; i < a.size(); i++) { if (a[i] == w \|\| a[i] == w - 1)...
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 7; int n, a[N], f[N][21], pos[N], nxt[N], tmp[N], ans; int query(int l, int r) { int k = log2(r - l + 1); return max(f[l][k], f[r - (1 << k) + 1][k]); } int main() { scanf( %d , &n); memset(pos, 0x3f, sizeof(pos)); for (in...
#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007; const double PI = 3.141592653589793238463; using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int q; cin >> q; while (q--) { long long sum = 0, r = 0; ...
#include <bits/stdc++.h> using namespace std; string a, b, c, s; map<string, long long> m[3]; long long f, q; bool sach(string aa) { if (s.size() >= aa.size() && s.substr(s.size() - aa.size(), aa.size()) == aa) return true; return false; } void solve(long long i) { if (sach(a)) { i...
#include <bits/stdc++.h> using namespace std; const int N = 300; const long long mod = 1e9 + 7; long long dp[N][N], mi[N], mi_1[N], C[N][N], n, k; int main() { cin >> n >> k; for (int i = (0); i <= (n); i++) { C[i][0] = 1; for (int j = (1); j <= (i); j++) C[i][j] = (C[i - 1][j] + C...
#include <bits/stdc++.h> using namespace std; int A[100]; int n; int countNonZero = 0; int sumElements(int size) { int sum = 0; for (int i = 0; i < size; i++) sum = sum + A[i]; return sum; } int findNonZero(int size) { int ind = -1; for (int i = 0; i < size; i++) { if (A[i] != 0)...
#include <bits/stdc++.h> using namespace std; using namespace std; int n, k, a[((int)(1e5) + 5)], x, y, bol[((int)(1e6 + 5))], dp[((int)(1e6 + 5))], t, snr; int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; cin >> x >> y; sort(a + 1, a + n + 1); n = unique(a + 1, a + n +...
#include <bits/stdc++.h> using namespace std; int dp[31][31][51]; int solve(int i, int j, int k) { if (i <= 0 \|\| j <= 0) return 1e9; if (i * j == k \|\| k <= 0) return 0; if (dp[i][j][k] != -1) return dp[i][j][k]; int op = 1e9; for (int x = 1; x <= i; ++x) for (int y = 1; y <= k; ++y) ...
#include <bits/stdc++.h> using namespace std; const int MAX = 2e4 + 14; const int INF = INT_MAX; const int MAXC = 30; const long long LLINF = 1e16 + 14; int main() { int t; scanf( %d , &t); while (t--) { int n; scanf( %d , &n); int d; scanf( %d , &d); int res; ...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:16777216 ) using namespace std; vector<vector<int>> g(1000); bool removed[1000]; int cost[1000]; int n, d; void input() { cin >> n >> d; for (int i = 0; i < n; i++) { cin >> cost[i]; } } void solution() { int sum = 0; f...

#include <bits/stdc++.h> using namespace std; const long long MAXN = 1e6, mod = 1000000007; long long n, m, x, k, d, p, z, sum; vector<long long> v, ans; set<long long> st; int main() { cin >> n >> k; for (long long i = 1; i <= 2 * n; i *= 2) v.push_back(i - 1); if (k == 1) { cout << n; ...

#include <bits/stdc++.h> using namespace std; template <class T> string toStr(const T &x) { stringstream s; s << x; return s.str(); } template <class T> int toInt(const T &x) { stringstream s; s << x; int r; s >> r; return r; } vector<string> pals; bool check(string s) ...

#include <bits/stdc++.h> using namespace std; const long long N = 1e5 + 5, MX = 2e5, MN = 0; struct node; extern node* empty; struct node { int mx; node *LF, *RT; node() : mx(0), LF(this), RT(this) {} node(int val, node* lf = empty, node* rt = empty) : mx(val), LF(lf), RT(rt) {} }; node* e...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); int n; cin >> n; int arr[n + 5][n + 5], a, b; map<int, int> mp, mp2; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { arr[i][j] = 0; } ...

#include <bits/stdc++.h> using namespace std; long long res, rec, d, h, v, e, p = 3.1415926535; int main() { cin >> d >> h; if (d == 1 && h == 1) { cout << 0; return 0; } while (d != 0 && h != 0) { if (d <= h) { d++; h -= 2; } else if (d > h) { d -= ...

#include <bits/stdc++.h> using namespace std; const int t = 1111; bitset<t> a[t], q[t]; int x[t], y[t]; char s[t]; void cl(int l, int r, int u, int d) { int i; for (i = l; i <= r; i++) q[i][u] = q[i][d] = 1; for (i = u; i <= d; i++) q[l][i] = q[r][i] = 1; } int main() { int n, m, i, j, c...

#include <bits/stdc++.h> using namespace std; int main() { int kocka[25] = {}; for (int i = 1; i <= 24; i++) cin >> kocka[i]; if (kocka[1] == kocka[2] && kocka[2] == kocka[3] && kocka[3] == kocka[4] && kocka[17] == kocka[18] && kocka[18] == kocka[7] && kocka[7] == kocka[8] && kocka[21] =...

#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 5; const double eps = 1e-14; char buf[1 << 12], *pp1 = buf, *pp2 = buf, nc; int ny; inline char gc() { return getchar(); } inline long long read() { long long x = 0; for (ny = 1; nc = gc(), (nc < 48 || nc > 57) && nc != EOF;) ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 100005; const long long INF = 1e18; const long long MOD = 1000000007; long double A[100005], B[100005]; int main() { int n, p; cin >> n >> p; for (int i = 0; i < n; i++) { int x, y; cin >> x >> y; A[i] = y / p; ...

#include <bits/stdc++.h> using namespace std; const long long mxn = 105; const long long mxm = 1; const long long INF = 0x3f3f3f3f; const long long mod = 1e9 + 7; const double eps = 1e-7; long long a[mxn]; signed main(void) { long long q; cin >> q; while (q--) { long long n; cin ...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n]; vector<int> v; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); v.push_back(1); int flag = 0; for (int i = 1; i < n; i++) { flag = 0; for (int j = 0; j < v.size(); j++) { ...

#include <bits/stdc++.h> using namespace std; const int N = 2e5; const int M = N + 7; const int MOD = 1e9 + 7; const long long INF = 1e16 + 17; const int K = 5; void ex() { printf( -1 n ); exit(0); } int a[M]; int l[M], r[M], len[M]; int an[M]; bool dp[M][K + 3]; pair<int, int> par[M][...

#include <bits/stdc++.h> using namespace std; const int mxN = 302; bool ar[mxN]; int p, n; void solve() { cin >> p >> n; for (int i = 0; i < n; i++) { int a; cin >> a; int temp = a % p; if (ar[temp] == 0) { ar[temp] = 1; } else { cout << i + 1; ret...

#include <bits/stdc++.h> using namespace std; const int MAXN = 1.01E6; vector<int> ans[MAXN]; char C[MAXN]; int A[MAXN]; int B[MAXN]; int n, top1, top2; int main(void) { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> (C + 1), n = strlen(C + 1); for (int i = 1; i <= n; ++i) { ...

#include <bits/stdc++.h> #pragma GCC optimize( O3 ) #pragma GCC optimize( unroll-loops ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; const long long mod = 1000000007; const int mxN = 100010; vector<int> g[mxN]; int main(int argc, char** argv) { ...

#include <bits/stdc++.h> using namespace std; int n, sz[100005], msz[100005], xsz[100005], lsz[100005], son[100005], ans[100005]; vector<int> G[100005]; void dfs(int u) { sz[u] = 1; lsz[u] = n; son[u] = -1; for (int v : G[u]) { dfs(v), sz[u] += sz[v]; if (son[u] == -1 || sz[v] ...

#include <bits/stdc++.h> using namespace std; long long gcd(long long first, long long second) { return !second ? first : gcd(second, first % second); } long long x, y, z; deque<long long> q, p; int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); ; cin >> x; for (int i = 1; i ...

#include <bits/stdc++.h> using namespace std; long long ans, cr[40002], ar[40005], br[40005], nd[40005]; void build(int id, int l, int r) { if (l == r) { nd[id] = cr[l]; return; } int md = (l + r) >> 1; build(id * 2, l, md); build(id * 2 + 1, md + 1, r); nd[id] = min(nd[2 * id]...

#include <bits/stdc++.h> using namespace std; const int N = 1002020, mod = 1e9 + 7; int m, tot, ans = 1, mu[N], iv[N], pr[N]; bool vis[N]; void prework(int mx) { iv[1] = mu[1] = 1; for (int i = 2; i <= mx; i++) { iv[i] = 1ll * iv[mod % i] * (mod - mod / i) % mod; if (!vis[i]) pr[++tot] = i...

#include <bits/stdc++.h> int main() { int HPY, ATKY, DEFY, HPM, ATKM, DEFM, h, a, d; while (scanf( %d %d %d , &HPY, &ATKY, &DEFY) == 3) { scanf( %d %d %d , &HPM, &ATKM, &DEFM); scanf( %d %d %d , &h, &a, &d); int mini = 1000000000; for (int i = ATKY; i <= 301; i++) for (int j = ...

#include <bits/stdc++.h> using namespace std; double EPS = 1e-9; int INF = 2000000000; long long INFF = 8000000000000000000LL; double PI = acos(-1); int dirx[8] = {-1, 0, 0, 1, -1, -1, 1, 1}; int diry[8] = {0, 1, -1, 0, -1, 1, -1, 1}; inline string IntToString(int a) { char x[100]; sprintf(x, %...

#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; int n, tot, u, v; int c[N], head[N], last[N * 2], ver[N * 2]; void add(int x, int y) { ver[++tot] = y; last[tot] = head[x]; head[x] = tot; } void dfs(int x, int fa) { cout << x << ; for (int i = head[x]; i; i = la...

#include <bits/stdc++.h> using namespace std; long long power_mod(long long num, long long g) { if (g == 0) return 1; if (g % 2 == 1) return (num * power_mod((num * num) % 1000000007, g / 2)) % 1000000007; return power_mod((num * num) % 1000000007, g / 2); } long long power(long long num, long...

#include <bits/stdc++.h> using namespace std; char board[2048][2048]; int rows[2][2048]; int cols[2][2048]; int main() { int N; scanf( %d , &N); for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) scanf( %c , &board[i][j]); int ans = 0; for (int x = 0; x < 2; x++) { for (i...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; char a[n][5]; for (int i = 0; i < n; i++) { for (int j = 0; j < 5; j++) cin >> a[i][j]; } int flag = 0; for (int i = 0; i < n; i++) { if ((a[i][0] == O && a[i][1] == O )) { a[i][0] = + ; ...

#include <bits/stdc++.h> using namespace std; int n; double l; int x[1005], b[1005]; const double eps = 1e-8; double dp[1005]; double check(double mid) { for (int i = 1; i <= n; i++) dp[i] = -1e10; dp[0] = 0; for (int i = 1; i <= n; i++) { for (int j = 0; j < i; j++) { dp[i] = ma...

#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; const int N = 200031; int n, m, a[N], b[N]; vector<int> g[N]; int used[N]; int dep[N]; vector<int> this_comp; vector<pair<int, int> > order; vector<pair<int, pair<int, int> > > solution; int par[N]; int in_st[N]; int used...

#include <bits/stdc++.h> using namespace std; int t, n, m, k, a, b, ans; int maxl = 1e9; int num[300005]; int main() { scanf( %d , &t); while (t--) { scanf( %d%d%d , &n, &m, &k); if (m <= k) k = m - 1; a = n - m + 1; b = n - k; for (int i = 1; i <= n; i++) { scanf...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, c0, c1, h; cin >> n >> c0 >> c1 >> h; string s; cin >> s; int ans = 0; int cnt = 0; int mini = min(c0, c1); for (int i = 0; i < n; i++) { if (s[i] == ...

#include <bits/stdc++.h> using namespace std; const long long N = 1e5 + 10; long long n, Mx, B[N], S[N]; struct Node { int32_t l, r, c; Node() { l = r = c = 0; } }; struct BST { long long L = 32; vector<Node> A; BST(long long _L = 32) { L = _L, A.clear(); A.push_back(Node());...

#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( O3 ) mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int get_random() { static uniform_int_distribution<int> dist(0, 1e9 + 6); return dist(rng); } template <class T> void make_unique(T& v) { sort(v.begin()...

#include <bits/stdc++.h> using namespace std; unsigned long long k, n, d = 0, ans; string s; unsigned long long int sol1(int k); int main() { cin >> s; n = s.size(); cin >> k; ans = max(0ULL, min(2 * k, n + k - ((n + k) % 2))); ans = max(ans, sol1(k)); cout << ans << endl; const cl...

#include <bits/stdc++.h> using namespace std; int main() { long long int n; while (cin >> n) { int flag = 0; long long int i; for (int sx = 1; sx < 100; sx++) { long long int x = (sqrt(sx * sx + 4 * n) - sx) / 2; if (x * x + sx * x == n) { int tem = x; i...

#include <bits/stdc++.h> using namespace std; struct Block { long long l, r, c; Block(long long l, long long r, long long c) : l(l), r(r), c(c) {} }; bool operator<(Block a, Block b) { if (a.l != b.l) return a.l < b.l; if (a.r != b.r) return a.r < b.r; return a.c < b.c; } const int maxn ...

#include <bits/stdc++.h> using namespace std; long long fib[100001]; void fibonacci() { fib[0] = 1; fib[1] = 1; fib[2] = 2; for (long long i = 3; i <= 100000; i++) { fib[i] = fib[i - 1] + fib[i - 2]; fib[i] = fib[i] % 1000000007; } } double dist(double x, double y, double a, do...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e3 + 5; int n, a[maxn], belong[maxn], bn = 1; int ans[maxn][maxn]; struct node { int l, r; } block[maxn]; bool cmp(node x, node y) { return (x.r - x.l) > (y.r - y.l); } int main() { int l, r, flag; cin >> n; for (int i = 1; ...

#include <bits/stdc++.h> using namespace std; const int MAX_N = 1505; const int dx[] = {-1, 0, 1, 0}; const int dy[] = {0, 1, 0, -1}; int visx[MAX_N][MAX_N]; int visy[MAX_N][MAX_N]; char A[MAX_N][MAX_N]; int sx, sy; int n, m; queue<pair<int, int> > q; bool in(int x, int y) { return x >= 0 && x < n...

#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } long long fac(long long n) { if (n == 1) return 1; return n * fac(n - 1); } long long power(long long x, long long y) { long long res = 1; for (long l...

#include <bits/stdc++.h> using namespace std; long long n, k, a, b, ans; int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n >> k >> a >> b; if (k == 1) { cout << (n - 1) * a; return 0; } while (n > 1) { if (n % k != 0 && n < k) { ans += (n - 1) * a; ...

#include <bits/stdc++.h> using namespace std; const long double PI = 3.14159265358979323846L; const long double E = 2.71828182845904523536L; const int INF = (1 << 30) - 1; const long long LINF = 1e18; const long double eps = 1e-7; const long long mod = 1e9 + 7; unordered_map<long long, long long> u[65][...

#include <bits/stdc++.h> using namespace std; bool isPrime(long long n) { if (n <= 1) return false; for (int i = 2; i <= sqrt(n); i++) if (n % i == 0) return false; return true; } long long mod = 1000000007; int main() { long long i, j, k = 0, n, m = 0, a[300001], b[300001], t = 0, ans =...

#include <bits/stdc++.h> using namespace std; int lim = 1e6; int inf = 1e9 + 7; bool ispal(string s) { int n = s.size(); bool ans = true; for (int i = 0; i < n / 2; i++) { if (s[i] != s[n - i - 1]) { ans = false; break; } } return ans; } int main() { ios_b...

#include <bits/stdc++.h> using namespace std; int main() { long long a, b; cin >> a >> b; int ans = 1; for (int i = 1; i <= min(a, b); i++) ans *= i; cout << ans; }

#include <bits/stdc++.h> using namespace std; long long int n; int main() { scanf( %lld , &n); if (n == 1 || n == 3 || n == 4 || n == 6 || n == 9 || n == 12) { cout << 0 << endl; return 0; } int mod = n % 3, mx; if (mod == 2) { for (long long i = 1e7; i >= 1; i -= 3) { ...

#include <bits/stdc++.h> using namespace std; vector<int> P[2]; int n; int mark[100011]; int cnt[100011]; int cor(int p, int n) { return 2 * n + p; } int main() { int k, x; cin >> n; for (int i = 0; i < 2; i++) { cin >> k; for (int j = 0; j < k; j++) { cin >> x; P[i...

#include <bits/stdc++.h> using namespace std; const long long INF = 1e18; struct custom_hash { static uint64_t splitmix64(uint64_t x) { x += 0x9e3779b97f4a7c15; x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9; x = (x ^ (x >> 27)) * 0x94d049bb133111eb; return x ^ (x >> 31); } size_t op...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; char last, f; cin >> last; int ans = 0; f = last; for (int i = 1; i < n; i++) { char a; cin >> a; if (a != last) ans++; last = a; } if ...

#include <bits/stdc++.h> using namespace std; deque<int> a[355]; int n, m, S, Q, z, L, R, k, l, r, x, c[355][100005]; int ans; void deal(int &x) { x = (x + ans - 1) % n + 1; } int main() { scanf( %d , &n); S = int(sqrt(n)), m = n / S + 1; for (int i = 0; i < n; i++) { scanf( %d , &x); ...

#include <bits/stdc++.h> using namespace std; long long int a[500001], pref[500001], valv[500001]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); long long int t, i, j, k, l, m = 0, n, o, p, q, r, s, x; cin >> n >> x; pref[0] = 0; valv[0] = 0; for (i = 0; i < n; i++) { ...

#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 10; const long long mod = 998244353; long long qpow(long long a, long long b) { long long ans = 1; while (b) { if (b & 1) ans = ans * a % mod; a = a * a % mod; b /= 2; } return ans; } long long b[maxn], in...

#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; int q, x_1, y_1, x_2, y_2, k, len, a[35], b[35], c[35]; pair<int, int> dp[35][2][2][2]; int Add(int a, int b) { return a + b >= mod ? a + b - mod : a + b; } int Minus(int a, int b) { return a < b ? a - b + mod : a - b; } pair<int, int>...

#include <bits/stdc++.h> using namespace std; bool visited[100005]; vector<long long> arr[100005]; int main() { std::ios::sync_with_stdio(false); long long n, x; cin >> n; vector<pair<long long, long long> > ans; for (long long i = 0; i < n; i++) { cin >> x; arr[x].push_back(i); ...

#include <bits/stdc++.h> using namespace std; long long modI(long long a, long long m); long long gcd(long long a, long long b); long long powM(long long x, long long y, long long m); long long swap(long long a, long long b); void swap(long long& a, long long& b) { long long tp = a; a = b; b = t...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector<long long> a(n + 1); for (int i = 1; i <= n; i++) { cin >> a[i]; } int m; cin >> m; long long ans = 0; long long wt = 0, ht = 0; ...

#include <bits/stdc++.h> using namespace std; int main() { cin.tie(0); ios_base::sync_with_stdio(0); string x, y; cin >> x >> y; char ans[200]; for (int i = 0; i < x.size(); i++) { if (y[i] == x[i]) { ans[i] = x[i]; } else if (y[i] < x[i]) { ans[i] = y[i]; }...

#include <bits/stdc++.h> using namespace std; int main() { int n, a[4] = {}; cin >> n; for (int i = 0; i < n; i++) { char c; cin >> c; a[0] += c == U ; a[1] += c == D ; a[2] += c == L ; a[3] += c == R ; } long res = min(a[0], a[1]) * 2 + min(a[2], a[3]) * ...

#include <bits/stdc++.h> using namespace std; const long long INF = LLONG_MAX; bool check(char a, char b) { return a == _ || a == b; } long long foo(string s, string tail) { if (!check(s[s.size() - 2], tail[0]) || !check(s.back(), tail[1])) return 0; s[s.size() - 2] = tail[0]; s[s.size() - 1] = ta...

#include <bits/stdc++.h> using namespace std; const int N = 200; int n, a[N], m; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d , &a[i]); scanf( %d , &m); for (int i = 0; i < m; i++) { int x, y; scanf( %d%d , &x, &y); x--; if (x - 1 >= 0) a[x - 1] += ...

#include <bits/stdc++.h> bool sev(int h, int m); using namespace std; int main() { int snooze; cin >> snooze; int h; int m; int n = 0; cin >> h >> m; if (sev(h, m)) { cout << 0 << endl; } else { while (sev(h, m) == false) { if (m >= snooze) { m = m -...

#include <bits/stdc++.h> using namespace std; int main() { int x, ans, sum = 0; cin >> x; x = abs(x); for (int i = 0;; i++) { sum += i; if (sum >= x && (sum - x) % 2 == 0) { ans = i; break; } } cout << ans << endl; return 0; }

#include <bits/stdc++.h> using namespace std; vector<long long int> g[200001]; vector<long long int> g1[200001]; vector<long long int> vec; bool vis[200001]; void fun(long long int u) { vis[u] = 1; for (long long int i = 0; i < g[u].size(); i++) { long long int v = g[u][i]; if (!vis[v]) ...

#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 10; int ans[maxn]; vector<int> xs[maxn], ys[maxn]; struct query { int l, r, d, u, id; query(int aa, int bb, int cc, int dd, int ee) { l = aa; r = bb; d = cc; u = dd; id = ee; } query() {} }; ...

#include <bits/stdc++.h> using namespace std; int main() { int n, k; scanf( %d %d , &n, &k); if (n == 5 && k == 2) { puts( YES ); for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (i & 1) printf( L ); else printf( S ); ...

#include <bits/stdc++.h> using namespace std; int main(void) { int t; cin >> t; while (t--) { long long n, p, k; cin >> n >> p >> k; long long ans = 0, pre = 0; vector<long long> a(n, -1); for (long long i = 0; i < n; ++i) { cin >> a[i]; } sort(a.begin()...

#include <bits/stdc++.h> using namespace std; void fast() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); } int main() { fast(); long long i, j, n, t, su = 0, k; cin >> t; vector<long long> v[t], s[t]; vector<pair<long long, pair<long long, long long>>> p; for (i...

#include <bits/stdc++.h> using namespace std; unsigned int dp[(int)1e3 + 7], mn[(int)1e3 + 7], n; int a[(int)1e3 + 7], b[26], ml = 0; char aa[(int)1e3 + 7]; void dpi() { dp[0] = 1; mn[0] = 1; ml = 1; for (int i = 1; i < n; i++) { int mm = a[i]; dp[i] = dp[i - 1]; mn[i] = mn[i...

#include <bits/stdc++.h> using namespace std; double l[10], b[10]; vector<int> kk(10, -1); vector<vector<int> > v; int k, n; void abc(int i, int sum) { if (i == 0 && sum == 0) { v.push_back(kk); return; } if (i == 0) { return; } for (int j = 0; j <= k; j++) { if (...

#include <bits/stdc++.h> template <class T> T abs(T x) { return (x > 0) ? x : (-x); } template <class T> T ceil(T a, T b) { return a / b + (a % b != 0); } int n, t[125][5], cnt[5], l, r, mid; int a[6] = {1, 2, 4, 8, 16, 32}; std::set<int> s; int score(int x, int y) { int s = y / x, i; ...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); long long n, k; cin >> n >> k; long long r = max(n - 2 * k, 0LL); cout << n * (n - 1) / 2 - r * (r - 1) / 2; return 0; }

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int r, b, y; cin >> y >> b >> r; int ans = min(y, b - 1); ans = min(ans, r - 2); ans = ans * 3 + 3; cout << ans; return 0; }

#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10, mod = 998244353, M = 3e3 + 10; int ksm(int x, int y) { int ans = 1; while (y) { if (y & 1) ans = (long long)ans * x % mod; x = (long long)x * x % mod; y >>= 1; } return ans; } int a[N], w[N], f[M][M], g[M][...

#include <bits/stdc++.h> using namespace std; int main() { string n; cin >> n; if (n[0] != - ) { cout << n; } else { char max = 0 ; int mem; for (int i = n.length() - 2; i < n.length(); ++i) { if (n[i] >= max) { max = n[i]; mem = i; } ...

#include <bits/stdc++.h> using namespace std; long long inv[100010], fac[100010], p[100010], t[100010][20]; int n, l, r, P, tot, Phi; int phi(int k) { int i, s; s = k; for (i = 2; i * i <= k; i++) { if (k % i == 0) s = s / i * (i - 1); while (k % i == 0) k /= i; } if (k > 1) s = ...

#include <bits/stdc++.h> using namespace std; const int maxn = 100100; int n; long long a[maxn]; map<long long, long long> mp; long long mul(long long x, long long n) { long long ret = 1; while (n) { if (n & 1) ret *= x; x *= x; n >>= 1; } return ret; } int main() { ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; cin >> n; multiset<long long> heros; for (int i = 0; i < n; i++) { long long temp; cin >> temp; heros.insert(temp); } long long sum = acc...

#include <bits/stdc++.h> using namespace std; long long int base(int a, int b) { int ret = 0; vector<int> v; while (a > 0) { v.push_back(a % b); a /= b; } for (int i = 0; i < v.size(); i++) { ret += v[i]; } return ret; } int main() { long long int a; cin >> ...

#include <bits/stdc++.h> using namespace std; long long lmin(long long a, long long b) { if (a < b) return a; return b; } long long lmax(long long a, long long b) { if (a > b) return a; return b; } int main() { long long t1, t2, x1, x2, t0; scanf( %lld %lld %lld %lld %lld , &t1, &t2...

#include <bits/stdc++.h> using namespace std; int main() { int x, y, z; cin >> x >> y >> z; if (abs(x - y) > z) { if (x > y) { cout << + n ; } else { cout << - n ; } } else { if (abs(x - y) == 0 && z == 0) { cout << 0 n ; } else { cout...

#include <bits/stdc++.h> using namespace std; const int MN = 1e4 + 5; int N, K, i, x, y, sz[MN], mx[MN], ct, c[MN], dp[MN]; vector<int> adj[MN], elem[2]; vector<pair<int, int> > ans; int dfs(int n, int p) { sz[n] = 1; mx[n] = 0; for (auto v : adj[n]) { if (v == p || c[v]) continue; s...

#include <bits/stdc++.h> using namespace std; int main() { long n; cin >> n; long long int ans = 0, ans1, k, a1, a2, x, y, m, s = 0; vector<pair<long, pair<long, long>>> r; for (int i = 0; i < n; ++i) { cin >> k; s += k; cin >> a1 >> x >> y >> m; ans1 = 0; r.push_ba...

#include<bits/stdc++.h> using namespace std; typedef long long ll; const int N=2e5+10,mod=1e9+7; ll a[N]; #define PII pair<int,int> #define x first #define y second #define PB push_back void solve() { int n; cin>>n; int sum=0; map<ll,int> mp; for(int i=1;i<=n;i++){ ...

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

#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 5; set<pair<int, int> > topo[2]; vector<int> G[maxn], R[maxn]; int n, m, code[maxn], in[maxn], out[maxn]; bool seen[maxn]; void dfs(int node) { seen[node] = 1; for (int son : G[node]) if (!seen[son]) dfs(son); topo[code...

#include <bits/stdc++.h> using namespace std; signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long int a, b, c, n; cin >> a >> b >> c >> n; if ((min(min(a, b), c) >= n) || (n - (a + b - c) < 1) || (min(a, b) < c)) return cout << -1, 0; co...

#include <bits/stdc++.h> using namespace std; map<string, int> ma; int main() { string s; int n; cin >> n; ma.clear(); while (n--) { cin >> s; if (ma[s] == 0) printf( NO n ); else printf( YES n ); ma[s]++; } return 0; }

#include <bits/stdc++.h> int main() { int n, w, cnt1, cnt2; scanf( %d , &n); cnt1 = cnt2 = 0; while (n-- > 0) { scanf( %d , &w); if (w == 100) cnt1++; else cnt2++; } printf( %s n , cnt1 % 2 == 0 && (cnt2 % 2 == 0 || cnt1 >= 2) ? YES : NO ); return 0; ...

#include <bits/stdc++.h> using namespace std; const int N = 20005; const int INF = -1; int n, m, p; int a[N]; int b[N]; int F[2][N]; int Ra[N]; int Rb[N]; string Path; inline void checkmax(int &t, const int x) { if (x > t) t = x; } inline int w(int i, int j) { int ret = a[i] + b[j]; ...

#include <bits/stdc++.h> using namespace std; const int INFint = 2e9; const long long INF = 1e18; const long long MOD = 1000000007ll; int main() { ios_base::sync_with_stdio(0); int n; cin >> n; vector<long long> a(n), b; for (auto &x : a) cin >> x; b = a; sort(b.begin(), b.end()); ...

#include <bits/stdc++.h> using namespace std; const int N = 4e5 + 10, INF = 1e9; int l[N], r[N], ps[N]; map<int, int> mp; int cnt, seg[4 * N], lazy[4 * N]; inline void shift(int id) { seg[2 * id] += lazy[id]; lazy[2 * id] += lazy[id]; seg[2 * id + 1] += lazy[id]; lazy[2 * id + 1] += lazy[id]...

#include <bits/stdc++.h> using namespace std; const int MAX_N = 1500 + 10; const int INF = 1e9; int ans[MAX_N][26]; int main() { ios::sync_with_stdio(0); int n; cin >> n; string s; cin >> s; for (int it = 0; it < 26; ++it) { char c = char(it + a ); for (int i = 0; i < n; +...

#include <bits/stdc++.h> using namespace std; int main() { long long w, m; cin >> w >> m; vector<int> a; long long z = m; while (z) { a.push_back(z % w); z /= w; } a.push_back(0); int flag = 1; for (int i = 0; i < a.size(); i++) { if (a[i] == w || a[i] == w - 1)...

#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 7; int n, a[N], f[N][21], pos[N], nxt[N], tmp[N], ans; int query(int l, int r) { int k = log2(r - l + 1); return max(f[l][k], f[r - (1 << k) + 1][k]); } int main() { scanf( %d , &n); memset(pos, 0x3f, sizeof(pos)); for (in...

#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007; const double PI = 3.141592653589793238463; using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int q; cin >> q; while (q--) { long long sum = 0, r = 0; ...

#include <bits/stdc++.h> using namespace std; string a, b, c, s; map<string, long long> m[3]; long long f, q; bool sach(string aa) { if (s.size() >= aa.size() && s.substr(s.size() - aa.size(), aa.size()) == aa) return true; return false; } void solve(long long i) { if (sach(a)) { i...

#include <bits/stdc++.h> using namespace std; const int N = 300; const long long mod = 1e9 + 7; long long dp[N][N], mi[N], mi_1[N], C[N][N], n, k; int main() { cin >> n >> k; for (int i = (0); i <= (n); i++) { C[i][0] = 1; for (int j = (1); j <= (i); j++) C[i][j] = (C[i - 1][j] + C...

#include <bits/stdc++.h> using namespace std; int A[100]; int n; int countNonZero = 0; int sumElements(int size) { int sum = 0; for (int i = 0; i < size; i++) sum = sum + A[i]; return sum; } int findNonZero(int size) { int ind = -1; for (int i = 0; i < size; i++) { if (A[i] != 0)...

#include <bits/stdc++.h> using namespace std; using namespace std; int n, k, a[((int)(1e5) + 5)], x, y, bol[((int)(1e6 + 5))], dp[((int)(1e6 + 5))], t, snr; int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; cin >> x >> y; sort(a + 1, a + n + 1); n = unique(a + 1, a + n +...

#include <bits/stdc++.h> using namespace std; int dp[31][31][51]; int solve(int i, int j, int k) { if (i <= 0 || j <= 0) return 1e9; if (i * j == k || k <= 0) return 0; if (dp[i][j][k] != -1) return dp[i][j][k]; int op = 1e9; for (int x = 1; x <= i; ++x) for (int y = 1; y <= k; ++y) ...

#include <bits/stdc++.h> using namespace std; const int MAX = 2e4 + 14; const int INF = INT_MAX; const int MAXC = 30; const long long LLINF = 1e16 + 14; int main() { int t; scanf( %d , &t); while (t--) { int n; scanf( %d , &n); int d; scanf( %d , &d); int res; ...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:16777216 ) using namespace std; vector<vector<int>> g(1000); bool removed[1000]; int cost[1000]; int n, d; void input() { cin >> n >> d; for (int i = 0; i < n; i++) { cin >> cost[i]; } } void solution() { int sum = 0; f...