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; struct EDGE { int v, next; }; EDGE w[222]; long long f[1 << 17], Y; int ans[22], ww[22], visit[22], N, M, W = 0; long long work() { memset(f, 0, sizeof(f)); f[0] = 1; for (int i = 0; i < 1 << N; ++i) if (f[i]) { if (i == 3) int as...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int t; cin >> t; bool flag; while (t--) { int n; cin >> n; long long int a[n]; for (int i = 0; i < n; i++) cin >> a[i]; flag = true; ...
#include <bits/stdc++.h> using namespace std; template <class T> using VV = vector<vector<T>>; template <class T> inline T SMIN(T& a, const T b) { return a = (a > b) ? b : a; } template <class T> inline T SMAX(T& a, const T b) { return a = (a < b) ? b : a; } template <class Iter> void dump...
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; inline void add(long long &a, long long b) { a += b; a %= MOD; } inline void sub(long long &a, long long b) { a -= b; a %= MOD; } inline long long mul(long long a, long long b) { return (long long)a * b % MOD; } ...
#include <bits/stdc++.h> using namespace std; int n, l[1000005], dp[1000005][2][2]; char s[1000005]; void Calc(int k) { if (s[k] == 0 ) dp[k][0][0] = 1; else if (s[k] == 1 ) dp[k][1][1] = 1; else { dp[k][1][0] = 1; dp[k][0][1] = 1; } } void Change(int x, int L, int ...
#include <bits/stdc++.h> using namespace std; const int N = 2e6 + 10, mod = 1e9 + 7; int rd() { int x = 0, w = 1; char ch = 0; while (ch < 0 \|\| ch > 9 ) { if (ch == - ) w = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + (ch ^ 48); ch = getchar()...
#include <bits/stdc++.h> using namespace std; int n; vector<int> edges[(200 * 1000 + 5)]; vector<int> f; vector<int> a; int dp[(200 * 1000 + 5)][5]; void read_data() { cin >> n; int u, v; for (int i = 1; i < n; i++) { scanf( %d %d , &u, &v); edges[u].push_back(v); edges[v].pu...
#include <bits/stdc++.h> using namespace std; void _print(int32_t t) { cerr << t; } void _print(int64_t t) { cerr << t; } void _print(string t) { cerr << t; } void _print(char t) { cerr << t; } void _print(long double t) { cerr << t; } void _print(double t) { cerr << t; } void _print(unsigned long long ...
#include <bits/stdc++.h> using namespace std; vector<int> s[100005]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m, i, j, a, b; cin >> n >> m; if (n == 1 && m == 1) { cout << YES n << 1; } else if (n == 1 && m == 2) { cout << NO ; } els...
#include <bits/stdc++.h> using namespace std; void printVector(vector<string> &v) { for (auto x : v) cout << x << n ; } void printVector(vector<int> &v) { for (auto x : v) cout << x << ; cout << n ; } int main() { cin.tie(0); cout.tie(0); ios::sync_with_stdio(0); int t; ...
#include <bits/stdc++.h> using namespace std; struct node { int len, l, r; bool operator<(const node &a) const { return len > a.len; } }; int day[200010]; int m[200010]; int main() { int n, k, c, i, j; scanf( %d %d , &n, &k); c = 0; for (i = 0; i < n; i++) { scanf( %d , &day[i]...
#include <bits/stdc++.h> using namespace std; inline void OPEN(const string &s) { freopen((s + .in ).c_str(), r , stdin); freopen((s + .out ).c_str(), w , stdout); } int main() { int n; scanf( %d , &n); int art; scanf( %d , &art); int alex; scanf( %d , &alex); int ans[110...
#include <bits/stdc++.h> using namespace std; int M[2002][2002]; struct TA { int a[2002], n; void init(int _n) { n = _n; memset(a, 0, sizeof a); } int get(int p) { int ret = 0; for (p++; p > 0; p -= p & -p) ret ^= a[p - 1]; return ret; } void change(int l) { ...
#include <bits/stdc++.h> using namespace std; class MinHeap { vector<long long int> arr; long long int size; public: MinHeap() { size = 0; } long long int parent(long long int i) { return (i - 1) / 2; } long long int lchild(long long int i) { return 2 * i + 1; } long long int rchild(lo...
#include <bits/stdc++.h> using namespace std; vector<long long> invi(long long n) { int x; vector<long long> a; for (long long i = 0; i < n; i++) { cin >> x; a.push_back(x); } return a; } void solve(); int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); in...
#include <bits/stdc++.h> using namespace std; int main() { char prev[26], next[26]; for (int i = 0; i < 26; i++) prev[i] = next[i] = -1; int n; cin >> n; for (int i = 0; i < n; i++) { string s; cin >> s; if (prev[s[0] - a ] == -1) prev[s[0] - a ] = 0; if (next[s[(int)s....
#include <bits/stdc++.h> int n, a[100000], sum = 0; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , &a[i]); sum += a[i]; } if (sum % n != 0) printf( %d n , n - 1); else printf( %d n , n); return 0; }
#include <bits/stdc++.h> using namespace std; const int INFint = 2147483547; const long long INF = 9223372036854775807ll; const long long MOD = 1000000007ll; const long double EPS = 1e-13; string min_cyclic_shift(string s) { s += s; int n = (int)s.length(); int i = 0, ans = 0; while (i < n /...
#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); bool isPrime(int n) { if (n == 1) return false; for (int i = 2; i * i <= n; ++i) { if (n % i == 0) return false; } return true; } void solve() { int n, sum = 0; cin ...
#include <bits/stdc++.h> using namespace std; int main() { int n, x; int a[100000 + 3], b[100000 + 3]; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; b[i] = a[i]; } sort(b, b + n); int cnt = 1; for (int i = 0; i < n; i++) { if (a[i] != b[i]) { cnt++; ...
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; int n, m, p; long long ans = -1e18; struct nd { int val, c; friend bool operator<(nd a, nd b) { return a.val < b.val; } } a[N], b[N]; struct mon { int x, y, z; friend bool operator<(mon a, mon b) { return a.x < b.x; } }...
#include <bits/stdc++.h> using namespace std; int main() { long long n, k, s; while (cin >> n >> k >> s) { long long temp = (s / k); long long rem = s % k; temp++; if (((n - 1) * k < s \|\| (k > s))) { cout << NO << endl; return 0; } cout << YES << endl;...
#include <bits/stdc++.h> using namespace std; int t; long long a, b, c, d; long long solve(long long x) { long long times = x / d + 1; long long sum = (x / d + 1) * a; long long finished; if (x < c) { finished = 0; } else { finished = (x - c) / d + 1; } long long left = t...
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:1024000000,1024000000 ) const double pi = 2.0 * asin(1.0), eps = 1e-12; const int maxn = 2100, maxm = 1100000, inf = 0x3f3f3f3f; char ch[maxn][maxn]; int ans[maxn]; int main() { int n, m, i, j, l, x; while (scanf( %d%d%d...
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 7; vector<int> cur; void split(int x, int p) { if (p == 1) { cout << x << ; return; } cout << x - 1 << ; split(x - 1, p - 1); } int main() { ios::sync_with_stdio(false); cin.tie(0); ; long ...
#include <bits/stdc++.h> using std::cin; using std::cout; using std::endl; using std::sort; using std::string; using std::swap; int main() { int times = INT_MAX; int a[6]; while (times-- && ~scanf( %d , &a[0])) { for (int i = 1; i < 6; ++i) scanf( %d , a + i); printf( %d n , (a[0] ...
#include <bits/stdc++.h> const double inf = 1e20; using namespace std; int n, m, i, j, f; char a[55][55]; int vis[55][55]; int dx[4] = {1, 0, -1, 0}; int dy[4] = {0, 1, 0, -1}; void dfs(int x, int y, int oldx, int oldy) { if (x == i && y == j && vis[i][j]) { f = 1; return; } for ...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n], x = 0; for (int i = 0; i < n; i++) { cin >> a[i]; if (a[i] == 1) { x++; } } if (x == n) { cout << n - 1 << n ; } else { int p = 0, m = 0; for (int i = 0; i ...
#include <bits/stdc++.h> using namespace std; int n; string sherlock, moriarty; int algos(bool upper) { int res = 0; multiset<int> S; for (int i = 0; i < n; ++i) S.insert((int)moriarty[i]); for (int i = 0; i < n; ++i) { multiset<int>::iterator it; if (upper) it = S.upper_boun...
#include <bits/stdc++.h> using namespace std; const int MAX = 100005; int n; int firzero = -1; int a[MAX]; int main() { scanf( %d , &n); for (int i = 0; i < n; ++i) { scanf( %d , &a[i]); if (!a[i] && firzero == -1) firzero = i; } if (a[n - 1]) printf( NO n ); else { ...
#include <bits/stdc++.h> using namespace std; int v[100005], goal[100005], parent[100005]; bool used[100005]; int n; vector<int> A[100005], leaves, sol; void dfs(int node, int current_xor, int other_xor) { if (used[node]) return; used[node] = 1; if ((v[node] ^ current_xor) != goal[node]) { ...
#include <bits/stdc++.h> using namespace std; const int NN = 150000 + 10; int N, M, H; int b[NN], a[NN]; int _max[NN << 2]; int add[NN << 2]; void up(int idx) { _max[idx] = max(_max[idx << 1], _max[idx << 1 \| 1]); } void build(int l, int r, int idx) { _max[idx] = -100000000; add[idx] = 0; if...
#include <bits/stdc++.h> using namespace std; char s[1000]; int main() { int n; scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %s , &s); } for (int i = 0; i < 10; i++) cout << ?? << i << >> << i << ?? n ; cout << ??>>? n ; for (int i = 0; i < 9; i++) { cout << ...
#include <bits/stdc++.h> using namespace std; void solve() { long long N, K; string X; cin >> N >> K; cin >> X; string foo = X; for (long long i = 0; i + K < foo.size(); i++) { foo[i + K] = foo[i]; } if (foo >= X) { cout << foo.size() << endl; cout << foo << endl; ...
#include <bits/stdc++.h> using namespace std; vector<int> A[7], B[100005]; int n, a[5005], f[5005][5005], ans; int main() { int i, j, u, v, w, p, q, r; scanf( %d , &n); for (i = 1; i <= n; i++) scanf( %d , &a[i]); for (i = n; i >= 1; i--) { A[a[i] % 7].push_back(i); B[a[i]].push_back...
#include <bits/stdc++.h> using namespace std; int main() { long long n, x, mx = 0, ans; cin >> n; while (n--) { cin >> x; if (x > mx) mx = x; } ans = mx ^ x; cout << ans << endl; return 0; }
#include <bits/stdc++.h> const int INF = 0x3f3f3f3f; const long long int INFLL = 0x3f3f3f3f3f3f3f3fll; long long int getint() { long long int ret = 0; bool f = 0; char c; while ((c = getchar()) < 0 \|\| c > 9 ) if (c == - ) f ^= 1; while (c >= 0 && c <= 9 ) { ret = ret * 10 + ...
#include <bits/stdc++.h> using namespace std; int main() { int i, n; string st; vector<string> v; map<string, int> mp; cin >> n; for (i = 0; i < n; i++) { cin >> st; if (mp[st] == 0) { v.push_back(st); } mp[st]++; } if (v.size() == 1) cout << v[0...
#include <bits/stdc++.h> using namespace std; int res[1111]; bool sol(int d) { int g = 1, e; for (e = 2; e <= sqrt(d); e++) { if (d % e == 0) { while (d % e == 0) d /= e; if (d != 1) { g = 0; } break; } } return g; } int main() { int a,...
#include <bits/stdc++.h> using namespace std; int gcd(int f, int s) { if (s == 0) return f; else return gcd(s, f % s); } int const N = 1000006; long long const M = 1000 * 1000 * 1000 + 7; long double const ep = .000000000000000001; int arr[N]; int main() { int n, m; cin >> n ...
#include <bits/stdc++.h> using namespace std; int used[550][550]; int main() { int x, y; int x0, y0; cin >> x >> y; cin >> x0 >> y0; string s; cin >> s; int cnt = 0; cout << 1 << ; int last = x * y - 1; for (int i = 0; i < s.size(); i++) { used[x0][y0] = 1; b...
#include <bits/stdc++.h> using namespace std; const int N = 200010; const int oo = 1e9; int xm, ym, zm, n, m, k, xmn, xmx, ymn, ymx, zmn, zmx; struct point { int x, y, z, idx; bool operator<(const point &rhs) const { return x < rhs.x; } void print() { cout << x << << y << << z << endl; } ...
#include <bits/stdc++.h> const long long MAX_N = 2e5 + 100; const long long MOD = 1e9 + 7; using namespace std; long long rm[MAX_N][20]; long long a[MAX_N]; map<int, int> last; long long ans; const long long c = (1ll << 50) - 1; long long ask(long long l, long long r) { long long len = r - l + 1; ...
#include <bits/stdc++.h> using namespace std; char A[3][3], B[3][3]; int main() { scanf( %s , A[0]); scanf( %s , A[1]); scanf( %s , B[0]); scanf( %s , B[1]); string a = A[0], b = B[0]; a += A[1][1]; a += A[1][0]; b += B[1][1]; b += B[1][0]; for (int i = 0; i < a.length(); i...
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const long double PI = 3.141592653589793238462643383279502884197; long long fac[1] = {1}, inv[1] = {1}; long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } long long mp(long long a, long long b) { long long ret ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1000100; struct Vertex { long long cnt; long long sum; Vertex() { cnt = sum = 0; } }; struct SegmentTree { Vertex tree[4 * MAXN]; SegmentTree() = default; void calc(int v) { int lv = 2 * v + 1; int rv = 2 * v + ...
#include <bits/stdc++.h> using namespace std; bool condition(int year) { int year_arr[4]; int boo; for (int i = 3; i >= 0; i--) { year_arr[i] = year % 10; year = year / 10; } if (year_arr[0] == year_arr[1] \|\| year_arr[0] == year_arr[2] \|\| year_arr[0] == year_arr[3] \|\| year_ar...
#include <bits/stdc++.h> using namespace std; int main() { long long int n; cin >> n; string s, p, r; s = 1 ; cin >> p; s = s + p; for (long long int i = 2; i < n - 1; i++) { if (n % i == 0) { p = s.substr(1, i); s = s.substr(i + 1, n); reverse(p.begin(), p...
#include <bits/stdc++.h> #pragma warning(disable : 4996) using namespace std; int n, m; struct GUGAN { int s, e; int type; int idx, x; bool operator<(const GUGAN &p) const { return e < p.e; } GUGAN() {} GUGAN(int s, int e, int type, int idx, int x) { this->s = s, this->e = e, this-...
#include <bits/stdc++.h> using namespace std; double p[105]; double a[205][205], b[205][205]; int main(void) { int n; scanf( %d , &n); for (int i = 0; i <= n; i++) { scanf( %lf , &p[i]); } for (int i = 0; i <= 2 * n; i++) for (int j = 0; j <= 2 * n; j++) a[i][j] = -100; for (...
#include <bits/stdc++.h> using namespace std; const long long INF = 1e18; const long long SIZE = 1e5 + 5; const long long mod = 1e9 + 7; int main() { long long t = 0, n, x, y, z, i, j, k, g, p, q, ans = 0, sum = 0, c = 0; string s, s1, s2; scanf( %lld , &q); while (q--) { cin >> s; ...
#include <bits/stdc++.h> using namespace std; int f[300010][2]; int dp[300010][2]; int Flag[300010]; int main() { int n, k; scanf( %d%d , &n, &k); for (int i = 1; i <= n; i++) scanf( %d , &f[i][0]); for (int i = 1; i <= n; i++) scanf( %d , &f[i][1]); if (k == 1) { for (int ii = 0; ii...
#include <bits/stdc++.h> using namespace std; int main() { string a, b, c, d, e, f, g; cin >> a >> b >> c >> d >> e >> f; if (a[0] == b[0] \|\| a[0] == b[1] \|\| a[0] == c[0] \|\| a[0] == c[1] \|\| a[0] == d[0] \|\| a[0] == d[1] \|\| a[0] == e[0] \|\| a[0] == e[1] \|\| a[0] == f[0] \|\| a[0] == f[1] \|\| a[...
#include <bits/stdc++.h> using namespace std; const int N = 601000; struct SuffixArray { int s[N], sa[N], rk[N], height[N], t[N], t2[N], c[N], n; void clear() { n = 0; } void build_sa(int m) { int x = t, y = t2; for (int i = 0; i < m; i++) c[i] = 0; for (int i = 0; i < n; i++) c[x[...
#include <bits/stdc++.h> using namespace std; const int MAX_N = 50; char s[MAX_N + 4]; int as[MAX_N][MAX_N], ass[MAX_N + 1][MAX_N + 1]; inline int area(int x0, int x1, int y0, int y1, int n) { if (x0 < 0 \|\| x1 > n \|\| y0 < 0 \|\| y1 > n) return 0; return ass[y1][x1] - ass[y1][x0] - ass[y0][x1] + ass[y0][...
#include <bits/stdc++.h> using ::std::cin; using ::std::cout; using ::std::string; using ::std::vector; int binpow(int a, int n) { if (n == 0) return 1; if (n % 2 == 0) { int b = binpow(a, n / 2); return b * b; } else return binpow(a, n - 1) * a; } int main() { int n, l, ...
#include <bits/stdc++.h> using namespace std; double PI = acos(-1); struct point { long long x, y; point(long long x = 0, long long y = 0) { this->x = x; this->y = y; } bool operator==(point& p) { return p.x == x && p.y == y; } } a[100010], origin; struct vecto { long long x, y...
#include <bits/stdc++.h> using namespace std; static const int MXN = 20000 + 2; const int mod = 998244353; long long dis[MXN]; struct CostFlow { static const long long INF = 102938475610293847LL; struct Edge { int v, r; long long f, c; Edge(int a, int b, int _c, int d) : v(a), r(b), ...
#include <bits/stdc++.h> using namespace std; struct Node { int sum = 0; Node L = 0, R = 0; Node() {} Node(int s, Node* l, Node* r) : sum(s), L(l), R(r) {} }; typedef Node* Ptr; Ptr tree[100100]; Ptr create() { Ptr p = new Node(); p->L = p->R = p; return p; } Ptr add(Ptr ro...
#include <bits/stdc++.h> using namespace std; const int maxn = 5e5 + 10; template <typename T> inline T read() { T ans = 0, flag = 1; char c = getchar(); while (!isdigit(c)) { if (c == - ) flag = -1; c = getchar(); } while (isdigit(c)) { ans = ans * 10 + c - 48; c = ...
#include <bits/stdc++.h> using namespace std; int a, b, l, r; void load() { cin >> a >> b >> l >> r; } string s; bool jel[30]; void konstrukcija() { s = ; for (int i = 0; i < a; i++) { char c = i + a ; s += c; } char c = s[s.size() - 1]; for (int i = 0; i < b; i++) s += c;...
#include <bits/stdc++.h> using namespace std; long long basis[62], a[200005], pref[200005]; int siz = 0; bool ins(long long x) { for (int i = 0; i < 62; i++) { if (!(x & (1LL << i))) continue; if (!basis[i]) { basis[i] = x; siz++; return true; } else { x ^= ...
#include <bits/stdc++.h> int main(void) { long long int N, num, ans, start = 0; int ind; char c, car; int flag = 0; scanf( %I64d n , &N); car = (char )malloc(sizeof(char) * N); num = (long long int )malloc(sizeof(long long int) N); ind = (int )malloc(sizeof(int) N); for (...
#include <bits/stdc++.h> using namespace std; const int maxn = 66, maxm = 200006, maxs = 65536, pr[] = {2, 3, 5, 7, 11, 13, 17, 19}; int n, P, a[maxm], b[maxm], f[maxs], s1[maxn], s2[maxn]; long long X, Y, ans, p[maxn]; long long mul(long long x, long long y, long long MOD) { x %= MOD; y %...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; int a[n], odd = 0, evenindex; for (int i = 0; i < n; i++) { cin >> a[i]; if (a[i] % 2 == 1) odd++; if (a[i] % 2 == 0) evenindex = i + 1; } ...
#include <bits/stdc++.h> using namespace std; map<long long, long long> tedad; int main() { long long a; string s; cin >> a; cin >> s; long long ans = 0; for (int i = 0; i < s.size(); i++) { for (int j = i, sum = 0; j < s.size(); j++) { sum += s[j] - 48; tedad[sum]++;...
#include <bits/stdc++.h> using namespace std; int main() { long long n, k; cin >> n >> k; string str; cin >> str; int overlap = -1; int max = -1; for (int i = 1; i < n; ++i) { if (str[i] == str[0]) { int j = 0; for (j = 0; i + j < n; ++j) { if (str[i + j] ...
#include <bits/stdc++.h> using namespace std; int main() { long long t; cin >> t; while (t--) { long long n; cin >> n; long long sum = 0; long long x = 0; while (n--) { long long s; cin >> s; sum += s; x ^= s; } cout << 2 << n ;...
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1); pair<double, double> R[100001], P; double dist(pair<double, double> a, pair<double, double> b) { return (a.first - b.first) * (a.first - b.first) + (a.second - b.second) * (a.second - b.second); } double dist(pair<doubl...
#include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; using pll = pair<ll, ll>; using pdd = pair<double, double>; using vi = vector<int>; using vii = vector<pii>; using vs = vector<string>; const double PI = acos(-1.0); const double EPS = 1e-14; const int ...
#include <bits/stdc++.h> using namespace std; int n, m, ans[1009], t, l, r, low = 1e8, vis[1009]; vector<pair<int, int> > v0, v1; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> m; for (int i = 0; i < m; i++) { cin >> t >> l >> r; if (t == 0) ...
#include <bits/stdc++.h> using namespace std; typedef pair<int, int> ll; typedef vector<int> vl; typedef vector<ll> vll; typedef vector<vl> vvl; template <typename T> ostream &operator<<(ostream &o, vector<T> v) { if (v.size() > 0) o << v[0]; for (unsigned i = 1; i < v.size(); i++) o << << v[i...
#include <bits/stdc++.h> using namespace std; const int MAX = 1000009; void solve() { unsigned long long n, x; cin >> n >> x; int count = 0; for (int i = 1; i <= floor(sqrt(x)); i++) { if ((x % i == 0) && (i <= n) && (x / i <= n)) { if ((x / i != i)) { count += 2; }...
#include <bits/stdc++.h> using namespace std; const int MAXN = 200005; const int MAXM = 1000005; const int MOD = 1000000007; const int MAMOD = 998244353; const int INF = 0x3f3f3f3f; const long long LLINF = 0x3f3f3f3f3f3f3f3f; const double PI = acos(-1.0); const double EPS = 1e-8; int a[1005], color[...
#include <bits/stdc++.h> const long long MOD = 1e9 + 7; const long long INF = 1e18; using namespace std; long long powmod(long long a, long long b) { long long res = 1ll; while (b) { if (b & 1) res = (res * a) % MOD; } } int main() { ios::sync_with_stdio(false); cin.tie(NULL); ...
#include <bits/stdc++.h> using namespace std; int main() { long long int n, a, b; cin >> n; while (n--) { cin >> a >> b; if (a != b) { cout << Happy Alex << endl; return 0; } } cout << Poor Alex << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; int cand_sums[n]; memset(cand_sums, 0, sizeof cand_sums); vector<vector<int>> votes = vector<vector<int>>(m, vector<int>(n, 0)); vector<priority_queue<pair<int, int>>> bad_stations = vector<priority_q...
#include <bits/stdc++.h> using namespace std; int main() { long long t, a, b; string s; scanf( %lld , &t); vector<int> v; while (t--) { v.clear(); scanf( %lld%lld , &a, &b); cin >> s; for (int i = 0; i < s.length(); i++) { if (s[i] == 0 ) v.push_back(i); } ...
#include <bits/stdc++.h> using namespace std; int gcd(int f, int s) { if (s == 0) return f; else return gcd(s, f % s); } int const N = 200005; long long const mod = 1000 * 1000 * 1000 + 7; map<string, long long> m; string s[N]; int main() { int a; cin >> a; if (a < 6) ...
#include <bits/stdc++.h> int main() { int x, y, z; while (scanf( %d%d , &x, &y) == 2) { z = abs(x) + abs(y); if (x > 0) { if (y > 0) printf( 0 %d %d 0 n , z, z); else printf( 0 -%d %d 0 n , z, z); } else { if (y > 0) printf( -%d 0 0 %d n ...
#include <bits/stdc++.h> using namespace std; int a1, a2, a3, a4; int main() { scanf( %d%d%d%d , &a1, &a2, &a3, &a4); if (min(a1, a2) < max(a3, a4)) { puts( -1 ); return 0; } if (a1 + a2 == a3 + a4) { puts( -1 ); return 0; } if (a3 - a4 == 1) { int n = a3; ...
#include <bits/stdc++.h> using namespace std; int p[5007][5007]; int pre[5007]; int a, b, c, ans, res, del; int solve(int x, int y) { res = 0; for (int i = 0; i <= x && i <= y; i++) { del = pre[i]; del = (1LL * del * p[x][i]) % 998244353; del = (1LL * del * p[y][i]) % 998244353; ...
#include <bits/stdc++.h> #pragma GCC optimize(2) #pragma GCC optimize(3) using namespace std; inline int read() { int x = 0, neg = 1; char op = getchar(); while (!isdigit(op)) { if (op == - ) neg = -1; op = getchar(); } while (isdigit(op)) { x = 10 * x + op - 0 ; op...
#include <bits/stdc++.h> using namespace std; int n, k, a[303], flipped[303]; int query(int l, int r) { cout << ? << l << << r << endl; cin >> l; fflush(stdin); return l; } void flip(int l, int r) { for (int i = l; i < r + 1; i++) { flipped[i] ^= 1; } } void sol(int l,...
#include <bits/stdc++.h> using namespace std; int a[310], g[310][310], use[310]; int tm; void add(int x, int y) { g[x][y] = g[y][x] = 1; tm++; } int main() { int n, m, K; scanf( %d%d%d , &n, &m, &K); for (int i = 0; i < K; i++) { scanf( %d , &a[i]); use[a[i]] = 1; } s...
#include <bits/stdc++.h> using namespace std; vector<vector<long long> > mul(const vector<vector<long long> > &a, const vector<vector<long long> > &b, const long long &mod) { int R1 = a.size(), C1 = a.front().size(); int R2 = b.size(), C2 = b...
#include <bits/stdc++.h> using namespace std; bool prime(long long n) { for (int i = 2; i <= sqrt(n); i++) if (n % i == 0) return false; return true; } int main() { string s, s1; long long a, b, c, m, n, k, t, l, d, p, nl, np; t = 1; while (t--) { cin >> n >> d; vector<...
#include <bits/stdc++.h> int main() { int n; std::cin >> n; std::vector<int> a(n); std::vector<int> mn(n); for (int i = 0; i < n; ++i) { std::cin >> a[i]; } mn[n - 1] = a[n - 1]; for (int i = n - 2; i >= 0; --i) { if (a[i] < mn[i + 1]) { mn[i] = a[i]; } else {...
#include <bits/stdc++.h> using namespace std; int n, dp[500005]; pair<int, int> p[500005]; int main() { scanf( %d , &n); for (int i = 0; i < n; ++i) scanf( %d%d , &p[i].first, &p[i].second); sort(p, p + n); for (int i = 0; i < n; ++i) { if (i) dp[i] = max(dp[i], dp[i - 1]); int ub = ...
#include <bits/stdc++.h> using namespace std; inline long long read() { long long sum = 0, ff = 1; char ch = getchar(); while (ch < 0 \|\| ch > 9 ) { if (ch == - ) ff = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) sum = sum * 10 + ch - 0 , ch = getchar(); return sum * ...
#include <bits/stdc++.h> using namespace std; pair<int, int> arr[3001]; const long long int INF = 1000000000000000; int n; long long int dp[3001][3001]; long long int solve(int pos, int prev) { if (pos > n) return 0; if (dp[pos][prev] != -INF) return dp[pos][prev]; long long int pin = arr[pos].s...
#include <bits/stdc++.h> using namespace std; int n; char ch[100]; int main() { scanf( %d , &n); int l = 0, r = 1e9; for (int i = 1; i <= min(29, n); i++) { int mid = (l + r) >> 1; printf( %d %d n , mid, 1); fflush(stdout); scanf( %s , ch); if (ch[0] == b ) l =...
#include <bits/stdc++.h> using namespace std; const int N = 1005; double dis(long u, long v, long p, long q) { return sqrt(((double)u - p) * (u - p) + ((double)q - v) * (q - v)); } struct point { int x; int y; }; int main() { int n, m; cin >> n >> m; if (n == 0) { cout << 0 <...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; const int INF = 0x3f3f3f3f; const double PI = acos(-1.0); const double eps = 1e-10; const int M = 1e9 + 7; int dcmp(double first) { if (fabs(first) < eps) return 0; return first < 0 ? -1 : 1; } int a[N]; int main() { i...
#include <bits/stdc++.h> using namespace std; using namespace std; bool onSegment(pair<int, int> p, pair<int, int> q, pair<int, int> r) { if (q.first <= max(p.first, r.first) && q.first >= min(p.first, r.first) && q.second <= max(p.second, r.second) && q.second >= min(p.second, r.second)) ...
#include <bits/stdc++.h> using namespace std; const int maxn = 100010; const int maxm = 100010; struct Arc { int to, next; } arcs[maxm]; int head[maxn], ne, out[maxn], ans[maxn]; inline void add_arc(int u, int v); priority_queue<int> Q; int main() { int n, m, i, u, v, k; while (scanf( %d%d...
#include <bits/stdc++.h> using namespace std; int main() { int z[6] = {1, 0, 0, 1, 2, 2}; int r[6] = {2, 2, 1, 0, 0, 1}; int l[6] = {0, 1, 2, 2, 1, 0}; long long int m, n, num; while (cin >> m >> n) { num = m % 6; if (z[num] == n) { cout << 1 << endl; } else if (r[num] ...
#include <bits/stdc++.h> using namespace std; const int MaxN = 1005; const int oo = 1000000000; const long long Base = 1000000007; typedef int Tarr[MaxN]; long long x, y, a, b, n, m, xx, yy, r1, r2, r3, r4; void Ok(int Val) { int xx = Val * a, yy = Val * b; if (xx % 2 == 0) { r1 = max((long ...
#include <bits/stdc++.h> using namespace std; const int N = 100 * 1000 + 13; bool flagBlack = false, flagWhite = false; int a[N]; int n; int lacesB[N]; int lacesW[N]; inline void read() { cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; if (a[i] == 0) { flagBlack = true; ...
#include <bits/stdc++.h> using namespace std; const long long INF = 1e18; const long long MAXN = 1e2 + 20; long long n, w, ans[MAXN]; pair<long long, long long> a[MAXN]; long long sa(long long n, long long k) { if (n % k) return n / k + 1; return n / k; } void fail() { cout << -1; exit(0...

#include <bits/stdc++.h> using namespace std; struct EDGE { int v, next; }; EDGE w[222]; long long f[1 << 17], Y; int ans[22], ww[22], visit[22], N, M, W = 0; long long work() { memset(f, 0, sizeof(f)); f[0] = 1; for (int i = 0; i < 1 << N; ++i) if (f[i]) { if (i == 3) int as...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int t; cin >> t; bool flag; while (t--) { int n; cin >> n; long long int a[n]; for (int i = 0; i < n; i++) cin >> a[i]; flag = true; ...

#include <bits/stdc++.h> using namespace std; template <class T> using VV = vector<vector<T>>; template <class T> inline T SMIN(T& a, const T b) { return a = (a > b) ? b : a; } template <class T> inline T SMAX(T& a, const T b) { return a = (a < b) ? b : a; } template <class Iter> void dump...

#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; inline void add(long long &a, long long b) { a += b; a %= MOD; } inline void sub(long long &a, long long b) { a -= b; a %= MOD; } inline long long mul(long long a, long long b) { return (long long)a * b % MOD; } ...

#include <bits/stdc++.h> using namespace std; int n, l[1000005], dp[1000005][2][2]; char s[1000005]; void Calc(int k) { if (s[k] == 0 ) dp[k][0][0] = 1; else if (s[k] == 1 ) dp[k][1][1] = 1; else { dp[k][1][0] = 1; dp[k][0][1] = 1; } } void Change(int x, int L, int ...

#include <bits/stdc++.h> using namespace std; const int N = 2e6 + 10, mod = 1e9 + 7; int rd() { int x = 0, w = 1; char ch = 0; while (ch < 0 || ch > 9 ) { if (ch == - ) w = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + (ch ^ 48); ch = getchar()...

#include <bits/stdc++.h> using namespace std; int n; vector<int> edges[(200 * 1000 + 5)]; vector<int> f; vector<int> a; int dp[(200 * 1000 + 5)][5]; void read_data() { cin >> n; int u, v; for (int i = 1; i < n; i++) { scanf( %d %d , &u, &v); edges[u].push_back(v); edges[v].pu...

#include <bits/stdc++.h> using namespace std; void _print(int32_t t) { cerr << t; } void _print(int64_t t) { cerr << t; } void _print(string t) { cerr << t; } void _print(char t) { cerr << t; } void _print(long double t) { cerr << t; } void _print(double t) { cerr << t; } void _print(unsigned long long ...

#include <bits/stdc++.h> using namespace std; vector<int> s[100005]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m, i, j, a, b; cin >> n >> m; if (n == 1 && m == 1) { cout << YES n << 1; } else if (n == 1 && m == 2) { cout << NO ; } els...

#include <bits/stdc++.h> using namespace std; void printVector(vector<string> &v) { for (auto x : v) cout << x << n ; } void printVector(vector<int> &v) { for (auto x : v) cout << x << ; cout << n ; } int main() { cin.tie(0); cout.tie(0); ios::sync_with_stdio(0); int t; ...

#include <bits/stdc++.h> using namespace std; struct node { int len, l, r; bool operator<(const node &a) const { return len > a.len; } }; int day[200010]; int m[200010]; int main() { int n, k, c, i, j; scanf( %d %d , &n, &k); c = 0; for (i = 0; i < n; i++) { scanf( %d , &day[i]...

#include <bits/stdc++.h> using namespace std; inline void OPEN(const string &s) { freopen((s + .in ).c_str(), r , stdin); freopen((s + .out ).c_str(), w , stdout); } int main() { int n; scanf( %d , &n); int art; scanf( %d , &art); int alex; scanf( %d , &alex); int ans[110...

#include <bits/stdc++.h> using namespace std; int M[2002][2002]; struct TA { int a[2002], n; void init(int _n) { n = _n; memset(a, 0, sizeof a); } int get(int p) { int ret = 0; for (p++; p > 0; p -= p & -p) ret ^= a[p - 1]; return ret; } void change(int l) { ...

#include <bits/stdc++.h> using namespace std; class MinHeap { vector<long long int> arr; long long int size; public: MinHeap() { size = 0; } long long int parent(long long int i) { return (i - 1) / 2; } long long int lchild(long long int i) { return 2 * i + 1; } long long int rchild(lo...

#include <bits/stdc++.h> using namespace std; vector<long long> invi(long long n) { int x; vector<long long> a; for (long long i = 0; i < n; i++) { cin >> x; a.push_back(x); } return a; } void solve(); int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); in...

#include <bits/stdc++.h> using namespace std; int main() { char prev[26], next[26]; for (int i = 0; i < 26; i++) prev[i] = next[i] = -1; int n; cin >> n; for (int i = 0; i < n; i++) { string s; cin >> s; if (prev[s[0] - a ] == -1) prev[s[0] - a ] = 0; if (next[s[(int)s....

#include <bits/stdc++.h> int n, a[100000], sum = 0; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , &a[i]); sum += a[i]; } if (sum % n != 0) printf( %d n , n - 1); else printf( %d n , n); return 0; }

#include <bits/stdc++.h> using namespace std; const int INFint = 2147483547; const long long INF = 9223372036854775807ll; const long long MOD = 1000000007ll; const long double EPS = 1e-13; string min_cyclic_shift(string s) { s += s; int n = (int)s.length(); int i = 0, ans = 0; while (i < n /...

#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); bool isPrime(int n) { if (n == 1) return false; for (int i = 2; i * i <= n; ++i) { if (n % i == 0) return false; } return true; } void solve() { int n, sum = 0; cin ...

#include <bits/stdc++.h> using namespace std; int main() { int n, x; int a[100000 + 3], b[100000 + 3]; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; b[i] = a[i]; } sort(b, b + n); int cnt = 1; for (int i = 0; i < n; i++) { if (a[i] != b[i]) { cnt++; ...

#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; int n, m, p; long long ans = -1e18; struct nd { int val, c; friend bool operator<(nd a, nd b) { return a.val < b.val; } } a[N], b[N]; struct mon { int x, y, z; friend bool operator<(mon a, mon b) { return a.x < b.x; } }...

#include <bits/stdc++.h> using namespace std; int main() { long long n, k, s; while (cin >> n >> k >> s) { long long temp = (s / k); long long rem = s % k; temp++; if (((n - 1) * k < s || (k > s))) { cout << NO << endl; return 0; } cout << YES << endl;...

#include <bits/stdc++.h> using namespace std; int t; long long a, b, c, d; long long solve(long long x) { long long times = x / d + 1; long long sum = (x / d + 1) * a; long long finished; if (x < c) { finished = 0; } else { finished = (x - c) / d + 1; } long long left = t...

#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:1024000000,1024000000 ) const double pi = 2.0 * asin(1.0), eps = 1e-12; const int maxn = 2100, maxm = 1100000, inf = 0x3f3f3f3f; char ch[maxn][maxn]; int ans[maxn]; int main() { int n, m, i, j, l, x; while (scanf( %d%d%d...

#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 7; vector<int> cur; void split(int x, int p) { if (p == 1) { cout << x << ; return; } cout << x - 1 << ; split(x - 1, p - 1); } int main() { ios::sync_with_stdio(false); cin.tie(0); ; long ...

#include <bits/stdc++.h> using std::cin; using std::cout; using std::endl; using std::sort; using std::string; using std::swap; int main() { int times = INT_MAX; int a[6]; while (times-- && ~scanf( %d , &a[0])) { for (int i = 1; i < 6; ++i) scanf( %d , a + i); printf( %d n , (a[0] ...

#include <bits/stdc++.h> const double inf = 1e20; using namespace std; int n, m, i, j, f; char a[55][55]; int vis[55][55]; int dx[4] = {1, 0, -1, 0}; int dy[4] = {0, 1, 0, -1}; void dfs(int x, int y, int oldx, int oldy) { if (x == i && y == j && vis[i][j]) { f = 1; return; } for ...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n], x = 0; for (int i = 0; i < n; i++) { cin >> a[i]; if (a[i] == 1) { x++; } } if (x == n) { cout << n - 1 << n ; } else { int p = 0, m = 0; for (int i = 0; i ...

#include <bits/stdc++.h> using namespace std; int n; string sherlock, moriarty; int algos(bool upper) { int res = 0; multiset<int> S; for (int i = 0; i < n; ++i) S.insert((int)moriarty[i]); for (int i = 0; i < n; ++i) { multiset<int>::iterator it; if (upper) it = S.upper_boun...

#include <bits/stdc++.h> using namespace std; const int MAX = 100005; int n; int firzero = -1; int a[MAX]; int main() { scanf( %d , &n); for (int i = 0; i < n; ++i) { scanf( %d , &a[i]); if (!a[i] && firzero == -1) firzero = i; } if (a[n - 1]) printf( NO n ); else { ...

#include <bits/stdc++.h> using namespace std; int v[100005], goal[100005], parent[100005]; bool used[100005]; int n; vector<int> A[100005], leaves, sol; void dfs(int node, int current_xor, int other_xor) { if (used[node]) return; used[node] = 1; if ((v[node] ^ current_xor) != goal[node]) { ...

#include <bits/stdc++.h> using namespace std; const int NN = 150000 + 10; int N, M, H; int b[NN], a[NN]; int _max[NN << 2]; int add[NN << 2]; void up(int idx) { _max[idx] = max(_max[idx << 1], _max[idx << 1 | 1]); } void build(int l, int r, int idx) { _max[idx] = -100000000; add[idx] = 0; if...

#include <bits/stdc++.h> using namespace std; char s[1000]; int main() { int n; scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %s , &s); } for (int i = 0; i < 10; i++) cout << ?? << i << >> << i << ?? n ; cout << ??>>? n ; for (int i = 0; i < 9; i++) { cout << ...

#include <bits/stdc++.h> using namespace std; void solve() { long long N, K; string X; cin >> N >> K; cin >> X; string foo = X; for (long long i = 0; i + K < foo.size(); i++) { foo[i + K] = foo[i]; } if (foo >= X) { cout << foo.size() << endl; cout << foo << endl; ...

#include <bits/stdc++.h> using namespace std; vector<int> A[7], B[100005]; int n, a[5005], f[5005][5005], ans; int main() { int i, j, u, v, w, p, q, r; scanf( %d , &n); for (i = 1; i <= n; i++) scanf( %d , &a[i]); for (i = n; i >= 1; i--) { A[a[i] % 7].push_back(i); B[a[i]].push_back...

#include <bits/stdc++.h> using namespace std; int main() { long long n, x, mx = 0, ans; cin >> n; while (n--) { cin >> x; if (x > mx) mx = x; } ans = mx ^ x; cout << ans << endl; return 0; }

#include <bits/stdc++.h> const int INF = 0x3f3f3f3f; const long long int INFLL = 0x3f3f3f3f3f3f3f3fll; long long int getint() { long long int ret = 0; bool f = 0; char c; while ((c = getchar()) < 0 || c > 9 ) if (c == - ) f ^= 1; while (c >= 0 && c <= 9 ) { ret = ret * 10 + ...

#include <bits/stdc++.h> using namespace std; int main() { int i, n; string st; vector<string> v; map<string, int> mp; cin >> n; for (i = 0; i < n; i++) { cin >> st; if (mp[st] == 0) { v.push_back(st); } mp[st]++; } if (v.size() == 1) cout << v[0...

#include <bits/stdc++.h> using namespace std; int res[1111]; bool sol(int d) { int g = 1, e; for (e = 2; e <= sqrt(d); e++) { if (d % e == 0) { while (d % e == 0) d /= e; if (d != 1) { g = 0; } break; } } return g; } int main() { int a,...

#include <bits/stdc++.h> using namespace std; int gcd(int f, int s) { if (s == 0) return f; else return gcd(s, f % s); } int const N = 1000006; long long const M = 1000 * 1000 * 1000 + 7; long double const ep = .000000000000000001; int arr[N]; int main() { int n, m; cin >> n ...

#include <bits/stdc++.h> using namespace std; int used[550][550]; int main() { int x, y; int x0, y0; cin >> x >> y; cin >> x0 >> y0; string s; cin >> s; int cnt = 0; cout << 1 << ; int last = x * y - 1; for (int i = 0; i < s.size(); i++) { used[x0][y0] = 1; b...

#include <bits/stdc++.h> using namespace std; const int N = 200010; const int oo = 1e9; int xm, ym, zm, n, m, k, xmn, xmx, ymn, ymx, zmn, zmx; struct point { int x, y, z, idx; bool operator<(const point &rhs) const { return x < rhs.x; } void print() { cout << x << << y << << z << endl; } ...

#include <bits/stdc++.h> const long long MAX_N = 2e5 + 100; const long long MOD = 1e9 + 7; using namespace std; long long rm[MAX_N][20]; long long a[MAX_N]; map<int, int> last; long long ans; const long long c = (1ll << 50) - 1; long long ask(long long l, long long r) { long long len = r - l + 1; ...

#include <bits/stdc++.h> using namespace std; char A[3][3], B[3][3]; int main() { scanf( %s , A[0]); scanf( %s , A[1]); scanf( %s , B[0]); scanf( %s , B[1]); string a = A[0], b = B[0]; a += A[1][1]; a += A[1][0]; b += B[1][1]; b += B[1][0]; for (int i = 0; i < a.length(); i...

#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const long double PI = 3.141592653589793238462643383279502884197; long long fac[1] = {1}, inv[1] = {1}; long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } long long mp(long long a, long long b) { long long ret ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 1000100; struct Vertex { long long cnt; long long sum; Vertex() { cnt = sum = 0; } }; struct SegmentTree { Vertex tree[4 * MAXN]; SegmentTree() = default; void calc(int v) { int lv = 2 * v + 1; int rv = 2 * v + ...

#include <bits/stdc++.h> using namespace std; bool condition(int year) { int year_arr[4]; int boo; for (int i = 3; i >= 0; i--) { year_arr[i] = year % 10; year = year / 10; } if (year_arr[0] == year_arr[1] || year_arr[0] == year_arr[2] || year_arr[0] == year_arr[3] || year_ar...

#include <bits/stdc++.h> using namespace std; int main() { long long int n; cin >> n; string s, p, r; s = 1 ; cin >> p; s = s + p; for (long long int i = 2; i < n - 1; i++) { if (n % i == 0) { p = s.substr(1, i); s = s.substr(i + 1, n); reverse(p.begin(), p...

#include <bits/stdc++.h> #pragma warning(disable : 4996) using namespace std; int n, m; struct GUGAN { int s, e; int type; int idx, x; bool operator<(const GUGAN &p) const { return e < p.e; } GUGAN() {} GUGAN(int s, int e, int type, int idx, int x) { this->s = s, this->e = e, this-...

#include <bits/stdc++.h> using namespace std; double p[105]; double a[205][205], b[205][205]; int main(void) { int n; scanf( %d , &n); for (int i = 0; i <= n; i++) { scanf( %lf , &p[i]); } for (int i = 0; i <= 2 * n; i++) for (int j = 0; j <= 2 * n; j++) a[i][j] = -100; for (...

#include <bits/stdc++.h> using namespace std; const long long INF = 1e18; const long long SIZE = 1e5 + 5; const long long mod = 1e9 + 7; int main() { long long t = 0, n, x, y, z, i, j, k, g, p, q, ans = 0, sum = 0, c = 0; string s, s1, s2; scanf( %lld , &q); while (q--) { cin >> s; ...

#include <bits/stdc++.h> using namespace std; int f[300010][2]; int dp[300010][2]; int Flag[300010]; int main() { int n, k; scanf( %d%d , &n, &k); for (int i = 1; i <= n; i++) scanf( %d , &f[i][0]); for (int i = 1; i <= n; i++) scanf( %d , &f[i][1]); if (k == 1) { for (int ii = 0; ii...

#include <bits/stdc++.h> using namespace std; int main() { string a, b, c, d, e, f, g; cin >> a >> b >> c >> d >> e >> f; if (a[0] == b[0] || a[0] == b[1] || a[0] == c[0] || a[0] == c[1] || a[0] == d[0] || a[0] == d[1] || a[0] == e[0] || a[0] == e[1] || a[0] == f[0] || a[0] == f[1] || a[...

#include <bits/stdc++.h> using namespace std; const int N = 601000; struct SuffixArray { int s[N], sa[N], rk[N], height[N], t[N], t2[N], c[N], n; void clear() { n = 0; } void build_sa(int m) { int *x = t, *y = t2; for (int i = 0; i < m; i++) c[i] = 0; for (int i = 0; i < n; i++) c[x[...

#include <bits/stdc++.h> using namespace std; const int MAX_N = 50; char s[MAX_N + 4]; int as[MAX_N][MAX_N], ass[MAX_N + 1][MAX_N + 1]; inline int area(int x0, int x1, int y0, int y1, int n) { if (x0 < 0 || x1 > n || y0 < 0 || y1 > n) return 0; return ass[y1][x1] - ass[y1][x0] - ass[y0][x1] + ass[y0][...

#include <bits/stdc++.h> using ::std::cin; using ::std::cout; using ::std::string; using ::std::vector; int binpow(int a, int n) { if (n == 0) return 1; if (n % 2 == 0) { int b = binpow(a, n / 2); return b * b; } else return binpow(a, n - 1) * a; } int main() { int n, l, ...

#include <bits/stdc++.h> using namespace std; double PI = acos(-1); struct point { long long x, y; point(long long x = 0, long long y = 0) { this->x = x; this->y = y; } bool operator==(point& p) { return p.x == x && p.y == y; } } a[100010], origin; struct vecto { long long x, y...

#include <bits/stdc++.h> using namespace std; static const int MXN = 20000 + 2; const int mod = 998244353; long long dis[MXN]; struct CostFlow { static const long long INF = 102938475610293847LL; struct Edge { int v, r; long long f, c; Edge(int a, int b, int _c, int d) : v(a), r(b), ...

#include <bits/stdc++.h> using namespace std; struct Node { int sum = 0; Node *L = 0, *R = 0; Node() {} Node(int s, Node* l, Node* r) : sum(s), L(l), R(r) {} }; typedef Node* Ptr; Ptr tree[100100]; Ptr create() { Ptr p = new Node(); p->L = p->R = p; return p; } Ptr add(Ptr ro...

#include <bits/stdc++.h> using namespace std; const int maxn = 5e5 + 10; template <typename T> inline T read() { T ans = 0, flag = 1; char c = getchar(); while (!isdigit(c)) { if (c == - ) flag = -1; c = getchar(); } while (isdigit(c)) { ans = ans * 10 + c - 48; c = ...

#include <bits/stdc++.h> using namespace std; int a, b, l, r; void load() { cin >> a >> b >> l >> r; } string s; bool jel[30]; void konstrukcija() { s = ; for (int i = 0; i < a; i++) { char c = i + a ; s += c; } char c = s[s.size() - 1]; for (int i = 0; i < b; i++) s += c;...

#include <bits/stdc++.h> using namespace std; long long basis[62], a[200005], pref[200005]; int siz = 0; bool ins(long long x) { for (int i = 0; i < 62; i++) { if (!(x & (1LL << i))) continue; if (!basis[i]) { basis[i] = x; siz++; return true; } else { x ^= ...

#include <bits/stdc++.h> int main(void) { long long int N, *num, ans, start = 0; int *ind; char c, *car; int flag = 0; scanf( %I64d n , &N); car = (char *)malloc(sizeof(char) * N); num = (long long int *)malloc(sizeof(long long int) * N); ind = (int *)malloc(sizeof(int) * N); for (...

#include <bits/stdc++.h> using namespace std; const int maxn = 66, maxm = 200006, maxs = 65536, pr[] = {2, 3, 5, 7, 11, 13, 17, 19}; int n, P, a[maxm], b[maxm], f[maxs], s1[maxn], s2[maxn]; long long X, Y, ans, p[maxn]; long long mul(long long x, long long y, long long MOD) { x %= MOD; y %...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; int a[n], odd = 0, evenindex; for (int i = 0; i < n; i++) { cin >> a[i]; if (a[i] % 2 == 1) odd++; if (a[i] % 2 == 0) evenindex = i + 1; } ...

#include <bits/stdc++.h> using namespace std; map<long long, long long> tedad; int main() { long long a; string s; cin >> a; cin >> s; long long ans = 0; for (int i = 0; i < s.size(); i++) { for (int j = i, sum = 0; j < s.size(); j++) { sum += s[j] - 48; tedad[sum]++;...

#include <bits/stdc++.h> using namespace std; int main() { long long n, k; cin >> n >> k; string str; cin >> str; int overlap = -1; int max = -1; for (int i = 1; i < n; ++i) { if (str[i] == str[0]) { int j = 0; for (j = 0; i + j < n; ++j) { if (str[i + j] ...

#include <bits/stdc++.h> using namespace std; int main() { long long t; cin >> t; while (t--) { long long n; cin >> n; long long sum = 0; long long x = 0; while (n--) { long long s; cin >> s; sum += s; x ^= s; } cout << 2 << n ;...

#include <bits/stdc++.h> using namespace std; const double PI = acos(-1); pair<double, double> R[100001], P; double dist(pair<double, double> a, pair<double, double> b) { return (a.first - b.first) * (a.first - b.first) + (a.second - b.second) * (a.second - b.second); } double dist(pair<doubl...

#include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; using pll = pair<ll, ll>; using pdd = pair<double, double>; using vi = vector<int>; using vii = vector<pii>; using vs = vector<string>; const double PI = acos(-1.0); const double EPS = 1e-14; const int ...

#include <bits/stdc++.h> using namespace std; int n, m, ans[1009], t, l, r, low = 1e8, vis[1009]; vector<pair<int, int> > v0, v1; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> m; for (int i = 0; i < m; i++) { cin >> t >> l >> r; if (t == 0) ...

#include <bits/stdc++.h> using namespace std; typedef pair<int, int> ll; typedef vector<int> vl; typedef vector<ll> vll; typedef vector<vl> vvl; template <typename T> ostream &operator<<(ostream &o, vector<T> v) { if (v.size() > 0) o << v[0]; for (unsigned i = 1; i < v.size(); i++) o << << v[i...

#include <bits/stdc++.h> using namespace std; const int MAX = 1000009; void solve() { unsigned long long n, x; cin >> n >> x; int count = 0; for (int i = 1; i <= floor(sqrt(x)); i++) { if ((x % i == 0) && (i <= n) && (x / i <= n)) { if ((x / i != i)) { count += 2; }...

#include <bits/stdc++.h> using namespace std; const int MAXN = 200005; const int MAXM = 1000005; const int MOD = 1000000007; const int MAMOD = 998244353; const int INF = 0x3f3f3f3f; const long long LLINF = 0x3f3f3f3f3f3f3f3f; const double PI = acos(-1.0); const double EPS = 1e-8; int a[1005], color[...

#include <bits/stdc++.h> const long long MOD = 1e9 + 7; const long long INF = 1e18; using namespace std; long long powmod(long long a, long long b) { long long res = 1ll; while (b) { if (b & 1) res = (res * a) % MOD; } } int main() { ios::sync_with_stdio(false); cin.tie(NULL); ...

#include <bits/stdc++.h> using namespace std; int main() { long long int n, a, b; cin >> n; while (n--) { cin >> a >> b; if (a != b) { cout << Happy Alex << endl; return 0; } } cout << Poor Alex << endl; return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; int cand_sums[n]; memset(cand_sums, 0, sizeof cand_sums); vector<vector<int>> votes = vector<vector<int>>(m, vector<int>(n, 0)); vector<priority_queue<pair<int, int>>> bad_stations = vector<priority_q...

#include <bits/stdc++.h> using namespace std; int main() { long long t, a, b; string s; scanf( %lld , &t); vector<int> v; while (t--) { v.clear(); scanf( %lld%lld , &a, &b); cin >> s; for (int i = 0; i < s.length(); i++) { if (s[i] == 0 ) v.push_back(i); } ...

#include <bits/stdc++.h> using namespace std; int gcd(int f, int s) { if (s == 0) return f; else return gcd(s, f % s); } int const N = 200005; long long const mod = 1000 * 1000 * 1000 + 7; map<string, long long> m; string s[N]; int main() { int a; cin >> a; if (a < 6) ...

#include <bits/stdc++.h> int main() { int x, y, z; while (scanf( %d%d , &x, &y) == 2) { z = abs(x) + abs(y); if (x > 0) { if (y > 0) printf( 0 %d %d 0 n , z, z); else printf( 0 -%d %d 0 n , z, z); } else { if (y > 0) printf( -%d 0 0 %d n ...

#include <bits/stdc++.h> using namespace std; int a1, a2, a3, a4; int main() { scanf( %d%d%d%d , &a1, &a2, &a3, &a4); if (min(a1, a2) < max(a3, a4)) { puts( -1 ); return 0; } if (a1 + a2 == a3 + a4) { puts( -1 ); return 0; } if (a3 - a4 == 1) { int n = a3; ...

#include <bits/stdc++.h> using namespace std; int p[5007][5007]; int pre[5007]; int a, b, c, ans, res, del; int solve(int x, int y) { res = 0; for (int i = 0; i <= x && i <= y; i++) { del = pre[i]; del = (1LL * del * p[x][i]) % 998244353; del = (1LL * del * p[y][i]) % 998244353; ...

#include <bits/stdc++.h> #pragma GCC optimize(2) #pragma GCC optimize(3) using namespace std; inline int read() { int x = 0, neg = 1; char op = getchar(); while (!isdigit(op)) { if (op == - ) neg = -1; op = getchar(); } while (isdigit(op)) { x = 10 * x + op - 0 ; op...

#include <bits/stdc++.h> using namespace std; int n, k, a[303], flipped[303]; int query(int l, int r) { cout << ? << l << << r << endl; cin >> l; fflush(stdin); return l; } void flip(int l, int r) { for (int i = l; i < r + 1; i++) { flipped[i] ^= 1; } } void sol(int l,...

#include <bits/stdc++.h> using namespace std; int a[310], g[310][310], use[310]; int tm; void add(int x, int y) { g[x][y] = g[y][x] = 1; tm++; } int main() { int n, m, K; scanf( %d%d%d , &n, &m, &K); for (int i = 0; i < K; i++) { scanf( %d , &a[i]); use[a[i]] = 1; } s...

#include <bits/stdc++.h> using namespace std; vector<vector<long long> > mul(const vector<vector<long long> > &a, const vector<vector<long long> > &b, const long long &mod) { int R1 = a.size(), C1 = a.front().size(); int R2 = b.size(), C2 = b...

#include <bits/stdc++.h> using namespace std; bool prime(long long n) { for (int i = 2; i <= sqrt(n); i++) if (n % i == 0) return false; return true; } int main() { string s, s1; long long a, b, c, m, n, k, t, l, d, p, nl, np; t = 1; while (t--) { cin >> n >> d; vector<...

#include <bits/stdc++.h> int main() { int n; std::cin >> n; std::vector<int> a(n); std::vector<int> mn(n); for (int i = 0; i < n; ++i) { std::cin >> a[i]; } mn[n - 1] = a[n - 1]; for (int i = n - 2; i >= 0; --i) { if (a[i] < mn[i + 1]) { mn[i] = a[i]; } else {...

#include <bits/stdc++.h> using namespace std; int n, dp[500005]; pair<int, int> p[500005]; int main() { scanf( %d , &n); for (int i = 0; i < n; ++i) scanf( %d%d , &p[i].first, &p[i].second); sort(p, p + n); for (int i = 0; i < n; ++i) { if (i) dp[i] = max(dp[i], dp[i - 1]); int ub = ...

#include <bits/stdc++.h> using namespace std; inline long long read() { long long sum = 0, ff = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) ff = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) sum = sum * 10 + ch - 0 , ch = getchar(); return sum * ...

#include <bits/stdc++.h> using namespace std; pair<int, int> arr[3001]; const long long int INF = 1000000000000000; int n; long long int dp[3001][3001]; long long int solve(int pos, int prev) { if (pos > n) return 0; if (dp[pos][prev] != -INF) return dp[pos][prev]; long long int pin = arr[pos].s...

#include <bits/stdc++.h> using namespace std; int n; char ch[100]; int main() { scanf( %d , &n); int l = 0, r = 1e9; for (int i = 1; i <= min(29, n); i++) { int mid = (l + r) >> 1; printf( %d %d n , mid, 1); fflush(stdout); scanf( %s , ch); if (ch[0] == b ) l =...

#include <bits/stdc++.h> using namespace std; const int N = 1005; double dis(long u, long v, long p, long q) { return sqrt(((double)u - p) * (u - p) + ((double)q - v) * (q - v)); } struct point { int x; int y; }; int main() { int n, m; cin >> n >> m; if (n == 0) { cout << 0 <...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; const int INF = 0x3f3f3f3f; const double PI = acos(-1.0); const double eps = 1e-10; const int M = 1e9 + 7; int dcmp(double first) { if (fabs(first) < eps) return 0; return first < 0 ? -1 : 1; } int a[N]; int main() { i...

#include <bits/stdc++.h> using namespace std; using namespace std; bool onSegment(pair<int, int> p, pair<int, int> q, pair<int, int> r) { if (q.first <= max(p.first, r.first) && q.first >= min(p.first, r.first) && q.second <= max(p.second, r.second) && q.second >= min(p.second, r.second)) ...

#include <bits/stdc++.h> using namespace std; const int maxn = 100010; const int maxm = 100010; struct Arc { int to, next; } arcs[maxm]; int head[maxn], ne, out[maxn], ans[maxn]; inline void add_arc(int u, int v); priority_queue<int> Q; int main() { int n, m, i, u, v, k; while (scanf( %d%d...

#include <bits/stdc++.h> using namespace std; int main() { int z[6] = {1, 0, 0, 1, 2, 2}; int r[6] = {2, 2, 1, 0, 0, 1}; int l[6] = {0, 1, 2, 2, 1, 0}; long long int m, n, num; while (cin >> m >> n) { num = m % 6; if (z[num] == n) { cout << 1 << endl; } else if (r[num] ...

#include <bits/stdc++.h> using namespace std; const int MaxN = 1005; const int oo = 1000000000; const long long Base = 1000000007; typedef int Tarr[MaxN]; long long x, y, a, b, n, m, xx, yy, r1, r2, r3, r4; void Ok(int Val) { int xx = Val * a, yy = Val * b; if (xx % 2 == 0) { r1 = max((long ...

#include <bits/stdc++.h> using namespace std; const int N = 100 * 1000 + 13; bool flagBlack = false, flagWhite = false; int a[N]; int n; int lacesB[N]; int lacesW[N]; inline void read() { cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; if (a[i] == 0) { flagBlack = true; ...

#include <bits/stdc++.h> using namespace std; const long long INF = 1e18; const long long MAXN = 1e2 + 20; long long n, w, ans[MAXN]; pair<long long, long long> a[MAXN]; long long sa(long long n, long long k) { if (n % k) return n / k + 1; return n / k; } void fail() { cout << -1; exit(0...