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

func_code_string stringlengths 59 71.4k
#include <iostream> #include <vector> #include <queue> #include <algorithm> using ll = long long; #define MIN(a, b) (((a) < (b)) ? (a) : (b)) #define MAX(a, b) (((a) < (b)) ? (b) : (a)) int const nmax = 400; int const modulo = 998244353; int d[1 + nmax][1 + nmax]; std::vector<int> g[1 + nma...
#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { return a % b ? gcd(b, a % b) : b; } int main() { int n; while (cin >> n) { int sum = 0; for (int i = 2; i < n; i++) { int t = n; while (t) { sum += t % i; t /= i; } } i...
#include <bits/stdc++.h> using namespace std; int main() { int n; double arr[105]; scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %lf , &arr[i]); sort(arr, arr + n); reverse(arr, arr + n); double Max = 0; double prev = 0, a = 0, b = 1; for (int i = 0; i < n; i++) { a =...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:1024000000,1024000000 ) using namespace std; const long long inf = 0x3f3f3f3f3f3f3f3f; const int maxn = 100005; int main() { int n; long long r; scanf( %d %lld , &n, &r); n = 1 << n; int c[n]; double sum = 0; for (int i = 0; ...
#include <bits/stdc++.h> using namespace std; const int maxn = 55; const int maxm = 5e3 + 110; double dp[maxn][maxm]; struct node { int f, s; double p; } a[maxn]; int main() { int n, R; scanf( %d %d , &n, &R); for (int i = 1; i <= n; i++) { scanf( %d %d %lf , &a[i].f, &a[i].s, &a...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 7; int a[maxn]; int b[maxn]; int n; vector<pair<int, int>> v; void borrow(int pos, int val) { if (val == 1) { if (a[pos + 1] == 0) borrow(pos + 1, -1); if (v.size() >= 100000) return; v.push_back(make_pair(pos, -1))...
#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > g[110]; char s[2]; int n, m, x, y, f[110][110][27]; int dp(int x, int y, int k) { if (f[x][y][k] != 0) return f[x][y][k]; int ret = 1; for (auto e : g[x]) if (e.second >= k) ret = min(ret, dp(y, e.first, e.second)); f[...
#include <bits/stdc++.h> using namespace std; int d[2005]; queue<int> q; int main() { int n, k, i, a; scanf( %d %d , &n, &k); for (i = 0; i <= 2000; i++) d[i] = 999999; for (i = 1; i <= k; i++) { scanf( %d , &a); d[a - n + 1000] = 1; } for (i = 0; i <= 2000; i++) if (d[...
#include <bits/stdc++.h> using namespace std; int main() { string a, b; cin >> a; cin >> b; std::reverse(a.begin(), a.end()); if (a == b) cout << YES << endl; else cout << NO << endl; return 0; }
#include <bits/stdc++.h> using namespace std; char s[500010]; int n, m, ver[500010], hor[500010]; bool b; void calc(int i, int j, int k) { if (!b) return; int x = (k < 3) ? 1 : 2; if (j % 2) x = 3 - x; if (hor[i] == 0) hor[i] = x; else if (hor[i] != x) { b = false; return...
#include <bits/stdc++.h> using namespace std; #pragma optimize( -O3 ) int cnt; int t[1200005]; int lazy[1200005]; long long int ans[300005]; void push(int v, int tl, int tr) { int tm = (tl + tr) / 2; if (lazy[v] == 2) { t[v * 2] = tm - tl + 1; t[2 * v + 1] = tr - tm; lazy[2 * v] ...
#include <bits/stdc++.h> using namespace std; #pragma warning(disable : 4996) #pragma comment(linker, /STACK:256000000 ) FILE *stream; const int INF = 1e9 + 7; const long long INFL = (long long)1e18 + 1; const int SIZE = 2e5 + 10; const int TSIZE = 1e3 + 10; const long double eps = 0.000001; const ...
#include<bits/stdc++.h> using namespace std; typedef long long ll; const int maxn=200010; int a[maxn],f[maxn]; int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); int t,n; cin>>t; while(t--){ memset(f,0,sizeof(f)); cin>>n; for(int i=0;i<n;i++)...
#include <bits/stdc++.h> using namespace std; int main() { int n, x, m, a[100005] = {}; cin >> n; m = n; while (n--) { cin >> x; a[x] = 1; while (a[m]) { cout << m << ; m--; } cout << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; int i, a, v, max, min, min1; cin >> a; max = min = a; for (i = 1; i < n; i++) { cin >> v; if (v > max) max = v; if (v < min) min = v; } cin >> a; min1 = a; for (i = 1; i < m;...
#include <bits/stdc++.h> using namespace std; string dp_func(string str) { if (str.size() & 1) return str; string gf, my; for (int i = 0; i < str.size() / 2; i++) my += str[i]; for (int i = str.size() / 2; str[i]; i++) gf += str[i]; string pts = dp_func(gf); string rts = dp_func(my); if ...
#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0, f = 1; char c = getchar(); while (c < 0 \|\| c > 9 ) c = getchar(); while (c <= 9 && c >= 0 ) x = x * 10 + c - 0 , c = getchar(); return x * f; } const int maxn = 500007 * 30; int rt = 0; struct Segtree { ...
#include <bits/stdc++.h> using namespace std; int n, m; int a[1010][1010]; bool got[1010][1010]; bool ok(int x) { memset(got, 0, sizeof(got)); for (int j = 0; j < m; j++) { vector<int> vt; for (int i = 0; i < n; i++) if (a[i][j] >= x) vt.push_back(i); for (int o = 0; o < vt.s...
#include <bits/stdc++.h> using namespace std; const long long OO = (long long)5e3 + 555; void ndr() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); } int divi(long long N) { int cnt(0); for (long long i = 1; i <= sqrt(N); i++) { if (N % i == 0) { if (N / i == i) cnt++; ...
#include <bits/stdc++.h> using namespace std; const int MAX_N = 5e3 + 10; const int MOD = 1e9 + 7; int n; char s[MAX_N]; int dp[26][MAX_N]; int sum[MAX_N]; int cb[MAX_N][MAX_N]; int main() { int i, l, j; scanf( %d , &n); scanf( %s , s + 1); cb[0][0] = 1; for (i = 1; i <= n; i++) { ...
#include <bits/stdc++.h> using namespace std; string simplify(string s) { string a; for (int i = 0; i < s.length(); i++) { if (isalpha(s[i])) { s[i] = tolower(s[i]); a.push_back(s[i]); } } return a; } int main() { ios::sync_with_stdio(0); cin.tie(NULL); st...
#include <bits/stdc++.h> using namespace std; int i, x, y; int main() { cin >> x >> y; i = 1; while (1 != 0) { if (i % 2 == 1) { if (x >= 2 && y >= 2) { x -= 2; y -= 2; i++; } else if (y >= 12 && x >= 1) { y -= 12; x -= 1; ...
#include <bits/stdc++.h> using namespace std; int n, q; int arr[123456]; int prW[123556]; int leNM[123456]; int main() { cin >> n >> q; n--; int a, b; cin >> a; for (int i = 1; i <= (n); ++i) { cin >> b; arr[i] = abs(a - b); a = b; } vector<pair<int, int> > stac...
#include <bits/stdc++.h> using namespace std; int n, k; string s1, s2; vector<pair<string, string> > ans; map<string, int> u; int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> s1 >> s2; map<string, int>::iterator it = u.find(s1); if (it == u.end()) { u[s1] = k, u...
#include <bits/stdc++.h> using namespace std; int nr, K, mod, ans[33], v[70]; long long N; struct matrix { int a[33][33]; matrix() { memset(a, 0, sizeof(a)); } matrix(bool type) { memset(a, 0, sizeof(a)); if (type == 1) for (int i = 0; i <= K; i++) a[i][i] = 1; } } dp[70][3...
#include <bits/stdc++.h> using namespace std; long long a[200000]; map<long long, bool> mm; int main() { int n, t, k, d; cin >> n >> t >> k >> d; int res0 = 0, res1 = 0, sum0 = 0, sum1 = 0; while (sum0 < n) res0 += t, sum0 += k; for (int i = 1; i <= 10000; i++) { if (i % t == 0) sum1 +...
#include <bits/stdc++.h> using namespace std; const long long N = 1e6 + 10, mod = 1e9 + 7; long long ans = 1, t, n, a, b, f[N]; int main() { scanf( %lld , &n); f[0] = f[1] = 1; for (long long i = 2; i <= n; i++) f[i] = (f[i - 1] + f[i - 2] * (i - 1) % mod) % mod; for (long long i = 1; i <=...
#include <bits/stdc++.h> using namespace std; string s, t; bool B1[1000001]; bool B2[1000001]; vector<int> R; int main() { int n; getline(cin, s); getline(cin, t); int i = 0; bool b = true; while (i < t.size()) { if (t[i] != s[i]) b = false; B1[i] = b; i++; } ...
#include <bits/stdc++.h> using namespace std; char s[1000001]; int main() { int n, v = 0; cin >> n; sprintf(s, %X , n); for (int i = 0; i < strlen(s); i++) { if (s[i] == 0 \|\| s[i] == 4 \|\| s[i] == 6 \|\| s[i] == 9 \|\| s[i] == A \|\| s[i] == D ) v++; else if (s[i...
#include <bits/stdc++.h> using namespace std; unordered_map<int, int> errors; void get_codes(unordered_map<int, int>& quantity, int cnt, int inc) { for (int i = 0; i < cnt; i++) { int code; cin >> code; quantity[code] += inc; } } int main() { ios_base::sync_with_stdio(0); int...
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; const int INF = 0x3f3f3f3f; const int mod = 1e9 + 7; int head[10010], cnt = 1, cur[10010], dis[N], s, t; struct edge { int next, to, w; } e[N << 1]; struct query { int u, t; } q[N]; int main() { auto add = [&](int u, i...
#include <bits/stdc++.h> using namespace std; pair<int, string> a[3005]; int h[3005]; vector<pair<string, int> > ans; int main() { int n, m; cin >> n; for (int i = 0; i < n; i++) cin >> a[i].second >> a[i].first; sort(a, a + n); for (int i = 0; i < n; i++) if (a[i].first > i) { ...
#include <bits/stdc++.h> using namespace std; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int t; cin >> t; while (t--) { long long int a[3]; cin >> a[0] >> a[1] >> a[2]; sort(a, a + 3, greater<long long int>()); if (a[0]...
#include <bits/stdc++.h> using namespace std; long long int p, pre, k, cnt; vector<long long int> ans; int main() { scanf( %lld %lld , &p, &k); if (p < k) { printf( 1 n%lld n , p); return 0; } pre = p; while (1) { cnt = (k - pre); if (cnt <= 0) { cnt = cnt / k...
#include <bits/stdc++.h> using namespace std; int n; long long v1, v2; vector<int> sz; vector<vector<pair<int, int>>> g; void dfs(int u, int p, int c) { sz[u] = 1; for (auto &e : g[u]) { int v = e.first; if (v == p) continue; dfs(v, u, e.second); sz[u] += sz[v]; } v1 ...
#include <bits/stdc++.h> using namespace std; int a[205], b[205]; long long dp[205][205], k; int n, m; char ans[205]; bool cmp(int x, int y) { return a[x] < a[y]; } int main() { scanf( %d%d , &n, &m); cin >> k; int t = n + m - 1; for (int i = 0; i < t; i++) { a[i] = n * m; b[i]...
#include <bits/stdc++.h> const int base = 1000000000; const int base_digits = 9; struct bigint { std::vector<int> z; int sign; bigint() : sign(1) {} bigint(long long v) { *this = v; } bigint(const std::string &s) { read(s); } void operator=(const bigint &v) { sign = v.sign; z =...
#include <bits/stdc++.h> using namespace std; const int nmax = 16, MX = 16 * 2000 + 42; int n, k, inp[nmax]; int outp[nmax]; void print() { vector<pair<int, int> > active; cout << YES << endl; for (int i = 0; i < n; i++) active.push_back({inp[i], outp[i]}); for (int t = 1; t < n; t++) { ...
#include <bits/stdc++.h> using namespace std; vector<long long> v[2000006], pp[2000006]; long long first[2000006], cur = 0, w[2000006], n, m, i, xx, second, d, h, ans, w1, p, tt, o, temp, t; void dfs(long long node, long long l) { if (node > n) return; long long i, j; fir...
#include <bits/stdc++.h> using namespace std; int n; map<int, long long> ans; inline long long go(int n) { if (ans.find(n) != ans.end()) return ans[n]; long long cur = n + 1; for (int i = 2; i * i <= n; ++i) { if (n % i == 0) { cur = max(cur, n + go(i)); cur = max(cur, n + go(n...
#include <bits/stdc++.h> using namespace std; int n, m, d; bool ck[100005]; vector<int> adj[100005]; int dep[100005], ans; void dfs(int u, int p) { dep[u] = (ck[u] ? 0 : -(1 << 20)); for (int i = 0; i < adj[u].size(); ++i) { int v = adj[u][i]; if (v == p) continue; dfs(v, u); ...
#include<bits/stdc++.h> #define ll long long using namespace std; int x[100005]; int idx=0; int d[100005]; int main() { int t; cin>>t; while(t--){ int n; cin>>n; idx=0; for(int i=1;i<=n;i++){ scanf( %d ,&x[i]); } ...
#include <bits/stdc++.h> using namespace std; int main() { int n, ans = 1; scanf( %d , &n); for (int i = 2; i <= n / 2; i++) { if (n % i == 0) ans++; } printf( %d n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; template <class T> ostream &operator<<(ostream &os, const vector<T> &v) { for (T i : v) os << i << , ; return os; } template <class T> ostream &operator<<(ostream &os, const set<T> &v) { for (T i : v) os << i << ; return os; } template <...
#include <bits/stdc++.h> using namespace std; const int maxn = 100000 + 10; const int maxm = 100 + 10; const int inf = 0x3f; long long f[maxm][maxn], D[maxn], H[maxn], T[maxn], q[maxn]; long long g[maxn]; int N, M, P; long long A[maxn], S[maxn]; void init() { sort(A + 1, A + 1 + M); for (int i...
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5, M = 1e9 + 7; const unsigned long long base = 13331; const double Pi = acos(-1.0); const long long C = 299792458; inline int read() { int x = 0, f = 1; char ch = getchar(); while (ch < 0 \|\| ch > 9 ) { if (ch == - ) f =...
#include <bits/stdc++.h> using namespace std; const int maxn = 25; inline int getDis(pair<int, int> a, pair<int, int> b) { return (b.first - a.first) * (b.first - a.first) + (b.second - a.second) * (b.second - a.second); } pair<int, int> G[maxn]; int dp[1 << maxn]; int dis[maxn][maxn], rout...
#include <bits/stdc++.h> #pragma warning(disable : 4786) #pragma comment(linker, /STACK:102400000,102400000 ) using namespace std; const int INF = 0x3f3f3f3f; const int mod = 1e9 + 7; const double PI = acos(-1.0); const double eps = 1e-6; const int maxn = 2e5 + 5; int isu[maxn], sz[maxn], dis[maxn], ...
#include <bits/stdc++.h> using namespace std; int main() { long long int n, m, i; cin >> n; long long int arr1[n]; for (i = 0; i < n; i++) cin >> arr1[i]; cin >> m; long long int arr2[m]; for (i = 0; i < m; i++) cin >> arr2[i]; sort(arr1, arr1 + n); sort(arr2, arr2 + m); cout...
#include <bits/stdc++.h> using namespace std; int sg[100005], sgp[100005]; int main() { int n; cin >> n; if (n <= 2) { cout << -1 ; return 0; } sg[0] = sg[1] = sg[2] = 0; for (int i = 3; i <= n; ++i) { int cnt[105] = {0}; for (int d = 2; d <= i; ++d) { int ...
#include <bits/stdc++.h> using namespace std; int main() { int i, j, n, a, b, c, ret = 0, t; scanf( %d %d %d %d , &n, &a, &b, &c); n = 10; for (i = 0; i <= a; i++) for (j = 0; j <= b; j++) { t = (i 5); t += (j * 10); if (n - t < 0) continue; if ((n - t) % 20 ...
#include <bits/stdc++.h> using namespace std; long long parse(string s) { long long k = 1, ret = 0; for (int i = 0; i < s.size(); i++) ret += k * (long long)(s[s.size() - i - 1] - 0 ), k *= 4; return ret; } string change(string s) { string ret = s; for (int i = 0; i < ret.size(); i++)...
#include <bits/stdc++.h> inline long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } inline void sub(long long &a, long long b) { a -= b; if (a < 0) a += 1000000007; } inline void add(long long &a, long long b) { a += b; if (a >= 1000000007) a -= 1000000007; } template <...
#include <bits/stdc++.h> const int N = 1e5 + 10; const int MOD = 1e9 + 7; const int INF = 2e9; const long long INFLL = 1e18; const double PI = acos((double)-1); inline int mult(int a, int b, int p = MOD) { return (1ll * a * b) % p; } inline int add(int a, int b, int p = MOD) { return (1ll * a + b) % p; } ...
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; if (n == 1 and k == 10) { cout << -1 ; } else if (k == 10) { cout << 1 ; for (int i = 1; i < n; i++) { cout << 0 ; } } else { for (int i = 0; i < n; i++) { cout <<...
#include <bits/stdc++.h> using namespace std; int in() { int x; scanf( %d , &x); return x; } int main() { ios::sync_with_stdio(false); long long k, d, t; cin >> k >> d >> t; t = 2; long long p = (k + d - 1) / d d; long double res = t / (p + k) * p; t %= (p + k); if...
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 23; long long f[maxn][3][2]; int a[maxn], n; int main() { cin >> n; for (int i = 1; i <= n; i++) scanf( %d , &a[i]); if (n == 1) { return 0 * printf( %d , a[1]); } for (int i = 0; i <= n; i++) { for (int j = 0...
#include <bits/stdc++.h> using namespace std; int n; double arr[550]; int m; int main() { cin >> n >> m; for (int i = 1; i <= n; i++) cin >> arr[i]; double ans = 0; for (int i = 1; i <= m; i++) { int u, v; double w; cin >> u >> v; cin >> w; double rr = (arr[u] + a...
#include <bits/stdc++.h> using namespace std; using namespace std; const long double PI = acos(-1.0); long long diff[200010]; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); ; int T, j, t, i, buckN = 1; int N = 1; scanf( %d , &T); long long sum = 0, a, x, lE = 0; whil...
#include <bits/stdc++.h> using namespace std; int main() { string arr[3]; for (int i = 0; i < 3; i++) { cin >> arr[i]; for (int j = 0; j < arr[i].size(); j++) if (arr[i][j] == ; \|\| arr[i][j] == - \|\| arr[i][j] == _ ) { arr[i].erase(j, 1); j--; } for ...
#include <bits/stdc++.h> using namespace std; int fir[201], tot, in[201], In[201]; int nxt[400201], to[400201]; inline void add_edge(int u, int v) { to[++tot] = v; nxt[tot] = fir[u]; fir[u] = tot; } int n, c[201], cc[4][201]; queue<int> q[5]; inline int solve(int x) { int ans = 0; fo...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10; const int inf = 0x3f3f3f3f; int main() { long long n, m, k, p[maxn], ans = 0, sub = 0; cin >> n >> m >> k; for (int i = 1; i <= m; i++) { scanf( %lld , &p[i]); p[i]--; } for (int i = 1; i <= m; i++) { ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1 * 1000 + 10; int ans[MAXN][MAXN]; int main() { ios::sync_with_stdio(false); int n, d, k; cin >> n; vector<int> a(n), b(n); for (int i = 0; i < n; i++) { cin >> a[i]; b[i] = a[i]; } sort(a.begin(), a.end(), [...
#include <bits/stdc++.h> using namespace std; int dp[2010][2010], a[2010]; int gcd(int a, int b) { if (b == 0) return a; return gcd(b, a % b); } int main() { int n, i, j, ans, mn, cnt; scanf( %d , &n); cnt = 0; for (i = 0; i < n; i++) { scanf( %d , a + i); if (a[i] == 1) cn...
#include <bits/stdc++.h> using namespace std; long long a[1000005]; int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) { scanf( %lld , &a[i]); } sort(a + 1, a + 1 + n); int x = 1; int y = n; long long ans = 0; while (x < y) { ans += abs(a[y] ...
#include <bits/stdc++.h> const int inf = 1e9 + 7; const int mod = 998244353; namespace __________ { namespace _in { template <class T> inline T read() { char ch; bool flag = 0; T x = 0; while (ch = getchar(), !isdigit(ch)) if (ch == - ) flag = 1; while (isdigit(ch)) x = x * 10 + c...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); long long T, N, M; cin >> T; while (T--) { cin >> N >> M; N /= M; long long Sum = 0, Ans = 0; long long digits[20]; for (int i = 1; i <= 10; i++) Sum += (digits[i...
#include <bits/stdc++.h> const int INF = 0x3f3f3f3f; const int NINF = -INF - 1; const int N = 2e5 + 5; using namespace std; char a[N]; int c[N]; int b[26]; int main() { int n, ans = 0, maxn = -1000000; scanf( %d , &n); scanf( %s , a); for (int i = 0; i < n; i++) { ans = 1; fo...
#include <bits/stdc++.h> using namespace std; int main() { int n, finall = 0, t1 = 0; vector<string> v; cin >> n; int cop = n; while (n--) { string s; cin >> s; v.push_back(s); } for (int j = 0; j < 7; j++) { t1 = 0; for (int k = 0; k < cop; k++) t1 += v[k][...
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f, N = 2e5 + 5; inline int read() { int sum = 0, f = 1; char c = getchar(); while (c > 9 \|\| c < 0 ) { if (c == - ) f = -f; c = getchar(); } while (c >= 0 && c <= 9 ) sum = sum * 10 + c - 48, c = getchar()...
#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; void yes() { cout << Yes << n ; } void no() { cout << No << n ; } struct Sync_stdio { Sync_stdio() { cin.tie(NULL); ios_base::sync_with_stdio(false); } } _sync_stdio; struct ...
#include <bits/stdc++.h> int main() { char abc[105]; scanf( %s , abc); int n = strlen(abc); int i = 0; int max = 1, count = 0; while (i < n) { if (abc[i] == A \|\| abc[i] == E \|\| abc[i] == I \|\| abc[i] == O \|\| abc[i] == U \|\| abc[i] == Y ) { if (max < count + 1) ...
#include <bits/stdc++.h> using namespace std; int find(int a[], int n) { int max = 1; int m = a[1]; for (int i = 2; i < n; i++) { if (m <= a[i]) { max = i; m = a[i]; } } return max; } int main() { int c = 0; int n; cin >> n; int a[n]; cin >> a[...
#include <bits/stdc++.h> using namespace std; int main() { int n, m; while (cin >> n >> m) { int i; for (i = 1; i <= n; i++) { int k = m - 2, t = m; if (i % 2) while (t--) cout << # ; else { cout << (i % 4 ? . : # ); while (k--) cout << ...
#include <bits/stdc++.h> using namespace std; const int N = 400005; vector<int> adj[N]; vector<int> st; int cTime = 1; int in[N]; int low[N]; vector<vector<int>> comps; map<array<int, 2>, int> edgeToI; array<int, 2> res[N]; int edgeToIndex(int a, int b) { return edgeToI[{min(a, b), max(a, b)}]; } ...
#include <bits/stdc++.h> using namespace std; int hed[600010], nxt[600010], to[600010], cnt; inline void addedge(int u, int v) { nxt[++cnt] = hed[u]; hed[u] = cnt; to[cnt] = v; } int siz[300010], root[300010], ans[300010]; int mx[300010]; int id[6000010], son[6000010][2], tot; int n, q; in...
#include <bits/stdc++.h> using namespace std; int main() { int n, k, temp, prev, A[100005]; bool f = false; cin >> n >> k; for (int i = 0; i < n; i++) { cin >> A[i]; } for (int i = 0; i < k; i++) { cin >> temp; } if (k == 1) { if (n == 1) { cout << Yes ; ...
#include <bits/stdc++.h> using namespace std; map<char, pair<int, int> > ins; void operator+=(pair<int, int> &i, pair<int, int> &j) { i.first += j.first, i.second += j.second; } int main() { ins[ U ] = pair<int, int>(0, 1), ins[ D ] = pair<int, int>(0, -1), ins[ L ] = pair<int, int>(-1, 0), ins[ R...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; long long a[n]; vector<long long> pref(n + 1, 0); for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n; i++) { pref[i + 1] = pref[i] + a[i]; } map<long long, int> m; m[0] = 0; long lon...
#include <bits/stdc++.h> namespace ZDY { #pragma GCC optimize(3) template <class T> __inline__ __attribute__((always_inline)) T ABS(T x) { return x > 0 ? x : -x; } template <class T> __inline__ __attribute__((always_inline)) T MAX(T x, T y) { return x > y ? x : y; } template <class T> __inli...
#include <bits/stdc++.h> using namespace std; pair<int, int> a[100007]; pair<int, int> b[100007]; pair<int, int> p, r; double t, q, x, y, w; int fl = 1; int main() { int n; int d1, d2, res = 0; scanf( %d , &n); ; scanf( %d , &d1); ; scanf( %d , &d2); ; for (int i = 1; i...
#include <bits/stdc++.h> using namespace std; const int N = 400000 + 5; int n, m, tr[N << 2][3], q; set<int> ssp[N][2]; void modify(int x, int who, int v, int l = 1, int r = n, int k = 1) { if (l == r) { if (ssp[l][who].count(v)) ssp[l][who].erase(v); else ssp[l][who].insert(v)...
#include <bits/stdc++.h> using namespace std; template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cerr << name << : << arg1 << std::endl; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, ...
#include <bits/stdc++.h> using namespace std; int main() { int n; unsigned long long k, res = 0; cin >> n >> k; unsigned long long arr = new unsigned long long[n + 1]; arr[0] = 1; for (int i = 1; i <= n; i++) arr[i] = arr[i - 1] 2; bool left = true; while (n > 1) { if (k > a...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long int n; cin >> n; multiset<long long int> s; for (long long int i = 0; i < n; i++) { long long int x; cin >> x; s.insert(x); } ...
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( O2 ) const int P = 998244353; int n, k, ans; int dp[2][510][510]; int cnt[510], pre[510]; template <typename T> inline void read(T &x) { T f = 1; x = 0; char c = getchar(); for (; !isdigit(c); c = getchar()) if (c ...
#include <bits/stdc++.h> using namespace std; const int N = (1 << 22) + 20; bool vis[2][N]; int a[N], n, m, ex[N]; int get_not(int x) { return (1 << n) - 1 - x; } void dfs(int type, int msk) { vis[type][msk] = true; if (type == 1) { if (!vis[0][get_not(msk)]) dfs(0, get_not(msk)); for (i...
#include <bits/stdc++.h> using namespace std; int main() { int n, sum = 0; cin >> n; n++; for (int i = 1; i < n - 2; i++) { for (int j = i; j < n - 1; j++) { int k = (int)(i ^ j); if (k < n && k > j) { if (!(i ^ j ^ k)) { double p = (i + j + k) / 2; ...
#include <bits/stdc++.h> using namespace std; long long mul(long long a, long long b, long long p) { long long s = 0; while (b) { if (b & 1) s = (s + a) % p; a = (a + a) % p; b >>= 1; } return s; } long long ksm(long long a, long long b, long long p) { long long s = 1; ...
#include <bits/stdc++.h> using namespace std; const int maxn = 1000005; int n, m, _m, cnt, d[maxn], fa[maxn]; bool vis[maxn]; struct Edge { int x, y; } Es[maxn]; long long ans; int getfa(int x) { return fa[x] == x ? x : fa[x] = getfa(fa[x]); } void merge(int x, int y) { x = getfa(x); y = g...
#include <bits/stdc++.h> using namespace std; int main() { long long n, a, b; cin >> n >> a >> b; long long ma, mi; ma = max(a, b); mi = min(a, b); long long seated = 0; for (long long i = (long long)(0); i < (long long)(n); i++) { char t; cin >> t; while (t == . and ...
#include <bits/stdc++.h> using namespace std; const int inf = 1 << 30; int num[222222]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) cin >> num[i]; int sum = 1; int ans = 1; for (int i = 1; i < n; i++) { if (num[i] <= num[i - 1] * 2) { sum++; } else { ...
#include <bits/stdc++.h> using namespace std; struct point { double df, de; void init(double _df, double _de) { df = _df; de = _de; } } V[100]; int nf, ne, ns, rf, re, rs, df, de; int n, top, place[13]; double ans = 0, dp[21][21], lf, le, ls; bool cmp(const point &a, const point &b...
#include <bits/stdc++.h> using namespace std; const int maxn = 10003; int32_t main() { int n, a, b, c; cin >> n >> a >> b >> c; if (n == 1) { cout << 0 ; return 0; } n--; long long ans = 0; ans += min(a, b); n--; if (min(a, b) > c) { ans += n * c; cout ...
#include <bits/stdc++.h> using namespace std; int main() { vector<int> vec1, vec2, vec3; int n, sz; cin >> n; for (int i = 1; i <= n; ++i) { int x; cin >> x; if (x == 1) vec1.push_back(i); else if (x == 2) vec2.push_back(i); else vec3.push_back(i...
#include <bits/stdc++.h> using namespace std; int n, arr[100000], r, arr1[100000], z; bool boo[100000]; int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> r; arr[i] = r; } for (int i = 0; i < n; i++) arr1[i] = arr[i]; reverse(arr1, arr1 + n); z = arr1[0]; boo[0] ...
#include <bits/stdc++.h> using namespace std; int main() { int n, a[222222]; scanf( %d n , &n); pair<int, int> p; vector<pair<int, int> > v, v1; for (int i = 1; i <= n; i++) { int x; scanf( %d , &x); p.first = x; p.second = 0; v.push_back(p); } reverse(v.beg...
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int n = s.length(); s += s; int ans = -1; int len = 1; for (int i = 1; i < 2 * n; i++) { if (s[i] != s[i - 1]) len++; else { if (len <= n) ans = max(len, ans); len = 1; ...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int arr[n]; for (int i = 0; i < n; i++) cin >> arr[i]; sort(arr, arr + n); int curr = 1; for (int i = 0; i < n; i++) { if (arr[i] >= curr) { curr++; } } cout << curr; return 0; }...
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; long long dp[255][255]; long long p[255], q[255], C[255][255]; int N; long long K; void init() { cin >> N >> K; p[0] = q[0] = C[0][0] = 1; for (int i = 1; i <= 250; i++) { p[i] = p[i - 1] * K % MOD; q[i] =...

#include <iostream> #include <vector> #include <queue> #include <algorithm> using ll = long long; #define MIN(a, b) (((a) < (b)) ? (a) : (b)) #define MAX(a, b) (((a) < (b)) ? (b) : (a)) int const nmax = 400; int const modulo = 998244353; int d[1 + nmax][1 + nmax]; std::vector<int> g[1 + nma...

#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { return a % b ? gcd(b, a % b) : b; } int main() { int n; while (cin >> n) { int sum = 0; for (int i = 2; i < n; i++) { int t = n; while (t) { sum += t % i; t /= i; } } i...

#include <bits/stdc++.h> using namespace std; int main() { int n; double arr[105]; scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %lf , &arr[i]); sort(arr, arr + n); reverse(arr, arr + n); double Max = 0; double prev = 0, a = 0, b = 1; for (int i = 0; i < n; i++) { a =...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:1024000000,1024000000 ) using namespace std; const long long inf = 0x3f3f3f3f3f3f3f3f; const int maxn = 100005; int main() { int n; long long r; scanf( %d %lld , &n, &r); n = 1 << n; int c[n]; double sum = 0; for (int i = 0; ...

#include <bits/stdc++.h> using namespace std; const int maxn = 55; const int maxm = 5e3 + 110; double dp[maxn][maxm]; struct node { int f, s; double p; } a[maxn]; int main() { int n, R; scanf( %d %d , &n, &R); for (int i = 1; i <= n; i++) { scanf( %d %d %lf , &a[i].f, &a[i].s, &a...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 7; int a[maxn]; int b[maxn]; int n; vector<pair<int, int>> v; void borrow(int pos, int val) { if (val == 1) { if (a[pos + 1] == 0) borrow(pos + 1, -1); if (v.size() >= 100000) return; v.push_back(make_pair(pos, -1))...

#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > g[110]; char s[2]; int n, m, x, y, f[110][110][27]; int dp(int x, int y, int k) { if (f[x][y][k] != 0) return f[x][y][k]; int ret = 1; for (auto e : g[x]) if (e.second >= k) ret = min(ret, dp(y, e.first, e.second)); f[...

#include <bits/stdc++.h> using namespace std; int d[2005]; queue<int> q; int main() { int n, k, i, a; scanf( %d %d , &n, &k); for (i = 0; i <= 2000; i++) d[i] = 999999; for (i = 1; i <= k; i++) { scanf( %d , &a); d[a - n + 1000] = 1; } for (i = 0; i <= 2000; i++) if (d[...

#include <bits/stdc++.h> using namespace std; int main() { string a, b; cin >> a; cin >> b; std::reverse(a.begin(), a.end()); if (a == b) cout << YES << endl; else cout << NO << endl; return 0; }

#include <bits/stdc++.h> using namespace std; char s[500010]; int n, m, ver[500010], hor[500010]; bool b; void calc(int i, int j, int k) { if (!b) return; int x = (k < 3) ? 1 : 2; if (j % 2) x = 3 - x; if (hor[i] == 0) hor[i] = x; else if (hor[i] != x) { b = false; return...

#include <bits/stdc++.h> using namespace std; #pragma optimize( -O3 ) int cnt; int t[1200005]; int lazy[1200005]; long long int ans[300005]; void push(int v, int tl, int tr) { int tm = (tl + tr) / 2; if (lazy[v] == 2) { t[v * 2] = tm - tl + 1; t[2 * v + 1] = tr - tm; lazy[2 * v] ...

#include <bits/stdc++.h> using namespace std; #pragma warning(disable : 4996) #pragma comment(linker, /STACK:256000000 ) FILE *stream; const int INF = 1e9 + 7; const long long INFL = (long long)1e18 + 1; const int SIZE = 2e5 + 10; const int TSIZE = 1e3 + 10; const long double eps = 0.000001; const ...

#include<bits/stdc++.h> using namespace std; typedef long long ll; const int maxn=200010; int a[maxn],f[maxn]; int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); int t,n; cin>>t; while(t--){ memset(f,0,sizeof(f)); cin>>n; for(int i=0;i<n;i++)...

#include <bits/stdc++.h> using namespace std; int main() { int n, x, m, a[100005] = {}; cin >> n; m = n; while (n--) { cin >> x; a[x] = 1; while (a[m]) { cout << m << ; m--; } cout << endl; } return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; int i, a, v, max, min, min1; cin >> a; max = min = a; for (i = 1; i < n; i++) { cin >> v; if (v > max) max = v; if (v < min) min = v; } cin >> a; min1 = a; for (i = 1; i < m;...

#include <bits/stdc++.h> using namespace std; string dp_func(string str) { if (str.size() & 1) return str; string gf, my; for (int i = 0; i < str.size() / 2; i++) my += str[i]; for (int i = str.size() / 2; str[i]; i++) gf += str[i]; string pts = dp_func(gf); string rts = dp_func(my); if ...

#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0, f = 1; char c = getchar(); while (c < 0 || c > 9 ) c = getchar(); while (c <= 9 && c >= 0 ) x = x * 10 + c - 0 , c = getchar(); return x * f; } const int maxn = 500007 * 30; int rt = 0; struct Segtree { ...

#include <bits/stdc++.h> using namespace std; int n, m; int a[1010][1010]; bool got[1010][1010]; bool ok(int x) { memset(got, 0, sizeof(got)); for (int j = 0; j < m; j++) { vector<int> vt; for (int i = 0; i < n; i++) if (a[i][j] >= x) vt.push_back(i); for (int o = 0; o < vt.s...

#include <bits/stdc++.h> using namespace std; const long long OO = (long long)5e3 + 555; void ndr() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); } int divi(long long N) { int cnt(0); for (long long i = 1; i <= sqrt(N); i++) { if (N % i == 0) { if (N / i == i) cnt++; ...

#include <bits/stdc++.h> using namespace std; const int MAX_N = 5e3 + 10; const int MOD = 1e9 + 7; int n; char s[MAX_N]; int dp[26][MAX_N]; int sum[MAX_N]; int cb[MAX_N][MAX_N]; int main() { int i, l, j; scanf( %d , &n); scanf( %s , s + 1); cb[0][0] = 1; for (i = 1; i <= n; i++) { ...

#include <bits/stdc++.h> using namespace std; string simplify(string s) { string a; for (int i = 0; i < s.length(); i++) { if (isalpha(s[i])) { s[i] = tolower(s[i]); a.push_back(s[i]); } } return a; } int main() { ios::sync_with_stdio(0); cin.tie(NULL); st...

#include <bits/stdc++.h> using namespace std; int i, x, y; int main() { cin >> x >> y; i = 1; while (1 != 0) { if (i % 2 == 1) { if (x >= 2 && y >= 2) { x -= 2; y -= 2; i++; } else if (y >= 12 && x >= 1) { y -= 12; x -= 1; ...

#include <bits/stdc++.h> using namespace std; int n, q; int arr[123456]; int prW[123556]; int leNM[123456]; int main() { cin >> n >> q; n--; int a, b; cin >> a; for (int i = 1; i <= (n); ++i) { cin >> b; arr[i] = abs(a - b); a = b; } vector<pair<int, int> > stac...

#include <bits/stdc++.h> using namespace std; int n, k; string s1, s2; vector<pair<string, string> > ans; map<string, int> u; int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> s1 >> s2; map<string, int>::iterator it = u.find(s1); if (it == u.end()) { u[s1] = k, u...

#include <bits/stdc++.h> using namespace std; int nr, K, mod, ans[33], v[70]; long long N; struct matrix { int a[33][33]; matrix() { memset(a, 0, sizeof(a)); } matrix(bool type) { memset(a, 0, sizeof(a)); if (type == 1) for (int i = 0; i <= K; i++) a[i][i] = 1; } } dp[70][3...

#include <bits/stdc++.h> using namespace std; long long a[200000]; map<long long, bool> mm; int main() { int n, t, k, d; cin >> n >> t >> k >> d; int res0 = 0, res1 = 0, sum0 = 0, sum1 = 0; while (sum0 < n) res0 += t, sum0 += k; for (int i = 1; i <= 10000; i++) { if (i % t == 0) sum1 +...

#include <bits/stdc++.h> using namespace std; const long long N = 1e6 + 10, mod = 1e9 + 7; long long ans = 1, t, n, a, b, f[N]; int main() { scanf( %lld , &n); f[0] = f[1] = 1; for (long long i = 2; i <= n; i++) f[i] = (f[i - 1] + f[i - 2] * (i - 1) % mod) % mod; for (long long i = 1; i <=...

#include <bits/stdc++.h> using namespace std; string s, t; bool B1[1000001]; bool B2[1000001]; vector<int> R; int main() { int n; getline(cin, s); getline(cin, t); int i = 0; bool b = true; while (i < t.size()) { if (t[i] != s[i]) b = false; B1[i] = b; i++; } ...

#include <bits/stdc++.h> using namespace std; char s[1000001]; int main() { int n, v = 0; cin >> n; sprintf(s, %X , n); for (int i = 0; i < strlen(s); i++) { if (s[i] == 0 || s[i] == 4 || s[i] == 6 || s[i] == 9 || s[i] == A || s[i] == D ) v++; else if (s[i...

#include <bits/stdc++.h> using namespace std; unordered_map<int, int> errors; void get_codes(unordered_map<int, int>& quantity, int cnt, int inc) { for (int i = 0; i < cnt; i++) { int code; cin >> code; quantity[code] += inc; } } int main() { ios_base::sync_with_stdio(0); int...

#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; const int INF = 0x3f3f3f3f; const int mod = 1e9 + 7; int head[10010], cnt = 1, cur[10010], dis[N], s, t; struct edge { int next, to, w; } e[N << 1]; struct query { int u, t; } q[N]; int main() { auto add = [&](int u, i...

#include <bits/stdc++.h> using namespace std; pair<int, string> a[3005]; int h[3005]; vector<pair<string, int> > ans; int main() { int n, m; cin >> n; for (int i = 0; i < n; i++) cin >> a[i].second >> a[i].first; sort(a, a + n); for (int i = 0; i < n; i++) if (a[i].first > i) { ...

#include <bits/stdc++.h> using namespace std; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int t; cin >> t; while (t--) { long long int a[3]; cin >> a[0] >> a[1] >> a[2]; sort(a, a + 3, greater<long long int>()); if (a[0]...

#include <bits/stdc++.h> using namespace std; long long int p, pre, k, cnt; vector<long long int> ans; int main() { scanf( %lld %lld , &p, &k); if (p < k) { printf( 1 n%lld n , p); return 0; } pre = p; while (1) { cnt = (k - pre); if (cnt <= 0) { cnt = cnt / k...

#include <bits/stdc++.h> using namespace std; int n; long long v1, v2; vector<int> sz; vector<vector<pair<int, int>>> g; void dfs(int u, int p, int c) { sz[u] = 1; for (auto &e : g[u]) { int v = e.first; if (v == p) continue; dfs(v, u, e.second); sz[u] += sz[v]; } v1 ...

#include <bits/stdc++.h> using namespace std; int a[205], b[205]; long long dp[205][205], k; int n, m; char ans[205]; bool cmp(int x, int y) { return a[x] < a[y]; } int main() { scanf( %d%d , &n, &m); cin >> k; int t = n + m - 1; for (int i = 0; i < t; i++) { a[i] = n * m; b[i]...

#include <bits/stdc++.h> const int base = 1000000000; const int base_digits = 9; struct bigint { std::vector<int> z; int sign; bigint() : sign(1) {} bigint(long long v) { *this = v; } bigint(const std::string &s) { read(s); } void operator=(const bigint &v) { sign = v.sign; z =...

#include <bits/stdc++.h> using namespace std; const int nmax = 16, MX = 16 * 2000 + 42; int n, k, inp[nmax]; int outp[nmax]; void print() { vector<pair<int, int> > active; cout << YES << endl; for (int i = 0; i < n; i++) active.push_back({inp[i], outp[i]}); for (int t = 1; t < n; t++) { ...

#include <bits/stdc++.h> using namespace std; vector<long long> v[2000006], pp[2000006]; long long first[2000006], cur = 0, w[2000006], n, m, i, xx, second, d, h, ans, w1, p, tt, o, temp, t; void dfs(long long node, long long l) { if (node > n) return; long long i, j; fir...

#include <bits/stdc++.h> using namespace std; int n; map<int, long long> ans; inline long long go(int n) { if (ans.find(n) != ans.end()) return ans[n]; long long cur = n + 1; for (int i = 2; i * i <= n; ++i) { if (n % i == 0) { cur = max(cur, n + go(i)); cur = max(cur, n + go(n...

#include <bits/stdc++.h> using namespace std; int n, m, d; bool ck[100005]; vector<int> adj[100005]; int dep[100005], ans; void dfs(int u, int p) { dep[u] = (ck[u] ? 0 : -(1 << 20)); for (int i = 0; i < adj[u].size(); ++i) { int v = adj[u][i]; if (v == p) continue; dfs(v, u); ...

#include<bits/stdc++.h> #define ll long long using namespace std; int x[100005]; int idx=0; int d[100005]; int main() { int t; cin>>t; while(t--){ int n; cin>>n; idx=0; for(int i=1;i<=n;i++){ scanf( %d ,&x[i]); } ...

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

#include <bits/stdc++.h> using namespace std; template <class T> ostream &operator<<(ostream &os, const vector<T> &v) { for (T i : v) os << i << , ; return os; } template <class T> ostream &operator<<(ostream &os, const set<T> &v) { for (T i : v) os << i << ; return os; } template <...

#include <bits/stdc++.h> using namespace std; const int maxn = 100000 + 10; const int maxm = 100 + 10; const int inf = 0x3f; long long f[maxm][maxn], D[maxn], H[maxn], T[maxn], q[maxn]; long long g[maxn]; int N, M, P; long long A[maxn], S[maxn]; void init() { sort(A + 1, A + 1 + M); for (int i...

#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5, M = 1e9 + 7; const unsigned long long base = 13331; const double Pi = acos(-1.0); const long long C = 299792458; inline int read() { int x = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f =...

#include <bits/stdc++.h> using namespace std; const int maxn = 25; inline int getDis(pair<int, int> a, pair<int, int> b) { return (b.first - a.first) * (b.first - a.first) + (b.second - a.second) * (b.second - a.second); } pair<int, int> G[maxn]; int dp[1 << maxn]; int dis[maxn][maxn], rout...

#include <bits/stdc++.h> #pragma warning(disable : 4786) #pragma comment(linker, /STACK:102400000,102400000 ) using namespace std; const int INF = 0x3f3f3f3f; const int mod = 1e9 + 7; const double PI = acos(-1.0); const double eps = 1e-6; const int maxn = 2e5 + 5; int isu[maxn], sz[maxn], dis[maxn], ...

#include <bits/stdc++.h> using namespace std; int main() { long long int n, m, i; cin >> n; long long int arr1[n]; for (i = 0; i < n; i++) cin >> arr1[i]; cin >> m; long long int arr2[m]; for (i = 0; i < m; i++) cin >> arr2[i]; sort(arr1, arr1 + n); sort(arr2, arr2 + m); cout...

#include <bits/stdc++.h> using namespace std; int sg[100005], sgp[100005]; int main() { int n; cin >> n; if (n <= 2) { cout << -1 ; return 0; } sg[0] = sg[1] = sg[2] = 0; for (int i = 3; i <= n; ++i) { int cnt[105] = {0}; for (int d = 2; d <= i; ++d) { int ...

#include <bits/stdc++.h> using namespace std; int main() { int i, j, n, a, b, c, ret = 0, t; scanf( %d %d %d %d , &n, &a, &b, &c); n *= 10; for (i = 0; i <= a; i++) for (j = 0; j <= b; j++) { t = (i * 5); t += (j * 10); if (n - t < 0) continue; if ((n - t) % 20 ...

#include <bits/stdc++.h> using namespace std; long long parse(string s) { long long k = 1, ret = 0; for (int i = 0; i < s.size(); i++) ret += k * (long long)(s[s.size() - i - 1] - 0 ), k *= 4; return ret; } string change(string s) { string ret = s; for (int i = 0; i < ret.size(); i++)...

#include <bits/stdc++.h> inline long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } inline void sub(long long &a, long long b) { a -= b; if (a < 0) a += 1000000007; } inline void add(long long &a, long long b) { a += b; if (a >= 1000000007) a -= 1000000007; } template <...

#include <bits/stdc++.h> const int N = 1e5 + 10; const int MOD = 1e9 + 7; const int INF = 2e9; const long long INFLL = 1e18; const double PI = acos((double)-1); inline int mult(int a, int b, int p = MOD) { return (1ll * a * b) % p; } inline int add(int a, int b, int p = MOD) { return (1ll * a + b) % p; } ...

#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; if (n == 1 and k == 10) { cout << -1 ; } else if (k == 10) { cout << 1 ; for (int i = 1; i < n; i++) { cout << 0 ; } } else { for (int i = 0; i < n; i++) { cout <<...

#include <bits/stdc++.h> using namespace std; int in() { int x; scanf( %d , &x); return x; } int main() { ios::sync_with_stdio(false); long long k, d, t; cin >> k >> d >> t; t *= 2; long long p = (k + d - 1) / d * d; long double res = t / (p + k) * p; t %= (p + k); if...

#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 23; long long f[maxn][3][2]; int a[maxn], n; int main() { cin >> n; for (int i = 1; i <= n; i++) scanf( %d , &a[i]); if (n == 1) { return 0 * printf( %d , a[1]); } for (int i = 0; i <= n; i++) { for (int j = 0...

#include <bits/stdc++.h> using namespace std; int n; double arr[550]; int m; int main() { cin >> n >> m; for (int i = 1; i <= n; i++) cin >> arr[i]; double ans = 0; for (int i = 1; i <= m; i++) { int u, v; double w; cin >> u >> v; cin >> w; double rr = (arr[u] + a...

#include <bits/stdc++.h> using namespace std; using namespace std; const long double PI = acos(-1.0); long long diff[200010]; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); ; int T, j, t, i, buckN = 1; int N = 1; scanf( %d , &T); long long sum = 0, a, x, lE = 0; whil...

#include <bits/stdc++.h> using namespace std; int main() { string arr[3]; for (int i = 0; i < 3; i++) { cin >> arr[i]; for (int j = 0; j < arr[i].size(); j++) if (arr[i][j] == ; || arr[i][j] == - || arr[i][j] == _ ) { arr[i].erase(j, 1); j--; } for ...

#include <bits/stdc++.h> using namespace std; int fir[201], tot, in[201], In[201]; int nxt[400201], to[400201]; inline void add_edge(int u, int v) { to[++tot] = v; nxt[tot] = fir[u]; fir[u] = tot; } int n, c[201], cc[4][201]; queue<int> q[5]; inline int solve(int x) { int ans = 0; fo...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10; const int inf = 0x3f3f3f3f; int main() { long long n, m, k, p[maxn], ans = 0, sub = 0; cin >> n >> m >> k; for (int i = 1; i <= m; i++) { scanf( %lld , &p[i]); p[i]--; } for (int i = 1; i <= m; i++) { ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 1 * 1000 + 10; int ans[MAXN][MAXN]; int main() { ios::sync_with_stdio(false); int n, d, k; cin >> n; vector<int> a(n), b(n); for (int i = 0; i < n; i++) { cin >> a[i]; b[i] = a[i]; } sort(a.begin(), a.end(), [...

#include <bits/stdc++.h> using namespace std; int dp[2010][2010], a[2010]; int gcd(int a, int b) { if (b == 0) return a; return gcd(b, a % b); } int main() { int n, i, j, ans, mn, cnt; scanf( %d , &n); cnt = 0; for (i = 0; i < n; i++) { scanf( %d , a + i); if (a[i] == 1) cn...

#include <bits/stdc++.h> using namespace std; long long a[1000005]; int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) { scanf( %lld , &a[i]); } sort(a + 1, a + 1 + n); int x = 1; int y = n; long long ans = 0; while (x < y) { ans += abs(a[y] ...

#include <bits/stdc++.h> const int inf = 1e9 + 7; const int mod = 998244353; namespace __________ { namespace _in { template <class T> inline T read() { char ch; bool flag = 0; T x = 0; while (ch = getchar(), !isdigit(ch)) if (ch == - ) flag = 1; while (isdigit(ch)) x = x * 10 + c...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); long long T, N, M; cin >> T; while (T--) { cin >> N >> M; N /= M; long long Sum = 0, Ans = 0; long long digits[20]; for (int i = 1; i <= 10; i++) Sum += (digits[i...

#include <bits/stdc++.h> const int INF = 0x3f3f3f3f; const int NINF = -INF - 1; const int N = 2e5 + 5; using namespace std; char a[N]; int c[N]; int b[26]; int main() { int n, ans = 0, maxn = -1000000; scanf( %d , &n); scanf( %s , a); for (int i = 0; i < n; i++) { ans = 1; fo...

#include <bits/stdc++.h> using namespace std; int main() { int n, finall = 0, t1 = 0; vector<string> v; cin >> n; int cop = n; while (n--) { string s; cin >> s; v.push_back(s); } for (int j = 0; j < 7; j++) { t1 = 0; for (int k = 0; k < cop; k++) t1 += v[k][...

#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f, N = 2e5 + 5; inline int read() { int sum = 0, f = 1; char c = getchar(); while (c > 9 || c < 0 ) { if (c == - ) f = -f; c = getchar(); } while (c >= 0 && c <= 9 ) sum = sum * 10 + c - 48, c = getchar()...

#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; void yes() { cout << Yes << n ; } void no() { cout << No << n ; } struct Sync_stdio { Sync_stdio() { cin.tie(NULL); ios_base::sync_with_stdio(false); } } _sync_stdio; struct ...

#include <bits/stdc++.h> int main() { char abc[105]; scanf( %s , abc); int n = strlen(abc); int i = 0; int max = 1, count = 0; while (i < n) { if (abc[i] == A || abc[i] == E || abc[i] == I || abc[i] == O || abc[i] == U || abc[i] == Y ) { if (max < count + 1) ...

#include <bits/stdc++.h> using namespace std; int find(int a[], int n) { int max = 1; int m = a[1]; for (int i = 2; i < n; i++) { if (m <= a[i]) { max = i; m = a[i]; } } return max; } int main() { int c = 0; int n; cin >> n; int a[n]; cin >> a[...

#include <bits/stdc++.h> using namespace std; int main() { int n, m; while (cin >> n >> m) { int i; for (i = 1; i <= n; i++) { int k = m - 2, t = m; if (i % 2) while (t--) cout << # ; else { cout << (i % 4 ? . : # ); while (k--) cout << ...

#include <bits/stdc++.h> using namespace std; const int N = 400005; vector<int> adj[N]; vector<int> st; int cTime = 1; int in[N]; int low[N]; vector<vector<int>> comps; map<array<int, 2>, int> edgeToI; array<int, 2> res[N]; int edgeToIndex(int a, int b) { return edgeToI[{min(a, b), max(a, b)}]; } ...

#include <bits/stdc++.h> using namespace std; int hed[600010], nxt[600010], to[600010], cnt; inline void addedge(int u, int v) { nxt[++cnt] = hed[u]; hed[u] = cnt; to[cnt] = v; } int siz[300010], root[300010], ans[300010]; int mx[300010]; int id[6000010], son[6000010][2], tot; int n, q; in...

#include <bits/stdc++.h> using namespace std; int main() { int n, k, temp, prev, A[100005]; bool f = false; cin >> n >> k; for (int i = 0; i < n; i++) { cin >> A[i]; } for (int i = 0; i < k; i++) { cin >> temp; } if (k == 1) { if (n == 1) { cout << Yes ; ...

#include <bits/stdc++.h> using namespace std; map<char, pair<int, int> > ins; void operator+=(pair<int, int> &i, pair<int, int> &j) { i.first += j.first, i.second += j.second; } int main() { ins[ U ] = pair<int, int>(0, 1), ins[ D ] = pair<int, int>(0, -1), ins[ L ] = pair<int, int>(-1, 0), ins[ R...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; long long a[n]; vector<long long> pref(n + 1, 0); for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n; i++) { pref[i + 1] = pref[i] + a[i]; } map<long long, int> m; m[0] = 0; long lon...

#include <bits/stdc++.h> namespace ZDY { #pragma GCC optimize(3) template <class T> __inline__ __attribute__((always_inline)) T ABS(T x) { return x > 0 ? x : -x; } template <class T> __inline__ __attribute__((always_inline)) T MAX(T x, T y) { return x > y ? x : y; } template <class T> __inli...

#include <bits/stdc++.h> using namespace std; pair<int, int> a[100007]; pair<int, int> b[100007]; pair<int, int> p, r; double t, q, x, y, w; int fl = 1; int main() { int n; int d1, d2, res = 0; scanf( %d , &n); ; scanf( %d , &d1); ; scanf( %d , &d2); ; for (int i = 1; i...

#include <bits/stdc++.h> using namespace std; const int N = 400000 + 5; int n, m, tr[N << 2][3], q; set<int> ssp[N][2]; void modify(int x, int who, int v, int l = 1, int r = n, int k = 1) { if (l == r) { if (ssp[l][who].count(v)) ssp[l][who].erase(v); else ssp[l][who].insert(v)...

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

#include <bits/stdc++.h> using namespace std; int main() { int n; unsigned long long k, res = 0; cin >> n >> k; unsigned long long *arr = new unsigned long long[n + 1]; arr[0] = 1; for (int i = 1; i <= n; i++) arr[i] = arr[i - 1] * 2; bool left = true; while (n > 1) { if (k > a...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long int n; cin >> n; multiset<long long int> s; for (long long int i = 0; i < n; i++) { long long int x; cin >> x; s.insert(x); } ...

#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( O2 ) const int P = 998244353; int n, k, ans; int dp[2][510][510]; int cnt[510], pre[510]; template <typename T> inline void read(T &x) { T f = 1; x = 0; char c = getchar(); for (; !isdigit(c); c = getchar()) if (c ...

#include <bits/stdc++.h> using namespace std; const int N = (1 << 22) + 20; bool vis[2][N]; int a[N], n, m, ex[N]; int get_not(int x) { return (1 << n) - 1 - x; } void dfs(int type, int msk) { vis[type][msk] = true; if (type == 1) { if (!vis[0][get_not(msk)]) dfs(0, get_not(msk)); for (i...

#include <bits/stdc++.h> using namespace std; int main() { int n, sum = 0; cin >> n; n++; for (int i = 1; i < n - 2; i++) { for (int j = i; j < n - 1; j++) { int k = (int)(i ^ j); if (k < n && k > j) { if (!(i ^ j ^ k)) { double p = (i + j + k) / 2; ...

#include <bits/stdc++.h> using namespace std; long long mul(long long a, long long b, long long p) { long long s = 0; while (b) { if (b & 1) s = (s + a) % p; a = (a + a) % p; b >>= 1; } return s; } long long ksm(long long a, long long b, long long p) { long long s = 1; ...

#include <bits/stdc++.h> using namespace std; const int maxn = 1000005; int n, m, _m, cnt, d[maxn], fa[maxn]; bool vis[maxn]; struct Edge { int x, y; } Es[maxn]; long long ans; int getfa(int x) { return fa[x] == x ? x : fa[x] = getfa(fa[x]); } void merge(int x, int y) { x = getfa(x); y = g...

#include <bits/stdc++.h> using namespace std; int main() { long long n, a, b; cin >> n >> a >> b; long long ma, mi; ma = max(a, b); mi = min(a, b); long long seated = 0; for (long long i = (long long)(0); i < (long long)(n); i++) { char t; cin >> t; while (t == . and ...

#include <bits/stdc++.h> using namespace std; const int inf = 1 << 30; int num[222222]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) cin >> num[i]; int sum = 1; int ans = 1; for (int i = 1; i < n; i++) { if (num[i] <= num[i - 1] * 2) { sum++; } else { ...

#include <bits/stdc++.h> using namespace std; struct point { double df, de; void init(double _df, double _de) { df = _df; de = _de; } } V[100]; int nf, ne, ns, rf, re, rs, df, de; int n, top, place[13]; double ans = 0, dp[21][21], lf, le, ls; bool cmp(const point &a, const point &b...

#include <bits/stdc++.h> using namespace std; const int maxn = 10003; int32_t main() { int n, a, b, c; cin >> n >> a >> b >> c; if (n == 1) { cout << 0 ; return 0; } n--; long long ans = 0; ans += min(a, b); n--; if (min(a, b) > c) { ans += n * c; cout ...

#include <bits/stdc++.h> using namespace std; int main() { vector<int> vec1, vec2, vec3; int n, sz; cin >> n; for (int i = 1; i <= n; ++i) { int x; cin >> x; if (x == 1) vec1.push_back(i); else if (x == 2) vec2.push_back(i); else vec3.push_back(i...

#include <bits/stdc++.h> using namespace std; int n, arr[100000], r, arr1[100000], z; bool boo[100000]; int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> r; arr[i] = r; } for (int i = 0; i < n; i++) arr1[i] = arr[i]; reverse(arr1, arr1 + n); z = arr1[0]; boo[0] ...

#include <bits/stdc++.h> using namespace std; int main() { int n, a[222222]; scanf( %d n , &n); pair<int, int> p; vector<pair<int, int> > v, v1; for (int i = 1; i <= n; i++) { int x; scanf( %d , &x); p.first = x; p.second = 0; v.push_back(p); } reverse(v.beg...

#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int n = s.length(); s += s; int ans = -1; int len = 1; for (int i = 1; i < 2 * n; i++) { if (s[i] != s[i - 1]) len++; else { if (len <= n) ans = max(len, ans); len = 1; ...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int arr[n]; for (int i = 0; i < n; i++) cin >> arr[i]; sort(arr, arr + n); int curr = 1; for (int i = 0; i < n; i++) { if (arr[i] >= curr) { curr++; } } cout << curr; return 0; }...

#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; long long dp[255][255]; long long p[255], q[255], C[255][255]; int N; long long K; void init() { cin >> N >> K; p[0] = q[0] = C[0][0] = 1; for (int i = 1; i <= 250; i++) { p[i] = p[i - 1] * K % MOD; q[i] =...