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; long long ar[1005][1005], br[1005][1005], fr[555]; string s[555]; string s1, s2; int main() { long long i, j, k, m, n, r, c; while (cin >> r >> c) { getchar(); s[0] = ; for (i = 1; i <= r; i++) { getline(cin, s[i]); } ...
#include <bits/stdc++.h> using namespace std; int cnt[27][200010]; int main() { string s; int q, i, j, l, r, c; cin >> s >> q; memset(cnt, 0, sizeof(cnt)); for (i = 0; i < s.length(); i++) { c = s[i] - a ; cnt[c][i + 1]++; for (j = 0; j < 26; j++) cnt[j][i + 1] += cnt[j][i];...
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; bool palindrom = true; for (int i = 0; i < ceil(s.length() / 2.0); i++) { if (s[i] != s[s.length() - 1 - i]) palindrom = false; } if (!palindrom) { cout << s.length() << n ; return 0; } ...
#include <bits/stdc++.h> using namespace std; int n, m, dfn[100010], siz[100010], tim, idfn[100010], a[100010], Q; vector<int> v[100010]; inline int add(int a, int b) { if ((a += b) >= m) a -= m; return a; } void dfs(int np, int fath) { dfn[np] = ++tim; idfn[tim] = np; siz[np] = 1; f...
#include <bits/stdc++.h> using namespace std; struct ppp { int x1, x2, y1, y2; void make_pair(int x1_, int x2_, int y1_, int y2_) { x1 = x1_; x2 = x2_; y1 = y1_; y2 = y2_; } } a[120]; long long ans; int n, m, i, j, k, x, y, l, r, P[220], tot, Pn, u, d; char c[1010][1010];...
#include <bits/stdc++.h> int n, k, s, e, m, ans, temp, tp, tv; bool m11, m22, first, b[100005], move; char a[100005]; int dist() { if (m - s < e - m) return e - m; else return m - s; } int main() { scanf( %d %d , &n, &k); scanf( %s , a); for (e = 0; e < n; e++) { if (a[...
#include <bits/stdc++.h> using namespace std; pair<int, int> temp[102][102]; int ans[102][102]; int main() { int n, m, q; cin >> n >> m >> q; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { temp[i][j].first = i; temp[i][j].second = j; } } while (q--)...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast,no-stack-protector,unroll-loops,fast-math,O3 ) using namespace std; long long powmod(long long a, long long b, long long mod) { if (b == 0 \|\| a == 1) { if (mod == 1) return 0; else return 1; } if (b % 2 == 0) { long...
#include <bits/stdc++.h> using namespace std; const int N = 100005; pair<pair<int, int>, int> queries[N]; long long arr[N], acc[N], in[N]; int main() { int n, m, k; scanf( %d %d %d , &n, &m, &k); for (int i = 0; i < n; ++i) { int x; scanf( %d , &x); in[i] = x; } for (int ...
#include <bits/stdc++.h> using namespace std; const long long N = 1e5 + 5; long long R = 1, n, q, arr[N]; vector<long long> a[N]; long long h[N], p[N][20]; long long cnt = 0, st[N], en[N], pos[2 * N]; long long it[8 * N], lz[8 * N]; void dfs(long long u) { st[u] = ++cnt; pos[cnt] = arr[u]; f...
#include <bits/stdc++.h> using namespace std; int dig[15]; int qpow(int digit) { int a = 2, b = digit, ans = 1; while (b) { if (b & 1) ans = a; a = a; b >>= 1; } return ans; } int getDigit(int x) { int ans = 0; while (x) { x /= 10; ans++; } retur...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast,no-stack-protector,unroll-loops,fast-math ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt,tune=native ) using namespace std; int n, m, k, ct[200010], cnt; vector<pair<int, int> > e[200010]; vector<int> mp[200010]; char bf...
#include <bits/stdc++.h> using namespace std; const int N = 205; template <typename T> inline void read(T &AKNOI) { T x = 0, flag = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) flag = -1; ch = getchar(); } while (isdigit(ch)) { x = x * 10 + ch - 0 ; ...
#include <bits/stdc++.h> #pragma GCC target( avx ) #pragma GCC optimize( O3 ) #pragma GCC optimize( unroll-loops ) using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); long long int A, B, C, D, E, H, W, M, K, L, R, N, X, Y, Z, num = 0, sum = 0, ...
#include <bits/stdc++.h> using namespace std; int main() { long n; while (cin >> n) { long flag = 0, count = 0, a[100005] = {0}, i; for (i = 0; i < n; i++) cin >> a[i]; for (i = n - 1; i > 0; i--) { if (a[i - 1] > a[i]) break; else count++; } ...
#include <bits/stdc++.h> using namespace std; long long a, b; int main() { cin >> a >> b; long long v = (a * (a + 1) / 2) % 1000000007; long long rs = b * (b - 1) / 2; rs %= 1000000007; long long res = 0; for (long long i = 1; i <= a; ++i) res = (res + rs * (i * b % 1000000007 + 1) %...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); int t, x, n; cin >> t; while (t--) { cin >> n; vector<int> v(109, 0); while (n--) { cin >> x; v[x] += 1; } int sum = 0; for (int i = 0; i <...
#include <bits/stdc++.h> using namespace std; const int MAXN = 6010; const int mod = 1000000007; int n; long long k[MAXN], k2[MAXN]; int main() { string asd; string asd2; cin >> asd; cin >> asd2; n = ((int)(asd2.size())); long long res = 0; for (int i = 0; i < ((int)(asd.size()))...
#include <bits/stdc++.h> using namespace std; const int N = 5010; int Case, n, a[N], la[N], fn[N]; int f[N][N]; int main() { scanf( %d , &Case); while (Case--) { scanf( %d , &n); for (int i = 1; i <= n; ++i) fn[i] = 0; for (int i = 1; i <= n; ++i) { scanf( %d , a + i); ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); int tc; cin >> tc; while (tc--) { int n; cin >> n >> ws; string str; cin >> str; int flag = 0, i; for (i = 0; i < str.size() - 1; i++) { ...
#include <bits/stdc++.h> using namespace std; const int nax = 4e5 + 5; int ans[nax]; int b[nax]; int n; bool solve(int bb) { vector<int> a; int val = (1 << (bb)); int val2 = val * 2; int val3 = val * 3; int val4 = val * 4; for (int i = 1; i <= n; i++) { a.push_back(b[i] & ((1 <...
#include <bits/stdc++.h> using namespace std; int main() { long long n, k; cin >> n >> k; long long a[n]; for (int i = 0; i < n; i++) cin >> a[i]; long long ind = 0, xtr = 0; sort(a, a + n); while (ind < n) { for (long long i = ind; i < n; i++) { if (a[i] > 2 * k) { ...
#include <bits/stdc++.h> #pragma GCC optimize( -O3 ) #pragma GCC optimize( Ofast ) #pragma GCC optimize( unroll-loops ) using namespace std; const long long MAXN = 1123456; const long long N = 2e6; const long long inf = 3e18; const long long mod = 998244353; const long long MOD = mod * (mod - 2); mt...
#include <bits/stdc++.h> using namespace std; int main() { char field[8][8]; for (int i = 0; i < 8; i++) { for (int j = 0; j < 8; j++) { cin >> field[i][j]; } } int minDist = 10; for (int j = 0; j < 8; j++) { for (int i = 0; i < 8; i++) { if (field[i][j] == B )...
#include <bits/stdc++.h> using namespace std; const long long MAX = 1e15; int main() { ios_base::sync_with_stdio(0); cin.tie(0); ; int n, k; cin >> n >> k; vector<int> first(n); for (int i = 0; i < n; i++) cin >> first[i]; vector<long long> pr(n + 1); for (int i = 0; i < n; i++...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10; vector<pair<int, bool> > adj[maxn]; vector<pair<pair<int, int>, bool> > edge; int dp[maxn], dis[maxn], par[maxn]; bool mark[maxn], in_path[maxn]; int n, m, ans = 0; void input() { cin >> n >> m; for (int i = 0; i < m; i++) ...
#include <bits/stdc++.h> using namespace std; template <typename T> void read(T &x) { x = 0; char ch = getchar(); long long f = 1; while (!isdigit(ch)) { if (ch == - ) f = -1; ch = getchar(); } while (isdigit(ch)) { x = x 10 + ch - 48; ch = getchar(); } ...
#include <bits/stdc++.h> using namespace std; string s; int cnt; int getdeal(long long c) { int ret = 0; while (c) { ret += c % 10; c /= 10; } return ret; } int main() { ios::sync_with_stdio(false); long long n; cin >> n; long long temp = 0; while (temp * 10 +...
#include <bits/stdc++.h> using namespace std; int mod = 998244353; const int M = 1e6 + 10; const int N = 1e5 + 10; inline long long read() { long long b = 1, sum = 0; char c = getchar(); while (!isdigit(c)) { if (c == - ) b = -1; c = getchar(); } while (isdigit(c)) { sum...
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int maxn = 3e5 + 100; int t, T, n, k; int A[maxn]; int B[maxn]; int main() { ios::sync_with_stdio(false); cin >> T; while (T--) { cin >> n; int sum = 0; for (int i = 1; i <= n; i++) { cin >> ...
#include <bits/stdc++.h> using namespace std; int main() { int n, v, k1 = 0, k2 = 0; int how_many1 = 0; vector<int> molt[99 + 1]; scanf( %d , &n); short b[n << 1]; for (int i = 0; i < (n << 1); i++) { scanf( %d , &v); molt[v].push_back(i); } for (int v = 10; v <= 99; v++)...
#include <bits/stdc++.h> using namespace std; int arr[105][3]; vector<int> vec[105]; bool vis[105]; void dfs(int i) { vis[i] = true; for (int j = 0; j < vec[i].size(); j++) { if (!vis[vec[i][j]]) dfs(vec[i][j]); } return; } int main() { int n, i, cnt = 0, j; cin >> n; for...
#include <bits/stdc++.h> using namespace std; const int kMaxN = 1 + 50; char A[kMaxN][kMaxN], B[kMaxN][kMaxN]; int N, M; int type; void ReadInput() { scanf( %d%d , &N, &M); for (int i = 1; i <= N; i++) { scanf( %s , A[i] + 1); } for (int i = 1; i <= N; i++) { scanf( %s , B[i] + 1...
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int MX = 1e5 + 6; long long l, r; int main() { cin >> l >> r; puts( YES ); for (long long i = l; i <= r; i += 2) cout << i << << i + 1 << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, m, a, b; cin >> n >> m >> a >> b; if (n * a != m * b) { cout << NO << endl; continue; } int index = 0; cout << YES << endl; for (int i = 0; i < n...
#include <bits/stdc++.h> using namespace std; struct dot { string f, s; }; bool cmp(dot x, dot y) {} int main() { int i, j, k, n; int p[100010]; dot A[100010]; cin >> n; for (int(i) = int(1); i <= int(n); i++) { cin >> A[i].f >> A[i].s; } string las = ; for (int(i) ...
#include <bits/stdc++.h> using namespace std; int f[1005][1005], s[1005][1005]; int n, k, a[1005], ans; inline int X(int x) { for (int i = 1; i <= k; i++) for (int j = 1; j <= n; j++) f[i][j] = s[i][j] = 0; for (int i = 1; i <= n; i++) f[1][i] = 1; for (int i = 1; i <= k; i++) { int l = ...
#include <bits/stdc++.h> using namespace std; long long num[30]; int main() { int n, m; long long k; string temp; scanf( %d%I64d , &n, &k); long long cnt = 0; cin >> temp; for (int i = 0; i < n; i++) { num[temp[i] - A + 1]++; } for (int i = 0; i < 26 && k != 0; i++) { ...
#include <bits/stdc++.h> using namespace std; int n; int c[1000010]; int mp[1000]; int in[1000010]; int fir[1000010]; int ans[1000010]; vector<int> v[1000010]; int calc(int nod) { if (c[nod] == 5) return fir[nod] = in[nod]; if (c[nod] == 4) return fir[nod] = 1 - calc(v[nod][0]); int q1 = c...
#include <bits/stdc++.h> using namespace std; int a[1010]; int main() { int n, k; scanf( %d%d , &n, &k); for (int i = 0; i < n; i++) scanf( %d , &a[i]); sort(a, a + n); int ans = 0; for (int i = 0; i < n; i++) { if (a[i] <= k * 2) { k = max(k, a[i]); continue; }...
#include <bits/stdc++.h> using namespace std; char a[1000005], b[1000005], s[1000005]; int k, T, tmp[27], vis[27], p, n, tt[27], vv[27]; bool check(int x, int cas) { memcpy(tt, tmp, sizeof(tt)); memcpy(vv, vis, sizeof(vv)); if (cas == 1) { for (int i = x; i <= n; i++) { if (tt[s[i] - ...
#include <bits/stdc++.h> using namespace std; using std::string; int main() { int n, k; cin >> n >> k; if (n * (n - 1) / 2 > k) { int i = 0, j = 0; while (n--) { cout << i << << j++ << endl; } } else cout << no solution ; }
#include <bits/stdc++.h> int main() { int g[5][5]; int ans = 0; for (int i = 0; i < 5; i++) for (int j = 0; j < 5; j++) scanf( %d , &g[i][j]); for (int i1 = 0; i1 < 5; i1++) { for (int i2 = 0; i2 < 5; i2++) { if (i2 == i1) continue; for (int i3 = 0; i3 < 5; i3++) { ...
#include <bits/stdc++.h> using namespace std; long long n, ans = 1; long long C(long long m, long long n) { long long p = 1; for (long long i = 1; i <= n; i++) p *= i; for (long long i = 1; i <= m; i++) p /= i; for (long long i = 1; i <= n - m; i++) p /= i; return p; } signed main() { ...
#include <bits/stdc++.h> using namespace std; int T[100010], first[100010], canKill[100010], ans = 0; char flag; int X, M, N, fle = 0, A[100010]; int main() { scanf( %d %d , &N, &M); memset(T, 0, sizeof(T)); memset(first, 0, sizeof(first)); memset(canKill, 0, sizeof(canKill)); ans = 0; ...
#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; vector<long long> v(2000000); for (long long i = 0; i < 2000000; i++) v[i] = 0; for (long long i = 0; i < n; i++) { long long t1; cin >> t1; v[t1]++; } long long t = 0; long long l = 1...
#include <bits/stdc++.h> using namespace std; void solve() { int n = 0; cin >> n; string s; vector<vector<int> > v(5, vector<int>(0)); for (int i = 0; i < n; i++) { cin >> s; vector<int> cnt(5, 0); int sum = 0; for (int j = 0; j < s.size(); j++) { cnt[s[j] - a ]+...
#include <bits/stdc++.h> using namespace std; long long read() { char x = getchar(); long long ans = 0, flag = 1; while (!isdigit(x)) if (x == - ) flag = -1, x = getchar(); else x = getchar(); while (isdigit(x)) ans = ans * 10 + x - 0 , x = getchar(); return ans * f...
#include <bits/stdc++.h> using namespace std; using namespace std; ; int n; long long mod = 1000 * 1000 * 1000 + 7; const int maxn = 1000005; int gcd(int a, int b) { if (a == 0) return b; return gcd(b % a, a); } long long d[maxn]; long long cnt[maxn]; long long pow2[maxn]; long long coef...
#include <bits/stdc++.h> using namespace std; int gcd(int x, int y) { if (y == 0) return x; else return gcd(y, x % y); } vector<int> ed[200001]; int an[200001]; int b[200001]; set<int> o[2000001]; void dfs(int x, int g, int p) { int i; if (x == 1) { an[x] = b[1]; ...
#include <bits/stdc++.h> int main() { char arr[200]; int i, j, jp, g, t, cl, jm, a, m, n; scanf( %d%d , &cl, &jm); scanf( %c , &arr[0]); for (i = 1; i <= cl; i++) scanf( %c , &arr[i]); for (i = 1; i <= cl; i++) { if (arr[i] == G ) { g = i; } if (arr[i] == T ) { ...
#include <bits/stdc++.h> using namespace std; double eps = 1e-9; const int INF = 1e9 + 7; const int MAXN = int(2e5 + 7); int n, k, b, ans; long long cur = 1, t; int main() { cin >> k >> b >> n >> t; while (cur <= t) { cur = cur * k + b; n--; } cout << max(0, ++n); return 0;...
#include <bits/stdc++.h> using namespace std; void boost() { ios_base::sync_with_stdio(false); cin.tie(NULL); } const int N = 2e5 + 5; int arr[N], ans[N]; vector<int> adj[N]; vector<int> factor[2][N]; bool avail[N]; void dfs(int u, int p, int d) { if (u != 1) { for (auto x : factor[0...
#include <bits/stdc++.h> using namespace std; int main() { int n, k, g, t; cin >> n >> k; char a[n]; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n; i++) { if (a[i] == G ) g = i; if (a[i] == T ) t = i; } for (int i = 0; i < n; i++) { if (g < t) { ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); string s; cin >> s; int n = s.size(); bool dp[n + 1][8]; memset(dp, false, sizeof(dp)); string ans[8]; for (int i = 1; i < n + 1; i++) { string te...
#include <bits/stdc++.h> using namespace std; int main() { long long int b, l, d; cin >> b >> l >> d; long long int m = b; if (l > m) { m = l; } if (d > m) { m = d; } long long int miss = 0; if (m - 1 - b > 0) { miss += m - 1 - b; } if (m - 1 - l > 0) { ...
#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > a[100500]; int d[100500]; int main() { int n, m, cap; scanf( %d%d%d , &n, &m, &cap); cap--; for (int i = 0; i < (m); i++) { int x, y, w; scanf( %d%d%d , &x, &y, &w); x--, y--; a[x].push_back(pair<int, i...
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using D = double; using uint = unsigned int; template <typename T> using pair2 = pair<T, T>; const int maxn = 300005; bool used[maxn]; int n, k; vector<int> all; int main() { cin >> n >> k; if (k ...
#include <bits/stdc++.h> using namespace std; const int sz = 55; int n, r1, c1, r2, c2, ans = 1000000000; string s[sz]; bool visited[sz][sz]; vector<pair<int, int> > v; void dfs(int x, int y, bool flag) { if (x < 1 \|\| x > n \|\| y < 1 \|\| y > n \|\| s[x][y] == 1 \|\| visited[x][y] == true) { ...
#include <bits/stdc++.h> using namespace std; int main() { string s1, s2, t = ; cin >> s1 >> s2; int n = s1.size(), c = 0, c1 = 0, c2 = 0; for (int i = 0; i < n; i++) { if (s1[i] != s2[i]) c++; } if (c % 2 != 0) cout << impossible << endl; else { c1 = c2 = c / 2; ...
#include <bits/stdc++.h> using namespace std; template <class T> inline void checkMin(T &a, T b) { if (b < a) a = b; } template <class T> inline void checkMax(T &a, T b) { if (a < b) a = b; } template <class T> inline T Min(T a, T b) { return a < b ? a : b; } template <class T> inlin...
#include <bits/stdc++.h> using namespace std; int dp[2][4500005], xl[3005], ans, gd[3005]; void merge(int l, int r) { if (l == r) return; int mid = (l + r) >> 1; merge(l, mid), merge(mid + 1, r); int i = l, j = mid + 1, dq = l; while (i <= mid && j <= r) { if (xl[i] <= xl[j]) gd[...
#include <bits/stdc++.h> int main() { int n, i; while (scanf( %d , &n) != EOF) { printf( %d , n); for (i = 1; i < n; i++) printf( %d , i); printf( n ); } return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 203600; pair<pair<int, int>, int> p[N]; int n; vector<int> ans; int main() { cin >> n; for (int i = (0); i < (int)(n); i++) { cin >> p[i].first.first >> p[i].first.second; p[i].second = i + 1; } sort(p, p + n); for (...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int n, r1 = -1, p1 = -1, p2 = INT_MAX, x, a, b; cin >> n; while (n--) cin >> x, r1 = max(r1, x); cin >> n; while (n--) cin >> x, p1 = max(p1, x); cin >> n; while (n--) cin >> x, p2...
#include <bits/stdc++.h> using namespace std; int a[100005], f[100005], st[100005]; int main() { int n, top = 0; scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d , a + i); for (int i = n - 1; i >= 0; i--) { int t = 0; while (top && a[st[top - 1]] < a[i]) f[i] = t = max(t + 1, f[s...
#include <bits/stdc++.h> using namespace std; map<long long, int> m; map<long long, int>::iterator it; int main() { int n, k, q, a[150001]; cin >> n >> k >> q; for (int i = 1; i <= n; i++) cin >> a[i]; while (q--) { int x, y; cin >> x >> y; if (x == 1) m.insert(make_pai...
#include <bits/stdc++.h> using namespace std; double PI = 3.141592653589793; vector<complex<double> > duzywek; vector<complex<double> > duzyret[50][2]; void szykuj() { for (int j = 0; j < 22; j++) { for (int i = 1; i <= (1 << (21 - j)); i++) { duzyret[j][0].push_back(0); if (j) duzyr...
#include <bits/stdc++.h> using namespace std; map<long long, int> last; int b[1000000]; long long a[100000]; long long d[100][2]; pair<long long, long long> solve(long long x, long long y) { long long xx, yy; pair<long long, long long> ans; if (x == 1) { return make_pair(1, 0); } x...
#include <bits/stdc++.h> using namespace std; struct node { int x, y; bool operator<(const node& a) const { return x < a.x \|\| x == a.x && y < a.y; } }; const int dr[] = {-1, 1, 0, 0, -1, -1, 1, 1}; const int dc[] = {0, 0, -1, 1, -1, 1, -1, 1}; int HH[277]; char s[401000]; int main() { int n,...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { int n, m; cin >> n >> m; bitset<32> b1(n); bitset<32> b2(m + 1); vector<int> a(32), b(32); for (int i = 0; i < 32; i++) a...
#include <bits/stdc++.h> using namespace std; const long long INF = 1e18; const int INFi = 2e9; const int maxN = 1e5 + 5; const int md = 998244353; const int md2 = 1e9 + 7; double getTime() { return clock() / (double)CLOCKS_PER_SEC; }; void solve() { int m, n; cin >> m >> n; vector<pair<int,...
#include <bits/stdc++.h> const int N = 5010; const int M = 1 << 20; const int K = 30; char s[N]; int vis[K]; bool dp[M]; int cnt[K], l[K], r[K]; int main(){ int n, a, b; scanf( %d%d%d , &n, &a, &b); scanf( %s , s); memset(vis, -1, sizeof(vis)); int id = 0; fo...
#include <bits/stdc++.h> using namespace std; int main() { int n, m; char a[55][55]; memset(a, 0, sizeof(a)); scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { cin >> a[i][j]; } } cout << a[1] << endl; int r[55], c[55], rn = 0, c...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 7; int h; int a[N]; int sum[N]; int main() { scanf( %d , &h); for (int i = 0; i <= h; i++) { scanf( %d , &a[i]); sum[i] += sum[i - 1] + a[i]; } bool check = false; int pre = 1; for (int i = 0; i <= h; i++) ...
#include <bits/stdc++.h> using namespace std; int n; int a[100010]; int b[100010]; int main() { cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; b[0] = 1; for (int i = 1; i < n; i++) if (a[i] > a[i - 1]) b[i] = b[i - 1] + 1; else b[i] = 1; int mx = 1; for ...
#include <bits/stdc++.h> using namespace std; const int N = 110; int T, mod = 1e9 + 7, n, k, deep[N], timer, sz; long long ans, fact[N], mem[N][N], vis[N][N]; vector<int> adj[N], v; map<int, int> mp[N]; void _clear() { ans = 0; for (int i = 1; i <= n; i++) adj[i].clear(); } long long po(long l...
#include <bits/stdc++.h> using namespace std; int read() { char c = getchar(); while (c < 0 \|\| c > 9 ) c = getchar(); int x = 0; while (c >= 0 && c <= 9 ) { x = x * 10 + c - 0 ; c = getchar(); } return x; } const int maxn = (1 << 21) + 3; const int INF = 0x3f3f3f3f; ...
#include <bits/stdc++.h> const int MOD = 1000000007; const int SIZE_N = 2000 + 10; int n; int ary[SIZE_N]; int vis[SIZE_N]; int fac[SIZE_N]; int madd(long long a, long long b) { return (a + b) % MOD; } int mmul(long long a, long long b) { return (a * b) % MOD; } int dp[SIZE_N][SIZE_N], v[SIZE_N][SIZE_...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 5; const int M = 1e9 + 7; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; int s, x1, x2, t1, t2, p, d; cin >> s >> x1 >> x2; cin >> t1 >> t2; cin >> p >> d; int ans = t2 * abs...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); int t; cin >> t; while ((t--)) { int n; cin >> n; int arr[n]; int diff[n - 1]; for (int i = 0; i < n; i++) { cin >> arr[i]; } int ctr = 0; int m...
#include <bits/stdc++.h> using namespace std; const long long MAX = 1e9; vector<long long> lucky_nums; void generate_lucky(long long n) { if (n > MAX) return; long long n1 = 10 * n + 4; lucky_nums.push_back(n1); generate_lucky(n1); long long n2 = 10 * n + 7; lucky_nums.push_back(n2); ...
#include <bits/stdc++.h> using namespace std; const int N = 500005; int n, k; char a[N], b[N]; int main() { scanf( %d%d%s%s , &n, &k, a, b); long long cur = 1, ans = 0; if (k == 1) { cout << n << endl; return 0; } for (int i = 0; i < n; i++) { cur *= 2; if (a[i] != ...
#include <bits/stdc++.h> using namespace std; const int INF = (1 << 30) - 1; const long long oo = (1ll << 62) - 1; const long double PI = 3.1415926535898; const int N = 1000000 + 5; int n, m; vector<int> a[N], e[N]; int num[N], low[N], vt[N], dd[N]; int Time = 0, tpltm = 0; stack<int> s; vector<in...
#include <bits/stdc++.h> using namespace std; const int MAX = 505; long long l1[MAX], l2[MAX], r1[MAX], r2[MAX], a1[MAX], a2[MAX]; int main() { ios::sync_with_stdio(0); cin.tie(0); int q; cin >> q; for (int i = 0; i < q; ++i) { cin >> l1[i] >> r1[i] >> l2[i] >> r2[i]; } for (in...
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; const int M = 1000000000; const int INF = 1e18; int a[N], b[N], s1[N], s2[N]; int n, m, k, d, top1, top2, ansr, ansl, sum[N], pos[N], t[N], mn[N]; map<int, int> mp; void reset(int x) { mn[x] = INF; for (int i = (x - 1) * m + 1...
#include <bits/stdc++.h> using namespace std; long long n, p[200005]; int pn; int main() { scanf( %I64d , &n); n *= 2; for (int k = 0; k < 60; ++k) { long long a = (1LL << (k + 1)) - 3; long long l = 0, r = 2000000000; if (a > 1) r = min(r, n / a + 1); while (r - l > 1) { ...
#include <bits/stdc++.h> using namespace std; char s[200010], t[200010]; string ans; void solve() { int n = strlen(s), x = 0; for (int i = 0; i < n; i++) { if (i) ans += + ; if (i < n - 1 && rand() % 2 == 0) { ans += (s[i]), ans += s[++i]; x += 10 * (s[i - 1] - 0 ) + s[i] -...
#include <bits/stdc++.h> namespace fastIO { static const int IN_BUF = 1 << 23, OUT_BUF = 1 << 23; char buf[IN_BUF], ps = buf, pt = buf; inline char my_getchar() { return ps == pt && (pt = (ps = buf) + fread(buf, 1, IN_BUF, stdin), ps == pt) ? EOF : *ps++; } template <type...
#include <bits/stdc++.h> using namespace std; int p[1001][1001], row[1001], col[1001]; int main() { int n, m, k; scanf( %d%d%d , &n, &m, &k); for (int r = 1; r <= n; ++r) row[r] = r; for (int c = 1; c <= m; ++c) col[c] = c; for (int r = 1; r <= n; ++r) for (int c = 1; c <= m; ++c) scanf(...
#include <bits/stdc++.h> using namespace std; bool ok = false, a[5][5]; int u[5]; string p, maxs; int pol(char s) { if (s == A ) return 1; if (s == B ) return 2; if (s == C ) return 3; } string pol2(int s) { if (s == 1) return A ; if (s == 2) return B ; if (s == 3) return C ;...
#include <bits/stdc++.h> using namespace std; unsigned int seed; unsigned int getrand() { seed ^= seed << 13; seed ^= seed >> 17; seed ^= seed << 5; return seed; } int get() { char ch; while (ch = getchar(), (ch < 0 \|\| ch > 9 ) && ch != - ) ; if (ch == - ) { int s ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 69; const int MAXP = 2e6 + 69; int n, q; int val[MAXN]; vector<int> a[MAXN]; int check[MAXP]; vector<int> p; void build() { for (long long i = 2; i < MAXP; i++) { if (check[i] == 0) { p.push_back(i); check[i...
#include <bits/stdc++.h> using namespace std; int main() { int v_1, v_2, v_3, v_m, m_1, m_2, m_3; cin >> v_1 >> v_2 >> v_3 >> v_m; if (v_m >= v_2 \|\| v_m < v_2 && v_m > v_3 && 2 * v_3 < v_m \|\| v_m <= v_3 && 2 * v_m < v_3) { cout << -1; return 0; } cout << 2 * v_1 << n << 2 ...
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int MN = 1000010; int exp(int x, int n) { int ret = 1; while (n) { if (n & 1) ret = 1LL * ret * x % mod; x = 1LL * x * x % mod; n >>= 1; } return ret; } int inv(int x) { return exp(x, mod - 2); } ...
#include <bits/stdc++.h> using namespace std; const long long int inf = 9e18; const long double pi = 2 * acos(0.0); long long int arr[100005]; void solve() { long long int n, k; cin >> n >> k; ; for (int i = 0; i < n; i++) cin >> arr[i]; ; long long int mn = inf, pos = 0; for (long...
#include <bits/stdc++.h> using namespace std; string s; vector<vector<int> > a[28]; vector<int> t, v1, v2; int ans = 1e9; void gen(int ind) { if (ind == 3) { a[t[0] + t[1] + t[2]].push_back(t); return; } for (int i = 0; i <= 9; i++) { t.push_back(i); gen(ind + 1); t...
#include <bits/stdc++.h> using namespace std; struct trie { trie* child[2]; int cnt; trie() { child[0] = child[1] = NULL; cnt = 0; } } * root; int n, k, sum; long long res; void add(int val) { trie* node = root; for (int i = 29; i >= 0; i--) { int j = (val >> i) & 1...
#include <bits/stdc++.h> using namespace std; long long n, k, A[1000100], A2[1000010], N; int main() { cin >> n >> k; for (int i = 1; i <= n; i++) { cin >> A[i]; } N = n; long long cumsum = 0; for (int i = 2, rank = 2; i <= n; i++) { long long cumsum2 = cumsum + (rank - 2) * A2...
#include <bits/stdc++.h> using namespace std; map<int, int> vis; string s[1000009]; int n, m, i; bool dfs(int x, int y) { if (x == n - 1 && y == m - 1) return true; if (x < 0 \|\| y < 0 \|\| x >= n \|\| y >= m \|\| vis[y + x * m] == 1 \|\| s[x][y] == # ) return false; if (x \|\| y) { vis[...

#include <bits/stdc++.h> using namespace std; long long ar[1005][1005], br[1005][1005], fr[555]; string s[555]; string s1, s2; int main() { long long i, j, k, m, n, r, c; while (cin >> r >> c) { getchar(); s[0] = ; for (i = 1; i <= r; i++) { getline(cin, s[i]); } ...

#include <bits/stdc++.h> using namespace std; int cnt[27][200010]; int main() { string s; int q, i, j, l, r, c; cin >> s >> q; memset(cnt, 0, sizeof(cnt)); for (i = 0; i < s.length(); i++) { c = s[i] - a ; cnt[c][i + 1]++; for (j = 0; j < 26; j++) cnt[j][i + 1] += cnt[j][i];...

#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; bool palindrom = true; for (int i = 0; i < ceil(s.length() / 2.0); i++) { if (s[i] != s[s.length() - 1 - i]) palindrom = false; } if (!palindrom) { cout << s.length() << n ; return 0; } ...

#include <bits/stdc++.h> using namespace std; int n, m, dfn[100010], siz[100010], tim, idfn[100010], a[100010], Q; vector<int> v[100010]; inline int add(int a, int b) { if ((a += b) >= m) a -= m; return a; } void dfs(int np, int fath) { dfn[np] = ++tim; idfn[tim] = np; siz[np] = 1; f...

#include <bits/stdc++.h> using namespace std; struct ppp { int x1, x2, y1, y2; void make_pair(int x1_, int x2_, int y1_, int y2_) { x1 = x1_; x2 = x2_; y1 = y1_; y2 = y2_; } } a[120]; long long ans; int n, m, i, j, k, x, y, l, r, P[220], tot, Pn, u, d; char c[1010][1010];...

#include <bits/stdc++.h> int n, k, s, e, m, ans, temp, tp, tv; bool m11, m22, first, b[100005], move; char a[100005]; int dist() { if (m - s < e - m) return e - m; else return m - s; } int main() { scanf( %d %d , &n, &k); scanf( %s , a); for (e = 0; e < n; e++) { if (a[...

#include <bits/stdc++.h> using namespace std; pair<int, int> temp[102][102]; int ans[102][102]; int main() { int n, m, q; cin >> n >> m >> q; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { temp[i][j].first = i; temp[i][j].second = j; } } while (q--)...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast,no-stack-protector,unroll-loops,fast-math,O3 ) using namespace std; long long powmod(long long a, long long b, long long mod) { if (b == 0 || a == 1) { if (mod == 1) return 0; else return 1; } if (b % 2 == 0) { long...

#include <bits/stdc++.h> using namespace std; const int N = 100005; pair<pair<int, int>, int> queries[N]; long long arr[N], acc[N], in[N]; int main() { int n, m, k; scanf( %d %d %d , &n, &m, &k); for (int i = 0; i < n; ++i) { int x; scanf( %d , &x); in[i] = x; } for (int ...

#include <bits/stdc++.h> using namespace std; const long long N = 1e5 + 5; long long R = 1, n, q, arr[N]; vector<long long> a[N]; long long h[N], p[N][20]; long long cnt = 0, st[N], en[N], pos[2 * N]; long long it[8 * N], lz[8 * N]; void dfs(long long u) { st[u] = ++cnt; pos[cnt] = arr[u]; f...

#include <bits/stdc++.h> using namespace std; int dig[15]; int qpow(int digit) { int a = 2, b = digit, ans = 1; while (b) { if (b & 1) ans *= a; a *= a; b >>= 1; } return ans; } int getDigit(int x) { int ans = 0; while (x) { x /= 10; ans++; } retur...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast,no-stack-protector,unroll-loops,fast-math ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt,tune=native ) using namespace std; int n, m, k, ct[200010], cnt; vector<pair<int, int> > e[200010]; vector<int> mp[200010]; char bf...

#include <bits/stdc++.h> using namespace std; const int N = 205; template <typename T> inline void read(T &AKNOI) { T x = 0, flag = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) flag = -1; ch = getchar(); } while (isdigit(ch)) { x = x * 10 + ch - 0 ; ...

#include <bits/stdc++.h> #pragma GCC target( avx ) #pragma GCC optimize( O3 ) #pragma GCC optimize( unroll-loops ) using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); long long int A, B, C, D, E, H, W, M, K, L, R, N, X, Y, Z, num = 0, sum = 0, ...

#include <bits/stdc++.h> using namespace std; int main() { long n; while (cin >> n) { long flag = 0, count = 0, a[100005] = {0}, i; for (i = 0; i < n; i++) cin >> a[i]; for (i = n - 1; i > 0; i--) { if (a[i - 1] > a[i]) break; else count++; } ...

#include <bits/stdc++.h> using namespace std; long long a, b; int main() { cin >> a >> b; long long v = (a * (a + 1) / 2) % 1000000007; long long rs = b * (b - 1) / 2; rs %= 1000000007; long long res = 0; for (long long i = 1; i <= a; ++i) res = (res + rs * (i * b % 1000000007 + 1) %...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); int t, x, n; cin >> t; while (t--) { cin >> n; vector<int> v(109, 0); while (n--) { cin >> x; v[x] += 1; } int sum = 0; for (int i = 0; i <...

#include <bits/stdc++.h> using namespace std; const int MAXN = 6010; const int mod = 1000000007; int n; long long k[MAXN], k2[MAXN]; int main() { string asd; string asd2; cin >> asd; cin >> asd2; n = ((int)(asd2.size())); long long res = 0; for (int i = 0; i < ((int)(asd.size()))...

#include <bits/stdc++.h> using namespace std; const int N = 5010; int Case, n, a[N], la[N], fn[N]; int f[N][N]; int main() { scanf( %d , &Case); while (Case--) { scanf( %d , &n); for (int i = 1; i <= n; ++i) fn[i] = 0; for (int i = 1; i <= n; ++i) { scanf( %d , a + i); ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); int tc; cin >> tc; while (tc--) { int n; cin >> n >> ws; string str; cin >> str; int flag = 0, i; for (i = 0; i < str.size() - 1; i++) { ...

#include <bits/stdc++.h> using namespace std; const int nax = 4e5 + 5; int ans[nax]; int b[nax]; int n; bool solve(int bb) { vector<int> a; int val = (1 << (bb)); int val2 = val * 2; int val3 = val * 3; int val4 = val * 4; for (int i = 1; i <= n; i++) { a.push_back(b[i] & ((1 <...

#include <bits/stdc++.h> using namespace std; int main() { long long n, k; cin >> n >> k; long long a[n]; for (int i = 0; i < n; i++) cin >> a[i]; long long ind = 0, xtr = 0; sort(a, a + n); while (ind < n) { for (long long i = ind; i < n; i++) { if (a[i] > 2 * k) { ...

#include <bits/stdc++.h> #pragma GCC optimize( -O3 ) #pragma GCC optimize( Ofast ) #pragma GCC optimize( unroll-loops ) using namespace std; const long long MAXN = 1123456; const long long N = 2e6; const long long inf = 3e18; const long long mod = 998244353; const long long MOD = mod * (mod - 2); mt...

#include <bits/stdc++.h> using namespace std; int main() { char field[8][8]; for (int i = 0; i < 8; i++) { for (int j = 0; j < 8; j++) { cin >> field[i][j]; } } int minDist = 10; for (int j = 0; j < 8; j++) { for (int i = 0; i < 8; i++) { if (field[i][j] == B )...

#include <bits/stdc++.h> using namespace std; const long long MAX = 1e15; int main() { ios_base::sync_with_stdio(0); cin.tie(0); ; int n, k; cin >> n >> k; vector<int> first(n); for (int i = 0; i < n; i++) cin >> first[i]; vector<long long> pr(n + 1); for (int i = 0; i < n; i++...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10; vector<pair<int, bool> > adj[maxn]; vector<pair<pair<int, int>, bool> > edge; int dp[maxn], dis[maxn], par[maxn]; bool mark[maxn], in_path[maxn]; int n, m, ans = 0; void input() { cin >> n >> m; for (int i = 0; i < m; i++) ...

#include <bits/stdc++.h> using namespace std; template <typename T> void read(T &x) { x = 0; char ch = getchar(); long long f = 1; while (!isdigit(ch)) { if (ch == - ) f *= -1; ch = getchar(); } while (isdigit(ch)) { x = x * 10 + ch - 48; ch = getchar(); } ...

#include <bits/stdc++.h> using namespace std; string s; int cnt; int getdeal(long long c) { int ret = 0; while (c) { ret += c % 10; c /= 10; } return ret; } int main() { ios::sync_with_stdio(false); long long n; cin >> n; long long temp = 0; while (temp * 10 +...

#include <bits/stdc++.h> using namespace std; int mod = 998244353; const int M = 1e6 + 10; const int N = 1e5 + 10; inline long long read() { long long b = 1, sum = 0; char c = getchar(); while (!isdigit(c)) { if (c == - ) b = -1; c = getchar(); } while (isdigit(c)) { sum...

#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int maxn = 3e5 + 100; int t, T, n, k; int A[maxn]; int B[maxn]; int main() { ios::sync_with_stdio(false); cin >> T; while (T--) { cin >> n; int sum = 0; for (int i = 1; i <= n; i++) { cin >> ...

#include <bits/stdc++.h> using namespace std; int main() { int n, v, k1 = 0, k2 = 0; int how_many1 = 0; vector<int> molt[99 + 1]; scanf( %d , &n); short b[n << 1]; for (int i = 0; i < (n << 1); i++) { scanf( %d , &v); molt[v].push_back(i); } for (int v = 10; v <= 99; v++)...

#include <bits/stdc++.h> using namespace std; int arr[105][3]; vector<int> vec[105]; bool vis[105]; void dfs(int i) { vis[i] = true; for (int j = 0; j < vec[i].size(); j++) { if (!vis[vec[i][j]]) dfs(vec[i][j]); } return; } int main() { int n, i, cnt = 0, j; cin >> n; for...

#include <bits/stdc++.h> using namespace std; const int kMaxN = 1 + 50; char A[kMaxN][kMaxN], B[kMaxN][kMaxN]; int N, M; int type; void ReadInput() { scanf( %d%d , &N, &M); for (int i = 1; i <= N; i++) { scanf( %s , A[i] + 1); } for (int i = 1; i <= N; i++) { scanf( %s , B[i] + 1...

#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int MX = 1e5 + 6; long long l, r; int main() { cin >> l >> r; puts( YES ); for (long long i = l; i <= r; i += 2) cout << i << << i + 1 << endl; return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, m, a, b; cin >> n >> m >> a >> b; if (n * a != m * b) { cout << NO << endl; continue; } int index = 0; cout << YES << endl; for (int i = 0; i < n...

#include <bits/stdc++.h> using namespace std; struct dot { string f, s; }; bool cmp(dot x, dot y) {} int main() { int i, j, k, n; int p[100010]; dot A[100010]; cin >> n; for (int(i) = int(1); i <= int(n); i++) { cin >> A[i].f >> A[i].s; } string las = ; for (int(i) ...

#include <bits/stdc++.h> using namespace std; int f[1005][1005], s[1005][1005]; int n, k, a[1005], ans; inline int X(int x) { for (int i = 1; i <= k; i++) for (int j = 1; j <= n; j++) f[i][j] = s[i][j] = 0; for (int i = 1; i <= n; i++) f[1][i] = 1; for (int i = 1; i <= k; i++) { int l = ...

#include <bits/stdc++.h> using namespace std; long long num[30]; int main() { int n, m; long long k; string temp; scanf( %d%I64d , &n, &k); long long cnt = 0; cin >> temp; for (int i = 0; i < n; i++) { num[temp[i] - A + 1]++; } for (int i = 0; i < 26 && k != 0; i++) { ...

#include <bits/stdc++.h> using namespace std; int n; int c[1000010]; int mp[1000]; int in[1000010]; int fir[1000010]; int ans[1000010]; vector<int> v[1000010]; int calc(int nod) { if (c[nod] == 5) return fir[nod] = in[nod]; if (c[nod] == 4) return fir[nod] = 1 - calc(v[nod][0]); int q1 = c...

#include <bits/stdc++.h> using namespace std; int a[1010]; int main() { int n, k; scanf( %d%d , &n, &k); for (int i = 0; i < n; i++) scanf( %d , &a[i]); sort(a, a + n); int ans = 0; for (int i = 0; i < n; i++) { if (a[i] <= k * 2) { k = max(k, a[i]); continue; }...

#include <bits/stdc++.h> using namespace std; char a[1000005], b[1000005], s[1000005]; int k, T, tmp[27], vis[27], p, n, tt[27], vv[27]; bool check(int x, int cas) { memcpy(tt, tmp, sizeof(tt)); memcpy(vv, vis, sizeof(vv)); if (cas == 1) { for (int i = x; i <= n; i++) { if (tt[s[i] - ...

#include <bits/stdc++.h> using namespace std; using std::string; int main() { int n, k; cin >> n >> k; if (n * (n - 1) / 2 > k) { int i = 0, j = 0; while (n--) { cout << i << << j++ << endl; } } else cout << no solution ; }

#include <bits/stdc++.h> int main() { int g[5][5]; int ans = 0; for (int i = 0; i < 5; i++) for (int j = 0; j < 5; j++) scanf( %d , &g[i][j]); for (int i1 = 0; i1 < 5; i1++) { for (int i2 = 0; i2 < 5; i2++) { if (i2 == i1) continue; for (int i3 = 0; i3 < 5; i3++) { ...

#include <bits/stdc++.h> using namespace std; long long n, ans = 1; long long C(long long m, long long n) { long long p = 1; for (long long i = 1; i <= n; i++) p *= i; for (long long i = 1; i <= m; i++) p /= i; for (long long i = 1; i <= n - m; i++) p /= i; return p; } signed main() { ...

#include <bits/stdc++.h> using namespace std; int T[100010], first[100010], canKill[100010], ans = 0; char flag; int X, M, N, fle = 0, A[100010]; int main() { scanf( %d %d , &N, &M); memset(T, 0, sizeof(T)); memset(first, 0, sizeof(first)); memset(canKill, 0, sizeof(canKill)); ans = 0; ...

#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; vector<long long> v(2000000); for (long long i = 0; i < 2000000; i++) v[i] = 0; for (long long i = 0; i < n; i++) { long long t1; cin >> t1; v[t1]++; } long long t = 0; long long l = 1...

#include <bits/stdc++.h> using namespace std; void solve() { int n = 0; cin >> n; string s; vector<vector<int> > v(5, vector<int>(0)); for (int i = 0; i < n; i++) { cin >> s; vector<int> cnt(5, 0); int sum = 0; for (int j = 0; j < s.size(); j++) { cnt[s[j] - a ]+...

#include <bits/stdc++.h> using namespace std; long long read() { char x = getchar(); long long ans = 0, flag = 1; while (!isdigit(x)) if (x == - ) flag = -1, x = getchar(); else x = getchar(); while (isdigit(x)) ans = ans * 10 + x - 0 , x = getchar(); return ans * f...

#include <bits/stdc++.h> using namespace std; using namespace std; ; int n; long long mod = 1000 * 1000 * 1000 + 7; const int maxn = 1000005; int gcd(int a, int b) { if (a == 0) return b; return gcd(b % a, a); } long long d[maxn]; long long cnt[maxn]; long long pow2[maxn]; long long coef...

#include <bits/stdc++.h> using namespace std; int gcd(int x, int y) { if (y == 0) return x; else return gcd(y, x % y); } vector<int> ed[200001]; int an[200001]; int b[200001]; set<int> o[2000001]; void dfs(int x, int g, int p) { int i; if (x == 1) { an[x] = b[1]; ...

#include <bits/stdc++.h> int main() { char arr[200]; int i, j, jp, g, t, cl, jm, a, m, n; scanf( %d%d , &cl, &jm); scanf( %c , &arr[0]); for (i = 1; i <= cl; i++) scanf( %c , &arr[i]); for (i = 1; i <= cl; i++) { if (arr[i] == G ) { g = i; } if (arr[i] == T ) { ...

#include <bits/stdc++.h> using namespace std; double eps = 1e-9; const int INF = 1e9 + 7; const int MAXN = int(2e5 + 7); int n, k, b, ans; long long cur = 1, t; int main() { cin >> k >> b >> n >> t; while (cur <= t) { cur = cur * k + b; n--; } cout << max(0, ++n); return 0;...

#include <bits/stdc++.h> using namespace std; void boost() { ios_base::sync_with_stdio(false); cin.tie(NULL); } const int N = 2e5 + 5; int arr[N], ans[N]; vector<int> adj[N]; vector<int> factor[2][N]; bool avail[N]; void dfs(int u, int p, int d) { if (u != 1) { for (auto x : factor[0...

#include <bits/stdc++.h> using namespace std; int main() { int n, k, g, t; cin >> n >> k; char a[n]; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n; i++) { if (a[i] == G ) g = i; if (a[i] == T ) t = i; } for (int i = 0; i < n; i++) { if (g < t) { ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); string s; cin >> s; int n = s.size(); bool dp[n + 1][8]; memset(dp, false, sizeof(dp)); string ans[8]; for (int i = 1; i < n + 1; i++) { string te...

#include <bits/stdc++.h> using namespace std; int main() { long long int b, l, d; cin >> b >> l >> d; long long int m = b; if (l > m) { m = l; } if (d > m) { m = d; } long long int miss = 0; if (m - 1 - b > 0) { miss += m - 1 - b; } if (m - 1 - l > 0) { ...

#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > a[100500]; int d[100500]; int main() { int n, m, cap; scanf( %d%d%d , &n, &m, &cap); cap--; for (int i = 0; i < (m); i++) { int x, y, w; scanf( %d%d%d , &x, &y, &w); x--, y--; a[x].push_back(pair<int, i...

#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using D = double; using uint = unsigned int; template <typename T> using pair2 = pair<T, T>; const int maxn = 300005; bool used[maxn]; int n, k; vector<int> all; int main() { cin >> n >> k; if (k ...

#include <bits/stdc++.h> using namespace std; const int sz = 55; int n, r1, c1, r2, c2, ans = 1000000000; string s[sz]; bool visited[sz][sz]; vector<pair<int, int> > v; void dfs(int x, int y, bool flag) { if (x < 1 || x > n || y < 1 || y > n || s[x][y] == 1 || visited[x][y] == true) { ...

#include <bits/stdc++.h> using namespace std; int main() { string s1, s2, t = ; cin >> s1 >> s2; int n = s1.size(), c = 0, c1 = 0, c2 = 0; for (int i = 0; i < n; i++) { if (s1[i] != s2[i]) c++; } if (c % 2 != 0) cout << impossible << endl; else { c1 = c2 = c / 2; ...

#include <bits/stdc++.h> using namespace std; template <class T> inline void checkMin(T &a, T b) { if (b < a) a = b; } template <class T> inline void checkMax(T &a, T b) { if (a < b) a = b; } template <class T> inline T Min(T a, T b) { return a < b ? a : b; } template <class T> inlin...

#include <bits/stdc++.h> using namespace std; int dp[2][4500005], xl[3005], ans, gd[3005]; void merge(int l, int r) { if (l == r) return; int mid = (l + r) >> 1; merge(l, mid), merge(mid + 1, r); int i = l, j = mid + 1, dq = l; while (i <= mid && j <= r) { if (xl[i] <= xl[j]) gd[...

#include <bits/stdc++.h> int main() { int n, i; while (scanf( %d , &n) != EOF) { printf( %d , n); for (i = 1; i < n; i++) printf( %d , i); printf( n ); } return 0; }

#include <bits/stdc++.h> using namespace std; const int N = 203600; pair<pair<int, int>, int> p[N]; int n; vector<int> ans; int main() { cin >> n; for (int i = (0); i < (int)(n); i++) { cin >> p[i].first.first >> p[i].first.second; p[i].second = i + 1; } sort(p, p + n); for (...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int n, r1 = -1, p1 = -1, p2 = INT_MAX, x, a, b; cin >> n; while (n--) cin >> x, r1 = max(r1, x); cin >> n; while (n--) cin >> x, p1 = max(p1, x); cin >> n; while (n--) cin >> x, p2...

#include <bits/stdc++.h> using namespace std; int a[100005], f[100005], st[100005]; int main() { int n, top = 0; scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d , a + i); for (int i = n - 1; i >= 0; i--) { int t = 0; while (top && a[st[top - 1]] < a[i]) f[i] = t = max(t + 1, f[s...

#include <bits/stdc++.h> using namespace std; map<long long, int> m; map<long long, int>::iterator it; int main() { int n, k, q, a[150001]; cin >> n >> k >> q; for (int i = 1; i <= n; i++) cin >> a[i]; while (q--) { int x, y; cin >> x >> y; if (x == 1) m.insert(make_pai...

#include <bits/stdc++.h> using namespace std; double PI = 3.141592653589793; vector<complex<double> > duzywek; vector<complex<double> > duzyret[50][2]; void szykuj() { for (int j = 0; j < 22; j++) { for (int i = 1; i <= (1 << (21 - j)); i++) { duzyret[j][0].push_back(0); if (j) duzyr...

#include <bits/stdc++.h> using namespace std; map<long long, int> last; int b[1000000]; long long a[100000]; long long d[100][2]; pair<long long, long long> solve(long long x, long long y) { long long xx, yy; pair<long long, long long> ans; if (x == 1) { return make_pair(1, 0); } x...

#include <bits/stdc++.h> using namespace std; struct node { int x, y; bool operator<(const node& a) const { return x < a.x || x == a.x && y < a.y; } }; const int dr[] = {-1, 1, 0, 0, -1, -1, 1, 1}; const int dc[] = {0, 0, -1, 1, -1, 1, -1, 1}; int HH[277]; char s[401000]; int main() { int n,...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { int n, m; cin >> n >> m; bitset<32> b1(n); bitset<32> b2(m + 1); vector<int> a(32), b(32); for (int i = 0; i < 32; i++) a...

#include <bits/stdc++.h> using namespace std; const long long INF = 1e18; const int INFi = 2e9; const int maxN = 1e5 + 5; const int md = 998244353; const int md2 = 1e9 + 7; double getTime() { return clock() / (double)CLOCKS_PER_SEC; }; void solve() { int m, n; cin >> m >> n; vector<pair<int,...

#include <bits/stdc++.h> const int N = 5010; const int M = 1 << 20; const int K = 30; char s[N]; int vis[K]; bool dp[M]; int cnt[K], l[K], r[K]; int main(){ int n, a, b; scanf( %d%d%d , &n, &a, &b); scanf( %s , s); memset(vis, -1, sizeof(vis)); int id = 0; fo...

#include <bits/stdc++.h> using namespace std; int main() { int n, m; char a[55][55]; memset(a, 0, sizeof(a)); scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { cin >> a[i][j]; } } cout << a[1] << endl; int r[55], c[55], rn = 0, c...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 7; int h; int a[N]; int sum[N]; int main() { scanf( %d , &h); for (int i = 0; i <= h; i++) { scanf( %d , &a[i]); sum[i] += sum[i - 1] + a[i]; } bool check = false; int pre = 1; for (int i = 0; i <= h; i++) ...

#include <bits/stdc++.h> using namespace std; int n; int a[100010]; int b[100010]; int main() { cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; b[0] = 1; for (int i = 1; i < n; i++) if (a[i] > a[i - 1]) b[i] = b[i - 1] + 1; else b[i] = 1; int mx = 1; for ...

#include <bits/stdc++.h> using namespace std; const int N = 110; int T, mod = 1e9 + 7, n, k, deep[N], timer, sz; long long ans, fact[N], mem[N][N], vis[N][N]; vector<int> adj[N], v; map<int, int> mp[N]; void _clear() { ans = 0; for (int i = 1; i <= n; i++) adj[i].clear(); } long long po(long l...

#include <bits/stdc++.h> using namespace std; int read() { char c = getchar(); while (c < 0 || c > 9 ) c = getchar(); int x = 0; while (c >= 0 && c <= 9 ) { x = x * 10 + c - 0 ; c = getchar(); } return x; } const int maxn = (1 << 21) + 3; const int INF = 0x3f3f3f3f; ...

#include <bits/stdc++.h> const int MOD = 1000000007; const int SIZE_N = 2000 + 10; int n; int ary[SIZE_N]; int vis[SIZE_N]; int fac[SIZE_N]; int madd(long long a, long long b) { return (a + b) % MOD; } int mmul(long long a, long long b) { return (a * b) % MOD; } int dp[SIZE_N][SIZE_N], v[SIZE_N][SIZE_...

#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 5; const int M = 1e9 + 7; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; int s, x1, x2, t1, t2, p, d; cin >> s >> x1 >> x2; cin >> t1 >> t2; cin >> p >> d; int ans = t2 * abs...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); int t; cin >> t; while ((t--)) { int n; cin >> n; int arr[n]; int diff[n - 1]; for (int i = 0; i < n; i++) { cin >> arr[i]; } int ctr = 0; int m...

#include <bits/stdc++.h> using namespace std; const long long MAX = 1e9; vector<long long> lucky_nums; void generate_lucky(long long n) { if (n > MAX) return; long long n1 = 10 * n + 4; lucky_nums.push_back(n1); generate_lucky(n1); long long n2 = 10 * n + 7; lucky_nums.push_back(n2); ...

#include <bits/stdc++.h> using namespace std; const int N = 500005; int n, k; char a[N], b[N]; int main() { scanf( %d%d%s%s , &n, &k, a, b); long long cur = 1, ans = 0; if (k == 1) { cout << n << endl; return 0; } for (int i = 0; i < n; i++) { cur *= 2; if (a[i] != ...

#include <bits/stdc++.h> using namespace std; const int INF = (1 << 30) - 1; const long long oo = (1ll << 62) - 1; const long double PI = 3.1415926535898; const int N = 1000000 + 5; int n, m; vector<int> a[N], e[N]; int num[N], low[N], vt[N], dd[N]; int Time = 0, tpltm = 0; stack<int> s; vector<in...

#include <bits/stdc++.h> using namespace std; const int MAX = 505; long long l1[MAX], l2[MAX], r1[MAX], r2[MAX], a1[MAX], a2[MAX]; int main() { ios::sync_with_stdio(0); cin.tie(0); int q; cin >> q; for (int i = 0; i < q; ++i) { cin >> l1[i] >> r1[i] >> l2[i] >> r2[i]; } for (in...

#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; const int M = 1000000000; const int INF = 1e18; int a[N], b[N], s1[N], s2[N]; int n, m, k, d, top1, top2, ansr, ansl, sum[N], pos[N], t[N], mn[N]; map<int, int> mp; void reset(int x) { mn[x] = INF; for (int i = (x - 1) * m + 1...

#include <bits/stdc++.h> using namespace std; long long n, p[200005]; int pn; int main() { scanf( %I64d , &n); n *= 2; for (int k = 0; k < 60; ++k) { long long a = (1LL << (k + 1)) - 3; long long l = 0, r = 2000000000; if (a > 1) r = min(r, n / a + 1); while (r - l > 1) { ...

#include <bits/stdc++.h> using namespace std; char s[200010], t[200010]; string ans; void solve() { int n = strlen(s), x = 0; for (int i = 0; i < n; i++) { if (i) ans += + ; if (i < n - 1 && rand() % 2 == 0) { ans += (s[i]), ans += s[++i]; x += 10 * (s[i - 1] - 0 ) + s[i] -...

#include <bits/stdc++.h> namespace fastIO { static const int IN_BUF = 1 << 23, OUT_BUF = 1 << 23; char buf[IN_BUF], *ps = buf, *pt = buf; inline char my_getchar() { return ps == pt && (pt = (ps = buf) + fread(buf, 1, IN_BUF, stdin), ps == pt) ? EOF : *ps++; } template <type...

#include <bits/stdc++.h> using namespace std; int p[1001][1001], row[1001], col[1001]; int main() { int n, m, k; scanf( %d%d%d , &n, &m, &k); for (int r = 1; r <= n; ++r) row[r] = r; for (int c = 1; c <= m; ++c) col[c] = c; for (int r = 1; r <= n; ++r) for (int c = 1; c <= m; ++c) scanf(...

#include <bits/stdc++.h> using namespace std; bool ok = false, a[5][5]; int u[5]; string p, maxs; int pol(char s) { if (s == A ) return 1; if (s == B ) return 2; if (s == C ) return 3; } string pol2(int s) { if (s == 1) return A ; if (s == 2) return B ; if (s == 3) return C ;...

#include <bits/stdc++.h> using namespace std; unsigned int seed; unsigned int getrand() { seed ^= seed << 13; seed ^= seed >> 17; seed ^= seed << 5; return seed; } int get() { char ch; while (ch = getchar(), (ch < 0 || ch > 9 ) && ch != - ) ; if (ch == - ) { int s ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 69; const int MAXP = 2e6 + 69; int n, q; int val[MAXN]; vector<int> a[MAXN]; int check[MAXP]; vector<int> p; void build() { for (long long i = 2; i < MAXP; i++) { if (check[i] == 0) { p.push_back(i); check[i...

#include <bits/stdc++.h> using namespace std; int main() { int v_1, v_2, v_3, v_m, m_1, m_2, m_3; cin >> v_1 >> v_2 >> v_3 >> v_m; if (v_m >= v_2 || v_m < v_2 && v_m > v_3 && 2 * v_3 < v_m || v_m <= v_3 && 2 * v_m < v_3) { cout << -1; return 0; } cout << 2 * v_1 << n << 2 ...

#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int MN = 1000010; int exp(int x, int n) { int ret = 1; while (n) { if (n & 1) ret = 1LL * ret * x % mod; x = 1LL * x * x % mod; n >>= 1; } return ret; } int inv(int x) { return exp(x, mod - 2); } ...

#include <bits/stdc++.h> using namespace std; const long long int inf = 9e18; const long double pi = 2 * acos(0.0); long long int arr[100005]; void solve() { long long int n, k; cin >> n >> k; ; for (int i = 0; i < n; i++) cin >> arr[i]; ; long long int mn = inf, pos = 0; for (long...

#include <bits/stdc++.h> using namespace std; string s; vector<vector<int> > a[28]; vector<int> t, v1, v2; int ans = 1e9; void gen(int ind) { if (ind == 3) { a[t[0] + t[1] + t[2]].push_back(t); return; } for (int i = 0; i <= 9; i++) { t.push_back(i); gen(ind + 1); t...

#include <bits/stdc++.h> using namespace std; struct trie { trie* child[2]; int cnt; trie() { child[0] = child[1] = NULL; cnt = 0; } } * root; int n, k, sum; long long res; void add(int val) { trie* node = root; for (int i = 29; i >= 0; i--) { int j = (val >> i) & 1...

#include <bits/stdc++.h> using namespace std; long long n, k, A[1000100], A2[1000010], N; int main() { cin >> n >> k; for (int i = 1; i <= n; i++) { cin >> A[i]; } N = n; long long cumsum = 0; for (int i = 2, rank = 2; i <= n; i++) { long long cumsum2 = cumsum + (rank - 2) * A2...

#include <bits/stdc++.h> using namespace std; map<int, int> vis; string s[1000009]; int n, m, i; bool dfs(int x, int y) { if (x == n - 1 && y == m - 1) return true; if (x < 0 || y < 0 || x >= n || y >= m || vis[y + x * m] == 1 || s[x][y] == # ) return false; if (x || y) { vis[...