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, m, k, c, x, y, rem; char a[501][501]; int v[501][501]; void dfs(int x, int y) { if (rem == 0 \|\| a[x][y] == # ) return; if (x < 0 \|\| x >= n \|\| y < 0 \|\| y >= m \|\| v[x][y] == 1) return; v[x][y] = 1; rem--; dfs(x + 1, y); dfs(x, y + 1);...
#include <bits/stdc++.h> using namespace std; vector<int> a[15]; vector<pair<int, int>> all; int rp[75000]; long long sum[15]; vector<pair<int, int>> loops; int path[16]; int plen = 0; bool vis[1 << 15] = {0}; int finstate; bool dfs(int state, int ps) { if (state == finstate) return true; ...
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; const int mod = 1e9 + 7; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m; long long ans = 0; cin >> n >> m; for (int i = 1; i <= n; i++) { ans += ((i % 5) + m) / 5; } cout ...
#include <bits/stdc++.h> using namespace std; struct opt { vector<set<int>> s; vector<int> l; vector<int> r; int n; opt(string t) { n = t.size(); t = $ + t; int c = 1; s.resize(n + 1); l.assign(n + 1, 1); r.assign(n + 1, n); s[1].insert(n); for (...
#include<cstdio> #include<cstring> #include<algorithm> using namespace std; #define N 100500 int n,is[N],mn=1e9,f1=1,f2=1,as[N],ct,s2[N]; char st[N]; int main() { scanf( %s ,st+1);n=strlen(st+1); st[n+2]= # ; int s1=0; for(int i=0;i<=n+2;i++)if(st[i]== # ) { if(!s1)continue; mn=mi...
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; int a[10], n; char s1, s2; int main() { a[0] = 118, a[1] = 60, a[2] = 94, a[3] = 62; while (cin >> s1 >> s2) { scanf( %d , &n); n %= 4; int k; for (int i = 0; i < 4; i++) if ((int)s1 == a[i]) { ...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:67108864 ) const int MOD = 1000000007; const long long INF = 3000000000000000001; const double EPS = 1e-6; const int HASH_POW = 29; const double PI = acos(-1.0); using namespace std; double workTime() { return double(clock()) / CLOCKS_PER_SEC; } ...
#include <bits/stdc++.h> using namespace std; long long n, m, k, i, j, a[1000000], b[1000000], x, res = 1; int main() { cin >> n; for (i = 0; i < n; i++) { cin >> a[i]; } for (i = 0; i < n; i++) { cin >> x; b[x] = i; } while (b[a[res]] > b[a[res - 1]]) { res++; ...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast,no-stack-protector ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,avx2,tune=native ) using namespace std; struct Dinic { struct Edge { long long flow; int to, next; }; vector<Edge> edges; ve...
#include <bits/stdc++.h> using namespace std; int main() { int h, cen; long long n, num; while (scanf( %d%I64d , &h, &n) != EOF) { num = (long long)pow(2.0, h) - 1 + n; int flag; long long ans = 0; if (num % 2 == 0) flag = 0; else flag = 1; cen = h - 1...
#include <bits/stdc++.h> using namespace std; int used[110]; int v[110][110]; vector<int> ans; int main() { int n, x; memset(used, 0, sizeof(used)); cin >> n; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { cin >> x; if (x == 1) { used[i] = 1; ...
#include <bits/stdc++.h> using namespace std; long long P = 998244353; double PI = 3.141592653589793; const int sqr = 500; const int arrn = 2e5 + 5; const int arrn2 = 1e3 + 5; long long inv[arrn] = {}; long long fac[arrn] = {}; void prefinv(int n, int p) { inv[0] = 1; inv[1] = 1; fac[1] = ...
#include <bits/stdc++.h> using namespace std; int main() { string s; int dif; cin >> s >> dif; set<char> st; for (int i = (0); i < s.length(); i++) st.insert(s[i]); if (s.length() < dif) { cout << impossible << endl; } else if (st.size() >= dif) cout << 0; else co...
#include <bits/stdc++.h> using namespace std; int main() { int T; cin >> T; while (T--) { int a, b; cin >> a >> b; int a1 = 2 * min(a, b); int a2 = max(a, b); cout << pow(max(a1, a2), 2) << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; int i, j, viz[1005], n; int sol[100005], nrsol; int main(void) { cin >> n; for (i = 2; i <= n; ++i) if (viz[i] == 0) { int nrp = i; int put = nrp; while (put <= n) { sol[++nrsol] = put; put *= nrp; } ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1000005; long long a00, a01, a10, a11; long long newton(long long n) { return n * (n - 1) / 2; } long long sqrNewton(long long x) { long long n = 0; while (newton(n) < x) n++; return newton(n) == x ? n : -1; } int W[MAXN]; bool p...
#include <bits/stdc++.h> using namespace std; const int INF = 2e6; const long long LINF = 8e18; const int MOD = 1e9 + 7; const long double EPS = 1e-9; int n; vector<long long> a; struct triplet { int ti, i, j; }; vector<struct triplet> s; int cnt[INF]; int main() { scanf( %d , &n); ;...
#include <bits/stdc++.h> using namespace std; int main() { int t, n, c, x, ans; cin >> t; while (t--) { ans = 0; x = -1; cin >> n; int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } for (int i = 0; i < n; i++) { if (a[i] == 1) { if ...
#include <bits/stdc++.h> using namespace std; int n, b, i, rez, a[2013], minn[2013], maxx[2013]; int main() { minn[0] = 123456890; cin >> n >> b; for (i = 1; i <= n; ++i) { cin >> a[i]; minn[i] = min(minn[i - 1], a[i]); } for (i = n; i >= 1; --i) { maxx[i] = max(maxx[i + 1], ...
#include <bits/stdc++.h> using namespace std; bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) { if (a.second < b.second) return true; if (a.second == b.second) return a.first < b.first; return false; } bool isprime(int n) { if (n <= 1) return false; for (int i = 2; i <= sqrt...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; vector<array<int, 2>> a(n); map<int, int> hhor; map<int, int> hver; set<array<int, 2>> hor[n]; set<array<int, 2>> ver[n]; int idhor...
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; int dp[100005], x[105], s[105]; bool vis[100005]; int main() { int n, m, minv = INF; scanf( %d%d , &n, &m); for (int i = 0; i < n; ++i) { scanf( %d%d , &x[i], &s[i]); minv = min(minv, x[i]); for (int j = ma...
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:16777216 ) const int fin = 111110; struct T { int cnt, val, l, r, mx, y, ans; T() : cnt(0), val(-1), l(fin), r(fin), mx(-1000000000), y(-1), ans(-1) {} }; T a[111111]; void upd(int v) { a[v].cnt = 1 + a[a[v].r].cnt +...
#include <bits/stdc++.h> using namespace std; int main() { long long int n, m, k, l, x = 1; cin >> n >> m >> k >> l; if (k + l > n) cout << -1 ; else if ((k + l) % m == 0 && (k + l) <= n) cout << (k + l) / m; else if ((k + l) % m != 0 && ((k + l) / m + 1) * m <= n) cout << ((k...
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; if (n == 1) { cout << 1; return 0; } if (n & 1) { if (m <= n / 2) cout << m + 1; else cout << m - 1; } else { if (m <= n / 2) cout << m + 1; else ...
#include <bits/stdc++.h> using namespace std; int read() { int x = 0, f = 1; char ch = getchar(); while (ch - 0 < 0 \|\| ch - 0 > 9) { if (ch == - ) f = -1; ch = getchar(); } while (ch - 0 >= 0 && ch - 0 <= 9) { x = x * 10 + ch - 0 ; ch = getchar(); } retu...
#include <bits/stdc++.h> using namespace std; const int maxk = 105, maxn = 2e5 + 5, inf = 1e9; int n, k, l[maxk], r[maxk], dp[2][maxn]; int main() { scanf( %d%d , &n, &k); for (int i = 1; i <= k; ++i) scanf( %d %d , l + i, r + i); if (l[k] != 2 * n) { ++k; l[k] = r[k] = 2 * n; } ...
#include <bits/stdc++.h> int main() { int n; scanf( %i , &n); printf( %li , (long int)n / 2 * 3); return 0; }
#include <bits/stdc++.h> long long mod = 1e9 + 7; int main() { long long n, m; std::cin >> n >> m; std::string s; std::cin >> s; std::vector<std::vector<long long>> dp(n - m + 1, std::vector<long long>(n - m + 1)); dp[0][0] = 1; for (long long i...
#include <bits/stdc++.h> char a[300][300]; int n, m, t, z, s; const int X[8] = {0, 1, 0, -1, 1, 1, -1, -1}, Y[8] = {1, 0, -1, 0, 1, -1, 1, -1}; void F(int x, int y, int &s) { if (x < 0 \|\| x >= n \|\| y < 0 \|\| y >= m \|\| a[x][y] != 1 ) return; a[x][y] = 2 , s++; for (int i = 0; i < 8; i++)...
#include <bits/stdc++.h> using namespace std; const long long MOD = 1E9 + 7; const long long N = 2E5 + 6; long long n, m, a[N], b[N], ans, zeros[N]; long long dp[N]; long long modexp(long long b, long long e) { long long res = 1; while (e) { if (e & 1) res = (res * b) % MOD; e >>= 1; ...
#include <bits/stdc++.h> using namespace std; template <typename T> void read(T &x) { x = 0; int f = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) f = -1; ch = getchar(); } while (isdigit(ch)) { x = x * 10 + ch - 0 ; ch = getchar(); } x *= f...
#include <bits/stdc++.h> using namespace std; const long double PI(acos((long double)-1.0)); struct cpx { long double r, i; cpx() : r(0), i(0) {} cpx(long double a, long double b) : r(a), i(b) {} cpx conj() { return cpx(r, -i); } } u[20], iu[20], a[524288], b[524288]; cpx operator+(const cpx &...
#include <bits/stdc++.h> using namespace std; const int M = 5010; namespace SuffixArray { const int MAXN = 1 << 21; string S; int N, gap; int sa[MAXN], pos[MAXN], tmp[MAXN], lcp[MAXN]; bool sufCmp(int i, int j) { if (pos[i] != pos[j]) return pos[i] < pos[j]; i += gap; j += gap; return (i...
#include <bits/stdc++.h> using namespace std; int n, k; char C[3000]; long long D[3000][3000]; long long S[3000]; long long s = 0; int main() { cin >> n >> k; cin >> C; S[0] = D[0][0] = (C[0] - a ); S[n] = D[0][n] = ( z - C[0]); s = D[0][k]; for (int i = 1; i < n; i++) { in...
#include <bits/stdc++.h> using namespace std; const int N = 250005; int n, k, P, ans, f[30][N], fac[N], ifac[N], inv[N]; inline int ksm(register int x, register int L) { register int ans = 1; while (L) L& 1 ? ans = (0ll + ans) * x % P, 0 : 0, x = (0ll + x) * x % P, L >>= 1; return ans; } i...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, k, ans = 0; cin >> n >> k; if (n % k > (k / 2)) { cout << (n / k) * k + (k / 2) << endl; } else { cout << n << endl; } } }
#include <bits/stdc++.h> double eps = 1e-9; double cal(int x, int n, int m) { double tmp = 1; for (int i = 0; i < n; i++) { tmp *= (double)x / m; if (tmp < eps) return 0.0; } return tmp; } int main() { int m, n; scanf( %d %d , &m, &n); double tmp = 0.0; for (int i = m...
#include <bits/stdc++.h> using namespace std; long long save[100005]; long long aa[100005]; int hihi[100005]; int main() { int n; scanf( %d , &n); memset(aa, 0, sizeof(aa)); memset(aa, 0, sizeof(aa)); int first = 0, second = 0, sum = 1; long long a; scanf( %I64d , &a); if (a !=...
#include <bits/stdc++.h> using namespace std; const int maxn = 3e5 + 10; int lim; int n; int p[maxn] = {0}; int res[maxn] = {0}; bool vis[maxn] = {0}; int cnt = 0; int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %d , &p[i]); } lim = n; res[cnt++] = 1; ...
#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 << i << ; cout << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; long long a, b, c, d, ans; char signs[3]; void r1(long long a) { ans = min(ans, a); } void r2(long long a, long long b) { if (signs[2] == * ) { r1(a * b); } else { r1(a + b); } } void r3(long long a, long long b, long long c) { if ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 100111; int N, M; int ncr[MAXN][128]; int pre[128][MAXN]; int init[MAXN]; int main() { ios_base::sync_with_stdio(false); ncr[0][0] = 1; for (int n = 1; n < MAXN; n++) for (int r = 0; r <= 100; r++) { ncr[n][r] = ncr[n...
#include <bits/stdc++.h> using namespace std; void solve() { int n, x; cin >> n >> x; int sum = 0, infected = 0; for (int i = 1; i <= n; i++) { int val; cin >> val; sum += val; infected += (val == x); } if (infected == n) cout << 0 << n ; else if (infected...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; long long int a[n + 1]; a[0] = 0ll; long long int ans = 0ll; for (int i = 1; i <= n; i++) { cin >> a[i]; if (a[i] > a[i - 1]) ans += (1ll * (a[i] - a[i - 1]) * (n - a[i] + 1)); if (a[i] < a[i - 1]) ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t, n; cin >> n; vector<int> a(n); int maxNum = 0; for (int i = 0; i < n; i++) { cin >> a[i]; maxNum = max(a[i], maxNum); } vector<vector<bool> > board(maxNu...
#include <bits/stdc++.h> using namespace std; int main() { long long q; cin >> q; while (q--) { long long n, a, b; cin >> n >> a >> b; if (a + b >= n) cout << max(a, b) - (a + b - 1 - n) << endl; else cout << min(a, b) + 1 << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int n; int A[101]; string s; long long d[101][101][101]; long long f(int lo, int hi, int p) { if (lo == hi) return A[p]; if (d[lo][hi][p]) return d[lo][hi][p]; long long ret = f(lo + 1, hi, 1) + A[p]; if (s[lo] == s[lo + 1]) ret = max(ret, f(lo +...
#include <bits/stdc++.h> using namespace std; #pragma GCC diagnostic ignored -Wmissing-declarations double triangle_area(const complex<double> p1, const complex<double> p2, const complex<double> p3) { return abs((p2.real() - p1.real()) * (p3.imag() - p1.imag()) - (p2.im...
#include <bits/stdc++.h> using namespace std; template <typename S, typename T> ostream& operator<<(ostream& out, pair<S, T> const& p) { out << ( << p.first << , << p.second << ) ; return out; } template <typename T> ostream& operator<<(ostream& out, vector<T> const& v) { int l = v.size();...
#include <bits/stdc++.h> using namespace std; const int N = 1000; int dist[N * N], memo[N * N]; vector<pair<int, int>> H, T; vector<int> ladj[N * N]; int vis[N * N]; inline int f(int x, int y) { return x * N + y; } int bfs(int start) { int n = N * N; fill(dist, dist + n, INT_MAX); fill(memo,...
#include <bits/stdc++.h> using namespace std; int read() { char x = getchar(); int ans = 0, flag = 1; while (!isdigit(x)) if (x == - ) flag = -1, x = getchar(); else x = getchar(); while (isdigit(x)) ans = ans * 10 + x - 0 , x = getchar(); return ans * flag; } i...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:64000000 ) using std::cerr; using std::cin; using std::cos; using std::cout; using std::endl; using std::make_pair; using std::map; using std::max; using std::min; using std::next_permutation; using std::pair; using std::priority_queue; ...
#include <bits/stdc++.h> using namespace std; int r1, c1, r2, c2; int chk(int i, int j) { if (i == r1 \|\| j == c1 \|\| (((i == r1 && j == c1) \|\| (i == r2 && j == c2)) ? 1 : 0)) return 1; if ((((i - 1 == r1 && j - 2 == c1) \|\| (i - 1 == r2 && j - 2 == c2)) ? 1 : 0)) return 1; if ((((i +...
#include <bits/stdc++.h> using namespace std; const int mod = 998244353; long long power(long long base, long long b) { long long ret = 1; while (b) { if (b & 1) ret = ret * base % mod; base = base * base % mod; b >>= 1; } return ret; } int n, m; long long ans, cur; int m...
#include <bits/stdc++.h> const int MAXN = 1e5 + 5; const long long MOD = 998244353; const int INF = 0x3f3f3f3f; const long long LL_INF = 0x3f3f3f3f3f3f3f3f; const double PI = acos(-1); const double ERR = 1e-10; const int L = 40; const int M = 30; using namespace std; long long mx = -1e18; long lon...
#include <bits/stdc++.h> using namespace std; template <typename T> T getint() { T x = 0, p = 1; char ch; do { ch = getchar(); } while (ch <= ); if (ch == - ) p = -1, ch = getchar(); while (ch >= 0 && ch <= 9 ) x = x * 10 + ch - 0 , ch = getchar(); return x * p; } mt1...
#include <bits/stdc++.h> using namespace std; int a[201][201] = {0}; int n, m; int main(int argc, char *argv[]) { int x = 100; int y = 100; int ok = 0; cin >> n >> m; a[x][y] = n; do { ok = 0; int max = y; int min = x; for (int i = x; i <= y; i++) for (int...
#include <bits/stdc++.h> using namespace std; const long long N = 100005; bool dp[501][501]; long long a[501], b[501]; signed main() { std::ios::sync_with_stdio(false); cin.tie(NULL); long long n, k; cin >> n >> k; for (long long i = 1; i < n + 1; i++) { cin >> a[i] >> b[i]; } ...
#include <bits/stdc++.h> using namespace std; int main() { long long i, j, k, l, m, n; cin >> n; if (n & 1) cout << 1 << endl; else cout << 2 << endl; }
#include <bits/stdc++.h> using namespace std; const int N = 1000010; char kol[6]; set<vector<int> > zb; bool used[6]; int rozw[6]; int obr[][6] = {{1, 2, 3, 4, 5, 6}, {1, 5, 3, 6, 4, 2}, {1, 6, 3, 5, 2, 4}, {1, 4, 3, 2, 6, 5}, {2, 3, 4, 1, 5, 6}, {2, 6, 4, 5, 3, 1}, {2,...
#include <bits/stdc++.h> using namespace std; int main() { long i, a = 0, b, j, b1[26] = {}, b2[26] = {}; string s1, s2; vector<long> v1, v2; cin >> s1 >> s2; if (s1.size() != s2.size()) { cout << NO ; return 0; } for (i = 0; i < s1.size(); i++) { if (s1[i] != s2[i]) {...
#include <bits/stdc++.h> #pragma GCC optimize(3) #pragma GCC optimize( Ofast ) #pragma GCC optimize( inline ) using namespace std; const int N = 7005; const int M = 200000; const long long mod = 1e9 + 7; const long long inf = 0x3f3f3f3f; namespace FastIO { template <typename tp> inline void read(t...
#include <bits/stdc++.h> using namespace std; int binSearch(int *a, int n, int x) { int l = 0; int r = n - 1; while (l < r) { int mid = (l + r) / 2; if (a[mid] == x) return mid; else if (a[mid] < x) l = mid + 1; else r = mid - 1; } return -1; } ...
#include <bits/stdc++.h> #pragma GCC target( sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx ) using namespace std; const int mod = 1e9 + 7; const int N = 2e5 + 4; int a[N], v[N], s[N]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m, k; cin >> n >> m >> k; for (i...
#include <bits/stdc++.h> using namespace std; const int MOD = 10000; struct Big { vector<int> data; int size() const { return data->size(); } bool operator<(const Big &a) const { if (size() != a.size()) return size() < a.size(); for (int i = (int)size() - 1; i >= 0; i--) if ((dat...
#include <bits/stdc++.h> using namespace std; int main() { int n, m; string s[105]; set<char> ms; cin >> n >> m; for (int i = 0; i < n; i++) cin >> s[i]; long long ans = 1; for (int i = 0; i < m; i++) { ms.clear(); for (int j = 0; j < n; j++) ms.insert(s[j][i]); ans = a...
#include <bits/stdc++.h> using namespace std; inline void read(int &x) { int v = 0, f = 1; char c = getchar(); while (!isdigit(c) && c != - ) c = getchar(); if (c == - ) f = -1; else v = (c & 15); while (isdigit(c = getchar())) v = (v << 1) + (v << 3) + (c & 15); x = v * f;...
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; int main() { int t; int n, m; long long s = 0; cin >> n >> m; vector<long long> a(m); for (int i = 0; i < m; i++) { cin >> a[i]; } s += (a[0] - 1); for (int i = 1; i < m; i++) { if (a[i] >= a[i -...
#include <bits/stdc++.h> using namespace std; int n, ans; int f[2005][2005], A[2005][2005]; int mul[2005], tr1[2005], tr2[2005], vis[2005], lck[2005]; int Getsum(int tree, int x) { int ans = 0; for (int i = x; i; i -= i & -i) ans += tree[i]; return ans; } void Update(int tree, int x, int v) ...
#include <bits/stdc++.h> using namespace std; struct point { int id; bool ok; int row; bool operator<(const point &p) const { return (id == p.id) ? ok < p.ok : id < p.id; } }; point a[600100]; vector<int> edge[300100]; int dp[300100]; int truoc[300100]; bool ok[300100]; int m...
#include <bits/stdc++.h> using namespace std; int main() { int w, m; cin >> w >> m; vector<int> v; while (m > 0) { v.push_back(m % w); m /= w; } int ok = 1; for (int i = 0; i < v.size(); i++) { if (v[i] != 0 && v[i] != 1) { v[i] -= w; if (v[i] != -1 && v...
#include <bits/stdc++.h> using namespace std; int main() { int a, b, sum = 0; cin >> a >> b; sum = (a * b) / 2; cout << sum << endl; return 0; }
#include <bits/stdc++.h> using namespace std; long long int pow_mod(long long int a, long long int b) { long long int res = 1; while (b != 0) { if (b & 1) { res = (res * a) % 1000000007; } a = (a * a) % 1000000007; b /= 2; } return res; } void solve() { long l...
#include <bits/stdc++.h> using namespace std; long long t1, t2, x1, x2, t0, ans1, ans2, z1, z2, y20; inline void trr(const long long& y1_gdssdfjsdgf, const long long& y2) { if (y1_gdssdfjsdgf == 0 && y2 == 0) return; if (ans1 == -1) { if ((y1_gdssdfjsdgf * t1 + y2 * t2) >= t0 * (y1_gdssdfjsdgf + y2)...
#include <bits/stdc++.h> using namespace std; const int N = 2e3 + 10; const int mod = 998244353; int f[N][N], g[N][N]; int mn[N][N], indl[N], indr[N]; bool bz[N][N]; int a[1000001]; int n, m; int main() { scanf( %d %d , &n, &m); for (int i = 1; i <= m; i++) scanf( %d , &a[i]); int x = m; ...
#include <bits/stdc++.h> int a[300004], pos[300004]; using namespace std; int main() { int n, temp; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; pos[a[i]] = i; } bool flag = false; for (int i = 1; i <= n && !flag; i++) for (int j = i + 1; j <= min(n, i + 5) && !f...
/* ID: c4ts0up LANG: C++ TASK: URL: */ #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; #define pb push_back #define ff first #define ss second #define endl n void fast_io() { ios_base::sync_with_stdio(false); cin.tie(NULL)...
#include <bits/stdc++.h> std::string colors( RGBYW ); struct Card { int color; int number; bool operator<(const Card& rhs) const { if (color == rhs.color) return (number < rhs.number); else return color < rhs.color; } }; int mapColor(char color) { size_t pos = col...
#include <bits/stdc++.h> using namespace std; int n, a, b, m[1001][1001]; void solve() { cin >> n >> a >> b; if (a > 1 and b > 1) { cout << NO << n ; return; } if (a == 1 and b == 1) { if (n == 1) { cout << YES << n ; cout << 0; return; } ...
#include <bits/stdc++.h> using namespace std; const int N = 1010; const int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0}; long long k; int n, m, h[N][N]; bool mark[N][N]; int pre[N * N], sz[N * N]; int find(int x) { return pre[x] = (pre[x] == x ? x : find(pre[x])); } bool merge(int x, int y) { int a...
#include <bits/stdc++.h> using namespace std; int main() { int ans, n, m, x, y; cin >> n >> m; int lo = (n + 1) / 2; ans = (lo + m - 1) / m; ans *= m; if (ans > n) cout << -1 << endl; else cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; long long n, m, dp[1 << 19][21], a[22][22], ans; long long lowbit(long long x) { return (x & (-x)); } int main() { memset(a, 0, sizeof(a)); memset(dp, 0, sizeof(dp)); scanf( %lld%lld , &n, &m); for (int i = 1; i <= m; i++) { int x, y; sca...
#include <bits/stdc++.h> using namespace std; template <typename P, typename Q> ostream& operator<<(ostream& os, pair<P, Q> p) { os << ( << p.first << , << p.second << ) ; return os; } int main(int argc, char* argv[]) { int n, k; while (scanf( %d%d , &n, &k) == 2) { vector<int> v; ...
#include <bits/stdc++.h> using namespace std; char buf[256]; signed main() { long long n; scanf( %lld , &n); stack<long long> cur; set<long long> si; long long tmp = 1, ans = 0; for (long long i = 0; i < n * 2; i++) { scanf( %s , buf); string s(buf); if (s == add ) { ...
#include <bits/stdc++.h> using namespace std; const int maxn = 300100, mod = 998244353; inline void Add(int &a, int b) { a = a + b >= mod ? a + b - mod : a + b; } int head[maxn], nxt[maxn << 1], ver[maxn << 1], tot; inline void addedge(int a, int b) { nxt[++tot] = head[a]; ver[tot] = b; head[a] = ...
#include <bits/stdc++.h> using namespace std; int newMask[1000000][4]; bool canMove[1000000][4]; int mv[][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}}; int len; int getMove(int x, int y) { if (x == 1 && y == 0) return 0; if (x == 0 && y == 1) return 1; if (x == -1 && y == 0) return 2; return 3; ...
#include <bits/stdc++.h> using namespace std; int a[120], n, t; bool check(); int main() { cin >> t; while (t--) { cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; sort(a + 1, a + n + 1); if (check()) cout << YES n ; else cout << NO n ; } } bool...
#include <bits/stdc++.h> using namespace std; const int N = 110000; string s; int n, cnt1, cnt0, cntq, m, p; char last0, last1; int may01, may10; int main() { cin >> s; n = s.size(); for (int i = 0; i < n; i++) if (s[i] == 1 ) cnt1++; else if (s[i] == 0 ) cnt0++; ...
#include <bits/stdc++.h> using namespace std; const long double pi = 3.1415926535897932384626433832795l; template <typename T> inline auto sqr(T x) -> decltype(x * x) { return x * x; } template <typename T1, typename T2> inline bool umx(T1& a, T2 b) { if (a < b) { a = b; return 1; ...
#include <bits/stdc++.h> using namespace std; int ans[1009]; int main() { memset(ans, -1, sizeof(ans)); for (int i = 1; i <= 15; i += 2) { int x = (i * i + 1) / 2; int y = (i - 1) / 4 * 2; for (int j = 0; j <= y; j++) { for (int k = 0; k <= (x - 1 - 2 * y) / 4; k++) { f...
#include <bits/stdc++.h> using namespace std; int main() { char spots[9][9]; for (int i = 0; i < 9; i++) { for (int j = 0; j < 3; j++) { string input; cin >> input; for (int k = 0; k < input.size(); k++) { spots[i][j * 3 + k] = input[k]; } } } in...
#include <bits/stdc++.h> using namespace std; int arr[1000005]; int n, m, k; int main() { scanf( %d%d%d , &n, &m, &k); memset(arr, 0, sizeof arr); for (int i = 0; i < m; ++i) { int number; scanf( %d , &number); arr[number] = 1; } bool flg = 0; int where = 1; if (arr...
#include <bits/stdc++.h> using namespace std; int main() { int i, l, skg = 0, skr = 0, sky = 0, skb = 0, kr = 0, kg = 0, kb = 0, ky = 0, pg = 0, pr = 0, py = 0, pb = 0; char s[120], r[4]; scanf( %s , s); l = strlen(s); if (l % 4 == 0) { for (i = 0; i < l; i += 4) { kg...
#include <bits/stdc++.h> using namespace std; struct debugger { static void call(const char* it) {} template <typename T, typename... aT> static void call(const char* it, T a, aT... rest) { string b; for (; it && it != , ; ++it) if (it != ) b += it; cerr << b << = << ...
#include <bits/stdc++.h> using namespace std; int n; int a[105]; int main() { int ans = 0; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); for (int i = 2; i <= n - 1; i++) { if (a[i] == 0 && a[i - 1] == 1 && a[i + 1] == 1) { ans++; a[i + 1] = 0; } ...
#include <bits/stdc++.h> using namespace std; int n, k; long long a[10010]; int main() { scanf( %d%d , &n, &k); for (int i = 1; i <= n; i++) scanf( %lld , &a[i]); sort(a + 1, a + 1 + n); long long sum = 0; for (int i = 1; i <= k; i++) sum += a[i]; printf( %lld n , sum); return 0; }...
#include <bits/stdc++.h> using namespace std; void err() { cout << endl; } template <class T, class... Ts> void err(const T &arg, const Ts &...args) { cout << arg << ; err(args...); } using ll = long long; using db = double; const int N = 1e5 + 10; int n, m, q; int deg[N]; vector<vector...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 5; int t, n, h, m, a[maxn], x; int sum; int main() { ios::sync_with_stdio(0); cin >> n >> h >> m; for (int i = 1; i <= n; ++i) a[i] = h; for (int i = 0; i < m; ++i) { int l, r, w; cin >> l >> r >> w; for (in...
#include <bits/stdc++.h> using namespace std; bool check(long long int n, long long int k) { long long int sum = k; long long int A[k]; fill(A, A + k, 1); for (long long int i = k - 1; i >= 0; --i) { while (sum + A[i] <= n) { sum += A[i]; A[i] *= 2; } } if (sum !=...

#include <bits/stdc++.h> using namespace std; int n, m, k, c, x, y, rem; char a[501][501]; int v[501][501]; void dfs(int x, int y) { if (rem == 0 || a[x][y] == # ) return; if (x < 0 || x >= n || y < 0 || y >= m || v[x][y] == 1) return; v[x][y] = 1; rem--; dfs(x + 1, y); dfs(x, y + 1);...

#include <bits/stdc++.h> using namespace std; vector<int> a[15]; vector<pair<int, int>> all; int rp[75000]; long long sum[15]; vector<pair<int, int>> loops; int path[16]; int plen = 0; bool vis[1 << 15] = {0}; int finstate; bool dfs(int state, int ps) { if (state == finstate) return true; ...

#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; const int mod = 1e9 + 7; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m; long long ans = 0; cin >> n >> m; for (int i = 1; i <= n; i++) { ans += ((i % 5) + m) / 5; } cout ...

#include <bits/stdc++.h> using namespace std; struct opt { vector<set<int>> s; vector<int> l; vector<int> r; int n; opt(string t) { n = t.size(); t = $ + t; int c = 1; s.resize(n + 1); l.assign(n + 1, 1); r.assign(n + 1, n); s[1].insert(n); for (...

#include<cstdio> #include<cstring> #include<algorithm> using namespace std; #define N 100500 int n,is[N],mn=1e9,f1=1,f2=1,as[N],ct,s2[N]; char st[N]; int main() { scanf( %s ,st+1);n=strlen(st+1); st[n+2]= # ; int s1=0; for(int i=0;i<=n+2;i++)if(st[i]== # ) { if(!s1)continue; mn=mi...

#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; int a[10], n; char s1, s2; int main() { a[0] = 118, a[1] = 60, a[2] = 94, a[3] = 62; while (cin >> s1 >> s2) { scanf( %d , &n); n %= 4; int k; for (int i = 0; i < 4; i++) if ((int)s1 == a[i]) { ...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:67108864 ) const int MOD = 1000000007; const long long INF = 3000000000000000001; const double EPS = 1e-6; const int HASH_POW = 29; const double PI = acos(-1.0); using namespace std; double workTime() { return double(clock()) / CLOCKS_PER_SEC; } ...

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

#include <bits/stdc++.h> #pragma GCC optimize( Ofast,no-stack-protector ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,avx2,tune=native ) using namespace std; struct Dinic { struct Edge { long long flow; int to, next; }; vector<Edge> edges; ve...

#include <bits/stdc++.h> using namespace std; int main() { int h, cen; long long n, num; while (scanf( %d%I64d , &h, &n) != EOF) { num = (long long)pow(2.0, h) - 1 + n; int flag; long long ans = 0; if (num % 2 == 0) flag = 0; else flag = 1; cen = h - 1...

#include <bits/stdc++.h> using namespace std; int used[110]; int v[110][110]; vector<int> ans; int main() { int n, x; memset(used, 0, sizeof(used)); cin >> n; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { cin >> x; if (x == 1) { used[i] = 1; ...

#include <bits/stdc++.h> using namespace std; long long P = 998244353; double PI = 3.141592653589793; const int sqr = 500; const int arrn = 2e5 + 5; const int arrn2 = 1e3 + 5; long long inv[arrn] = {}; long long fac[arrn] = {}; void prefinv(int n, int p) { inv[0] = 1; inv[1] = 1; fac[1] = ...

#include <bits/stdc++.h> using namespace std; int main() { string s; int dif; cin >> s >> dif; set<char> st; for (int i = (0); i < s.length(); i++) st.insert(s[i]); if (s.length() < dif) { cout << impossible << endl; } else if (st.size() >= dif) cout << 0; else co...

#include <bits/stdc++.h> using namespace std; int main() { int T; cin >> T; while (T--) { int a, b; cin >> a >> b; int a1 = 2 * min(a, b); int a2 = max(a, b); cout << pow(max(a1, a2), 2) << n ; } return 0; }

#include <bits/stdc++.h> using namespace std; int i, j, viz[1005], n; int sol[100005], nrsol; int main(void) { cin >> n; for (i = 2; i <= n; ++i) if (viz[i] == 0) { int nrp = i; int put = nrp; while (put <= n) { sol[++nrsol] = put; put *= nrp; } ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 1000005; long long a00, a01, a10, a11; long long newton(long long n) { return n * (n - 1) / 2; } long long sqrNewton(long long x) { long long n = 0; while (newton(n) < x) n++; return newton(n) == x ? n : -1; } int W[MAXN]; bool p...

#include <bits/stdc++.h> using namespace std; const int INF = 2e6; const long long LINF = 8e18; const int MOD = 1e9 + 7; const long double EPS = 1e-9; int n; vector<long long> a; struct triplet { int ti, i, j; }; vector<struct triplet> s; int cnt[INF]; int main() { scanf( %d , &n); ;...

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

#include <bits/stdc++.h> using namespace std; int n, b, i, rez, a[2013], minn[2013], maxx[2013]; int main() { minn[0] = 123456890; cin >> n >> b; for (i = 1; i <= n; ++i) { cin >> a[i]; minn[i] = min(minn[i - 1], a[i]); } for (i = n; i >= 1; --i) { maxx[i] = max(maxx[i + 1], ...

#include <bits/stdc++.h> using namespace std; bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) { if (a.second < b.second) return true; if (a.second == b.second) return a.first < b.first; return false; } bool isprime(int n) { if (n <= 1) return false; for (int i = 2; i <= sqrt...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; vector<array<int, 2>> a(n); map<int, int> hhor; map<int, int> hver; set<array<int, 2>> hor[n]; set<array<int, 2>> ver[n]; int idhor...

#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; int dp[100005], x[105], s[105]; bool vis[100005]; int main() { int n, m, minv = INF; scanf( %d%d , &n, &m); for (int i = 0; i < n; ++i) { scanf( %d%d , &x[i], &s[i]); minv = min(minv, x[i]); for (int j = ma...

#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:16777216 ) const int fin = 111110; struct T { int cnt, val, l, r, mx, y, ans; T() : cnt(0), val(-1), l(fin), r(fin), mx(-1000000000), y(-1), ans(-1) {} }; T a[111111]; void upd(int v) { a[v].cnt = 1 + a[a[v].r].cnt +...

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

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

#include <bits/stdc++.h> using namespace std; int read() { int x = 0, f = 1; char ch = getchar(); while (ch - 0 < 0 || ch - 0 > 9) { if (ch == - ) f = -1; ch = getchar(); } while (ch - 0 >= 0 && ch - 0 <= 9) { x = x * 10 + ch - 0 ; ch = getchar(); } retu...

#include <bits/stdc++.h> using namespace std; const int maxk = 105, maxn = 2e5 + 5, inf = 1e9; int n, k, l[maxk], r[maxk], dp[2][maxn]; int main() { scanf( %d%d , &n, &k); for (int i = 1; i <= k; ++i) scanf( %d %d , l + i, r + i); if (l[k] != 2 * n) { ++k; l[k] = r[k] = 2 * n; } ...

#include <bits/stdc++.h> int main() { int n; scanf( %i , &n); printf( %li , (long int)n / 2 * 3); return 0; }

#include <bits/stdc++.h> long long mod = 1e9 + 7; int main() { long long n, m; std::cin >> n >> m; std::string s; std::cin >> s; std::vector<std::vector<long long>> dp(n - m + 1, std::vector<long long>(n - m + 1)); dp[0][0] = 1; for (long long i...

#include <bits/stdc++.h> char a[300][300]; int n, m, t, z, s; const int X[8] = {0, 1, 0, -1, 1, 1, -1, -1}, Y[8] = {1, 0, -1, 0, 1, -1, 1, -1}; void F(int x, int y, int &s) { if (x < 0 || x >= n || y < 0 || y >= m || a[x][y] != 1 ) return; a[x][y] = 2 , s++; for (int i = 0; i < 8; i++)...

#include <bits/stdc++.h> using namespace std; const long long MOD = 1E9 + 7; const long long N = 2E5 + 6; long long n, m, a[N], b[N], ans, zeros[N]; long long dp[N]; long long modexp(long long b, long long e) { long long res = 1; while (e) { if (e & 1) res = (res * b) % MOD; e >>= 1; ...

#include <bits/stdc++.h> using namespace std; template <typename T> void read(T &x) { x = 0; int f = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) f = -1; ch = getchar(); } while (isdigit(ch)) { x = x * 10 + ch - 0 ; ch = getchar(); } x *= f...

#include <bits/stdc++.h> using namespace std; const long double PI(acos((long double)-1.0)); struct cpx { long double r, i; cpx() : r(0), i(0) {} cpx(long double a, long double b) : r(a), i(b) {} cpx conj() { return cpx(r, -i); } } u[20], iu[20], a[524288], b[524288]; cpx operator+(const cpx &...

#include <bits/stdc++.h> using namespace std; const int M = 5010; namespace SuffixArray { const int MAXN = 1 << 21; string S; int N, gap; int sa[MAXN], pos[MAXN], tmp[MAXN], lcp[MAXN]; bool sufCmp(int i, int j) { if (pos[i] != pos[j]) return pos[i] < pos[j]; i += gap; j += gap; return (i...

#include <bits/stdc++.h> using namespace std; int n, k; char C[3000]; long long D[3000][3000]; long long S[3000]; long long s = 0; int main() { cin >> n >> k; cin >> C; S[0] = D[0][0] = (C[0] - a ); S[n] = D[0][n] = ( z - C[0]); s = D[0][k]; for (int i = 1; i < n; i++) { in...

#include <bits/stdc++.h> using namespace std; const int N = 250005; int n, k, P, ans, f[30][N], fac[N], ifac[N], inv[N]; inline int ksm(register int x, register int L) { register int ans = 1; while (L) L& 1 ? ans = (0ll + ans) * x % P, 0 : 0, x = (0ll + x) * x % P, L >>= 1; return ans; } i...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, k, ans = 0; cin >> n >> k; if (n % k > (k / 2)) { cout << (n / k) * k + (k / 2) << endl; } else { cout << n << endl; } } }

#include <bits/stdc++.h> double eps = 1e-9; double cal(int x, int n, int m) { double tmp = 1; for (int i = 0; i < n; i++) { tmp *= (double)x / m; if (tmp < eps) return 0.0; } return tmp; } int main() { int m, n; scanf( %d %d , &m, &n); double tmp = 0.0; for (int i = m...

#include <bits/stdc++.h> using namespace std; long long save[100005]; long long aa[100005]; int hihi[100005]; int main() { int n; scanf( %d , &n); memset(aa, 0, sizeof(aa)); memset(aa, 0, sizeof(aa)); int first = 0, second = 0, sum = 1; long long a; scanf( %I64d , &a); if (a !=...

#include <bits/stdc++.h> using namespace std; const int maxn = 3e5 + 10; int lim; int n; int p[maxn] = {0}; int res[maxn] = {0}; bool vis[maxn] = {0}; int cnt = 0; int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %d , &p[i]); } lim = n; res[cnt++] = 1; ...

#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 << i << ; cout << endl; } return 0; }

#include <bits/stdc++.h> using namespace std; long long a, b, c, d, ans; char signs[3]; void r1(long long a) { ans = min(ans, a); } void r2(long long a, long long b) { if (signs[2] == * ) { r1(a * b); } else { r1(a + b); } } void r3(long long a, long long b, long long c) { if ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 100111; int N, M; int ncr[MAXN][128]; int pre[128][MAXN]; int init[MAXN]; int main() { ios_base::sync_with_stdio(false); ncr[0][0] = 1; for (int n = 1; n < MAXN; n++) for (int r = 0; r <= 100; r++) { ncr[n][r] = ncr[n...

#include <bits/stdc++.h> using namespace std; void solve() { int n, x; cin >> n >> x; int sum = 0, infected = 0; for (int i = 1; i <= n; i++) { int val; cin >> val; sum += val; infected += (val == x); } if (infected == n) cout << 0 << n ; else if (infected...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; long long int a[n + 1]; a[0] = 0ll; long long int ans = 0ll; for (int i = 1; i <= n; i++) { cin >> a[i]; if (a[i] > a[i - 1]) ans += (1ll * (a[i] - a[i - 1]) * (n - a[i] + 1)); if (a[i] < a[i - 1]) ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t, n; cin >> n; vector<int> a(n); int maxNum = 0; for (int i = 0; i < n; i++) { cin >> a[i]; maxNum = max(a[i], maxNum); } vector<vector<bool> > board(maxNu...

#include <bits/stdc++.h> using namespace std; int main() { long long q; cin >> q; while (q--) { long long n, a, b; cin >> n >> a >> b; if (a + b >= n) cout << max(a, b) - (a + b - 1 - n) << endl; else cout << min(a, b) + 1 << endl; } return 0; }

#include <bits/stdc++.h> using namespace std; int n; int A[101]; string s; long long d[101][101][101]; long long f(int lo, int hi, int p) { if (lo == hi) return A[p]; if (d[lo][hi][p]) return d[lo][hi][p]; long long ret = f(lo + 1, hi, 1) + A[p]; if (s[lo] == s[lo + 1]) ret = max(ret, f(lo +...

#include <bits/stdc++.h> using namespace std; #pragma GCC diagnostic ignored -Wmissing-declarations double triangle_area(const complex<double> p1, const complex<double> p2, const complex<double> p3) { return abs((p2.real() - p1.real()) * (p3.imag() - p1.imag()) - (p2.im...

#include <bits/stdc++.h> using namespace std; template <typename S, typename T> ostream& operator<<(ostream& out, pair<S, T> const& p) { out << ( << p.first << , << p.second << ) ; return out; } template <typename T> ostream& operator<<(ostream& out, vector<T> const& v) { int l = v.size();...

#include <bits/stdc++.h> using namespace std; const int N = 1000; int dist[N * N], memo[N * N]; vector<pair<int, int>> H, T; vector<int> ladj[N * N]; int vis[N * N]; inline int f(int x, int y) { return x * N + y; } int bfs(int start) { int n = N * N; fill(dist, dist + n, INT_MAX); fill(memo,...

#include <bits/stdc++.h> using namespace std; int read() { char x = getchar(); int ans = 0, flag = 1; while (!isdigit(x)) if (x == - ) flag = -1, x = getchar(); else x = getchar(); while (isdigit(x)) ans = ans * 10 + x - 0 , x = getchar(); return ans * flag; } i...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:64000000 ) using std::cerr; using std::cin; using std::cos; using std::cout; using std::endl; using std::make_pair; using std::map; using std::max; using std::min; using std::next_permutation; using std::pair; using std::priority_queue; ...

#include <bits/stdc++.h> using namespace std; int r1, c1, r2, c2; int chk(int i, int j) { if (i == r1 || j == c1 || (((i == r1 && j == c1) || (i == r2 && j == c2)) ? 1 : 0)) return 1; if ((((i - 1 == r1 && j - 2 == c1) || (i - 1 == r2 && j - 2 == c2)) ? 1 : 0)) return 1; if ((((i +...

#include <bits/stdc++.h> using namespace std; const int mod = 998244353; long long power(long long base, long long b) { long long ret = 1; while (b) { if (b & 1) ret = ret * base % mod; base = base * base % mod; b >>= 1; } return ret; } int n, m; long long ans, cur; int m...

#include <bits/stdc++.h> const int MAXN = 1e5 + 5; const long long MOD = 998244353; const int INF = 0x3f3f3f3f; const long long LL_INF = 0x3f3f3f3f3f3f3f3f; const double PI = acos(-1); const double ERR = 1e-10; const int L = 40; const int M = 30; using namespace std; long long mx = -1e18; long lon...

#include <bits/stdc++.h> using namespace std; template <typename T> T getint() { T x = 0, p = 1; char ch; do { ch = getchar(); } while (ch <= ); if (ch == - ) p = -1, ch = getchar(); while (ch >= 0 && ch <= 9 ) x = x * 10 + ch - 0 , ch = getchar(); return x * p; } mt1...

#include <bits/stdc++.h> using namespace std; int a[201][201] = {0}; int n, m; int main(int argc, char *argv[]) { int x = 100; int y = 100; int ok = 0; cin >> n >> m; a[x][y] = n; do { ok = 0; int max = y; int min = x; for (int i = x; i <= y; i++) for (int...

#include <bits/stdc++.h> using namespace std; const long long N = 100005; bool dp[501][501]; long long a[501], b[501]; signed main() { std::ios::sync_with_stdio(false); cin.tie(NULL); long long n, k; cin >> n >> k; for (long long i = 1; i < n + 1; i++) { cin >> a[i] >> b[i]; } ...

#include <bits/stdc++.h> using namespace std; int main() { long long i, j, k, l, m, n; cin >> n; if (n & 1) cout << 1 << endl; else cout << 2 << endl; }

#include <bits/stdc++.h> using namespace std; const int N = 1000010; char kol[6]; set<vector<int> > zb; bool used[6]; int rozw[6]; int obr[][6] = {{1, 2, 3, 4, 5, 6}, {1, 5, 3, 6, 4, 2}, {1, 6, 3, 5, 2, 4}, {1, 4, 3, 2, 6, 5}, {2, 3, 4, 1, 5, 6}, {2, 6, 4, 5, 3, 1}, {2,...

#include <bits/stdc++.h> using namespace std; int main() { long i, a = 0, b, j, b1[26] = {}, b2[26] = {}; string s1, s2; vector<long> v1, v2; cin >> s1 >> s2; if (s1.size() != s2.size()) { cout << NO ; return 0; } for (i = 0; i < s1.size(); i++) { if (s1[i] != s2[i]) {...

#include <bits/stdc++.h> #pragma GCC optimize(3) #pragma GCC optimize( Ofast ) #pragma GCC optimize( inline ) using namespace std; const int N = 7005; const int M = 200000; const long long mod = 1e9 + 7; const long long inf = 0x3f3f3f3f; namespace FastIO { template <typename tp> inline void read(t...

#include <bits/stdc++.h> using namespace std; int binSearch(int *a, int n, int x) { int l = 0; int r = n - 1; while (l < r) { int mid = (l + r) / 2; if (a[mid] == x) return mid; else if (a[mid] < x) l = mid + 1; else r = mid - 1; } return -1; } ...

#include <bits/stdc++.h> #pragma GCC target( sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx ) using namespace std; const int mod = 1e9 + 7; const int N = 2e5 + 4; int a[N], v[N], s[N]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m, k; cin >> n >> m >> k; for (i...

#include <bits/stdc++.h> using namespace std; const int MOD = 10000; struct Big { vector<int> *data; int size() const { return data->size(); } bool operator<(const Big &a) const { if (size() != a.size()) return size() < a.size(); for (int i = (int)size() - 1; i >= 0; i--) if ((*dat...

#include <bits/stdc++.h> using namespace std; int main() { int n, m; string s[105]; set<char> ms; cin >> n >> m; for (int i = 0; i < n; i++) cin >> s[i]; long long ans = 1; for (int i = 0; i < m; i++) { ms.clear(); for (int j = 0; j < n; j++) ms.insert(s[j][i]); ans = a...

#include <bits/stdc++.h> using namespace std; inline void read(int &x) { int v = 0, f = 1; char c = getchar(); while (!isdigit(c) && c != - ) c = getchar(); if (c == - ) f = -1; else v = (c & 15); while (isdigit(c = getchar())) v = (v << 1) + (v << 3) + (c & 15); x = v * f;...

#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; int main() { int t; int n, m; long long s = 0; cin >> n >> m; vector<long long> a(m); for (int i = 0; i < m; i++) { cin >> a[i]; } s += (a[0] - 1); for (int i = 1; i < m; i++) { if (a[i] >= a[i -...

#include <bits/stdc++.h> using namespace std; int n, ans; int f[2005][2005], A[2005][2005]; int mul[2005], tr1[2005], tr2[2005], vis[2005], lck[2005]; int Getsum(int *tree, int x) { int ans = 0; for (int i = x; i; i -= i & -i) ans += tree[i]; return ans; } void Update(int *tree, int x, int v) ...

#include <bits/stdc++.h> using namespace std; struct point { int id; bool ok; int row; bool operator<(const point &p) const { return (id == p.id) ? ok < p.ok : id < p.id; } }; point a[600100]; vector<int> edge[300100]; int dp[300100]; int truoc[300100]; bool ok[300100]; int m...

#include <bits/stdc++.h> using namespace std; int main() { int w, m; cin >> w >> m; vector<int> v; while (m > 0) { v.push_back(m % w); m /= w; } int ok = 1; for (int i = 0; i < v.size(); i++) { if (v[i] != 0 && v[i] != 1) { v[i] -= w; if (v[i] != -1 && v...

#include <bits/stdc++.h> using namespace std; int main() { int a, b, sum = 0; cin >> a >> b; sum = (a * b) / 2; cout << sum << endl; return 0; }

#include <bits/stdc++.h> using namespace std; long long int pow_mod(long long int a, long long int b) { long long int res = 1; while (b != 0) { if (b & 1) { res = (res * a) % 1000000007; } a = (a * a) % 1000000007; b /= 2; } return res; } void solve() { long l...

#include <bits/stdc++.h> using namespace std; long long t1, t2, x1, x2, t0, ans1, ans2, z1, z2, y20; inline void trr(const long long& y1_gdssdfjsdgf, const long long& y2) { if (y1_gdssdfjsdgf == 0 && y2 == 0) return; if (ans1 == -1) { if ((y1_gdssdfjsdgf * t1 + y2 * t2) >= t0 * (y1_gdssdfjsdgf + y2)...

#include <bits/stdc++.h> using namespace std; const int N = 2e3 + 10; const int mod = 998244353; int f[N][N], g[N][N]; int mn[N][N], indl[N], indr[N]; bool bz[N][N]; int a[1000001]; int n, m; int main() { scanf( %d %d , &n, &m); for (int i = 1; i <= m; i++) scanf( %d , &a[i]); int x = m; ...

#include <bits/stdc++.h> int a[300004], pos[300004]; using namespace std; int main() { int n, temp; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; pos[a[i]] = i; } bool flag = false; for (int i = 1; i <= n && !flag; i++) for (int j = i + 1; j <= min(n, i + 5) && !f...

/* ID: c4ts0up LANG: C++ TASK: URL: */ #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; #define pb push_back #define ff first #define ss second #define endl n void fast_io() { ios_base::sync_with_stdio(false); cin.tie(NULL)...

#include <bits/stdc++.h> std::string colors( RGBYW ); struct Card { int color; int number; bool operator<(const Card& rhs) const { if (color == rhs.color) return (number < rhs.number); else return color < rhs.color; } }; int mapColor(char color) { size_t pos = col...

#include <bits/stdc++.h> using namespace std; int n, a, b, m[1001][1001]; void solve() { cin >> n >> a >> b; if (a > 1 and b > 1) { cout << NO << n ; return; } if (a == 1 and b == 1) { if (n == 1) { cout << YES << n ; cout << 0; return; } ...

#include <bits/stdc++.h> using namespace std; const int N = 1010; const int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0}; long long k; int n, m, h[N][N]; bool mark[N][N]; int pre[N * N], sz[N * N]; int find(int x) { return pre[x] = (pre[x] == x ? x : find(pre[x])); } bool merge(int x, int y) { int a...

#include <bits/stdc++.h> using namespace std; int main() { int ans, n, m, x, y; cin >> n >> m; int lo = (n + 1) / 2; ans = (lo + m - 1) / m; ans *= m; if (ans > n) cout << -1 << endl; else cout << ans << endl; return 0; }

#include <bits/stdc++.h> using namespace std; long long n, m, dp[1 << 19][21], a[22][22], ans; long long lowbit(long long x) { return (x & (-x)); } int main() { memset(a, 0, sizeof(a)); memset(dp, 0, sizeof(dp)); scanf( %lld%lld , &n, &m); for (int i = 1; i <= m; i++) { int x, y; sca...

#include <bits/stdc++.h> using namespace std; template <typename P, typename Q> ostream& operator<<(ostream& os, pair<P, Q> p) { os << ( << p.first << , << p.second << ) ; return os; } int main(int argc, char* argv[]) { int n, k; while (scanf( %d%d , &n, &k) == 2) { vector<int> v; ...

#include <bits/stdc++.h> using namespace std; char buf[256]; signed main() { long long n; scanf( %lld , &n); stack<long long> cur; set<long long> si; long long tmp = 1, ans = 0; for (long long i = 0; i < n * 2; i++) { scanf( %s , buf); string s(buf); if (s == add ) { ...

#include <bits/stdc++.h> using namespace std; const int maxn = 300100, mod = 998244353; inline void Add(int &a, int b) { a = a + b >= mod ? a + b - mod : a + b; } int head[maxn], nxt[maxn << 1], ver[maxn << 1], tot; inline void addedge(int a, int b) { nxt[++tot] = head[a]; ver[tot] = b; head[a] = ...

#include <bits/stdc++.h> using namespace std; int newMask[1000000][4]; bool canMove[1000000][4]; int mv[][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}}; int len; int getMove(int x, int y) { if (x == 1 && y == 0) return 0; if (x == 0 && y == 1) return 1; if (x == -1 && y == 0) return 2; return 3; ...

#include <bits/stdc++.h> using namespace std; int a[120], n, t; bool check(); int main() { cin >> t; while (t--) { cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; sort(a + 1, a + n + 1); if (check()) cout << YES n ; else cout << NO n ; } } bool...

#include <bits/stdc++.h> using namespace std; const int N = 110000; string s; int n, cnt1, cnt0, cntq, m, p; char last0, last1; int may01, may10; int main() { cin >> s; n = s.size(); for (int i = 0; i < n; i++) if (s[i] == 1 ) cnt1++; else if (s[i] == 0 ) cnt0++; ...

#include <bits/stdc++.h> using namespace std; const long double pi = 3.1415926535897932384626433832795l; template <typename T> inline auto sqr(T x) -> decltype(x * x) { return x * x; } template <typename T1, typename T2> inline bool umx(T1& a, T2 b) { if (a < b) { a = b; return 1; ...

#include <bits/stdc++.h> using namespace std; int ans[1009]; int main() { memset(ans, -1, sizeof(ans)); for (int i = 1; i <= 15; i += 2) { int x = (i * i + 1) / 2; int y = (i - 1) / 4 * 2; for (int j = 0; j <= y; j++) { for (int k = 0; k <= (x - 1 - 2 * y) / 4; k++) { f...

#include <bits/stdc++.h> using namespace std; int main() { char spots[9][9]; for (int i = 0; i < 9; i++) { for (int j = 0; j < 3; j++) { string input; cin >> input; for (int k = 0; k < input.size(); k++) { spots[i][j * 3 + k] = input[k]; } } } in...

#include <bits/stdc++.h> using namespace std; int arr[1000005]; int n, m, k; int main() { scanf( %d%d%d , &n, &m, &k); memset(arr, 0, sizeof arr); for (int i = 0; i < m; ++i) { int number; scanf( %d , &number); arr[number] = 1; } bool flg = 0; int where = 1; if (arr...

#include <bits/stdc++.h> using namespace std; int main() { int i, l, skg = 0, skr = 0, sky = 0, skb = 0, kr = 0, kg = 0, kb = 0, ky = 0, pg = 0, pr = 0, py = 0, pb = 0; char s[120], r[4]; scanf( %s , s); l = strlen(s); if (l % 4 == 0) { for (i = 0; i < l; i += 4) { kg...

#include <bits/stdc++.h> using namespace std; struct debugger { static void call(const char* it) {} template <typename T, typename... aT> static void call(const char* it, T a, aT... rest) { string b; for (; *it && *it != , ; ++it) if (*it != ) b += *it; cerr << b << = << ...

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

#include <bits/stdc++.h> using namespace std; int n, k; long long a[10010]; int main() { scanf( %d%d , &n, &k); for (int i = 1; i <= n; i++) scanf( %lld , &a[i]); sort(a + 1, a + 1 + n); long long sum = 0; for (int i = 1; i <= k; i++) sum += a[i]; printf( %lld n , sum); return 0; }...

#include <bits/stdc++.h> using namespace std; void err() { cout << endl; } template <class T, class... Ts> void err(const T &arg, const Ts &...args) { cout << arg << ; err(args...); } using ll = long long; using db = double; const int N = 1e5 + 10; int n, m, q; int deg[N]; vector<vector...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 5; int t, n, h, m, a[maxn], x; int sum; int main() { ios::sync_with_stdio(0); cin >> n >> h >> m; for (int i = 1; i <= n; ++i) a[i] = h; for (int i = 0; i < m; ++i) { int l, r, w; cin >> l >> r >> w; for (in...

#include <bits/stdc++.h> using namespace std; bool check(long long int n, long long int k) { long long int sum = k; long long int A[k]; fill(A, A + k, 1); for (long long int i = k - 1; i >= 0; --i) { while (sum + A[i] <= n) { sum += A[i]; A[i] *= 2; } } if (sum !=...