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; pair<char, int> check(string s) { map<char, int> used; int l = s.size(), i, maxVal = 0; char ans; for (i = 0; i < l; i++) { used[s.at(i)]++; if (used[s.at(i)] > maxVal) { maxVal = used[s.at(i)]; ans = s.at(i); } } ...
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 1; long long a[4], mn = 1e12 + 1; char b, c, d; int main() { cin >> a[0] >> a[1] >> a[2] >> a[3]; cin >> b >> c >> d; sort(a, a + 4); do { long long first, second, temp; if (b == + ) first = a[0] + a[1]; ...
#include <bits/stdc++.h> using namespace std; char s[100010]; typedef struct record { char ch; int po; } rec; int main() { int leng, ans, l, r; rec tmp1, tmp2; int tmp3; bool flag; stack<rec> st; while (~scanf( %s , s)) { flag = false; while (!st.empty()) st.pop(); ...
#include <bits/stdc++.h> #pragma GCC optimize(2) using namespace std; const int INF = 0x3f3f3f3f; const long long inf = 0x3f3f3f3f3f3f3f3f; const int mod = 1e9 + 7; const int maxn = 1e3 + 5; int n, m, qq, s[maxn][maxn], f[maxn][maxn]; bool vis[maxn][maxn]; int a[4] = {0, 1, 0, -1}; int b[4] = {-1, 0...
#include <bits/stdc++.h> using namespace std; int n, m; vector<int> adj[100005]; vector<int> vis(100005, 1); vector<int> ans; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int T = 1; for (int qq = 1; qq <= T; qq++) { cin >> n >> m; for (int i = 0; i < m; i++) { ...
#include <bits/stdc++.h> using namespace std; const long long inf = 1e18 + 1e17; const long long mod = 1e9 + 7; long long modInverse(long long a, long long m) { long long m0 = m; long long y = 0, x = 1; if (m == 1) return 0; while (a > 1) { long long q = a / m; long long t = m; ...
#include <bits/stdc++.h> using namespace std; int freq[27]; char sent[101]; int main() { int n; scanf( %d , &n); scanf( %s , sent); while (n--) { if (isupper(sent[n])) sent[n] = tolower(sent[n]); freq[sent[n] - a ]++; } for (int i = 0; i < 26; i++) if (!freq[i]) { ...
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; const int INF = 1e9 + 5; int read(int base = 10) { int x = 0; char ch = getchar(); while (!isdigit(ch)) ch = getchar(); while (isdigit(ch)) x = x * base + ch - 0 , ch = getchar(); return x; } struct Node { int num[...
#include <bits/stdc++.h> using namespace std; template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cerr << name << : << arg1 << endl; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, , ); ...
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; string s; cin >> s; int ans = 0; for (int i = 1; i < n; i++) if (s[i - 1] == . && s[i] == . ) ans++; while (m--) { int k; char c; cin >> k >> c; if (c != s[k - 1]) { ...
#include <bits/stdc++.h> using namespace std; int main() { int me; int bebia; int iliko = 0; int ilarioni = 0; cin >> me; for (int i = 0; i < me; i++) { cin >> bebia; if (bebia > 0) iliko += bebia; if (bebia == -1) { if (iliko - 1 < 0) { ilarioni++; ...
#include <bits/stdc++.h> using namespace std; int main() { int i, j, t; int n; int a[105]; cin >> n; for (i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); int b[105] = {0}; int cnt = 1; for (i = 0; i < n; i++) { for (j = 0; j <= cnt; j++) { if (!b[j]) { b[j...
#include <bits/stdc++.h> using namespace std; int rx[4] = {0, 0, 1, -1}; int ry[4] = {-1, 1, 0, 0}; int main() { int n, k, a, b, u, v; cin >> n >> k; cin >> a >> b >> u >> v; if (k < n + 1 \|\| n == 4) { cout << -1 << endl; return 0; } int ind1, ind2; vector<int> p(n + 1); ...
#include <bits/stdc++.h> using namespace std; int main() { string s; int i; cin >> s; for (i = 0; i < s.size(); i++) { if (s[i] == r ) cout << i + 1 << n ; } for (i = s.size() - 1; i >= 0; i--) { if (s[i] == l ) cout << i + 1 << n ; } }
#include <bits/stdc++.h> using namespace std; signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long a, b, c, d; cin >> a >> b >> c >> d; long long sum = a + b + c + d; if (sum % 2 == 0) { if (a + b == sum / 2 \|\| a + c == sum / 2 \|\| a + d == sum / 2 \|\|...
#include <bits/stdc++.h> using namespace std; int main() { int i, j, r, n, x; cin >> x; r = x % 4; if (r == 0) { cout << 1 << A ; } if (r == 1) { cout << 0 << A ; } if (r == 2) { cout << 1 << B ; } if (r == 3) { ...
#include <bits/stdc++.h> using namespace std; inline bool SR(int &x) { return scanf( %d , &x) == 1; } inline bool SR(long long &x) { return scanf( %lld , &x) == 1; } inline bool SR(double &x) { return scanf( %lf , &x); } inline bool SR(char *s) { return scanf( %s , s); } inline bool RI() { return 1; } tem...
#include <bits/stdc++.h> using namespace std; const int maxN = 50000 + 10; int n; int B[maxN]; vector<pair<int, int>> VB; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d , &B[i]); for (int i = 0; i < n; i++) { VB.push_back(make_pair(B[i] + B[(i + 1) % n], i)); } ...
#include <bits/stdc++.h> using namespace std; int main() { int arr[5001], k = 0; string s, in; stack<int> s1; while (getline(cin, s)) { in = in + s; } for (int i = 0; i < in.size(); i++) { char st[5001] = { 0 }; if (in[i] == < ) { i++; int j = 0; w...
#include <bits/stdc++.h> int main() { int a, b, c; int a1, b1, c1; int s = 0; scanf( %d%d%d%d%d%d , &a, &b, &c, &a1, &b1, &c1); if (a > a1) { s = s + ((a - a1) / 2); } else s = s - (a1 - a); if (b > b1) { s = s + ((b - b1) / 2); } else s = s - (b1 - b); if (...
#include <bits/stdc++.h> using namespace std; int main(int argc, char *argv[]) { int n, tmp = 1, res = 1; cin >> n; int A[n][2]; for (int i = 0; i < n; i++) cin >> A[i][0] >> A[i][1]; for (int i = 0; i < n - 1; i++) { if ((A[i][0] == A[i + 1][0]) && (A[i][1] == A[i + 1][1])) { tmp+...
#include <bits/stdc++.h> using namespace std; unsigned long long int expo_fast(long long int a, long long int b) { a = a; long long int result = 1; while (b) { if (b & 1) result = (result * a); b >>= 1; a = (a * a); } return (result); } void take_in(vector<long long int> *a...
#include <bits/stdc++.h> using namespace std; int n, m, k, l[100100], c[100100]; vector<int> g[100100]; vector<int> s; void dfs(int t) { s.push_back(t); l[t] = s.size(); for (auto v : g[t]) { if (!l[v]) dfs(v); else { if (l[t] - l[v] + 1 >= k) { printf( 2 n%d ...
#include <bits/stdc++.h> using namespace std; vector<int> v[200008]; int val[200008]; int n, tk; int dp[200008]; int lim; int siz[200008]; int cnt, tot; int no[200008]; void dfs(int x, int p) { no[x] = val[x] < lim; dp[x] = 0; int b1 = 0, b2 = 0, b3 = 0; siz[x] = 1; for (int i = ...
#include <bits/stdc++.h> using namespace std; long long int mini(long long int p, long long int q) { if (p < q) return p; return q; } int main() { long long int k2, k3, k5, k6, total = 0; cin >> k2 >> k3 >> k5 >> k6; int m = 0; m = mini(k2, k5); m = mini(m, k6); total = m * 256; ...
#include <bits/stdc++.h> using namespace std; const double PI = 2.0 * acos(0.0); inline int getInt() { int x; scanf( %d , &x); return x; } inline long long getLL() { long long x; scanf( %lld , &x); return x; }; inline int NUM(char c) { return (int)c - 48; } inline char CHR(int n)...
#include <bits/stdc++.h> using namespace std; const int MAX = 1 << 20, KOR = 32000; const long long INF = 1e18; int n; int p[MAX]; int sito[KOR]; int bezp[MAX], sp[MAX]; int cijseg, cijprom; vector<int> Pr; void Eratosten() { for (int i = 2; i < KOR; i++) { if (!sito[i]) { Pr.push_...
#include <bits/stdc++.h> using namespace std; const long long N = 1000006, MOD = 1e9 + 7, INF = 1e16; long long a[N], b, n, m, k, g[105][105], q, x, ans, Ans, pre[N], l, r; string s; pair<int, int> p[N]; int main() { ios_base::sync_with_stdio(false), cin.tie(0); cin >> n >> m; for (int i = 1; i ...
#include <bits/stdc++.h> using namespace std; int n, m, a[100010]; long long t; int main() { cin >> n >> m; a[0] = 1; for (int i = 1; i <= m; i++) { cin >> a[i]; if (a[i] > a[i - 1]) t += (a[i] - a[i - 1]); if (a[i] < a[i - 1]) t += (n - a[i - 1] + a[i]); } cout << t; } ...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); int n, k; cin >> n >> k; int i = 1; for (i = k - 1; i > 0; i--) { if ((n % i) == 0) break; } if (i == 0) i = 1; int x = (n / i) * k; for (; x % k != i;...
#include <bits/stdc++.h> using namespace std; using ll = long long; const ll INF = 4e18; const int MAXN = 1.1e5; ll T[MAXN]; int main() { ios::sync_with_stdio(0), cin.tie(0); ll N, M, A, D; cin >> N >> M >> A >> D; for (ll i = 0; i < M; i++) { cin >> T[i]; } sort(T, T + M); ...
#include <iostream> #include <cstring> using namespace std; int a[10005],s[10005]; signed main() { int T; cin >> T; while(T--) { int n; cin >> n; memset(s,0,sizeof s); for(int i=1;i<=n;i++) cin >> a[i]; long long ans=0; for(int i=1;i<=n;i++) { an...
#include <bits/stdc++.h> using namespace std; int l[51], r[51], a[51], c[51], dp[51][51][51]; void inline FilterRestrictions(int i, int j, int h, vector<int> &v) { vector<int> u; for (int x : v) { if (r[x] < i \|\| j < l[x] \|\| a[x] >= h) { continue; } u.push_back(x); } v = ...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC optimize( unroll-loops ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native ) using namespace std; template <typename T1, typename T2> void ckmin(T1 &a, T2 b) { if (a > b) a = b; } template <type...
#include <bits/stdc++.h> using namespace std; struct MinMax { int min, max; MinMax() : min(INT_MAX), max(INT_MIN){}; MinMax(int min, int max) : min(min), max(max){}; }; int main(int argc, char const *argv[]) { ios_base::sync_with_stdio(false); int n, m; cin >> n >> m; MinMax a[n]; ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int t, n, i, j, k, h = 0; cin >> n; long long int a[n], b[n]; for (i = 0; i < n; ++i) { cin >> a[i] >> b[i]; } if (n == 1) cout << a[0] << endl; if (n > 1) ...
#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; if (n == 0) cout << 1; else { n %= 4; if (n == 0) n = 4; n = pow(8, n); cout << n % 10; } }
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; vector<double> a(n), b(n); for (int i = 0; i < n; i++) { cin >> a[i]; if (a[i] <= 1) { printf( -1 n ); exit(0); } } for (int i = 0; i < n; i++) { cin >> b[i]; if ...
#include <bits/stdc++.h> using namespace std; using ll = long long; using ull = unsigned long long; const int MAX_N = 1e6 + 5; int fen[MAX_N]; int n; int lowbit(int x) { return x & (-x); } void add(int x, int val) { for (int i = x; i <= n; i += lowbit(i)) fen[i] += val; } int sum(int x) { in...
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 9; bool p[N]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; vector<int> k; for (int i = 2; i <= 1e6; i++) { if (p[i]) continue; k.push_back(i); for (int j = i + i; j <= 1...
#include <bits/stdc++.h> using namespace std; const int INF = 1000000007; const int N = 100100; int n; int main() { cin >> n; for (int i = n + 1; i <= n + n; i++) cout << i << ; }
#include <bits/stdc++.h> using namespace std; const double EPS = 1e-9; struct DDMY { ostringstream o; template <class T> DDMY &operator,(const T &t) { o << t << , ; return this; } string operator() { return o.str().substr(0, o.str().size() - 1); } }; template <class T> std...
#include <bits/stdc++.h> template <class T> inline void read(T &res) { res = 0; bool bo = 0; char c; while (((c = getchar()) < 0 \|\| c > 9 ) && c != - ); if (c == - ) bo = 1; else res = c - 48; while ((c = getchar()) >= 0 && c <= 9 ) res = (res << 3) + (res << 1) + (c - 48); if (bo) r...
#include <bits/stdc++.h> using namespace std; long double pi = 3.141592653589793238462643383279502884197; vector<long long int> v(14); void Compute() { for (long long int i = 1; i < 14; i++) { v[i] = pow(2, i) + v[i - 1]; } } void solve() { long long int n; cin >> n; long long int ...
#include <bits/stdc++.h> using namespace std; const int V = 100000 + 5; int n, num[V]; int main() { int i, j; scanf( %d , &n); for (i = 0; i < n; ++i) scanf( %d , &num[i]); sort(num, num + n); printf( %d , num[n - 1]); for (i = 1; i < n - 1; ++i) printf( %d , num[i]); printf( %d n ...
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10; const double pi = acos(-1.0); struct Complex { double x, y; Complex(double x = 0.0, double y = 0.0) { this->x = x; this->y = y; } Complex operator-(const Complex &b) const { return Complex(x - b.x, y - b.y); ...
#include <bits/stdc++.h> using namespace std; inline void read(int& n) { int x = 0, f = 1; char ch = getchar(); while (ch < 0 \|\| ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) x = (x << 1) + (x << 3) + ch - 0 , ch = getchar(); n = x *...
#include <bits/stdc++.h> using namespace std; int main() { int n, m, ans = 0; cin >> n >> m; while (n != m) { if (n < m) { if (m % 2 == 0) m /= 2, ans++; else m++, ans++; } else { ans++; m++; } } cout << ans; }
#include <bits/stdc++.h> using namespace std; int n, m, q; int matrix[52][52]; long long pref[3][52][52]; long long all[2][52][52][52][52]; void precalculate() { for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { for (int k = i; k <= n; k++) { for (int ij = j; ij <= m;...
#include <bits/stdc++.h> using namespace std; int arr[4005]; int nxt[4005], prv[4005]; map<int, int> M; map<int, int> Q; int main() { int n; cin >> n; int ans = 0; for (int i = 0; i < n; ++i) { cin >> arr[i]; if (M.find(arr[i]) != M.end()) { nxt[M[arr[i]]] = i; pr...
#include <bits/stdc++.h> using namespace std; const int b = 3e6; long long a[b]; void ans(long long x, long long y, long long k, long long i) { long long sidl = k + k * y, ans = k; long long ez1 = (sidl - 3 + x) / (x - 1); ans += ez1; a[i] = ans; } int main() { long long t, x, y, k, j; ...
#include <bits/stdc++.h> using namespace std; int test() { long long n; cin >> n; long long cL = 0, cR = 0; long long si = 3 * 100001; long long right = new long long[si], left = new long long[si]; for (long long i = 0; i < si; i++) { right[i] = 0; left[i] = 0; } long l...
#include <bits/stdc++.h> using namespace std; const double EPS = 1e-6; double n, r; bool check(double R) { double x1 = r + R; double y1 = 0; double x2 = cos(2 * acos(-1) / n) * (r + R); double y2 = sin(2 * acos(-1) / n) * (r + R); double len = sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y...
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c; cin >> a; cin >> b; cin >> c; int d = a + b - c; int e = b + c - a; int f = a + c - b; if (d < 0 \|\| e < 0 \|\| f < 0 \|\| e % 2 \|\| d % 2 \|\| f % 2) { cout << Impossible ; return 0; } cout << d / 2...
#include <bits/stdc++.h> using namespace std; struct node { int l, r, num; } a[100005]; int n, ans[100005]; bool cmp(node x, node y) { if (x.l == y.l) return x.r < y.r; return x.l < y.l; } void solve() { cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i].l >> a[i].r; a[i]...
#include <bits/stdc++.h> using namespace std; int main() { long long int n, a, b, c, d, e, f, g, h; cin >> n; vector<long long int> values(n), kalues(n), malues; for (int i = 0; i < n; i++) { cin >> values[i]; cin >> kalues[i]; kalues[i]--; malues.push_back(values[i]); ...
#include <bits/stdc++.h> using namespace std; char s[55]; int l; int df[55][10]; int f(int pos, int c) { if (pos == l) return 1; if (df[pos][c] != -1) return df[pos][c]; int res = 0; int nn = c + s[pos]; res += f(pos + 1, nn / 2); if (nn & 1) res += f(pos + 1, (nn + 1) / 2); return...
#include <bits/stdc++.h> const int INF = 1e9; using namespace std; int R, C, frow, fcol, row, col, srow, scol, nxcol, nxrow; int ans, intest[1005][1005], goal; char grid[1005][1005]; queue<pair<int, int> > q; const int dr[4] = {-1, 0, 1, 0}; const int dc[4] = {0, -1, 0, 1}; bool inside(int r, int c) {...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); for (int i = 0; i < n; i++) cout << a[i] << ; }
#include <bits/stdc++.h> using namespace std; int x, y, z; int _x, _y, _z; int a[6]; long long int ans = 0LL; int main() { ios::sync_with_stdio(false); cin >> x >> y >> z; cin >> _x >> _y >> _z; for (int i = 0; i < 6; i++) cin >> a[i]; if (y < 0) ans += a[0]; if (y > _y) ans += a[1];...
#include <bits/stdc++.h> using namespace std; const int SZ = 8e6 + 10; const int INF = 1e9 + 10; const int mod = 998244353; const long double eps = 1e-8; long long read() { long long n = 0; char a = getchar(); bool flag = 0; while (a > 9 \|\| a < 0 ) { if (a == - ) flag = 1; a ...
#include <bits/stdc++.h> using namespace std; int book[3]; char s[105], rs[105]; int main() { int t, ans, n; scanf( %d , &t); for (int i = 0; i < t; i++) { scanf( %d , &n); ans = 0; memset(rs, 0 , sizeof(rs)); for (int i = 0; i < 3; i++) { scanf( %d , &book[i]); ...
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 5; long long le[N], ri[N], mid, lee, rii; long long a[N], b[N], c[N], mp[35], ans, n, answ, idx, idx1, pw[35], bb; int main() { std::ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); cin >> n; for (int i = 1; i <= n; i++) {...
#include <bits/stdc++.h> using namespace std; int a[20000], num[20000]; int dp[400]; int n, m, t, k, ans, maxm; int main() { scanf( %d%d , &n, &m); maxm = 0; ans = 0; for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); num[a[i]]++; maxm = max(maxm, num[a[i]]); } t = mi...
#include <bits/stdc++.h> const int inf = 1500000000; const int d = 1e9 + 7; using namespace std; struct triple { int a; int b; int c; bool flag; triple() { flag = true; } }; int main() { int n; cin >> n; vector<triple> t(n - 1, triple()); vector<int> adj[n + 1]; for (...
#include <bits/stdc++.h> using namespace std; int k; string s; int main() { cin >> k; cin >> s; int n = s.length(); for (int i = 0; i < n; ++i) { if (s[i] == ? && s[n - i - 1] == ? ) { continue; } else if (s[i] == ? ) { s[i] = s[n - i - 1]; } else if (s[n - ...
#include <bits/stdc++.h> const long double EPS = 1e-10; const long long int MOD = 1000000007ll; const long long int mod1 = 1000000009ll; const long long int mod2 = 1100000009ll; int INF = (int)1e9; long long int INFINF = (long long int)1e18; int debug = 0; long double PI = acos(-1.0); using namespace ...
#include <bits/stdc++.h> using namespace std; template <typename Q> void inin(Q &x) { x = 0; int f = 0; char ch = getchar(); while (ch < 0 \|\| ch > 9 ) { if (ch == - ) f = 1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) x = x * 10 + ch - 0 , ch = getchar(); x = f ? ...
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; const long long sze = 1e5 + 2; const long long inf = 0x3f3f3f3f; void solve() { long long n, k; cin >> n; cin >> k; long long swap = k; long long last = n; long long i = 1; bool turn = true; while (swa...
#include <bits/stdc++.h> using namespace std; int main() { int a, b; vector<pair<int, int> > v, re; scanf( %d %d , &a, &b); v.push_back(make_pair(a, b)); scanf( %d %d , &a, &b); v.push_back(make_pair(a, b)); scanf( %d %d , &a, &b); v.push_back(make_pair(a, b)); sort(v.begin(),...
#include <bits/stdc++.h> using namespace std; int len, pos; void insert(int x) { len++; if (x <= pos) pos++; } void erase(int x) { if (x >= pos) len = x; else len -= x, pos -= x; } int main() { int m, t; scanf( %d%d%d%d , &len, &pos, &m, &t); while (t--) { int...
#include <bits/stdc++.h> using namespace std; using ll = long long; const int sz = 5e5 + 10; int ar[sz]; int main() { int n, ans; while (cin >> n) { for (int i = 0; i < n; i++) cin >> ar[i]; sort(ar, ar + n); ans = n; for (int i = n - 1, j = (n / 2) - 1; j >= 0; j--) { ...
#include <bits/stdc++.h> using namespace std; const int DX[8] = {1, -1, 0, 0, 1, 1, -1, -1}; const int DY[8] = {0, 0, 1, -1, 1, -1, 1, -1}; const int intmax = 0x7fffffff; map<int, int> mp; int main() { int n; scanf( %d , &n); for (int i = 0; i < n; i++) { int a; scanf( %d , &a); ...
#include <bits/stdc++.h> using namespace std; const long double PI = acos(-1); const long double eps = 0.0000000001; const long long INF = 0x3fffffffffffffff; long long a[200005], sum[200005], n, q, x, y; long long lowbit(long long now) { return now & -now; } void add(long long pos, long long v) { whi...
#include <bits/stdc++.h> using namespace std; long long int n, p, q, b, l; long long int gcd(long long int a, long long int c) { if (!c) return a; return gcd(c, a % c); } long long int read_ll() { char ch; long long int num = 0; ch = getchar(); while (!isdigit(ch)) { ch = getchar...
#include <bits/stdc++.h> using namespace std; int main() { int x, y, z; cin >> x >> y >> z; int total = x - y; if (total < 0) { if (total + z < 0) { cout << - ; } else { cout << ? ; } } if (total > 0) { if (total - z > 0) { cout << + ; ...
#include <bits/stdc++.h> using namespace std; int n; int main() { cin >> n; if (n == 1) cout << -1 ; else cout << n << << n + 1 << << n * n + n; return 0; }
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:100000000 ) int n; double l; pair<int, int> mas[1010]; int lst[1010]; double dp[1010]; bool check(double r) { for (int i = 0; i <= n; i++) lst[i] = -1; for (int i = 1; i <= n; i++) dp[i] = -1e15; for (int i = 0; i ...
#include <bits/stdc++.h> using namespace std; const int m = 31; const int maxn = 31; long long n, k; long long f[maxn + 5], g[maxn + 5]; void init() { f[1] = g[1] = 1; for (int i = 2; i <= m; i++) { f[i] = (1LL << i * 2 - 2) + f[i - 1]; g[i] = (1LL << i) - 1 + g[i - 1]; } } int m...
#include <bits/stdc++.h> using namespace std; int main() { string s; int n, m; cin >> n >> m; cin >> s; for (int i = 0; i < m; i++) { int l, r; char c1, c2; scanf( %d %d %c %c , &l, &r, &c1, &c2); for (int j = l - 1; j < r; j++) { if (s[j] == c1) { s[j] ...
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); if (n == 1) { printf( a na nb nb n ); } else if (n == 2) { printf( aa nbb ncc ndd n ); } else if (n == 3) { printf( aab n ); printf( ccb n ); printf( baa n ); printf( bcc n ); ...
#include <bits/stdc++.h> using namespace std; int main() { long long h, n; cin >> h >> n; long long l = 1, r = (1LL << h), ret = 0, cur = 0, dir = 0; while (cur < h) { long long size = (1LL << (h - cur)), mid = (l + r) / 2; if (dir == 0) { if (n <= mid) ++ret, r = mid, ...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx ) template <class T = int> inline T readInt(); inline double readDouble(); inline int readUInt(); inline int readChar(); inline void readWord(char s); inline bool readLine(char s); ...
#include <bits/stdc++.h> using ull = unsigned long long; using ll = long long; using ld = long double; using namespace std; const ll mod = 998244353; int main() { ios::sync_with_stdio(false); cin.tie(NULL); int n, m, k, t; cin >> n >> k >> m >> t; deque<bool> cur(n); cur[k - 1] = 1; ...
#include <bits/stdc++.h> using namespace std; int maze[1500][1500]; pair<int, int> was[1500][1500]; int n, m; int sr, sc; inline int rem(int x, int y) { x %= y; return (x < 0) ? x + y : x; } bool dfs(int r, int c) { int rm = rem(r, n), cm = rem(c, m); if (maze[rm][cm] == 1) { retur...
#include <bits/stdc++.h> using namespace std; int n; struct node { int cnt; node* bit[3]; node() { bit[0] = bit[1] = NULL; cnt = 0; } }; node* root; void Insertt(int x) { node* cur = root; for (int i = 28; i >= 0; --i) { if (cur->bit[(x >> i) & 1] == NULL) cur->bit[...
#include <bits/stdc++.h> using namespace std; long long labs(long long a) { return a < 0 ? (-a) : a; } long long max(long long a, long long b) { return a > b ? a : b; } long long min(long long a, long long b) { return a < b ? a : b; } struct Fenwik { vector<long long> t; long long n; void Init(lon...
#include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 7; const int MAXN = 1e6 + 7; const double EPS = 1e-8; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long n, m; cin >> n >> m; vector<long long> cnt(m, 0); long long d = n % m; for...
#include <bits/stdc++.h> using namespace std; char buffer[200]; int main() { int n; string data; while (scanf( %d , &n) != EOF) { getchar(); for (int i = 0; i < n; i++) { gets(buffer); data = string(buffer); int firstM = data.find( miao. ); int lastL = data....
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const long double PI = 3.1415926535898; const long long LLMAX = LLONG_MAX; int a[(int)2e5 + 5], b[(int)2e5 + 5], c[(int)2e5 + 5]; int n; vector<vector<int> > v((int)2e5 + 5); int type10 = 0; int type01 = 0; long long ans = 0; i...
#include <bits/stdc++.h> using namespace std; long long a, b; int main() { cin >> a >> b; long long ans = (b * (b - 1)) / 2; ans %= 1000000007; ans = (a * ans + ((b * ans) % 1000000007) * ((a * (a + 1) / 2) % 1000000007)) % 1000000007; cout << ans; return 0; }
#include<bits/stdc++.h> using namespace std; #define mp make_pair #define fi first #define se second #define pb push_back #define pf push_front #define ppb pop_back #define ppf pop_front #define sz(v) (v).size() #define all(v) (v).begin(),(v).end() #define REP(i,a,b) for(int (i)=(a);(i)<(b);(i)++)...
#include <bits/stdc++.h> using namespace std; using ll = long long; using vi = vector<int>; using vpi = vector<pair<int, int>>; using pi = pair<int, int>; const int nax = 1e5 + 7; const int mod = 1e9 + 7; const int inf = numeric_limits<int>::max() - (int)9e6; struct monotonic_queue { queue<int> qu...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; int a[20]; long long ans, p[] = {1, 2, 3, 5, 7, 11, 13, 17, 19, 23, 29}, limit = 1e18; void dfs(int num, int len) { if (num == 1) { long long res = 1; for (int i = 1; i <= len; ++i) { for (int j = 1; j < a[i]; ++j) { ...
#include <bits/stdc++.h> using namespace std; int n, m, T; int l[200010], r[200010], s[200010], t[200010], id[200010]; int f[1010][1010]; int ans[200010]; int x[200010], y[200010]; inline int cmp(int x, int y) { return l[x] > l[y]; } int main() { scanf( %d%d%d , &n, &m, &T); for (int i = 1; i <=...
#include <bits/stdc++.h> using namespace std; const long long oo = 0x3f3f3f3f3f3f3f3fLL; struct Edge { int u, v; long long cap[2], flow; }; vector<int> d, act; bool bfs(int s, int t, vector<vector<int>>& adj, vector<Edge>& E, long long lim = 1) { queue<int> Q; d = vector<int>(adj....
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const long long INF = 0x3f3f3f3f3f3f3f3fll; const int maxn = 1000010; const long long mod = 1e9 + 7; char str1[maxn], str2[maxn]; int ans[maxn]; long long L1[maxn], R1[maxn], L2[maxn], R2[maxn]; int main() { while (scanf( %s...
#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); } const int MAXN = 100000; const int MAXQ = 200000; int nq; int qkind[MAXQ], qx[MAXQ], qy[MAXQ], qans[MAXQ]; int n; map<pair<int, int>, int> mp; int px[MAXN], py[MAXN], pl[MAXN], pr[MAXN]; map<lo...
#include <bits/stdc++.h> int main(void) { int i, j, k, m, n, max_length, length; char string[101]; for (n = 0, scanf( %s , string); string[n]; n++) ; for (m = 1, max_length = 0; m < n; m++) { for (i = m - 1; i >= 0; i--) { for (j = i, k = m, length = 0; k && string[j] == string[k];...
#include <bits/stdc++.h> using namespace std; int main() { int K; cin >> K; int sinir = 2 * K * K; int primes[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 27, 31, 37, 39}; set<int> mynums; int i; for (i = 0; i < sizeof(primes) / sizeof(int); i++) { mynums.clear(); int t1 = 1, t2 = 1,...

#include <bits/stdc++.h> using namespace std; pair<char, int> check(string s) { map<char, int> used; int l = s.size(), i, maxVal = 0; char ans; for (i = 0; i < l; i++) { used[s.at(i)]++; if (used[s.at(i)] > maxVal) { maxVal = used[s.at(i)]; ans = s.at(i); } } ...

#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 1; long long a[4], mn = 1e12 + 1; char b, c, d; int main() { cin >> a[0] >> a[1] >> a[2] >> a[3]; cin >> b >> c >> d; sort(a, a + 4); do { long long first, second, temp; if (b == + ) first = a[0] + a[1]; ...

#include <bits/stdc++.h> using namespace std; char s[100010]; typedef struct record { char ch; int po; } rec; int main() { int leng, ans, l, r; rec tmp1, tmp2; int tmp3; bool flag; stack<rec> st; while (~scanf( %s , s)) { flag = false; while (!st.empty()) st.pop(); ...

#include <bits/stdc++.h> #pragma GCC optimize(2) using namespace std; const int INF = 0x3f3f3f3f; const long long inf = 0x3f3f3f3f3f3f3f3f; const int mod = 1e9 + 7; const int maxn = 1e3 + 5; int n, m, qq, s[maxn][maxn], f[maxn][maxn]; bool vis[maxn][maxn]; int a[4] = {0, 1, 0, -1}; int b[4] = {-1, 0...

#include <bits/stdc++.h> using namespace std; int n, m; vector<int> adj[100005]; vector<int> vis(100005, 1); vector<int> ans; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int T = 1; for (int qq = 1; qq <= T; qq++) { cin >> n >> m; for (int i = 0; i < m; i++) { ...

#include <bits/stdc++.h> using namespace std; const long long inf = 1e18 + 1e17; const long long mod = 1e9 + 7; long long modInverse(long long a, long long m) { long long m0 = m; long long y = 0, x = 1; if (m == 1) return 0; while (a > 1) { long long q = a / m; long long t = m; ...

#include <bits/stdc++.h> using namespace std; int freq[27]; char sent[101]; int main() { int n; scanf( %d , &n); scanf( %s , sent); while (n--) { if (isupper(sent[n])) sent[n] = tolower(sent[n]); freq[sent[n] - a ]++; } for (int i = 0; i < 26; i++) if (!freq[i]) { ...

#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; const int INF = 1e9 + 5; int read(int base = 10) { int x = 0; char ch = getchar(); while (!isdigit(ch)) ch = getchar(); while (isdigit(ch)) x = x * base + ch - 0 , ch = getchar(); return x; } struct Node { int num[...

#include <bits/stdc++.h> using namespace std; template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cerr << name << : << arg1 << endl; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, , ); ...

#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; string s; cin >> s; int ans = 0; for (int i = 1; i < n; i++) if (s[i - 1] == . && s[i] == . ) ans++; while (m--) { int k; char c; cin >> k >> c; if (c != s[k - 1]) { ...

#include <bits/stdc++.h> using namespace std; int main() { int me; int bebia; int iliko = 0; int ilarioni = 0; cin >> me; for (int i = 0; i < me; i++) { cin >> bebia; if (bebia > 0) iliko += bebia; if (bebia == -1) { if (iliko - 1 < 0) { ilarioni++; ...

#include <bits/stdc++.h> using namespace std; int main() { int i, j, t; int n; int a[105]; cin >> n; for (i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); int b[105] = {0}; int cnt = 1; for (i = 0; i < n; i++) { for (j = 0; j <= cnt; j++) { if (!b[j]) { b[j...

#include <bits/stdc++.h> using namespace std; int rx[4] = {0, 0, 1, -1}; int ry[4] = {-1, 1, 0, 0}; int main() { int n, k, a, b, u, v; cin >> n >> k; cin >> a >> b >> u >> v; if (k < n + 1 || n == 4) { cout << -1 << endl; return 0; } int ind1, ind2; vector<int> p(n + 1); ...

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

#include <bits/stdc++.h> using namespace std; signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long a, b, c, d; cin >> a >> b >> c >> d; long long sum = a + b + c + d; if (sum % 2 == 0) { if (a + b == sum / 2 || a + c == sum / 2 || a + d == sum / 2 ||...

#include <bits/stdc++.h> using namespace std; int main() { int i, j, r, n, x; cin >> x; r = x % 4; if (r == 0) { cout << 1 << A ; } if (r == 1) { cout << 0 << A ; } if (r == 2) { cout << 1 << B ; } if (r == 3) { ...

#include <bits/stdc++.h> using namespace std; inline bool SR(int &x) { return scanf( %d , &x) == 1; } inline bool SR(long long &x) { return scanf( %lld , &x) == 1; } inline bool SR(double &x) { return scanf( %lf , &x); } inline bool SR(char *s) { return scanf( %s , s); } inline bool RI() { return 1; } tem...

#include <bits/stdc++.h> using namespace std; const int maxN = 50000 + 10; int n; int B[maxN]; vector<pair<int, int>> VB; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d , &B[i]); for (int i = 0; i < n; i++) { VB.push_back(make_pair(B[i] + B[(i + 1) % n], i)); } ...

#include <bits/stdc++.h> using namespace std; int main() { int arr[5001], k = 0; string s, in; stack<int> s1; while (getline(cin, s)) { in = in + s; } for (int i = 0; i < in.size(); i++) { char st[5001] = { 0 }; if (in[i] == < ) { i++; int j = 0; w...

#include <bits/stdc++.h> int main() { int a, b, c; int a1, b1, c1; int s = 0; scanf( %d%d%d%d%d%d , &a, &b, &c, &a1, &b1, &c1); if (a > a1) { s = s + ((a - a1) / 2); } else s = s - (a1 - a); if (b > b1) { s = s + ((b - b1) / 2); } else s = s - (b1 - b); if (...

#include <bits/stdc++.h> using namespace std; int main(int argc, char *argv[]) { int n, tmp = 1, res = 1; cin >> n; int A[n][2]; for (int i = 0; i < n; i++) cin >> A[i][0] >> A[i][1]; for (int i = 0; i < n - 1; i++) { if ((A[i][0] == A[i + 1][0]) && (A[i][1] == A[i + 1][1])) { tmp+...

#include <bits/stdc++.h> using namespace std; unsigned long long int expo_fast(long long int a, long long int b) { a = a; long long int result = 1; while (b) { if (b & 1) result = (result * a); b >>= 1; a = (a * a); } return (result); } void take_in(vector<long long int> *a...

#include <bits/stdc++.h> using namespace std; int n, m, k, l[100100], c[100100]; vector<int> g[100100]; vector<int> s; void dfs(int t) { s.push_back(t); l[t] = s.size(); for (auto v : g[t]) { if (!l[v]) dfs(v); else { if (l[t] - l[v] + 1 >= k) { printf( 2 n%d ...

#include <bits/stdc++.h> using namespace std; vector<int> v[200008]; int val[200008]; int n, tk; int dp[200008]; int lim; int siz[200008]; int cnt, tot; int no[200008]; void dfs(int x, int p) { no[x] = val[x] < lim; dp[x] = 0; int b1 = 0, b2 = 0, b3 = 0; siz[x] = 1; for (int i = ...

#include <bits/stdc++.h> using namespace std; long long int mini(long long int p, long long int q) { if (p < q) return p; return q; } int main() { long long int k2, k3, k5, k6, total = 0; cin >> k2 >> k3 >> k5 >> k6; int m = 0; m = mini(k2, k5); m = mini(m, k6); total = m * 256; ...

#include <bits/stdc++.h> using namespace std; const double PI = 2.0 * acos(0.0); inline int getInt() { int x; scanf( %d , &x); return x; } inline long long getLL() { long long x; scanf( %lld , &x); return x; }; inline int NUM(char c) { return (int)c - 48; } inline char CHR(int n)...

#include <bits/stdc++.h> using namespace std; const int MAX = 1 << 20, KOR = 32000; const long long INF = 1e18; int n; int p[MAX]; int sito[KOR]; int bezp[MAX], sp[MAX]; int cijseg, cijprom; vector<int> Pr; void Eratosten() { for (int i = 2; i < KOR; i++) { if (!sito[i]) { Pr.push_...

#include <bits/stdc++.h> using namespace std; const long long N = 1000006, MOD = 1e9 + 7, INF = 1e16; long long a[N], b, n, m, k, g[105][105], q, x, ans, Ans, pre[N], l, r; string s; pair<int, int> p[N]; int main() { ios_base::sync_with_stdio(false), cin.tie(0); cin >> n >> m; for (int i = 1; i ...

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

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); int n, k; cin >> n >> k; int i = 1; for (i = k - 1; i > 0; i--) { if ((n % i) == 0) break; } if (i == 0) i = 1; int x = (n / i) * k; for (; x % k != i;...

#include <bits/stdc++.h> using namespace std; using ll = long long; const ll INF = 4e18; const int MAXN = 1.1e5; ll T[MAXN]; int main() { ios::sync_with_stdio(0), cin.tie(0); ll N, M, A, D; cin >> N >> M >> A >> D; for (ll i = 0; i < M; i++) { cin >> T[i]; } sort(T, T + M); ...

#include <iostream> #include <cstring> using namespace std; int a[10005],s[10005]; signed main() { int T; cin >> T; while(T--) { int n; cin >> n; memset(s,0,sizeof s); for(int i=1;i<=n;i++) cin >> a[i]; long long ans=0; for(int i=1;i<=n;i++) { an...

#include <bits/stdc++.h> using namespace std; int l[51], r[51], a[51], c[51], dp[51][51][51]; void inline FilterRestrictions(int i, int j, int h, vector<int> &v) { vector<int> u; for (int x : v) { if (r[x] < i || j < l[x] || a[x] >= h) { continue; } u.push_back(x); } v = ...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC optimize( unroll-loops ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native ) using namespace std; template <typename T1, typename T2> void ckmin(T1 &a, T2 b) { if (a > b) a = b; } template <type...

#include <bits/stdc++.h> using namespace std; struct MinMax { int min, max; MinMax() : min(INT_MAX), max(INT_MIN){}; MinMax(int min, int max) : min(min), max(max){}; }; int main(int argc, char const *argv[]) { ios_base::sync_with_stdio(false); int n, m; cin >> n >> m; MinMax a[n]; ...

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

#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; if (n == 0) cout << 1; else { n %= 4; if (n == 0) n = 4; n = pow(8, n); cout << n % 10; } }

#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; vector<double> a(n), b(n); for (int i = 0; i < n; i++) { cin >> a[i]; if (a[i] <= 1) { printf( -1 n ); exit(0); } } for (int i = 0; i < n; i++) { cin >> b[i]; if ...

#include <bits/stdc++.h> using namespace std; using ll = long long; using ull = unsigned long long; const int MAX_N = 1e6 + 5; int fen[MAX_N]; int n; int lowbit(int x) { return x & (-x); } void add(int x, int val) { for (int i = x; i <= n; i += lowbit(i)) fen[i] += val; } int sum(int x) { in...

#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 9; bool p[N]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; vector<int> k; for (int i = 2; i <= 1e6; i++) { if (p[i]) continue; k.push_back(i); for (int j = i + i; j <= 1...

#include <bits/stdc++.h> using namespace std; const int INF = 1000000007; const int N = 100100; int n; int main() { cin >> n; for (int i = n + 1; i <= n + n; i++) cout << i << ; }

#include <bits/stdc++.h> using namespace std; const double EPS = 1e-9; struct DDMY { ostringstream o; template <class T> DDMY &operator,(const T &t) { o << t << , ; return *this; } string operator*() { return o.str().substr(0, o.str().size() - 1); } }; template <class T> std...

#include <bits/stdc++.h> template <class T> inline void read(T &res) { res = 0; bool bo = 0; char c; while (((c = getchar()) < 0 || c > 9 ) && c != - ); if (c == - ) bo = 1; else res = c - 48; while ((c = getchar()) >= 0 && c <= 9 ) res = (res << 3) + (res << 1) + (c - 48); if (bo) r...

#include <bits/stdc++.h> using namespace std; long double pi = 3.141592653589793238462643383279502884197; vector<long long int> v(14); void Compute() { for (long long int i = 1; i < 14; i++) { v[i] = pow(2, i) + v[i - 1]; } } void solve() { long long int n; cin >> n; long long int ...

#include <bits/stdc++.h> using namespace std; const int V = 100000 + 5; int n, num[V]; int main() { int i, j; scanf( %d , &n); for (i = 0; i < n; ++i) scanf( %d , &num[i]); sort(num, num + n); printf( %d , num[n - 1]); for (i = 1; i < n - 1; ++i) printf( %d , num[i]); printf( %d n ...

#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10; const double pi = acos(-1.0); struct Complex { double x, y; Complex(double x = 0.0, double y = 0.0) { this->x = x; this->y = y; } Complex operator-(const Complex &b) const { return Complex(x - b.x, y - b.y); ...

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

#include <bits/stdc++.h> using namespace std; int main() { int n, m, ans = 0; cin >> n >> m; while (n != m) { if (n < m) { if (m % 2 == 0) m /= 2, ans++; else m++, ans++; } else { ans++; m++; } } cout << ans; }

#include <bits/stdc++.h> using namespace std; int n, m, q; int matrix[52][52]; long long pref[3][52][52]; long long all[2][52][52][52][52]; void precalculate() { for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { for (int k = i; k <= n; k++) { for (int ij = j; ij <= m;...

#include <bits/stdc++.h> using namespace std; int arr[4005]; int nxt[4005], prv[4005]; map<int, int> M; map<int, int> Q; int main() { int n; cin >> n; int ans = 0; for (int i = 0; i < n; ++i) { cin >> arr[i]; if (M.find(arr[i]) != M.end()) { nxt[M[arr[i]]] = i; pr...

#include <bits/stdc++.h> using namespace std; const int b = 3e6; long long a[b]; void ans(long long x, long long y, long long k, long long i) { long long sidl = k + k * y, ans = k; long long ez1 = (sidl - 3 + x) / (x - 1); ans += ez1; a[i] = ans; } int main() { long long t, x, y, k, j; ...

#include <bits/stdc++.h> using namespace std; int test() { long long n; cin >> n; long long cL = 0, cR = 0; long long si = 3 * 100001; long long *right = new long long[si], *left = new long long[si]; for (long long i = 0; i < si; i++) { right[i] = 0; left[i] = 0; } long l...

#include <bits/stdc++.h> using namespace std; const double EPS = 1e-6; double n, r; bool check(double R) { double x1 = r + R; double y1 = 0; double x2 = cos(2 * acos(-1) / n) * (r + R); double y2 = sin(2 * acos(-1) / n) * (r + R); double len = sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y...

#include <bits/stdc++.h> using namespace std; int main() { int a, b, c; cin >> a; cin >> b; cin >> c; int d = a + b - c; int e = b + c - a; int f = a + c - b; if (d < 0 || e < 0 || f < 0 || e % 2 || d % 2 || f % 2) { cout << Impossible ; return 0; } cout << d / 2...

#include <bits/stdc++.h> using namespace std; struct node { int l, r, num; } a[100005]; int n, ans[100005]; bool cmp(node x, node y) { if (x.l == y.l) return x.r < y.r; return x.l < y.l; } void solve() { cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i].l >> a[i].r; a[i]...

#include <bits/stdc++.h> using namespace std; int main() { long long int n, a, b, c, d, e, f, g, h; cin >> n; vector<long long int> values(n), kalues(n), malues; for (int i = 0; i < n; i++) { cin >> values[i]; cin >> kalues[i]; kalues[i]--; malues.push_back(values[i]); ...

#include <bits/stdc++.h> using namespace std; char s[55]; int l; int df[55][10]; int f(int pos, int c) { if (pos == l) return 1; if (df[pos][c] != -1) return df[pos][c]; int res = 0; int nn = c + s[pos]; res += f(pos + 1, nn / 2); if (nn & 1) res += f(pos + 1, (nn + 1) / 2); return...

#include <bits/stdc++.h> const int INF = 1e9; using namespace std; int R, C, frow, fcol, row, col, srow, scol, nxcol, nxrow; int ans, intest[1005][1005], goal; char grid[1005][1005]; queue<pair<int, int> > q; const int dr[4] = {-1, 0, 1, 0}; const int dc[4] = {0, -1, 0, 1}; bool inside(int r, int c) {...

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

#include <bits/stdc++.h> using namespace std; int x, y, z; int _x, _y, _z; int a[6]; long long int ans = 0LL; int main() { ios::sync_with_stdio(false); cin >> x >> y >> z; cin >> _x >> _y >> _z; for (int i = 0; i < 6; i++) cin >> a[i]; if (y < 0) ans += a[0]; if (y > _y) ans += a[1];...

#include <bits/stdc++.h> using namespace std; const int SZ = 8e6 + 10; const int INF = 1e9 + 10; const int mod = 998244353; const long double eps = 1e-8; long long read() { long long n = 0; char a = getchar(); bool flag = 0; while (a > 9 || a < 0 ) { if (a == - ) flag = 1; a ...

#include <bits/stdc++.h> using namespace std; int book[3]; char s[105], rs[105]; int main() { int t, ans, n; scanf( %d , &t); for (int i = 0; i < t; i++) { scanf( %d , &n); ans = 0; memset(rs, 0 , sizeof(rs)); for (int i = 0; i < 3; i++) { scanf( %d , &book[i]); ...

#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 5; long long le[N], ri[N], mid, lee, rii; long long a[N], b[N], c[N], mp[35], ans, n, answ, idx, idx1, pw[35], bb; int main() { std::ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); cin >> n; for (int i = 1; i <= n; i++) {...

#include <bits/stdc++.h> using namespace std; int a[20000], num[20000]; int dp[400]; int n, m, t, k, ans, maxm; int main() { scanf( %d%d , &n, &m); maxm = 0; ans = 0; for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); num[a[i]]++; maxm = max(maxm, num[a[i]]); } t = mi...

#include <bits/stdc++.h> const int inf = 1500000000; const int d = 1e9 + 7; using namespace std; struct triple { int a; int b; int c; bool flag; triple() { flag = true; } }; int main() { int n; cin >> n; vector<triple> t(n - 1, triple()); vector<int> adj[n + 1]; for (...

#include <bits/stdc++.h> using namespace std; int k; string s; int main() { cin >> k; cin >> s; int n = s.length(); for (int i = 0; i < n; ++i) { if (s[i] == ? && s[n - i - 1] == ? ) { continue; } else if (s[i] == ? ) { s[i] = s[n - i - 1]; } else if (s[n - ...

#include <bits/stdc++.h> const long double EPS = 1e-10; const long long int MOD = 1000000007ll; const long long int mod1 = 1000000009ll; const long long int mod2 = 1100000009ll; int INF = (int)1e9; long long int INFINF = (long long int)1e18; int debug = 0; long double PI = acos(-1.0); using namespace ...

#include <bits/stdc++.h> using namespace std; template <typename Q> void inin(Q &x) { x = 0; int f = 0; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = 1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) x = x * 10 + ch - 0 , ch = getchar(); x = f ? ...

#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; const long long sze = 1e5 + 2; const long long inf = 0x3f3f3f3f; void solve() { long long n, k; cin >> n; cin >> k; long long swap = k; long long last = n; long long i = 1; bool turn = true; while (swa...

#include <bits/stdc++.h> using namespace std; int main() { int a, b; vector<pair<int, int> > v, re; scanf( %d %d , &a, &b); v.push_back(make_pair(a, b)); scanf( %d %d , &a, &b); v.push_back(make_pair(a, b)); scanf( %d %d , &a, &b); v.push_back(make_pair(a, b)); sort(v.begin(),...

#include <bits/stdc++.h> using namespace std; int len, pos; void insert(int x) { len++; if (x <= pos) pos++; } void erase(int x) { if (x >= pos) len = x; else len -= x, pos -= x; } int main() { int m, t; scanf( %d%d%d%d , &len, &pos, &m, &t); while (t--) { int...

#include <bits/stdc++.h> using namespace std; using ll = long long; const int sz = 5e5 + 10; int ar[sz]; int main() { int n, ans; while (cin >> n) { for (int i = 0; i < n; i++) cin >> ar[i]; sort(ar, ar + n); ans = n; for (int i = n - 1, j = (n / 2) - 1; j >= 0; j--) { ...

#include <bits/stdc++.h> using namespace std; const int DX[8] = {1, -1, 0, 0, 1, 1, -1, -1}; const int DY[8] = {0, 0, 1, -1, 1, -1, 1, -1}; const int intmax = 0x7fffffff; map<int, int> mp; int main() { int n; scanf( %d , &n); for (int i = 0; i < n; i++) { int a; scanf( %d , &a); ...

#include <bits/stdc++.h> using namespace std; const long double PI = acos(-1); const long double eps = 0.0000000001; const long long INF = 0x3fffffffffffffff; long long a[200005], sum[200005], n, q, x, y; long long lowbit(long long now) { return now & -now; } void add(long long pos, long long v) { whi...

#include <bits/stdc++.h> using namespace std; long long int n, p, q, b, l; long long int gcd(long long int a, long long int c) { if (!c) return a; return gcd(c, a % c); } long long int read_ll() { char ch; long long int num = 0; ch = getchar(); while (!isdigit(ch)) { ch = getchar...

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

#include <bits/stdc++.h> using namespace std; int n; int main() { cin >> n; if (n == 1) cout << -1 ; else cout << n << << n + 1 << << n * n + n; return 0; }

#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:100000000 ) int n; double l; pair<int, int> mas[1010]; int lst[1010]; double dp[1010]; bool check(double r) { for (int i = 0; i <= n; i++) lst[i] = -1; for (int i = 1; i <= n; i++) dp[i] = -1e15; for (int i = 0; i ...

#include <bits/stdc++.h> using namespace std; const int m = 31; const int maxn = 31; long long n, k; long long f[maxn + 5], g[maxn + 5]; void init() { f[1] = g[1] = 1; for (int i = 2; i <= m; i++) { f[i] = (1LL << i * 2 - 2) + f[i - 1]; g[i] = (1LL << i) - 1 + g[i - 1]; } } int m...

#include <bits/stdc++.h> using namespace std; int main() { string s; int n, m; cin >> n >> m; cin >> s; for (int i = 0; i < m; i++) { int l, r; char c1, c2; scanf( %d %d %c %c , &l, &r, &c1, &c2); for (int j = l - 1; j < r; j++) { if (s[j] == c1) { s[j] ...

#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); if (n == 1) { printf( a na nb nb n ); } else if (n == 2) { printf( aa nbb ncc ndd n ); } else if (n == 3) { printf( aab n ); printf( ccb n ); printf( baa n ); printf( bcc n ); ...

#include <bits/stdc++.h> using namespace std; int main() { long long h, n; cin >> h >> n; long long l = 1, r = (1LL << h), ret = 0, cur = 0, dir = 0; while (cur < h) { long long size = (1LL << (h - cur)), mid = (l + r) / 2; if (dir == 0) { if (n <= mid) ++ret, r = mid, ...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx ) template <class T = int> inline T readInt(); inline double readDouble(); inline int readUInt(); inline int readChar(); inline void readWord(char *s); inline bool readLine(char *s); ...

#include <bits/stdc++.h> using ull = unsigned long long; using ll = long long; using ld = long double; using namespace std; const ll mod = 998244353; int main() { ios::sync_with_stdio(false); cin.tie(NULL); int n, m, k, t; cin >> n >> k >> m >> t; deque<bool> cur(n); cur[k - 1] = 1; ...

#include <bits/stdc++.h> using namespace std; int maze[1500][1500]; pair<int, int> was[1500][1500]; int n, m; int sr, sc; inline int rem(int x, int y) { x %= y; return (x < 0) ? x + y : x; } bool dfs(int r, int c) { int rm = rem(r, n), cm = rem(c, m); if (maze[rm][cm] == 1) { retur...

#include <bits/stdc++.h> using namespace std; int n; struct node { int cnt; node* bit[3]; node() { bit[0] = bit[1] = NULL; cnt = 0; } }; node* root; void Insertt(int x) { node* cur = root; for (int i = 28; i >= 0; --i) { if (cur->bit[(x >> i) & 1] == NULL) cur->bit[...

#include <bits/stdc++.h> using namespace std; long long labs(long long a) { return a < 0 ? (-a) : a; } long long max(long long a, long long b) { return a > b ? a : b; } long long min(long long a, long long b) { return a < b ? a : b; } struct Fenwik { vector<long long> t; long long n; void Init(lon...

#include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 7; const int MAXN = 1e6 + 7; const double EPS = 1e-8; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long n, m; cin >> n >> m; vector<long long> cnt(m, 0); long long d = n % m; for...

#include <bits/stdc++.h> using namespace std; char buffer[200]; int main() { int n; string data; while (scanf( %d , &n) != EOF) { getchar(); for (int i = 0; i < n; i++) { gets(buffer); data = string(buffer); int firstM = data.find( miao. ); int lastL = data....

#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const long double PI = 3.1415926535898; const long long LLMAX = LLONG_MAX; int a[(int)2e5 + 5], b[(int)2e5 + 5], c[(int)2e5 + 5]; int n; vector<vector<int> > v((int)2e5 + 5); int type10 = 0; int type01 = 0; long long ans = 0; i...

#include <bits/stdc++.h> using namespace std; long long a, b; int main() { cin >> a >> b; long long ans = (b * (b - 1)) / 2; ans %= 1000000007; ans = (a * ans + ((b * ans) % 1000000007) * ((a * (a + 1) / 2) % 1000000007)) % 1000000007; cout << ans; return 0; }

#include<bits/stdc++.h> using namespace std; #define mp make_pair #define fi first #define se second #define pb push_back #define pf push_front #define ppb pop_back #define ppf pop_front #define sz(v) (v).size() #define all(v) (v).begin(),(v).end() #define REP(i,a,b) for(int (i)=(a);(i)<(b);(i)++)...

#include <bits/stdc++.h> using namespace std; using ll = long long; using vi = vector<int>; using vpi = vector<pair<int, int>>; using pi = pair<int, int>; const int nax = 1e5 + 7; const int mod = 1e9 + 7; const int inf = numeric_limits<int>::max() - (int)9e6; struct monotonic_queue { queue<int> qu...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; int a[20]; long long ans, p[] = {1, 2, 3, 5, 7, 11, 13, 17, 19, 23, 29}, limit = 1e18; void dfs(int num, int len) { if (num == 1) { long long res = 1; for (int i = 1; i <= len; ++i) { for (int j = 1; j < a[i]; ++j) { ...

#include <bits/stdc++.h> using namespace std; int n, m, T; int l[200010], r[200010], s[200010], t[200010], id[200010]; int f[1010][1010]; int ans[200010]; int x[200010], y[200010]; inline int cmp(int x, int y) { return l[x] > l[y]; } int main() { scanf( %d%d%d , &n, &m, &T); for (int i = 1; i <=...

#include <bits/stdc++.h> using namespace std; const long long oo = 0x3f3f3f3f3f3f3f3fLL; struct Edge { int u, v; long long cap[2], flow; }; vector<int> d, act; bool bfs(int s, int t, vector<vector<int>>& adj, vector<Edge>& E, long long lim = 1) { queue<int> Q; d = vector<int>(adj....

#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const long long INF = 0x3f3f3f3f3f3f3f3fll; const int maxn = 1000010; const long long mod = 1e9 + 7; char str1[maxn], str2[maxn]; int ans[maxn]; long long L1[maxn], R1[maxn], L2[maxn], R2[maxn]; int main() { while (scanf( %s...

#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); } const int MAXN = 100000; const int MAXQ = 200000; int nq; int qkind[MAXQ], qx[MAXQ], qy[MAXQ], qans[MAXQ]; int n; map<pair<int, int>, int> mp; int px[MAXN], py[MAXN], pl[MAXN], pr[MAXN]; map<lo...

#include <bits/stdc++.h> int main(void) { int i, j, k, m, n, max_length, length; char string[101]; for (n = 0, scanf( %s , string); string[n]; n++) ; for (m = 1, max_length = 0; m < n; m++) { for (i = m - 1; i >= 0; i--) { for (j = i, k = m, length = 0; k && string[j] == string[k];...

#include <bits/stdc++.h> using namespace std; int main() { int K; cin >> K; int sinir = 2 * K * K; int primes[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 27, 31, 37, 39}; set<int> mynums; int i; for (i = 0; i < sizeof(primes) / sizeof(int); i++) { mynums.clear(); int t1 = 1, t2 = 1,...