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

func_code_string stringlengths 59 71.4k
#include <bits/stdc++.h> using namespace std; int n; long long h[100005], d; int dp[100005]; int arr[300003]; int tree[(1200004)]; int lazy[(1200004)]; void build_tree(int node, int a, int b) { if (a > b) return; if (a == b) { tree[node] = arr[a]; return; } build_tree(node * ...
#include <bits/stdc++.h> const int inf = 1 << 30; const long long INF = 1ll << 61; using namespace std; const int MOD = 1000000; int n; int nnum[500000 + 55]; int vis[1000000 + 55]; int flag[1000000 + 55]; vector<int> G; void init() { memset(flag, 0, sizeof(flag)); memset(nnum, 0, sizeof(nnu...
#include <bits/stdc++.h> using namespace std; vector<int> g[2000]; int vis[2000]; vector<pair<int, int> > cyc; void dfs(int x, int scc) { if (vis[x] > 0) { return; } vis[x] = 1; int j; for (int i = 0; i < g[x].size(); i++) { for (j = 0; j < g[g[x][i]].size(); j++) { if ...
#include <bits/stdc++.h> using namespace std; int gi() { int x = 0, w = 1; char ch = getchar(); while ((ch < 0 \|\| ch > 9 ) && ch != - ) ch = getchar(); if (ch == - ) w = 0, ch = getchar(); while (ch >= 0 && ch <= 9 ) x = (x << 3) + (x << 1) + ch - 0 , ch = getchar(); return w ...
#include <bits/stdc++.h> using namespace std; bool spj(set<int>& s) { vector<int> v{s.begin(), s.end()}; return (v[2] == 3 * v[0] && v[1] == 2 * v[0]); } int main() { int n; scanf( %d , &n); vector<int> result; for (int i = n, factor = 1; i != 0; i /= 2, factor *= 2) { if (i == 3) ...
#include <bits/stdc++.h> using namespace std; int n, m, s, f, l, r, t; int stay() { int next = (s < f) ? s + 1 : s - 1; return (s >= l && s <= r) \|\| (next >= l && next <= r); } int di[] = {0, 1}; int dj[] = {1, 0}; void write(vector<string> &res, int x, int y, int dir, string s) { for (int i =...
#include <bits/stdc++.h> using namespace std; string s; int dpl[2010], dpr[2010]; int main() { cin >> s; memset(dpr, 0, sizeof(dpr)); memset(dpl, 0, sizeof(dpl)); int i, j, k; for (i = 0; i < s.size(); i++) { for (j = i, k = i; j >= 0 && k < s.size() && s[k] == s[j]; j--, k++) ...
#include <bits/stdc++.h> using namespace std; map<int, int> ara; int main() { int n, k; cin >> n >> k; int t = n / 2; if (n == 1 && k != 0) { cout << -1; return 0; } if (n == 1 && k == 0) { cout << 1; return 0; } if (k < t) { cout << -1; return 0...
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1.0); const double eps = 1e-6; const int inf = 1e9; const long long llf = 1e18; const int mod = 1e9 + 7; const int maxn = 1e5 + 10; char s[110]; int f[310]; int main() { int tc; cin >> tc; while (tc--) { cin >> s...
#include <bits/stdc++.h> int main() { std::vector<int> count(1 << 19); auto modify = [&](char *s, int dt) { int len = strlen(s); std::reverse(s, s + len); int val = 0; for (int i = 0; i < 18; ++i) { val = val \| (i >= len ? 0 : (s[i] - 0 & 1)) << i; } count[val] +=...
#include <bits/stdc++.h> using namespace std; namespace Solve { const int MAXN = 200010; inline int ScanInt(void) { int r = 0, c, d; while (!isdigit(c = getchar()) && c != - ) ; if (c != - ) r = c - 0 ; d = c; while (isdigit(c = getchar())) r = r * 10 + c - 0 ; return d == - ...
#include <bits/stdc++.h> using namespace std; mt19937 rang(chrono::high_resolution_clock::now().time_since_epoch().count()); const long double PI = 3.141592653589793; const long long INF = 9223372036854775807ll; const long long mod = 1e9 + 7; const int N = 1e5 + 5; long long tree[4 * N + 10]; long long ...
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int x1 = 0, x2 = 0, y1 = 0, y2 = 0, position = 0; int length = s.size(); for (int i = 0; i < length; i++) { if (s[i] == R ) { x1++; position++; } if (s[i] == L ) { x1--; ...
#include <bits/stdc++.h> using namespace std; const long ka[6] = {0, 0, 0, 0, 2, 4}; int main() { long long n, m; while (cin >> n >> m) { if (n > m) { int tmp = n; n = m; m = tmp; } long long ret; if (n == 1) ret = m / 6 * 6 + ka[m % 6]; else i...
#include <bits/stdc++.h> int n, i, x, ind[210], o = 0, e = 0; char a[200001], arr[200010]; int main() { scanf( %s , a); n = strlen(a); if (n == 1) { printf( %s n , a); return 0; } for (int i = 0; i < n; i++) { ind[a[i]]++; } for (int i = a ; i <= z ; i++) { if...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; inline int read() { int x = 0; char c = getchar(); bool f = 0; while (!isdigit(c)) f \|= (c == - ), c = getchar(); while (isdigit(c)) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar(); return f ? -x : x; } int ...
#include <bits/stdc++.h> using namespace std; int main() { int x1, x2, x3; cin >> x1 >> x2 >> x3; int min, max; int t = (x1 < x2) ? x1 : x2; min = (t < x3) ? t : x3; t = (x1 > x2) ? x1 : x2; max = (t > x3) ? t : x3; cout << max - min; }
#include <bits/stdc++.h> using namespace std; const int N = 200005; const int p = 998244353; int n, k, cnt, a[N], d[N], jc[N], ny[N]; long long s = 1, ans; inline int read() { int ans = 0; char c = getchar(); while (c < 48 \|\| c > 57) c = getchar(); while (c >= 48 && c <= 57) ans = (ans...
#include <bits/stdc++.h> using namespace std; const long long mod = 998244353; long long powmod(long long a, long long b) { long long res = 1; a %= mod; assert(b >= 0); for (; b; b >>= 1) { if (b & 1) res = res * a % mod; a = a * a % mod; } return res; } long long gcd(long ...
#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0, f = 1; char ch = getchar(); while (!(ch >= 0 && ch <= 9 )) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + (ch - 0 ); ch = getchar(); } return...
#include <bits/stdc++.h> using namespace std; const int Z = (int)3e3 + 228; const int N = (int)1e6 + 228; const int INF = (int)1e9 + 228; const int MOD = (int)1e9 + 7; int n, d; long long a[N], delta[N], k; bool can(long long mid) { fill(delta + 1, delta + 1 + n, 0LL); for (int i = 1; i <= n; i+...
#include <bits/stdc++.h> using namespace std; bool shown[100001]; vector<pair<int, int> > v; vector<int> cycle; vector<vector<int> > ans; int main() { int n, tmp; scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , &tmp); v.push_back(make_pair(tmp, i)); } sort(v.begin(...
#include <bits/stdc++.h> using namespace std; int main() { string s1, s2; long long int n, c11 = 0, c00 = 0, c10 = 0, c01 = 0, p1 = 0, p2 = 0; cin >> n >> s1 >> s2; n *= 2; for (int i = 0; i < n; i++) { if (s1[i] == s2[i]) { if (s1[i] == 1 ) c11++; else ...
#include <bits/stdc++.h> using namespace std; long long n, k, x, r, z, sol; int main() { cin >> n >> k; for (int i = 1; i <= n; i++) { cin >> x; if (r > 0) { x = x - k + r; sol++; } z = x / k; sol += z; r = x % k; } if (r > 0) { sol++; ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1E6; int n, q, sz = 1; long long value[6]; long long dp[MAXN]; inline void upData(int v, long long w) { for (int i = MAXN - 1; i >= v; --i) dp[i] = max(dp[i], dp[i - v] + w); } inline void Divide(int x) { int v = 3 * sz, all = min(MA...
#include <bits/stdc++.h> using namespace std; long long mod = 1000000000 + 7; map<int, vector<int>> mp; vector<int> cur(1, -1), goal(1, -1), done(1, -1); vector<int> ans; int c; void funct(int node, int level, int even, int odd) { int r = level % 2; done[node] = 1; if (r == 1 && odd == 1) ...
#include <bits/stdc++.h> using namespace std; int main() { int n, m, a[60], b[60]; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; cin >> m; for (int i = 0; i < m; i++) cin >> b[i]; int BG = -1; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (b[j] % a[i] ...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; using ll = long long; using ld = long double; ll mod = 998244353; ll gcd(ll a, ll b) { if (a == 0 or b == 0) return a + b; return gcd(b, a % b); } ll sum(ll a, ll b) { a += b; a %= mod; return a; } ll sub...
#include <bits/stdc++.h> using namespace std; void solve() { int flag = 1; int a, b, c, d; cin >> a >> b >> c >> d; if ((a + b) % 2 == 0) { } else flag = -1; if (a + d == 0) { if (flag == 1) { cout << Tidak Tidak Ya Tidak << n ; return; } el...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; vector<int> a(n); for (auto &x : a) cin >> x; sort(a.begin(), a.end()); set<int> s; int ans = 0, x; for (int i = 0; i < n; i++) { x = a[i]; ...
#include <bits/stdc++.h> int main() { char a[1000]; scanf( %s , a); if (a[0] > 96) a[0] -= 32; printf( %s , a); }
#include <bits/stdc++.h> using namespace std; const int dx[] = {-1, 1, 0, 0}; const int dy[] = {0, 0, -1, 1}; const int max_n = 1000; char a[max_n][max_n]; int res[max_n][max_n], val[max_n * max_n]; vector<pair<int, int> > comp[max_n * max_n]; bool used[10]; bool range(int x, int l, int r) { return ((...
#include <bits/stdc++.h> using namespace std; int n, m, k; int a[10000]; int main() { cin >> n >> m >> k; for (int i = 0; i < n; i++) scanf( %d , a + i); if (n % 2 == 0) puts( 0 ); else { long long r = m / ((n + 1) / 2); long long hi = (1 << 30); for (int i = 0; i < n; i ...
#include <bits/stdc++.h> using namespace std; const int MaxN = 1e5 + 5; int main() { int n, f[MaxN], cnt[MaxN], mm = 0, ans = 0; scanf( %d , &n); memset(f, 0, sizeof(f)); memset(cnt, 0, sizeof(cnt)); for (int i = 1; i <= n; i++) { int a; scanf( %d , &a); cnt[f[a]]--; f[...
#include <bits/stdc++.h> using namespace std; using ll = long long; const ll OO = 0x3f3f3f3f3f3f3f3fLL; int di[8] = {0, 0, 1, -1, -1, 1, -1, 1}; int dj[8] = {1, -1, 0, 0, 1, 1, -1, -1}; string ys = YES , no = NO ; const int N = 1e5 + 5, M = 5 * (1 << 10) + 10; int main() { ios_base::sync_with_stdi...
#include <bits/stdc++.h> using namespace std; int n; string a; void input() { cin >> n; cin >> a; } void solve() { int ans = 0; for (int i = 1; i < n; ++i) { ans += (a[i] == a[i - 1]); } cout << (ans + 1) / 2 << n ; } int main() { ios_base ::sync_with_stdio(false); ...
#include <bits/stdc++.h> using namespace std; int A = 0, B = 0, C = 0; void add(char o) { if (o == A ) { A++; } else { if (o == B ) { B++; } else { if (o == C ) { C++; } } } } void sub(char o) { if (o == A ) { A--; } else ...
#include <bits/stdc++.h> const long long oo = (long long)1e18 + 1; using namespace std; int n, q; int b[200002]; pair<int, int> a[200002]; int T[200002]; vector<pair<int, int> > query[200002]; int k[200002], p[200002]; int res[200002]; void upd(int x) { while (x < 200002) { T[x]++; x...
#include <bits/stdc++.h> #pragma comment(linker, /stack:200000000 ) #pragma GCC optimize( Ofast ) #pragma target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; inline int read() { char c = getchar(); int tot = 1; while ((c < 0 \|\| c > 9 ) && c != - ) c = getcha...
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } const int MAXN = 16; int n; int mod[MAXN], rem[MAXN]; int egcd(int a, int b, int &x, int &y) { if (b == 0) { x = 1, y = 0; return a; } int g = egcd(b, a % b, x...
#include <bits/stdc++.h> template <typename T> inline bool chkmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; } template <typename T> inline bool chkmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; } inline int read() { static char ch; bool sgn = false; while (ch = getchar(), ...
#include <bits/stdc++.h> using namespace std; long long st; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long n, m, k; cin >> n >> m >> k; if (k < n) { cout << (long long)(k + 1) << << 1; return 0; } k -= (long long)(n - 1); long long row = k /...
#include <bits/stdc++.h> using namespace std; int main() { long long int n, a[100000], b, c = 0, x, y, z, m, i, j, t; string s; vector<int> v; cin >> n; for (i = 0; i < n; i++) { cin >> x; v.push_back(x); } sort(v.begin(), v.end()); for (i = 0; i < n / 2; i++) { c +...
#include <bits/stdc++.h> using namespace std; const long long N = 3e5 + 2; const long long N1 = 1e2 + 2; const long long mod = 1e9 + 7; const int MASK = 1 << 17 + 1; const int who = 6 * N * log2(N); long long power(long long a, long long b, long long c) { long long ret = 1; while (b) { if (b...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:36777216 ) using namespace std; template <typename T1, typename T2> inline void chkmin(T1 &a, T2 b) { if (a > b) a = b; } template <typename T1, typename T2> inline void chkmax(T1 &a, T2 b) { if (a < b) a = b; } const string FILENAME = ...
#include <bits/stdc++.h> using namespace std; int n, m; bool f[100009]; pair<int, int> a[100009]; vector<int> v[100009]; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &a[i].first); a[i].second = i; } sort(a + 1, a + n + 1); for (int i = 1; i <= n; i...
#include <bits/stdc++.h> using namespace std; void arr(string &s); int main() { int n = 0, k = 0, m = 0; bool b = 0; cin >> n >> k; string s = ; cin >> s; arr(s); for (int i = 0; i < s.length(); i++) switch (s[i]) { case G : m = i; i = s.length(); ...
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 7; int a[N], b[N], na[N], nb[N], t1[N], t2[N], c[N], tp, q[N], mx[N], x, n, m, i, j; long long ans; void init(int* a, int* ans, int n) { for (memset(ans, 0x3f, (n + 3) << 2), tp = 0, i = 1; i <= n; ++i) { j = a[i]; while (...
#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0, c = getchar(), f = 0; for (; c > 9 \|\| c < 0 ; f = c == - , c = getchar()) ; for (; c >= 0 && c <= 9 ; x = (x << 1) + (x << 3) + c - 0 , c = getchar()) ; return f ? -x : x; } inline void write(int x) ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int TESTS = 1; while (TESTS--) { long long m = 1, ans = 1; long long n; cin >> n; while (ans < n) { m++; ans += 2; } cout << m...
#include <bits/stdc++.h> using namespace std; const int INF = 2147483647; const long long LLINF = 9223372036854775807LL; const int ST = 100010; const int ST1 = 1000010; const long long MOD = 1000000007; long long ABS(long long a) { if (a < 0) return a * (-1); else return a; } int m...
#include <bits/stdc++.h> using namespace std; int read() { int x = 0, sgn = 1; char ch = getchar(); for (; !isdigit(ch); ch = getchar()) if (ch == - ) sgn = -1; for (; isdigit(ch); ch = getchar()) x = (x << 1) + (x << 3) + (ch ^ 48); return x * sgn; } const int N = 1e5 + 10; int n, ...
#include <bits/stdc++.h> using namespace std; char student; int arr; struct node { int x; int y; int val; }; std::vector<node> v; std::vector<node> out; struct edge { int v; edge left; edge right; }; edge ed; bool flag; bool comp(node &a, node &b) { return (!(a....
#include <bits/stdc++.h> using namespace std; const long double PI = acos(-1); pair<long double, long double> sum(pair<long double, long double> a, pair<long double, long double> b) { return {a.first + b.first, a.second + b.second}; } long double cross(pair<long double...
#include <bits/stdc++.h> using namespace std; long long n, a, b, c; long long d; long long cnt1, cnt2; long long r; int main() { cin >> n >> a >> b >> c; d = b - c; if (n >= a) { cnt1 = n / a; r = n % a; if (r >= b) cnt1 += (r - b) / d + 1; } if (n >= b) { r = n -...
#include <bits/stdc++.h> using namespace std; int n, i; int fi = 0, se = 0, th = 0, fo = 0; int main() { cin >> n; cout << +------------------------+ << endl; if (n >= 3) { n--; th++; } while (n) { if (n) { fi++; n--; } if (n) { se++; ...
#include <bits/stdc++.h> using namespace std; int main() { int n, temp, count = 0, found = 0; cin >> n; int a[n]; for (int i = 0; i < n; i++) { cin >> temp; if (temp == i) ++count; else if (temp < i && a[temp] == i) found = 2; else if (found != 2) foun...
#include <bits/stdc++.h> using namespace std; struct sheet { long long xt, yt, xb, yb; }; sheet a[3]; long long flag = 0; void hor() { long long yc = a[0].yb; for (double x = a[0].xb; x <= a[0].xt; x += .5) { if (a[1].xb <= x && x <= a[1].xt && a[1].yb <= yc && yc <= a[1].yt) { con...
#include <bits/stdc++.h> using namespace std; void ret(string s) { cout << s; exit(0); } int main() { int x1, x2, y1, y2, n; cin >> n >> x1 >> y1 >> x2 >> y2; if (x1 * x2 == 0 && x1 + x2 == n) cout << min(n + y1 + y2, 3 * n - y1 - y2); else if (y1 * y2 == 0 && y1 + y2 == n) c...
#include <bits/stdc++.h> using namespace std; const int N = 34; const int M = 70; int n; int arr[N]; int dp[N][M * M][M]; int find(int pos, int sum, int cnt) { if (pos > n) { return (sum * 2 == cnt * (cnt - 1)) ? cnt : M; } if (dp[pos][sum][cnt] != -1) { return dp[pos][sum][cnt]; ...
#include <bits/stdc++.h> using namespace std; int tmp, n, tr[100005 * 30][2], cnt; inline void insert(int x) { int p = 0, d; for (int i = 29; i >= 0; --i) { d = (x >> i) & 1; if (tr[p][d]) p = tr[p][d]; else { tr[p][d] = ++cnt; p = cnt; memset(tr[p], 0, si...
#include <bits/stdc++.h> using namespace std; void solve() { vector<long long> arr(4); for (int i = 0; i < 4; i++) cin >> arr[i]; int counter = 0; for (int i = 0; i < 4; i++) counter += arr[i] % 2; if (counter == 0 \|\| counter == 1 \|\| counter == 4) { cout << Yes n ; return; } els...
#include <bits/stdc++.h> using namespace std; const int N = 250; int n, m, B, ans; int co[N], sx[N], sy[N]; int mp[N][N], id[N], fl[N]; bool cmp(int x, int y) { return sy[x] < sy[y]; } const int ND = 500; struct edge { int to, next, f, v; } e[N * N]; int head[ND], cur[ND], tot; int S, T, dis[N...
#include <bits/stdc++.h> using namespace std; int n, m, t; pair<int, int> a[300005]; int b[300005]; int force(int ll, int rr) { int r = 0; for (int i = 1; i <= n; i++) if (a[i].first >= ll && a[i].second <= rr) r++; return r; } struct indexed_tree_2d { vector<int> T[1000006]; voi...
#include <bits/stdc++.h> using namespace std; vector<pair<int, pair<int, int> > > v[100005]; vector<int> ans; int n; bool has_cycle(int mid) { int indeg[100005]; int cnt = 0, x; memset(indeg, 0, sizeof(indeg)); for (int i = 1; i <= n; ++i) { for (auto g : v[i]) { if (g.second.fir...
#include <bits/stdc++.h> int func(int num) { if (num > 0) return 1; else if (num < 0) return -1; else return num; } int main() { char a[101], b[101]; int i; scanf( %s , &a); scanf( %s , &b); for (i = 0; i < strlen(a); i++) if (a[i] >= A && a[i] <= Z ) a[i...
#include <bits/stdc++.h> using namespace std; int DEBUG = 0; int main(int argc, char **argv) { DEBUG = (argc >= 2) ? atoi(argv[1]) : 0; int t; cin >> t; for (int c = 0; c < t; c++) { char tmp; int board[8][8]; int kx[2]; int ky[2]; int eger = 0; for (int i = 0; ...
#include <bits/stdc++.h> using namespace std; const int64_t mod = 1000000007; int main() { int n; cin >> n; int64_t ways = 1; for (int i = 0; i < 3 * n; ++i) { ways = 3; ways %= mod; } int64_t bad = 1; for (int i = 0; i < n; ++i) { bad = 7; bad %= mod; } ...
#include <bits/stdc++.h> using namespace std; long long A[100005 * 10]; long long B[100005 * 10]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long tst = 1; for (long long tt = 1; tt <= tst; tt++) { long long n, a, mn = 1e12, m, res = 0; ...
#include <bits/stdc++.h> using namespace std; int N; pair<pair<int, int>, int> V[100005]; vector<int> r; bool cmp(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) { if (a.first.first != b.first.first) return a.first.first > b.first.first; return a.first.second > b.first.second; } int main...
#include <bits/stdc++.h> using namespace std; using LL = long long; constexpr int maxn = 100; int a[maxn]; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int t; for (cin >> t; t; t -= 1) { int n, x, am = 0, ok = 0; cin >> n >> x; for (int a...
#include <bits/stdc++.h> using namespace std; int caseno = 1; typedef long long LL; typedef unsigned long long ULL; typedef long long int64; typedef unsigned long long uint64; const int SIZE = 100 + 10; int ar[SIZE]; int main() { std::ios_base::sync_with_stdio(0); int tcases, I, J, K, N, n, m,...
#include <bits/stdc++.h> using namespace std; const int INF = 2147483647; const long long LLINF = 9223372036854775807LL; int digsum(long long x) { int ans = 0; do { ans += x % 10; x /= 10; } while (x); return ans; } int main() { int a, b, c; cin >> a >> b >> c; vector...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:671088640 ) using namespace std; const int MOD = 1000000007; const int INF = 20000000; const long double EPS = 1e-7; const int HASH_POW = 29; const long double PI = acos(-1.0); mt19937_64 rnd(1); double workTime() { return double(clock()) / CLOC...
#include <bits/stdc++.h> using namespace std; int main() { int tst; cin >> tst; while (tst--) { int i, j, k, l, m, n; cin >> n; string s; cin >> s; set<int> ze, on; for (i = 0; i < n; i++) { if (s[i] == 1 ) on.insert(i); else ze.in...
#include <bits/stdc++.h> using namespace std; unsigned long long int t, k, x; int main() { ios_base::sync_with_stdio(0); cin >> t; for (; t > 0; t--) { cin >> k >> x; cout << (k - 1) * 9 + x << endl; } }
#include <bits/stdc++.h> using namespace std; int a[60000], x, mn = 0x3f3f3f3f; int main() { int n, m; cin >> m >> n; for (int i = 1; i <= n; i++) { cin >> x; a[x]++; } sort(a + 1, a + m + 1); cout << a[1]; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 4e4 + 10; const int inf = 1e9; int t; int n; int b[N], ans[N]; void solve() { cin >> n; for (int i = 0; i < n; i++) cin >> b[i]; long long tot = 0; for (int i = 0; i < n; i++) tot += b[i]; if (tot % (n * (n + 1) / 2) != 0) { ...
#include <bits/stdc++.h> using namespace std; const long long Max = 1e5 + 10; int T; long long n, m; long long number[Max]; int main() { cin >> T; while (T--) { cin >> n >> m; long long ans = 1; int k = 1; for (int i = 1;; i *= 2) { number[k] = number[k - 1] + i; ...
#include <bits/stdc++.h> const double eps = 1e-10; const float epsf = 1e-6; using namespace std; inline long long int __gcd(long long int a, long long int b) { if (a == 0 \|\| b == 0) { return max(a, b); } long long int tempa, tempb; while (1) { if (a % b == 0) return b; ...
#include <bits/stdc++.h> using namespace std; double prec = 0.00000001; void calcHistory(vector<double>& history, int hp2, double p1, int l1, int h1) { double h[201]; double newh[201]; memset(h, 0, sizeof(h)); memset(newh, 0, sizeof(newh)); h[hp2] = 1.; for (int i = 0; i < history.size(); ...
#include <bits/stdc++.h> using namespace std; int n, m; long long l[200020], r[200020]; struct node { long long x, y, p; } a[200020]; long long ans[200020]; struct bridge { long long p, v; }; struct Compare { bool operator()(const bridge& a, const bridge& b) const { if (a.v < b.v \|\| ...
#include <bits/stdc++.h> using namespace std; int a[111]; int main() { int mx = 1000000000; int cnt, n; scanf( %d , &n); int sum = 0; cnt = 0; int k = 0; for (int i = 1; i < n * 2; ++i) { scanf( %d , &a[i]); sum += abs(a[i]); mx = ((mx) < (abs(a[i])) ? (mx) : (abs(a[i...
#include <bits/stdc++.h> using namespace std; const double eps = 1e-8; char a[1010], b[1010]; int h = 0; int main() { scanf( %s , a); int l = strlen(a); int j = 0; for (int i = 0; i < l; i++) { b[j++] = a[i]; if (a[i] == > ) { b[j] = 0; if (b[1] == / ) h--; ...
#include <bits/stdc++.h> using namespace std; default_random_engine generator; uniform_int_distribution<int> distribution(1, INT_MAX); long long my_rand(long long a = 0, long long b = INT_MAX) { return a + distribution(generator) % b; } inline int mul(int a, int b) { return int(a * 1ll * b % 998244353);...
#include <bits/stdc++.h> using namespace std; const int N = 1000010; struct node { int x, id; } a[N], ans[N]; int anss; bool cmp(node x, node y) { if (x.x != y.x) return x.x > y.x; return x.id < y.id; } void solve() { int k = a[2].x / a[3].x; while (k) { if (k & 1) { a[...
#include <bits/stdc++.h> using namespace std; const int maxn = 59; const long long mod = 998244353; int add[maxn]; long long w[maxn]; long long dp[52][52][52]; long long val[52][52][52]; bool vis[52][52][52]; long long Pow(long long a, long long b) { long long res = 1; a %= mod; while (b) ...
#include <bits/stdc++.h> using namespace std; int n; int main() { scanf( %d , &n); if (n % 2 == 0) { printf( -1 ); return 0; } for (int i = 0; i < n; i++) printf( %d , i); printf( n ); for (int i = 0; i < n; i++) printf( %d , i); printf( n ); for (int i = 0; i < n; ...
#include <bits/stdc++.h> using namespace std; using LL = long long int; template <class TH> void _dbg(const char sdbg, TH h) { cerr << sdbg << = << h << n ; } template <class TH, class... TA> void _dbg(const char sdbg, TH h, TA... a) { while (sdbg != , ) cerr << sdbg++; cerr << = <<...
#include <bits/stdc++.h> int main() { std::ios::sync_with_stdio(false); int n; long long m, k; long long tmp; std::cin >> n >> m >> k; std::vector<long long> a; for (int i = 0; i < n; i++) { std::cin >> tmp; a.push_back(tmp); } std::sort(a.begin(), a.end()); std::co...
#include <bits/stdc++.h> using namespace std; const long long oo = 1000000000000000000; long long sum, ans = 0, mx = 0, mn = 1000000000, num, pos; vector<int> v[100001]; long long int a[100001], mxx[100001]; map<int, int> mp[100001]; void unin(int x, int y) { if (mp[x].size() < mp[y].size()) { m...
#include <bits/stdc++.h> using namespace std; int main() { vector<int> a(6); int s = 0; for (int i = 0; i < 6; i++) { cin >> a[i]; s += a[i]; } if (s % 2 != 0) { cout << NO ; return 0; } for (int i = 0; i < 6; i++) for (int j = i + 1; j < 6; j++) fo...
#include <bits/stdc++.h> using namespace std; int main() { long long ans = 0; int n, m, k = 0; scanf( %d %d , &n, &m); vector<int> v(1e7); for (int i = 0; i < n; i++) { scanf( %d , &k); ans += v[(k ^ m)]; v[k]++; } printf( %I64d , ans); }
#include <bits/stdc++.h> using namespace std; int main() { char s[101]; int n; cin >> n; cin >> s; if (n == 1 && s[0] == 0 ) { cout << 0; return 0; } cout << 1; for (int i = 0; i < n; i++) if (s[i] == 0 ) cout << 0; return 0; }
#include <bits/stdc++.h> int main() { int m, s, c, i; std::cin >> m >> s; c = s; if (m == 1 && c == 0) std::cout << 0 << << 0; else { if (c == 0 \|\| c > (9 * m)) { std::cout << -1 << << -1; } else { for (i = m; i > 0; i--) { if (c <= 9 * (i - 1)) ...
#include <bits/stdc++.h> using namespace std; template <size_t N, size_t M> struct Suffix_Automata { int maxlen[N], trans[N][M], link[N], Size, Last, isclone[N]; Suffix_Automata() { Size = Last = 1; } void Extend(int id) { int cur = (++Size), p; maxlen[cur] = maxlen[Last] + 1; for (p...
#include <bits/stdc++.h> using namespace std; int n; string s, t, a; void dfs(int i, int c4, int c7, bool d) { if (c4 + n - i < n / 2 \|\| c7 + n - i < n / 2) return; if (i == n) { a = t; return; } if (d) { t[i] = 4 ; dfs(i + 1, c4 + 1, c7, 1); if (a != ) return; ...
#include <bits/stdc++.h> using namespace std; void read(int &k) { k = 0; char x = getchar(); while (x < 0 \|\| x > 9 ) x = getchar(); while (x >= 0 && x <= 9 ) { k = k * 10 - 48 + x; x = getchar(); } } int n, a[55], K; long double dp[55][55][55], ans, fac[55]; int main() ...
#include <bits/stdc++.h> using namespace std; int ok[101010]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; vector<int> ct(n); int tl = 0; int nn = 0; int odd = 0; for (int i = 0; i < n; i++) { cin >> ct[i]; tl += ct[i]; if (ct[i] % 2...
#include <bits/stdc++.h> #pragma GCC optimize ( Ofast , unroll-loops ) using namespace std; #define ll long long //#define int ll #define FOR(i,a,b) for (int i = (a); i<(b); i++) #define REP(i,n) FOR(i,0,n) #define REP1(i,n) FOR(i,1,n+1) #define RREP(i,n) for (int i=(n)-1; i>=0; i--) #define f first ...

#include <bits/stdc++.h> using namespace std; int n; long long h[100005], d; int dp[100005]; int arr[300003]; int tree[(1200004)]; int lazy[(1200004)]; void build_tree(int node, int a, int b) { if (a > b) return; if (a == b) { tree[node] = arr[a]; return; } build_tree(node * ...

#include <bits/stdc++.h> const int inf = 1 << 30; const long long INF = 1ll << 61; using namespace std; const int MOD = 1000000; int n; int nnum[500000 + 55]; int vis[1000000 + 55]; int flag[1000000 + 55]; vector<int> G; void init() { memset(flag, 0, sizeof(flag)); memset(nnum, 0, sizeof(nnu...

#include <bits/stdc++.h> using namespace std; vector<int> g[2000]; int vis[2000]; vector<pair<int, int> > cyc; void dfs(int x, int scc) { if (vis[x] > 0) { return; } vis[x] = 1; int j; for (int i = 0; i < g[x].size(); i++) { for (j = 0; j < g[g[x][i]].size(); j++) { if ...

#include <bits/stdc++.h> using namespace std; int gi() { int x = 0, w = 1; char ch = getchar(); while ((ch < 0 || ch > 9 ) && ch != - ) ch = getchar(); if (ch == - ) w = 0, ch = getchar(); while (ch >= 0 && ch <= 9 ) x = (x << 3) + (x << 1) + ch - 0 , ch = getchar(); return w ...

#include <bits/stdc++.h> using namespace std; bool spj(set<int>& s) { vector<int> v{s.begin(), s.end()}; return (v[2] == 3 * v[0] && v[1] == 2 * v[0]); } int main() { int n; scanf( %d , &n); vector<int> result; for (int i = n, factor = 1; i != 0; i /= 2, factor *= 2) { if (i == 3) ...

#include <bits/stdc++.h> using namespace std; int n, m, s, f, l, r, t; int stay() { int next = (s < f) ? s + 1 : s - 1; return (s >= l && s <= r) || (next >= l && next <= r); } int di[] = {0, 1}; int dj[] = {1, 0}; void write(vector<string> &res, int x, int y, int dir, string s) { for (int i =...

#include <bits/stdc++.h> using namespace std; string s; int dpl[2010], dpr[2010]; int main() { cin >> s; memset(dpr, 0, sizeof(dpr)); memset(dpl, 0, sizeof(dpl)); int i, j, k; for (i = 0; i < s.size(); i++) { for (j = i, k = i; j >= 0 && k < s.size() && s[k] == s[j]; j--, k++) ...

#include <bits/stdc++.h> using namespace std; map<int, int> ara; int main() { int n, k; cin >> n >> k; int t = n / 2; if (n == 1 && k != 0) { cout << -1; return 0; } if (n == 1 && k == 0) { cout << 1; return 0; } if (k < t) { cout << -1; return 0...

#include <bits/stdc++.h> using namespace std; const double PI = acos(-1.0); const double eps = 1e-6; const int inf = 1e9; const long long llf = 1e18; const int mod = 1e9 + 7; const int maxn = 1e5 + 10; char s[110]; int f[310]; int main() { int tc; cin >> tc; while (tc--) { cin >> s...

#include <bits/stdc++.h> int main() { std::vector<int> count(1 << 19); auto modify = [&](char *s, int dt) { int len = strlen(s); std::reverse(s, s + len); int val = 0; for (int i = 0; i < 18; ++i) { val = val | (i >= len ? 0 : (s[i] - 0 & 1)) << i; } count[val] +=...

#include <bits/stdc++.h> using namespace std; namespace Solve { const int MAXN = 200010; inline int ScanInt(void) { int r = 0, c, d; while (!isdigit(c = getchar()) && c != - ) ; if (c != - ) r = c - 0 ; d = c; while (isdigit(c = getchar())) r = r * 10 + c - 0 ; return d == - ...

#include <bits/stdc++.h> using namespace std; mt19937 rang(chrono::high_resolution_clock::now().time_since_epoch().count()); const long double PI = 3.141592653589793; const long long INF = 9223372036854775807ll; const long long mod = 1e9 + 7; const int N = 1e5 + 5; long long tree[4 * N + 10]; long long ...

#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int x1 = 0, x2 = 0, y1 = 0, y2 = 0, position = 0; int length = s.size(); for (int i = 0; i < length; i++) { if (s[i] == R ) { x1++; position++; } if (s[i] == L ) { x1--; ...

#include <bits/stdc++.h> using namespace std; const long ka[6] = {0, 0, 0, 0, 2, 4}; int main() { long long n, m; while (cin >> n >> m) { if (n > m) { int tmp = n; n = m; m = tmp; } long long ret; if (n == 1) ret = m / 6 * 6 + ka[m % 6]; else i...

#include <bits/stdc++.h> int n, i, x, ind[210], o = 0, e = 0; char a[200001], arr[200010]; int main() { scanf( %s , a); n = strlen(a); if (n == 1) { printf( %s n , a); return 0; } for (int i = 0; i < n; i++) { ind[a[i]]++; } for (int i = a ; i <= z ; i++) { if...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; inline int read() { int x = 0; char c = getchar(); bool f = 0; while (!isdigit(c)) f |= (c == - ), c = getchar(); while (isdigit(c)) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar(); return f ? -x : x; } int ...

#include <bits/stdc++.h> using namespace std; int main() { int x1, x2, x3; cin >> x1 >> x2 >> x3; int min, max; int t = (x1 < x2) ? x1 : x2; min = (t < x3) ? t : x3; t = (x1 > x2) ? x1 : x2; max = (t > x3) ? t : x3; cout << max - min; }

#include <bits/stdc++.h> using namespace std; const int N = 200005; const int p = 998244353; int n, k, cnt, a[N], d[N], jc[N], ny[N]; long long s = 1, ans; inline int read() { int ans = 0; char c = getchar(); while (c < 48 || c > 57) c = getchar(); while (c >= 48 && c <= 57) ans = (ans...

#include <bits/stdc++.h> using namespace std; const long long mod = 998244353; long long powmod(long long a, long long b) { long long res = 1; a %= mod; assert(b >= 0); for (; b; b >>= 1) { if (b & 1) res = res * a % mod; a = a * a % mod; } return res; } long long gcd(long ...

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

#include <bits/stdc++.h> using namespace std; const int Z = (int)3e3 + 228; const int N = (int)1e6 + 228; const int INF = (int)1e9 + 228; const int MOD = (int)1e9 + 7; int n, d; long long a[N], delta[N], k; bool can(long long mid) { fill(delta + 1, delta + 1 + n, 0LL); for (int i = 1; i <= n; i+...

#include <bits/stdc++.h> using namespace std; bool shown[100001]; vector<pair<int, int> > v; vector<int> cycle; vector<vector<int> > ans; int main() { int n, tmp; scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , &tmp); v.push_back(make_pair(tmp, i)); } sort(v.begin(...

#include <bits/stdc++.h> using namespace std; int main() { string s1, s2; long long int n, c11 = 0, c00 = 0, c10 = 0, c01 = 0, p1 = 0, p2 = 0; cin >> n >> s1 >> s2; n *= 2; for (int i = 0; i < n; i++) { if (s1[i] == s2[i]) { if (s1[i] == 1 ) c11++; else ...

#include <bits/stdc++.h> using namespace std; long long n, k, x, r, z, sol; int main() { cin >> n >> k; for (int i = 1; i <= n; i++) { cin >> x; if (r > 0) { x = x - k + r; sol++; } z = x / k; sol += z; r = x % k; } if (r > 0) { sol++; ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 1E6; int n, q, sz = 1; long long value[6]; long long dp[MAXN]; inline void upData(int v, long long w) { for (int i = MAXN - 1; i >= v; --i) dp[i] = max(dp[i], dp[i - v] + w); } inline void Divide(int x) { int v = 3 * sz, all = min(MA...

#include <bits/stdc++.h> using namespace std; long long mod = 1000000000 + 7; map<int, vector<int>> mp; vector<int> cur(1, -1), goal(1, -1), done(1, -1); vector<int> ans; int c; void funct(int node, int level, int even, int odd) { int r = level % 2; done[node] = 1; if (r == 1 && odd == 1) ...

#include <bits/stdc++.h> using namespace std; int main() { int n, m, a[60], b[60]; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; cin >> m; for (int i = 0; i < m; i++) cin >> b[i]; int BG = -1; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (b[j] % a[i] ...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; using ll = long long; using ld = long double; ll mod = 998244353; ll gcd(ll a, ll b) { if (a == 0 or b == 0) return a + b; return gcd(b, a % b); } ll sum(ll a, ll b) { a += b; a %= mod; return a; } ll sub...

#include <bits/stdc++.h> using namespace std; void solve() { int flag = 1; int a, b, c, d; cin >> a >> b >> c >> d; if ((a + b) % 2 == 0) { } else flag = -1; if (a + d == 0) { if (flag == 1) { cout << Tidak Tidak Ya Tidak << n ; return; } el...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; vector<int> a(n); for (auto &x : a) cin >> x; sort(a.begin(), a.end()); set<int> s; int ans = 0, x; for (int i = 0; i < n; i++) { x = a[i]; ...

#include <bits/stdc++.h> int main() { char a[1000]; scanf( %s , a); if (a[0] > 96) a[0] -= 32; printf( %s , a); }

#include <bits/stdc++.h> using namespace std; const int dx[] = {-1, 1, 0, 0}; const int dy[] = {0, 0, -1, 1}; const int max_n = 1000; char a[max_n][max_n]; int res[max_n][max_n], val[max_n * max_n]; vector<pair<int, int> > comp[max_n * max_n]; bool used[10]; bool range(int x, int l, int r) { return ((...

#include <bits/stdc++.h> using namespace std; int n, m, k; int a[10000]; int main() { cin >> n >> m >> k; for (int i = 0; i < n; i++) scanf( %d , a + i); if (n % 2 == 0) puts( 0 ); else { long long r = m / ((n + 1) / 2); long long hi = (1 << 30); for (int i = 0; i < n; i ...

#include <bits/stdc++.h> using namespace std; const int MaxN = 1e5 + 5; int main() { int n, f[MaxN], cnt[MaxN], mm = 0, ans = 0; scanf( %d , &n); memset(f, 0, sizeof(f)); memset(cnt, 0, sizeof(cnt)); for (int i = 1; i <= n; i++) { int a; scanf( %d , &a); cnt[f[a]]--; f[...

#include <bits/stdc++.h> using namespace std; using ll = long long; const ll OO = 0x3f3f3f3f3f3f3f3fLL; int di[8] = {0, 0, 1, -1, -1, 1, -1, 1}; int dj[8] = {1, -1, 0, 0, 1, 1, -1, -1}; string ys = YES , no = NO ; const int N = 1e5 + 5, M = 5 * (1 << 10) + 10; int main() { ios_base::sync_with_stdi...

#include <bits/stdc++.h> using namespace std; int n; string a; void input() { cin >> n; cin >> a; } void solve() { int ans = 0; for (int i = 1; i < n; ++i) { ans += (a[i] == a[i - 1]); } cout << (ans + 1) / 2 << n ; } int main() { ios_base ::sync_with_stdio(false); ...

#include <bits/stdc++.h> using namespace std; int A = 0, B = 0, C = 0; void add(char o) { if (o == A ) { A++; } else { if (o == B ) { B++; } else { if (o == C ) { C++; } } } } void sub(char o) { if (o == A ) { A--; } else ...

#include <bits/stdc++.h> const long long oo = (long long)1e18 + 1; using namespace std; int n, q; int b[200002]; pair<int, int> a[200002]; int T[200002]; vector<pair<int, int> > query[200002]; int k[200002], p[200002]; int res[200002]; void upd(int x) { while (x < 200002) { T[x]++; x...

#include <bits/stdc++.h> #pragma comment(linker, /stack:200000000 ) #pragma GCC optimize( Ofast ) #pragma target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; inline int read() { char c = getchar(); int tot = 1; while ((c < 0 || c > 9 ) && c != - ) c = getcha...

#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } const int MAXN = 16; int n; int mod[MAXN], rem[MAXN]; int egcd(int a, int b, int &x, int &y) { if (b == 0) { x = 1, y = 0; return a; } int g = egcd(b, a % b, x...

#include <bits/stdc++.h> template <typename T> inline bool chkmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; } template <typename T> inline bool chkmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; } inline int read() { static char ch; bool sgn = false; while (ch = getchar(), ...

#include <bits/stdc++.h> using namespace std; long long st; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long n, m, k; cin >> n >> m >> k; if (k < n) { cout << (long long)(k + 1) << << 1; return 0; } k -= (long long)(n - 1); long long row = k /...

#include <bits/stdc++.h> using namespace std; int main() { long long int n, a[100000], b, c = 0, x, y, z, m, i, j, t; string s; vector<int> v; cin >> n; for (i = 0; i < n; i++) { cin >> x; v.push_back(x); } sort(v.begin(), v.end()); for (i = 0; i < n / 2; i++) { c +...

#include <bits/stdc++.h> using namespace std; const long long N = 3e5 + 2; const long long N1 = 1e2 + 2; const long long mod = 1e9 + 7; const int MASK = 1 << 17 + 1; const int who = 6 * N * log2(N); long long power(long long a, long long b, long long c) { long long ret = 1; while (b) { if (b...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:36777216 ) using namespace std; template <typename T1, typename T2> inline void chkmin(T1 &a, T2 b) { if (a > b) a = b; } template <typename T1, typename T2> inline void chkmax(T1 &a, T2 b) { if (a < b) a = b; } const string FILENAME = ...

#include <bits/stdc++.h> using namespace std; int n, m; bool f[100009]; pair<int, int> a[100009]; vector<int> v[100009]; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &a[i].first); a[i].second = i; } sort(a + 1, a + n + 1); for (int i = 1; i <= n; i...

#include <bits/stdc++.h> using namespace std; void arr(string &s); int main() { int n = 0, k = 0, m = 0; bool b = 0; cin >> n >> k; string s = ; cin >> s; arr(s); for (int i = 0; i < s.length(); i++) switch (s[i]) { case G : m = i; i = s.length(); ...

#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 7; int a[N], b[N], na[N], nb[N], t1[N], t2[N], c[N], tp, q[N], mx[N], x, n, m, i, j; long long ans; void init(int* a, int* ans, int n) { for (memset(ans, 0x3f, (n + 3) << 2), tp = 0, i = 1; i <= n; ++i) { j = a[i]; while (...

#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0, c = getchar(), f = 0; for (; c > 9 || c < 0 ; f = c == - , c = getchar()) ; for (; c >= 0 && c <= 9 ; x = (x << 1) + (x << 3) + c - 0 , c = getchar()) ; return f ? -x : x; } inline void write(int x) ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int TESTS = 1; while (TESTS--) { long long m = 1, ans = 1; long long n; cin >> n; while (ans < n) { m++; ans += 2; } cout << m...

#include <bits/stdc++.h> using namespace std; const int INF = 2147483647; const long long LLINF = 9223372036854775807LL; const int ST = 100010; const int ST1 = 1000010; const long long MOD = 1000000007; long long ABS(long long a) { if (a < 0) return a * (-1); else return a; } int m...

#include <bits/stdc++.h> using namespace std; int read() { int x = 0, sgn = 1; char ch = getchar(); for (; !isdigit(ch); ch = getchar()) if (ch == - ) sgn = -1; for (; isdigit(ch); ch = getchar()) x = (x << 1) + (x << 3) + (ch ^ 48); return x * sgn; } const int N = 1e5 + 10; int n, ...

#include <bits/stdc++.h> using namespace std; char *student; int *arr; struct node { int x; int y; int val; }; std::vector<node> v; std::vector<node> out; struct edge { int v; edge *left; edge *right; }; edge *ed; bool *flag; bool comp(node &a, node &b) { return (!(a....

#include <bits/stdc++.h> using namespace std; const long double PI = acos(-1); pair<long double, long double> sum(pair<long double, long double> a, pair<long double, long double> b) { return {a.first + b.first, a.second + b.second}; } long double cross(pair<long double...

#include <bits/stdc++.h> using namespace std; long long n, a, b, c; long long d; long long cnt1, cnt2; long long r; int main() { cin >> n >> a >> b >> c; d = b - c; if (n >= a) { cnt1 = n / a; r = n % a; if (r >= b) cnt1 += (r - b) / d + 1; } if (n >= b) { r = n -...

#include <bits/stdc++.h> using namespace std; int n, i; int fi = 0, se = 0, th = 0, fo = 0; int main() { cin >> n; cout << +------------------------+ << endl; if (n >= 3) { n--; th++; } while (n) { if (n) { fi++; n--; } if (n) { se++; ...

#include <bits/stdc++.h> using namespace std; int main() { int n, temp, count = 0, found = 0; cin >> n; int a[n]; for (int i = 0; i < n; i++) { cin >> temp; if (temp == i) ++count; else if (temp < i && a[temp] == i) found = 2; else if (found != 2) foun...

#include <bits/stdc++.h> using namespace std; struct sheet { long long xt, yt, xb, yb; }; sheet a[3]; long long flag = 0; void hor() { long long yc = a[0].yb; for (double x = a[0].xb; x <= a[0].xt; x += .5) { if (a[1].xb <= x && x <= a[1].xt && a[1].yb <= yc && yc <= a[1].yt) { con...

#include <bits/stdc++.h> using namespace std; void ret(string s) { cout << s; exit(0); } int main() { int x1, x2, y1, y2, n; cin >> n >> x1 >> y1 >> x2 >> y2; if (x1 * x2 == 0 && x1 + x2 == n) cout << min(n + y1 + y2, 3 * n - y1 - y2); else if (y1 * y2 == 0 && y1 + y2 == n) c...

#include <bits/stdc++.h> using namespace std; const int N = 34; const int M = 70; int n; int arr[N]; int dp[N][M * M][M]; int find(int pos, int sum, int cnt) { if (pos > n) { return (sum * 2 == cnt * (cnt - 1)) ? cnt : M; } if (dp[pos][sum][cnt] != -1) { return dp[pos][sum][cnt]; ...

#include <bits/stdc++.h> using namespace std; int tmp, n, tr[100005 * 30][2], cnt; inline void insert(int x) { int p = 0, d; for (int i = 29; i >= 0; --i) { d = (x >> i) & 1; if (tr[p][d]) p = tr[p][d]; else { tr[p][d] = ++cnt; p = cnt; memset(tr[p], 0, si...

#include <bits/stdc++.h> using namespace std; void solve() { vector<long long> arr(4); for (int i = 0; i < 4; i++) cin >> arr[i]; int counter = 0; for (int i = 0; i < 4; i++) counter += arr[i] % 2; if (counter == 0 || counter == 1 || counter == 4) { cout << Yes n ; return; } els...

#include <bits/stdc++.h> using namespace std; const int N = 250; int n, m, B, ans; int co[N], sx[N], sy[N]; int mp[N][N], id[N], fl[N]; bool cmp(int x, int y) { return sy[x] < sy[y]; } const int ND = 500; struct edge { int to, next, f, v; } e[N * N]; int head[ND], cur[ND], tot; int S, T, dis[N...

#include <bits/stdc++.h> using namespace std; int n, m, t; pair<int, int> a[300005]; int b[300005]; int force(int ll, int rr) { int r = 0; for (int i = 1; i <= n; i++) if (a[i].first >= ll && a[i].second <= rr) r++; return r; } struct indexed_tree_2d { vector<int> T[1000006]; voi...

#include <bits/stdc++.h> using namespace std; vector<pair<int, pair<int, int> > > v[100005]; vector<int> ans; int n; bool has_cycle(int mid) { int indeg[100005]; int cnt = 0, x; memset(indeg, 0, sizeof(indeg)); for (int i = 1; i <= n; ++i) { for (auto g : v[i]) { if (g.second.fir...

#include <bits/stdc++.h> int func(int num) { if (num > 0) return 1; else if (num < 0) return -1; else return num; } int main() { char a[101], b[101]; int i; scanf( %s , &a); scanf( %s , &b); for (i = 0; i < strlen(a); i++) if (a[i] >= A && a[i] <= Z ) a[i...

#include <bits/stdc++.h> using namespace std; int DEBUG = 0; int main(int argc, char **argv) { DEBUG = (argc >= 2) ? atoi(argv[1]) : 0; int t; cin >> t; for (int c = 0; c < t; c++) { char tmp; int board[8][8]; int kx[2]; int ky[2]; int eger = 0; for (int i = 0; ...

#include <bits/stdc++.h> using namespace std; const int64_t mod = 1000000007; int main() { int n; cin >> n; int64_t ways = 1; for (int i = 0; i < 3 * n; ++i) { ways *= 3; ways %= mod; } int64_t bad = 1; for (int i = 0; i < n; ++i) { bad *= 7; bad %= mod; } ...

#include <bits/stdc++.h> using namespace std; long long A[100005 * 10]; long long B[100005 * 10]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long tst = 1; for (long long tt = 1; tt <= tst; tt++) { long long n, a, mn = 1e12, m, res = 0; ...

#include <bits/stdc++.h> using namespace std; int N; pair<pair<int, int>, int> V[100005]; vector<int> r; bool cmp(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) { if (a.first.first != b.first.first) return a.first.first > b.first.first; return a.first.second > b.first.second; } int main...

#include <bits/stdc++.h> using namespace std; using LL = long long; constexpr int maxn = 100; int a[maxn]; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int t; for (cin >> t; t; t -= 1) { int n, x, am = 0, ok = 0; cin >> n >> x; for (int a...

#include <bits/stdc++.h> using namespace std; int caseno = 1; typedef long long LL; typedef unsigned long long ULL; typedef long long int64; typedef unsigned long long uint64; const int SIZE = 100 + 10; int ar[SIZE]; int main() { std::ios_base::sync_with_stdio(0); int tcases, I, J, K, N, n, m,...

#include <bits/stdc++.h> using namespace std; const int INF = 2147483647; const long long LLINF = 9223372036854775807LL; int digsum(long long x) { int ans = 0; do { ans += x % 10; x /= 10; } while (x); return ans; } int main() { int a, b, c; cin >> a >> b >> c; vector...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:671088640 ) using namespace std; const int MOD = 1000000007; const int INF = 20000000; const long double EPS = 1e-7; const int HASH_POW = 29; const long double PI = acos(-1.0); mt19937_64 rnd(1); double workTime() { return double(clock()) / CLOC...

#include <bits/stdc++.h> using namespace std; int main() { int tst; cin >> tst; while (tst--) { int i, j, k, l, m, n; cin >> n; string s; cin >> s; set<int> ze, on; for (i = 0; i < n; i++) { if (s[i] == 1 ) on.insert(i); else ze.in...

#include <bits/stdc++.h> using namespace std; unsigned long long int t, k, x; int main() { ios_base::sync_with_stdio(0); cin >> t; for (; t > 0; t--) { cin >> k >> x; cout << (k - 1) * 9 + x << endl; } }

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

#include <bits/stdc++.h> using namespace std; const int N = 4e4 + 10; const int inf = 1e9; int t; int n; int b[N], ans[N]; void solve() { cin >> n; for (int i = 0; i < n; i++) cin >> b[i]; long long tot = 0; for (int i = 0; i < n; i++) tot += b[i]; if (tot % (n * (n + 1) / 2) != 0) { ...

#include <bits/stdc++.h> using namespace std; const long long Max = 1e5 + 10; int T; long long n, m; long long number[Max]; int main() { cin >> T; while (T--) { cin >> n >> m; long long ans = 1; int k = 1; for (int i = 1;; i *= 2) { number[k] = number[k - 1] + i; ...

#include <bits/stdc++.h> const double eps = 1e-10; const float epsf = 1e-6; using namespace std; inline long long int __gcd(long long int a, long long int b) { if (a == 0 || b == 0) { return max(a, b); } long long int tempa, tempb; while (1) { if (a % b == 0) return b; ...

#include <bits/stdc++.h> using namespace std; double prec = 0.00000001; void calcHistory(vector<double>& history, int hp2, double p1, int l1, int h1) { double h[201]; double newh[201]; memset(h, 0, sizeof(h)); memset(newh, 0, sizeof(newh)); h[hp2] = 1.; for (int i = 0; i < history.size(); ...

#include <bits/stdc++.h> using namespace std; int n, m; long long l[200020], r[200020]; struct node { long long x, y, p; } a[200020]; long long ans[200020]; struct bridge { long long p, v; }; struct Compare { bool operator()(const bridge& a, const bridge& b) const { if (a.v < b.v || ...

#include <bits/stdc++.h> using namespace std; int a[111]; int main() { int mx = 1000000000; int cnt, n; scanf( %d , &n); int sum = 0; cnt = 0; int k = 0; for (int i = 1; i < n * 2; ++i) { scanf( %d , &a[i]); sum += abs(a[i]); mx = ((mx) < (abs(a[i])) ? (mx) : (abs(a[i...

#include <bits/stdc++.h> using namespace std; const double eps = 1e-8; char a[1010], b[1010]; int h = 0; int main() { scanf( %s , a); int l = strlen(a); int j = 0; for (int i = 0; i < l; i++) { b[j++] = a[i]; if (a[i] == > ) { b[j] = 0; if (b[1] == / ) h--; ...

#include <bits/stdc++.h> using namespace std; default_random_engine generator; uniform_int_distribution<int> distribution(1, INT_MAX); long long my_rand(long long a = 0, long long b = INT_MAX) { return a + distribution(generator) % b; } inline int mul(int a, int b) { return int(a * 1ll * b % 998244353);...

#include <bits/stdc++.h> using namespace std; const int N = 1000010; struct node { int x, id; } a[N], ans[N]; int anss; bool cmp(node x, node y) { if (x.x != y.x) return x.x > y.x; return x.id < y.id; } void solve() { int k = a[2].x / a[3].x; while (k) { if (k & 1) { a[...

#include <bits/stdc++.h> using namespace std; const int maxn = 59; const long long mod = 998244353; int add[maxn]; long long w[maxn]; long long dp[52][52][52]; long long val[52][52][52]; bool vis[52][52][52]; long long Pow(long long a, long long b) { long long res = 1; a %= mod; while (b) ...

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

#include <bits/stdc++.h> using namespace std; using LL = long long int; template <class TH> void _dbg(const char *sdbg, TH h) { cerr << sdbg << = << h << n ; } template <class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) { while (*sdbg != , ) cerr << *sdbg++; cerr << = <<...

#include <bits/stdc++.h> int main() { std::ios::sync_with_stdio(false); int n; long long m, k; long long tmp; std::cin >> n >> m >> k; std::vector<long long> a; for (int i = 0; i < n; i++) { std::cin >> tmp; a.push_back(tmp); } std::sort(a.begin(), a.end()); std::co...

#include <bits/stdc++.h> using namespace std; const long long oo = 1000000000000000000; long long sum, ans = 0, mx = 0, mn = 1000000000, num, pos; vector<int> v[100001]; long long int a[100001], mxx[100001]; map<int, int> mp[100001]; void unin(int x, int y) { if (mp[x].size() < mp[y].size()) { m...

#include <bits/stdc++.h> using namespace std; int main() { vector<int> a(6); int s = 0; for (int i = 0; i < 6; i++) { cin >> a[i]; s += a[i]; } if (s % 2 != 0) { cout << NO ; return 0; } for (int i = 0; i < 6; i++) for (int j = i + 1; j < 6; j++) fo...

#include <bits/stdc++.h> using namespace std; int main() { long long ans = 0; int n, m, k = 0; scanf( %d %d , &n, &m); vector<int> v(1e7); for (int i = 0; i < n; i++) { scanf( %d , &k); ans += v[(k ^ m)]; v[k]++; } printf( %I64d , ans); }

#include <bits/stdc++.h> using namespace std; int main() { char s[101]; int n; cin >> n; cin >> s; if (n == 1 && s[0] == 0 ) { cout << 0; return 0; } cout << 1; for (int i = 0; i < n; i++) if (s[i] == 0 ) cout << 0; return 0; }

#include <bits/stdc++.h> int main() { int m, s, c, i; std::cin >> m >> s; c = s; if (m == 1 && c == 0) std::cout << 0 << << 0; else { if (c == 0 || c > (9 * m)) { std::cout << -1 << << -1; } else { for (i = m; i > 0; i--) { if (c <= 9 * (i - 1)) ...

#include <bits/stdc++.h> using namespace std; template <size_t N, size_t M> struct Suffix_Automata { int maxlen[N], trans[N][M], link[N], Size, Last, isclone[N]; Suffix_Automata() { Size = Last = 1; } void Extend(int id) { int cur = (++Size), p; maxlen[cur] = maxlen[Last] + 1; for (p...

#include <bits/stdc++.h> using namespace std; int n; string s, t, a; void dfs(int i, int c4, int c7, bool d) { if (c4 + n - i < n / 2 || c7 + n - i < n / 2) return; if (i == n) { a = t; return; } if (d) { t[i] = 4 ; dfs(i + 1, c4 + 1, c7, 1); if (a != ) return; ...

#include <bits/stdc++.h> using namespace std; void read(int &k) { k = 0; char x = getchar(); while (x < 0 || x > 9 ) x = getchar(); while (x >= 0 && x <= 9 ) { k = k * 10 - 48 + x; x = getchar(); } } int n, a[55], K; long double dp[55][55][55], ans, fac[55]; int main() ...

#include <bits/stdc++.h> using namespace std; int ok[101010]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; vector<int> ct(n); int tl = 0; int nn = 0; int odd = 0; for (int i = 0; i < n; i++) { cin >> ct[i]; tl += ct[i]; if (ct[i] % 2...

#include <bits/stdc++.h> #pragma GCC optimize ( Ofast , unroll-loops ) using namespace std; #define ll long long //#define int ll #define FOR(i,a,b) for (int i = (a); i<(b); i++) #define REP(i,n) FOR(i,0,n) #define REP1(i,n) FOR(i,1,n+1) #define RREP(i,n) for (int i=(n)-1; i>=0; i--) #define f first ...