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

func_code_string stringlengths 59 71.4k
#include <bits/stdc++.h> using namespace std; int main() { int n, sum = 0; string x; cin >> n; for (int i = 1; i <= n; i++) { cin >> x; if (x == ABSINTH \|\| x == BEER \|\| x == BRANDY \|\| x == CHAMPAGNE \|\| x == GIN \|\| x == RUM \|\| x == SAKE \|\| x == TEQUILA \|\| ...
#include <bits/stdc++.h> using namespace std; struct Root { int p, c; long long e, x; vector<int> v; Root(int p, long long e) : p(p), e(e) {} }; const int MAXN = 200200; bool oncirc[MAXN]; vector<pair<int, long long> > e[MAXN]; vector<Root> circ; long long ans[MAXN]; bool mark[MAXN]; ...
#include <bits/stdc++.h> using namespace std; const int N = 1000000; bool can[2]; int a[N]; int main() { ios::sync_with_stdio(false); int n, x, y, l; cin >> n >> l >> x >> y; for (int i = 0; i < n; i++) { cin >> a[i]; } set<int> q; for (int i = 0; i < n; i++) { q.insert...
#include <bits/stdc++.h> using namespace std; template <typename T> inline bool chkmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; } template <typename T> inline bool chkmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; } const int oo = 0x3f3f3f3f; const int maxn = 200000, max0 = 10000...
#include <bits/stdc++.h> using namespace std; int N, Q; vector<vector<int> > adj; vector<set<int> > grp; vector<int> dep, tin, tout; vector<vector<int> > par; int num = 0; void dfs(int now, int bf) { tin[now] = num++; if (bf != -1) par[now][0] = bf; for (int i = 1; i < 18; i++) { int t...
#include <bits/stdc++.h> using namespace std; int main() { int n, a; cin >> n >> a; if (a & 1) cout << (a / 2 + 1); else { a = n - a; cout << a / 2 + 1; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int x, t, a, b, at, bt; cin >> x >> t >> a >> b >> at >> bt; int btek = b; set<int> my; my.insert(0); int ttek1 = t; while (btek > 0 && ttek1 > 0) { my.insert(btek); int atek = a; int ttek2 = t; while (ate...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); string s; int n, i, ct = 0; cin >> n >> s; s = + s; for (i = 1; i <= n - 10; i++) { if (s[i] == 8 ) ct++; } if (ct > (n - 11) / 2) cout << YES n...
#include <bits/stdc++.h> using namespace std; const int N = 100005; struct Query { int idx, k; }; int n, m; int c[N], ans[N], cnt[N], pref[N]; vector<Query> qs[N]; vector<int> adj[N]; void read() { cin >> n >> m; for (int i = 1; i <= n; i++) cin >> c[i]; for (int i = 1; i <= n - 1; i++...
#include<bits/stdc++.h> using namespace std; #define N 2005 int read(){ int w=0,f=1; char c= ; while(c< 0 \|\|c> 9 )f=(c== - ?-f:f),c=getchar(); while(c>= 0 &&c<= 9 )w=w10+c- 0 ,c=getchar(); return wf; } int T,n,ans[N],cnt; bool vis[N]; bool check(int x){ printf( ? %d %d n ,x,1); fo...
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3f; const int MOD = (int)1e9 + 7; const int N = (int)3e5 + 7; int n, p, k, a[N]; map<int, int> cnt; inline int add(int a, int b) { return (a += b) >= p ? a - p : a; } inline int mul(int a, ...
#include <bits/stdc++.h> using namespace std; int on[10001]; int main() { std::ios::sync_with_stdio(false); cin.tie(0); int n, t, r, ans = 0; cin >> n >> t >> r; for (int i = 0; i < n; ++i) { int w; cin >> w; w += 400; int cnt = 0; for (int j = w; j > w - t; --j) ...
#include <bits/stdc++.h> using namespace std; int main() { int n, cnt = 0, i, l; cin >> n; for (i = 1; i <= n; i++) { cin >> l; if (l == 1) { cnt += 1; } } if (cnt > 0) { cout << HARD ; } else { cout << EASY ; } }
#include <bits/stdc++.h> using namespace std; int n, L, R; int a, b; int lo = -1, hi = 1e9 + 1; const int MAXN = 111111; const int INF = 1e9; vector<pair<int, int> > adj[MAXN]; int sz[MAXN], chk[MAXN]; int q[MAXN], f[MAXN], g[MAXN], d[MAXN], h[MAXN]; void dfs(int u, int p) { sz[u] = 1; for (...
#include <bits/stdc++.h> const int N = 200020; int _, n, m, x, y, flag, a[N], c[N], d[N]; std::queue<int> q; std::pair<int, int> b[N]; std::vector<int> g[N], ans; void f(int u) { if (++a[u] > g[u].size() && !c[u]) q.push(u), c[u] = 1; } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <...
#include <bits/stdc++.h> using namespace std; long long MOD = 1e9 + 7; long long add(long long a, long long b) { return (a + b) % MOD; } long long sub(long long a, long long b) { return ((a - b) % MOD + MOD) % MOD; } long long mul(long long a, long long b) { return (a * b) % MOD; } long long a[800000], tim[...
#include <bits/stdc++.h> using namespace std; long long int base = 639941; char str[1505], bad[30]; set<long long int> s; int main() { int k, n, i, j; scanf( %s , str); scanf( %s , bad); scanf( %d , &k); n = strlen(str); int ans = 0; for (i = 0; i < n; i++) { int b = 0; ...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:128000000 ) using namespace std; const int INF = 1000000000; typedef struct zap { int p; zap left, right, rod; }; char s[100]; zap top = 0, temp = 0; int dfs(zap t) { if (t->p == 0) { printf( int ); return 0; } ...
#include <bits/stdc++.h> using namespace std; int q, w, e, W; int a[500000], k, b, c, d, n, m, ip1, ip2, a1, b1, c1, d1, m1[500000], m2[500000], m3[500000], m4[500000]; string old[2000], nov[2000], s1, s2; int main() { cin >> q; for (int i = 1; i <= q; i++) { cin >> s1 >> s2; int ok ...
#include <bits/stdc++.h> using namespace std; const int N = 300010; int dia, n; long long a[N], ans; map<long long, int> mp; int main() { cin >> dia >> n; ans = (long long)n * (n - 1LL) * (n - 2LL) / 6LL; for (int i = 1, s, f; i <= n; ++i) { cin >> s >> f; if (!s) f += dia; f %...
#include <bits/stdc++.h> using namespace std; template <typename T, typename U> std::istream& operator>>(std::istream& i, pair<T, U>& p) { i >> p.first >> p.second; return i; } template <typename T> std::istream& operator>>(std::istream& i, vector<T>& t) { for (auto& v : t) { i >> v; }...
#include <bits/stdc++.h> using namespace std; map<string, string> m; map<string, int> used; string f(string x) { used[x] = 1; if (m[x] == x) return x; return f(m[x]); } int main() { int count = 0; vector<string> tab; int n; cin >> n; for (int i = 0; i < n; i++) { string...
#include <bits/stdc++.h> using namespace std; const int N = 2002; int n, a[N][N], c[N], p[N], t, A; string s[N]; bool C() { for (int i = 1; i <= n; i++) p[i] = c[i]; sort(p + 1, p + n + 1), t = 0; for (int i = 1; i < n; i++) { t += p[i]; if (t == i * (i - 1) / 2) return false; } ...
#include <bits/stdc++.h> using namespace std; const int maxn = 2010; int n, m, k; long long sum[maxn][maxn]; char s[maxn][maxn]; long long calc(int x, int y) { if (x <= 0 \|\| y <= 0) return 0; long long ans = 0; int a = x % n, b = y % m; ans = (1ll * x * y - 1ll * a * b) / 2; if ((__built...
#include <bits/stdc++.h> using namespace std; int main() { long long a[100005]; int n; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; } for (int i = 0; i < n; i++) { printf( %I64d , a[i] + a[i + 1]); } }
#include <bits/stdc++.h> using namespace std; string s; int k; int main() { cin >> s; for (int i = 0; i < s.length(); i++) if (s[i] == 1 ) k++; if (k > 1) cout << (s.length() + 1) / 2 << endl; else cout << s.length() / 2 << endl; return 0; }
#include <bits/stdc++.h> using namespace std; long long read() { long long a = 0, b = getchar(), c = 1; while (!isdigit(b)) c = b == - ? -1 : 1, b = getchar(); while (isdigit(b)) a = a * 10 + b - 0 , b = getchar(); return a * c; } void print(long long x) { if (x < 0) putchar( - ), x = -x;...
#include <bits/stdc++.h> using namespace std; struct Vec { double x, y; Vec(double newX = 0, double newY = 0) { x = newX; y = newY; } Vec operator+(Vec r) { return Vec(x + r.x, y + r.y); } Vec operator-(Vec r) { return Vec(x - r.x, y - r.y); } Vec operator*(double r) { return Vec...
#include <bits/stdc++.h> using namespace std; const int Maxn = 1 << 30; int n, m, str[100100], lim[100100], up[100100], D[100100], col[100100 * 4]; long long ans; vector<int> F[100100 * 4]; vector<long long> sum2[100100 * 4], sum[100100 * 4]; bool cmp(int x, int y) { return D[x] > D[y]; } void build(int...
#include <bits/stdc++.h> int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } int main() { int la, ra, ta, lb, rb, tb; scanf( %d%d%d , &la, &ra, &ta), ++ra; scanf( %d%d%d , &lb, &rb, &tb), ++rb; int g = gcd(ta, tb); ra -= la / g * g, la %= g; rb -= lb / g * g, lb %= g; if (lb > la) lb...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1E4 + 10; bool st[MAXN]; int n, k, l, f[1 << 20], dis[25][25], id[MAXN], d[MAXN], tot; vector<int> g[MAXN]; queue<int> q; inline void add(int u, int v) { g[u].push_back(v); g[v].push_back(u); } void bfs(int s) { memset(d, 0x3f,...
#include <bits/stdc++.h> using namespace std; const int Maxn = 3e5 + 5; const int inf = 1 << 29; inline int min(int a, int b) { return a < b ? a : b; } inline int max(int a, int b) { return a > b ? a : b; } inline int R() { char ch = getchar(); int x = 0; bool f = 0; for (; !isdigit(ch); ch ...
#include <bits/stdc++.h> using namespace std; void work(long long ang) { for (long long n = 3;; n++) { if (ang * n % 180 == 0) { if (ang * n / 180 <= n - 2) { printf( %I64d n , n); return; } } if (n == 998244353) break; } } int main() { int T; ...
#include <bits/stdc++.h> using namespace std; const int MOD = 998244353; string s; int n, ans; int T, A[1010], B[1010], cnt, head[2010], nxt[100010], dis[100010], id; bool w[100010]; void link(int a, int b, int c) { nxt[++id] = head[a], head[a] = id, dis[id] = b, w[id] = c; nxt[++id] = head[b], he...
#include <bits/stdc++.h> using namespace std; const long long N = 4e6 + 5; long long n, a[N], b[N], sum[N], I, lim = 1, mx = -1, Ans; long long read() { long long x = 0, f = 1; char c = getchar(); while (c < 0 \|\| c > 9 ) { if (c == - ) f = -1; c = getchar(); } while (c >= 0 ...
#include <bits/stdc++.h> using namespace std; long long read() { long long w = 0, f = 1; char c = ; while (c < 0 \|\| c > 9 ) c = getchar(), f = c == - ? -1 : f; while (c >= 0 && c <= 9 ) w = w * 10 + c - 48, c = getchar(); return w * f; } long long read14() { char c = getchar()...
#include <bits/stdc++.h> using namespace std; int n, apple[200000], a, b; long long tot = 0; vector<int> adj[200000]; int GCD(long long x, long long y) { if (y == 0) return x; return GCD(y, x % y); } pair<long long, long long> DFS(int ant, int act) { if (adj[act].size() == 1) return make_pair(...
#include <bits/stdc++.h> using namespace std; int main(int argc, char* argv[]) { int k, n; cin >> n >> k; int val[100000]; int awake[100000]; for (int i = 0; i < n; ++i) { cin >> val[i]; } int sum = 0; int extra = 0; int max = 0; for (int i = 0; i < n; ++i) { cin ...
#include <bits/stdc++.h> using namespace std; int main() { long long int n; cin >> n; long long int c, e = 0; long long int s = 0, a; for (long long int i = 0; i < n; i++) { cin >> a; s += a; if (a % 2 != 0) { e++; if (e == 1) c = a; else if (e...
#include <bits/stdc++.h> using namespace std; const int MAXN = int(2e5 + 5); int n, m, S; int POW[25]; int f[MAXN]; bool vis[MAXN]; bool flag[MAXN]; long long tmp, tot, Ans, t; struct edge { int u, v, id; int w, c; } e[MAXN]; struct node { int to, id; node() {} node(int T, int ...
#include <bits/stdc++.h> using namespace std; const long long N = 1e5 + 10; const long long inf = 1e14 + 10; long long n, k; long long a[N]; long long ps[N]; long long fen[N]; vector<long long> vec; void upd(long long x) { for (; x < N; x += (x & (-x))) { fen[x]++; } } long long get(...
#include <bits/stdc++.h> int cmpfunc(const void* a, const void* b) { return ((int)a - (int)b); } int main() { int t, x, i, j, c; scanf( %d , &t); while (t--) { char n[101]; int m[101]; scanf( %s , &n); x = strlen(n); j = 0; c = 0; for (i = 0; i < x; i++) { ...
#include <bits/stdc++.h> using namespace std; long long ans[100004] = {0}; vector<long long> v[100005]; int main() { long long n, m, i, j, ms = 0, sum = 0, res = 0; scanf( %lld %lld , &n, &m); for (i = 0; i < n; i++) { long long a, b; scanf( %lld %lld , &a, &b); v[a].push_back(b); ...
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int cmx = 1e5 + 5; int n, k; char a[505][505]; int id[505][505]; int cc_sz[505 * 505]; int seen[505 * 505]; bool inside(int x, int y) { if (0 <= min(x, y) and max(x, y) < n) return true; return false; } int dx[] =...
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; string s; cin >> s; int mark = 1; for (int i = 1; i < s.size(); i++) { if (s[i] != s[i - 1]) { mark = -1; break; } } if (mark == 1) { cout << s; for (int i = 1;...
#include <bits/stdc++.h> using namespace std; int n, s[200003], m, cnt, ans[200003]; vector<pair<int, int> > v[200003], g[200003]; bool vis[200003]; int dfs(int x) { vis[x] = 1; int ret = 0, tmp; for (int i = 0; i < v[x].size(); i++) if (!vis[v[x][i].first]) { tmp = dfs(v[x][i].first...
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, j = 0; cin >> a >> b >> c; for (int i = 1; i <= a; i++) { if (b >= 2 * i && c >= 4 * i) j++; } cout << j + 2 * j + 4 * j; return 0; }
#include <bits/stdc++.h> using namespace std; struct Counter { static int k; Counter() { k++; } ~Counter() { k--; } }; int Counter::k = 0; template <typename T> void pr(const string& name, T t) { cout << name << = << t << endl; } template <typename T, typename... Types> void pr(con...
#include <bits/stdc++.h> using namespace std; int n, m, a[102], b[102]; int main(void) { scanf( %d %d , &n, &m); for (int i = 0; i < m; ++i) scanf( %d %d , &a[i], &b[i]); for (int x = 1; x <= n; ++x) { int c = 0; for (int i = 0; i < m; ++i) if (x >= a[i] && x <= b[i]) ++c; if...
#include <bits/stdc++.h> using namespace std; const int maxn = 100100; long double a[maxn]; int main() { int n, s; long long k, b; while (~scanf( %d , &n)) { s = 0; for (int i = 0; i < n; i++) { scanf( %I64d %I64d , &k, &b); if (k != 0) { a[s++] = -(double)(b * ...
#include <bits/stdc++.h> using namespace std; inline long long bip(long long x, long long n, long long mod) { long long res = 1; while (n) { if (n & 1) { res = (res * x) % mod; } x = (x * x) % mod; n >>= 1; } return res; } const int maxn = INT_MAX; const long lo...
#include <bits/stdc++.h> using namespace std; const int Maxn = 100000 + 19; int a[Maxn], Le[Maxn], Ri[Maxn], cnt, L, R, n, i, ans; int main() { scanf( %d , &n); for (i = 1; i <= n; i++) scanf( %d , &a[i]); Le[cnt = 1] = 1; a[++n] = a[n - 1] - 1; for (i = 1; i <= n; i++) if (a[i] <= a[i...
#include <bits/stdc++.h> using namespace std; vector<int> path[1005]; long long d[105], t[105]; int n, m, u, v; queue<int> q; void work(int now) { for (int i = 1; i <= n; i++) { d[i] = 1 << 30; t[i] = 0; } d[now] = 0; t[now] = 1; q.push(now); while (!q.empty()) { u ...
#include <bits/stdc++.h> using namespace std; long long p, q, b, n, tmp; long long gcd(int x, int y) { return y ? gcd(y, x % y) : x; } int main() { ios::sync_with_stdio(false); cin.tie(); cout.tie(); cin >> n; for (int i = 0; i < n; i++) { cin >> p >> q >> b; q = q / gcd(q, p); ...
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; long long binpow(long long a, long long b) { if (b == 0) return 1; long long res = binpow(a, b / 2); if (b % 2) return res * res * a; else return res * res; } vector<int> adj[200006]; bool vis[200006]; bool ...
#include <bits/stdc++.h> using namespace std; signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long n, k; cin >> n >> k; string x; cin >> x; string ans = x; string y = ; long long p = n; for (long long i = 1; i < n; i++) { long long j; y = ...
#include <bits/stdc++.h> using namespace std; const int N = 1005; const int W = 1005; const long long inf = 1e18; struct dsu { vector<int> pr; vector<int> weights; vector<long long> beauties; set<int> roots; dsu(int _n) { pr.resize(_n + 5); weights.resize(_n + 5); beautie...
#include <bits/stdc++.h> using namespace std; const int maxn = 152; const int maxp = 51123987; static int A[maxn], len; static int opt[maxn][52][52][52], n, Ne[maxn][4]; char s[maxn]; static int idx[maxn * 10]; int main() { scanf( %d n , &n); for (int i = 1; i <= n; i++) { s[++len] = getch...
#include <bits/stdc++.h> using namespace std; char c[600]; vector<int> check; int n; vector<int> cal; int calculate() { int num = 0; cal.clear(); int minimum = INT_MAX; for (int i = 1; i <= n; i++) { if (c[i - 1] == ( ) { num++; minimum = min(minimum, num); cal...
#include <bits/stdc++.h> using namespace std; const long long INF = 1e18; const long long MOD = 1e9 + 7; const int N = 1e6; int T, n, r, A[1005]; void solve() { cin >> n >> r; for (int i = 1; i <= n; i++) { cin >> A[i]; } int ans = 0; int z; for (int i = 1; i <= n; i = z + r) {...
#include<iostream> #include<bits/stdc++.h> using namespace std; #define boost ios_base::sync_with_stdio(false); cin.tie(NULL) #define ll unsigned long long int #define tinput int t; cin>>t; while(t--) #define rep(i,n,s) for((i)=(s); (i)<(n); (i)++) template <typename T> T getmini(T x, T y) { return (...
#include <bits/stdc++.h> using namespace std; int primes[] = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, ...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 5; int pa[maxn], a[maxn], b[maxn]; struct Edge { int u, v, w; friend bool operator<(const Edge& a, const Edge& b) { return a.w > b.w; } } e[maxn]; void init(int n) { for (int i = 1; i <= n; i++) pa[i] = i, b[i] = 1; } int f...
#include <bits/stdc++.h> using namespace std; long long M = 1e9 + 7; long long power(long long a, long long p) { if (p == 0) return 1; long long ans = power(a, p / 2); ans = (ans * ans) % M; if (p % 2) ans = (ans * a) % M; return ans; } int nC2(int n) { return (n * (n - 1)) / 2; } int fa...
#include <bits/stdc++.h> using namespace std; void test_case(); long long power(int n, int p); int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { test_case(); } return 0; } void test_case() { int n, x; cin >> n >> ...
#include <bits/stdc++.h> using namespace std; struct rec { int l, r; }; rec f[2222][2223]; bool can[2222][2223]; int n, m, k, x, y, xx, yy; void del(int x, int y) { can[x][y] = false; for (int i = 1; i <= m; i++) { f[x][i].l = f[x][i - 1].l; if (can[x][i - 1]) f[x][i].l = i - 1; ...
#include <bits/stdc++.h> using namespace std; int a[100007], b[100007], c[100007]; int main() { ios_base::sync_with_stdio(false); int n; cin >> n; for (int i = 1; i < n + 1; i++) cin >> a[i]; for (int i = 1; i < n + 1; i++) { if (a[i] > a[i - 1]) b[i] = b[i - 1] + 1; else ...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); int t; cin >> t; while (t--) { long long n, k, d1, d2; cin >> n >> k >> d1 >> d2; if (n % 3) { cout << no n ; continue; } int flag = 0; long long x1, x2, x3; ...
#include <bits/stdc++.h> using namespace std; const int mod = 998244353; const int N = 132007; int n, a, b; int rev[N], fac[N], finv[N], f[N], g[N], h[N]; inline int qpow(int x, int k, int r = 1) { for (; k; k >>= 1, x = 1ll * x * x % mod) if (k & 1) r = 1ll * r * x % mod; return r; } inli...
#include <bits/stdc++.h> using namespace std; int n, x; vector<int> v; int main() { scanf( %d , &n); for (int i = 0; i < n; ++i) { scanf( %d , &x); int a = lower_bound(v.begin(), v.end(), x) - v.begin(); if (a == v.size()) v.push_back(x); else v[a] = x; } ...
#include <bits/stdc++.h> using namespace std; int main() { int n; int b; cin >> n >> b; int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } int mini[n]; mini[0] = a[0]; for (int i = 1; i < n; i++) { mini[i] = min(mini[i - 1], a[i]); } int maxi = b; for ...
#include <bits/stdc++.h> using namespace std; const int maxn = 5e5 + 10; int n, m, x, y, w, cnt, col[maxn], dis[maxn], vis[maxn], d[maxn], head[maxn]; struct node { int nxt, to, val; } e[maxn << 1]; void add(int x, int y, int w) { e[++cnt].to = y; e[cnt].nxt = head[x]; head[x] = cnt; e[c...
#include <bits/stdc++.h> using namespace std; long long int fpow(long long int n, long long int k, long long int p = 1000000007) { long long int r = 1; n = n % p; while (k > 0) { if (k & 1) { r = (r * n) % p; } k = k >> 1; n = (n * n) % p; } r...
#include <bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 51, MOD = 1e9 + 7; struct Matrix { int num[6][6]; Matrix() { memset(num, 0, sizeof(num)); } inline int* operator[](const int& x) { return num[x]; } inline const int* operator[](const int& x) const { return num[x]; } }; Matrix...
#include <bits/stdc++.h> using namespace std; int main() { long long int t, i, n, ans = 0, k = 0, mx; cin >> n; long long int a[n]; for (i = 0; i < n; i++) { cin >> a[i]; } ans = a[0] / 3; k = a[0] % 3; for (i = 1; i < n; i++) { mx = min(k, a[i] / 2); ans += mx; ...
#include <bits/stdc++.h> using namespace std; void data() {} const int N = 1e6 + 100; const long long mod = 998244353; const long long mod2 = 1e9 + 7; int main() { data(); ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); long long k; cin >> k; string second; cin >> second; ...
#include <bits/stdc++.h> using namespace std; const double eps = 1e-8; const int INF = (1 << 30) - 1; long long Gcd(long long a, long long b) { while (a > 0 && b > 0) { if (a > b) a %= b; else b %= a; } return a + b; } long long x, y; int main() { cin >> x >> y;...
#include <bits/stdc++.h> using namespace std; long long read() { char ch; for (ch = getchar(); ch < 0 \|\| ch > 9 ; ch = getchar()) ; long long x = ch - 0 ; for (ch = getchar(); ch >= 0 && ch <= 9 ; ch = getchar()) x = x * 10 + ch - 0 ; return x; } const int N = 2 * 1e5 + 5...
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 10, inf = 1e9 + 10, P = 53, MOD = 1e9 + 7; vector<int> a, b; int main() { ios_base::sync_with_stdio(false); long long n, x, t = 0; long long ans = 1; cin >> n >> x; for (int i = 0; i < 42; i++) if ((1ll << i) & x) { ...
#include <bits/stdc++.h> using namespace std; const int N = 110000; const int M = 1100000; const long long mod = 1e9 + 7; const int inf = (int)1e9; const double eps = 1e-9; long long n, k, a[N]; long long f[N], inv[N], fac[N], sinv[N], g[N]; long long pw[N]; long long pow_mod(long long a, long long ...
#include <bits/stdc++.h> int main() { int ara[5001], i, n, mx = 0, j, ans[5001] = {0}, col[5001] = {0}, eq, k; scanf( %d , &n); for (i = 1; i <= n; i++) scanf( %d , &ara[i]); for (i = 1; i <= n; i++) { for (k = 1; k <= n; k++) col[k] = 0; mx = 0, eq = 0; for (j = i; j <= n; j++) { ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); int n, m; cin >> n >> m; vector<vector<int>> pr(n); vector<vector<int>> nx(n); vector<int> a(m); long long tot = 0; for (int i = 0; i < m; i++) { cin >> a[i]; a[i]--; if (i) { ...
#include <bits/stdc++.h> using namespace std; template <class X, class Y> bool minimize(X &x, const Y &y) { X eps = 1e-9; if (x > y + eps) { x = y; return true; } else return false; } template <class X, class Y> bool maximize(X &x, const Y &y) { X eps = 1e-9; if (x + ep...
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c; cin >> a >> b >> c; cout << (a - 1) * (b + c - 1) + b * c << endl; return 0; }
#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { ll t; cin >> t; while (t--) { int n, m; cin >> n >> m; int ar[n]; int su = 0; for (int i = 0; i < n; i++) { cin >> ar[i]; su += ar[i]; } int ans = min(su, m); ...
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const long long int INF = 1e12; int n, k; int memo[101][101][101]; int solve(string &str, int i, int N, int _max) { _max = max(N, _max); int &a = memo[i][N][_max]; if (a != -1) return a; if (i == n) { if (_max == k)...
#include <bits/stdc++.h> using namespace std; int type, pos, len, start[100020], dest[100020], a[100020], b[100020], q, n, seg[4 * 100020]; bool mark[4 * 100020]; void setVal(int v, int vl, int vr, int val, int l, int r) { if (l <= vl && vr <= r) { seg[v] = max(seg[v], val); mark[v] = true...
#include <bits/stdc++.h> using namespace std; int main() { int y, b, r, ans = 0; cin >> y >> b >> r; if (y + 1 <= b && y + 2 <= r) { ans = max(ans, 3 * y + 3); } if (b + 1 <= r && b - 1 <= y) { ans = max(ans, 3 * b); } if (r - 1 <= b && r - 2 <= y) { ans = max(ans, 3 * ...
#include <bits/stdc++.h> using namespace std; template <class T> inline void umin(T &a, T b) { a = min(a, b); } template <class T> inline void umax(T &a, T b) { a = max(a, b); } const int INF = 0x3f3f3f3f; long long mod = 1e9 + 7; const int N = 100005; char s[N]; struct Trie { static...
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const int idata = 2e5 + 7; int i, j, k; int judge, flag; long long step[idata]; long long temp; int n, m, t; double maxx = 0, minn = inf; long long cnt, len, sum, ans; long long high, wigh; map<long long, int> pre[2]; si...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1000005; int n; int a[MAXN]; int x[MAXN]; int y[MAXN]; int match[MAXN]; bool vis[MAXN]; int main() { ios::sync_with_stdio(0); cin >> n; if (~n & 1) { cout << First << endl; for (int i = 1; i <= n; i++) cout << i <...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, m, x, y, i, j, k, l; cin >> n >> m >> x >> y; cout << x << << y << n ; for (i = 1; i <= m; i++) if (i != y) cout << x << << i << n ; int c; for (i = 1, j = m;...
#include <bits/stdc++.h> using namespace std; set<int> s; const int MAX = 150000; int t[MAX]; int main() { int n, q, k; cin >> n >> k >> q; for (int i = 0; i < n; i++) scanf( %d , t + i); for (int i = 0; i < q; i++) { int query; scanf( %d , &query); int x; scanf( %d , &...
#include <bits/stdc++.h> using namespace std; pair<int, int> v[110]; int cur[110]; int main() { int n, w; scanf( %d %d , &n, &w); for (int i = 0; i < n; ++i) { scanf( %d , &v[i].first); v[i].second = i; } sort(v, v + n); reverse(v, v + n); for (int i = 0; i < n; ++i) { ...
//#pragma GCC optimize( Ofast ) #include <iostream> #include <vector> #include <map> #include <algorithm> #include <random> #include <chrono> #include <complex> #include <cstdio> #include <deque> #include <cmath> #include <bitset> #include <set> #include <cassert> using namespace std; ...
#include <bits/stdc++.h> using namespace std; inline void pisz(int n) { printf( %d n , n); } int dl[1000][1000]; int dr[1000][1000]; int ul[1000][1000]; int ur[1000][1000]; int g[1000][1000]; int n, m; int recdl(int i, int j) { if (i < 0 \|\| i == n \|\| j < 0 \|\| j == m) return -1001001001; if (i ...
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1.0); const double eps = 0.0000000001; const int N = 100000 + 100; int head[N]; int tot; struct node { int to, next; } edge[N << 1]; int color[N]; int vis[N]; int a[N]; int b[N]; int num[N]; void init() { memset(he...
#include <bits/stdc++.h> int main() { int n, pur, foo = 0, quz = 1, bar = 0, baz = 0; scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %d , &pur); foo += pur, bar++; if (foo * quz > bar * baz) quz = bar, baz = foo; } printf( %.6lf n , (double)baz / quz); return 0; } ...
#include <bits/stdc++.h> using namespace std; void fun() {} long long int md = 998244353; long long int __gcd(long long int a, long long int b) { if (b == 0) return a; return __gcd(b, a % b); } long long int poww(long long int a, long long int b, long long int md) { if (b < 0) return 0; if (...
#include <bits/stdc++.h> using namespace std; int N, M, T; int A[20000]; int rans; vector<int> ans; set<pair<int, int>> online; multiset<pair<int, int>> events; bool solve() { bool good = false; for (int i = 0; i < N; i++) events.insert({A[i], -1}); while (!events.empty()) { int t = ev...

#include <bits/stdc++.h> using namespace std; int main() { int n, sum = 0; string x; cin >> n; for (int i = 1; i <= n; i++) { cin >> x; if (x == ABSINTH || x == BEER || x == BRANDY || x == CHAMPAGNE || x == GIN || x == RUM || x == SAKE || x == TEQUILA || ...

#include <bits/stdc++.h> using namespace std; struct Root { int p, c; long long e, x; vector<int> v; Root(int p, long long e) : p(p), e(e) {} }; const int MAXN = 200200; bool oncirc[MAXN]; vector<pair<int, long long> > e[MAXN]; vector<Root> circ; long long ans[MAXN]; bool mark[MAXN]; ...

#include <bits/stdc++.h> using namespace std; const int N = 1000000; bool can[2]; int a[N]; int main() { ios::sync_with_stdio(false); int n, x, y, l; cin >> n >> l >> x >> y; for (int i = 0; i < n; i++) { cin >> a[i]; } set<int> q; for (int i = 0; i < n; i++) { q.insert...

#include <bits/stdc++.h> using namespace std; template <typename T> inline bool chkmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; } template <typename T> inline bool chkmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; } const int oo = 0x3f3f3f3f; const int maxn = 200000, max0 = 10000...

#include <bits/stdc++.h> using namespace std; int N, Q; vector<vector<int> > adj; vector<set<int> > grp; vector<int> dep, tin, tout; vector<vector<int> > par; int num = 0; void dfs(int now, int bf) { tin[now] = num++; if (bf != -1) par[now][0] = bf; for (int i = 1; i < 18; i++) { int t...

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

#include <bits/stdc++.h> using namespace std; int main() { int x, t, a, b, at, bt; cin >> x >> t >> a >> b >> at >> bt; int btek = b; set<int> my; my.insert(0); int ttek1 = t; while (btek > 0 && ttek1 > 0) { my.insert(btek); int atek = a; int ttek2 = t; while (ate...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); string s; int n, i, ct = 0; cin >> n >> s; s = + s; for (i = 1; i <= n - 10; i++) { if (s[i] == 8 ) ct++; } if (ct > (n - 11) / 2) cout << YES n...

#include <bits/stdc++.h> using namespace std; const int N = 100005; struct Query { int idx, k; }; int n, m; int c[N], ans[N], cnt[N], pref[N]; vector<Query> qs[N]; vector<int> adj[N]; void read() { cin >> n >> m; for (int i = 1; i <= n; i++) cin >> c[i]; for (int i = 1; i <= n - 1; i++...

#include<bits/stdc++.h> using namespace std; #define N 2005 int read(){ int w=0,f=1; char c= ; while(c< 0 ||c> 9 )f=(c== - ?-f:f),c=getchar(); while(c>= 0 &&c<= 9 )w=w*10+c- 0 ,c=getchar(); return w*f; } int T,n,ans[N],cnt; bool vis[N]; bool check(int x){ printf( ? %d %d n ,x,1); fo...

#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3f; const int MOD = (int)1e9 + 7; const int N = (int)3e5 + 7; int n, p, k, a[N]; map<int, int> cnt; inline int add(int a, int b) { return (a += b) >= p ? a - p : a; } inline int mul(int a, ...

#include <bits/stdc++.h> using namespace std; int on[10001]; int main() { std::ios::sync_with_stdio(false); cin.tie(0); int n, t, r, ans = 0; cin >> n >> t >> r; for (int i = 0; i < n; ++i) { int w; cin >> w; w += 400; int cnt = 0; for (int j = w; j > w - t; --j) ...

#include <bits/stdc++.h> using namespace std; int main() { int n, cnt = 0, i, l; cin >> n; for (i = 1; i <= n; i++) { cin >> l; if (l == 1) { cnt += 1; } } if (cnt > 0) { cout << HARD ; } else { cout << EASY ; } }

#include <bits/stdc++.h> using namespace std; int n, L, R; int a, b; int lo = -1, hi = 1e9 + 1; const int MAXN = 111111; const int INF = 1e9; vector<pair<int, int> > adj[MAXN]; int sz[MAXN], chk[MAXN]; int q[MAXN], f[MAXN], g[MAXN], d[MAXN], h[MAXN]; void dfs(int u, int p) { sz[u] = 1; for (...

#include <bits/stdc++.h> const int N = 200020; int _, n, m, x, y, flag, a[N], c[N], d[N]; std::queue<int> q; std::pair<int, int> b[N]; std::vector<int> g[N], ans; void f(int u) { if (++a[u] > g[u].size() && !c[u]) q.push(u), c[u] = 1; } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <...

#include <bits/stdc++.h> using namespace std; long long MOD = 1e9 + 7; long long add(long long a, long long b) { return (a + b) % MOD; } long long sub(long long a, long long b) { return ((a - b) % MOD + MOD) % MOD; } long long mul(long long a, long long b) { return (a * b) % MOD; } long long a[800000], tim[...

#include <bits/stdc++.h> using namespace std; long long int base = 639941; char str[1505], bad[30]; set<long long int> s; int main() { int k, n, i, j; scanf( %s , str); scanf( %s , bad); scanf( %d , &k); n = strlen(str); int ans = 0; for (i = 0; i < n; i++) { int b = 0; ...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:128000000 ) using namespace std; const int INF = 1000000000; typedef struct zap { int p; zap *left, *right, *rod; }; char s[100]; zap *top = 0, *temp = 0; int dfs(zap *t) { if (t->p == 0) { printf( int ); return 0; } ...

#include <bits/stdc++.h> using namespace std; int q, w, e, W; int a[500000], k, b, c, d, n, m, ip1, ip2, a1, b1, c1, d1, m1[500000], m2[500000], m3[500000], m4[500000]; string old[2000], nov[2000], s1, s2; int main() { cin >> q; for (int i = 1; i <= q; i++) { cin >> s1 >> s2; int ok ...

#include <bits/stdc++.h> using namespace std; const int N = 300010; int dia, n; long long a[N], ans; map<long long, int> mp; int main() { cin >> dia >> n; ans = (long long)n * (n - 1LL) * (n - 2LL) / 6LL; for (int i = 1, s, f; i <= n; ++i) { cin >> s >> f; if (!s) f += dia; f %...

#include <bits/stdc++.h> using namespace std; template <typename T, typename U> std::istream& operator>>(std::istream& i, pair<T, U>& p) { i >> p.first >> p.second; return i; } template <typename T> std::istream& operator>>(std::istream& i, vector<T>& t) { for (auto& v : t) { i >> v; }...

#include <bits/stdc++.h> using namespace std; map<string, string> m; map<string, int> used; string f(string x) { used[x] = 1; if (m[x] == x) return x; return f(m[x]); } int main() { int count = 0; vector<string> tab; int n; cin >> n; for (int i = 0; i < n; i++) { string...

#include <bits/stdc++.h> using namespace std; const int N = 2002; int n, a[N][N], c[N], p[N], t, A; string s[N]; bool C() { for (int i = 1; i <= n; i++) p[i] = c[i]; sort(p + 1, p + n + 1), t = 0; for (int i = 1; i < n; i++) { t += p[i]; if (t == i * (i - 1) / 2) return false; } ...

#include <bits/stdc++.h> using namespace std; const int maxn = 2010; int n, m, k; long long sum[maxn][maxn]; char s[maxn][maxn]; long long calc(int x, int y) { if (x <= 0 || y <= 0) return 0; long long ans = 0; int a = x % n, b = y % m; ans = (1ll * x * y - 1ll * a * b) / 2; if ((__built...

#include <bits/stdc++.h> using namespace std; int main() { long long a[100005]; int n; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; } for (int i = 0; i < n; i++) { printf( %I64d , a[i] + a[i + 1]); } }

#include <bits/stdc++.h> using namespace std; string s; int k; int main() { cin >> s; for (int i = 0; i < s.length(); i++) if (s[i] == 1 ) k++; if (k > 1) cout << (s.length() + 1) / 2 << endl; else cout << s.length() / 2 << endl; return 0; }

#include <bits/stdc++.h> using namespace std; long long read() { long long a = 0, b = getchar(), c = 1; while (!isdigit(b)) c = b == - ? -1 : 1, b = getchar(); while (isdigit(b)) a = a * 10 + b - 0 , b = getchar(); return a * c; } void print(long long x) { if (x < 0) putchar( - ), x = -x;...

#include <bits/stdc++.h> using namespace std; struct Vec { double x, y; Vec(double newX = 0, double newY = 0) { x = newX; y = newY; } Vec operator+(Vec r) { return Vec(x + r.x, y + r.y); } Vec operator-(Vec r) { return Vec(x - r.x, y - r.y); } Vec operator*(double r) { return Vec...

#include <bits/stdc++.h> using namespace std; const int Maxn = 1 << 30; int n, m, str[100100], lim[100100], up[100100], D[100100], col[100100 * 4]; long long ans; vector<int> F[100100 * 4]; vector<long long> sum2[100100 * 4], sum[100100 * 4]; bool cmp(int x, int y) { return D[x] > D[y]; } void build(int...

#include <bits/stdc++.h> int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } int main() { int la, ra, ta, lb, rb, tb; scanf( %d%d%d , &la, &ra, &ta), ++ra; scanf( %d%d%d , &lb, &rb, &tb), ++rb; int g = gcd(ta, tb); ra -= la / g * g, la %= g; rb -= lb / g * g, lb %= g; if (lb > la) lb...

#include <bits/stdc++.h> using namespace std; const int MAXN = 1E4 + 10; bool st[MAXN]; int n, k, l, f[1 << 20], dis[25][25], id[MAXN], d[MAXN], tot; vector<int> g[MAXN]; queue<int> q; inline void add(int u, int v) { g[u].push_back(v); g[v].push_back(u); } void bfs(int s) { memset(d, 0x3f,...

#include <bits/stdc++.h> using namespace std; const int Maxn = 3e5 + 5; const int inf = 1 << 29; inline int min(int a, int b) { return a < b ? a : b; } inline int max(int a, int b) { return a > b ? a : b; } inline int R() { char ch = getchar(); int x = 0; bool f = 0; for (; !isdigit(ch); ch ...

#include <bits/stdc++.h> using namespace std; void work(long long ang) { for (long long n = 3;; n++) { if (ang * n % 180 == 0) { if (ang * n / 180 <= n - 2) { printf( %I64d n , n); return; } } if (n == 998244353) break; } } int main() { int T; ...

#include <bits/stdc++.h> using namespace std; const int MOD = 998244353; string s; int n, ans; int T, A[1010], B[1010], cnt, head[2010], nxt[100010], dis[100010], id; bool w[100010]; void link(int a, int b, int c) { nxt[++id] = head[a], head[a] = id, dis[id] = b, w[id] = c; nxt[++id] = head[b], he...

#include <bits/stdc++.h> using namespace std; const long long N = 4e6 + 5; long long n, a[N], b[N], sum[N], I, lim = 1, mx = -1, Ans; long long read() { long long x = 0, f = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) f = -1; c = getchar(); } while (c >= 0 ...

#include <bits/stdc++.h> using namespace std; long long read() { long long w = 0, f = 1; char c = ; while (c < 0 || c > 9 ) c = getchar(), f = c == - ? -1 : f; while (c >= 0 && c <= 9 ) w = w * 10 + c - 48, c = getchar(); return w * f; } long long read14() { char c = getchar()...

#include <bits/stdc++.h> using namespace std; int n, apple[200000], a, b; long long tot = 0; vector<int> adj[200000]; int GCD(long long x, long long y) { if (y == 0) return x; return GCD(y, x % y); } pair<long long, long long> DFS(int ant, int act) { if (adj[act].size() == 1) return make_pair(...

#include <bits/stdc++.h> using namespace std; int main(int argc, char* argv[]) { int k, n; cin >> n >> k; int val[100000]; int awake[100000]; for (int i = 0; i < n; ++i) { cin >> val[i]; } int sum = 0; int extra = 0; int max = 0; for (int i = 0; i < n; ++i) { cin ...

#include <bits/stdc++.h> using namespace std; int main() { long long int n; cin >> n; long long int c, e = 0; long long int s = 0, a; for (long long int i = 0; i < n; i++) { cin >> a; s += a; if (a % 2 != 0) { e++; if (e == 1) c = a; else if (e...

#include <bits/stdc++.h> using namespace std; const int MAXN = int(2e5 + 5); int n, m, S; int POW[25]; int f[MAXN]; bool vis[MAXN]; bool flag[MAXN]; long long tmp, tot, Ans, t; struct edge { int u, v, id; int w, c; } e[MAXN]; struct node { int to, id; node() {} node(int T, int ...

#include <bits/stdc++.h> using namespace std; const long long N = 1e5 + 10; const long long inf = 1e14 + 10; long long n, k; long long a[N]; long long ps[N]; long long fen[N]; vector<long long> vec; void upd(long long x) { for (; x < N; x += (x & (-x))) { fen[x]++; } } long long get(...

#include <bits/stdc++.h> int cmpfunc(const void* a, const void* b) { return (*(int*)a - *(int*)b); } int main() { int t, x, i, j, c; scanf( %d , &t); while (t--) { char n[101]; int m[101]; scanf( %s , &n); x = strlen(n); j = 0; c = 0; for (i = 0; i < x; i++) { ...

#include <bits/stdc++.h> using namespace std; long long ans[100004] = {0}; vector<long long> v[100005]; int main() { long long n, m, i, j, ms = 0, sum = 0, res = 0; scanf( %lld %lld , &n, &m); for (i = 0; i < n; i++) { long long a, b; scanf( %lld %lld , &a, &b); v[a].push_back(b); ...

#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int cmx = 1e5 + 5; int n, k; char a[505][505]; int id[505][505]; int cc_sz[505 * 505]; int seen[505 * 505]; bool inside(int x, int y) { if (0 <= min(x, y) and max(x, y) < n) return true; return false; } int dx[] =...

#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; string s; cin >> s; int mark = 1; for (int i = 1; i < s.size(); i++) { if (s[i] != s[i - 1]) { mark = -1; break; } } if (mark == 1) { cout << s; for (int i = 1;...

#include <bits/stdc++.h> using namespace std; int n, s[200003], m, cnt, ans[200003]; vector<pair<int, int> > v[200003], g[200003]; bool vis[200003]; int dfs(int x) { vis[x] = 1; int ret = 0, tmp; for (int i = 0; i < v[x].size(); i++) if (!vis[v[x][i].first]) { tmp = dfs(v[x][i].first...

#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, j = 0; cin >> a >> b >> c; for (int i = 1; i <= a; i++) { if (b >= 2 * i && c >= 4 * i) j++; } cout << j + 2 * j + 4 * j; return 0; }

#include <bits/stdc++.h> using namespace std; struct Counter { static int k; Counter() { k++; } ~Counter() { k--; } }; int Counter::k = 0; template <typename T> void pr(const string& name, T t) { cout << name << = << t << endl; } template <typename T, typename... Types> void pr(con...

#include <bits/stdc++.h> using namespace std; int n, m, a[102], b[102]; int main(void) { scanf( %d %d , &n, &m); for (int i = 0; i < m; ++i) scanf( %d %d , &a[i], &b[i]); for (int x = 1; x <= n; ++x) { int c = 0; for (int i = 0; i < m; ++i) if (x >= a[i] && x <= b[i]) ++c; if...

#include <bits/stdc++.h> using namespace std; const int maxn = 100100; long double a[maxn]; int main() { int n, s; long long k, b; while (~scanf( %d , &n)) { s = 0; for (int i = 0; i < n; i++) { scanf( %I64d %I64d , &k, &b); if (k != 0) { a[s++] = -(double)(b * ...

#include <bits/stdc++.h> using namespace std; inline long long bip(long long x, long long n, long long mod) { long long res = 1; while (n) { if (n & 1) { res = (res * x) % mod; } x = (x * x) % mod; n >>= 1; } return res; } const int maxn = INT_MAX; const long lo...

#include <bits/stdc++.h> using namespace std; const int Maxn = 100000 + 19; int a[Maxn], Le[Maxn], Ri[Maxn], cnt, L, R, n, i, ans; int main() { scanf( %d , &n); for (i = 1; i <= n; i++) scanf( %d , &a[i]); Le[cnt = 1] = 1; a[++n] = a[n - 1] - 1; for (i = 1; i <= n; i++) if (a[i] <= a[i...

#include <bits/stdc++.h> using namespace std; vector<int> path[1005]; long long d[105], t[105]; int n, m, u, v; queue<int> q; void work(int now) { for (int i = 1; i <= n; i++) { d[i] = 1 << 30; t[i] = 0; } d[now] = 0; t[now] = 1; q.push(now); while (!q.empty()) { u ...

#include <bits/stdc++.h> using namespace std; long long p, q, b, n, tmp; long long gcd(int x, int y) { return y ? gcd(y, x % y) : x; } int main() { ios::sync_with_stdio(false); cin.tie(); cout.tie(); cin >> n; for (int i = 0; i < n; i++) { cin >> p >> q >> b; q = q / gcd(q, p); ...

#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; long long binpow(long long a, long long b) { if (b == 0) return 1; long long res = binpow(a, b / 2); if (b % 2) return res * res * a; else return res * res; } vector<int> adj[200006]; bool vis[200006]; bool ...

#include <bits/stdc++.h> using namespace std; signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long n, k; cin >> n >> k; string x; cin >> x; string ans = x; string y = ; long long p = n; for (long long i = 1; i < n; i++) { long long j; y = ...

#include <bits/stdc++.h> using namespace std; const int N = 1005; const int W = 1005; const long long inf = 1e18; struct dsu { vector<int> pr; vector<int> weights; vector<long long> beauties; set<int> roots; dsu(int _n) { pr.resize(_n + 5); weights.resize(_n + 5); beautie...

#include <bits/stdc++.h> using namespace std; const int maxn = 152; const int maxp = 51123987; static int A[maxn], len; static int opt[maxn][52][52][52], n, Ne[maxn][4]; char s[maxn]; static int idx[maxn * 10]; int main() { scanf( %d n , &n); for (int i = 1; i <= n; i++) { s[++len] = getch...

#include <bits/stdc++.h> using namespace std; char c[600]; vector<int> check; int n; vector<int> cal; int calculate() { int num = 0; cal.clear(); int minimum = INT_MAX; for (int i = 1; i <= n; i++) { if (c[i - 1] == ( ) { num++; minimum = min(minimum, num); cal...

#include <bits/stdc++.h> using namespace std; const long long INF = 1e18; const long long MOD = 1e9 + 7; const int N = 1e6; int T, n, r, A[1005]; void solve() { cin >> n >> r; for (int i = 1; i <= n; i++) { cin >> A[i]; } int ans = 0; int z; for (int i = 1; i <= n; i = z + r) {...

#include<iostream> #include<bits/stdc++.h> using namespace std; #define boost ios_base::sync_with_stdio(false); cin.tie(NULL) #define ll unsigned long long int #define tinput int t; cin>>t; while(t--) #define rep(i,n,s) for((i)=(s); (i)<(n); (i)++) template <typename T> T getmini(T x, T y) { return (...

#include <bits/stdc++.h> using namespace std; int primes[] = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, ...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 5; int pa[maxn], a[maxn], b[maxn]; struct Edge { int u, v, w; friend bool operator<(const Edge& a, const Edge& b) { return a.w > b.w; } } e[maxn]; void init(int n) { for (int i = 1; i <= n; i++) pa[i] = i, b[i] = 1; } int f...

#include <bits/stdc++.h> using namespace std; long long M = 1e9 + 7; long long power(long long a, long long p) { if (p == 0) return 1; long long ans = power(a, p / 2); ans = (ans * ans) % M; if (p % 2) ans = (ans * a) % M; return ans; } int nC2(int n) { return (n * (n - 1)) / 2; } int fa...

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

#include <bits/stdc++.h> using namespace std; struct rec { int l, r; }; rec f[2222][2223]; bool can[2222][2223]; int n, m, k, x, y, xx, yy; void del(int x, int y) { can[x][y] = false; for (int i = 1; i <= m; i++) { f[x][i].l = f[x][i - 1].l; if (can[x][i - 1]) f[x][i].l = i - 1; ...

#include <bits/stdc++.h> using namespace std; int a[100007], b[100007], c[100007]; int main() { ios_base::sync_with_stdio(false); int n; cin >> n; for (int i = 1; i < n + 1; i++) cin >> a[i]; for (int i = 1; i < n + 1; i++) { if (a[i] > a[i - 1]) b[i] = b[i - 1] + 1; else ...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); int t; cin >> t; while (t--) { long long n, k, d1, d2; cin >> n >> k >> d1 >> d2; if (n % 3) { cout << no n ; continue; } int flag = 0; long long x1, x2, x3; ...

#include <bits/stdc++.h> using namespace std; const int mod = 998244353; const int N = 132007; int n, a, b; int rev[N], fac[N], finv[N], f[N], g[N], h[N]; inline int qpow(int x, int k, int r = 1) { for (; k; k >>= 1, x = 1ll * x * x % mod) if (k & 1) r = 1ll * r * x % mod; return r; } inli...

#include <bits/stdc++.h> using namespace std; int n, x; vector<int> v; int main() { scanf( %d , &n); for (int i = 0; i < n; ++i) { scanf( %d , &x); int a = lower_bound(v.begin(), v.end(), x) - v.begin(); if (a == v.size()) v.push_back(x); else v[a] = x; } ...

#include <bits/stdc++.h> using namespace std; int main() { int n; int b; cin >> n >> b; int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } int mini[n]; mini[0] = a[0]; for (int i = 1; i < n; i++) { mini[i] = min(mini[i - 1], a[i]); } int maxi = b; for ...

#include <bits/stdc++.h> using namespace std; const int maxn = 5e5 + 10; int n, m, x, y, w, cnt, col[maxn], dis[maxn], vis[maxn], d[maxn], head[maxn]; struct node { int nxt, to, val; } e[maxn << 1]; void add(int x, int y, int w) { e[++cnt].to = y; e[cnt].nxt = head[x]; head[x] = cnt; e[c...

#include <bits/stdc++.h> using namespace std; long long int fpow(long long int n, long long int k, long long int p = 1000000007) { long long int r = 1; n = n % p; while (k > 0) { if (k & 1) { r = (r * n) % p; } k = k >> 1; n = (n * n) % p; } r...

#include <bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 51, MOD = 1e9 + 7; struct Matrix { int num[6][6]; Matrix() { memset(num, 0, sizeof(num)); } inline int* operator[](const int& x) { return num[x]; } inline const int* operator[](const int& x) const { return num[x]; } }; Matrix...

#include <bits/stdc++.h> using namespace std; int main() { long long int t, i, n, ans = 0, k = 0, mx; cin >> n; long long int a[n]; for (i = 0; i < n; i++) { cin >> a[i]; } ans = a[0] / 3; k = a[0] % 3; for (i = 1; i < n; i++) { mx = min(k, a[i] / 2); ans += mx; ...

#include <bits/stdc++.h> using namespace std; void data() {} const int N = 1e6 + 100; const long long mod = 998244353; const long long mod2 = 1e9 + 7; int main() { data(); ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); long long k; cin >> k; string second; cin >> second; ...

#include <bits/stdc++.h> using namespace std; const double eps = 1e-8; const int INF = (1 << 30) - 1; long long Gcd(long long a, long long b) { while (a > 0 && b > 0) { if (a > b) a %= b; else b %= a; } return a + b; } long long x, y; int main() { cin >> x >> y;...

#include <bits/stdc++.h> using namespace std; long long read() { char ch; for (ch = getchar(); ch < 0 || ch > 9 ; ch = getchar()) ; long long x = ch - 0 ; for (ch = getchar(); ch >= 0 && ch <= 9 ; ch = getchar()) x = x * 10 + ch - 0 ; return x; } const int N = 2 * 1e5 + 5...

#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 10, inf = 1e9 + 10, P = 53, MOD = 1e9 + 7; vector<int> a, b; int main() { ios_base::sync_with_stdio(false); long long n, x, t = 0; long long ans = 1; cin >> n >> x; for (int i = 0; i < 42; i++) if ((1ll << i) & x) { ...

#include <bits/stdc++.h> using namespace std; const int N = 110000; const int M = 1100000; const long long mod = 1e9 + 7; const int inf = (int)1e9; const double eps = 1e-9; long long n, k, a[N]; long long f[N], inv[N], fac[N], sinv[N], g[N]; long long pw[N]; long long pow_mod(long long a, long long ...

#include <bits/stdc++.h> int main() { int ara[5001], i, n, mx = 0, j, ans[5001] = {0}, col[5001] = {0}, eq, k; scanf( %d , &n); for (i = 1; i <= n; i++) scanf( %d , &ara[i]); for (i = 1; i <= n; i++) { for (k = 1; k <= n; k++) col[k] = 0; mx = 0, eq = 0; for (j = i; j <= n; j++) { ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); int n, m; cin >> n >> m; vector<vector<int>> pr(n); vector<vector<int>> nx(n); vector<int> a(m); long long tot = 0; for (int i = 0; i < m; i++) { cin >> a[i]; a[i]--; if (i) { ...

#include <bits/stdc++.h> using namespace std; template <class X, class Y> bool minimize(X &x, const Y &y) { X eps = 1e-9; if (x > y + eps) { x = y; return true; } else return false; } template <class X, class Y> bool maximize(X &x, const Y &y) { X eps = 1e-9; if (x + ep...

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

#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { ll t; cin >> t; while (t--) { int n, m; cin >> n >> m; int ar[n]; int su = 0; for (int i = 0; i < n; i++) { cin >> ar[i]; su += ar[i]; } int ans = min(su, m); ...

#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const long long int INF = 1e12; int n, k; int memo[101][101][101]; int solve(string &str, int i, int N, int _max) { _max = max(N, _max); int &a = memo[i][N][_max]; if (a != -1) return a; if (i == n) { if (_max == k)...

#include <bits/stdc++.h> using namespace std; int type, pos, len, start[100020], dest[100020], a[100020], b[100020], q, n, seg[4 * 100020]; bool mark[4 * 100020]; void setVal(int v, int vl, int vr, int val, int l, int r) { if (l <= vl && vr <= r) { seg[v] = max(seg[v], val); mark[v] = true...

#include <bits/stdc++.h> using namespace std; int main() { int y, b, r, ans = 0; cin >> y >> b >> r; if (y + 1 <= b && y + 2 <= r) { ans = max(ans, 3 * y + 3); } if (b + 1 <= r && b - 1 <= y) { ans = max(ans, 3 * b); } if (r - 1 <= b && r - 2 <= y) { ans = max(ans, 3 * ...

#include <bits/stdc++.h> using namespace std; template <class T> inline void umin(T &a, T b) { a = min(a, b); } template <class T> inline void umax(T &a, T b) { a = max(a, b); } const int INF = 0x3f3f3f3f; long long mod = 1e9 + 7; const int N = 100005; char s[N]; struct Trie { static...

#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const int idata = 2e5 + 7; int i, j, k; int judge, flag; long long step[idata]; long long temp; int n, m, t; double maxx = 0, minn = inf; long long cnt, len, sum, ans; long long high, wigh; map<long long, int> pre[2]; si...

#include <bits/stdc++.h> using namespace std; const int MAXN = 1000005; int n; int a[MAXN]; int x[MAXN]; int y[MAXN]; int match[MAXN]; bool vis[MAXN]; int main() { ios::sync_with_stdio(0); cin >> n; if (~n & 1) { cout << First << endl; for (int i = 1; i <= n; i++) cout << i <...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, m, x, y, i, j, k, l; cin >> n >> m >> x >> y; cout << x << << y << n ; for (i = 1; i <= m; i++) if (i != y) cout << x << << i << n ; int c; for (i = 1, j = m;...

#include <bits/stdc++.h> using namespace std; set<int> s; const int MAX = 150000; int t[MAX]; int main() { int n, q, k; cin >> n >> k >> q; for (int i = 0; i < n; i++) scanf( %d , t + i); for (int i = 0; i < q; i++) { int query; scanf( %d , &query); int x; scanf( %d , &...

#include <bits/stdc++.h> using namespace std; pair<int, int> v[110]; int cur[110]; int main() { int n, w; scanf( %d %d , &n, &w); for (int i = 0; i < n; ++i) { scanf( %d , &v[i].first); v[i].second = i; } sort(v, v + n); reverse(v, v + n); for (int i = 0; i < n; ++i) { ...

//#pragma GCC optimize( Ofast ) #include <iostream> #include <vector> #include <map> #include <algorithm> #include <random> #include <chrono> #include <complex> #include <cstdio> #include <deque> #include <cmath> #include <bitset> #include <set> #include <cassert> using namespace std; ...

#include <bits/stdc++.h> using namespace std; inline void pisz(int n) { printf( %d n , n); } int dl[1000][1000]; int dr[1000][1000]; int ul[1000][1000]; int ur[1000][1000]; int g[1000][1000]; int n, m; int recdl(int i, int j) { if (i < 0 || i == n || j < 0 || j == m) return -1001001001; if (i ...

#include <bits/stdc++.h> using namespace std; const double PI = acos(-1.0); const double eps = 0.0000000001; const int N = 100000 + 100; int head[N]; int tot; struct node { int to, next; } edge[N << 1]; int color[N]; int vis[N]; int a[N]; int b[N]; int num[N]; void init() { memset(he...

#include <bits/stdc++.h> int main() { int n, pur, foo = 0, quz = 1, bar = 0, baz = 0; scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %d , &pur); foo += pur, bar++; if (foo * quz > bar * baz) quz = bar, baz = foo; } printf( %.6lf n , (double)baz / quz); return 0; } ...

#include <bits/stdc++.h> using namespace std; void fun() {} long long int md = 998244353; long long int __gcd(long long int a, long long int b) { if (b == 0) return a; return __gcd(b, a % b); } long long int poww(long long int a, long long int b, long long int md) { if (b < 0) return 0; if (...

#include <bits/stdc++.h> using namespace std; int N, M, T; int A[20000]; int rans; vector<int> ans; set<pair<int, int>> online; multiset<pair<int, int>> events; bool solve() { bool good = false; for (int i = 0; i < N; i++) events.insert({A[i], -1}); while (!events.empty()) { int t = ev...