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; bool posible(int a, int b, int a2, int b2) { if ((a + a2 == b && b == b2) \|\| (a + b2 == b && b == a2) \|\| (b + b2 == a && a == a2) \|\| (b + a2 == a && a == b2)) { return true; } return false; } int main() { int t; cin >> t; for (i...
#include <bits/stdc++.h> using namespace std; int n, m, p, last[10]; struct node { int x, y; }; int s[10]; char a[1005][1005]; int vis[1005][1005], ans[10], can[10]; queue<node> que[10]; int d[4][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}}; void bfs() { for (int i = 1; i <= p; i++) { while...
#include <bits/stdc++.h> using namespace std; const long long INF = 1e18; const int inf = 1e9; int main() { long long n, m, grt = 0, eq = 0, less = 0, i; cin >> n >> m; for (i = 0; i < n; i++) { long long temp; cin >> temp; if (temp == m) eq++; else if (temp < m) ...
#include <bits/stdc++.h> using namespace std; bool prime(int n) { for (int i = 2; i * i <= n; i++) { if (n % i == 0) return false; } return true; } int main() { int n; cin >> n; if (prime(n)) { cout << 1 << n << n << endl; return 0; } if (prime(n - 2)) { ...
#include <bits/stdc++.h> using namespace std; int n, m, k, a[300]; double p[300], d[202][202][402], ans; int main() { scanf( %d%d%d , &n, &m, &k); for (int i = 1; i <= n; ++i) { scanf( %lf , &p[i]); p[i] /= 100; } for (int i = 1; i <= n; ++i) { scanf( %d , &a[i]); } if ...
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using ii = pair<ll, ll>; using vi = vector<ll>; using vb = vector<bool>; using vvi = vector<vi>; using vii = vector<ii>; using vvii = vector<vii>; const int INF = 2000000000; const ll LLINF = 90000000000000...
#include <bits/stdc++.h> using namespace std; template <class T> void read(vector<T> &a, long long n) { T x; a.clear(); for (long long i = 0; i < n; i++) { cin >> x; a.push_back(x); } } template <class T> void write(vector<T> &a) { for (T x : a) cout << x << ; cout << ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; map<int, int> mp1, mp2; map<int, int>::iterator it; for (int i = 0; i < n; i++) { int a, b; cin >> a >> b; mp1[a] = b; } int m; cin >> m; ...
#include <bits/stdc++.h> using namespace std; long long test(long long k) { long long a[] = {-1, 1, k + 2}; int c = -1; long long cur = 0, res = 0; for (int i = 0; i < 3; i++) { cur += a[i]; if (cur < 0) { cur = 0; c = i; } res = max(res, (i - c) * cur); }...
#include <bits/stdc++.h> #define task suffixarray #define ll long long #define FOR( i, l, r) for(int i = (l), _r = (r); i <= _r; ++i) #define FOD( i, l, r) for(int i = (l), _r = (r); i >= _r; --i) #define REP( i, n) for(int i = 0, _n = (n); i < _n; ++i) #define pii pair<int,int> #define fi first #...
#include <bits/stdc++.h> using namespace std; template <typename _T> inline void read(_T &f) { f = 0; _T fu = 1; char c = getchar(); while (c < 0 \|\| c > 9 ) { if (c == - ) fu = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { f = (f << 3) + (f << 1) + (c & 15); ...
#include <bits/stdc++.h> int main() { int arr[1000], n, i, j, k, counter = 99999999, x, y; scanf( %d , &n); for (i = 0; i < n; ++i) { scanf( %d , &arr[i]); } for (j = 1; j < n; ++j) { for (k = j - 1; k < j; ++k) { if (abs(arr[j] - arr[k]) < counter) { counter = abs(ar...
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const int eps = -1e6; const int MAX = 200010; long long int n, k, x; long long int a[MAX], pre[MAX], s[MAX]; long long int expo(long long int a, long long int b) { long long int x = 1, y = a; while (b > 0) { if (b & 1) x ...
#include <bits/stdc++.h> using namespace std; int arr[100000]; int pre[100000]; int leftMax; int main() { ios_base ::sync_with_stdio(false); cin.tie(NULL); ; int t; cin >> t; while (t--) { int maxLen = 0; int n, x; cin >> n >> x; for (int i = 0; i < n; i++) cin ...
#include <bits/stdc++.h> using ll = long long; constexpr int INF = 1073741823; constexpr int MINF = -1073741823; constexpr ll LINF = ll(4661686018427387903); constexpr ll MOD = 1000000007; const long double PI = acosl(-1.0L); using namespace std; void scans(string& str) { char c; str = ; s...
#include <bits/stdc++.h> using namespace std; struct cmp { bool operator()(long long a, long long b) { return a > b; } }; multiset<long long> mex, msy; multiset<long long, cmp> msx, mey; int main() { long long n; cin >> n; long long sx[n], ex[n], sy[n], ey[n]; for (long long i = 0; i < n...
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; pair<int, int> cc[105]; for (int i = 1; i <= m; i++) { int a, b, c, d; cin >> a >> b >> c >> d; for (int j = a; j <= b; j++) { if (!cc[j].first \|\| c < cc[j].first) { cc[j].first = ...
#include <bits/stdc++.h> using namespace std; long long n, m; long long q_pow(long long a, long long b, long long c) { if (b == 0) return 1; long long ret = q_pow(a, b / 2, c); ret = (ret * ret) % c; if (b & 1) ret = (ret * a) % c; return ret; } int main() { scanf( %d%d , &n, &m); ...
#include <bits/stdc++.h> using namespace std; const char nl = n ; const int mod = 1000000007; const double pi = 4 * atan(1); const int inf = 2000000000; const long long linf = (long long)1e18; const int pr = 37; const int maxn = 1000001; const int maxn_big = 1000001; string s; vector<int> v; u...
#include <bits/stdc++.h> using namespace std; const int N = 25; int main(int argc, char argv[]) { long long n; cin >> n; long long ret1 = (1LL << 60); long long ret2 = 0; for (long long x = 1; x x <= n; ++x) { if (n % x) continue; long long m = n / x; for (long long y = 1;...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:1000000000 ) using namespace std; inline void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); solve(); } string abc = abcdefghijklmnopqrstuvwxyz ; string ABC = ABCDEFGHIJKLMNOPQRSTUVWXYZ ; string digits = ...
#include <bits/stdc++.h> using namespace std; void qmax(long long &x, long long y) { if (x < y) x = y; } void qmin(long long &x, long long y) { if (x > y) x = y; } inline long long read() { char s; long long k = 0, base = 1; while ((s = getchar()) != - && s != EOF && !(isdigit(s))) ...
#include <bits/stdc++.h> using namespace std; int main() { long long int t, n, d, x, y, javab1, javab2, ans[1000]; cin >> t; for (int i = 0; i < t; i++) { cin >> n >> x >> y >> d; javab1 = javab2 = n; if ((y - x) % d == 0) { ans[i] = ((abs(y - x)) / d); } else if ((y - 1)...
#include <bits/stdc++.h> using namespace std; using gg = long long; constexpr gg MAX = 1e6 + 5; constexpr gg mod = 1e9 + 7; constexpr gg INF = 1e10; constexpr double thre = 1e-7; gg ti, ni, mi, ki, di, pi, xi, yi; int main() { ios::sync_with_stdio(false); cin.tie(0); ti = 1; cin >> ti; ...
#include <bits/stdc++.h> using namespace std; int main() { int n, s, h, m, qh, qm, qhm, d; cin >> n >> s; qh = 0, qm = 0; qhm = 0; for (int i = 0; i < n; i++) { cin >> h >> m; d = h * 60 + m; if (i == 0 && d >= s + 1) { cout << 0 << << 0; return 0; } ...
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { return (a ? gcd(b % a, a) : b); } long long power(long long a, long long n) { long long p = 1; while (n > 0) { if (n % 2) { p = p * a; } n >>= 1; a *= a; } return p; } const ...
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const int maxn = 2e3 + 1; const int maxm = 2e3 + 1; char a[maxn], b[maxn]; int num[maxn]; int m, d; long long dp[maxn][maxm]; int len; int judge(const char* s, int lena) { int mod = 0; for (int i = 1; i <= lena; i++) { ...
#include <bits/stdc++.h> using namespace std; const long long inf = LLONG_MAX; struct minimum_cost_bipartite_matching { int nl, nr; long long mc = 0; vector<int> ml, mr, ly; minimum_cost_bipartite_matching(int nl, int nr, vector<vector<long long>> &c) : nl(nl), nr(nr), ml(nl, -1), mr(nr, -...
#include <bits/stdc++.h> #pragma GCC target( avx,avx2,fma ) #pragma GCC optimization( O8 ) #pragma GCC optimization( unroll-loops ) using namespace std; const long long int N = 4e6 + 20, mod = 1e9 + 7, inf = 1e9, dlt = 12250, maxm = 2e6; int poww(long long a, int k) { if (!k) retur...
#include <bits/stdc++.h> using namespace std; template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cerr << name << : << arg1 << std::endl; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, ...
#include <bits/stdc++.h> using namespace std; void boost() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } const long long mod = 1000000007; int tablica[2]; long long potega(long long base, long long pot) { if (pot == 0) return 1; if (pot == 1) return base; if (pot % 2 == ...
#include <bits/stdc++.h> using namespace std; const long long UNDEF = -1; const long long INF = 1e18; template <typename T> inline bool chkmax(T &aa, T bb) { return aa < bb ? aa = bb, true : false; } template <typename T> inline bool chkmin(T &aa, T bb) { return aa > bb ? aa = bb, true : false; ...
#include <bits/stdc++.h> using namespace std; int main() { long long n, m; scanf( %lld%lld , &n, &m); long long t = m / 2; if (t >= n) { printf( 0 n ); } else { if (m % 2 == 1) { printf( %lld n , min(t, n - (t + 1) + 1)); } else { printf( %lld n , min(t - 1, n -...
#include <bits/stdc++.h> using namespace std; const long long M = 3e4 + 1; long long n, m, d; const long long K = 3e4 + 5; const long long huge = 1e15; long long dp[K][500]; long long a[K], ps[K]; long long solve(long long i, long long j) { if (i >= M) return 0; long long jj = j - (d - 250); ...
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int n = s.length(); for (int i = 1; i < n - 1; i++) if (s[i] == s[i - 1] && s[i] == s[i + 1]) { if (s[i] == a ) s[i] = b ; else s[i] = a ; } for (int i = 1; i < n; i+...
#include <bits/stdc++.h> using namespace std; int a[5]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); cout << a[n / 2]; }
#include <bits/stdc++.h> using namespace std; int n, m; int main() { cin >> n >> m; if (n == 1) { cout << 1; exit(0); } cout << fixed << setprecision(12) << 1.0 / n + (1.0 * (n - 1)) / n * (1.0 * (m - 1)) / (m * n - 1); }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<pair<int, int> > p; int a[n + 1], b[n + 1]; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= n; i++) cin >> b[i]; for (int i = 1; i <= n; i++) { if (a[i] != b[i]) { for (int j =...
#include <bits/stdc++.h> using namespace std; int main() { int a[1002], b[1002], n, m; while (cin >> n >> m) { for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n; i++) cin >> b[i]; double be = m; bool flag = 0; for (int i = n - 1; i >= 0; i--) { be = be * b[...
#include <bits/stdc++.h> using namespace std; long long int power(long long int a, long long int b) { a %= 1000000007; long long int res = 1; while (b > 0) { if (b & 1) res = res * a % 1000000007; a = a * a % 1000000007; b >>= 1; } return res; } long long int modinv(long lo...
#include <bits/stdc++.h> const int N = 2e4 + 42, M = 1e6 + 61, LN = 16; struct edge { int to, next, w; } e[M << 1]; int head[M], cnt = 1, nc; void addedge(int x, int y, int z) { if (!y) return; e[++cnt] = (edge){y, x[head], z}, x[head] = cnt; e[++cnt] = (edge){x, y[head], 0}, y[head] = cnt; ...
#include <bits/stdc++.h> using namespace std; const double one = 1.0; const double PI = 3.14159265; const long long maxn = 2e3 + 10; const long long maxx = 1e6 + 10; const long double eps = 1e-14; const long long max_len = 1e6 + 1; const long long mod1 = 1000000007; const long long mod2 = 998244353; ...
#include <bits/stdc++.h> int a, b, k; int main() { scanf( %d%d%d , &b, &a, &k); if (b + k < a) { printf( %.12f n , 0.0f); return 0; } double ans = 1; for (int i = 0; i <= k; i++) { ans *= (a - i); ans /= (b + 1 + i); } ans = 1 - ans; printf( %.12f n , ans); ...
#include <bits/stdc++.h> using namespace std; const int SZ = (int)3e7 + 10; int cnt[SZ]; int n[3], t[3], sum[3]; int main() { int k; cin >> k; for (int i = 0; i < 3; i++) cin >> n[i]; for (int i = 0; i < 3; i++) cin >> t[i]; for (int i = 0; i < 3; i++) sum[i] = 0; for (int tme = 0;; tm...
#include <bits/stdc++.h> using namespace std; long long n, k; long double ans, eps = 1e-10, l, v1, v2; bool solve(long double mid) { int x = (n + k - 1) / k; long double tl = mid, pos = l; while (x--) { if (tl < 0) return 0; long double trav = (v2 * v1 * tl - v2 * pos) / (v1 - v2); ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 3010; const int MOD = 1000000007; int n, m; long long f[MAXN][MAXN], ans1, ans2, ans3, ans4; char a[MAXN][MAXN]; int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) scanf( %s , a[i] + 1); if (a[1][2] == . ) f[1][2] = ...
#include <bits/stdc++.h> using namespace std; int a[212345], s1[212345], s2[212345], pos1[212345], pos2[212345], n; vector<pair<int, int> > res; int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= n; i++) { s1[i] = s1[i - 1] + (a[i] == 1); s2[i] = s2[i -...
#include <bits/stdc++.h> using namespace std; int main() { long long int n; cin >> n; long long d = 0; for (int i = 9; n > 0; i *= 10) { d += n; n -= i; } cout << d << endl; }
#include <bits/stdc++.h> using namespace std; namespace FGF { const int N = 1e5 + 5, mo = 1e9 + 7, inv2 = (mo + 1) / 2; int a[N], b[N], pre[N], lst[N], nxt[N], sum[N << 2][4], ta[N << 2][2], n, st[N], tp, mi[N], mx[N], ans, cnt[N]; void pushtag(int ro, int l, int r, int x, int o) { sum[ro][3] = 1ll ...
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const double PI = 3.14159265; const double E = 2.718281828459; const double EPS = 1e-8; const int M = 2e5 + 5; long long n, A; long long a[M]; int main() { while (~scanf( %I64d %I64d , &n, &A)) { long long sumb = 0; ...
#include <bits/stdc++.h> using namespace std; struct Node { int v; int id; } node[110]; int t[110]; bool cmp(Node x, Node y) { return x.v > y.v; } int main() { int n, w; cin.sync_with_stdio(false); while (cin >> n >> w) { for (int i = 0; i < n; i++) { cin >> node[i].v; ...
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 2; int n; struct Node { int l, r; }; Node a[maxn]; bool cmp(Node x, Node y) { if (x.r == y.r) return x.l < y.l; return x.r < y.r; } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { int x, w; ...
#include <bits/stdc++.h> using namespace std; unsigned int dp[100100]; char s[100100]; int main() { unsigned int n; cin >> n; if (n & 1) { return !printf( 0 ); } scanf( %s , s + 1); int m = n / 2; dp[0] = 1; for (int i = 1; i <= n; i++) { if (s[i] == ? ) { fo...
#include <bits/stdc++.h> using namespace std; int modInverse(int a, int m); int gcd(int a, int b); int power(int x, unsigned int y, unsigned int m); void pairsort(int a[], int b[], int n); int logint(int x, int y); int gcd(int a, int b) { if (a == 0) return b; return gcd(b % a, a); } int power...
#include <bits/stdc++.h> using namespace std; int visit[210000]; int ans[210000]; queue<int> q; int a[210000]; int n; vector<int> g[210000]; int main() { int n; cin >> n; for (int i = 1; i <= n; i++) scanf( %d , &a[i]); for (int i = 1; i <= n; i++) { if (a[i] & 1) { q.push(...
#include <bits/stdc++.h> using namespace std; const int P = 998244353, INF = 0x3f3f3f3f; long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } long long qpow(long long a, long long n) { long long r = 1 % P; for (a %= P; n; a = a * a % P, n >>= 1) if (n & 1) r = r * a % P; r...
#include <bits/stdc++.h> using namespace std; inline int read() { int num = 0; char c = getchar(); if (c == - ) return -read(); while (c >= 0 && c <= 9 ) { num = (num << 3) + (num << 1) + c - 0 ; c = getchar(); } return num; } inline long long READ() { long long num ...
#include <bits/stdc++.h> using namespace std; long long num[505]; int n; long long minval = 0x3f3f3f3f3f3f3f3fll; long long check(int x) { long long ans = 0; for (int i = 1; i <= n; i++) { if (num[i] % x == 0) { ans += num[i] / x; } else { if (num[i] % x + num[i] / x >= x -...
#include <bits/stdc++.h> using namespace std; double tick() { static clock_t oldt, newt = clock(); double diff = 1.0 * (newt - oldt) / CLOCKS_PER_SEC; oldt = newt; return diff; } inline long long int read() { long long int f = 1, x = 0; char ch = getchar(); while (ch < 0 \|\| ch > 9...
#include <bits/stdc++.h> using namespace std; int a[100100]; int main() { int i, n; scanf( %d , &n); for (i = 0; i < n; i++) scanf( %d , &a[i]); sort(a, a + n); int sign = 1; for (i = 0; i < n; i++) { if (a[i] >= sign) { a[i] = sign; sign++; } } printf( ...
#include<bits/stdc++.h> typedef int LL; typedef double dl; #define opt operator #define pb push_back #define pii std::pair<LL,LL> const LL maxn=2e4+9,mod=998244353,inf=0x3f3f3f3f; LL Read(){ LL 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 a[1001]; long long b[2001]; int main() { long long n, k, p; cin >> n >> k >> p; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= k; i++) cin >> b[i]; sort(a + 1, a + n + 1); sort(b + 1, b + k + 1); long long ans = ...
#include <bits/stdc++.h> using namespace std; int main() { int s1, s2, t1, t2; char ch1, ch2; cin >> s1 >> ch1 >> s2; cin >> t1 >> ch2 >> t2; int a = s1 - t1; int b = s2 - t2; if (b < 0) { b += 60; a--; } if (a < 0) { a += 24; } cout << right << setw(2) ...
#include <bits/stdc++.h> using namespace std; int main() { int n, a; cin >> n >> a; int arr[n]; int sum = 0; for (int i = 0; i < n; i++) { cin >> arr[i]; sum += arr[i]; } sum += (n - 1) * 10; if (sum > a) { cout << -1 << endl; } else { cout << (n - 1) * 2 ...
#include <bits/stdc++.h> using namespace std; const int N = 1000000 + 5; vector<int> g[N]; bool used[N]; int n, m; int main() { scanf( %d %d , &n, &m); for (int i = 0; i < m; i++) { int u, v; scanf( %d %d , &u, &v); u--, v--; g[u].push_back(v); } for (int i = 0; i < n...
#include <bits/stdc++.h> using namespace std; const int maxN = 500 + 5; const int maxM = 100000 + 5; inline long long read() { long long sum = 0, f = 1; char ch = getchar(); while (ch < 0 \|\| ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { ...
#include <bits/stdc++.h> int main() { long int n, s, sum = 0, z, count = 0; scanf( %ld%ld , &n, &s); z = s; do { if (s >= n) { sum = sum + (s / n) * n; count = count + (s / n); s = s - (s / n) * n; } else n = n - 1; } while (s != 0 && n != 0); printf...
#include <bits/stdc++.h> const double EPS = 0.00000001; int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(nullptr); int32_t t; std::cin >> t; for (int32_t cs = 1; cs <= t; cs++) { int32_t n, l; std::cin >> n >> l; std::vector<int32_t> a(n); for (auto &x : a...
#include <bits/stdc++.h> using namespace std; void solve() {} const long long maxn = 1050; long long n, a, b; long long ans[maxn][maxn]; void no() { cout << NO << n ; exit(0); } signed main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> a >> b; if (min(a, b) > 1) no(); ...
#include <bits/stdc++.h> using namespace std; int main() { int i, n; int a, b, c; int sum_a, sum_b, sum_c; sum_a = 0; sum_b = 0; sum_c = 0; cin >> n; for (i = 1; i <= n; i++) { cin >> a >> b >> c; sum_a = sum_a + a; sum_b = sum_b + b; sum_c = sum_c + c; } ...
#include <bits/stdc++.h> using namespace std; long long dp[1001][2 * 1001][2]; long long MOD = 998244353; int main() { ios_base::sync_with_stdio(false); int n, k; cin >> n >> k; dp[1][1][0] = 2; dp[1][2][0] = 0; dp[1][1][1] = 0; dp[1][2][1] = 2; for (int i = 2; i <= n; ++i) { ...
#include <bits/stdc++.h> using namespace std; const double PI = 2.0 * acos(0.0); const double eps = 1e-6; const long long _mod = 1000000007LL; const int save[10][4] = {{0}, {0}, {6, 2, 4, 8}, {1, 3, 9, 7}, {6, 4}, {0}, {0}, {1, 7, 9, 3}, {6, 8, 4, 2}, {1, 9}}; int todigit(char c) ...
#include <bits/stdc++.h> using namespace std; int n, mem[505][505]; string s; int dp(int i, int j) { if (i > j) return 0; int &ans = mem[i][j]; if (ans != -1) return ans; ans = dp(i + 1, j) + 1; for (int k = i + 1; k <= j; k++) if (s[i] == s[k]) ans = min(ans, dp(i + 1, k - 1) + dp(k, ...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n][2]; for (int i = 0; i < n; i++) { cin >> a[i][0] >> a[i][1]; } int sum1 = 0; int sum2 = 0; for (int i = 0; i < n; i++) { if (abs(sum1 + a[i][0] - sum2) <= 500) { sum1 += a[i][0]; ...
#include <bits/stdc++.h> using namespace std; int main() { int t, j; cin >> t; for (j = 0; j <= t - 1; j++) { int a, b, c, n; cin >> a >> b >> n; n = n % 3; c = a ^ b; if (n == 0) { cout << a << endl; } else if (n == 1) { cout << b << endl; } els...
#include <bits/stdc++.h> char _; using namespace std; int N, C, D; pair<int, int> A[400000]; long long Z, ZO, ZOZ, O, OZ, OZO; inline bool cmp(const pair<int, int>& a, const pair<int, int>& b) { if ((b.second < 0) ^ (a.second < 0)) return 1LL * a.first * b.second > 1LL * b.first * a.second; re...
#include <bits/stdc++.h> using namespace std; const int INF = 0x3F3F3F3F; const int NEGINF = 0xC0C0C0C0; const double EPS = 1e-8; int cmp(double x, double y = 0, double tol = EPS) { return (x <= y + tol) ? (x + tol < y) ? -1 : 0 : 1; } string s; bool test(long long inx) { int pos = 0; int m ...
#include <bits/stdc++.h> using namespace std; int a[500005]; int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); int kk = 1; sort(a + 1, a + n + 1); for (int i = 1; i <= n; i++) { if (a[i] >= a[kk] * 2) { ++kk; } } --kk; kk ...
#include <bits/stdc++.h> using namespace std; const int maxn = 200005; int now[30]; char s[maxn]; int num[maxn]; int main() { int n; scanf( %d , &n); scanf( %s , s + 1); int ans = 0; for (int i = 1; i <= n; i++) { for (int j = 1; j <= 30; j++) { if (s[i] >= now[j]) { ...
#include <bits/stdc++.h> using namespace std; int read() { char ch; for (ch = getchar(); ch < 0 \|\| ch > 9 ; ch = getchar()) ; int x = ch - 0 ; for (ch = getchar(); ch >= 0 && ch <= 9 ; ch = getchar()) x = x * 10 + ch - 0 ; return x; } const int N = 3e5 + 5; int n, m, q,...
#include <bits/stdc++.h> using namespace std; const int N = 305; long long dist[10][N][N], I[2][N][N]; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m; cin >> n >> m; for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) { if (i != j) dist[0][i][...
#include <bits/stdc++.h> using namespace std; const int maxn = 200025; int n, m, i, j, t, k, s, mod, a[maxn], fat[maxn]; bool flg, vis[maxn << 1]; inline int Pow(int x, int y, int mo) { int ret = 1; while (y) { if (y & 1) ret = 1ll * ret * x % mo; x = 1ll * x * x % mo; y >>= 1; }...
#include <bits/stdc++.h> using namespace std; char mainstr[111111]; char substr1[111]; char substr2[111]; int main() { while (scanf( %s %s %s , mainstr, substr1, substr2) != EOF) { bool flag1 = false, flag2 = false; int len = strlen(mainstr); int len1 = strlen(substr1); int len2 = ...
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; const double pi = acos(-1); long long n; string str; int main() { cin >> n >> str; sort(str.begin(), str.end()); cout << str << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1000 * 100 + 10, LG = 20; int n, h[N], st[N], en[N], par[N][LG], seg[N << 2], lazy[N << 2], TM, ver[N], ans[N]; vector<int> adj[N]; struct Query { int l, r, id; Query(int x = 0, int y = 0, int z = 0) { l = x, r = y, id = z; } }; vec...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int tt; cin >> tt; while (tt--) { int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; ++i) { cin >> a[i]; } int ans = 0; function<void(int, ...
#include <bits/stdc++.h> using namespace std; void print(vector<int> v) { for (int i = 0; i < v.size(); i++) { if (v[i] != 0) { cout << v[i]; } } cout << endl; } void solve(vector<int>& v, int even, int odd) { if (v.size() == 1) { cout << -1 << endl; return; }...
#include <bits/stdc++.h> using std::max; using std::min; const int inf = 0x3f3f3f3f, Inf = 0x7fffffff; const long long INF = 0x3f3f3f3f3f3f3f3f; std::mt19937 rnd(std::chrono::steady_clock::now().time_since_epoch().count()); template <typename _Tp> _Tp gcd(const _Tp &a, const _Tp &b) { return (!b) ? a ...
#include <bits/stdc++.h> const long long N = 200200; const long long Q = 100100; const long long mod = 998244353; const long long block = 500; using namespace std; string s; int cnt; bool t; void solve() { cin >> s; for (int i = 0; i < s.size(); i++) { if (s[i] == 1 ) { t = 1; ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 100005; int N; int a[MAXN]; vector<int> lol; int main(int argc, char *argv[]) { scanf( %d , &N); int p = 1; while (p < MAXN) { lol.push_back(p); p <<= 1; } for (int i = 0, _i = N; i < _i; ++i) { scanf( %d , ...
#include <bits/stdc++.h> using namespace std; void display(vector<int> &a) { for (int z : a) cout << z << ; cout << endl; } int dx[4] = {0, 0, 1, -1}; int dy[4] = {1, -1, 0, 0}; const int mod = 998244353; const long long INF64 = 3e18; void smxl(long long &a, long long b) { if (a < b) a = ...
#include <bits/stdc++.h> using namespace std; long long cap[200005]; int n, m; inline long long tri(int n) { return n * (n + 1LL) / 2; } inline long long arithsum(int a, int d, int n) { long long ret = a * (long long)n; ret += tri(n - 1) * d; return ret; } int main() { scanf( %d%d , &n, &m...
#include <bits/stdc++.h> using namespace std; int main() { int t, s, x; cin >> t >> s >> x; int tmp = x - t; if ((tmp % s == 0 \|\| tmp % s == 1) && tmp >= 0 && tmp != 1) cout << YES ; else cout << NO ; return 0; }
#include <bits/stdc++.h> using namespace std; int mod = 1e9 + 7; struct edge { int v, next; }; int ans, ans2, f[1005][1 << 12]; int Pow(int a, int b) { int rec = 1; for (; b; b >>= 1, a = 1ll * a * a % mod) if (b & 1) rec = 1ll * rec * a % mod; return rec; } struct nade { int h...
#include <bits/stdc++.h> using namespace std; using LL = long long; using pii = pair<int, int>; const int mod = 998244353; const int inf = 0x3f3f3f3f; const int N = 2e5 + 10; int n, m, a[N]; LL sum[N], fac[N], rev[N]; LL pow_mod(LL x, int p) { LL s = 1; while (p) { if (p & 1) s = s * x %...
#include <bits/stdc++.h> using namespace std; int main() { int input; vector<int> ret; cin >> input; for (int i = 1; i < input; i += 2) { ret.push_back(i + 1); ret.push_back(i); } if (ret.empty() \|\| ret.size() != input) ret = {-1}; for (auto &d : ret) { cout << d << ...
#include <bits/stdc++.h> using namespace std; int n; double ans[1024 * 1024], l, r, x[20], y[20], a[20], cosA[20], sinA[20], maxi; int main() { scanf( %d %lf %lf , &n, &l, &r); maxi = l; for (int i = 0; i < n; i++) { scanf( %lf %lf %lf , &x[i], &y[i], &a[i]); cosA[i] = cos(a[i] * 3.14159...
#include <bits/stdc++.h> using namespace std; int main() { long long int n, count = 0, count1 = 0, ans = 0, i, ma; cin >> n; long long int a[n]; for (i = 0; i < n; i++) { cin >> a[i]; } ma = a[0]; for (i = 0; i < n; i++) { if (a[i] > ma) { ma = a[i]; } } ...
#include <bits/stdc++.h> using namespace std; bool ok(int a, int b) { int c = 0; for (int i = 0; i < 4; i++) { if ((a % 10) != (b % 10)) c++; if (c > 1) return false; a /= 10; b /= 10; } return true; } int getlow(int a, int m) { for (int i = m; i <= 2011; i++) i...
#include <bits/stdc++.h> using namespace std; inline void read(register int n) { register char c; n = 0; do { c = getchar(); } while (c < 0 \|\| c > 9 ); do { n = c - 0 + n * 10; c = getchar(); } while (c >= 0 && c <= 9 ); } long long C[2048][2048], fac[100000...

#include <bits/stdc++.h> using namespace std; bool posible(int a, int b, int a2, int b2) { if ((a + a2 == b && b == b2) || (a + b2 == b && b == a2) || (b + b2 == a && a == a2) || (b + a2 == a && a == b2)) { return true; } return false; } int main() { int t; cin >> t; for (i...

#include <bits/stdc++.h> using namespace std; int n, m, p, last[10]; struct node { int x, y; }; int s[10]; char a[1005][1005]; int vis[1005][1005], ans[10], can[10]; queue<node> que[10]; int d[4][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}}; void bfs() { for (int i = 1; i <= p; i++) { while...

#include <bits/stdc++.h> using namespace std; const long long INF = 1e18; const int inf = 1e9; int main() { long long n, m, grt = 0, eq = 0, less = 0, i; cin >> n >> m; for (i = 0; i < n; i++) { long long temp; cin >> temp; if (temp == m) eq++; else if (temp < m) ...

#include <bits/stdc++.h> using namespace std; bool prime(int n) { for (int i = 2; i * i <= n; i++) { if (n % i == 0) return false; } return true; } int main() { int n; cin >> n; if (prime(n)) { cout << 1 << n << n << endl; return 0; } if (prime(n - 2)) { ...

#include <bits/stdc++.h> using namespace std; int n, m, k, a[300]; double p[300], d[202][202][402], ans; int main() { scanf( %d%d%d , &n, &m, &k); for (int i = 1; i <= n; ++i) { scanf( %lf , &p[i]); p[i] /= 100; } for (int i = 1; i <= n; ++i) { scanf( %d , &a[i]); } if ...

#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using ii = pair<ll, ll>; using vi = vector<ll>; using vb = vector<bool>; using vvi = vector<vi>; using vii = vector<ii>; using vvii = vector<vii>; const int INF = 2000000000; const ll LLINF = 90000000000000...

#include <bits/stdc++.h> using namespace std; template <class T> void read(vector<T> &a, long long n) { T x; a.clear(); for (long long i = 0; i < n; i++) { cin >> x; a.push_back(x); } } template <class T> void write(vector<T> &a) { for (T x : a) cout << x << ; cout << ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; map<int, int> mp1, mp2; map<int, int>::iterator it; for (int i = 0; i < n; i++) { int a, b; cin >> a >> b; mp1[a] = b; } int m; cin >> m; ...

#include <bits/stdc++.h> using namespace std; long long test(long long k) { long long a[] = {-1, 1, k + 2}; int c = -1; long long cur = 0, res = 0; for (int i = 0; i < 3; i++) { cur += a[i]; if (cur < 0) { cur = 0; c = i; } res = max(res, (i - c) * cur); }...

#include <bits/stdc++.h> #define task suffixarray #define ll long long #define FOR( i, l, r) for(int i = (l), _r = (r); i <= _r; ++i) #define FOD( i, l, r) for(int i = (l), _r = (r); i >= _r; --i) #define REP( i, n) for(int i = 0, _n = (n); i < _n; ++i) #define pii pair<int,int> #define fi first #...

#include <bits/stdc++.h> using namespace std; template <typename _T> inline void read(_T &f) { f = 0; _T fu = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) fu = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { f = (f << 3) + (f << 1) + (c & 15); ...

#include <bits/stdc++.h> int main() { int arr[1000], n, i, j, k, counter = 99999999, x, y; scanf( %d , &n); for (i = 0; i < n; ++i) { scanf( %d , &arr[i]); } for (j = 1; j < n; ++j) { for (k = j - 1; k < j; ++k) { if (abs(arr[j] - arr[k]) < counter) { counter = abs(ar...

#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const int eps = -1e6; const int MAX = 200010; long long int n, k, x; long long int a[MAX], pre[MAX], s[MAX]; long long int expo(long long int a, long long int b) { long long int x = 1, y = a; while (b > 0) { if (b & 1) x ...

#include <bits/stdc++.h> using namespace std; int arr[100000]; int pre[100000]; int leftMax; int main() { ios_base ::sync_with_stdio(false); cin.tie(NULL); ; int t; cin >> t; while (t--) { int maxLen = 0; int n, x; cin >> n >> x; for (int i = 0; i < n; i++) cin ...

#include <bits/stdc++.h> using ll = long long; constexpr int INF = 1073741823; constexpr int MINF = -1073741823; constexpr ll LINF = ll(4661686018427387903); constexpr ll MOD = 1000000007; const long double PI = acosl(-1.0L); using namespace std; void scans(string& str) { char c; str = ; s...

#include <bits/stdc++.h> using namespace std; struct cmp { bool operator()(long long a, long long b) { return a > b; } }; multiset<long long> mex, msy; multiset<long long, cmp> msx, mey; int main() { long long n; cin >> n; long long sx[n], ex[n], sy[n], ey[n]; for (long long i = 0; i < n...

#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; pair<int, int> cc[105]; for (int i = 1; i <= m; i++) { int a, b, c, d; cin >> a >> b >> c >> d; for (int j = a; j <= b; j++) { if (!cc[j].first || c < cc[j].first) { cc[j].first = ...

#include <bits/stdc++.h> using namespace std; long long n, m; long long q_pow(long long a, long long b, long long c) { if (b == 0) return 1; long long ret = q_pow(a, b / 2, c); ret = (ret * ret) % c; if (b & 1) ret = (ret * a) % c; return ret; } int main() { scanf( %d%d , &n, &m); ...

#include <bits/stdc++.h> using namespace std; const char nl = n ; const int mod = 1000000007; const double pi = 4 * atan(1); const int inf = 2000000000; const long long linf = (long long)1e18; const int pr = 37; const int maxn = 1000001; const int maxn_big = 1000001; string s; vector<int> v; u...

#include <bits/stdc++.h> using namespace std; const int N = 25; int main(int argc, char *argv[]) { long long n; cin >> n; long long ret1 = (1LL << 60); long long ret2 = 0; for (long long x = 1; x * x <= n; ++x) { if (n % x) continue; long long m = n / x; for (long long y = 1;...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:1000000000 ) using namespace std; inline void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); solve(); } string abc = abcdefghijklmnopqrstuvwxyz ; string ABC = ABCDEFGHIJKLMNOPQRSTUVWXYZ ; string digits = ...

#include <bits/stdc++.h> using namespace std; void qmax(long long &x, long long y) { if (x < y) x = y; } void qmin(long long &x, long long y) { if (x > y) x = y; } inline long long read() { char s; long long k = 0, base = 1; while ((s = getchar()) != - && s != EOF && !(isdigit(s))) ...

#include <bits/stdc++.h> using namespace std; int main() { long long int t, n, d, x, y, javab1, javab2, ans[1000]; cin >> t; for (int i = 0; i < t; i++) { cin >> n >> x >> y >> d; javab1 = javab2 = n; if ((y - x) % d == 0) { ans[i] = ((abs(y - x)) / d); } else if ((y - 1)...

#include <bits/stdc++.h> using namespace std; using gg = long long; constexpr gg MAX = 1e6 + 5; constexpr gg mod = 1e9 + 7; constexpr gg INF = 1e10; constexpr double thre = 1e-7; gg ti, ni, mi, ki, di, pi, xi, yi; int main() { ios::sync_with_stdio(false); cin.tie(0); ti = 1; cin >> ti; ...

#include <bits/stdc++.h> using namespace std; int main() { int n, s, h, m, qh, qm, qhm, d; cin >> n >> s; qh = 0, qm = 0; qhm = 0; for (int i = 0; i < n; i++) { cin >> h >> m; d = h * 60 + m; if (i == 0 && d >= s + 1) { cout << 0 << << 0; return 0; } ...

#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { return (a ? gcd(b % a, a) : b); } long long power(long long a, long long n) { long long p = 1; while (n > 0) { if (n % 2) { p = p * a; } n >>= 1; a *= a; } return p; } const ...

#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const int maxn = 2e3 + 1; const int maxm = 2e3 + 1; char a[maxn], b[maxn]; int num[maxn]; int m, d; long long dp[maxn][maxm]; int len; int judge(const char* s, int lena) { int mod = 0; for (int i = 1; i <= lena; i++) { ...

#include <bits/stdc++.h> using namespace std; const long long inf = LLONG_MAX; struct minimum_cost_bipartite_matching { int nl, nr; long long mc = 0; vector<int> ml, mr, ly; minimum_cost_bipartite_matching(int nl, int nr, vector<vector<long long>> &c) : nl(nl), nr(nr), ml(nl, -1), mr(nr, -...

#include <bits/stdc++.h> #pragma GCC target( avx,avx2,fma ) #pragma GCC optimization( O8 ) #pragma GCC optimization( unroll-loops ) using namespace std; const long long int N = 4e6 + 20, mod = 1e9 + 7, inf = 1e9, dlt = 12250, maxm = 2e6; int poww(long long a, int k) { if (!k) retur...

#include <bits/stdc++.h> using namespace std; template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cerr << name << : << arg1 << std::endl; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, ...

#include <bits/stdc++.h> using namespace std; void boost() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } const long long mod = 1000000007; int tablica[2]; long long potega(long long base, long long pot) { if (pot == 0) return 1; if (pot == 1) return base; if (pot % 2 == ...

#include <bits/stdc++.h> using namespace std; const long long UNDEF = -1; const long long INF = 1e18; template <typename T> inline bool chkmax(T &aa, T bb) { return aa < bb ? aa = bb, true : false; } template <typename T> inline bool chkmin(T &aa, T bb) { return aa > bb ? aa = bb, true : false; ...

#include <bits/stdc++.h> using namespace std; int main() { long long n, m; scanf( %lld%lld , &n, &m); long long t = m / 2; if (t >= n) { printf( 0 n ); } else { if (m % 2 == 1) { printf( %lld n , min(t, n - (t + 1) + 1)); } else { printf( %lld n , min(t - 1, n -...

#include <bits/stdc++.h> using namespace std; const long long M = 3e4 + 1; long long n, m, d; const long long K = 3e4 + 5; const long long huge = 1e15; long long dp[K][500]; long long a[K], ps[K]; long long solve(long long i, long long j) { if (i >= M) return 0; long long jj = j - (d - 250); ...

#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int n = s.length(); for (int i = 1; i < n - 1; i++) if (s[i] == s[i - 1] && s[i] == s[i + 1]) { if (s[i] == a ) s[i] = b ; else s[i] = a ; } for (int i = 1; i < n; i+...

#include <bits/stdc++.h> using namespace std; int a[5]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); cout << a[n / 2]; }

#include <bits/stdc++.h> using namespace std; int n, m; int main() { cin >> n >> m; if (n == 1) { cout << 1; exit(0); } cout << fixed << setprecision(12) << 1.0 / n + (1.0 * (n - 1)) / n * (1.0 * (m - 1)) / (m * n - 1); }

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<pair<int, int> > p; int a[n + 1], b[n + 1]; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= n; i++) cin >> b[i]; for (int i = 1; i <= n; i++) { if (a[i] != b[i]) { for (int j =...

#include <bits/stdc++.h> using namespace std; int main() { int a[1002], b[1002], n, m; while (cin >> n >> m) { for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n; i++) cin >> b[i]; double be = m; bool flag = 0; for (int i = n - 1; i >= 0; i--) { be = be * b[...

#include <bits/stdc++.h> using namespace std; long long int power(long long int a, long long int b) { a %= 1000000007; long long int res = 1; while (b > 0) { if (b & 1) res = res * a % 1000000007; a = a * a % 1000000007; b >>= 1; } return res; } long long int modinv(long lo...

#include <bits/stdc++.h> const int N = 2e4 + 42, M = 1e6 + 61, LN = 16; struct edge { int to, next, w; } e[M << 1]; int head[M], cnt = 1, nc; void addedge(int x, int y, int z) { if (!y) return; e[++cnt] = (edge){y, x[head], z}, x[head] = cnt; e[++cnt] = (edge){x, y[head], 0}, y[head] = cnt; ...

#include <bits/stdc++.h> using namespace std; const double one = 1.0; const double PI = 3.14159265; const long long maxn = 2e3 + 10; const long long maxx = 1e6 + 10; const long double eps = 1e-14; const long long max_len = 1e6 + 1; const long long mod1 = 1000000007; const long long mod2 = 998244353; ...

#include <bits/stdc++.h> int a, b, k; int main() { scanf( %d%d%d , &b, &a, &k); if (b + k < a) { printf( %.12f n , 0.0f); return 0; } double ans = 1; for (int i = 0; i <= k; i++) { ans *= (a - i); ans /= (b + 1 + i); } ans = 1 - ans; printf( %.12f n , ans); ...

#include <bits/stdc++.h> using namespace std; const int SZ = (int)3e7 + 10; int cnt[SZ]; int n[3], t[3], sum[3]; int main() { int k; cin >> k; for (int i = 0; i < 3; i++) cin >> n[i]; for (int i = 0; i < 3; i++) cin >> t[i]; for (int i = 0; i < 3; i++) sum[i] = 0; for (int tme = 0;; tm...

#include <bits/stdc++.h> using namespace std; long long n, k; long double ans, eps = 1e-10, l, v1, v2; bool solve(long double mid) { int x = (n + k - 1) / k; long double tl = mid, pos = l; while (x--) { if (tl < 0) return 0; long double trav = (v2 * v1 * tl - v2 * pos) / (v1 - v2); ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 3010; const int MOD = 1000000007; int n, m; long long f[MAXN][MAXN], ans1, ans2, ans3, ans4; char a[MAXN][MAXN]; int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) scanf( %s , a[i] + 1); if (a[1][2] == . ) f[1][2] = ...

#include <bits/stdc++.h> using namespace std; int a[212345], s1[212345], s2[212345], pos1[212345], pos2[212345], n; vector<pair<int, int> > res; int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= n; i++) { s1[i] = s1[i - 1] + (a[i] == 1); s2[i] = s2[i -...

#include <bits/stdc++.h> using namespace std; int main() { long long int n; cin >> n; long long d = 0; for (int i = 9; n > 0; i *= 10) { d += n; n -= i; } cout << d << endl; }

#include <bits/stdc++.h> using namespace std; namespace FGF { const int N = 1e5 + 5, mo = 1e9 + 7, inv2 = (mo + 1) / 2; int a[N], b[N], pre[N], lst[N], nxt[N], sum[N << 2][4], ta[N << 2][2], n, st[N], tp, mi[N], mx[N], ans, cnt[N]; void pushtag(int ro, int l, int r, int x, int o) { sum[ro][3] = 1ll ...

#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const double PI = 3.14159265; const double E = 2.718281828459; const double EPS = 1e-8; const int M = 2e5 + 5; long long n, A; long long a[M]; int main() { while (~scanf( %I64d %I64d , &n, &A)) { long long sumb = 0; ...

#include <bits/stdc++.h> using namespace std; struct Node { int v; int id; } node[110]; int t[110]; bool cmp(Node x, Node y) { return x.v > y.v; } int main() { int n, w; cin.sync_with_stdio(false); while (cin >> n >> w) { for (int i = 0; i < n; i++) { cin >> node[i].v; ...

#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 2; int n; struct Node { int l, r; }; Node a[maxn]; bool cmp(Node x, Node y) { if (x.r == y.r) return x.l < y.l; return x.r < y.r; } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { int x, w; ...

#include <bits/stdc++.h> using namespace std; unsigned int dp[100100]; char s[100100]; int main() { unsigned int n; cin >> n; if (n & 1) { return !printf( 0 ); } scanf( %s , s + 1); int m = n / 2; dp[0] = 1; for (int i = 1; i <= n; i++) { if (s[i] == ? ) { fo...

#include <bits/stdc++.h> using namespace std; int modInverse(int a, int m); int gcd(int a, int b); int power(int x, unsigned int y, unsigned int m); void pairsort(int a[], int b[], int n); int logint(int x, int y); int gcd(int a, int b) { if (a == 0) return b; return gcd(b % a, a); } int power...

#include <bits/stdc++.h> using namespace std; int visit[210000]; int ans[210000]; queue<int> q; int a[210000]; int n; vector<int> g[210000]; int main() { int n; cin >> n; for (int i = 1; i <= n; i++) scanf( %d , &a[i]); for (int i = 1; i <= n; i++) { if (a[i] & 1) { q.push(...

#include <bits/stdc++.h> using namespace std; const int P = 998244353, INF = 0x3f3f3f3f; long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } long long qpow(long long a, long long n) { long long r = 1 % P; for (a %= P; n; a = a * a % P, n >>= 1) if (n & 1) r = r * a % P; r...

#include <bits/stdc++.h> using namespace std; inline int read() { int num = 0; char c = getchar(); if (c == - ) return -read(); while (c >= 0 && c <= 9 ) { num = (num << 3) + (num << 1) + c - 0 ; c = getchar(); } return num; } inline long long READ() { long long num ...

#include <bits/stdc++.h> using namespace std; long long num[505]; int n; long long minval = 0x3f3f3f3f3f3f3f3fll; long long check(int x) { long long ans = 0; for (int i = 1; i <= n; i++) { if (num[i] % x == 0) { ans += num[i] / x; } else { if (num[i] % x + num[i] / x >= x -...

#include <bits/stdc++.h> using namespace std; double tick() { static clock_t oldt, newt = clock(); double diff = 1.0 * (newt - oldt) / CLOCKS_PER_SEC; oldt = newt; return diff; } inline long long int read() { long long int f = 1, x = 0; char ch = getchar(); while (ch < 0 || ch > 9...

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

#include<bits/stdc++.h> typedef int LL; typedef double dl; #define opt operator #define pb push_back #define pii std::pair<LL,LL> const LL maxn=2e4+9,mod=998244353,inf=0x3f3f3f3f; LL Read(){ LL 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 a[1001]; long long b[2001]; int main() { long long n, k, p; cin >> n >> k >> p; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= k; i++) cin >> b[i]; sort(a + 1, a + n + 1); sort(b + 1, b + k + 1); long long ans = ...

#include <bits/stdc++.h> using namespace std; int main() { int s1, s2, t1, t2; char ch1, ch2; cin >> s1 >> ch1 >> s2; cin >> t1 >> ch2 >> t2; int a = s1 - t1; int b = s2 - t2; if (b < 0) { b += 60; a--; } if (a < 0) { a += 24; } cout << right << setw(2) ...

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

#include <bits/stdc++.h> using namespace std; const int N = 1000000 + 5; vector<int> g[N]; bool used[N]; int n, m; int main() { scanf( %d %d , &n, &m); for (int i = 0; i < m; i++) { int u, v; scanf( %d %d , &u, &v); u--, v--; g[u].push_back(v); } for (int i = 0; i < n...

#include <bits/stdc++.h> using namespace std; const int maxN = 500 + 5; const int maxM = 100000 + 5; inline long long read() { long long sum = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { ...

#include <bits/stdc++.h> int main() { long int n, s, sum = 0, z, count = 0; scanf( %ld%ld , &n, &s); z = s; do { if (s >= n) { sum = sum + (s / n) * n; count = count + (s / n); s = s - (s / n) * n; } else n = n - 1; } while (s != 0 && n != 0); printf...

#include <bits/stdc++.h> const double EPS = 0.00000001; int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(nullptr); int32_t t; std::cin >> t; for (int32_t cs = 1; cs <= t; cs++) { int32_t n, l; std::cin >> n >> l; std::vector<int32_t> a(n); for (auto &x : a...

#include <bits/stdc++.h> using namespace std; void solve() {} const long long maxn = 1050; long long n, a, b; long long ans[maxn][maxn]; void no() { cout << NO << n ; exit(0); } signed main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> a >> b; if (min(a, b) > 1) no(); ...

#include <bits/stdc++.h> using namespace std; int main() { int i, n; int a, b, c; int sum_a, sum_b, sum_c; sum_a = 0; sum_b = 0; sum_c = 0; cin >> n; for (i = 1; i <= n; i++) { cin >> a >> b >> c; sum_a = sum_a + a; sum_b = sum_b + b; sum_c = sum_c + c; } ...

#include <bits/stdc++.h> using namespace std; long long dp[1001][2 * 1001][2]; long long MOD = 998244353; int main() { ios_base::sync_with_stdio(false); int n, k; cin >> n >> k; dp[1][1][0] = 2; dp[1][2][0] = 0; dp[1][1][1] = 0; dp[1][2][1] = 2; for (int i = 2; i <= n; ++i) { ...

#include <bits/stdc++.h> using namespace std; const double PI = 2.0 * acos(0.0); const double eps = 1e-6; const long long _mod = 1000000007LL; const int save[10][4] = {{0}, {0}, {6, 2, 4, 8}, {1, 3, 9, 7}, {6, 4}, {0}, {0}, {1, 7, 9, 3}, {6, 8, 4, 2}, {1, 9}}; int todigit(char c) ...

#include <bits/stdc++.h> using namespace std; int n, mem[505][505]; string s; int dp(int i, int j) { if (i > j) return 0; int &ans = mem[i][j]; if (ans != -1) return ans; ans = dp(i + 1, j) + 1; for (int k = i + 1; k <= j; k++) if (s[i] == s[k]) ans = min(ans, dp(i + 1, k - 1) + dp(k, ...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n][2]; for (int i = 0; i < n; i++) { cin >> a[i][0] >> a[i][1]; } int sum1 = 0; int sum2 = 0; for (int i = 0; i < n; i++) { if (abs(sum1 + a[i][0] - sum2) <= 500) { sum1 += a[i][0]; ...

#include <bits/stdc++.h> using namespace std; int main() { int t, j; cin >> t; for (j = 0; j <= t - 1; j++) { int a, b, c, n; cin >> a >> b >> n; n = n % 3; c = a ^ b; if (n == 0) { cout << a << endl; } else if (n == 1) { cout << b << endl; } els...

#include <bits/stdc++.h> char _; using namespace std; int N, C, D; pair<int, int> A[400000]; long long Z, ZO, ZOZ, O, OZ, OZO; inline bool cmp(const pair<int, int>& a, const pair<int, int>& b) { if ((b.second < 0) ^ (a.second < 0)) return 1LL * a.first * b.second > 1LL * b.first * a.second; re...

#include <bits/stdc++.h> using namespace std; const int INF = 0x3F3F3F3F; const int NEGINF = 0xC0C0C0C0; const double EPS = 1e-8; int cmp(double x, double y = 0, double tol = EPS) { return (x <= y + tol) ? (x + tol < y) ? -1 : 0 : 1; } string s; bool test(long long inx) { int pos = 0; int m ...

#include <bits/stdc++.h> using namespace std; int a[500005]; int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); int kk = 1; sort(a + 1, a + n + 1); for (int i = 1; i <= n; i++) { if (a[i] >= a[kk] * 2) { ++kk; } } --kk; kk ...

#include <bits/stdc++.h> using namespace std; const int maxn = 200005; int now[30]; char s[maxn]; int num[maxn]; int main() { int n; scanf( %d , &n); scanf( %s , s + 1); int ans = 0; for (int i = 1; i <= n; i++) { for (int j = 1; j <= 30; j++) { if (s[i] >= now[j]) { ...

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

#include <bits/stdc++.h> using namespace std; const int N = 305; long long dist[10][N][N], I[2][N][N]; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m; cin >> n >> m; for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) { if (i != j) dist[0][i][...

#include <bits/stdc++.h> using namespace std; const int maxn = 200025; int n, m, i, j, t, k, s, mod, a[maxn], fat[maxn]; bool flg, vis[maxn << 1]; inline int Pow(int x, int y, int mo) { int ret = 1; while (y) { if (y & 1) ret = 1ll * ret * x % mo; x = 1ll * x * x % mo; y >>= 1; }...

#include <bits/stdc++.h> using namespace std; char mainstr[111111]; char substr1[111]; char substr2[111]; int main() { while (scanf( %s %s %s , mainstr, substr1, substr2) != EOF) { bool flag1 = false, flag2 = false; int len = strlen(mainstr); int len1 = strlen(substr1); int len2 = ...

#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; const double pi = acos(-1); long long n; string str; int main() { cin >> n >> str; sort(str.begin(), str.end()); cout << str << endl; return 0; }

#include <bits/stdc++.h> using namespace std; const int N = 1000 * 100 + 10, LG = 20; int n, h[N], st[N], en[N], par[N][LG], seg[N << 2], lazy[N << 2], TM, ver[N], ans[N]; vector<int> adj[N]; struct Query { int l, r, id; Query(int x = 0, int y = 0, int z = 0) { l = x, r = y, id = z; } }; vec...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int tt; cin >> tt; while (tt--) { int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; ++i) { cin >> a[i]; } int ans = 0; function<void(int, ...

#include <bits/stdc++.h> using namespace std; void print(vector<int> v) { for (int i = 0; i < v.size(); i++) { if (v[i] != 0) { cout << v[i]; } } cout << endl; } void solve(vector<int>& v, int even, int odd) { if (v.size() == 1) { cout << -1 << endl; return; }...

#include <bits/stdc++.h> using std::max; using std::min; const int inf = 0x3f3f3f3f, Inf = 0x7fffffff; const long long INF = 0x3f3f3f3f3f3f3f3f; std::mt19937 rnd(std::chrono::steady_clock::now().time_since_epoch().count()); template <typename _Tp> _Tp gcd(const _Tp &a, const _Tp &b) { return (!b) ? a ...

#include <bits/stdc++.h> const long long N = 200200; const long long Q = 100100; const long long mod = 998244353; const long long block = 500; using namespace std; string s; int cnt; bool t; void solve() { cin >> s; for (int i = 0; i < s.size(); i++) { if (s[i] == 1 ) { t = 1; ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 100005; int N; int a[MAXN]; vector<int> lol; int main(int argc, char *argv[]) { scanf( %d , &N); int p = 1; while (p < MAXN) { lol.push_back(p); p <<= 1; } for (int i = 0, _i = N; i < _i; ++i) { scanf( %d , ...

#include <bits/stdc++.h> using namespace std; void display(vector<int> &a) { for (int z : a) cout << z << ; cout << endl; } int dx[4] = {0, 0, 1, -1}; int dy[4] = {1, -1, 0, 0}; const int mod = 998244353; const long long INF64 = 3e18; void smxl(long long &a, long long b) { if (a < b) a = ...

#include <bits/stdc++.h> using namespace std; long long cap[200005]; int n, m; inline long long tri(int n) { return n * (n + 1LL) / 2; } inline long long arithsum(int a, int d, int n) { long long ret = a * (long long)n; ret += tri(n - 1) * d; return ret; } int main() { scanf( %d%d , &n, &m...

#include <bits/stdc++.h> using namespace std; int main() { int t, s, x; cin >> t >> s >> x; int tmp = x - t; if ((tmp % s == 0 || tmp % s == 1) && tmp >= 0 && tmp != 1) cout << YES ; else cout << NO ; return 0; }

#include <bits/stdc++.h> using namespace std; int mod = 1e9 + 7; struct edge { int v, next; }; int ans, ans2, f[1005][1 << 12]; int Pow(int a, int b) { int rec = 1; for (; b; b >>= 1, a = 1ll * a * a % mod) if (b & 1) rec = 1ll * rec * a % mod; return rec; } struct nade { int h...

#include <bits/stdc++.h> using namespace std; using LL = long long; using pii = pair<int, int>; const int mod = 998244353; const int inf = 0x3f3f3f3f; const int N = 2e5 + 10; int n, m, a[N]; LL sum[N], fac[N], rev[N]; LL pow_mod(LL x, int p) { LL s = 1; while (p) { if (p & 1) s = s * x %...

#include <bits/stdc++.h> using namespace std; int main() { int input; vector<int> ret; cin >> input; for (int i = 1; i < input; i += 2) { ret.push_back(i + 1); ret.push_back(i); } if (ret.empty() || ret.size() != input) ret = {-1}; for (auto &d : ret) { cout << d << ...

#include <bits/stdc++.h> using namespace std; int n; double ans[1024 * 1024], l, r, x[20], y[20], a[20], cosA[20], sinA[20], maxi; int main() { scanf( %d %lf %lf , &n, &l, &r); maxi = l; for (int i = 0; i < n; i++) { scanf( %lf %lf %lf , &x[i], &y[i], &a[i]); cosA[i] = cos(a[i] * 3.14159...

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

#include <bits/stdc++.h> using namespace std; bool ok(int a, int b) { int c = 0; for (int i = 0; i < 4; i++) { if ((a % 10) != (b % 10)) c++; if (c > 1) return false; a /= 10; b /= 10; } return true; } int getlow(int a, int m) { for (int i = m; i <= 2011; i++) i...

#include <bits/stdc++.h> using namespace std; inline void read(register int *n) { register char c; *n = 0; do { c = getchar(); } while (c < 0 || c > 9 ); do { *n = c - 0 + *n * 10; c = getchar(); } while (c >= 0 && c <= 9 ); } long long C[2048][2048], fac[100000...