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

func_code_string stringlengths 59 71.4k
#include <bits/stdc++.h> using namespace std; int N; vector<int> a, b; int main() { int n, m, k, x; cin >> n >> m >> k; for (int i = 0; i < n; ++i) { cin >> x; a.push_back(x); } for (int i = 0; i < m; ++i) { cin >> x; b.push_back(x); } sort(a.begin(), a.end())...
#include <bits/stdc++.h> using namespace std; int n, m; int main() { ios_base::sync_with_stdio(false); cin >> n >> m; if (m == 3 && n != 4 && n != 3) { cout << -1; return false; } int x = 0, y = 0; for (int i = 1; i <= m; i++) { cout << x << << y << endl; x++; ...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 100, M = 10 + 10, SQ = 333; pair<int, int> nxt[N][M]; char a[N][M]; bool mark[N][M]; int n, m, q; bool OK(pair<int, int> x) { return x.first > 0 && x.second > 0 && x.second <= m; } pair<int, int> go(int x, int y) { if (!OK({x, y...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin.tie(0); cout.tie(0); int n; cin >> n; int arr[n]; for (auto& elem : arr) { cin >> elem; } for (int i = 1; i <= n; ++i) { for (int j = 0; j < n; ++j) { ...
#include <bits/stdc++.h> using namespace std; const int N = 505; const int mod = 1000000007; int a, b, c, d, e, f, g, h, i, j; int Mi[N * N]; int F[N][N], K; void Work() { Mi[0] = 1; for (int ii = 1; ii <= a * a; ii++) Mi[ii] = (Mi[ii - 1] << 1) % mod; F[0][0] = 1; for (int ii = 1; ii <= a...
#include <bits/stdc++.h> using namespace std; long long q, a[555555], k, l, m, n, o, p; const long long mod = 1e9 + 7; queue<long long> qq[100005]; struct node { node left, right; long long val; node() { val = 0; left = right = this; } node(node le, node re, long long va) {...
#include <bits/stdc++.h> using namespace std; long long dp[5010][5010]={}; long long cnt[5010]={}; long long a[5000]; long long mod=1e9+7; signed main() { int n,k,q; cin>>n>>k>>q; for(int i=0;i<n;i++){ cin>>a[i]; } for(int i=0;i<n;i++)dp[i][0]=1; for(int j=1;j...
#include <bits/stdc++.h> using namespace std; int main() { char a[200]; char c; int i = 0; while ((c = getchar()) != n ) { a[i] = c; i++; } for (int k = 0; k < i - 2; k++) { if (a[k] == W && a[k + 1] == U && a[k + 2] == B ) { a[k] = ; a[k + 1] = ...
#include <bits/stdc++.h> using namespace std; int main() { string t; cin >> t; string s; bool a = true; for (int i = 0; i < t.size(); i++) { if (a && t[i] == 0 ) { a = false; continue; } s.push_back(t[i]); } if (a) s.erase(s.begin()); cout << s << e...
#include <bits/stdc++.h> int a[105]; int main() { int n; scanf( %d , &n); for (int i = 0; i < n; ++i) scanf( %d , &a[i]); int s = 0; for (int i = 0; i < n; ++i) { int t = 0; for (int j = i; j < n; ++j) { t ^= a[j]; if (s < t) s = t; } } printf( %d n , s)...
#include <bits/stdc++.h> using namespace std; map<pair<long long, long long>, long long> O; map<pair<long long, long long>, long long>::iterator oit; map<long long, long long> X, Y; map<long long, long long>::iterator it; int main() { int n; cin >> n; for (int i = 0; i < n; ++i) { double x...
#include <bits/stdc++.h> using namespace std; vector<int> num, con, a; vector<vector<int> > g(1000001); bool used[1000001]; void dfs(int v) { num.push_back(v); con.push_back(a[v - 1]); used[v] = true; if (g[v].empty()) return; for (int i = 0; i < g[v].size(); i++) if (!used[g[v][i]])...
#include <bits/stdc++.h> using namespace std; const int N = 2e6 + 7; const int M = 2e6 + 7; const int lim = 1e6; const int mod = 1e9 + 7; const int inf = 0x3f3f3f3f; long long ksm(long long a, long long b, long long p) { long long ret = 1; while (b) { if (b & 1) (ret = a) %= p; (a = ...
#include <bits/stdc++.h> inline long long gcd(long long a, long long b) { return (b ? gcd(b, a % b) : a); } inline long long lcm(long long a, long long b) { return (a / gcd(a, b)) * b; } inline int cmp(double x, double y = 0, double tol = 1e-7) { return (x <= y + tol) ? (x + tol < y) ? -1 : 0 : 1; } ...
#include <bits/stdc++.h> #define ln n #define all(dat) dat.begin(), dat.end() #define loop(i, to) for (int i = 0; i < to; ++i) #define cont(i, to) for (int i = 1; i <= to; ++i) #define circ(i, fm, to) for (int i = fm; i <= to; ++i) #define foreach(i, dat) ...
#include <bits/stdc++.h> using namespace std; int a, b, c, d, k, t; int main() { cin >> t; while (t--) { cin >> a >> b >> c >> d >> k; bool isok = 0; for (int i = 1; i <= k; i++) { if (i * c >= a && (k - i) * d >= b) { isok = 1; cout << i << << k - i << en...
#include <bits/stdc++.h> using namespace std; const int MAXN = 200002; double eps = 1e-9; int T, N, M, K, mx, sum, ans; int a, b, c; bool visit[MAXN], call[MAXN]; int color[MAXN]; vector<int> v[MAXN]; map<int, int> mp; void dfs(int n) { mp[color[n]]++; for (auto i : v[n]) if (!visit[i]...
#include <bits/stdc++.h> using namespace std; char arr[1001][1001]; long long int used[1001][1001]; long long int ans[1001][1001]; long long int n, m; long long int inf = 1e18; long long int p = 1e9 + 7; long long int phi(long long int n) { long long int result = n; for (long long int i = 2; i *...
#include <bits/stdc++.h> using namespace std; const long long inf = (long long)1e9; const long long MOD = (long long)1e9 + 7; const long long P = 239; const long long MAX_N = 1000; const long long CNT = 5; const long double pi = 3.1415926535897932384626; const long double eps = 1e-6; int main() { ...
#include <bits/stdc++.h> using namespace std; const int max_n = 3e5 + 10, inf = 1000111222; struct node { int p0, p1; int cnt; node() { p0 = p1 = 0; cnt = 0; } }; int root = 1; node A[max_n * 33]; int last_used = 1; int new_node() { return ++last_used; } int a[max_n]; lon...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); int tc; cin >> tc; while (tc--) { long long l, r; cin >> l >> r; long long i = 1; while ((l \| i) <= r) { l \|= i; i <<= 1; } cout << l ...
#include <bits/stdc++.h> using namespace std; basic_string<int> e[500005][2]; basic_string<int> f[500005][2]; int n, m; int d[500005], w[500005][2]; const int inf = 123123123; int main() { ios::sync_with_stdio(!cin.tie(0)); cin >> n >> m; for (int i = 0; i < m; i++) { int u, v, t; ...
#include <bits/stdc++.h> using namespace std; const int MAXS = 75, MAXK = 10, MAXQ = 30; const long long INF = 0x3f3f3f3f3f3f3f3f; int x, k, n, q, c[MAXK]; struct node { int p, w; } d[MAXQ]; bool operator<(const node &aa, const node &bb) { return aa.p < bb.p; } int sta[MAXS], scn, cnt[300], id[300];...
#include <bits/stdc++.h> using namespace std; const long long N = 507; const long long INF = 1e9 + 7; long long n, m, mod; long long Pow(long long x, long long y) { long long ans = 1, now = x; while (y) { if (y & 1) ans = ans * now % mod; now = now * now % mod; y >>= 1; } ret...
#include <bits/stdc++.h> using namespace std; int main() { long long t; cin >> t; while (t-- > 0) { int n; string s; cin >> n >> s; vector<int> a(n, 0), b(n, 0), c; int flag1 = 1, flag2 = 1; for (int i = 0; i < n - 1; i++) { if (s[i] == < ) { b[i] =...
#include <bits/stdc++.h> using namespace std; int main() { int n, x[100005], h[100005]; cin >> n; for (int i = 0; i < n; ++i) cin >> x[i] >> h[i]; int count = 1; int newarr[100005]; newarr[1] = x[0] - h[0]; for (int i = 1; i < n - 1; ++i) { if ((x[i] - h[i] > x[i - 1]) && (x[i] - h...
#include <bits/stdc++.h> using namespace std; int n, q; vector<vector<pair<int, int> > > graph; vector<pair<int, int> > edges; class SegmentTree { struct node_t { int best[2]; int lazy; node_t() { best[0] = 0; best[1] = 0; lazy = 0; } node_t operator+(...
#include <bits/stdc++.h> using namespace std; map<int, int> cnt1, cnt2; const int maxn = 1e5 * 3; int x[maxn]; int y[maxn]; int main() { int n = 0; cin >> n; for (int i = 0; i < n; i++) { cin >> x[i] >> y[i]; cnt1[x[i] - y[i]]++; cnt2[x[i] + y[i]]++; } long long ans = 0...
#include <bits/stdc++.h> using namespace std; void solve() { long long n; cin >> n; string s[n]; for (long long i = 0; i < n; i++) { for (long long j = 0; j <= i; j++) cout << ( ; for (long long j = 0; j <= i; j++) cout << ) ; for (long long j = 0; j < n - i - 1; j++) cout << ()...
#include <bits/stdc++.h> using namespace std; const int K = 269; const int MS = 2; const int MOD[MS] = {(int)1e9 + 7, (int)1e9 + 9}; const int MAXN = 1e6 + 69; using hsh = vector<long long>; struct hj { int shift = MS == 1 ? 0 : 32 / (MS - 1); size_t operator()(const hsh& h) const { long lon...
#include <bits/stdc++.h> using namespace std; int a, b; int dp[55][55][4]; int f(int n, int m, int p) { if ((n == m && n == 0) \|\| (n == 0 && p == 1) \|\| (m == 0 && p == 2)) { return dp[n][m][p] = 0; } if (dp[n][m][p] != -1) { return dp[n][m][p]; } bool g = 0; if (p == 1) { ...
#include <bits/stdc++.h> using namespace std; const int maxn = 40 + 2; int n, m, q, dp[maxn][maxn][maxn][maxn], ones[maxn][maxn], a, b, c, d; int main() { ios::sync_with_stdio(false); char ch; cin >> n >> m >> q; for (int _b = (n), i = (1); i <= _b; ++i) for (int _b = (m), j = (1); j <= _b...
#include <bits/stdc++.h> using namespace std; int n, k, mas[1000], ans[1000], anss; int main() { cin >> n >> k; for (int i = 1; i <= n; i++) cin >> mas[i]; for (int i = 2; i <= n; i++) { if (mas[i] + mas[i - 1] < k) { anss += k - mas[i - 1] - mas[i]; mas[i] = k - mas[i - 1]; ...
#include <bits/stdc++.h> using namespace std; inline long long read() { long long num = 0, neg = 1; char c = getchar(); while (!isdigit(c)) { if (c == - ) neg = -1; c = getchar(); } while (isdigit(c)) { num = (num << 3) + (num << 1) + c - 0 ; c = getchar(); } re...
#include <bits/stdc++.h> using namespace std; const int N = 200005; long long c[N << 2], a[N]; void pushup(int rt) { c[rt] = c[rt << 1] \| c[rt << 1 \| 1]; } void build(int rt, int l, int r) { if (l == r) { scanf( %I64d , c + rt); a[l] = c[rt]; return; } int mid = (l + r) >> 1; ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); int n; cin >> n; string s; cin >> s; set<int> col[26]; vector<int> ans; int cnt = 0; for (int i = 0; i < n; i++) { set<int> used; for (int j = s[i] - a ...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; double ans; int a[N]; int n, u, p; int main() { scanf( %d%d , &n, &u); ans = 0; for (int i = 1; i <= n; i++) { scanf( %d , a + i); } for (int i = 1; i <= n; i++) { if (i <= n - 2) { p = lower_bound(...
#include <bits/stdc++.h> using namespace std; int n, k, ans = -1, dist[2020]; vector<int> adj[2020], vet; int main() { scanf( %d%d , &n, &k); for (int(i) = (0); (i) < (k); (i)++) { int v; scanf( %d , &v); vet.push_back(v - n); } sort((vet).begin(), (vet).end()); vet.resize(...
#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > upd; struct query { int l, r, t, id, ans; query() {} query(int _l, int _r, int _t, int _id) { l = _l; r = _r; t = _t; id = _id; } }; vector<query> que; stack<pair<int, int> > S; vector<int> V; i...
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const long long N = 1e5 + 7; long long p[N], cnt; bool vis[N]; long long res1 = 0; long long res2 = 0; long long res3 = 0; inline void init(long long NN) { res1 = res2 = res3 = 0; for (long long i = 2; i <= NN + res1 + r...
#include <bits/stdc++.h> using namespace std; long long fib[100], A[100], B[100]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long t, n, najwieksza = 2; fib[0] = 1; fib[1] = 1; for (; fib[najwieksza - 1] + fib[najwieksza - 2] <= 1e18; najwieksza++) fi...
#include <bits/stdc++.h> using namespace std; int mediana(vector<int> &v) { if (int(v.size()) % 2 == 1) return v[int(v.size()) / 2]; return v[int(v.size()) / 2 - 1]; } bool esta(vector<int> &v, int x) { for (int i = 0; i < int(v.size()); i++) if (v[i] == x) return true; return false; } ...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e2 + 10; const long long mod = 998244353; const long long inf = (long long)4e17 + 5; const int INF = 1e9 + 7; const double pi = acos(-1.0); long long inv(long long b) { if (b == 1) return 1; return (mod - mod / b) * inv(mod % b) % mod...
#include <bits/stdc++.h> using namespace std; const int N = 3e5; int n, ans; int Dpos[N + 3]; char str[N + 10], Nstr[N + 10]; int main() { scanf( %d%s , &n, str + 1); int Ncnt = 0, Ned = n, Nmin = 0; for (int i = 1; i <= n; i++) { if (str[i] == ( ) Ncnt++; else Ncnt-...
#include <bits/stdc++.h> using namespace std; int a[5005] = {0}; void ge(int a) { if (a == 1) printf( one n ); else if (a == 2) printf( two n ); else if (a == 3) printf( three n ); else if (a == 4) printf( four n ); else if (a == 5) printf( five n ); else if (...
#include <bits/stdc++.h> using namespace std; struct point { double x, y, alpha; int num; }; int n, c[1510] = {}, ans[1510] = {}; vector<int> a[1510]; point p[1510]; int rec(int v, int pr) { int r = 0; for (int i = 0; i < a[v].size(); i++) if (a[v][i] != pr) r += rec(a[v][i], v); ...
#include <bits/stdc++.h> const int maxn = (int)1e6; const int mod = (int)1e9 + 7; using namespace std; int n; long long dp[maxn]; long long a[maxn]; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) { cin >> a[i]; } dp[0] = abs(a[0]); for (int i = 1; i < n; i++) { d...
#include <bits/stdc++.h> using namespace std; bool mycomp(vector<long long int> a, vector<long long int> b) { long long int acost = min(2 * a[0], a[1]) - min(a[0], a[1]); long long int bcost = min(2 * b[0], b[1]) - min(b[0], b[1]); return acost > bcost; } long long int fn(vector<vector<long long int...
#include <bits/stdc++.h> using namespace std; long long n, m, k; long long f(int x, int len) { if (len == 0) return 0; if (x > len) return (long long)len * (2 * x - len - 1) / 2; else return (long long)x * (x - 1) / 2 + len - x + 1; } bool ok(int x) { if (f(x, k - 1) + f(x, n - k) ...
#include <bits/stdc++.h> using namespace std; int arr[310], nex[310], T, N; bool can, isRoot[310]; void dfs(int x, int val) { if (T < 0) return; arr[x] += val; if (nex[x] != -1) { T -= arr[x]; dfs(nex[x], arr[x]); } } long long int memo[310][100000 + 100]; long long int solve(i...
#include <bits/stdc++.h> using namespace std; const int N = 150, M = 150, OO = 0x3f3f3f3f; int n, arr[2005], temp, ans; void DFS(int u) { temp++; if (arr[u] == -1) return; DFS(arr[u]); } int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %d , arr + i); } fo...
#include <bits/stdc++.h> using namespace std; int convert(int k) { if (k < 2) return k; else if (k < 5) return k - 1; else return k - 2; } int main() { string s[6]; int A[6][6] = {3, 3, 4, 4, 3, 3, 3, 3, 4, 4, 3, 3, 2, 2, 3, 3, 2, 2, 2, 2, 3, 3, 2, 2, 1, ...
#include <bits/stdc++.h> using namespace std; template <class T> inline void checkmin(T &a, T b) { if (a > b) a = b; } template <class T> inline void checkmax(T &a, T b) { if (a < b) a = b; } const int oo = 1 << 30; const double eps = 1e-7; const int N = 1 << 10; const int M = 1; const l...
#include <bits/stdc++.h> using namespace std; int main() { int a; int b; int c; int d; int e; cin >> a; int aa[a]; for (b = 0; b < a; ++b) { cin >> aa[b]; } d = aa[0]; c = 0; b = 0; vector<int> ab; while (b < a) { if (aa[b] > d) d = aa[b]; if...
#include <bits/stdc++.h> using namespace std; int q, a[100100], head, tail; long long n; long long solve(long long n, long long k) { if (k & 1) return (k + 1) / 2; if (n & 1) if (k == 2) return solve(n / 2, n / 2) + (n + 1) / 2; else return solve(n / 2, k / 2 - 1) + (n + 1) /...
#include <bits/stdc++.h> using namespace std; long long int n, k; vector<long long int> v[100005]; vector<long long int> res; long long int ares[100005]; long long int was[100005]; int dfs(long long int ind, long long int c) { if (c > 100005) { return -1; } if (ares[ind]) return 1; i...
#include <bits/stdc++.h> using namespace std; const double EPS = 1e-9; const double PI = acos(-1.0); const int MOD = 1000 * 1000 * 1000 + 7; const int INF = 2000 * 1000 * 1000; const int MAXN = 55; template <typename T> inline T sqr(T n) { return n * n; } int n; long long m; long long weight...
#include <bits/stdc++.h> using namespace std; const int N = 32005; int n, m, i, j, f; int a[N]; long long ans; int main() { scanf( %d%d , &n, &m); for (i = m + 1; i <= (n + 1) / 2; i++) { for (j = m + 1; j < 2 * i; j++) { f = (i * (2 * i - j) + (n + 1) * (2 * j - i)) / (i + j); ...
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; const long long mod = 1e9 + 7; long long n, m; struct mat { int a[105][105]; mat() { memset(a, 0, sizeof(a)); } mat operator*(const mat &b) const { mat c; for (int i = (1); i < (m + 1); i++) { for (int j = (1)...
#include <bits/stdc++.h> using namespace std; const int maxn = 210000; int n; int oke[maxn], okp[maxn]; struct edge { int y, nex; } a[maxn << 1]; int len, fir[maxn]; inline void ins(const int x, const int y) { a[++len] = (edge){y, fir[x]}; fir[x] = len; } int siz[maxn], mxs[maxn]; void...
#include <bits/stdc++.h> using namespace std; mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count()); int main() { ios::sync_with_stdio(0); cin.tie(0); int ts; cin >> ts; while (ts--) { string s, t; cin >> s >> t; int n = (int)s.size(); map<string,...
#include <bits/stdc++.h> using namespace std; string s; long long n; bool len(char x) { return x == a \|\| x == e \|\| x == i \|\| x == o \|\| x == u \|\| x == y ; } int main() { cin >> n; cin >> s; cout << s[0]; for (int i = 1; i < n; i++) { if (len(s[i]) && len(s[i - 1])) contin...
#include <bits/stdc++.h> #pragma GCC optimize(3, Ofast , inline ) using namespace std; mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count()); const long long maxn = (long long)1e6 + 5; const long long mod = 998244353; const long long inf = 0x3f3f3f3f; long long T = 1; vector<lon...
#include <bits/stdc++.h> using namespace std; int32_t main() { ios::sync_with_stdio(0); cin.tie(0); long long n; cin >> n; vector<long long> vec(n); for (long long i = 0; i < n; i++) { cin >> vec[i]; } vec.push_back(vec.back()); long long ans = 1; long long cnt = 1; ...
#include <bits/stdc++.h> using namespace std; const int oo = 0x3f3f3f3f; const double eps = 1e-9; int main() { int n; scanf( %d , &n); double inch = (double)n / 3; int ninch = (int)inch; if (inch - (double)ninch >= 0.5) ++ninch; printf( %d %d n , ninch / 12, ninch % 12); return 0; ...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:20000000 ) using namespace std; int main() { int n, m; cin >> n >> m; vector<string> a; string s; for (int i = (0); (i) < (n); (i)++) { cin >> s; a.push_back( # + s + # ); } int x = 1; long long r = 0; bool ...
#include <bits/stdc++.h> using namespace std; struct node { node l, r, p; long long v, s, z, w, t, k, i; node(long long v, long long i) : l(0), r(0), p(0), v(v), s(1), z(0), w(0), t(v), k(1), i(i) {} }; inline bool is_root(node n) { return n->p == NULL \|\| n->p->l != n && n->p->r != n...
#include <bits/stdc++.h> using namespace std; constexpr int N = 3e3; uint16_t a[N], lst[N], nxt[N], cnxt[20], dp[N][N]; int main() { cin.tie(0), ios::sync_with_stdio(0); int t, n; cin >> t; while (t--) { cin >> n; for (int i = 0; i < n; ++i) { cin >> a[i], --a[i]; } ...
#include <bits/stdc++.h> using namespace std; pair<int, int> seg[2100000], lazy[2100000]; pair<int, int> Merge(pair<int, int> l, pair<int, int> r) { if (l < r) return l; else return r; } void Propagate(int n, int l, int r) { if (lazy[n] != make_pair(0x3f3f3f3f, 0)) { if (l != r) ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n, x; cin >> n >> x; long long count = 0; if (n >= x) { for (long long i = 1; i < n + 1; i++) { if (x % i == 0) { count++; } }...
#include <bits/stdc++.h> using namespace std; void show_trace() { cout << endl; } template <typename Start, typename... Rem> void show_trace(Start S, Rem... R) { cout << << S; show_trace(R...); } const int INFi = 2139062143; const long long INF = 1e18; int main() { ios::sync_with_stdio(f...
#include <bits/stdc++.h> using namespace std; void solve() { long long n; cin >> n; string s; cin >> s; vector<string> all; for (long long i = 0; i <= 9; i++) { all.push_back(s); for (char &c : s) if (c == 9 ) c = 0 ; else c++; } stri...
#include <bits/stdc++.h> using namespace std; long double a[100009][2]; long double maxi(long double a, long double b) { if (a > b) return a; else return b; } bool solve(long double mid, int n, long double p) { long double req = 0; for (int i = 0; i < n; i++) { req += maxi(0....
#include <bits/stdc++.h> using namespace std; void FREOPEN() {} inline double Time() { return (clock() * 1.0) / CLOCKS_PER_SEC; } const int N = (int)2000, inf = (int)2e9, MOD = (int)1e9 + 7, alph = 26; char CH[N]; const long long INF = (long long)1e18; const int dx[] = {1, -1, 0, 0, -1, 1, -1, 1}; const...
#include <bits/stdc++.h> using namespace std; const int N = 2000000 + 7; const int M = 26; const int mod = 999983; const int inf = 1e9 + 7; const double pi = acos(-1); const int maxn = N * 2; const double PI = acos(-1); int n, m; int a[N]; int dp[22][N]; string s; void solve() { cin >> n >...
#include <bits/stdc++.h> using namespace std; char s[2005]; char p[505]; int dp[2005][2005]; int len[2005]; int main() { scanf( %s , s); scanf( %s , p); int len_s = strlen(s); int len_p = strlen(p); for (int i = 0; i < len_s; i++) { int tot = i; if (s[i] != p[0]) { le...
#include <bits/stdc++.h> using namespace std; long long input[100000], n, output, table[100000], a, tlg, go, high, lg; int main(int argc, char** argv) { int i, j, k; while (scanf( %d , &n) == 1) { output = 0; lg = 1; tlg = 1; scanf( %d , &input[0]); for (i = 1; i < n; i++) ...
#include <bits/stdc++.h> using namespace std; const int N = 333333; const long long mod = 1000000009ll; int n, m; struct node { int l, r; long long sum, f1, f2; } t[N * 6]; long long a[N], F[N]; inline long long read() { long long x = 0; char c = getchar(); while (!isdigit(c)) c = ge...
#include <bits/stdc++.h> using namespace std; const int M = 100000 + 10; int a[M]; vector<int> ans[M]; int main() { int n, k; cin >> n >> k; for (int i = 0; i < n; i++) { cin >> a[i]; } sort(a, a + n); int num = 0; while (num < k) { for (int i = n; i >= 0 && num < k; i-...
#include <bits/stdc++.h> using namespace std; inline int Pow(int x, int y, int mod) { long long t = x, r = 1; for (; y; y >>= 1, t = t * t % mod) y& 1 ? r = r * t % mod : 0; return r; } inline int Get() { int res = 0, q = 1; char ch = getchar(); while ((ch < 0 \|\| ch > 9 ) && ch != - ...
#include <bits/stdc++.h> long long n, i, j, h, k, t, d; long double a, m, b; using namespace std; long double pow(long double a, long long b) { if (b == 0) return 1; if (b == 1) return a; long double t = pow(a, b / 2); t = t * t; if (b % 2 == 0) return t; else return t * a; ...
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; int main() { ios::sync_with_stdio(false); int _; cin >> _; while (_--) { int n; cin >> n; int ans = 1e9 + 10; for (int i = 1; i * i <= n; i++) { int res = i - 1 + ceil(1.0 * n / (1.0 * i)) - 1; ...
#include <bits/stdc++.h> using namespace std; int cycle; vector<int> adj[26], topo; int color[26]; void dfs(int i) { color[i] = 1; for (auto nx : adj[i]) if (!color[nx]) dfs(nx); else if (color[nx] == 1) cycle = 1; topo.push_back(i); color[i] = 2; } int main() {...
#include <bits/stdc++.h> using namespace std; int n, m, ans, col[1000005], flag[1000005], tot, res[1000005]; int k = 1, la[1000005], ff[1000005 * 2], check[1000005], pre[1000005], pos, del[1000005]; int cnt, f[1000005], g[1000005]; struct node { int a, b; } e[1000005 * 2]; map<pair<int, int>, in...
#include <bits/stdc++.h> using namespace std; int who(int n) { if (n < 5) { return n; } else { n -= 5; return who(n / 2); } } int main(int argc, char** argv) { int n, m; cin >> n >> m; vector<vector<char> > snake(n, vector<char>(m, # )); for (int i = 1; i < n; i +=...
#include <bits/stdc++.h> using namespace std; const int N = 1e5, K = 4; vector<int> g[N]; set<int> s; int a[N]; int get_index(const vector<int> x) { static map<vector<int>, int> m; static int cnt; if (m.find(x) == m.end()) m[x] = cnt++; return m[x]; } void dfs_pre(int u, int fa) { ve...
#include <bits/stdc++.h> using namespace std; int main() { int t; int a[] = {1, 2, 3, 4, 6, 12}; int b[] = {12, 6, 4, 3, 2, 1}; cin >> t; while (t--) { string s; cin >> s; int ans[20]; int count = 0, n = 0, no; for (int i = 0; i < 6; i++) { for (int j = 0; j...
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) #pragma GCC optimize( unroll-loops ) using namespace std; const int arr = 2e5 + 10; const int ar = 2e3 + 10; const long double pi = acos(-1); const long double eps = 1e-10; ...
#include <bits/stdc++.h> using namespace std; vector<pair<long long, long long> > v; bool cmp(pair<long long, long long> a, pair<long long, long long> b) { if (a.first == b.first) a.second < b.second; return a.first > b.first; } int main() { long long t, n, arr[200005], brr[200005], i; cin >> ...
#include <bits/stdc++.h> using namespace std; int main() { int n, s; cin >> n >> s; int a[n + 1]; int b[n + 1]; bool isCrossable = false; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= n; i++) cin >> b[i]; if (a[1] == 0 \|\| (a[s] == 0 && b[s] == 0)) { cout << NO...
#include <bits/stdc++.h> using namespace std; struct interval { int l, r; bool operator<(const interval &t) const { return r < t.r; } }; set<interval> itree[20]; set<interval>::iterator l, r; long long ans; long long f(int type, int num) { return (1LL << type) * ((num + 1LL) * num) / 2; } ...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { long long n, a, b; cin >> a >> b >> n; if (n % 2 == 0) cout << (n / 2) * (a - b) << endl; else cout << ((n / 2) * (a - b)) + a << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 2000005; long long n, L, t; long long K; long long a[maxn]; double ans; int main() { scanf( %I64d%I64d%I64d , &n, &L, &t); t += t; K = t / L; t = t - L * K; ans += 0.25 * (double)K * n * (n - 1); for (int i = 1; i <= n;...
#include <bits/stdc++.h> using namespace std; int main() { cin.tie(nullptr); ios::sync_with_stdio(false); int n; cin >> n; vector<int> a(n); set<int> s; int g = 0; for (int i = 0; i < n; i++) { cin >> a[i]; g ^= a[i]; s.insert(a[i]); } if (n == 3) { pr...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1100; int N, M; int WX, WY, BX, BY; int wdist[MAXN][MAXN]; int wprev[MAXN][MAXN]; int bdist[MAXN][MAXN]; int bprev[MAXN][MAXN]; int xc[8] = {-2, 2, -1, 1, -2, 2, -1, 1}; int yc[8] = {-1, -1, -2, -2, 1, 1, 2, 2}; bool is_white; void a...
#include <bits/stdc++.h> using namespace std; void Read(int &x) { char c; while (c = getchar(), c != EOF) if (c >= 0 && c <= 9 ) { x = c - 0 ; while (c = getchar(), c >= 0 && c <= 9 ) x = x * 10 + c - 0 ; ungetc(c, stdin); return; } } int n, a, b; st...
#include <bits/stdc++.h> using namespace std; int main() { cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0); int t; cin >> t; while (t--) { long long l, r; cin >> l >> r; cout << l << << l * 2 << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; pair<long long, int> ar[200003 + 2]; long long DP[200003 + 2][2]; long long n; long long dp(int i, bool fl) { if (i == n + 1) { if (fl == 0) return 0; return 2e18; } if (i > n + 1) return 2e18; long long &ret = DP[i][fl]; if (ret !=...
#include <bits/stdc++.h> using namespace std; const int MX = 500000; int m, i, j, ii; long long l, r, k, R, h, s, a[2][2], b[2][2], f[2][2]; void upd(long long h) { if (r / h - (l - 1) / h >= k) R = max(R, h); } int main() { scanf( %d%I64d%I64d%I64d , &m, &l, &r, &k); for (h = 1; h <= MX; h++)...
#include <bits/stdc++.h> using namespace std; int main() { int n, h; cin >> n >> h; double s = 1.0 * h / n; double t = s; for (int i = 0; i < n - 1; i++) { double ans = sqrt(1.0 * s * h); s += t; printf( %.12llf n , ans); } return 0; }

#include <bits/stdc++.h> using namespace std; int N; vector<int> a, b; int main() { int n, m, k, x; cin >> n >> m >> k; for (int i = 0; i < n; ++i) { cin >> x; a.push_back(x); } for (int i = 0; i < m; ++i) { cin >> x; b.push_back(x); } sort(a.begin(), a.end())...

#include <bits/stdc++.h> using namespace std; int n, m; int main() { ios_base::sync_with_stdio(false); cin >> n >> m; if (m == 3 && n != 4 && n != 3) { cout << -1; return false; } int x = 0, y = 0; for (int i = 1; i <= m; i++) { cout << x << << y << endl; x++; ...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 100, M = 10 + 10, SQ = 333; pair<int, int> nxt[N][M]; char a[N][M]; bool mark[N][M]; int n, m, q; bool OK(pair<int, int> x) { return x.first > 0 && x.second > 0 && x.second <= m; } pair<int, int> go(int x, int y) { if (!OK({x, y...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin.tie(0); cout.tie(0); int n; cin >> n; int arr[n]; for (auto& elem : arr) { cin >> elem; } for (int i = 1; i <= n; ++i) { for (int j = 0; j < n; ++j) { ...

#include <bits/stdc++.h> using namespace std; const int N = 505; const int mod = 1000000007; int a, b, c, d, e, f, g, h, i, j; int Mi[N * N]; int F[N][N], K; void Work() { Mi[0] = 1; for (int ii = 1; ii <= a * a; ii++) Mi[ii] = (Mi[ii - 1] << 1) % mod; F[0][0] = 1; for (int ii = 1; ii <= a...

#include <bits/stdc++.h> using namespace std; long long q, a[555555], k, l, m, n, o, p; const long long mod = 1e9 + 7; queue<long long> qq[100005]; struct node { node *left, *right; long long val; node() { val = 0; left = right = this; } node(node *le, node *re, long long va) {...

#include <bits/stdc++.h> using namespace std; long long dp[5010][5010]={}; long long cnt[5010]={}; long long a[5000]; long long mod=1e9+7; signed main() { int n,k,q; cin>>n>>k>>q; for(int i=0;i<n;i++){ cin>>a[i]; } for(int i=0;i<n;i++)dp[i][0]=1; for(int j=1;j...

#include <bits/stdc++.h> using namespace std; int main() { char a[200]; char c; int i = 0; while ((c = getchar()) != n ) { a[i] = c; i++; } for (int k = 0; k < i - 2; k++) { if (a[k] == W && a[k + 1] == U && a[k + 2] == B ) { a[k] = ; a[k + 1] = ...

#include <bits/stdc++.h> using namespace std; int main() { string t; cin >> t; string s; bool a = true; for (int i = 0; i < t.size(); i++) { if (a && t[i] == 0 ) { a = false; continue; } s.push_back(t[i]); } if (a) s.erase(s.begin()); cout << s << e...

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

#include <bits/stdc++.h> using namespace std; map<pair<long long, long long>, long long> O; map<pair<long long, long long>, long long>::iterator oit; map<long long, long long> X, Y; map<long long, long long>::iterator it; int main() { int n; cin >> n; for (int i = 0; i < n; ++i) { double x...

#include <bits/stdc++.h> using namespace std; vector<int> num, con, a; vector<vector<int> > g(1000001); bool used[1000001]; void dfs(int v) { num.push_back(v); con.push_back(a[v - 1]); used[v] = true; if (g[v].empty()) return; for (int i = 0; i < g[v].size(); i++) if (!used[g[v][i]])...

#include <bits/stdc++.h> using namespace std; const int N = 2e6 + 7; const int M = 2e6 + 7; const int lim = 1e6; const int mod = 1e9 + 7; const int inf = 0x3f3f3f3f; long long ksm(long long a, long long b, long long p) { long long ret = 1; while (b) { if (b & 1) (ret *= a) %= p; (a *= ...

#include <bits/stdc++.h> inline long long gcd(long long a, long long b) { return (b ? gcd(b, a % b) : a); } inline long long lcm(long long a, long long b) { return (a / gcd(a, b)) * b; } inline int cmp(double x, double y = 0, double tol = 1e-7) { return (x <= y + tol) ? (x + tol < y) ? -1 : 0 : 1; } ...

#include <bits/stdc++.h> #define ln n #define all(dat) dat.begin(), dat.end() #define loop(i, to) for (int i = 0; i < to; ++i) #define cont(i, to) for (int i = 1; i <= to; ++i) #define circ(i, fm, to) for (int i = fm; i <= to; ++i) #define foreach(i, dat) ...

#include <bits/stdc++.h> using namespace std; int a, b, c, d, k, t; int main() { cin >> t; while (t--) { cin >> a >> b >> c >> d >> k; bool isok = 0; for (int i = 1; i <= k; i++) { if (i * c >= a && (k - i) * d >= b) { isok = 1; cout << i << << k - i << en...

#include <bits/stdc++.h> using namespace std; const int MAXN = 200002; double eps = 1e-9; int T, N, M, K, mx, sum, ans; int a, b, c; bool visit[MAXN], call[MAXN]; int color[MAXN]; vector<int> v[MAXN]; map<int, int> mp; void dfs(int n) { mp[color[n]]++; for (auto i : v[n]) if (!visit[i]...

#include <bits/stdc++.h> using namespace std; char arr[1001][1001]; long long int used[1001][1001]; long long int ans[1001][1001]; long long int n, m; long long int inf = 1e18; long long int p = 1e9 + 7; long long int phi(long long int n) { long long int result = n; for (long long int i = 2; i *...

#include <bits/stdc++.h> using namespace std; const long long inf = (long long)1e9; const long long MOD = (long long)1e9 + 7; const long long P = 239; const long long MAX_N = 1000; const long long CNT = 5; const long double pi = 3.1415926535897932384626; const long double eps = 1e-6; int main() { ...

#include <bits/stdc++.h> using namespace std; const int max_n = 3e5 + 10, inf = 1000111222; struct node { int p0, p1; int cnt; node() { p0 = p1 = 0; cnt = 0; } }; int root = 1; node A[max_n * 33]; int last_used = 1; int new_node() { return ++last_used; } int a[max_n]; lon...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); int tc; cin >> tc; while (tc--) { long long l, r; cin >> l >> r; long long i = 1; while ((l | i) <= r) { l |= i; i <<= 1; } cout << l ...

#include <bits/stdc++.h> using namespace std; basic_string<int> e[500005][2]; basic_string<int> f[500005][2]; int n, m; int d[500005], w[500005][2]; const int inf = 123123123; int main() { ios::sync_with_stdio(!cin.tie(0)); cin >> n >> m; for (int i = 0; i < m; i++) { int u, v, t; ...

#include <bits/stdc++.h> using namespace std; const int MAXS = 75, MAXK = 10, MAXQ = 30; const long long INF = 0x3f3f3f3f3f3f3f3f; int x, k, n, q, c[MAXK]; struct node { int p, w; } d[MAXQ]; bool operator<(const node &aa, const node &bb) { return aa.p < bb.p; } int sta[MAXS], scn, cnt[300], id[300];...

#include <bits/stdc++.h> using namespace std; const long long N = 507; const long long INF = 1e9 + 7; long long n, m, mod; long long Pow(long long x, long long y) { long long ans = 1, now = x; while (y) { if (y & 1) ans = ans * now % mod; now = now * now % mod; y >>= 1; } ret...

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

#include <bits/stdc++.h> using namespace std; int main() { int n, x[100005], h[100005]; cin >> n; for (int i = 0; i < n; ++i) cin >> x[i] >> h[i]; int count = 1; int newarr[100005]; newarr[1] = x[0] - h[0]; for (int i = 1; i < n - 1; ++i) { if ((x[i] - h[i] > x[i - 1]) && (x[i] - h...

#include <bits/stdc++.h> using namespace std; int n, q; vector<vector<pair<int, int> > > graph; vector<pair<int, int> > edges; class SegmentTree { struct node_t { int best[2]; int lazy; node_t() { best[0] = 0; best[1] = 0; lazy = 0; } node_t operator+(...

#include <bits/stdc++.h> using namespace std; map<int, int> cnt1, cnt2; const int maxn = 1e5 * 3; int x[maxn]; int y[maxn]; int main() { int n = 0; cin >> n; for (int i = 0; i < n; i++) { cin >> x[i] >> y[i]; cnt1[x[i] - y[i]]++; cnt2[x[i] + y[i]]++; } long long ans = 0...

#include <bits/stdc++.h> using namespace std; void solve() { long long n; cin >> n; string s[n]; for (long long i = 0; i < n; i++) { for (long long j = 0; j <= i; j++) cout << ( ; for (long long j = 0; j <= i; j++) cout << ) ; for (long long j = 0; j < n - i - 1; j++) cout << ()...

#include <bits/stdc++.h> using namespace std; const int K = 269; const int MS = 2; const int MOD[MS] = {(int)1e9 + 7, (int)1e9 + 9}; const int MAXN = 1e6 + 69; using hsh = vector<long long>; struct hj { int shift = MS == 1 ? 0 : 32 / (MS - 1); size_t operator()(const hsh& h) const { long lon...

#include <bits/stdc++.h> using namespace std; int a, b; int dp[55][55][4]; int f(int n, int m, int p) { if ((n == m && n == 0) || (n == 0 && p == 1) || (m == 0 && p == 2)) { return dp[n][m][p] = 0; } if (dp[n][m][p] != -1) { return dp[n][m][p]; } bool g = 0; if (p == 1) { ...

#include <bits/stdc++.h> using namespace std; const int maxn = 40 + 2; int n, m, q, dp[maxn][maxn][maxn][maxn], ones[maxn][maxn], a, b, c, d; int main() { ios::sync_with_stdio(false); char ch; cin >> n >> m >> q; for (int _b = (n), i = (1); i <= _b; ++i) for (int _b = (m), j = (1); j <= _b...

#include <bits/stdc++.h> using namespace std; int n, k, mas[1000], ans[1000], anss; int main() { cin >> n >> k; for (int i = 1; i <= n; i++) cin >> mas[i]; for (int i = 2; i <= n; i++) { if (mas[i] + mas[i - 1] < k) { anss += k - mas[i - 1] - mas[i]; mas[i] = k - mas[i - 1]; ...

#include <bits/stdc++.h> using namespace std; inline long long read() { long long num = 0, neg = 1; char c = getchar(); while (!isdigit(c)) { if (c == - ) neg = -1; c = getchar(); } while (isdigit(c)) { num = (num << 3) + (num << 1) + c - 0 ; c = getchar(); } re...

#include <bits/stdc++.h> using namespace std; const int N = 200005; long long c[N << 2], a[N]; void pushup(int rt) { c[rt] = c[rt << 1] | c[rt << 1 | 1]; } void build(int rt, int l, int r) { if (l == r) { scanf( %I64d , c + rt); a[l] = c[rt]; return; } int mid = (l + r) >> 1; ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); int n; cin >> n; string s; cin >> s; set<int> col[26]; vector<int> ans; int cnt = 0; for (int i = 0; i < n; i++) { set<int> used; for (int j = s[i] - a ...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; double ans; int a[N]; int n, u, p; int main() { scanf( %d%d , &n, &u); ans = 0; for (int i = 1; i <= n; i++) { scanf( %d , a + i); } for (int i = 1; i <= n; i++) { if (i <= n - 2) { p = lower_bound(...

#include <bits/stdc++.h> using namespace std; int n, k, ans = -1, dist[2020]; vector<int> adj[2020], vet; int main() { scanf( %d%d , &n, &k); for (int(i) = (0); (i) < (k); (i)++) { int v; scanf( %d , &v); vet.push_back(v - n); } sort((vet).begin(), (vet).end()); vet.resize(...

#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > upd; struct query { int l, r, t, id, ans; query() {} query(int _l, int _r, int _t, int _id) { l = _l; r = _r; t = _t; id = _id; } }; vector<query> que; stack<pair<int, int> > S; vector<int> V; i...

#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const long long N = 1e5 + 7; long long p[N], cnt; bool vis[N]; long long res1 = 0; long long res2 = 0; long long res3 = 0; inline void init(long long NN) { res1 = res2 = res3 = 0; for (long long i = 2; i <= NN + res1 + r...

#include <bits/stdc++.h> using namespace std; long long fib[100], A[100], B[100]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long t, n, najwieksza = 2; fib[0] = 1; fib[1] = 1; for (; fib[najwieksza - 1] + fib[najwieksza - 2] <= 1e18; najwieksza++) fi...

#include <bits/stdc++.h> using namespace std; int mediana(vector<int> &v) { if (int(v.size()) % 2 == 1) return v[int(v.size()) / 2]; return v[int(v.size()) / 2 - 1]; } bool esta(vector<int> &v, int x) { for (int i = 0; i < int(v.size()); i++) if (v[i] == x) return true; return false; } ...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e2 + 10; const long long mod = 998244353; const long long inf = (long long)4e17 + 5; const int INF = 1e9 + 7; const double pi = acos(-1.0); long long inv(long long b) { if (b == 1) return 1; return (mod - mod / b) * inv(mod % b) % mod...

#include <bits/stdc++.h> using namespace std; const int N = 3e5; int n, ans; int Dpos[N + 3]; char str[N + 10], Nstr[N + 10]; int main() { scanf( %d%s , &n, str + 1); int Ncnt = 0, Ned = n, Nmin = 0; for (int i = 1; i <= n; i++) { if (str[i] == ( ) Ncnt++; else Ncnt-...

#include <bits/stdc++.h> using namespace std; int a[5005] = {0}; void ge(int a) { if (a == 1) printf( one n ); else if (a == 2) printf( two n ); else if (a == 3) printf( three n ); else if (a == 4) printf( four n ); else if (a == 5) printf( five n ); else if (...

#include <bits/stdc++.h> using namespace std; struct point { double x, y, alpha; int num; }; int n, c[1510] = {}, ans[1510] = {}; vector<int> a[1510]; point p[1510]; int rec(int v, int pr) { int r = 0; for (int i = 0; i < a[v].size(); i++) if (a[v][i] != pr) r += rec(a[v][i], v); ...

#include <bits/stdc++.h> const int maxn = (int)1e6; const int mod = (int)1e9 + 7; using namespace std; int n; long long dp[maxn]; long long a[maxn]; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) { cin >> a[i]; } dp[0] = abs(a[0]); for (int i = 1; i < n; i++) { d...

#include <bits/stdc++.h> using namespace std; bool mycomp(vector<long long int> a, vector<long long int> b) { long long int acost = min(2 * a[0], a[1]) - min(a[0], a[1]); long long int bcost = min(2 * b[0], b[1]) - min(b[0], b[1]); return acost > bcost; } long long int fn(vector<vector<long long int...

#include <bits/stdc++.h> using namespace std; long long n, m, k; long long f(int x, int len) { if (len == 0) return 0; if (x > len) return (long long)len * (2 * x - len - 1) / 2; else return (long long)x * (x - 1) / 2 + len - x + 1; } bool ok(int x) { if (f(x, k - 1) + f(x, n - k) ...

#include <bits/stdc++.h> using namespace std; int arr[310], nex[310], T, N; bool can, isRoot[310]; void dfs(int x, int val) { if (T < 0) return; arr[x] += val; if (nex[x] != -1) { T -= arr[x]; dfs(nex[x], arr[x]); } } long long int memo[310][100000 + 100]; long long int solve(i...

#include <bits/stdc++.h> using namespace std; const int N = 150, M = 150, OO = 0x3f3f3f3f; int n, arr[2005], temp, ans; void DFS(int u) { temp++; if (arr[u] == -1) return; DFS(arr[u]); } int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %d , arr + i); } fo...

#include <bits/stdc++.h> using namespace std; int convert(int k) { if (k < 2) return k; else if (k < 5) return k - 1; else return k - 2; } int main() { string s[6]; int A[6][6] = {3, 3, 4, 4, 3, 3, 3, 3, 4, 4, 3, 3, 2, 2, 3, 3, 2, 2, 2, 2, 3, 3, 2, 2, 1, ...

#include <bits/stdc++.h> using namespace std; template <class T> inline void checkmin(T &a, T b) { if (a > b) a = b; } template <class T> inline void checkmax(T &a, T b) { if (a < b) a = b; } const int oo = 1 << 30; const double eps = 1e-7; const int N = 1 << 10; const int M = 1; const l...

#include <bits/stdc++.h> using namespace std; int main() { int a; int b; int c; int d; int e; cin >> a; int aa[a]; for (b = 0; b < a; ++b) { cin >> aa[b]; } d = aa[0]; c = 0; b = 0; vector<int> ab; while (b < a) { if (aa[b] > d) d = aa[b]; if...

#include <bits/stdc++.h> using namespace std; int q, a[100100], head, tail; long long n; long long solve(long long n, long long k) { if (k & 1) return (k + 1) / 2; if (n & 1) if (k == 2) return solve(n / 2, n / 2) + (n + 1) / 2; else return solve(n / 2, k / 2 - 1) + (n + 1) /...

#include <bits/stdc++.h> using namespace std; long long int n, k; vector<long long int> v[100005]; vector<long long int> res; long long int ares[100005]; long long int was[100005]; int dfs(long long int ind, long long int c) { if (c > 100005) { return -1; } if (ares[ind]) return 1; i...

#include <bits/stdc++.h> using namespace std; const double EPS = 1e-9; const double PI = acos(-1.0); const int MOD = 1000 * 1000 * 1000 + 7; const int INF = 2000 * 1000 * 1000; const int MAXN = 55; template <typename T> inline T sqr(T n) { return n * n; } int n; long long m; long long weight...

#include <bits/stdc++.h> using namespace std; const int N = 32005; int n, m, i, j, f; int a[N]; long long ans; int main() { scanf( %d%d , &n, &m); for (i = m + 1; i <= (n + 1) / 2; i++) { for (j = m + 1; j < 2 * i; j++) { f = (i * (2 * i - j) + (n + 1) * (2 * j - i)) / (i + j); ...

#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; const long long mod = 1e9 + 7; long long n, m; struct mat { int a[105][105]; mat() { memset(a, 0, sizeof(a)); } mat operator*(const mat &b) const { mat c; for (int i = (1); i < (m + 1); i++) { for (int j = (1)...

#include <bits/stdc++.h> using namespace std; const int maxn = 210000; int n; int oke[maxn], okp[maxn]; struct edge { int y, nex; } a[maxn << 1]; int len, fir[maxn]; inline void ins(const int x, const int y) { a[++len] = (edge){y, fir[x]}; fir[x] = len; } int siz[maxn], mxs[maxn]; void...

#include <bits/stdc++.h> using namespace std; mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count()); int main() { ios::sync_with_stdio(0); cin.tie(0); int ts; cin >> ts; while (ts--) { string s, t; cin >> s >> t; int n = (int)s.size(); map<string,...

#include <bits/stdc++.h> using namespace std; string s; long long n; bool len(char x) { return x == a || x == e || x == i || x == o || x == u || x == y ; } int main() { cin >> n; cin >> s; cout << s[0]; for (int i = 1; i < n; i++) { if (len(s[i]) && len(s[i - 1])) contin...

#include <bits/stdc++.h> #pragma GCC optimize(3, Ofast , inline ) using namespace std; mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count()); const long long maxn = (long long)1e6 + 5; const long long mod = 998244353; const long long inf = 0x3f3f3f3f; long long T = 1; vector<lon...

#include <bits/stdc++.h> using namespace std; int32_t main() { ios::sync_with_stdio(0); cin.tie(0); long long n; cin >> n; vector<long long> vec(n); for (long long i = 0; i < n; i++) { cin >> vec[i]; } vec.push_back(vec.back()); long long ans = 1; long long cnt = 1; ...

#include <bits/stdc++.h> using namespace std; const int oo = 0x3f3f3f3f; const double eps = 1e-9; int main() { int n; scanf( %d , &n); double inch = (double)n / 3; int ninch = (int)inch; if (inch - (double)ninch >= 0.5) ++ninch; printf( %d %d n , ninch / 12, ninch % 12); return 0; ...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:20000000 ) using namespace std; int main() { int n, m; cin >> n >> m; vector<string> a; string s; for (int i = (0); (i) < (n); (i)++) { cin >> s; a.push_back( # + s + # ); } int x = 1; long long r = 0; bool ...

#include <bits/stdc++.h> using namespace std; struct node { node *l, *r, *p; long long v, s, z, w, t, k, i; node(long long v, long long i) : l(0), r(0), p(0), v(v), s(1), z(0), w(0), t(v), k(1), i(i) {} }; inline bool is_root(node *n) { return n->p == NULL || n->p->l != n && n->p->r != n...

#include <bits/stdc++.h> using namespace std; constexpr int N = 3e3; uint16_t a[N], lst[N], nxt[N], cnxt[20], dp[N][N]; int main() { cin.tie(0), ios::sync_with_stdio(0); int t, n; cin >> t; while (t--) { cin >> n; for (int i = 0; i < n; ++i) { cin >> a[i], --a[i]; } ...

#include <bits/stdc++.h> using namespace std; pair<int, int> seg[2100000], lazy[2100000]; pair<int, int> Merge(pair<int, int> l, pair<int, int> r) { if (l < r) return l; else return r; } void Propagate(int n, int l, int r) { if (lazy[n] != make_pair(0x3f3f3f3f, 0)) { if (l != r) ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n, x; cin >> n >> x; long long count = 0; if (n >= x) { for (long long i = 1; i < n + 1; i++) { if (x % i == 0) { count++; } }...

#include <bits/stdc++.h> using namespace std; void show_trace() { cout << endl; } template <typename Start, typename... Rem> void show_trace(Start S, Rem... R) { cout << << S; show_trace(R...); } const int INFi = 2139062143; const long long INF = 1e18; int main() { ios::sync_with_stdio(f...

#include <bits/stdc++.h> using namespace std; void solve() { long long n; cin >> n; string s; cin >> s; vector<string> all; for (long long i = 0; i <= 9; i++) { all.push_back(s); for (char &c : s) if (c == 9 ) c = 0 ; else c++; } stri...

#include <bits/stdc++.h> using namespace std; long double a[100009][2]; long double maxi(long double a, long double b) { if (a > b) return a; else return b; } bool solve(long double mid, int n, long double p) { long double req = 0; for (int i = 0; i < n; i++) { req += maxi(0....

#include <bits/stdc++.h> using namespace std; void FREOPEN() {} inline double Time() { return (clock() * 1.0) / CLOCKS_PER_SEC; } const int N = (int)2000, inf = (int)2e9, MOD = (int)1e9 + 7, alph = 26; char CH[N]; const long long INF = (long long)1e18; const int dx[] = {1, -1, 0, 0, -1, 1, -1, 1}; const...

#include <bits/stdc++.h> using namespace std; const int N = 2000000 + 7; const int M = 26; const int mod = 999983; const int inf = 1e9 + 7; const double pi = acos(-1); const int maxn = N * 2; const double PI = acos(-1); int n, m; int a[N]; int dp[22][N]; string s; void solve() { cin >> n >...

#include <bits/stdc++.h> using namespace std; char s[2005]; char p[505]; int dp[2005][2005]; int len[2005]; int main() { scanf( %s , s); scanf( %s , p); int len_s = strlen(s); int len_p = strlen(p); for (int i = 0; i < len_s; i++) { int tot = i; if (s[i] != p[0]) { le...

#include <bits/stdc++.h> using namespace std; long long input[100000], n, output, table[100000], a, tlg, go, high, lg; int main(int argc, char** argv) { int i, j, k; while (scanf( %d , &n) == 1) { output = 0; lg = 1; tlg = 1; scanf( %d , &input[0]); for (i = 1; i < n; i++) ...

#include <bits/stdc++.h> using namespace std; const int N = 333333; const long long mod = 1000000009ll; int n, m; struct node { int l, r; long long sum, f1, f2; } t[N * 6]; long long a[N], F[N]; inline long long read() { long long x = 0; char c = getchar(); while (!isdigit(c)) c = ge...

#include <bits/stdc++.h> using namespace std; const int M = 100000 + 10; int a[M]; vector<int> ans[M]; int main() { int n, k; cin >> n >> k; for (int i = 0; i < n; i++) { cin >> a[i]; } sort(a, a + n); int num = 0; while (num < k) { for (int i = n; i >= 0 && num < k; i-...

#include <bits/stdc++.h> using namespace std; inline int Pow(int x, int y, int mod) { long long t = x, r = 1; for (; y; y >>= 1, t = t * t % mod) y& 1 ? r = r * t % mod : 0; return r; } inline int Get() { int res = 0, q = 1; char ch = getchar(); while ((ch < 0 || ch > 9 ) && ch != - ...

#include <bits/stdc++.h> long long n, i, j, h, k, t, d; long double a, m, b; using namespace std; long double pow(long double a, long long b) { if (b == 0) return 1; if (b == 1) return a; long double t = pow(a, b / 2); t = t * t; if (b % 2 == 0) return t; else return t * a; ...

#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; int main() { ios::sync_with_stdio(false); int _; cin >> _; while (_--) { int n; cin >> n; int ans = 1e9 + 10; for (int i = 1; i * i <= n; i++) { int res = i - 1 + ceil(1.0 * n / (1.0 * i)) - 1; ...

#include <bits/stdc++.h> using namespace std; int cycle; vector<int> adj[26], topo; int color[26]; void dfs(int i) { color[i] = 1; for (auto nx : adj[i]) if (!color[nx]) dfs(nx); else if (color[nx] == 1) cycle = 1; topo.push_back(i); color[i] = 2; } int main() {...

#include <bits/stdc++.h> using namespace std; int n, m, ans, col[1000005], flag[1000005], tot, res[1000005]; int k = 1, la[1000005], ff[1000005 * 2], check[1000005], pre[1000005], pos, del[1000005]; int cnt, f[1000005], g[1000005]; struct node { int a, b; } e[1000005 * 2]; map<pair<int, int>, in...

#include <bits/stdc++.h> using namespace std; int who(int n) { if (n < 5) { return n; } else { n -= 5; return who(n / 2); } } int main(int argc, char** argv) { int n, m; cin >> n >> m; vector<vector<char> > snake(n, vector<char>(m, # )); for (int i = 1; i < n; i +=...

#include <bits/stdc++.h> using namespace std; const int N = 1e5, K = 4; vector<int> g[N]; set<int> s; int a[N]; int get_index(const vector<int> x) { static map<vector<int>, int> m; static int cnt; if (m.find(x) == m.end()) m[x] = cnt++; return m[x]; } void dfs_pre(int u, int fa) { ve...

#include <bits/stdc++.h> using namespace std; int main() { int t; int a[] = {1, 2, 3, 4, 6, 12}; int b[] = {12, 6, 4, 3, 2, 1}; cin >> t; while (t--) { string s; cin >> s; int ans[20]; int count = 0, n = 0, no; for (int i = 0; i < 6; i++) { for (int j = 0; j...

#include <bits/stdc++.h> #pragma GCC optimize( O3 ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) #pragma GCC optimize( unroll-loops ) using namespace std; const int arr = 2e5 + 10; const int ar = 2e3 + 10; const long double pi = acos(-1); const long double eps = 1e-10; ...

#include <bits/stdc++.h> using namespace std; vector<pair<long long, long long> > v; bool cmp(pair<long long, long long> a, pair<long long, long long> b) { if (a.first == b.first) a.second < b.second; return a.first > b.first; } int main() { long long t, n, arr[200005], brr[200005], i; cin >> ...

#include <bits/stdc++.h> using namespace std; int main() { int n, s; cin >> n >> s; int a[n + 1]; int b[n + 1]; bool isCrossable = false; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= n; i++) cin >> b[i]; if (a[1] == 0 || (a[s] == 0 && b[s] == 0)) { cout << NO...

#include <bits/stdc++.h> using namespace std; struct interval { int l, r; bool operator<(const interval &t) const { return r < t.r; } }; set<interval> itree[20]; set<interval>::iterator l, r; long long ans; long long f(int type, int num) { return (1LL << type) * ((num + 1LL) * num) / 2; } ...

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

#include <bits/stdc++.h> using namespace std; const int maxn = 2000005; long long n, L, t; long long K; long long a[maxn]; double ans; int main() { scanf( %I64d%I64d%I64d , &n, &L, &t); t += t; K = t / L; t = t - L * K; ans += 0.25 * (double)K * n * (n - 1); for (int i = 1; i <= n;...

#include <bits/stdc++.h> using namespace std; int main() { cin.tie(nullptr); ios::sync_with_stdio(false); int n; cin >> n; vector<int> a(n); set<int> s; int g = 0; for (int i = 0; i < n; i++) { cin >> a[i]; g ^= a[i]; s.insert(a[i]); } if (n == 3) { pr...

#include <bits/stdc++.h> using namespace std; const int MAXN = 1100; int N, M; int WX, WY, BX, BY; int wdist[MAXN][MAXN]; int wprev[MAXN][MAXN]; int bdist[MAXN][MAXN]; int bprev[MAXN][MAXN]; int xc[8] = {-2, 2, -1, 1, -2, 2, -1, 1}; int yc[8] = {-1, -1, -2, -2, 1, 1, 2, 2}; bool is_white; void a...

#include <bits/stdc++.h> using namespace std; void Read(int &x) { char c; while (c = getchar(), c != EOF) if (c >= 0 && c <= 9 ) { x = c - 0 ; while (c = getchar(), c >= 0 && c <= 9 ) x = x * 10 + c - 0 ; ungetc(c, stdin); return; } } int n, a, b; st...

#include <bits/stdc++.h> using namespace std; int main() { cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0); int t; cin >> t; while (t--) { long long l, r; cin >> l >> r; cout << l << << l * 2 << endl; } return 0; }

#include <bits/stdc++.h> using namespace std; pair<long long, int> ar[200003 + 2]; long long DP[200003 + 2][2]; long long n; long long dp(int i, bool fl) { if (i == n + 1) { if (fl == 0) return 0; return 2e18; } if (i > n + 1) return 2e18; long long &ret = DP[i][fl]; if (ret !=...

#include <bits/stdc++.h> using namespace std; const int MX = 500000; int m, i, j, ii; long long l, r, k, R, h, s, a[2][2], b[2][2], f[2][2]; void upd(long long h) { if (r / h - (l - 1) / h >= k) R = max(R, h); } int main() { scanf( %d%I64d%I64d%I64d , &m, &l, &r, &k); for (h = 1; h <= MX; h++)...

#include <bits/stdc++.h> using namespace std; int main() { int n, h; cin >> n >> h; double s = 1.0 * h / n; double t = s; for (int i = 0; i < n - 1; i++) { double ans = sqrt(1.0 * s * h); s += t; printf( %.12llf n , ans); } return 0; }