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; mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count()); mt19937 rnf(2106); const int N = 300005; int n; int a[N]; vector<int> v[N]; int ans[N]; void solv() { scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %d , &a[i]); for (in...
#include <bits/stdc++.h> const int offs = 350; int n, d, f[30005][705], gem[30005]; int main() { scanf( %d%d , &n, &d); for (int i = 0, t; i < n; i++) scanf( %d , &t), gem[t]++; memset(f, -1, sizeof(f)); f[d][offs] = gem[d]; for (int i = d + 1, t; i < 30005; i++) for (int j = 0; j < 705 ...
#include <bits/stdc++.h> using namespace std; const long long inf = 1000000000000000000LL; const double EPS = 1e-9; const long long mod = 1000000007ll; const int maxn = 500500; int longestP[1000500]; char pat[1000500]; void KMP() { for (int i = 1, k = 0; pat[i]; i++) { while (k > 0 && pat[i] !...
#include <bits/stdc++.h> using namespace std; int n, ans = 0; int a[1000 + 10], pre[9][1000 + 10], kr[9][1000 + 10], cnt[10]; int f[1000 + 10][1 << 8]; int g[9] = {0, 1, 2, 4, 8, 16, 32, 64, 128}; int read() { int x = 0, f = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) f =...
#include <bits/stdc++.h> using namespace std; int a[25] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 4, 9, 25, 49}; int main() { string s; int num = 0; for (int i = 0; i < 19; i++) { printf( %d n , a[i]); fflush(stdout); cin >> s; if (s == ye...
#include <bits/stdc++.h> using namespace std; const char IO_MODE = 3; inline long long ReadInt() { long long x = 0, s = 1; char c = getchar(); while (c < 0 \|\| c > 9 ) { if (c == - ) s = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { x = x * 10 + c - 0 ; c = ge...
#include <bits/stdc++.h> using namespace std; int i, t; double a, b; int main() { cin >> t; for (i = 0; i < t; i++) { cin >> a >> b; if (b == 0) { cout << 1 << endl; continue; } b = 4; if (a > b) { cout << 1.0 - b / (4.0 a) << endl; contin...
#include <bits/stdc++.h> using namespace std; int main() { long long t, n, k; cin >> t; while (t--) { cin >> n; int arr[n]; int c1 = 0; for (int i = 0; i < n; i++) { cin >> arr[i]; if (arr[i] == 1) c1++; } if (n - c1 >= c1) { cout << n - c1 << ...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 7; long long a[N], n, seg[20][N]; void build(int xl = 0, int xr = n, int ind = 0) { if (xr - xl == 1) { seg[ind][xl] = a[xr] - a[xl]; return; } int xm = (xl + xr) / 2; build(xl, xm, ind + 1); build(xm, xr, ind + 1)...
#include <bits/stdc++.h> using namespace std; const int maxn = 500 + 10; int R, C; char pic[maxn][maxn]; bool vis[maxn][maxn]; int sr, sc, er, ec; const int dr[] = {-1, 0, 1, 0}; const int dc[] = {0, 1, 0, -1}; bool ok(int r, int c) { return r >= 1 && r <= R && c >= 1 && c <= C; } struct Node { ...
#include <bits/stdc++.h> using namespace std; double majk; double dp[8005][1005]; int visdp[8005][1005]; double solve(int n, int k) { if (n == 0 && k == 0) return 1; if (n == 0) return 0; double sol = 0; if (visdp[n][k]) return dp[n][k]; if (k) { sol += solve(n - 1, k - 1) * ((double...
#include <bits/stdc++.h> using namespace std; long long maxm = 0; long long nmbr = INT_MAX; map<long long, bool> vstd; class graph { public: map<long long, list<pair<long long, long long>>> adj; void input(long long n) { long long x, y, z; for (long long i = 1; i < n; i++) { cin...
#include <bits/stdc++.h> using namespace std; signed main() { cin.sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long t; cin >> t; while (t--) { long long n, s; cin >> n >> s; long long half = n / 2; half++; cout << s / half << endl; } ...
#include <bits/stdc++.h> int ff[] = {1, 1, 2, 6, 24, 120, 720, 5040, 40320, 362880}; long long dp[16][9 + 1]; void solve(int *bb, int l) { int k, d, i, e, j; memset(dp, 0, sizeof dp); k = ((l) < (bb[0]) ? (l) : (bb[0])); for (i = 0; i <= k; i++) dp[0][i] = 1; for (d = 0; d < 16 - 1; d++) ...
#include <bits/stdc++.h> using namespace std; const double PI = acos(double(-1)); const double INF = 1e10; const double EPS = 1e-8; inline double sqr(double x) { return x * x; } struct PT { double x, y; PT() {} PT(double x, double y) : x(x), y(y) {} void in() { double _x, _y; sca...
#include <bits/stdc++.h> using namespace std; const int MAXN = 100001; const long long mod = 1e9 + 7; int main() { int N, M; scanf( %d %d , &N, &M); int arr[M][2], nums[N]; for (int i = 0; i < N; i++) { scanf( %d , &nums[i]); } for (int i = 0; i < M; i++) { scanf( %d %d , &ar...
#include <bits/stdc++.h> using namespace std; set<int> s; map<long long, int> m1, m2; int main() { int n, n2, k; cin >> n >> n2 >> k; for (int i = 0; i < n; i++) { int q; cin >> q; m1[q]++; s.insert(q); } for (int i = 0; i < n2; i++) { int q; cin >> q; ...
#include <bits/stdc++.h> using namespace std; const long long MAXN = 2e5 + 10; long long n, T, fac[MAXN], a[MAXN], inv[MAXN], b[MAXN], ans, mod = 1e9 + 7; long long read() { long long sss = 0, fff = 1; char ccc; ccc = getchar(); while (ccc < 0 \|\| ccc > 9 ) { if (ccc == - ) fff = -1; ...
#include <bits/stdc++.h> using namespace std; int main() { int n, m, i, flag, ans, index, j; int a[4000], b[4000]; cin >> n >> m; for (i = 0; i < n; i++) cin >> a[i]; for (i = 0; i < m; i++) cin >> b[i]; ans = 0; for (i = n; i >= 0; i--) { flag = 0; for (j = m; j >= 0; j--) {...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); int n, k; cin >> n >> k; string s; cin >> s; string ss = s; int iter = 0; int total = 0; while (true) { int cnt = 0; for (int i = 1; i < n; i++) if (s[i - 1] == R && s[i]...
#include <bits/stdc++.h> using namespace std; int main() { int N; cin >> N; int v[N]; for (int i = 0; i < N; i++) { cin >> v[i]; } vector<int> quadr; for (int i = 0; 1; i++) { if (i > sqrt(INT_MAX)) { break; } quadr.push_back(i * i); } int dist[N];...
#include <bits/stdc++.h> using namespace std; const int N = 5e5 + 5; char a[N], b[N]; int main() { int n, k; cin >> n >> k; scanf( %s %s , a + 1, b + 1); long long ans = 0, t = 1; for (int i = 1; i <= n; ++i) { t = t * 2; if (b[i] == a ) t--; if (a[i] == b ) t--; if...
#include <bits/stdc++.h> using namespace std; template <typename T> class FenwickTree { private: vector<T> bit; int M; public: FenwickTree(int M) : bit(vector<T>(M + 1, 0)), M(M) {} int sum(int i) { if (!i) return 0; return bit[i] + sum(i - (i & -i)); } void add(int i,...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 777; vector<int> G[maxn]; map<int, int> savesiz[maxn]; int siz[maxn]; vector<int> ans; int n; void dfs(int s, int fa) { siz[s] = 1; int cnt = 0; for (int d : G[s]) { if (d == fa) continue; dfs(d, s); saves...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:16777216 ) using namespace std; const double eps = 1e-9; const double pi = acos(-1.0); const int maxn = (int)1e4 + 10; int a[maxn], b[maxn]; int main() { int n, c; cin >> n >> c; if (c < n) { cout << 0 << endl; return 0; ...
#include <bits/stdc++.h> using namespace std; const int N = (int)15e4 + 10, M = 310; int n, m, d; long long a[N], b[N], t[N], tmp[N], dp[2][N]; inline void f(int j) { long long k = 1ll * (t[j] - t[j - 1]) * d; int r = j % 2; deque<int> deq; for (int i = 0; i < n; i++) { while (deq.size()...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast , unroll-loops , omit-frame-pointer , inline ) #pragma GCC optimize(3) using namespace std; const long long INF = 1e17; const long long maxn = 1e5 + 700; const int mod = 998244353; const int up = 1e9; template <typename T> inline void read(T &a) ...
#include <bits/stdc++.h> using namespace std; int a[1000000], ans[1000000]; int n, k, p, x, y, sum = 0; int main() { cin >> n >> k >> p >> x >> y; for (int i = 1; i <= k; i++) { cin >> a[i]; sum += a[i]; } if (sum + n - k > x) { cout << -1; return 0; } for (int i ...
#include <bits/stdc++.h> using namespace std; int N; inline bool check(int x) { long long t = (long long)x * (long long)(x - 1) / 2; if (x & 1) t++; else t += x / 2; return t <= N; } int main() { int M; scanf( %d%d , &N, &M); vector<int> A; for (int i = 0; i < M; i+...
#include <bits/stdc++.h> using namespace std; int main() { int x; cin >> x; string names[x * 2]; for (int i = 0; i < x * 2; i++) cin >> names[i]; for (int i = 0; i < x * 2; i++) if (names[i] == rat ) { cout << names[i - 1]; cout << endl; } for (int i = 0; i < x *...
#include <bits/stdc++.h> using namespace std; int n, m; struct EDGE { int u, v, w; } p[100000 + 5]; struct Edge { int v, w, next; } edge[100000 + 5]; int head[100000 + 5], cnt = 0; void init() { cnt = 0; memset(head, -1, sizeof head); } void add_edge(int u, int v, int w) { edge[c...
#include <bits/stdc++.h> using namespace std; int main() { int n, i, a[150]; scanf( %d , &n); int sum = 0; for (i = 0; i < n; i++) { scanf( %d , &a[i]); sum += a[i]; } int ans = 0; for (i = 0; i < n; i++) (sum % 2) ^ ((a[i] + 1) % 2) ? ans++ : ans = ans; printf( %d n , an...
#include <bits/stdc++.h> using namespace std; int main() { string a, b; int mini = INT_MAX; cin >> a >> b; int az = a.size(); for (int i = -2000; i <= az; i++) { int ans = b.size(); for (int j = 0; j < b.size(); j++) { ans -= (i + j >= 0 && i + j < a.size() && a[i + j] == b[j...
#include <bits/stdc++.h> using namespace std; typedef struct line { int k; int b; long double x; } line; bool com(line l1, line l2) { if (l1.x < l2.x) return true; else return false; } int main() { long long k, b, n, t; cin >> k >> b >> n >> t; long long x = 1; ...
#include <bits/stdc++.h> using namespace std; const int N = 4e5 + 10; struct Edge { int to, nxt; } e[N << 1]; int h[N], idx; void Ins(int a, int b) { e[++idx].to = b; e[idx].nxt = h[a]; h[a] = idx; } int bas, f[N], g[N], to[N], n, siz[N], Mx[N], mk[N], sec[N]; void dfs(int u, int fa) {...
#include <bits/stdc++.h> using namespace std; const int INF = 1000000000; int main() { int n; cin >> n >> ws; char s[1001]; scanf( %s , &s); int h = 0; for (int i = 0; i < n; i++) { if (s[i] == H ) h++; } int _min = INF; for (int i = 0; i < n; i++) { int ans = 0; ...
#include <bits/stdc++.h> using ll = long long; using ld = long double; using ull = unsigned long long; using namespace std; const int N = 10; int T, n, a[N]; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cin >> T; while (T--) { cin >> n; for (int i = (0); i <...
#include <bits/stdc++.h> using namespace std; const int nmax = 5e5 + 42; int n, m; struct edges { int u, v, w; int id_original; }; edges inp[nmax], all[nmax]; bool cmp(edges a, edges b) { return a.w < b.w; } int parent[nmax]; int root(int node) { if (parent[node] == node) return node; ...
#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0, f = 1; char c = getchar(); while (!isdigit(c)) { if (c == - ) f = -1; c = getchar(); } while (isdigit(c)) { x = (x << 1) + (x << 3) + c - 48; c = getchar(); } return x * f; } const i...
#include <bits/stdc++.h> using namespace std; const int INF = numeric_limits<int>::max(); const long long LLINF = numeric_limits<long long>::max(); const unsigned long long ULLINF = numeric_limits<unsigned long long>::max(); const double PI = acos(-1.0); vector<int> ans; void solve(int n, int p, int maxN)...
#include <bits/stdc++.h> using namespace std; using namespace std::chrono; inline long long lrand() { long long x = 0; for (int i = 0; i < (4); i++) { x <<= 16; x ^= rand(); } return x; } string fname(string s, vector<long long> v) { string x = C:/leet/ + s; for (auto& k ...
#include <bits/stdc++.h> using namespace std; void write(int num) { if (num >= 10) write(num / 10); putchar(num % 10 + 0 ); } string s; vector<int> l, r; int id[100001]; vector<int> v[100001]; vector<int> ll, lr, rl, rr; int main() { cin >> s; int cnt = 0; for (int i = 0; i < s.si...
#include <bits/stdc++.h> using namespace std; vector<int> e[200100], g[200100]; int n, m, q; int low[200100], dfn[200100], sta[200100], idx, top; bool in[200100]; void tarjan(int u, int pre) { low[u] = dfn[u] = ++idx; sta[top++] = u; in[u] = true; for (auto v : g[u]) { if (v == pre) co...
#include <bits/stdc++.h> using namespace std; long long int a[1000001], has[1000001]; int main() { long long int n, i; cin >> n; for (i = 0; i < n; i++) { cin >> a[i]; has[a[i]] = 1; } long long int c = 0; for (i = 1; i <= n; i++) if (has[i]) c++; cout << n - c; r...
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 100; const long long inf = 1e18; vector<int> g[maxn]; bool visit[maxn]; int cnt = 0; void dfs(int u) { cnt = 0; queue<int> q; q.push(u); visit[u] = true; cnt++; while (!q.empty()) { int u = q.front(); ...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:200000000 ) using namespace std; const long long oo = 1LL << 60; const long long kNumMoves = 4; const long long kMoves[kNumMoves][2] = {{1, 0}, {-1, 0}, {0, -1}, {0, 1}}; int n, v, e; vector<int> a, b; vector<vector<int> > conn, edges; vector<in...
#include <bits/stdc++.h> using namespace std; vector<vector<int>> graph(200005), revGraph(200005); vector<int> vis(200005, 0), revVis(200005, 0); bool dfs(int u, vector<vector<int>> &curGraph, vector<int> &curVis) { curVis[u] = -1; for (auto v : curGraph[u]) { if (curVis[v] == -1) return false; ...
#include <bits/stdc++.h> using namespace std; template <typename T> string to_string(const vector<T>& vc, int w) { if (vc.empty()) return ; if (w + 1 == vc.size()) return to_string(vc[w]); return to_string(vc[w]) + , + to_string(vc, w + 1); } template <typename T> string to_string(const vect...
#include <bits/stdc++.h> using namespace std; const int N = 100010; int n, x[N], y[N]; struct pt { int s, id, ans; } p[N], w[N]; bool cmpID(pt A, pt B) { return A.id < B.id; } bool cmpSw(pt A, pt B) { return (A.s < B.s) \|\| (A.s == B.s && A.id < B.id); } bool cmpSp(pt A, pt B) { return (A.s < B.s...
#include <bits/stdc++.h> using namespace std; const int MAXN = 3100; int n, m; vector<int> eds[MAXN]; vector<int> reds[MAXN]; vector<pair<int, int> > go[MAXN]; vector<pair<int, int> > rgo[MAXN]; int dd[MAXN]; int ddg[MAXN][MAXN]; void bfs(int v) { for (int i = 0; i < n; ++i) dd[i] = -1; dd[v...
#include <bits/stdc++.h> using namespace std; long long i, j, n, c[223456], d[223456], a[456789], l, r, s, t, tt, k, x, y, z, m, b[1111111]; string p, q, du, qq; vector<long long> u[345678], uu, ui; multiset<long long> mm; int main() { cin >> n >> t; for (i = 0; i < n; i++) { cin >> a[i]...
#include <bits/stdc++.h> using namespace std; #define ios ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL) #define FOR(i,m) for(int i = 0 ;i < m ;i++) #define mem(a ,b) memset(a, (b) , sizeof(a)) #define all(cont) cont.begin(),cont.end() #define mp make_pair #define pb pus...
#include <bits/stdc++.h> using namespace std; struct code { int x, y; }; int res, k; string s; int gcd(int a, int b) { while (b) { a %= b; swap(a, b); } return a; } int a[100001], ans; int main() { int n; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i...
#include <bits/stdc++.h> using namespace std; char s[1010000]; int main() { int i, j, k, m, n; scanf( %s , s); n = strlen(s); if (n % 2 == 1) { n = (n + 1) / 2; for (i = 1; i <= n; i++) putchar( 4 ); for (i = 1; i <= n; i++) putchar( 7 ); puts( ); } else { char u...
#include <bits/stdc++.h> using namespace std; inline void solve() { int d, m; scanf( %d%d , &d, &m); int ans = 1; for (int i = 0; (1 << i) <= d; ++i) { ans = 1ll * ans * ((1 << i) + 1) % m; d -= (1 << i); } if (d) ans = 1ll * ans * (d + 1) % m; printf( %d n , (ans - 1 + m) % ...
#include <bits/stdc++.h> using namespace std; const int maxn = 200100; const int mod = 1e9 + 7; int add(int a, int b) { a += b; if (a >= mod) a -= mod; if (a < 0) a += mod; return a; } int mul(int a, int b) { return 1ll * a * b % mod; } int N; int F[maxn]; int Ans[maxn]; vector<int> ...
#include <bits/stdc++.h> using namespace std; const int N = 300000 + 9; const int Mod = 1000000007; int A[N], n, B[N]; multiset<int> S; bool ok(int l, int r) { if (l == r) { auto it = S.find(l); return it != S.end(); } auto it = S.lower_bound(l); auto it2 = S.lower_bound(r); ...
#include <bits/stdc++.h> using namespace std; long long a, b, ans; void gcd(long long a, long long b) { if (a == 0 \|\| b == 0) return; if (a > b) swap(a, b); ans += (b / a); gcd(b % a, a); } int main() { cin >> a >> b; gcd(a, b); cout << ans << endl; }
#include <bits/stdc++.h> using namespace std; const long long INF = 1e9; const long long mod = 1e9 + 7; const long long N = 1e5 + 5; const long long Sz = 1e6 + 5; string to_string(const string& s) { return + s + ; } void DBG() { cerr << ] << endl; } template <class H, class... T> void DBG(H h...
#include <bits/stdc++.h> using namespace std; const int maxx = 5e5 + 7; long long a[maxx], prime[maxx], cnt[maxx], sum, tedad; bool mark[maxx]; int main() { int n, q; cin >> n >> q; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 2; i < maxx; i++) { if (prime[i] == 0) for (...
#include <bits/stdc++.h> using namespace std; int main() { int i, j, n, x = (int)(1e7 + 1); cin >> n; vector<bool> p(x, true); p[0] = p[1] = false; int c = 0; for (i = 2; i <= x; i++) { if (p[i]) { c++; cout << i << ; if (c == n) break; for (j = i; (l...
#include <bits/stdc++.h> using namespace std; vector<bool> isthere(2000010, false); vector<int> nextmax(2000010); int main() { ios::sync_with_stdio(false); int n, i; cin >> n; vector<int> a(n); for (i = 0; i < n; i++) { cin >> a[i]; isthere[a[i]] = true; } sort(a.begin(),...
#include <bits/stdc++.h> using namespace std; int main() { int x0, y0, x1, y1; cin >> x0 >> y0 >> x1 >> y1; int n; cin >> n; multimap<int, pair<long long int, long long int> > sections; for (long long int i = 0; i < n; i++) { int r, a, b; cin >> r >> a >> b; sections.insert...
#include <bits/stdc++.h> const int maxn = 2222; using namespace std; char s1[maxn], s2[maxn]; int dp[maxn][maxn]; int n, m; int solve(int i) { int top = m; int rq = 0; if (i < m) return maxn; while (top && i) { if (s1[i] == s2[top]) top--; else rq++; i--; ...
#include <bits/stdc++.h> using namespace std; int main() { int N; scanf( %d , &N); if (N <= 2) printf( %d , -1); else { for (int i = N; i >= 1; i--) { printf( %d , i); printf( ); } } return 0; }
#include <bits/stdc++.h> using namespace std; pair<long double, long double> A[200666]; int st[200666], ind[200666]; long double val[200666]; bool comp(int i1, int i2) { return A[i1] < A[i2]; } bool eql(long double v1, long double v2) { return (v1 - v2 > -((long double)0.00000000000001) && v...
#include <bits/stdc++.h> using namespace std; using ll = long long; template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) { for (size_t i = 0; i < v.size(); i++) o << v[i] << (i + 1 != v.size() ? : ); return o; } template <int n, class... T> typename enable_if<(n >=...
#include <bits/stdc++.h> using namespace std; int dp[1024], n, m, c1, c2, c3, c4, an[1024], am[1024]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> c1 >> c2 >> c3 >> c4; cin >> n >> m; for (int i = 0; i < n; ++i) cin >> an[i]; for (int i = 0; i < m; ++i) cin >> am[i]; i...
#include <bits/stdc++.h> using namespace std; map<pair<long long, long long>, bool> blocked; vector<vector<pair<long long, long long> > > graph; vector<bool> used; int part(int v) { vector<long long> adj; for (int i = 0; i < graph[v].size(); i++) { long long w = graph[v][i].first; long lon...
#include <bits/stdc++.h> using namespace std; bool acompare(int lhs, int rhs) { return lhs > rhs; } struct t { int a, pos; }; int b[1000]; struct t aa[1000]; int main() { int i, j, k, l, m, n; vector<int> a; string s, s1, s2, s3, s4; cin >> n; cin >> k; for (i = 0; i < n; i++) ...
#include <bits/stdc++.h> using namespace std; const int maxn = 200100; vector<pair<int, int> > d[2]; vector<int> S[2]; int n, v; int main() { cin >> n >> v; int sum = 0; for (int i = 0; i < n; i++) { int t, s; cin >> t >> s; sum += s; d[t - 1].push_back(make_pair(s, i + 1...
#include <bits/stdc++.h> using namespace std; int main(void) { long long a, b; cin >> a >> b; if (a >= b) { printf( %.12f , (a + b) / ((double)2 * ((a + b) / (2 * b)))); } else printf( -1 ); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long i, j, n, m, d, f, x, d1, ans = 1e9; cin >> n >> m; long long a[n], b[n]; for (i = 0; i < n; i++) cin >> a[i]; for (i = 0; i < n; i++) cin >> b[i]; sort(a, a + n); sort(b, b + n); for (i = 0; i < n; i++) { x = ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1001; const long long INF = (long long)1000 * 1000 * 1000 * 1000; const int INF_SMAL = 1000 * 1000 * 1000; const int K = 13; struct edge { int u, v, cap, flow; edge(){}; edge(int u, int v, int cap) : u(u), v(v), cap(cap), flow(0){}; ...
#include <bits/stdc++.h> using namespace std; const int N = (int)1e6 + 1; const int INF = (int)1e9; const int logN = 20; int n, k, a[N], Log2[N]; int maxValue[N][21]; int getMax(int l, int r) { int k = Log2[r - l + 1]; return max(maxValue[l][k], maxValue[r - (1 << k) + 1][k]); } void solve() {...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 7; map<int, int> euler; long long w[maxn]; int phi(int n) { int now = n; int ret = n; if (euler.count(now)) return euler[now]; for (int i = 2; i <= sqrt(n); i++) { if (n % i == 0) { ret = ret / i * (i - 1); ...
#include <bits/stdc++.h> using namespace std; int main() { char s[55], t[55], i = 0, j = 0; scanf( %s , s); scanf( %s , t); while (t[i] != 0 ) { if (t[i] == s[j]) j++; i++; if (j >= strlen(s)) break; } cout << j + 1; return 0; }
#include <bits/stdc++.h> using namespace std; bool comp(pair<long long, long long> a, pair<long long, long long> b) { if (a.first > a.second && a.first > b.first) return 1; return 0; } void solve() { long long n; cin >> n; vector<pair<double, pair<long long, long long>>> v(n); for (long ...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> v(n); map<int, int> freq; for (int i = 0; i < n; i++) cin >> v[i]; int min = v[0], max = v[0], maximum = 0; freq[v[0]]++; int i = 0, j = 1; while (j < n) { while (((v[j] == min \|\| v[j] =...
#include <bits/stdc++.h> using namespace std; const int maxn = 14; int dp[1 << maxn], n, m, ver[maxn][maxn][1 << maxn]; pair<pair<int, int>, int> pre[1 << maxn]; bool valid[maxn][maxn][1 << maxn]; vector<int> G[maxn]; int main() { scanf( %d%d , &n, &m); while (m--) { int u, v; scanf( %...
#include <bits/stdc++.h> using namespace std; const int N = 2010; const int mod = 998244353; inline int Pow(int x, int y) { int res = 1; for (; y; y >>= 1, x = (long long)x * x % mod) if (y & 1) res = (long long)res * x % mod; return res; } int f0[N], f1[N], f2[N], g[N]; inline int calc(...
#include <bits/stdc++.h> #pragma GCC optimize( -O2 ) using namespace std; string doSum(string a, string b) { if (a.size() < b.size()) swap(a, b); int j = a.size() - 1; for (int i = b.size() - 1; i >= 0; i--, j--) a[j] += (b[i] - 0 ); for (int i = a.size() - 1; i > 0; i--) { if (a[i] > 9 ) ...
#include <bits/stdc++.h> using namespace std; long long n, k, a[100010], w[100010]; int main() { while (~scanf( %lld%lld , &n, &k)) { for (long long i = 1; i <= n; i++) scanf( %lld , &a[i]); memset(w, -1, sizeof(w)); for (long long i = 1; i <= n; i++) if (w[a[i]] == -1) { l...
#include <bits/stdc++.h> const int SIZE = 200000; int p[SIZE]; int ans[SIZE][2]; int ans_cnt; bool judge(int a[], int n) { static int used[SIZE + 1]; for (int i = 1; i <= n; i++) used[i] = 0; for (int i = 0; i < n; i++) used[a[i]] = 1; for (int i = 1; i <= n; i++) { if (!used[i]) return ...
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; long long ans = 0; for (int i = (0); i < (n); ++i) { long long t, T, x, cost; cin >> t >> T >> x >> cost; if (t >= T) { ans += cost + m * x; continue; } long long aux1 = ...
#include <bits/stdc++.h> const int p10[7] = {1, 10, 100, 1000, 10000, 100000, 1000000}; int N, S[10], can_be_zero[10], L, p[10], fill[10], O; char a[7]; int main() { for (int i = 0; i < 10; i++) can_be_zero[i] = 1; scanf( %d , &N); for (int i = 0; i < N; i++) { scanf( %s , a); L = 0; ...
#include <bits/stdc++.h> using namespace std; const int maxn = 10000001; int a, n, x[maxn]; int main() { scanf( %d%d , &a, &n); for (int i = a; i <= a + n - 1; i++) x[i] = i; for (int i = 2; i * i <= a + n - 1; i++) { int p = i * i; int t = ((a + p - 1) / p) * p; for (int j = t; j ...
// Copyright (C) 2021 JacderZhang // // This program is free software: you can redistribute it and/or modify // it under the terms of the GNU General Public License as published by // the Free Software Foundation, either version 3 of the License, or // (at your option) any later version. // // This progra...
#include <bits/stdc++.h> using namespace std; const long long N = 400010; inline long long read() { long long s = 0, w = 1; register char ch = getchar(); while (ch < 0 \|\| ch > 9 ) { if (ch == - ) w = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) s = (s << 3) + (s <...
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; const long double pi = 3.141592653589793238462643383279; const long double log23 = 1.58496250072115618145373894394781; const long double eps = 1e-8; const long long INF = 1e18 + 239; const long long prost = 239; const int two = 2; ...
#include <bits/stdc++.h> using namespace std; int solve() { long long n; cin >> n; vector<vector<long long> > mat(n, vector<long long int>(n, 0)); for (long long int i = 0; i < n - 1; i++) { long long x, y; cin >> x >> y; x--, y--; mat[x][y] = 1; } vector<pair<long lo...
#include <bits/stdc++.h> using namespace std; int a, b, c, d; int gcd(int first, int second) { if (!second) return first; return gcd(second, first % second); } pair<int, int> sol, curr; int main() { cin >> a >> b >> c >> d; int dd = gcd(a, b); a /= dd; b /= dd; dd = gcd(c, d); ...
#include <bits/stdc++.h> using namespace std; template <typename T> struct Point { public: T x, y; Point() : x(0), y(0) {} Point(T x_, T y_) : x(x_), y(y_) {} template <typename U> explicit Point(const Point<U>& p) : x(p.x), y(p.y) {} Point(const std::pair<T, T>& p) : x(p.first), y(p.se...
#include <bits/stdc++.h> using namespace std; pair<pair<int, int>, pair<int, int> > find_pramougolnik(int x1, int y1, int x2, int y2) { int lef = x1 - 1, rig = x2; while (lef + 1 < rig) { int mid = (lef + rig) / 2; cout << ? << x1 << ...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int Q; cin >> Q; while (Q-- > 0) { int N; string S; cin >> N >> S; if (N == 2 && S[0] >= S[1]) { cout << NO << n ; } else { cout << YES <<...
#include <bits/stdc++.h> using namespace std; int ques[50005]; int ma[26]; int main() { string s; cin >> s; int i, j; memset(ques, 0, sizeof(ques)); int br = 1; for (i = 0; i < (s.size()); i++) { if (i != 0) ques[i] = ques[i] + ques[i - 1]; if (s[i] == ? ) ques[i] += 1; ...
#include <bits/stdc++.h> using namespace std; long double area(long double a, long double b, long double c) { long double s = (a + b + c) / 2.0; return sqrt(s * (s - a) * (s - b) * (s - c)); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int i, j; long double l[9], a = 0...
#include <bits/stdc++.h> using namespace std; int N, M; vector<int> graph[200005]; int nd[2], deg[2]; int cnt[2][200005]; int dsu[200005]; int olddsu[200005]; int sz[4]; int getrt(int n) { return dsu[n] = (dsu[n] == n ? n : getrt(dsu[n])); } int getoldrt(int n) { return olddsu[n] = (olddsu[n] ==...
#include <bits/stdc++.h> using namespace std; int a[200]; int main() { int n, k; cin >> n >> k; for (int i = 0; i < n; i++) { string d; cin >> d; a[d.size()]++; } string s; cin >> s; int k1 = s.size(); int r = 0; for (int i = 1; i < 150; i++) { if (k1 > ...
#include <bits/stdc++.h> using namespace std; const int Maxn = 40005; int n, m, c, s, t, ct, cnt, ans, b[Maxn], dis[Maxn], head[Maxn], cur[Maxn], a[205][205], id[205][205]; long long tot; bool vis[Maxn]; struct edg { int nxt, to, w; } edge[10 * Maxn]; void add(int x, int y, int w) { edge[+...

#include <bits/stdc++.h> using namespace std; mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count()); mt19937 rnf(2106); const int N = 300005; int n; int a[N]; vector<int> v[N]; int ans[N]; void solv() { scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %d , &a[i]); for (in...

#include <bits/stdc++.h> const int offs = 350; int n, d, f[30005][705], gem[30005]; int main() { scanf( %d%d , &n, &d); for (int i = 0, t; i < n; i++) scanf( %d , &t), gem[t]++; memset(f, -1, sizeof(f)); f[d][offs] = gem[d]; for (int i = d + 1, t; i < 30005; i++) for (int j = 0; j < 705 ...

#include <bits/stdc++.h> using namespace std; const long long inf = 1000000000000000000LL; const double EPS = 1e-9; const long long mod = 1000000007ll; const int maxn = 500500; int longestP[1000500]; char pat[1000500]; void KMP() { for (int i = 1, k = 0; pat[i]; i++) { while (k > 0 && pat[i] !...

#include <bits/stdc++.h> using namespace std; int n, ans = 0; int a[1000 + 10], pre[9][1000 + 10], kr[9][1000 + 10], cnt[10]; int f[1000 + 10][1 << 8]; int g[9] = {0, 1, 2, 4, 8, 16, 32, 64, 128}; int read() { int x = 0, f = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) f =...

#include <bits/stdc++.h> using namespace std; int a[25] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 4, 9, 25, 49}; int main() { string s; int num = 0; for (int i = 0; i < 19; i++) { printf( %d n , a[i]); fflush(stdout); cin >> s; if (s == ye...

#include <bits/stdc++.h> using namespace std; const char IO_MODE = 3; inline long long ReadInt() { long long x = 0, s = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) s = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { x = x * 10 + c - 0 ; c = ge...

#include <bits/stdc++.h> using namespace std; int i, t; double a, b; int main() { cin >> t; for (i = 0; i < t; i++) { cin >> a >> b; if (b == 0) { cout << 1 << endl; continue; } b *= 4; if (a > b) { cout << 1.0 - b / (4.0 * a) << endl; contin...

#include <bits/stdc++.h> using namespace std; int main() { long long t, n, k; cin >> t; while (t--) { cin >> n; int arr[n]; int c1 = 0; for (int i = 0; i < n; i++) { cin >> arr[i]; if (arr[i] == 1) c1++; } if (n - c1 >= c1) { cout << n - c1 << ...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 7; long long a[N], n, seg[20][N]; void build(int xl = 0, int xr = n, int ind = 0) { if (xr - xl == 1) { seg[ind][xl] = a[xr] - a[xl]; return; } int xm = (xl + xr) / 2; build(xl, xm, ind + 1); build(xm, xr, ind + 1)...

#include <bits/stdc++.h> using namespace std; const int maxn = 500 + 10; int R, C; char pic[maxn][maxn]; bool vis[maxn][maxn]; int sr, sc, er, ec; const int dr[] = {-1, 0, 1, 0}; const int dc[] = {0, 1, 0, -1}; bool ok(int r, int c) { return r >= 1 && r <= R && c >= 1 && c <= C; } struct Node { ...

#include <bits/stdc++.h> using namespace std; double majk; double dp[8005][1005]; int visdp[8005][1005]; double solve(int n, int k) { if (n == 0 && k == 0) return 1; if (n == 0) return 0; double sol = 0; if (visdp[n][k]) return dp[n][k]; if (k) { sol += solve(n - 1, k - 1) * ((double...

#include <bits/stdc++.h> using namespace std; long long maxm = 0; long long nmbr = INT_MAX; map<long long, bool> vstd; class graph { public: map<long long, list<pair<long long, long long>>> adj; void input(long long n) { long long x, y, z; for (long long i = 1; i < n; i++) { cin...

#include <bits/stdc++.h> using namespace std; signed main() { cin.sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long t; cin >> t; while (t--) { long long n, s; cin >> n >> s; long long half = n / 2; half++; cout << s / half << endl; } ...

#include <bits/stdc++.h> int ff[] = {1, 1, 2, 6, 24, 120, 720, 5040, 40320, 362880}; long long dp[16][9 + 1]; void solve(int *bb, int l) { int k, d, i, e, j; memset(dp, 0, sizeof dp); k = ((l) < (bb[0]) ? (l) : (bb[0])); for (i = 0; i <= k; i++) dp[0][i] = 1; for (d = 0; d < 16 - 1; d++) ...

#include <bits/stdc++.h> using namespace std; const double PI = acos(double(-1)); const double INF = 1e10; const double EPS = 1e-8; inline double sqr(double x) { return x * x; } struct PT { double x, y; PT() {} PT(double x, double y) : x(x), y(y) {} void in() { double _x, _y; sca...

#include <bits/stdc++.h> using namespace std; const int MAXN = 100001; const long long mod = 1e9 + 7; int main() { int N, M; scanf( %d %d , &N, &M); int arr[M][2], nums[N]; for (int i = 0; i < N; i++) { scanf( %d , &nums[i]); } for (int i = 0; i < M; i++) { scanf( %d %d , &ar...

#include <bits/stdc++.h> using namespace std; set<int> s; map<long long, int> m1, m2; int main() { int n, n2, k; cin >> n >> n2 >> k; for (int i = 0; i < n; i++) { int q; cin >> q; m1[q]++; s.insert(q); } for (int i = 0; i < n2; i++) { int q; cin >> q; ...

#include <bits/stdc++.h> using namespace std; const long long MAXN = 2e5 + 10; long long n, T, fac[MAXN], a[MAXN], inv[MAXN], b[MAXN], ans, mod = 1e9 + 7; long long read() { long long sss = 0, fff = 1; char ccc; ccc = getchar(); while (ccc < 0 || ccc > 9 ) { if (ccc == - ) fff = -1; ...

#include <bits/stdc++.h> using namespace std; int main() { int n, m, i, flag, ans, index, j; int a[4000], b[4000]; cin >> n >> m; for (i = 0; i < n; i++) cin >> a[i]; for (i = 0; i < m; i++) cin >> b[i]; ans = 0; for (i = n; i >= 0; i--) { flag = 0; for (j = m; j >= 0; j--) {...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); int n, k; cin >> n >> k; string s; cin >> s; string ss = s; int iter = 0; int total = 0; while (true) { int cnt = 0; for (int i = 1; i < n; i++) if (s[i - 1] == R && s[i]...

#include <bits/stdc++.h> using namespace std; int main() { int N; cin >> N; int v[N]; for (int i = 0; i < N; i++) { cin >> v[i]; } vector<int> quadr; for (int i = 0; 1; i++) { if (i > sqrt(INT_MAX)) { break; } quadr.push_back(i * i); } int dist[N];...

#include <bits/stdc++.h> using namespace std; const int N = 5e5 + 5; char a[N], b[N]; int main() { int n, k; cin >> n >> k; scanf( %s %s , a + 1, b + 1); long long ans = 0, t = 1; for (int i = 1; i <= n; ++i) { t = t * 2; if (b[i] == a ) t--; if (a[i] == b ) t--; if...

#include <bits/stdc++.h> using namespace std; template <typename T> class FenwickTree { private: vector<T> bit; int M; public: FenwickTree(int M) : bit(vector<T>(M + 1, 0)), M(M) {} int sum(int i) { if (!i) return 0; return bit[i] + sum(i - (i & -i)); } void add(int i,...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 777; vector<int> G[maxn]; map<int, int> savesiz[maxn]; int siz[maxn]; vector<int> ans; int n; void dfs(int s, int fa) { siz[s] = 1; int cnt = 0; for (int d : G[s]) { if (d == fa) continue; dfs(d, s); saves...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:16777216 ) using namespace std; const double eps = 1e-9; const double pi = acos(-1.0); const int maxn = (int)1e4 + 10; int a[maxn], b[maxn]; int main() { int n, c; cin >> n >> c; if (c < n) { cout << 0 << endl; return 0; ...

#include <bits/stdc++.h> using namespace std; const int N = (int)15e4 + 10, M = 310; int n, m, d; long long a[N], b[N], t[N], tmp[N], dp[2][N]; inline void f(int j) { long long k = 1ll * (t[j] - t[j - 1]) * d; int r = j % 2; deque<int> deq; for (int i = 0; i < n; i++) { while (deq.size()...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast , unroll-loops , omit-frame-pointer , inline ) #pragma GCC optimize(3) using namespace std; const long long INF = 1e17; const long long maxn = 1e5 + 700; const int mod = 998244353; const int up = 1e9; template <typename T> inline void read(T &a) ...

#include <bits/stdc++.h> using namespace std; int a[1000000], ans[1000000]; int n, k, p, x, y, sum = 0; int main() { cin >> n >> k >> p >> x >> y; for (int i = 1; i <= k; i++) { cin >> a[i]; sum += a[i]; } if (sum + n - k > x) { cout << -1; return 0; } for (int i ...

#include <bits/stdc++.h> using namespace std; int N; inline bool check(int x) { long long t = (long long)x * (long long)(x - 1) / 2; if (x & 1) t++; else t += x / 2; return t <= N; } int main() { int M; scanf( %d%d , &N, &M); vector<int> A; for (int i = 0; i < M; i+...

#include <bits/stdc++.h> using namespace std; int main() { int x; cin >> x; string names[x * 2]; for (int i = 0; i < x * 2; i++) cin >> names[i]; for (int i = 0; i < x * 2; i++) if (names[i] == rat ) { cout << names[i - 1]; cout << endl; } for (int i = 0; i < x *...

#include <bits/stdc++.h> using namespace std; int n, m; struct EDGE { int u, v, w; } p[100000 + 5]; struct Edge { int v, w, next; } edge[100000 + 5]; int head[100000 + 5], cnt = 0; void init() { cnt = 0; memset(head, -1, sizeof head); } void add_edge(int u, int v, int w) { edge[c...

#include <bits/stdc++.h> using namespace std; int main() { int n, i, a[150]; scanf( %d , &n); int sum = 0; for (i = 0; i < n; i++) { scanf( %d , &a[i]); sum += a[i]; } int ans = 0; for (i = 0; i < n; i++) (sum % 2) ^ ((a[i] + 1) % 2) ? ans++ : ans = ans; printf( %d n , an...

#include <bits/stdc++.h> using namespace std; int main() { string a, b; int mini = INT_MAX; cin >> a >> b; int az = a.size(); for (int i = -2000; i <= az; i++) { int ans = b.size(); for (int j = 0; j < b.size(); j++) { ans -= (i + j >= 0 && i + j < a.size() && a[i + j] == b[j...

#include <bits/stdc++.h> using namespace std; typedef struct line { int k; int b; long double x; } line; bool com(line l1, line l2) { if (l1.x < l2.x) return true; else return false; } int main() { long long k, b, n, t; cin >> k >> b >> n >> t; long long x = 1; ...

#include <bits/stdc++.h> using namespace std; const int N = 4e5 + 10; struct Edge { int to, nxt; } e[N << 1]; int h[N], idx; void Ins(int a, int b) { e[++idx].to = b; e[idx].nxt = h[a]; h[a] = idx; } int bas, f[N], g[N], to[N], n, siz[N], Mx[N], mk[N], sec[N]; void dfs(int u, int fa) {...

#include <bits/stdc++.h> using namespace std; const int INF = 1000000000; int main() { int n; cin >> n >> ws; char s[1001]; scanf( %s , &s); int h = 0; for (int i = 0; i < n; i++) { if (s[i] == H ) h++; } int _min = INF; for (int i = 0; i < n; i++) { int ans = 0; ...

#include <bits/stdc++.h> using ll = long long; using ld = long double; using ull = unsigned long long; using namespace std; const int N = 10; int T, n, a[N]; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cin >> T; while (T--) { cin >> n; for (int i = (0); i <...

#include <bits/stdc++.h> using namespace std; const int nmax = 5e5 + 42; int n, m; struct edges { int u, v, w; int id_original; }; edges inp[nmax], all[nmax]; bool cmp(edges a, edges b) { return a.w < b.w; } int parent[nmax]; int root(int node) { if (parent[node] == node) return node; ...

#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0, f = 1; char c = getchar(); while (!isdigit(c)) { if (c == - ) f = -1; c = getchar(); } while (isdigit(c)) { x = (x << 1) + (x << 3) + c - 48; c = getchar(); } return x * f; } const i...

#include <bits/stdc++.h> using namespace std; const int INF = numeric_limits<int>::max(); const long long LLINF = numeric_limits<long long>::max(); const unsigned long long ULLINF = numeric_limits<unsigned long long>::max(); const double PI = acos(-1.0); vector<int> ans; void solve(int n, int p, int maxN)...

#include <bits/stdc++.h> using namespace std; using namespace std::chrono; inline long long lrand() { long long x = 0; for (int i = 0; i < (4); i++) { x <<= 16; x ^= rand(); } return x; } string fname(string s, vector<long long> v) { string x = C:/leet/ + s; for (auto& k ...

#include <bits/stdc++.h> using namespace std; void write(int num) { if (num >= 10) write(num / 10); putchar(num % 10 + 0 ); } string s; vector<int> l, r; int id[100001]; vector<int> v[100001]; vector<int> ll, lr, rl, rr; int main() { cin >> s; int cnt = 0; for (int i = 0; i < s.si...

#include <bits/stdc++.h> using namespace std; vector<int> e[200100], g[200100]; int n, m, q; int low[200100], dfn[200100], sta[200100], idx, top; bool in[200100]; void tarjan(int u, int pre) { low[u] = dfn[u] = ++idx; sta[top++] = u; in[u] = true; for (auto v : g[u]) { if (v == pre) co...

#include <bits/stdc++.h> using namespace std; long long int a[1000001], has[1000001]; int main() { long long int n, i; cin >> n; for (i = 0; i < n; i++) { cin >> a[i]; has[a[i]] = 1; } long long int c = 0; for (i = 1; i <= n; i++) if (has[i]) c++; cout << n - c; r...

#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 100; const long long inf = 1e18; vector<int> g[maxn]; bool visit[maxn]; int cnt = 0; void dfs(int u) { cnt = 0; queue<int> q; q.push(u); visit[u] = true; cnt++; while (!q.empty()) { int u = q.front(); ...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:200000000 ) using namespace std; const long long oo = 1LL << 60; const long long kNumMoves = 4; const long long kMoves[kNumMoves][2] = {{1, 0}, {-1, 0}, {0, -1}, {0, 1}}; int n, v, e; vector<int> a, b; vector<vector<int> > conn, edges; vector<in...

#include <bits/stdc++.h> using namespace std; vector<vector<int>> graph(200005), revGraph(200005); vector<int> vis(200005, 0), revVis(200005, 0); bool dfs(int u, vector<vector<int>> &curGraph, vector<int> &curVis) { curVis[u] = -1; for (auto v : curGraph[u]) { if (curVis[v] == -1) return false; ...

#include <bits/stdc++.h> using namespace std; template <typename T> string to_string(const vector<T>& vc, int w) { if (vc.empty()) return ; if (w + 1 == vc.size()) return to_string(vc[w]); return to_string(vc[w]) + , + to_string(vc, w + 1); } template <typename T> string to_string(const vect...

#include <bits/stdc++.h> using namespace std; const int N = 100010; int n, x[N], y[N]; struct pt { int s, id, ans; } p[N], w[N]; bool cmpID(pt A, pt B) { return A.id < B.id; } bool cmpSw(pt A, pt B) { return (A.s < B.s) || (A.s == B.s && A.id < B.id); } bool cmpSp(pt A, pt B) { return (A.s < B.s...

#include <bits/stdc++.h> using namespace std; const int MAXN = 3100; int n, m; vector<int> eds[MAXN]; vector<int> reds[MAXN]; vector<pair<int, int> > go[MAXN]; vector<pair<int, int> > rgo[MAXN]; int dd[MAXN]; int ddg[MAXN][MAXN]; void bfs(int v) { for (int i = 0; i < n; ++i) dd[i] = -1; dd[v...

#include <bits/stdc++.h> using namespace std; long long i, j, n, c[223456], d[223456], a[456789], l, r, s, t, tt, k, x, y, z, m, b[1111111]; string p, q, du, qq; vector<long long> u[345678], uu, ui; multiset<long long> mm; int main() { cin >> n >> t; for (i = 0; i < n; i++) { cin >> a[i]...

#include <bits/stdc++.h> using namespace std; #define ios ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL) #define FOR(i,m) for(int i = 0 ;i < m ;i++) #define mem(a ,b) memset(a, (b) , sizeof(a)) #define all(cont) cont.begin(),cont.end() #define mp make_pair #define pb pus...

#include <bits/stdc++.h> using namespace std; struct code { int x, y; }; int res, k; string s; int gcd(int a, int b) { while (b) { a %= b; swap(a, b); } return a; } int a[100001], ans; int main() { int n; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i...

#include <bits/stdc++.h> using namespace std; char s[1010000]; int main() { int i, j, k, m, n; scanf( %s , s); n = strlen(s); if (n % 2 == 1) { n = (n + 1) / 2; for (i = 1; i <= n; i++) putchar( 4 ); for (i = 1; i <= n; i++) putchar( 7 ); puts( ); } else { char u...

#include <bits/stdc++.h> using namespace std; inline void solve() { int d, m; scanf( %d%d , &d, &m); int ans = 1; for (int i = 0; (1 << i) <= d; ++i) { ans = 1ll * ans * ((1 << i) + 1) % m; d -= (1 << i); } if (d) ans = 1ll * ans * (d + 1) % m; printf( %d n , (ans - 1 + m) % ...

#include <bits/stdc++.h> using namespace std; const int maxn = 200100; const int mod = 1e9 + 7; int add(int a, int b) { a += b; if (a >= mod) a -= mod; if (a < 0) a += mod; return a; } int mul(int a, int b) { return 1ll * a * b % mod; } int N; int F[maxn]; int Ans[maxn]; vector<int> ...

#include <bits/stdc++.h> using namespace std; const int N = 300000 + 9; const int Mod = 1000000007; int A[N], n, B[N]; multiset<int> S; bool ok(int l, int r) { if (l == r) { auto it = S.find(l); return it != S.end(); } auto it = S.lower_bound(l); auto it2 = S.lower_bound(r); ...

#include <bits/stdc++.h> using namespace std; long long a, b, ans; void gcd(long long a, long long b) { if (a == 0 || b == 0) return; if (a > b) swap(a, b); ans += (b / a); gcd(b % a, a); } int main() { cin >> a >> b; gcd(a, b); cout << ans << endl; }

#include <bits/stdc++.h> using namespace std; const long long INF = 1e9; const long long mod = 1e9 + 7; const long long N = 1e5 + 5; const long long Sz = 1e6 + 5; string to_string(const string& s) { return + s + ; } void DBG() { cerr << ] << endl; } template <class H, class... T> void DBG(H h...

#include <bits/stdc++.h> using namespace std; const int maxx = 5e5 + 7; long long a[maxx], prime[maxx], cnt[maxx], sum, tedad; bool mark[maxx]; int main() { int n, q; cin >> n >> q; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 2; i < maxx; i++) { if (prime[i] == 0) for (...

#include <bits/stdc++.h> using namespace std; int main() { int i, j, n, x = (int)(1e7 + 1); cin >> n; vector<bool> p(x, true); p[0] = p[1] = false; int c = 0; for (i = 2; i <= x; i++) { if (p[i]) { c++; cout << i << ; if (c == n) break; for (j = i; (l...

#include <bits/stdc++.h> using namespace std; vector<bool> isthere(2000010, false); vector<int> nextmax(2000010); int main() { ios::sync_with_stdio(false); int n, i; cin >> n; vector<int> a(n); for (i = 0; i < n; i++) { cin >> a[i]; isthere[a[i]] = true; } sort(a.begin(),...

#include <bits/stdc++.h> using namespace std; int main() { int x0, y0, x1, y1; cin >> x0 >> y0 >> x1 >> y1; int n; cin >> n; multimap<int, pair<long long int, long long int> > sections; for (long long int i = 0; i < n; i++) { int r, a, b; cin >> r >> a >> b; sections.insert...

#include <bits/stdc++.h> const int maxn = 2222; using namespace std; char s1[maxn], s2[maxn]; int dp[maxn][maxn]; int n, m; int solve(int i) { int top = m; int rq = 0; if (i < m) return maxn; while (top && i) { if (s1[i] == s2[top]) top--; else rq++; i--; ...

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

#include <bits/stdc++.h> using namespace std; pair<long double, long double> A[200666]; int st[200666], ind[200666]; long double val[200666]; bool comp(int i1, int i2) { return A[i1] < A[i2]; } bool eql(long double v1, long double v2) { return (v1 - v2 > -((long double)0.00000000000001) && v...

#include <bits/stdc++.h> using namespace std; using ll = long long; template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) { for (size_t i = 0; i < v.size(); i++) o << v[i] << (i + 1 != v.size() ? : ); return o; } template <int n, class... T> typename enable_if<(n >=...

#include <bits/stdc++.h> using namespace std; int dp[1024], n, m, c1, c2, c3, c4, an[1024], am[1024]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> c1 >> c2 >> c3 >> c4; cin >> n >> m; for (int i = 0; i < n; ++i) cin >> an[i]; for (int i = 0; i < m; ++i) cin >> am[i]; i...

#include <bits/stdc++.h> using namespace std; map<pair<long long, long long>, bool> blocked; vector<vector<pair<long long, long long> > > graph; vector<bool> used; int part(int v) { vector<long long> adj; for (int i = 0; i < graph[v].size(); i++) { long long w = graph[v][i].first; long lon...

#include <bits/stdc++.h> using namespace std; bool acompare(int lhs, int rhs) { return lhs > rhs; } struct t { int a, pos; }; int b[1000]; struct t aa[1000]; int main() { int i, j, k, l, m, n; vector<int> a; string s, s1, s2, s3, s4; cin >> n; cin >> k; for (i = 0; i < n; i++) ...

#include <bits/stdc++.h> using namespace std; const int maxn = 200100; vector<pair<int, int> > d[2]; vector<int> S[2]; int n, v; int main() { cin >> n >> v; int sum = 0; for (int i = 0; i < n; i++) { int t, s; cin >> t >> s; sum += s; d[t - 1].push_back(make_pair(s, i + 1...

#include <bits/stdc++.h> using namespace std; int main(void) { long long a, b; cin >> a >> b; if (a >= b) { printf( %.12f , (a + b) / ((double)2 * ((a + b) / (2 * b)))); } else printf( -1 ); return 0; }

#include <bits/stdc++.h> using namespace std; int main() { long long i, j, n, m, d, f, x, d1, ans = 1e9; cin >> n >> m; long long a[n], b[n]; for (i = 0; i < n; i++) cin >> a[i]; for (i = 0; i < n; i++) cin >> b[i]; sort(a, a + n); sort(b, b + n); for (i = 0; i < n; i++) { x = ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 1001; const long long INF = (long long)1000 * 1000 * 1000 * 1000; const int INF_SMAL = 1000 * 1000 * 1000; const int K = 13; struct edge { int u, v, cap, flow; edge(){}; edge(int u, int v, int cap) : u(u), v(v), cap(cap), flow(0){}; ...

#include <bits/stdc++.h> using namespace std; const int N = (int)1e6 + 1; const int INF = (int)1e9; const int logN = 20; int n, k, a[N], Log2[N]; int maxValue[N][21]; int getMax(int l, int r) { int k = Log2[r - l + 1]; return max(maxValue[l][k], maxValue[r - (1 << k) + 1][k]); } void solve() {...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 7; map<int, int> euler; long long w[maxn]; int phi(int n) { int now = n; int ret = n; if (euler.count(now)) return euler[now]; for (int i = 2; i <= sqrt(n); i++) { if (n % i == 0) { ret = ret / i * (i - 1); ...

#include <bits/stdc++.h> using namespace std; int main() { char s[55], t[55], i = 0, j = 0; scanf( %s , s); scanf( %s , t); while (t[i] != 0 ) { if (t[i] == s[j]) j++; i++; if (j >= strlen(s)) break; } cout << j + 1; return 0; }

#include <bits/stdc++.h> using namespace std; bool comp(pair<long long, long long> a, pair<long long, long long> b) { if (a.first > a.second && a.first > b.first) return 1; return 0; } void solve() { long long n; cin >> n; vector<pair<double, pair<long long, long long>>> v(n); for (long ...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> v(n); map<int, int> freq; for (int i = 0; i < n; i++) cin >> v[i]; int min = v[0], max = v[0], maximum = 0; freq[v[0]]++; int i = 0, j = 1; while (j < n) { while (((v[j] == min || v[j] =...

#include <bits/stdc++.h> using namespace std; const int maxn = 14; int dp[1 << maxn], n, m, ver[maxn][maxn][1 << maxn]; pair<pair<int, int>, int> pre[1 << maxn]; bool valid[maxn][maxn][1 << maxn]; vector<int> G[maxn]; int main() { scanf( %d%d , &n, &m); while (m--) { int u, v; scanf( %...

#include <bits/stdc++.h> using namespace std; const int N = 2010; const int mod = 998244353; inline int Pow(int x, int y) { int res = 1; for (; y; y >>= 1, x = (long long)x * x % mod) if (y & 1) res = (long long)res * x % mod; return res; } int f0[N], f1[N], f2[N], g[N]; inline int calc(...

#include <bits/stdc++.h> #pragma GCC optimize( -O2 ) using namespace std; string doSum(string a, string b) { if (a.size() < b.size()) swap(a, b); int j = a.size() - 1; for (int i = b.size() - 1; i >= 0; i--, j--) a[j] += (b[i] - 0 ); for (int i = a.size() - 1; i > 0; i--) { if (a[i] > 9 ) ...

#include <bits/stdc++.h> using namespace std; long long n, k, a[100010], w[100010]; int main() { while (~scanf( %lld%lld , &n, &k)) { for (long long i = 1; i <= n; i++) scanf( %lld , &a[i]); memset(w, -1, sizeof(w)); for (long long i = 1; i <= n; i++) if (w[a[i]] == -1) { l...

#include <bits/stdc++.h> const int SIZE = 200000; int p[SIZE]; int ans[SIZE][2]; int ans_cnt; bool judge(int a[], int n) { static int used[SIZE + 1]; for (int i = 1; i <= n; i++) used[i] = 0; for (int i = 0; i < n; i++) used[a[i]] = 1; for (int i = 1; i <= n; i++) { if (!used[i]) return ...

#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; long long ans = 0; for (int i = (0); i < (n); ++i) { long long t, T, x, cost; cin >> t >> T >> x >> cost; if (t >= T) { ans += cost + m * x; continue; } long long aux1 = ...

#include <bits/stdc++.h> const int p10[7] = {1, 10, 100, 1000, 10000, 100000, 1000000}; int N, S[10], can_be_zero[10], L, p[10], fill[10], O; char a[7]; int main() { for (int i = 0; i < 10; i++) can_be_zero[i] = 1; scanf( %d , &N); for (int i = 0; i < N; i++) { scanf( %s , a); L = 0; ...

#include <bits/stdc++.h> using namespace std; const int maxn = 10000001; int a, n, x[maxn]; int main() { scanf( %d%d , &a, &n); for (int i = a; i <= a + n - 1; i++) x[i] = i; for (int i = 2; i * i <= a + n - 1; i++) { int p = i * i; int t = ((a + p - 1) / p) * p; for (int j = t; j ...

// Copyright (C) 2021 JacderZhang // // This program is free software: you can redistribute it and/or modify // it under the terms of the GNU General Public License as published by // the Free Software Foundation, either version 3 of the License, or // (at your option) any later version. // // This progra...

#include <bits/stdc++.h> using namespace std; const long long N = 400010; inline long long read() { long long s = 0, w = 1; register char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) w = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) s = (s << 3) + (s <...

#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; const long double pi = 3.141592653589793238462643383279; const long double log23 = 1.58496250072115618145373894394781; const long double eps = 1e-8; const long long INF = 1e18 + 239; const long long prost = 239; const int two = 2; ...

#include <bits/stdc++.h> using namespace std; int solve() { long long n; cin >> n; vector<vector<long long> > mat(n, vector<long long int>(n, 0)); for (long long int i = 0; i < n - 1; i++) { long long x, y; cin >> x >> y; x--, y--; mat[x][y] = 1; } vector<pair<long lo...

#include <bits/stdc++.h> using namespace std; int a, b, c, d; int gcd(int first, int second) { if (!second) return first; return gcd(second, first % second); } pair<int, int> sol, curr; int main() { cin >> a >> b >> c >> d; int dd = gcd(a, b); a /= dd; b /= dd; dd = gcd(c, d); ...

#include <bits/stdc++.h> using namespace std; template <typename T> struct Point { public: T x, y; Point() : x(0), y(0) {} Point(T x_, T y_) : x(x_), y(y_) {} template <typename U> explicit Point(const Point<U>& p) : x(p.x), y(p.y) {} Point(const std::pair<T, T>& p) : x(p.first), y(p.se...

#include <bits/stdc++.h> using namespace std; pair<pair<int, int>, pair<int, int> > find_pramougolnik(int x1, int y1, int x2, int y2) { int lef = x1 - 1, rig = x2; while (lef + 1 < rig) { int mid = (lef + rig) / 2; cout << ? << x1 << ...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int Q; cin >> Q; while (Q-- > 0) { int N; string S; cin >> N >> S; if (N == 2 && S[0] >= S[1]) { cout << NO << n ; } else { cout << YES <<...

#include <bits/stdc++.h> using namespace std; int ques[50005]; int ma[26]; int main() { string s; cin >> s; int i, j; memset(ques, 0, sizeof(ques)); int br = 1; for (i = 0; i < (s.size()); i++) { if (i != 0) ques[i] = ques[i] + ques[i - 1]; if (s[i] == ? ) ques[i] += 1; ...

#include <bits/stdc++.h> using namespace std; long double area(long double a, long double b, long double c) { long double s = (a + b + c) / 2.0; return sqrt(s * (s - a) * (s - b) * (s - c)); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int i, j; long double l[9], a = 0...

#include <bits/stdc++.h> using namespace std; int N, M; vector<int> graph[200005]; int nd[2], deg[2]; int cnt[2][200005]; int dsu[200005]; int olddsu[200005]; int sz[4]; int getrt(int n) { return dsu[n] = (dsu[n] == n ? n : getrt(dsu[n])); } int getoldrt(int n) { return olddsu[n] = (olddsu[n] ==...

#include <bits/stdc++.h> using namespace std; int a[200]; int main() { int n, k; cin >> n >> k; for (int i = 0; i < n; i++) { string d; cin >> d; a[d.size()]++; } string s; cin >> s; int k1 = s.size(); int r = 0; for (int i = 1; i < 150; i++) { if (k1 > ...

#include <bits/stdc++.h> using namespace std; const int Maxn = 40005; int n, m, c, s, t, ct, cnt, ans, b[Maxn], dis[Maxn], head[Maxn], cur[Maxn], a[205][205], id[205][205]; long long tot; bool vis[Maxn]; struct edg { int nxt, to, w; } edge[10 * Maxn]; void add(int x, int y, int w) { edge[+...