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; void prepare() {} const int maxn = 100005; int n; int a[maxn], b[maxn]; vector<int> res; int q[maxn]; void go(int x) { int l = 0, r = 0; long long cur = a[0]; while (true) { cur -= b[r]; (++r) %= n; while (cur < 0) { ((-...
#include <bits/stdc++.h> using namespace std; const double pi = acos(-1.0); const int imax = 2147483647; const int imin = -2147483647; const long long lmax = 9223372036854775807; const long long lmin = -9223372036854775807; long long power(long long a, long long b, long long m) { long long p = 1; ...
#include <bits/stdc++.h> using namespace std; int socks, day; int main() { cin.sync_with_stdio(0); cin >> socks >> day; int i = 0; while (socks) { i++; if (!(i % day)) socks++; socks--; } cout << i; }
#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { return a == 0 ? b : gcd(b % a, a); } void solve(int test) { int n, k; cin >> n >> k; vector<pair<pair<int, int>, int>> v(n); int i, j, l; for (i = (0); i < (n); ++i) cin >> v[i].first.first >> v[i].first.second; for (i =...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 50, M = 55; int B, bl[N]; vector<int> bcc[N]; inline void update(int &a, int b) { a = max(a, b); } int n, m, d; int dp[N * M]; char op[N][M]; vector<int> G[N], G2[N], G3[N]; void add(int u, int v, vector<int> G[]) { G[u].push_back(v);...
#include <bits/stdc++.h> using namespace std; long long int power(long long int x, unsigned long long int y) { long long int res = 1; while (y > 0) { if (y & 1) { res = res * x; } y = y >> 1; x = x * x; } return res; } long long int powermod(long long int x, unsig...
#include <bits/stdc++.h> int B = 400; using namespace std; const long long inf = 1e8; int MOD = 1e9 + 7; const int mxn = 300010; const int N = 1000005; const double pi = 3.14159; int dx[] = {0, 1, 0, -1, 1, -1, 1, -1}; int dy[] = {1, 0, -1, 0, -1, 1, 1, -1}; int n, d, k; vector<int> g[mxn]; vect...
#include <bits/stdc++.h> using namespace std; int main() { int t; t = 1; for (int r = 0; r < t; r++) { long long n, m, i, x, y, z, sum = 0; cin >> n >> m; vector<string> v(51); char a = a , b = A ; for (i = 0; i <= 50; i++) { if (b > Z ) b = A ; v[i].pus...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); int i, j, k; int n, m, idx; string s, s2; cin >> s; n = s.length(); int cnt = 0; for (i = 0; i < n; i++) { if (s[i] == a ) cnt++; } k = 0; id...
#include <bits/stdc++.h> using namespace std; int p1[400010], p2[400010], p3[400010], p0[400010]; int cnt1, cnt2, cnt3, cnt0; inline bool cmp(const int a, const int b) { return a > b; } int main() { int n; cin >> n; for (int i = 1, a, b, va; i <= n; i++) { scanf( %1d%1d %d , &a, &b, &va); ...
#include <bits/stdc++.h> using namespace std; int main() { int a, y, flag = 0, count, z, x; cin >> y; if (y % 400 == 0 \|\| y % 4 == 0 && y % 100 != 0) { x = 1; } else { x = 2; } z = y + 1; if (x == 1) count = 3; else count = 2; while (flag != 1) { if ...
#include <bits/stdc++.h> using namespace std; int n = 0, m = 0, k; vector<string> a; int CountSpiders(int j) { int sum = 0; int jR = j, jL = j; for (int i = 1; i < n; ++i) { if (!(i % 2) && a[i][j] == U ) ++sum; if (jR > 0) { --jR; if (a[i][jR] == R ) ++sum; } ...
#include <bits/stdc++.h> using namespace std; int xx1, xx2, yy1, yy2; int x, y, r, ans; char v[30000000]; int zhuan(int x, int y) { return (x + 1000) * 10000 + y + 1000; } void swap(int &a, int &b) { int h = a; a = b; b = h; } bool dis(int xx, int yy) { return (xx - x) * (xx - x) + (yy -...
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int n = s.length(); int ans = 0; int num = 0; for (int i = 0; i < n; i++) { if ((s[i] - 0 ) % 3 == 0) { ans++; num = 0; } else { num++; if (num == 2) { if ((s...
#include <bits/stdc++.h> using namespace std; long long t, n, i, b[1010], ta, tb, k1, a[1010], tem, x[1010], y[1010], k2, tom; vector<long long> v[1010]; void dfs(long long aa, long long bb) { b[aa] = bb; long long ii; for (ii = 0; ii < v[aa].size(); ii++) if (!b[v[aa][ii]]) dfs(v[aa][ii], bb)...
#include <bits/stdc++.h> using namespace std; int main() { string s = qwertyuiopasdfghjkl;zxcvbnm,./ ; char lr; cin >> lr; string message; cin >> message; for (int i = 0; i < message.length(); i++) { int it = s.find(message[i]); if (lr == R ) { cout << s[it - 1]; ...
#include <bits/stdc++.h> using namespace std; const long long mod = 1e6 + 3; long long n, k, x; pair<long long, long long> ans; long long powmod(long long a, long long b, long long c) { long long ans = 1; while (b > 0) { if (b & 1) ans = ans * a % c; a = a * a % c; b /= 2; } ...
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 40; const long long INFLL = 1e18; long long dp[N][3][2][2]; signed main() { srand(time(NULL)); ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; long long r1, r2, r3, d; cin >> n >> r1 >> r2 >> r3 >> ...
#include <bits/stdc++.h> using namespace std; typedef pair<int, int> pii; template <typename T> inline void read(T &x) { int ch = getchar(); x = 0; bool f = false; double d = 1; for (; ch != - && (ch < 0 \|\| ch > 9 ); ch = getchar()) ; if (ch == - ) { f = true; ch ...
#include <bits/stdc++.h> using namespace std; char s[110], ss[110]; int a[210], ans[210], n, k, namlen; bool boo; bool check() { int i, j; for (i = 1; i <= n; i++) if (ss[i] == 0 ) { bool bk = true; for (j = 1; j <= namlen; j++) if (a[i + j - 1] != s[j]) { ...
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; string a; cin >> a; string res = ; int kolvo = k / 2; int i = 0; int s = 0; int bla = 0; while (i < kolvo) { res += a[s]; if (a[s] == ( ) { ++i; } else { +...
#include <bits/stdc++.h> using namespace std; const long long N = 2e5 + 5, M = 1e18 + 5, OO = 0x3f3f3f3f; const double pi = 3.141592653589793238462643383279502884; double n, r; double calc() { double ang = 180 / n; ang = (ang / 180) * pi; double a = (sin(ang / 2) * r) / sin(pi - (1.5 * ang)); ...
#include <bits/stdc++.h> using namespace std; const int N = 3228; const int MOD = 1000 * 1000 * 1000 + 7; long long pw(long long a, int first) { if (!first) return 1; if (first % 2) return a * pw(a * a, first / 2); return pw(a * a, first / 2); } void solve() { int pl[3] = {0}; int n, p1,...
#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; const int N = 300005; const double PI = 4 * atan(1); const long long MAX = 9223372036854775807; int dx[] = {1, -1, 0, 0, 1, -1, 1, -1}; int dy[] = {0, 0, 1, -1, 1, 1, -1, -1}; long long gcd(long long a, long long b) { return (b ==...
#include <bits/stdc++.h> using namespace std; inline int read() { int res = 0, f = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) f = -f; ch = getchar(); } while (isdigit(ch)) { res = (res << 3) + (res << 1) + ch - 0 ; ch = getchar(); } return res ...
#include <bits/stdc++.h> using namespace std; int max(int a, int b) { if (a > b) return a; else return b; } long long min(long long a, long long b) { if (a < b) return a; else return b; } int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); } int lcm(int a, in...
#include <bits/stdc++.h> using namespace std; template <class T> T abs(T x) { return x < 0 ? -x : x; } const double pi = asin(1.0) * 2; int n; int m; long long pl, pr, vl, vr; int k; vector<long long> h; double prob(long long l, long long r, long long L, long long R) { L = max(l, L); R...
#include <bits/stdc++.h> using namespace std; long long calc2(long long a, long long b, long long c, long long ab, long long ac, long long bc, long long abc) { long long parts[] = {a - ab - ac + abc, b - ab - bc + abc, c - ac - bc + abc, ...
#include <bits/stdc++.h> using namespace std; double p, f[220][220]; int x, k; int main() { scanf( %d%d%lf , &x, &k, &p); p /= 100; for (int i = 0; i <= k; i++) for (int j = x + i; j % 2 == 0; j /= 2) f[0][i]++; for (int i = 0; i < k; i++) { for (int j = 0; j <= k; j++) { if ...
#include <bits/stdc++.h> using namespace std; void inout() { ios_base::sync_with_stdio(false); cin.tie(NULL); ; } int main() { inout(); long long n, i, u, v; cin >> n; map<long long, long long> prv, nxt, cnt1, cnt2; vector<long long> ans(n + 5); for (i = 0; i < n; i++) { ...
#include <bits/stdc++.h> using namespace std; const int N = 105000; const int M = 105; int n, m, p; long long hill[N]; long long a[N], s[N]; long long dp[N]; int top, tail; long long duix[N], duiy[N]; int getint() { char e = getchar(); int res = 0; while (e < 0 \|\| e > 9 ) e = getchar(...
#include <bits/stdc++.h> using namespace std; int n, h; int main() { scanf( %d %d , &n, &h); for (int i = 1; i < n; i++) { printf( %.10lf n , sqrt(1. * h * h * i / n)); } }
#include <bits/stdc++.h> using namespace std; void sprint(int x) { cout << x; } void sprint(long x) { cout << x; } void sprint(long long x) { cout << x; } void sprint(unsigned x) { cout << x; } void sprint(unsigned long x) { cout << x; } void sprint(unsigned long long x) { cout << x; } void sprint(float...
#include <bits/stdc++.h> using namespace std; int l[100005], r[100005]; int main(int argc, char* argv[]) { std::ios::sync_with_stdio(false); int n, k; scanf( %d%d , &n, &k); int sum = 0; for (int i = 0; i < n; i++) { scanf( %d%d , &l[i], &r[i]); sum += r[i] - l[i] + 1; } in...
#include <bits/stdc++.h> using namespace std; template <class T> inline T bigmod(T p, T e, T M) { long long ret = 1; for (; e > 0; e >>= 1) { if (e & 1) ret = (ret * p) % M; p = (p * p) % M; } return (T)ret; } template <class T> inline T gcd(T a, T b) { if (b == 0) return a; ...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:64000000 ) using namespace std; const int MAXN = -1; const int MOD = 1; const long double EPS = 1e-11; long double sqr(long double x) { return x * x; } bool ok(long double x) { return x >= -EPS && x <= 1 + EPS; } void norm(long double &x) { if...
#include <bits/stdc++.h> using namespace std; const int maxn = 65; char g[maxn][maxn]; int r, c, row[maxn], col[maxn]; void solve() { memset(row, 0, sizeof row); memset(col, 0, sizeof col); int sum = 0; for (int i = 1; i <= r; i++) { for (int j = 1; j <= c; j++) { if (g[i][j] == ...
#include <bits/stdc++.h> using namespace std; int n, a[300005], pre[300005], L[300005], R[300005]; int st[300005][19], f[300005], ans; int Max(int l, int r) { int s = f[r - l]; return a[st[l][s]] > a[st[r - (1 << s)][s]] ? st[l][s] : st[r - (1 << s)][s]; } void solve(int l, int r) { if (l > r) r...
#include <bits/stdc++.h> using namespace std; const int c[4][2] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}}; char a[60][60], color[2510]; int to[60][60], minx[2510], maxx[2510], miny[2510], maxy[2510], f[2510][4][2]; void dfs(int x0, int y0, int value) { to[x0][y0] = value; minx[value] = min(minx[value], x0)...
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1.0); const unsigned long long MAX = LONG_MAX; void fasterIO() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); } int sumDig(int a) { int sum = 0; while (a != 0) { sum += a % 10; a /= 10; } retur...
#include <bits/stdc++.h> using namespace std; long long a[18] = {0}; long long int get(long long int n, int l) { if (!n) return 0; if (l == 1) return n; long long int t = a[l]; if (n == t) return l; if (n < t) return min(get(n, l - 1), l + get(t - n, l - 1)); else return min((n...
#include <bits/stdc++.h> using namespace std; int t, n, p, c; int main() { scanf( %d , &t); while (t--) { scanf( %d%d , &n, &p), c = 2 * n + p; for (int i = 1; i <= n; ++i) for (int j = i + 1; j <= n; ++j) if (c) printf( %d %d n , i, j), --c; } return 0; }
#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > g[500100]; long long f[500100][2]; int n, k; void dfs(int u, int fa) { vector<long long> d; d.clear(); f[u][0] = f[u][1] = 0; for (int i = 0; i < g[u].size(); i++) { int v = g[u][i].first, w = g[u][i].second; if ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 10; int a[MAXN], b[MAXN], f[260], n, k; int main(void) { ios::sync_with_stdio(false); cin >> n >> k; for (int i = 1; i <= n; ++i) { cin >> a[i]; b[i] = a[i]; } memset(f, -1, sizeof f); for (int i = 1; i <= n...
#include <bits/stdc++.h> using namespace std; char s[100005]; int n, a[100005], ans[100005]; inline bool find() { int i = 1, j = n; while (i <= j) { if (a[i] == a[j]) { i++; j--; } else if (a[i] == a[j] + 10) { a[j - 1]--; a[j] += 10; } else if ((a[i] ==...
#include <bits/stdc++.h> using namespace std; int ben[11]; int n, k; int mem[505][505 * 11]; int arr[505 * 505]; int freqFav[100005]; int freqCards[100005]; int solve(int num, int rem) { if (rem == 0 \|\| num == 0) return 0; int &ret = mem[num][rem]; if (~ret) return ret; for (int i = 0; i...
#include <bits/stdc++.h> using namespace std; const int sz = 4e6 + 50; int n, m; string str; int s[sz], e[sz], four[sz], seven[sz], non_dec[sz], non_inc[sz]; vector<bool> lazy(sz, 0); void calculate(int node) { int lc = node * 2; int rc = lc + 1; int f1 = four[lc], s1 = seven[lc], nd1 = non_de...
#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int rnd(int l, int r) { return l + rng() % (r - l + 1); } const int N = 200010; int n; long long ret; int a[N], lz[N], b[N]; int f[N][25]; int que(int i, int j) { int t = lz[j - i + 1...
#include <bits/stdc++.h> using namespace std; int arr[3010][3010], height[3010][3010]; deque<pair<int, int> > mdq; void push(int val, int pos) { while (!mdq.empty() && mdq.back().first > val) mdq.pop_back(); mdq.push_back(make_pair(val, pos)); } int front(int lim) { while (!mdq.empty() && mdq.fr...
#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0, f = 1; char ch = getchar(); while (ch < 0 \|\| ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * f;...
#include <bits/stdc++.h> using namespace std; template <class T> inline void read(T& num) { bool start = false, neg = false; char c; num = 0; while ((c = getchar()) != EOF) { if (c == - ) start = neg = true; else if (c >= 0 && c <= 9 ) { start = true; num = ...
#include <bits/stdc++.h> using namespace std; int a[1000000 + 5]; int b[1000000 + 5]; int main() { ios_base::sync_with_stdio(false); int i, j, n, k; queue<pair<int, int> > q; cin >> n; for (i = 1; i <= n; i++) cin >> a[i]; for (i = 1; i <= n; i++) cin >> b[i]; for (i = 1; i <= n; i++...
#include <bits/stdc++.h> using namespace std; const int bignumlen = 2200; const int Blen = 8; const long long base = 100000000; struct bignum { int len; long long data[bignumlen]; long long &operator[](int x) { return (data[x]); } const long long &operator[](int x) const { return (data[x]); } ...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10, MSQ = 1010, SQ = 10, inf = 2e9; pair<pair<int, int>, int> p[maxn]; map<int, vector<int> > mp; vector<int> vec, vec2; int n, k, sm[maxn], l[maxn], r[maxn]; long long ans; void add(int ind, int val) { while (ind < maxn) { s...
#include <bits/stdc++.h> using namespace std; int main() { long long t; cin >> t; while (t--) { long long x, y, p, q; cin >> x >> y >> p >> q; if (p == q && x == y) { printf( 0 n ); continue; } if (p == 0 && x == 0) { printf( 0 n ); continue;...
#include <bits/stdc++.h> using namespace std; const double sq = 1.73205080757; int main() { long long k, k1; cin >> k; k1 = k * 2; k = 2; k1 -= k1 % 3; k1++; if (k1 > k) k1 -= 3; long long h = 1, h1, an = 0; while (k1 > 0) { while (k1 k1 + 3LL * h * h <= k * k && ...
#include <bits/stdc++.h> using namespace std; void fast() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } int main() { fast(); long long int t = 1; while (t--) { long long int n, m; cin >> n >> m; long long int a[n][m], b[n][m]; for (int i = 0...
#include <bits/stdc++.h> using namespace std; const double pi = acos(-1.0); const int inf = 0x3f3f3f3f; const double eps = 1e-10; const long long INF = (1LL << 60); int main() { int a, b; scanf( %d%d , &a, &b); if (a == b) { printf( %d n , a); return 0; } double ans = -1; ...
#include <bits/stdc++.h> using namespace std; int a[100000 + 10]; int main() { int n; cin >> n; for (int i = 1; i <= n; i++) { long long k; cin >> k; for (int i = 1; i <= k; i++) cin >> a[i]; sort(a + 1, a + k + 1); int ans = 1; for (int i = 1; i < k; i++) { ...
#include <bits/stdc++.h> using namespace std; int main(int argc, char const *argv[]) { ios::sync_with_stdio(false); long long n, m, k; cin >> n >> m >> k; long long x, s; cin >> x >> s; pair<long long, long long> a[m]; for (int i = 0; i < m; i++) cin >> a[i].second; for (int i = 0; i...
#include <bits/stdc++.h> const int MAXN = 2e5 + 10; using namespace std; int T, N, cmp; int p[MAXN], c[MAXN]; vector<int> comp[MAXN]; bool vis[MAXN]; void dfs(int x) { vis[x] = true; comp[cmp].push_back(c[x]); if (!vis[p[x]]) dfs(p[x]); } int min_ans(int idx_comp) { int n_comp = (int)(...
#include <bits/stdc++.h> using namespace std; bool st[1000000]; int main() { int N, K; cin >> N >> K; for (int i = 0; i < 1000000; i++) st[i] = false; int cnt = 0; for (int i = 0; i < N; i++) { int te1, te2; cin >> te1 >> te2; te1 += 100000, te2 += 100000; for (int j = ...
#include <bits/stdc++.h> using namespace std; const int maxint = -1u >> 1; template <class T> bool get_max(T& a, const T& b) { return b > a ? a = b, 1 : 0; } template <class T> bool get_min(T& a, const T& b) { return b < a ? a = b, 1 : 0; } int main() { int f[21]; int a, b, c; cin ...
#include <bits/stdc++.h> using namespace std; struct edge { int u; int v; long long cost; edge() {} edge(int u, int v, long long c) : u(u), v(v), cost(c) {} }; long long comb2(long long n) { return (n * (n - 1)) / 2; } const int MAXN = 100100; int n; vector<int> G[MAXN]; edge es[MAXN...
#include <bits/stdc++.h> const int N = 5e5, mo = 1e6 + 3; int n, m, i, j, ans; bool h[N][2], l[N][2]; char s[N]; int main() { scanf( %d%d , &n, &m); ans = 1; for (i = 0; i < n; i++) for (scanf( %s , s), j = 0; j < m; j++) if (s[j] != . ) { int x = s[j] - 48; h[i]...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int t = n % 4; int a = 0; for (int i = 0; i < 4; i++) { if ((i * 7) % 4 == t) a = i; } int b = -1, c; for (int j = (n - a) / 4 * 4 + a; j >= a; j -= 4) { if ((n - 7 * j) % 4 == 0 && (n - 7 * j >= ...
#include <bits/stdc++.h> using namespace std; class Solution { public: void solve(vector<pair<int, int>>& edges, vector<int>& xs, vector<int>& ys, int n) { vector<vector<int>> graph(n + 1); for (auto& p : edges) { int u = p.first, v = p.second; graph[u].push_back(v)...
#include <bits/stdc++.h> using namespace std; const int MOD = 1000 * 1000 * 1000 + 9; const int MAX_N = 1000 * 1000 + 10; long long dp1[MAX_N]; int main() { int n; scanf( %d , &n); n /= 2; if (n == 1) { printf( %d n , 10); return 0; } dp1[1] = 5; for (int i = 2; i <= n ...
#include <bits/stdc++.h> int a[100100]; int f[100100][3]; int s[100100]; char tmp[100100]; int n; void maximize(int &x, const int &y) { if (x < y) x = y; } void swap(int &a, int &b) { int sw; sw = a; a = b; b = sw; } void init(void) { scanf( %d , &n); int i; for (i = ...
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; const long long INF = 1e9 + 9; const long long N = 500500; char s[4][4]; long long dot, cross, nought, first_wins, second_wins; long long first_win_rows, first_win_col, second_win_row, second_win_col; long long total; signed ...
#include <bits/stdc++.h> using namespace std; int n; int mx = 0, sum = 0; int main() { cin >> n; for (int i = 1; i <= n; ++i) { int a; cin >> a; mx = max(mx, a); sum += a; } sum *= 2; sum += n; sum /= n; cout << max(sum, mx) << endl; return 0; }
/* Author : Prakhar Rai */ #include<bits/stdc++.h> #define ll long long #define ld long double #define LB(x,num) lower_bound(x.begin(),x.end(),num) - x.begin() #define UB(x,num) upper_bound(x.begin(),x.end(),num) - x.begin() #define BS(x,num) binary_search(x.begin(),x.end(),num) #define pb push_back...
#include <bits/stdc++.h> using namespace std; int play(int n) { int x = 1; for (;;) { if (x * 2 > n) break; else x = 2; } return x / 2; } int main() { int n, b, p, k, x = 1, btl = 0, twl = 0; scanf( %d %d %d , &n, &b, &p); twl = n p; while (1) { ...
#include <bits/stdc++.h> using namespace std; int main() { int h, w; cin >> h >> w; string line; char table[h + 2][w + 2]; memset(table, 0 , sizeof table); for (int i = 1; i <= h; i++) { cin >> line; line = + line; for (int j = 1; j <= w; j++) { table[i][j] = l...
#include <bits/stdc++.h> using namespace std; template <typename _T, typename _T2> string to_string(pair<_T, _T2> x) { return < + to_string(x.first) + , + to_string(x.second) + > ; } template <typename _T> string to_string(vector<_T> vec) { string s = [ ; for (auto el : vec) s += to_stri...
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; long long s[100005]{0}; pair<long long, long long> p[100005]; for (int i = 0; i < m; i++) { int u, v; long long d; cin >> u >> v >> d; u--; v--; s[u] -= d; s[v] += d; ...
#include <bits/stdc++.h> using namespace std; inline void read(int &res) { register char ch = getchar(); res = 0; register int g = 1; while (!isdigit(ch)) { if (ch == - ) g = -1; ch = getchar(); } while (isdigit(ch)) { res = (res << 3) + (res << 1) + (ch ^ 48); ch = ...
#include <bits/stdc++.h> using namespace std; int n, i; long long r, c = 1000000000000000000LL; void solve(int n, long long x) { for (int i = 1; i * i <= n; i++) if (!(n % i)) { r = max(r, (i + 2LL) * (n / i + 2LL) * x); c = min(c, (i + 2LL) * (n / i + 2LL) * x); } } int main...
#include <bits/stdc++.h> using namespace std; int main() { long long i, t, n, m, c, d, a[100005]; cin >> n >> m; if (n == 1 && m == 0) { cout << 10000000; return 0; } if (m < n / 2 \|\| n < 2) { cout << -1; return 0; } c = 1000000000LL; for (int i = n - 1; i > 1...
#include <bits/stdc++.h> using namespace std; map<string, string> p; int ans = 0; string tmp = abcdef ; void doit(int n, string s) { if (n == 0) { int f = 0; while (true) { if (s.length() == 2) { if (p.find(s) == p.end()) { f = 1; break; } ...
#include <bits/stdc++.h> using namespace std; unsigned long long const Mod = 1000000007; unsigned long long sq_sum(unsigned long long n) { unsigned long long ret = n; ret = (n * (n + 1)); ret /= 2; if (ret % 3 == 0) { return ((ret / 3) % Mod * (2 * n + 1)) % Mod; } else { return ((...
#include <bits/stdc++.h> using namespace std; long long segs[] = {6, 2, 5, 5, 4, 5, 6, 3, 7, 6}; int n, m, k; long long a[200005]; vector<pair<int, int> > q; int res[200005]; int main() { cin >> n >> m; for (int i = 0; i < n; i++) { cin >> a[i]; } for (int i = 0; i < m; i++) { ...
#include <bits/stdc++.h> using namespace std; long long a, b, c; long long exgcd(long long a, long long b, long long& x, long long& y) { if (b == 0) { x = 1; y = 0; return a; } long long d = exgcd(b, a % b, x, y); long long z = x; x = y; y = z - y * (a / b); return d;...
#include <bits/stdc++.h> using namespace std; long long t, cn, n, nr, p10; int main() { cin >> t; while (t--) { cin >> n; cn = n; nr = 0; p10 = 1; while (cn) { if (cn % 10) nr++; cn /= 10; } cout << nr << n ; while (n) { if (n % 10)...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n, amazing = 0, maxx, minn, k; cin >> n; cin >> k; maxx = k; minn = k; for (int i = 1; i < n; i++) { cin >> k; if (k > maxx) { maxx = k; amazing++;...
#include <bits/stdc++.h> using namespace std; const int INF = INT_MAX; const int N = 2 * 1e3 + 10; const long double eps = 1e-9; const int mod = 998244353; char a[N][N]; int d[N][N], v[N][N], n, m; bool used[N][N]; void nxt(char c, int &x, int &y) { if (c == U ) --x; else if (c == D ) ...
#include <bits/stdc++.h> using namespace std; long long a[300005]; string s, p; vector<long long> v; int main() { ios_base::sync_with_stdio(false); long long i, j, k, l, m, x, y, r, n, t; cin >> n >> m; for (i = 1; i <= n; i++) { cin >> x; if (x < 300005) a[x] = 1; } long l...
#include <bits/stdc++.h> using namespace std; int main() { long long m = 100000, n = 0, a[1005], b[1005], u, i, j, k = 0, c, d, s = 0, r = 0; char str1[1005], str2[1005]; cin >> c >> d; scanf( %s , str1); scanf( %s , str2); for (i = 0, j = 0;; i++, j++) { if (str1[i] != s...
#include <bits/stdc++.h> int ab(int x) { if (x < 0) { x = x * -1; } return x; } int main() { int x, y, z, x1, x2, y1, y2; scanf( %d %d , &x, &y); z = ab(x) + ab(y); if (x < 0) { x1 = -1 * z; x2 = 0; if (y < 0) { y1 = 0; y2 = -1 * z; } else ...
#include <bits/stdc++.h> using namespace std; char a[310][310]; int main() { int n, m, k; cin >> n >> m >> k; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> a[i][j]; } } int t = min(m, n); for (int d = 1; d < t; d++) { for (int i = d; i < n - d...
#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0; char ch = getchar(); while (!isdigit(ch)) ch = getchar(); while (isdigit(ch)) x = x * 10 + ch - 0 , ch = getchar(); return x; } const int maxn = 100005; int n; long long zero = 0, one = 0, z1 = 0, o1 = 0; cha...
#include <bits/stdc++.h> using namespace std; int dx[] = {0, 0, 1, -1, -1, -1, 1, 1}; int dy[] = {1, -1, 0, 0, -1, 1, 1, -1}; char ch[] = { N , S , E , W }; template <class T> inline T biton(T n, T pos) { return n \| ((T)1 << pos); } template <class T> inline T bitoff(T n, T pos) { return n ...
#include <bits/stdc++.h> using namespace std; const long long N = 105; vector<long long> a, b, v; string s; long long n, m, x; long long killAll() { vector<long long> hlp; long long i = 0; for (long long x : b) { while (i < v.size() and v[i] <= x) { hlp.push_back(v[i]); i++...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; int a[n]; for (int i = 0; i < n; ++i) { cin >> a[i]; } for (int i = n - 1; i >= 0; --i) { int temp = i % 2 != 0 ? -a[i] : a[i]; cout << t...
#include <bits/stdc++.h> using namespace std; template <class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } template <class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long n; ...
#include <bits/stdc++.h> using namespace std; const int maxn = (int)1e5 + 100; const int mod = (int)1e9 + 7; int n, k, a[maxn], c[maxn]; bool was[maxn]; vector<int> g[maxn]; bool check(int pos) { memset(was, 0, sizeof(was)); int used = 0, unused = pos; for (int i = pos; i >= 1; i--) { if...
#include <bits/stdc++.h> using namespace std; void solve() { string s; int first; cin >> s >> first; string w = string(s.length(), w ); for (int i = 0; i < s.length(); i++) { if (s[i] == 0 ) { if (i - first >= 0) w[i - first] = 0 ; if (i + first < s.length()) w[i + first...
#include <bits/stdc++.h> using namespace std; char s[10][10]; int t, i, j, o, x[2], y[2], ok; int main() { scanf( %d , &t); while (t--) { for (i = o = 0; i < 8; i++) { scanf( %s , s + i); for (j = 0; j < 8; j++) if (s[i][j] == K ) x[o] = i, y[o++] = j; } if (...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4 ) #pragma GCC optimize( unroll-loops ) using namespace std; using i64 = int64_t; using ui64 = uint64_t; template <class A, class B> bool smin(A &x, B &&y) { if (y < x) { x = y; return true...
#include <bits/stdc++.h> using namespace std; int n, m, ans = 1, bell[1005], c[1005][1005]; char s[55][1005]; map<long long, int> w; long long get(int x) { long long res = 0; for (int i = 1; i <= n; i++) res = (res << 1) + s[i][x] - 48; return res; } int main() { scanf( %d%d , &m, &n); ...

#include <bits/stdc++.h> using namespace std; void prepare() {} const int maxn = 100005; int n; int a[maxn], b[maxn]; vector<int> res; int q[maxn]; void go(int x) { int l = 0, r = 0; long long cur = a[0]; while (true) { cur -= b[r]; (++r) %= n; while (cur < 0) { ((-...

#include <bits/stdc++.h> using namespace std; const double pi = acos(-1.0); const int imax = 2147483647; const int imin = -2147483647; const long long lmax = 9223372036854775807; const long long lmin = -9223372036854775807; long long power(long long a, long long b, long long m) { long long p = 1; ...

#include <bits/stdc++.h> using namespace std; int socks, day; int main() { cin.sync_with_stdio(0); cin >> socks >> day; int i = 0; while (socks) { i++; if (!(i % day)) socks++; socks--; } cout << i; }

#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { return a == 0 ? b : gcd(b % a, a); } void solve(int test) { int n, k; cin >> n >> k; vector<pair<pair<int, int>, int>> v(n); int i, j, l; for (i = (0); i < (n); ++i) cin >> v[i].first.first >> v[i].first.second; for (i =...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 50, M = 55; int B, bl[N]; vector<int> bcc[N]; inline void update(int &a, int b) { a = max(a, b); } int n, m, d; int dp[N * M]; char op[N][M]; vector<int> G[N], G2[N], G3[N]; void add(int u, int v, vector<int> G[]) { G[u].push_back(v);...

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

#include <bits/stdc++.h> int B = 400; using namespace std; const long long inf = 1e8; int MOD = 1e9 + 7; const int mxn = 300010; const int N = 1000005; const double pi = 3.14159; int dx[] = {0, 1, 0, -1, 1, -1, 1, -1}; int dy[] = {1, 0, -1, 0, -1, 1, 1, -1}; int n, d, k; vector<int> g[mxn]; vect...

#include <bits/stdc++.h> using namespace std; int main() { int t; t = 1; for (int r = 0; r < t; r++) { long long n, m, i, x, y, z, sum = 0; cin >> n >> m; vector<string> v(51); char a = a , b = A ; for (i = 0; i <= 50; i++) { if (b > Z ) b = A ; v[i].pus...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); int i, j, k; int n, m, idx; string s, s2; cin >> s; n = s.length(); int cnt = 0; for (i = 0; i < n; i++) { if (s[i] == a ) cnt++; } k = 0; id...

#include <bits/stdc++.h> using namespace std; int p1[400010], p2[400010], p3[400010], p0[400010]; int cnt1, cnt2, cnt3, cnt0; inline bool cmp(const int a, const int b) { return a > b; } int main() { int n; cin >> n; for (int i = 1, a, b, va; i <= n; i++) { scanf( %1d%1d %d , &a, &b, &va); ...

#include <bits/stdc++.h> using namespace std; int main() { int a, y, flag = 0, count, z, x; cin >> y; if (y % 400 == 0 || y % 4 == 0 && y % 100 != 0) { x = 1; } else { x = 2; } z = y + 1; if (x == 1) count = 3; else count = 2; while (flag != 1) { if ...

#include <bits/stdc++.h> using namespace std; int n = 0, m = 0, k; vector<string> a; int CountSpiders(int j) { int sum = 0; int jR = j, jL = j; for (int i = 1; i < n; ++i) { if (!(i % 2) && a[i][j] == U ) ++sum; if (jR > 0) { --jR; if (a[i][jR] == R ) ++sum; } ...

#include <bits/stdc++.h> using namespace std; int xx1, xx2, yy1, yy2; int x, y, r, ans; char v[30000000]; int zhuan(int x, int y) { return (x + 1000) * 10000 + y + 1000; } void swap(int &a, int &b) { int h = a; a = b; b = h; } bool dis(int xx, int yy) { return (xx - x) * (xx - x) + (yy -...

#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int n = s.length(); int ans = 0; int num = 0; for (int i = 0; i < n; i++) { if ((s[i] - 0 ) % 3 == 0) { ans++; num = 0; } else { num++; if (num == 2) { if ((s...

#include <bits/stdc++.h> using namespace std; long long t, n, i, b[1010], ta, tb, k1, a[1010], tem, x[1010], y[1010], k2, tom; vector<long long> v[1010]; void dfs(long long aa, long long bb) { b[aa] = bb; long long ii; for (ii = 0; ii < v[aa].size(); ii++) if (!b[v[aa][ii]]) dfs(v[aa][ii], bb)...

#include <bits/stdc++.h> using namespace std; int main() { string s = qwertyuiopasdfghjkl;zxcvbnm,./ ; char lr; cin >> lr; string message; cin >> message; for (int i = 0; i < message.length(); i++) { int it = s.find(message[i]); if (lr == R ) { cout << s[it - 1]; ...

#include <bits/stdc++.h> using namespace std; const long long mod = 1e6 + 3; long long n, k, x; pair<long long, long long> ans; long long powmod(long long a, long long b, long long c) { long long ans = 1; while (b > 0) { if (b & 1) ans = ans * a % c; a = a * a % c; b /= 2; } ...

#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 40; const long long INFLL = 1e18; long long dp[N][3][2][2]; signed main() { srand(time(NULL)); ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; long long r1, r2, r3, d; cin >> n >> r1 >> r2 >> r3 >> ...

#include <bits/stdc++.h> using namespace std; typedef pair<int, int> pii; template <typename T> inline void read(T &x) { int ch = getchar(); x = 0; bool f = false; double d = 1; for (; ch != - && (ch < 0 || ch > 9 ); ch = getchar()) ; if (ch == - ) { f = true; ch ...

#include <bits/stdc++.h> using namespace std; char s[110], ss[110]; int a[210], ans[210], n, k, namlen; bool boo; bool check() { int i, j; for (i = 1; i <= n; i++) if (ss[i] == 0 ) { bool bk = true; for (j = 1; j <= namlen; j++) if (a[i + j - 1] != s[j]) { ...

#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; string a; cin >> a; string res = ; int kolvo = k / 2; int i = 0; int s = 0; int bla = 0; while (i < kolvo) { res += a[s]; if (a[s] == ( ) { ++i; } else { +...

#include <bits/stdc++.h> using namespace std; const long long N = 2e5 + 5, M = 1e18 + 5, OO = 0x3f3f3f3f; const double pi = 3.141592653589793238462643383279502884; double n, r; double calc() { double ang = 180 / n; ang = (ang / 180) * pi; double a = (sin(ang / 2) * r) / sin(pi - (1.5 * ang)); ...

#include <bits/stdc++.h> using namespace std; const int N = 3228; const int MOD = 1000 * 1000 * 1000 + 7; long long pw(long long a, int first) { if (!first) return 1; if (first % 2) return a * pw(a * a, first / 2); return pw(a * a, first / 2); } void solve() { int pl[3] = {0}; int n, p1,...

#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; const int N = 300005; const double PI = 4 * atan(1); const long long MAX = 9223372036854775807; int dx[] = {1, -1, 0, 0, 1, -1, 1, -1}; int dy[] = {0, 0, 1, -1, 1, 1, -1, -1}; long long gcd(long long a, long long b) { return (b ==...

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

#include <bits/stdc++.h> using namespace std; int max(int a, int b) { if (a > b) return a; else return b; } long long min(long long a, long long b) { if (a < b) return a; else return b; } int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); } int lcm(int a, in...

#include <bits/stdc++.h> using namespace std; template <class T> T abs(T x) { return x < 0 ? -x : x; } const double pi = asin(1.0) * 2; int n; int m; long long pl, pr, vl, vr; int k; vector<long long> h; double prob(long long l, long long r, long long L, long long R) { L = max(l, L); R...

#include <bits/stdc++.h> using namespace std; long long calc2(long long a, long long b, long long c, long long ab, long long ac, long long bc, long long abc) { long long parts[] = {a - ab - ac + abc, b - ab - bc + abc, c - ac - bc + abc, ...

#include <bits/stdc++.h> using namespace std; double p, f[220][220]; int x, k; int main() { scanf( %d%d%lf , &x, &k, &p); p /= 100; for (int i = 0; i <= k; i++) for (int j = x + i; j % 2 == 0; j /= 2) f[0][i]++; for (int i = 0; i < k; i++) { for (int j = 0; j <= k; j++) { if ...

#include <bits/stdc++.h> using namespace std; void inout() { ios_base::sync_with_stdio(false); cin.tie(NULL); ; } int main() { inout(); long long n, i, u, v; cin >> n; map<long long, long long> prv, nxt, cnt1, cnt2; vector<long long> ans(n + 5); for (i = 0; i < n; i++) { ...

#include <bits/stdc++.h> using namespace std; const int N = 105000; const int M = 105; int n, m, p; long long hill[N]; long long a[N], s[N]; long long dp[N]; int top, tail; long long duix[N], duiy[N]; int getint() { char e = getchar(); int res = 0; while (e < 0 || e > 9 ) e = getchar(...

#include <bits/stdc++.h> using namespace std; int n, h; int main() { scanf( %d %d , &n, &h); for (int i = 1; i < n; i++) { printf( %.10lf n , sqrt(1. * h * h * i / n)); } }

#include <bits/stdc++.h> using namespace std; void sprint(int x) { cout << x; } void sprint(long x) { cout << x; } void sprint(long long x) { cout << x; } void sprint(unsigned x) { cout << x; } void sprint(unsigned long x) { cout << x; } void sprint(unsigned long long x) { cout << x; } void sprint(float...

#include <bits/stdc++.h> using namespace std; int l[100005], r[100005]; int main(int argc, char* argv[]) { std::ios::sync_with_stdio(false); int n, k; scanf( %d%d , &n, &k); int sum = 0; for (int i = 0; i < n; i++) { scanf( %d%d , &l[i], &r[i]); sum += r[i] - l[i] + 1; } in...

#include <bits/stdc++.h> using namespace std; template <class T> inline T bigmod(T p, T e, T M) { long long ret = 1; for (; e > 0; e >>= 1) { if (e & 1) ret = (ret * p) % M; p = (p * p) % M; } return (T)ret; } template <class T> inline T gcd(T a, T b) { if (b == 0) return a; ...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:64000000 ) using namespace std; const int MAXN = -1; const int MOD = 1; const long double EPS = 1e-11; long double sqr(long double x) { return x * x; } bool ok(long double x) { return x >= -EPS && x <= 1 + EPS; } void norm(long double &x) { if...

#include <bits/stdc++.h> using namespace std; const int maxn = 65; char g[maxn][maxn]; int r, c, row[maxn], col[maxn]; void solve() { memset(row, 0, sizeof row); memset(col, 0, sizeof col); int sum = 0; for (int i = 1; i <= r; i++) { for (int j = 1; j <= c; j++) { if (g[i][j] == ...

#include <bits/stdc++.h> using namespace std; int n, a[300005], pre[300005], L[300005], R[300005]; int st[300005][19], f[300005], ans; int Max(int l, int r) { int s = f[r - l]; return a[st[l][s]] > a[st[r - (1 << s)][s]] ? st[l][s] : st[r - (1 << s)][s]; } void solve(int l, int r) { if (l > r) r...

#include <bits/stdc++.h> using namespace std; const int c[4][2] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}}; char a[60][60], color[2510]; int to[60][60], minx[2510], maxx[2510], miny[2510], maxy[2510], f[2510][4][2]; void dfs(int x0, int y0, int value) { to[x0][y0] = value; minx[value] = min(minx[value], x0)...

#include <bits/stdc++.h> using namespace std; const double PI = acos(-1.0); const unsigned long long MAX = LONG_MAX; void fasterIO() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); } int sumDig(int a) { int sum = 0; while (a != 0) { sum += a % 10; a /= 10; } retur...

#include <bits/stdc++.h> using namespace std; long long a[18] = {0}; long long int get(long long int n, int l) { if (!n) return 0; if (l == 1) return n; long long int t = a[l]; if (n == t) return l; if (n < t) return min(get(n, l - 1), l + get(t - n, l - 1)); else return min((n...

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

#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > g[500100]; long long f[500100][2]; int n, k; void dfs(int u, int fa) { vector<long long> d; d.clear(); f[u][0] = f[u][1] = 0; for (int i = 0; i < g[u].size(); i++) { int v = g[u][i].first, w = g[u][i].second; if ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 10; int a[MAXN], b[MAXN], f[260], n, k; int main(void) { ios::sync_with_stdio(false); cin >> n >> k; for (int i = 1; i <= n; ++i) { cin >> a[i]; b[i] = a[i]; } memset(f, -1, sizeof f); for (int i = 1; i <= n...

#include <bits/stdc++.h> using namespace std; char s[100005]; int n, a[100005], ans[100005]; inline bool find() { int i = 1, j = n; while (i <= j) { if (a[i] == a[j]) { i++; j--; } else if (a[i] == a[j] + 10) { a[j - 1]--; a[j] += 10; } else if ((a[i] ==...

#include <bits/stdc++.h> using namespace std; int ben[11]; int n, k; int mem[505][505 * 11]; int arr[505 * 505]; int freqFav[100005]; int freqCards[100005]; int solve(int num, int rem) { if (rem == 0 || num == 0) return 0; int &ret = mem[num][rem]; if (~ret) return ret; for (int i = 0; i...

#include <bits/stdc++.h> using namespace std; const int sz = 4e6 + 50; int n, m; string str; int s[sz], e[sz], four[sz], seven[sz], non_dec[sz], non_inc[sz]; vector<bool> lazy(sz, 0); void calculate(int node) { int lc = node * 2; int rc = lc + 1; int f1 = four[lc], s1 = seven[lc], nd1 = non_de...

#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int rnd(int l, int r) { return l + rng() % (r - l + 1); } const int N = 200010; int n; long long ret; int a[N], lz[N], b[N]; int f[N][25]; int que(int i, int j) { int t = lz[j - i + 1...

#include <bits/stdc++.h> using namespace std; int arr[3010][3010], height[3010][3010]; deque<pair<int, int> > mdq; void push(int val, int pos) { while (!mdq.empty() && mdq.back().first > val) mdq.pop_back(); mdq.push_back(make_pair(val, pos)); } int front(int lim) { while (!mdq.empty() && mdq.fr...

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

#include <bits/stdc++.h> using namespace std; template <class T> inline void read(T& num) { bool start = false, neg = false; char c; num = 0; while ((c = getchar()) != EOF) { if (c == - ) start = neg = true; else if (c >= 0 && c <= 9 ) { start = true; num = ...

#include <bits/stdc++.h> using namespace std; int a[1000000 + 5]; int b[1000000 + 5]; int main() { ios_base::sync_with_stdio(false); int i, j, n, k; queue<pair<int, int> > q; cin >> n; for (i = 1; i <= n; i++) cin >> a[i]; for (i = 1; i <= n; i++) cin >> b[i]; for (i = 1; i <= n; i++...

#include <bits/stdc++.h> using namespace std; const int bignumlen = 2200; const int Blen = 8; const long long base = 100000000; struct bignum { int len; long long data[bignumlen]; long long &operator[](int x) { return (data[x]); } const long long &operator[](int x) const { return (data[x]); } ...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10, MSQ = 1010, SQ = 10, inf = 2e9; pair<pair<int, int>, int> p[maxn]; map<int, vector<int> > mp; vector<int> vec, vec2; int n, k, sm[maxn], l[maxn], r[maxn]; long long ans; void add(int ind, int val) { while (ind < maxn) { s...

#include <bits/stdc++.h> using namespace std; int main() { long long t; cin >> t; while (t--) { long long x, y, p, q; cin >> x >> y >> p >> q; if (p == q && x == y) { printf( 0 n ); continue; } if (p == 0 && x == 0) { printf( 0 n ); continue;...

#include <bits/stdc++.h> using namespace std; const double sq = 1.73205080757; int main() { long long k, k1; cin >> k; k1 = k * 2; k *= 2; k1 -= k1 % 3; k1++; if (k1 > k) k1 -= 3; long long h = 1, h1, an = 0; while (k1 > 0) { while (k1 * k1 + 3LL * h * h <= k * k && ...

#include <bits/stdc++.h> using namespace std; void fast() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } int main() { fast(); long long int t = 1; while (t--) { long long int n, m; cin >> n >> m; long long int a[n][m], b[n][m]; for (int i = 0...

#include <bits/stdc++.h> using namespace std; const double pi = acos(-1.0); const int inf = 0x3f3f3f3f; const double eps = 1e-10; const long long INF = (1LL << 60); int main() { int a, b; scanf( %d%d , &a, &b); if (a == b) { printf( %d n , a); return 0; } double ans = -1; ...

#include <bits/stdc++.h> using namespace std; int a[100000 + 10]; int main() { int n; cin >> n; for (int i = 1; i <= n; i++) { long long k; cin >> k; for (int i = 1; i <= k; i++) cin >> a[i]; sort(a + 1, a + k + 1); int ans = 1; for (int i = 1; i < k; i++) { ...

#include <bits/stdc++.h> using namespace std; int main(int argc, char const *argv[]) { ios::sync_with_stdio(false); long long n, m, k; cin >> n >> m >> k; long long x, s; cin >> x >> s; pair<long long, long long> a[m]; for (int i = 0; i < m; i++) cin >> a[i].second; for (int i = 0; i...

#include <bits/stdc++.h> const int MAXN = 2e5 + 10; using namespace std; int T, N, cmp; int p[MAXN], c[MAXN]; vector<int> comp[MAXN]; bool vis[MAXN]; void dfs(int x) { vis[x] = true; comp[cmp].push_back(c[x]); if (!vis[p[x]]) dfs(p[x]); } int min_ans(int idx_comp) { int n_comp = (int)(...

#include <bits/stdc++.h> using namespace std; bool st[1000000]; int main() { int N, K; cin >> N >> K; for (int i = 0; i < 1000000; i++) st[i] = false; int cnt = 0; for (int i = 0; i < N; i++) { int te1, te2; cin >> te1 >> te2; te1 += 100000, te2 += 100000; for (int j = ...

#include <bits/stdc++.h> using namespace std; const int maxint = -1u >> 1; template <class T> bool get_max(T& a, const T& b) { return b > a ? a = b, 1 : 0; } template <class T> bool get_min(T& a, const T& b) { return b < a ? a = b, 1 : 0; } int main() { int f[21]; int a, b, c; cin ...

#include <bits/stdc++.h> using namespace std; struct edge { int u; int v; long long cost; edge() {} edge(int u, int v, long long c) : u(u), v(v), cost(c) {} }; long long comb2(long long n) { return (n * (n - 1)) / 2; } const int MAXN = 100100; int n; vector<int> G[MAXN]; edge es[MAXN...

#include <bits/stdc++.h> const int N = 5e5, mo = 1e6 + 3; int n, m, i, j, ans; bool h[N][2], l[N][2]; char s[N]; int main() { scanf( %d%d , &n, &m); ans = 1; for (i = 0; i < n; i++) for (scanf( %s , s), j = 0; j < m; j++) if (s[j] != . ) { int x = s[j] - 48; h[i]...

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

#include <bits/stdc++.h> using namespace std; class Solution { public: void solve(vector<pair<int, int>>& edges, vector<int>& xs, vector<int>& ys, int n) { vector<vector<int>> graph(n + 1); for (auto& p : edges) { int u = p.first, v = p.second; graph[u].push_back(v)...

#include <bits/stdc++.h> using namespace std; const int MOD = 1000 * 1000 * 1000 + 9; const int MAX_N = 1000 * 1000 + 10; long long dp1[MAX_N]; int main() { int n; scanf( %d , &n); n /= 2; if (n == 1) { printf( %d n , 10); return 0; } dp1[1] = 5; for (int i = 2; i <= n ...

#include <bits/stdc++.h> int a[100100]; int f[100100][3]; int s[100100]; char tmp[100100]; int n; void maximize(int &x, const int &y) { if (x < y) x = y; } void swap(int &a, int &b) { int sw; sw = a; a = b; b = sw; } void init(void) { scanf( %d , &n); int i; for (i = ...

#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; const long long INF = 1e9 + 9; const long long N = 500500; char s[4][4]; long long dot, cross, nought, first_wins, second_wins; long long first_win_rows, first_win_col, second_win_row, second_win_col; long long total; signed ...

#include <bits/stdc++.h> using namespace std; int n; int mx = 0, sum = 0; int main() { cin >> n; for (int i = 1; i <= n; ++i) { int a; cin >> a; mx = max(mx, a); sum += a; } sum *= 2; sum += n; sum /= n; cout << max(sum, mx) << endl; return 0; }

/* Author : Prakhar Rai */ #include<bits/stdc++.h> #define ll long long #define ld long double #define LB(x,num) lower_bound(x.begin(),x.end(),num) - x.begin() #define UB(x,num) upper_bound(x.begin(),x.end(),num) - x.begin() #define BS(x,num) binary_search(x.begin(),x.end(),num) #define pb push_back...

#include <bits/stdc++.h> using namespace std; int play(int n) { int x = 1; for (;;) { if (x * 2 > n) break; else x *= 2; } return x / 2; } int main() { int n, b, p, k, x = 1, btl = 0, twl = 0; scanf( %d %d %d , &n, &b, &p); twl = n * p; while (1) { ...

#include <bits/stdc++.h> using namespace std; int main() { int h, w; cin >> h >> w; string line; char table[h + 2][w + 2]; memset(table, 0 , sizeof table); for (int i = 1; i <= h; i++) { cin >> line; line = + line; for (int j = 1; j <= w; j++) { table[i][j] = l...

#include <bits/stdc++.h> using namespace std; template <typename _T, typename _T2> string to_string(pair<_T, _T2> x) { return < + to_string(x.first) + , + to_string(x.second) + > ; } template <typename _T> string to_string(vector<_T> vec) { string s = [ ; for (auto el : vec) s += to_stri...

#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; long long s[100005]{0}; pair<long long, long long> p[100005]; for (int i = 0; i < m; i++) { int u, v; long long d; cin >> u >> v >> d; u--; v--; s[u] -= d; s[v] += d; ...

#include <bits/stdc++.h> using namespace std; inline void read(int &res) { register char ch = getchar(); res = 0; register int g = 1; while (!isdigit(ch)) { if (ch == - ) g = -1; ch = getchar(); } while (isdigit(ch)) { res = (res << 3) + (res << 1) + (ch ^ 48); ch = ...

#include <bits/stdc++.h> using namespace std; int n, i; long long r, c = 1000000000000000000LL; void solve(int n, long long x) { for (int i = 1; i * i <= n; i++) if (!(n % i)) { r = max(r, (i + 2LL) * (n / i + 2LL) * x); c = min(c, (i + 2LL) * (n / i + 2LL) * x); } } int main...

#include <bits/stdc++.h> using namespace std; int main() { long long i, t, n, m, c, d, a[100005]; cin >> n >> m; if (n == 1 && m == 0) { cout << 10000000; return 0; } if (m < n / 2 || n < 2) { cout << -1; return 0; } c = 1000000000LL; for (int i = n - 1; i > 1...

#include <bits/stdc++.h> using namespace std; map<string, string> p; int ans = 0; string tmp = abcdef ; void doit(int n, string s) { if (n == 0) { int f = 0; while (true) { if (s.length() == 2) { if (p.find(s) == p.end()) { f = 1; break; } ...

#include <bits/stdc++.h> using namespace std; unsigned long long const Mod = 1000000007; unsigned long long sq_sum(unsigned long long n) { unsigned long long ret = n; ret = (n * (n + 1)); ret /= 2; if (ret % 3 == 0) { return ((ret / 3) % Mod * (2 * n + 1)) % Mod; } else { return ((...

#include <bits/stdc++.h> using namespace std; long long segs[] = {6, 2, 5, 5, 4, 5, 6, 3, 7, 6}; int n, m, k; long long a[200005]; vector<pair<int, int> > q; int res[200005]; int main() { cin >> n >> m; for (int i = 0; i < n; i++) { cin >> a[i]; } for (int i = 0; i < m; i++) { ...

#include <bits/stdc++.h> using namespace std; long long a, b, c; long long exgcd(long long a, long long b, long long& x, long long& y) { if (b == 0) { x = 1; y = 0; return a; } long long d = exgcd(b, a % b, x, y); long long z = x; x = y; y = z - y * (a / b); return d;...

#include <bits/stdc++.h> using namespace std; long long t, cn, n, nr, p10; int main() { cin >> t; while (t--) { cin >> n; cn = n; nr = 0; p10 = 1; while (cn) { if (cn % 10) nr++; cn /= 10; } cout << nr << n ; while (n) { if (n % 10)...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n, amazing = 0, maxx, minn, k; cin >> n; cin >> k; maxx = k; minn = k; for (int i = 1; i < n; i++) { cin >> k; if (k > maxx) { maxx = k; amazing++;...

#include <bits/stdc++.h> using namespace std; const int INF = INT_MAX; const int N = 2 * 1e3 + 10; const long double eps = 1e-9; const int mod = 998244353; char a[N][N]; int d[N][N], v[N][N], n, m; bool used[N][N]; void nxt(char c, int &x, int &y) { if (c == U ) --x; else if (c == D ) ...

#include <bits/stdc++.h> using namespace std; long long a[300005]; string s, p; vector<long long> v; int main() { ios_base::sync_with_stdio(false); long long i, j, k, l, m, x, y, r, n, t; cin >> n >> m; for (i = 1; i <= n; i++) { cin >> x; if (x < 300005) a[x] = 1; } long l...

#include <bits/stdc++.h> using namespace std; int main() { long long m = 100000, n = 0, a[1005], b[1005], u, i, j, k = 0, c, d, s = 0, r = 0; char str1[1005], str2[1005]; cin >> c >> d; scanf( %s , str1); scanf( %s , str2); for (i = 0, j = 0;; i++, j++) { if (str1[i] != s...

#include <bits/stdc++.h> int ab(int x) { if (x < 0) { x = x * -1; } return x; } int main() { int x, y, z, x1, x2, y1, y2; scanf( %d %d , &x, &y); z = ab(x) + ab(y); if (x < 0) { x1 = -1 * z; x2 = 0; if (y < 0) { y1 = 0; y2 = -1 * z; } else ...

#include <bits/stdc++.h> using namespace std; char a[310][310]; int main() { int n, m, k; cin >> n >> m >> k; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> a[i][j]; } } int t = min(m, n); for (int d = 1; d < t; d++) { for (int i = d; i < n - d...

#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0; char ch = getchar(); while (!isdigit(ch)) ch = getchar(); while (isdigit(ch)) x = x * 10 + ch - 0 , ch = getchar(); return x; } const int maxn = 100005; int n; long long zero = 0, one = 0, z1 = 0, o1 = 0; cha...

#include <bits/stdc++.h> using namespace std; int dx[] = {0, 0, 1, -1, -1, -1, 1, 1}; int dy[] = {1, -1, 0, 0, -1, 1, 1, -1}; char ch[] = { N , S , E , W }; template <class T> inline T biton(T n, T pos) { return n | ((T)1 << pos); } template <class T> inline T bitoff(T n, T pos) { return n ...

#include <bits/stdc++.h> using namespace std; const long long N = 105; vector<long long> a, b, v; string s; long long n, m, x; long long killAll() { vector<long long> hlp; long long i = 0; for (long long x : b) { while (i < v.size() and v[i] <= x) { hlp.push_back(v[i]); i++...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; int a[n]; for (int i = 0; i < n; ++i) { cin >> a[i]; } for (int i = n - 1; i >= 0; --i) { int temp = i % 2 != 0 ? -a[i] : a[i]; cout << t...

#include <bits/stdc++.h> using namespace std; template <class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } template <class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long n; ...

#include <bits/stdc++.h> using namespace std; const int maxn = (int)1e5 + 100; const int mod = (int)1e9 + 7; int n, k, a[maxn], c[maxn]; bool was[maxn]; vector<int> g[maxn]; bool check(int pos) { memset(was, 0, sizeof(was)); int used = 0, unused = pos; for (int i = pos; i >= 1; i--) { if...

#include <bits/stdc++.h> using namespace std; void solve() { string s; int first; cin >> s >> first; string w = string(s.length(), w ); for (int i = 0; i < s.length(); i++) { if (s[i] == 0 ) { if (i - first >= 0) w[i - first] = 0 ; if (i + first < s.length()) w[i + first...

#include <bits/stdc++.h> using namespace std; char s[10][10]; int t, i, j, o, x[2], y[2], ok; int main() { scanf( %d , &t); while (t--) { for (i = o = 0; i < 8; i++) { scanf( %s , s + i); for (j = 0; j < 8; j++) if (s[i][j] == K ) x[o] = i, y[o++] = j; } if (...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4 ) #pragma GCC optimize( unroll-loops ) using namespace std; using i64 = int64_t; using ui64 = uint64_t; template <class A, class B> bool smin(A &x, B &&y) { if (y < x) { x = y; return true...

#include <bits/stdc++.h> using namespace std; int n, m, ans = 1, bell[1005], c[1005][1005]; char s[55][1005]; map<long long, int> w; long long get(int x) { long long res = 0; for (int i = 1; i <= n; i++) res = (res << 1) + s[i][x] - 48; return res; } int main() { scanf( %d%d , &m, &n); ...