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; const int N = 4e5 + 5; int n, m, fa[N], b[N], ans; struct edge { int u, v, w; } e[N]; bool cmp(edge x, edge y) { return x.w > y.w; } int find(int x) { return x == fa[x] ? x : fa[x] = find(fa[x]); } int main() { scanf( %d%d , &n, &m); for (registe...
#include <bits/stdc++.h> using namespace std; struct Point { long long x, y; int type; void get(int t) { cin >> x >> y; type = t; } }; int N, M; Point R[500], B[500], P[1000], pivot; bool used[500]; Point operator-(Point p1, Point p2) { return Point{p1.x - p2.x, p1.y - p2.y}; }...
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; if (n > m) swap(n, m); switch (n) { case 1: cout << m / 6 * 6 + 2 * max(m % 6 - 3, 0); break; case 2: switch (m) { case 2: cout << 0; break; ...
#include <bits/stdc++.h> using namespace std; int a[500000 + 5], ans[500000 + 5]; int main() { int n, k, d; cin >> n >> k >> d; for (int i = 0; i < n; i++) { cin >> a[i]; } sort(a, a + n); ans[n + 1] = 0; ans[n] = 1; int lptr = n - 1, dptr = n - 1; for (int i = n - 1; i >...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); cerr.tie(nullptr); int n, p, k; cin >> n >> p >> k; map<int, int> mp; long long sol = 0; for (int i = 0; i < n; i++) { int x; cin >> x; ...
#include <bits/stdc++.h> using namespace std; const long double pi = 3.1415926535897932384626433832795l; template <typename T> inline auto sqr(T x) -> decltype(x * x) { return x * x; } template <typename T1, typename T2> inline bool umx(T1& a, T2 b) { if (a < b) { a = b; return 1; ...
#include <bits/stdc++.h> #pragma GCC optimize(2) #pragma GCC optimize(3) #pragma GCC optimize( Ofast ) #pragma GCC optimize( inline ) #pragma GCC optimize( -fgcse ) #pragma GCC optimize( -fgcse-lm ) #pragma GCC optimize( -fipa-sra ) #pragma GCC optimize( -ftree-pre ) #pragma GCC optimize( -ftree-vrp )...
#include <bits/stdc++.h> using namespace std; vector<int> knapsack(long long lim, vector<int> allItems) { vector<bool> mark; int mx = 0; for (auto it : allItems) mx += it; mx = min((long long)mx, lim); mark.assign(mx + 1, 0); mark[0] = true; for (auto it : allItems) { for (int i = ...
#include <bits/stdc++.h> using namespace std; long long power(long long a, long long b) { long long result = 1; while (b > 0) { if (b % 2 == 1) { result = a; } a = a; b /= 2; } return result; } long long gcd(long long x, long long y) { long long r; while...
#include <bits/stdc++.h> int main() { long long n, k; scanf( %lld %lld , &n, &k); long long total(0), count(0); for (long long p = 1; p <= n; p++) { long long x; scanf( %lld , &x); if (p > 1 && total - x * (n - p) * (p - count - 1) < k) { printf( %lld n , p); ++count;...
#include <bits/stdc++.h> using namespace std; inline int IN() { int x = 0, ch = getchar(), f = 1; while (!isdigit(ch) && (ch != - ) && (ch != EOF)) ch = getchar(); if (ch == - ) { f = -1; ch = getchar(); } while (isdigit(ch)) { x = (x << 1) + (x << 3) + ch - 0 ; ch = g...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; for (int i = 0; i < t; ++i) { int n; cin >> n; string s; cin >> s; int sum(0), pos(-1), pos1(-1), ot(-1), num(0); for (int i = 0; i < s.length(); ++i) sum += (s[i] - 0 ); for (int i = 0...
#include <bits/stdc++.h> double a, b, c, d, x, y; int main() { scanf( %lf%lf%lf%lf , &a, &b, &c, &d); x = a / b; y = c / d; printf( %lf , x / (1.0 - (1.0 - x) * (1.0 - y))); }
#include <bits/stdc++.h> using namespace std; using ll = long long; const ll OO = 1e18; 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 ; void fast() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); } string s1, s2; int...
#include <bits/stdc++.h> using namespace std; void solutionA(); int main() { ios_base::sync_with_stdio(false); solutionA(); return EXIT_SUCCESS; } long long n, a, b, u[1024]; double d[1024]; struct point { double x, y; point(double x = 0, double y = 0) : x(x), y(y) {} } s, f; struc...
#include <bits/stdc++.h> using namespace std; long long sol(long long n, long long t) { long long ret = n * (n + 1) * (2 * n + 3 * t + 1); ret /= 6; return ret; } int main() { ios_base::sync_with_stdio(0); long long x; cin >> x; long long ans = 0; vector<pair<long long, long long...
#include <bits/stdc++.h> using namespace std; template <class c> struct rge { c b, e; }; template <class c> rge<c> range(c i, c j) { return rge<c>{i, j}; } template <class c> auto dud(c* x) -> decltype(cerr << *x, 0); template <class c> char dud(...); struct debug { template <class c...
#include <bits/stdc++.h> using namespace std; vector<int> v[1000005]; int ok[2][1000005]; int main() { int q; cin >> q; while (q--) { int n; cin >> n; for (int i = 0; i < n; i++) ok[0][i] = 0; set<int> s; for (int i = 0; i < n; i++) s.insert(i); int cnt = 0; ...
#include <bits/stdc++.h> using namespace std; int main() { int n, m, a[55], b[55], c, mx; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; } cin >> m; for (int j = 1; j <= m; j++) { cin >> b[j]; } mx = 0; c = 1; for (int i = 1; i <= n; i++) { for (int j...
#include <bits/stdc++.h> #pragma GCC target( avx2 ) #pragma GCC optimization( O3 ) #pragma GCC optimization( unroll-loops ) int dx[] = {0, 0, 1, -1, 1, -1, 1, -1}; int dy[] = {1, -1, 0, 0, -1, 1, 1, -1}; const double PI = acos(-1), EPS = 1e-7; const int OO = 0x3f3f3f3f, N = 1e7 + 5, mod = 1e9 + 7; using...
#include <bits/stdc++.h> using namespace std; int months[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; string itos(long long i) { string s = ; while (i) { s += char(i % 10 + 0 ); i /= 10; } reverse(s.begin(), s.end()); return s; } long long stoi(string &s) { ...
#include <bits/stdc++.h> using namespace std; set<int> se; struct zzz { int v, id; } zz[1000005]; bool cmp(const zzz &i, const zzz &j) { return i.v > j.v; } int N, M, K; char S[1000005], T[1000005], s[1000005]; int z[1000005], p[2][1000005]; void w(int td) { for (int i = 0; i < M; i++) s[i] = ...
#include <bits/stdc++.h> const int N = 100005; int n, fa[N], rt, cnt = 0, sz[N], son[N] = {0}, top[N], dep[N], idx = 0, Q, dfn[N], head[N], hq[N], nodes = 0, year[N]; int ret, L, R; inline int readint() { int c = getchar(), d = 0; for (; !isdigit(c); c = getchar()) ; for (;...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1005; const int INF = 0x3f3f3f3f; int n, a[MAXN]; vector<int> ans; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); if (i != 1 && a[i] == 1) ans.push_back(a[i - 1]); } ans.push_back(a[n...
#include <bits/stdc++.h> int n, i, a[10001], p = 0; int main() { scanf( %d , &n); for (i = 1; i <= n; i++) scanf( %d , &a[i]); for (i = 1; i <= n; i++) { if (a[i] == 1) p++; } if (n > 1) { if (p == (n - 1)) printf( YES ); else printf( NO ); } else { if...
#include <bits/stdc++.h> using namespace std; int n; int main() { cin >> n; if (n % 2 == 0) cout << white n << 1 2 n ; else cout << black n ; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 505; const int dr[4] = {0, 0, -1, 1}; const int dc[4] = {-1, 1, 0, 0}; int n, K, mien, ans, res, t; int sz[N * N], vis[N * N], c[N][N]; char a[N][N]; bool ok(int x, int y) { return x >= 1 && x <= n && y >= 1 && y <= n && a[x][y] == . ; }...
#include <bits/stdc++.h> #define all(x) (x).begin(),(x).end() #define sz(x) int(x.size()) using namespace std; using ll = long long; using pii = pair<int, int>; template<typename... T> void rd(T&... args) {((cin>>args), ...);} template<typename... T> void wr(T... args) {((cout<<args<< ), ...); cou...
#include <bits/stdc++.h> using namespace std; int f[1 << 21], a[210000], i, j, minn, ans, n, l, k; char c[22]; void Min(int &x, int y) { if (y < x) x = y; } int main() { scanf( %d , &n); for (i = 1; i <= n; ++i) { scanf( %s , c + 1); l = strlen(c + 1); for (j = 1; j <= l; ++j) ...
#include <bits/stdc++.h> using namespace std; void kaboom() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } int main() { kaboom(); int t; cin >> t; while (t--) { long long int n; cin >> n; cout << n << endl; } }
#include <bits/stdc++.h> using namespace std; int main() { int name[100], i, j = 0; string codename; cin >> codename; for (i = 0; i < codename.length(); i++) { name[j] = (int)codename[i]; j++; } sort(name, name + j); int count = 0; for (int k = 1; k < j; k++) { if (...
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, d; cin >> a >> b >> c >> d; if (max((3 * a / 10), a - a / 250 * c) == max((3 * b / 10), b - b / 250 * d)) cout << Tie ; else if (max((3 * a / 10), a - a / 250 * c) > max((3 * b / 10), b - b / 250 * d)) ...
#include <bits/stdc++.h> using namespace std; long long int a[100005]; int main() { long long int n, b, k; cin >> k >> b >> n; for (int i = 0; i < n; i++) { cin >> a[i]; } long long int ans = 0; if (b == 0) { for (int i = 0; i < n;) { long long int now = a[i]; l...
#include <bits/stdc++.h> using namespace std; int solve() { int n; cin >> n; int e = 0, o = 0; int x; for (int i = 0; i < n; i++) { cin >> x; if (i % 2 == 0 && x % 2 == 1) o++; if (i % 2 == 1 && x % 2 == 0) e++; } if (o == e) return o; return -1; } int main() { ...
#include <bits/stdc++.h> using ll = long long; using namespace std; using pii = pair<ll, ll>; ll mod = 998244353; int get_p2(int n) { int i = 0; while ((1 << i) <= n) i++; return i - 1; } int main() { ios_base::sync_with_stdio(0); int t; cin >> t; while (t--) { int n; ...
#include <bits/stdc++.h> using namespace std; const string sf[6] = { lios , liala , etr , etra , initis , inites }; char a[1100000], s[1100000]; int n, sd, p, num[3]; int gender; int suffix(int x) { int len = strlen(s); if (len < (int)sf[x].length()) return 0; for (int i = len - sf[x].lengt...
#include <bits/stdc++.h> using namespace std; int main() { int q, n, i, a[201], start, tmp, yn; cin >> q; while (q--) { cin >> n; for (i = 0; i < n; i++) { cin >> a[i]; if (a[i] == 1) start = i; } yn = 0; tmp = 1; for (i = 0; i < n - 1; i++) if...
#include <bits/stdc++.h> using namespace std; ifstream Cin( input.txt ); ofstream Cout( output.txt ); pair<bool, long long> Try(long long A, long long B, long long N) { long long err = 0, C; while (A > 0 && B > 0 && N > 0) { if (A == 1 && B != 1) { C = B - 1; A = B = 1; } els...
#include <bits/stdc++.h> using namespace std; int l; char s[205]; int exe(int a, int b) { int u = 0, r = 0; for (int i = a; i < b; i++) { switch (s[i]) { case U : u++; break; case D : u--; break; case R : r++; b...
#include <bits/stdc++.h> using namespace std; const long long MOD = 1000000007; void solve() { long long n; cin >> n; vector<long long> v(n); for (long long i = 0; i < n; ++i) { cin >> v[i]; } long long ans = 0; map<long long, long long> mp; for (long long i = 0; i < n; i++) ...
#include <bits/stdc++.h> using namespace std; const int N = 201; int n, a[N], cum[N][N], k, freq[N]; vector<int> hs; int calc(int l, int r) { priority_queue<int> qu; int res = 0; for (int i = l; i <= r; ++i) { qu.push(-hs[a[i]]); res += hs[a[i]]; } int sz = hs.size(), op = k; ...
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 5; int n, x[2], need[N][2]; pair<int, int> p[N]; int main() { ios::sync_with_stdio(false); cin >> n >> x[0] >> x[1]; for (int i = 0; i < n; i++) { int c; cin >> c; p[i] = {c, i}; } sort(p, p + n); for (...
#include <bits/stdc++.h> using namespace std; const double Eps = 1e-9; int Mod = 1000000000 + 7; int n, m, q, k; int Arr[100010]; bool prime[10010]; bool ok = true; void sieve() { for (int i = 2; i * i <= 1e4; i++) { if (prime[i] == true) for (int j = i * 2; j <= 1e4; j++) { ...
#include <bits/stdc++.h> using namespace std; int N; vector<int> fen, v; void _update(int i) { while (i <= N) { fen[i]++; i += i & -i; } } int _sum(int i) { int ret = 0; while (i > 0) { ret += fen[i]; i -= i & -i; } return ret; } int _bin(int i) { int ...
#include <bits/stdc++.h> using namespace std; long long dp[1010][105], po[1010], po2[1010]; long long qui(long long a, long long n, long long m) { long long ans = 1; while (n) { if (n & 1) ans = (ans * a) % m; n >>= 1; a = (a * a) % m; } return ans; }; int main() { long l...
#include <bits/stdc++.h> using namespace std; int read() { char c = getchar(); int t = 0, f = 1; while (c > 9 \|\| c < 0 ) f = (c == - ) ? -1 : 1, c = getchar(); while (c >= 0 && c <= 9 ) t = t * 10 + c - 0 , c = getchar(); return t * f; } struct node { int L, R, po, id; bool o...
#include <bits/stdc++.h> using namespace std; long long int pow_mod(long long int a, long long int b) { long long int res = 1; while (b != 0) { if (b & 1) { res = (res * a) % 1000000007; } a = (a * a) % 1000000007; b /= 2; } return res; } void solve() { long l...
#include <bits/stdc++.h> using namespace std; int main() { int y, a, b, c, d, temp; while (cin >> y) { temp = y + 1; while (temp != 0) { a = temp % 10; b = (temp % 100) / 10; c = (temp % 1000) / 100; d = temp / 1000; if (a == b \|\| b == c \|\| c == d \|\| d == ...
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using ll = long long int; using namespace std; template <class c> struct rge { c b, e; }; template <class c> rge<c> range(c i, c j) { return rge<c>{i, j}; } template <class c> auto dud(c x) -> decltype(cerr << x, 0); template <class c...
#include <bits/stdc++.h> using namespace std; const int MOD = (int)1e9 + 7; const double EPS = 1e-9; const int INF = INT_MAX; const long long INFLL = (long long)1e18; const double PI = acos(-1.0); template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; } template <class T> T lcm(T a...
#include <bits/stdc++.h> using namespace std; vector<int> mp[105]; int vis[105]; struct node { int fa; int kid; node(int fa, int b) { this->fa = fa; kid = b; } }; bool bfs(int rt, int n) { queue<node> q; q.push(node(-1, rt)); vis[rt] = 1; while (!q.empty()) { ...
#include <bits/stdc++.h> int main() { int a; while (scanf( %d , &a) != EOF) printf( %d %d %d n , 0, 0, a); return 0; }
#include <bits/stdc++.h> using namespace std; int maxrob(int p, int f, int cnt_s, int cnt_w, int s, int w) { if (p > f) { swap(p, f); } if (s > w) { swap(cnt_s, cnt_w); swap(s, w); } long long s_total = (long long)cnt_s * s; if ((p + f) <= s_total) { return (p / s) + ...
#include <bits/stdc++.h> using namespace std; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long t = 1, n, k, fact, a, b; cin >> t; while (t--) { cin >> a >> b; if (a == 1) cout << 0 n ; else if (a == 2) cout << b <<...
#include <bits/stdc++.h> using namespace std; int n, m; int res[100010], k = 0; struct edge { int id, v, w, next; } e[100010]; int head[100010], cnt = 0; void adde(int u, int v, int w, int id) { e[cnt].id = id; e[cnt].v = v; e[cnt].w = w; e[cnt].next = head[u]; head[u] = cnt++; }...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr); long long int t; cin >> t; while (t--) { string s; cin >> s; if (s.size() == 1) { cout << 0 << endl; continue; } map<char, i...
#include <bits/stdc++.h> char s[1111111]; int f[1111111]; int c[1111111]; int d[1111111]; int main() { int i, j, n, m, l; scanf( %d%d%s , &n, &m, s); if (m == 0) { j = 1; for (i = 0; i < n; i++) j = 26LL * j % 1000000007; printf( %d , j); return 0; } f[0] = -1; ...
#include <bits/stdc++.h> using namespace std; uniform_int_distribution<long long> d(156, 99657); mt19937 rnd; int n, s, x, mn = -100, q, w; void solve() { scanf( %d%d%d , &n, &s, &x); if (n >= 2000) { for (int i = 1; i <= 1000; i++) { printf( ? %d n , (d(rnd) * d(rnd)) % n + 1); ...
#include <bits/stdc++.h> using namespace std; const int inf = 1 << 30; const int N = 1003, mod = 1000000007; int n, q; char a[N]; int k; int p[N]; int calc(int x) { if (x == 1) return 0; if (p[x] != -1) return p[x]; int cnt = 0, ret = 0; while (x) { cnt += (x % 2); x /= 2; ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); string s; int i, n; cin >> s; n = s.length(); cout << Mike << n ; int mi = s[0] - a ; for (i = 1; i < n; i++) { int x; x = s[i] - a ; ...
#include <bits/stdc++.h> using namespace std; int n, r; int v[100], cnt, diff; const int inf = 0x3fffffff; int calc(int x, int y) { cnt = 0; int sum = 0; while (x) { if (y % x == 0) { if (y == 1) v[++cnt] = y / x; else if (x == 1) v[++cnt] = y / x - 1; ...
#include <bits/stdc++.h> using namespace std; const double eps = 1e-8; const int inf = 0x3f3f3f3f; const int maxn = 2000 + 10; long long MOD = 1e9 + 7; long long fac[200010]; void getFac() { fac[0] = 1; for (int i = 1; i < 200010; i++) { fac[i] = fac[i - 1] * i % MOD; } } long long p...
#include <bits/stdc++.h> using namespace std; struct Edge { int v, next; } edge[100010]; int head[10]; int pos; void insert(int x, int y) { edge[pos].v = y; edge[pos].next = head[x]; head[x] = pos++; } int du[10]; int pp[100010]; int qq; int fa[10]; int find(int x) { if (fa[x...
#include <bits/stdc++.h> using namespace std; int x[100010], y[100010], vis[100010]; int main() { int n, ans, i; scanf( %d , &n); memset(vis, 0, sizeof(vis)); for (i = 1; i <= n; i++) { scanf( %d%d , &x[i], &y[i]); vis[x[i]]++; } for (i = 1; i <= n; i++) { ans = n - 1; ...
#include <bits/stdc++.h> using namespace std; int main() { int n, t, i, j, k; cin >> n >> t; string a; cin >> a; for (i = 1; i <= t; ++i) { for (j = 0; j < n - 1; ++j) { if (a[j] == B && a[j + 1] == G ) { a[j + 1] = B ; a[j] = G ; ++j; } ...
#include <bits/stdc++.h> using namespace std; int n, m, x = -1, y, xx, yy, k; bool a[510][510]; char h; int main() { cin >> n >> m; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> h; if (h == X ) { a[i][j] = true; if (x == -1) { ...
#include <bits/stdc++.h> using namespace std; vector<int> vec; int main() { int k; cin >> k; string arr; while (k--) { cin >> arr; int n = arr.length(); int maxLen = 0; for (int i = 0; i < n; i++) { int len = 0; while (arr[i] == L ) { len++; ...
#include <bits/stdc++.h> using namespace std; long long max(long long a, long long b) { return a > b ? a : b; } long long a[100005]; int main() { int t; cin >> t; while (t--) { int n; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; } sort(a + 1, a + 1 + n)...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; vector<long long> bs(n); for (auto &x : bs) cin >> x; if (count(bs.begin(), bs.end(), 0) == n) { cout << YES << endl; for (int _ = 0; _ < (n); ++_) cout << ...
#include <bits/stdc++.h> using namespace std; int n, m, a[1111]; int main() { scanf( %d%d , &n, &m); for (int i = (0); i < (n); i++) scanf( %d , &a[i]); int ans = 0; for (int i = (0); i < (m); i++) { int x, y; scanf( %d%d , &x, &y); x--; y--; ans += min(a[x], a[y]); ...
#include <bits/stdc++.h> using namespace std; int a[10010]; int main() { int n, m; while (scanf( %d%d , &n, &m) == 2) { for (int i = 1; i < n; i++) a[i] = 1; a[n] = 0; int maxx = 1; for (int ii = 0; ii < m; ii++) { for (int i = 1; i <= n; i++) { if (a[i] + maxx <=...
#include <bits/stdc++.h> using namespace std; template <class T> inline void read(T& x) { bool fu = 0; char c; for (c = getchar(); c <= 32; c = getchar()) ; if (c == - ) fu = 1, c = getchar(); for (x = 0; c > 32; c = getchar()) x = x * 10 + c - 0 ; if (fu) x = -x; }; template <...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:268435456 ) using namespace std; template <typename T1, typename T2> istream& operator>>(istream& in, pair<T1, T2>& t) { return in >> t.first >> t.second; } template <typename T1, typename T2> ostream& operator<<(ostream& out, pair<T1, T2>& t) {...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast,unroll-loops ) using namespace std; const int maxn = 15e4 + 7, blo = 255, mo = 998244353; int n, q, cl = 0, p[maxn], sz[maxn], lb[maxn], rb[maxn]; int_fast64_t inv, one = 0, rec[maxn], dat[maxn]; vector<int> vt, g[maxn]; vector<vector<int>> hsz; inlin...
#include <bits/stdc++.h> using namespace std; const int maxn = 5e5 + 10; const int base = 31337; const int mod = 1e9 + 7; const int inf = 0x3f3f3f3f; const int logo = 20; const int off = 1 << logo; const int treesiz = off << 1; int n; char niz[maxn]; int his[maxn]; int main() { scanf( %d%s ,...
#include <bits/stdc++.h> using namespace std; int main() { int x, y, z; cin >> x >> y >> z; if (x > y + z) cout << + << endl; else if (y > x + z) cout << - << endl; else if (x == y && z == 0) cout << 0 << endl; else cout << ? << endl; return 0; }
#include <bits/stdc++.h> using namespace std; long long int ampow(int k, int p) { long long int ans = 1; for (int i = 0; i < p; i++) { ans *= k; } return ans; } int main() { std::ios::sync_with_stdio(false); long long int k, b, n, t, z, i; cin >> k >> b >> n >> t; if (k == ...
#include <bits/stdc++.h> using namespace std; bool f(int a, string s) { vector<char> v; int tmp; int ss = (s.size() - 1); while (a) { tmp = a % 10; if (tmp == 7) v.push_back( 7 ); if (tmp == 4) v.push_back( 4 ); a /= 10; } if (v.size() != s.size()) return false; f...
#include <bits/stdc++.h> int main() { int n, a, b; scanf( %d%d%d , &n, &a, &b); for (int i = 1; i <= n; i++) { long long x; scanf( %I64d , &x); x = ((x * a) % b) / a; printf( %I64d , x); } }
#include <bits/stdc++.h> using namespace std; int main() { int a, b; long long p(1); cin >> a >> b; while (b--) p = (p << 1ll) % 1000000009ll; long long ans(1); while (a--) { p--; if (p < 0) p += 1000000009ll; ans *= p; ans %= 1000000009ll; } cout << ans; ...
#include <bits/stdc++.h> using namespace std; int n, k; const int MAXN = 500000; int A[MAXN + 10]; int main() { scanf( %d %d , &n, &k); for (int i = 1; i <= n; i++) scanf( %d , &A[i]); A[n + 1] = INT_MAX; A[0] = INT_MIN; sort(A + 1, A + n + 1); int l = 1, r = n; for (l = 2; l <= n ...
#include <bits/stdc++.h> const int INF_INT = 0x3f3f3f3f; const long long INF_LL = 0x7f7f7f7f; const int MOD = 1e9 + 7; const double eps = 1e-10; const double pi = acos(-1); using namespace std; const int N = 200010; long long n, k; long long fac[N], inv[N]; long long ksm(long long a, long long x, lo...
#include <bits/stdc++.h> using namespace std; const int P = 1e9 + 7, N = 17, M = 16389, O = 131; int qp(int a, int b) { int r = 1; for (; b; b >>= 1, a = a * 1ll * a % P) if (b & 1) r = r * 1ll * a % P; return r; } int a[N], e[N][N], p[M], n, ll[O][O], lr[O][O], rl[O][O], rr[O][O]; int g(i...
#include <bits/stdc++.h> using namespace std; vector<long long> v[3005]; long long f[20][3005], ans; int n, k; void solve(int l, int r, int d) { if (l == r) { for (int i = (int)(0); i <= (int)(v[l].size() - 1); i++) if (i + 1 <= k) ans = max(ans, v[l][i] + f[d][k - i - 1]); return; ...
#include <bits/stdc++.h> using namespace std; string s, t, k; string str(string a) { if (a[1] == X ) swap(a[1], a[3]); else if (a[2] == X ) swap(a[2], a[3]); else if (a[0] == X ) swap(a[0], a[2]), swap(a[2], a[3]); string b = a.substr(0, 3); return b; } int main() { ...
#include <bits/stdc++.h> using namespace std; const int N = 15; const int K = 500; int a[N][N]; const int INF = 1e9 + 7; int calc(int x, int y, int h, int w) { int cnt = 0; for (int i = x; i < x + h; i++) { for (int j = y; j < y + w; j++) { cnt += a[i][j]; } } return cnt;...
#include <bits/stdc++.h> using namespace std; long long pow2[61]; vector<long long> ans; int main() { std::ios_base::sync_with_stdio(false); pow2[0] = 1; pow2[1] = 2; for (int i = 2; i <= 60; i++) pow2[i] = pow2[i - 1] * 2; long long X, d; scanf( %lld %lld , &X, &d); while (X > 1) { ...
#include <bits/stdc++.h> using namespace std; typedef long long int ll; ll sum(ll n) { ll s=0; while(n>0) { s+= n%10; n=n/10; } return s; } ll gcd(ll n, ll m ) { ll k = n%m; while(k!=0) { n=m; m=k; ...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; int l[100005], r[100005], fr[100005], to[100005]; int f[100005]; vector<int> v[600000]; int fa[100005], it[100005]; int getfa(int x) { return (x == fa[x]) ? x : (fa[x] = getfa(fa[x])); } void merge(int x, int y) { if (x == y...
#include <bits/stdc++.h> const int maxn = 100010, mod = 998244353; int n, fac[maxn], ifac[maxn]; long long pw(long long a, int n = mod - 2) { long long b = 1; for (; n; n >>= 1) n& 1 ? b = b * a % mod : 1, a = a * a % mod; return b; } struct edge { int to; edge* next; } E[maxn * 2], *ne ...
#include <bits/stdc++.h> using namespace std; int main(int argc, char const *argv[]) { int n, x; while (cin >> n) { map<int, int> a; for (int i = 0; i < n; i++) { cin >> x; if (x != 0) a[x]++; } int ans = 0, ans1 = 0, ans2 = 0; for (map<int, int>::iterator it = ...
#include <bits/stdc++.h> using namespace std; int z[10000], ans[10000], size[10000], v[10000]; long long a[10004]; int vis[10004]; int root(int i) { while (z[i] != i) i = z[i]; return i; } void union1(int i, int j) { i = root(i); j = root(j); if (i != j) { if (size[i] > size[j]) ...
#include <bits/stdc++.h> using namespace std; int mat[(int)1e3][(int)1e3], n; int dp2[(int)1e3][(int)1e3]; int dp5[(int)1e3][(int)1e3]; int changeRow[] = {1, 0}; int changeCol[] = {0, 1}; int pw2[(int)1e3][(int)1e3], pw5[(int)1e3][(int)1e3]; string dir[] = { D , R }; int pwr(int n, int k) { int r...
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int N = 5e5 + 10; vector<int> v[31]; long long par[31], X[31], Y[31], vis[31]; int xxx = 31; void bfs() { queue<tuple<int, int, int>> qu; qu.push(make_tuple(1, 0, xxx)); vis[1] = 1; X[1] = Y[1] = 1ll << xxx; w...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 233, mxzt = (1 << 20) + 23; int f[21][mxzt], tmp[2][mxzt][20]; int stv[maxn]; int i, j, k, n, m; char s[maxn]; int ra, fh; char rx; inline int read() { rx = getchar(), ra = 0, fh = 1; while (rx < 48) rx == - && (fh = -1), r...
#include <bits/stdc++.h> int p; struct seg { std::vector<int64_t> cuts; int64_t sum; int64_t operator()(int64_t x) const { return x + sum - p * int64_t(std::upper_bound(begin(cuts), end(cuts), x) - begin(cuts)); } }; seg operator*(seg const& a, seg con...
#include <bits/stdc++.h> int main() { char s[5200] = {0}, next[5200] = {0}, p[5200] = {0}, t[5200] = {0}; while (scanf( %s , s + 1) != EOF) { s[0] = a ; double sum = 0; int f = 0; while (sscanf(s, %*[^0-9]%[0-9.]%[^ 0] , p, next) > 0) { double num1 = 0, num2 = 0; int ...
#include <bits/stdc++.h> using namespace std; int n, m, num[100100]; inline int as(int u) { int a, b; if (num[u]) return num[u]; printf( ? %d n , u); fflush(stdout); scanf( %d , &a); return num[u] = a; } inline void pd(int u) { if (as(u) == as(u + m)) { printf( ! %d n , u); ...
#include <bits/stdc++.h> long num[1000000]; int main() { long long ans; long i, j, k, n; long long max1, max2; scanf( %ld , &n); ans = 0; for (i = 1; i <= n; i++) { scanf( %ld , &num[i]); ans += num[i]; } max1 = 0; max2 = 0; for (i = 1; i <= n; i++) { scanf(...
#include <bits/stdc++.h> long long n, m, Now, Ans, i; long long sumi(long long a, long long b); int main() { scanf( %I64d %I64d , &n, &m); Now = sumi(2, m); if (Now == 0) Now = 1000000009 - 1; else Now--; Ans = 1; for (i = 1; i <= n; i++) { Ans *= Now; Ans %= 100000...

#include <bits/stdc++.h> using namespace std; const int N = 4e5 + 5; int n, m, fa[N], b[N], ans; struct edge { int u, v, w; } e[N]; bool cmp(edge x, edge y) { return x.w > y.w; } int find(int x) { return x == fa[x] ? x : fa[x] = find(fa[x]); } int main() { scanf( %d%d , &n, &m); for (registe...

#include <bits/stdc++.h> using namespace std; struct Point { long long x, y; int type; void get(int t) { cin >> x >> y; type = t; } }; int N, M; Point R[500], B[500], P[1000], pivot; bool used[500]; Point operator-(Point p1, Point p2) { return Point{p1.x - p2.x, p1.y - p2.y}; }...

#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; if (n > m) swap(n, m); switch (n) { case 1: cout << m / 6 * 6 + 2 * max(m % 6 - 3, 0); break; case 2: switch (m) { case 2: cout << 0; break; ...

#include <bits/stdc++.h> using namespace std; int a[500000 + 5], ans[500000 + 5]; int main() { int n, k, d; cin >> n >> k >> d; for (int i = 0; i < n; i++) { cin >> a[i]; } sort(a, a + n); ans[n + 1] = 0; ans[n] = 1; int lptr = n - 1, dptr = n - 1; for (int i = n - 1; i >...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); cerr.tie(nullptr); int n, p, k; cin >> n >> p >> k; map<int, int> mp; long long sol = 0; for (int i = 0; i < n; i++) { int x; cin >> x; ...

#include <bits/stdc++.h> using namespace std; const long double pi = 3.1415926535897932384626433832795l; template <typename T> inline auto sqr(T x) -> decltype(x * x) { return x * x; } template <typename T1, typename T2> inline bool umx(T1& a, T2 b) { if (a < b) { a = b; return 1; ...

#include <bits/stdc++.h> #pragma GCC optimize(2) #pragma GCC optimize(3) #pragma GCC optimize( Ofast ) #pragma GCC optimize( inline ) #pragma GCC optimize( -fgcse ) #pragma GCC optimize( -fgcse-lm ) #pragma GCC optimize( -fipa-sra ) #pragma GCC optimize( -ftree-pre ) #pragma GCC optimize( -ftree-vrp )...

#include <bits/stdc++.h> using namespace std; vector<int> knapsack(long long lim, vector<int> allItems) { vector<bool> mark; int mx = 0; for (auto it : allItems) mx += it; mx = min((long long)mx, lim); mark.assign(mx + 1, 0); mark[0] = true; for (auto it : allItems) { for (int i = ...

#include <bits/stdc++.h> using namespace std; long long power(long long a, long long b) { long long result = 1; while (b > 0) { if (b % 2 == 1) { result *= a; } a *= a; b /= 2; } return result; } long long gcd(long long x, long long y) { long long r; while...

#include <bits/stdc++.h> int main() { long long n, k; scanf( %lld %lld , &n, &k); long long total(0), count(0); for (long long p = 1; p <= n; p++) { long long x; scanf( %lld , &x); if (p > 1 && total - x * (n - p) * (p - count - 1) < k) { printf( %lld n , p); ++count;...

#include <bits/stdc++.h> using namespace std; inline int IN() { int x = 0, ch = getchar(), f = 1; while (!isdigit(ch) && (ch != - ) && (ch != EOF)) ch = getchar(); if (ch == - ) { f = -1; ch = getchar(); } while (isdigit(ch)) { x = (x << 1) + (x << 3) + ch - 0 ; ch = g...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; for (int i = 0; i < t; ++i) { int n; cin >> n; string s; cin >> s; int sum(0), pos(-1), pos1(-1), ot(-1), num(0); for (int i = 0; i < s.length(); ++i) sum += (s[i] - 0 ); for (int i = 0...

#include <bits/stdc++.h> double a, b, c, d, x, y; int main() { scanf( %lf%lf%lf%lf , &a, &b, &c, &d); x = a / b; y = c / d; printf( %lf , x / (1.0 - (1.0 - x) * (1.0 - y))); }

#include <bits/stdc++.h> using namespace std; using ll = long long; const ll OO = 1e18; 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 ; void fast() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); } string s1, s2; int...

#include <bits/stdc++.h> using namespace std; void solutionA(); int main() { ios_base::sync_with_stdio(false); solutionA(); return EXIT_SUCCESS; } long long n, a, b, u[1024]; double d[1024]; struct point { double x, y; point(double x = 0, double y = 0) : x(x), y(y) {} } s, f; struc...

#include <bits/stdc++.h> using namespace std; long long sol(long long n, long long t) { long long ret = n * (n + 1) * (2 * n + 3 * t + 1); ret /= 6; return ret; } int main() { ios_base::sync_with_stdio(0); long long x; cin >> x; long long ans = 0; vector<pair<long long, long long...

#include <bits/stdc++.h> using namespace std; template <class c> struct rge { c b, e; }; template <class c> rge<c> range(c i, c j) { return rge<c>{i, j}; } template <class c> auto dud(c* x) -> decltype(cerr << *x, 0); template <class c> char dud(...); struct debug { template <class c...

#include <bits/stdc++.h> using namespace std; vector<int> v[1000005]; int ok[2][1000005]; int main() { int q; cin >> q; while (q--) { int n; cin >> n; for (int i = 0; i < n; i++) ok[0][i] = 0; set<int> s; for (int i = 0; i < n; i++) s.insert(i); int cnt = 0; ...

#include <bits/stdc++.h> using namespace std; int main() { int n, m, a[55], b[55], c, mx; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; } cin >> m; for (int j = 1; j <= m; j++) { cin >> b[j]; } mx = 0; c = 1; for (int i = 1; i <= n; i++) { for (int j...

#include <bits/stdc++.h> #pragma GCC target( avx2 ) #pragma GCC optimization( O3 ) #pragma GCC optimization( unroll-loops ) int dx[] = {0, 0, 1, -1, 1, -1, 1, -1}; int dy[] = {1, -1, 0, 0, -1, 1, 1, -1}; const double PI = acos(-1), EPS = 1e-7; const int OO = 0x3f3f3f3f, N = 1e7 + 5, mod = 1e9 + 7; using...

#include <bits/stdc++.h> using namespace std; int months[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; string itos(long long i) { string s = ; while (i) { s += char(i % 10 + 0 ); i /= 10; } reverse(s.begin(), s.end()); return s; } long long stoi(string &s) { ...

#include <bits/stdc++.h> using namespace std; set<int> se; struct zzz { int v, id; } zz[1000005]; bool cmp(const zzz &i, const zzz &j) { return i.v > j.v; } int N, M, K; char S[1000005], T[1000005], s[1000005]; int z[1000005], p[2][1000005]; void w(int td) { for (int i = 0; i < M; i++) s[i] = ...

#include <bits/stdc++.h> const int N = 100005; int n, fa[N], rt, cnt = 0, sz[N], son[N] = {0}, top[N], dep[N], idx = 0, Q, dfn[N], head[N], hq[N], nodes = 0, year[N]; int ret, L, R; inline int readint() { int c = getchar(), d = 0; for (; !isdigit(c); c = getchar()) ; for (;...

#include <bits/stdc++.h> using namespace std; const int MAXN = 1005; const int INF = 0x3f3f3f3f; int n, a[MAXN]; vector<int> ans; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); if (i != 1 && a[i] == 1) ans.push_back(a[i - 1]); } ans.push_back(a[n...

#include <bits/stdc++.h> int n, i, a[10001], p = 0; int main() { scanf( %d , &n); for (i = 1; i <= n; i++) scanf( %d , &a[i]); for (i = 1; i <= n; i++) { if (a[i] == 1) p++; } if (n > 1) { if (p == (n - 1)) printf( YES ); else printf( NO ); } else { if...

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

#include <bits/stdc++.h> using namespace std; const int N = 505; const int dr[4] = {0, 0, -1, 1}; const int dc[4] = {-1, 1, 0, 0}; int n, K, mien, ans, res, t; int sz[N * N], vis[N * N], c[N][N]; char a[N][N]; bool ok(int x, int y) { return x >= 1 && x <= n && y >= 1 && y <= n && a[x][y] == . ; }...

#include <bits/stdc++.h> #define all(x) (x).begin(),(x).end() #define sz(x) int(x.size()) using namespace std; using ll = long long; using pii = pair<int, int>; template<typename... T> void rd(T&... args) {((cin>>args), ...);} template<typename... T> void wr(T... args) {((cout<<args<< ), ...); cou...

#include <bits/stdc++.h> using namespace std; int f[1 << 21], a[210000], i, j, minn, ans, n, l, k; char c[22]; void Min(int &x, int y) { if (y < x) x = y; } int main() { scanf( %d , &n); for (i = 1; i <= n; ++i) { scanf( %s , c + 1); l = strlen(c + 1); for (j = 1; j <= l; ++j) ...

#include <bits/stdc++.h> using namespace std; void kaboom() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } int main() { kaboom(); int t; cin >> t; while (t--) { long long int n; cin >> n; cout << n << endl; } }

#include <bits/stdc++.h> using namespace std; int main() { int name[100], i, j = 0; string codename; cin >> codename; for (i = 0; i < codename.length(); i++) { name[j] = (int)codename[i]; j++; } sort(name, name + j); int count = 0; for (int k = 1; k < j; k++) { if (...

#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, d; cin >> a >> b >> c >> d; if (max((3 * a / 10), a - a / 250 * c) == max((3 * b / 10), b - b / 250 * d)) cout << Tie ; else if (max((3 * a / 10), a - a / 250 * c) > max((3 * b / 10), b - b / 250 * d)) ...

#include <bits/stdc++.h> using namespace std; long long int a[100005]; int main() { long long int n, b, k; cin >> k >> b >> n; for (int i = 0; i < n; i++) { cin >> a[i]; } long long int ans = 0; if (b == 0) { for (int i = 0; i < n;) { long long int now = a[i]; l...

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

#include <bits/stdc++.h> using ll = long long; using namespace std; using pii = pair<ll, ll>; ll mod = 998244353; int get_p2(int n) { int i = 0; while ((1 << i) <= n) i++; return i - 1; } int main() { ios_base::sync_with_stdio(0); int t; cin >> t; while (t--) { int n; ...

#include <bits/stdc++.h> using namespace std; const string sf[6] = { lios , liala , etr , etra , initis , inites }; char a[1100000], s[1100000]; int n, sd, p, num[3]; int gender; int suffix(int x) { int len = strlen(s); if (len < (int)sf[x].length()) return 0; for (int i = len - sf[x].lengt...

#include <bits/stdc++.h> using namespace std; int main() { int q, n, i, a[201], start, tmp, yn; cin >> q; while (q--) { cin >> n; for (i = 0; i < n; i++) { cin >> a[i]; if (a[i] == 1) start = i; } yn = 0; tmp = 1; for (i = 0; i < n - 1; i++) if...

#include <bits/stdc++.h> using namespace std; ifstream Cin( input.txt ); ofstream Cout( output.txt ); pair<bool, long long> Try(long long A, long long B, long long N) { long long err = 0, C; while (A > 0 && B > 0 && N > 0) { if (A == 1 && B != 1) { C = B - 1; A = B = 1; } els...

#include <bits/stdc++.h> using namespace std; int l; char s[205]; int exe(int a, int b) { int u = 0, r = 0; for (int i = a; i < b; i++) { switch (s[i]) { case U : u++; break; case D : u--; break; case R : r++; b...

#include <bits/stdc++.h> using namespace std; const long long MOD = 1000000007; void solve() { long long n; cin >> n; vector<long long> v(n); for (long long i = 0; i < n; ++i) { cin >> v[i]; } long long ans = 0; map<long long, long long> mp; for (long long i = 0; i < n; i++) ...

#include <bits/stdc++.h> using namespace std; const int N = 201; int n, a[N], cum[N][N], k, freq[N]; vector<int> hs; int calc(int l, int r) { priority_queue<int> qu; int res = 0; for (int i = l; i <= r; ++i) { qu.push(-hs[a[i]]); res += hs[a[i]]; } int sz = hs.size(), op = k; ...

#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 5; int n, x[2], need[N][2]; pair<int, int> p[N]; int main() { ios::sync_with_stdio(false); cin >> n >> x[0] >> x[1]; for (int i = 0; i < n; i++) { int c; cin >> c; p[i] = {c, i}; } sort(p, p + n); for (...

#include <bits/stdc++.h> using namespace std; const double Eps = 1e-9; int Mod = 1000000000 + 7; int n, m, q, k; int Arr[100010]; bool prime[10010]; bool ok = true; void sieve() { for (int i = 2; i * i <= 1e4; i++) { if (prime[i] == true) for (int j = i * 2; j <= 1e4; j++) { ...

#include <bits/stdc++.h> using namespace std; int N; vector<int> fen, v; void _update(int i) { while (i <= N) { fen[i]++; i += i & -i; } } int _sum(int i) { int ret = 0; while (i > 0) { ret += fen[i]; i -= i & -i; } return ret; } int _bin(int i) { int ...

#include <bits/stdc++.h> using namespace std; long long dp[1010][105], po[1010], po2[1010]; long long qui(long long a, long long n, long long m) { long long ans = 1; while (n) { if (n & 1) ans = (ans * a) % m; n >>= 1; a = (a * a) % m; } return ans; }; int main() { long l...

#include <bits/stdc++.h> using namespace std; int read() { char c = getchar(); int t = 0, f = 1; while (c > 9 || c < 0 ) f = (c == - ) ? -1 : 1, c = getchar(); while (c >= 0 && c <= 9 ) t = t * 10 + c - 0 , c = getchar(); return t * f; } struct node { int L, R, po, id; bool o...

#include <bits/stdc++.h> using namespace std; long long int pow_mod(long long int a, long long int b) { long long int res = 1; while (b != 0) { if (b & 1) { res = (res * a) % 1000000007; } a = (a * a) % 1000000007; b /= 2; } return res; } void solve() { long l...

#include <bits/stdc++.h> using namespace std; int main() { int y, a, b, c, d, temp; while (cin >> y) { temp = y + 1; while (temp != 0) { a = temp % 10; b = (temp % 100) / 10; c = (temp % 1000) / 100; d = temp / 1000; if (a == b || b == c || c == d || d == ...

#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using ll = long long int; using namespace std; template <class c> struct rge { c b, e; }; template <class c> rge<c> range(c i, c j) { return rge<c>{i, j}; } template <class c> auto dud(c *x) -> decltype(cerr << *x, 0); template <class c...

#include <bits/stdc++.h> using namespace std; const int MOD = (int)1e9 + 7; const double EPS = 1e-9; const int INF = INT_MAX; const long long INFLL = (long long)1e18; const double PI = acos(-1.0); template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; } template <class T> T lcm(T a...

#include <bits/stdc++.h> using namespace std; vector<int> mp[105]; int vis[105]; struct node { int fa; int kid; node(int fa, int b) { this->fa = fa; kid = b; } }; bool bfs(int rt, int n) { queue<node> q; q.push(node(-1, rt)); vis[rt] = 1; while (!q.empty()) { ...

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

#include <bits/stdc++.h> using namespace std; int maxrob(int p, int f, int cnt_s, int cnt_w, int s, int w) { if (p > f) { swap(p, f); } if (s > w) { swap(cnt_s, cnt_w); swap(s, w); } long long s_total = (long long)cnt_s * s; if ((p + f) <= s_total) { return (p / s) + ...

#include <bits/stdc++.h> using namespace std; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long t = 1, n, k, fact, a, b; cin >> t; while (t--) { cin >> a >> b; if (a == 1) cout << 0 n ; else if (a == 2) cout << b <<...

#include <bits/stdc++.h> using namespace std; int n, m; int res[100010], k = 0; struct edge { int id, v, w, next; } e[100010]; int head[100010], cnt = 0; void adde(int u, int v, int w, int id) { e[cnt].id = id; e[cnt].v = v; e[cnt].w = w; e[cnt].next = head[u]; head[u] = cnt++; }...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr); long long int t; cin >> t; while (t--) { string s; cin >> s; if (s.size() == 1) { cout << 0 << endl; continue; } map<char, i...

#include <bits/stdc++.h> char s[1111111]; int f[1111111]; int c[1111111]; int d[1111111]; int main() { int i, j, n, m, l; scanf( %d%d%s , &n, &m, s); if (m == 0) { j = 1; for (i = 0; i < n; i++) j = 26LL * j % 1000000007; printf( %d , j); return 0; } f[0] = -1; ...

#include <bits/stdc++.h> using namespace std; uniform_int_distribution<long long> d(156, 99657); mt19937 rnd; int n, s, x, mn = -100, q, w; void solve() { scanf( %d%d%d , &n, &s, &x); if (n >= 2000) { for (int i = 1; i <= 1000; i++) { printf( ? %d n , (d(rnd) * d(rnd)) % n + 1); ...

#include <bits/stdc++.h> using namespace std; const int inf = 1 << 30; const int N = 1003, mod = 1000000007; int n, q; char a[N]; int k; int p[N]; int calc(int x) { if (x == 1) return 0; if (p[x] != -1) return p[x]; int cnt = 0, ret = 0; while (x) { cnt += (x % 2); x /= 2; ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); string s; int i, n; cin >> s; n = s.length(); cout << Mike << n ; int mi = s[0] - a ; for (i = 1; i < n; i++) { int x; x = s[i] - a ; ...

#include <bits/stdc++.h> using namespace std; int n, r; int v[100], cnt, diff; const int inf = 0x3fffffff; int calc(int x, int y) { cnt = 0; int sum = 0; while (x) { if (y % x == 0) { if (y == 1) v[++cnt] = y / x; else if (x == 1) v[++cnt] = y / x - 1; ...

#include <bits/stdc++.h> using namespace std; const double eps = 1e-8; const int inf = 0x3f3f3f3f; const int maxn = 2000 + 10; long long MOD = 1e9 + 7; long long fac[200010]; void getFac() { fac[0] = 1; for (int i = 1; i < 200010; i++) { fac[i] = fac[i - 1] * i % MOD; } } long long p...

#include <bits/stdc++.h> using namespace std; struct Edge { int v, next; } edge[100010]; int head[10]; int pos; void insert(int x, int y) { edge[pos].v = y; edge[pos].next = head[x]; head[x] = pos++; } int du[10]; int pp[100010]; int qq; int fa[10]; int find(int x) { if (fa[x...

#include <bits/stdc++.h> using namespace std; int x[100010], y[100010], vis[100010]; int main() { int n, ans, i; scanf( %d , &n); memset(vis, 0, sizeof(vis)); for (i = 1; i <= n; i++) { scanf( %d%d , &x[i], &y[i]); vis[x[i]]++; } for (i = 1; i <= n; i++) { ans = n - 1; ...

#include <bits/stdc++.h> using namespace std; int main() { int n, t, i, j, k; cin >> n >> t; string a; cin >> a; for (i = 1; i <= t; ++i) { for (j = 0; j < n - 1; ++j) { if (a[j] == B && a[j + 1] == G ) { a[j + 1] = B ; a[j] = G ; ++j; } ...

#include <bits/stdc++.h> using namespace std; int n, m, x = -1, y, xx, yy, k; bool a[510][510]; char h; int main() { cin >> n >> m; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> h; if (h == X ) { a[i][j] = true; if (x == -1) { ...

#include <bits/stdc++.h> using namespace std; vector<int> vec; int main() { int k; cin >> k; string arr; while (k--) { cin >> arr; int n = arr.length(); int maxLen = 0; for (int i = 0; i < n; i++) { int len = 0; while (arr[i] == L ) { len++; ...

#include <bits/stdc++.h> using namespace std; long long max(long long a, long long b) { return a > b ? a : b; } long long a[100005]; int main() { int t; cin >> t; while (t--) { int n; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; } sort(a + 1, a + 1 + n)...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; vector<long long> bs(n); for (auto &x : bs) cin >> x; if (count(bs.begin(), bs.end(), 0) == n) { cout << YES << endl; for (int _ = 0; _ < (n); ++_) cout << ...

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

#include <bits/stdc++.h> using namespace std; int a[10010]; int main() { int n, m; while (scanf( %d%d , &n, &m) == 2) { for (int i = 1; i < n; i++) a[i] = 1; a[n] = 0; int maxx = 1; for (int ii = 0; ii < m; ii++) { for (int i = 1; i <= n; i++) { if (a[i] + maxx <=...

#include <bits/stdc++.h> using namespace std; template <class T> inline void read(T& x) { bool fu = 0; char c; for (c = getchar(); c <= 32; c = getchar()) ; if (c == - ) fu = 1, c = getchar(); for (x = 0; c > 32; c = getchar()) x = x * 10 + c - 0 ; if (fu) x = -x; }; template <...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:268435456 ) using namespace std; template <typename T1, typename T2> istream& operator>>(istream& in, pair<T1, T2>& t) { return in >> t.first >> t.second; } template <typename T1, typename T2> ostream& operator<<(ostream& out, pair<T1, T2>& t) {...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast,unroll-loops ) using namespace std; const int maxn = 15e4 + 7, blo = 255, mo = 998244353; int n, q, cl = 0, p[maxn], sz[maxn], lb[maxn], rb[maxn]; int_fast64_t inv, one = 0, rec[maxn], dat[maxn]; vector<int> vt, g[maxn]; vector<vector<int>> hsz; inlin...

#include <bits/stdc++.h> using namespace std; const int maxn = 5e5 + 10; const int base = 31337; const int mod = 1e9 + 7; const int inf = 0x3f3f3f3f; const int logo = 20; const int off = 1 << logo; const int treesiz = off << 1; int n; char niz[maxn]; int his[maxn]; int main() { scanf( %d%s ,...

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

#include <bits/stdc++.h> using namespace std; long long int ampow(int k, int p) { long long int ans = 1; for (int i = 0; i < p; i++) { ans *= k; } return ans; } int main() { std::ios::sync_with_stdio(false); long long int k, b, n, t, z, i; cin >> k >> b >> n >> t; if (k == ...

#include <bits/stdc++.h> using namespace std; bool f(int a, string s) { vector<char> v; int tmp; int ss = (s.size() - 1); while (a) { tmp = a % 10; if (tmp == 7) v.push_back( 7 ); if (tmp == 4) v.push_back( 4 ); a /= 10; } if (v.size() != s.size()) return false; f...

#include <bits/stdc++.h> int main() { int n, a, b; scanf( %d%d%d , &n, &a, &b); for (int i = 1; i <= n; i++) { long long x; scanf( %I64d , &x); x = ((x * a) % b) / a; printf( %I64d , x); } }

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

#include <bits/stdc++.h> using namespace std; int n, k; const int MAXN = 500000; int A[MAXN + 10]; int main() { scanf( %d %d , &n, &k); for (int i = 1; i <= n; i++) scanf( %d , &A[i]); A[n + 1] = INT_MAX; A[0] = INT_MIN; sort(A + 1, A + n + 1); int l = 1, r = n; for (l = 2; l <= n ...

#include <bits/stdc++.h> const int INF_INT = 0x3f3f3f3f; const long long INF_LL = 0x7f7f7f7f; const int MOD = 1e9 + 7; const double eps = 1e-10; const double pi = acos(-1); using namespace std; const int N = 200010; long long n, k; long long fac[N], inv[N]; long long ksm(long long a, long long x, lo...

#include <bits/stdc++.h> using namespace std; const int P = 1e9 + 7, N = 17, M = 16389, O = 131; int qp(int a, int b) { int r = 1; for (; b; b >>= 1, a = a * 1ll * a % P) if (b & 1) r = r * 1ll * a % P; return r; } int a[N], e[N][N], p[M], n, ll[O][O], lr[O][O], rl[O][O], rr[O][O]; int g(i...

#include <bits/stdc++.h> using namespace std; vector<long long> v[3005]; long long f[20][3005], ans; int n, k; void solve(int l, int r, int d) { if (l == r) { for (int i = (int)(0); i <= (int)(v[l].size() - 1); i++) if (i + 1 <= k) ans = max(ans, v[l][i] + f[d][k - i - 1]); return; ...

#include <bits/stdc++.h> using namespace std; string s, t, k; string str(string a) { if (a[1] == X ) swap(a[1], a[3]); else if (a[2] == X ) swap(a[2], a[3]); else if (a[0] == X ) swap(a[0], a[2]), swap(a[2], a[3]); string b = a.substr(0, 3); return b; } int main() { ...

#include <bits/stdc++.h> using namespace std; const int N = 15; const int K = 500; int a[N][N]; const int INF = 1e9 + 7; int calc(int x, int y, int h, int w) { int cnt = 0; for (int i = x; i < x + h; i++) { for (int j = y; j < y + w; j++) { cnt += a[i][j]; } } return cnt;...

#include <bits/stdc++.h> using namespace std; long long pow2[61]; vector<long long> ans; int main() { std::ios_base::sync_with_stdio(false); pow2[0] = 1; pow2[1] = 2; for (int i = 2; i <= 60; i++) pow2[i] = pow2[i - 1] * 2; long long X, d; scanf( %lld %lld , &X, &d); while (X > 1) { ...

#include <bits/stdc++.h> using namespace std; typedef long long int ll; ll sum(ll n) { ll s=0; while(n>0) { s+= n%10; n=n/10; } return s; } ll gcd(ll n, ll m ) { ll k = n%m; while(k!=0) { n=m; m=k; ...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; int l[100005], r[100005], fr[100005], to[100005]; int f[100005]; vector<int> v[600000]; int fa[100005], it[100005]; int getfa(int x) { return (x == fa[x]) ? x : (fa[x] = getfa(fa[x])); } void merge(int x, int y) { if (x == y...

#include <bits/stdc++.h> const int maxn = 100010, mod = 998244353; int n, fac[maxn], ifac[maxn]; long long pw(long long a, int n = mod - 2) { long long b = 1; for (; n; n >>= 1) n& 1 ? b = b * a % mod : 1, a = a * a % mod; return b; } struct edge { int to; edge* next; } E[maxn * 2], *ne ...

#include <bits/stdc++.h> using namespace std; int main(int argc, char const *argv[]) { int n, x; while (cin >> n) { map<int, int> a; for (int i = 0; i < n; i++) { cin >> x; if (x != 0) a[x]++; } int ans = 0, ans1 = 0, ans2 = 0; for (map<int, int>::iterator it = ...

#include <bits/stdc++.h> using namespace std; int z[10000], ans[10000], size[10000], v[10000]; long long a[10004]; int vis[10004]; int root(int i) { while (z[i] != i) i = z[i]; return i; } void union1(int i, int j) { i = root(i); j = root(j); if (i != j) { if (size[i] > size[j]) ...

#include <bits/stdc++.h> using namespace std; int mat[(int)1e3][(int)1e3], n; int dp2[(int)1e3][(int)1e3]; int dp5[(int)1e3][(int)1e3]; int changeRow[] = {1, 0}; int changeCol[] = {0, 1}; int pw2[(int)1e3][(int)1e3], pw5[(int)1e3][(int)1e3]; string dir[] = { D , R }; int pwr(int n, int k) { int r...

#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int N = 5e5 + 10; vector<int> v[31]; long long par[31], X[31], Y[31], vis[31]; int xxx = 31; void bfs() { queue<tuple<int, int, int>> qu; qu.push(make_tuple(1, 0, xxx)); vis[1] = 1; X[1] = Y[1] = 1ll << xxx; w...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 233, mxzt = (1 << 20) + 23; int f[21][mxzt], tmp[2][mxzt][20]; int stv[maxn]; int i, j, k, n, m; char s[maxn]; int ra, fh; char rx; inline int read() { rx = getchar(), ra = 0, fh = 1; while (rx < 48) rx == - && (fh = -1), r...

#include <bits/stdc++.h> int p; struct seg { std::vector<int64_t> cuts; int64_t sum; int64_t operator()(int64_t x) const { return x + sum - p * int64_t(std::upper_bound(begin(cuts), end(cuts), x) - begin(cuts)); } }; seg operator*(seg const& a, seg con...

#include <bits/stdc++.h> int main() { char s[5200] = {0}, next[5200] = {0}, p[5200] = {0}, t[5200] = {0}; while (scanf( %s , s + 1) != EOF) { s[0] = a ; double sum = 0; int f = 0; while (sscanf(s, %*[^0-9]%[0-9.]%[^ 0] , p, next) > 0) { double num1 = 0, num2 = 0; int ...

#include <bits/stdc++.h> using namespace std; int n, m, num[100100]; inline int as(int u) { int a, b; if (num[u]) return num[u]; printf( ? %d n , u); fflush(stdout); scanf( %d , &a); return num[u] = a; } inline void pd(int u) { if (as(u) == as(u + m)) { printf( ! %d n , u); ...

#include <bits/stdc++.h> long num[1000000]; int main() { long long ans; long i, j, k, n; long long max1, max2; scanf( %ld , &n); ans = 0; for (i = 1; i <= n; i++) { scanf( %ld , &num[i]); ans += num[i]; } max1 = 0; max2 = 0; for (i = 1; i <= n; i++) { scanf(...

#include <bits/stdc++.h> long long n, m, Now, Ans, i; long long sumi(long long a, long long b); int main() { scanf( %I64d %I64d , &n, &m); Now = sumi(2, m); if (Now == 0) Now = 1000000009 - 1; else Now--; Ans = 1; for (i = 1; i <= n; i++) { Ans *= Now; Ans %= 100000...