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; const int N = 2e5 + 9; int n, u, v, w, t, p, sub[N], par[N], mark[N]; vector<pair<int, int> > g[N]; vector<pair<int, pair<int, int> > > edge[N]; pair<pair<int, int>, pair<int, int> > ed[N]; long long mx, ans[N]; set<int> s; int Get_par(int u) { if (par...
#include <bits/stdc++.h> using namespace std; struct Node { int ancestor; vector<int> children; }; class TarjanOLCA { enum Color { WHITE = 0, BLACK = 1, }; public: TarjanOLCA(const vector<Node>& tree, int root, const vector<pair<int, int> >& query) : ...
#include <bits/stdc++.h> #define optimize ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); #define S second #define F first #define ENDL n #define fori(i, n) for(int i=0; i<n; ++i) #define foreach(n) for(int i=0; i<n; ++i) #define read_v(v) for(int i=0; i<v.size(); ++i) cin >> v[i] #defi...
#include <bits/stdc++.h> using namespace std; struct Data { bool bip; int a, xora, ha; int b, xorb, hb; }; struct dsu { int n; bool bip = 1; vector<int> x, t, h; vector<Data> memo; dsu(int nn) { n = nn; x.resize(n + 1); t.resize(n + 1); h.resize(n + 1); ...
#include <bits/stdc++.h> using namespace std; int t, a, b, c, ans, t1; int main() { scanf( %d , &t); while (t--) { scanf( %d%d%d , &a, &b, &c); ans = 0; t1 = c / 2; t1 = min(t1, b); ans += t1 * 3; b -= t1; t1 = b / 2; t1 = min(t1, a); ans += t1 * 3; ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); string s; cin >> s; vector<int> st; st.push_back(s[0]); for (int i = 1; i < s.size(); i++) { if (st.empty()) st.push_back(s[i]); else { if (st.back() == s[...
#include <bits/stdc++.h> using namespace std; int A[55], ctos, lleno; long long D[52][52][52][52]; double res = 0, suma; int main() { scanf( %d , &ctos); for (int i = 1; i <= ctos; i++) { scanf( %d , &A[i]); suma += A[i]; } scanf( %d , &lleno); for (int quien = 1; quien <= ctos...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 5; char s[maxn], t[maxn]; int pr1, mod1, pr2, mod2; const int prs[60] = { 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, ...
#include <bits/stdc++.h> int main() { long a, b; while (scanf( %ld%ld , &a, &b) != EOF) { if (a == b) { if (a % 2 == 0) printf( 2 n ); else if (a % 3 == 0) printf( 3 n ); else if (a % 5 == 0) printf( 5 n ); else if (a % 7 == 0) prin...
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1.0); const double eps = 1e-8; char ans[1024]; int K, X, N, M; char st[64], ed[64]; long long num[64]; void printAns(char from, char to, int all, int len) { int pos = 1; if (from == A ) pos = 0; for (int i = 0; i < len; i...
#include <bits/stdc++.h> using namespace std; string last_w = ; set<string> reserved; void change_last_w() { do { int j(last_w.size() - 1); while (j >= 0 && last_w[j] == z ) --j; if (j == -1) last_w.assign(last_w.size() + 1, a ); else { ++last_w[j]; for (i...
#include <bits/stdc++.h> #pragma comment(linker, /STACK: 1024000000,1024000000 ) using namespace std; inline int getint() { int _x = 0; char _tc = getchar(); while (_tc < 0 \|\| _tc > 9 ) _tc = getchar(); while (_tc >= 0 && _tc <= 9 ) _x *= 10, _x += (_tc - 0 ), _tc = getchar(); return _...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long n; cin >> n; long long a[n]; for (long long i = 0; i < n; i++) cin >> a[i]; long long ans = 0; for (long long i = n - 1; i >= 0; i--) { if (i == n - 1) ...
#include <bits/stdc++.h> long long mod = 1000000007; long long mod2 = 998244353; long long OO = 1e18; long long david_villa_pow(long long x, long long n) { if (n == 0) return 1; long long u = david_villa_pow(x, n / 2); u = ((u) * (u)); if (n % 2 == 1) u = ((u) * (x)); return u; } long lo...
#include <bits/stdc++.h> using namespace std; const int inf = (1 << 30) - 1; const long long linf = (1ll << 62) - 1; int main() { int n; cin >> n; vector<int> is_prime(n + 1, true), primes; is_prime[0] = is_prime[1] = 0; for (int i = 2; i * i <= n; i++) { if (is_prime[i]) { for...
#include <bits/stdc++.h> using namespace std; int main() { long long int i, n, k, r; cin >> n >> k; long long int a[n]; for (i = 0; i < n; i++) { cin >> a[i]; } long long int m = min_element(a, a + n); r = 0; for (i = 0; i < n; i++) { if ((a[i] - m) % k == 0) { ...
#include <bits/stdc++.h> using namespace std; const int N = 1000 * 100 + 10; int n, d[N], par[N]; pair<int, int> tr[N * 4]; pair<long long, int> a[N], b[N]; void add(int val, int p, int b = 0, int e = n, int ind = 1) { tr[ind] = max(tr[ind], make_pair(val, p)); if (b + 1 == e) return; int mid = ...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:267386880 ) using namespace std; int n; char g[72][72]; struct pos { int data[3]; }; const int MAXQ = 400000; bool used[72][72][72]; pos prv[72][72][72]; pos q[MAXQ]; int head, tail; pair<int, int> getDiff(pos &a, pos &b) { int dif...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { int n, q; cin >> n >> q; string s; cin >> s; int pref[n + 1]; memset(pref, 0, sizeof(pref)); set<int> arr[2 * n + 5...
#include <bits/stdc++.h> using namespace std; long long int him(long long int a, long long int n) { long long int ans = 1; while (n) { if (n % 2 != 0) { ans = ((ans) * (a)); } a = ((a) * (a)); n = n / 2; } return ans; } int main() { long long int t; cin >>...
#include <bits/stdc++.h> using namespace std; const int Max = 1e6 + 5; int lst[Max]; int main() { int t; cin >> t; while (t--) { long long n, k; cin >> n >> k; long long sum = 0; while (n > 0) { if (n % k == 0) { n /= k; sum++; } else { ...
#include <bits/stdc++.h> using namespace std; vector<string> split_string(string); bool isDiverse(string &s) { int len = s.length(); sort(s.begin(), s.end()); for (int i = 0; i < len - 1; i++) { if (s[i] == s[i + 1]) { return false; } else if (s[i + 1] != s[i] + 1) { return...
#include <bits/stdc++.h> using namespace std; const int MAXN = 405; const int oo = 10005; int N, M, T, K, Q; vector<pair<int, int> > G[MAXN]; int dp[MAXN][MAXN][MAXN]; int par[MAXN]; int indPar[MAXN]; void DFS(int u, int p) { par[u] = p; for (int i = 0; i < G[u].size(); i++) { int v = G[...
#include <bits/stdc++.h> using namespace std; int main() { long long n, k; cin >> n; string s = to_string(n); k = s.size() - 1; if (k > 0) { long long a = rint(pow(10, k)); long long z = rint(n / a); long long m = (z + 1) * a; cout << m - n; } else cout << 1; ...
#include<bits/stdc++.h> using namespace std; #define ll long long ll gcd(ll a, ll b){ return b?gcd(b,a%b):a; } ll a[200005],b[200005],c,d; int main(){ ll n,m; scanf( %lld%lld ,&n,&m); ll d=0; cin>>a[1]; for(ll i=2;i<=n;i++){ //从a[2]-a[1]开始 scanf( %lld ,&a[i]); d=gcd(d,a[i]-a[...
#include <bits/stdc++.h> using namespace std; int n, a[10005], sum1 = 0, sum2 = 0; int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; if (a[i] < 0) sum2++; else { if (a[i] == 0) sum1++; else cout << a[i] << ; } } ...
#include <bits/stdc++.h> using namespace std; const int INF = 2147483647; const long long LLINF = 9223372036854775807LL; const int maxn = 30010; int a[maxn] = {}; int used[maxn] = {}; int main() { int n; scanf( %d , &n); for (int i = 0; i < n; ++i) scanf( %d , &a[i]); vector<int> ans1, ans...
#include <bits/stdc++.h> using namespace std; #pragma GCC target( avx2 ) #pragma GCC optimization( unroll-loops ) #pragma GCC optimize( O2 ) constexpr int dx[] = {-1, 0, 1, 0, 1, 1, -1, -1}; constexpr int dy[] = {0, -1, 0, 1, 1, -1, 1, -1}; constexpr long long INF = 1999999999999999997; constexpr int in...
#include <bits/stdc++.h> #define fi first #define se second #define db double #define U unsigned #define P std::pair<int,int> #define LL long long #define pb push_back #define MP std::make_pair #define all(x) x.begin(),x.end() #define CLR(i,a) memset(i,a,sizeof(i)) #define FOR(i,a,b) for(int i ...
#include <bits/stdc++.h> #pragma GCC optimization( O3 ) using namespace std; template <typename T> inline void Cin(T& first) { char c; T sign = 1; first = 0; for (c = getchar(); c < 0 \|\| c > 9 ; c = getchar()) if (c == - ) sign = -1; for (; c >= 0 && c <= 9 ; c = getchar()) firs...
#include <bits/stdc++.h> using namespace std; const double eps = 1e-9; const double pi = acos(-1.0); int a[32][101111], n, m, d[32][111111], b[111111], t[400111]; pair<pair<int, int>, int> p[111111]; int bit(int mask, int i) { return (mask & (1 << i)) > 0; } void build(int v, int tl, int tr) { if (tl ...
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3fll; map<int, int> memo; int solve(int mask) { if (!mask) return 0; if (memo.find(mask) != memo.end()) return memo[mask]; map<int, bool> canreach; for (int i = 0; i < 32; i++) { ...
#include <bits/stdc++.h> using namespace std; int t, n; int a[1000005]; vector<int> x; void solve() { int sum = 0, ans; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; sum += a[i]; } int l = 1, r = 1e7; while (l <= r) { int mid = (l + r) >> 1; if (mid * n ...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int T; cin >> T; while (T--) { long long a, b, n; cin >> a >> b >> n; if (a < b) swap(a, b); int ans = 0; while (a <= n) { b += a; if...
#include <bits/stdc++.h> using namespace std; int main() { int n, jump[100005]; bool visited[100005]; string s; cin >> n; cin >> s; for (int i = 0; i < n; i++) cin >> jump[i]; int pos = 0; fill(visited, visited + n, false); while (!visited[pos]) { visited[pos] = true; ...
#include <bits/stdc++.h> using namespace std; double PI = 3.141592653589793238462643383279; const double EPS = 1e-9; const long long MOD = 1000000007; const int inf = 1 << 30; const long long linf = 1LL << 60; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); namespace LCA { vector<...
#include <bits/stdc++.h> using namespace std; int a[105][105], b, c, d, e, f, g, h, i, j, k, l, m, n; inline bool pd(int x, int y, int s) { return a[x - 1][y] == s \|\| a[x + 1][y] == s \|\| a[x][y - 1] == s \|\| a[x][y + 1] == s; } int main() { scanf( %d%d , &n, &m); for (i = 1; i <= n; i++)...
#include <bits/stdc++.h> using namespace std; int h, q, v, e; string s; map<int, int> xx; inline double dfs(int x, int mx) { if (xx[x] <= mx) return mx; return 0.5 * (dfs(x << 1, max(mx, xx[x] - xx[x << 1])) + dfs(x << 1 \| 1, max(mx, xx[x] - xx[x << 1 \| 1]))); } int main() { ...
#include <bits/stdc++.h> using namespace std; int a[200000]; int main() { int t; cin >> t; while (t--) { int n; cin >> n; int odd = 0, even = 0; for (int i = 0; i < n; i++) { cin >> a[i]; if (a[i] & 1) odd++; else even++; } ...
#include <bits/stdc++.h> using namespace std; int main() { long long i, j, n, m, a, b, s = 0, e1, e2, o1, o2; long long t; cin >> t; while (t--) { e1 = e2 = o1 = o2 = 0; cin >> n; for (int i = 0; i < n; i++) { cin >> a; if (a & 1) o1++; else ...
#include <bits/stdc++.h> using namespace std; const int maxn = 400050; int n, x; long long w; vector<long long> val[4]; int Abs(int a) { return a < 0 ? -a : a; } int main() { scanf( %d , &n); long long sum = 0; for (int i = 0; i < n; i++) { scanf( %d%I64d , &x, &w); if (x == 11) ...
#include <bits/stdc++.h> using namespace std; int main() { int r, c; cin >> r; cin >> c; vector<vector<bool> > a(r); for (int i = 0; i < r; i++) a[i].resize(c); char t_c; for (int i = 0; i < r; i++) { for (int j = 0; j < c; j++) { cin >> t_c; if (t_c == . ) ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 100 + 5; const long long MOD = 1000000007; long long pow2[MAXN]; char x[MAXN]; int main() { scanf( %s , x); int n = strlen(x); pow2[0] = 1; for (int i = 1; i < n; i++) pow2[i] = (pow2[i - 1] * 2) % MOD; long long d = pow2[n -...
#include <bits/stdc++.h> using namespace std; const int MAX_N = 1000000 + 20; int pos[MAX_N], mark[MAX_N]; int inter[MAX_N]; set<int> D; long long ans; int n, k; void add(int x) { for (; x <= n; x += x & (-x)) ++inter[x]; } int get(int x) { if (x < 1) return 0; int res = 0; for (; x ...
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; const long long inf = 1e18 + 9; const long long MAX_SIZE = 1e7 + 1; long long _t = 1, _T, csn; long long max(long long a, long long b) { if (a < b) return b; return a; } long long min(long long a, long long b) { if ...
#include <bits/stdc++.h> using namespace std; const int N = 5005; int n, a, b, k; int d[3][N]; int sum[N]; int ans = 0; int cur = 1; int main() { scanf( %d%d%d%d , &n, &a, &b, &k); d[0][a] = 1; for (int cnt = 1; cnt <= k; ++cnt) { for (int i = 1; i <= n; ++i) sum[i] = (sum[i - ...
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 9; const int L = 20; int par[N][L]; int up[N][L]; int h[N]; int to[N]; int s[N], t[N]; pair<int, int> edge[N]; vector<pair<int, int> > al[N]; int find(int v) { if (to[v] == v) return v; return to[v] = find(to[v]); } int ...
#include <bits/stdc++.h> using namespace std; const int inf = 1999999999; const double pi = acos(-1.0); const double eps = 1e-10; char gc() { char c; while (isspace(c = getchar())) ; return c; } int gs(char* s) { gets(s); int l = strlen(s); while (l && isspace(s[l - 1])) s[--...
#include <bits/stdc++.h> using namespace std; int main() { vector<vector<string> > tab(9); int emp[3][3]; memset(emp, 0, sizeof emp); for (int i = 0; i < 9; i++) { tab[i].resize(3); for (int j = 0; j < 3; j++) { string a; cin >> a; for (int k = 0; k < a.size(); k+...
#include <bits/stdc++.h> using namespace std; const long long MAXN = 1e6 + 10; const long long INF = 8e18; const long long MOD = 1e9 + 7; inline long long poww(long long a, long long b) { a %= MOD; long long ans = 1; while (b > 0) { if (b & 1) ans = ans * a % MOD; b >>= 1; a = a ...
#include <bits/stdc++.h> using namespace std; int a[105], c[105]; int findz(int n) { return a[n] == n ? a[n] : a[n] = findz(a[n]); } void un(int x, int y) { a[findz(x)] = findz(y); } int main() { int n, l, f; cin >> n >> l; int count = 0; int wei = 0; memset(c, 0, sizeof(c)); for (int ...
#include <bits/stdc++.h> using namespace std; inline long long mod(long long n) { return (n % 1000000007); } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long n, m; cin >> n; vector<long long> v(n); map<long long, long long> has, cnt; for (long l...
#include <bits/stdc++.h> using namespace std; int invertir(int n) { int r = 0; while (n > 0) { r = r * 10 + (n % 10); n = n / 10; } return r; } int main() { int a, b; cin >> a >> b; cout << (a + invertir(b)); return 0; }
#include <bits/stdc++.h> using namespace std; long long n; int m; const long long mod = 1e9 + 7; struct Mat { long long mat[111][111]; } st, ed; long long stt[111][111]; void init() { memset(stt, 0, sizeof(stt)); stt[0][0] = stt[0][m - 1] = 1; for (int i = 1; i < m; ++i) stt[i][i - 1] = ...
#include <bits/stdc++.h> using namespace std; const long long mod = 998244353; long long a_na_b_mod_c(long long a, long long b, long long c) { if (b == 0) return 1; long long t = a_na_b_mod_c(a, (b / 2), c) % c; if (b % 2 == 0) return (t * t) % c; else return (((t * t) % c) * (a % c)) ...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; set<int> s; s.insert(0); int a; for (int i = 1; i <= n; i++) { cin >> a; if (s.find(a) != s.end()) { s.erase(a); } s.insert(i); } cout << s.size(); }
#include <bits/stdc++.h> using namespace std; const int N = 100050; struct node { int sa, ea, sb, eb; } a[N]; int t[N << 1], rt1[N << 1], rt2[N << 1], lc[N * 80], rc[N * 80], tot, n, m1, m2; bool cnt[N * 80], addv[N * 80]; inline bool cmp1(const node &a, const node &b) { return a.ea < b.ea; } inline...
#include <bits/stdc++.h> using namespace std; long long GCD(long long a, long long b) { return (b == 0) ? a : GCD(b, a % b); } long long oo = 1e18; long long const M = 1e9 + 7, N = 3e5 + 9; int n, m, d; string s = ; int ans = 0; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); ...
#include <bits/stdc++.h> using namespace std; const int INF = 1000000000; const int maxn = 1005; int c[10], n, s; int main() { scanf( %d%d , &n, &s); for (int i = 1, x; i <= n; i++) scanf( %d , &x), c[x]++; int ans = INF, I, K, J, t; for (int i = s / n; i >= 0; i--) for (int j = (s - c[3...
#include <bits/stdc++.h> using namespace std; vector<vector<int> > data; vector<bool> parallel; vector<int> father; vector<int> spec; vector<int> opt; vector<long long> ans; void dfs(int vertex) { if (parallel[vertex]) { int tot = 0; for (int i = 0; i < data[vertex].size(); ++i) { ...
#include <bits/stdc++.h> using namespace std; long long int c[2020][2020]; int main() { long long int n, k, sum = 0; cin >> n >> k; for (int i = 0; i < ((int)(n)); i++) { c[i][i] = -1; } if (k >= 3) { long long int tmp; for (int i = 0; i < ((int)(n - 1)); i++) { for (...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int i, t; vector<int> a; for (i = 0; i < n; i++) { cin >> t; a.push_back(t); } for (i = 0; i < n - 1; i++) { if (a[i] % 2 != 0) { a[i] %= 2; a[i + 1]--; if (a[i + 1] < 0)...
#include <bits/stdc++.h> using namespace std; long long Q = 1e9 + 7; long long poww(long long a, long long b) { long long x = 1, y = a; while (b > 0) { if (b % 2 == 1) { x = (x * y); if (x > Q) x %= Q; } y = (y * y); if (y > Q) y %= Q; b /= 2; } return...
#include <bits/stdc++.h> using namespace std; void solve() { long long n; cin >> n; vector<long long> ar(n + 1, 1e10); vector<long long> cur(n + 1, 1); for (long long i = 1; i <= n; i++) { cin >> ar[i]; if (ar[i] == ar[i - 1]) cur[i] = cur[i - 1] + 1; } long long ans = 0; ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; string s; for (int i = 1; i <= n; i++) { string str; ostringstream temp; temp << i; s += temp.str(); } cout << s[n - 1] << endl; }
#include <bits/stdc++.h> using namespace std; inline long long read() { char i = getchar(); long long f = 1, res = 0; while (i < 0 \|\| i > 9 ) { if (i == - ) f = -1; i = getchar(); } while (i >= 0 && i <= 9 ) { res = res * 10 + i - 0 ; i = getchar(); } retu...
#include <bits/stdc++.h> using namespace std; template <typename T> string tostr(const T& t) { ostringstream os; os << t; return os.str(); } int adj[110][110]; int adj2[110][110]; int N, M; set<int> emp[110]; bool are_connected2(int a, int b) { set<int>::iterator it; for (it = emp[...
#include <bits/stdc++.h> int dx[] = {0, 0, 1, -1, -1, -1, 1, 1}; int dy[] = {1, -1, 0, 0, -1, 1, 1, -1}; template <class T> inline T biton(T n, T pos) { return n \| ((T)1 << pos); } template <class T> inline T bitoff(T n, T pos) { return n & ~((T)1 << pos); } template <class T> inline T ison(...
#include <bits/stdc++.h> using namespace std; const int M = 1000000007, BIG = 0x3f3f3f3f; int n; vector<int> a; vector<int> Process() { vector<int> ans = {0}; int x = 0; for (int i = 0; i < n; i++) { if (a[i] < 0 && ++x > 2) { x = 1; ans.push_back(0); } ans.back()...
#include <bits/stdc++.h> using namespace std; int main() { int n; int i, t; char str[25]; while (~scanf( %s , str)) { int len = strlen(str); t = 0; for (int i = 0; i < len; i++) { if (str[i] == 4 \|\| str[i] == 7 ) { t++; } } if (t == 4 \|\| t =...
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; int n, a[200001], mp[200001], x, y; vector<int> to[200001], t2[200001]; int fa[200001], d[200001], sz[200001], son[200001]; int top[200001], dfn[200001], cnt; int f[200001], v[200001], p[200001], g[200001]; int st[200001], tp, s, sum...
#include <bits/stdc++.h> using namespace std; int main(int argc, char *argv[]) { int n; string str; string ans = ; while (cin >> n) { cin >> str; int now = 0; int vis[26]; ans = ; while (now < str.length()) { char tmp = str[now]; int diff = 0; ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long t; cin >> t; while (t--) { long long n; cin >> n; n = 4 * n; for (long long i = 0; i < (n / 4); i++) { cout << n - (2 * i) << ; } c...
#include <bits/stdc++.h> using namespace std; const int N = 100020, mo = 1e9 + 7; int n, second[N], x, y, cnt, dfn[N], vis[N]; int dot[N], size; int l[N], r[N]; long long ans = 1; set<pair<int, int> > L[N], R[N]; struct Dot { int x, y; } s[N]; inline void read(int &x) { x = 0; char c = g...
#include <bits/stdc++.h> using namespace std; bool notprime[1000010]; int sumprime[1000010]; void fun() { for (int i = 2; i <= 1000000; i++) { if (notprime[i] == 0) { for (int j = i * 2; j <= 1000000; j += i) { notprime[j] = 1; } } } } void sum() { sumprime[...
#include <bits/stdc++.h> using namespace std; int n, m, i, j; string s[103]; bool ktra1() { if (n % 3 == 0) { static int chk[1000]; fill_n(chk, 1000, 0); for (int i = 1; i <= n / 3; ++i) { for (int j = 1; j <= m; ++j) { chk[s[i][j]]++; } } if (chk[s[1]...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( avx,avx2,fma ) using namespace std; int main() { { long long n, m, k, p, s, k1, p1; cin >> n >> m >> s; if (s == 1) { cout << n * m; return 0; } k = (n - 1) % s + 1; k1 = n / s; ...
#include <bits/stdc++.h> using namespace std; struct point { int x, y, idx; long double at; bool operator<(const point &other) const { return at < other.at; } }; point p[123123]; int main() { int n; scanf( %d n , &n); for (auto(i) = (0); (i) < (n); (i)++) { int a, b; scanf(...
#include <bits/stdc++.h> using namespace std; bool primeFactor(int n) { if (n == 2 \|\| n == 3) return true; int sum = 1, two = 0, cnt; while (!(n % 2)) { return false; } for (int i = 3; i <= sqrt(n); i += 2) { while (!(n % i)) { return false; } } return true; }...
#include <bits/stdc++.h> const uint64_t MAX_NUM = 1000000000000000001ul; uint64_t get_iteration_simple(const int n, const uint64_t k, std::vector<uint64_t>& a) { int iterations = 0; while (true) { ++iterations; for (int i = 1; i < n; ++i) { a[i] += a[i - 1...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e2 + 7; const int inf = 0x3f3f3f3f; int t, n; int a[maxn]; char s[maxn]; int main() { cin >> t; while (t--) { scanf( %s , s + 1); n = strlen(s + 1); int ou = 0, sum = 0, zero = 0; int mark = -1; for (int ...
#include <bits/stdc++.h> #pragma comment(linker, /stack:200000000 ) #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; char _; inline long long powmod(long long x, long long n, long long _mod) { long long res = 1; while (...
#include <bits/stdc++.h> using namespace std; long long n, p, ans, v; void wczytaj(int x) { string slowo; cin >> slowo; if (x != n) wczytaj(x + 1); if (slowo.size() > 4) { ans += v * p; ans += p / 2; v = 2; ++v; } else { ans += v p; v *= 2; } } in...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t-- > 0) { int n; cin >> n; int a; int f[51] = {0}; for (int i = 0; i < 2 * n; i++) { cin >> a; if (f[a] == 0) { f[a]++; cout << a << ; } ...
#include <bits/stdc++.h> using namespace std; const int nmax = 32; int n, arr[nmax]; vector<int> output, current; bool been[2 * nmax][2 * nmax * nmax][nmax]; void dfs(int people, int sum, int position) { if (position > n) { if (people * (people - 1) / 2 == sum) { if (output.size() == 0) ...
#include <bits/stdc++.h> using namespace std; const int manx = 1e5 + 100; const int INF = 0x3f3f3f3f; int main() { int n, a[200], b[200], cnt = 0, numb1 = 0; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); if (a[i]) cnt++; } for (int i = 1; i <= n; i++) { ...
#include <bits/stdc++.h> using namespace std; int main() { long n; int k; cin >> n >> k; long l = 1, r = n; while (l < r) { long m = l + (r - l) / 2; long s = 0, v = m; while (v != 0) { s += v; v /= k; } if (s >= n) r = m; else ...
#include <bits/stdc++.h> using namespace std; template <typename P, typename Q> ostream& operator<<(ostream& os, pair<P, Q> p) { os << ( << p.first << , << p.second << ) ; return os; } int main(int argc, char* argv[]) { ios_base::sync_with_stdio(0); cin.tie(0); int n; long long in...
#include <bits/stdc++.h> using namespace std; const int N = 200010, M = 500010; int h[N], e[M * 2], nex[M * 2], idx, n, m, nodea, nodeb, sz; int col[N]; void add(int x, int y) { e[idx] = y; nex[idx] = h[x]; h[x] = idx++; } bool dfs1(int u) { col[u] = 1; sz++; for (int i = h[u]; ~i;...
#include <bits/stdc++.h> using namespace std; int n, m, d[100005], sd[100005][3], f[2 * 100005]; int Find(int x) { return f[x] == x ? x : f[x] = Find(f[x]); } void link(int a, int b) { int x = Find(a), y = Find(b); if (x != y) f[x] = y; } int main(void) { cin >> n >> m; for (int i = 0; i < n...
#include <bits/stdc++.h> using namespace std; const int maxn = 1005; char st[maxn][maxn]; char tmp[maxn][maxn]; int row[maxn], rs; int col[maxn], cs; int n, m; void init() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) scanf( %s , st[i] + 1); } void work() { rs = 0; for (int i...
#include <bits/stdc++.h> using namespace std; const int MAXN = 150005; int a[MAXN]; int num[MAXN]; bool vis[MAXN]; int n, m, ans; int main() { memset(vis, 0, sizeof(vis)); memset(num, 0, sizeof(num)); scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , &a[i]); num[a[i]]+...
#include <bits/stdc++.h> using namespace std; pair<long long, long long> a[5]; long long k; int main() { for (long long i = 1, _b = (2); i <= _b; i++) cin >> a[i].first >> a[i].second; cin >> k; sort(a + 1, a + 2 + 1); if (a[1].second < a[2].first) return cout << 0, 0; long long res = ...
#include <bits/stdc++.h> using namespace std; bool debug = 1; int main() { long long k; vector<long long> v; scanf( %lld , &k); string s; cin >> s; long long sum = 0; for (int i = 0; i < (s.size()); i++) { v.push_back(s[i] - 0 ); sum += v[i]; } sort(v.begin(), v.en...
#include <bits/stdc++.h> using namespace std; set<int> S; priority_queue<pair<int, pair<int, int> >, vector<pair<int, pair<int, int> > >, greater<pair<int, pair<int, int> > > > H; int i, j, k, n, a[222222], nl, nr, sz, aa, bb, u[222222], o; pair<int, pair<int, int> > pp; set<pair<int,...
#include <bits/stdc++.h> using namespace std; const int maxn = (int)3 * 1e5 + 21; const double eps = (double)1e-8; const int mod = (int)1000000007; int a[maxn], b[maxn]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, x; memset((a), 0, sizeof(a)); ; mem...
#include <bits/stdc++.h> using namespace std; int ToInt(string& s, int len) { int r = 0; for (int i = 0, max_ = (len); i < max_; ++i) { r = 10; r += s[i] - 0 ; } return r; } int GCD(int a, int b) { return b != 0 ? GCD(b, a % b) : a; } int LCM(int a, int b) { return a (b / GCD(a...
#include <bits/stdc++.h> using namespace std; const long long INF = 1e9, MAX = 100100, mod = 1000000007; signed main() { long long n, k, A, B; cin >> n >> k >> A >> B; long long ans = 0; if (k == 1) cout << (n - 1) * A; else { while (n != 1) { if (n < k) { ans = a...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { long long int a, b, n, s; cin >> a >> b >> n >> s; if (((s % n) <= b) && (((a * n) + b) >= s)) { cout << YES n ; } else { cout << NO n ; } } }
#include <bits/stdc++.h> #pragma comment(linker, /STACK:268435456 ) using namespace std; template <typename T> inline T abs(T a) { return ((a < 0) ? -a : a); } template <typename T> inline T sqr(T a) { return a * a; } template <class T> T gcd(T a, T b) { return a ? gcd(b % a, a) : b; ...

#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 9; int n, u, v, w, t, p, sub[N], par[N], mark[N]; vector<pair<int, int> > g[N]; vector<pair<int, pair<int, int> > > edge[N]; pair<pair<int, int>, pair<int, int> > ed[N]; long long mx, ans[N]; set<int> s; int Get_par(int u) { if (par...

#include <bits/stdc++.h> using namespace std; struct Node { int ancestor; vector<int> children; }; class TarjanOLCA { enum Color { WHITE = 0, BLACK = 1, }; public: TarjanOLCA(const vector<Node>& tree, int root, const vector<pair<int, int> >& query) : ...

#include <bits/stdc++.h> #define optimize ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); #define S second #define F first #define ENDL n #define fori(i, n) for(int i=0; i<n; ++i) #define foreach(n) for(int i=0; i<n; ++i) #define read_v(v) for(int i=0; i<v.size(); ++i) cin >> v[i] #defi...

#include <bits/stdc++.h> using namespace std; struct Data { bool bip; int a, xora, ha; int b, xorb, hb; }; struct dsu { int n; bool bip = 1; vector<int> x, t, h; vector<Data> memo; dsu(int nn) { n = nn; x.resize(n + 1); t.resize(n + 1); h.resize(n + 1); ...

#include <bits/stdc++.h> using namespace std; int t, a, b, c, ans, t1; int main() { scanf( %d , &t); while (t--) { scanf( %d%d%d , &a, &b, &c); ans = 0; t1 = c / 2; t1 = min(t1, b); ans += t1 * 3; b -= t1; t1 = b / 2; t1 = min(t1, a); ans += t1 * 3; ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); string s; cin >> s; vector<int> st; st.push_back(s[0]); for (int i = 1; i < s.size(); i++) { if (st.empty()) st.push_back(s[i]); else { if (st.back() == s[...

#include <bits/stdc++.h> using namespace std; int A[55], ctos, lleno; long long D[52][52][52][52]; double res = 0, suma; int main() { scanf( %d , &ctos); for (int i = 1; i <= ctos; i++) { scanf( %d , &A[i]); suma += A[i]; } scanf( %d , &lleno); for (int quien = 1; quien <= ctos...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 5; char s[maxn], t[maxn]; int pr1, mod1, pr2, mod2; const int prs[60] = { 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, ...

#include <bits/stdc++.h> int main() { long a, b; while (scanf( %ld%ld , &a, &b) != EOF) { if (a == b) { if (a % 2 == 0) printf( 2 n ); else if (a % 3 == 0) printf( 3 n ); else if (a % 5 == 0) printf( 5 n ); else if (a % 7 == 0) prin...

#include <bits/stdc++.h> using namespace std; const double PI = acos(-1.0); const double eps = 1e-8; char ans[1024]; int K, X, N, M; char st[64], ed[64]; long long num[64]; void printAns(char from, char to, int all, int len) { int pos = 1; if (from == A ) pos = 0; for (int i = 0; i < len; i...

#include <bits/stdc++.h> using namespace std; string last_w = ; set<string> reserved; void change_last_w() { do { int j(last_w.size() - 1); while (j >= 0 && last_w[j] == z ) --j; if (j == -1) last_w.assign(last_w.size() + 1, a ); else { ++last_w[j]; for (i...

#include <bits/stdc++.h> #pragma comment(linker, /STACK: 1024000000,1024000000 ) using namespace std; inline int getint() { int _x = 0; char _tc = getchar(); while (_tc < 0 || _tc > 9 ) _tc = getchar(); while (_tc >= 0 && _tc <= 9 ) _x *= 10, _x += (_tc - 0 ), _tc = getchar(); return _...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long n; cin >> n; long long a[n]; for (long long i = 0; i < n; i++) cin >> a[i]; long long ans = 0; for (long long i = n - 1; i >= 0; i--) { if (i == n - 1) ...

#include <bits/stdc++.h> long long mod = 1000000007; long long mod2 = 998244353; long long OO = 1e18; long long david_villa_pow(long long x, long long n) { if (n == 0) return 1; long long u = david_villa_pow(x, n / 2); u = ((u) * (u)); if (n % 2 == 1) u = ((u) * (x)); return u; } long lo...

#include <bits/stdc++.h> using namespace std; const int inf = (1 << 30) - 1; const long long linf = (1ll << 62) - 1; int main() { int n; cin >> n; vector<int> is_prime(n + 1, true), primes; is_prime[0] = is_prime[1] = 0; for (int i = 2; i * i <= n; i++) { if (is_prime[i]) { for...

#include <bits/stdc++.h> using namespace std; int main() { long long int i, n, k, r; cin >> n >> k; long long int a[n]; for (i = 0; i < n; i++) { cin >> a[i]; } long long int *m = min_element(a, a + n); r = 0; for (i = 0; i < n; i++) { if ((a[i] - *m) % k == 0) { ...

#include <bits/stdc++.h> using namespace std; const int N = 1000 * 100 + 10; int n, d[N], par[N]; pair<int, int> tr[N * 4]; pair<long long, int> a[N], b[N]; void add(int val, int p, int b = 0, int e = n, int ind = 1) { tr[ind] = max(tr[ind], make_pair(val, p)); if (b + 1 == e) return; int mid = ...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:267386880 ) using namespace std; int n; char g[72][72]; struct pos { int data[3]; }; const int MAXQ = 400000; bool used[72][72][72]; pos prv[72][72][72]; pos q[MAXQ]; int head, tail; pair<int, int> getDiff(pos &a, pos &b) { int dif...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { int n, q; cin >> n >> q; string s; cin >> s; int pref[n + 1]; memset(pref, 0, sizeof(pref)); set<int> arr[2 * n + 5...

#include <bits/stdc++.h> using namespace std; long long int him(long long int a, long long int n) { long long int ans = 1; while (n) { if (n % 2 != 0) { ans = ((ans) * (a)); } a = ((a) * (a)); n = n / 2; } return ans; } int main() { long long int t; cin >>...

#include <bits/stdc++.h> using namespace std; const int Max = 1e6 + 5; int lst[Max]; int main() { int t; cin >> t; while (t--) { long long n, k; cin >> n >> k; long long sum = 0; while (n > 0) { if (n % k == 0) { n /= k; sum++; } else { ...

#include <bits/stdc++.h> using namespace std; vector<string> split_string(string); bool isDiverse(string &s) { int len = s.length(); sort(s.begin(), s.end()); for (int i = 0; i < len - 1; i++) { if (s[i] == s[i + 1]) { return false; } else if (s[i + 1] != s[i] + 1) { return...

#include <bits/stdc++.h> using namespace std; const int MAXN = 405; const int oo = 10005; int N, M, T, K, Q; vector<pair<int, int> > G[MAXN]; int dp[MAXN][MAXN][MAXN]; int par[MAXN]; int indPar[MAXN]; void DFS(int u, int p) { par[u] = p; for (int i = 0; i < G[u].size(); i++) { int v = G[...

#include <bits/stdc++.h> using namespace std; int main() { long long n, k; cin >> n; string s = to_string(n); k = s.size() - 1; if (k > 0) { long long a = rint(pow(10, k)); long long z = rint(n / a); long long m = (z + 1) * a; cout << m - n; } else cout << 1; ...

#include<bits/stdc++.h> using namespace std; #define ll long long ll gcd(ll a, ll b){ return b?gcd(b,a%b):a; } ll a[200005],b[200005],c,d; int main(){ ll n,m; scanf( %lld%lld ,&n,&m); ll d=0; cin>>a[1]; for(ll i=2;i<=n;i++){ //从a[2]-a[1]开始 scanf( %lld ,&a[i]); d=gcd(d,a[i]-a[...

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

#include <bits/stdc++.h> using namespace std; const int INF = 2147483647; const long long LLINF = 9223372036854775807LL; const int maxn = 30010; int a[maxn] = {}; int used[maxn] = {}; int main() { int n; scanf( %d , &n); for (int i = 0; i < n; ++i) scanf( %d , &a[i]); vector<int> ans1, ans...

#include <bits/stdc++.h> using namespace std; #pragma GCC target( avx2 ) #pragma GCC optimization( unroll-loops ) #pragma GCC optimize( O2 ) constexpr int dx[] = {-1, 0, 1, 0, 1, 1, -1, -1}; constexpr int dy[] = {0, -1, 0, 1, 1, -1, 1, -1}; constexpr long long INF = 1999999999999999997; constexpr int in...

#include <bits/stdc++.h> #define fi first #define se second #define db double #define U unsigned #define P std::pair<int,int> #define LL long long #define pb push_back #define MP std::make_pair #define all(x) x.begin(),x.end() #define CLR(i,a) memset(i,a,sizeof(i)) #define FOR(i,a,b) for(int i ...

#include <bits/stdc++.h> #pragma GCC optimization( O3 ) using namespace std; template <typename T> inline void Cin(T& first) { char c; T sign = 1; first = 0; for (c = getchar(); c < 0 || c > 9 ; c = getchar()) if (c == - ) sign = -1; for (; c >= 0 && c <= 9 ; c = getchar()) firs...

#include <bits/stdc++.h> using namespace std; const double eps = 1e-9; const double pi = acos(-1.0); int a[32][101111], n, m, d[32][111111], b[111111], t[400111]; pair<pair<int, int>, int> p[111111]; int bit(int mask, int i) { return (mask & (1 << i)) > 0; } void build(int v, int tl, int tr) { if (tl ...

#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3fll; map<int, int> memo; int solve(int mask) { if (!mask) return 0; if (memo.find(mask) != memo.end()) return memo[mask]; map<int, bool> canreach; for (int i = 0; i < 32; i++) { ...

#include <bits/stdc++.h> using namespace std; int t, n; int a[1000005]; vector<int> x; void solve() { int sum = 0, ans; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; sum += a[i]; } int l = 1, r = 1e7; while (l <= r) { int mid = (l + r) >> 1; if (mid * n ...

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

#include <bits/stdc++.h> using namespace std; int main() { int n, jump[100005]; bool visited[100005]; string s; cin >> n; cin >> s; for (int i = 0; i < n; i++) cin >> jump[i]; int pos = 0; fill(visited, visited + n, false); while (!visited[pos]) { visited[pos] = true; ...

#include <bits/stdc++.h> using namespace std; double PI = 3.141592653589793238462643383279; const double EPS = 1e-9; const long long MOD = 1000000007; const int inf = 1 << 30; const long long linf = 1LL << 60; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); namespace LCA { vector<...

#include <bits/stdc++.h> using namespace std; int a[105][105], b, c, d, e, f, g, h, i, j, k, l, m, n; inline bool pd(int x, int y, int s) { return a[x - 1][y] == s || a[x + 1][y] == s || a[x][y - 1] == s || a[x][y + 1] == s; } int main() { scanf( %d%d , &n, &m); for (i = 1; i <= n; i++)...

#include <bits/stdc++.h> using namespace std; int h, q, v, e; string s; map<int, int> xx; inline double dfs(int x, int mx) { if (xx[x] <= mx) return mx; return 0.5 * (dfs(x << 1, max(mx, xx[x] - xx[x << 1])) + dfs(x << 1 | 1, max(mx, xx[x] - xx[x << 1 | 1]))); } int main() { ...

#include <bits/stdc++.h> using namespace std; int a[200000]; int main() { int t; cin >> t; while (t--) { int n; cin >> n; int odd = 0, even = 0; for (int i = 0; i < n; i++) { cin >> a[i]; if (a[i] & 1) odd++; else even++; } ...

#include <bits/stdc++.h> using namespace std; int main() { long long i, j, n, m, a, b, s = 0, e1, e2, o1, o2; long long t; cin >> t; while (t--) { e1 = e2 = o1 = o2 = 0; cin >> n; for (int i = 0; i < n; i++) { cin >> a; if (a & 1) o1++; else ...

#include <bits/stdc++.h> using namespace std; const int maxn = 400050; int n, x; long long w; vector<long long> val[4]; int Abs(int a) { return a < 0 ? -a : a; } int main() { scanf( %d , &n); long long sum = 0; for (int i = 0; i < n; i++) { scanf( %d%I64d , &x, &w); if (x == 11) ...

#include <bits/stdc++.h> using namespace std; int main() { int r, c; cin >> r; cin >> c; vector<vector<bool> > a(r); for (int i = 0; i < r; i++) a[i].resize(c); char t_c; for (int i = 0; i < r; i++) { for (int j = 0; j < c; j++) { cin >> t_c; if (t_c == . ) ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 100 + 5; const long long MOD = 1000000007; long long pow2[MAXN]; char x[MAXN]; int main() { scanf( %s , x); int n = strlen(x); pow2[0] = 1; for (int i = 1; i < n; i++) pow2[i] = (pow2[i - 1] * 2) % MOD; long long d = pow2[n -...

#include <bits/stdc++.h> using namespace std; const int MAX_N = 1000000 + 20; int pos[MAX_N], mark[MAX_N]; int inter[MAX_N]; set<int> D; long long ans; int n, k; void add(int x) { for (; x <= n; x += x & (-x)) ++inter[x]; } int get(int x) { if (x < 1) return 0; int res = 0; for (; x ...

#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; const long long inf = 1e18 + 9; const long long MAX_SIZE = 1e7 + 1; long long _t = 1, _T, csn; long long max(long long a, long long b) { if (a < b) return b; return a; } long long min(long long a, long long b) { if ...

#include <bits/stdc++.h> using namespace std; const int N = 5005; int n, a, b, k; int d[3][N]; int sum[N]; int ans = 0; int cur = 1; int main() { scanf( %d%d%d%d , &n, &a, &b, &k); d[0][a] = 1; for (int cnt = 1; cnt <= k; ++cnt) { for (int i = 1; i <= n; ++i) sum[i] = (sum[i - ...

#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 9; const int L = 20; int par[N][L]; int up[N][L]; int h[N]; int to[N]; int s[N], t[N]; pair<int, int> edge[N]; vector<pair<int, int> > al[N]; int find(int v) { if (to[v] == v) return v; return to[v] = find(to[v]); } int ...

#include <bits/stdc++.h> using namespace std; const int inf = 1999999999; const double pi = acos(-1.0); const double eps = 1e-10; char gc() { char c; while (isspace(c = getchar())) ; return c; } int gs(char* s) { gets(s); int l = strlen(s); while (l && isspace(s[l - 1])) s[--...

#include <bits/stdc++.h> using namespace std; int main() { vector<vector<string> > tab(9); int emp[3][3]; memset(emp, 0, sizeof emp); for (int i = 0; i < 9; i++) { tab[i].resize(3); for (int j = 0; j < 3; j++) { string a; cin >> a; for (int k = 0; k < a.size(); k+...

#include <bits/stdc++.h> using namespace std; const long long MAXN = 1e6 + 10; const long long INF = 8e18; const long long MOD = 1e9 + 7; inline long long poww(long long a, long long b) { a %= MOD; long long ans = 1; while (b > 0) { if (b & 1) ans = ans * a % MOD; b >>= 1; a = a ...

#include <bits/stdc++.h> using namespace std; int a[105], c[105]; int findz(int n) { return a[n] == n ? a[n] : a[n] = findz(a[n]); } void un(int x, int y) { a[findz(x)] = findz(y); } int main() { int n, l, f; cin >> n >> l; int count = 0; int wei = 0; memset(c, 0, sizeof(c)); for (int ...

#include <bits/stdc++.h> using namespace std; inline long long mod(long long n) { return (n % 1000000007); } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long n, m; cin >> n; vector<long long> v(n); map<long long, long long> has, cnt; for (long l...

#include <bits/stdc++.h> using namespace std; int invertir(int n) { int r = 0; while (n > 0) { r = r * 10 + (n % 10); n = n / 10; } return r; } int main() { int a, b; cin >> a >> b; cout << (a + invertir(b)); return 0; }

#include <bits/stdc++.h> using namespace std; long long n; int m; const long long mod = 1e9 + 7; struct Mat { long long mat[111][111]; } st, ed; long long stt[111][111]; void init() { memset(stt, 0, sizeof(stt)); stt[0][0] = stt[0][m - 1] = 1; for (int i = 1; i < m; ++i) stt[i][i - 1] = ...

#include <bits/stdc++.h> using namespace std; const long long mod = 998244353; long long a_na_b_mod_c(long long a, long long b, long long c) { if (b == 0) return 1; long long t = a_na_b_mod_c(a, (b / 2), c) % c; if (b % 2 == 0) return (t * t) % c; else return (((t * t) % c) * (a % c)) ...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; set<int> s; s.insert(0); int a; for (int i = 1; i <= n; i++) { cin >> a; if (s.find(a) != s.end()) { s.erase(a); } s.insert(i); } cout << s.size(); }

#include <bits/stdc++.h> using namespace std; const int N = 100050; struct node { int sa, ea, sb, eb; } a[N]; int t[N << 1], rt1[N << 1], rt2[N << 1], lc[N * 80], rc[N * 80], tot, n, m1, m2; bool cnt[N * 80], addv[N * 80]; inline bool cmp1(const node &a, const node &b) { return a.ea < b.ea; } inline...

#include <bits/stdc++.h> using namespace std; long long GCD(long long a, long long b) { return (b == 0) ? a : GCD(b, a % b); } long long oo = 1e18; long long const M = 1e9 + 7, N = 3e5 + 9; int n, m, d; string s = ; int ans = 0; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); ...

#include <bits/stdc++.h> using namespace std; const int INF = 1000000000; const int maxn = 1005; int c[10], n, s; int main() { scanf( %d%d , &n, &s); for (int i = 1, x; i <= n; i++) scanf( %d , &x), c[x]++; int ans = INF, I, K, J, t; for (int i = s / n; i >= 0; i--) for (int j = (s - c[3...

#include <bits/stdc++.h> using namespace std; vector<vector<int> > data; vector<bool> parallel; vector<int> father; vector<int> spec; vector<int> opt; vector<long long> ans; void dfs(int vertex) { if (parallel[vertex]) { int tot = 0; for (int i = 0; i < data[vertex].size(); ++i) { ...

#include <bits/stdc++.h> using namespace std; long long int c[2020][2020]; int main() { long long int n, k, sum = 0; cin >> n >> k; for (int i = 0; i < ((int)(n)); i++) { c[i][i] = -1; } if (k >= 3) { long long int tmp; for (int i = 0; i < ((int)(n - 1)); i++) { for (...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int i, t; vector<int> a; for (i = 0; i < n; i++) { cin >> t; a.push_back(t); } for (i = 0; i < n - 1; i++) { if (a[i] % 2 != 0) { a[i] %= 2; a[i + 1]--; if (a[i + 1] < 0)...

#include <bits/stdc++.h> using namespace std; long long Q = 1e9 + 7; long long poww(long long a, long long b) { long long x = 1, y = a; while (b > 0) { if (b % 2 == 1) { x = (x * y); if (x > Q) x %= Q; } y = (y * y); if (y > Q) y %= Q; b /= 2; } return...

#include <bits/stdc++.h> using namespace std; void solve() { long long n; cin >> n; vector<long long> ar(n + 1, 1e10); vector<long long> cur(n + 1, 1); for (long long i = 1; i <= n; i++) { cin >> ar[i]; if (ar[i] == ar[i - 1]) cur[i] = cur[i - 1] + 1; } long long ans = 0; ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; string s; for (int i = 1; i <= n; i++) { string str; ostringstream temp; temp << i; s += temp.str(); } cout << s[n - 1] << endl; }

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

#include <bits/stdc++.h> using namespace std; template <typename T> string tostr(const T& t) { ostringstream os; os << t; return os.str(); } int adj[110][110]; int adj2[110][110]; int N, M; set<int> emp[110]; bool are_connected2(int a, int b) { set<int>::iterator it; for (it = emp[...

#include <bits/stdc++.h> int dx[] = {0, 0, 1, -1, -1, -1, 1, 1}; int dy[] = {1, -1, 0, 0, -1, 1, 1, -1}; template <class T> inline T biton(T n, T pos) { return n | ((T)1 << pos); } template <class T> inline T bitoff(T n, T pos) { return n & ~((T)1 << pos); } template <class T> inline T ison(...

#include <bits/stdc++.h> using namespace std; const int M = 1000000007, BIG = 0x3f3f3f3f; int n; vector<int> a; vector<int> Process() { vector<int> ans = {0}; int x = 0; for (int i = 0; i < n; i++) { if (a[i] < 0 && ++x > 2) { x = 1; ans.push_back(0); } ans.back()...

#include <bits/stdc++.h> using namespace std; int main() { int n; int i, t; char str[25]; while (~scanf( %s , str)) { int len = strlen(str); t = 0; for (int i = 0; i < len; i++) { if (str[i] == 4 || str[i] == 7 ) { t++; } } if (t == 4 || t =...

#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; int n, a[200001], mp[200001], x, y; vector<int> to[200001], t2[200001]; int fa[200001], d[200001], sz[200001], son[200001]; int top[200001], dfn[200001], cnt; int f[200001], v[200001], p[200001], g[200001]; int st[200001], tp, s, sum...

#include <bits/stdc++.h> using namespace std; int main(int argc, char *argv[]) { int n; string str; string ans = ; while (cin >> n) { cin >> str; int now = 0; int vis[26]; ans = ; while (now < str.length()) { char tmp = str[now]; int diff = 0; ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long t; cin >> t; while (t--) { long long n; cin >> n; n = 4 * n; for (long long i = 0; i < (n / 4); i++) { cout << n - (2 * i) << ; } c...

#include <bits/stdc++.h> using namespace std; const int N = 100020, mo = 1e9 + 7; int n, second[N], x, y, cnt, dfn[N], vis[N]; int dot[N], size; int l[N], r[N]; long long ans = 1; set<pair<int, int> > L[N], R[N]; struct Dot { int x, y; } s[N]; inline void read(int &x) { x = 0; char c = g...

#include <bits/stdc++.h> using namespace std; bool notprime[1000010]; int sumprime[1000010]; void fun() { for (int i = 2; i <= 1000000; i++) { if (notprime[i] == 0) { for (int j = i * 2; j <= 1000000; j += i) { notprime[j] = 1; } } } } void sum() { sumprime[...

#include <bits/stdc++.h> using namespace std; int n, m, i, j; string s[103]; bool ktra1() { if (n % 3 == 0) { static int chk[1000]; fill_n(chk, 1000, 0); for (int i = 1; i <= n / 3; ++i) { for (int j = 1; j <= m; ++j) { chk[s[i][j]]++; } } if (chk[s[1]...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( avx,avx2,fma ) using namespace std; int main() { { long long n, m, k, p, s, k1, p1; cin >> n >> m >> s; if (s == 1) { cout << n * m; return 0; } k = (n - 1) % s + 1; k1 = n / s; ...

#include <bits/stdc++.h> using namespace std; struct point { int x, y, idx; long double at; bool operator<(const point &other) const { return at < other.at; } }; point p[123123]; int main() { int n; scanf( %d n , &n); for (auto(i) = (0); (i) < (n); (i)++) { int a, b; scanf(...

#include <bits/stdc++.h> using namespace std; bool primeFactor(int n) { if (n == 2 || n == 3) return true; int sum = 1, two = 0, cnt; while (!(n % 2)) { return false; } for (int i = 3; i <= sqrt(n); i += 2) { while (!(n % i)) { return false; } } return true; }...

#include <bits/stdc++.h> const uint64_t MAX_NUM = 1000000000000000001ul; uint64_t get_iteration_simple(const int n, const uint64_t k, std::vector<uint64_t>& a) { int iterations = 0; while (true) { ++iterations; for (int i = 1; i < n; ++i) { a[i] += a[i - 1...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e2 + 7; const int inf = 0x3f3f3f3f; int t, n; int a[maxn]; char s[maxn]; int main() { cin >> t; while (t--) { scanf( %s , s + 1); n = strlen(s + 1); int ou = 0, sum = 0, zero = 0; int mark = -1; for (int ...

#include <bits/stdc++.h> #pragma comment(linker, /stack:200000000 ) #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; char _; inline long long powmod(long long x, long long n, long long _mod) { long long res = 1; while (...

#include <bits/stdc++.h> using namespace std; long long n, p, ans, v; void wczytaj(int x) { string slowo; cin >> slowo; if (x != n) wczytaj(x + 1); if (slowo.size() > 4) { ans += v * p; ans += p / 2; v *= 2; ++v; } else { ans += v * p; v *= 2; } } in...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t-- > 0) { int n; cin >> n; int a; int f[51] = {0}; for (int i = 0; i < 2 * n; i++) { cin >> a; if (f[a] == 0) { f[a]++; cout << a << ; } ...

#include <bits/stdc++.h> using namespace std; const int nmax = 32; int n, arr[nmax]; vector<int> output, current; bool been[2 * nmax][2 * nmax * nmax][nmax]; void dfs(int people, int sum, int position) { if (position > n) { if (people * (people - 1) / 2 == sum) { if (output.size() == 0) ...

#include <bits/stdc++.h> using namespace std; const int manx = 1e5 + 100; const int INF = 0x3f3f3f3f; int main() { int n, a[200], b[200], cnt = 0, numb1 = 0; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); if (a[i]) cnt++; } for (int i = 1; i <= n; i++) { ...

#include <bits/stdc++.h> using namespace std; int main() { long n; int k; cin >> n >> k; long l = 1, r = n; while (l < r) { long m = l + (r - l) / 2; long s = 0, v = m; while (v != 0) { s += v; v /= k; } if (s >= n) r = m; else ...

#include <bits/stdc++.h> using namespace std; template <typename P, typename Q> ostream& operator<<(ostream& os, pair<P, Q> p) { os << ( << p.first << , << p.second << ) ; return os; } int main(int argc, char* argv[]) { ios_base::sync_with_stdio(0); cin.tie(0); int n; long long in...

#include <bits/stdc++.h> using namespace std; const int N = 200010, M = 500010; int h[N], e[M * 2], nex[M * 2], idx, n, m, nodea, nodeb, sz; int col[N]; void add(int x, int y) { e[idx] = y; nex[idx] = h[x]; h[x] = idx++; } bool dfs1(int u) { col[u] = 1; sz++; for (int i = h[u]; ~i;...

#include <bits/stdc++.h> using namespace std; int n, m, d[100005], sd[100005][3], f[2 * 100005]; int Find(int x) { return f[x] == x ? x : f[x] = Find(f[x]); } void link(int a, int b) { int x = Find(a), y = Find(b); if (x != y) f[x] = y; } int main(void) { cin >> n >> m; for (int i = 0; i < n...

#include <bits/stdc++.h> using namespace std; const int maxn = 1005; char st[maxn][maxn]; char tmp[maxn][maxn]; int row[maxn], rs; int col[maxn], cs; int n, m; void init() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) scanf( %s , st[i] + 1); } void work() { rs = 0; for (int i...

#include <bits/stdc++.h> using namespace std; const int MAXN = 150005; int a[MAXN]; int num[MAXN]; bool vis[MAXN]; int n, m, ans; int main() { memset(vis, 0, sizeof(vis)); memset(num, 0, sizeof(num)); scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , &a[i]); num[a[i]]+...

#include <bits/stdc++.h> using namespace std; pair<long long, long long> a[5]; long long k; int main() { for (long long i = 1, _b = (2); i <= _b; i++) cin >> a[i].first >> a[i].second; cin >> k; sort(a + 1, a + 2 + 1); if (a[1].second < a[2].first) return cout << 0, 0; long long res = ...

#include <bits/stdc++.h> using namespace std; bool debug = 1; int main() { long long k; vector<long long> v; scanf( %lld , &k); string s; cin >> s; long long sum = 0; for (int i = 0; i < (s.size()); i++) { v.push_back(s[i] - 0 ); sum += v[i]; } sort(v.begin(), v.en...

#include <bits/stdc++.h> using namespace std; set<int> S; priority_queue<pair<int, pair<int, int> >, vector<pair<int, pair<int, int> > >, greater<pair<int, pair<int, int> > > > H; int i, j, k, n, a[222222], nl, nr, sz, aa, bb, u[222222], o; pair<int, pair<int, int> > pp; set<pair<int,...

#include <bits/stdc++.h> using namespace std; const int maxn = (int)3 * 1e5 + 21; const double eps = (double)1e-8; const int mod = (int)1000000007; int a[maxn], b[maxn]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, x; memset((a), 0, sizeof(a)); ; mem...

#include <bits/stdc++.h> using namespace std; int ToInt(string& s, int len) { int r = 0; for (int i = 0, max_ = (len); i < max_; ++i) { r *= 10; r += s[i] - 0 ; } return r; } int GCD(int a, int b) { return b != 0 ? GCD(b, a % b) : a; } int LCM(int a, int b) { return a * (b / GCD(a...

#include <bits/stdc++.h> using namespace std; const long long INF = 1e9, MAX = 100100, mod = 1000000007; signed main() { long long n, k, A, B; cin >> n >> k >> A >> B; long long ans = 0; if (k == 1) cout << (n - 1) * A; else { while (n != 1) { if (n < k) { ans = a...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { long long int a, b, n, s; cin >> a >> b >> n >> s; if (((s % n) <= b) && (((a * n) + b) >= s)) { cout << YES n ; } else { cout << NO n ; } } }

#include <bits/stdc++.h> #pragma comment(linker, /STACK:268435456 ) using namespace std; template <typename T> inline T abs(T a) { return ((a < 0) ? -a : a); } template <typename T> inline T sqr(T a) { return a * a; } template <class T> T gcd(T a, T b) { return a ? gcd(b % a, a) : b; ...