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; unordered_map<long long int, long long int> mp; long long int n, m, k, ans; long long int a[22][22]; int dx[] = {1, -1, 0, 0}; int dy[] = {0, 0, 1, -1}; void dfs1(int ex, int ey, int sx, int sy, long long int cur) { if (sx == ex and sy == ey) mp[cur]++; ...
#include <bits/stdc++.h> const int inf = 0x3f3f3f3f, Inf = 0x7fffffff; const long long INF = 0x7fffffffffffffff; template <typename _Tp> _Tp gcd(const _Tp &a, const _Tp &b) { return (!b) ? a : gcd(b, a % b); } template <typename _Tp> __inline__ __attribute__((always_inline)) _Tp abs(const _Tp &a) { ...
#include <bits/stdc++.h> using namespace std; int a[2000050]; int b[2000050]; int c[2000050]; struct node { int x, y; node() {} node(int xx, int yy) { x = xx, y = yy; } } q[2000050]; int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %d , &a[i]); for (int ...
#include <bits/stdc++.h> using namespace std; int main(int argc, char const *argv[]) { int bags[4]; int flag = 0; for (int i = 0; i < 4; i++) { cin >> bags[i]; } if (bags[0] + bags[1] == bags[2] + bags[3]) { cout << YES n ; } else if (bags[0] + bags[2] == bags[1] + bags[3]) { ...
#include <bits/stdc++.h> using namespace std; int main(void) { string s, t; cin >> s >> t; int ind = -1; for (int i = 0; i < s.length(); i++) { if (s[i] != 0 ) break; else ind = i; } s = s.substr(ind + 1); ind = -1; for (int i = 0; i < t.length(); i++) { ...
#include <bits/stdc++.h> using namespace std; int main() { int n, h; cin >> n >> h; vector<pair<int, int>> zeros; int a, b; for (int i = 0; i < n; i++) { cin >> a >> b; zeros.push_back(make_pair(a, b)); } int sol = 0; int pa, pb, ib, c1; pa = zeros[0].first; pb = ...
#include <bits/stdc++.h> const int INF = 0x3f3f3f3f; using namespace std; int a[105], n, dp[105][105][2], cnt = 0; int main() { scanf( %d , &n); cnt = (n + 1) / 2; for (int i = 1; i <= n; ++i) { scanf( %d , &a[i]); if (a[i]) { if (a[i] & 1) --cnt; } } memset(dp, INF...
#include <bits/stdc++.h> using namespace std; int n; string s; int main() { cin >> n; cin >> s; for (int i = 0; i < n; ++i) { int c1 = 0, c2 = 0; for (int j = i - 1; j >= 0; --j) { if (s[j] == L ) { break; } if (s[j] == R ) { ++c1; } ...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int n, m; cin >> n >> m; vector<long long> x(n), y(n); for (int i = 0; i < n; i++) { cin >> x[i] >> y[i]; y[i] -= x[i]; } vector<vector<int>> g(n); for (int i = 0; i < ...
#include <bits/stdc++.h> using namespace std; int main() { int m, n; scanf( %d%d , &n, &m); printf( %d n , m * n / 2); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int boxes; cin >> boxes; int arr[boxes]; for (int i = 0; i < boxes; i++) cin >> arr[i]; int shots; cin >> shots; int x, y; for (int i = 0; i < shots; i++) { cin >> x >> y; if (x == 1) { arr[x] += (arr[x - ...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; long long int a[2 * n]; for (int i = 0; i < 2 * n; i++) cin >> a[i]; sort(a, a + (2 * n)); long long int s = 2e19; ; for (int i = 1; i < n; i++) { s = min(s, (a[n * 2 - 1] - a[0]) * (a[n + i - 1] - a[i]...
#include <bits/stdc++.h> using namespace std; using ll = long long; struct node { char type; vector<node> children; ll dp = 0; ll r = 0; }; node get(string& s, int& idx) { node* v = new node(); if (s[idx] == * ) { v->type = * ; idx++; return v; } else if (s[id...
#include <bits/stdc++.h> using namespace std; const int maxn = 3e5 + 10; int n, b[maxn]; pair<int, int> a[maxn]; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &a[i].first); a[i].second = i; } sort(a + 1, a + 1 + n); reverse(a + 1, a + 1 + n); for ...
#include <bits/stdc++.h> int main() { int n, x, y, z, sum1 = 0, sum2 = 0, sum3 = 0; scanf( %d , &n); while (n--) { scanf( %d %d %d , &x, &y, &z); sum1 = sum1 + x; sum2 = sum2 + y; sum3 = sum3 + z; } if (sum1 == 0 && sum2 == 0 && sum3 == 0) printf( YES ); else ...
#include <bits/stdc++.h> using namespace std; const long long N = 22; long long a[N]; long long dp[N][N][N]; long long DP(long long pos, long long sum, long long limit) { if (!pos) return 1; if (!limit && dp[pos][sum][limit] != -1) return dp[pos][sum][limit]; long long high = limit ? a[pos] : 9; ...
#include <bits/stdc++.h> using namespace std; long long a[101000]; long long pre[101000]; map<long long, long long> Hash; int main() { int n, k; scanf( %d%d , &n, &k); for (int i = 1; i <= n; i++) scanf( %I64d , &a[i]); for (int i = 1; i <= n; i++) pre[i] = pre[i - 1] + a[i]; Hash[0] = 1; ...
#include <bits/stdc++.h> using namespace std; int mat[4005][4005]; int acum[4005][4005]; int dp[4005][805]; int step(int n, int k, int min_i, int max_i) { dp[n][k] = dp[min_i - 1][k - 1] + (acum[n][n] + acum[min_i - 1][min_i - 1] - acum[n][min_i - 1] - acum[min_i - 1...
#include <bits/stdc++.h> using namespace std; set<int> si; int n, k; bool solve(set<int> &cands, vector<int> &chosen) { if (cands.empty()) { if (chosen.empty()) { return false; } for (int i = 0; i < k; ++i) { int cnt = 0; for (const int num : chosen) { cnt...
#include <bits/stdc++.h> using namespace std; int a[5005], cnt, tmp, nxt, V[5005], j, n, i; long long dp[2][5005], ans; struct LS { int pos, val; } ls[5005]; inline bool cmp(LS aa, LS bb) { return aa.val < bb.val; } int main() { cin >> n; for (i = 1; i <= n; ++i) cin >> a[i], ls[i].val = a[i],...
#include <bits/stdc++.h> using namespace std; int main() { long long int n, d; cin >> n >> d; int t; cin >> t; while (t--) { long long int x, y; cin >> x >> y; long long int eq1 = y * (n - d) - ((n - d) * (x - d)); long long int eq2 = (y - (n - d)) + (x - (n)); long...
#include <bits/stdc++.h> using namespace std; int main() { bool flag = 0, flag2 = 0; long long n, m, c = 0; cin >> n >> m; for (long long i = 0; i < n; i++) { for (long long j = 0; j < m; j++) { if (i % 2 != 0 && c % 2 == 0 && j != m - 1) { cout << . ; flag = 1; ...
#include<bits/stdc++.h> using namespace std; typedef long long int ll; ll mod=1e9+7; int main() { int t; cin>>t; while(t--) { ll n,k; cin>>n>>k; ll ans=1; for(ll i=0;i<k;i++) { ans=(ans*n)%mod; } cout<<ans<<endl; } }
#include <bits/stdc++.h> using namespace std; int _I() { int x; scanf( %d , &x); return x; } const int lmt = 10000000; bool prime[lmt + 5]; int rng = 1, v[lmt + 5]; void sv() { v[0] = 2; for (int i = 4; i <= lmt; i += 2) prime[i] = 1; for (int i = 3; i <= lmt; i += 2) { if (!...
#include <bits/stdc++.h> using namespace std; const long double radian = 180 / acos(-1); int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long x, mini = LLONG_MAX, p; cin >> x; x %= 360; if (x < 0) x = 360 + x; for (int i = 0; i < 4; i++) { if (min...
#include <bits/stdc++.h> using namespace std; template <typename T> inline T sqr(const T &a) { return a * a; } template <typename T> inline int nread(vector<T> &a) { int n; cin >> n; a.clear(); a.resize(n); for (int i = 0; i < n; i++) cin >> a[i]; return n; } template <typena...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 100; long long t; long long n; long long a[N]; long long b[N]; map<long long, long long> ma; int main() { scanf( %lld , &t); while (t--) { ma.clear(); memset(a, 0, sizeof(a)); memset(b, 0, sizeof(b)); scanf...
#include <bits/stdc++.h> using namespace std; int main() { string a, b, c, d; cin >> a >> b >> c >> d; int c1 = 0, c2 = 0, c3 = 0, c4 = 0; if ((a.size() - 2) >= (b.size() - 2) * 2 && (a.size() - 2) >= (c.size() - 2) * 2 && (a.size() - 2) >= (d.size() - 2) * 2) { c1 = 1; } e...
#include <bits/stdc++.h> using namespace std; inline long long read() { long long x; cin >> x; return x; } const int MAX_N = 15; const int MAX_F = (1 << (MAX_N - 2)) + 4; int n, m, nQ, id[MAX_N]; bool isEdge[MAX_N][MAX_N], isParent[MAX_N][MAX_N], isNotParent[MAX_N][MAX_N], isLCA[MAX_N][M...
#include <bits/stdc++.h> using namespace std; int n, k; char playLog[1111]; char posLet[3] = { W , D , L }; int delta[3] = {1, 0, -1}; int val[256]; char dp[1111][2222]; void clearArray() { for (int i = 0; i <= n + 1; i++) { for (int j = -k; j <= k; j++) dp[i][j + k] = X ; } } void ...
#include <bits/stdc++.h> using namespace std; const int shape[4][4][2] = {{{1, 0}, {2, 0}, {1, 1}, {1, 2}}, {{1, 0}, {2, 0}, {2, -1}, {2, 1}}, {{0, 1}, {0, 2}, {-1, 2}, {1, 2}}, {{0, 1}, {0, 2}, {1, 1}, {2, 1}}}; int x, y; ...
#include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; using pll = pair<ll, ll>; const ll inf = 1; const ll mod = 1E9; int main() { int n, m; scanf( %d %d , &n, &m); int colors = 1; vector<vector<int> > mset(n, vector<int>()); vector<vector<int>...
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; cout << s; reverse(s.begin(), s.end()); cout << s; }
#include <bits/stdc++.h> using namespace std; template <typename T> inline T Max(T a, T b) { return a > b ? a : b; } template <typename T> inline T Min(T a, T b) { return a < b ? a : b; } template <typename T> inline void checkMax(T &a, T b) { if (a < b) a = b; } template <typename T> ...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, k; cin >> n >> k; string s; cin >> s; sort(s.begin(), s.end()); map<char, int> store; for (int i = 0; i < n; i++) { store[s[i]]++; } if (store.si...
#include <bits/stdc++.h> using namespace std; set<int> v; multiset<int> diff; void clean() { if (v.size() < 2) { cout << 0 << endl; return; } cout << v.rbegin() - v.begin() - *diff.rbegin() << endl; } int main() { v.clear(); diff.clear(); int n, q; cin >> n >> q; ...
#include <bits/stdc++.h> using namespace std; int const oo = 1e9, bound = 1e6, mod = oo + 7; long long const OO = 1e18; int n, m, k, aa[20]; int cc[20][20]; long long dp[18][1 << 18]; long long rec(int idx, int msk) { long long &ret = dp[idx][msk]; if (ret != -1) return ret; int cop = msk, e =...
#include <bits/stdc++.h> using namespace std; const long long int INF = 98769876987698889LL; const int MOD = 1e9 + 7; const int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1}; const int dy8[] = {0, 1, 1, 1, 0, -1, -1, -1}; const int dx4[] = {1, -1, 0, 0}; const int dy4[] = {0, 0, 1, -1}; const int N = 2e5 + 5; l...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; for (int i = 0; i < t; ++i) { int n, m, h; cin >> n >> m; long long int sum = 0; for (int j = 0; j < n; ++j) { int x; cin >> x; if (j != 0) sum = sum + x; if (j == 0) h = x...
#include <bits/stdc++.h> using namespace std; long long n, k, p; string s; vector<long long> mem; long long solve(int i) { if (mem[i] != -1) return mem[i]; if (i == 0) return 0; long long tmp = stoll(s.substr(i - 1, 1)); long long res = 1ll << 62; for (int j = i - 1; tmp < n; --j) { ...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( avx,avx2,fma ) #pragma GCC optimization( unroll-loops ) using namespace std; const int MX = 2000006; char a[MX], b[MX]; char arb[MX], abr[MX], ba[MX]; int parb[MX], zabr[MX], zba[MX], pos[MX]; void compute_pi(int n, char s[], i...
#include <bits/stdc++.h> #pragma GCC target( avx2 ) #pragma GCC optimization( O3 ) #pragma GCC optimization( unroll-loops ) using namespace std; inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; } inline int msbp(int x) { return 31 - __builtin_clz(x); } inline int msb(int x) { return 1 << ms...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:64777216 ) using namespace std; const long long maxn = 100001; const long long maxk = 200001; const long long maxx = 10001; const long long secret_number = 87468267; const long long inf = 1e18; const int iinf = 2147483647 / 2; const double pi = ...
#include <bits/stdc++.h> using namespace std; using ll = long long; struct p { ll v; int i; } pp[3]; bool cmp(p x, p y) { return x.v < y.v; } void dd() { sort(pp, pp + 3, cmp); ll y = 2 * pp[2].v - pp[0].v - pp[1].v; cout << y << endl; cout.flush(); int x; cin >> x; if (x...
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); vector<vector<int>> g(n); for (int i = 0; (i) < (int)(n - 1); (i)++) { int a, b; scanf( %d%d , &a, &b); a--, b--; g[a].push_back(b); g[b].push_back(a); } int ans = 0; for (int...
#include <bits/stdc++.h> const double pi = acos(-1.0); int main() { int n; double s, f, r, v, t; scanf( %d %lf %lf , &n, &r, &v); double p = 2 * pi * r; double tp = p / v; while (n--) { scanf( %lf %lf , &s, &f); double x = f - s; double cyc = floor(x / p); double rem ...
#include <bits/stdc++.h> using namespace std; int a[11000][4]; int ans[110][110]; int main() { cin.sync_with_stdio(false); cin.tie(0); int n, m, q; cin >> n >> m >> q; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) ans[i][j] = 0; for (int i = 0; i < q; i++) { int x1;...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; const int K = 18; long long a[N], tree[N << 2], lazy[N << 2]; vector<int> v[N]; int anc[N][K], h[N], sz[N]; int c[N], pos[N]; int ct; void build(int node, int st, int end) { if (st == end) { tree[node] = c[st]; retur...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 50; const int LOG = 19; const int INF = 1e9; int m, p[MAXN], par[12][MAXN], nxt[MAXN], id[MAXN], ss[MAXN], ans, l[MAXN], r[MAXN]; int tt[LOG][MAXN], lc[LOG][MAXN]; string s[14]; pair<pair<int, int>, int> vec[MAXN]; int lcp(int ...
#include <bits/stdc++.h> using namespace std; int n, arr[110], c1, c0; int main() { scanf( %d , &n); for (int i = 0; i < n; ++i) scanf( %d , &arr[i]), c1 += arr[i]; int out = 0; for (int i = 0; i < n; ++i) { c0 += (!arr[i]); out = max(out, c0 + c1); c1 -= arr[i]; } cout <...
#include <bits/stdc++.h> using namespace std; struct node { int a; int b; int index; }; bool compare(node &n1, node &n2) { if (n1.a < n2.a) return true; else return false; } bool compare1(node &n1, node &n2) { if (n1.b < n2.b) return true; else return fals...
#include <bits/stdc++.h> using namespace std; int main() { int hy, ay, dy; int hm, am, dm; int h, a, d; cin >> hy >> ay >> dy; cin >> hm >> am >> dm; cin >> h >> a >> d; int res = 1e9; for (int atk = dm + 1; atk <= 200; ++atk) { for (int def = dy; def <= 100; ++def) { i...
#include <bits/stdc++.h> using namespace std; int N, br[20][200200], d[20][200200], lev[200200]; vector<int> in, adj[200200], myc[200200], ans; bool dead[200200]; vector<multiset<int>> m[200200]; multiset<int> sub, best[200200], outofall; int go(int l, int i, int p = -1) { in.push_back(i); for (in...
#include <bits/stdc++.h> using namespace std; map<pair<long long, long long>, long long> m; int main() { long long t, ai, bi, dr = 1; cin >> t; vector<pair<long long, long long>> v(t); for (int i = 0; i < t; i++) { cin >> ai >> bi; v[i] = {ai, bi}; } m[{0, 0}] = 1; dr += mi...
#include <bits/stdc++.h> using namespace std; template <typename T> inline T qmin(const T a, const T b) { return a < b ? a : b; } template <typename T> inline T qmax(const T a, const T b) { return a > b ? a : b; } template <typename T> inline void getmin(T &a, const T b) { if (a > b) a = b...
#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007; const int MAXN = 1500907; vector<vector<long long>> adj; bool visited[MAXN]; long long n_nodes; long long n_edges; void dfs(int node) { visited[node] = 1; n_nodes++; for (auto i : adj[node]) { n_edges++; ...
#include <bits/stdc++.h> using namespace std; set<long long> num; void f(int x, int a, int b, long long now) { if (x == 0) { num.insert(now); return; } if (a) f(x - 1, a - 1, b, now * 10 + 4); if (b) f(x - 1, a, b - 1, now * 10 + 7); } void init() { int i; for (i = 1; i <= ...
#include <bits/stdc++.h> using namespace std; int main(void) { int n; scanf( %d , &n); long a[n]; long long s = 0, ss = 0; for (int i = 0; i < n; i++) { scanf( %ld , &a[i]); s += a[i]; } if (s % 3 != 0) { printf( 0 n ); return 0; } s = s / 3; vector<in...
#include <bits/stdc++.h> using namespace std; int main() { int n, m, i, j, a[110], b[110], a1, b1; cin >> n >> m; for (i = 0; i <= n; i++) cin >> a[i]; for (i = 0; i <= m; i++) cin >> b[i]; a1 = a[0], b1 = b[0]; if (n > m) { if (a1 * b1 > 0) cout << Infinity << endl; el...
#include <bits/stdc++.h> using namespace std; long long int MOD = 1e9 + 7; const long long int INF = 1e18; long long int sub(long long int a, long long int b, long long int p = MOD) { return ((a % p) - (b % p) + p) % p; } long long int mult(long long int a, long long int b, long long int p = MOD) { ...
#include <bits/stdc++.h> using namespace std; template <int V, class T = long long> class max_flow { static const T INF = numeric_limits<T>::max(); struct edge { int t, rev; T cap, f; }; vector<edge> adj[V]; int dist[V]; int ptr[V]; bool bfs(int s, int t) { memset(dis...
#include <bits/stdc++.h> using namespace std; int main() { long long int n; scanf( %lld , &n); long long int i; for (i = 2; i * i <= n; i++) { while (n % (i * i) == 0) n /= i; } printf( %lld n , n); return 0; }
#include <bits/stdc++.h> using namespace std; int n, m, s, i, j, k; bool A[301][301]; char str[301]; int main() { scanf( %d%d%d , &n, &m, &s); for (i = 0; i < n; i++) { scanf( %s , str); for (j = 0; j < m; j++) A[i][j] = str[j] == * ; } for (i = 1; 2 * i + 1 <= min(n, m); i++) { ...
#include <bits/stdc++.h> using namespace std; const int nm = 100002; int n, d; long long x; int a[nm], b[nm], vt[nm]; int c[nm]; int nc; int getNextX() { x = (x * 37 + 10007) % 1000000007; return x; } void init() { int i; for (i = 0; i < n; i = i + 1) { a[i] = i + 1; } ...
#include<cstdio> int t,n; int vx[13][2003]; int vy[13][2003]; int fx[13][2003]; int lx[13][2003]; int fy[13][2003]; int ly[13][2003]; int a[2003][2003]; int main() { scanf( %d ,&t); while(t--) { scanf( %d ,&n); for(int i=1;i<=n;++i) { for(int j=1;j<=n;++j) { sc...
#include <bits/stdc++.h> using namespace std; const long long PR = 1000000009; int n, m, premin[100009], sufmax[100009]; char A[100009], B[100009]; int main() { ios::sync_with_stdio(false); cin >> A >> B; n = strlen(A); m = strlen(B); for (int i = 0; i < m; i++) premin[i] = n, sufmax[i] = ...
#include <bits/stdc++.h> using namespace std; int main() { long long n, m; cin >> n >> m; long long mod = 1; int k = 0; while (k < n) { if (mod > m) { break; } mod *= 2; k++; } cout << m % mod << endl; }
#include <bits/stdc++.h> using namespace std; int n, k; string a; int change(char c) { int j = 0, i = 0, ans = 0, cont = 0; for (i = 0; i < n; i++) { if (a[i] == c) cont++; if (cont > k) { while (cont > k) if (a[j++] == c) cont--; } ans = max(ans, i - j + 1); ...
#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > g[100100]; int fa[100100][18], typ[100100], n; int sum[100100][2], dep[100100]; void dfs(int u) { for (int i = 1; i < 18; ++i) fa[u][i] = fa[fa[u][i - 1]][i - 1]; for (auto v : g[u]) { int A = v.first, tp = v.second; sum...
#include <bits/stdc++.h> using namespace std; int a[32]; int n, k; double dp[32][32][205]; int main() { memset(dp, 0, sizeof(dp)); cin >> n >> k; for (int i = 0; i < n; ++i) cin >> a[i]; for (int i = 0; i < n; ++i) { for (int j = i; j < n; ++j) { if (a[i] > a[j]) { dp[i...
#include <bits/stdc++.h> int cicle[300] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, ...
#include <bits/stdc++.h> const int mod = 1e9 + 7; const int N = 3e5 + 1; using namespace std; void err(istream_iterator<string> it) {} template <typename T, typename... Args> void err(istream_iterator<string> it, T a, Args... args) { cerr << *it << = << a << ; err(++it, args...); } long l...
#include <bits/stdc++.h> using namespace std; long long n, q; struct interv { long long l, r, ubonus, lbonus; interv(long long L, long long R, long long UBONUS, long long LBONUS) { l = L; r = R; ubonus = UBONUS; lbonus = LBONUS; } bool operator<(const interv& x) const { ret...
#include <bits/stdc++.h> using namespace std; inline void solve() { long long n; cin >> n; vector<bool> isp(n + 1, 1); vector<long long> maxx(n + 1, -1); isp[0] = isp[1] = 0; for (long long i = 2; i <= n; i++) { if (isp[i]) { if (i * 2 <= n) { for (long long j = i * 2...
#include <bits/stdc++.h> using namespace std; long long n, m, k, y, a, b, c; long long A[2005]; bool B[2005]; int main() { cin >> n >> k; priority_queue<pair<int, int> > pq; for (int i = int(0); i < int(n); i++) { cin >> A[i]; pq.push({A[i], i}); } int ans = 0; for (int i =...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; int n; int seq[N]; vector<int> zli[N]; int res[N]; int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %d , seq + i); seq[i] = n - seq[i]; zli[seq[i]].push_back(i); } int rodzaj = 0; ...
#include <bits/stdc++.h> int find_min(int pos, int target) { int right = -1; for (int i = 0; right == -1; i++) if ((pos + i) % 26 == target) right = i; int left = -1; for (int i = 0; left == -1; i++) if ((pos - i + 26 * 2) % 26 == target) left = i; return std::min(right, left); } i...
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1); const long long MOD = 998244353; struct node { int v; node d, r; }; node a[1050][1050]; long long n, m, q; void solve() { cin >> n >> m >> q; for (int i = (int)(1); i <= (int)(n); i += 1) { for (int j = (in...
#include <bits/stdc++.h> using namespace std; const int maxn = 50, maxm = 5e3 + 100; int n, lim, f[maxn + 3], s[maxn + 3]; double p[maxn + 3], q[maxn + 3], dp[maxn + 3][maxm + 3]; bool check(double x) { for (int i = n; i; i--) { for (int j = lim + 1; j <= lim + 100; j++) { dp[i + 1][j] = x; ...
#include <bits/stdc++.h> using namespace std; int main() { int n, ans = 0; bool flag = false; int a[105]; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 1; i < n; i++) { if (a[i] == 2) { if (a[i - 1] == 1) { if (i >= 2 && a[i - 2] == 3) an...
#include <bits/stdc++.h> using namespace std; const int matmul[][6] = {{2, 1, 1, 1, 0, 0}, {1, 2, 1, 1, 0, 0}, {1, 0, 1, 0, 0, 0}, {0, 1, 0, 1, 0, 0}, {1, 1, 1, 1, 1, 0}, {2, 2, 2, 2, 1, 1}}; long long N, sx, sy, dx, dy, t; struct matrix { int m, n; ...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); int n, m; cin >> n >> m; int ver[n + 1]; ver[n] = 1e9; for (int i = 0; i < n; i++) cin >> ver[i]; int hor[m]; for (int i = 0; i < m; i++) { int x1, x2, y; cin >> x1 >> x2 >> y; if (x...
#include <bits/stdc++.h> const int md = 1e9 + 7; const long long hs = 199; using namespace std; int n, x; set<int> a; int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> n; for (int i = 1; i <= n; i++) a.insert(i); cout << 1 ; while (--n) { cin >> x; a.era...
#include <bits/stdc++.h> using namespace std; int setBite(int r, int pos) { return r \| (1 << pos); } int resetBit(int r, int pos) { return r & ~(1 << pos); } bool checkBit(int r, int pos) { return (r & (1 << pos)); } bool leap(long long x) { if ((x % 4 == 0 && x % 100 != 0) \|\| x % 400 == 0) return true; ...
#include <bits/stdc++.h> using namespace std; long long int m; long long int a; long long int b; set<int> s; long long int im(long long int val, int dv) { long long int z = 0; long long int U = (1LL + val / dv) * (val / dv) / 2LL; U = dv; U -= (val / dv) (dv - (val % dv) - 1); return ...
#include <bits/stdc++.h> using namespace std; int main() { long long n; int a = 0; cin >> n; long long tp = n; for (long long i = 2; i <= sqrt(tp); i++) { if (tp % i == 0) { while (tp % i == 0) tp /= i; a = i; break; } } if (a == 0) cout << n; ...
#include <bits/stdc++.h> using namespace std; map<string, int> Map; char str[2200][22]; int p[2200], q[2200]; int main() { int num, n, k1, k2, cnt; char s1[22], s2[22]; while (scanf( %d , &n) != EOF) { memset(p, 0, sizeof(p)); memset(q, 0, sizeof(q)); cnt = 1; num = 0; ...
#include <bits/stdc++.h> using namespace std; int a[100002]; int gcd(int a, int b) { int c; while (a != 0) { c = a; a = b % a; b = c; } return b; } int main() { int n; int mina = 2000000009; cin >> n; cin >> a[1]; int ucln; ucln = a[1]; for (long l...
#include <bits/stdc++.h> using namespace std; int maxx = 1e6 + 10; int up(int a, int b) { if (a % b) return a / b + 1; else return a / b; } int main() { int t; scanf( %d , &t); while (t--) { int n, d; scanf( %d%d , &n, &d); bool flag = 0; for (int x = 0;...
#include <bits/stdc++.h> using namespace std; long long int mod = 998244353; long long int expo(long long int base, long long int exponent, long long int mod) { long long int ans = 1; while (exponent != 0) { if (exponent & 1) ans = (1LL * ans * base) % mod; base = (1LL * b...
#include <bits/stdc++.h> using namespace std; const int Maxn = 55; long long dp[Maxn][10]; int main() { string k; cin >> k; int n = k.length(); for (int i = 0; i < 10; i++) { dp[0][i] = 1; } for (int i = 1; i < n; i++) { int t = k[i] - 0 ; for (int j = 0; j < 10; j++) ...
#include <bits/stdc++.h> using namespace std; const long long M = 1000000007; const double pi = acos(-1); const int N = 2e5 + 10; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); ; long long n, k, m, d, q = 1, ans = 0; cin >> n >> k >> m >> d; for (long lon...
#include <bits/stdc++.h> using namespace std; const int N = 105; const int M = 1005; int n, m, x[N], s; double p[N * M], tmp[N * M]; int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; ++i) scanf( %d , &x[i]); for (int i = 1; i <= n; ++i) s += x[i]; if (m == 1) { puts( 1.000000...
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; const int M = 1e6 + 10; int n, m, x, y, a[N], f[M]; bitset<N> ans, tmp; int main() { scanf( %d%d%d , &n, &x, &y); for (int i = 1; i <= n + 1; i++) { scanf( %d , &a[i]); tmp.set(a[i]); } for (int i = 1; i <= n +...
#include <bits/stdc++.h> using namespace std; int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1}; long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int n, m; ...
#include <bits/stdc++.h> const int N = 200010; std::vector<int> e[N]; int color[N], dep[N]; bool vis[N]; int n, k; int max = 0; void dfs(int u, int fa) { max = std::max(max, dep[u]); for (auto v : e[u]) { if (vis[v] \|\| v == fa) { continue; } dep[v] = dep[u] + 1; dfs...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long n1, m; cin >> n1 >> m; string s; cin >> s; long long n; n = s.size(); long long lps[n]; lps[0] = 0; long long i, j; if (m == 0) { ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 100010; const int INF = 0x7f7f7f7f; const double pi = 4.0 * atan(1.0); int cases; struct Segment_Tree { long long lazy[MAXN << 2]; long long data[MAXN << 2]; long long flag[MAXN << 2]; void pushup(int o) { data[o] = data[(o...
#include <bits/stdc++.h> using namespace std; int n, a[100001], c[100001]; int main() { cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; int s = 0; for (int i = n - 1; i >= 0; i--) if (s > 0) s -= a[i]; else { c[i] = 1; s += a[i]; } if (s < 0) ...
#include <bits/stdc++.h> using namespace std; struct num2 { static const int MB = 1e9 + 9; int b; num2() {} num2(int x) : b(x) {} num2 operator+(const num2& x) const { return num2((b + x.b) % MB); } num2 operator-(const num2& x) const { return num2((b + MB - x.b) % MB); } num2 operator*(...

#include <bits/stdc++.h> using namespace std; unordered_map<long long int, long long int> mp; long long int n, m, k, ans; long long int a[22][22]; int dx[] = {1, -1, 0, 0}; int dy[] = {0, 0, 1, -1}; void dfs1(int ex, int ey, int sx, int sy, long long int cur) { if (sx == ex and sy == ey) mp[cur]++; ...

#include <bits/stdc++.h> const int inf = 0x3f3f3f3f, Inf = 0x7fffffff; const long long INF = 0x7fffffffffffffff; template <typename _Tp> _Tp gcd(const _Tp &a, const _Tp &b) { return (!b) ? a : gcd(b, a % b); } template <typename _Tp> __inline__ __attribute__((always_inline)) _Tp abs(const _Tp &a) { ...

#include <bits/stdc++.h> using namespace std; int a[2000050]; int b[2000050]; int c[2000050]; struct node { int x, y; node() {} node(int xx, int yy) { x = xx, y = yy; } } q[2000050]; int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %d , &a[i]); for (int ...

#include <bits/stdc++.h> using namespace std; int main(int argc, char const *argv[]) { int bags[4]; int flag = 0; for (int i = 0; i < 4; i++) { cin >> bags[i]; } if (bags[0] + bags[1] == bags[2] + bags[3]) { cout << YES n ; } else if (bags[0] + bags[2] == bags[1] + bags[3]) { ...

#include <bits/stdc++.h> using namespace std; int main(void) { string s, t; cin >> s >> t; int ind = -1; for (int i = 0; i < s.length(); i++) { if (s[i] != 0 ) break; else ind = i; } s = s.substr(ind + 1); ind = -1; for (int i = 0; i < t.length(); i++) { ...

#include <bits/stdc++.h> using namespace std; int main() { int n, h; cin >> n >> h; vector<pair<int, int>> zeros; int a, b; for (int i = 0; i < n; i++) { cin >> a >> b; zeros.push_back(make_pair(a, b)); } int sol = 0; int pa, pb, ib, c1; pa = zeros[0].first; pb = ...

#include <bits/stdc++.h> const int INF = 0x3f3f3f3f; using namespace std; int a[105], n, dp[105][105][2], cnt = 0; int main() { scanf( %d , &n); cnt = (n + 1) / 2; for (int i = 1; i <= n; ++i) { scanf( %d , &a[i]); if (a[i]) { if (a[i] & 1) --cnt; } } memset(dp, INF...

#include <bits/stdc++.h> using namespace std; int n; string s; int main() { cin >> n; cin >> s; for (int i = 0; i < n; ++i) { int c1 = 0, c2 = 0; for (int j = i - 1; j >= 0; --j) { if (s[j] == L ) { break; } if (s[j] == R ) { ++c1; } ...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int n, m; cin >> n >> m; vector<long long> x(n), y(n); for (int i = 0; i < n; i++) { cin >> x[i] >> y[i]; y[i] -= x[i]; } vector<vector<int>> g(n); for (int i = 0; i < ...

#include <bits/stdc++.h> using namespace std; int main() { int m, n; scanf( %d%d , &n, &m); printf( %d n , m * n / 2); return 0; }

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

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; long long int a[2 * n]; for (int i = 0; i < 2 * n; i++) cin >> a[i]; sort(a, a + (2 * n)); long long int s = 2e19; ; for (int i = 1; i < n; i++) { s = min(s, (a[n * 2 - 1] - a[0]) * (a[n + i - 1] - a[i]...

#include <bits/stdc++.h> using namespace std; using ll = long long; struct node { char type; vector<node*> children; ll dp = 0; ll r = 0; }; node* get(string& s, int& idx) { node* v = new node(); if (s[idx] == * ) { v->type = * ; idx++; return v; } else if (s[id...

#include <bits/stdc++.h> using namespace std; const int maxn = 3e5 + 10; int n, b[maxn]; pair<int, int> a[maxn]; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &a[i].first); a[i].second = i; } sort(a + 1, a + 1 + n); reverse(a + 1, a + 1 + n); for ...

#include <bits/stdc++.h> int main() { int n, x, y, z, sum1 = 0, sum2 = 0, sum3 = 0; scanf( %d , &n); while (n--) { scanf( %d %d %d , &x, &y, &z); sum1 = sum1 + x; sum2 = sum2 + y; sum3 = sum3 + z; } if (sum1 == 0 && sum2 == 0 && sum3 == 0) printf( YES ); else ...

#include <bits/stdc++.h> using namespace std; const long long N = 22; long long a[N]; long long dp[N][N][N]; long long DP(long long pos, long long sum, long long limit) { if (!pos) return 1; if (!limit && dp[pos][sum][limit] != -1) return dp[pos][sum][limit]; long long high = limit ? a[pos] : 9; ...

#include <bits/stdc++.h> using namespace std; long long a[101000]; long long pre[101000]; map<long long, long long> Hash; int main() { int n, k; scanf( %d%d , &n, &k); for (int i = 1; i <= n; i++) scanf( %I64d , &a[i]); for (int i = 1; i <= n; i++) pre[i] = pre[i - 1] + a[i]; Hash[0] = 1; ...

#include <bits/stdc++.h> using namespace std; int mat[4005][4005]; int acum[4005][4005]; int dp[4005][805]; int step(int n, int k, int min_i, int max_i) { dp[n][k] = dp[min_i - 1][k - 1] + (acum[n][n] + acum[min_i - 1][min_i - 1] - acum[n][min_i - 1] - acum[min_i - 1...

#include <bits/stdc++.h> using namespace std; set<int> si; int n, k; bool solve(set<int> &cands, vector<int> &chosen) { if (cands.empty()) { if (chosen.empty()) { return false; } for (int i = 0; i < k; ++i) { int cnt = 0; for (const int num : chosen) { cnt...

#include <bits/stdc++.h> using namespace std; int a[5005], cnt, tmp, nxt, V[5005], j, n, i; long long dp[2][5005], ans; struct LS { int pos, val; } ls[5005]; inline bool cmp(LS aa, LS bb) { return aa.val < bb.val; } int main() { cin >> n; for (i = 1; i <= n; ++i) cin >> a[i], ls[i].val = a[i],...

#include <bits/stdc++.h> using namespace std; int main() { long long int n, d; cin >> n >> d; int t; cin >> t; while (t--) { long long int x, y; cin >> x >> y; long long int eq1 = y * (n - d) - ((n - d) * (x - d)); long long int eq2 = (y - (n - d)) + (x - (n)); long...

#include <bits/stdc++.h> using namespace std; int main() { bool flag = 0, flag2 = 0; long long n, m, c = 0; cin >> n >> m; for (long long i = 0; i < n; i++) { for (long long j = 0; j < m; j++) { if (i % 2 != 0 && c % 2 == 0 && j != m - 1) { cout << . ; flag = 1; ...

#include<bits/stdc++.h> using namespace std; typedef long long int ll; ll mod=1e9+7; int main() { int t; cin>>t; while(t--) { ll n,k; cin>>n>>k; ll ans=1; for(ll i=0;i<k;i++) { ans=(ans*n)%mod; } cout<<ans<<endl; } }

#include <bits/stdc++.h> using namespace std; int _I() { int x; scanf( %d , &x); return x; } const int lmt = 10000000; bool prime[lmt + 5]; int rng = 1, v[lmt + 5]; void sv() { v[0] = 2; for (int i = 4; i <= lmt; i += 2) prime[i] = 1; for (int i = 3; i <= lmt; i += 2) { if (!...

#include <bits/stdc++.h> using namespace std; const long double radian = 180 / acos(-1); int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long x, mini = LLONG_MAX, p; cin >> x; x %= 360; if (x < 0) x = 360 + x; for (int i = 0; i < 4; i++) { if (min...

#include <bits/stdc++.h> using namespace std; template <typename T> inline T sqr(const T &a) { return a * a; } template <typename T> inline int nread(vector<T> &a) { int n; cin >> n; a.clear(); a.resize(n); for (int i = 0; i < n; i++) cin >> a[i]; return n; } template <typena...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 100; long long t; long long n; long long a[N]; long long b[N]; map<long long, long long> ma; int main() { scanf( %lld , &t); while (t--) { ma.clear(); memset(a, 0, sizeof(a)); memset(b, 0, sizeof(b)); scanf...

#include <bits/stdc++.h> using namespace std; int main() { string a, b, c, d; cin >> a >> b >> c >> d; int c1 = 0, c2 = 0, c3 = 0, c4 = 0; if ((a.size() - 2) >= (b.size() - 2) * 2 && (a.size() - 2) >= (c.size() - 2) * 2 && (a.size() - 2) >= (d.size() - 2) * 2) { c1 = 1; } e...

#include <bits/stdc++.h> using namespace std; inline long long read() { long long x; cin >> x; return x; } const int MAX_N = 15; const int MAX_F = (1 << (MAX_N - 2)) + 4; int n, m, nQ, id[MAX_N]; bool isEdge[MAX_N][MAX_N], isParent[MAX_N][MAX_N], isNotParent[MAX_N][MAX_N], isLCA[MAX_N][M...

#include <bits/stdc++.h> using namespace std; int n, k; char playLog[1111]; char posLet[3] = { W , D , L }; int delta[3] = {1, 0, -1}; int val[256]; char dp[1111][2222]; void clearArray() { for (int i = 0; i <= n + 1; i++) { for (int j = -k; j <= k; j++) dp[i][j + k] = X ; } } void ...

#include <bits/stdc++.h> using namespace std; const int shape[4][4][2] = {{{1, 0}, {2, 0}, {1, 1}, {1, 2}}, {{1, 0}, {2, 0}, {2, -1}, {2, 1}}, {{0, 1}, {0, 2}, {-1, 2}, {1, 2}}, {{0, 1}, {0, 2}, {1, 1}, {2, 1}}}; int x, y; ...

#include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; using pll = pair<ll, ll>; const ll inf = 1; const ll mod = 1E9; int main() { int n, m; scanf( %d %d , &n, &m); int colors = 1; vector<vector<int> > mset(n, vector<int>()); vector<vector<int>...

#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; cout << s; reverse(s.begin(), s.end()); cout << s; }

#include <bits/stdc++.h> using namespace std; template <typename T> inline T Max(T a, T b) { return a > b ? a : b; } template <typename T> inline T Min(T a, T b) { return a < b ? a : b; } template <typename T> inline void checkMax(T &a, T b) { if (a < b) a = b; } template <typename T> ...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, k; cin >> n >> k; string s; cin >> s; sort(s.begin(), s.end()); map<char, int> store; for (int i = 0; i < n; i++) { store[s[i]]++; } if (store.si...

#include <bits/stdc++.h> using namespace std; set<int> v; multiset<int> diff; void clean() { if (v.size() < 2) { cout << 0 << endl; return; } cout << *v.rbegin() - *v.begin() - *diff.rbegin() << endl; } int main() { v.clear(); diff.clear(); int n, q; cin >> n >> q; ...

#include <bits/stdc++.h> using namespace std; int const oo = 1e9, bound = 1e6, mod = oo + 7; long long const OO = 1e18; int n, m, k, aa[20]; int cc[20][20]; long long dp[18][1 << 18]; long long rec(int idx, int msk) { long long &ret = dp[idx][msk]; if (ret != -1) return ret; int cop = msk, e =...

#include <bits/stdc++.h> using namespace std; const long long int INF = 98769876987698889LL; const int MOD = 1e9 + 7; const int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1}; const int dy8[] = {0, 1, 1, 1, 0, -1, -1, -1}; const int dx4[] = {1, -1, 0, 0}; const int dy4[] = {0, 0, 1, -1}; const int N = 2e5 + 5; l...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; for (int i = 0; i < t; ++i) { int n, m, h; cin >> n >> m; long long int sum = 0; for (int j = 0; j < n; ++j) { int x; cin >> x; if (j != 0) sum = sum + x; if (j == 0) h = x...

#include <bits/stdc++.h> using namespace std; long long n, k, p; string s; vector<long long> mem; long long solve(int i) { if (mem[i] != -1) return mem[i]; if (i == 0) return 0; long long tmp = stoll(s.substr(i - 1, 1)); long long res = 1ll << 62; for (int j = i - 1; tmp < n; --j) { ...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( avx,avx2,fma ) #pragma GCC optimization( unroll-loops ) using namespace std; const int MX = 2000006; char a[MX], b[MX]; char arb[MX], abr[MX], ba[MX]; int parb[MX], zabr[MX], zba[MX], pos[MX]; void compute_pi(int n, char s[], i...

#include <bits/stdc++.h> #pragma GCC target( avx2 ) #pragma GCC optimization( O3 ) #pragma GCC optimization( unroll-loops ) using namespace std; inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; } inline int msbp(int x) { return 31 - __builtin_clz(x); } inline int msb(int x) { return 1 << ms...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:64777216 ) using namespace std; const long long maxn = 100001; const long long maxk = 200001; const long long maxx = 10001; const long long secret_number = 87468267; const long long inf = 1e18; const int iinf = 2147483647 / 2; const double pi = ...

#include <bits/stdc++.h> using namespace std; using ll = long long; struct p { ll v; int i; } pp[3]; bool cmp(p x, p y) { return x.v < y.v; } void dd() { sort(pp, pp + 3, cmp); ll y = 2 * pp[2].v - pp[0].v - pp[1].v; cout << y << endl; cout.flush(); int x; cin >> x; if (x...

#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); vector<vector<int>> g(n); for (int i = 0; (i) < (int)(n - 1); (i)++) { int a, b; scanf( %d%d , &a, &b); a--, b--; g[a].push_back(b); g[b].push_back(a); } int ans = 0; for (int...

#include <bits/stdc++.h> const double pi = acos(-1.0); int main() { int n; double s, f, r, v, t; scanf( %d %lf %lf , &n, &r, &v); double p = 2 * pi * r; double tp = p / v; while (n--) { scanf( %lf %lf , &s, &f); double x = f - s; double cyc = floor(x / p); double rem ...

#include <bits/stdc++.h> using namespace std; int a[11000][4]; int ans[110][110]; int main() { cin.sync_with_stdio(false); cin.tie(0); int n, m, q; cin >> n >> m >> q; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) ans[i][j] = 0; for (int i = 0; i < q; i++) { int x1;...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; const int K = 18; long long a[N], tree[N << 2], lazy[N << 2]; vector<int> v[N]; int anc[N][K], h[N], sz[N]; int c[N], pos[N]; int ct; void build(int node, int st, int end) { if (st == end) { tree[node] = c[st]; retur...

#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 50; const int LOG = 19; const int INF = 1e9; int m, p[MAXN], par[12][MAXN], nxt[MAXN], id[MAXN], ss[MAXN], ans, l[MAXN], r[MAXN]; int tt[LOG][MAXN], lc[LOG][MAXN]; string s[14]; pair<pair<int, int>, int> vec[MAXN]; int lcp(int ...

#include <bits/stdc++.h> using namespace std; int n, arr[110], c1, c0; int main() { scanf( %d , &n); for (int i = 0; i < n; ++i) scanf( %d , &arr[i]), c1 += arr[i]; int out = 0; for (int i = 0; i < n; ++i) { c0 += (!arr[i]); out = max(out, c0 + c1); c1 -= arr[i]; } cout <...

#include <bits/stdc++.h> using namespace std; struct node { int a; int b; int index; }; bool compare(node &n1, node &n2) { if (n1.a < n2.a) return true; else return false; } bool compare1(node &n1, node &n2) { if (n1.b < n2.b) return true; else return fals...

#include <bits/stdc++.h> using namespace std; int main() { int hy, ay, dy; int hm, am, dm; int h, a, d; cin >> hy >> ay >> dy; cin >> hm >> am >> dm; cin >> h >> a >> d; int res = 1e9; for (int atk = dm + 1; atk <= 200; ++atk) { for (int def = dy; def <= 100; ++def) { i...

#include <bits/stdc++.h> using namespace std; int N, br[20][200200], d[20][200200], lev[200200]; vector<int> in, adj[200200], myc[200200], ans; bool dead[200200]; vector<multiset<int>> m[200200]; multiset<int> sub, best[200200], outofall; int go(int l, int i, int p = -1) { in.push_back(i); for (in...

#include <bits/stdc++.h> using namespace std; map<pair<long long, long long>, long long> m; int main() { long long t, ai, bi, dr = 1; cin >> t; vector<pair<long long, long long>> v(t); for (int i = 0; i < t; i++) { cin >> ai >> bi; v[i] = {ai, bi}; } m[{0, 0}] = 1; dr += mi...

#include <bits/stdc++.h> using namespace std; template <typename T> inline T qmin(const T a, const T b) { return a < b ? a : b; } template <typename T> inline T qmax(const T a, const T b) { return a > b ? a : b; } template <typename T> inline void getmin(T &a, const T b) { if (a > b) a = b...

#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007; const int MAXN = 1500907; vector<vector<long long>> adj; bool visited[MAXN]; long long n_nodes; long long n_edges; void dfs(int node) { visited[node] = 1; n_nodes++; for (auto i : adj[node]) { n_edges++; ...

#include <bits/stdc++.h> using namespace std; set<long long> num; void f(int x, int a, int b, long long now) { if (x == 0) { num.insert(now); return; } if (a) f(x - 1, a - 1, b, now * 10 + 4); if (b) f(x - 1, a, b - 1, now * 10 + 7); } void init() { int i; for (i = 1; i <= ...

#include <bits/stdc++.h> using namespace std; int main(void) { int n; scanf( %d , &n); long a[n]; long long s = 0, ss = 0; for (int i = 0; i < n; i++) { scanf( %ld , &a[i]); s += a[i]; } if (s % 3 != 0) { printf( 0 n ); return 0; } s = s / 3; vector<in...

#include <bits/stdc++.h> using namespace std; int main() { int n, m, i, j, a[110], b[110], a1, b1; cin >> n >> m; for (i = 0; i <= n; i++) cin >> a[i]; for (i = 0; i <= m; i++) cin >> b[i]; a1 = a[0], b1 = b[0]; if (n > m) { if (a1 * b1 > 0) cout << Infinity << endl; el...

#include <bits/stdc++.h> using namespace std; long long int MOD = 1e9 + 7; const long long int INF = 1e18; long long int sub(long long int a, long long int b, long long int p = MOD) { return ((a % p) - (b % p) + p) % p; } long long int mult(long long int a, long long int b, long long int p = MOD) { ...

#include <bits/stdc++.h> using namespace std; template <int V, class T = long long> class max_flow { static const T INF = numeric_limits<T>::max(); struct edge { int t, rev; T cap, f; }; vector<edge> adj[V]; int dist[V]; int ptr[V]; bool bfs(int s, int t) { memset(dis...

#include <bits/stdc++.h> using namespace std; int main() { long long int n; scanf( %lld , &n); long long int i; for (i = 2; i * i <= n; i++) { while (n % (i * i) == 0) n /= i; } printf( %lld n , n); return 0; }

#include <bits/stdc++.h> using namespace std; int n, m, s, i, j, k; bool A[301][301]; char str[301]; int main() { scanf( %d%d%d , &n, &m, &s); for (i = 0; i < n; i++) { scanf( %s , str); for (j = 0; j < m; j++) A[i][j] = str[j] == * ; } for (i = 1; 2 * i + 1 <= min(n, m); i++) { ...

#include <bits/stdc++.h> using namespace std; const int nm = 100002; int n, d; long long x; int a[nm], b[nm], vt[nm]; int c[nm]; int nc; int getNextX() { x = (x * 37 + 10007) % 1000000007; return x; } void init() { int i; for (i = 0; i < n; i = i + 1) { a[i] = i + 1; } ...

#include<cstdio> int t,n; int vx[13][2003]; int vy[13][2003]; int fx[13][2003]; int lx[13][2003]; int fy[13][2003]; int ly[13][2003]; int a[2003][2003]; int main() { scanf( %d ,&t); while(t--) { scanf( %d ,&n); for(int i=1;i<=n;++i) { for(int j=1;j<=n;++j) { sc...

#include <bits/stdc++.h> using namespace std; const long long PR = 1000000009; int n, m, premin[100009], sufmax[100009]; char A[100009], B[100009]; int main() { ios::sync_with_stdio(false); cin >> A >> B; n = strlen(A); m = strlen(B); for (int i = 0; i < m; i++) premin[i] = n, sufmax[i] = ...

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

#include <bits/stdc++.h> using namespace std; int n, k; string a; int change(char c) { int j = 0, i = 0, ans = 0, cont = 0; for (i = 0; i < n; i++) { if (a[i] == c) cont++; if (cont > k) { while (cont > k) if (a[j++] == c) cont--; } ans = max(ans, i - j + 1); ...

#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > g[100100]; int fa[100100][18], typ[100100], n; int sum[100100][2], dep[100100]; void dfs(int u) { for (int i = 1; i < 18; ++i) fa[u][i] = fa[fa[u][i - 1]][i - 1]; for (auto v : g[u]) { int A = v.first, tp = v.second; sum...

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

#include <bits/stdc++.h> int cicle[300] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, ...

#include <bits/stdc++.h> const int mod = 1e9 + 7; const int N = 3e5 + 1; using namespace std; void err(istream_iterator<string> it) {} template <typename T, typename... Args> void err(istream_iterator<string> it, T a, Args... args) { cerr << *it << = << a << ; err(++it, args...); } long l...

#include <bits/stdc++.h> using namespace std; long long n, q; struct interv { long long l, r, ubonus, lbonus; interv(long long L, long long R, long long UBONUS, long long LBONUS) { l = L; r = R; ubonus = UBONUS; lbonus = LBONUS; } bool operator<(const interv& x) const { ret...

#include <bits/stdc++.h> using namespace std; inline void solve() { long long n; cin >> n; vector<bool> isp(n + 1, 1); vector<long long> maxx(n + 1, -1); isp[0] = isp[1] = 0; for (long long i = 2; i <= n; i++) { if (isp[i]) { if (i * 2 <= n) { for (long long j = i * 2...

#include <bits/stdc++.h> using namespace std; long long n, m, k, y, a, b, c; long long A[2005]; bool B[2005]; int main() { cin >> n >> k; priority_queue<pair<int, int> > pq; for (int i = int(0); i < int(n); i++) { cin >> A[i]; pq.push({A[i], i}); } int ans = 0; for (int i =...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; int n; int seq[N]; vector<int> zli[N]; int res[N]; int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %d , seq + i); seq[i] = n - seq[i]; zli[seq[i]].push_back(i); } int rodzaj = 0; ...

#include <bits/stdc++.h> int find_min(int pos, int target) { int right = -1; for (int i = 0; right == -1; i++) if ((pos + i) % 26 == target) right = i; int left = -1; for (int i = 0; left == -1; i++) if ((pos - i + 26 * 2) % 26 == target) left = i; return std::min(right, left); } i...

#include <bits/stdc++.h> using namespace std; const double PI = acos(-1); const long long MOD = 998244353; struct node { int v; node *d, *r; }; node a[1050][1050]; long long n, m, q; void solve() { cin >> n >> m >> q; for (int i = (int)(1); i <= (int)(n); i += 1) { for (int j = (in...

#include <bits/stdc++.h> using namespace std; const int maxn = 50, maxm = 5e3 + 100; int n, lim, f[maxn + 3], s[maxn + 3]; double p[maxn + 3], q[maxn + 3], dp[maxn + 3][maxm + 3]; bool check(double x) { for (int i = n; i; i--) { for (int j = lim + 1; j <= lim + 100; j++) { dp[i + 1][j] = x; ...

#include <bits/stdc++.h> using namespace std; int main() { int n, ans = 0; bool flag = false; int a[105]; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 1; i < n; i++) { if (a[i] == 2) { if (a[i - 1] == 1) { if (i >= 2 && a[i - 2] == 3) an...

#include <bits/stdc++.h> using namespace std; const int matmul[][6] = {{2, 1, 1, 1, 0, 0}, {1, 2, 1, 1, 0, 0}, {1, 0, 1, 0, 0, 0}, {0, 1, 0, 1, 0, 0}, {1, 1, 1, 1, 1, 0}, {2, 2, 2, 2, 1, 1}}; long long N, sx, sy, dx, dy, t; struct matrix { int m, n; ...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); int n, m; cin >> n >> m; int ver[n + 1]; ver[n] = 1e9; for (int i = 0; i < n; i++) cin >> ver[i]; int hor[m]; for (int i = 0; i < m; i++) { int x1, x2, y; cin >> x1 >> x2 >> y; if (x...

#include <bits/stdc++.h> const int md = 1e9 + 7; const long long hs = 199; using namespace std; int n, x; set<int> a; int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> n; for (int i = 1; i <= n; i++) a.insert(i); cout << 1 ; while (--n) { cin >> x; a.era...

#include <bits/stdc++.h> using namespace std; int setBite(int r, int pos) { return r | (1 << pos); } int resetBit(int r, int pos) { return r & ~(1 << pos); } bool checkBit(int r, int pos) { return (r & (1 << pos)); } bool leap(long long x) { if ((x % 4 == 0 && x % 100 != 0) || x % 400 == 0) return true; ...

#include <bits/stdc++.h> using namespace std; long long int m; long long int a; long long int b; set<int> s; long long int im(long long int val, int dv) { long long int z = 0; long long int U = (1LL + val / dv) * (val / dv) / 2LL; U *= dv; U -= (val / dv) * (dv - (val % dv) - 1); return ...

#include <bits/stdc++.h> using namespace std; int main() { long long n; int a = 0; cin >> n; long long tp = n; for (long long i = 2; i <= sqrt(tp); i++) { if (tp % i == 0) { while (tp % i == 0) tp /= i; a = i; break; } } if (a == 0) cout << n; ...

#include <bits/stdc++.h> using namespace std; map<string, int> Map; char str[2200][22]; int p[2200], q[2200]; int main() { int num, n, k1, k2, cnt; char s1[22], s2[22]; while (scanf( %d , &n) != EOF) { memset(p, 0, sizeof(p)); memset(q, 0, sizeof(q)); cnt = 1; num = 0; ...

#include <bits/stdc++.h> using namespace std; int a[100002]; int gcd(int a, int b) { int c; while (a != 0) { c = a; a = b % a; b = c; } return b; } int main() { int n; int mina = 2000000009; cin >> n; cin >> a[1]; int ucln; ucln = a[1]; for (long l...

#include <bits/stdc++.h> using namespace std; int maxx = 1e6 + 10; int up(int a, int b) { if (a % b) return a / b + 1; else return a / b; } int main() { int t; scanf( %d , &t); while (t--) { int n, d; scanf( %d%d , &n, &d); bool flag = 0; for (int x = 0;...

#include <bits/stdc++.h> using namespace std; long long int mod = 998244353; long long int expo(long long int base, long long int exponent, long long int mod) { long long int ans = 1; while (exponent != 0) { if (exponent & 1) ans = (1LL * ans * base) % mod; base = (1LL * b...

#include <bits/stdc++.h> using namespace std; const int Maxn = 55; long long dp[Maxn][10]; int main() { string k; cin >> k; int n = k.length(); for (int i = 0; i < 10; i++) { dp[0][i] = 1; } for (int i = 1; i < n; i++) { int t = k[i] - 0 ; for (int j = 0; j < 10; j++) ...

#include <bits/stdc++.h> using namespace std; const long long M = 1000000007; const double pi = acos(-1); const int N = 2e5 + 10; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); ; long long n, k, m, d, q = 1, ans = 0; cin >> n >> k >> m >> d; for (long lon...

#include <bits/stdc++.h> using namespace std; const int N = 105; const int M = 1005; int n, m, x[N], s; double p[N * M], tmp[N * M]; int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; ++i) scanf( %d , &x[i]); for (int i = 1; i <= n; ++i) s += x[i]; if (m == 1) { puts( 1.000000...

#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; const int M = 1e6 + 10; int n, m, x, y, a[N], f[M]; bitset<N> ans, tmp; int main() { scanf( %d%d%d , &n, &x, &y); for (int i = 1; i <= n + 1; i++) { scanf( %d , &a[i]); tmp.set(a[i]); } for (int i = 1; i <= n +...

#include <bits/stdc++.h> using namespace std; int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1}; long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int n, m; ...

#include <bits/stdc++.h> const int N = 200010; std::vector<int> e[N]; int color[N], dep[N]; bool vis[N]; int n, k; int max = 0; void dfs(int u, int fa) { max = std::max(max, dep[u]); for (auto v : e[u]) { if (vis[v] || v == fa) { continue; } dep[v] = dep[u] + 1; dfs...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long n1, m; cin >> n1 >> m; string s; cin >> s; long long n; n = s.size(); long long lps[n]; lps[0] = 0; long long i, j; if (m == 0) { ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 100010; const int INF = 0x7f7f7f7f; const double pi = 4.0 * atan(1.0); int cases; struct Segment_Tree { long long lazy[MAXN << 2]; long long data[MAXN << 2]; long long flag[MAXN << 2]; void pushup(int o) { data[o] = data[(o...

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

#include <bits/stdc++.h> using namespace std; struct num2 { static const int MB = 1e9 + 9; int b; num2() {} num2(int x) : b(x) {} num2 operator+(const num2& x) const { return num2((b + x.b) % MB); } num2 operator-(const num2& x) const { return num2((b + MB - x.b) % MB); } num2 operator*(...