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 MAXN = 32, MAXS = 1 << 17; const int MOD = 1e9 + 7, H = 3137; int add(int a, int b) { a += b; if (a >= MOD) a -= MOD; return a; } int sub(int a, int b) { a -= b; if (a < 0) a += MOD; return a; } int mul(int a, int b) { retur...
#include <bits/stdc++.h> using namespace std; const int MAXN = 505; int n, k; int a[MAXN], b[MAXN]; bool f[MAXN][MAXN]; int main() { scanf( %d%d , &n, &k); long long sum_a = 0, sum_b = 0; for (int i = 1; i <= n; i++) { scanf( %d%d , &a[i], &b[i]); sum_a += a[i]; sum_b += b[i]; ...
#include <bits/stdc++.h> using namespace std; using ii = pair<int, int>; using ll = long long; using li = pair<ll, int>; const int MAXK = 5000; struct jump { int node, prime, count; }; int n; vector<int> k; int fact_node[MAXK + 1]; vector<map<int, ii>> children; vector<int> primes; bool no...
#include <bits/stdc++.h> const int bufSize = 1e6; inline char nc() { return getchar(); static char buf[bufSize], p1 = buf, p2 = buf; return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, bufSize, stdin), p1 == p2) ? EOF : *p1++; } template <typename T> inline T read(T...
#include <bits/stdc++.h> using namespace std; int main() { long long n, m; while (cin >> n >> m) { long long num, sum = 0, minx = 1000000001; for (long long i = 0; i < n; i++) { cin >> num; sum += num; if (num < minx) minx = num; } if (sum < m) cout <<...
#include <bits/stdc++.h> using namespace std; const int N = 1e4 + 10; const int P = 1048576 + 10; const int Y = 30; int vis[N]; int cnt; int book[N]; int a[N]; int n; int m; int k; int addis[Y][Y]; int dis[N]; int dp[P]; queue<int> q; inline void bfs(int s) { for (int i = 1; i <= n +...
#include <bits/stdc++.h> using namespace std; int t, n, m; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> t; while(t--) { cin >> n; vector<int> pancake(n, 0); for(int i = 0; i < n; i++) { cin >> m; ...
#include <bits/stdc++.h> using namespace std; const int N = 10010; const double eps = 1e-12; struct point { int x, y, op, id; int u, v; long long operator(const point &r) const { return (long long)u r.v - (long long)v * r.u; } } a[N << 1], s; int n; int ans[N]; inline bool cmp(p...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; int n; cin >> n; int a[n], b[n]; int r1 = 0, r2 = 0; for (int i = 0; i < n; i++) { cin >> a[i]; r1 \|= a[i]; } for (int i = 0; i < n; i++) { cin...
#include <bits/stdc++.h> using namespace std; const long long inf = 1e15; const int maxn = 5000 + 5; long long cnt[maxn + 10]; long long p[maxn + 10][maxn + 10]; long long pd[maxn + 10]; int main() { memset(cnt, 0, sizeof(cnt)); int n; scanf( %d , &n); for (int i = (1); i <= (n); i++) { ...
#include <bits/stdc++.h> using namespace std; char buf[1 << 20], p1, p2; template <typename T> inline void read(T &t) { register int v = (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 20, stdin), p1 == p2) ? EOF : *p1++); T f = 1; t = 0; while (!isdigit(v)...
#include <bits/stdc++.h> using namespace std; const long double Pi = 3.141592653; const long long mod = 1e6 + 3; class Graph { map<int, vector<int>> ma; public: void addedge(int n, int m) { ma[n].push_back(m); ma[m].push_back(n); } }; int main() { long long n; cin >> n;...
#include <bits/stdc++.h> char fs, ft, buf[1 << 20]; inline int read() { int x = 0, f = 1; char ch = (fs == ft && (ft = (fs = buf) + fread(buf, 1, 1 << 20, stdin), fs == ft)) ? 0 : *fs++; ; while (ch < 0 \|\| ch > 9 ) { if (ch == - ) f = -1; ch = (fs ==...
#include <bits/stdc++.h> using namespace std; const int RNG = 1000003; const int RNGT = RNG * 4; const int MOD1 = 1e9 + 7; const int MOD2 = 1e9 + 87; const double pi = 2 * acos(0.0); inline int _Int() { int x; scanf( %d , &x); return x; } inline long long _LLi() { long long x; scan...
#include <bits/stdc++.h> using namespace std; template <class T> inline int cMin(T& a, T b) { return b < a ? a = b, 1 : 0; } template <class T> inline int cMax(T& a, T b) { return a < b ? a = b, 1 : 0; } template <class T> inline string to_str(T v) { ostringstream os; os << v; retu...
#include <bits/stdc++.h> using namespace std; const int maxm = 1e6; int pre[maxm * 2 + 10]; bool a[maxm + 10]; int N; int main(int argc, const char* argv[]) { scanf( %d , &N); for (int i = 1; i <= N; i++) { int val; scanf( %d , &val); pre[val] = -1; a[val] = true; } i...
#include <bits/stdc++.h> using namespace std; vector<int> e[100500]; bool visited[100500]; int main() { int n, m; scanf( %d%d , &n, &m); if (m != n - 1) { cout << no << endl; return 0; } for (int i = 0; i < m; i++) { int u, v; scanf( %d%d , &u, &v); u--; ...
#include <bits/stdc++.h> using namespace std; signed main() { long long n; cin >> n; vector<double> gr, le; vector<long long> gri, lei; vector<long long> grind, leind; for (long long i = 0; i < n; ++i) { double t; cin >> t; if (t >= 0) { gr.push_back(t); gri...
#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; const int N = 3e5 + 5; int n, q, a[N]; int rt[N * 20], ls[N * 20], rs[N * 20], sum[N * 20], cnt = 0; void change(int pre, int& o, int l, int r, int pos) { o = ++cnt; ls[o] = ls[pre]; rs[o] = rs[pre]; sum[o] = sum[pre] + 1; if (l == r) return; ...
#include <bits/stdc++.h> using namespace std; void PrintVector(vector<int> v2, string s) { cout << s; for (int i = 0; i < v2.size(); i++) cout << v2[i] << ; cout << endl; } void PrintVector(vector<int> v2) { for (int i = 0; i < v2.size(); i++) cout << v2[i] << ; cout << endl; } int...
#include <bits/stdc++.h> using namespace std; int dirx[] = {1, -1, 0, 0, 1, 1, -1, -1}, diry[] = {0, 0, 1, -1, 1, -1, 1, -1}; bool Set(int n, int pos) { return bool(n & (1 << pos)); } int32_t main() { ios_base::sync_with_stdio(false); int n, m; cin >> n >> m; string a, b; cin >> a >> b; ...
#include <bits/stdc++.h> using namespace std; template <typename T> void maxtt(T& t1, T t2) { t1 = max(t1, t2); } template <typename T> void mintt(T& t1, T t2) { t1 = min(t1, t2); } bool debug = 0; int n, m, k; int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0}; string direc = URDL ; long...
#include <bits/stdc++.h> int a[55]; using namespace std; int main() { int n, m, k, i, t = 0, cnt; scanf( %d%d%d , &n, &m, &k); if (k >= m) { printf( 0 n ); return 0; } for (i = 0; i < n; i++) scanf( %d , &a[i]); sort(a, a + n, std::greater<int>()); a[0] += k - 1; t = 0;...
#include <bits/stdc++.h> using namespace std; void seif() { std::ios_base::sync_with_stdio(0); } int xa[] = {-1, -1, -1, 0, 0, 0, 1, 1, 1}; int ya[] = {1, 0, -1, 1, 0, -1, 1, 0, -1}; int anx, any, marx, mary; bool ok = false; char grid[8][8]; bool valid(int x, int y) { if (x < 0 \|\| y < 0 \|\| x > 7 \|\|...
#include <bits/stdc++.h> using namespace std; int main() { int n, t; cin >> t; while (t--) { cin >> n; int arr[n]; for (int i = 0; i < n; i++) { cin >> arr[i]; } int mx, x; mx = 0; for (int i = 1; i < n; i++) { if (arr[i] < arr[i - 1]) { ...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma ) #pragma GCC optimize( unroll-loops ) using namespace std; double eps = 1e-12; template <class T> void swp(T& a, T& b) { T temp = a; a = b; b = temp; } long long...
#include <bits/stdc++.h> using namespace std; void ins(long long int a[], long long int n, long long int i = 0) { for (long long int i = 0; i < n; i++) a[i] = i; } template <typename t> void ins(t a[], long long int n, t b = 0) { for (long long int i = 0; i < n; i++) a[i] = b; } void print(long lo...
#include <bits/stdc++.h> using namespace std; long long n, mi, mx; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; long long a[n]; for (int i = 0; i < n && cin >> a[i]; i++) ; cout << abs(a[0] - a[1]) << << abs(a[0] - a[n - 1]) << endl; for (int i...
#include <bits/stdc++.h> using namespace std; string s, t, ts, ans; int pos[10000005], len[10000005], tot; inline string reverse(string s) { string t; t.resize(s.size()); int n = s.size(); for (int i = 0; i < n; i++) t[n - i - 1] = s[i]; return t; } void Duval(const string& s) { int ...
#include <bits/stdc++.h> using namespace std; template <class T1, class T2> int upmin(T1 &x, T2 v) { if (x > v) { x = v; return 1; } return 0; } template <class T1, class T2> int upmax(T1 &x, T2 v) { if (x < v) { x = v; return 1; } return 0; } const int IN...
#include <bits/stdc++.h> using namespace std; int main() { long long c, hr, hb, wr, wb; cin >> c >> hr >> hb >> wr >> wb; long long res = 0; for (long long w = 0; w < 2; ++w) { for (long long i = 0; i * wr <= c && i <= 10000000; ++i) { res = max(res, i * hr + hb * ((c - i * wr) / wb));...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cerr << Time : << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC << ms n ; string s; cin >> s; int l = 0, r = s.length() - 1; int cnt = 0; set<int> s1; ...
#include <bits/stdc++.h> using namespace std; int n; int a[500007]; int l[500007]; int r[500007]; long long ans = 0; pair<int, int> p[500007]; void input() { scanf( %d , &n); int i; for (i = 0; i < n; i++) { scanf( %d , &a[i]); p[i].first = a[i]; p[i].second = i; } ...
#include <bits/stdc++.h> using namespace std; const int mod = 998244353; void add(int &x, int y) { x = (x + y) % mod; } int mul(int x, int y) { return (long long)x * y % mod; } int pw(int x, int p) { int r = 1; while (p) { if (p & 1) r = mul(r, x); x = mul(x, x); p >>= 1; } r...
#include <bits/stdc++.h> char s[200001]; char pick(char a, char b) { char c; for (c = a ; c == a \|\| c == b; c++) ; return c; } char handle(char s) { char ps = s; for (s += 1; s; s++) { if (s == (s - 1)) s = pick((s - 1), *(s + 1)); } return ps; } int main() {...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; long long c[N], d[N]; int main() { long long sum = 0, ans = 0; int n, k; scanf( %d %d , &n, &k); for (int i = 1; i <= n; i++) { scanf( %lld , &c[i]); sum += c[i]; } for (int i = 1; i <= k; i++) { scan...
#include <bits/stdc++.h> using namespace std; int main() { int n, s; cin >> n >> s; int a[n + 1]; int cnt = 0; for (int i = 1; i < n; ++i) { a[i] = 1; cnt++; } a[n] = s - cnt; s -= cnt; if (s - cnt < 2) { cout << NO << endl; } else { cout << YES <<...
#include <bits/stdc++.h> using namespace std; int val_of_op[200]; int n; struct T { string Name, Expr; bool danger; int num[5]; int sum(int a0 = 0, int a1 = 0, int a2 = 0, int a3 = 0) { return num[a0] + num[a1] + num[a2] + num[a3]; } } macro[1000]; void Eliminate_Space(string &s) {...
#include <bits/stdc++.h> using namespace std; const int MAX = 1e5 + 9; int n, sq, a[MAX], group[MAX]; struct Bucket { Bucket() : l(1), r(0) {} int l, r, freq[MAX], cnt; } buckets[320]; void add(int idx, int k) { for (int i = buckets[idx].r + 1; i <= n; ++i) { if (!buckets[idx].freq[a[i]]) ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 100010, MAXC = 500; int can[MAXC], c = 0; int n, m, a[MAXN], b[MAXN]; int t[MAXN][MAXC]; int main() { cin >> n >> m; for (int i = 0; i < n; i++) cin >> a[i]; memcpy(b, a, sizeof(b)); sort(b, b + n); for (int i = 0; i < n; i++...
#include <bits/stdc++.h> using namespace std; struct exam { long long a; long long b; }; exam a[200000]; long long n, r, avg; bool comp(exam a, exam b) { return a.b < b.b; } int main() { cin >> n >> r >> avg; for (int i = 0; i < n; i++) cin >> a[i].a >> a[i].b; sort(a, a + n, comp); ...
#include <bits/stdc++.h> using namespace std; int n; map<int, int> num; int main() { cin >> n; int minNum = 1000 * 1000 * 1000 + 1; for (int i = 0; i < n; i++) { int tmp; cin >> tmp; num[tmp]++; minNum = min(minNum, tmp); } for (int i = minNum; n > 0; i++) { if ...
#include <bits/stdc++.h> int max(int a, int b) { if (a > b) return a; else return b; } int main() { int t, j; scanf( %d , &t); for (j = 0; j < t; j++) { int n, i, first = 0, last = 0, flagf = 0, count = 0; scanf( %d , &n); char arr[n]; scanf( %s , arr); ...
#include <bits/stdc++.h> using namespace std; long long ans, l, r, j, cn, ii, ix, p, N = 4e3; vector<long long> A; long long pww(long long a, long long b) { long long r = 1; for (long long i = 1; i <= b; i++) r *= a; return r; } void gen(long long i, long long p) { long long r = 0; for (...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; for (int itr = 0; itr < t; itr++) { int n; vector<int> s; cin >> n; for (int i = 1; i <= n; i++) { int tmp; cin >> tmp; s.push_back(tmp); } int token = 0; for (in...
#include <bits/stdc++.h> using namespace std; map<char, int> freq; vector<int> vec; vector<char> vec2; int main() { int n, k; cin >> n >> k; string s, ans, update, alpha = abcdefghijklmnopqrstuvwxyz ; cin >> s; int size = s.size(); for (int i = 0; i < 26; i++) { for (int j = 0; ...
#include <bits/stdc++.h> using namespace std; template <typename T> void chkmax(T &x, T y) { x = x > y ? x : y; } template <typename T> void chkmin(T &x, T y) { x = x > y ? y : x; } const int INF = (1ll << 30) - 1; template <typename T> void read(T &x) { x = 0; bool f = 1; char c...
#include <bits/stdc++.h> using namespace std; struct node { int pos, h, ans, id, f; } Do[100001]; int n; int cmd(node a, node b) { return a.pos < b.pos; } int cmd2(node a, node b) { return a.id < b.id; } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d%d , &Do[i].po...
#include <bits/stdc++.h> using namespace std; int main() { double fact[51], all = 0.0; fact[0] = 1; for (int i = 1; i < 51; i++) fact[i] = fact[i - 1] * i; int N, A[50], P; double dp[51][51]; cin >> N; for (int i = 0; i < N; i++) cin >> A[i]; cin >> P; int sum = 0; for (int i...
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( Ofast ) void scan() {} template <typename F, typename... R> void scan(F& f, R&... r) { cin >> f; scan(r...); } int di_; string dnms_, co_ = , ; void debug_() { cout << endl; } template <typename F, typename... R> void deb...
#include <bits/stdc++.h> using namespace std; void init_code() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); } int main() { init_code(); long long t; cin >> t; while (t--) { long long x1, y1, z1; long long x2, y2, z2; cin >> x1 >> y1 >> z1 >> x2 >> y2 >> z2; ...
#include <bits/stdc++.h> using namespace std; char c[600][600]; int check(int x, int y) { if (c[x][y - 1] == * && c[x][y + 1] == * && c[x + 1][y] == * && c[x - 1][y] == * && c[x][y] == * ) return 1; return 0; } int main() { int m, n; cin >> n >> m; for (int i = 0; i ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 200010; int N; int c[2][MAXN]; int idx[2]; pair<int, int> p[MAXN]; int pn; long long solve() { long long ret = 0; int pre = -1; for (int i = 0; i < N; ++i) idx[i] = 1; while (1) { int opt = 1000000007, x = -1; for...
#include <bits/stdc++.h> using namespace std; const int MAXN = 505; const int MAXQ = 5000005; int n, m, X1[MAXQ], X2[MAXQ], Y1[MAXQ], Y2[MAXQ]; bool ans[MAXQ]; bitset<MAXN> dp1[MAXN][MAXN], dp2[MAXN][MAXN], temp; char board[MAXN][MAXN]; void dnc(int r1, int r2, vector<int> &que) { if (que.empty() \|\|...
#include <bits/stdc++.h> using namespace std; vector<int> v[3005]; vector<long long> sum[3005]; struct node { int mon; int who; bool operator<(const node &a) const { return mon > a.mon; } }; int main() { int n, m; int p, c; int get; int Max; long long ans; int pos[3005]; ...
#include <bits/stdc++.h> using namespace std; int main() { long k2, k3, k5, k6; long long sum = 0; cin >> k2 >> k3 >> k5 >> k6; long min = k2 < k5 ? k2 < k6 ? k2 : k6 : k5 < k6 ? k5 : k6; sum += min * 256; k2 -= min; k5 -= min; k6 -= min; min = k2 < k3 ? k2 : k3; sum += 32 * ...
#include <bits/stdc++.h> const int maxn = 5e5 + 5; using namespace std; bool vis[maxn]; int a[maxn]; int main() { string s; cin >> s; int k = s.size(); char y = s[0]; int ans = 1; for (int i = 0; i < k; i++) { if (i == 0) { cout << Mike << endl; continue; ...
#include <bits/stdc++.h> using namespace std; const int tt = 100005; struct edge { edge nxt; int des; void maker(edge &a, int b) { nxt = a, des = b; a = this; } } w[tt], sta[tt], tot; struct treap { treap l, r; int key, sz, ran; } * seg[tt * 4], buf[2000000], *pos; ...
#include <bits/stdc++.h> using namespace std; int n; char s[10000010]; struct Trie { struct nd { int ch[2], fa, fail, pos; } t[10000010]; int used; Trie() : used(1) {} int id[10000010]; int ins(int len, int I) { int u = 1; for (int i = 1; i <= len; i++) { if (!t...
#include <bits/stdc++.h> using namespace std; int main() { int n; long long tab[200001], min1, odl = -1, wynik, first; cin >> n; cin >> tab[0]; min1 = 0; first = 0; for (int i = 1; i < n; i++) { cin >> tab[i]; if (tab[i] == tab[min1]) { if (odl < i - min1) odl = i - m...
#include <bits/stdc++.h> using namespace std; const int N = 100010; const int M = 10005; const int mod = 1e9 + 7; const int inf = 0x3f3f3f3f; int n, a, i, j, b[M + 1], s[100100], r = 200000000; int main() { scanf( %d , &n); for (i = 1; i <= M; i++) b[i] = 10000; for (i = 1; i <= n; i++) { ...
#include <bits/stdc++.h> using namespace std; int main() { int a[55], b[55]; int n, i, j, sum = 0, sum1 = 0, s = 0, s1 = 0, count = 0, count1 = 0, k = 0; scanf( %d , &n); for (i = 0; i < n; i++) { scanf( %d , &a[i]); sum += a[i]; } for (i = 0; i < n; i++) { scanf( %d , &b[i...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; const long long MX = 4e6 + 5, MOD = 1e9 + 7, inf = 1e18, LG = 21; int main() { int t; cin >> t; while (t--) { long long x0, n, ans = 0; cin >> x0 >> n; if (n == 0) { cout << x0 << n ; cont...
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; const int maxN = 1 << 18; template <class T1, class T2> inline void remax(T1& a, T2 b) { a = max(a, (T1)b); } int deg[maxN], fat[maxN]; vector<int> G[maxN]; queue<int> Q; long long w[maxN]; pair<long long, int> leg[2][max...
#include <bits/stdc++.h> using namespace std; int main() { int n, minx = 999999, ans, df1, df2; char s[51]; scanf( %d , &n); getchar(); scanf( %s , s); for (int i = 0; i < n - 3; i++) { int t = 0; ans = 0; while (t <= 3) { int x = i + t; if (t == 0) { ...
#include <bits/stdc++.h> using namespace std; const int N = 100005; int n, m; int a[N], q[N]; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> m; for (int i = 0; i < m; ++i) cin >> q[i]; cin >> n; for (int i = 0; i < n; ++i) cin >> a[i]; sort(q, q + m); sort(a,...
#include <bits/stdc++.h> using namespace std; const int MAXN = 2001; const long long INF = 1e15; int DELTA = 2500; int n; long long price[MAXN], Time[MAXN]; long long dp[MAXN][3 * MAXN]; long long rec(int idx, int remTime) { if (remTime >= MAXN) remTime = MAXN - 1; if (idx == n) return remTime >...
#include <bits/stdc++.h> using namespace std; int main() { int n, s; cin >> n >> s; map<int, long long> sale; map<int, long long> buy; for (int i = 0; i < n; i++) { char c; cin >> c; if (c == B ) { int price, num; cin >> price >> num; buy[price] += num;...
#include <bits/stdc++.h> using namespace std; int main() { char s[1001]; int m[26]; while (gets(s)) { memset(m, 0, sizeof(m)); int len = strlen(s); int dan = 0, shuang = 0; for (int i = 0; i < len; i++) m[s[i] - a ]++; for (int i = 0; i < 26; i++) if (m[i]) { ...
#include <bits/stdc++.h> using namespace std; const long long maxi = 1e18; long long prime[] = {0, 2, 3, 5, 7, 11, 13, 17, 19, 23, 29}; long long dp[15][1005], mi[15][1005], ans; int n; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); for (int i = 1; i <= 10; i++) { mi[i][0] =...
#include <bits/stdc++.h> using namespace std; int n; vector<pair<int, int> > white, black; int main() { cin >> n; for (int i = 0; i < n; i++) { int c, s; cin >> c >> s; if (c) { black.push_back(make_pair(s, i + 1)); } else { white.push_back(make_pair(s, i + 1)); ...
#include <bits/stdc++.h> using namespace std; const long long INF = (long long)1 << 61; int main() { long long n, m; cin >> n >> m; pair<long long, long long> first, last; bool was = false; vector<vector<char>> v(n, vector<char>(m)); for (int i = 0; i < n; ++i) { for (int j = 0; j < ...
#include <bits/stdc++.h> using namespace std; int sum[200000 + 5]; int main() { int n; scanf( %d , &n); for (int i = 0; i < n; ++i) { scanf( %d , sum + i); sum[i] += i; } sort(sum, sum + n); for (int i = 1; i < n; ++i) { if (sum[i] == sum[i - 1]) { printf( :( n );...
#include <bits/stdc++.h> using namespace std; const double eps = 1e-11; int vex[4] = {1, 0, -1, 0}; int vey[4] = {0, 1, 0, -1}; long long int MOD = 1000000007; const int MAX = 3000000; string c[100005]; char s[MAX]; int main() { int n; cin >> n; using p = pair<int, pair<int, int>>; usi...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); int a, b, n; vector<int> div; cin >> a >> b >> n; if (b > a) swap(a, b); for (int d = 1; d * d <= b; d++) { if (a % d == 0 and b % d == 0) div.push_back(d); int d2 = -1; if (b % d =...
#include <bits/stdc++.h> using namespace std; multiset<int> s; multiset<int>::iterator itr; int c[5], tot; int get_ty(int x) { if (c[2] >= x) return 1; else if (c[1] + c[2] >= x) return 2; else if (c[0] + c[1] + c[2] >= x) return 3; else return 4; } int main() { ...
#include <bits/stdc++.h> using namespace std; long long ret[70]; long long qpow(long long a, long long n) { long long ret = 1; while (n) { if (n & 1) ret = ret * a; a = a * a; n >>= 1; } return ret; } void solve() { ret[0] = 1; for (long long i = 1; i < 64; i++) { ...
#include <bits/stdc++.h> using namespace std; const int N = 2501; int dp[N][3], a[N << 1]; int main() { int n; cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; memset(dp, 0x3f, sizeof(dp)); dp[0][0] = dp[1][1] = 0; for (int i = 2; i <= n; i++) for (int j = i + 1 >> 1; j; j--) { ...
#include <bits/stdc++.h> const long long mod = (long long)(1e9 + 7); int n; long long s, ans; long long f[1000]; long long ksm(long long x, long long y) { long long ans = 1; while (y) { if (y & 1) ans = ans * x % mod; x = x * x % mod; y = y / 2; } return ans; } long long ...
#include <bits/stdc++.h> using namespace std; int main() { int n, a, b, c; cin >> n >> a >> b >> c; int x, y, z, p = 0, i; i = min(a, min(b, c)); i = n / i; for (x = i; x >= 0; x--) { for (y = 0; y <= i; y++) { z = abs((n - (a * x + b * y)) / c); if ((a * x + b * y + c ...
#include <bits/stdc++.h> using namespace std; long long same(vector<pair<long long, int> > &x) { int n = x.size(); return (x[n - 1].first + x[n - 2].first) - (x[0].first + x[1].first); } long long diff(vector<pair<long long, int> > &x, long long h) { int n = x.size(); long long minx = min(x[0].f...
#include <bits/stdc++.h> using namespace std; void solve() { int n; cin >> n; string a, b; cin >> a >> b; vector<int> ans; int l = 0, r = n - 1; for (int i = 0; i < n; i++) { if (!(i & 1)) { if (a[l] == b[n - i - 1]) ans.push_back(1); ans.push_back(max(l, r) - min(l...
#include <bits/stdc++.h> using namespace std; long long int min1(long long int a) { long long int mx = 0, mi = 10; while (a) { mx = max(mx, a % 10); mi = min(mi, a % 10); a /= 10; } return mi * mx; } int main() { int t; cin >> t; while (t--) { long long int a,...
#include <bits/stdc++.h> using namespace std; const long long linf = LLONG_MAX; const int MOD = 1000000007; const int maxn = 1e5 + 10; const int MAX = 2e4 + 10; int _size[maxn], vis[maxn]; vector<int> sub; vector<pair<int, int> > adj[maxn]; int n, k, a, b; bool first(string second) { string a = ...
#include <bits/stdc++.h> using namespace std; const long long OO = 1e9; int main() { int n; scanf( %d , &n); vector<int> a(n); for (int i = 0; i < n; i++) scanf( %d , &a[i]); map<int, int> mp; vector<int> ans; for (int i = 0; i < n; i++) { if (mp[a[i]]) { ans.push_back(i ...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); int n, m; cin >> n >> m; int res = 2e9; for (int i = 0; i < m; i++) { int r, l; cin >> l >> r; res = min(res, r - l + 1); } vector<int> vec(n, 0); cout << res << n ; for (int i...
#include <bits/stdc++.h> int i, j, n, m; bool killed[200100], visited[200100]; int vlist[200100][3]; int ans[200100]; inline int myabs(int a) { return a < 0 ? -a : a; } inline int sign(int a) { return a / myabs(a); } struct G { int ind[200100]; int last[200100 * 2], e[200100 * 2], e_num[200100 * 2...
#include <bits/stdc++.h> using namespace std; vector<string> str(1); vector<int> ans(1); int solve(const string& s) { for (int len = 1; len <= 10; ++len) { for (int opt = 0; opt < (1 << len); ++opt) { bitset<10> bits(opt); string tmpS(len, 0 ); for (int i = 0; i < len; ++i) { ...
#include <bits/stdc++.h> using namespace std; const int dx[] = {1, 0, -1, 0}; const int dy[] = {0, 1, 0, -1}; const int N = 300009; const int INF = 1e9; const long long INF64 = 1e18; const double eps = 1e-9; const int MOD = 1e9 + 7; int n, q; int a[N], f[N]; int sum(int pos) { int res = 0; ...
#include <bits/stdc++.h> using namespace std; const int MX = 300005; int n, c[MX]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; for (int i = 0; i < n; i++) cin >> c[i]; int res = 0, i = n - 1; while (c[0] == c[i]) i--; res = i; i = 0; while (c[i] == c[n - ...
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, d, sum, mod1, mod, mod2; cin >> a >> b >> c; sum = (a + b); if ((a >= b \|\| a <= b) && (c <= sum)) { if (c == a) { cout << YES << endl; } else if (c == sum) { cout << YES << endl; } else { ...
#include <bits/stdc++.h> using namespace std; int n, k, m; int arr[1005][105][2], arr1[1005], arr2[1005]; long long dp(int i, int s, int hg) { if (s == 0 && hg) return ((i != n) ? ((9 * 1LL * arr2[n - i - 1]) % m) : 1); if (i == n) return 0; if (arr[i][s][hg] != -1) return arr[i][s][hg]; arr[i][...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1E5 + 5; const int BASE1 = 1E9 + 7; const int BASE2 = 999999993; int n, k; bool mark[MAXN]; int a[MAXN], nTurn; int main() { ios_base::sync_with_stdio(0); cin >> n >> k; for (int i = 0; i <= n; ++i) { string s; cin >>...
#include <bits/stdc++.h> using namespace std; const int M = 5005; int a[M], n, dp[M], ans, mx, s[M], t[M], cnt; bool vis[M]; struct no { int l, r, x; } p[M]; bool cmp(no a, no b) { return a.r != b.r ? a.r < b.r : a.l < b.l; } int main() { ios::sync_with_stdio(false); cin >> n; for (int i...
#include <bits/stdc++.h> using namespace std; int main() { vector<long long> a; a.push_back(0); a.push_back(1); map<long long, long long> m; int k, l = 0; m[0] = 1; m[1] = 1; while (1) { k = l; l = a.size(); for (int i = k; i < l; i++) { long long z = a[i] *...
#include <bits/stdc++.h> using namespace std; const int M = 1000000007; const int N = 100005, E = 262144; int n, m, i, u, v, p, t, vis[55][55], j, k; vector<int> g[55][55]; int q[N], l, r; vector<int> ansr, ansl, w[55][55]; long long g1[55][55][105], g2[55][55][105], g3[55][55][105]; long long dp[105]...
#include <bits/stdc++.h> using namespace std; const int N = (int)1e6 + 9; set<pair<int, int> > len, pos; int n, m; void add_seg(int L, int R) { if (L > R) return; int sz = R - L + 1; pos.insert(make_pair(L, sz)); if (L != 1 && R != n) sz = (sz + 1) / 2; len.insert(make_pair(sz, L)); } ...
#include <bits/stdc++.h> using namespace std; int inf = -1e9; struct node { int low; int high; pair<int, int> val; node() : val(make_pair(inf, 0)) {} node(int _l, int _h) : low(_l), high(_h), val(make_pair(inf, 0)) {} node(int _l, int _h, pair<int, int> _v) : low(_l), high(_h), val(_v) {} ...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int t[n]; for (int i = 0; i < n; i++) cin >> t[i]; int left_cnt, left_time, right_cnt, right_time; int left_idx = 0, right_idx = n - 1; left_time = left_cnt = right_time = right_cnt = 0; while (left_idx <= ri...

#include <bits/stdc++.h> using namespace std; const int MAXN = 32, MAXS = 1 << 17; const int MOD = 1e9 + 7, H = 3137; int add(int a, int b) { a += b; if (a >= MOD) a -= MOD; return a; } int sub(int a, int b) { a -= b; if (a < 0) a += MOD; return a; } int mul(int a, int b) { retur...

#include <bits/stdc++.h> using namespace std; const int MAXN = 505; int n, k; int a[MAXN], b[MAXN]; bool f[MAXN][MAXN]; int main() { scanf( %d%d , &n, &k); long long sum_a = 0, sum_b = 0; for (int i = 1; i <= n; i++) { scanf( %d%d , &a[i], &b[i]); sum_a += a[i]; sum_b += b[i]; ...

#include <bits/stdc++.h> using namespace std; using ii = pair<int, int>; using ll = long long; using li = pair<ll, int>; const int MAXK = 5000; struct jump { int node, prime, count; }; int n; vector<int> k; int fact_node[MAXK + 1]; vector<map<int, ii>> children; vector<int> primes; bool no...

#include <bits/stdc++.h> const int bufSize = 1e6; inline char nc() { return getchar(); static char buf[bufSize], *p1 = buf, *p2 = buf; return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, bufSize, stdin), p1 == p2) ? EOF : *p1++; } template <typename T> inline T read(T...

#include <bits/stdc++.h> using namespace std; int main() { long long n, m; while (cin >> n >> m) { long long num, sum = 0, minx = 1000000001; for (long long i = 0; i < n; i++) { cin >> num; sum += num; if (num < minx) minx = num; } if (sum < m) cout <<...

#include <bits/stdc++.h> using namespace std; const int N = 1e4 + 10; const int P = 1048576 + 10; const int Y = 30; int vis[N]; int cnt; int book[N]; int a[N]; int n; int m; int k; int addis[Y][Y]; int dis[N]; int dp[P]; queue<int> q; inline void bfs(int s) { for (int i = 1; i <= n +...

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

#include <bits/stdc++.h> using namespace std; const int N = 10010; const double eps = 1e-12; struct point { int x, y, op, id; int u, v; long long operator*(const point &r) const { return (long long)u * r.v - (long long)v * r.u; } } a[N << 1], s; int n; int ans[N]; inline bool cmp(p...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; int n; cin >> n; int a[n], b[n]; int r1 = 0, r2 = 0; for (int i = 0; i < n; i++) { cin >> a[i]; r1 |= a[i]; } for (int i = 0; i < n; i++) { cin...

#include <bits/stdc++.h> using namespace std; const long long inf = 1e15; const int maxn = 5000 + 5; long long cnt[maxn + 10]; long long p[maxn + 10][maxn + 10]; long long pd[maxn + 10]; int main() { memset(cnt, 0, sizeof(cnt)); int n; scanf( %d , &n); for (int i = (1); i <= (n); i++) { ...

#include <bits/stdc++.h> using namespace std; char buf[1 << 20], *p1, *p2; template <typename T> inline void read(T &t) { register int v = (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 20, stdin), p1 == p2) ? EOF : *p1++); T f = 1; t = 0; while (!isdigit(v)...

#include <bits/stdc++.h> using namespace std; const long double Pi = 3.141592653; const long long mod = 1e6 + 3; class Graph { map<int, vector<int>> ma; public: void addedge(int n, int m) { ma[n].push_back(m); ma[m].push_back(n); } }; int main() { long long n; cin >> n;...

#include <bits/stdc++.h> char *fs, *ft, buf[1 << 20]; inline int read() { int x = 0, f = 1; char ch = (fs == ft && (ft = (fs = buf) + fread(buf, 1, 1 << 20, stdin), fs == ft)) ? 0 : *fs++; ; while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = (fs ==...

#include <bits/stdc++.h> using namespace std; const int RNG = 1000003; const int RNGT = RNG * 4; const int MOD1 = 1e9 + 7; const int MOD2 = 1e9 + 87; const double pi = 2 * acos(0.0); inline int _Int() { int x; scanf( %d , &x); return x; } inline long long _LLi() { long long x; scan...

#include <bits/stdc++.h> using namespace std; template <class T> inline int cMin(T& a, T b) { return b < a ? a = b, 1 : 0; } template <class T> inline int cMax(T& a, T b) { return a < b ? a = b, 1 : 0; } template <class T> inline string to_str(T v) { ostringstream os; os << v; retu...

#include <bits/stdc++.h> using namespace std; const int maxm = 1e6; int pre[maxm * 2 + 10]; bool a[maxm + 10]; int N; int main(int argc, const char* argv[]) { scanf( %d , &N); for (int i = 1; i <= N; i++) { int val; scanf( %d , &val); pre[val] = -1; a[val] = true; } i...

#include <bits/stdc++.h> using namespace std; vector<int> e[100500]; bool visited[100500]; int main() { int n, m; scanf( %d%d , &n, &m); if (m != n - 1) { cout << no << endl; return 0; } for (int i = 0; i < m; i++) { int u, v; scanf( %d%d , &u, &v); u--; ...

#include <bits/stdc++.h> using namespace std; signed main() { long long n; cin >> n; vector<double> gr, le; vector<long long> gri, lei; vector<long long> grind, leind; for (long long i = 0; i < n; ++i) { double t; cin >> t; if (t >= 0) { gr.push_back(t); gri...

#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; const int N = 3e5 + 5; int n, q, a[N]; int rt[N * 20], ls[N * 20], rs[N * 20], sum[N * 20], cnt = 0; void change(int pre, int& o, int l, int r, int pos) { o = ++cnt; ls[o] = ls[pre]; rs[o] = rs[pre]; sum[o] = sum[pre] + 1; if (l == r) return; ...

#include <bits/stdc++.h> using namespace std; void PrintVector(vector<int> v2, string s) { cout << s; for (int i = 0; i < v2.size(); i++) cout << v2[i] << ; cout << endl; } void PrintVector(vector<int> v2) { for (int i = 0; i < v2.size(); i++) cout << v2[i] << ; cout << endl; } int...

#include <bits/stdc++.h> using namespace std; int dirx[] = {1, -1, 0, 0, 1, 1, -1, -1}, diry[] = {0, 0, 1, -1, 1, -1, 1, -1}; bool Set(int n, int pos) { return bool(n & (1 << pos)); } int32_t main() { ios_base::sync_with_stdio(false); int n, m; cin >> n >> m; string a, b; cin >> a >> b; ...

#include <bits/stdc++.h> using namespace std; template <typename T> void maxtt(T& t1, T t2) { t1 = max(t1, t2); } template <typename T> void mintt(T& t1, T t2) { t1 = min(t1, t2); } bool debug = 0; int n, m, k; int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0}; string direc = URDL ; long...

#include <bits/stdc++.h> int a[55]; using namespace std; int main() { int n, m, k, i, t = 0, cnt; scanf( %d%d%d , &n, &m, &k); if (k >= m) { printf( 0 n ); return 0; } for (i = 0; i < n; i++) scanf( %d , &a[i]); sort(a, a + n, std::greater<int>()); a[0] += k - 1; t = 0;...

#include <bits/stdc++.h> using namespace std; void seif() { std::ios_base::sync_with_stdio(0); } int xa[] = {-1, -1, -1, 0, 0, 0, 1, 1, 1}; int ya[] = {1, 0, -1, 1, 0, -1, 1, 0, -1}; int anx, any, marx, mary; bool ok = false; char grid[8][8]; bool valid(int x, int y) { if (x < 0 || y < 0 || x > 7 ||...

#include <bits/stdc++.h> using namespace std; int main() { int n, t; cin >> t; while (t--) { cin >> n; int arr[n]; for (int i = 0; i < n; i++) { cin >> arr[i]; } int mx, x; mx = 0; for (int i = 1; i < n; i++) { if (arr[i] < arr[i - 1]) { ...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma ) #pragma GCC optimize( unroll-loops ) using namespace std; double eps = 1e-12; template <class T> void swp(T& a, T& b) { T temp = a; a = b; b = temp; } long long...

#include <bits/stdc++.h> using namespace std; void ins(long long int a[], long long int n, long long int i = 0) { for (long long int i = 0; i < n; i++) a[i] = i; } template <typename t> void ins(t a[], long long int n, t b = 0) { for (long long int i = 0; i < n; i++) a[i] = b; } void print(long lo...

#include <bits/stdc++.h> using namespace std; long long n, mi, mx; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; long long a[n]; for (int i = 0; i < n && cin >> a[i]; i++) ; cout << abs(a[0] - a[1]) << << abs(a[0] - a[n - 1]) << endl; for (int i...

#include <bits/stdc++.h> using namespace std; string s, t, ts, ans; int pos[10000005], len[10000005], tot; inline string reverse(string s) { string t; t.resize(s.size()); int n = s.size(); for (int i = 0; i < n; i++) t[n - i - 1] = s[i]; return t; } void Duval(const string& s) { int ...

#include <bits/stdc++.h> using namespace std; template <class T1, class T2> int upmin(T1 &x, T2 v) { if (x > v) { x = v; return 1; } return 0; } template <class T1, class T2> int upmax(T1 &x, T2 v) { if (x < v) { x = v; return 1; } return 0; } const int IN...

#include <bits/stdc++.h> using namespace std; int main() { long long c, hr, hb, wr, wb; cin >> c >> hr >> hb >> wr >> wb; long long res = 0; for (long long w = 0; w < 2; ++w) { for (long long i = 0; i * wr <= c && i <= 10000000; ++i) { res = max(res, i * hr + hb * ((c - i * wr) / wb));...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cerr << Time : << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC << ms n ; string s; cin >> s; int l = 0, r = s.length() - 1; int cnt = 0; set<int> s1; ...

#include <bits/stdc++.h> using namespace std; int n; int a[500007]; int l[500007]; int r[500007]; long long ans = 0; pair<int, int> p[500007]; void input() { scanf( %d , &n); int i; for (i = 0; i < n; i++) { scanf( %d , &a[i]); p[i].first = a[i]; p[i].second = i; } ...

#include <bits/stdc++.h> using namespace std; const int mod = 998244353; void add(int &x, int y) { x = (x + y) % mod; } int mul(int x, int y) { return (long long)x * y % mod; } int pw(int x, int p) { int r = 1; while (p) { if (p & 1) r = mul(r, x); x = mul(x, x); p >>= 1; } r...

#include <bits/stdc++.h> char s[200001]; char pick(char a, char b) { char c; for (c = a ; c == a || c == b; c++) ; return c; } char *handle(char *s) { char *ps = s; for (s += 1; *s; s++) { if (*s == *(s - 1)) *s = pick(*(s - 1), *(s + 1)); } return ps; } int main() {...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; long long c[N], d[N]; int main() { long long sum = 0, ans = 0; int n, k; scanf( %d %d , &n, &k); for (int i = 1; i <= n; i++) { scanf( %lld , &c[i]); sum += c[i]; } for (int i = 1; i <= k; i++) { scan...

#include <bits/stdc++.h> using namespace std; int main() { int n, s; cin >> n >> s; int a[n + 1]; int cnt = 0; for (int i = 1; i < n; ++i) { a[i] = 1; cnt++; } a[n] = s - cnt; s -= cnt; if (s - cnt < 2) { cout << NO << endl; } else { cout << YES <<...

#include <bits/stdc++.h> using namespace std; int val_of_op[200]; int n; struct T { string Name, Expr; bool danger; int num[5]; int sum(int a0 = 0, int a1 = 0, int a2 = 0, int a3 = 0) { return num[a0] + num[a1] + num[a2] + num[a3]; } } macro[1000]; void Eliminate_Space(string &s) {...

#include <bits/stdc++.h> using namespace std; const int MAX = 1e5 + 9; int n, sq, a[MAX], group[MAX]; struct Bucket { Bucket() : l(1), r(0) {} int l, r, freq[MAX], cnt; } buckets[320]; void add(int idx, int k) { for (int i = buckets[idx].r + 1; i <= n; ++i) { if (!buckets[idx].freq[a[i]]) ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 100010, MAXC = 500; int can[MAXC], c = 0; int n, m, a[MAXN], b[MAXN]; int t[MAXN][MAXC]; int main() { cin >> n >> m; for (int i = 0; i < n; i++) cin >> a[i]; memcpy(b, a, sizeof(b)); sort(b, b + n); for (int i = 0; i < n; i++...

#include <bits/stdc++.h> using namespace std; struct exam { long long a; long long b; }; exam a[200000]; long long n, r, avg; bool comp(exam a, exam b) { return a.b < b.b; } int main() { cin >> n >> r >> avg; for (int i = 0; i < n; i++) cin >> a[i].a >> a[i].b; sort(a, a + n, comp); ...

#include <bits/stdc++.h> using namespace std; int n; map<int, int> num; int main() { cin >> n; int minNum = 1000 * 1000 * 1000 + 1; for (int i = 0; i < n; i++) { int tmp; cin >> tmp; num[tmp]++; minNum = min(minNum, tmp); } for (int i = minNum; n > 0; i++) { if ...

#include <bits/stdc++.h> int max(int a, int b) { if (a > b) return a; else return b; } int main() { int t, j; scanf( %d , &t); for (j = 0; j < t; j++) { int n, i, first = 0, last = 0, flagf = 0, count = 0; scanf( %d , &n); char arr[n]; scanf( %s , arr); ...

#include <bits/stdc++.h> using namespace std; long long ans, l, r, j, cn, ii, ix, p, N = 4e3; vector<long long> A; long long pww(long long a, long long b) { long long r = 1; for (long long i = 1; i <= b; i++) r *= a; return r; } void gen(long long i, long long p) { long long r = 0; for (...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; for (int itr = 0; itr < t; itr++) { int n; vector<int> s; cin >> n; for (int i = 1; i <= n; i++) { int tmp; cin >> tmp; s.push_back(tmp); } int token = 0; for (in...

#include <bits/stdc++.h> using namespace std; map<char, int> freq; vector<int> vec; vector<char> vec2; int main() { int n, k; cin >> n >> k; string s, ans, update, alpha = abcdefghijklmnopqrstuvwxyz ; cin >> s; int size = s.size(); for (int i = 0; i < 26; i++) { for (int j = 0; ...

#include <bits/stdc++.h> using namespace std; template <typename T> void chkmax(T &x, T y) { x = x > y ? x : y; } template <typename T> void chkmin(T &x, T y) { x = x > y ? y : x; } const int INF = (1ll << 30) - 1; template <typename T> void read(T &x) { x = 0; bool f = 1; char c...

#include <bits/stdc++.h> using namespace std; struct node { int pos, h, ans, id, f; } Do[100001]; int n; int cmd(node a, node b) { return a.pos < b.pos; } int cmd2(node a, node b) { return a.id < b.id; } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d%d , &Do[i].po...

#include <bits/stdc++.h> using namespace std; int main() { double fact[51], all = 0.0; fact[0] = 1; for (int i = 1; i < 51; i++) fact[i] = fact[i - 1] * i; int N, A[50], P; double dp[51][51]; cin >> N; for (int i = 0; i < N; i++) cin >> A[i]; cin >> P; int sum = 0; for (int i...

#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( Ofast ) void scan() {} template <typename F, typename... R> void scan(F& f, R&... r) { cin >> f; scan(r...); } int di_; string dnms_, co_ = , ; void debug_() { cout << endl; } template <typename F, typename... R> void deb...

#include <bits/stdc++.h> using namespace std; void init_code() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); } int main() { init_code(); long long t; cin >> t; while (t--) { long long x1, y1, z1; long long x2, y2, z2; cin >> x1 >> y1 >> z1 >> x2 >> y2 >> z2; ...

#include <bits/stdc++.h> using namespace std; char c[600][600]; int check(int x, int y) { if (c[x][y - 1] == * && c[x][y + 1] == * && c[x + 1][y] == * && c[x - 1][y] == * && c[x][y] == * ) return 1; return 0; } int main() { int m, n; cin >> n >> m; for (int i = 0; i ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 200010; int N; int c[2][MAXN]; int idx[2]; pair<int, int> p[MAXN]; int pn; long long solve() { long long ret = 0; int pre = -1; for (int i = 0; i < N; ++i) idx[i] = 1; while (1) { int opt = 1000000007, x = -1; for...

#include <bits/stdc++.h> using namespace std; const int MAXN = 505; const int MAXQ = 5000005; int n, m, X1[MAXQ], X2[MAXQ], Y1[MAXQ], Y2[MAXQ]; bool ans[MAXQ]; bitset<MAXN> dp1[MAXN][MAXN], dp2[MAXN][MAXN], temp; char board[MAXN][MAXN]; void dnc(int r1, int r2, vector<int> &que) { if (que.empty() ||...

#include <bits/stdc++.h> using namespace std; vector<int> v[3005]; vector<long long> sum[3005]; struct node { int mon; int who; bool operator<(const node &a) const { return mon > a.mon; } }; int main() { int n, m; int p, c; int get; int Max; long long ans; int pos[3005]; ...

#include <bits/stdc++.h> using namespace std; int main() { long k2, k3, k5, k6; long long sum = 0; cin >> k2 >> k3 >> k5 >> k6; long min = k2 < k5 ? k2 < k6 ? k2 : k6 : k5 < k6 ? k5 : k6; sum += min * 256; k2 -= min; k5 -= min; k6 -= min; min = k2 < k3 ? k2 : k3; sum += 32 * ...

#include <bits/stdc++.h> const int maxn = 5e5 + 5; using namespace std; bool vis[maxn]; int a[maxn]; int main() { string s; cin >> s; int k = s.size(); char y = s[0]; int ans = 1; for (int i = 0; i < k; i++) { if (i == 0) { cout << Mike << endl; continue; ...

#include <bits/stdc++.h> using namespace std; const int tt = 100005; struct edge { edge *nxt; int des; void maker(edge *&a, int b) { nxt = a, des = b; a = this; } } w[tt], *sta[tt], *tot; struct treap { treap *l, *r; int key, sz, ran; } * seg[tt * 4], buf[2000000], *pos; ...

#include <bits/stdc++.h> using namespace std; int n; char s[10000010]; struct Trie { struct nd { int ch[2], fa, fail, pos; } t[10000010]; int used; Trie() : used(1) {} int id[10000010]; int ins(int len, int I) { int u = 1; for (int i = 1; i <= len; i++) { if (!t...

#include <bits/stdc++.h> using namespace std; int main() { int n; long long tab[200001], min1, odl = -1, wynik, first; cin >> n; cin >> tab[0]; min1 = 0; first = 0; for (int i = 1; i < n; i++) { cin >> tab[i]; if (tab[i] == tab[min1]) { if (odl < i - min1) odl = i - m...

#include <bits/stdc++.h> using namespace std; const int N = 100010; const int M = 10005; const int mod = 1e9 + 7; const int inf = 0x3f3f3f3f; int n, a, i, j, b[M + 1], s[100100], r = 200000000; int main() { scanf( %d , &n); for (i = 1; i <= M; i++) b[i] = 10000; for (i = 1; i <= n; i++) { ...

#include <bits/stdc++.h> using namespace std; int main() { int a[55], b[55]; int n, i, j, sum = 0, sum1 = 0, s = 0, s1 = 0, count = 0, count1 = 0, k = 0; scanf( %d , &n); for (i = 0; i < n; i++) { scanf( %d , &a[i]); sum += a[i]; } for (i = 0; i < n; i++) { scanf( %d , &b[i...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; const long long MX = 4e6 + 5, MOD = 1e9 + 7, inf = 1e18, LG = 21; int main() { int t; cin >> t; while (t--) { long long x0, n, ans = 0; cin >> x0 >> n; if (n == 0) { cout << x0 << n ; cont...

#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; const int maxN = 1 << 18; template <class T1, class T2> inline void remax(T1& a, T2 b) { a = max(a, (T1)b); } int deg[maxN], fat[maxN]; vector<int> G[maxN]; queue<int> Q; long long w[maxN]; pair<long long, int> leg[2][max...

#include <bits/stdc++.h> using namespace std; int main() { int n, minx = 999999, ans, df1, df2; char s[51]; scanf( %d , &n); getchar(); scanf( %s , s); for (int i = 0; i < n - 3; i++) { int t = 0; ans = 0; while (t <= 3) { int x = i + t; if (t == 0) { ...

#include <bits/stdc++.h> using namespace std; const int N = 100005; int n, m; int a[N], q[N]; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> m; for (int i = 0; i < m; ++i) cin >> q[i]; cin >> n; for (int i = 0; i < n; ++i) cin >> a[i]; sort(q, q + m); sort(a,...

#include <bits/stdc++.h> using namespace std; const int MAXN = 2001; const long long INF = 1e15; int DELTA = 2500; int n; long long price[MAXN], Time[MAXN]; long long dp[MAXN][3 * MAXN]; long long rec(int idx, int remTime) { if (remTime >= MAXN) remTime = MAXN - 1; if (idx == n) return remTime >...

#include <bits/stdc++.h> using namespace std; int main() { int n, s; cin >> n >> s; map<int, long long> sale; map<int, long long> buy; for (int i = 0; i < n; i++) { char c; cin >> c; if (c == B ) { int price, num; cin >> price >> num; buy[price] += num;...

#include <bits/stdc++.h> using namespace std; int main() { char s[1001]; int m[26]; while (gets(s)) { memset(m, 0, sizeof(m)); int len = strlen(s); int dan = 0, shuang = 0; for (int i = 0; i < len; i++) m[s[i] - a ]++; for (int i = 0; i < 26; i++) if (m[i]) { ...

#include <bits/stdc++.h> using namespace std; const long long maxi = 1e18; long long prime[] = {0, 2, 3, 5, 7, 11, 13, 17, 19, 23, 29}; long long dp[15][1005], mi[15][1005], ans; int n; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); for (int i = 1; i <= 10; i++) { mi[i][0] =...

#include <bits/stdc++.h> using namespace std; int n; vector<pair<int, int> > white, black; int main() { cin >> n; for (int i = 0; i < n; i++) { int c, s; cin >> c >> s; if (c) { black.push_back(make_pair(s, i + 1)); } else { white.push_back(make_pair(s, i + 1)); ...

#include <bits/stdc++.h> using namespace std; const long long INF = (long long)1 << 61; int main() { long long n, m; cin >> n >> m; pair<long long, long long> first, last; bool was = false; vector<vector<char>> v(n, vector<char>(m)); for (int i = 0; i < n; ++i) { for (int j = 0; j < ...

#include <bits/stdc++.h> using namespace std; int sum[200000 + 5]; int main() { int n; scanf( %d , &n); for (int i = 0; i < n; ++i) { scanf( %d , sum + i); sum[i] += i; } sort(sum, sum + n); for (int i = 1; i < n; ++i) { if (sum[i] == sum[i - 1]) { printf( :( n );...

#include <bits/stdc++.h> using namespace std; const double eps = 1e-11; int vex[4] = {1, 0, -1, 0}; int vey[4] = {0, 1, 0, -1}; long long int MOD = 1000000007; const int MAX = 3000000; string c[100005]; char s[MAX]; int main() { int n; cin >> n; using p = pair<int, pair<int, int>>; usi...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); int a, b, n; vector<int> div; cin >> a >> b >> n; if (b > a) swap(a, b); for (int d = 1; d * d <= b; d++) { if (a % d == 0 and b % d == 0) div.push_back(d); int d2 = -1; if (b % d =...

#include <bits/stdc++.h> using namespace std; multiset<int> s; multiset<int>::iterator itr; int c[5], tot; int get_ty(int x) { if (c[2] >= x) return 1; else if (c[1] + c[2] >= x) return 2; else if (c[0] + c[1] + c[2] >= x) return 3; else return 4; } int main() { ...

#include <bits/stdc++.h> using namespace std; long long ret[70]; long long qpow(long long a, long long n) { long long ret = 1; while (n) { if (n & 1) ret = ret * a; a = a * a; n >>= 1; } return ret; } void solve() { ret[0] = 1; for (long long i = 1; i < 64; i++) { ...

#include <bits/stdc++.h> using namespace std; const int N = 2501; int dp[N][3], a[N << 1]; int main() { int n; cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; memset(dp, 0x3f, sizeof(dp)); dp[0][0] = dp[1][1] = 0; for (int i = 2; i <= n; i++) for (int j = i + 1 >> 1; j; j--) { ...

#include <bits/stdc++.h> const long long mod = (long long)(1e9 + 7); int n; long long s, ans; long long f[1000]; long long ksm(long long x, long long y) { long long ans = 1; while (y) { if (y & 1) ans = ans * x % mod; x = x * x % mod; y = y / 2; } return ans; } long long ...

#include <bits/stdc++.h> using namespace std; int main() { int n, a, b, c; cin >> n >> a >> b >> c; int x, y, z, p = 0, i; i = min(a, min(b, c)); i = n / i; for (x = i; x >= 0; x--) { for (y = 0; y <= i; y++) { z = abs((n - (a * x + b * y)) / c); if ((a * x + b * y + c ...

#include <bits/stdc++.h> using namespace std; long long same(vector<pair<long long, int> > &x) { int n = x.size(); return (x[n - 1].first + x[n - 2].first) - (x[0].first + x[1].first); } long long diff(vector<pair<long long, int> > &x, long long h) { int n = x.size(); long long minx = min(x[0].f...

#include <bits/stdc++.h> using namespace std; void solve() { int n; cin >> n; string a, b; cin >> a >> b; vector<int> ans; int l = 0, r = n - 1; for (int i = 0; i < n; i++) { if (!(i & 1)) { if (a[l] == b[n - i - 1]) ans.push_back(1); ans.push_back(max(l, r) - min(l...

#include <bits/stdc++.h> using namespace std; long long int min1(long long int a) { long long int mx = 0, mi = 10; while (a) { mx = max(mx, a % 10); mi = min(mi, a % 10); a /= 10; } return mi * mx; } int main() { int t; cin >> t; while (t--) { long long int a,...

#include <bits/stdc++.h> using namespace std; const long long linf = LLONG_MAX; const int MOD = 1000000007; const int maxn = 1e5 + 10; const int MAX = 2e4 + 10; int _size[maxn], vis[maxn]; vector<int> sub; vector<pair<int, int> > adj[maxn]; int n, k, a, b; bool first(string second) { string a = ...

#include <bits/stdc++.h> using namespace std; const long long OO = 1e9; int main() { int n; scanf( %d , &n); vector<int> a(n); for (int i = 0; i < n; i++) scanf( %d , &a[i]); map<int, int> mp; vector<int> ans; for (int i = 0; i < n; i++) { if (mp[a[i]]) { ans.push_back(i ...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); int n, m; cin >> n >> m; int res = 2e9; for (int i = 0; i < m; i++) { int r, l; cin >> l >> r; res = min(res, r - l + 1); } vector<int> vec(n, 0); cout << res << n ; for (int i...

#include <bits/stdc++.h> int i, j, n, m; bool killed[200100], visited[200100]; int vlist[200100][3]; int ans[200100]; inline int myabs(int a) { return a < 0 ? -a : a; } inline int sign(int a) { return a / myabs(a); } struct G { int ind[200100]; int last[200100 * 2], e[200100 * 2], e_num[200100 * 2...

#include <bits/stdc++.h> using namespace std; vector<string> str(1); vector<int> ans(1); int solve(const string& s) { for (int len = 1; len <= 10; ++len) { for (int opt = 0; opt < (1 << len); ++opt) { bitset<10> bits(opt); string tmpS(len, 0 ); for (int i = 0; i < len; ++i) { ...

#include <bits/stdc++.h> using namespace std; const int dx[] = {1, 0, -1, 0}; const int dy[] = {0, 1, 0, -1}; const int N = 300009; const int INF = 1e9; const long long INF64 = 1e18; const double eps = 1e-9; const int MOD = 1e9 + 7; int n, q; int a[N], f[N]; int sum(int pos) { int res = 0; ...

#include <bits/stdc++.h> using namespace std; const int MX = 300005; int n, c[MX]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; for (int i = 0; i < n; i++) cin >> c[i]; int res = 0, i = n - 1; while (c[0] == c[i]) i--; res = i; i = 0; while (c[i] == c[n - ...

#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, d, sum, mod1, mod, mod2; cin >> a >> b >> c; sum = (a + b); if ((a >= b || a <= b) && (c <= sum)) { if (c == a) { cout << YES << endl; } else if (c == sum) { cout << YES << endl; } else { ...

#include <bits/stdc++.h> using namespace std; int n, k, m; int arr[1005][105][2], arr1[1005], arr2[1005]; long long dp(int i, int s, int hg) { if (s == 0 && hg) return ((i != n) ? ((9 * 1LL * arr2[n - i - 1]) % m) : 1); if (i == n) return 0; if (arr[i][s][hg] != -1) return arr[i][s][hg]; arr[i][...

#include <bits/stdc++.h> using namespace std; const int MAXN = 1E5 + 5; const int BASE1 = 1E9 + 7; const int BASE2 = 999999993; int n, k; bool mark[MAXN]; int a[MAXN], nTurn; int main() { ios_base::sync_with_stdio(0); cin >> n >> k; for (int i = 0; i <= n; ++i) { string s; cin >>...

#include <bits/stdc++.h> using namespace std; const int M = 5005; int a[M], n, dp[M], ans, mx, s[M], t[M], cnt; bool vis[M]; struct no { int l, r, x; } p[M]; bool cmp(no a, no b) { return a.r != b.r ? a.r < b.r : a.l < b.l; } int main() { ios::sync_with_stdio(false); cin >> n; for (int i...

#include <bits/stdc++.h> using namespace std; int main() { vector<long long> a; a.push_back(0); a.push_back(1); map<long long, long long> m; int k, l = 0; m[0] = 1; m[1] = 1; while (1) { k = l; l = a.size(); for (int i = k; i < l; i++) { long long z = a[i] *...

#include <bits/stdc++.h> using namespace std; const int M = 1000000007; const int N = 100005, E = 262144; int n, m, i, u, v, p, t, vis[55][55], j, k; vector<int> g[55][55]; int q[N], l, r; vector<int> ansr, ansl, w[55][55]; long long g1[55][55][105], g2[55][55][105], g3[55][55][105]; long long dp[105]...

#include <bits/stdc++.h> using namespace std; const int N = (int)1e6 + 9; set<pair<int, int> > len, pos; int n, m; void add_seg(int L, int R) { if (L > R) return; int sz = R - L + 1; pos.insert(make_pair(L, sz)); if (L != 1 && R != n) sz = (sz + 1) / 2; len.insert(make_pair(sz, L)); } ...

#include <bits/stdc++.h> using namespace std; int inf = -1e9; struct node { int low; int high; pair<int, int> val; node() : val(make_pair(inf, 0)) {} node(int _l, int _h) : low(_l), high(_h), val(make_pair(inf, 0)) {} node(int _l, int _h, pair<int, int> _v) : low(_l), high(_h), val(_v) {} ...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int t[n]; for (int i = 0; i < n; i++) cin >> t[i]; int left_cnt, left_time, right_cnt, right_time; int left_idx = 0, right_idx = n - 1; left_time = left_cnt = right_time = right_cnt = 0; while (left_idx <= ri...