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; int main() { int n; cin >> n; vector<string> rs; if (n == 1) { rs.push_back( a ); rs.push_back( a ); rs.push_back( b ); rs.push_back( b ); } else if (n == 2) { rs.push_back( aa ); rs.push_back( bb ); rs.push_...
#include <bits/stdc++.h> using namespace std; const double EPS = 1e-6; int H[1005]; int main() { int n, m, h; int l, r, x; int i, j; scanf( %d%d%d , &n, &h, &m); for (i = 1; i <= n; i++) H[i] = h; for (i = 0; i < m; i++) { scanf( %d%d%d , &l, &r, &x); for (j = l; j <= r; j++)...
#include <bits/stdc++.h> using namespace std; long long a[500006]; long long dp[500006]; long long vis[500006]; vector<long long> v[500006]; long long on; long long n, d, che; void dfs(long long root, long long parent) { vis[root] = 1; dp[root] = 1; for (auto it : v[root]) { if (!vis[i...
#include <bits/stdc++.h> using namespace std; inline long long ma(long long a, long long b) { return a > b ? a : b; } inline long long mi(long long a, long long b) { return a > b ? b : a; } template <typename Arg1> void __f(const char *name, Arg1 &&arg1) { cerr << name << : << arg1 << endl; } temp...
#include <bits/stdc++.h> using namespace std; const int maxn = 64; int n, m, r, a[maxn][maxn], dis[maxn]; int dp[maxn][maxn][maxn]; set<pair<int, int> > s; void dij(int v) { memset(dis, 127, sizeof dis); dis[v] = 0; s.insert(make_pair(dis[v], v)); while (s.size()) { v = s.begin()->seco...
#include <bits/stdc++.h> using namespace std; int a[100005], b[100005], c[100005]; class segtree { public: int seg[524288 * 2]; int lazy[524288 * 2]; void init() { for (int i = 0; i < 524288 * 2; i++) { seg[i] = 0; } } void lazy_evaluate(int x) { if (x * 2 + 2 >= 5...
#include <bits/stdc++.h> using namespace std; int n, k; int ans; int p1 = 1 << 17; int p2 = 1 << 18; void solve(int x) { int a = p1 \| x; int b = p2 \| p1; cout << a << << b << << p2; } int main() { cin >> n >> k; if (n == 2 && k == 0) { cout << NO << endl; return...
#include <bits/stdc++.h> using namespace std; const int max_N = 2e5 + 10; const int l_N = 20; int st[l_N][max_N]; int lg[max_N]; int inp[max_N]; vector<int> bits[30]; int query_max(int i, int j); int main() { { int j = 0; for (int i = 0; i < max_N; ++i) { while ((1 << j) <= i) ...
#include <bits/stdc++.h> using namespace std; int num[1005]; char num0[1005]; int res1[1005]; int N; int query() { int res = 0; for (int i = 0; i < N; i++) { if (num[i] != 0) { res = 10; res += num[i]; } else if (num[i] == 0) { res = 10; } } return...
#include <bits/stdc++.h> using namespace std; const long long nax = 100001; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n; cin >> n; vector<int> a(n); for (auto& x : a) { cin >> x; } ...
#include <bits/stdc++.h> using namespace std; int x, n, p; int a[1005]; long double f[205][205][205]; int check(int m) { int s = 0; while (m % 2 == 0) { s++; m /= 2; } return s; } int main() { ios_base::sync_with_stdio(false); int i, j, k; long double xx, yy; ci...
#include <bits/stdc++.h> using namespace std; int tr[100001]; int sum(int ind) { int sum = 0; ind = ind + 1; while (ind) { sum += tr[ind]; ind -= ind & (-ind); } return sum; } void update(int ind, int val) { ++ind; while (ind <= 100000) { tr[ind] += val; ind...
#include <bits/stdc++.h> using namespace std; const int N = 2000000; const int mod = 998244353; int used[N][2]; int f[N][2]; bool ok[N]; int solve(int n, int k) { if (used[n][k]) { return f[n][k]; } if (!ok[n]) { return 0; } int last = 0; int m = n; int j = 0; f...
#include <bits/stdc++.h> using namespace std; int main() { int T; long long a, b, c; for (scanf( %d , &T); T; T--) { cin >> a >> b >> c; if (a >= c) { printf( -1 ); } else printf( 1 ); if (a * b > c) printf( %I64d n , b); else printf( -1 n ...
#include <bits/stdc++.h> using namespace std; template <class T> inline void upmax(T& a, T b) { if (a < b) a = b; } template <class T> inline void upmin(T& a, T b) { if (a > b) a = b; } const int maxn = 307; const int maxm = 100007; const int mod = 1000000007; const int inf = 0x7fffffff; ...
#include <bits/stdc++.h> using namespace std; const int MN = 52; const long long mod = 1e9 + 7; int N; long long dp[2][MN][MN][MN][MN]; vector<int> d; int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> N; d.resize(N); for (int i = 0; i < N; i++) { cin >> d[i]; } int...
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 10; int n, Q, pos; long long a[maxn], sum[maxn], x; long long tr[maxn << 2], tag[maxn << 2]; void pushup(int rt) { tr[rt] = max(tr[rt << 1], tr[rt << 1 \| 1]); } void build(int rt = 1, int l = 1, int r = n) { tag[rt] = 0; if (l ==...
#include <bits/stdc++.h> const long long mod = 1000000000; class V { public: long long a[2]; V(long long a0 = 0, long long a1 = 0) { a[0] = a0 % mod; a[1] = a1 % mod; } V operator+(const V &v) { return V(a[0] + v.a[0], a[1] + v.a[1]); } }; class M { public: long long a[2][2...
#include <bits/stdc++.h> int II() { int n; scanf( %d , &n); return n; } void II(int n) { printf( %d , n); } void IIn(int n) { printf( %d n , n); } void IIb(int n) { printf( %d , n); } long long int LL() { long long int n; scanf( %lld , &n); return n; } void LL(long long int n) {...
#include <bits/stdc++.h> using namespace std; int solve(vector<int> &v, int pow) { if (pow == 20) { for (int j : v) { if (j) return 40; } return 0; } bool fnd = false; for (int i = 0; i < v.size(); i++) { if (v[i] % (1 << (pow + 1))) { fnd = true; } ...
#include <bits/stdc++.h> using namespace std; using ll = long long; const ll maxc = 1000000, sz = maxc + 5, modint = 998244353; ll arrleq2[sz] = {}, arr1[sz] = {}, arr2[sz] = {}, arr3[sz] = {}; int main() { //ios_base::sync_with_stdio(0); cin.tie(0); arrleq2[0] = 1; ll sum = 0; ...
#include <bits/stdc++.h> using namespace std; int main(int argc, char** argv) { int t; cin >> t; while (t--) { long long int n, k; cin >> n >> k; long long int q = k / (n - 1); long long int r = k % (n - 1); if (r == 0) { cout << n * q - 1 << n ; } else { ...
#include <bits/stdc++.h> using namespace std; string res, s[100005], temp, given; int main() { std::ios_base::sync_with_stdio(false); cin.tie(NULL); int n, pos; bool valid = false; temp = <3 ; cin >> n; res = ; res += temp; for (int i = 0; i < n; i++) { cin >> s[i]; ...
#include <bits/stdc++.h> using namespace std; int ans, flag, a[20][300010], n, i, x, anx[20], as[20]; void dfs(int x, int y) { if (y >= ans) return; if (x < 2) { anx[1] = 0; if (a[x][0]) { y++; anx[1] = -1; } if (a[x][2]) { y++; anx[1] = 1; } ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); const long long inf = 1e9; long long n; cin >> n; vector<pair<long long, long long> > m(n); for (int i = 0; i < n; i++) cin >> m[i].first >> m[i].second; long long maxy = -inf, miny = inf, maxx = -in...
#include <bits/stdc++.h> using namespace std; int get() { char ch; while (ch = getchar(), (ch < 0 \|\| ch > 9 ) && ch != - ) ; if (ch == - ) { int s = 0; while (ch = getchar(), ch >= 0 && ch <= 9 ) s = s * 10 + ch - 0 ; return -s; } int s = ch - 0 ; while (ch ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 2097155; int n, mS; char s[MAXN], t[MAXN]; long long a[MAXN], b[MAXN], bt[MAXN]; inline void FWT_or(long long *F, int len, int typ) { for (int i = 0; i < n; ++i) { for (int S = 0; S < len; ++S) { if (S >> i & 1) { F[S...
#include <bits/stdc++.h> using namespace std; const int maxn = 200005; long long aa[maxn]; long long bb[maxn]; vector<long long> gou; int in[maxn << 2]; long long Z[maxn << 2]; set<long long> ans; int main() { int n; long long m; scanf( %d%lld , &n, &m); for (int i = 1; i <= n; ++i) sc...
#include <bits/stdc++.h> using namespace std; const int maxn = 1000 * 100 + 5; const long long inf = 9223372036854775807; int n, q, cnt, mark[3][maxn]; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; cin >> n >> q; for (int i = 1; i <= q; i++) { int x, y; ...
#include <bits/stdc++.h> using namespace std; int main(int argc, char* argv[]) { int n; scanf( %d , &n); int c1 = 0, c2 = 0; for (int i = 0; i < n; ++i) { int a; scanf( %d , &a); if (a == 1) ++c1; else ++c2; } int ans = min(c2, c1); c1 -= ans; ...
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const long long INF = 0x3f3f3f3f3f3f3f3fll; const int N = 1e4 + 10; const int M = 3e6 + 10; const int maxn = 1e6 + 10; const int mod = 1000173169; const double eps = 1e-10; const double pi = acos(-1.0); struct Tree { int n...
#include <bits/stdc++.h> using namespace std; long long read() { long long num = 0; int fix = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) fix = -1; ch = getchar(); } while (isdigit(ch)) { num = num * 10 + ch - 0 ; ch = getchar(); } return nu...
#include <bits/stdc++.h> using namespace std; char b[101]; char a[101][101]; int mark[101]; int main() { int n, m, s = 0; cin >> n >> m; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { cin >> a[i][j]; if (a[i][j] > b[j]) { b[j] = a[i][j]; } ...
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1.0); const int INF = 0x3f3f3f3f; const double eps = 1e-8; const int MAXN = 50 + 10; const int MOD = 29; const int dir[][2] = {{-1, 0}, {0, -1}, {1, 0}, {0, 1}}; int cases = 0; int vis[MAXN][MAXN], row, col; char mp[MAXN][MAXN]; ...
#include <bits/stdc++.h> const int MAX_N = 20; int n, k, t; int e[MAX_N + 1][MAX_N + 1]; int choosen[MAX_N + 1]; int mid; int cnt; void dfs(int x, int now_cost_sum) { if (x > n) { cnt++; return; } dfs(x + 1, now_cost_sum); for (int y = 1; y <= n && cnt < t; y++) { if (!ch...
#include <bits/stdc++.h> using namespace std; map<string, long long> mp; string S[1006]; long long cost[1006]; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; int N, i, j, k; cin >> N; mp[ A ] = 1e9; mp[ B ] = 1e9; mp[ C ] = 1e9; mp[ AB ] = 1e9; mp[...
#include <bits/stdc++.h> using namespace std; const int N = 1000010; const int MOD = 1e9 + 7; int n, m; vector<int> tmp; vector<int> g[N]; int cnt1[N]; int marked[N]; int f[N]; map<vector<int>, int> cnt; int product(int a, int b) { return (1ll * a * b) % MOD; } void mult(int &a, int b) { a = (1l...
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:1000000000 ) static long long m1[70][70]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); m1[0][0] = 1; for (int i = 1; i <= 30; ++i) { m1[i][0] = 1; for (int j = 1; j <= 30; ++j) m1[i][j] = m1[i - 1...
#include <bits/stdc++.h> using namespace std; int N, M; char in[2010][2010]; int deg[2010][2010]; pair<int, int> Q[4000010]; int QL, QR, FREE; int sft[4][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}}; int get(int x, int y) { if (x < 0 \|\| x >= N \|\| y < 0 \|\| y >= M) return * ; return in[x][y]; } vo...
#include <bits/stdc++.h> using namespace std; int i, a[1111], x, n, s, y, f1, f2; int main() { cin >> n; for (i = 0; i < n; i++) { cin >> x; if (x == 0 \|\| x == 100) a[++s] = x; else if (x < 10 && f1 == 0) a[++s] = x, f1 = 1; else if (x % 10 == 0 && f2 == 0) ...
#include <bits/stdc++.h> using namespace std; int n, p; int sum, mx; vector<int> ans; int32_t main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n; for (int i = (1); i <= (n); i++) { if (i == 1) { cin >> p; ans.push_back(1); sum += p; ...
#include <bits/stdc++.h> using namespace std; const int N = 1e4 + 9; struct Point { int col, id; int x, y; bool operator<(const Point& b) { if (x == b.x) return y < b.y; return x < b.x; } } p0, p[N * 2]; int cross(Point a, Point b, Point c) { return (b.x - a.x) * (c.y - a.y) - ...
#include <bits/stdc++.h> int main() { static long long N, K, b[1000000] = {}, n, i, t; for (scanf( %lld%lld , &N, &K), n = N, i = 900000; n; n /= 2, i++) n & 1 && (b[i]++, K--); if (K < 0) puts( No ); else { for (i = 999999; K >= b[i]; i--) if (b[i]) while (b[i]) b[...
#include <bits/stdc++.h> using namespace std; void factorize(long long v, std::map<long long, int> &result) { long long p = 2; while (v > 1 && p * p <= v) { int cnt = 0; while (v % p == 0) { cnt++; v /= p; } if (cnt > 0) { if (result.count(p) == 0) { ...
#include <bits/stdc++.h> using namespace std; int a[200000], b[200000], c[200000]; int main() { int n, i, j, max1 = -1; scanf( %d , &n); for (i = 0; i < n; i++) scanf( %d , &a[i]); b[0] = 1; for (i = 1; i < n; i++) { if (a[i] > a[i - 1]) { b[i] = b[i - 1] + 1; } else ...
#include <bits/stdc++.h> int main() { char x[205]; scanf( %s , x); for (int i = 0; i < strlen(x); i++) { if (x[i] == . ) { x[i] = 0 ; printf( %c , x[i]); } if (x[i] == - && x[i + 1] == . ) { x[i] = 1 ; printf( %c , x[i]); i = i + 1; } ...
#include <bits/stdc++.h> using namespace std; const int N = 200005; const int LOGN = 18; int n, q, p[N], stk[N], L[LOGN][N], R[LOGN][N]; long long a[N], b[N], LC[LOGN][N], RC[LOGN][N]; inline long long getdist(int u, int v) { long long ret = 0; for (int i = LOGN - 1; i >= 0; i--) if (R[i][u] <= v) { ...
#include <bits/stdc++.h> using namespace std; void __print(int x) { cout << x; } void __print(long x) { cout << x; } void __print(long long x) { cout << x; } void __print(unsigned x) { cout << x; } void __print(unsigned long x) { cout << x; } void __print(unsigned long long x) { cout << x; } void __prin...
#include <bits/stdc++.h> using namespace std; const int maxn = 450000 + 100; int n, k; vector<int> pos[maxn]; int a[maxn]; int b[maxn]; int v[maxn]; int main() { while (cin >> n >> k) { for (int i = 1; i <= n; i++) { cin >> a[i]; v[i] = a[i]; pos[i].push_back(0); ...
#include <bits/stdc++.h> using namespace std; string s; long long ans, i, l, n, d, m; int main() { cin >> n >> m; for (i = 1; i < n; i++) { cin >> s; } cin >> s; for (i = 1; i < s.size(); i++) { if (s[i] != s[i - 1]) ans++; } if (ans % 2 == 0) { ans /= 2; if (...
#include <bits/stdc++.h> using namespace std; template <class T> inline void input(T &x) { register char c = getchar(); x = 0; int neg = 0; for (; ((c < 48 \|\| c > 57) && c != - ); c = getchar()) ; if (c == - ) { neg = 1; c = getchar(); } for (; c > 47 && c < 58; c =...
#include <bits/stdc++.h> using namespace std; using lli = long long int; using pii = pair<int, int>; using vi = vector<int>; using vb = vector<bool>; using vvi = vector<vector<int>>; using vlli = vector<long long int>; using vpii = vector<pair<int, int>>; lli n, m, k, u, v, x, ans, curr, T; vlli c; ...
#include <bits/stdc++.h> using namespace std; long long n; void solve() { int m; cin >> n >> m; vector<string> a(n); for (int i = (0); i <= int(n - 1); i++) cin >> a[i]; if (n < 3) { cout << -1; return; } int ans = 0; vector<vector<int>> dp(n * m, vector<int>(4, 0)); ...
#include <bits/stdc++.h> using namespace std; int n, a[1111], f[1111]; int main() { cin >> n; for (int i = 0; i < n; ++i) cin >> a[i]; for (int day = 1000; day >= 1; --day) { for (int i = 0; i < n; ++i) f[i] = 0; f[0] = (day <= a[0]); for (int i = 1; i < n; ++i) { if (day > a...
#include <bits/stdc++.h> using namespace std; string str, queries[100010]; int n; unsigned long long values[10] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; unsigned long long length[10] = {10, 10, 10, 10, 10, 10, 10, 10, 10, 10}; int main() { cin >> str >> n; queries[0] = 0-> + str; for (int i = 0; i < ...
#include <bits/stdc++.h> using namespace std; int main() { int h, m; while (scanf( %d:%d , &h, &m) == 2) { int a; scanf( %d , &a); int t = (h * 60 + m + a) % (24 * 60); printf( %02d:%02d n , t / 60, t % 60); } }
#include <bits/stdc++.h> using namespace std; const int nax = 1000 * 1007; long long int revi(long long int i) { long long int rev = 0; while (i > 0) { rev = (rev * 10) + (i % 10); i = i / 10; } return rev; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)...
#include <bits/stdc++.h> using namespace std; int main() { int n; string str; cin >> n; for (int i = 0; i < n; i++) { cin >> str; sort(str.begin(), str.end()); for (int j = 0; j < str.size() - 1; j++) { if (str[j + 1] - str[j] != 1) { cout << NO <...
#include <bits/stdc++.h> using namespace std; const int maxn = 2 * 1000 * 100 + 100; long long nums[maxn]; long long ans = 0; long long cou[30]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) { cin >> nums[i]; cou[nums[i] + 10]++; } ans += (cou[0 + 10] * (cou[10] -...
#include <bits/stdc++.h> using namespace std; int main() { int l, r; cin >> l >> r; if (l == r) { cout << l << endl; return 0; } else { cout << 2 << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int const N = 8; char a[N][N + 1]; int d[N * N][N][N]; inline int in(int x) { return x >= 0 && x < N; } int main() { for (int i = 0; i < N; ++i) scanf( %s , a[i]); for (int i = 0; i < N; ++i) for (int j = 0; j < N; ++j) d[0][i][j] = (a[i][j] == M ...
#include <bits/stdc++.h> using namespace std; using LL = long long; using ULL = unsigned long long; using VI = vector<int>; using VL = vector<LL>; using PII = pair<int, int>; using PLL = pair<LL, LL>; void dout() { cerr << endl; } template <typename Head, typename... Tail> void dout(Head H, Tail... ...
#include <bits/stdc++.h> using namespace std; int main() { long long int t, n, i, min1, min2, max1, max2, a[10000], b[10000]; cin >> n; t = n; while (n--) { cin >> a[i] >> b[i]; i++; } max1 = a[0]; max2 = b[0]; min1 = a[0]; min2 = b[0]; for (i = 0; i < t; i++) { ...
#include <bits/stdc++.h> using namespace std; const int INF = 0x7f7f7f7f; const double EPS = 1e-8; int n, m; int ans[707][707][3]; bool used[707]; int start; void DFS(int v, int len = 0) { used[v] = true; for (int i = 0; i < n; i++) { if (ans[v][i][0] && !used[v]) { DFS(i, len + 1)...
#include <bits/stdc++.h> using namespace std; pair<long long, long long> sn[100005], sp[100005]; bool myfunction(pair<long long, long long> i, pair<long long, long long> j) { return (i.first > j.first); } int main() { int n, p, a, first = 0, second = 0; scanf( %d , &n); for (int i = 1; i <= n;...
#include <bits/stdc++.h> using namespace std; const int maxn = 1000010; const long long inf = (1ll << 58ll); int k, n, q; int ten[10] = {1, 10, 100, 1000, 10000, 100000}; long long F[7]; long long dp[maxn], g[7][maxn]; long long read() { long long s = 0, f = 1; char ch = getchar(); while (ch...
#include <bits/stdc++.h> using namespace std; int n, c[205], num = 1e9; vector<int> a, ans; void dfs(int n, vector<int> a, int d, int t) { if (n == 0) { if (d < num) { ans.clear(); num = d; for (int i = 0; i < d; i++) ans.push_back(c[i]); } return; } int m =...
#include <bits/stdc++.h> using namespace std; long long n, m, ans; int main() { scanf( %I64d%I64d , &n, &m); if (n > m) swap(n, m); if (n == 2) { if (m <= 2) ans = 0; else { ans = n * m; if (m == 3) ans -= 2; else if (m == 7) ans -= 2; ...
#include <bits/stdc++.h> using namespace std; int main() { int t, n, a, b, c, d; cin >> t; while (t--) { cin >> n >> a >> b >> c >> d; int rice_left = a - b; int rice_right = a + b; int packeg_left = c - d; int packeg_right = c + d; rice_left = n; rice_right =...
#include <bits/stdc++.h> using namespace std; template <class T1, class T2> ostream& operator<<(ostream& os, const pair<T1, T2>& p) { os << { << p.first << , << p.second << } ; return os; } template <class T> ostream& operator<<(ostream& os, const vector<T>& p) { os << [ ; int i = 0; ...
#include <bits/stdc++.h> using namespace std; int main() { int n, a[20000], i, j, s = 1; cin >> n; for (i = 0; i < n; i++) { cin >> a[i]; } for (i = 0; i < n; i++) { if (a[i] % 2) { printf( %d n , (s + a[i]) / 2); s *= -1; } else printf( %d n , a[i] / 2)...
#include <bits/stdc++.h> using namespace std; const long long INF = 1e18 + 1; const int INF_INT = 2e9 + 100; const long long POLTOS = 50; const long long SOTKA = 100; const long long P = 1e9 + 7; const long double eps = 1e-9; const long long base = 1000 * 1000 * 1000; const long long M = 3050; const...
#include <bits/stdc++.h> inline long long pow(long long a, long long b, long long mod) { long long ans = 1; a %= mod; for (; b; b >>= 1, a = a * a % mod) if (b & 1) ans = ans * a % mod; return ans; } struct Node { int L, R; mutable long long val; Node(int L, int R = -1, long long...
#include <bits/stdc++.h> using namespace std; long long a, b, c; int vis[12]; bool ok(long long mid, int x) { long long m = mid % 7; int day = x; long long res[5]; res[1] = mid / 7; res[2] = mid / 7; res[3] = mid / 7; res[1] = 3; res[2] = 2; res[3] *= 2; while (m--) { ...
#include <bits/stdc++.h> using namespace std; const int INF = 2000000000; using namespace std; template <typename A, typename B> string to_string(pair<A, B> p); template <typename A, typename B, typename C> string to_string(tuple<A, B, C> p); template <typename A, typename B, typename C, typename D> s...
#include <bits/stdc++.h> const double eps = 1e-7, PI = 3.1415926; const int N = 2e5 + 10; using namespace std; int n, q, m, k, x, y, a[N], mx = -1, mn = 1e9, sum, t; char c[N]; string s, s1, s2; map<pair<int, char>, int> mp; vector<int> vec; int main() { cin >> q; while (q--) { cin >> n;...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1005; const int INF = 0x3f3f3f3f; int a[MAXN]; int book[MAXN * 2]; int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 1; i <= m; i++) { int tmp; scanf( %d , &tmp); a[tmp] = 1; } queue<int> Q; mem...
#include <bits/stdc++.h> using namespace std; struct ring { int inside, outside, height; } rings[200000]; long long all, tot; bool cmp(ring a, ring b) { if (a.outside != b.outside) return a.outside < b.outside; return a.inside < b.inside; } int main() { int n; while (cin >> n) { ...
#include <bits/stdc++.h> const int max_N = 1000005; const int max_P = 100; const long double eps = 1e-9; int n, m, cnt; long double R, C, T[max_N], l_pos[max_N], r_pos[max_N]; long double coef[max_N][3]; std::vector<std::pair<long double, int> > Vec; int read() { char c = getchar(); int ans = 0;...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e4 + 10; int dp[maxn][40]; long long pw[maxn][40]; long long n; int dfs(int a, int b) { if (dp[a][b]) return dp[a][b]; if (pw[a][b] >= n) return dp[a][b] = 1; if (pw[a][2] >= n) { if ((n - a) % 2 == 0) return dp[a][b] ...
#include <bits/stdc++.h> using namespace std; long long int mod(long long int x) { return (((x) % 1000000007) + 1000000007) % 1000000007; } long long int mod1(long long int x, long long int m) { return (((x) % m) + m) % m; } long long int solve() { string s; cin >> s; long long int d = c...
#include <bits/stdc++.h> using namespace std; const long long MAXn = 1e5 + 100; const long long INF = 1e9 + 100; long long l, r = -INF, n, k, a[MAXn], p, ans, dp[MAXn], anss; signed main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n >> k; cin >> a[1]; for (lo...
#include <bits/stdc++.h> using namespace std; using ll = long long; const ll N = 1e6 + 233; struct node { ll x, y; node(ll x = 0, ll y = 0) : x(x), y(y) {} }; ll dist(node a, node b) { ll L = a.x - b.x; ll R = a.y - b.y; return L * L + R * R; } vector<node> v; vector<ll> ans; ll ...
#include <bits/stdc++.h> using namespace std; vector<long long> v[200005]; long long dp[200005][3]; long long f[200005]; long long g[200005]; const int mod = 998244353; void dfs(int p, int u) { for (auto x : v[u]) { if (x != p) { dfs(u, x); } } int l = v[u].size() - (p ? 1 ...
#include <bits/stdc++.h> using namespace std; inline long long read() { long long s = 0, w = 1; char ch = getchar(); for (; !isdigit(ch); ch = getchar()) if (ch == - ) w = -1; for (; isdigit(ch); ch = getchar()) s = (s << 1) + (s << 3) + (ch ^ 48); return s * w; } inline void print(lo...
#include <bits/stdc++.h> using namespace std; int n, a[102], b[102]; pair<int, int> dp[102][2 * 10002]; bool vis[102][2 * 10002]; pair<int, int> solve(int i, int diff) { if (i == n + 1) return diff >= 10000 ? pair<int, int>(0, 0) : pair<int, int>(1e9, 1e9); if (vis[i][diff]) return dp[i][diff]; ...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); long count[] = {0, 0, 0, 0}; long n; cin >> n; while (n--) { long x; cin >> x; count[x] += 1; } cout << min(min(count[1] + count[2], count[1] + count[3]), ...
#include <bits/stdc++.h> using namespace std; bool isPrime(long long int n) { for (long long int i = 2; i <= sqrt(n); i++) if (n % i == 0) return 0; return 1; } long long knap_0_1(long long wt[], long long val[], long long n, long long w) { long long kp[n + 1][w + 1]; for (long long i = 0;...
#include <bits/stdc++.h> using namespace std; long long n, m, t[200100], ll, rr, sum; double inv, res, f[200100], g[200100]; inline double calc(long long l, long long r) { while (ll > l) { --ll; inv += 1.0 / t[ll]; sum += t[ll]; res += inv * t[ll]; } while (rr < r) { ++...
#include <bits/stdc++.h> using namespace std; int n, x, y, z; pair<int, int> a[200005]; map<int, int> m, o; map<pair<int, int>, int> p; long long q; int main() { scanf( %d , &n); ; for (int i = 1; i <= n; i++) { scanf( %d , &a[i].first); ; scanf( %d , &a[i].second); ; ...
#include <bits/stdc++.h> const long long max9 = 10 + 1e9, max6 = 10 + 1e6, max12 = 10 + 1e12, max15 = 10 + 1e15; const long long min6 = -1 * max6, min9 = -1 * max9, min12 = -1 * max12, min15 = -1 * max15; const long long R = 7 + 1e9, NN = 10 + 1e5; using namespace std; int ...
#include <bits/stdc++.h> using namespace std; const int OO = int(1e6); bool dcmp(double a, double b) { return fabs(a - b) < 1e-8; } int Dcmp(long double a, long double b) { return fabs(a - b) <= 1e-8 ? 0 : a < b ? -1 : 1; } int gcd(int a, int b) { if (b == 0) return a; return gcd(b, a % b); } ...
#include <bits/stdc++.h> using namespace std; long long f(long long x) { return x * (x - 1) / 2; } vector<int> g[303]; int m1[303][303]; int m2[303][303]; int main() { int n, m, k; cin >> n >> m >> k; vector<int> a(k); vector<int> c(n + 1, 0); for (int i = 0; i < k; i++) { cin >> a...
#include <bits/stdc++.h> using namespace std; int main() { vector<long> v; long n, i, j, k; cin >> n; for (i = 0; i < n; i++) { long long a; cin >> a; v.push_back(a); } if (v[0] != v[n - 1]) { cout << n - 1; } else { i = n - 1; while (v[i] == v[0]) { ...
#include <bits/stdc++.h> using namespace std; vector<long long> adj[100001]; long long vis[100001]; long long level[100001]; long long nodes[100001]; void bfs(long long s) { queue<long long> q; q.push(s); vis[s] = 1; while (!q.empty()) { long long f = q.front(); q.pop(); fo...
#include <bits/stdc++.h> using namespace std; int32_t main() { long long t; cin >> t; while (t--) { long long a, b, c; cin >> a >> b >> c; if (a < c) cout << 1; else cout << -1; cout << ; if (c < a * b) cout << b; else cout << ...
#include <bits/stdc++.h> using namespace std; int dp[2100][2100] = {0}; int a[2100]; bool vis[2100][2100]; int main(int argc, const char* argv[]) { string s, p; cin >> s >> p; for (int i = 0; i < s.size(); ++i) { int tmp = 0; int l = 0; while (i + tmp < s.size() && l < p.size()) ...
#include <bits/stdc++.h> using namespace std; const int md = 998244353, MX = 2020; int n, it, cc, j, z, r, u[2][MX], c[2][MX], v[2][MX], st[MX], vst[MX], pw2[MX]; char s[MX]; bool ok; void dfs(int i, int j, int cur, int val) { u[i][j] = it; c[i][j] = cur; v[i][j] = val; if (i == 0) { i...
#include <bits/stdc++.h> using namespace std; template <typename T> using V = vector<T>; const long long mod = 1000000007; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); string s; V<V<size_t> > p[2]; p[0].resize(8); p[1].resize(8); for (__typeof(8) i = (0) - ((0) ...
#include <bits/stdc++.h> using namespace std; int d(int n) { if (!n) return 1; int d = 0; while (n) { d++; n /= 10; } return d; } int n, k, m; set<int> st; set<int>::iterator it; void prnt() { it = st.begin(); for (int i = 0; i < m; i++) { printf( %08d n , *it...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<string> rs; if (n == 1) { rs.push_back( a ); rs.push_back( a ); rs.push_back( b ); rs.push_back( b ); } else if (n == 2) { rs.push_back( aa ); rs.push_back( bb ); rs.push_...

#include <bits/stdc++.h> using namespace std; const double EPS = 1e-6; int H[1005]; int main() { int n, m, h; int l, r, x; int i, j; scanf( %d%d%d , &n, &h, &m); for (i = 1; i <= n; i++) H[i] = h; for (i = 0; i < m; i++) { scanf( %d%d%d , &l, &r, &x); for (j = l; j <= r; j++)...

#include <bits/stdc++.h> using namespace std; long long a[500006]; long long dp[500006]; long long vis[500006]; vector<long long> v[500006]; long long on; long long n, d, che; void dfs(long long root, long long parent) { vis[root] = 1; dp[root] = 1; for (auto it : v[root]) { if (!vis[i...

#include <bits/stdc++.h> using namespace std; inline long long ma(long long a, long long b) { return a > b ? a : b; } inline long long mi(long long a, long long b) { return a > b ? b : a; } template <typename Arg1> void __f(const char *name, Arg1 &&arg1) { cerr << name << : << arg1 << endl; } temp...

#include <bits/stdc++.h> using namespace std; const int maxn = 64; int n, m, r, a[maxn][maxn], dis[maxn]; int dp[maxn][maxn][maxn]; set<pair<int, int> > s; void dij(int v) { memset(dis, 127, sizeof dis); dis[v] = 0; s.insert(make_pair(dis[v], v)); while (s.size()) { v = s.begin()->seco...

#include <bits/stdc++.h> using namespace std; int a[100005], b[100005], c[100005]; class segtree { public: int seg[524288 * 2]; int lazy[524288 * 2]; void init() { for (int i = 0; i < 524288 * 2; i++) { seg[i] = 0; } } void lazy_evaluate(int x) { if (x * 2 + 2 >= 5...

#include <bits/stdc++.h> using namespace std; int n, k; int ans; int p1 = 1 << 17; int p2 = 1 << 18; void solve(int x) { int a = p1 | x; int b = p2 | p1; cout << a << << b << << p2; } int main() { cin >> n >> k; if (n == 2 && k == 0) { cout << NO << endl; return...

#include <bits/stdc++.h> using namespace std; const int max_N = 2e5 + 10; const int l_N = 20; int st[l_N][max_N]; int lg[max_N]; int inp[max_N]; vector<int> bits[30]; int query_max(int i, int j); int main() { { int j = 0; for (int i = 0; i < max_N; ++i) { while ((1 << j) <= i) ...

#include <bits/stdc++.h> using namespace std; int num[1005]; char num0[1005]; int res1[1005]; int N; int query() { int res = 0; for (int i = 0; i < N; i++) { if (num[i] != 0) { res *= 10; res += num[i]; } else if (num[i] == 0) { res *= 10; } } return...

#include <bits/stdc++.h> using namespace std; const long long nax = 100001; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n; cin >> n; vector<int> a(n); for (auto& x : a) { cin >> x; } ...

#include <bits/stdc++.h> using namespace std; int x, n, p; int a[1005]; long double f[205][205][205]; int check(int m) { int s = 0; while (m % 2 == 0) { s++; m /= 2; } return s; } int main() { ios_base::sync_with_stdio(false); int i, j, k; long double xx, yy; ci...

#include <bits/stdc++.h> using namespace std; int tr[100001]; int sum(int ind) { int sum = 0; ind = ind + 1; while (ind) { sum += tr[ind]; ind -= ind & (-ind); } return sum; } void update(int ind, int val) { ++ind; while (ind <= 100000) { tr[ind] += val; ind...

#include <bits/stdc++.h> using namespace std; const int N = 2000000; const int mod = 998244353; int used[N][2]; int f[N][2]; bool ok[N]; int solve(int n, int k) { if (used[n][k]) { return f[n][k]; } if (!ok[n]) { return 0; } int last = 0; int m = n; int j = 0; f...

#include <bits/stdc++.h> using namespace std; int main() { int T; long long a, b, c; for (scanf( %d , &T); T; T--) { cin >> a >> b >> c; if (a >= c) { printf( -1 ); } else printf( 1 ); if (a * b > c) printf( %I64d n , b); else printf( -1 n ...

#include <bits/stdc++.h> using namespace std; template <class T> inline void upmax(T& a, T b) { if (a < b) a = b; } template <class T> inline void upmin(T& a, T b) { if (a > b) a = b; } const int maxn = 307; const int maxm = 100007; const int mod = 1000000007; const int inf = 0x7fffffff; ...

#include <bits/stdc++.h> using namespace std; const int MN = 52; const long long mod = 1e9 + 7; int N; long long dp[2][MN][MN][MN][MN]; vector<int> d; int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> N; d.resize(N); for (int i = 0; i < N; i++) { cin >> d[i]; } int...

#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 10; int n, Q, pos; long long a[maxn], sum[maxn], x; long long tr[maxn << 2], tag[maxn << 2]; void pushup(int rt) { tr[rt] = max(tr[rt << 1], tr[rt << 1 | 1]); } void build(int rt = 1, int l = 1, int r = n) { tag[rt] = 0; if (l ==...

#include <bits/stdc++.h> const long long mod = 1000000000; class V { public: long long a[2]; V(long long a0 = 0, long long a1 = 0) { a[0] = a0 % mod; a[1] = a1 % mod; } V operator+(const V &v) { return V(a[0] + v.a[0], a[1] + v.a[1]); } }; class M { public: long long a[2][2...

#include <bits/stdc++.h> int II() { int n; scanf( %d , &n); return n; } void II(int n) { printf( %d , n); } void IIn(int n) { printf( %d n , n); } void IIb(int n) { printf( %d , n); } long long int LL() { long long int n; scanf( %lld , &n); return n; } void LL(long long int n) {...

#include <bits/stdc++.h> using namespace std; int solve(vector<int> &v, int pow) { if (pow == 20) { for (int j : v) { if (j) return 40; } return 0; } bool fnd = false; for (int i = 0; i < v.size(); i++) { if (v[i] % (1 << (pow + 1))) { fnd = true; } ...

#include <bits/stdc++.h> using namespace std; using ll = long long; const ll maxc = 1000000, sz = maxc + 5, modint = 998244353; ll arrleq2[sz] = {}, arr1[sz] = {}, arr2[sz] = {}, arr3[sz] = {}; int main() { //ios_base::sync_with_stdio(0); cin.tie(0); arrleq2[0] = 1; ll sum = 0; ...

#include <bits/stdc++.h> using namespace std; int main(int argc, char** argv) { int t; cin >> t; while (t--) { long long int n, k; cin >> n >> k; long long int q = k / (n - 1); long long int r = k % (n - 1); if (r == 0) { cout << n * q - 1 << n ; } else { ...

#include <bits/stdc++.h> using namespace std; string res, s[100005], temp, given; int main() { std::ios_base::sync_with_stdio(false); cin.tie(NULL); int n, pos; bool valid = false; temp = <3 ; cin >> n; res = ; res += temp; for (int i = 0; i < n; i++) { cin >> s[i]; ...

#include <bits/stdc++.h> using namespace std; int ans, flag, a[20][300010], n, i, x, anx[20], as[20]; void dfs(int x, int y) { if (y >= ans) return; if (x < 2) { anx[1] = 0; if (a[x][0]) { y++; anx[1] = -1; } if (a[x][2]) { y++; anx[1] = 1; } ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); const long long inf = 1e9; long long n; cin >> n; vector<pair<long long, long long> > m(n); for (int i = 0; i < n; i++) cin >> m[i].first >> m[i].second; long long maxy = -inf, miny = inf, maxx = -in...

#include <bits/stdc++.h> using namespace std; int get() { char ch; while (ch = getchar(), (ch < 0 || ch > 9 ) && ch != - ) ; if (ch == - ) { int s = 0; while (ch = getchar(), ch >= 0 && ch <= 9 ) s = s * 10 + ch - 0 ; return -s; } int s = ch - 0 ; while (ch ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 2097155; int n, mS; char s[MAXN], t[MAXN]; long long a[MAXN], b[MAXN], bt[MAXN]; inline void FWT_or(long long *F, int len, int typ) { for (int i = 0; i < n; ++i) { for (int S = 0; S < len; ++S) { if (S >> i & 1) { F[S...

#include <bits/stdc++.h> using namespace std; const int maxn = 200005; long long aa[maxn]; long long bb[maxn]; vector<long long> gou; int in[maxn << 2]; long long Z[maxn << 2]; set<long long> ans; int main() { int n; long long m; scanf( %d%lld , &n, &m); for (int i = 1; i <= n; ++i) sc...

#include <bits/stdc++.h> using namespace std; const int maxn = 1000 * 100 + 5; const long long inf = 9223372036854775807; int n, q, cnt, mark[3][maxn]; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; cin >> n >> q; for (int i = 1; i <= q; i++) { int x, y; ...

#include <bits/stdc++.h> using namespace std; int main(int argc, char* argv[]) { int n; scanf( %d , &n); int c1 = 0, c2 = 0; for (int i = 0; i < n; ++i) { int a; scanf( %d , &a); if (a == 1) ++c1; else ++c2; } int ans = min(c2, c1); c1 -= ans; ...

#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const long long INF = 0x3f3f3f3f3f3f3f3fll; const int N = 1e4 + 10; const int M = 3e6 + 10; const int maxn = 1e6 + 10; const int mod = 1000173169; const double eps = 1e-10; const double pi = acos(-1.0); struct Tree { int n...

#include <bits/stdc++.h> using namespace std; long long read() { long long num = 0; int fix = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) fix = -1; ch = getchar(); } while (isdigit(ch)) { num = num * 10 + ch - 0 ; ch = getchar(); } return nu...

#include <bits/stdc++.h> using namespace std; char b[101]; char a[101][101]; int mark[101]; int main() { int n, m, s = 0; cin >> n >> m; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { cin >> a[i][j]; if (a[i][j] > b[j]) { b[j] = a[i][j]; } ...

#include <bits/stdc++.h> using namespace std; const double PI = acos(-1.0); const int INF = 0x3f3f3f3f; const double eps = 1e-8; const int MAXN = 50 + 10; const int MOD = 29; const int dir[][2] = {{-1, 0}, {0, -1}, {1, 0}, {0, 1}}; int cases = 0; int vis[MAXN][MAXN], row, col; char mp[MAXN][MAXN]; ...

#include <bits/stdc++.h> const int MAX_N = 20; int n, k, t; int e[MAX_N + 1][MAX_N + 1]; int choosen[MAX_N + 1]; int mid; int cnt; void dfs(int x, int now_cost_sum) { if (x > n) { cnt++; return; } dfs(x + 1, now_cost_sum); for (int y = 1; y <= n && cnt < t; y++) { if (!ch...

#include <bits/stdc++.h> using namespace std; map<string, long long> mp; string S[1006]; long long cost[1006]; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; int N, i, j, k; cin >> N; mp[ A ] = 1e9; mp[ B ] = 1e9; mp[ C ] = 1e9; mp[ AB ] = 1e9; mp[...

#include <bits/stdc++.h> using namespace std; const int N = 1000010; const int MOD = 1e9 + 7; int n, m; vector<int> tmp; vector<int> g[N]; int cnt1[N]; int marked[N]; int f[N]; map<vector<int>, int> cnt; int product(int a, int b) { return (1ll * a * b) % MOD; } void mult(int &a, int b) { a = (1l...

#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:1000000000 ) static long long m1[70][70]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); m1[0][0] = 1; for (int i = 1; i <= 30; ++i) { m1[i][0] = 1; for (int j = 1; j <= 30; ++j) m1[i][j] = m1[i - 1...

#include <bits/stdc++.h> using namespace std; int N, M; char in[2010][2010]; int deg[2010][2010]; pair<int, int> Q[4000010]; int QL, QR, FREE; int sft[4][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}}; int get(int x, int y) { if (x < 0 || x >= N || y < 0 || y >= M) return * ; return in[x][y]; } vo...

#include <bits/stdc++.h> using namespace std; int i, a[1111], x, n, s, y, f1, f2; int main() { cin >> n; for (i = 0; i < n; i++) { cin >> x; if (x == 0 || x == 100) a[++s] = x; else if (x < 10 && f1 == 0) a[++s] = x, f1 = 1; else if (x % 10 == 0 && f2 == 0) ...

#include <bits/stdc++.h> using namespace std; int n, p; int sum, mx; vector<int> ans; int32_t main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n; for (int i = (1); i <= (n); i++) { if (i == 1) { cin >> p; ans.push_back(1); sum += p; ...

#include <bits/stdc++.h> using namespace std; const int N = 1e4 + 9; struct Point { int col, id; int x, y; bool operator<(const Point& b) { if (x == b.x) return y < b.y; return x < b.x; } } p0, p[N * 2]; int cross(Point a, Point b, Point c) { return (b.x - a.x) * (c.y - a.y) - ...

#include <bits/stdc++.h> int main() { static long long N, K, b[1000000] = {}, n, i, t; for (scanf( %lld%lld , &N, &K), n = N, i = 900000; n; n /= 2, i++) n & 1 && (b[i]++, K--); if (K < 0) puts( No ); else { for (i = 999999; K >= b[i]; i--) if (b[i]) while (b[i]) b[...

#include <bits/stdc++.h> using namespace std; void factorize(long long v, std::map<long long, int> &result) { long long p = 2; while (v > 1 && p * p <= v) { int cnt = 0; while (v % p == 0) { cnt++; v /= p; } if (cnt > 0) { if (result.count(p) == 0) { ...

#include <bits/stdc++.h> using namespace std; int a[200000], b[200000], c[200000]; int main() { int n, i, j, max1 = -1; scanf( %d , &n); for (i = 0; i < n; i++) scanf( %d , &a[i]); b[0] = 1; for (i = 1; i < n; i++) { if (a[i] > a[i - 1]) { b[i] = b[i - 1] + 1; } else ...

#include <bits/stdc++.h> int main() { char x[205]; scanf( %s , x); for (int i = 0; i < strlen(x); i++) { if (x[i] == . ) { x[i] = 0 ; printf( %c , x[i]); } if (x[i] == - && x[i + 1] == . ) { x[i] = 1 ; printf( %c , x[i]); i = i + 1; } ...

#include <bits/stdc++.h> using namespace std; const int N = 200005; const int LOGN = 18; int n, q, p[N], stk[N], L[LOGN][N], R[LOGN][N]; long long a[N], b[N], LC[LOGN][N], RC[LOGN][N]; inline long long getdist(int u, int v) { long long ret = 0; for (int i = LOGN - 1; i >= 0; i--) if (R[i][u] <= v) { ...

#include <bits/stdc++.h> using namespace std; void __print(int x) { cout << x; } void __print(long x) { cout << x; } void __print(long long x) { cout << x; } void __print(unsigned x) { cout << x; } void __print(unsigned long x) { cout << x; } void __print(unsigned long long x) { cout << x; } void __prin...

#include <bits/stdc++.h> using namespace std; const int maxn = 450000 + 100; int n, k; vector<int> pos[maxn]; int a[maxn]; int b[maxn]; int v[maxn]; int main() { while (cin >> n >> k) { for (int i = 1; i <= n; i++) { cin >> a[i]; v[i] = a[i]; pos[i].push_back(0); ...

#include <bits/stdc++.h> using namespace std; string s; long long ans, i, l, n, d, m; int main() { cin >> n >> m; for (i = 1; i < n; i++) { cin >> s; } cin >> s; for (i = 1; i < s.size(); i++) { if (s[i] != s[i - 1]) ans++; } if (ans % 2 == 0) { ans /= 2; if (...

#include <bits/stdc++.h> using namespace std; template <class T> inline void input(T &x) { register char c = getchar(); x = 0; int neg = 0; for (; ((c < 48 || c > 57) && c != - ); c = getchar()) ; if (c == - ) { neg = 1; c = getchar(); } for (; c > 47 && c < 58; c =...

#include <bits/stdc++.h> using namespace std; using lli = long long int; using pii = pair<int, int>; using vi = vector<int>; using vb = vector<bool>; using vvi = vector<vector<int>>; using vlli = vector<long long int>; using vpii = vector<pair<int, int>>; lli n, m, k, u, v, x, ans, curr, T; vlli c; ...

#include <bits/stdc++.h> using namespace std; long long n; void solve() { int m; cin >> n >> m; vector<string> a(n); for (int i = (0); i <= int(n - 1); i++) cin >> a[i]; if (n < 3) { cout << -1; return; } int ans = 0; vector<vector<int>> dp(n * m, vector<int>(4, 0)); ...

#include <bits/stdc++.h> using namespace std; int n, a[1111], f[1111]; int main() { cin >> n; for (int i = 0; i < n; ++i) cin >> a[i]; for (int day = 1000; day >= 1; --day) { for (int i = 0; i < n; ++i) f[i] = 0; f[0] = (day <= a[0]); for (int i = 1; i < n; ++i) { if (day > a...

#include <bits/stdc++.h> using namespace std; string str, queries[100010]; int n; unsigned long long values[10] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; unsigned long long length[10] = {10, 10, 10, 10, 10, 10, 10, 10, 10, 10}; int main() { cin >> str >> n; queries[0] = 0-> + str; for (int i = 0; i < ...

#include <bits/stdc++.h> using namespace std; int main() { int h, m; while (scanf( %d:%d , &h, &m) == 2) { int a; scanf( %d , &a); int t = (h * 60 + m + a) % (24 * 60); printf( %02d:%02d n , t / 60, t % 60); } }

#include <bits/stdc++.h> using namespace std; const int nax = 1000 * 1007; long long int revi(long long int i) { long long int rev = 0; while (i > 0) { rev = (rev * 10) + (i % 10); i = i / 10; } return rev; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)...

#include <bits/stdc++.h> using namespace std; int main() { int n; string str; cin >> n; for (int i = 0; i < n; i++) { cin >> str; sort(str.begin(), str.end()); for (int j = 0; j < str.size() - 1; j++) { if (str[j + 1] - str[j] != 1) { cout << NO <...

#include <bits/stdc++.h> using namespace std; const int maxn = 2 * 1000 * 100 + 100; long long nums[maxn]; long long ans = 0; long long cou[30]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) { cin >> nums[i]; cou[nums[i] + 10]++; } ans += (cou[0 + 10] * (cou[10] -...

#include <bits/stdc++.h> using namespace std; int main() { int l, r; cin >> l >> r; if (l == r) { cout << l << endl; return 0; } else { cout << 2 << endl; } return 0; }

#include <bits/stdc++.h> using namespace std; int const N = 8; char a[N][N + 1]; int d[N * N][N][N]; inline int in(int x) { return x >= 0 && x < N; } int main() { for (int i = 0; i < N; ++i) scanf( %s , a[i]); for (int i = 0; i < N; ++i) for (int j = 0; j < N; ++j) d[0][i][j] = (a[i][j] == M ...

#include <bits/stdc++.h> using namespace std; using LL = long long; using ULL = unsigned long long; using VI = vector<int>; using VL = vector<LL>; using PII = pair<int, int>; using PLL = pair<LL, LL>; void dout() { cerr << endl; } template <typename Head, typename... Tail> void dout(Head H, Tail... ...

#include <bits/stdc++.h> using namespace std; int main() { long long int t, n, i, min1, min2, max1, max2, a[10000], b[10000]; cin >> n; t = n; while (n--) { cin >> a[i] >> b[i]; i++; } max1 = a[0]; max2 = b[0]; min1 = a[0]; min2 = b[0]; for (i = 0; i < t; i++) { ...

#include <bits/stdc++.h> using namespace std; const int INF = 0x7f7f7f7f; const double EPS = 1e-8; int n, m; int ans[707][707][3]; bool used[707]; int start; void DFS(int v, int len = 0) { used[v] = true; for (int i = 0; i < n; i++) { if (ans[v][i][0] && !used[v]) { DFS(i, len + 1)...

#include <bits/stdc++.h> using namespace std; pair<long long, long long> sn[100005], sp[100005]; bool myfunction(pair<long long, long long> i, pair<long long, long long> j) { return (i.first > j.first); } int main() { int n, p, a, first = 0, second = 0; scanf( %d , &n); for (int i = 1; i <= n;...

#include <bits/stdc++.h> using namespace std; const int maxn = 1000010; const long long inf = (1ll << 58ll); int k, n, q; int ten[10] = {1, 10, 100, 1000, 10000, 100000}; long long F[7]; long long dp[maxn], g[7][maxn]; long long read() { long long s = 0, f = 1; char ch = getchar(); while (ch...

#include <bits/stdc++.h> using namespace std; int n, c[205], num = 1e9; vector<int> a, ans; void dfs(int n, vector<int> a, int d, int t) { if (n == 0) { if (d < num) { ans.clear(); num = d; for (int i = 0; i < d; i++) ans.push_back(c[i]); } return; } int m =...

#include <bits/stdc++.h> using namespace std; long long n, m, ans; int main() { scanf( %I64d%I64d , &n, &m); if (n > m) swap(n, m); if (n == 2) { if (m <= 2) ans = 0; else { ans = n * m; if (m == 3) ans -= 2; else if (m == 7) ans -= 2; ...

#include <bits/stdc++.h> using namespace std; int main() { int t, n, a, b, c, d; cin >> t; while (t--) { cin >> n >> a >> b >> c >> d; int rice_left = a - b; int rice_right = a + b; int packeg_left = c - d; int packeg_right = c + d; rice_left *= n; rice_right *=...

#include <bits/stdc++.h> using namespace std; template <class T1, class T2> ostream& operator<<(ostream& os, const pair<T1, T2>& p) { os << { << p.first << , << p.second << } ; return os; } template <class T> ostream& operator<<(ostream& os, const vector<T>& p) { os << [ ; int i = 0; ...

#include <bits/stdc++.h> using namespace std; int main() { int n, a[20000], i, j, s = 1; cin >> n; for (i = 0; i < n; i++) { cin >> a[i]; } for (i = 0; i < n; i++) { if (a[i] % 2) { printf( %d n , (s + a[i]) / 2); s *= -1; } else printf( %d n , a[i] / 2)...

#include <bits/stdc++.h> using namespace std; const long long INF = 1e18 + 1; const int INF_INT = 2e9 + 100; const long long POLTOS = 50; const long long SOTKA = 100; const long long P = 1e9 + 7; const long double eps = 1e-9; const long long base = 1000 * 1000 * 1000; const long long M = 3050; const...

#include <bits/stdc++.h> inline long long pow(long long a, long long b, long long mod) { long long ans = 1; a %= mod; for (; b; b >>= 1, a = a * a % mod) if (b & 1) ans = ans * a % mod; return ans; } struct Node { int L, R; mutable long long val; Node(int L, int R = -1, long long...

#include <bits/stdc++.h> using namespace std; long long a, b, c; int vis[12]; bool ok(long long mid, int x) { long long m = mid % 7; int day = x; long long res[5]; res[1] = mid / 7; res[2] = mid / 7; res[3] = mid / 7; res[1] *= 3; res[2] *= 2; res[3] *= 2; while (m--) { ...

#include <bits/stdc++.h> using namespace std; const int INF = 2000000000; using namespace std; template <typename A, typename B> string to_string(pair<A, B> p); template <typename A, typename B, typename C> string to_string(tuple<A, B, C> p); template <typename A, typename B, typename C, typename D> s...

#include <bits/stdc++.h> const double eps = 1e-7, PI = 3.1415926; const int N = 2e5 + 10; using namespace std; int n, q, m, k, x, y, a[N], mx = -1, mn = 1e9, sum, t; char c[N]; string s, s1, s2; map<pair<int, char>, int> mp; vector<int> vec; int main() { cin >> q; while (q--) { cin >> n;...

#include <bits/stdc++.h> using namespace std; const int MAXN = 1005; const int INF = 0x3f3f3f3f; int a[MAXN]; int book[MAXN * 2]; int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 1; i <= m; i++) { int tmp; scanf( %d , &tmp); a[tmp] = 1; } queue<int> Q; mem...

#include <bits/stdc++.h> using namespace std; struct ring { int inside, outside, height; } rings[200000]; long long all, tot; bool cmp(ring a, ring b) { if (a.outside != b.outside) return a.outside < b.outside; return a.inside < b.inside; } int main() { int n; while (cin >> n) { ...

#include <bits/stdc++.h> const int max_N = 1000005; const int max_P = 100; const long double eps = 1e-9; int n, m, cnt; long double R, C, T[max_N], l_pos[max_N], r_pos[max_N]; long double coef[max_N][3]; std::vector<std::pair<long double, int> > Vec; int read() { char c = getchar(); int ans = 0;...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e4 + 10; int dp[maxn][40]; long long pw[maxn][40]; long long n; int dfs(int a, int b) { if (dp[a][b]) return dp[a][b]; if (pw[a][b] >= n) return dp[a][b] = 1; if (pw[a][2] >= n) { if ((n - a) % 2 == 0) return dp[a][b] ...

#include <bits/stdc++.h> using namespace std; long long int mod(long long int x) { return (((x) % 1000000007) + 1000000007) % 1000000007; } long long int mod1(long long int x, long long int m) { return (((x) % m) + m) % m; } long long int solve() { string s; cin >> s; long long int d = c...

#include <bits/stdc++.h> using namespace std; const long long MAXn = 1e5 + 100; const long long INF = 1e9 + 100; long long l, r = -INF, n, k, a[MAXn], p, ans, dp[MAXn], anss; signed main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n >> k; cin >> a[1]; for (lo...

#include <bits/stdc++.h> using namespace std; using ll = long long; const ll N = 1e6 + 233; struct node { ll x, y; node(ll x = 0, ll y = 0) : x(x), y(y) {} }; ll dist(node a, node b) { ll L = a.x - b.x; ll R = a.y - b.y; return L * L + R * R; } vector<node> v; vector<ll> ans; ll ...

#include <bits/stdc++.h> using namespace std; vector<long long> v[200005]; long long dp[200005][3]; long long f[200005]; long long g[200005]; const int mod = 998244353; void dfs(int p, int u) { for (auto x : v[u]) { if (x != p) { dfs(u, x); } } int l = v[u].size() - (p ? 1 ...

#include <bits/stdc++.h> using namespace std; inline long long read() { long long s = 0, w = 1; char ch = getchar(); for (; !isdigit(ch); ch = getchar()) if (ch == - ) w = -1; for (; isdigit(ch); ch = getchar()) s = (s << 1) + (s << 3) + (ch ^ 48); return s * w; } inline void print(lo...

#include <bits/stdc++.h> using namespace std; int n, a[102], b[102]; pair<int, int> dp[102][2 * 10002]; bool vis[102][2 * 10002]; pair<int, int> solve(int i, int diff) { if (i == n + 1) return diff >= 10000 ? pair<int, int>(0, 0) : pair<int, int>(1e9, 1e9); if (vis[i][diff]) return dp[i][diff]; ...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); long count[] = {0, 0, 0, 0}; long n; cin >> n; while (n--) { long x; cin >> x; count[x] += 1; } cout << min(min(count[1] + count[2], count[1] + count[3]), ...

#include <bits/stdc++.h> using namespace std; bool isPrime(long long int n) { for (long long int i = 2; i <= sqrt(n); i++) if (n % i == 0) return 0; return 1; } long long knap_0_1(long long wt[], long long val[], long long n, long long w) { long long kp[n + 1][w + 1]; for (long long i = 0;...

#include <bits/stdc++.h> using namespace std; long long n, m, t[200100], ll, rr, sum; double inv, res, f[200100], g[200100]; inline double calc(long long l, long long r) { while (ll > l) { --ll; inv += 1.0 / t[ll]; sum += t[ll]; res += inv * t[ll]; } while (rr < r) { ++...

#include <bits/stdc++.h> using namespace std; int n, x, y, z; pair<int, int> a[200005]; map<int, int> m, o; map<pair<int, int>, int> p; long long q; int main() { scanf( %d , &n); ; for (int i = 1; i <= n; i++) { scanf( %d , &a[i].first); ; scanf( %d , &a[i].second); ; ...

#include <bits/stdc++.h> const long long max9 = 10 + 1e9, max6 = 10 + 1e6, max12 = 10 + 1e12, max15 = 10 + 1e15; const long long min6 = -1 * max6, min9 = -1 * max9, min12 = -1 * max12, min15 = -1 * max15; const long long R = 7 + 1e9, NN = 10 + 1e5; using namespace std; int ...

#include <bits/stdc++.h> using namespace std; const int OO = int(1e6); bool dcmp(double a, double b) { return fabs(a - b) < 1e-8; } int Dcmp(long double a, long double b) { return fabs(a - b) <= 1e-8 ? 0 : a < b ? -1 : 1; } int gcd(int a, int b) { if (b == 0) return a; return gcd(b, a % b); } ...

#include <bits/stdc++.h> using namespace std; long long f(long long x) { return x * (x - 1) / 2; } vector<int> g[303]; int m1[303][303]; int m2[303][303]; int main() { int n, m, k; cin >> n >> m >> k; vector<int> a(k); vector<int> c(n + 1, 0); for (int i = 0; i < k; i++) { cin >> a...

#include <bits/stdc++.h> using namespace std; int main() { vector<long> v; long n, i, j, k; cin >> n; for (i = 0; i < n; i++) { long long a; cin >> a; v.push_back(a); } if (v[0] != v[n - 1]) { cout << n - 1; } else { i = n - 1; while (v[i] == v[0]) { ...

#include <bits/stdc++.h> using namespace std; vector<long long> adj[100001]; long long vis[100001]; long long level[100001]; long long nodes[100001]; void bfs(long long s) { queue<long long> q; q.push(s); vis[s] = 1; while (!q.empty()) { long long f = q.front(); q.pop(); fo...

#include <bits/stdc++.h> using namespace std; int32_t main() { long long t; cin >> t; while (t--) { long long a, b, c; cin >> a >> b >> c; if (a < c) cout << 1; else cout << -1; cout << ; if (c < a * b) cout << b; else cout << ...

#include <bits/stdc++.h> using namespace std; int dp[2100][2100] = {0}; int a[2100]; bool vis[2100][2100]; int main(int argc, const char* argv[]) { string s, p; cin >> s >> p; for (int i = 0; i < s.size(); ++i) { int tmp = 0; int l = 0; while (i + tmp < s.size() && l < p.size()) ...

#include <bits/stdc++.h> using namespace std; const int md = 998244353, MX = 2020; int n, it, cc, j, z, r, u[2][MX], c[2][MX], v[2][MX], st[MX], vst[MX], pw2[MX]; char s[MX]; bool ok; void dfs(int i, int j, int cur, int val) { u[i][j] = it; c[i][j] = cur; v[i][j] = val; if (i == 0) { i...

#include <bits/stdc++.h> using namespace std; template <typename T> using V = vector<T>; const long long mod = 1000000007; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); string s; V<V<size_t> > p[2]; p[0].resize(8); p[1].resize(8); for (__typeof(8) i = (0) - ((0) ...

#include <bits/stdc++.h> using namespace std; int d(int n) { if (!n) return 1; int d = 0; while (n) { d++; n /= 10; } return d; } int n, k, m; set<int> st; set<int>::iterator it; void prnt() { it = st.begin(); for (int i = 0; i < m; i++) { printf( %08d n , *it...