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

func_code_string stringlengths 59 71.4k
#include <bits/stdc++.h> using namespace std; int ask(string s) { cout << ? << s << endl; fflush(stdout); int x; cin >> x; return x; } int main() { int n; scanf( %d , &n); string s(n, 0 ); int c = ask(s); s[0] = 1 ; int a0; int d = ask(s); int pos1 = -1, ...
#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007; long long dp[100005][2]; string a, b; int main() { int K; while (cin >> a >> b) { cin >> K; memset(dp, 0, sizeof(dp)); if (a == b) dp[0][1] = 1; else dp[0][0] = 1; int cnt = 0,...
#include <bits/stdc++.h> using namespace std; vector<int> g[100010]; int us[100010], w[3][100010], z1, z2, dooc; void dfs(int v, int in = 1) { us[v] = in; for (int i = 0; i < g[v].size(); i++) if (us[g[v][i]] == 0) { dfs(g[v][i], (in == 1 ? 2 : 1)); } else if (us[g[v][i]] == in) { ...
#include <bits/stdc++.h> using namespace std; int main() { int r = 0, u = 0; string s; cin >> s; for (int i = 0; i < s.size(); i++) { if (s[i] == L ) r--; else if (s[i] == R ) r++; else if (s[i] == U ) u++; else if (s[i] == D ) u--; } ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1005, MAXM = 3e4 + 5; int N, M, s, t; int cost[MAXM], low[MAXN], disc[MAXN]; bool vis[MAXN]; vector<int> edges, bridge, ANS; vector<pair<int, int> > adj[MAXN]; void read() { scanf( %d %d , &N, &M); scanf( %d %d , &s, &t); for (in...
#include <bits/stdc++.h> using namespace std; long long M; const int N_MAX = 2; template <class T> void mul(int n, const T A[N_MAX][N_MAX], const T x[N_MAX], T y[N_MAX]) { static T z[N_MAX]; for (int i = 0; i < (n); i++) { z[i] = 0; for (int j = 0; j < (n); j++) z[i] = (z[i] + A[i][j] * x[...
#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; map<long long, long long> mp; int main() { ios_base::sync_with_stdio(false); cin.tie(0); long long n, m; cin >> n; vector<long long> v(n); for (int i = 0; i < n; ++i) { cin >> v[i]; if (mp.find(v[i]) ==...
#include <bits/stdc++.h> using namespace std; const int maxn = 2e6 + 5; const int mod = 1e9 + 7; int n, k; long long a[maxn]; template <class T> inline void read(T &res) { res = 0; T f = 1; char c = getchar(); while (c < 0 \|\| c > 9 ) { if (c == - ) f = -1; c = getchar(); ...
#include <bits/stdc++.h> using namespace std; struct Problem { long long as, at, bs, bt; double pr; } a[2000]; const long long P = (long long)1e6; int n, m; long long fail[1001]; long long f[1001][1600]; double g[1001][1600]; bool cmp(Problem u, Problem v) { return u.bt * u.pr * (1 - v.pr)...
#include <bits/stdc++.h> using namespace std; const int MAXN = 300; const double eps = 1e-9; int px[MAXN], py[MAXN]; int ans[1000100]; int n, m; int main() { while (scanf( %d%d , &n, &m) != EOF) { for (int i = 0; i < m; ++i) scanf( %d%d , px + i, py + i); memset(ans, 0, sizeof(ans)); ...
#include <bits/stdc++.h> template <typename tp> inline tp max(tp x, tp y) { return x > y ? x : y; } template <typename tp> inline tp min(tp x, tp y) { return x < y ? x : y; } template <typename tp> inline bool chkmax(tp& x, tp y) { return (x >= y) ? false : (x = y, true); } template <typ...
#include <bits/stdc++.h> using namespace std; int n, p, t[100100], tree[100100]; queue<int> q; set<int> waiting; long long curT, ans[100100]; int get(int x) { for (int i = x; i; i -= i & -i) if (tree[i]) return 1; return 0; } void add(int x, int v) { for (int i = x; i <= 100000; i += i...
#include <bits/stdc++.h> using namespace std; long long n, m, i, j, ans, tmp, t, curr, x, r, sm, k, l; long long arr[1000005], res[1000005], par1[1000005], par2[1000005]; string s; vector<long long> vec[1000005]; void dfs(long long idx, long long par, long long col) { if (col != arr[idx]) { ans++;...
#include <bits/stdc++.h> using namespace std; int n, m, k, x, y, z, last[500039][2], a[500039], s[500039], ans; long long q[500039]; inline void swap(int &x, int &y) { x ^= y ^= x ^= y; } inline void check(int x, int y) { if (y - x < 2 \|\| !x) return; if (q[y - 1] - q[x] == (a[y] ^ a[x])) ans++; } ...
#include <bits/stdc++.h> using namespace std; string employees; queue<int> d, r; int main() { int n; cin >> n >> employees; for (int i = 0; i < n; i++) { if (employees[i] == D ) d.push(i); else r.push(i); } while (!d.empty() && !r.empty()) { int idx_d = d.f...
#include <bits/stdc++.h> using namespace std; int n; int main() { cin >> n; if (n == 1 \|\| n == 4 \|\| n == 6 \|\| n == 8 \|\| n == 9 \|\| n == 10 \|\| n == 13 \|\| n == 15) { cout << 1 ; return 0; } cout << 0 ; return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 1000050; const int inf = 0x3f3f3f3f; const int mod = 1e9 + 7; int a[maxn], b[maxn], mi, ans1, ans2, ans3, ans, l, r; vector<int> v; char s[maxn]; void pa(int s, int e) { ans2 = 0; for (int i = s; i < e; i++) if (a[i] == mi + 1)...
#include <bits/stdc++.h> using namespace std; int arr[104]; int main() { int n, avg, mn, flag; cin >> n; for (int i = 0; i < n; i++) { cin >> arr[i]; } avg = 0; avg = arr[1] - arr[0]; flag = 0; for (int i = 1; i < n; i++) { int diff = (arr[i] - arr[i - 1]); if (di...
#include <bits/stdc++.h> using namespace std; struct Edge { int64_t v, f, c; Edge(int64_t v, int64_t f, int64_t c) : v(v), f(f), c(c) {} int64_t get_capacity() { return c - f; } }; const int64_t INF = (int64_t)(1e9) + 666; const int64_t N = 10000; const int64_t S = N - 2; const int64_t T = N -...
#include <bits/stdc++.h> using namespace std; const int pri[26] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, -1}; const long long mo[5] = {223092870ll, 2756205443ll, 907383479ll, 42600829ll, 97ll}; long l...
#include <bits/stdc++.h> using namespace std; int x[1000] = {4, 1, 1, 1, 2, 2, 2, 3, 3, 3}; int y[1000] = {2, 1, 2, 3, 1, 2, 3, 1, 2, 3}; int X[1005], Y[1005]; int main(int argc, char** argv) { int n; string a; cin >> n >> a; int mnx = 1e9, mny = 1e9, mxx = 0, mxy = 0; for (int i = 1; i < ...
#include <bits/stdc++.h> using namespace std; std::ostream& operator<<(std::ostream& os, pair<int, int> p) { os << p.first << , << p.second; return os; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { long long int l, r; ci...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); int n; cin >> n; string s; cin >> s; int cnt = 0; for (int i = 0; i < n; i++) { int up = 0, le = 0; for (int j = i; j < n; j++) { if (s[j] == U ) up++; if (s[j] == D ) u...
#include <bits/stdc++.h> using namespace std; long long n, k, i, j; int main() { cin >> n >> k; if (2 * k >= n) { cout << -1; return 0; } cout << n * k << endl; for (i = 1; i <= n; i++) for (j = 0; j < k; j++) cout << i << << (i + j) % n + 1 << n ; }
#include <bits/stdc++.h> using namespace std; long long int bt[50 + 10]; map<int, int> MAP; int main() { long long int a, b, c, d, e, f, m, n, p, q, x, y, z, w, k; vector<long long int> v[2525], temp; cin >> n >> k; for (int i = 1; i <= n; i++) { cin >> x; bt[i] = x; temp.push_...
#include <bits/stdc++.h> using namespace std; int main() { int ts = 1, cs = 1; cin >> ts; while (ts--) { int n, m; cin >> n >> m; pair<int, int> vec[m + 2]; for (int i = 1; i <= m; i++) { cin >> vec[i].first; vec[i].second = i; } sort(vec + 1, vec + m ...
#include <bits/stdc++.h> using namespace std; int main() { int num, i, count = 0, sum = 0, a; cin >> num; a = 1; while (1) { for (i = 1; i <= a; i++) { sum += i; } a++; if (sum > num) break; count++; } cout << count << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const long long base = 139; const long long M = 1000012309; long long p[200007]; vector<pair<long long, char> > vp1; vector<pair<long long, char> > vp2; long long hashtable[200007], hv, cnt = 0; void pcal() { p[0] = 1; for (long long i = 1; i < 20000...
#include <bits/stdc++.h> using namespace std; template <class T> inline T sqr(T x) { return x * x; } const double EPS = 1e-9; const int INF = 1000 * 1000 * 1000; const long long LINF = INF * 1ll * INF; const double DINF = 1e200; const double PI = 3.1415926535897932384626433832795l; int gcd(int a...
#include <bits/stdc++.h> using namespace std; int n, tmp; vector<int> nPos; vector<int> NegPos, ZeroPos; int minNeg = -1000000001, minNegPos = -1; int main() { scanf( %d n , &n); for (int i = 0; i < n; i++) { scanf( %d , &tmp); nPos.push_back(tmp); } for (int i = 0; i < n; i++) {...
#include <bits/stdc++.h> using namespace std; int m = 1000000 + 3; int db[1010]; int twospows[1010]; long long mpow(int b, int e) { if (e == 0) return 1; if (e == 1) return b; return (mpow(b, e / 2) % m) * (mpow(b, e - e / 2) % m) % m; } long long twopow(int e) { if (twospows[e] != -1) ret...
#include <bits/stdc++.h> using namespace std; int main() { int n, m, i, k; cin >> n >> m; if (n < m) { cout << -1; return 0; } k = n / 2; if (n % 2) k++; for (i = k;; i++) { if (i % m == 0) break; } cout << i; return 0; }
#include <bits/stdc++.h> using namespace std; template <typename T> inline void read(T& x) { x = 0; char c; while (!isdigit(c = getchar())) ; do { x = x * 10 + c - 0 ; } while (isdigit(c = getchar())); } template <typename T> inline void write(T x) { if (x > 9) write(x /...
#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); const int MOD = 1e9 + 7; vector<int> check(int n, vector<int> a, int x) { multiset<int> as; for (auto u : a) { as.insert(u); } vector<int> res; for (int i = 0; i < n; ++i)...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); int n; cin >> n; int a[n][n]; int dp[2][n][n]; for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) cin >> a[i][j]; for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) for (int ...
#include <bits/stdc++.h> using namespace std; const int N = 501; int n, m, K, px[N], py[N]; bool check(int k) { vector<int> cx, cy; cx.push_back(1), cx.push_back(n), cx.push_back(n + 1), cy.push_back(1), cy.push_back(m), cy.push_back(m + 1); for (int i = 0; i < K; i++) { cx.push_back(m...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma ) #pragma GCC optimize( unroll-loops ) using namespace std; int n, k, t, a, b; long long w, z, x[3008], y[3008]; int main() { for (ios::sync_with_stdio(0), cin.tie(0), cin >>...
#include <bits/stdc++.h> using namespace std; int main() { unsigned long long int n, sum = 0, pos = 0, ans1 = 0, ans2 = 0; cin >> n; vector<unsigned long long int> vect; vect.resize(n); for (unsigned long long int i = 0; i < n; i++) { cin >> vect[i]; sum += vect[i]; } if (sum...
#include <bits/stdc++.h> using namespace std; void karem() { ios::sync_with_stdio(0); ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } int main() { karem(); int n, s = 0, res = 0; cin >> n; vector<int> v(12); for (int i = int(0); i < 12; i++) cin >> v[i]; sort(v.b...
#include <bits/stdc++.h> using namespace std; int main() { int n, x, a, b, c = 0; cin >> n >> x; while (n--) { cin >> a >> b; if (x == a \|\| x == b \|\| x == 7 - a \|\| x == 7 - b) c++; x = 7 - x; } if (c > 0) cout << NO << endl; else cout << YES << endl; ret...
#include <bits/stdc++.h> using namespace std; void rf() {} void fast() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } void solve() { int k = 0; string s; cin >> s; k = 0; for (int i = 0; i < s.size(); i++) { if (k && s[i] == B ) { k--; ...
#include <bits/stdc++.h> using namespace std; const int N = 100005; int n, m; int t; int a[N]; string s; int main() { cin >> t; while (t--) { cin >> s; int c = 0; for (int i = 0; i < s.length(); i++) { if (s[i] == B ) c++; } if (s.length() % 2 == 0 && c == s....
#include <bits/stdc++.h> using namespace std; constexpr int N = 1e5 + 10; int n, ans = 0; int dp[N][2]; vector<int> g[N]; void chkmax(int &first, int second) { if (first < second) first = second; } void dfs(int u, int fa) { dp[u][0] = dp[u][1] = 0; int flag = 0; for (int &v : g[u]) { ...
#include <bits/stdc++.h> using namespace std; const double eps = 1e-8; int i, j, k, l, n, m, K[120], tmp, flag, bo; struct point { int x, y; } a[120]; struct ppp { double x, y; } O; double ans; int dot(point &a, point &b, point &c, point &d) { return (b.x - a.x) * (d.x - c.x) + (b.y - a.y)...
#include <bits/stdc++.h> using namespace std; const int INF = 1e9; const int MAXN = 1e6 + 5; const long long LINF = 1e18; const double pi = 3.1415926535; const long long MOD = 1e9 + 7; void cyclic_roll(int &a, int &b, int &c, int &d) { int tmp = a; a = b; b = c; c = d; d = tmp; } i...
#include <bits/stdc++.h> using namespace std; long q, n, arp[3000], s, ans, ar[2100][2100]; vector<long> pp; void dfs(long a, long b) { arp[a] = 1; ans = max(ans, b); for (int i = 1; i <= n; i++) if (ar[a][i] == 1 && arp[i] == 0) { dfs(i, b + 1); } } int main() { cin >> n...
#include <bits/stdc++.h> using namespace std; int n, m, a[111169], sum = 0; int main() { int x, y; cin >> n >> m; for (int i = (0); i < n; i += 1) cin >> a[i]; for (int i = (0); i < m; i += 1) { cin >> x >> y; sum += min(a[x - 1], a[y - 1]); } cout << sum; return 0; }
#include <bits/stdc++.h> #pragma GCC optimize( O2 ) using namespace std; const int maxn = 200000 + 10; inline void read(int &x) { int f = 1; x = 0; char ch = getchar(); while (ch < 0 \|\| ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { ...
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; inline long long getint() { long long _x = 0, _tmp = 1; char _tc = getchar(); while ((_tc < 0 \|\| _tc > 9 ) && _tc != - ) _tc = getchar(); if (_tc == - ) _tc = getchar(), _tmp = -1; while (_tc >= 0 && _tc <= 9 ) _x...
#include <bits/stdc++.h> using namespace std; int N, K; int tosum; int begin1 = 1000000001, end1; map<int, pair<int, int> > m; vector<pair<int, int> > v; int main() { if (fopen( cf612d.in , r )) { freopen( cf612d.in , r , stdin); freopen( cf612d.out , w , stdout); } scanf( %d %d...
#include <bits/stdc++.h> using namespace std; int main() { long long int n, x, l; cin >> n; vector<int> tab; for (long long int i = 0; i < n; ++i) { l = 0; cin >> x; if (x <= 7) tab.push_back(1); else if (x % 7 == 0) tab.push_back(x / 7); else if (x % 6 ...
#include <bits/stdc++.h> using namespace std; struct node { int first; int second; } a[350030]; int cmp(node a, node b) { if (a.first == b.first) { return a.second < b.second; } else return a.first > b.first; } int main() { int n; while (~scanf( %d , &n)) { for (int...
#include <bits/stdc++.h> using namespace std; int main() { long long int n, m, j = 0, ans = 0; cin >> n >> m; string s; cin >> s; set<char> st; vector<long long int> vec; for (long long int i = 0; i < m; i++) { char c; cin >> c; st.insert(c); } for (long long in...
#include <bits/stdc++.h> using namespace std; typedef int8_t i8; typedef int16_t i16; typedef int32_t i32; typedef int64_t i64; typedef ptrdiff_t isize; typedef uint8_t u8; typedef uint16_t u16; typedef uint32_t u32; typedef uint64_t u64; typedef size_t usize; typedef float f32; ty...
#include <bits/stdc++.h> using namespace std; int n, A; int a[100005]; map<int, int> mp; map<int, set<int> > se; set<int>::iterator it, itt; set<int> re; int main() { scanf( %d %d , &n, &A); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); int now = 0; int flag = 0; for (int i = 1; i...
#include <bits/stdc++.h> using namespace std; template <class T> bool uin(T &a, T b) { return (a > b ? a = b, true : false); } template <class T> bool uax(T &a, T b) { return (a < b ? a = b, true : false); } int const X = 8; int const L = 16; int const N = 41; long long const INF = 3e18 + ...
#include <bits/stdc++.h> using namespace std; vector<int> adj[100005], dir[100005], vec; int vis1[100005], vis2[100005], vis3[100005], fl = 0; void dfs1(int u) { vis1[u] = 1; vec.push_back(u); for (int i = (int)0; i <= (int)adj[u].size() - 1; i++) { if (!vis1[adj[u][i]]) dfs1(adj[u][i]); }...
#include <bits/stdc++.h> using namespace std; const int N = 600050; long long a[N], dp[N][3]; int main() { int n, x; scanf( %d%d , &n, &x); for (int i = 1; i <= n; i++) { scanf( %lld , &a[i]); } long long ans = 0; for (int i = 1; i <= n; i++) { dp[i][0] = max(dp[i][0], max(dp...
#include <bits/stdc++.h> using namespace std; int q; long long L, R; set<long long> s; long long v2[2000002], x; void precalculate() { long long LLMAX = 1e18; for (int i = 2; i <= 1000000; ++i) { long long x = 1LL * i * i * i; while (1) { if ((int)sqrt(x) != sqrt(x)) s.insert(x);...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:268435456 ) using namespace std; template <typename T> inline T abs(T a) { return ((a < 0) ? -a : a); } template <typename T> inline T sqr(T a) { return a * a; } template <class T> T gcd(T a, T b) { return a ? gcd(b % a, a) : b; ...
#include <bits/stdc++.h> using namespace std; map<char, int> m; int main() { string s; cin >> s; int x = 0; for (int i = 0; i < s.size(); i++) { if (m[s[i]] == 0) x++; m[s[i]]++; } if (x > 4 \|\| x < 2) cout << No << endl; else if (x == 2) { for (int i = 0; i < ...
#include <bits/stdc++.h> using namespace std; const long long M = 1000000007; const double pi = 3.141592653589793238463; long long modExp(long long x, long long n, long long M) { long long result = 1; while (n > 0) { if (n % 2 == 1) result = (result * x) % M; x = (x * x) % M; n = n / 2...
#include <bits/stdc++.h> const long long N = 4e5 + 10; long long fa[N][21] = {0}, sum[N][21], cnt = 0, last = 0, x, y, Q, op, w[N]; void add(long long u, long long val) { cnt++; w[cnt] = val; if (w[u] >= val) fa[cnt][0] = u; else { for (int i = 20; i >= 0; i--) { if (w[fa[u][i]...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); int n; cin >> n; vector<int> a(n + 1); for (int i = 1; i <= n; i++) cin >> a[i]; stack<int> lid, rid; vector<int> mxl(n + 1), mxr(n + 1); for (int i = 1; i <= n; i++) { while (!lid.empty() &...
#include <bits/stdc++.h> long long mod = 1000000007; using namespace std; long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } void solve() { long long n; cin >> n; vector<long long> a(n); priority_queue<pair<long long, long long> > pq; for (int i...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:66777216 ) using namespace std; const int N = 100000 + 5; int n, k; char s[N]; int su[N]; int a[N]; bool check(int md) { for (int i = 1; i <= (int)(n); ++i) { int s = max(i - md, 1); int f = min(i + md, n); if (a[i] == 1 && s...
#include <bits/stdc++.h> using namespace std; const int oo = 1e9, mxn = 100010; int A[mxn]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n; cin >> n; string s; cin >> s; for (int i = (0); i < (n); ++i) cin >> A[i]; vector<bool> visited(n); int curr = 0; ...
#include <bits/stdc++.h> using namespace std; const int NMAX = 100000; vector<int> g[NMAX + 1]; int H[NMAX + 1], D[NMAX + 1], G[NMAX + 1], GS[NMAX + 1]; long long DS[NMAX + 1]; vector<int> data[NMAX + 1]; vector<long long> acc[NMAX + 1], psum[NMAX + 1]; int dfs1(int u, int p, int gp) { G[u] = gp; ...
#include <bits/stdc++.h> using namespace std; void Get(int &T) { char C; bool F = 0; for (; C = getchar(), C < 0 \|\| C > 9 ;) if (C == - ) F = 1; for (T = C - 0 ; C = getchar(), C >= 0 && C <= 9 ; T = T * 10 + C - 0 ) ; F && (T = -T); } void Get(long long &T) { char C...
#include <bits/stdc++.h> using namespace std; const long double eps = 1e-9; const int inf = LONG_MAX; const long long inf64 = LLONG_MAX; const long double pi = 3.1415926535897932384626433832795; bool cmp(const pair<int, int> a, const pair<int, int> b) { return a.first > b.first; } int a[100100]; i...
#include <bits/stdc++.h> using namespace std; const int N = 110; vector<int> G[N]; int vis[N]; void DFS(int cur) { vis[cur]++; int sz = G[cur].size(); int v; for (int i = 0; i < sz; i++) { v = G[cur][i]; if (!vis[v]) DFS(v); } } int main() { int n, m, u, v; cin >> n...
#include <bits/stdc++.h> using namespace std; int n, x, b, k, v[100005], v2[100005], m; bool OK(int x) { int lst = -1e9, nr = 0; for (int i = 1; i <= n; i++) { if (v[i] - lst >= x) { nr++; lst = v[i]; } } return nr <= k; } int main() { ios::sync_with_stdio(false...
#include <bits/stdc++.h> using namespace std; int n, m; const int N = 1005; char grid[N][N]; int visited[N][N]; bool row[N]; bool col[N]; int drow[] = {0, 0, -1, 1}; int dcol[] = {1, -1, 0, 0}; bool fullrow = false; bool fullcol = false; bool inside(int x, int y) { return (1 <= x && x <= n && 1 ...
#include <bits/stdc++.h> using namespace std; struct Block { int r1, c1, r2, c2; int state[8]; void get(int& r, int& c, int st) { switch (st) { case 7: case 0: r = r1; c = c2; break; case 1: case 2: r = r2; c = c2; ...
#include <bits/stdc++.h> using namespace std; const int mod = 998244353; int n, m, num[5000007], inv[10000007], g[10000007], f[10000007], res; int read() { int num = 0; char c = getchar(); while (c < 0 \|\| c > 9 ) c = getchar(); while (c >= 0 && c <= 9 ) num = num * 10 + c - 0 , c = getcha...
#include <bits/stdc++.h> using namespace std; void dfs(int i, int j, vector<vector<char>>& grid, vector<vector<char>>& visited) { int n = grid.size(); if (i < 0 \|\| i >= n \|\| j < 0 \|\| j >= n \|\| visited[i][j] \|\| grid[i][j] == 0 ) return; visited[i][j] = 1; dfs(i - 1, j, grid, visited...
#include <bits/stdc++.h> using namespace std; const int N = 200005; int a[N], b[N]; int d1[N][25], d2[N][25]; void RMQ1_init(int *A, int n) { for (int i = 0; i < n; i++) d1[i][0] = A[i]; for (int j = 1; (1 << j) <= n; j++) { for (int i = 0; i + (1 << j) - 1 < n; i++) { d1[i][j] = max(d1[...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); int k = 0, l = 0, i = 0, count = 0, x = -1, y = 0; vector<int> alpha(26, 0); string s; cin >> k >> s; char temp[105][105]; for (i = 0; s[i] != 0 ; i++) { alpha[s[i] - a ] += 1; if ...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int l, r; cin >> l >> r; cout << l << << 2 * l << endl; } }
#include <bits/stdc++.h> using namespace std; using ll = long long; using ii = pair<int, int>; using vi = vector<int>; using vll = vector<long long>; using vii = vector<pair<int, int>>; int main() { int n, m; scanf( %d%d , &n, &m); vector<tuple<int, int, int>> ve; for (int i = 0; i < m; i+...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 100; int sz[maxn], N, M; int main() { scanf( %d%d , &N, &M); memset(sz, 0, sizeof(sz)); vector<int> cnt; cnt.resize(N); int a, b; for (int i = 1; i <= M; i++) { scanf( %d%d , &a, &b); a--, b--; cnt[a]+...
#include <bits/stdc++.h> using namespace std; struct node { int h, s, preh, pres, vis, water, sec; } n[400010][4]; int m, k, p, hh; char c; queue<node> q; int main() { scanf( %d%d , &m, &k); getchar(); for (int i = 1; i <= m; i++) { scanf( %c , &c); n[i][1].vis = n[i][2].vis = ...
#include <bits/stdc++.h> using namespace std; char s[110000], ans[110000]; int rs[70], G[110000][64], E[110000]; inline int read() { int n = 0; char a; bool z = false; while (a = getchar()) { if (a > 9 \|\| a < 0 ) if (z) break; else continue; if ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 102; int R, P, S; bool visited[3][MAXN][MAXN][MAXN]; double dp[3][MAXN][MAXN][MAXN]; double f(int t, int r, int p, int s) { if (!r && !p && !s) { return 0; } else if (r && !p && !s) { return t == 0; } else if (!r && p && ...
#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { if (b == 0) return a; else return gcd(b, a % b); } int main() { ios_base::sync_with_stdio(true); int c1, c2, a, b; cin >> c1 >> c2 >> a >> b; long long lo, hi, mid, numdiva, numdivb, numdivl, lcm, gc, na, n...
#include <bits/stdc++.h> ///#prbgmb GCC target ( sse4.2 ) ///#pragma GCC opimize( O1 ) ///#pragma GCC opimize( O2 ) ///#pragma GCC opimize( Os ) ///#pragma GCC opimize( Ofast ) ///#pragma GCC target( avx,avx2,fma ) ///#pragma GCC target( avx2 ) ///#pragma GCC opimize( O3 ) ///#pragma GC...
#include <bits/stdc++.h> using namespace std; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long n; cin >> n; long long arr[n], dp[550][550] = {}; for (long long i = 0; i < n; i++) cin >> arr[i]; for (long long size = 1; size <= n; size++) { ...
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; unordered_map<string, string> dict; string lecture[n], s1, s2; for (int i = 0; i < m; i++) { cin >> s1 >> s2; dict[s1] = s2; } for (int i = 0; i < n; i++) { cin >> lecture[i]; if (...
#include <bits/stdc++.h> using namespace std; int main() { int n, a, b, result; cin >> n >> a >> b; result = n + 1 - max(a + 1, n - b); cout << result << endl; return 0; }
#include <bits/stdc++.h> using namespace std; string s; int find_47(const string& s, int from) { for (int i = from; i < (s.size() - 1); i++) { if ((s[i] == 4 ) && (s[i + 1] == 7 )) return i; } return -1; } int main() { int n, k; cin >> n >> k; cin >> s; int from = 0; wh...
#include <bits/stdc++.h> using namespace std; int i, j, k, m[100005], n[100005]; int main() { while (scanf( %d , &k) != EOF) { for (i = 1; i <= k; i++) scanf( %d , &n[i]); j = 0; for (i = k; i >= 2; i--) { if (n[i] > n[i - 1]) continue; else { j = i - 1; ...
#include <bits/stdc++.h> using namespace std; int main() { const int MAX_N = 200000; int n; char s[MAX_N][20]; set<string> chat; scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %s , s[i]); } for (int i = n - 1; i >= 0; i--) { if (chat.find(s[i]) == chat.end()) { ...
#include <bits/stdc++.h> using namespace std; const int N = 2 * 1e5 + 1; int l[N], r[N], pos[30]; int main() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); string s, t; cin >> s >> t; int n = s.size(), m = t.size(); memset(pos, -1, sizeof pos); for (int i = 0, j = 0; i < n; i++)...
#include <bits/stdc++.h> using namespace std; long long int arr[105][105]; int main() { long long int n, m; cin >> n >> m; long long int r[n], c[m], tr1 = 0, tr2 = 0; for (long long int i = 0; i < n; i++) { cin >> r[i]; tr1 ^= r[i]; } for (long long int i = 0; i < m; i++) { ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); ; string s; cin >> s; int c = 0; for (int i = 0; i < s.length(); i++) { if (s[i] == a \|\| s[i] == e \|\| s[i] == i \|\| s[i] == o \|\| s[i] == u ) c++; else...
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3fll; const long double DINF = 1e18; const long double pi = acos(-1.0); const long double eps = 1e-9; bool eq(long double a, long double b) { return abs(a - b) <= eps; } struct pt { long ...
#include <bits/stdc++.h> using namespace std; const int maxn = 2 * 1e5 + 10; char str[maxn]; int ans[maxn]; int main() { int n, a, b, k; while (scanf( %d%d%d%d , &n, &a, &b, &k) != EOF) { scanf( %s , str + 1); int m = 0, cnt = 0; for (int i = 1; i <= n; ++i) { if (str[i] == ...
#include <bits/stdc++.h> using namespace std; long long int power(long long int x, long long int y, long long int p) { long long int res = 1; x = x % p; if (x == 0) return 0; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } bo...
#include <bits/stdc++.h> using namespace std; const long long N = 1e5 + 5; long long n, k, dp[N], sum, pos, s1, s2, deep[N], mndp[N], ans, ss, ss1; vector<pair<long long, long long> > g[N]; void dfs(long long x, long long p) { dp[x] = 0; for (long long i = 0; i < g[x].size(); ++i) { long long y ...
#include <bits/stdc++.h> using namespace std; int main() { int n; int a; int count = 0; cin >> n; for (int i = 1; i <= n; i++) { cin >> a; if (a == 1) count += 1; } if (n != 1) { if (count == (n - 1)) cout << YES << endl; else cout << NO << end...

#include <bits/stdc++.h> using namespace std; int ask(string s) { cout << ? << s << endl; fflush(stdout); int x; cin >> x; return x; } int main() { int n; scanf( %d , &n); string s(n, 0 ); int c = ask(s); s[0] = 1 ; int a0; int d = ask(s); int pos1 = -1, ...

#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007; long long dp[100005][2]; string a, b; int main() { int K; while (cin >> a >> b) { cin >> K; memset(dp, 0, sizeof(dp)); if (a == b) dp[0][1] = 1; else dp[0][0] = 1; int cnt = 0,...

#include <bits/stdc++.h> using namespace std; vector<int> g[100010]; int us[100010], w[3][100010], z1, z2, dooc; void dfs(int v, int in = 1) { us[v] = in; for (int i = 0; i < g[v].size(); i++) if (us[g[v][i]] == 0) { dfs(g[v][i], (in == 1 ? 2 : 1)); } else if (us[g[v][i]] == in) { ...

#include <bits/stdc++.h> using namespace std; int main() { int r = 0, u = 0; string s; cin >> s; for (int i = 0; i < s.size(); i++) { if (s[i] == L ) r--; else if (s[i] == R ) r++; else if (s[i] == U ) u++; else if (s[i] == D ) u--; } ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 1005, MAXM = 3e4 + 5; int N, M, s, t; int cost[MAXM], low[MAXN], disc[MAXN]; bool vis[MAXN]; vector<int> edges, bridge, ANS; vector<pair<int, int> > adj[MAXN]; void read() { scanf( %d %d , &N, &M); scanf( %d %d , &s, &t); for (in...

#include <bits/stdc++.h> using namespace std; long long M; const int N_MAX = 2; template <class T> void mul(int n, const T A[N_MAX][N_MAX], const T x[N_MAX], T y[N_MAX]) { static T z[N_MAX]; for (int i = 0; i < (n); i++) { z[i] = 0; for (int j = 0; j < (n); j++) z[i] = (z[i] + A[i][j] * x[...

#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; map<long long, long long> mp; int main() { ios_base::sync_with_stdio(false); cin.tie(0); long long n, m; cin >> n; vector<long long> v(n); for (int i = 0; i < n; ++i) { cin >> v[i]; if (mp.find(v[i]) ==...

#include <bits/stdc++.h> using namespace std; const int maxn = 2e6 + 5; const int mod = 1e9 + 7; int n, k; long long a[maxn]; template <class T> inline void read(T &res) { res = 0; T f = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) f = -1; c = getchar(); ...

#include <bits/stdc++.h> using namespace std; struct Problem { long long as, at, bs, bt; double pr; } a[2000]; const long long P = (long long)1e6; int n, m; long long fail[1001]; long long f[1001][1600]; double g[1001][1600]; bool cmp(Problem u, Problem v) { return u.bt * u.pr * (1 - v.pr)...

#include <bits/stdc++.h> using namespace std; const int MAXN = 300; const double eps = 1e-9; int px[MAXN], py[MAXN]; int ans[1000100]; int n, m; int main() { while (scanf( %d%d , &n, &m) != EOF) { for (int i = 0; i < m; ++i) scanf( %d%d , px + i, py + i); memset(ans, 0, sizeof(ans)); ...

#include <bits/stdc++.h> template <typename tp> inline tp max(tp x, tp y) { return x > y ? x : y; } template <typename tp> inline tp min(tp x, tp y) { return x < y ? x : y; } template <typename tp> inline bool chkmax(tp& x, tp y) { return (x >= y) ? false : (x = y, true); } template <typ...

#include <bits/stdc++.h> using namespace std; int n, p, t[100100], tree[100100]; queue<int> q; set<int> waiting; long long curT, ans[100100]; int get(int x) { for (int i = x; i; i -= i & -i) if (tree[i]) return 1; return 0; } void add(int x, int v) { for (int i = x; i <= 100000; i += i...

#include <bits/stdc++.h> using namespace std; long long n, m, i, j, ans, tmp, t, curr, x, r, sm, k, l; long long arr[1000005], res[1000005], par1[1000005], par2[1000005]; string s; vector<long long> vec[1000005]; void dfs(long long idx, long long par, long long col) { if (col != arr[idx]) { ans++;...

#include <bits/stdc++.h> using namespace std; int n, m, k, x, y, z, last[500039][2], a[500039], s[500039], ans; long long q[500039]; inline void swap(int &x, int &y) { x ^= y ^= x ^= y; } inline void check(int x, int y) { if (y - x < 2 || !x) return; if (q[y - 1] - q[x] == (a[y] ^ a[x])) ans++; } ...

#include <bits/stdc++.h> using namespace std; string employees; queue<int> d, r; int main() { int n; cin >> n >> employees; for (int i = 0; i < n; i++) { if (employees[i] == D ) d.push(i); else r.push(i); } while (!d.empty() && !r.empty()) { int idx_d = d.f...

#include <bits/stdc++.h> using namespace std; int n; int main() { cin >> n; if (n == 1 || n == 4 || n == 6 || n == 8 || n == 9 || n == 10 || n == 13 || n == 15) { cout << 1 ; return 0; } cout << 0 ; return 0; }

#include <bits/stdc++.h> using namespace std; const int maxn = 1000050; const int inf = 0x3f3f3f3f; const int mod = 1e9 + 7; int a[maxn], b[maxn], mi, ans1, ans2, ans3, ans, l, r; vector<int> v; char s[maxn]; void pa(int s, int e) { ans2 = 0; for (int i = s; i < e; i++) if (a[i] == mi + 1)...

#include <bits/stdc++.h> using namespace std; int arr[104]; int main() { int n, avg, mn, flag; cin >> n; for (int i = 0; i < n; i++) { cin >> arr[i]; } avg = 0; avg = arr[1] - arr[0]; flag = 0; for (int i = 1; i < n; i++) { int diff = (arr[i] - arr[i - 1]); if (di...

#include <bits/stdc++.h> using namespace std; struct Edge { int64_t v, f, c; Edge(int64_t v, int64_t f, int64_t c) : v(v), f(f), c(c) {} int64_t get_capacity() { return c - f; } }; const int64_t INF = (int64_t)(1e9) + 666; const int64_t N = 10000; const int64_t S = N - 2; const int64_t T = N -...

#include <bits/stdc++.h> using namespace std; const int pri[26] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, -1}; const long long mo[5] = {223092870ll, 2756205443ll, 907383479ll, 42600829ll, 97ll}; long l...

#include <bits/stdc++.h> using namespace std; int x[1000] = {4, 1, 1, 1, 2, 2, 2, 3, 3, 3}; int y[1000] = {2, 1, 2, 3, 1, 2, 3, 1, 2, 3}; int X[1005], Y[1005]; int main(int argc, char** argv) { int n; string a; cin >> n >> a; int mnx = 1e9, mny = 1e9, mxx = 0, mxy = 0; for (int i = 1; i < ...

#include <bits/stdc++.h> using namespace std; std::ostream& operator<<(std::ostream& os, pair<int, int> p) { os << p.first << , << p.second; return os; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { long long int l, r; ci...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); int n; cin >> n; string s; cin >> s; int cnt = 0; for (int i = 0; i < n; i++) { int up = 0, le = 0; for (int j = i; j < n; j++) { if (s[j] == U ) up++; if (s[j] == D ) u...

#include <bits/stdc++.h> using namespace std; long long n, k, i, j; int main() { cin >> n >> k; if (2 * k >= n) { cout << -1; return 0; } cout << n * k << endl; for (i = 1; i <= n; i++) for (j = 0; j < k; j++) cout << i << << (i + j) % n + 1 << n ; }

#include <bits/stdc++.h> using namespace std; long long int bt[50 + 10]; map<int, int> MAP; int main() { long long int a, b, c, d, e, f, m, n, p, q, x, y, z, w, k; vector<long long int> v[2525], temp; cin >> n >> k; for (int i = 1; i <= n; i++) { cin >> x; bt[i] = x; temp.push_...

#include <bits/stdc++.h> using namespace std; int main() { int ts = 1, cs = 1; cin >> ts; while (ts--) { int n, m; cin >> n >> m; pair<int, int> vec[m + 2]; for (int i = 1; i <= m; i++) { cin >> vec[i].first; vec[i].second = i; } sort(vec + 1, vec + m ...

#include <bits/stdc++.h> using namespace std; int main() { int num, i, count = 0, sum = 0, a; cin >> num; a = 1; while (1) { for (i = 1; i <= a; i++) { sum += i; } a++; if (sum > num) break; count++; } cout << count << endl; return 0; }

#include <bits/stdc++.h> using namespace std; const long long base = 139; const long long M = 1000012309; long long p[200007]; vector<pair<long long, char> > vp1; vector<pair<long long, char> > vp2; long long hashtable[200007], hv, cnt = 0; void pcal() { p[0] = 1; for (long long i = 1; i < 20000...

#include <bits/stdc++.h> using namespace std; template <class T> inline T sqr(T x) { return x * x; } const double EPS = 1e-9; const int INF = 1000 * 1000 * 1000; const long long LINF = INF * 1ll * INF; const double DINF = 1e200; const double PI = 3.1415926535897932384626433832795l; int gcd(int a...

#include <bits/stdc++.h> using namespace std; int n, tmp; vector<int> nPos; vector<int> NegPos, ZeroPos; int minNeg = -1000000001, minNegPos = -1; int main() { scanf( %d n , &n); for (int i = 0; i < n; i++) { scanf( %d , &tmp); nPos.push_back(tmp); } for (int i = 0; i < n; i++) {...

#include <bits/stdc++.h> using namespace std; int m = 1000000 + 3; int db[1010]; int twospows[1010]; long long mpow(int b, int e) { if (e == 0) return 1; if (e == 1) return b; return (mpow(b, e / 2) % m) * (mpow(b, e - e / 2) % m) % m; } long long twopow(int e) { if (twospows[e] != -1) ret...

#include <bits/stdc++.h> using namespace std; int main() { int n, m, i, k; cin >> n >> m; if (n < m) { cout << -1; return 0; } k = n / 2; if (n % 2) k++; for (i = k;; i++) { if (i % m == 0) break; } cout << i; return 0; }

#include <bits/stdc++.h> using namespace std; template <typename T> inline void read(T& x) { x = 0; char c; while (!isdigit(c = getchar())) ; do { x = x * 10 + c - 0 ; } while (isdigit(c = getchar())); } template <typename T> inline void write(T x) { if (x > 9) write(x /...

#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); const int MOD = 1e9 + 7; vector<int> check(int n, vector<int> a, int x) { multiset<int> as; for (auto u : a) { as.insert(u); } vector<int> res; for (int i = 0; i < n; ++i)...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); int n; cin >> n; int a[n][n]; int dp[2][n][n]; for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) cin >> a[i][j]; for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) for (int ...

#include <bits/stdc++.h> using namespace std; const int N = 501; int n, m, K, px[N], py[N]; bool check(int k) { vector<int> cx, cy; cx.push_back(1), cx.push_back(n), cx.push_back(n + 1), cy.push_back(1), cy.push_back(m), cy.push_back(m + 1); for (int i = 0; i < K; i++) { cx.push_back(m...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma ) #pragma GCC optimize( unroll-loops ) using namespace std; int n, k, t, a, b; long long w, z, x[3008], y[3008]; int main() { for (ios::sync_with_stdio(0), cin.tie(0), cin >>...

#include <bits/stdc++.h> using namespace std; int main() { unsigned long long int n, sum = 0, pos = 0, ans1 = 0, ans2 = 0; cin >> n; vector<unsigned long long int> vect; vect.resize(n); for (unsigned long long int i = 0; i < n; i++) { cin >> vect[i]; sum += vect[i]; } if (sum...

#include <bits/stdc++.h> using namespace std; void karem() { ios::sync_with_stdio(0); ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } int main() { karem(); int n, s = 0, res = 0; cin >> n; vector<int> v(12); for (int i = int(0); i < 12; i++) cin >> v[i]; sort(v.b...

#include <bits/stdc++.h> using namespace std; int main() { int n, x, a, b, c = 0; cin >> n >> x; while (n--) { cin >> a >> b; if (x == a || x == b || x == 7 - a || x == 7 - b) c++; x = 7 - x; } if (c > 0) cout << NO << endl; else cout << YES << endl; ret...

#include <bits/stdc++.h> using namespace std; void rf() {} void fast() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } void solve() { int k = 0; string s; cin >> s; k = 0; for (int i = 0; i < s.size(); i++) { if (k && s[i] == B ) { k--; ...

#include <bits/stdc++.h> using namespace std; const int N = 100005; int n, m; int t; int a[N]; string s; int main() { cin >> t; while (t--) { cin >> s; int c = 0; for (int i = 0; i < s.length(); i++) { if (s[i] == B ) c++; } if (s.length() % 2 == 0 && c == s....

#include <bits/stdc++.h> using namespace std; constexpr int N = 1e5 + 10; int n, ans = 0; int dp[N][2]; vector<int> g[N]; void chkmax(int &first, int second) { if (first < second) first = second; } void dfs(int u, int fa) { dp[u][0] = dp[u][1] = 0; int flag = 0; for (int &v : g[u]) { ...

#include <bits/stdc++.h> using namespace std; const double eps = 1e-8; int i, j, k, l, n, m, K[120], tmp, flag, bo; struct point { int x, y; } a[120]; struct ppp { double x, y; } O; double ans; int dot(point &a, point &b, point &c, point &d) { return (b.x - a.x) * (d.x - c.x) + (b.y - a.y)...

#include <bits/stdc++.h> using namespace std; const int INF = 1e9; const int MAXN = 1e6 + 5; const long long LINF = 1e18; const double pi = 3.1415926535; const long long MOD = 1e9 + 7; void cyclic_roll(int &a, int &b, int &c, int &d) { int tmp = a; a = b; b = c; c = d; d = tmp; } i...

#include <bits/stdc++.h> using namespace std; long q, n, arp[3000], s, ans, ar[2100][2100]; vector<long> pp; void dfs(long a, long b) { arp[a] = 1; ans = max(ans, b); for (int i = 1; i <= n; i++) if (ar[a][i] == 1 && arp[i] == 0) { dfs(i, b + 1); } } int main() { cin >> n...

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

#include <bits/stdc++.h> #pragma GCC optimize( O2 ) using namespace std; const int maxn = 200000 + 10; inline void read(int &x) { int f = 1; x = 0; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { ...

#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; inline long long getint() { long long _x = 0, _tmp = 1; char _tc = getchar(); while ((_tc < 0 || _tc > 9 ) && _tc != - ) _tc = getchar(); if (_tc == - ) _tc = getchar(), _tmp = -1; while (_tc >= 0 && _tc <= 9 ) _x...

#include <bits/stdc++.h> using namespace std; int N, K; int tosum; int begin1 = 1000000001, end1; map<int, pair<int, int> > m; vector<pair<int, int> > v; int main() { if (fopen( cf612d.in , r )) { freopen( cf612d.in , r , stdin); freopen( cf612d.out , w , stdout); } scanf( %d %d...

#include <bits/stdc++.h> using namespace std; int main() { long long int n, x, l; cin >> n; vector<int> tab; for (long long int i = 0; i < n; ++i) { l = 0; cin >> x; if (x <= 7) tab.push_back(1); else if (x % 7 == 0) tab.push_back(x / 7); else if (x % 6 ...

#include <bits/stdc++.h> using namespace std; struct node { int first; int second; } a[350030]; int cmp(node a, node b) { if (a.first == b.first) { return a.second < b.second; } else return a.first > b.first; } int main() { int n; while (~scanf( %d , &n)) { for (int...

#include <bits/stdc++.h> using namespace std; int main() { long long int n, m, j = 0, ans = 0; cin >> n >> m; string s; cin >> s; set<char> st; vector<long long int> vec; for (long long int i = 0; i < m; i++) { char c; cin >> c; st.insert(c); } for (long long in...

#include <bits/stdc++.h> using namespace std; typedef int8_t i8; typedef int16_t i16; typedef int32_t i32; typedef int64_t i64; typedef ptrdiff_t isize; typedef uint8_t u8; typedef uint16_t u16; typedef uint32_t u32; typedef uint64_t u64; typedef size_t usize; typedef float f32; ty...

#include <bits/stdc++.h> using namespace std; int n, A; int a[100005]; map<int, int> mp; map<int, set<int> > se; set<int>::iterator it, itt; set<int> re; int main() { scanf( %d %d , &n, &A); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); int now = 0; int flag = 0; for (int i = 1; i...

#include <bits/stdc++.h> using namespace std; template <class T> bool uin(T &a, T b) { return (a > b ? a = b, true : false); } template <class T> bool uax(T &a, T b) { return (a < b ? a = b, true : false); } int const X = 8; int const L = 16; int const N = 41; long long const INF = 3e18 + ...

#include <bits/stdc++.h> using namespace std; vector<int> adj[100005], dir[100005], vec; int vis1[100005], vis2[100005], vis3[100005], fl = 0; void dfs1(int u) { vis1[u] = 1; vec.push_back(u); for (int i = (int)0; i <= (int)adj[u].size() - 1; i++) { if (!vis1[adj[u][i]]) dfs1(adj[u][i]); }...

#include <bits/stdc++.h> using namespace std; const int N = 600050; long long a[N], dp[N][3]; int main() { int n, x; scanf( %d%d , &n, &x); for (int i = 1; i <= n; i++) { scanf( %lld , &a[i]); } long long ans = 0; for (int i = 1; i <= n; i++) { dp[i][0] = max(dp[i][0], max(dp...

#include <bits/stdc++.h> using namespace std; int q; long long L, R; set<long long> s; long long v2[2000002], x; void precalculate() { long long LLMAX = 1e18; for (int i = 2; i <= 1000000; ++i) { long long x = 1LL * i * i * i; while (1) { if ((int)sqrt(x) != sqrt(x)) s.insert(x);...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:268435456 ) using namespace std; template <typename T> inline T abs(T a) { return ((a < 0) ? -a : a); } template <typename T> inline T sqr(T a) { return a * a; } template <class T> T gcd(T a, T b) { return a ? gcd(b % a, a) : b; ...

#include <bits/stdc++.h> using namespace std; map<char, int> m; int main() { string s; cin >> s; int x = 0; for (int i = 0; i < s.size(); i++) { if (m[s[i]] == 0) x++; m[s[i]]++; } if (x > 4 || x < 2) cout << No << endl; else if (x == 2) { for (int i = 0; i < ...

#include <bits/stdc++.h> using namespace std; const long long M = 1000000007; const double pi = 3.141592653589793238463; long long modExp(long long x, long long n, long long M) { long long result = 1; while (n > 0) { if (n % 2 == 1) result = (result * x) % M; x = (x * x) % M; n = n / 2...

#include <bits/stdc++.h> const long long N = 4e5 + 10; long long fa[N][21] = {0}, sum[N][21], cnt = 0, last = 0, x, y, Q, op, w[N]; void add(long long u, long long val) { cnt++; w[cnt] = val; if (w[u] >= val) fa[cnt][0] = u; else { for (int i = 20; i >= 0; i--) { if (w[fa[u][i]...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); int n; cin >> n; vector<int> a(n + 1); for (int i = 1; i <= n; i++) cin >> a[i]; stack<int> lid, rid; vector<int> mxl(n + 1), mxr(n + 1); for (int i = 1; i <= n; i++) { while (!lid.empty() &...

#include <bits/stdc++.h> long long mod = 1000000007; using namespace std; long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } void solve() { long long n; cin >> n; vector<long long> a(n); priority_queue<pair<long long, long long> > pq; for (int i...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:66777216 ) using namespace std; const int N = 100000 + 5; int n, k; char s[N]; int su[N]; int a[N]; bool check(int md) { for (int i = 1; i <= (int)(n); ++i) { int s = max(i - md, 1); int f = min(i + md, n); if (a[i] == 1 && s...

#include <bits/stdc++.h> using namespace std; const int oo = 1e9, mxn = 100010; int A[mxn]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n; cin >> n; string s; cin >> s; for (int i = (0); i < (n); ++i) cin >> A[i]; vector<bool> visited(n); int curr = 0; ...

#include <bits/stdc++.h> using namespace std; const int NMAX = 100000; vector<int> g[NMAX + 1]; int H[NMAX + 1], D[NMAX + 1], G[NMAX + 1], GS[NMAX + 1]; long long DS[NMAX + 1]; vector<int> data[NMAX + 1]; vector<long long> acc[NMAX + 1], psum[NMAX + 1]; int dfs1(int u, int p, int gp) { G[u] = gp; ...

#include <bits/stdc++.h> using namespace std; void Get(int &T) { char C; bool F = 0; for (; C = getchar(), C < 0 || C > 9 ;) if (C == - ) F = 1; for (T = C - 0 ; C = getchar(), C >= 0 && C <= 9 ; T = T * 10 + C - 0 ) ; F && (T = -T); } void Get(long long &T) { char C...

#include <bits/stdc++.h> using namespace std; const long double eps = 1e-9; const int inf = LONG_MAX; const long long inf64 = LLONG_MAX; const long double pi = 3.1415926535897932384626433832795; bool cmp(const pair<int, int> a, const pair<int, int> b) { return a.first > b.first; } int a[100100]; i...

#include <bits/stdc++.h> using namespace std; const int N = 110; vector<int> G[N]; int vis[N]; void DFS(int cur) { vis[cur]++; int sz = G[cur].size(); int v; for (int i = 0; i < sz; i++) { v = G[cur][i]; if (!vis[v]) DFS(v); } } int main() { int n, m, u, v; cin >> n...

#include <bits/stdc++.h> using namespace std; int n, x, b, k, v[100005], v2[100005], m; bool OK(int x) { int lst = -1e9, nr = 0; for (int i = 1; i <= n; i++) { if (v[i] - lst >= x) { nr++; lst = v[i]; } } return nr <= k; } int main() { ios::sync_with_stdio(false...

#include <bits/stdc++.h> using namespace std; int n, m; const int N = 1005; char grid[N][N]; int visited[N][N]; bool row[N]; bool col[N]; int drow[] = {0, 0, -1, 1}; int dcol[] = {1, -1, 0, 0}; bool fullrow = false; bool fullcol = false; bool inside(int x, int y) { return (1 <= x && x <= n && 1 ...

#include <bits/stdc++.h> using namespace std; struct Block { int r1, c1, r2, c2; int state[8]; void get(int& r, int& c, int st) { switch (st) { case 7: case 0: r = r1; c = c2; break; case 1: case 2: r = r2; c = c2; ...

#include <bits/stdc++.h> using namespace std; const int mod = 998244353; int n, m, num[5000007], inv[10000007], g[10000007], f[10000007], res; int read() { int num = 0; char c = getchar(); while (c < 0 || c > 9 ) c = getchar(); while (c >= 0 && c <= 9 ) num = num * 10 + c - 0 , c = getcha...

#include <bits/stdc++.h> using namespace std; void dfs(int i, int j, vector<vector<char>>& grid, vector<vector<char>>& visited) { int n = grid.size(); if (i < 0 || i >= n || j < 0 || j >= n || visited[i][j] || grid[i][j] == 0 ) return; visited[i][j] = 1; dfs(i - 1, j, grid, visited...

#include <bits/stdc++.h> using namespace std; const int N = 200005; int a[N], b[N]; int d1[N][25], d2[N][25]; void RMQ1_init(int *A, int n) { for (int i = 0; i < n; i++) d1[i][0] = A[i]; for (int j = 1; (1 << j) <= n; j++) { for (int i = 0; i + (1 << j) - 1 < n; i++) { d1[i][j] = max(d1[...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); int k = 0, l = 0, i = 0, count = 0, x = -1, y = 0; vector<int> alpha(26, 0); string s; cin >> k >> s; char temp[105][105]; for (i = 0; s[i] != 0 ; i++) { alpha[s[i] - a ] += 1; if ...

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

#include <bits/stdc++.h> using namespace std; using ll = long long; using ii = pair<int, int>; using vi = vector<int>; using vll = vector<long long>; using vii = vector<pair<int, int>>; int main() { int n, m; scanf( %d%d , &n, &m); vector<tuple<int, int, int>> ve; for (int i = 0; i < m; i+...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 100; int sz[maxn], N, M; int main() { scanf( %d%d , &N, &M); memset(sz, 0, sizeof(sz)); vector<int> cnt; cnt.resize(N); int a, b; for (int i = 1; i <= M; i++) { scanf( %d%d , &a, &b); a--, b--; cnt[a]+...

#include <bits/stdc++.h> using namespace std; struct node { int h, s, preh, pres, vis, water, sec; } n[400010][4]; int m, k, p, hh; char c; queue<node> q; int main() { scanf( %d%d , &m, &k); getchar(); for (int i = 1; i <= m; i++) { scanf( %c , &c); n[i][1].vis = n[i][2].vis = ...

#include <bits/stdc++.h> using namespace std; char s[110000], ans[110000]; int rs[70], G[110000][64], E[110000]; inline int read() { int n = 0; char a; bool z = false; while (a = getchar()) { if (a > 9 || a < 0 ) if (z) break; else continue; if ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 102; int R, P, S; bool visited[3][MAXN][MAXN][MAXN]; double dp[3][MAXN][MAXN][MAXN]; double f(int t, int r, int p, int s) { if (!r && !p && !s) { return 0; } else if (r && !p && !s) { return t == 0; } else if (!r && p && ...

#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { if (b == 0) return a; else return gcd(b, a % b); } int main() { ios_base::sync_with_stdio(true); int c1, c2, a, b; cin >> c1 >> c2 >> a >> b; long long lo, hi, mid, numdiva, numdivb, numdivl, lcm, gc, na, n...

#include <bits/stdc++.h> ///#prbgmb GCC target ( sse4.2 ) ///#pragma GCC opimize( O1 ) ///#pragma GCC opimize( O2 ) ///#pragma GCC opimize( Os ) ///#pragma GCC opimize( Ofast ) ///#pragma GCC target( avx,avx2,fma ) ///#pragma GCC target( avx2 ) ///#pragma GCC opimize( O3 ) ///#pragma GC...

#include <bits/stdc++.h> using namespace std; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long n; cin >> n; long long arr[n], dp[550][550] = {}; for (long long i = 0; i < n; i++) cin >> arr[i]; for (long long size = 1; size <= n; size++) { ...

#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; unordered_map<string, string> dict; string lecture[n], s1, s2; for (int i = 0; i < m; i++) { cin >> s1 >> s2; dict[s1] = s2; } for (int i = 0; i < n; i++) { cin >> lecture[i]; if (...

#include <bits/stdc++.h> using namespace std; int main() { int n, a, b, result; cin >> n >> a >> b; result = n + 1 - max(a + 1, n - b); cout << result << endl; return 0; }

#include <bits/stdc++.h> using namespace std; string s; int find_47(const string& s, int from) { for (int i = from; i < (s.size() - 1); i++) { if ((s[i] == 4 ) && (s[i + 1] == 7 )) return i; } return -1; } int main() { int n, k; cin >> n >> k; cin >> s; int from = 0; wh...

#include <bits/stdc++.h> using namespace std; int i, j, k, m[100005], n[100005]; int main() { while (scanf( %d , &k) != EOF) { for (i = 1; i <= k; i++) scanf( %d , &n[i]); j = 0; for (i = k; i >= 2; i--) { if (n[i] > n[i - 1]) continue; else { j = i - 1; ...

#include <bits/stdc++.h> using namespace std; int main() { const int MAX_N = 200000; int n; char s[MAX_N][20]; set<string> chat; scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %s , s[i]); } for (int i = n - 1; i >= 0; i--) { if (chat.find(s[i]) == chat.end()) { ...

#include <bits/stdc++.h> using namespace std; const int N = 2 * 1e5 + 1; int l[N], r[N], pos[30]; int main() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); string s, t; cin >> s >> t; int n = s.size(), m = t.size(); memset(pos, -1, sizeof pos); for (int i = 0, j = 0; i < n; i++)...

#include <bits/stdc++.h> using namespace std; long long int arr[105][105]; int main() { long long int n, m; cin >> n >> m; long long int r[n], c[m], tr1 = 0, tr2 = 0; for (long long int i = 0; i < n; i++) { cin >> r[i]; tr1 ^= r[i]; } for (long long int i = 0; i < m; i++) { ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); ; string s; cin >> s; int c = 0; for (int i = 0; i < s.length(); i++) { if (s[i] == a || s[i] == e || s[i] == i || s[i] == o || s[i] == u ) c++; else...

#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3fll; const long double DINF = 1e18; const long double pi = acos(-1.0); const long double eps = 1e-9; bool eq(long double a, long double b) { return abs(a - b) <= eps; } struct pt { long ...

#include <bits/stdc++.h> using namespace std; const int maxn = 2 * 1e5 + 10; char str[maxn]; int ans[maxn]; int main() { int n, a, b, k; while (scanf( %d%d%d%d , &n, &a, &b, &k) != EOF) { scanf( %s , str + 1); int m = 0, cnt = 0; for (int i = 1; i <= n; ++i) { if (str[i] == ...

#include <bits/stdc++.h> using namespace std; long long int power(long long int x, long long int y, long long int p) { long long int res = 1; x = x % p; if (x == 0) return 0; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } bo...

#include <bits/stdc++.h> using namespace std; const long long N = 1e5 + 5; long long n, k, dp[N], sum, pos, s1, s2, deep[N], mndp[N], ans, ss, ss1; vector<pair<long long, long long> > g[N]; void dfs(long long x, long long p) { dp[x] = 0; for (long long i = 0; i < g[x].size(); ++i) { long long y ...

#include <bits/stdc++.h> using namespace std; int main() { int n; int a; int count = 0; cin >> n; for (int i = 1; i <= n; i++) { cin >> a; if (a == 1) count += 1; } if (n != 1) { if (count == (n - 1)) cout << YES << endl; else cout << NO << end...