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 oo = 1e9; const int maxc = 77; struct thang { int X, B; }; thang A[1010]; double f[1010]; int trace[1010], st[1010]; int N, L; void nhap() { scanf( %d%d , &N, &L); for (int i = 1; i <= N; i++) scanf( %d%d , &A[i].X, &A[i].B); A[...
#include <bits/stdc++.h> using namespace std; int n, m, a[300005], op, l, r; long long fib[300005 + 100]; struct wyh { long long tagl, tagr, sum; } tree[300005 * 4]; inline long long getint() { long long x = 0, f = 1; char ch = getchar(); while (ch < 0 \|\| ch > 9 ) { if (ch == - ) f...
#include <bits/stdc++.h> using namespace std; template <class T> long long size(const T& x) { return x.size(); } #pragma GCC optimize( Ofast ) template <class T> T smod(T a, T b) { return (a % b + b) % b; } long long pw(long long a, long long b) { long long res = 1; while (b > 0) { ...
#include <bits/stdc++.h> int main() { char s[101]; int cnt[2] = {}; scanf( %s , s); for (int i = 0; s[i]; i++) cnt[s[i] == - ]++; printf( %s n , cnt[0] && cnt[1] % cnt[0] ? NO : YES ); }
#include <bits/stdc++.h> using namespace std; const int maxn = 100010; int p[maxn], w[maxn]; vector<pair<pair<int, int>, int>> a; int find(int x) { if (p[x] == x) return x; else { int ret = find(p[x]); w[x] ^= w[p[x]]; return p[x] = ret; } } int main() { int l, r, n...
#include <bits/stdc++.h> using namespace std; namespace IO { const unsigned int Buffsize = 1 << 15, Output = 1 << 23; static char Ch_[Buffsize], S_ = Ch_, T_ = Ch_; static char Out[Output], *nowps = Out; inline void flush() { fwrite(Out, 1, nowps - Out, stdout); nowps = Out; } template <class ...
#include <bits/stdc++.h> using namespace std; double dis(double ax, double ay, double bx, double by) { return sqrt(pow(ax - bx, 2) + pow(ay - by, 2)); } bool f(double a, double b, double c) { if (a == sqrt(pow(b, 2) + pow(c, 2))) return true; else return false; } int main() { cou...
#include <bits/stdc++.h> using namespace std; int main() { int w = 26; int count = 0; char a[] = { a , b , c , d , e , f , g , h , i , j , k , l , m , n , o , p , q , r , s , t , u , v , w , x , y , z }; string b; cin >> b; for (char c : b) { fo...
#include <bits/stdc++.h> using namespace std; int main() { string s, x; cin >> s; int count = 0, sz = s.size(); for (int i = 0; i < sz; ++i) if (s[i] == 1 ) ++count; for (int i = 0; i < sz; ++i) { if (s[i] == 0 ) x += 0 ; else if (s[i] == 2 ) { while (count-...
#include <bits/stdc++.h> using namespace std; const int maxn = 100009; int first[maxn], du[maxn], pre[maxn][2]; struct edg { int next, to; } e[maxn << 1]; struct node { int x, opt; }; bool vis[maxn][2], ins[maxn], ok[maxn]; queue<node> q; int n, m, s, e_sum; bool flag; inline int read() ...
#include <bits/stdc++.h> using namespace std; int main() { int n, m, l, r, x, mid; cin >> n >> m; int a[n][2]; for (int i = 0; i < n; i++) cin >> a[i][0] >> a[i][1]; int b[m]; for (int i = 0; i < m; i++) cin >> b[i]; int music[n]; for (int i = 0; i < n; i++) music[i] = 0; music[0...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast,unroll-loops,no-stack-protector,fast-math,inline ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2 ) using namespace std; using ll = long long; using vvi = vector<vector<int>>; using vi = vector<int>; using vvll = vector<vector<long...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; int n, a[N], d[N], b[21][N], a2[25], ans[N]; void dg(int x) { if (x > 20) { if (d[0] < ans[0]) for (int i = 0; i <= d[0]; i++) ans[i] = d[i]; return; } int pos = 0; for (int i = 1; i <= n; i++) pos \|= a[i] &...
#include <bits/stdc++.h> using namespace std; char s[10001000]; int n; vector<int> sep; void lindon() { for (int i = 0; i < n;) { sep.push_back(i); int p1 = i, p2 = i + 1; while (p2 < n && s[p1] <= s[p2]) { if (s[p1] == s[p2]) ++p1, ++p2; else p1 = i, ...
#include <bits/stdc++.h> using namespace std; int a[1010][1010]; int mapa[1010][1010]; int n, m; int TIME = 0; bool ok(int val) { for (int i = 0; i < n; i++) { vector<int> row; for (int j = 0; j < m; j++) { if (a[i][j] >= val) row.push_back(j); } for (int first = 0; first...
#include <bits/stdc++.h> using namespace std; using uint = unsigned; using ll = long long; using ull = unsigned long long; using vi = vector<int>; using vvi = vector<vi>; using vl = vector<ll>; using vvl = vector<vl>; using vd = vector<double>; using vvd = vector<vd>; using vs = vector<string>; ...
#include <bits/stdc++.h> using namespace std; long long mypow(long long x, int y) { long long an = 1; while (y) { if (y & 1) { an = x; an %= 1000000007; } x = x; x %= 1000000007; y >>= 1; } return an; } int d[1000001]; int f(int k, int w) { m...
#include <bits/stdc++.h> long long dx[4] = {0, -1, 0, 1}; long long dy[4] = {1, 0, -1, 0}; using namespace std; class pa3 { public: long long x, y, z; pa3(long long x = 0, long long y = 0, long long z = 0) : x(x), y(y), z(z) {} bool operator<(const pa3 &p) const { if (x != p.x) return x < p...
#include <bits/stdc++.h> using namespace std; struct node { int x, id; }; node a[1005]; bool cmp(node a, node b) { return a.x < b.x; } int main() { int n, k; int i; scanf( %d%d , &n, &k); for (i = 1; i <= n; i++) { scanf( %d , &a[i].x); a[i].id = i; } sort(a + 1, a + ...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( avx,avx2,fma ) #pragma GCC optimization( unroll-loops ) using namespace std; long long int n, k, ans = 0; long long int arr[500005]; void solve() { cin >> n >> k; map<long long int, long long int> mpp, tot, till; for (l...
#include <bits/stdc++.h> using namespace std; int main() { string a; cin >> a; if (a[0] >= a && a[0] <= z ) a[0] -= 32; cout << a; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int c = 0; int u = a ; for (int i = 0; i < s.length(); i++) { if (c >= 26) break; if (s[i] <= u) { s[i] = u; c++; u++; if (u > z ) break; } } if (c >= 26) ...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e+5; char str[2 * maxn + 5]; int main() { int cishu; cin >> cishu; while (cishu--) { int n; cin >> n; for (int a = 0; a < n - 1; a++) cin >> str[a]; str[n - 1] = 0 ; int tmp = n; for (int i = 0; i < ...
#include <bits/stdc++.h> using namespace std; mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count()); template <typename T> T ceil(T a, T b) { return (a + b - 1) / b; } template <typename T> T binpow(T a, T b) { T res = 1; while (b > 0) { if (b & 1) res = res * a; a = ...
#include <bits/stdc++.h> using namespace std; class Data { public: int l, r, num; Data() {} Data(int a, int b, int c) { l = a; r = b; num = c; } bool operator<(const Data& a) const { return l < a.r; } }; vector<Data> a; int main() { int L, b, f, n, q, k; cin >>...
#include <bits/stdc++.h> int main() { std::string str; std::getline(std::cin, str); int number = 0; for (int j = 0, i = 0; j < str.size(); ++j) { int n = 0; while (j < str.size() && isdigit(str.at(j))) n = n * 10 + str.at(j++) - 48; number = number + n * i++; if (j >= str.size(...
#include <bits/stdc++.h> using namespace std; char c; int s = 0, k = 0, n = 0, x, f = 0; ; int main() { while (cin.get(c)) { if (c == n ) break; switch (s) { case 0: { if (c >= a && c <= z \|\| c >= A && c <= Z \|\| c == _ \|\| c >= 0 && c <= 9 ) { ...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { double a, b, c, d, k; cin >> a >> b >> c >> d >> k; double pen = a / c; double pencil = b / d; pen = ceil(pen); pencil = ceil(pencil); if ((pen + pencil) <= k) { do...
#include <bits/stdc++.h> using namespace std; const int N = 1000023; long long int power(long long int a, long long int b) { long long int ans = 1; while (b) { if (b & 1) ans = (ans * a); b /= 2; a = (a * a); } return ans; } bool sortbysec(const pair<long long int, long long ...
#include <bits/stdc++.h> using namespace std; using ll = long long; using pll = pair<ll, ll>; bool cmpx(const pll& a, const pll& b) { return a.first < b.first; } bool cmpy(const pll& a, const pll& b) { return a.second < b.second; } ll sq(const ll& first) { return first * first; } ll dis(const pll& a, cons...
#include <bits/stdc++.h> using namespace std; const long long int INF = 1000000007; const int N = 1000000 + 7; long long int trans[N]; long long int ca[N]; long long int maxb[N]; int main() { std::ios::sync_with_stdio(false); cin.tie(NULL); int n; long long int d; cin >> n >> d; fo...
#include <bits/stdc++.h> const int mod = 1000000007; int dp[4][200005]; int main() { long long a, b; scanf( %I64d %I64d , &a, &b); long long t = sqrt(2 * (a + b)); while ((t * t + t > 2 * (a + b)) \|\| ((t * t + 3 * t + 2) <= 2 * (a + b))) { --t; } long long sum = t * (t + 1) / 2; ...
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } template <class T1, class T2> struct cmpf { bool rev; inline bool operator()(const pair<T1, T2>& a, const pair<T1, T2>& b) const { return (a.first < b.first) ^ rev; } cmp...
#include <bits/stdc++.h> using namespace std; char buf[100005]; int cnt[10]; int cnt2[10]; int main() { scanf( %s , buf); int N = strlen(buf); for (int i = 0; i < (N); ++i) cnt[buf[i] - 0 ]++; for (int i = 0; i < (10); ++i) cnt2[i] = cnt[i]; int best = 0, bestres = cnt[0]; for (int d ...
#include <bits/stdc++.h> using namespace std; int main() { string s[1005], ss[1005]; cin >> s[0] >> ss[0]; int n; cin >> n; for (int i = 1; i <= n; i++) cin >> s[i] >> ss[i]; for (int i = 0; i <= n; i++) { if (i == 0) { cout << s[0] << << ss[0] << endl; continue; ...
#include <bits/stdc++.h> using namespace std; int n, m, k; int a[100]; int ans; int main() { cin >> n >> m >> k; for (int i = 0; i < k; i++) { cin >> a[i]; a[i]--; } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { int x; cin >> x; x--; ...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); long long n, k; cin >> n >> k; long long ans = 0; for (int i = (int)0; i < (int)n; ++i) { long long l, r; cin >> l >> r; ans += r - l + 1; } int ted = 0; while (ans % k) { ...
#include <bits/stdc++.h> using namespace std; vector<string> val; bool check1[110]; bool check2[110]; char a[5] = { R , G , B , Y , W }; bool used1[5]; bool used2[5]; char val1[5]; int val2[5]; int ans = 1000 * 1000; void go2(int pos, int cnt, int cnt2) { if (pos == cnt) { for (int i...
#include <bits/stdc++.h> using namespace std; long long m; long long f(long long a) { long long res = 0; for (long long k = 2;; k++) { long long k3 = k * k * k; if (k3 > a) break; if (res > m - a / k3) return -1; res += a / k3; } return res; } int main() { cin >> m;...
#include <bits/stdc++.h> const int MAXN = 505; const long long MOD = 998244353; int n, sizb, sizc; long long a[MAXN], b[MAXN], c[MAXN]; bool fac[MAXN]; std::map<long long, int> mp; inline long long gcd(long long x, long long y) { if (!x \|\| !y) return x + y; while (y) { std::swap(x, y); ...
#include <bits/stdc++.h> using namespace std; int main() { int t, n, fl = 0, fl2; cin >> t; while (t--) { fl = 0, fl2 = 0; cin >> n; vector<int> v; int p = n; for (int i = 2; i * i <= n; i++) { if (p % i == 0 && fl <= 1) { v.push_back(i); p /= i;...
#include <bits/stdc++.h> long long int a[1500][1500]; using namespace std; int main() { int n, m; scanf( %i , &n); scanf( %i , &m); for (int i = 0; i < n; i++) { int x; scanf( %i , &x); a[i][0] = x; for (int j = 1; j < m; j++) { scanf( %i , &x); a[i][j] = a[...
#include <bits/stdc++.h> using namespace std; const int MX = 1e5 + 10; unordered_set<int> adj[MX]; vector<int> ans; bool vis[MX]; set<pair<int, int>> ord; void dfs(int u) { vis[u] = true; ans.push_back(u); for (int v : adj[u]) { if (!vis[v]) dfs(v); } } bool can(int k, int t, int...
#include <bits/stdc++.h> using namespace std; string str; string sbyt( 127 ), ssho( 32767 ), sint( 2147483647 ), slon( 9223372036854775807 ); int main() { while (cin >> str) { if (str.size() > 19) { cout << BigInteger n ; continue; } if (str.size() < sbyt.size()) ...
#include <bits/stdc++.h> namespace tree { const int N = 501000, MOD = 998244353; inline void inc(int a, int &b) { b = (a + b) % MOD; } int begin[N], next[N * 2], to[N * 2]; int f[N][2], siz[N][2]; int n, e; void add(int x, int y, bool k = 1) { to[++e] = y; next[e] = begin[x]; begin[x] = e; ...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5; int n, fa[maxn + 2], cont[maxn + 2]; int mx1[maxn + 2], mx2[maxn + 2], diameter[maxn + 2]; bool vist[maxn + 2]; vector<int> G[maxn + 2]; vector<long long> dist[maxn + 2]; map<pair<int, int>, double> Map; void dfs1(int x, int pre, int ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base ::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, i, j, k, x, cnt = 0, y; vector<int> a; vector<int> b; vector<int> c; vector<int> d; vector<int> e; vector<int> f; vector<int> v; map<int, int> p; ...
#include <bits/stdc++.h> using namespace std; int main() { long long int l, r; cin >> l >> r; long long int mid = (r - l + 1) / 2; cout << YES << endl; while (mid--) { if (r >= l) { cout << l << << l + 1 << endl; l = l + 2; } } }
#include <bits/stdc++.h> using namespace std; void read_file(bool outToFile = true) {} int main() { read_file(); string a, b; char str[1000000 + 1]; while (scanf( %s , str) != EOF) { a = str; scanf( %s , str); b = str; int n = a.length(), m = b.length(); if (n != m) {...
#include <bits/stdc++.h> using namespace std; int n, comp = 0, a[100005], b[100005], v[100005]; bool vis[100005]; set<int> s[100005]; void dfs(int u) { if (vis[u]) return; vis[u] = true; s[comp].insert(u); dfs(v[u]); } int main() { cin >> n; for (int i = 0; i < n; i++) { cin ...
#include <bits/stdc++.h> using namespace std; long long used[100001], last, a[100001]; vector<long long> v[1000001], verr[100001]; void build(long long tv, long long tl, long long tr) { if (tl == tr) v[tv].push_back(used[tl]); else { long long tm = (tl + tr) / 2; build(tv * 2, tl, tm);...
#include <bits/stdc++.h> using namespace std; int a[100005]; int main() { int n, k, x, sum; scanf( %d %d , &n, &k); for (int i = 0; i < (n); i++) scanf( %d , &a[i]); int ng = 0, ps = 0, nm = -(1 << 28), pm = (1 << 28); for (int i = 0; i < (n); i++) { if (a[i] < 0) ng++; els...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(NULL); int n; string s; cin >> n >> s; int steps0 = 0; int steps1 = 0; for (int i = 0; i < n; ++i) { steps0 += ((s[i] - 0 ) != (i % 2)); steps1 += ((s[i] - 0 ) == (i % 2)); ...
#include <bits/stdc++.h> using namespace std; const long long N = 105; long long max(long long a, long long b) { if (a > b) return a; else return b; } long long min(long long a, long long b) { if (a < b) return a; else return b; } void vecdisp(vector<long long> v) {...
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 1; vector<pair<long long, long long> > g[N]; set<pair<long long, long long> > q; long long dist[N]; int main() { cin.tie(0); cout.tie(0); long long n, m, u, v, w; cin >> n >> m; for (int i = 0; i < m; i++) { cin >> u...
#include <bits/stdc++.h> using namespace std; int main() { std::ios::sync_with_stdio(false); string s, res = ; cin >> s; int len = s.length(); if (len <= 3) { cout << s[0] << endl; return 0; } int l = 0, r = len - 1; while (l + 1 < r - 1) { if (s[l] == s[r] \|\| s[l...
#include <bits/stdc++.h> using namespace std; int n, m, col[100010], out[100010], sum[3], cn, id[100010]; vector<int> g[100010]; void dfs(int x) { for (int i = 0, v; i < g[x].size(); i++) { v = g[x][i]; if (col[v]) continue; col[v] = 3 ^ col[x]; dfs(v); } } void get() { f...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); vector<bool> possible(1010); possible[0] = true; for (int i = 0; i < 1000; ++i) { if (!possible[i]) continue; else { possible[i + 3] = true; possible...
#include <bits/stdc++.h> long long v[4000 + 1], c[4000 + 1], d[4000 + 1], done[4000 + 1], sol[4000 + 1], stiva[4000 + 1]; int main() { int n, i, j, vf; long long sum, sc; fscanf(stdin, %d , &n); for (i = 1; i <= n; i++) { fscanf(stdin, %I64d%I64d%I64d , &v[i], &d[i], &c[i]); } ...
#include <bits/stdc++.h> using namespace std; const int maxn = 55; int a[maxn][maxn], b[maxn][maxn]; int vis[maxn][maxn]; vector<pair<int, int> > ans; int main(int argc, char const *argv[]) { ios::sync_with_stdio(false); int n, m; scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) { f...
#include <bits/stdc++.h> using namespace std; int main() { int n, m, k; cin >> n >> m >> k; int a[m], b[k], c[105] = {0}; for (int i = 0; i < m; i++) { cin >> a[i]; } for (int i = 0; i < k; i++) { cin >> b[i]; } for (int i = 0; i < m; i++) { c[a[i]] = 1; } f...
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; vector<pair<int, bool> > list(n); for (int i = 0; i < n; i++) cin >> list[i].first; int tmp; for (int i = 0; i < m; i++) { cin >> tmp; list[tmp - 1].second = 1; } vector<int> v1(n - m), v2...
#include <bits/stdc++.h> const int inf = (1ll << 30) - 1; const int maxn = (int)1e5 + 10; using namespace std; int dp[150][(1 << 16) + 100]; int c[111]; int r[111]; int b[111]; char temp[111]; int cntR[(1 << 16) + 10]; int cntB[(1 << 16) + 10]; int n; void solve() { memset(dp, -1, sizeof dp)...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long a, b, c, count = 0; scanf( %lld %lld , &a, &b); while (a--) { scanf( %lld , &c); if (c <= b) count++; else count += 2; } printf...
#include <bits/stdc++.h> using namespace std; const long long N = 300100, MOD = 1e9 + 7; long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } int main() { ios::sync_with_stdio(0); cout.tie(0); cin.tie(0); int n; cin >> n; vector<int> arr(n); int odd = 0, even = 0...
#include <bits/stdc++.h> using namespace std; int main() { int i, j, k, l, ans = 0, sign = 1, count = 0; string s; getline(cin, s); l = s.size(); vector<int> v; for (i = 0; i < l; i++) { if (s[i] == ? ) { v.push_back(sign); sign == 1 ? count++ : count--; } else i...
#include <bits/stdc++.h> using namespace std; int n, m, ans(0); int main() { cin >> n >> m; while ((n + m) >= 3 && n > 0 && m > 0) { if (n >= m) { ans++; n -= 2; m--; } else { ans++; m -= 2; n--; } } cout << ans; return 0; } ...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; void debug_out() { clog << n ; } template <typename H, typename... T> void debug_out(H head, T... tail) { clog << << head; debug_out(tail...); } template <typename T> ostream &operator<<(ostream &os, const vector<T...
#include <bits/stdc++.h> int main() { int tc; std::cin >> tc; while (tc--) { int64_t a, b, c; std::cin >> a >> b >> c; std::cout << a + b + c - 1 << std::endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int N, A, ni, ai; string si; vector<int> hero; vector<string> moves; vector<int> player; bool used[22][(int)(1 << 20)]; int dp[22][(int)(1 << 20)]; int BAD = 99999999; int memo(int a, int b) { if (used[a][b]) return dp[a][b]; if (a == A) return 0...
#include <bits/stdc++.h> using namespace std; string s; int isPalin(int start, int end) { if (start == end) return 1; int i = (start + end - 1) / 2; while (start <= i) { if (s[start++] != s[end--]) return 0; } return 1; } int main() { cin >> s; int start = 0, end = s.length()...
#include <bits/stdc++.h> using namespace std; int main() { int a[4]; cin >> a[0] >> a[1] >> a[2] >> a[3]; int sum, i; sum = 0; string s; cin >> s; for (i = 0; i < s.length(); i++) { sum += a[((s[i]) - 0 ) - 1]; } cout << sum; }
#include <bits/stdc++.h> using namespace std; const int inf = 1e9; const int N = 2e6 + 1; const long long mod = 998244353; long long fact[N]; long long power(long long x, long long n) { long long res = 1; x %= mod; while (n) { if (n & 1) res = (res * x) % mod; x = (x * x) % mod; ...
#include <bits/stdc++.h> using namespace std; int main(int argc, char** argv) { int n; cin >> n; long long int sum = 0; for (int i = 1; i < n; i++) { sum += ((n - i) * i); } cout << sum + n; return 0; }
#include <bits/stdc++.h> const int MAXN = 5000 + 10; char s[MAXN]; int f[MAXN][MAXN]; bool isP[MAXN][MAXN]; int main() { scanf( %s , s + 1); int len = strlen(s + 1); for (int i = 1; i <= len + 1; i++) { f[i][i + 1] = 1; isP[i][i + 1] = isP[i][i] = true; } for (int l = 2; l <= l...
#include <bits/stdc++.h> using namespace std; stack<int> ST, SI; vector<int> P; char OR[10000], TEMP[10000]; int L, S, C; int main() { while (scanf( %s , TEMP) == 1) strcat(OR, TEMP); L = strlen(OR); for (S = 0; S < L;) { if (OR[S + 2] == a ) ST.push(0), SI.push(C), C = 0, S += 7;...
#include <bits/stdc++.h> using namespace std; int main() { long long int a, b; cin >> a >> b; while (1) { if (a >= (2 * b)) { a = a % (2 * b); } else if (b >= (2 * a)) b = b % (2 * a); else break; if ((a == 0 \|\| b == 0)) break; } cout << a << <...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1100; int N, K, L; string S; int nc[26]; vector<char> res[MAXN]; int main() { ios_base::sync_with_stdio(0); for (int i = 0; i < 26; i++) nc[i] = 0; cin >> N >> L >> K >> S; for (int i = 0; i < S.length(); i++) nc[S[i] - a ]++;...
#include <bits/stdc++.h> using namespace std; mt19937 mrand(43); const double PI = acos((double)-1); const double eps = 1e-5; const long long inf0 = 1023 * 1024 * 1024; const long long inf = inf0 * inf0; const long long mod = 1e9 + 7; void solve(); void scan(); signed main() { cin.tie(0); co...
#include <bits/stdc++.h> using namespace std; int al = 1 << 29; char ans[1000100]; char a[1000100]; int n, m; void computer(int x, int y) { int l = 0; while (x != y) { if (x > y) { a[l++] = T ; x -= y; } else { a[l++] = B ; y -= x; } } if (...
#include <bits/stdc++.h> using namespace std; int n, s; int a[110][2]; int main() { scanf( %d %d , &n, &s); for (int i = 0; i < n; i++) { scanf( %d %d , &a[i][0], &a[i][1]); } int cnt = 0; int maxcnt = 0; int temp = 0; for (int i = 0; i < n; i++) { if ((a[i][0] == s && a[...
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long inf = 0x3f3f3f3f3f3f3f3f; const long long mod = 998244353; const int N = 3e5 + 10; int n; int a[N]; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); for (int i = 1; i <= n;...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 10; int n, m; int a[maxn], par[maxn], t[maxn]; vector<int> g[maxn]; int get_par(int v) { return (par[v] == -1) ? v : par[v] = get_par(par[v]); } void merge(int u, int v) { u = get_par(u); v = get_par(v); if (v == u) return; ...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int x, y, n = 0; cin >> x >> y; for (int i = 2; i <= x; i++) { if (x % i == 0) { n = i; break; } } cout << x + n + (y - 1) * 2 << endl; } }
#include <bits/stdc++.h> using namespace std; int main() { int n; int sum = 0; cin >> n; int *p; p = new int [n]; for (int i = 0; i < n; i++) { p[i] = new int[n]; for (int j = 0; j < n; j++) { cin >> p[i][j]; } } for (int i = 0; i < n; i++) { for (in...
#include <bits/stdc++.h> int DEBUG = 1; using namespace std; const int N = 100 * 1000 + 5; const long long INF = 1e17; long long gcd(long long a, long long b) { if (b == 0) return a; else return gcd(b, a % b); } long long n, k; long long a, b; long long x; long long MIN = +INF; ...
#include <bits/stdc++.h> #define MAXN 100001 int spf[MAXN]; using namespace std; #define mod 1000000007 #define int long long //32bit as well as 64bit #define vi vector<int> // a[n] s[n] v(n) pop_back #define vvi vector<vector<int>> // vvi(n) ...
#include <bits/stdc++.h> int main() { int i, j, k, l; long long n, m, sum; while (scanf( %lld%lld , &n, &m) != EOF) { sum = 0; for (int i = 1; i <= n; i++) { if (m % i == 0 && m / i <= n) { ++sum; } } printf( %d n , sum); } return 0; }
#include <bits/stdc++.h> using namespace std; map<string, int> hsh; int check(string str, int l, int r) { int pos = 0, cur = 0; for (int i = r; i >= l; i--) { if (str[i] == ( ) cur++; else if (str[i] == ) ) cur--; else if (cur == 0 && pos == 0 && (str[i] == * \|\| str[i...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 9; const long long INF = 1e12; int n = 100000; long long a[MAXN]; long long f[20][MAXN]; void init() { for (int i = 1; i <= n; i++) { a[i] = i; } for (int i = 1; i <= n; i++) { for (int j = i + i; j < MAXN; j += i...
#include <bits/stdc++.h> using namespace std; const int Max = 1e3, Max_Q = 1e4; const int fx[8] = {0, 0, 1, 1, 1, -1, -1, -1}; const int fy[8] = {1, -1, 0, 1, -1, 0, 1, -1}; int h, w, Q, cnt, s, t, Top, siz, q[Max + 5], stk[Max + 5], Id[Max + 5][Max + 5], fa[Max * Max + 5], vis[Max * Max + 5]; char S[...
#include <bits/stdc++.h> using namespace std; struct elem { int u, clen, tlen; int nlis; int lis[4]; elem() { clen = -1; nlis = 0; } elem(int u, int clen, int tlen) : u(u), clen(clen), tlen(tlen) { nlis = 0; } }; void write(string s, elem e) { cout << [ << s << , u <...
#include <bits/stdc++.h> using namespace std; inline 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 - 0 ; ch = getchar(); } return x * f;...
#include <bits/stdc++.h> using namespace std; const int MAXN = 110; static int N, M, P, val[MAXN], cut[MAXN]; int main() { scanf( %d%d , &N, &M); for (int i = 1; i <= N; i++) scanf( %d , &val[i]); for (int i = 1, odd = 0, evn = 0; i < N; i++) { ((val[i] & 1) ? odd : evn) += 1; if (odd ==...
#include <bits/stdc++.h> using namespace std; int sol1, sol2, sol3, n; string str; int main() { cin >> n >> str; for (int i = 0; i < str.length(); i++) { if (str[i] == A ) sol1++; else if (str[i] == I ) sol2++; } sol3 = str.length() - sol1 - sol2; if (sol2 == 0)...
#include <bits/stdc++.h> using namespace std; const int inf = 1e9; const long long inf64 = 1e18; const int N = 1e5 + 5; int xmax, ymax, zmax, n, m, k; enum TYPE { XZ, OPEN, CLOSED, UNKNOWN }; vector<pair<int, int> > add[N]; vector<pair<pair<pair<int, int>, pair<int, int> >, int> > op[N], cl[N]; vector...
#include <bits/stdc++.h> using namespace std; int ar[6]; int main() { long long int n, x, j, y, cnt = 0, sum = 0; for (cin >> n, j = 0; j < n; j++) { cin >> x >> y; ar[x] += 1; ar[y] += 1; } for (int i = 1; i <= 5; i++) { if (ar[i] >= 3 \|\| ar[i] <= 1) cnt++; } if (c...
#include <bits/stdc++.h> using namespace std; int xx[4] = {0, 0, 1, -1}; int yy[4] = {1, -1, 0, 0}; int n, m, q; int h[int(1e3 + 100)], dem, st[int(1e3 + 100)], vt[int(1e3 + 100)], top, mid; int a[int(1e3 + 100)][int(1e3 + 100)]; int hl[int(1e3 + 100)][int(1e3 + 100)], cl[int(1e3 + 100)][int(1e3 + 100)], ...
#include <bits/stdc++.h> using namespace std; int main() { int matrix[5][5]; for (int i = 0; i < 5; i++) { for (int j = 0; j < 5; j++) { cin >> matrix[i][j]; } } int row = 0; int col = 0; for (int i = 0; i < 5; i++) { for (int j = 0; j < 5; j++) { if (matrix...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false), cout.tie(0), cin.tie(0); int m, n; cin >> m >> n; vector<int> A(m), B(n); for (int &i : A) cin >> i; for (int &i : B) cin >> i; vector<pair<int, pair<int, int>>> C; for (int i = 0; i < m; ++i...

#include <bits/stdc++.h> using namespace std; const int oo = 1e9; const int maxc = 77; struct thang { int X, B; }; thang A[1010]; double f[1010]; int trace[1010], st[1010]; int N, L; void nhap() { scanf( %d%d , &N, &L); for (int i = 1; i <= N; i++) scanf( %d%d , &A[i].X, &A[i].B); A[...

#include <bits/stdc++.h> using namespace std; int n, m, a[300005], op, l, r; long long fib[300005 + 100]; struct wyh { long long tagl, tagr, sum; } tree[300005 * 4]; inline long long getint() { long long x = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f...

#include <bits/stdc++.h> using namespace std; template <class T> long long size(const T& x) { return x.size(); } #pragma GCC optimize( Ofast ) template <class T> T smod(T a, T b) { return (a % b + b) % b; } long long pw(long long a, long long b) { long long res = 1; while (b > 0) { ...

#include <bits/stdc++.h> int main() { char s[101]; int cnt[2] = {}; scanf( %s , s); for (int i = 0; s[i]; i++) cnt[s[i] == - ]++; printf( %s n , cnt[0] && cnt[1] % cnt[0] ? NO : YES ); }

#include <bits/stdc++.h> using namespace std; const int maxn = 100010; int p[maxn], w[maxn]; vector<pair<pair<int, int>, int>> a; int find(int x) { if (p[x] == x) return x; else { int ret = find(p[x]); w[x] ^= w[p[x]]; return p[x] = ret; } } int main() { int l, r, n...

#include <bits/stdc++.h> using namespace std; namespace IO { const unsigned int Buffsize = 1 << 15, Output = 1 << 23; static char Ch_[Buffsize], *S_ = Ch_, *T_ = Ch_; static char Out[Output], *nowps = Out; inline void flush() { fwrite(Out, 1, nowps - Out, stdout); nowps = Out; } template <class ...

#include <bits/stdc++.h> using namespace std; double dis(double ax, double ay, double bx, double by) { return sqrt(pow(ax - bx, 2) + pow(ay - by, 2)); } bool f(double a, double b, double c) { if (a == sqrt(pow(b, 2) + pow(c, 2))) return true; else return false; } int main() { cou...

#include <bits/stdc++.h> using namespace std; int main() { int w = 26; int count = 0; char a[] = { a , b , c , d , e , f , g , h , i , j , k , l , m , n , o , p , q , r , s , t , u , v , w , x , y , z }; string b; cin >> b; for (char c : b) { fo...

#include <bits/stdc++.h> using namespace std; int main() { string s, x; cin >> s; int count = 0, sz = s.size(); for (int i = 0; i < sz; ++i) if (s[i] == 1 ) ++count; for (int i = 0; i < sz; ++i) { if (s[i] == 0 ) x += 0 ; else if (s[i] == 2 ) { while (count-...

#include <bits/stdc++.h> using namespace std; const int maxn = 100009; int first[maxn], du[maxn], pre[maxn][2]; struct edg { int next, to; } e[maxn << 1]; struct node { int x, opt; }; bool vis[maxn][2], ins[maxn], ok[maxn]; queue<node> q; int n, m, s, e_sum; bool flag; inline int read() ...

#include <bits/stdc++.h> using namespace std; int main() { int n, m, l, r, x, mid; cin >> n >> m; int a[n][2]; for (int i = 0; i < n; i++) cin >> a[i][0] >> a[i][1]; int b[m]; for (int i = 0; i < m; i++) cin >> b[i]; int music[n]; for (int i = 0; i < n; i++) music[i] = 0; music[0...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast,unroll-loops,no-stack-protector,fast-math,inline ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2 ) using namespace std; using ll = long long; using vvi = vector<vector<int>>; using vi = vector<int>; using vvll = vector<vector<long...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; int n, a[N], d[N], b[21][N], a2[25], ans[N]; void dg(int x) { if (x > 20) { if (d[0] < ans[0]) for (int i = 0; i <= d[0]; i++) ans[i] = d[i]; return; } int pos = 0; for (int i = 1; i <= n; i++) pos |= a[i] &...

#include <bits/stdc++.h> using namespace std; char s[10001000]; int n; vector<int> sep; void lindon() { for (int i = 0; i < n;) { sep.push_back(i); int p1 = i, p2 = i + 1; while (p2 < n && s[p1] <= s[p2]) { if (s[p1] == s[p2]) ++p1, ++p2; else p1 = i, ...

#include <bits/stdc++.h> using namespace std; int a[1010][1010]; int mapa[1010][1010]; int n, m; int TIME = 0; bool ok(int val) { for (int i = 0; i < n; i++) { vector<int> row; for (int j = 0; j < m; j++) { if (a[i][j] >= val) row.push_back(j); } for (int first = 0; first...

#include <bits/stdc++.h> using namespace std; using uint = unsigned; using ll = long long; using ull = unsigned long long; using vi = vector<int>; using vvi = vector<vi>; using vl = vector<ll>; using vvl = vector<vl>; using vd = vector<double>; using vvd = vector<vd>; using vs = vector<string>; ...

#include <bits/stdc++.h> using namespace std; long long mypow(long long x, int y) { long long an = 1; while (y) { if (y & 1) { an *= x; an %= 1000000007; } x *= x; x %= 1000000007; y >>= 1; } return an; } int d[1000001]; int f(int k, int w) { m...

#include <bits/stdc++.h> long long dx[4] = {0, -1, 0, 1}; long long dy[4] = {1, 0, -1, 0}; using namespace std; class pa3 { public: long long x, y, z; pa3(long long x = 0, long long y = 0, long long z = 0) : x(x), y(y), z(z) {} bool operator<(const pa3 &p) const { if (x != p.x) return x < p...

#include <bits/stdc++.h> using namespace std; struct node { int x, id; }; node a[1005]; bool cmp(node a, node b) { return a.x < b.x; } int main() { int n, k; int i; scanf( %d%d , &n, &k); for (i = 1; i <= n; i++) { scanf( %d , &a[i].x); a[i].id = i; } sort(a + 1, a + ...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( avx,avx2,fma ) #pragma GCC optimization( unroll-loops ) using namespace std; long long int n, k, ans = 0; long long int arr[500005]; void solve() { cin >> n >> k; map<long long int, long long int> mpp, tot, till; for (l...

#include <bits/stdc++.h> using namespace std; int main() { string a; cin >> a; if (a[0] >= a && a[0] <= z ) a[0] -= 32; cout << a; return 0; }

#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int c = 0; int u = a ; for (int i = 0; i < s.length(); i++) { if (c >= 26) break; if (s[i] <= u) { s[i] = u; c++; u++; if (u > z ) break; } } if (c >= 26) ...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e+5; char str[2 * maxn + 5]; int main() { int cishu; cin >> cishu; while (cishu--) { int n; cin >> n; for (int a = 0; a < n - 1; a++) cin >> str[a]; str[n - 1] = 0 ; int tmp = n; for (int i = 0; i < ...

#include <bits/stdc++.h> using namespace std; mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count()); template <typename T> T ceil(T a, T b) { return (a + b - 1) / b; } template <typename T> T binpow(T a, T b) { T res = 1; while (b > 0) { if (b & 1) res = res * a; a = ...

#include <bits/stdc++.h> using namespace std; class Data { public: int l, r, num; Data() {} Data(int a, int b, int c) { l = a; r = b; num = c; } bool operator<(const Data& a) const { return l < a.r; } }; vector<Data> a; int main() { int L, b, f, n, q, k; cin >>...

#include <bits/stdc++.h> int main() { std::string str; std::getline(std::cin, str); int number = 0; for (int j = 0, i = 0; j < str.size(); ++j) { int n = 0; while (j < str.size() && isdigit(str.at(j))) n = n * 10 + str.at(j++) - 48; number = number + n * i++; if (j >= str.size(...

#include <bits/stdc++.h> using namespace std; char c; int s = 0, k = 0, n = 0, x, f = 0; ; int main() { while (cin.get(c)) { if (c == n ) break; switch (s) { case 0: { if (c >= a && c <= z || c >= A && c <= Z || c == _ || c >= 0 && c <= 9 ) { ...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { double a, b, c, d, k; cin >> a >> b >> c >> d >> k; double pen = a / c; double pencil = b / d; pen = ceil(pen); pencil = ceil(pencil); if ((pen + pencil) <= k) { do...

#include <bits/stdc++.h> using namespace std; const int N = 1000023; long long int power(long long int a, long long int b) { long long int ans = 1; while (b) { if (b & 1) ans = (ans * a); b /= 2; a = (a * a); } return ans; } bool sortbysec(const pair<long long int, long long ...

#include <bits/stdc++.h> using namespace std; using ll = long long; using pll = pair<ll, ll>; bool cmpx(const pll& a, const pll& b) { return a.first < b.first; } bool cmpy(const pll& a, const pll& b) { return a.second < b.second; } ll sq(const ll& first) { return first * first; } ll dis(const pll& a, cons...

#include <bits/stdc++.h> using namespace std; const long long int INF = 1000000007; const int N = 1000000 + 7; long long int trans[N]; long long int ca[N]; long long int maxb[N]; int main() { std::ios::sync_with_stdio(false); cin.tie(NULL); int n; long long int d; cin >> n >> d; fo...

#include <bits/stdc++.h> const int mod = 1000000007; int dp[4][200005]; int main() { long long a, b; scanf( %I64d %I64d , &a, &b); long long t = sqrt(2 * (a + b)); while ((t * t + t > 2 * (a + b)) || ((t * t + 3 * t + 2) <= 2 * (a + b))) { --t; } long long sum = t * (t + 1) / 2; ...

#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } template <class T1, class T2> struct cmpf { bool rev; inline bool operator()(const pair<T1, T2>& a, const pair<T1, T2>& b) const { return (a.first < b.first) ^ rev; } cmp...

#include <bits/stdc++.h> using namespace std; char buf[100005]; int cnt[10]; int cnt2[10]; int main() { scanf( %s , buf); int N = strlen(buf); for (int i = 0; i < (N); ++i) cnt[buf[i] - 0 ]++; for (int i = 0; i < (10); ++i) cnt2[i] = cnt[i]; int best = 0, bestres = cnt[0]; for (int d ...

#include <bits/stdc++.h> using namespace std; int main() { string s[1005], ss[1005]; cin >> s[0] >> ss[0]; int n; cin >> n; for (int i = 1; i <= n; i++) cin >> s[i] >> ss[i]; for (int i = 0; i <= n; i++) { if (i == 0) { cout << s[0] << << ss[0] << endl; continue; ...

#include <bits/stdc++.h> using namespace std; int n, m, k; int a[100]; int ans; int main() { cin >> n >> m >> k; for (int i = 0; i < k; i++) { cin >> a[i]; a[i]--; } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { int x; cin >> x; x--; ...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); long long n, k; cin >> n >> k; long long ans = 0; for (int i = (int)0; i < (int)n; ++i) { long long l, r; cin >> l >> r; ans += r - l + 1; } int ted = 0; while (ans % k) { ...

#include <bits/stdc++.h> using namespace std; vector<string> val; bool check1[110]; bool check2[110]; char a[5] = { R , G , B , Y , W }; bool used1[5]; bool used2[5]; char val1[5]; int val2[5]; int ans = 1000 * 1000; void go2(int pos, int cnt, int cnt2) { if (pos == cnt) { for (int i...

#include <bits/stdc++.h> using namespace std; long long m; long long f(long long a) { long long res = 0; for (long long k = 2;; k++) { long long k3 = k * k * k; if (k3 > a) break; if (res > m - a / k3) return -1; res += a / k3; } return res; } int main() { cin >> m;...

#include <bits/stdc++.h> const int MAXN = 505; const long long MOD = 998244353; int n, sizb, sizc; long long a[MAXN], b[MAXN], c[MAXN]; bool fac[MAXN]; std::map<long long, int> mp; inline long long gcd(long long x, long long y) { if (!x || !y) return x + y; while (y) { std::swap(x, y); ...

#include <bits/stdc++.h> using namespace std; int main() { int t, n, fl = 0, fl2; cin >> t; while (t--) { fl = 0, fl2 = 0; cin >> n; vector<int> v; int p = n; for (int i = 2; i * i <= n; i++) { if (p % i == 0 && fl <= 1) { v.push_back(i); p /= i;...

#include <bits/stdc++.h> long long int a[1500][1500]; using namespace std; int main() { int n, m; scanf( %i , &n); scanf( %i , &m); for (int i = 0; i < n; i++) { int x; scanf( %i , &x); a[i][0] = x; for (int j = 1; j < m; j++) { scanf( %i , &x); a[i][j] = a[...

#include <bits/stdc++.h> using namespace std; const int MX = 1e5 + 10; unordered_set<int> adj[MX]; vector<int> ans; bool vis[MX]; set<pair<int, int>> ord; void dfs(int u) { vis[u] = true; ans.push_back(u); for (int v : adj[u]) { if (!vis[v]) dfs(v); } } bool can(int k, int t, int...

#include <bits/stdc++.h> using namespace std; string str; string sbyt( 127 ), ssho( 32767 ), sint( 2147483647 ), slon( 9223372036854775807 ); int main() { while (cin >> str) { if (str.size() > 19) { cout << BigInteger n ; continue; } if (str.size() < sbyt.size()) ...

#include <bits/stdc++.h> namespace tree { const int N = 501000, MOD = 998244353; inline void inc(int a, int &b) { b = (a + b) % MOD; } int begin[N], next[N * 2], to[N * 2]; int f[N][2], siz[N][2]; int n, e; void add(int x, int y, bool k = 1) { to[++e] = y; next[e] = begin[x]; begin[x] = e; ...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e5; int n, fa[maxn + 2], cont[maxn + 2]; int mx1[maxn + 2], mx2[maxn + 2], diameter[maxn + 2]; bool vist[maxn + 2]; vector<int> G[maxn + 2]; vector<long long> dist[maxn + 2]; map<pair<int, int>, double> Map; void dfs1(int x, int pre, int ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base ::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, i, j, k, x, cnt = 0, y; vector<int> a; vector<int> b; vector<int> c; vector<int> d; vector<int> e; vector<int> f; vector<int> v; map<int, int> p; ...

#include <bits/stdc++.h> using namespace std; int main() { long long int l, r; cin >> l >> r; long long int mid = (r - l + 1) / 2; cout << YES << endl; while (mid--) { if (r >= l) { cout << l << << l + 1 << endl; l = l + 2; } } }

#include <bits/stdc++.h> using namespace std; void read_file(bool outToFile = true) {} int main() { read_file(); string a, b; char str[1000000 + 1]; while (scanf( %s , str) != EOF) { a = str; scanf( %s , str); b = str; int n = a.length(), m = b.length(); if (n != m) {...

#include <bits/stdc++.h> using namespace std; int n, comp = 0, a[100005], b[100005], v[100005]; bool vis[100005]; set<int> s[100005]; void dfs(int u) { if (vis[u]) return; vis[u] = true; s[comp].insert(u); dfs(v[u]); } int main() { cin >> n; for (int i = 0; i < n; i++) { cin ...

#include <bits/stdc++.h> using namespace std; long long used[100001], last, a[100001]; vector<long long> v[1000001], verr[100001]; void build(long long tv, long long tl, long long tr) { if (tl == tr) v[tv].push_back(used[tl]); else { long long tm = (tl + tr) / 2; build(tv * 2, tl, tm);...

#include <bits/stdc++.h> using namespace std; int a[100005]; int main() { int n, k, x, sum; scanf( %d %d , &n, &k); for (int i = 0; i < (n); i++) scanf( %d , &a[i]); int ng = 0, ps = 0, nm = -(1 << 28), pm = (1 << 28); for (int i = 0; i < (n); i++) { if (a[i] < 0) ng++; els...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(NULL); int n; string s; cin >> n >> s; int steps0 = 0; int steps1 = 0; for (int i = 0; i < n; ++i) { steps0 += ((s[i] - 0 ) != (i % 2)); steps1 += ((s[i] - 0 ) == (i % 2)); ...

#include <bits/stdc++.h> using namespace std; const long long N = 105; long long max(long long a, long long b) { if (a > b) return a; else return b; } long long min(long long a, long long b) { if (a < b) return a; else return b; } void vecdisp(vector<long long> v) {...

#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 1; vector<pair<long long, long long> > g[N]; set<pair<long long, long long> > q; long long dist[N]; int main() { cin.tie(0); cout.tie(0); long long n, m, u, v, w; cin >> n >> m; for (int i = 0; i < m; i++) { cin >> u...

#include <bits/stdc++.h> using namespace std; int main() { std::ios::sync_with_stdio(false); string s, res = ; cin >> s; int len = s.length(); if (len <= 3) { cout << s[0] << endl; return 0; } int l = 0, r = len - 1; while (l + 1 < r - 1) { if (s[l] == s[r] || s[l...

#include <bits/stdc++.h> using namespace std; int n, m, col[100010], out[100010], sum[3], cn, id[100010]; vector<int> g[100010]; void dfs(int x) { for (int i = 0, v; i < g[x].size(); i++) { v = g[x][i]; if (col[v]) continue; col[v] = 3 ^ col[x]; dfs(v); } } void get() { f...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); vector<bool> possible(1010); possible[0] = true; for (int i = 0; i < 1000; ++i) { if (!possible[i]) continue; else { possible[i + 3] = true; possible...

#include <bits/stdc++.h> long long v[4000 + 1], c[4000 + 1], d[4000 + 1], done[4000 + 1], sol[4000 + 1], stiva[4000 + 1]; int main() { int n, i, j, vf; long long sum, sc; fscanf(stdin, %d , &n); for (i = 1; i <= n; i++) { fscanf(stdin, %I64d%I64d%I64d , &v[i], &d[i], &c[i]); } ...

#include <bits/stdc++.h> using namespace std; const int maxn = 55; int a[maxn][maxn], b[maxn][maxn]; int vis[maxn][maxn]; vector<pair<int, int> > ans; int main(int argc, char const *argv[]) { ios::sync_with_stdio(false); int n, m; scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) { f...

#include <bits/stdc++.h> using namespace std; int main() { int n, m, k; cin >> n >> m >> k; int a[m], b[k], c[105] = {0}; for (int i = 0; i < m; i++) { cin >> a[i]; } for (int i = 0; i < k; i++) { cin >> b[i]; } for (int i = 0; i < m; i++) { c[a[i]] = 1; } f...

#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; vector<pair<int, bool> > list(n); for (int i = 0; i < n; i++) cin >> list[i].first; int tmp; for (int i = 0; i < m; i++) { cin >> tmp; list[tmp - 1].second = 1; } vector<int> v1(n - m), v2...

#include <bits/stdc++.h> const int inf = (1ll << 30) - 1; const int maxn = (int)1e5 + 10; using namespace std; int dp[150][(1 << 16) + 100]; int c[111]; int r[111]; int b[111]; char temp[111]; int cntR[(1 << 16) + 10]; int cntB[(1 << 16) + 10]; int n; void solve() { memset(dp, -1, sizeof dp)...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long a, b, c, count = 0; scanf( %lld %lld , &a, &b); while (a--) { scanf( %lld , &c); if (c <= b) count++; else count += 2; } printf...

#include <bits/stdc++.h> using namespace std; const long long N = 300100, MOD = 1e9 + 7; long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } int main() { ios::sync_with_stdio(0); cout.tie(0); cin.tie(0); int n; cin >> n; vector<int> arr(n); int odd = 0, even = 0...

#include <bits/stdc++.h> using namespace std; int main() { int i, j, k, l, ans = 0, sign = 1, count = 0; string s; getline(cin, s); l = s.size(); vector<int> v; for (i = 0; i < l; i++) { if (s[i] == ? ) { v.push_back(sign); sign == 1 ? count++ : count--; } else i...

#include <bits/stdc++.h> using namespace std; int n, m, ans(0); int main() { cin >> n >> m; while ((n + m) >= 3 && n > 0 && m > 0) { if (n >= m) { ans++; n -= 2; m--; } else { ans++; m -= 2; n--; } } cout << ans; return 0; } ...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; void debug_out() { clog << n ; } template <typename H, typename... T> void debug_out(H head, T... tail) { clog << << head; debug_out(tail...); } template <typename T> ostream &operator<<(ostream &os, const vector<T...

#include <bits/stdc++.h> int main() { int tc; std::cin >> tc; while (tc--) { int64_t a, b, c; std::cin >> a >> b >> c; std::cout << a + b + c - 1 << std::endl; } return 0; }

#include <bits/stdc++.h> using namespace std; int N, A, ni, ai; string si; vector<int> hero; vector<string> moves; vector<int> player; bool used[22][(int)(1 << 20)]; int dp[22][(int)(1 << 20)]; int BAD = 99999999; int memo(int a, int b) { if (used[a][b]) return dp[a][b]; if (a == A) return 0...

#include <bits/stdc++.h> using namespace std; string s; int isPalin(int start, int end) { if (start == end) return 1; int i = (start + end - 1) / 2; while (start <= i) { if (s[start++] != s[end--]) return 0; } return 1; } int main() { cin >> s; int start = 0, end = s.length()...

#include <bits/stdc++.h> using namespace std; int main() { int a[4]; cin >> a[0] >> a[1] >> a[2] >> a[3]; int sum, i; sum = 0; string s; cin >> s; for (i = 0; i < s.length(); i++) { sum += a[((s[i]) - 0 ) - 1]; } cout << sum; }

#include <bits/stdc++.h> using namespace std; const int inf = 1e9; const int N = 2e6 + 1; const long long mod = 998244353; long long fact[N]; long long power(long long x, long long n) { long long res = 1; x %= mod; while (n) { if (n & 1) res = (res * x) % mod; x = (x * x) % mod; ...

#include <bits/stdc++.h> using namespace std; int main(int argc, char** argv) { int n; cin >> n; long long int sum = 0; for (int i = 1; i < n; i++) { sum += ((n - i) * i); } cout << sum + n; return 0; }

#include <bits/stdc++.h> const int MAXN = 5000 + 10; char s[MAXN]; int f[MAXN][MAXN]; bool isP[MAXN][MAXN]; int main() { scanf( %s , s + 1); int len = strlen(s + 1); for (int i = 1; i <= len + 1; i++) { f[i][i + 1] = 1; isP[i][i + 1] = isP[i][i] = true; } for (int l = 2; l <= l...

#include <bits/stdc++.h> using namespace std; stack<int> ST, SI; vector<int> P; char OR[10000], TEMP[10000]; int L, S, C; int main() { while (scanf( %s , TEMP) == 1) strcat(OR, TEMP); L = strlen(OR); for (S = 0; S < L;) { if (OR[S + 2] == a ) ST.push(0), SI.push(C), C = 0, S += 7;...

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

#include <bits/stdc++.h> using namespace std; const int MAXN = 1100; int N, K, L; string S; int nc[26]; vector<char> res[MAXN]; int main() { ios_base::sync_with_stdio(0); for (int i = 0; i < 26; i++) nc[i] = 0; cin >> N >> L >> K >> S; for (int i = 0; i < S.length(); i++) nc[S[i] - a ]++;...

#include <bits/stdc++.h> using namespace std; mt19937 mrand(43); const double PI = acos((double)-1); const double eps = 1e-5; const long long inf0 = 1023 * 1024 * 1024; const long long inf = inf0 * inf0; const long long mod = 1e9 + 7; void solve(); void scan(); signed main() { cin.tie(0); co...

#include <bits/stdc++.h> using namespace std; int al = 1 << 29; char ans[1000100]; char a[1000100]; int n, m; void computer(int x, int y) { int l = 0; while (x != y) { if (x > y) { a[l++] = T ; x -= y; } else { a[l++] = B ; y -= x; } } if (...

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

#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long inf = 0x3f3f3f3f3f3f3f3f; const long long mod = 998244353; const int N = 3e5 + 10; int n; int a[N]; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); for (int i = 1; i <= n;...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 10; int n, m; int a[maxn], par[maxn], t[maxn]; vector<int> g[maxn]; int get_par(int v) { return (par[v] == -1) ? v : par[v] = get_par(par[v]); } void merge(int u, int v) { u = get_par(u); v = get_par(v); if (v == u) return; ...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int x, y, n = 0; cin >> x >> y; for (int i = 2; i <= x; i++) { if (x % i == 0) { n = i; break; } } cout << x + n + (y - 1) * 2 << endl; } }

#include <bits/stdc++.h> using namespace std; int main() { int n; int sum = 0; cin >> n; int **p; p = new int *[n]; for (int i = 0; i < n; i++) { p[i] = new int[n]; for (int j = 0; j < n; j++) { cin >> p[i][j]; } } for (int i = 0; i < n; i++) { for (in...

#include <bits/stdc++.h> int DEBUG = 1; using namespace std; const int N = 100 * 1000 + 5; const long long INF = 1e17; long long gcd(long long a, long long b) { if (b == 0) return a; else return gcd(b, a % b); } long long n, k; long long a, b; long long x; long long MIN = +INF; ...

#include <bits/stdc++.h> #define MAXN 100001 int spf[MAXN]; using namespace std; #define mod 1000000007 #define int long long //32bit as well as 64bit #define vi vector<int> // a[n] s[n] v(n) pop_back #define vvi vector<vector<int>> // vvi(n) ...

#include <bits/stdc++.h> int main() { int i, j, k, l; long long n, m, sum; while (scanf( %lld%lld , &n, &m) != EOF) { sum = 0; for (int i = 1; i <= n; i++) { if (m % i == 0 && m / i <= n) { ++sum; } } printf( %d n , sum); } return 0; }

#include <bits/stdc++.h> using namespace std; map<string, int> hsh; int check(string str, int l, int r) { int pos = 0, cur = 0; for (int i = r; i >= l; i--) { if (str[i] == ( ) cur++; else if (str[i] == ) ) cur--; else if (cur == 0 && pos == 0 && (str[i] == * || str[i...

#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 9; const long long INF = 1e12; int n = 100000; long long a[MAXN]; long long f[20][MAXN]; void init() { for (int i = 1; i <= n; i++) { a[i] = i; } for (int i = 1; i <= n; i++) { for (int j = i + i; j < MAXN; j += i...

#include <bits/stdc++.h> using namespace std; const int Max = 1e3, Max_Q = 1e4; const int fx[8] = {0, 0, 1, 1, 1, -1, -1, -1}; const int fy[8] = {1, -1, 0, 1, -1, 0, 1, -1}; int h, w, Q, cnt, s, t, Top, siz, q[Max + 5], stk[Max + 5], Id[Max + 5][Max + 5], fa[Max * Max + 5], vis[Max * Max + 5]; char S[...

#include <bits/stdc++.h> using namespace std; struct elem { int u, clen, tlen; int nlis; int lis[4]; elem() { clen = -1; nlis = 0; } elem(int u, int clen, int tlen) : u(u), clen(clen), tlen(tlen) { nlis = 0; } }; void write(string s, elem e) { cout << [ << s << , u <...

#include <bits/stdc++.h> using namespace std; inline 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 - 0 ; ch = getchar(); } return x * f;...

#include <bits/stdc++.h> using namespace std; const int MAXN = 110; static int N, M, P, val[MAXN], cut[MAXN]; int main() { scanf( %d%d , &N, &M); for (int i = 1; i <= N; i++) scanf( %d , &val[i]); for (int i = 1, odd = 0, evn = 0; i < N; i++) { ((val[i] & 1) ? odd : evn) += 1; if (odd ==...

#include <bits/stdc++.h> using namespace std; int sol1, sol2, sol3, n; string str; int main() { cin >> n >> str; for (int i = 0; i < str.length(); i++) { if (str[i] == A ) sol1++; else if (str[i] == I ) sol2++; } sol3 = str.length() - sol1 - sol2; if (sol2 == 0)...

#include <bits/stdc++.h> using namespace std; const int inf = 1e9; const long long inf64 = 1e18; const int N = 1e5 + 5; int xmax, ymax, zmax, n, m, k; enum TYPE { XZ, OPEN, CLOSED, UNKNOWN }; vector<pair<int, int> > add[N]; vector<pair<pair<pair<int, int>, pair<int, int> >, int> > op[N], cl[N]; vector...

#include <bits/stdc++.h> using namespace std; int ar[6]; int main() { long long int n, x, j, y, cnt = 0, sum = 0; for (cin >> n, j = 0; j < n; j++) { cin >> x >> y; ar[x] += 1; ar[y] += 1; } for (int i = 1; i <= 5; i++) { if (ar[i] >= 3 || ar[i] <= 1) cnt++; } if (c...

#include <bits/stdc++.h> using namespace std; int xx[4] = {0, 0, 1, -1}; int yy[4] = {1, -1, 0, 0}; int n, m, q; int h[int(1e3 + 100)], dem, st[int(1e3 + 100)], vt[int(1e3 + 100)], top, mid; int a[int(1e3 + 100)][int(1e3 + 100)]; int hl[int(1e3 + 100)][int(1e3 + 100)], cl[int(1e3 + 100)][int(1e3 + 100)], ...

#include <bits/stdc++.h> using namespace std; int main() { int matrix[5][5]; for (int i = 0; i < 5; i++) { for (int j = 0; j < 5; j++) { cin >> matrix[i][j]; } } int row = 0; int col = 0; for (int i = 0; i < 5; i++) { for (int j = 0; j < 5; j++) { if (matrix...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false), cout.tie(0), cin.tie(0); int m, n; cin >> m >> n; vector<int> A(m), B(n); for (int &i : A) cin >> i; for (int &i : B) cin >> i; vector<pair<int, pair<int, int>>> C; for (int i = 0; i < m; ++i...