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

func_code_string stringlengths 59 71.4k
#include <bits/stdc++.h> #define N 410 #define ll long long #define ull unsigned long long //#define mo (ll)((ll)1e9+7) #define squ(x) ((x)*(x)) #define db double #define all(x) x.begin(),x.end() #define cmax(a,b) a=max(a,b) #define cmin(a,b) a=min(a,b) #define rep(i,l,r) for(register int i=l;i<=r;+...
#include <bits/stdc++.h> using namespace std; int a[20]; int main() { int n, b[20]; cin >> n; for (int i = 0; i < n; i++) cin >> b[i]; int kol = 1; for (int i = 0; i < n; i++) kol *= 2; for (int i = 0; i < kol; i++) { int sum = 0; a[n - 1]++; for (int j = n - 1; j > 0; j-...
#include <bits/stdc++.h> using namespace std; const int N = (int)500; const int linf = (int)1e9 + 7; const int mod = (int)1e9 + 7; const int sN = (int)27000; inline void ioi2020() {} using ll = long long; using ld = long double; using ull = unsigned long long; ll n, m, k; ll a[N]; ll dp[(1 << 20...
#include <bits/stdc++.h> using namespace std; const int MAXP = 1e5; long long int n, s, p, q, x, sell[MAXP + 5] = {0}, buy[MAXP + 5] = {0}; char d; vector<pair<long long int, long long int> > ansell; int main() { cin >> n >> s; for (int i = 0; i < n; i++) { cin >> d >> p >> q; if (d == ...
#include <bits/stdc++.h> using namespace std; int tm[100005]; int gcd(int a, int b) { int r; while (b > 0) { r = a % b; a = b; b = r; } return a; } int main() { int n, i, j, tt, m; scanf( %d , &n); scanf( %d , &tm[1]); for (i = 2; i <= n; i++) { scanf( %...
#include <bits/stdc++.h> using namespace std; int main() { int n; string ans = no ; cin >> n; vector<int> lineas(n); for (int i = 0; i < n; i++) { int a; cin >> a; lineas[i] = a; } int minimo; int maximo; for (int i = 0; i < n - 1; i++) { minimo = min(lin...
#include <bits/stdc++.h> using namespace std; long long Pos[1 << (24)], dp[1 << (24)]; int a, b; int main() { int n; cin >> n; for (int i = 0; i < n; ++i) { cin >> Pos[1 << i]; } int m; cin >> m; if (m) cin >> a, m--; if (m) cin >> b, m--; int upper = 1 << n; dp[0] ...
#include <bits/stdc++.h> using namespace std; int main() { int i, j, k, n; cin >> n; k = n / 2; for (i = 1; i <= n; i++) { cout << (i - 1) * k + 1; for (j = (i - 1) * k + 2; j <= i * k; j++) cout << << j; for (j = n * n - (i - 1) * k; j > n * n - i * k; j--) cout << << j; ...
#include <bits/stdc++.h> using namespace std; const int ppr = 257; const long long INF = 2e18; const int inf = 2e9; const int mod = 1e9 + 7; const int N = 1e6 + 123; const long double pi = 3.141592653589793238462643; const int dx[] = {1, 0, -1, 0}; const int dy[] = {0, 1, 0, -1}; int n, dp[55][55][5...
#include <bits/stdc++.h> using namespace std; long long int n; int main() { cin >> n; long long int summ = n + (n - 1); long long int wei = 0; while (summ != 0) { summ /= 10; wei++; } long long int stdl = 9; for (int i = 1; i < wei; i++) { stdl = stdl * 10 + 9; } ...
#include <bits/stdc++.h> using namespace std; using ll = long long; int const N = 100 * 1000 + 16; int const M = 1000 * 1000 * 1000 + 7; int n, k; int a[N]; int c[N]; ll e, v[N]; vector<int> idx[N]; struct wavelet { int L, R; vector<int> b; wavelet* l = 0; wavelet* r = 0; wavelet...
#include <bits/stdc++.h> using namespace std; template <class c> struct rge { c b, e; }; template <class c> rge<c> range(c i, c j) { return rge<c>{i, j}; } template <class c> auto dud(c* x) -> decltype(cerr << *x, 0); template <class c> char dud(...); struct debug { template <class c...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e6 + 7; const int MOD = 1e9 + 7; vector<int> Gimp[MAXN]; vector<int> Gcrew[MAXN]; vector<int> G[MAXN]; int comp[MAXN]; int compSize[MAXN]; bool vis[MAXN]; bool col[MAXN]; bool ans; int res; int allSize; void DFScomp(int v, int n...
#include <bits/stdc++.h> using namespace std; int main() { long long int n, k; cin >> n; cin >> k; if (n % 2 == 0) { if (k <= (n / 2)) cout << 2 * (k - 1) + 1; else { k = k - (n / 2); cout << 2 * k; } } else { if (k <= (n + 1) / 2) cout << ...
#include <bits/stdc++.h> using ll = long long; using namespace std; int main() { cin.tie(0); cin.sync_with_stdio(0); int n, r; cin >> n >> r; double R = -r / (sin(acos(-1) / n) - 1); double ans = R - r; cout << fixed << setprecision(10) << ans; }
#include <bits/stdc++.h> using namespace std; long long t, d, ct, q, ans, l, m, r, n, mx, mn, i, j, k, x, y, z, s; char ch; string ss = , str = ; map<pair<long long, long long>, long long> mp; set<long long> st; long long a[300003], b[300003]; vector<pair<long long, long long>> v; bool ask(long lo...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); string sub, inp = ; while (cin >> sub) { inp += sub; } string s = ; for (int i = 0; i < (int)inp.size(); ++i) { if (inp[i] == a ) { inp[i - 2] == / ? s +...
#include <bits/stdc++.h> using namespace std; const int maxn = 5e5 + 5, Mod = 1e9 + 7; struct Edge { int nxt, to; } e[maxn << 1]; int hd[maxn], e_cnt = 1; void add(int u, int v) { e[++e_cnt] = (Edge){hd[u], v}; hd[u] = e_cnt; } int n, pre[maxn << 2], nxt[maxn << 2], p[maxn], dep[maxn], fac[m...
#include <bits/stdc++.h> using namespace std; int read() { char ch = getchar(); int x, f = 1; while (ch < 0 \|\| ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } x = ch - 0 ; while (1) { ch = getchar(); if (ch < 0 \|\| ch > 9 ) break; x = x * 10 + ch - 0 ...
#include <bits/stdc++.h> using namespace std; void __print(long long x) { cerr << x; } void __print(unsigned x) { cerr << x; } void __print(unsigned long x) { cerr << x; } void __print(unsigned long long x) { cerr << x; } void __print(float x) { cerr << x; } void __print(double x) { cerr << x; } void __...
#include <bits/stdc++.h> using namespace std; void solve() { long long i, j, k, l, n, m, a, b, u; cin >> n; vector<pair<string, pair<long long, long long>>> v(n); for (i = 0; i < n; i++) { cin >> v[i].first >> v[i].second.first >> v[i].second.second; } long long ans = 0; for (i = 1...
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int n = s.size(); int i = 0; while (i < n and s[i] == a ) i++; int j = i + 1; while (j < n and s[j] != a ) j++; if (i == n) s[n - 1] = z ; else for (int k = i; k < j; k++) s[k] = (s[k] -...
#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; long long POW(long long a, long long b, long long MMM = MOD) { long long ret = 1; for (; b; b >>= 1, a = (a * a) % MMM) if (b & 1) ret = (ret * a) % MMM; return ret; } long long gcd(long long a, long long b) { return b...
#include <bits/stdc++.h> using namespace std; void swap(int &a, int &b) { a = a ^ b; b = a ^ b; a = a ^ b; return; } void get_output(int arr[], int n) { int flag = 1; while (flag) { flag = 0; for (int i = 0; i < n - 1; i++) { if (arr[i] > arr[i + 1]) { swap(...
#include <bits/stdc++.h> using namespace std; const int INF = ~(1 << 31); const int N = 200000; int n; char s[N + 1]; char t[N + 1]; int suffix_array[N + 1]; int *eq; int lcp[N + 1]; vector<pair<int, int> > lcp_; inline int add(int a, int b, int md) { a += b; if (a >= md) a -= md; retu...
#include <bits/stdc++.h> using namespace std; inline int read() { int x, f = 1; char c; while ((c = getchar()) < 0 \|\| c > 9 ) if (c == - ) f = 0; for (x = c - 0 ; (c = getchar()) >= 0 && c <= 9 ;) x = x * 10 + c - 0 ; return f ? x : -x; } struct vec { int x, y; } v[10 + ...
#include <bits/stdc++.h> const int N_MAX = 600007; std::map<std::pair<int, int>, int> ext; long long ans[N_MAX], now; int fa[N_MAX], siz[N_MAX][2], top; std::pair<int, int> stk[N_MAX]; int find(int x) { while (fa[x] != x) x = fa[x]; return x; } void merge(std::pair<int, int> v) { int x = fin...
#include <bits/stdc++.h> using namespace std; int prv[100010], nxt[100010]; int main() { int n, k; string s; cin >> n >> k; cin >> s; int closest = -1; for (int i = 0; i < s.length(); ++i) { if (s[i] == 0 ) { closest = i; } prv[i] = closest; } closest = n...
#include <bits/stdc++.h> using namespace std; const int N = 100100; long long arr[N]; int main() { long long n, k; cin >> n >> k; for (int i = 0; i < n; ++i) cin >> arr[i]; sort(arr, arr + n); --k; int x = 0, y = 0; for (int i = 0; i < n; ++i) { if (arr[i] < arr[k / n]) x++; ...
#include <bits/stdc++.h> using namespace std; int main() { int n, m; char c, res[2] = { W , B }; cin >> n >> m; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> c; if (c == - ) cout << c; else cout << res[((i % 2) + (j % 2)) % 2];...
#include <iostream> #include <algorithm> #include <string> using namespace std; int main() { int t, n; string s, b = trygub ; cin >> t; while (t--) { int k = 0; cin >> n >> s; sort(s.begin(), s.end()); cout << s << endl; } }
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5, base = 2333, mod = 20030731; int n, m, a[N], b[N], pw[N], h1[N], h2[N], ans[N]; void init() { pw[0] = 1; for (int i = (1); i <= (n - 1); i++) pw[i] = (long long)base * pw[i - 1] % mod, h1[i] = (((long long)h1[i - 1] * base ...
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) #pragma GCC optimize( Ofast ) #pragma GCC target( avx,avx2,fma ) #pragma GCC optimization( unroll-loops ) using namespace std; long long max3(long long x, long long y, long long z) { return max(max(x, y), z); } long long min3(long long x, long long...
#include <bits/stdc++.h> using namespace std; long long front[1000001], back[1000001], vt[1000001]; int main() { long long k, sz, ko = 0, j = 0, kq = 0; string s; cin >> k >> s; sz = s.size(); s = + s; for (long long i = 1; i <= sz + 1; i++) { front[i] = ko; if (s[i] == 0 ...
#include <bits/stdc++.h> using namespace std; vector<double> p; double g; int n; int main() { cin >> n; p.resize(n + 1); for (int i = 0; i <= n; i++) cin >> p[i]; g = p[n / 2]; for (int i = 0; i <= (n - 1) / 2; i++) for (int j = n - (n - 1) / 2; j <= n; j++) g = max(g, (p[i] ...
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { if (!a) return b; return gcd(b % a, a); } long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); } const long long MAX = 1e6 + 2047; const long long mod = 1e9 + 7; const long long MAX_2 = 1009; ...
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); if (n == 1) { cout << 0 << endl; return 0; } int a[n + 2], cnt = n - 1; for (int i = 2; i <= n; i++) { a[i] = i; } for (int i = 2; i < n; i++) { for (int j = i + 1; j <= n; j++)...
#include <bits/stdc++.h> using namespace std; char s[100100]; char s1[100100]; int res[5]; vector<int> zeros, ones; int n; int was[100100]; int model() { memset(was, 0, sizeof(was)); for (int i = (0); i < (n); ++i) if (s[i] == 0 ) zeros.push_back(i); else ones.push_b...
#include <bits/stdc++.h> int main() { int n, min = 0, k; scanf( %d , &n); for (int i = 1; i < 200; i++) { k = (pow(2, i) - 1) * pow(2, i - 1); if (k > n) { printf( %d , min); break; } else if ((n % k) == 0) { min = k; } } return 0; }
#include <bits/stdc++.h> using namespace std; long long int input(long long int n, vector<long long int> &ve); long long int input(long long int n, vector<long long int> &ve) { long long int val; for (long long int i = 0; i < n; i++) { cin >> val; ve.push_back(val); } return 0; } i...
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; string h, v; cin >> h >> v; bool flag = true; if (h[0] == > && v[0] == v ) flag = false; if (h[0] == < && v[m - 1] == v ) flag = false; if (h[n - 1] == > && v[0] == ^ ) flag = false; if (...
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:255000000 ) bool firstout = 1; template <class T> T &minn(T &a, T b) { if (b < a) a = b; return a; } template <class T> T &maxx(T &a, T b) { if (a < b) a = b; return a; } int &madd(int &a, int b) { a +=...
#include <bits/stdc++.h> using namespace std; map<int, bool> g; struct node { int x, y, z, num; } ans[3000]; int a[60], sum[60], vis[60], flag, n, final, k; int main() { int i, t = 0, s, j, num = 0, tt; flag = 0; final = 0; scanf( %d%d , &n, &k); g.clear(); for (i = 1; i <= n; i+...
#include <bits/stdc++.h> using namespace std; const int P = 1e9 + 7, 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; ret...
#include <bits/stdc++.h> using namespace std; const int MAXN = 100000; class Interval { public: int s, e, i; } interval[MAXN + 5]; bool cmp_input(const Interval &a, const Interval &b) { return a.i < b.i; } bool cmp_interval(const Interval &a, const Interval &b) { if (a.s != b.s) return a.s < b.s;...
#include <bits/stdc++.h> using namespace std; int main() { string s; string s2; cin >> s >> s2; transform(s.begin(), s.end(), s.begin(), ::tolower); transform(s2.begin(), s2.end(), s2.begin(), ::tolower); if (s == s2) { printf( 0 n ); } else if (s < s2) { printf( -1 n ); ...
#include <bits/stdc++.h> using namespace std; bool comp(pair<int, int> a, pair<int, int> b) { return a.second > b.second; } int main() { int n, m; cin >> n >> m; vector<pair<int, int>> a; for (int i = 0; i < m; i++) { int q, w; cin >> q >> w; a.push_back(make_pair(q, w)); } ...
#include <bits/stdc++.h> using namespace std; void solve() { int N; char in[120]; scanf( %d%s , &N, in); int len = strlen(in); int flag = 0; for (int i = 0; i < len; i++) { for (int d = 1; d < len; d++) { if (i + 4 * d >= len) break; if (in[i] == * && in[i + d] == * ...
#include <bits/stdc++.h> using namespace std; int n; int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); } int main() { scanf( %d , &n); if (n == 1) { printf( 0 n0 n0 n ); return 0; } for (int t = 1; t <= n - 1; t++) if (gcd(t, n) == 1 && gcd(t + 1, n) == 1) { fo...
#include <bits/stdc++.h> using namespace std; const int INF = 2147483647; const double PI = 3.141592653589793; const double eps = 1e-6; int n, r, R; double x; int main() { scanf( %d %d %d , &n, &R, &r); if (n == 1) { if (r <= R) printf( YES n ); else printf( NO n ); ...
#include <bits/stdc++.h> using namespace std; const int MAXN = (int)5e3 + 10; const int MOD = (int)1e9 + 7; long long dp[1111][1111]; int num[1111], k; int mark[1111]; long long dfs(int pos, int x, int flag) { if (pos == 0) return mark[x] == k - 1 && (x != 0); if (dp[pos][x] != -1 && !flag) { ...
#include <bits/stdc++.h> using namespace std; int A[(1 << 20) + 4], n; long long store[21][2], INV = 0; long long query(int l, int r, int no) { return (A + r + 1 - upper_bound(A + l, A + r + 1, no)); } void gen(int de, int l, int r) { if (!de) return; gen(de - 1, l, (l + r) / 2); gen(de - 1,...
#include <bits/stdc++.h> using namespace std; const int N = 100005; int n, m, k; int a[N]; int b[N]; int main() { cin >> n >> m >> k; for (int i = 0; i < n; ++i) cin >> a[i]; for (int i = 0; i < n - 1; ++i) { b[i] = a[i + 1] - a[i] - 1; } sort(b, b + n - 1); int kk = n; lon...
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; bool is_Prime(long long a) { for (long long i = 2; i * i <= a; ++i) if (a % i == 0) return false; return true; } bool cmp(pair<long long, long long> a, pair<long long, long long> b) { return (a.second < b.second); } lo...
#include <bits/stdc++.h> using namespace std; void smain(); int main() { ios_base::sync_with_stdio(0); cout.precision(7); cout << fixed; smain(); return 0; } long long d[100001], d2[100001], r[100001], s[100001], sz[100001], c[100001]; struct node { long long cnt, ps, pcnt; }; ma...
#include <bits/stdc++.h> using namespace std; const int mod = 998244353; long long int qpow(long long int x, long long int y) { long long int ans = 1; while (y) { if (y & 1) ans = ans * x % mod; x = x * x % mod; y >>= 1; } return ans; } const int maxn = 1024 * 2; long long ...
#include <bits/stdc++.h> using namespace std; struct Query { int l, r, x; Query(int l = 0, int r = 0, int x = 0) : l(l), r(r), x(x) {} }; struct node { int pref, suff, val; node(int pref = 0, int suff = 0, int val = 0) : pref(pref), suff(suff), val(val) {} }; int n, k; map<int, int...
#include <bits/stdc++.h> #define ll long long int #define ld long double #define NMAX 1009 using namespace std; ll mask; ll u,d,r,l; ll n; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); ll t; cin>>t; while(t--) { cin>>n>>u>>r>>d>>l; bool o...
#include <bits/stdc++.h> const int max_N = 1000 + 21; int n, a[max_N], b[max_N], cnt[max_N]; std::vector<int> vec, _vec, ret[max_N]; int main() { scanf( %d , &n); for (int i = 1; i < n; ++i) { scanf( %d%d , a + i, b + i); if (a[i] > b[i]) std::swap(a[i], b[i]); if (b[i] != n) return pu...
#include <bits/stdc++.h> char a[100050], b[100050]; int sa[100050], sb[100050], ta[100050], tb[100050], Q; int main() { scanf( %s%s , a + 1, b + 1); int la = strlen(a + 1), lb = strlen(b + 1); for (int i = 1; i <= la; i++) { if (a[i] == A ) sa[i] = sa[i - 1] + 1; sb[i] = sb[i - 1] + (a[i]...
#include <bits/stdc++.h> using namespace std; const int N = 123466; bool is[N]; vector<int> adj[N]; int dp[N]; int mx_dep[N]; const int inf = 1 << 22; pair<int, int> calc_dp(int v, int p) { int res = 0; int mx = -inf; if (is[v]) mx = 0; for (auto u : adj[v]) if (u != p) { a...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n]; for (int i = 0; i < n; ++i) cin >> a[i]; int dp[n][n]; memset(dp, 0, sizeof dp); int s = 0; for (int i = 0; i < n; ++i) { for (int j = i - 1; j >= 0; --j) if (a[j] > a[i]) dp...
#include <bits/stdc++.h> using namespace std; FILE* g_f_; int g_s_; char* g_g_; template <class _T> inline _T sqr(const _T& x) { return x * x; } template <class _T> inline string tostr(const _T& a) { ostringstream os( ); os << a; return os.str(); } const long double PI = 3.1415926...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; bool b1[N]; int Z, num[N], in[N], dp[N][20], dep[N], freq[2][N], f[N]; long long fans[N]; vector<int> g[N], v; map<int, int> mp; struct qq { int in, l, r, c; qq(int a, int b, int e, int d) { in = a, l = b, r = e, c = d; } b...
#include <bits/stdc++.h> using namespace std; int main() { long long n, s = 0, x, m = 0; cin >> n; for (int i = 1; i <= n; i++) { cin >> x; s += x; m = max(m, x); } long long t = s / (n - 1); if (s % (n - 1)) t++; cout << max(m, t); }
#include <bits/stdc++.h> using namespace std; long long dp[5000010], f[5000010]; int main() { long long t, l, r, i, j, a, b, mod, ans, k = 1, final = 0; mod = 1e9 + 7; scanf( %lld %lld %lld , &t, &l, &r); for (i = 2; i <= r; i++) { if (dp[i] == 0) { for (j = i; j <= r; j += i) ...
#include <bits/stdc++.h> using namespace std; inline int read() { register char c = ; register int v = 0, x = 1; while ((c < 0 ) \|\| (c > 9 )) { if (c == - ) x = -1; c = getchar(); } while ((c >= 0 ) && (c <= 9 )) { v = (v << 1) + (v << 3) + (c ^ 48); c = getchar()...
#include <bits/stdc++.h> using namespace std; int n, m = 3, l, c[20000]; char s[500]; int main() { cin >> n; while (c[m] <= n) m++, c[m] = (long long)m * (m - 1) * (m - 2) * (m - 3) / 24; for (int i = m - 1; i >= 1; i--) { while (c[i] >= 1 && n >= c[i]) { s[++l] = a ; n -= c[i...
#include <bits/stdc++.h> using namespace std; int px[4000010]; int py[4000010]; char c[2010][2010]; int n, m; bool pd(int x, int y, int d) { if (x < 0 \|\| y < 0 \|\| x + d >= n \|\| y + d >= m) return false; for (int t = 1; t <= px[0]; t++) if ((px[t] != x) && (px[t] != x + d) && (py[t] != y) && (p...
#include <bits/stdc++.h> using namespace std; char Ma[4105]; int Mp[4105]; void Manacher(char s[], int len) { int l = 0; Ma[l++] = $ ; Ma[l++] = # ; for (int i = 0; i < len; i++) { Ma[l++] = s[i]; Ma[l++] = # ; } Ma[l] = 0; int mx = 0, id = 0; for (int i = 0; i < l...
#include <bits/stdc++.h> using namespace std; const int dr[]{-1, -1, 0, 1, 1, 1, 0, -1}; const int dc[]{0, 1, 1, 1, 0, -1, -1, -1}; void run() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } const int sqrtQ = 150; struct suffix_automaton { struct state { int len, link...
#include <bits/stdc++.h> using namespace std; template <class T> void _R(T &x) { cin >> x; } void _R(int &x) { scanf( %d , &x); } void _R(int64_t &x) { scanf( %lld , &x); } void _R(double &x) { scanf( %lf , &x); } void _R(char &x) { scanf( %c , &x); } void _R(char *x) { scanf( %s , x); } void R...
#include <bits/stdc++.h> int c[1000001]; char str[1000001]; int len; int ct; long long ans; int main() { int k; int i; scanf( %d , &k); scanf( %s , str); len = strlen(str); if (k == 0) { for (i = 0; i < len; i++) { if (str[i] == 0 ) ct++; else { ...
#include <bits/stdc++.h> using namespace std; const long long INF = 100000000; const long long MAXN = 20100; int n, a[MAXN], ans; int main() { ans = -INF; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; } for (int k = 1; k <= n; k++) { if (n % k == 0) { for (int j...
#include <bits/stdc++.h> using namespace std; const int N = 50; struct matrix { double m[N + 5][N + 5]; friend matrix operator*(const matrix &A, const matrix &B) { matrix C; for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) C.m[i][j] = 0; for (int i = 0; i < N; i++) ...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int a[51], n; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); int res = INT_MAX; for (int i = 1; i < n; i++) { res = min(res, a[i] - a[i - 1]); }...
#include <bits/stdc++.h> using namespace std; int q; long long a, b, n; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> q; while (q--) { cin >> a >> b >> n; if (a > b) swap(a, b); long long ans = 0; while (b <= n) { a += b; ...
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n; long long int a[45001] = {0}; if (n == 1 \|\| n == 2) cout << No << endl; else { cout << Yes << endl; cout << 1 << << n << endl; cout << n - 1; for (int i = 1; i <= n -...
#include <bits/stdc++.h> using namespace std; const int INF = 1000000007; const int N = 2020; struct trie { trie c[26]; int cnt; } root, nil; string s1, s2, s3; int n, l, r, f[N][N], ans; trie new_node() { trie *node = new (trie); for (int i = 0; i < 26; i++) node->c[i] = nil; n...
#include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; void solve(int tc) { int n; cin >> n; vector<vector<int>> adj(n, vector<int>(n)); for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { cin >> adj[i][j]; } } int k; ...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; ++i) cin >> a[i]; sort(a.begin(), a.end()); int ans = a.back() - a[0]; int eachCanRemove = (n - 2) / 2; for (int i = 0...
#include <bits/stdc++.h> using namespace std; int caseno = 1; typedef long long LL; typedef unsigned long long ULL; template <class T> inline void SWAP(T &a, T &b) { T t = a; a = b; b = t; } inline LL POW(LL base, LL power) { LL res = base; if (power == 0) return 1; for (int I = ...
#include <bits/stdc++.h> int n, m; int A[100005], B[100005], pass[100005]; int l; int main() { while (scanf( %d %d , &n, &m) != EOF) { int i, j; for (i = 1; i <= n; ++i) scanf( %d , &A[i]); int sum = 0; for (i = n; i >= 1; --i) { if (B[A[i]] == 0) { ++sum; ...
#include <bits/stdc++.h> using namespace std; int lower_case[26] = {0}, upper_case[26] = {0}; char buf[100010]; int main() { scanf( %s , buf); int len = strlen(buf); for (int i = 0; i < len; i++) { if (buf[i] <= Z ) upper_case[buf[i] - A ]++; else lower_case[buf[i] - a...
#include <bits/stdc++.h> using namespace std; long long pwr(long long base, long long p, long long mod = (1000000007LL)) { long long ans = 1; while (p) { if (p & 1) ans = (ans * base) % mod; base = (base * base) % mod; p /= 2; } return ans; } long long gcd(long long a, long lon...
#include <bits/stdc++.h> int n, K, F[3005][3005]; char s[3005][15], T[10][10] = { 1110111 , 0010010 , 1011101 , 1011011 , 0111010 , 1101011 , 1101111 , 1010010 , 1111111 , 1111011 }; int read() { char c = getchar(); int ans = 0; while (c < 0 \|\| c > 9 ) c = getchar(...
#include <bits/stdc++.h> using namespace std; using ll = long long; using ii = pair<int, int>; int main() { ios::sync_with_stdio(0); cin.tie(0); int q; cin >> q; for (int cas = 0; cas < q; ++cas) { ll a, b, m; cin >> a >> b >> m; if (a == b) { cout << 1 << << a ...
#include <bits/stdc++.h> using namespace std; long long max(long long a, long long 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 ma[101][101], yes[101]; int main...
#include <bits/stdc++.h> using namespace std; int n; char s[2000011]; int h1[2000011], h2[2000011], p1[2000011], p2[2000011], mod1 = 998244353, mod2 = 1000000007; int geth1(int L, int R) { return (h1[R] - h1[L - 1] * 1ll * p1[R - L + 1] % mod1 + mo...
#include <bits/stdc++.h> using namespace std; int main() { int M, N, x, a[400010], mini = 0; cin >> M >> N; memset(a, 0, sizeof(a)); for (int i = 1; i <= M; i++) { scanf( %d , &x); a[x % N]++; if (x % N != mini) printf( %d n , a[mini] * N + mini); else { if (i...
#include <bits/stdc++.h> using namespace std; long long read() { long long x = 0, f = 0; char c = getchar(); while (!isdigit(c)) f \|= c == - , c = getchar(); while (isdigit(c)) x = x * 10 + c - 0 , c = getchar(); return f ? -x : x; } inline int max(int a, int b, int c) { return max(a, max(...
#include <bits/stdc++.h> std::mt19937_64 rng( std::chrono::steady_clock::now().time_since_epoch().count()); long long int myRand(long long int R) { long long int val = rng() % R; assert(val >= 0); return val; } const long double PI = atan(1.0) * 4; const int32_t INF32 = 2e9 + 7; const int6...
#include <bits/stdc++.h> using namespace std; string a, b; int r = 0; int main() { getline(cin, a); getline(cin, b); int k = 0; while (a[k] == 0 ) k++; a = a.substr(k, a.size() - k); k = 0; while (b[k] == 0 ) k++; b = b.substr(k, b.size() - k); if (a.size() < b.size()) { ...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; char arr[n]; int sf = 0, fs = 0; for (int i = 0; i < n; i++) { cin >> arr[i]; } for (int j = 0; j < n - 1; j++) { if (arr[j] == S ) { if (arr[j + 1] == F ) sf++; } else if (arr[j] == ...
#include <bits/stdc++.h> using namespace std; const int N = 502; int n, m, l = -1, ok = 1, r; string s[N]; int main() { cin >> n >> m; for (int i = 0; i < n; i++) cin >> s[i]; for (int j = 0; j < n; j++) { l = r = -1; for (int i = 0; i < s[j].length(); i++) { if (l == -1 && s[j...
#include <bits/stdc++.h> using namespace std; int main() { string str; cin >> str; string s = WUB ; size_t pos = str.find(s); while (pos != string::npos) { string token = str.substr(0, pos); if (token.length() != 0) cout << token << ; str.erase(0, pos + 3); pos = str....
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7, M = 2e6 + 7, INF = INT_MAX / 10; long long powe(long long x, long long y) { x = x % mod, y = y % (mod - 1); long long ans = 1; while (y > 0) { if (y & 1) { ans = (1ll * x * ans) % mod; } y >>= 1; ...
#include <bits/stdc++.h> using namespace std; int n, m, ans = 1e9; int a[100005]; inline int read() { int x = 0, f = 1; char ch = getchar(); for (; ch < 0 \|\| ch > 9 ; ch = getchar()) if (ch == - ) f = -1; for (; ch >= 0 && ch <= 9 ; ch = getchar()) x = x * 10 + ch - 0 ; return ...
#include <bits/stdc++.h> const long long mod = (long long)1e9 + 7; using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long n, m; cin >> n >> m; vector<long long> v(m); bool valid = true; for (long long i = 0; i < m; i++) { ...
#include <bits/stdc++.h> using namespace std; int main() { int n, k; string out, chr; cin >> n >> k; for (int i = 0; i < k; ++i) chr += a + i; for (int i = 0; i < n; ++i) out += chr[i % k]; cout << out; return 0; }

#include <bits/stdc++.h> #define N 410 #define ll long long #define ull unsigned long long //#define mo (ll)((ll)1e9+7) #define squ(x) ((x)*(x)) #define db double #define all(x) x.begin(),x.end() #define cmax(a,b) a=max(a,b) #define cmin(a,b) a=min(a,b) #define rep(i,l,r) for(register int i=l;i<=r;+...

#include <bits/stdc++.h> using namespace std; int a[20]; int main() { int n, b[20]; cin >> n; for (int i = 0; i < n; i++) cin >> b[i]; int kol = 1; for (int i = 0; i < n; i++) kol *= 2; for (int i = 0; i < kol; i++) { int sum = 0; a[n - 1]++; for (int j = n - 1; j > 0; j-...

#include <bits/stdc++.h> using namespace std; const int N = (int)500; const int linf = (int)1e9 + 7; const int mod = (int)1e9 + 7; const int sN = (int)27000; inline void ioi2020() {} using ll = long long; using ld = long double; using ull = unsigned long long; ll n, m, k; ll a[N]; ll dp[(1 << 20...

#include <bits/stdc++.h> using namespace std; const int MAXP = 1e5; long long int n, s, p, q, x, sell[MAXP + 5] = {0}, buy[MAXP + 5] = {0}; char d; vector<pair<long long int, long long int> > ansell; int main() { cin >> n >> s; for (int i = 0; i < n; i++) { cin >> d >> p >> q; if (d == ...

#include <bits/stdc++.h> using namespace std; int tm[100005]; int gcd(int a, int b) { int r; while (b > 0) { r = a % b; a = b; b = r; } return a; } int main() { int n, i, j, tt, m; scanf( %d , &n); scanf( %d , &tm[1]); for (i = 2; i <= n; i++) { scanf( %...

#include <bits/stdc++.h> using namespace std; int main() { int n; string ans = no ; cin >> n; vector<int> lineas(n); for (int i = 0; i < n; i++) { int a; cin >> a; lineas[i] = a; } int minimo; int maximo; for (int i = 0; i < n - 1; i++) { minimo = min(lin...

#include <bits/stdc++.h> using namespace std; long long Pos[1 << (24)], dp[1 << (24)]; int a, b; int main() { int n; cin >> n; for (int i = 0; i < n; ++i) { cin >> Pos[1 << i]; } int m; cin >> m; if (m) cin >> a, m--; if (m) cin >> b, m--; int upper = 1 << n; dp[0] ...

#include <bits/stdc++.h> using namespace std; int main() { int i, j, k, n; cin >> n; k = n / 2; for (i = 1; i <= n; i++) { cout << (i - 1) * k + 1; for (j = (i - 1) * k + 2; j <= i * k; j++) cout << << j; for (j = n * n - (i - 1) * k; j > n * n - i * k; j--) cout << << j; ...

#include <bits/stdc++.h> using namespace std; const int ppr = 257; const long long INF = 2e18; const int inf = 2e9; const int mod = 1e9 + 7; const int N = 1e6 + 123; const long double pi = 3.141592653589793238462643; const int dx[] = {1, 0, -1, 0}; const int dy[] = {0, 1, 0, -1}; int n, dp[55][55][5...

#include <bits/stdc++.h> using namespace std; long long int n; int main() { cin >> n; long long int summ = n + (n - 1); long long int wei = 0; while (summ != 0) { summ /= 10; wei++; } long long int stdl = 9; for (int i = 1; i < wei; i++) { stdl = stdl * 10 + 9; } ...

#include <bits/stdc++.h> using namespace std; using ll = long long; int const N = 100 * 1000 + 16; int const M = 1000 * 1000 * 1000 + 7; int n, k; int a[N]; int c[N]; ll e, v[N]; vector<int> idx[N]; struct wavelet { int L, R; vector<int> b; wavelet* l = 0; wavelet* r = 0; wavelet...

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

#include <bits/stdc++.h> using namespace std; const int MAXN = 1e6 + 7; const int MOD = 1e9 + 7; vector<int> Gimp[MAXN]; vector<int> Gcrew[MAXN]; vector<int> G[MAXN]; int comp[MAXN]; int compSize[MAXN]; bool vis[MAXN]; bool col[MAXN]; bool ans; int res; int allSize; void DFScomp(int v, int n...

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

#include <bits/stdc++.h> using ll = long long; using namespace std; int main() { cin.tie(0); cin.sync_with_stdio(0); int n, r; cin >> n >> r; double R = -r / (sin(acos(-1) / n) - 1); double ans = R - r; cout << fixed << setprecision(10) << ans; }

#include <bits/stdc++.h> using namespace std; long long t, d, ct, q, ans, l, m, r, n, mx, mn, i, j, k, x, y, z, s; char ch; string ss = , str = ; map<pair<long long, long long>, long long> mp; set<long long> st; long long a[300003], b[300003]; vector<pair<long long, long long>> v; bool ask(long lo...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); string sub, inp = ; while (cin >> sub) { inp += sub; } string s = ; for (int i = 0; i < (int)inp.size(); ++i) { if (inp[i] == a ) { inp[i - 2] == / ? s +...

#include <bits/stdc++.h> using namespace std; const int maxn = 5e5 + 5, Mod = 1e9 + 7; struct Edge { int nxt, to; } e[maxn << 1]; int hd[maxn], e_cnt = 1; void add(int u, int v) { e[++e_cnt] = (Edge){hd[u], v}; hd[u] = e_cnt; } int n, pre[maxn << 2], nxt[maxn << 2], p[maxn], dep[maxn], fac[m...

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

#include <bits/stdc++.h> using namespace std; void __print(long long x) { cerr << x; } void __print(unsigned x) { cerr << x; } void __print(unsigned long x) { cerr << x; } void __print(unsigned long long x) { cerr << x; } void __print(float x) { cerr << x; } void __print(double x) { cerr << x; } void __...

#include <bits/stdc++.h> using namespace std; void solve() { long long i, j, k, l, n, m, a, b, u; cin >> n; vector<pair<string, pair<long long, long long>>> v(n); for (i = 0; i < n; i++) { cin >> v[i].first >> v[i].second.first >> v[i].second.second; } long long ans = 0; for (i = 1...

#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int n = s.size(); int i = 0; while (i < n and s[i] == a ) i++; int j = i + 1; while (j < n and s[j] != a ) j++; if (i == n) s[n - 1] = z ; else for (int k = i; k < j; k++) s[k] = (s[k] -...

#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; long long POW(long long a, long long b, long long MMM = MOD) { long long ret = 1; for (; b; b >>= 1, a = (a * a) % MMM) if (b & 1) ret = (ret * a) % MMM; return ret; } long long gcd(long long a, long long b) { return b...

#include <bits/stdc++.h> using namespace std; void swap(int &a, int &b) { a = a ^ b; b = a ^ b; a = a ^ b; return; } void get_output(int arr[], int n) { int flag = 1; while (flag) { flag = 0; for (int i = 0; i < n - 1; i++) { if (arr[i] > arr[i + 1]) { swap(...

#include <bits/stdc++.h> using namespace std; const int INF = ~(1 << 31); const int N = 200000; int n; char s[N + 1]; char t[N + 1]; int suffix_array[N + 1]; int *eq; int lcp[N + 1]; vector<pair<int, int> > lcp_; inline int add(int a, int b, int md) { a += b; if (a >= md) a -= md; retu...

#include <bits/stdc++.h> using namespace std; inline int read() { int x, f = 1; char c; while ((c = getchar()) < 0 || c > 9 ) if (c == - ) f = 0; for (x = c - 0 ; (c = getchar()) >= 0 && c <= 9 ;) x = x * 10 + c - 0 ; return f ? x : -x; } struct vec { int x, y; } v[10 + ...

#include <bits/stdc++.h> const int N_MAX = 600007; std::map<std::pair<int, int>, int> ext; long long ans[N_MAX], now; int fa[N_MAX], siz[N_MAX][2], top; std::pair<int, int> stk[N_MAX]; int find(int x) { while (fa[x] != x) x = fa[x]; return x; } void merge(std::pair<int, int> v) { int x = fin...

#include <bits/stdc++.h> using namespace std; int prv[100010], nxt[100010]; int main() { int n, k; string s; cin >> n >> k; cin >> s; int closest = -1; for (int i = 0; i < s.length(); ++i) { if (s[i] == 0 ) { closest = i; } prv[i] = closest; } closest = n...

#include <bits/stdc++.h> using namespace std; const int N = 100100; long long arr[N]; int main() { long long n, k; cin >> n >> k; for (int i = 0; i < n; ++i) cin >> arr[i]; sort(arr, arr + n); --k; int x = 0, y = 0; for (int i = 0; i < n; ++i) { if (arr[i] < arr[k / n]) x++; ...

#include <bits/stdc++.h> using namespace std; int main() { int n, m; char c, res[2] = { W , B }; cin >> n >> m; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> c; if (c == - ) cout << c; else cout << res[((i % 2) + (j % 2)) % 2];...

#include <iostream> #include <algorithm> #include <string> using namespace std; int main() { int t, n; string s, b = trygub ; cin >> t; while (t--) { int k = 0; cin >> n >> s; sort(s.begin(), s.end()); cout << s << endl; } }

#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5, base = 2333, mod = 20030731; int n, m, a[N], b[N], pw[N], h1[N], h2[N], ans[N]; void init() { pw[0] = 1; for (int i = (1); i <= (n - 1); i++) pw[i] = (long long)base * pw[i - 1] % mod, h1[i] = (((long long)h1[i - 1] * base ...

#include <bits/stdc++.h> #pragma GCC optimize( O3 ) #pragma GCC optimize( Ofast ) #pragma GCC target( avx,avx2,fma ) #pragma GCC optimization( unroll-loops ) using namespace std; long long max3(long long x, long long y, long long z) { return max(max(x, y), z); } long long min3(long long x, long long...

#include <bits/stdc++.h> using namespace std; long long front[1000001], back[1000001], vt[1000001]; int main() { long long k, sz, ko = 0, j = 0, kq = 0; string s; cin >> k >> s; sz = s.size(); s = + s; for (long long i = 1; i <= sz + 1; i++) { front[i] = ko; if (s[i] == 0 ...

#include <bits/stdc++.h> using namespace std; vector<double> p; double g; int n; int main() { cin >> n; p.resize(n + 1); for (int i = 0; i <= n; i++) cin >> p[i]; g = p[n / 2]; for (int i = 0; i <= (n - 1) / 2; i++) for (int j = n - (n - 1) / 2; j <= n; j++) g = max(g, (p[i] ...

#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { if (!a) return b; return gcd(b % a, a); } long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); } const long long MAX = 1e6 + 2047; const long long mod = 1e9 + 7; const long long MAX_2 = 1009; ...

#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); if (n == 1) { cout << 0 << endl; return 0; } int a[n + 2], cnt = n - 1; for (int i = 2; i <= n; i++) { a[i] = i; } for (int i = 2; i < n; i++) { for (int j = i + 1; j <= n; j++)...

#include <bits/stdc++.h> using namespace std; char s[100100]; char s1[100100]; int res[5]; vector<int> zeros, ones; int n; int was[100100]; int model() { memset(was, 0, sizeof(was)); for (int i = (0); i < (n); ++i) if (s[i] == 0 ) zeros.push_back(i); else ones.push_b...

#include <bits/stdc++.h> int main() { int n, min = 0, k; scanf( %d , &n); for (int i = 1; i < 200; i++) { k = (pow(2, i) - 1) * pow(2, i - 1); if (k > n) { printf( %d , min); break; } else if ((n % k) == 0) { min = k; } } return 0; }

#include <bits/stdc++.h> using namespace std; long long int input(long long int n, vector<long long int> &ve); long long int input(long long int n, vector<long long int> &ve) { long long int val; for (long long int i = 0; i < n; i++) { cin >> val; ve.push_back(val); } return 0; } i...

#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; string h, v; cin >> h >> v; bool flag = true; if (h[0] == > && v[0] == v ) flag = false; if (h[0] == < && v[m - 1] == v ) flag = false; if (h[n - 1] == > && v[0] == ^ ) flag = false; if (...

#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:255000000 ) bool firstout = 1; template <class T> T &minn(T &a, T b) { if (b < a) a = b; return a; } template <class T> T &maxx(T &a, T b) { if (a < b) a = b; return a; } int &madd(int &a, int b) { a +=...

#include <bits/stdc++.h> using namespace std; map<int, bool> g; struct node { int x, y, z, num; } ans[3000]; int a[60], sum[60], vis[60], flag, n, final, k; int main() { int i, t = 0, s, j, num = 0, tt; flag = 0; final = 0; scanf( %d%d , &n, &k); g.clear(); for (i = 1; i <= n; i+...

#include <bits/stdc++.h> using namespace std; const int P = 1e9 + 7, 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; ret...

#include <bits/stdc++.h> using namespace std; const int MAXN = 100000; class Interval { public: int s, e, i; } interval[MAXN + 5]; bool cmp_input(const Interval &a, const Interval &b) { return a.i < b.i; } bool cmp_interval(const Interval &a, const Interval &b) { if (a.s != b.s) return a.s < b.s;...

#include <bits/stdc++.h> using namespace std; int main() { string s; string s2; cin >> s >> s2; transform(s.begin(), s.end(), s.begin(), ::tolower); transform(s2.begin(), s2.end(), s2.begin(), ::tolower); if (s == s2) { printf( 0 n ); } else if (s < s2) { printf( -1 n ); ...

#include <bits/stdc++.h> using namespace std; bool comp(pair<int, int> a, pair<int, int> b) { return a.second > b.second; } int main() { int n, m; cin >> n >> m; vector<pair<int, int>> a; for (int i = 0; i < m; i++) { int q, w; cin >> q >> w; a.push_back(make_pair(q, w)); } ...

#include <bits/stdc++.h> using namespace std; void solve() { int N; char in[120]; scanf( %d%s , &N, in); int len = strlen(in); int flag = 0; for (int i = 0; i < len; i++) { for (int d = 1; d < len; d++) { if (i + 4 * d >= len) break; if (in[i] == * && in[i + d] == * ...

#include <bits/stdc++.h> using namespace std; int n; int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); } int main() { scanf( %d , &n); if (n == 1) { printf( 0 n0 n0 n ); return 0; } for (int t = 1; t <= n - 1; t++) if (gcd(t, n) == 1 && gcd(t + 1, n) == 1) { fo...

#include <bits/stdc++.h> using namespace std; const int INF = 2147483647; const double PI = 3.141592653589793; const double eps = 1e-6; int n, r, R; double x; int main() { scanf( %d %d %d , &n, &R, &r); if (n == 1) { if (r <= R) printf( YES n ); else printf( NO n ); ...

#include <bits/stdc++.h> using namespace std; const int MAXN = (int)5e3 + 10; const int MOD = (int)1e9 + 7; long long dp[1111][1111]; int num[1111], k; int mark[1111]; long long dfs(int pos, int x, int flag) { if (pos == 0) return mark[x] == k - 1 && (x != 0); if (dp[pos][x] != -1 && !flag) { ...

#include <bits/stdc++.h> using namespace std; int A[(1 << 20) + 4], n; long long store[21][2], INV = 0; long long query(int l, int r, int no) { return (A + r + 1 - upper_bound(A + l, A + r + 1, no)); } void gen(int de, int l, int r) { if (!de) return; gen(de - 1, l, (l + r) / 2); gen(de - 1,...

#include <bits/stdc++.h> using namespace std; const int N = 100005; int n, m, k; int a[N]; int b[N]; int main() { cin >> n >> m >> k; for (int i = 0; i < n; ++i) cin >> a[i]; for (int i = 0; i < n - 1; ++i) { b[i] = a[i + 1] - a[i] - 1; } sort(b, b + n - 1); int kk = n; lon...

#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; bool is_Prime(long long a) { for (long long i = 2; i * i <= a; ++i) if (a % i == 0) return false; return true; } bool cmp(pair<long long, long long> a, pair<long long, long long> b) { return (a.second < b.second); } lo...

#include <bits/stdc++.h> using namespace std; void smain(); int main() { ios_base::sync_with_stdio(0); cout.precision(7); cout << fixed; smain(); return 0; } long long d[100001], d2[100001], r[100001], s[100001], sz[100001], c[100001]; struct node { long long cnt, ps, pcnt; }; ma...

#include <bits/stdc++.h> using namespace std; const int mod = 998244353; long long int qpow(long long int x, long long int y) { long long int ans = 1; while (y) { if (y & 1) ans = ans * x % mod; x = x * x % mod; y >>= 1; } return ans; } const int maxn = 1024 * 2; long long ...

#include <bits/stdc++.h> using namespace std; struct Query { int l, r, x; Query(int l = 0, int r = 0, int x = 0) : l(l), r(r), x(x) {} }; struct node { int pref, suff, val; node(int pref = 0, int suff = 0, int val = 0) : pref(pref), suff(suff), val(val) {} }; int n, k; map<int, int...

#include <bits/stdc++.h> #define ll long long int #define ld long double #define NMAX 1009 using namespace std; ll mask; ll u,d,r,l; ll n; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); ll t; cin>>t; while(t--) { cin>>n>>u>>r>>d>>l; bool o...

#include <bits/stdc++.h> const int max_N = 1000 + 21; int n, a[max_N], b[max_N], cnt[max_N]; std::vector<int> vec, _vec, ret[max_N]; int main() { scanf( %d , &n); for (int i = 1; i < n; ++i) { scanf( %d%d , a + i, b + i); if (a[i] > b[i]) std::swap(a[i], b[i]); if (b[i] != n) return pu...

#include <bits/stdc++.h> char a[100050], b[100050]; int sa[100050], sb[100050], ta[100050], tb[100050], Q; int main() { scanf( %s%s , a + 1, b + 1); int la = strlen(a + 1), lb = strlen(b + 1); for (int i = 1; i <= la; i++) { if (a[i] == A ) sa[i] = sa[i - 1] + 1; sb[i] = sb[i - 1] + (a[i]...

#include <bits/stdc++.h> using namespace std; const int N = 123466; bool is[N]; vector<int> adj[N]; int dp[N]; int mx_dep[N]; const int inf = 1 << 22; pair<int, int> calc_dp(int v, int p) { int res = 0; int mx = -inf; if (is[v]) mx = 0; for (auto u : adj[v]) if (u != p) { a...

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

#include <bits/stdc++.h> using namespace std; FILE* g_f_; int g_s_; char* g_g_; template <class _T> inline _T sqr(const _T& x) { return x * x; } template <class _T> inline string tostr(const _T& a) { ostringstream os( ); os << a; return os.str(); } const long double PI = 3.1415926...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; bool b1[N]; int Z, num[N], in[N], dp[N][20], dep[N], freq[2][N], f[N]; long long fans[N]; vector<int> g[N], v; map<int, int> mp; struct qq { int in, l, r, c; qq(int a, int b, int e, int d) { in = a, l = b, r = e, c = d; } b...

#include <bits/stdc++.h> using namespace std; int main() { long long n, s = 0, x, m = 0; cin >> n; for (int i = 1; i <= n; i++) { cin >> x; s += x; m = max(m, x); } long long t = s / (n - 1); if (s % (n - 1)) t++; cout << max(m, t); }

#include <bits/stdc++.h> using namespace std; long long dp[5000010], f[5000010]; int main() { long long t, l, r, i, j, a, b, mod, ans, k = 1, final = 0; mod = 1e9 + 7; scanf( %lld %lld %lld , &t, &l, &r); for (i = 2; i <= r; i++) { if (dp[i] == 0) { for (j = i; j <= r; j += i) ...

#include <bits/stdc++.h> using namespace std; inline int read() { register char c = ; register int v = 0, x = 1; while ((c < 0 ) || (c > 9 )) { if (c == - ) x = -1; c = getchar(); } while ((c >= 0 ) && (c <= 9 )) { v = (v << 1) + (v << 3) + (c ^ 48); c = getchar()...

#include <bits/stdc++.h> using namespace std; int n, m = 3, l, c[20000]; char s[500]; int main() { cin >> n; while (c[m] <= n) m++, c[m] = (long long)m * (m - 1) * (m - 2) * (m - 3) / 24; for (int i = m - 1; i >= 1; i--) { while (c[i] >= 1 && n >= c[i]) { s[++l] = a ; n -= c[i...

#include <bits/stdc++.h> using namespace std; int px[4000010]; int py[4000010]; char c[2010][2010]; int n, m; bool pd(int x, int y, int d) { if (x < 0 || y < 0 || x + d >= n || y + d >= m) return false; for (int t = 1; t <= px[0]; t++) if ((px[t] != x) && (px[t] != x + d) && (py[t] != y) && (p...

#include <bits/stdc++.h> using namespace std; char Ma[4105]; int Mp[4105]; void Manacher(char s[], int len) { int l = 0; Ma[l++] = $ ; Ma[l++] = # ; for (int i = 0; i < len; i++) { Ma[l++] = s[i]; Ma[l++] = # ; } Ma[l] = 0; int mx = 0, id = 0; for (int i = 0; i < l...

#include <bits/stdc++.h> using namespace std; const int dr[]{-1, -1, 0, 1, 1, 1, 0, -1}; const int dc[]{0, 1, 1, 1, 0, -1, -1, -1}; void run() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } const int sqrtQ = 150; struct suffix_automaton { struct state { int len, link...

#include <bits/stdc++.h> using namespace std; template <class T> void _R(T &x) { cin >> x; } void _R(int &x) { scanf( %d , &x); } void _R(int64_t &x) { scanf( %lld , &x); } void _R(double &x) { scanf( %lf , &x); } void _R(char &x) { scanf( %c , &x); } void _R(char *x) { scanf( %s , x); } void R...

#include <bits/stdc++.h> int c[1000001]; char str[1000001]; int len; int ct; long long ans; int main() { int k; int i; scanf( %d , &k); scanf( %s , str); len = strlen(str); if (k == 0) { for (i = 0; i < len; i++) { if (str[i] == 0 ) ct++; else { ...

#include <bits/stdc++.h> using namespace std; const long long INF = 100000000; const long long MAXN = 20100; int n, a[MAXN], ans; int main() { ans = -INF; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; } for (int k = 1; k <= n; k++) { if (n % k == 0) { for (int j...

#include <bits/stdc++.h> using namespace std; const int N = 50; struct matrix { double m[N + 5][N + 5]; friend matrix operator*(const matrix &A, const matrix &B) { matrix C; for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) C.m[i][j] = 0; for (int i = 0; i < N; i++) ...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int a[51], n; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); int res = INT_MAX; for (int i = 1; i < n; i++) { res = min(res, a[i] - a[i - 1]); }...

#include <bits/stdc++.h> using namespace std; int q; long long a, b, n; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> q; while (q--) { cin >> a >> b >> n; if (a > b) swap(a, b); long long ans = 0; while (b <= n) { a += b; ...

#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n; long long int a[45001] = {0}; if (n == 1 || n == 2) cout << No << endl; else { cout << Yes << endl; cout << 1 << << n << endl; cout << n - 1; for (int i = 1; i <= n -...

#include <bits/stdc++.h> using namespace std; const int INF = 1000000007; const int N = 2020; struct trie { trie *c[26]; int cnt; } * root, *nil; string s1, s2, s3; int n, l, r, f[N][N], ans; trie *new_node() { trie *node = new (trie); for (int i = 0; i < 26; i++) node->c[i] = nil; n...

#include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; void solve(int tc) { int n; cin >> n; vector<vector<int>> adj(n, vector<int>(n)); for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { cin >> adj[i][j]; } } int k; ...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; ++i) cin >> a[i]; sort(a.begin(), a.end()); int ans = a.back() - a[0]; int eachCanRemove = (n - 2) / 2; for (int i = 0...

#include <bits/stdc++.h> using namespace std; int caseno = 1; typedef long long LL; typedef unsigned long long ULL; template <class T> inline void SWAP(T &a, T &b) { T t = a; a = b; b = t; } inline LL POW(LL base, LL power) { LL res = base; if (power == 0) return 1; for (int I = ...

#include <bits/stdc++.h> int n, m; int A[100005], B[100005], pass[100005]; int l; int main() { while (scanf( %d %d , &n, &m) != EOF) { int i, j; for (i = 1; i <= n; ++i) scanf( %d , &A[i]); int sum = 0; for (i = n; i >= 1; --i) { if (B[A[i]] == 0) { ++sum; ...

#include <bits/stdc++.h> using namespace std; int lower_case[26] = {0}, upper_case[26] = {0}; char buf[100010]; int main() { scanf( %s , buf); int len = strlen(buf); for (int i = 0; i < len; i++) { if (buf[i] <= Z ) upper_case[buf[i] - A ]++; else lower_case[buf[i] - a...

#include <bits/stdc++.h> using namespace std; long long pwr(long long base, long long p, long long mod = (1000000007LL)) { long long ans = 1; while (p) { if (p & 1) ans = (ans * base) % mod; base = (base * base) % mod; p /= 2; } return ans; } long long gcd(long long a, long lon...

#include <bits/stdc++.h> int n, K, F[3005][3005]; char s[3005][15], T[10][10] = { 1110111 , 0010010 , 1011101 , 1011011 , 0111010 , 1101011 , 1101111 , 1010010 , 1111111 , 1111011 }; int read() { char c = getchar(); int ans = 0; while (c < 0 || c > 9 ) c = getchar(...

#include <bits/stdc++.h> using namespace std; using ll = long long; using ii = pair<int, int>; int main() { ios::sync_with_stdio(0); cin.tie(0); int q; cin >> q; for (int cas = 0; cas < q; ++cas) { ll a, b, m; cin >> a >> b >> m; if (a == b) { cout << 1 << << a ...

#include <bits/stdc++.h> using namespace std; long long max(long long a, long long 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 ma[101][101], yes[101]; int main...

#include <bits/stdc++.h> using namespace std; int n; char s[2000011]; int h1[2000011], h2[2000011], p1[2000011], p2[2000011], mod1 = 998244353, mod2 = 1000000007; int geth1(int L, int R) { return (h1[R] - h1[L - 1] * 1ll * p1[R - L + 1] % mod1 + mo...

#include <bits/stdc++.h> using namespace std; int main() { int M, N, x, a[400010], mini = 0; cin >> M >> N; memset(a, 0, sizeof(a)); for (int i = 1; i <= M; i++) { scanf( %d , &x); a[x % N]++; if (x % N != mini) printf( %d n , a[mini] * N + mini); else { if (i...

#include <bits/stdc++.h> using namespace std; long long read() { long long x = 0, f = 0; char c = getchar(); while (!isdigit(c)) f |= c == - , c = getchar(); while (isdigit(c)) x = x * 10 + c - 0 , c = getchar(); return f ? -x : x; } inline int max(int a, int b, int c) { return max(a, max(...

#include <bits/stdc++.h> std::mt19937_64 rng( std::chrono::steady_clock::now().time_since_epoch().count()); long long int myRand(long long int R) { long long int val = rng() % R; assert(val >= 0); return val; } const long double PI = atan(1.0) * 4; const int32_t INF32 = 2e9 + 7; const int6...

#include <bits/stdc++.h> using namespace std; string a, b; int r = 0; int main() { getline(cin, a); getline(cin, b); int k = 0; while (a[k] == 0 ) k++; a = a.substr(k, a.size() - k); k = 0; while (b[k] == 0 ) k++; b = b.substr(k, b.size() - k); if (a.size() < b.size()) { ...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; char arr[n]; int sf = 0, fs = 0; for (int i = 0; i < n; i++) { cin >> arr[i]; } for (int j = 0; j < n - 1; j++) { if (arr[j] == S ) { if (arr[j + 1] == F ) sf++; } else if (arr[j] == ...

#include <bits/stdc++.h> using namespace std; const int N = 502; int n, m, l = -1, ok = 1, r; string s[N]; int main() { cin >> n >> m; for (int i = 0; i < n; i++) cin >> s[i]; for (int j = 0; j < n; j++) { l = r = -1; for (int i = 0; i < s[j].length(); i++) { if (l == -1 && s[j...

#include <bits/stdc++.h> using namespace std; int main() { string str; cin >> str; string s = WUB ; size_t pos = str.find(s); while (pos != string::npos) { string token = str.substr(0, pos); if (token.length() != 0) cout << token << ; str.erase(0, pos + 3); pos = str....

#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7, M = 2e6 + 7, INF = INT_MAX / 10; long long powe(long long x, long long y) { x = x % mod, y = y % (mod - 1); long long ans = 1; while (y > 0) { if (y & 1) { ans = (1ll * x * ans) % mod; } y >>= 1; ...

#include <bits/stdc++.h> using namespace std; int n, m, ans = 1e9; int a[100005]; inline int read() { int x = 0, f = 1; char ch = getchar(); for (; ch < 0 || ch > 9 ; ch = getchar()) if (ch == - ) f = -1; for (; ch >= 0 && ch <= 9 ; ch = getchar()) x = x * 10 + ch - 0 ; return ...

#include <bits/stdc++.h> const long long mod = (long long)1e9 + 7; using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long n, m; cin >> n >> m; vector<long long> v(m); bool valid = true; for (long long i = 0; i < m; i++) { ...

#include <bits/stdc++.h> using namespace std; int main() { int n, k; string out, chr; cin >> n >> k; for (int i = 0; i < k; ++i) chr += a + i; for (int i = 0; i < n; ++i) out += chr[i % k]; cout << out; return 0; }