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

func_code_string stringlengths 59 71.4k
#include <bits/stdc++.h> template <class T> inline void read(T &x) { x = 0; int f = 0; char ch = getchar(); while (!isdigit(ch)) { f \|= ch == - ; ch = getchar(); } while (isdigit(ch)) { x = (x << 1) + (x << 3) + (ch ^ 48); ch = getchar(); } x = f ? -x : x; ...
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7, INF = 1e9; const int mx = 1e5 + 5; int main() { ios::sync_with_stdio(0); cin.tie(0); int n, s, k; cin >> n >> s; if (2 * n > s) cout << NO << endl; else { cout << YES << endl; for (int i = 1; i <...
#include <bits/stdc++.h> int days[200][12]; int v[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; void swap(int &a, int &b) { int t = a; a = b; b = t; } struct year { int y; int m; int d; bool operator>(year &next) { if (this->y > next.y) return true; el...
#include <bits/stdc++.h> using namespace std; int n, arr[100005], diff[100005], prv[100005]; bool flag[100005]; vector<int> a, d; int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %d , arr + i); flag[arr[i]] = 1; } for (int i = 1; i <= n; ++i) { if (!flag[ar...
#include <bits/stdc++.h> using namespace std; long long t, n, m; long long pre[405][405], a[405][405], sum[405]; long long get(long long a, long long b, long long c) { return pre[b][c] - pre[a - 1][c]; } signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin...
#include <bits/stdc++.h> using namespace std; int read() { int x = 0, f = 1; char ch = getchar(); while (ch < 0 \|\| ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 48, ch = getchar(); } return x * f; } bool vi...
#include <bits/stdc++.h> using namespace std; int a[100002], b[100000]; int main() { int n; cin >> n; set<pair<int, int> > c; c.clear(); for (int i = 1; i <= n; i++) { int x, y; cin >> x >> y; pair<int, int> a = make_pair(x, y); c.insert(a); } n = 0; set<pai...
#include <bits/stdc++.h> using namespace std; double x[1010], y[1010]; bool vis[1010]; int main() { int n, cnt = 0; double x0, y0; scanf( %d%lf%lf , &n, &x0, &y0); for (int i = 0; i < n; i++) { scanf( %lf%lf , &x[i], &y[i]); } for (int i = 0; i < n; i++) { double x1 = x[i], y...
#include <bits/stdc++.h> using namespace std; int main() { int arr[2], x; cin >> arr[0] >> arr[1] >> x; vector<int> v; int curr = 1; if (x % 2 == 1) { v.push_back(curr); arr[curr]--; curr ^= 1; for (int i = 0; i < x; i++) { v.push_back(curr); arr[curr]--; ...
#include <bits/stdc++.h> using namespace std; #define ll long long #define ld long double #define pii pair <ll, ll> #define mp make_pair // const int inf = 1e9 + 111; const int NMAX = 200111; const int inf = 1e9 + 7; const ld eps = 0.00000000001; const ll mod = 1e9 + 7; constexpr int64...
#include <bits/stdc++.h> using namespace std; char s[100050]; bool vis; int main() { scanf( %s , s + 1); int len = strlen(s + 1); if (len <= 2) { printf( No n ); return 0; } for (int i = 1; i <= len - 2; i++) { if (s[i] != s[i + 1] && s[i + 1] != s[i + 2] && s[i] != s[i + 2...
#include <bits/stdc++.h> using namespace std; string s; long long x; long long mp[1 << 20]; vector<long long> vec; long long trans[1 << 20][10]; long long dp[1005][12005]; int main(void) { ios::sync_with_stdio(0); cin.tie(0); cin >> s; long long n = s.size(); s = # + s; cin >> ...
#include <bits/stdc++.h> using namespace std; int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(0); std::cout.tie(0); int t; cin >> t; while (t--) { int n; cin >> n; vector<int> a(n), b(2 * n); multiset<int> m; for (size_t i = 0; i < 2 * n; ++i) m...
#include <bits/stdc++.h> using namespace std; const double pi = acos(-1.0); void solve() { long long n; cin >> n; n = 2 * n; long double dist, ang; ang = (360 * 1.0) / (n * 1.0); ang = ang / 2.0; long double rad = ang / 180.0; rad = rad * pi; dist = tan(rad); dist = 1.0 / d...
#include <bits/stdc++.h> using namespace std; long long arr[100005], ans[2]; int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) { scanf( %lld , arr + i); } for (int sum = 1; sum <= m << 1; sum++) { vector<int> vec = {0}; for (int i = 0; i < n; i++) { ...
#include <bits/stdc++.h> using namespace std; const int BLOCK = 250; const int N = 200100; const int NB = BLOCK * N; long long ans = 0ll; int sm[NB + N], pf[N], n, pr[N]; string s; int calc(int len, int kol) { return len / kol; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >...
#include <bits/stdc++.h> int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) printf( %d , i); printf( %d , n + m + 1); for (int i = n + m; i > n; i--) printf( %d , i); }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; if (n % 2) { cout << YES << endl; for (int i = 1; i <= n; i++) { if (i % 2) cout << 2 * i - 1 << ; else cout << 2 * i << ; } for (int i = 1; i <= n; i++) { ...
#include <bits/stdc++.h> inline long long read() { long long x = 0, f = 1; char c = getchar(); for (; c > 9 \|\| c < 0 ; c = getchar()) { if (c == - ) f = -1; } for (; c >= 0 && c <= 9 ; c = getchar()) { x = x * 10 + c - 0 ; } return x * f; } int dp[200005]; int a[8...
#include <bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 10, INF = 1e9; struct event { int pos, start, end, val, t, i; event(int a, int b, int c, int d, int e, int f) : pos(a), start(b), end(c), val(d), t(e), i(f){}; }; bool comp(event a, event b) { if (a.pos != b.pos) re...
#include <bits/stdc++.h> //--------------------------------------------------- #define l_int long long int #define double long double #define inf INT64_MAX #define mod 100000 #define fo(i,a,b) for(l_...
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int i = 0; for (i = 0; i < s.length(); i++) { if (s[i] == 0 ) break; } if (i < s.length() - 1) s = s.substr(0, i) + s.substr(i + 1); else s = s.substr(0, s.length() - 1); cout << s << en...
#include <bits/stdc++.h> using namespace std; const double eps = 1e-6; int n, ans; double a[2000]; struct Line { double x, y, vx, vy; void read() { double t1, t2; scanf( %lf%lf%lf%lf%lf%lf , &t1, &x, &y, &t2, &vx, &vy); vx -= x; vy -= y; vx /= t2 - t1; vy /= t2 - t1...
#include <bits/stdc++.h> using namespace std; int main() { int k, n, w; cin >> k >> n >> w; int s = 0; for (int i = 1; i <= w; i++) { s += i * k; } if (n < s) cout << s - n; else cout << 0; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; string s; cin >> s; int cnt = 0; for (int i = 0; i < n; i += 2) { if (s[i] == s[i + 1]) { cnt++; if (s[i] == a ) s[i] = b ; else s[i] = a ; } } cout ...
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) #pragma GCC target( sse2 ) #pragma GCC target( avx2 ) using namespace std; inline void opting() { ios_base::sync_with_stdio(false); cout.tie(0); cin.tie(0); } int inp() { int x; cin >> x; return x; } void make_unique(vector<in...
#include <bits/stdc++.h> using namespace std; namespace red { inline long long read() { long long x = 0; char f = 0, ch; for (ch = getchar(); (ch < 0 \|\| ch > 9 ) && ch != - ; ch = getchar()) ; if (ch == - ) f = 1, ch = getchar(); while (ch >= 0 && ch <= 9 ) { x = (x << 1) +...
#include <bits/stdc++.h> using namespace std; char c[10][10]; int ans; int main() { cin >> c[1] >> c[2] >> c[3] >> c[4] >> c[5] >> c[6] >> c[7] >> c[8]; for (int i = 1; i <= 8; i++) { int p = 0; for (int j = 0; j < 8; j++) if (c[i][j] == B ) p++; if (p == 8) ans++; p = 0...
#include <bits/stdc++.h> using namespace std; const int INF = 2147483647; const double PI = 3.141592653589793; int n, k, l, a[105], used[105], suma, i, j, q, b; double maxx, minn; vector<int> wek; int main() { scanf( %d %d , &n, &k); l = n / k; for (i = 0; i < n; i++) { scanf( %d , &a[i]...
#include <bits/stdc++.h> using namespace std; const unsigned long long hash1 = 201326611; const double eps = 1e-8; const long long INF = 0x3f3f3f3f3f3f3f3f; const int inf = 0x3f3f3f3f; const long long mod = 1e9 + 7; const int N = 1e5 + 10; const int M = 12; const int dif = 26; const double PI = acos...
#include <bits/stdc++.h> using namespace std; map<int, int> card; void init() { for (int i = 6, j = 1; i < 15; i++, j++) card.insert(make_pair(i, j)); } int isCard(char num) { int res = 0; if (num >= 0 && num <= 9 ) res = num - 0 ; else { if (num == T ) res = 10; ...
#include <bits/stdc++.h> using namespace std; void solve() { int n, k; cin >> n >> k; vector<int> table(n), d = {119, 18, 93, 91, 58, 107, 111, 82, 127, 123}; for (int i = 0; i < n; ++i) { string tmp; cin >> tmp; reverse(tmp.begin(), tmp.end()); for (int j = 0; j < 7; ++j) { ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; int N = 1000001; vector<int> count(N); long long n; cin >> n; vector<long long> a(n), ans; long long sum = 0, i, j, k; for (i = 0; i < n; i++) cin >> a[i], ...
#include <bits/stdc++.h> using namespace std; using ll = long long; const ll M = 1000000007; const ll M1 = 998244353; using vl = vector<ll>; using pll = pair<ll, ll>; ll power(ll x, ll y) { if (y == 0) return 1; ll res = power(x, y / 2); res = (res * res); if (y & 1) res = (res * x); r...
#include <bits/stdc++.h> using namespace std; char s[50], c[50]; int t1 = 0, t2 = 0; int main() { cin >> s >> c; for (int i = 0; i < strlen(s); i += 2) { if ((s[i] == 8 && c[i] == [ ) \|\| (s[i] == [ && c[i] == ( ) \|\| (s[i] == ( && c[i] == 8 )) t1++; else if (s[i] !=...
#include <bits/stdc++.h> using namespace std; long long c[110][110]; long long a[110]; long long tmp[110]; long long dp[10][110]; long long gao(long long n) { memset(dp, 0, sizeof(dp)); long long i, j, k; long long m = 0; for (i = 0; i <= 9; i++) m += a[i]; if (m > n) return 0; for (...
#include <bits/stdc++.h> using namespace std; long long f[16][16][1 << 17]; int b[16]; long long dp(int x, int Mx, int sum, bool flag) { if (x == 0) { return (sum >> Mx) & 1; } if (!flag && f[x][Mx][sum] != -1) return f[x][Mx][sum]; int lm = flag ? b[x] : 15; long long ans = 0; for...
#include <bits/stdc++.h> using namespace std; int main() { long long int n; long double f; int i; cin >> n; long long int m = n; for (i = 1; n / pow(10, i) >= 1; ++i) ; i--; f = n / pow(10, i); if (ceil(f) == f) f++; f = ceil(f); n = f * pow(10, i); cout << n - ...
#include <bits/stdc++.h> using namespace std; long long A[100001], B[100001]; bool valid[100001]; int main() { ios::sync_with_stdio(0); int n; cin >> n; for (int i = 0; i < n; ++i) cin >> A[i]; for (int i = 0; i < n; ++i) cin >> B[i]; long long ac = 0, bc = 0; long long mini = (1LL <...
#include <bits/stdc++.h> const long long mod = 998244353; const int kN = 5e3 + 10; int n, a[kN], lim[kN]; long long f[kN], fac[kN], invfac[kN]; inline int read() { int f = 1, w = 0; char ch = getchar(); for (; !isdigit(ch); ch = getchar()) if (ch == - ) f = -1; for (; isdigit(ch); ch = ...
#include <bits/stdc++.h> using namespace std; const int N = 109; int n, suma, K, sumb, f[10086][N], ans = 0; struct node { int a, b; } c[N]; bool cmp(const node& a, const node& b) { return a.b > b.b; } int main() { scanf( %d , &n); for (register int i = 1; i <= n; i++) scanf( %d , &c[i].a), su...
#include <bits/stdc++.h> using namespace std; int n; pair<long long, long long> a[100005]; long long pymax[100005], pymin[100005]; long long symax[100005], symin[100005]; bool trial(long long x) { for (int i = 0; i < n; i++) { symax[i] = pymax[i] = a[i].second - x; symin[i] = pymin[i] = a[i]...
#include <bits/stdc++.h> using namespace std; int main() { int n, a[1007]; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; int ans, min = 10000007, sum = 0; for (int i = 1; i <= 100; i++) { sum = 0; for (int j = 0; j < n; j++) { if (a[j] > i + 1) sum += a[j] - i ...
#include <bits/stdc++.h> using namespace std; string s; const int maxN = 1000010; int len; int ra[maxN], tra[maxN], sa[maxN], tmpsa[maxN], cnt[maxN]; void countSort(int k) { int maxr = max(300, len); memset(cnt, 0, sizeof(cnt[0]) * (maxr + 5)); for (int i = 0; i < len; i++) cnt[sa[i] + k < len ?...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; cout << n << endl; for (int i = 1; i <= n; ++i) cout << 1 ; }
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 20; int a[105]; int u[105], res[105]; int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 0; i < m; i++) { scanf( %d , &a[i]); } int pos = a[0], ans = 1; while (ans < m) { if (a[ans] > pos) { ...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; long long a[10], n, rem[10], par[10], res = N, rem_factors[10], factors[10]; inline bool is_prime(long long u) { if (u == 1) return false; if (u == 2) return true; if (u % 2 == 0) return false; for (long long i = 3; i * i <= u;...
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; const long long inf = 1e12; int n, h[N], w[N], u, v; long long ans, f[N][2]; vector<int> g[N]; void dfs(int u, int fa) { vector<long long> vec; long long sum = 0; for (auto v : g[u]) { if (v ^ fa) { dfs(v, u); ...
#include <bits/stdc++.h> using namespace std; const int maxn = 4e5 + 5; int head[maxn], e[maxn << 1], nxt[maxn << 1], cnt = 1; void addedge(int u, int v) { e[++cnt] = v, nxt[cnt] = head[u], head[u] = cnt; e[++cnt] = u, nxt[cnt] = head[v], head[v] = cnt; } int s[maxn], t[maxn]; int f[maxn], num; ...
#include <bits/stdc++.h> using namespace std; long long T[1001][1001]; int main() { long long n; cin >> n; long long a[n]; for (long long i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < 1001; i++) { for (int j = 0; j <= i; j++) { if (j == 0 \|\| i == j) T[i][j] = 1; ...
#include <bits/stdc++.h> using namespace std; const int MAX_N = 1e6 + 5; const double delta = 1e-6; const long long mod = 1e9 + 7; struct ev { double coord; int type; int mincost; }; const bool operator<(const ev &f, const ev &s) { return f.coord < s.coord; } int n, m; const int magic_cons...
#include <bits/stdc++.h> using namespace std; const long long N = 2e5 + 10; long long n; long long pre[N]; long long cal(long long x) { if (x == n * (n - 1) + 1) return 1; long long p = lower_bound(pre + 1, pre + n + 1, x) - pre; long long b = x - pre[p - 1]; if (b & 1) return p; els...
#include <bits/stdc++.h> using namespace std; const int siz = 1e5 + 7; const int siz2 = 2e5 + 7; int t, n; int a[222]; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> t; A: while (t--) { cin >> n; map<int, int> mp; vector<int> Ans; for ...
#include <bits/stdc++.h> using namespace std; const int N = 20 * 1000 + 200; const int INF = 1000 * 1000 * 1000; int d[N]; int n, m; inline void read() { scanf( %d %d , &n, &m); } inline void solve() { for (int i = 0; i < N; i++) d[i] = INF; queue<int> q; q.push(n); d[n] = 0; while (!q...
#include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 7; int N, M; int dist[200000]; int interval[200000]; int cnt[200000]; int main(void) { cin >> N; for (int i = 0; i < (int)(N); ++i) scanf( %d , dist + i); for (int i = 0; i < (int)(N - 1); ++i) interval[i] = dist[i + 1] - dist...
#include <bits/stdc++.h> using namespace std; int G[100010]; int A[1000]; int g(int q) { int n = 2, m, i, g, t, nn; memset(A, 0, sizeof(A)); n = 2; nn = -1; while (q >= n * (n + 1) / 2) { m = q - n * (n + 1) / 2; if (m % n != 0) { n++; continue; } m /=...
#include <bits/stdc++.h> using namespace std; const int N = 2e6 + 15; int cc[N]; long long sum[N]; long long getSeg(int pos, int p, int x, int y) { int last = pos + p - 1; int t = x / y; int ed = max(pos, last - t); long long ret = (long long)(cc[ed] - cc[pos]) * x; long long tot = (long l...
#include <bits/stdc++.h> using namespace std; string f[300], t[300], e[300]; char s[20]; int n; bool cmp(string& a, string b) { if (a == ) return 1; return a.size() == b.size() ? a > b : a.size() > b.size(); } int main() { f[240] = x ; f[204] = y ; f[170] = z ; while (1) { ...
#include <bits/stdc++.h> using namespace std; template <class T> void Max(T &a, T b) { if (b > a) a = b; } template <class T> void Min(T &a, T b) { if (b < a) a = b; } template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; } int main() { ios::sync_with_stdio(false); ...
#include<bits/stdc++.h> #define __fastIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL) #define MOD 1000000007 using namespace std; typedef long long int ll; int tc; void solve() { int n,w,x; multiset<int>st; vector<int>r; cin>>n>>w; for(int i...
#include <bits/stdc++.h> using namespace std; int x[10], p[50], dp[200][200]; int pp[50], q[50]; int n, k; int maxi; double suma; int nm = 0; void check(int a, int b, int c, int d) { nm++; for (int i = 1; i <= n; i++) p[i] = x[i]; int br = q[a]; for (int j = pp[a]; j <= ((q[a] + pp[a]) >...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:512000000 ) using namespace std; void solve(bool); void precalc(); clock_t start; int main() { start = clock(); int t = 1; cout.sync_with_stdio(0); cin.tie(0); precalc(); cout.precision(10); cout << fixed; int testNum =...
#include <bits/stdc++.h> using namespace std; int arr[102][102] = {0}; int main() { int n, m, a, b, sum = -1, minsum = -1; scanf( %d%d , &n, &m); int cost[n + 1]; for (int i = 1; i <= n; i++) { scanf( %d , &cost[i]); } for (int i = 1; i <= m; i++) { scanf( %d%d , &a, &b); ...
#include <bits/stdc++.h> using namespace std; const long long maxn = (int)1e6; long long n, m, a; int main() { cin >> a; if (a == 1) { cout << 1 1 n 1 ; return 0; } cout << (a - 1) * 2 << << 2 << n ; cout << 1 2 ; }
#include <bits/stdc++.h> using namespace std; struct node { bool bracket, flag; vector<int> op; }; map<string, node> def; map<char, int> op; void del_space(string tmp) { int x = tmp.find_first_not_of( ); tmp.erase(0, x); x = tmp.find_last_not_of( ); tmp.erase(x + 1, tmp.length())...
#include <bits/stdc++.h> using namespace std; int main() { int a, b; cin >> a >> b; cout << a * b / 2 << endl; }
#include <bits/stdc++.h> using namespace std; int MOD = 1000000007; int dp[1001][1001]; int main() { int k; cin >> k; int balls[1000]; int n = 0; for (int i = 0; i < k; i++) { cin >> balls[i]; n += balls[i]; } long long l = 1; for (int i = 0; i <= n; i++) { dp[i...
#include <bits/stdc++.h> using namespace std; const int maxn = 3e5 + 5; const int inf = 0x3f3f3f3f; const int mod = 1e9 + 7; int T, n, m; string s; int vis[26]; int pos[maxn][26]; int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> T; while (T--) { memset(vis, 0, sizeof(...
#include <bits/stdc++.h> using namespace std; class BIT { vector<int> tree; public: BIT(int n) : tree(n + 1, 0) {} BIT(const vector<int>& Arg) { tree.resize(Arg.size()); for (int i = 0; i < tree.size(); i++) increase(i, Arg[i]); } void increase(int i, int delta) { for (; ...
#include <bits/stdc++.h> using namespace std; int main() { int n = 0, cc = 0, cn = 0, ic = 0, in1 = 0; int pr; cin >> n; for (int i = 1; i <= n; i++) { cin >> pr; if (pr % 2 == 1) { cn++; in1 = i; } else { cc++; ic = i; } } int answer =...
#include <bits/stdc++.h> using namespace std; const int maxn = 2e3 + 10, oo = maxn; int n, m; char s[maxn], t[maxn]; int a[maxn]; int dp[maxn][maxn]; void myMax(int &a, int b) { if (a < b) { a = b; } } int main() { int i, j, k, x, y; scanf( %s , s + 1); n = strlen(s + 1); ...
#include <bits/stdc++.h> using namespace std; long long i, j, k, n, t, s, p[100009], d[100009], a[100009]; int main() { cin >> n; for (i = 1; i <= n; i++) cin >> p[i]; for (i = 1; i <= n; i++) if (!d[i]) { k = 0; j = i; while (d[j] == 0) { d[j] = 1; j ...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int score = 0; string str; cin >> str; for (int j = 0; j < str.size(); ++j) { if (str[j] == A ) score += 1; if (str[j] == D ) { score -= 1; } } if (score > 0) cout << Anton ; ...
#include <bits/stdc++.h> using namespace std; const int INF = 1000 * 1000 * 1000; const long long INF64 = 1LL * INF * INF; const long long mod = INF + 7; int m[10][10]; bool check(int k, int x, int y, int w, int h) { int ans = 0; for (int i = x; i <= h; ++i) { for (int j = y; j <= w; ++j) { ...
#include <bits/stdc++.h> using namespace std; int main() { long n = 0, m = 0; cin >> n; vector<int> hit(n, -1); map<int, pair<int, int> > circle; for (int i = 0; i < n; i++) { int c, r; cin >> c >> r; circle.insert(make_pair(c, make_pair(r, i))); } int hits = 0; cin...
#include <bits/stdc++.h> using namespace std; const int mod = int(1e9) + 7; const int maxn = 200010; int n; long long a[maxn]; long long fact[maxn]; long long ans; void read() { scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %I64d , &a[i]); } long long exp(long long x) { long long ...
#include <bits/stdc++.h> using namespace std; int it[1000100 * 5], a[1000100]; char s[1000100]; void incIT(int node, int l, int r, int pos, int k) { if (pos < l \|\| pos > r) return; if (l == r) { it[node] += k; return; } incIT(node * 2, l, (l + r) / 2, pos, k); incIT(node * 2 + 1,...
#include <bits/stdc++.h> using namespace std; char a[1000005]; char b[1000005]; int main(void) { int n; cin >> n >> (a + 1) >> (b + 1); int ok = 0; for (int i = 1; i <= n; ++i) ok += a[i] != b[i]; if (!ok) return cout << 26 n , 0; if (ok == 1) return cout << 2 n , 0; string k = ,...
#include <bits/stdc++.h> using namespace std; int main() { char s[111111]; scanf( %s , s); int len = strlen(s); int i; if (len == 1 && s[0] == a ) { puts( z ); return 0; } i = 0; while (s[i] == a ) { i++; } if (i == len) { s[len - 1] = z ; } ...
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; inline int add(int x, int y) { x += y; if (x >= mod) x -= mod; return x; } inline int sub(int x, int y) { x -= y; if (x < 0) x += mod; return x; } inline int mul(int x, int y) { return (x * 1ll * y) % mod; } i...
#include <bits/stdc++.h> using namespace std; const int MX = 1005; struct Edge { int v, nxt; } edge[MX * MX]; int head[MX], tot, c[MX], E[MX], V[MX], vis[MX]; void add(int u, int v) { edge[tot].v = v; edge[tot].nxt = head[u]; head[u] = tot++; } void dfs(int u, int &e, int &v) { for (...
#include <bits/stdc++.h> using namespace std; int n; bool check(int num) { if (1 == num) return true; for (int i = 2; i <= num / i; i++) { if (num % i == 0) { return false; } } return true; } int main() { cin >> n; if (check(n)) { printf( 1 n ); printf( ...
#include <bits/stdc++.h> using namespace std; const int N = 100007; int n, k, a[N]; bool solve() { bool exists = false; for (int i = 0; i < n; ++i) { cin >> a[i]; if (a[i] == k) { exists = true; } } if (!exists) { return false; } if (n == 1) return true; ...
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1); void fft(vector<complex<double> >& a, bool invert) { int n = (int)a.size(); for (int i = 1, j = 0; i < n; ++i) { int bit = n >> 1; for (; j >= bit; bit >>= 1) j -= bit; j += bit; if (i < j) swap(a[i], a[j]); ...
#include <bits/stdc++.h> using namespace std; string proc(int a, int b) { if (a * 2 > b) return noob ; if (a * 5 > b) return random ; if (a * 10 > b) return average ; if (a * 100 > b) return hardcore ; return pro ; } int main() { int i, n, x; string s; map<string, int> score...
#include <bits/stdc++.h> using namespace std; int main() { string s1, s2; getline(cin, s1); getline(cin, s2); int yek1 = 0, yek2 = 0; for (int i = 0; i < s1.size(); i++) { if (s1[i] == 1 ) yek1++; } for (int i = 0; i < s2.size(); i++) { if (s2[i] == 1 ) yek2++; } if...
#include <bits/stdc++.h> using namespace std; template <class T> T min(T a, T b, T c) { return min(a, min(b, c)); } template <class T> T min(T a, T b, T c, T d) { return min(a, min(b, min(c, d))); } template <class T> T max(T a, T b, T c) { return max(a, max(b, c)); } template <class T...
#include <bits/stdc++.h> using namespace std; int n, m, s = 0; int t[501][501]; int a = -1, b = -1, c = -1, d; int g = -1; int main() { ios_base::sync_with_stdio(false); cin >> n >> m; for (int i = 0; i < n - 1; i++) { for (int j = 0; j < m; j++) { cin >> t[i][j]; if (j == ...
#include <bits/stdc++.h> using namespace std; template <class T> inline void umax(T &a, T b) { if (a < b) a = b; } const int maxn = 4000 + 5; const int INF = 1e9 + 7; const double eps = 1e-8; string a[10]; int dp[4][105]; int n, k; int valid(int x, int y) { if (x >= 0 && x < n && y >= 0 &&...
#include <bits/stdc++.h> using namespace std; namespace std { template <typename T, typename U> struct hash<pair<T, U>> { hash<T> t; hash<U> u; size_t operator()(const pair<T, U>& p) const { return t(p.first) ^ (u(p.second) << 7); } }; } // namespace std template <typename T, typena...
#include <bits/stdc++.h> using namespace std; const int MAXN = 5000 + 10; bitset<MAXN> kna; vector<int> G[MAXN]; int n, a, b, c, d, p[MAXN], sze[MAXN]; bool vis[MAXN]; bool check(int a, int b) { memset(vis, 0, sizeof(vis)); kna.reset(); kna.flip(0); for (int u = a; p[u]; u = p[u]) vis[u] =...
#include <bits/stdc++.h> using namespace std; int main() { long long int k, i, cn = 0, cnt = 0, j; cin >> k; string s; cin >> s; map<long long int, long long int> ans; long long int a[s.length()], n = s.length(); for (i = 0; i < s.length(); i++) { if (s[i] == 1 ) cnt++; } ...
#include <bits/stdc++.h> using namespace std; int main() { long long n, k, p, a; cin >> n >> k >> p; if (n % 2 && k) { n--; k--; } if (2 * k > n) { long long t = 2 * k - n; n -= t; k -= t; } while (p--) { cin >> a; if ((a > n) \|\| ((a % 2 == 0) &&...
#include <bits/stdc++.h> using namespace std; int main() { int n, i, nu, ul, ka, c1ul, c1ka, c2ul, c2ka; cin >> n; c1ul = c1ka = c2ul = c2ka = 0; for (i = 0; i < n; i++) { cin >> nu >> ul >> ka; if (nu == 1) { c1ul += ul; c1ka += ka; } else { c2ul += ul; ...
#include <bits/stdc++.h> using namespace std; int main() { int shr[10], mor[10], shrc[10], morc[10], n, i; cin >> n; for (i = 0; i < 10; i++) { shr[i] = 0; mor[i] = 0; shrc[i] = 0; morc[i] = 0; } char sher[n + 1], mr[n + 1]; cin >> sher >> mr; for (i = 0; i < n; i...
#include <bits/stdc++.h> using namespace std; char a; int n, sum, flag = 1; int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> a; if (a != 0 ) sum++, flag = 1; else if (flag == 1 && a == 0 ) { cout << sum; sum = 0; flag = 0; } else if (a...
#include <bits/stdc++.h> using namespace std; struct node { int a[4], index; node() { memset(a, 0, sizeof(a)); } } no1[100005]; int n; int ans = 0, flag = 1, indexa, indexb; vector<pair<int, int> > ve; map<pair<int, int>, int> mp; int l = 0; set<pair<int, int> > se[1000000]; void update(int ...
#include <bits/stdc++.h> #pragma GCC optimize( O2 ) using namespace std; const int N = 1e6 + 10; const long long mod = 1e9 + 7; const long long mod2 = 998244353; const long long inf = 8e18; const int LOG = 22; long long pw(long long a, long long b, long long M) { return (!b ? 1 : (b &...
#include <bits/stdc++.h> using namespace std; vector<int> edge[100005]; int visited[100005][2]; vector<int> ans; int draw = 1; int visit(int verId, int isPetyaTurn) { visited[verId][isPetyaTurn] = 1; if (edge[verId].size() == 0) { draw = 0; if (isPetyaTurn == 0) { ans.push_back(v...
#include <bits/stdc++.h> using namespace std; const int inf = 2000000000; static inline int Rint() { struct X { int dig[256]; X() { for (int i = 0 ; i <= 9 ; ++i) dig[i] = 1; dig[ - ] = 1; } }; static X fuck; int s = 1, v = 0, c; for (; !fuck.dig[c = getchar...

#include <bits/stdc++.h> template <class T> inline void read(T &x) { x = 0; int f = 0; char ch = getchar(); while (!isdigit(ch)) { f |= ch == - ; ch = getchar(); } while (isdigit(ch)) { x = (x << 1) + (x << 3) + (ch ^ 48); ch = getchar(); } x = f ? -x : x; ...

#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7, INF = 1e9; const int mx = 1e5 + 5; int main() { ios::sync_with_stdio(0); cin.tie(0); int n, s, k; cin >> n >> s; if (2 * n > s) cout << NO << endl; else { cout << YES << endl; for (int i = 1; i <...

#include <bits/stdc++.h> int days[200][12]; int v[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; void swap(int &a, int &b) { int t = a; a = b; b = t; } struct year { int y; int m; int d; bool operator>(year &next) { if (this->y > next.y) return true; el...

#include <bits/stdc++.h> using namespace std; int n, arr[100005], diff[100005], prv[100005]; bool flag[100005]; vector<int> a, d; int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %d , arr + i); flag[arr[i]] = 1; } for (int i = 1; i <= n; ++i) { if (!flag[ar...

#include <bits/stdc++.h> using namespace std; long long t, n, m; long long pre[405][405], a[405][405], sum[405]; long long get(long long a, long long b, long long c) { return pre[b][c] - pre[a - 1][c]; } signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin...

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

#include <bits/stdc++.h> using namespace std; int a[100002], b[100000]; int main() { int n; cin >> n; set<pair<int, int> > c; c.clear(); for (int i = 1; i <= n; i++) { int x, y; cin >> x >> y; pair<int, int> a = make_pair(x, y); c.insert(a); } n = 0; set<pai...

#include <bits/stdc++.h> using namespace std; double x[1010], y[1010]; bool vis[1010]; int main() { int n, cnt = 0; double x0, y0; scanf( %d%lf%lf , &n, &x0, &y0); for (int i = 0; i < n; i++) { scanf( %lf%lf , &x[i], &y[i]); } for (int i = 0; i < n; i++) { double x1 = x[i], y...

#include <bits/stdc++.h> using namespace std; int main() { int arr[2], x; cin >> arr[0] >> arr[1] >> x; vector<int> v; int curr = 1; if (x % 2 == 1) { v.push_back(curr); arr[curr]--; curr ^= 1; for (int i = 0; i < x; i++) { v.push_back(curr); arr[curr]--; ...

#include <bits/stdc++.h> using namespace std; #define ll long long #define ld long double #define pii pair <ll, ll> #define mp make_pair // const int inf = 1e9 + 111; const int NMAX = 200111; const int inf = 1e9 + 7; const ld eps = 0.00000000001; const ll mod = 1e9 + 7; constexpr int64...

#include <bits/stdc++.h> using namespace std; char s[100050]; bool vis; int main() { scanf( %s , s + 1); int len = strlen(s + 1); if (len <= 2) { printf( No n ); return 0; } for (int i = 1; i <= len - 2; i++) { if (s[i] != s[i + 1] && s[i + 1] != s[i + 2] && s[i] != s[i + 2...

#include <bits/stdc++.h> using namespace std; string s; long long x; long long mp[1 << 20]; vector<long long> vec; long long trans[1 << 20][10]; long long dp[1005][12005]; int main(void) { ios::sync_with_stdio(0); cin.tie(0); cin >> s; long long n = s.size(); s = # + s; cin >> ...

#include <bits/stdc++.h> using namespace std; int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(0); std::cout.tie(0); int t; cin >> t; while (t--) { int n; cin >> n; vector<int> a(n), b(2 * n); multiset<int> m; for (size_t i = 0; i < 2 * n; ++i) m...

#include <bits/stdc++.h> using namespace std; const double pi = acos(-1.0); void solve() { long long n; cin >> n; n = 2 * n; long double dist, ang; ang = (360 * 1.0) / (n * 1.0); ang = ang / 2.0; long double rad = ang / 180.0; rad = rad * pi; dist = tan(rad); dist = 1.0 / d...

#include <bits/stdc++.h> using namespace std; long long arr[100005], ans[2]; int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) { scanf( %lld , arr + i); } for (int sum = 1; sum <= m << 1; sum++) { vector<int> vec = {0}; for (int i = 0; i < n; i++) { ...

#include <bits/stdc++.h> using namespace std; const int BLOCK = 250; const int N = 200100; const int NB = BLOCK * N; long long ans = 0ll; int sm[NB + N], pf[N], n, pr[N]; string s; int calc(int len, int kol) { return len / kol; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >...

#include <bits/stdc++.h> int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) printf( %d , i); printf( %d , n + m + 1); for (int i = n + m; i > n; i--) printf( %d , i); }

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

#include <bits/stdc++.h> inline long long read() { long long x = 0, f = 1; char c = getchar(); for (; c > 9 || c < 0 ; c = getchar()) { if (c == - ) f = -1; } for (; c >= 0 && c <= 9 ; c = getchar()) { x = x * 10 + c - 0 ; } return x * f; } int dp[200005]; int a[8...

#include <bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 10, INF = 1e9; struct event { int pos, start, end, val, t, i; event(int a, int b, int c, int d, int e, int f) : pos(a), start(b), end(c), val(d), t(e), i(f){}; }; bool comp(event a, event b) { if (a.pos != b.pos) re...

#include <bits/stdc++.h> //--------------------------------------------------- #define l_int long long int #define double long double #define inf INT64_MAX #define mod 100000 #define fo(i,a,b) for(l_...

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

#include <bits/stdc++.h> using namespace std; const double eps = 1e-6; int n, ans; double a[2000]; struct Line { double x, y, vx, vy; void read() { double t1, t2; scanf( %lf%lf%lf%lf%lf%lf , &t1, &x, &y, &t2, &vx, &vy); vx -= x; vy -= y; vx /= t2 - t1; vy /= t2 - t1...

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

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

#include <bits/stdc++.h> #pragma GCC optimize( O3 ) #pragma GCC target( sse2 ) #pragma GCC target( avx2 ) using namespace std; inline void opting() { ios_base::sync_with_stdio(false); cout.tie(0); cin.tie(0); } int inp() { int x; cin >> x; return x; } void make_unique(vector<in...

#include <bits/stdc++.h> using namespace std; namespace red { inline long long read() { long long x = 0; char f = 0, ch; for (ch = getchar(); (ch < 0 || ch > 9 ) && ch != - ; ch = getchar()) ; if (ch == - ) f = 1, ch = getchar(); while (ch >= 0 && ch <= 9 ) { x = (x << 1) +...

#include <bits/stdc++.h> using namespace std; char c[10][10]; int ans; int main() { cin >> c[1] >> c[2] >> c[3] >> c[4] >> c[5] >> c[6] >> c[7] >> c[8]; for (int i = 1; i <= 8; i++) { int p = 0; for (int j = 0; j < 8; j++) if (c[i][j] == B ) p++; if (p == 8) ans++; p = 0...

#include <bits/stdc++.h> using namespace std; const int INF = 2147483647; const double PI = 3.141592653589793; int n, k, l, a[105], used[105], suma, i, j, q, b; double maxx, minn; vector<int> wek; int main() { scanf( %d %d , &n, &k); l = n / k; for (i = 0; i < n; i++) { scanf( %d , &a[i]...

#include <bits/stdc++.h> using namespace std; const unsigned long long hash1 = 201326611; const double eps = 1e-8; const long long INF = 0x3f3f3f3f3f3f3f3f; const int inf = 0x3f3f3f3f; const long long mod = 1e9 + 7; const int N = 1e5 + 10; const int M = 12; const int dif = 26; const double PI = acos...

#include <bits/stdc++.h> using namespace std; map<int, int> card; void init() { for (int i = 6, j = 1; i < 15; i++, j++) card.insert(make_pair(i, j)); } int isCard(char num) { int res = 0; if (num >= 0 && num <= 9 ) res = num - 0 ; else { if (num == T ) res = 10; ...

#include <bits/stdc++.h> using namespace std; void solve() { int n, k; cin >> n >> k; vector<int> table(n), d = {119, 18, 93, 91, 58, 107, 111, 82, 127, 123}; for (int i = 0; i < n; ++i) { string tmp; cin >> tmp; reverse(tmp.begin(), tmp.end()); for (int j = 0; j < 7; ++j) { ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; int N = 1000001; vector<int> count(N); long long n; cin >> n; vector<long long> a(n), ans; long long sum = 0, i, j, k; for (i = 0; i < n; i++) cin >> a[i], ...

#include <bits/stdc++.h> using namespace std; using ll = long long; const ll M = 1000000007; const ll M1 = 998244353; using vl = vector<ll>; using pll = pair<ll, ll>; ll power(ll x, ll y) { if (y == 0) return 1; ll res = power(x, y / 2); res = (res * res); if (y & 1) res = (res * x); r...

#include <bits/stdc++.h> using namespace std; char s[50], c[50]; int t1 = 0, t2 = 0; int main() { cin >> s >> c; for (int i = 0; i < strlen(s); i += 2) { if ((s[i] == 8 && c[i] == [ ) || (s[i] == [ && c[i] == ( ) || (s[i] == ( && c[i] == 8 )) t1++; else if (s[i] !=...

#include <bits/stdc++.h> using namespace std; long long c[110][110]; long long a[110]; long long tmp[110]; long long dp[10][110]; long long gao(long long n) { memset(dp, 0, sizeof(dp)); long long i, j, k; long long m = 0; for (i = 0; i <= 9; i++) m += a[i]; if (m > n) return 0; for (...

#include <bits/stdc++.h> using namespace std; long long f[16][16][1 << 17]; int b[16]; long long dp(int x, int Mx, int sum, bool flag) { if (x == 0) { return (sum >> Mx) & 1; } if (!flag && f[x][Mx][sum] != -1) return f[x][Mx][sum]; int lm = flag ? b[x] : 15; long long ans = 0; for...

#include <bits/stdc++.h> using namespace std; int main() { long long int n; long double f; int i; cin >> n; long long int m = n; for (i = 1; n / pow(10, i) >= 1; ++i) ; i--; f = n / pow(10, i); if (ceil(f) == f) f++; f = ceil(f); n = f * pow(10, i); cout << n - ...

#include <bits/stdc++.h> using namespace std; long long A[100001], B[100001]; bool valid[100001]; int main() { ios::sync_with_stdio(0); int n; cin >> n; for (int i = 0; i < n; ++i) cin >> A[i]; for (int i = 0; i < n; ++i) cin >> B[i]; long long ac = 0, bc = 0; long long mini = (1LL <...

#include <bits/stdc++.h> const long long mod = 998244353; const int kN = 5e3 + 10; int n, a[kN], lim[kN]; long long f[kN], fac[kN], invfac[kN]; inline int read() { int f = 1, w = 0; char ch = getchar(); for (; !isdigit(ch); ch = getchar()) if (ch == - ) f = -1; for (; isdigit(ch); ch = ...

#include <bits/stdc++.h> using namespace std; const int N = 109; int n, suma, K, sumb, f[10086][N], ans = 0; struct node { int a, b; } c[N]; bool cmp(const node& a, const node& b) { return a.b > b.b; } int main() { scanf( %d , &n); for (register int i = 1; i <= n; i++) scanf( %d , &c[i].a), su...

#include <bits/stdc++.h> using namespace std; int n; pair<long long, long long> a[100005]; long long pymax[100005], pymin[100005]; long long symax[100005], symin[100005]; bool trial(long long x) { for (int i = 0; i < n; i++) { symax[i] = pymax[i] = a[i].second - x; symin[i] = pymin[i] = a[i]...

#include <bits/stdc++.h> using namespace std; int main() { int n, a[1007]; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; int ans, min = 10000007, sum = 0; for (int i = 1; i <= 100; i++) { sum = 0; for (int j = 0; j < n; j++) { if (a[j] > i + 1) sum += a[j] - i ...

#include <bits/stdc++.h> using namespace std; string s; const int maxN = 1000010; int len; int ra[maxN], tra[maxN], sa[maxN], tmpsa[maxN], cnt[maxN]; void countSort(int k) { int maxr = max(300, len); memset(cnt, 0, sizeof(cnt[0]) * (maxr + 5)); for (int i = 0; i < len; i++) cnt[sa[i] + k < len ?...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; cout << n << endl; for (int i = 1; i <= n; ++i) cout << 1 ; }

#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 20; int a[105]; int u[105], res[105]; int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 0; i < m; i++) { scanf( %d , &a[i]); } int pos = a[0], ans = 1; while (ans < m) { if (a[ans] > pos) { ...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; long long a[10], n, rem[10], par[10], res = N, rem_factors[10], factors[10]; inline bool is_prime(long long u) { if (u == 1) return false; if (u == 2) return true; if (u % 2 == 0) return false; for (long long i = 3; i * i <= u;...

#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; const long long inf = 1e12; int n, h[N], w[N], u, v; long long ans, f[N][2]; vector<int> g[N]; void dfs(int u, int fa) { vector<long long> vec; long long sum = 0; for (auto v : g[u]) { if (v ^ fa) { dfs(v, u); ...

#include <bits/stdc++.h> using namespace std; const int maxn = 4e5 + 5; int head[maxn], e[maxn << 1], nxt[maxn << 1], cnt = 1; void addedge(int u, int v) { e[++cnt] = v, nxt[cnt] = head[u], head[u] = cnt; e[++cnt] = u, nxt[cnt] = head[v], head[v] = cnt; } int s[maxn], t[maxn]; int f[maxn], num; ...

#include <bits/stdc++.h> using namespace std; long long T[1001][1001]; int main() { long long n; cin >> n; long long a[n]; for (long long i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < 1001; i++) { for (int j = 0; j <= i; j++) { if (j == 0 || i == j) T[i][j] = 1; ...

#include <bits/stdc++.h> using namespace std; const int MAX_N = 1e6 + 5; const double delta = 1e-6; const long long mod = 1e9 + 7; struct ev { double coord; int type; int mincost; }; const bool operator<(const ev &f, const ev &s) { return f.coord < s.coord; } int n, m; const int magic_cons...

#include <bits/stdc++.h> using namespace std; const long long N = 2e5 + 10; long long n; long long pre[N]; long long cal(long long x) { if (x == n * (n - 1) + 1) return 1; long long p = lower_bound(pre + 1, pre + n + 1, x) - pre; long long b = x - pre[p - 1]; if (b & 1) return p; els...

#include <bits/stdc++.h> using namespace std; const int siz = 1e5 + 7; const int siz2 = 2e5 + 7; int t, n; int a[222]; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> t; A: while (t--) { cin >> n; map<int, int> mp; vector<int> Ans; for ...

#include <bits/stdc++.h> using namespace std; const int N = 20 * 1000 + 200; const int INF = 1000 * 1000 * 1000; int d[N]; int n, m; inline void read() { scanf( %d %d , &n, &m); } inline void solve() { for (int i = 0; i < N; i++) d[i] = INF; queue<int> q; q.push(n); d[n] = 0; while (!q...

#include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 7; int N, M; int dist[200000]; int interval[200000]; int cnt[200000]; int main(void) { cin >> N; for (int i = 0; i < (int)(N); ++i) scanf( %d , dist + i); for (int i = 0; i < (int)(N - 1); ++i) interval[i] = dist[i + 1] - dist...

#include <bits/stdc++.h> using namespace std; int G[100010]; int A[1000]; int g(int q) { int n = 2, m, i, g, t, nn; memset(A, 0, sizeof(A)); n = 2; nn = -1; while (q >= n * (n + 1) / 2) { m = q - n * (n + 1) / 2; if (m % n != 0) { n++; continue; } m /=...

#include <bits/stdc++.h> using namespace std; const int N = 2e6 + 15; int cc[N]; long long sum[N]; long long getSeg(int pos, int p, int x, int y) { int last = pos + p - 1; int t = x / y; int ed = max(pos, last - t); long long ret = (long long)(cc[ed] - cc[pos]) * x; long long tot = (long l...

#include <bits/stdc++.h> using namespace std; string f[300], t[300], e[300]; char s[20]; int n; bool cmp(string& a, string b) { if (a == ) return 1; return a.size() == b.size() ? a > b : a.size() > b.size(); } int main() { f[240] = x ; f[204] = y ; f[170] = z ; while (1) { ...

#include <bits/stdc++.h> using namespace std; template <class T> void Max(T &a, T b) { if (b > a) a = b; } template <class T> void Min(T &a, T b) { if (b < a) a = b; } template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; } int main() { ios::sync_with_stdio(false); ...

#include<bits/stdc++.h> #define __fastIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL) #define MOD 1000000007 using namespace std; typedef long long int ll; int tc; void solve() { int n,w,x; multiset<int>st; vector<int>r; cin>>n>>w; for(int i...

#include <bits/stdc++.h> using namespace std; int x[10], p[50], dp[200][200]; int pp[50], q[50]; int n, k; int maxi; double suma; int nm = 0; void check(int a, int b, int c, int d) { nm++; for (int i = 1; i <= n; i++) p[i] = x[i]; int br = q[a]; for (int j = pp[a]; j <= ((q[a] + pp[a]) >...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:512000000 ) using namespace std; void solve(bool); void precalc(); clock_t start; int main() { start = clock(); int t = 1; cout.sync_with_stdio(0); cin.tie(0); precalc(); cout.precision(10); cout << fixed; int testNum =...

#include <bits/stdc++.h> using namespace std; int arr[102][102] = {0}; int main() { int n, m, a, b, sum = -1, minsum = -1; scanf( %d%d , &n, &m); int cost[n + 1]; for (int i = 1; i <= n; i++) { scanf( %d , &cost[i]); } for (int i = 1; i <= m; i++) { scanf( %d%d , &a, &b); ...

#include <bits/stdc++.h> using namespace std; const long long maxn = (int)1e6; long long n, m, a; int main() { cin >> a; if (a == 1) { cout << 1 1 n 1 ; return 0; } cout << (a - 1) * 2 << << 2 << n ; cout << 1 2 ; }

#include <bits/stdc++.h> using namespace std; struct node { bool bracket, flag; vector<int> op; }; map<string, node> def; map<char, int> op; void del_space(string tmp) { int x = tmp.find_first_not_of( ); tmp.erase(0, x); x = tmp.find_last_not_of( ); tmp.erase(x + 1, tmp.length())...

#include <bits/stdc++.h> using namespace std; int main() { int a, b; cin >> a >> b; cout << a * b / 2 << endl; }

#include <bits/stdc++.h> using namespace std; int MOD = 1000000007; int dp[1001][1001]; int main() { int k; cin >> k; int balls[1000]; int n = 0; for (int i = 0; i < k; i++) { cin >> balls[i]; n += balls[i]; } long long l = 1; for (int i = 0; i <= n; i++) { dp[i...

#include <bits/stdc++.h> using namespace std; const int maxn = 3e5 + 5; const int inf = 0x3f3f3f3f; const int mod = 1e9 + 7; int T, n, m; string s; int vis[26]; int pos[maxn][26]; int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> T; while (T--) { memset(vis, 0, sizeof(...

#include <bits/stdc++.h> using namespace std; class BIT { vector<int> tree; public: BIT(int n) : tree(n + 1, 0) {} BIT(const vector<int>& Arg) { tree.resize(Arg.size()); for (int i = 0; i < tree.size(); i++) increase(i, Arg[i]); } void increase(int i, int delta) { for (; ...

#include <bits/stdc++.h> using namespace std; int main() { int n = 0, cc = 0, cn = 0, ic = 0, in1 = 0; int pr; cin >> n; for (int i = 1; i <= n; i++) { cin >> pr; if (pr % 2 == 1) { cn++; in1 = i; } else { cc++; ic = i; } } int answer =...

#include <bits/stdc++.h> using namespace std; const int maxn = 2e3 + 10, oo = maxn; int n, m; char s[maxn], t[maxn]; int a[maxn]; int dp[maxn][maxn]; void myMax(int &a, int b) { if (a < b) { a = b; } } int main() { int i, j, k, x, y; scanf( %s , s + 1); n = strlen(s + 1); ...

#include <bits/stdc++.h> using namespace std; long long i, j, k, n, t, s, p[100009], d[100009], a[100009]; int main() { cin >> n; for (i = 1; i <= n; i++) cin >> p[i]; for (i = 1; i <= n; i++) if (!d[i]) { k = 0; j = i; while (d[j] == 0) { d[j] = 1; j ...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int score = 0; string str; cin >> str; for (int j = 0; j < str.size(); ++j) { if (str[j] == A ) score += 1; if (str[j] == D ) { score -= 1; } } if (score > 0) cout << Anton ; ...

#include <bits/stdc++.h> using namespace std; const int INF = 1000 * 1000 * 1000; const long long INF64 = 1LL * INF * INF; const long long mod = INF + 7; int m[10][10]; bool check(int k, int x, int y, int w, int h) { int ans = 0; for (int i = x; i <= h; ++i) { for (int j = y; j <= w; ++j) { ...

#include <bits/stdc++.h> using namespace std; int main() { long n = 0, m = 0; cin >> n; vector<int> hit(n, -1); map<int, pair<int, int> > circle; for (int i = 0; i < n; i++) { int c, r; cin >> c >> r; circle.insert(make_pair(c, make_pair(r, i))); } int hits = 0; cin...

#include <bits/stdc++.h> using namespace std; const int mod = int(1e9) + 7; const int maxn = 200010; int n; long long a[maxn]; long long fact[maxn]; long long ans; void read() { scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %I64d , &a[i]); } long long exp(long long x) { long long ...

#include <bits/stdc++.h> using namespace std; int it[1000100 * 5], a[1000100]; char s[1000100]; void incIT(int node, int l, int r, int pos, int k) { if (pos < l || pos > r) return; if (l == r) { it[node] += k; return; } incIT(node * 2, l, (l + r) / 2, pos, k); incIT(node * 2 + 1,...

#include <bits/stdc++.h> using namespace std; char a[1000005]; char b[1000005]; int main(void) { int n; cin >> n >> (a + 1) >> (b + 1); int ok = 0; for (int i = 1; i <= n; ++i) ok += a[i] != b[i]; if (!ok) return cout << 26 n , 0; if (ok == 1) return cout << 2 n , 0; string k = ,...

#include <bits/stdc++.h> using namespace std; int main() { char s[111111]; scanf( %s , s); int len = strlen(s); int i; if (len == 1 && s[0] == a ) { puts( z ); return 0; } i = 0; while (s[i] == a ) { i++; } if (i == len) { s[len - 1] = z ; } ...

#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; inline int add(int x, int y) { x += y; if (x >= mod) x -= mod; return x; } inline int sub(int x, int y) { x -= y; if (x < 0) x += mod; return x; } inline int mul(int x, int y) { return (x * 1ll * y) % mod; } i...

#include <bits/stdc++.h> using namespace std; const int MX = 1005; struct Edge { int v, nxt; } edge[MX * MX]; int head[MX], tot, c[MX], E[MX], V[MX], vis[MX]; void add(int u, int v) { edge[tot].v = v; edge[tot].nxt = head[u]; head[u] = tot++; } void dfs(int u, int &e, int &v) { for (...

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

#include <bits/stdc++.h> using namespace std; const int N = 100007; int n, k, a[N]; bool solve() { bool exists = false; for (int i = 0; i < n; ++i) { cin >> a[i]; if (a[i] == k) { exists = true; } } if (!exists) { return false; } if (n == 1) return true; ...

#include <bits/stdc++.h> using namespace std; const double PI = acos(-1); void fft(vector<complex<double> >& a, bool invert) { int n = (int)a.size(); for (int i = 1, j = 0; i < n; ++i) { int bit = n >> 1; for (; j >= bit; bit >>= 1) j -= bit; j += bit; if (i < j) swap(a[i], a[j]); ...

#include <bits/stdc++.h> using namespace std; string proc(int a, int b) { if (a * 2 > b) return noob ; if (a * 5 > b) return random ; if (a * 10 > b) return average ; if (a * 100 > b) return hardcore ; return pro ; } int main() { int i, n, x; string s; map<string, int> score...

#include <bits/stdc++.h> using namespace std; int main() { string s1, s2; getline(cin, s1); getline(cin, s2); int yek1 = 0, yek2 = 0; for (int i = 0; i < s1.size(); i++) { if (s1[i] == 1 ) yek1++; } for (int i = 0; i < s2.size(); i++) { if (s2[i] == 1 ) yek2++; } if...

#include <bits/stdc++.h> using namespace std; template <class T> T min(T a, T b, T c) { return min(a, min(b, c)); } template <class T> T min(T a, T b, T c, T d) { return min(a, min(b, min(c, d))); } template <class T> T max(T a, T b, T c) { return max(a, max(b, c)); } template <class T...

#include <bits/stdc++.h> using namespace std; int n, m, s = 0; int t[501][501]; int a = -1, b = -1, c = -1, d; int g = -1; int main() { ios_base::sync_with_stdio(false); cin >> n >> m; for (int i = 0; i < n - 1; i++) { for (int j = 0; j < m; j++) { cin >> t[i][j]; if (j == ...

#include <bits/stdc++.h> using namespace std; template <class T> inline void umax(T &a, T b) { if (a < b) a = b; } const int maxn = 4000 + 5; const int INF = 1e9 + 7; const double eps = 1e-8; string a[10]; int dp[4][105]; int n, k; int valid(int x, int y) { if (x >= 0 && x < n && y >= 0 &&...

#include <bits/stdc++.h> using namespace std; namespace std { template <typename T, typename U> struct hash<pair<T, U>> { hash<T> t; hash<U> u; size_t operator()(const pair<T, U>& p) const { return t(p.first) ^ (u(p.second) << 7); } }; } // namespace std template <typename T, typena...

#include <bits/stdc++.h> using namespace std; const int MAXN = 5000 + 10; bitset<MAXN> kna; vector<int> G[MAXN]; int n, a, b, c, d, p[MAXN], sze[MAXN]; bool vis[MAXN]; bool check(int a, int b) { memset(vis, 0, sizeof(vis)); kna.reset(); kna.flip(0); for (int u = a; p[u]; u = p[u]) vis[u] =...

#include <bits/stdc++.h> using namespace std; int main() { long long int k, i, cn = 0, cnt = 0, j; cin >> k; string s; cin >> s; map<long long int, long long int> ans; long long int a[s.length()], n = s.length(); for (i = 0; i < s.length(); i++) { if (s[i] == 1 ) cnt++; } ...

#include <bits/stdc++.h> using namespace std; int main() { long long n, k, p, a; cin >> n >> k >> p; if (n % 2 && k) { n--; k--; } if (2 * k > n) { long long t = 2 * k - n; n -= t; k -= t; } while (p--) { cin >> a; if ((a > n) || ((a % 2 == 0) &&...

#include <bits/stdc++.h> using namespace std; int main() { int n, i, nu, ul, ka, c1ul, c1ka, c2ul, c2ka; cin >> n; c1ul = c1ka = c2ul = c2ka = 0; for (i = 0; i < n; i++) { cin >> nu >> ul >> ka; if (nu == 1) { c1ul += ul; c1ka += ka; } else { c2ul += ul; ...

#include <bits/stdc++.h> using namespace std; int main() { int shr[10], mor[10], shrc[10], morc[10], n, i; cin >> n; for (i = 0; i < 10; i++) { shr[i] = 0; mor[i] = 0; shrc[i] = 0; morc[i] = 0; } char sher[n + 1], mr[n + 1]; cin >> sher >> mr; for (i = 0; i < n; i...

#include <bits/stdc++.h> using namespace std; char a; int n, sum, flag = 1; int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> a; if (a != 0 ) sum++, flag = 1; else if (flag == 1 && a == 0 ) { cout << sum; sum = 0; flag = 0; } else if (a...

#include <bits/stdc++.h> using namespace std; struct node { int a[4], index; node() { memset(a, 0, sizeof(a)); } } no1[100005]; int n; int ans = 0, flag = 1, indexa, indexb; vector<pair<int, int> > ve; map<pair<int, int>, int> mp; int l = 0; set<pair<int, int> > se[1000000]; void update(int ...

#include <bits/stdc++.h> #pragma GCC optimize( O2 ) using namespace std; const int N = 1e6 + 10; const long long mod = 1e9 + 7; const long long mod2 = 998244353; const long long inf = 8e18; const int LOG = 22; long long pw(long long a, long long b, long long M) { return (!b ? 1 : (b &...

#include <bits/stdc++.h> using namespace std; vector<int> edge[100005]; int visited[100005][2]; vector<int> ans; int draw = 1; int visit(int verId, int isPetyaTurn) { visited[verId][isPetyaTurn] = 1; if (edge[verId].size() == 0) { draw = 0; if (isPetyaTurn == 0) { ans.push_back(v...

#include <bits/stdc++.h> using namespace std; const int inf = 2000000000; static inline int Rint() { struct X { int dig[256]; X() { for (int i = 0 ; i <= 9 ; ++i) dig[i] = 1; dig[ - ] = 1; } }; static X fuck; int s = 1, v = 0, c; for (; !fuck.dig[c = getchar...