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() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; cin >> n; string a; cin >> a; if (n & 1) { cout << :( ; return 0; } int cnt1 = 1; int cnt2 = 1; if (a[0] == ) ) { cout << :( ; ...
#include <bits/stdc++.h> using namespace std; long long a, cnt; int fans = 1, r2; string b, c, d, n; struct Node { string s1; string s2; int jyh1 = -1; } nd[107]; int find(string x) { int ress = -1; for (int i = 0; i < cnt; i++) { if (nd[i].s1 == x) ress = i; } return res...
#include <bits/stdc++.h> using namespace std; long long n, m, x, a[3000], b[3000], qmi[3000], ymi[3000]; string s; int main() { iostream::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> n >> m; for (int i = 0; i < n; i++) { cin >> a[i + 1]; a[i + 1] += a[i]; } for (int j = 0;...
#include <bits/stdc++.h> using namespace std; int main() { long long i, n, k, sum = 0; bool flag = false; set<long long> S; scanf( %I64d%I64d , &n, &k); for (i = 1; i <= sqrt(n); i++) { if (n % i == 0) { S.insert(i); S.insert(n / i); } } if (S.size() >= k) fla...
#include <bits/stdc++.h> int n, m, seg[300005], lazy[300005], d[200005], l[200005], r[200005], q[200005]; bool b = 1; void update(int root, int lo, int hi, int l, int r, int val) { if (lazy[root]) { seg[root] \|= lazy[root]; if (lo ^ hi) { lazy[root * 2 + 1] \|= lazy[root]; lazy[root...
#include <bits/stdc++.h> using namespace std; const int MAX = 1e5 + 1; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int n; cin >> n; vector<long long int> v(n); for (int i = 0; i < n; i++) { cin >> v[i]; } long long int s, t; ...
#include <bits/stdc++.h> using namespace std; const double eps = 1e-8; const int mod = 1000000007; const double PI = acos(-1.0); int dx[4] = {0, 0, 1, -1}; int dy[4] = {1, -1, 0, 0}; int n, m; long long ans; int a[100005]; int b[2000]; int c[2000]; int main() { ios_base::sync_with_stdio(fals...
#include <bits/stdc++.h> using namespace std; int main() { int n; int ind = 0; vector<int> v; scanf( %d , &n); for (int i = 0; i < n; i++) { int temp; scanf( %d , &temp); v.push_back(temp); } sort(v.begin(), v.end()); for (int i = 0; i < n; i++) { if (v[i] - i...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10; const int maxm = 500 * 500 + 10; const int inf = 1e9; const long long mod = 1e9 + 7; int getint() { char c; while ((c = getchar()) && !(c >= 0 && c <= 9 ) && c != - ) ; int ret = c - 0 , sgn = 0; if (c == - ...
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; const long long N = 1e5 + 10; long long power(long long a, long long b) { long long ret = 1; while (b) { if (b & 1) ret = a; a = a; if (ret >= MOD) ret %= MOD; if (a >= MOD) a %= MOD; b >>= 1; ...
#include <bits/stdc++.h> using namespace std; bool G[100005]; bool use[100005]; int top[100005]; int Top[100005]; char R[100005]; int num[100005]; int main() { int m, n, Len = 0, useLen = 0; char str[10]; memset(G, true, sizeof(G)); memset(use, false, sizeof(use)); scanf( %d%d , &n, ...
#include <bits/stdc++.h> #pragma comment(linker, /stack:32000000 ) using namespace std; const int INF = 2147483647; const long long LLINF = 9223372036854775807LL; const int maxn = 300100; struct state { int len, link; map<char, int> next; int cnt[3]; state() { memset(cnt, 0, sizeof(cnt)); }...
#include <bits/stdc++.h> using namespace std; long long int modmulti(long long int a, long long int b, long long int m) { return ((a % m) * (b % m)) % m; } long long int gcd(long long int a, long long int b) { if (b == 0) return a; return gcd(b, a % b); } long long int power(long long int x, lon...
#include <bits/stdc++.h> using namespace std; const long long MAX = 2500000000; const int inf = 123456789; const double EPS = 1e-9; const double PI = 2 * asin(1.0); const long long mod = 1e9 + 7; int double_cmp(double x, double y = 0, double tol = EPS) { return (x <= y + tol) ? (x + tol < y) ? -1 : 0 ...
#include <bits/stdc++.h> using namespace std; int n; bool benar; string ans, st; int main() { scanf( %d , &n); vector<string> data; while (cin >> st) data.push_back(st); if (data[0] == int ) { if (data.size() == 1) printf( %s n , data[0].c_str()); else printf( Erro...
#include <bits/stdc++.h> using namespace std; long long int bexp(long long int a, long long int b, long long int mod) { long long int res = 1; while (b) { if (b & 1) res = (res * a) % mod; a = (a * a) % mod; b >>= 1; } return res; } long long int gcd(long long int a, long long ...
#include <bits/stdc++.h> using namespace std; float r, p, m; float a[100 * 1000]; int main() { cin >> m >> r; p = r * sqrt(2); a[0] = 2 * r; a[1] = 2 * r + p; for (int i = (2), _end = (m); i < _end; ++i) { a[i] = 2 * p; a[i] += 2 * r * (i - 1); } float sum = 0; sum +=...
#include <bits/stdc++.h> using namespace std; using lli = long long; using ld = long double; mt19937 rnd(time(nullptr)); lli GCD(lli a, lli b) { if (b == 0) return a; return GCD(b, a % b); } lli LCM(lli a, lli b) { return a / GCD(a, b) * b; } inline void Solve() { lli n = 0; cin >> n; ...
#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; const int P[] = {2, 3, 5, 7, 13, 17, 19, 31, 61, 89, 107, 127, 521, 607, 1279, 2203, 2281, 3217, 4253, 4...
#include <bits/stdc++.h> using namespace std; int main() { long long int n, m, k; cin >> n >> m >> k; long long int b[n]; memset(b, 0, sizeof(b)); vector<pair<long long int, long long int> > a; for (int i = 0; i < n; i++) { long long int x; cin >> x; a.push_back(make_pair(x...
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; vector<vector<pair<int, string> > > rg(m, vector<pair<int, string> >(1)); for (int i = 0; i < n; i++) { string sn; int r, s; cin >> sn; scanf( %d %d , &r, &s); rg[r - 1].push_back(make_p...
#include <bits/stdc++.h> using namespace std; const long long MOD = 1000000007; long long POW(long long a, long long b, long long MMM = MOD) { long long ret = 1; for (; b; b >>= 1, a = (a * a) % MMM) if (b & 1) ret = (ret * a) % MMM; return ret; } long long gcd(long long a, long long b) { re...
#include <bits/stdc++.h> using namespace std; int options[] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2}; int main(void) { string s; cin >> s; int total = 1; for (int i = 0; i < 2; ++i) { total *= options[s[i] - 0 ]; } cout << total << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int a[512]; int main() { int n, t; scanf( %d , &t); while (t--) { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); vector<int> ans; for (int i = 1; i <= n; i++) { for (int j = 1; j < n - 1; j++) { ...
#include <bits/stdc++.h> using namespace std; long long dx[] = {-1, -1, -1, 0, 0, 1, 1, 1}; long long dy[] = {-1, 0, 1, -1, 1, -1, 0, 1}; const long double pi = 3.141592653589; const long long mod = 1000000007; const long long maxn = 1e5 + 5; template <typename T> void printv(const vector<T>& v) { f...
#include <bits/stdc++.h> using namespace std; const int N = 100010; int n; struct Data { int s, id; bool operator<(const Data &a) const { return s < a.s; } } da[N]; int a[N], b[N]; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) { int s; scanf( %d , &s); da[i] =...
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; vector<pair<long long, long long> > arr; long long n = s.length(); for (int i = 0; i < n; i++) { for (int j = 1; i + (2 * j) < n; j++) { if (s[i] == s[i + j] && s[i] == s[i + (2 * j)]) { arr.pu...
#include <bits/stdc++.h> using namespace std; int main(int argc, const char* argv[]) { int n, maxf; cin >> n; int h[n]; for (int i = 0; i < n; i++) cin >> h[i]; maxf = h[n - 1]; h[n - 1] = 0; for (int i = n - 2; i >= 0; i--) { if (h[i] > maxf) { maxf = h[i]; h[i] = ...
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10, mod = 998244353; int n, m, x, y; vector<int> e[2][N]; inline void adde(int x, int y, int o) { e[o][x].push_back(y); } inline int read() { char ch = getchar(); int x = 0, f = 1; while (ch < 0 \|\| ch > 9 ) { if (ch == -...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long t; cin >> t; while (t--) { int n, m; cin >> n >> m; vector<string> v(n); for (int i = 0; i < n; i++) cin >> v[i]; int c = 0; ...
#include <bits/stdc++.h> using namespace std; const double eps = 1e-6; const double INF = DBL_MAX; bool iszero(const double a) { return fabs(a) <= eps; } double sqr(const double a) { return a * a; } int sgn(const double a) { if (a < -eps) return -1; return (a > eps); } int cmp(const double a, co...
#include <bits/stdc++.h> using namespace std; string s; int g, t, n; int main() { cin >> n >> n; cin >> s; int l = s.size(); for (int i = 0; i < l; i++) { if (s[i] == T ) t = i; else if (s[i] == G ) g = i; } if (g < t) swap(g, t); int i; if ((g - t) ...
#include <bits/stdc++.h> using namespace std; vector<int> me; long long sum(long long x) { return (x * (x + 1)) / 2; } int main() { int k; string s; cin >> k >> s; for (int i = 0; i < s.size(); i++) { if (s[i] == 1 ) { me.push_back(i); } } long long ans = 0, cnt = 0,...
#include <bits/stdc++.h> using namespace std; void test_case() { const int N = 55; int n, x, y, m = 0; cin >> n; int arr[N][N] = {0}; map<int, pair<int, int>> pos; deque<int> ci, sally; vector<pair<pair<int, int>, pair<int, int>>> ans; for (int k = 0; k < n; ++k) { cin >> x; ...
#include <bits/stdc++.h> using namespace std; char str[210], in[10]; int cnt[10], r[10]; int main() { scanf( %s %s , in, str); int l = strlen(in); for (int i = 0; i < l; i++) { if (in[i] == 9 ) cnt[6]++; else if (in[i] == 5 ) cnt[2]++; else cnt[in[i] - 0 ...
#include <bits/stdc++.h> using namespace std; int main() { int n, r = 0; cin >> n; string s; cin >> s; for (int i = 0; i < n - 1; i++) { if (s[i] == s[i + 1]) r++; } cout << r; return 0; }
#include<bits/stdc++.h> #include<iostream> #include<string> #include<cmath> #include<cstdio> #include<cctype> #include<cstring> #include<iomanip> #include<cstdlib> #include<ctime> #include<set> #include<map> #include<utility> #include<queue> #include<vector> #include<stack> #include<sstr...
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { while (a) b %= a, swap(a, b); return b; } char x[1000005], y[1000005]; int aux[1000005][26]; int main() { long long n, m; cin >> n >> m; scanf( %s %s , x, y); int lenx = strlen(x), leny = strlen(y...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:1000000000 ) #pragma GCC optimize( Ofast,no-stack-protector ) using namespace std; const int maxn = (int)3e5 + 10, mod = 998244353; int add(int x, int y) { x += y; if (x >= mod) { x -= mod; } return x; } int sub(int x, int y) {...
#include <bits/stdc++.h> using namespace std; void init() {} const int N = 1e6 + 34; const int INF = 1e9 + 34; vector<int> ans[2]; vector<int> es[N]; int n, m, v1, v2; int c[N]; void dfs(int v, int q) { if (c[v] && c[v] != q + 1) { cout << -1 ; exit(0); } if (c[v]) return; ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t = 1; while (t--) { int n; cin >> n; long long int a[n + 1]; int o = 0, idx, z = 0; long long int maxo = -1000000007; vector<int> v, v0; ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); string a = , b = , s1, s2; cin >> s1 >> s2; if (s1[0] == X ) a += s1[1]; else if (s1[1] == X ) a += s1[0]; else a += s1; if (s2[1] == X ) ...
#include <bits/stdc++.h> using namespace std; int min(int a, int b) { int min = a; if (b < a) { min = b; } return min; } int main() { int a, b, c, ans, min; cin >> a; cin >> b; cin >> c; if (a == 1 && b != 1 && c != 1) { ans = (a + b) * c; } else if (a != 1 &&...
#include <bits/stdc++.h> using namespace std; using ll = long long; template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) { os << p.first << << p.second; return os; } template <typename T> ostream& operator<<(ostream& os, const vector<T>& vec) { for (int i...
#include <bits/stdc++.h> using namespace std; const int dx[] = {0, 1, 0, -1}; const int dy[] = {1, 0, -1, 0}; 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 ) { ...
#include <bits/stdc++.h> using namespace std; char t[5][13] = { S , M , L , XL , XXL }; char s[13]; int a[5], p[] = {0, 1, -1, 2, -2, 3, -3, 4, -4}; int main() { for (int i = 0; i < (5); ++i) scanf( %d , &a[i]); int n; scanf( %d , &n); while (n--) { scanf( %s , s); int x = 0; ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 100010; int n, dp[MAXN], ans[MAXN], mx[4 * MAXN], lz[4 * MAXN]; vector<pair<int, int> > v, id; void refresh(int pos, int bg, int ed) { if (lz[pos] == 0) return; int LZ = lz[pos]; lz[pos] = 0; mx[pos] += LZ; if (bg == ed) return...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e3 + 20; const int MOD = 1e9 + 7; const int INF = 0x3f3f3f3f; const long long LLINF = 0x3f3f3f3f3f3f3f3f; const double PI = acos(-1.0); const double RATE = 0.995; const double eps = 1e-4; int arr[MAXN][MAXN]; signed main() { int n; ...
#include <bits/stdc++.h> using namespace std; void solve() { long long n; cin >> n; vector<pair<long long, long long>> ans; long long i = 0; long long j = 0; ans.push_back({0, -1}); ans.push_back({-1, 0}); ans.push_back({-1, -1}); for (long long k = 0; k < n; k++) { ans.pus...
#include <bits/stdc++.h> using namespace std; int main() { long long int n, k; cin >> n >> k; long long int prices[n]; for (long long int i = 0; i < n; i++) { cin >> prices[i]; } long long int minimum = prices[0]; long long int ans = 0; for (long long int i = 1; i < n; i++) { ...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; char a[N], b[N]; int n, T; int ans[N * 2], ct, rev; int rt, ch[N][2], fa[N], tg[N], col[N], sz[N]; int get(int x) { return ch[fa[x]][1] == x; } void pushdown(int x) { swap(ch[x][0], ch[x][1]), col[ch[x][0]] ^= 1, col[ch[x][1]] ^= ...
#include <bits/stdc++.h> using namespace std; constexpr int N = 2e5 + 10; int x, y; string cc; vector<string> s[10][10]; bool can(int a, int b) { for (auto i : s[a][b]) { for (auto j : i) if (j == . ) return true; } return false; } void color(int a, int b) { for (int i = 0...
#include <bits/stdc++.h> using namespace std; void ifree() { freopen( in , r , stdin); } void ofree() { freopen( out , w , stdout); } double min(double a, double b) { return a < b ? a : b; } int main() { int n, w; while (cin >> n >> w) { int arr[2 * n]; for (int i = 0; i < 2 * n; i++) ci...
#include <bits/stdc++.h> using namespace std; long long a[102], b[102]; long long cn[103]; int main() { long long n, m; cin >> n >> m; long long k; memset(a, -1, sizeof(a)); for (long long i = 1; i <= m; i++) for (long long j = 1; j <= n; j++) { cin >> k; if (k > a[i]) ...
#include <bits/stdc++.h> using namespace std; string input; int main() { cin >> input; int last = -1; for (char i = z ; i >= a ; i--) for (int j = last + 1; j < input.length(); j++) if (input[j] == i) { cout << input[j]; last = j; } return 0; }
#include <bits/stdc++.h> using namespace std; int n; int l[1 << 12]; int in[1 << 12]; int sm[1 << 12]; void go(int now) { if (now * 2 > ((1 << n) - 1)) return; int a = now * 2; int b = now * 2 + 1; go(a); go(b); int al = l[a] + in[a]; int bl = l[b] + in[b]; l[now] = max(al, b...
#include <bits/stdc++.h> using namespace std; int main() { string s, t, sum; cin >> s >> t; string n = to_string(stoi(s) + stoi(t)); s.erase(remove(s.begin(), s.end(), 0 ), s.end()); t.erase(remove(t.begin(), t.end(), 0 ), t.end()); n.erase(remove(n.begin(), n.end(), 0 ), n.end()); if...
#include <bits/stdc++.h> using namespace std; const int N = 1e6; const long long oo = 1e18; long long a[N], w[N], k, n, t, l[N], r[N], res; string s; vector<long long> b; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; for (int i = 1; i <= n; ++i) { cin >...
#include <bits/stdc++.h> using namespace std; void test() { string s; cin >> s; const int len = s.size(); stack<char> a; for (int i = 0; i < len; ++i) { if (a.empty()) { a.push(s[i]); } else if (s[i] == B ) { a.pop(); } else { a.push(s[i]); } ...
#include<bits/stdc++.h> using namespace std; #define ll long long int #define vi vector<int> #define vll vector<ll> /int gcd(int a,int b){ if(b==0) return a; else return gcd(b,a%b); } / void solve(){ int n; cin>>n; int a[n]; for(int i=0;i<n;i+...
#include <bits/stdc++.h> using namespace std; int main() { int n, x[100002] = {0}, j, t; cin >> n; t = n; for (int i = 0; i < n; i++) { cin >> j; x[j] = 1; while (t >= 1 && x[t] == 1) { cout << t << ; t--; } cout << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const long long N = 1e3 + 5; long long n, m, c, cur, loc; long long a[N]; void work() { long long lim = c / 2 + c % 2; if (cur > lim) { for (long long i = n; i >= 1; i--) { if (cur > a[i] \|\| !a[i]) { loc = i; return; ...
#include <bits/stdc++.h> using namespace std; static const double EPS = 1e-13; int ROUND(double x) { return (int)(x + 0.5); } bool ISINT(double x) { return fabs(ROUND(x) - x) <= EPS; } bool ISEQUAL(double x, double y) { return fabs(x - y) <= EPS * max(1.0, max(fabs(x), fabs(y))); } double SQSUM(double...
#include <bits/stdc++.h> using namespace std; int a[5]; int kiemtra(int x, int y, int z) { if (x < y + z && y < z + x && z < x + y) return 1; if (x == y + z \|\| y == x + z \|\| z == x + y) return 2; return 0; } void solve() { int i, j, k, x, gan; gan = 0; for (i = 0; i < 4; i++) for...
#include <bits/stdc++.h> using namespace std; int MAX(long long int a, long long int b) { if (a > b) { return a; } else { return b; } } int MIN(long long int a, long long int b) { if (a < b) { return a; } else { return b; } } int gcd(long long int a, long long...
#include <bits/stdc++.h> using namespace std; const int node_max = 3000; struct network { struct node { int v, c, w, b; node(int _v = 0, int _c = 0, int _w = 0, int _b = 0) : v(_v), c(_c), w(_w), b(_b) {} }; int n, pre[node_max]; vector<node> nd[node_max]; void clear() { ...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int a, b; cin >> a >> b; int c = 2 * min(a, b); int d = max(a, b); if (c > max(a, b)) { cout << c * c << endl; } else { cout << d * d << endl; } } r...
#include <bits/stdc++.h> using namespace std; int getint() { unsigned int c; int x = 0; while (((c = getchar()) - 0 ) >= 10) { if (c == - ) return -getint(); if (!~c) exit(0); } do { x = (x << 3) + (x << 1) + (c - 0 ); } while (((c = getchar()) - 0 ) < 10); return x...
#include <bits/stdc++.h> using namespace std; const int maxn = 2007; int n, m, a[maxn][maxn]; long long sr[maxn][maxn], sc[maxn][maxn], sumr[maxn], sumc[maxn], allsumr[maxn], allsumc[maxn]; int main() { scanf( %d %d , &n, &m); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { ...
#include <bits/stdc++.h> using namespace std; int v[100001]; int acum[100001]; long long cnt = 0, ans[100001]; struct Q { int i, j, p; Q(int a, int b, int c) : i(a), j(b), p(c){}; Q() {} bool operator<(const Q &other) const { if (i / 300 == other.i / 300) return j < other.j; return...
#include <bits/stdc++.h> using namespace std; int people[105]; int main() { int a, b, c; memset(people, 0, sizeof(people)); int n, m; scanf( %d%d , &n, &m); for (int i = 0; i < m; i++) { scanf( %d%d%d , &a, &b, &c); people[a] -= c; people[b] += c; } long long sum = 0;...
#include <bits/stdc++.h> using namespace std; bool check(vector<int>& v, int k, int val, int start) { vector<int> dp(v.size()); if (v[0] <= val && start == 0) { dp[0] = dp[1] = 1; } if (v[1] <= val) { dp[1] = 1; } for (int i = 2; i < v.size(); ++i) { dp[i] = dp[i - 1]; ...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 5; const int MOD = 1e9 + 7; inline int read() { int s = 0, f = 1; char ch = getchar(); while (ch < 0 \|\| ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { s = (s << 1) ...
#include <bits/stdc++.h> using namespace std; const long long MOD = (long long)1e9 + 7; const int N = 1e5 + 5, inf = 1e9 + 5; long long add(long long x, long long y) { x += y; if (x >= MOD) return x - MOD; return x; } long long sub(long long x, long long y) { x -= y; if (x < 0) return x ...
#include <bits/stdc++.h> using namespace std; const int IINF = 1e9; const long long LINF = 1e18; const int K = 1e5 + 5; const int KL = 1e6 + 5; int n; int a[505]; int mem[505][505]; bool tok[505]; int dp(int l, int r) { if (l == r) return 1; if (l > r) return 0; if (mem[l][r] != -1) retu...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; for (int i = 0; i < n * n / 2; i++) { cout << i + 1 << << n * n - i; if (2 * (i + 1) % n == 0) cout << endl; else cout << ; } return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10, mod = 1e9 + 7; int n, m, q, top, col, cnt, st[N], len[N], size[N], dfn[N], bl[N], son[N], S[N], w[N], T[N], low[N], bin[N], dep[N], f[N]; char sc[N][10]; vector<int> e[N], v[N]; int read() { int x = 0, f = 1; char c = getcha...
#include <bits/stdc++.h> using namespace std; int main() { long long n, k; cin >> n >> k; vector<long long> div; for (long long i = 1; i <= sqrt(n); i++) { if (n % i == 0) { if (n / i != i) { div.push_back(n / i); } div.push_back(i); } } sort(div...
#include <bits/stdc++.h> using namespace std; const int N = 107; const int M = 107 * 26; const int inf = (int)1e9 + 7; const long long base = (long long)1e18; const double pi = acos(-1); const double ep = 1e-18; int dp[107][M]; void solve() { dp[0][0] = 1; for (int i = 1; i < N; i++) { f...
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); int num; while (n--) { scanf( %d , &num); printf( %d n , num > 2 ? num - 2 : 0); } }
#include <bits/stdc++.h> using namespace std; int main() { int n, k; while (cin >> n >> k) { set<int> s; int l = 0, r = 0; int ans[200005]; int a; while (n--) { cin >> a; if (s.count(a)) { continue; } s.insert(a); ans[r++] = a; ...
#include <bits/stdc++.h> using namespace std; const double EPS = 1E-10; inline int cmp(double x, double y = 0, double tol = EPS) { return (x <= y + tol) ? (x + tol < y) ? -1 : 0 : 1; } char M[440][440]; int C[440][440]; int dy[] = {-1, 0, 1, 0}; int dx[] = {0, -1, 0, 1}; int main() { int N, K;...
#include <bits/stdc++.h> using namespace std; long long powi(long long base, int p) { long long res = 1; while (p--) res *= base; return res; } long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } bool is_vowel(char c) { c = tolower(c); return c == a \|\| c == e ...
#include <bits/stdc++.h> using namespace std; map<long, long> cmap; map<long, long>::iterator it; bool visit[200005]; long c[200005]; vector<long> graph[200005]; long res = 0, mac, counter; void DFS(long node); int main(void) { long long n, m, k, i, l, r, j; cin >> n >> m >> k; memset(visi...
#include <bits/stdc++.h> int f[2010][2010][2]; int n, m; int sr[2010][2010], sc[2010][2010]; int gr[2010], gc[2010]; int br[2010][2010], bc[2010][2010]; char s[2010][2010]; int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) scanf( %s , s[i] + 1); if (n == 1 && m == 1) return 0 * ...
#include <bits/stdc++.h> using namespace std; template <class T1, class T2> inline istream& operator>>(istream& fin, pair<T1, T2>& pr) { fin >> pr.first >> pr.second; return fin; } template <class T0, class T1, class T2> inline istream& operator>>(istream& fin, tuple<T0, T1, T2>& t) { fin >> get...
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 5; int head[maxn], deg[maxn], ans[maxn], tot = 1; struct edge { int v, nex, id; bool f; } e[maxn << 4]; void add(int u, int v, int id) { e[++tot] = {v, head[u], id, 0}, head[u] = tot; e[++tot] = {u, head[v], id, 0}, head[v]...
#include <bits/stdc++.h> using namespace std; string LexicographicallyMaximumSubsequence(string text) { string localMax = ; char current = text.at(text.length() - 1); localMax += current; unsigned int size = text.length() - 2; for (int i = size; i >= 0; i--) { if (text.at(i) >= current) ...
#include <bits/stdc++.h> int main() { long int n, c = 0, d = 0, e = 0, f = 0, t, i, j; scanf( %ld , &n); int a[n], b[n]; for (i = 1; i <= n; i++) { scanf( %d %d , &a[i], &b[i]); if (a[i] < 0) c++; else d++; } for (i = 1; i < n; i++) { for (j = i + 1; j <...
#include <bits/stdc++.h> using namespace std; struct Binode { Binode z, o; void init() { z = NULL; o = NULL; } } T; int n; long long a[100010], o[100010], s[70]; void add(long long x) { for (int i = 0; i < 61; i++) { s[i] = x & 1; x >>= 1; } Binode *p = &T; ...
#include <bits/stdc++.h> using namespace std; int n; vector<vector<int>> a; bool inp(int i, int j) { (i < n && j == n) && inp(i + 1, 0); (i < n && j < n) && (cin >> a[i][j]); (i < n && j < n) && (inp(i, j + 1)); return 0; } bool floyd(int k, int i, int j) { (k < n && i < n && j == n) && ...
#include <bits/stdc++.h> using namespace std; int T; long long n, m; inline long long Fin(long long w) { if (!w) return m * (m + 1) / 2; long long p = w / m, x = Fin(p), t = w % m; return m * ((m * m + 1) * p + m * t) + m * (m + 1) / 2 + max(0ll, min(m, (m * m + 1) * p + t * m + m - x + 1...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e3 + 5; bool adj1[MAXN][MAXN], adj2[MAXN][MAXN]; vector<pair<int, int> > ans1, ans2; int n; void comp1(int a, int b) { if (b - a == 1) return; for (int i = a + 1; i < b; ++i) { if (adj1[1][i] == 1) { comp1(a, i); c...
#include <bits/stdc++.h> using namespace std; long long parent[1000001]; long long result[1000005]; map<int, list<int>> g; long long getPoints(int p, int t) { return max((3 * p) / 10, (p - (p / 250) * t)); } struct Score { int p, t; }; bool chc(Score a, Score b) { if (a.p == b.p) { r...
#include <bits/stdc++.h> using namespace std; const int maxN = 1e5 + 7; int n, m; vector<tuple<int, int, int>> res; vector<pair<int, int>> g[maxN]; bool blocked[maxN]; bool solve(int v, int pr = -1) { vector<int> unpaired; vector<int> adj; for (auto& to : g[v]) { if (!blocked[to.second])...
#include <bits/stdc++.h> const int mod = 1e9 + 7; int n, m; inline long long ksm(register int y, register int p) { long long x = y, now = 1; while (p) { if (p & 1) now = now * x % mod; x = x * x % mod, p >>= 1; } return now; } int main() { scanf( %d%d , &n, &m); printf( %ll...
#include <bits/stdc++.h> using namespace std; int main(int argc, char** argv) { int n, x, p, min = 0, max = 1000; cin >> n >> x; p = x; for (int i = 0; i < n; i++) { int a, b; cin >> a >> b; if (a < b) { if ((p >= a) && (p <= b)) { if (a > min) min = a; ...
#include <bits/stdc++.h> using namespace std; vector<long long int> graph[250]; long long int n, a[250]; long long int visit[250]; long long int sol(long long int pos) { memset(visit, 0, sizeof(visit)); long long int ans = 0; long long int c = 0; while (c <= n) { long long int f = 0; ...
#include <bits/stdc++.h> using namespace std; const int MAX = 1000000; const int MAX_N = 50000; const int oo = 1e9; const int LOGN = 20; const int Z = 230; int f[MAX + 1], n, m, a[MAX_N], ans[MAX_N]; struct node { int nxt[2], val; multiset<int> mst; node() { memset(nxt, -1, sizeof nxt)...
#include <bits/stdc++.h> using namespace std; int n, m; int mat[505][505]; const int N = 3e5 + 10, C = 26, inf = 1e7; bool check(int i, int j) { if ((i - 1 > 0 \|\| i - 1 == 0) && mat[i - 1][j] == 1) { return 1; } if ((j - 1 > 0 \|\| j - 1 == 0) && mat[i][j - 1] == 1) { return 1; } ...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; cin >> n; string a; cin >> a; if (n & 1) { cout << :( ; return 0; } int cnt1 = 1; int cnt2 = 1; if (a[0] == ) ) { cout << :( ; ...

#include <bits/stdc++.h> using namespace std; long long a, cnt; int fans = 1, r2; string b, c, d, n; struct Node { string s1; string s2; int jyh1 = -1; } nd[107]; int find(string x) { int ress = -1; for (int i = 0; i < cnt; i++) { if (nd[i].s1 == x) ress = i; } return res...

#include <bits/stdc++.h> using namespace std; long long n, m, x, a[3000], b[3000], qmi[3000], ymi[3000]; string s; int main() { iostream::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> n >> m; for (int i = 0; i < n; i++) { cin >> a[i + 1]; a[i + 1] += a[i]; } for (int j = 0;...

#include <bits/stdc++.h> using namespace std; int main() { long long i, n, k, sum = 0; bool flag = false; set<long long> S; scanf( %I64d%I64d , &n, &k); for (i = 1; i <= sqrt(n); i++) { if (n % i == 0) { S.insert(i); S.insert(n / i); } } if (S.size() >= k) fla...

#include <bits/stdc++.h> int n, m, seg[300005], lazy[300005], d[200005], l[200005], r[200005], q[200005]; bool b = 1; void update(int root, int lo, int hi, int l, int r, int val) { if (lazy[root]) { seg[root] |= lazy[root]; if (lo ^ hi) { lazy[root * 2 + 1] |= lazy[root]; lazy[root...

#include <bits/stdc++.h> using namespace std; const int MAX = 1e5 + 1; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int n; cin >> n; vector<long long int> v(n); for (int i = 0; i < n; i++) { cin >> v[i]; } long long int s, t; ...

#include <bits/stdc++.h> using namespace std; const double eps = 1e-8; const int mod = 1000000007; const double PI = acos(-1.0); int dx[4] = {0, 0, 1, -1}; int dy[4] = {1, -1, 0, 0}; int n, m; long long ans; int a[100005]; int b[2000]; int c[2000]; int main() { ios_base::sync_with_stdio(fals...

#include <bits/stdc++.h> using namespace std; int main() { int n; int ind = 0; vector<int> v; scanf( %d , &n); for (int i = 0; i < n; i++) { int temp; scanf( %d , &temp); v.push_back(temp); } sort(v.begin(), v.end()); for (int i = 0; i < n; i++) { if (v[i] - i...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10; const int maxm = 500 * 500 + 10; const int inf = 1e9; const long long mod = 1e9 + 7; int getint() { char c; while ((c = getchar()) && !(c >= 0 && c <= 9 ) && c != - ) ; int ret = c - 0 , sgn = 0; if (c == - ...

#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; const long long N = 1e5 + 10; long long power(long long a, long long b) { long long ret = 1; while (b) { if (b & 1) ret *= a; a *= a; if (ret >= MOD) ret %= MOD; if (a >= MOD) a %= MOD; b >>= 1; ...

#include <bits/stdc++.h> using namespace std; bool G[100005]; bool use[100005]; int top[100005]; int Top[100005]; char R[100005]; int num[100005]; int main() { int m, n, Len = 0, useLen = 0; char str[10]; memset(G, true, sizeof(G)); memset(use, false, sizeof(use)); scanf( %d%d , &n, ...

#include <bits/stdc++.h> #pragma comment(linker, /stack:32000000 ) using namespace std; const int INF = 2147483647; const long long LLINF = 9223372036854775807LL; const int maxn = 300100; struct state { int len, link; map<char, int> next; int cnt[3]; state() { memset(cnt, 0, sizeof(cnt)); }...

#include <bits/stdc++.h> using namespace std; long long int modmulti(long long int a, long long int b, long long int m) { return ((a % m) * (b % m)) % m; } long long int gcd(long long int a, long long int b) { if (b == 0) return a; return gcd(b, a % b); } long long int power(long long int x, lon...

#include <bits/stdc++.h> using namespace std; const long long MAX = 2500000000; const int inf = 123456789; const double EPS = 1e-9; const double PI = 2 * asin(1.0); const long long mod = 1e9 + 7; int double_cmp(double x, double y = 0, double tol = EPS) { return (x <= y + tol) ? (x + tol < y) ? -1 : 0 ...

#include <bits/stdc++.h> using namespace std; int n; bool benar; string ans, st; int main() { scanf( %d , &n); vector<string> data; while (cin >> st) data.push_back(st); if (data[0] == int ) { if (data.size() == 1) printf( %s n , data[0].c_str()); else printf( Erro...

#include <bits/stdc++.h> using namespace std; long long int bexp(long long int a, long long int b, long long int mod) { long long int res = 1; while (b) { if (b & 1) res = (res * a) % mod; a = (a * a) % mod; b >>= 1; } return res; } long long int gcd(long long int a, long long ...

#include <bits/stdc++.h> using namespace std; float r, p, m; float a[100 * 1000]; int main() { cin >> m >> r; p = r * sqrt(2); a[0] = 2 * r; a[1] = 2 * r + p; for (int i = (2), _end = (m); i < _end; ++i) { a[i] = 2 * p; a[i] += 2 * r * (i - 1); } float sum = 0; sum +=...

#include <bits/stdc++.h> using namespace std; using lli = long long; using ld = long double; mt19937 rnd(time(nullptr)); lli GCD(lli a, lli b) { if (b == 0) return a; return GCD(b, a % b); } lli LCM(lli a, lli b) { return a / GCD(a, b) * b; } inline void Solve() { lli n = 0; cin >> n; ...

#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; const int P[] = {2, 3, 5, 7, 13, 17, 19, 31, 61, 89, 107, 127, 521, 607, 1279, 2203, 2281, 3217, 4253, 4...

#include <bits/stdc++.h> using namespace std; int main() { long long int n, m, k; cin >> n >> m >> k; long long int b[n]; memset(b, 0, sizeof(b)); vector<pair<long long int, long long int> > a; for (int i = 0; i < n; i++) { long long int x; cin >> x; a.push_back(make_pair(x...

#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; vector<vector<pair<int, string> > > rg(m, vector<pair<int, string> >(1)); for (int i = 0; i < n; i++) { string sn; int r, s; cin >> sn; scanf( %d %d , &r, &s); rg[r - 1].push_back(make_p...

#include <bits/stdc++.h> using namespace std; const long long MOD = 1000000007; long long POW(long long a, long long b, long long MMM = MOD) { long long ret = 1; for (; b; b >>= 1, a = (a * a) % MMM) if (b & 1) ret = (ret * a) % MMM; return ret; } long long gcd(long long a, long long b) { re...

#include <bits/stdc++.h> using namespace std; int options[] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2}; int main(void) { string s; cin >> s; int total = 1; for (int i = 0; i < 2; ++i) { total *= options[s[i] - 0 ]; } cout << total << endl; return 0; }

#include <bits/stdc++.h> using namespace std; int a[512]; int main() { int n, t; scanf( %d , &t); while (t--) { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); vector<int> ans; for (int i = 1; i <= n; i++) { for (int j = 1; j < n - 1; j++) { ...

#include <bits/stdc++.h> using namespace std; long long dx[] = {-1, -1, -1, 0, 0, 1, 1, 1}; long long dy[] = {-1, 0, 1, -1, 1, -1, 0, 1}; const long double pi = 3.141592653589; const long long mod = 1000000007; const long long maxn = 1e5 + 5; template <typename T> void printv(const vector<T>& v) { f...

#include <bits/stdc++.h> using namespace std; const int N = 100010; int n; struct Data { int s, id; bool operator<(const Data &a) const { return s < a.s; } } da[N]; int a[N], b[N]; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) { int s; scanf( %d , &s); da[i] =...

#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; vector<pair<long long, long long> > arr; long long n = s.length(); for (int i = 0; i < n; i++) { for (int j = 1; i + (2 * j) < n; j++) { if (s[i] == s[i + j] && s[i] == s[i + (2 * j)]) { arr.pu...

#include <bits/stdc++.h> using namespace std; int main(int argc, const char* argv[]) { int n, maxf; cin >> n; int h[n]; for (int i = 0; i < n; i++) cin >> h[i]; maxf = h[n - 1]; h[n - 1] = 0; for (int i = n - 2; i >= 0; i--) { if (h[i] > maxf) { maxf = h[i]; h[i] = ...

#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10, mod = 998244353; int n, m, x, y; vector<int> e[2][N]; inline void adde(int x, int y, int o) { e[o][x].push_back(y); } inline int read() { char ch = getchar(); int x = 0, f = 1; while (ch < 0 || ch > 9 ) { if (ch == -...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long t; cin >> t; while (t--) { int n, m; cin >> n >> m; vector<string> v(n); for (int i = 0; i < n; i++) cin >> v[i]; int c = 0; ...

#include <bits/stdc++.h> using namespace std; const double eps = 1e-6; const double INF = DBL_MAX; bool iszero(const double a) { return fabs(a) <= eps; } double sqr(const double a) { return a * a; } int sgn(const double a) { if (a < -eps) return -1; return (a > eps); } int cmp(const double a, co...

#include <bits/stdc++.h> using namespace std; string s; int g, t, n; int main() { cin >> n >> n; cin >> s; int l = s.size(); for (int i = 0; i < l; i++) { if (s[i] == T ) t = i; else if (s[i] == G ) g = i; } if (g < t) swap(g, t); int i; if ((g - t) ...

#include <bits/stdc++.h> using namespace std; vector<int> me; long long sum(long long x) { return (x * (x + 1)) / 2; } int main() { int k; string s; cin >> k >> s; for (int i = 0; i < s.size(); i++) { if (s[i] == 1 ) { me.push_back(i); } } long long ans = 0, cnt = 0,...

#include <bits/stdc++.h> using namespace std; void test_case() { const int N = 55; int n, x, y, m = 0; cin >> n; int arr[N][N] = {0}; map<int, pair<int, int>> pos; deque<int> ci, sally; vector<pair<pair<int, int>, pair<int, int>>> ans; for (int k = 0; k < n; ++k) { cin >> x; ...

#include <bits/stdc++.h> using namespace std; char str[210], in[10]; int cnt[10], r[10]; int main() { scanf( %s %s , in, str); int l = strlen(in); for (int i = 0; i < l; i++) { if (in[i] == 9 ) cnt[6]++; else if (in[i] == 5 ) cnt[2]++; else cnt[in[i] - 0 ...

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

#include<bits/stdc++.h> #include<iostream> #include<string> #include<cmath> #include<cstdio> #include<cctype> #include<cstring> #include<iomanip> #include<cstdlib> #include<ctime> #include<set> #include<map> #include<utility> #include<queue> #include<vector> #include<stack> #include<sstr...

#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { while (a) b %= a, swap(a, b); return b; } char x[1000005], y[1000005]; int aux[1000005][26]; int main() { long long n, m; cin >> n >> m; scanf( %s %s , x, y); int lenx = strlen(x), leny = strlen(y...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:1000000000 ) #pragma GCC optimize( Ofast,no-stack-protector ) using namespace std; const int maxn = (int)3e5 + 10, mod = 998244353; int add(int x, int y) { x += y; if (x >= mod) { x -= mod; } return x; } int sub(int x, int y) {...

#include <bits/stdc++.h> using namespace std; void init() {} const int N = 1e6 + 34; const int INF = 1e9 + 34; vector<int> ans[2]; vector<int> es[N]; int n, m, v1, v2; int c[N]; void dfs(int v, int q) { if (c[v] && c[v] != q + 1) { cout << -1 ; exit(0); } if (c[v]) return; ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t = 1; while (t--) { int n; cin >> n; long long int a[n + 1]; int o = 0, idx, z = 0; long long int maxo = -1000000007; vector<int> v, v0; ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); string a = , b = , s1, s2; cin >> s1 >> s2; if (s1[0] == X ) a += s1[1]; else if (s1[1] == X ) a += s1[0]; else a += s1; if (s2[1] == X ) ...

#include <bits/stdc++.h> using namespace std; int min(int a, int b) { int min = a; if (b < a) { min = b; } return min; } int main() { int a, b, c, ans, min; cin >> a; cin >> b; cin >> c; if (a == 1 && b != 1 && c != 1) { ans = (a + b) * c; } else if (a != 1 &&...

#include <bits/stdc++.h> using namespace std; using ll = long long; template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) { os << p.first << << p.second; return os; } template <typename T> ostream& operator<<(ostream& os, const vector<T>& vec) { for (int i...

#include <bits/stdc++.h> using namespace std; const int dx[] = {0, 1, 0, -1}; const int dy[] = {1, 0, -1, 0}; 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 ) { ...

#include <bits/stdc++.h> using namespace std; char t[5][13] = { S , M , L , XL , XXL }; char s[13]; int a[5], p[] = {0, 1, -1, 2, -2, 3, -3, 4, -4}; int main() { for (int i = 0; i < (5); ++i) scanf( %d , &a[i]); int n; scanf( %d , &n); while (n--) { scanf( %s , s); int x = 0; ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 100010; int n, dp[MAXN], ans[MAXN], mx[4 * MAXN], lz[4 * MAXN]; vector<pair<int, int> > v, id; void refresh(int pos, int bg, int ed) { if (lz[pos] == 0) return; int LZ = lz[pos]; lz[pos] = 0; mx[pos] += LZ; if (bg == ed) return...

#include <bits/stdc++.h> using namespace std; const int MAXN = 1e3 + 20; const int MOD = 1e9 + 7; const int INF = 0x3f3f3f3f; const long long LLINF = 0x3f3f3f3f3f3f3f3f; const double PI = acos(-1.0); const double RATE = 0.995; const double eps = 1e-4; int arr[MAXN][MAXN]; signed main() { int n; ...

#include <bits/stdc++.h> using namespace std; void solve() { long long n; cin >> n; vector<pair<long long, long long>> ans; long long i = 0; long long j = 0; ans.push_back({0, -1}); ans.push_back({-1, 0}); ans.push_back({-1, -1}); for (long long k = 0; k < n; k++) { ans.pus...

#include <bits/stdc++.h> using namespace std; int main() { long long int n, k; cin >> n >> k; long long int prices[n]; for (long long int i = 0; i < n; i++) { cin >> prices[i]; } long long int minimum = prices[0]; long long int ans = 0; for (long long int i = 1; i < n; i++) { ...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; char a[N], b[N]; int n, T; int ans[N * 2], ct, rev; int rt, ch[N][2], fa[N], tg[N], col[N], sz[N]; int get(int x) { return ch[fa[x]][1] == x; } void pushdown(int x) { swap(ch[x][0], ch[x][1]), col[ch[x][0]] ^= 1, col[ch[x][1]] ^= ...

#include <bits/stdc++.h> using namespace std; constexpr int N = 2e5 + 10; int x, y; string cc; vector<string> s[10][10]; bool can(int a, int b) { for (auto i : s[a][b]) { for (auto j : i) if (j == . ) return true; } return false; } void color(int a, int b) { for (int i = 0...

#include <bits/stdc++.h> using namespace std; void ifree() { freopen( in , r , stdin); } void ofree() { freopen( out , w , stdout); } double min(double a, double b) { return a < b ? a : b; } int main() { int n, w; while (cin >> n >> w) { int arr[2 * n]; for (int i = 0; i < 2 * n; i++) ci...

#include <bits/stdc++.h> using namespace std; long long a[102], b[102]; long long cn[103]; int main() { long long n, m; cin >> n >> m; long long k; memset(a, -1, sizeof(a)); for (long long i = 1; i <= m; i++) for (long long j = 1; j <= n; j++) { cin >> k; if (k > a[i]) ...

#include <bits/stdc++.h> using namespace std; string input; int main() { cin >> input; int last = -1; for (char i = z ; i >= a ; i--) for (int j = last + 1; j < input.length(); j++) if (input[j] == i) { cout << input[j]; last = j; } return 0; }

#include <bits/stdc++.h> using namespace std; int n; int l[1 << 12]; int in[1 << 12]; int sm[1 << 12]; void go(int now) { if (now * 2 > ((1 << n) - 1)) return; int a = now * 2; int b = now * 2 + 1; go(a); go(b); int al = l[a] + in[a]; int bl = l[b] + in[b]; l[now] = max(al, b...

#include <bits/stdc++.h> using namespace std; int main() { string s, t, sum; cin >> s >> t; string n = to_string(stoi(s) + stoi(t)); s.erase(remove(s.begin(), s.end(), 0 ), s.end()); t.erase(remove(t.begin(), t.end(), 0 ), t.end()); n.erase(remove(n.begin(), n.end(), 0 ), n.end()); if...

#include <bits/stdc++.h> using namespace std; const int N = 1e6; const long long oo = 1e18; long long a[N], w[N], k, n, t, l[N], r[N], res; string s; vector<long long> b; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; for (int i = 1; i <= n; ++i) { cin >...

#include <bits/stdc++.h> using namespace std; void test() { string s; cin >> s; const int len = s.size(); stack<char> a; for (int i = 0; i < len; ++i) { if (a.empty()) { a.push(s[i]); } else if (s[i] == B ) { a.pop(); } else { a.push(s[i]); } ...

#include<bits/stdc++.h> using namespace std; #define ll long long int #define vi vector<int> #define vll vector<ll> /*int gcd(int a,int b){ if(b==0) return a; else return gcd(b,a%b); } */ void solve(){ int n; cin>>n; int a[n]; for(int i=0;i<n;i+...

#include <bits/stdc++.h> using namespace std; int main() { int n, x[100002] = {0}, j, t; cin >> n; t = n; for (int i = 0; i < n; i++) { cin >> j; x[j] = 1; while (t >= 1 && x[t] == 1) { cout << t << ; t--; } cout << endl; } return 0; }

#include <bits/stdc++.h> using namespace std; const long long N = 1e3 + 5; long long n, m, c, cur, loc; long long a[N]; void work() { long long lim = c / 2 + c % 2; if (cur > lim) { for (long long i = n; i >= 1; i--) { if (cur > a[i] || !a[i]) { loc = i; return; ...

#include <bits/stdc++.h> using namespace std; static const double EPS = 1e-13; int ROUND(double x) { return (int)(x + 0.5); } bool ISINT(double x) { return fabs(ROUND(x) - x) <= EPS; } bool ISEQUAL(double x, double y) { return fabs(x - y) <= EPS * max(1.0, max(fabs(x), fabs(y))); } double SQSUM(double...

#include <bits/stdc++.h> using namespace std; int a[5]; int kiemtra(int x, int y, int z) { if (x < y + z && y < z + x && z < x + y) return 1; if (x == y + z || y == x + z || z == x + y) return 2; return 0; } void solve() { int i, j, k, x, gan; gan = 0; for (i = 0; i < 4; i++) for...

#include <bits/stdc++.h> using namespace std; int MAX(long long int a, long long int b) { if (a > b) { return a; } else { return b; } } int MIN(long long int a, long long int b) { if (a < b) { return a; } else { return b; } } int gcd(long long int a, long long...

#include <bits/stdc++.h> using namespace std; const int node_max = 3000; struct network { struct node { int v, c, w, b; node(int _v = 0, int _c = 0, int _w = 0, int _b = 0) : v(_v), c(_c), w(_w), b(_b) {} }; int n, pre[node_max]; vector<node> nd[node_max]; void clear() { ...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int a, b; cin >> a >> b; int c = 2 * min(a, b); int d = max(a, b); if (c > max(a, b)) { cout << c * c << endl; } else { cout << d * d << endl; } } r...

#include <bits/stdc++.h> using namespace std; int getint() { unsigned int c; int x = 0; while (((c = getchar()) - 0 ) >= 10) { if (c == - ) return -getint(); if (!~c) exit(0); } do { x = (x << 3) + (x << 1) + (c - 0 ); } while (((c = getchar()) - 0 ) < 10); return x...

#include <bits/stdc++.h> using namespace std; const int maxn = 2007; int n, m, a[maxn][maxn]; long long sr[maxn][maxn], sc[maxn][maxn], sumr[maxn], sumc[maxn], allsumr[maxn], allsumc[maxn]; int main() { scanf( %d %d , &n, &m); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { ...

#include <bits/stdc++.h> using namespace std; int v[100001]; int acum[100001]; long long cnt = 0, ans[100001]; struct Q { int i, j, p; Q(int a, int b, int c) : i(a), j(b), p(c){}; Q() {} bool operator<(const Q &other) const { if (i / 300 == other.i / 300) return j < other.j; return...

#include <bits/stdc++.h> using namespace std; int people[105]; int main() { int a, b, c; memset(people, 0, sizeof(people)); int n, m; scanf( %d%d , &n, &m); for (int i = 0; i < m; i++) { scanf( %d%d%d , &a, &b, &c); people[a] -= c; people[b] += c; } long long sum = 0;...

#include <bits/stdc++.h> using namespace std; bool check(vector<int>& v, int k, int val, int start) { vector<int> dp(v.size()); if (v[0] <= val && start == 0) { dp[0] = dp[1] = 1; } if (v[1] <= val) { dp[1] = 1; } for (int i = 2; i < v.size(); ++i) { dp[i] = dp[i - 1]; ...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 5; const int MOD = 1e9 + 7; inline int read() { int s = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { s = (s << 1) ...

#include <bits/stdc++.h> using namespace std; const long long MOD = (long long)1e9 + 7; const int N = 1e5 + 5, inf = 1e9 + 5; long long add(long long x, long long y) { x += y; if (x >= MOD) return x - MOD; return x; } long long sub(long long x, long long y) { x -= y; if (x < 0) return x ...

#include <bits/stdc++.h> using namespace std; const int IINF = 1e9; const long long LINF = 1e18; const int K = 1e5 + 5; const int KL = 1e6 + 5; int n; int a[505]; int mem[505][505]; bool tok[505]; int dp(int l, int r) { if (l == r) return 1; if (l > r) return 0; if (mem[l][r] != -1) retu...

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

#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10, mod = 1e9 + 7; int n, m, q, top, col, cnt, st[N], len[N], size[N], dfn[N], bl[N], son[N], S[N], w[N], T[N], low[N], bin[N], dep[N], f[N]; char sc[N][10]; vector<int> e[N], v[N]; int read() { int x = 0, f = 1; char c = getcha...

#include <bits/stdc++.h> using namespace std; int main() { long long n, k; cin >> n >> k; vector<long long> div; for (long long i = 1; i <= sqrt(n); i++) { if (n % i == 0) { if (n / i != i) { div.push_back(n / i); } div.push_back(i); } } sort(div...

#include <bits/stdc++.h> using namespace std; const int N = 107; const int M = 107 * 26; const int inf = (int)1e9 + 7; const long long base = (long long)1e18; const double pi = acos(-1); const double ep = 1e-18; int dp[107][M]; void solve() { dp[0][0] = 1; for (int i = 1; i < N; i++) { f...

#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); int num; while (n--) { scanf( %d , &num); printf( %d n , num > 2 ? num - 2 : 0); } }

#include <bits/stdc++.h> using namespace std; int main() { int n, k; while (cin >> n >> k) { set<int> s; int l = 0, r = 0; int ans[200005]; int a; while (n--) { cin >> a; if (s.count(a)) { continue; } s.insert(a); ans[r++] = a; ...

#include <bits/stdc++.h> using namespace std; const double EPS = 1E-10; inline int cmp(double x, double y = 0, double tol = EPS) { return (x <= y + tol) ? (x + tol < y) ? -1 : 0 : 1; } char M[440][440]; int C[440][440]; int dy[] = {-1, 0, 1, 0}; int dx[] = {0, -1, 0, 1}; int main() { int N, K;...

#include <bits/stdc++.h> using namespace std; long long powi(long long base, int p) { long long res = 1; while (p--) res *= base; return res; } long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } bool is_vowel(char c) { c = tolower(c); return c == a || c == e ...

#include <bits/stdc++.h> using namespace std; map<long, long> cmap; map<long, long>::iterator it; bool visit[200005]; long c[200005]; vector<long> graph[200005]; long res = 0, mac, counter; void DFS(long node); int main(void) { long long n, m, k, i, l, r, j; cin >> n >> m >> k; memset(visi...

#include <bits/stdc++.h> int f[2010][2010][2]; int n, m; int sr[2010][2010], sc[2010][2010]; int gr[2010], gc[2010]; int br[2010][2010], bc[2010][2010]; char s[2010][2010]; int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) scanf( %s , s[i] + 1); if (n == 1 && m == 1) return 0 * ...

#include <bits/stdc++.h> using namespace std; template <class T1, class T2> inline istream& operator>>(istream& fin, pair<T1, T2>& pr) { fin >> pr.first >> pr.second; return fin; } template <class T0, class T1, class T2> inline istream& operator>>(istream& fin, tuple<T0, T1, T2>& t) { fin >> get...

#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 5; int head[maxn], deg[maxn], ans[maxn], tot = 1; struct edge { int v, nex, id; bool f; } e[maxn << 4]; void add(int u, int v, int id) { e[++tot] = {v, head[u], id, 0}, head[u] = tot; e[++tot] = {u, head[v], id, 0}, head[v]...

#include <bits/stdc++.h> using namespace std; string LexicographicallyMaximumSubsequence(string text) { string localMax = ; char current = text.at(text.length() - 1); localMax += current; unsigned int size = text.length() - 2; for (int i = size; i >= 0; i--) { if (text.at(i) >= current) ...

#include <bits/stdc++.h> int main() { long int n, c = 0, d = 0, e = 0, f = 0, t, i, j; scanf( %ld , &n); int a[n], b[n]; for (i = 1; i <= n; i++) { scanf( %d %d , &a[i], &b[i]); if (a[i] < 0) c++; else d++; } for (i = 1; i < n; i++) { for (j = i + 1; j <...

#include <bits/stdc++.h> using namespace std; struct Binode { Binode *z, *o; void init() { z = NULL; o = NULL; } } T; int n; long long a[100010], o[100010], s[70]; void add(long long x) { for (int i = 0; i < 61; i++) { s[i] = x & 1; x >>= 1; } Binode *p = &T; ...

#include <bits/stdc++.h> using namespace std; int n; vector<vector<int>> a; bool inp(int i, int j) { (i < n && j == n) && inp(i + 1, 0); (i < n && j < n) && (cin >> a[i][j]); (i < n && j < n) && (inp(i, j + 1)); return 0; } bool floyd(int k, int i, int j) { (k < n && i < n && j == n) && ...

#include <bits/stdc++.h> using namespace std; int T; long long n, m; inline long long Fin(long long w) { if (!w) return m * (m + 1) / 2; long long p = w / m, x = Fin(p), t = w % m; return m * ((m * m + 1) * p + m * t) + m * (m + 1) / 2 + max(0ll, min(m, (m * m + 1) * p + t * m + m - x + 1...

#include <bits/stdc++.h> using namespace std; const int MAXN = 1e3 + 5; bool adj1[MAXN][MAXN], adj2[MAXN][MAXN]; vector<pair<int, int> > ans1, ans2; int n; void comp1(int a, int b) { if (b - a == 1) return; for (int i = a + 1; i < b; ++i) { if (adj1[1][i] == 1) { comp1(a, i); c...

#include <bits/stdc++.h> using namespace std; long long parent[1000001]; long long result[1000005]; map<int, list<int>> g; long long getPoints(int p, int t) { return max((3 * p) / 10, (p - (p / 250) * t)); } struct Score { int p, t; }; bool chc(Score a, Score b) { if (a.p == b.p) { r...

#include <bits/stdc++.h> using namespace std; const int maxN = 1e5 + 7; int n, m; vector<tuple<int, int, int>> res; vector<pair<int, int>> g[maxN]; bool blocked[maxN]; bool solve(int v, int pr = -1) { vector<int> unpaired; vector<int> adj; for (auto& to : g[v]) { if (!blocked[to.second])...

#include <bits/stdc++.h> const int mod = 1e9 + 7; int n, m; inline long long ksm(register int y, register int p) { long long x = y, now = 1; while (p) { if (p & 1) now = now * x % mod; x = x * x % mod, p >>= 1; } return now; } int main() { scanf( %d%d , &n, &m); printf( %ll...

#include <bits/stdc++.h> using namespace std; int main(int argc, char** argv) { int n, x, p, min = 0, max = 1000; cin >> n >> x; p = x; for (int i = 0; i < n; i++) { int a, b; cin >> a >> b; if (a < b) { if ((p >= a) && (p <= b)) { if (a > min) min = a; ...

#include <bits/stdc++.h> using namespace std; vector<long long int> graph[250]; long long int n, a[250]; long long int visit[250]; long long int sol(long long int pos) { memset(visit, 0, sizeof(visit)); long long int ans = 0; long long int c = 0; while (c <= n) { long long int f = 0; ...

#include <bits/stdc++.h> using namespace std; const int MAX = 1000000; const int MAX_N = 50000; const int oo = 1e9; const int LOGN = 20; const int Z = 230; int f[MAX + 1], n, m, a[MAX_N], ans[MAX_N]; struct node { int nxt[2], val; multiset<int> mst; node() { memset(nxt, -1, sizeof nxt)...

#include <bits/stdc++.h> using namespace std; int n, m; int mat[505][505]; const int N = 3e5 + 10, C = 26, inf = 1e7; bool check(int i, int j) { if ((i - 1 > 0 || i - 1 == 0) && mat[i - 1][j] == 1) { return 1; } if ((j - 1 > 0 || j - 1 == 0) && mat[i][j - 1] == 1) { return 1; } ...