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 n, k; int ok(double x, double a[]) { double z1 = 0, z2 = 0; for (int i = 0; i < n; i++) { if (x - a[i] > 0) { z1 += x - a[i]; } if (x - a[i] < 0) { double ans = 1 - (k * (double)1) / 100; z2 += (a[i] - x) * ans; ...
#include <bits/stdc++.h> #pragma GCC target( avx2 ) #pragma GCC optimize( O3 ) bool FLAG = 0; using namespace std; const long long MOD = (long long)1e9 + 7, N = (long long)2e6 + 222; const long long INF = (long long)1e18; long long dx[] = {0, -1, 0, 1, 0}; long long dy[] = {0, 0, 1, 0, -1}; long long ...
#include <bits/stdc++.h> using namespace std; vector<int> v[200005]; int t1[200005], t2[200005]; bool vis[200005]; int n, x, a, b; void dfs1(int step, int t) { t1[step] = t; vis[step] = true; for (int i = 0; i < v[step].size(); i++) { if (!vis[v[step][i]]) dfs1(v[step][i], t + 1); } ...
#include <bits/stdc++.h> using namespace std; int main() { int q; cin >> q; while (q--) { int n, k, temp; cin >> n >> k; set<int> s; for (int i = 0; i < n; i++) { cin >> temp; s.insert(temp); } set<int>::reverse_iterator it; int count = 0; ...
#include <bits/stdc++.h> #define int long long using namespace std; long long gcd(long long a, long long b) { if(!b) return a; return gcd(b, a % b); } long long lcm(long long a, long long b) { long long z = gcd(a, b); a /= z; if(a > 1e18 / b) return ...
#include <bits/stdc++.h> using namespace std; const int Nmax = 1000005, Mod = 1e9 + 7; const int Mod1 = 1e9 + 7, Mod2 = 1e9 + 9; char A[Nmax], B[Nmax]; int hash1[Nmax], hash2[Nmax]; int inv_hash1[Nmax], inv_hash2[Nmax]; int main() { ios::sync_with_stdio(false); int N, M; cin >> N >> M; cin...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); ; long long n, k; cin >> n >> k; vector<long long> v(n); for (int i = 0; i < n; i++) { cin >> v[i]; } long long ans = 0; unordered_map<int, int> m; for (int...
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; void yash() { int arr[4], count = 1; for (int i = 0; i < 4; i++) { cin >> arr[i]; } sort(arr, arr + 4); for (int i = 0; i < 3; i++) { if (arr[i] != arr[i + 1]) { count++; } } cout << 4 - co...
#include <bits/stdc++.h> using namespace std; int main() { long long int n, m, x; cin >> n >> m; x = m - n; if (x >= 2 && n % 2 == 0) cout << n << << n + 1 << << n + 2 << endl; else if (x >= 3 && n % 2 != 0) cout << n + 1 << << n + 2 << << n + 3 << endl; else ...
#include <bits/stdc++.h> using namespace std; const int N = 3000 + 5; int n, m; int l[N][N], r[N][N], cnt[N], fen[N]; char s[N][N]; vector<int> del[N]; void up(int x, int k) { cnt[x] += k; for (; x; x -= x & -x) fen[x] += k; } int get(int x) { int res = 0; for (; x < N; x += x & -x) re...
#include <bits/stdc++.h> using namespace std; int a[111111], b[111111]; vector<int> v; long long t[555][555]; int main() { int n; cin >> n; int r, c; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { cin >> t[i][j]; if (t[i][j] == 0) { r = i; ...
#include <bits/stdc++.h> char s[100001]; int a[100000]; int b[100000]; void func() { int n = strlen(s), i, ans = 1 << 29; if (isupper(s[0])) { a[0] = 0; } else { a[0] = 1; } for (i = 1; i < n; i++) { if (isupper(s[i])) { a[i] = a[i - 1]; } else { a[i] ...
#include <bits/stdc++.h> using namespace std; const int maxn = 300 + 10, mod = 1e9 + 7, INF = 0x3f3f3f3f; long long c[maxn][maxn], pw[2][maxn], f[maxn][maxn]; inline int add(long long a, long long b) { a += b; return a >= mod ? a - mod : a; } inline int mul(long long a, long long b) { return a * b %...
#include <bits/stdc++.h> using namespace std; const int INT_INF = 1e9; const long long LL_INF = 1e18; int getInt(char c) { return c - 0 ; } int getDistance(int index, int y, int z, vector<vector<int>>& last) { int p = last[index][y]; if (p == -1) return INT_INF; int q = last[p][z]; if (q == -...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(NULL); int n, tmp, ans = 0, mx = -1; cin >> n; for (int i = 0; i < n && cin >> tmp; ++i) mx = max(tmp, mx); cout << (mx > 25 ? mx - 25 : 0); }
#include <bits/stdc++.h> using namespace std; const int N = 212345, LG = 21, mod = 1000000007; const double eps = 1e-3, pi = acos(-1.0); int in[N]; vector<int> adj[N]; map<pair<int, int>, int> mp; set<pair<int, int>> s; int main() { int n, m; scanf( %d , &n), scanf( %d , &m); for (int i = 1;...
#include <bits/stdc++.h> using namespace std; const int A = 100000, MD = 998244353; int kk[A + 1]; int pp[A + 1][6][6], aa[6][6], tt[6][6]; int uu_[6], vv_[6], uu = uu_, vv = vv_; int kp[A + 1]; bool sq[A + 1]; void init(int *aa, int a0, int a1, int a2, int a3, int a4, int a5) { aa[0] = a0, aa[1] ...
#include <bits/stdc++.h> using namespace std; int n, K, p; char s[11]; int calc(int x, int y) { printf( 1 %d %d n , x, y); fflush(stdout); scanf( %s , s + 1); return s[1] == T ; } int find(int l, int r) { while (l < r) { int mid = (l + r) >> 1; if (calc(mid, mid + 1)) ...
#include <bits/stdc++.h> using namespace std; const int N = 1e4 + 100; int n, k; char str[N]; bool f[N]; int main() { scanf( %s , str + 1), n = strlen(str + 1); while (1 << k < n) ++k; if (1 << k > n) --k; memset(f, 1, sizeof(f)); for (int i = 1; i <= n - (1 << k) + 1; ++i) { char ...
#include <bits/stdc++.h> using namespace std; int main() { int l, r; cin >> l >> r; while (l <= r) { int arr[9] = {0}; int x = l; bool diff = 1; while (x) { int num = x % 10; x /= 10; if (arr[num]) { diff = 0; l++; break; ...
#include <bits/stdc++.h> using namespace std; string s, str; long long mns, all, pls, nom, maxi, mini, n, sum, otn; vector<char> v; vector<long long> ans; int main() { getline(cin, s); for (int i = 0; i < s.size(); i++) { if (s[i] == - ) mns++; if (s[i] == ? ) all++; if (s[i] == ...
#include <bits/stdc++.h> using namespace std; int main() { int m[] = {6, 2, 5, 5, 4, 5, 6, 3, 7, 6}; long a, b; cin >> a; cin >> b; int count = 0; int i; long x; do { x = a; while (x >= 10) { i = x % 10; count += m[i]; x /= 10; } count ...
#include <bits/stdc++.h> using namespace std; using ll = long long; ll cnt_inv[30][2]; void rec(vector<int>& a, int b) { if (b < 0 \|\| a.empty()) return; vector<int> s, us; for (int& i : a) { int val = i & (1 << b); if (val) cnt_inv[b][1] += us.size(), s.push_back(i); else ...
#include <bits/stdc++.h> using namespace std; namespace LYYY { int read() { int s = 0; char c = getchar(); int f = 1; while (c < 48 \|\| c > 57) { if (c == 45) f = -1; c = getchar(); } while (c >= 48 && c <= 57) s = (s << 3) + (s << 1) + (c ^ 48), c = getchar(); return s * f;...
#include <bits/stdc++.h> using namespace std; int arr[111]; int main() { int n; scanf( %d , &n); arr[0] = 0; for (int i = (1); i < (n + 1); ++i) scanf( %d , &arr[i]); int ans = 0; if (n % 2 == 0 \|\| n == 1) { printf( -1 n ); return 0; } for (int i = n; i >= 1; i -= 2) { ...
#include <bits/stdc++.h> using namespace std; struct msg { long long lstl = 0; long long lstr = 0; long long num = 0; }; int32_t main() { long long n, k; cin >> n >> k; long long a[n]; msg ms[n]; for (long long i = 0; i < n; i++) { cin >> a[i]; } for (long long i = ...
#include <bits/stdc++.h> using namespace std; const int maxn = (1 << 11); const int maxs = 27; string s[maxn]; vector<int> NextIn[maxn][maxs]; int NextOut[maxn][maxs], First[maxn][maxs], a[maxn]; pair<int, int> dp[maxn][maxn]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.t...
#include <bits/stdc++.h> using namespace std; long long int n, I; vector<long long int> vec; vector<long long int> comp; long long int K; int main() { scanf( %lld %lld , &n, &I); for (int i = 1; i <= n; i++) { long long int a; scanf( %lld , &a); vec.push_back(a); } K = 1 <<...
#include <bits/stdc++.h> using namespace std; const double pi = acos(-1.0); const int inf = 0x3f3f3f3f; const double eps = 1e-15; const long long INF = (1LL << 60); int cnt[1010]; int a[1010]; int M[1010]; int m; int dp[1010][1010][2]; int main() { int n, m, x; scanf( %d%d , &n, &m); m...
#include <bits/stdc++.h> using namespace std; mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count()); const int N = 200005; const int M = 1000000007; long long ast(long long x, long long n) { x %= M; long long ans = 1; while (n) { if (n % 2 == 1) ans = (ans * x) % M; x = (...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; for (int i = 1; i <= n; i++) { cout << 1 ; } cout << n ; } }
#include <bits/stdc++.h> using namespace std; int n, m, st[350005], dr[350005], grad[350005], bad[350005], l, order[350005], len; bool used[350005], stare[350005]; vector<int> L[350005]; vector<int>::iterator it[350005]; inline void add_edge(int x, int y) { ++m; L[x].push_back(m); L[y].pus...
#include <bits/stdc++.h> using namespace std; int main() { int R, C; cin >> R >> C; char m[R][C]; for (int i = 0; i < R; i++) for (int j = 0; j < C; j++) cin >> m[i][j]; for (int i = 0; i < R; i++) for (int j = 0; j < C; j++) { if (m[i][j] == S ) { if (i > 0) ...
#include <bits/stdc++.h> using namespace std; long long n, m; long long arr[200002], time_freq[101]; void solve() { long long total_time = 0; for (long long i = 0; i < n; i++) { long long exam_start_time = total_time + arr[i] - m; int student_removed = 0; if (exam_start_time > 0) { ...
#include <bits/stdc++.h> using namespace std; const double pi = acos(-1.0); map<int, int> mp; int main() { std::ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; int n, k, tmp = 1, mx = 0; cin >> n >> k; while (tmp <= k + 1) { int pos, x; cout << ? << ; f...
#include <bits/stdc++.h> using namespace std; int main() { int k[3]; while (cin >> k[0] >> k[1] >> k[2]) { bool flag = false; int one = 0, two = 0, three = 0, four = 0; for (int i = 0; i < 3; i++) { if (k[i] == 1) one++; if (k[i] == 2) two++; if (k[i] == 3) three++;...
#include <bits/stdc++.h> using namespace std; pair<int, int> tc[30]; bool dp[5][110][505]; int vis[5][110][505], n, k, Trow[30], kase, stx, sty; char mp[5][110]; bool solve(int x, int y, int mv) { if (x < 1 \|\| x > 3 \|\| y < 1) return 0; if (y > n) return 1; bool oc1 = 0, oc2 = 0, oc3 = 0; if ...
#include <bits/stdc++.h> #pragma GCC target( fma ) #pragma GCC optimize( unroll-loops,-Ofast ) using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); long long a[500005]; int n; set<long long> buck[1000]; long long c[1000]; void fix(int v) { int l = v * 700; ...
#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { if (a % b == 0) return b; else return gcd(b, a % b); } int main() { int n, m, an[120], am[120], fa = -1, fb = -1, f = 0, a, b; cin >> n >> m; for (int i = 0; i < n + 1; i++) { cin >> an[i]; if (f ==...
#include <bits/stdc++.h> using namespace std; const int step[8][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}, {1, 1}, {1, -1}, {-1, 1}, {-1, -1}}; template <class T> inline T abs1(T a) { return a < 0 ? -a : a; } const int maxn = 100110; template <class t> struct segment_node { ...
#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; n = (n * (n - 1)) / 2 + (((n * (n - 1)) / 2) * ((2 * n - 1))) / 3 - 2; cout << n << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int dp[100010]; int main() { int val90, val1440, n; cin >> n; dp[0] = 0; unsigned int ar[n + 10]; for (int i = 1; i <= n; i++) { cin >> ar[i]; } val1440 = val90 = 1; for (int i = 1; i <= n; i++) { while (ar[i] - ar[val1440] ...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10; const int maxlog = 24; int par[maxn][maxlog], h[maxn]; int siz[maxn]; bool mark[maxn]; int n; vector<int> adj[maxn]; void dfs(int x) { mark[x] = 1; for (int i = 0; i < adj[x].size(); i++) { int child = adj[x][i]; ...
#include <bits/stdc++.h> using namespace std; const int ALPHABETS = 30; const int maxN = 410; bitset<maxN> orig[ALPHABETS][maxN], ans[maxN]; int main() { ios::sync_with_stdio(false); cin.tie(0); int N, M; cin >> N >> M; string s; for (int i = 0; i < N; i++) { cin >> s; for ...
#include <bits/stdc++.h> int main() { int n; std::cin >> n; int t, c; int max = 0, cur = 0, lt = -1; for (int i = 0; i < n; i++) { std::cin >> t >> c; if (lt != -1) { cur += lt - t; } if (cur < 0) cur = 0; cur += c; if (cur > max) max = cur; lt = t...
#include <bits/stdc++.h> using namespace std; const int inf = 1e9 + 7; const int N = 230; const int M = 3500; int m, n; int a[N], b[N]; long long dp[M][N]; int main() { cin >> m >> n; memset(dp, 0, sizeof(dp)); for (int i = 0; i < m; ++i) { cin >> a[i] >> b[i]; dp[a[i]][i]++; ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 200100; int main() { int n = 0, u = 0, v = 0; int d[MAXN] = {0}; scanf( %d , &n); for (int i = 0; i < n - 1; i++) { scanf( %d %d , &u, &v); d[u] += 1; d[v] += 1; } for (int i = 1; i <= n; i++) { if (d[i]...
#include <bits/stdc++.h> using namespace std; long long x, y, n, c; bool check(long long t) { long long ans = 2 * t * t + 2 * t + 1; if (x + t > n) { long long m = x + t - n; ans -= m * m; } if (y + t > n) { long long m = y + t - n; ans -= m * m; } if (x <= t) { ...
#include <bits/stdc++.h> using namespace std; void gk() { ios_base::sync_with_stdio(0); cin.tie(0); std::cout.tie(0); } int64_t mul(int64_t a, int64_t b) { return (a * b) % (int64_t)1000000007; } int64_t gcd(int64_t a, int64_t b) { if (b == 0) { return a; } return gcd(b, a % b); ...
#include <bits/stdc++.h> using namespace std; int N, edge; pair<int, int> E[2][200002]; vector<int> V[2][200002]; int in[2][200002], out[2][200002]; bool S[2][200002], isdel[2][200002]; vector<pair<pair<int, int>, int> > ARBf[2][4 * 200002], ARBs[2][4 * 200002]; int Ap1, Ap2, Apv, Ax1, Ax2; vector<int...
#include <bits/stdc++.h> using namespace std; const int N = 200005; int cycl[N], set_val[N], cycl_size[N]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int h, m, n; cin >> h >> m >> n; vector<int> strt; bool vis[h]; memset(vis, false, sizeof vis); int kk = 0; ...
#include <bits/stdc++.h> int p[100005], q[100005], n, m, V; double a[100005], x[100005], y[100005], dx[100005], dy[100005], h, vx, vy, t, w; bool cmp1(const int i, const int j) { return a[i] < a[j]; } bool cmp2(const int i, const int j) { return x[i] < x[j]; } bool up(double t, double y) { return (h = vy * t ...
#include <bits/stdc++.h> using namespace std; int dx[] = {-1, 1, 0, 0, -1, -1, 1, 1}; int dy[] = {0, 0, 1, -1, -1, 1, -1, 1}; map<int, bool> ans; map<long long, int> dp; int rec(long long q) { if (ans[q] == 1) return dp[q]; vector<int> v; long long sq = sqrt(q); int mex, x; for (int l = ...
#include <bits/stdc++.h> using namespace std; int main() { int n, p = 0; cin >> n; int a[2 * n], i, j; for (i = 0; i < 2 * n; i++) cin >> a[i]; for (i = 0; i < 2 * n; i++) { if (a[i] == a[i + 1] && a[i] != -1) i = i + 1; else if (a[i] != -1) { for (j = i + 1; j < 2 * ...
#include <bits/stdc++.h> char num[10][10]; int main() { for (int i = 1; i < 9; i++) scanf( %s , num[i]); bool yes = true; for (int i = 1; i <= 8; i++) { int cntb = 0, cntw = 0; char pre = * ; for (int j = 0; j < 8; j++) { if (num[i][j] == pre) { yes = false; ...
#include <bits/stdc++.h> using namespace std; int a[100000]; int b[100001]; int c1[100001]; int c2[100001]; int main() { int n, c = 0, x = 0, y = 0, z1 = 0, z2 = 0, i; long long ans = 0; scanf( %d , &n); for (i = 0; i < n; i++) scanf( %d , &a[i]); for (i = 0; i < n; i++) { b[a[i]]+...
#include <bits/stdc++.h> using namespace std; struct hero { int power; int nr; }; int main() { int n, m; int board[100]; hero heroes[100]; vector<int> left, right; cin >> n >> m; for (int i = 0; i < n; ++i) heroes[i].nr = -1; int l_ind = n; int r_ind = -1; for (int si...
#include <bits/stdc++.h> using namespace std; const double PI = 3.14159265358979323846; const int N = 1e6 + 5; const long long MOD = 1000000007; int dx[] = {0, 1, 0, -1}; int dy[] = {1, 0, -1, 0}; bool cmp(const pair<int, int>& a, const pair<int, int>& b) { return (a.second < b.second); } int gcd(...
#include <bits/stdc++.h> using namespace std; ifstream in( input.txt ); ofstream out( output.txt ); int main() { vector<int> a; int n, x; cin >> n >> x; a.resize(100001); vector<int> b; for (int i = 0; i < n; i++) { int t; cin >> t; a[t]++; b.push_back(t); } ...
#include <bits/stdc++.h> #define ll long long #define nl n #define vpn 1000000 using namespace std; ll t,n,dismin; ll a[vpn],b[vpn]; ll gcd(ll x, ll y) { if (y==0) return x; return gcd(y,x%y); } int main() { ios::sync_with_stdio(0); cin.tie(0); cin>>t; while ...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); long long t = 0, i, j, n; long long arr[100002]; cin >> n; for (i = 0; i < n; ++i) { cin >> arr[i]; t += arr[i]; } if (t % (n - 1) == 0) { j = t / (n - 1); } else { j = t /...
#include <bits/stdc++.h> using namespace std; using ll = long long; using ii = pair<ll, ll>; inline int get_state(ll s, int x) { return ((s >> (5 * x)) & 0x1f); } inline ll set_state(ll s, ll v, int x) { return ((s & ~(0x1fLL << (5 * x))) \| (v << (5 * x))); } int cs[10]; map<ll, int> st; map<ll, i...
#include <bits/stdc++.h> using namespace std; void init() {} const int N = 63e5 + 34; const long long INF = 2e9 + 34; int MD = 30; string sym = AHIMOTUVWXYovwx ; void fail() { cout << NIE ; exit(0); } int main() { init(); string s; cin >> s; int n = s.length(); if (n % 2 ...
#include <bits/stdc++.h> using namespace std; const int maxn = 2000 + 5; const int MOD = 1000000000 + 7; int n, k; int a[maxn], e[maxn], s[maxn], t[maxn]; inline void mm(int a[], int b[]) { for (int i = 0; i < n; i++) { t[i] = 0; for (int j = 0; j <= i; j++) t[i] = ((long long)a[j] *...
#include <bits/stdc++.h> using namespace std; const int N = 200001; int cs1[N]; int cs2[N]; int ss1[N]; int ss2[N]; int sum(int i, int cs[]) { int s = 0; while (i > 0) { s += cs[i]; i -= i & -i; } return s; } void add(int i, int k, int cs[]) { while (i < N) { cs[i...
#include <bits/stdc++.h> using namespace std; int main() { int ans = 0, a, b, a2, b2; cin >> a >> b; while (((a != 0) and (b != 0))) { if ((a + b) <= 2) { cout << ans << endl; return 0; } if (2 * a <= b) { cout << ans + a << endl; return 0; } ...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:102400000,102400000 ) using namespace std; template <class T, class U> inline void Max(T &a, U b) { if (a < b) a = b; } template <class T, class U> inline void Min(T &a, U b) { if (a > b) a = b; } char s[3][105]; int ok[3][105], dp[105...
#include <bits/stdc++.h> #define modulus 1000000007 //for loops //------------------- #define for0(i, N) for (i = 0; i < (int) N; i++) #define for1(i, N) for (i = 1; i <= (int) N; i++) #define forr0(i, N) for (i = (int) N - 1; ~i; i--) #define forr1(i, N) for (i = (int) N; i; i--) #define foru(i, ...
#include <bits/stdc++.h> using namespace std; const long long int mod = 1000000000 + 7; const long long int N = 10000000 + 6; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int q; cin >> q; for (int i = 0; i < q; ++i) { long long n; cin >> n; vector<...
#include <bits/stdc++.h> using namespace std; using ll = long long; const bool MULTI_TESTCASES = 0; struct Query { int l, r, id; }; void solve() { int n, k; cin >> n >> k; vector<int> t(n + 1); for (int i = 1; i < n + 1; ++i) { cin >> t[i]; if (t[i] == 2) t[i] = -1; } ...
#include <bits/stdc++.h> using namespace std; int a[102]; int main() { int n, i, l, r, j; char name[100009]; cin >> n; scanf( %s , name); l = 0; r = 9; for (i = 0; i < n; i++) { if (name[i] == L ) for (j = 0; j < 10; j++) if (a[j] == 0) { a[j] = 1; ...
#include <bits/stdc++.h> #pragma optimize( , off) #pragma GCC optimize( Ofast,no-stack-protector,unroll-loops ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) #pragma comment(linker, /STACK:36777216 ) const int mod = 1000000007; using namespace std; template <class T> vo...
#include <bits/stdc++.h> const int N = 100000 + 1; struct Point { int x, y; Point(int x = 0, int y = 0) : x(x), y(y) {} Point &operator-=(const Point &o) { x -= o.x; y -= o.y; return *this; } int quadrant() const { if (y != 0) { return y > 0; } return ...
#include <bits/stdc++.h> const double eps = 1e-9; const double PI = acos(-1); const long long MOD = 1e9 + 7; using namespace std; vector<string> powers; pair<string, string> solution(string s) { string order; reverse(s.begin(), s.end()); map<char, int> mp; for (char c : s) { if (!mp[c]...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; string s; cin >> s; map<string, int> gram; for (int i = 0; i < n - 1; i++) ++gram[s.substr(i, 2)]; int cnt = 0; string ans = ; for (aut...
#include <bits/stdc++.h> using namespace std; const int N = (int)1e4 + 10; const int M = (int)1e9 + 7; int n, k; int mina, maxa; void track() { for (int i = (1); i <= (n); i++) { for (int j = (1); j <= (n); j++) { if (i == j) cout << k; else cout << 0; i...
#include <bits/stdc++.h> using namespace std; const int MAXN = 300005, N = 333333; const int D = 1e9 + 7, inv2 = 5e8 + 4; int n, Q, a[MAXN], mul[N + 233], inv[N + 233]; int val[MAXN << 1]; int id[MAXN], w[MAXN]; int tim, len; struct node { int v, id; node() {} node(int vv, int ii) { v = vv, ...
#include <bits/stdc++.h> using namespace std; const int N = 2e5; vector<int> g[N]; int mn[N]; int mx[N]; int ans; void dfs(int u, int p) { bool leaf = true; mn[u] = 1e9; mx[u] = -1e9; for (int v : g[u]) if (v != p) { dfs(v, u); leaf = false; mn[u] = min(mn[u],...
#include <bits/stdc++.h> using namespace std; bool found = false; int b, A[10000], orig_a; int main() { int a, b[3], i, j, n, x, y, z, array[100000]; cin >> n; for (i = 0; i < 3; i++) { if (i <= 1) { cout << ? << 1 << << i + 2 << endl; } else { cout << ? << 2 <<...
#include <bits/stdc++.h> using namespace std; const int max_n = 1111111, inf = 1000000007; int n, k, a[max_n], pw[max_n], used[max_n]; int main() { cin >> n >> k; if (k == 0) { long long ans = 1; for (int i = 1; i < n; ++i) { ans = (ans * n) % inf; } cout << ans << endl; ...
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; map<char, int> mp; for (int i = 0; i < s.length(); i++) { mp[s[i]]++; } int mn; set<int> st; set<int>::iterator it; st.insert(mp[ B ]); st.insert(mp[ u ] / 2); st.insert(mp[ l ]); st....
#include <bits/stdc++.h> using namespace std; char buf[11]; const int MAXC = 20; double C[MAXC][MAXC + 1]; void count(int &sum, int &q) { char buf[11]; cin >> buf; sum = 0; q = 0; for (char p = buf; p; ++p) { switch (*p) { case + : ++sum; break; ...
#include <bits/stdc++.h> using namespace std; struct Point { long double x, y; Point(){}; long double dist(Point b) { return sqrt((b.x - x) * (b.x - x) + (b.y - y) * (b.y - y)); } }; int main() { Point a, b, c; cin >> a.x >> a.y >> b.x >> b.y >> c.x >> c.y; long double k = a.di...
#include <bits/stdc++.h> int main() { int days, time, count, free; int x = 0; scanf( %d , &days); scanf( %d , &time); int busyTime[days]; for (x = 0; x < days; x++) { scanf( %d , &busyTime[x]); } count = 0; while (time > 0) { free = 86400 - busyTime[count]; time -...
#include <bits/stdc++.h> using namespace std; const int INF = 2000000000; const int N = 1e5 + 5; const int TN = 1 << 18; const double PI = acos(-1); int n, m, k; long long tree[TN], lazy[TN] = {0}; void probagate(int l, int r, int p) { tree[p] \|= lazy[p]; if (l != r) { lazy[p << 1] \|= lazy...
#include <bits/stdc++.h> using namespace std; struct point { int i; int j; }; int main() { vector<char> s; int n, m; char c; char a[102][102]; point first; first.i = -1; point last; memset(a, 0, sizeof(a)); scanf( %d %d %c , &n, &m, &c); getchar(); for (int i ...
#include <bits/stdc++.h> #pragma optimize( O3 ) using namespace std; const long long MOD = 1e9 + 7; const long long INF = 1e9 + 7; const int base = 2e5 + 1; const int MAX = 1e5 + 2; const double EPS = 1e-9; const double PI = acos(-1.); const int MAXN = 1e6 + 47; mt19937 rng(chrono::steady_clock::now...
#include <bits/stdc++.h> using namespace std; int main() { int n; int s = 0; int a[5000]; cin >> n; int i; for (i = 1; i <= n; i++) { cin >> a[i]; } for (i = 1; i <= n; i++) { if (a[i] == a[a[a[a[i]]]]) s = s + 1; } if (s != 0) { cout << YES ; } else ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); int n, k; cin >> n >> k; vector<pair<int, int>> a(n * 2); vector<pair<int, int>> ans; for (int i = 0; i < n; i++) { cin >> a[i].first >> a[n + i].first; a[n + i].second = 1; } sor...
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; using ll = long long; using ld = long double; using pi = pair<int, int>; using pl = pair<ll, ll>; using vi = vector<int>; using vl = vector<ll>; using vpi = vector<pi>; using si = set<int>; using sl = set<ll>; using qi = qu...
#include <bits/stdc++.h> using namespace std; map<string, int> mp; int main() { int n, m; string s; cin >> n >> m; for (int i = 0; i < n; i++) { cin >> s; mp[s] = 1; } int con = 0; for (int i = 0; i < m; i++) { cin >> s; if (mp[s] == 1) { con++; } ...
#include <bits/stdc++.h> using namespace std; int main() { long long t, a, b, c; cin >> t; while (t--) { cin >> a >> b >> c; if (a == c) { cout << -1 << b << n ; } else if (a > c) { cout << -1 1 n ; } else { double x = (double)c / b; double y...
#include <bits/stdc++.h> using namespace std; vector<vector<int>> adj, CC; const int MX = 1e5 + 69; int n, m, q, vis[MX], dis[MX], pa[MX], compsz[MX], D[MX]; int parent(int x) { if (x == pa[x]) return x; return pa[x] = parent(pa[x]); } bool cmp(int a, int b) { if (dis[a] != dis[b]) return dis[...
#include <bits/stdc++.h> using namespace std; int main() { double x1, y1, x2, y2, x0, y0; while (scanf( %lf%lf%lf%lf%lf%lf , &x0, &y0, &x1, &y1, &x2, &y2) != EOF) { double area = x0 * y1 + x2 * y0 + x1 * y2 - x2 * y1 - x0 * y2 - x1 * y0; if (area == 0) { printf( TOWARDS n ); } else...
#include <bits/stdc++.h> using namespace std; const int MAX = 200 * 1000 + 1; struct Seg { int s, e, Id; friend bool operator<(Seg a, Seg b) { return a.s < b.s; } friend bool operator>(Seg a, Seg b) { return (a.e != b.e ? a.e > b.e : a.Id > b.Id); } } a[MAX + 10]; set<Seg, greater<Seg> >...
#include <bits/stdc++.h> using namespace std; int n, s; const int N = 1e5 + 10; int v[N]; int ans; bool check(int x, int &res) { int k[n]; for (int i = 0; i < n; i++) { k[i] = v[i] + (i + 1) * x; } sort(k, k + n); for (int i = 0; i < x; i++) if (res <= s) res += k[i]; ret...
#include <bits/stdc++.h> using namespace std; string sol; const int kBufferSize = 10000; int BufferInd = kBufferSize; char Buffer[kBufferSize]; void cit(int &n) { ((++BufferInd >= kBufferSize) ? (cin.read(Buffer, kBufferSize), BufferInd = 0) : (0)); for (; not((((Bu...
#include <bits/stdc++.h> using namespace std; bool func(pair<int, int> &a, pair<int, int> &b) { return a.first < b.first; } int main() { int n, q; vector<pair<int, int>> arr; int input1, input2; int i, j; int level[5001] = { 0, }; priority_queue<int, vector<int>, greater<int>> ...
#include <bits/stdc++.h> using namespace std; using lli = long long int; int main() { int n; cin >> n; if (n == 2) { cout << 1 << endl << 1 << << 1 << endl; return 0; } else if (n == 3) { cout << 0 n2 1 2 n ; } else if (n == 4) { cout << 0 n2 1 4 n ; } else { ...
#include <bits/stdc++.h> using namespace std; long long int cnt; long long int v[100005], lft[100005], rgt[100005], rt[100005]; std::map<long long int, bool> M; void check(long long int i, long long int left, long long int right) { if (v[i] <= left && v[i] >= right) { M[v[i]] = true; } if (l...

#include <bits/stdc++.h> using namespace std; int n, k; int ok(double x, double a[]) { double z1 = 0, z2 = 0; for (int i = 0; i < n; i++) { if (x - a[i] > 0) { z1 += x - a[i]; } if (x - a[i] < 0) { double ans = 1 - (k * (double)1) / 100; z2 += (a[i] - x) * ans; ...

#include <bits/stdc++.h> #pragma GCC target( avx2 ) #pragma GCC optimize( O3 ) bool FLAG = 0; using namespace std; const long long MOD = (long long)1e9 + 7, N = (long long)2e6 + 222; const long long INF = (long long)1e18; long long dx[] = {0, -1, 0, 1, 0}; long long dy[] = {0, 0, 1, 0, -1}; long long ...

#include <bits/stdc++.h> using namespace std; vector<int> v[200005]; int t1[200005], t2[200005]; bool vis[200005]; int n, x, a, b; void dfs1(int step, int t) { t1[step] = t; vis[step] = true; for (int i = 0; i < v[step].size(); i++) { if (!vis[v[step][i]]) dfs1(v[step][i], t + 1); } ...

#include <bits/stdc++.h> using namespace std; int main() { int q; cin >> q; while (q--) { int n, k, temp; cin >> n >> k; set<int> s; for (int i = 0; i < n; i++) { cin >> temp; s.insert(temp); } set<int>::reverse_iterator it; int count = 0; ...

#include <bits/stdc++.h> #define int long long using namespace std; long long gcd(long long a, long long b) { if(!b) return a; return gcd(b, a % b); } long long lcm(long long a, long long b) { long long z = gcd(a, b); a /= z; if(a > 1e18 / b) return ...

#include <bits/stdc++.h> using namespace std; const int Nmax = 1000005, Mod = 1e9 + 7; const int Mod1 = 1e9 + 7, Mod2 = 1e9 + 9; char A[Nmax], B[Nmax]; int hash1[Nmax], hash2[Nmax]; int inv_hash1[Nmax], inv_hash2[Nmax]; int main() { ios::sync_with_stdio(false); int N, M; cin >> N >> M; cin...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); ; long long n, k; cin >> n >> k; vector<long long> v(n); for (int i = 0; i < n; i++) { cin >> v[i]; } long long ans = 0; unordered_map<int, int> m; for (int...

#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; void yash() { int arr[4], count = 1; for (int i = 0; i < 4; i++) { cin >> arr[i]; } sort(arr, arr + 4); for (int i = 0; i < 3; i++) { if (arr[i] != arr[i + 1]) { count++; } } cout << 4 - co...

#include <bits/stdc++.h> using namespace std; int main() { long long int n, m, x; cin >> n >> m; x = m - n; if (x >= 2 && n % 2 == 0) cout << n << << n + 1 << << n + 2 << endl; else if (x >= 3 && n % 2 != 0) cout << n + 1 << << n + 2 << << n + 3 << endl; else ...

#include <bits/stdc++.h> using namespace std; const int N = 3000 + 5; int n, m; int l[N][N], r[N][N], cnt[N], fen[N]; char s[N][N]; vector<int> del[N]; void up(int x, int k) { cnt[x] += k; for (; x; x -= x & -x) fen[x] += k; } int get(int x) { int res = 0; for (; x < N; x += x & -x) re...

#include <bits/stdc++.h> using namespace std; int a[111111], b[111111]; vector<int> v; long long t[555][555]; int main() { int n; cin >> n; int r, c; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { cin >> t[i][j]; if (t[i][j] == 0) { r = i; ...

#include <bits/stdc++.h> char s[100001]; int a[100000]; int b[100000]; void func() { int n = strlen(s), i, ans = 1 << 29; if (isupper(s[0])) { a[0] = 0; } else { a[0] = 1; } for (i = 1; i < n; i++) { if (isupper(s[i])) { a[i] = a[i - 1]; } else { a[i] ...

#include <bits/stdc++.h> using namespace std; const int maxn = 300 + 10, mod = 1e9 + 7, INF = 0x3f3f3f3f; long long c[maxn][maxn], pw[2][maxn], f[maxn][maxn]; inline int add(long long a, long long b) { a += b; return a >= mod ? a - mod : a; } inline int mul(long long a, long long b) { return a * b %...

#include <bits/stdc++.h> using namespace std; const int INT_INF = 1e9; const long long LL_INF = 1e18; int getInt(char c) { return c - 0 ; } int getDistance(int index, int y, int z, vector<vector<int>>& last) { int p = last[index][y]; if (p == -1) return INT_INF; int q = last[p][z]; if (q == -...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(NULL); int n, tmp, ans = 0, mx = -1; cin >> n; for (int i = 0; i < n && cin >> tmp; ++i) mx = max(tmp, mx); cout << (mx > 25 ? mx - 25 : 0); }

#include <bits/stdc++.h> using namespace std; const int N = 212345, LG = 21, mod = 1000000007; const double eps = 1e-3, pi = acos(-1.0); int in[N]; vector<int> adj[N]; map<pair<int, int>, int> mp; set<pair<int, int>> s; int main() { int n, m; scanf( %d , &n), scanf( %d , &m); for (int i = 1;...

#include <bits/stdc++.h> using namespace std; const int A = 100000, MD = 998244353; int kk[A + 1]; int pp[A + 1][6][6], aa[6][6], tt[6][6]; int uu_[6], vv_[6], *uu = uu_, *vv = vv_; int kp[A + 1]; bool sq[A + 1]; void init(int *aa, int a0, int a1, int a2, int a3, int a4, int a5) { aa[0] = a0, aa[1] ...

#include <bits/stdc++.h> using namespace std; int n, K, p; char s[11]; int calc(int x, int y) { printf( 1 %d %d n , x, y); fflush(stdout); scanf( %s , s + 1); return s[1] == T ; } int find(int l, int r) { while (l < r) { int mid = (l + r) >> 1; if (calc(mid, mid + 1)) ...

#include <bits/stdc++.h> using namespace std; const int N = 1e4 + 100; int n, k; char str[N]; bool f[N]; int main() { scanf( %s , str + 1), n = strlen(str + 1); while (1 << k < n) ++k; if (1 << k > n) --k; memset(f, 1, sizeof(f)); for (int i = 1; i <= n - (1 << k) + 1; ++i) { char ...

#include <bits/stdc++.h> using namespace std; int main() { int l, r; cin >> l >> r; while (l <= r) { int arr[9] = {0}; int x = l; bool diff = 1; while (x) { int num = x % 10; x /= 10; if (arr[num]) { diff = 0; l++; break; ...

#include <bits/stdc++.h> using namespace std; string s, str; long long mns, all, pls, nom, maxi, mini, n, sum, otn; vector<char> v; vector<long long> ans; int main() { getline(cin, s); for (int i = 0; i < s.size(); i++) { if (s[i] == - ) mns++; if (s[i] == ? ) all++; if (s[i] == ...

#include <bits/stdc++.h> using namespace std; int main() { int m[] = {6, 2, 5, 5, 4, 5, 6, 3, 7, 6}; long a, b; cin >> a; cin >> b; int count = 0; int i; long x; do { x = a; while (x >= 10) { i = x % 10; count += m[i]; x /= 10; } count ...

#include <bits/stdc++.h> using namespace std; using ll = long long; ll cnt_inv[30][2]; void rec(vector<int>& a, int b) { if (b < 0 || a.empty()) return; vector<int> s, us; for (int& i : a) { int val = i & (1 << b); if (val) cnt_inv[b][1] += us.size(), s.push_back(i); else ...

#include <bits/stdc++.h> using namespace std; namespace LYYY { int read() { int s = 0; char c = getchar(); int f = 1; while (c < 48 || c > 57) { if (c == 45) f = -1; c = getchar(); } while (c >= 48 && c <= 57) s = (s << 3) + (s << 1) + (c ^ 48), c = getchar(); return s * f;...

#include <bits/stdc++.h> using namespace std; int arr[111]; int main() { int n; scanf( %d , &n); arr[0] = 0; for (int i = (1); i < (n + 1); ++i) scanf( %d , &arr[i]); int ans = 0; if (n % 2 == 0 || n == 1) { printf( -1 n ); return 0; } for (int i = n; i >= 1; i -= 2) { ...

#include <bits/stdc++.h> using namespace std; struct msg { long long lstl = 0; long long lstr = 0; long long num = 0; }; int32_t main() { long long n, k; cin >> n >> k; long long a[n]; msg ms[n]; for (long long i = 0; i < n; i++) { cin >> a[i]; } for (long long i = ...

#include <bits/stdc++.h> using namespace std; const int maxn = (1 << 11); const int maxs = 27; string s[maxn]; vector<int> NextIn[maxn][maxs]; int NextOut[maxn][maxs], First[maxn][maxs], a[maxn]; pair<int, int> dp[maxn][maxn]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.t...

#include <bits/stdc++.h> using namespace std; long long int n, I; vector<long long int> vec; vector<long long int> comp; long long int K; int main() { scanf( %lld %lld , &n, &I); for (int i = 1; i <= n; i++) { long long int a; scanf( %lld , &a); vec.push_back(a); } K = 1 <<...

#include <bits/stdc++.h> using namespace std; const double pi = acos(-1.0); const int inf = 0x3f3f3f3f; const double eps = 1e-15; const long long INF = (1LL << 60); int cnt[1010]; int a[1010]; int M[1010]; int m; int dp[1010][1010][2]; int main() { int n, m, x; scanf( %d%d , &n, &m); m...

#include <bits/stdc++.h> using namespace std; mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count()); const int N = 200005; const int M = 1000000007; long long ast(long long x, long long n) { x %= M; long long ans = 1; while (n) { if (n % 2 == 1) ans = (ans * x) % M; x = (...

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

#include <bits/stdc++.h> using namespace std; int n, m, st[350005], dr[350005], grad[350005], bad[350005], l, order[350005], len; bool used[350005], stare[350005]; vector<int> L[350005]; vector<int>::iterator it[350005]; inline void add_edge(int x, int y) { ++m; L[x].push_back(m); L[y].pus...

#include <bits/stdc++.h> using namespace std; int main() { int R, C; cin >> R >> C; char m[R][C]; for (int i = 0; i < R; i++) for (int j = 0; j < C; j++) cin >> m[i][j]; for (int i = 0; i < R; i++) for (int j = 0; j < C; j++) { if (m[i][j] == S ) { if (i > 0) ...

#include <bits/stdc++.h> using namespace std; long long n, m; long long arr[200002], time_freq[101]; void solve() { long long total_time = 0; for (long long i = 0; i < n; i++) { long long exam_start_time = total_time + arr[i] - m; int student_removed = 0; if (exam_start_time > 0) { ...

#include <bits/stdc++.h> using namespace std; const double pi = acos(-1.0); map<int, int> mp; int main() { std::ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; int n, k, tmp = 1, mx = 0; cin >> n >> k; while (tmp <= k + 1) { int pos, x; cout << ? << ; f...

#include <bits/stdc++.h> using namespace std; int main() { int k[3]; while (cin >> k[0] >> k[1] >> k[2]) { bool flag = false; int one = 0, two = 0, three = 0, four = 0; for (int i = 0; i < 3; i++) { if (k[i] == 1) one++; if (k[i] == 2) two++; if (k[i] == 3) three++;...

#include <bits/stdc++.h> using namespace std; pair<int, int> tc[30]; bool dp[5][110][505]; int vis[5][110][505], n, k, Trow[30], kase, stx, sty; char mp[5][110]; bool solve(int x, int y, int mv) { if (x < 1 || x > 3 || y < 1) return 0; if (y > n) return 1; bool oc1 = 0, oc2 = 0, oc3 = 0; if ...

#include <bits/stdc++.h> #pragma GCC target( fma ) #pragma GCC optimize( unroll-loops,-Ofast ) using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); long long a[500005]; int n; set<long long> buck[1000]; long long c[1000]; void fix(int v) { int l = v * 700; ...

#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { if (a % b == 0) return b; else return gcd(b, a % b); } int main() { int n, m, an[120], am[120], fa = -1, fb = -1, f = 0, a, b; cin >> n >> m; for (int i = 0; i < n + 1; i++) { cin >> an[i]; if (f ==...

#include <bits/stdc++.h> using namespace std; const int step[8][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}, {1, 1}, {1, -1}, {-1, 1}, {-1, -1}}; template <class T> inline T abs1(T a) { return a < 0 ? -a : a; } const int maxn = 100110; template <class t> struct segment_node { ...

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

#include <bits/stdc++.h> using namespace std; int dp[100010]; int main() { int val90, val1440, n; cin >> n; dp[0] = 0; unsigned int ar[n + 10]; for (int i = 1; i <= n; i++) { cin >> ar[i]; } val1440 = val90 = 1; for (int i = 1; i <= n; i++) { while (ar[i] - ar[val1440] ...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10; const int maxlog = 24; int par[maxn][maxlog], h[maxn]; int siz[maxn]; bool mark[maxn]; int n; vector<int> adj[maxn]; void dfs(int x) { mark[x] = 1; for (int i = 0; i < adj[x].size(); i++) { int child = adj[x][i]; ...

#include <bits/stdc++.h> using namespace std; const int ALPHABETS = 30; const int maxN = 410; bitset<maxN> orig[ALPHABETS][maxN], ans[maxN]; int main() { ios::sync_with_stdio(false); cin.tie(0); int N, M; cin >> N >> M; string s; for (int i = 0; i < N; i++) { cin >> s; for ...

#include <bits/stdc++.h> int main() { int n; std::cin >> n; int t, c; int max = 0, cur = 0, lt = -1; for (int i = 0; i < n; i++) { std::cin >> t >> c; if (lt != -1) { cur += lt - t; } if (cur < 0) cur = 0; cur += c; if (cur > max) max = cur; lt = t...

#include <bits/stdc++.h> using namespace std; const int inf = 1e9 + 7; const int N = 230; const int M = 3500; int m, n; int a[N], b[N]; long long dp[M][N]; int main() { cin >> m >> n; memset(dp, 0, sizeof(dp)); for (int i = 0; i < m; ++i) { cin >> a[i] >> b[i]; dp[a[i]][i]++; ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 200100; int main() { int n = 0, u = 0, v = 0; int d[MAXN] = {0}; scanf( %d , &n); for (int i = 0; i < n - 1; i++) { scanf( %d %d , &u, &v); d[u] += 1; d[v] += 1; } for (int i = 1; i <= n; i++) { if (d[i]...

#include <bits/stdc++.h> using namespace std; long long x, y, n, c; bool check(long long t) { long long ans = 2 * t * t + 2 * t + 1; if (x + t > n) { long long m = x + t - n; ans -= m * m; } if (y + t > n) { long long m = y + t - n; ans -= m * m; } if (x <= t) { ...

#include <bits/stdc++.h> using namespace std; void gk() { ios_base::sync_with_stdio(0); cin.tie(0); std::cout.tie(0); } int64_t mul(int64_t a, int64_t b) { return (a * b) % (int64_t)1000000007; } int64_t gcd(int64_t a, int64_t b) { if (b == 0) { return a; } return gcd(b, a % b); ...

#include <bits/stdc++.h> using namespace std; int N, edge; pair<int, int> E[2][200002]; vector<int> V[2][200002]; int in[2][200002], out[2][200002]; bool S[2][200002], isdel[2][200002]; vector<pair<pair<int, int>, int> > ARBf[2][4 * 200002], ARBs[2][4 * 200002]; int Ap1, Ap2, Apv, Ax1, Ax2; vector<int...

#include <bits/stdc++.h> using namespace std; const int N = 200005; int cycl[N], set_val[N], cycl_size[N]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int h, m, n; cin >> h >> m >> n; vector<int> strt; bool vis[h]; memset(vis, false, sizeof vis); int kk = 0; ...

#include <bits/stdc++.h> int p[100005], q[100005], n, m, V; double a[100005], x[100005], y[100005], dx[100005], dy[100005], h, vx, vy, t, w; bool cmp1(const int i, const int j) { return a[i] < a[j]; } bool cmp2(const int i, const int j) { return x[i] < x[j]; } bool up(double t, double y) { return (h = vy * t ...

#include <bits/stdc++.h> using namespace std; int dx[] = {-1, 1, 0, 0, -1, -1, 1, 1}; int dy[] = {0, 0, 1, -1, -1, 1, -1, 1}; map<int, bool> ans; map<long long, int> dp; int rec(long long q) { if (ans[q] == 1) return dp[q]; vector<int> v; long long sq = sqrt(q); int mex, x; for (int l = ...

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

#include <bits/stdc++.h> char num[10][10]; int main() { for (int i = 1; i < 9; i++) scanf( %s , num[i]); bool yes = true; for (int i = 1; i <= 8; i++) { int cntb = 0, cntw = 0; char pre = * ; for (int j = 0; j < 8; j++) { if (num[i][j] == pre) { yes = false; ...

#include <bits/stdc++.h> using namespace std; int a[100000]; int b[100001]; int c1[100001]; int c2[100001]; int main() { int n, c = 0, x = 0, y = 0, z1 = 0, z2 = 0, i; long long ans = 0; scanf( %d , &n); for (i = 0; i < n; i++) scanf( %d , &a[i]); for (i = 0; i < n; i++) { b[a[i]]+...

#include <bits/stdc++.h> using namespace std; struct hero { int power; int nr; }; int main() { int n, m; int board[100]; hero heroes[100]; vector<int> left, right; cin >> n >> m; for (int i = 0; i < n; ++i) heroes[i].nr = -1; int l_ind = n; int r_ind = -1; for (int si...

#include <bits/stdc++.h> using namespace std; const double PI = 3.14159265358979323846; const int N = 1e6 + 5; const long long MOD = 1000000007; int dx[] = {0, 1, 0, -1}; int dy[] = {1, 0, -1, 0}; bool cmp(const pair<int, int>& a, const pair<int, int>& b) { return (a.second < b.second); } int gcd(...

#include <bits/stdc++.h> using namespace std; ifstream in( input.txt ); ofstream out( output.txt ); int main() { vector<int> a; int n, x; cin >> n >> x; a.resize(100001); vector<int> b; for (int i = 0; i < n; i++) { int t; cin >> t; a[t]++; b.push_back(t); } ...

#include <bits/stdc++.h> #define ll long long #define nl n #define vpn 1000000 using namespace std; ll t,n,dismin; ll a[vpn],b[vpn]; ll gcd(ll x, ll y) { if (y==0) return x; return gcd(y,x%y); } int main() { ios::sync_with_stdio(0); cin.tie(0); cin>>t; while ...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); long long t = 0, i, j, n; long long arr[100002]; cin >> n; for (i = 0; i < n; ++i) { cin >> arr[i]; t += arr[i]; } if (t % (n - 1) == 0) { j = t / (n - 1); } else { j = t /...

#include <bits/stdc++.h> using namespace std; using ll = long long; using ii = pair<ll, ll>; inline int get_state(ll s, int x) { return ((s >> (5 * x)) & 0x1f); } inline ll set_state(ll s, ll v, int x) { return ((s & ~(0x1fLL << (5 * x))) | (v << (5 * x))); } int cs[10]; map<ll, int> st; map<ll, i...

#include <bits/stdc++.h> using namespace std; void init() {} const int N = 63e5 + 34; const long long INF = 2e9 + 34; int MD = 30; string sym = AHIMOTUVWXYovwx ; void fail() { cout << NIE ; exit(0); } int main() { init(); string s; cin >> s; int n = s.length(); if (n % 2 ...

#include <bits/stdc++.h> using namespace std; const int maxn = 2000 + 5; const int MOD = 1000000000 + 7; int n, k; int a[maxn], e[maxn], s[maxn], t[maxn]; inline void mm(int a[], int b[]) { for (int i = 0; i < n; i++) { t[i] = 0; for (int j = 0; j <= i; j++) t[i] = ((long long)a[j] *...

#include <bits/stdc++.h> using namespace std; const int N = 200001; int cs1[N]; int cs2[N]; int ss1[N]; int ss2[N]; int sum(int i, int cs[]) { int s = 0; while (i > 0) { s += cs[i]; i -= i & -i; } return s; } void add(int i, int k, int cs[]) { while (i < N) { cs[i...

#include <bits/stdc++.h> using namespace std; int main() { int ans = 0, a, b, a2, b2; cin >> a >> b; while (((a != 0) and (b != 0))) { if ((a + b) <= 2) { cout << ans << endl; return 0; } if (2 * a <= b) { cout << ans + a << endl; return 0; } ...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:102400000,102400000 ) using namespace std; template <class T, class U> inline void Max(T &a, U b) { if (a < b) a = b; } template <class T, class U> inline void Min(T &a, U b) { if (a > b) a = b; } char s[3][105]; int ok[3][105], dp[105...

#include <bits/stdc++.h> #define modulus 1000000007 //for loops //------------------- #define for0(i, N) for (i = 0; i < (int) N; i++) #define for1(i, N) for (i = 1; i <= (int) N; i++) #define forr0(i, N) for (i = (int) N - 1; ~i; i--) #define forr1(i, N) for (i = (int) N; i; i--) #define foru(i, ...

#include <bits/stdc++.h> using namespace std; const long long int mod = 1000000000 + 7; const long long int N = 10000000 + 6; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int q; cin >> q; for (int i = 0; i < q; ++i) { long long n; cin >> n; vector<...

#include <bits/stdc++.h> using namespace std; using ll = long long; const bool MULTI_TESTCASES = 0; struct Query { int l, r, id; }; void solve() { int n, k; cin >> n >> k; vector<int> t(n + 1); for (int i = 1; i < n + 1; ++i) { cin >> t[i]; if (t[i] == 2) t[i] = -1; } ...

#include <bits/stdc++.h> using namespace std; int a[102]; int main() { int n, i, l, r, j; char name[100009]; cin >> n; scanf( %s , name); l = 0; r = 9; for (i = 0; i < n; i++) { if (name[i] == L ) for (j = 0; j < 10; j++) if (a[j] == 0) { a[j] = 1; ...

#include <bits/stdc++.h> #pragma optimize( , off) #pragma GCC optimize( Ofast,no-stack-protector,unroll-loops ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) #pragma comment(linker, /STACK:36777216 ) const int mod = 1000000007; using namespace std; template <class T> vo...

#include <bits/stdc++.h> const int N = 100000 + 1; struct Point { int x, y; Point(int x = 0, int y = 0) : x(x), y(y) {} Point &operator-=(const Point &o) { x -= o.x; y -= o.y; return *this; } int quadrant() const { if (y != 0) { return y > 0; } return ...

#include <bits/stdc++.h> const double eps = 1e-9; const double PI = acos(-1); const long long MOD = 1e9 + 7; using namespace std; vector<string> powers; pair<string, string> solution(string s) { string order; reverse(s.begin(), s.end()); map<char, int> mp; for (char c : s) { if (!mp[c]...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; string s; cin >> s; map<string, int> gram; for (int i = 0; i < n - 1; i++) ++gram[s.substr(i, 2)]; int cnt = 0; string ans = ; for (aut...

#include <bits/stdc++.h> using namespace std; const int N = (int)1e4 + 10; const int M = (int)1e9 + 7; int n, k; int mina, maxa; void track() { for (int i = (1); i <= (n); i++) { for (int j = (1); j <= (n); j++) { if (i == j) cout << k; else cout << 0; i...

#include <bits/stdc++.h> using namespace std; const int MAXN = 300005, N = 333333; const int D = 1e9 + 7, inv2 = 5e8 + 4; int n, Q, a[MAXN], mul[N + 233], inv[N + 233]; int val[MAXN << 1]; int id[MAXN], w[MAXN]; int tim, len; struct node { int v, id; node() {} node(int vv, int ii) { v = vv, ...

#include <bits/stdc++.h> using namespace std; const int N = 2e5; vector<int> g[N]; int mn[N]; int mx[N]; int ans; void dfs(int u, int p) { bool leaf = true; mn[u] = 1e9; mx[u] = -1e9; for (int v : g[u]) if (v != p) { dfs(v, u); leaf = false; mn[u] = min(mn[u],...

#include <bits/stdc++.h> using namespace std; bool found = false; int b, A[10000], orig_a; int main() { int a, b[3], i, j, n, x, y, z, array[100000]; cin >> n; for (i = 0; i < 3; i++) { if (i <= 1) { cout << ? << 1 << << i + 2 << endl; } else { cout << ? << 2 <<...

#include <bits/stdc++.h> using namespace std; const int max_n = 1111111, inf = 1000000007; int n, k, a[max_n], pw[max_n], used[max_n]; int main() { cin >> n >> k; if (k == 0) { long long ans = 1; for (int i = 1; i < n; ++i) { ans = (ans * n) % inf; } cout << ans << endl; ...

#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; map<char, int> mp; for (int i = 0; i < s.length(); i++) { mp[s[i]]++; } int mn; set<int> st; set<int>::iterator it; st.insert(mp[ B ]); st.insert(mp[ u ] / 2); st.insert(mp[ l ]); st....

#include <bits/stdc++.h> using namespace std; char buf[11]; const int MAXC = 20; double C[MAXC][MAXC + 1]; void count(int &sum, int &q) { char buf[11]; cin >> buf; sum = 0; q = 0; for (char *p = buf; *p; ++p) { switch (*p) { case + : ++sum; break; ...

#include <bits/stdc++.h> using namespace std; struct Point { long double x, y; Point(){}; long double dist(Point b) { return sqrt((b.x - x) * (b.x - x) + (b.y - y) * (b.y - y)); } }; int main() { Point a, b, c; cin >> a.x >> a.y >> b.x >> b.y >> c.x >> c.y; long double k = a.di...

#include <bits/stdc++.h> int main() { int days, time, count, free; int x = 0; scanf( %d , &days); scanf( %d , &time); int busyTime[days]; for (x = 0; x < days; x++) { scanf( %d , &busyTime[x]); } count = 0; while (time > 0) { free = 86400 - busyTime[count]; time -...

#include <bits/stdc++.h> using namespace std; const int INF = 2000000000; const int N = 1e5 + 5; const int TN = 1 << 18; const double PI = acos(-1); int n, m, k; long long tree[TN], lazy[TN] = {0}; void probagate(int l, int r, int p) { tree[p] |= lazy[p]; if (l != r) { lazy[p << 1] |= lazy...

#include <bits/stdc++.h> using namespace std; struct point { int i; int j; }; int main() { vector<char> s; int n, m; char c; char a[102][102]; point first; first.i = -1; point last; memset(a, 0, sizeof(a)); scanf( %d %d %c , &n, &m, &c); getchar(); for (int i ...

#include <bits/stdc++.h> #pragma optimize( O3 ) using namespace std; const long long MOD = 1e9 + 7; const long long INF = 1e9 + 7; const int base = 2e5 + 1; const int MAX = 1e5 + 2; const double EPS = 1e-9; const double PI = acos(-1.); const int MAXN = 1e6 + 47; mt19937 rng(chrono::steady_clock::now...

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

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); int n, k; cin >> n >> k; vector<pair<int, int>> a(n * 2); vector<pair<int, int>> ans; for (int i = 0; i < n; i++) { cin >> a[i].first >> a[n + i].first; a[n + i].second = 1; } sor...

#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; using ll = long long; using ld = long double; using pi = pair<int, int>; using pl = pair<ll, ll>; using vi = vector<int>; using vl = vector<ll>; using vpi = vector<pi>; using si = set<int>; using sl = set<ll>; using qi = qu...

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

#include <bits/stdc++.h> using namespace std; int main() { long long t, a, b, c; cin >> t; while (t--) { cin >> a >> b >> c; if (a == c) { cout << -1 << b << n ; } else if (a > c) { cout << -1 1 n ; } else { double x = (double)c / b; double y...

#include <bits/stdc++.h> using namespace std; vector<vector<int>> adj, CC; const int MX = 1e5 + 69; int n, m, q, vis[MX], dis[MX], pa[MX], compsz[MX], D[MX]; int parent(int x) { if (x == pa[x]) return x; return pa[x] = parent(pa[x]); } bool cmp(int a, int b) { if (dis[a] != dis[b]) return dis[...

#include <bits/stdc++.h> using namespace std; int main() { double x1, y1, x2, y2, x0, y0; while (scanf( %lf%lf%lf%lf%lf%lf , &x0, &y0, &x1, &y1, &x2, &y2) != EOF) { double area = x0 * y1 + x2 * y0 + x1 * y2 - x2 * y1 - x0 * y2 - x1 * y0; if (area == 0) { printf( TOWARDS n ); } else...

#include <bits/stdc++.h> using namespace std; const int MAX = 200 * 1000 + 1; struct Seg { int s, e, Id; friend bool operator<(Seg a, Seg b) { return a.s < b.s; } friend bool operator>(Seg a, Seg b) { return (a.e != b.e ? a.e > b.e : a.Id > b.Id); } } a[MAX + 10]; set<Seg, greater<Seg> >...

#include <bits/stdc++.h> using namespace std; int n, s; const int N = 1e5 + 10; int v[N]; int ans; bool check(int x, int &res) { int k[n]; for (int i = 0; i < n; i++) { k[i] = v[i] + (i + 1) * x; } sort(k, k + n); for (int i = 0; i < x; i++) if (res <= s) res += k[i]; ret...

#include <bits/stdc++.h> using namespace std; string sol; const int kBufferSize = 10000; int BufferInd = kBufferSize; char Buffer[kBufferSize]; void cit(int &n) { ((++BufferInd >= kBufferSize) ? (cin.read(Buffer, kBufferSize), BufferInd = 0) : (0)); for (; not((((Bu...

#include <bits/stdc++.h> using namespace std; bool func(pair<int, int> &a, pair<int, int> &b) { return a.first < b.first; } int main() { int n, q; vector<pair<int, int>> arr; int input1, input2; int i, j; int level[5001] = { 0, }; priority_queue<int, vector<int>, greater<int>> ...

#include <bits/stdc++.h> using namespace std; using lli = long long int; int main() { int n; cin >> n; if (n == 2) { cout << 1 << endl << 1 << << 1 << endl; return 0; } else if (n == 3) { cout << 0 n2 1 2 n ; } else if (n == 4) { cout << 0 n2 1 4 n ; } else { ...

#include <bits/stdc++.h> using namespace std; long long int cnt; long long int v[100005], lft[100005], rgt[100005], rt[100005]; std::map<long long int, bool> M; void check(long long int i, long long int left, long long int right) { if (v[i] <= left && v[i] >= right) { M[v[i]] = true; } if (l...