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; template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cerr << name << : << arg1 << std::endl; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, ...
#include <bits/stdc++.h> using namespace std; int n, t; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> t; while (t--) { cin >> n; if (n <= 2) { cout << 0 << endl; continue; } else { int x; x = n / 2; if (n % ...
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; int a[n + 1]; for (int i = 1; i <= n; i++) cin >> a[i]; sort(a + 1, a + n + 1); int ans = 0; for (int i = 1; i <= k; i++) ans += a[i]; cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; int dp[60][20010]; int S[60][20010]; int n, m, k; int sum(int i, int l, int r) { if (l > r) return 0; return S[i][r] - S[i][l - 1]; } int L[20010], R[20010]; int pre[20010], suf[20010]; int ST[2][200010]; void init(int tree[], int A[], int node, ...
#include <bits/stdc++.h> using namespace std; vector<int> ans; void solve(long long n) { long long step = 0; while (n != 1) { if (n % 2 == 0) { if (n % 6 != 0) { ans.push_back(-1); return; } n /= 6; if (n == 0) { ans.push_back(-1); ...
#include <bits/stdc++.h> using namespace std; int main() { int n, k, nums[2201], ans = 0; cin >> n >> k; for (int i = 0; i < n; i++) { cin >> nums[i]; } sort(nums, nums + n); for (int i = 0; i < k; i++) { ans += nums[i]; } cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; const long long linf = 1e18 + 9; const int inf = 1e9 + 9; const long long mod = 1e9 + 7; const int N = 4e5 + 9; int n, u, v, ans[N], sub[N], mx[N], centroid; vector<int> gr[N], c[N]; int dfs(int v, int f) { sub[v] = 1; for (int i = 0; i < gr[v].size(...
#include <bits/stdc++.h> using namespace std; int gcd(int x, int y) { return (y == 0 ? x : gcd(y, x % y)); } const int N = (int)1e6 + 100; int a[30]; int n; int m = 0; char s[N]; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d , &a[i]); for (int i = 0; i < n; i++) m += a[...
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5; int d[maxn]; int w[maxn]; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; string s; cin >> s; for (int i = 0; i < n; ++i) { cin >> d[i]; } int cur = 0; while (cur >= 0...
#include <bits/stdc++.h> using namespace std; const int max_n = 22, max_q = 11111, mod = 1000000007; struct matrix { vector<vector<int> > v; matrix() {} matrix(int n, int m) { v.resize(n, vector<int>(m, 0)); } matrix operator*(const matrix &m) const { matrix res(v.size(), m.v[0].size()); ...
#include <bits/stdc++.h> using namespace std; void solve() { int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } string ans = NO ; for (int i = 0; i < n - 1; i++) { if (a[i] <= a[i + 1]) ans = YES ; } cout << ans << n ; } int main() { i...
#include <bits/stdc++.h> using namespace std; int N, S, L, A[100009]; int c[100009], dp[100009]; deque<pair<int, int>> s, t, u; int main() { scanf( %d%d%d , &N, &S, &L); for (int i = 1; i <= N; i++) dp[i] = 1e6; for (int i = 1, ptr = 1; i <= N; i++) { scanf( %d , &A[i]); while (s.size(...
#include <bits/stdc++.h> using namespace std; void dfs(long long v, vector<long long> adj[], vector<bool>& visited) { cout << char(v + a ); visited[v] = true; for (long long u : adj[v]) { if (!visited[u]) dfs(u, adj, visited); } } signed main() { ios_base::sync_with_stdio(false); ...
#include <bits/stdc++.h> using namespace std; vector<int> set1; vector<int> set2; int col[100004], vis[100004]; int flag = 1; class Graph { int V; list<int> *adj; public: Graph(int V); void addEdge(int v, int w); void BFS(int s); }; Graph::Graph(int V) { this->V = V; ad...
#include <bits/stdc++.h> using namespace std; const int NMax = 100005; const int sqrNMax = 330; int N; int Nb[NMax][sqrNMax + 5]; int A[NMax], B[sqrNMax + 5][2 * sqrNMax + 5], Start[sqrNMax + 5], Block[NMax], totalB, Size[sqrNMax + 5]; void Read() { scanf( %d , &N); for (int i = 1; i <= N; i...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1005; const int MOD = 1000000007; int N, P; int dp[MAXN][4]; int a[MAXN], b[MAXN]; int cnt[3]; void load() { scanf( %d%d , &N, &P); } inline int add(int x, int y) { x += y; if (x >= MOD) x -= MOD; else if (x < 0) x ...
#include <bits/stdc++.h> using namespace std; int a[100005], l[100005], r[100005]; int main() { int n, m, i, j, x, y, pos; cin >> n >> m; for (i = 1; i <= n; i++) scanf( %d , &a[i]); l[1] = r[1] = 0; for (i = 2; i <= n; i++) { l[i] = l[i - 1]; if (a[i - 1] > a[i]) l[i]++; r[i...
#include <bits/stdc++.h> using namespace std; struct ter { int cx, cy, dir, pt, rem; ter(){}; ter(int _cx, int _cy, int _dir, int _pt, int _rem) : cx(_cx), cy(_cy), dir(_dir), pt(_pt), rem(_rem){}; }; const int dx[] = {0, 1, 1, 1, 0, -1, -1, -1}; const int dy[] = {1, 1, 0, -1, -1, -1, 0, 1...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; map<int, int> a; for (int i = 0; i < n; i++) { int temp; cin >> temp; a[temp]++; } map<int, int> b; for (int i = 0; i < n - 1; i++) { int temp; cin >> temp; b[temp]++; } ...
#include <bits/stdc++.h> int main() { int n; scanf( %d , &n); int people_in_queue[n]; for (int i = 0; i < n; i++) { scanf( %d , &people_in_queue[i]); } int num_of_product[n][100], sum[n]; for (int i = 0; i < n; i++) { sum[i] = 0; for (int j = 0; j < people_in_queue[i]; j...
#include <bits/stdc++.h> using namespace std; void err(istream_iterator<string> it) {} template <typename T, typename... Args> void err(istream_iterator<string> it, T a, Args... args) { cerr << *it << = << a << endl; err(++it, args...); } template <typename T> void printV(const T &t) { std...
#include <bits/stdc++.h> using namespace std; const int ms = 100010; vector<int> g[ms]; int in[ms], out[ms]; int main() { int n, m; int a, b; cin >> n >> m; for (int i = 0; i < m; ++i) { scanf( %d%d , &a, &b); if (a > b) swap(a, b); in[a]++, out[b]++; g[a].push_back(b);...
#include <bits/stdc++.h> using namespace std; priority_queue<int, vector<int>, greater<int> > p; bool visited[100005]; vector<int> G[100005]; int n, m; void prime() { p.push(1); while (!p.empty()) { int v = p.top(); p.pop(); if (visited[v]) continue; visited[v] = true; ...
#include <bits/stdc++.h> using namespace std; const int N = 2005, P = 998244353; using ll = long long; ll qpow(ll a, ll b) { ll ret = 1; while (b) { if (b & 1) ret = ret * a % P; a = a * a % P; b >>= 1; } return ret; } int n, a, b; ll pw[N * N], pw1[N * N]; ll dp[N][N],...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, f = 0, ans, m, a1[20], flag = 0, a2[20], b1[20], b2[20], num[20] = {0}, c = 0; cin >> n >> m; for (int i = 0; i < n; i++) cin >> a1[i] >> a2[i]; f...
#include <bits/stdc++.h> using namespace std; const int MAXN = 132674; const int MOD = 1e9 + 7; int main() { set<int> ar; set<int> to_buy; set<int> to_sell; long long multiplyier = 1; int n; scanf( %d , &n); for (int i = 0; i < n; i++) { int temp; string l; cin >> l...
#include <bits/stdc++.h> using namespace std; int a, b, n, k, y, x, i, j, h, ans, c, d[100005], f[10]; char s[105], s1[105]; int main() { scanf( %d%d%s , &n, &k, s); for (i = 1; i <= k; i++) { int f[1000] = {0}; scanf( %d %d , &a, &b); x = 0; int DP = 1, CP = 0, lens1 = 0; ...
#include <bits/stdc++.h> using namespace std; const int N = 2010, M = N * N; int n, m, dist[N][N], deg[N][N], fx[N][N], fy[N][N]; char str[N][N]; pair<int, int> p[M]; int hh, tt; bool st[N][N]; void topsort() { hh = 0; tt = -1; for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) ...
#include <bits/stdc++.h> using namespace std; const double PI = 3.1415926536; int n, m, spaces; bool a[100005], vis[505][505]; void walk(int x, int y, string s) { int counter = 1; for (int i = 0; i < s.size(); i++) { if (s[i] == U ) { if (x > 1) { x--; if (!vis[x][y]...
#include <bits/stdc++.h> using namespace std; const long long INF = (long long)1e12; const int maxn = 100050; struct STU { int b, c, id; bool operator<(const STU &s) const { return c < s.c \|\| (c == s.c && id < s.id); } }; map<STU, int> mp; bool cmp(const STU &a, const STU &b) { return a....
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, i; cin >> n; string s; int ans = 0; cin >> s; for (i = 1; i < n; i++) { if (s[i] != s[0]) break; } if (i != n) { int c = 1; for (int j ...
#include <bits/stdc++.h> using namespace std; long long a, b, c, Minus, tmp, pos, lar_pos, ans; long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } long long lcm(long long a, long long b) { return a / gcd(a, b) * b; } long long f(long long a, long long b) { if...
#include <bits/stdc++.h> using namespace std; int N, M, K; vector<pair<int, char> > r, rr; int main() { scanf( %d %d %d , &N, &M, &K); if (4 * N * M - 2 * N - 2 * M < K) return !printf( NO ); printf( YES n ); int c; char d; c = M - 1; d = R ; r.push_back({min(c, K), d}); K -...
#include <bits/stdc++.h> using namespace std; const int maxn = 1000020; const int maxx = 1000000; const int MOd = 1e9 + 7; const int K = 1000; const int P = 143; int loc[maxn]; class Aho_Corasick { public: int last, next[maxn][26]; short used[maxn][26], step; int deg[maxn], dad[maxn]; ...
#include <bits/stdc++.h> int main(int argc, char const *argv[]) { int h1, a1, c1, h2, a2; std::cin >> h1 >> a1 >> c1; std::cin >> h2 >> a2; std::string s = STRIKE n , h = HEAL n ; int n(0); std::string ans; while (h2 > 0) { n++; if (h1 <= a2 && h2 > a1) { h1 += c1; ...
#include <bits/stdc++.h> using namespace std; int t[123]; int main() { ios::sync_with_stdio(0); cin.tie(0); int a, n; cin >> n >> a; --a; for (int i = 0; i < n; ++i) cin >> t[i]; int l, r; l = r = a; int res = 0; while (l >= 0 \|\| r < n) { if (l >= 0 && r < n) { ...
#include <bits/stdc++.h> using namespace std; int lsone(int n) { return (n & -n); } void mult(long long int a[25][25], long long int b[25][25], long long int c[25][25], int m, int n, int p) { for (int i = 1; i <= m; i++) { for (int j = 1; j <= p; j++) { c[i][j] = 0; for (int ...
#include <bits/stdc++.h> using namespace std; const int N = 2005; char mp[N][N]; int deg[N][N]; int cnt[2], n, m; int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0}; string str = ><v^ , tmp = <>^v ; bool check(int x, int y) { return x >= 1 && x <= n && y >= 1 && y <= m; } int main() { ios ::sync_wit...
#include <bits/stdc++.h> using namespace std; void flash() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } void solve() { long long n; cin >> n; vector<long long> v(n); long long sm = 0; long long mx = 0; for (long long i = 0; i < n; i++) { cin >> v...
#include <bits/stdc++.h> using namespace std; bool SR(int &_x) { return scanf( %d , &_x) == 1; } bool SR(long long &_x) { return scanf( %lld , &_x) == 1; } bool SR(double &_x) { return scanf( %lf , &_x) == 1; } bool SR(char *_s) { return scanf( %s , _s) == 1; } bool RI() { return true; } template <typenam...
#include <bits/stdc++.h> using namespace std; using ll = long long; int n, a[100005], sta[100005]; vector<int> V; int calc(int k) { while (k) { int d = k % 10; k /= 10; if (d != 4 && d != 7) return 0; } return 1; } using pii = pair<int, int>; int tar[100005], to[100005]; ...
#include <bits/stdc++.h> using namespace std; struct node { int lb, rb, l_max, r_max, s_max; }; int n, m, l, r, k, offset = 1 << 19, a[300004], z, t; long long d[600004]; node trn[1100000]; int sgn(long long x) { if (x > 0) return 1; if (x < 0) return -1; return 0; } void update(int po...
#include <bits/stdc++.h> using namespace std; const int inf = 0x7fffffff; const double eps = 1e-10; const double pi = acos(-1.0); inline int read() { int x = 0, f = 1; char ch; ch = getchar(); while (ch < 0 \|\| ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch...
#include <bits/stdc++.h> const long long int mrx = 1e6 + 5, M = 1e9 + 7; long long int mx = INT_MIN, mn = INT_MAX; using namespace std; long long int x1, x2, s, t1, t2, p, d; long long int poezd, igor; int main() { ios_base::sync_with_stdio(NULL); cin.tie(NULL); cin >> s >> x1 >> x2; cin >> ...
#include <bits/stdc++.h> using namespace std; int n; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; int sl = 0; for (int i = 1; i <= n; ++i) { int x, y; cin >> x >> y; if (x > 0) ++sl; } if (sl == n \|\| sl == 0 \|\| sl == n - 1 \|\| sl == 1) { cout ...
#include <bits/stdc++.h> using namespace std; template <class T> void printQueue(T& q) { while (!q.empty()) { cout << q.top() << endl; q.pop(); } } vector<int> adj[200009]; vector<pair<int, int> > levels; bool visited[200009]; bool cmp(pair<int, int> a, pair<int, int> b) { if (a....
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; void compute() { long long n; cin >> n; n -= 2; string s[n]; cin >> s[0]; string ans = s[0]; for (long long i = 1; i < n; i++) { cin >> s[i]; if (s[i][0] == ans[ans.size() - 1]) ans.push_ba...
#include <bits/stdc++.h> using namespace std; vector<int> ans; int m; int main() { int n, ans = 0; string s; cin >> n; cin >> s; for (int i = 0; i < n; i++) if (s[i] == < ) ans++; else break; for (int i = n - 1; i >= 0; i--) if (s[i] == > ) ans...
#include <bits/stdc++.h> using namespace std; const long long mod = 1000 * 1000 * 1000 + 7LL; const double EXP = 1e-6; const int MAX = 100001; int main() { int n, k; while (cin >> n >> k) { int a[10001]; for (int i = 1; i <= n; i++) a[i] = 1; a[n] = 0; while (k--) { for...
#include <bits/stdc++.h> using namespace std; char s[100010], s1[100010], s2[100010], s3[100010], s11[100010]; int main() { scanf( %s , &s); int len; len = strlen(s); int sum = 0, a = 0; for (int i = 0; i < len; i++) { sum += s[i] - 0 ; if (s[i] == 0 ) a = 1; } if (sum % ...
#include <bits/stdc++.h> using namespace std; void sprint(string s) { for (int i = 0; i < s.size(); ++i) printf( %c , s[i]); printf( n ); } int main() { int n, k, d; cin >> n >> k >> d; int a[n]; int b[n]; for (int i = 0; i < n; ++i) { scanf( %d , &a[i]); b[i] = 0; }...
#include <bits/stdc++.h> using namespace std; struct myQueue { stack<pair<long long, long long> > s1, s2; int size() { return s1.size() + s2.size(); } bool isEmpty() { return size() == 0; } long long getMax() { if (isEmpty()) { return -2e9; } if (!s1.empty() && !s2.empty())...
#include <bits/stdc++.h> using namespace std; string s1, s2; int len1, len2; int dp[5002][5002]; int func(int p1, int p2) { if ((p1 == len1) \|\| (p2 == len2)) { return 0; } if (dp[p1][p2] != -1) { return dp[p1][p2]; } int ans = 0; if (s1[p1] == s2[p2]) { ans = (1 + ans...
#include <bits/stdc++.h> using namespace std; using namespace std; int get_type(int a, int b, int c) { if (a == 0 && b == 0 && c != 0) return 0; if (a == 0 && b == 0 && c == 0) return -1; if (a == 0) return 1; if (b == 0) return 2; return 3; } int main() { int a1, b1, c1, a2, b2, c2; ...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; struct node { long long v[10]; int tag[10]; void init(int x) { int y = 1; memset(v, 0, sizeof(v)); while (x) { v[x % 10] += y; x /= 10; y = 10; } } void updtag(int _tag) { ...
#include<bits/stdc++.h> using namespace std; //#pragma GCC optimize( Ofast,unroll-loops,no-stack-protector ) //#pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) #define pb push_back #define fi first #define se second #define ll long long #define ld long double #def...
#include <bits/stdc++.h> using namespace std; vector<pair<int, pair<int, int> > > horz, vert, tmp; set<int> y_com; map<int, int> y_map; void cleanup(vector<pair<int, pair<int, int> > >& v) { sort(v.begin(), v.end()); for (auto it = v.begin(); it != v.end();) { if (it != v.begin()) { auto...
#include <bits/stdc++.h> using namespace std; const double eps = 1e-7; const int inf = 0x3f3f3f3f; const int hinf = 0x3f3f3f3f; const long long mod = 1000000009; struct node { int l, r; double expe; double add; } sgt[100010 << 2]; int n, m; int a[100010], h[100010], l[100010], r[100010]; ...
#include <bits/stdc++.h> using namespace std; const double eps = 1e-9; const long long int MOD1 = 1e9 + 7; const long long int MAX5 = 1e5; const long long int MAX6 = 1e6; const long long int MAX7 = 1e7; const long long int MAX8 = 1e8; const long long int MAX9 = 1e9; const long long int MAX10 = 1e10; ...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; pair<int, int> mmx[3]; for (int i = 0; i < 3; i++) cin >> mmx[i].first >> mmx[i].second; int a, b, c; a = min(n - mmx[1].first - mmx[2].first, mmx[0].second); b = min(n - a - mmx[2].first, mmx[1].second); c =...
#include<bits/stdc++.h> using namespace :: std; #define ll long long #define mp make_pair #define ld long double #define F first #define S second #define pii pair<int,int> #define pb push_back const int maxn=2e5+500; const int inf=1e9+900; const int mod=1e9+7; pair<int,int> tip,che; ...
#include <bits/stdc++.h> using namespace std; template <typename T> T read1() { T t = 0; char k; bool v = 0; do (k = getchar()) == - && (v = 1); while ( 0 > k \|\| k > 9 ); while ( 0 <= k && k <= 9 ) t = (t << 3) + (t << 1) + (k ^ 0 ), k = getchar(); return v ? -t : t; } ...
#include <bits/stdc++.h> using namespace std; int main() { int c, d, n, m, k; cin >> c >> d >> n >> m >> k; int users = n * m - k; int ans = 1000000000; for (int i = 0; i <= m; i++) for (int j = 0; j <= 10000; j++) { if (i * n + j >= users) { if (c * i + j * d < ans) ans ...
#include <bits/stdc++.h> using namespace std; int a[10001]; int i, j, n, k; int main() { cin >> n; for (i = 0; i < n; i++) for (j = 0; j < n; j++) { cin >> k; if (k == 3 \|\| k == 1) a[i] = -1; } k = 0; for (i = 0; i < n; i++) if (a[i] != -1) k++; cout << k <<...
#include <bits/stdc++.h> using namespace std; int main() { int i; int n, d, l; cin >> n >> d >> l; int pos = (n + 1) / 2; int neg = n / 2; int a[n + 1]; if (d > (pos * l - neg) \|\| d < (pos - neg * l)) { cout << -1 ; return 0; } if (d > 0) { for (i = 1; i <= n; ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 10; int n, m; bool lie[40]; int ask(int d) { int ret; cout << d << endl; cin >> ret; if (ret == 0) exit(0); return ret; } int main() { cin >> m >> n; for (int i = 0; i < n; i++) if (ask(m) == 1) lie[i] =...
#include <bits/stdc++.h> using namespace std; vector<long long int> v1, v2; vector<char> v4; string s1, s2, s3; long long int visited[2000005]; set<char> st; set<long long int>::iterator it; int main() { long long int a, b, c, d, e, f, i, j, k, cnt1 = 0, cnt2 = 0, sum1 = 0, sum2 = 0, first, ...
#include <bits/stdc++.h> using namespace std; double dp[200 + 50][200 + 50][200 + 50]; double p[200 + 50]; double res; int a[200 + 50]; int n, l, x, kol; int main() { scanf( %d%d%d , &n, &l, &kol); for (int i = 1; i <= n; i++) { scanf( %d , &x); p[i] = (x + 0.0) / 100; } for (i...
#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > out; vector<pair<int, int> >::iterator iter; long long int a[3][200005]; int main() { long long int x[3], y[3], m[3]; int k[3], i, j, bad = 0, prev = 0, n, u = 1, v = 1; bool A, B; scanf( %d , &n); for (i = 1; i <= 2; i+...
#include <bits/stdc++.h> using namespace std; int d[1000000]; int main() { int n, k; scanf( %d%d , &n, &k); for (int i = 0; i < (n); ++i) { int(x); scanf( %d , &x); d[i % k] += x; } int mi = (int)1e9; int id = -1; for (int i = 0; i < (k); ++i) { if (mi > d[i]) {...
#include <bits/stdc++.h> using namespace std; const int dy[] = {-1, 0, 1, 0}, dx[] = {0, 1, 0, -1}; const double EPS = 1e-8; const double PI = acos(-1.0); int popcount(int n) { return __builtin_popcount(n); } int popcount(long long n) { return __builtin_popcountll(n); } template <class T> int SIZE(T a) ...
#include <bits/stdc++.h> using namespace std; int dirty[3009]; int main() { int n, m; cin >> n >> m; for (typeof(0) i = (0); i < (m); i++) cin >> dirty[i]; sort(dirty, dirty + m); if (!m) cout << YES n ; else if ((dirty[0] != 1) && (dirty[m - 1] != n)) { if (m < 3) cou...
#include <bits/stdc++.h> const double pi = acos(-1.0); using namespace std; inline long long MAX2(long long a, long long b) { return (a) > (b) ? (a) : (b); } inline long long MAX3(long long a, long long b, long long c) { return (a) > (b) ? ((a) > (c) ? (a) : (c)) : ((b) > (c) ? (b) : (c)); } inlin...
#include <bits/stdc++.h> using namespace std; unsigned long long B[31][31], res = 0; int main(void) { for (int i = 0; i <= 30; i++) { B[i][0] = B[i][i] = 1; for (int j = 1; j < i; j++) B[i][j] = B[i - 1][j - 1] + B[i - 1][j]; } int n, m, k; cin >> n >> m >> k; for (int b = 4; b < k...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1000005; const int SQRTN = 1003; const int LOGN = 22; const double PI = acos(-1); const int INF = 1e9; int MOD = 1000000007; const int FMOD = 998244353; const double eps = 1e-9; long long gcd(long long a, long long b) { if (a == 0) r...
#include <bits/stdc++.h> using namespace std; const int NMax = 1100000; inline int read() { int x = 0; char ch = getchar(); bool positive = 1; for (; ch < 0 \|\| ch > 9 ; ch = getchar()) if (ch == - ) positive = 0; for (; ch >= 0 && ch <= 9 ; ch = getchar()) x = x * 10 + ch - 0 ; ...
#include <bits/stdc++.h> using namespace std; int n, cnt[100015], x[100015], y[100015], z[100015]; vector<int> a[100015]; int getpos(int i, int u) { if (x[i] == u) return 0; if (y[i] == u) return 1; if (z[i] == u) return 2; } void dfs(int u, int v) { cout << u << ; if (cnt[v] == 0) { ...
#include <bits/stdc++.h> const int INF = 1e7; using namespace std; const int N = 20; int n, m; int c[N]; int a[N]; int like[N]; string s[N]; int T_res = 0; int Lika = 0; bool Check_Res() { int Lik; for (int i = 2; i <= m; i++) { { Lik = 0; for (int j = 0; j <= n - 1; ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); long long n; cin >> n; long long out = n * (n + 1) * (n + 2) / 6; out = n (n + 1) * (n + 2) * (n + 3) * (n + 4) / 120; cout << out << n ; return 0; }
#include <bits/stdc++.h> using namespace std; const int m = 320; struct data { int n, x, a[2 * m + 10]; data next; }; data head; int get(int value, int limit) { int ret = 0; data *k; for (k = head; k != NULL; k = k->next) { if (k->x > value) break; ret += k->n; } if...
#include <bits/stdc++.h> using namespace std; int dp[150][150]; int main() { int n; cin >> n; for (char a = a ; a <= z ; a++) for (char b = a ; b <= z ; b++) dp[a][b] = -2000000009; for (char c = a ; c <= z ; c++) dp[c][c] = 0; while (n--) { string s; cin >> s; ch...
#include <bits/stdc++.h> using namespace std; using ll = long long; ll modinv(ll a, ll m) { assert(m > 0); if (m == 1) return 0; a %= m; if (a < 0) a += m; assert(a != 0); if (a == 1) return 1; return m - modinv(m, a) * m / a; } template <int MOD_> struct modnum { private: ...
#include <bits/stdc++.h> using namespace std; const int maxn = 1000000 + 50; const int maxm = 1300000 + 100; const int maxt = 3000000 + 100; const int maxk = 10 + 3; const int M = 2010; const long long unit = 1LL; const int INF = 0x3f3f3f3f; const long long Inf = 0x3f3f3f3f3f3f3f3fLL; const double e...
#include <bits/stdc++.h> using namespace std; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n, m; cin >> n >> m; vector<vector<vector<long long>>> g(n); vector<vector<long long>> store(m); for (long long i = 0; i < m; i++) { long long a, b, c...
#include <bits/stdc++.h> using namespace std; int n, m; int main() { cin >> n; int cur = 1; while (n) { if (n == 3) { printf( %d %d %d , cur, cur, cur * n); return 0; } int cnt = n / 2 + n % 2; n -= cnt; while (cnt--) printf( %d , cur); cur *= 2; ...
#include <bits/stdc++.h> const int Max_N(1000005); int N, D; int first[Max_N], ecnt(1), Next[Max_N * 2], To[Max_N * 2]; int degree[Max_N]; std::tuple<int, int> dfs(const int v, const int p = 0) { if (To[first[v]] == p && Next[first[v]] == 0) return std::make_tuple(0, 0); int res(0), max(0), min(D + 1)...
#include <bits/stdc++.h> using namespace std; const long long mxn = 5e5 + 123; const long long inf = 1e9; const long long mod = 998244353; bool om[mxn]; vector<long long> v; long long n, mn = 1e18; ; int main() { int n, m; cin >> n >> m; for (int i = 1; i <= n; i++) if (n % i == 0) v...
#include <bits/stdc++.h> using namespace std; inline long long tmx(long long a, long long b, long long c) { return (a > b && a > c) ? a : ((b > c) ? b : c); } inline long long tmn(long long a, long long b, long long c) { return (a < b && a < c) ? a : ((b < c) ? b : c); } const int MXL = 0x3f3f3f3f; ...
#include <bits/stdc++.h> using namespace std; const int mod = 1000000007; long long f = 0, g = 1; int n; int main() { cin >> n; for (int i = 2; i <= n; i++) { long long k = f; f = 3 * g % mod; g = (k + 2 * g) % mod; } printf( %lld , f); return 0; }
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3fll; void bad() { cout << NO << n ; exit(0); } const int MAX = 4e5 + 10; vector<int> g[MAX]; int main() { if (!false) ios_base::sync_with_stdio(0); cin.tie(0); int n,...
#include <bits/stdc++.h> using namespace std; const int inf = 1e8; struct node { int x, y, z, s; } pre[12][18][18][18]; int n, a, b, dp[12][18][18][18], h[12]; vector<int> ans; void f(int i, int x, int y, int z, int v, int xx, int yy, int zz, int s) { x = max(0, x); y = max(0, y); z = max(...
#include <bits/stdc++.h> using namespace std; int n, arr[2005], counts[2005]; char c = a ; int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> arr[i]; } for (int i = n - 1; i >= 0; i--) { counts[i] = arr[i]; if (arr[i] != 0) { for (int j = i - 1; j >= 0; j--) {...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; if (n & n - 1) puts( NO ); else puts( YES ); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ifstream fin( input.txt ); double a, b, c = 1.000000011, d; cin >> a >> b; d = a * pow(c, b); cout.precision(30); cout << d << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, c = 0; cin >> n; int r = n; int cnt = 0; while (r > 0) { int temp = r % 10; if (temp > 0) cnt++; r = r / 10; c++; } cout << cnt << en...
#include <bits/stdc++.h> using namespace std; char A[102]; int M[102][205][3][52]; int dp(int i, int x, int d, int n) { if (n < 0) return 0; if (!A[i] && n == 0) return abs(x - 102); if (!A[i]) return 0; int &r = M[i][x][d == 1][n]; if (r == -1) { if (A[i] == F ) { r = max(dp(...
#include <bits/stdc++.h> using namespace std; long long n, s, k; string u; long long r[60], dp[2501][60]; signed main() { cin >> n >> s >> k; for (long long i = 0; i < n; ++i) cin >> r[i]; cin >> u; for (long long i = 0; i < n; ++i) for (long long j = 0; j < n; ++j) dp[i][j] = -1e18; ...
#include <bits/stdc++.h> using namespace std; template <typename A, typename B> string to_string(pair<A, B> p); template <typename A, typename B, typename C> string to_string(tuple<A, B, C> p); template <typename A, typename B, typename C, typename D> string to_string(tuple<A, B, C, D> p); string to_str...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 5; const int MOD = 1e9 + 7.5; char s[MAXN]; int f[MAXN], n; int main() { scanf( %s , s + 1); n = strlen(s + 1); int preb = 0; for (int i = 1; i <= n; ++i) { f[i] = f[i - 1]; if (s[i] == a ) { f[i] = (f[...
#include <bits/stdc++.h> using namespace std; namespace io { void _(int &k) { char c; int e = 1; k = 0; while ((c = getchar()) > 9 \|\| c < 0 ) if (c == - ) e = -1; k = c - 0 ; while ((c = getchar()) <= 9 && c >= 0 ) { k = 10; k += c - 0 ; } k = e; } ...

#include <bits/stdc++.h> using namespace std; template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cerr << name << : << arg1 << std::endl; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, ...

#include <bits/stdc++.h> using namespace std; int n, t; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> t; while (t--) { cin >> n; if (n <= 2) { cout << 0 << endl; continue; } else { int x; x = n / 2; if (n % ...

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

#include <bits/stdc++.h> using namespace std; int dp[60][20010]; int S[60][20010]; int n, m, k; int sum(int i, int l, int r) { if (l > r) return 0; return S[i][r] - S[i][l - 1]; } int L[20010], R[20010]; int pre[20010], suf[20010]; int ST[2][200010]; void init(int tree[], int A[], int node, ...

#include <bits/stdc++.h> using namespace std; vector<int> ans; void solve(long long n) { long long step = 0; while (n != 1) { if (n % 2 == 0) { if (n % 6 != 0) { ans.push_back(-1); return; } n /= 6; if (n == 0) { ans.push_back(-1); ...

#include <bits/stdc++.h> using namespace std; int main() { int n, k, nums[2201], ans = 0; cin >> n >> k; for (int i = 0; i < n; i++) { cin >> nums[i]; } sort(nums, nums + n); for (int i = 0; i < k; i++) { ans += nums[i]; } cout << ans; return 0; }

#include <bits/stdc++.h> using namespace std; const long long linf = 1e18 + 9; const int inf = 1e9 + 9; const long long mod = 1e9 + 7; const int N = 4e5 + 9; int n, u, v, ans[N], sub[N], mx[N], centroid; vector<int> gr[N], c[N]; int dfs(int v, int f) { sub[v] = 1; for (int i = 0; i < gr[v].size(...

#include <bits/stdc++.h> using namespace std; int gcd(int x, int y) { return (y == 0 ? x : gcd(y, x % y)); } const int N = (int)1e6 + 100; int a[30]; int n; int m = 0; char s[N]; int main() { scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d , &a[i]); for (int i = 0; i < n; i++) m += a[...

#include <bits/stdc++.h> using namespace std; const int maxn = 2e5; int d[maxn]; int w[maxn]; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; string s; cin >> s; for (int i = 0; i < n; ++i) { cin >> d[i]; } int cur = 0; while (cur >= 0...

#include <bits/stdc++.h> using namespace std; const int max_n = 22, max_q = 11111, mod = 1000000007; struct matrix { vector<vector<int> > v; matrix() {} matrix(int n, int m) { v.resize(n, vector<int>(m, 0)); } matrix operator*(const matrix &m) const { matrix res(v.size(), m.v[0].size()); ...

#include <bits/stdc++.h> using namespace std; void solve() { int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } string ans = NO ; for (int i = 0; i < n - 1; i++) { if (a[i] <= a[i + 1]) ans = YES ; } cout << ans << n ; } int main() { i...

#include <bits/stdc++.h> using namespace std; int N, S, L, A[100009]; int c[100009], dp[100009]; deque<pair<int, int>> s, t, u; int main() { scanf( %d%d%d , &N, &S, &L); for (int i = 1; i <= N; i++) dp[i] = 1e6; for (int i = 1, ptr = 1; i <= N; i++) { scanf( %d , &A[i]); while (s.size(...

#include <bits/stdc++.h> using namespace std; void dfs(long long v, vector<long long> adj[], vector<bool>& visited) { cout << char(v + a ); visited[v] = true; for (long long u : adj[v]) { if (!visited[u]) dfs(u, adj, visited); } } signed main() { ios_base::sync_with_stdio(false); ...

#include <bits/stdc++.h> using namespace std; vector<int> set1; vector<int> set2; int col[100004], vis[100004]; int flag = 1; class Graph { int V; list<int> *adj; public: Graph(int V); void addEdge(int v, int w); void BFS(int s); }; Graph::Graph(int V) { this->V = V; ad...

#include <bits/stdc++.h> using namespace std; const int NMax = 100005; const int sqrNMax = 330; int N; int Nb[NMax][sqrNMax + 5]; int A[NMax], B[sqrNMax + 5][2 * sqrNMax + 5], Start[sqrNMax + 5], Block[NMax], totalB, Size[sqrNMax + 5]; void Read() { scanf( %d , &N); for (int i = 1; i <= N; i...

#include <bits/stdc++.h> using namespace std; const int MAXN = 1005; const int MOD = 1000000007; int N, P; int dp[MAXN][4]; int a[MAXN], b[MAXN]; int cnt[3]; void load() { scanf( %d%d , &N, &P); } inline int add(int x, int y) { x += y; if (x >= MOD) x -= MOD; else if (x < 0) x ...

#include <bits/stdc++.h> using namespace std; int a[100005], l[100005], r[100005]; int main() { int n, m, i, j, x, y, pos; cin >> n >> m; for (i = 1; i <= n; i++) scanf( %d , &a[i]); l[1] = r[1] = 0; for (i = 2; i <= n; i++) { l[i] = l[i - 1]; if (a[i - 1] > a[i]) l[i]++; r[i...

#include <bits/stdc++.h> using namespace std; struct ter { int cx, cy, dir, pt, rem; ter(){}; ter(int _cx, int _cy, int _dir, int _pt, int _rem) : cx(_cx), cy(_cy), dir(_dir), pt(_pt), rem(_rem){}; }; const int dx[] = {0, 1, 1, 1, 0, -1, -1, -1}; const int dy[] = {1, 1, 0, -1, -1, -1, 0, 1...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; map<int, int> a; for (int i = 0; i < n; i++) { int temp; cin >> temp; a[temp]++; } map<int, int> b; for (int i = 0; i < n - 1; i++) { int temp; cin >> temp; b[temp]++; } ...

#include <bits/stdc++.h> int main() { int n; scanf( %d , &n); int people_in_queue[n]; for (int i = 0; i < n; i++) { scanf( %d , &people_in_queue[i]); } int num_of_product[n][100], sum[n]; for (int i = 0; i < n; i++) { sum[i] = 0; for (int j = 0; j < people_in_queue[i]; j...

#include <bits/stdc++.h> using namespace std; void err(istream_iterator<string> it) {} template <typename T, typename... Args> void err(istream_iterator<string> it, T a, Args... args) { cerr << *it << = << a << endl; err(++it, args...); } template <typename T> void printV(const T &t) { std...

#include <bits/stdc++.h> using namespace std; const int ms = 100010; vector<int> g[ms]; int in[ms], out[ms]; int main() { int n, m; int a, b; cin >> n >> m; for (int i = 0; i < m; ++i) { scanf( %d%d , &a, &b); if (a > b) swap(a, b); in[a]++, out[b]++; g[a].push_back(b);...

#include <bits/stdc++.h> using namespace std; priority_queue<int, vector<int>, greater<int> > p; bool visited[100005]; vector<int> G[100005]; int n, m; void prime() { p.push(1); while (!p.empty()) { int v = p.top(); p.pop(); if (visited[v]) continue; visited[v] = true; ...

#include <bits/stdc++.h> using namespace std; const int N = 2005, P = 998244353; using ll = long long; ll qpow(ll a, ll b) { ll ret = 1; while (b) { if (b & 1) ret = ret * a % P; a = a * a % P; b >>= 1; } return ret; } int n, a, b; ll pw[N * N], pw1[N * N]; ll dp[N][N],...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, f = 0, ans, m, a1[20], flag = 0, a2[20], b1[20], b2[20], num[20] = {0}, c = 0; cin >> n >> m; for (int i = 0; i < n; i++) cin >> a1[i] >> a2[i]; f...

#include <bits/stdc++.h> using namespace std; const int MAXN = 132674; const int MOD = 1e9 + 7; int main() { set<int> ar; set<int> to_buy; set<int> to_sell; long long multiplyier = 1; int n; scanf( %d , &n); for (int i = 0; i < n; i++) { int temp; string l; cin >> l...

#include <bits/stdc++.h> using namespace std; int a, b, n, k, y, x, i, j, h, ans, c, d[100005], f[10]; char s[105], s1[105]; int main() { scanf( %d%d%s , &n, &k, s); for (i = 1; i <= k; i++) { int f[1000] = {0}; scanf( %d %d , &a, &b); x = 0; int DP = 1, CP = 0, lens1 = 0; ...

#include <bits/stdc++.h> using namespace std; const int N = 2010, M = N * N; int n, m, dist[N][N], deg[N][N], fx[N][N], fy[N][N]; char str[N][N]; pair<int, int> p[M]; int hh, tt; bool st[N][N]; void topsort() { hh = 0; tt = -1; for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) ...

#include <bits/stdc++.h> using namespace std; const double PI = 3.1415926536; int n, m, spaces; bool a[100005], vis[505][505]; void walk(int x, int y, string s) { int counter = 1; for (int i = 0; i < s.size(); i++) { if (s[i] == U ) { if (x > 1) { x--; if (!vis[x][y]...

#include <bits/stdc++.h> using namespace std; const long long INF = (long long)1e12; const int maxn = 100050; struct STU { int b, c, id; bool operator<(const STU &s) const { return c < s.c || (c == s.c && id < s.id); } }; map<STU, int> mp; bool cmp(const STU &a, const STU &b) { return a....

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

#include <bits/stdc++.h> using namespace std; long long a, b, c, Minus, tmp, pos, lar_pos, ans; long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } long long lcm(long long a, long long b) { return a / gcd(a, b) * b; } long long f(long long a, long long b) { if...

#include <bits/stdc++.h> using namespace std; int N, M, K; vector<pair<int, char> > r, rr; int main() { scanf( %d %d %d , &N, &M, &K); if (4 * N * M - 2 * N - 2 * M < K) return !printf( NO ); printf( YES n ); int c; char d; c = M - 1; d = R ; r.push_back({min(c, K), d}); K -...

#include <bits/stdc++.h> using namespace std; const int maxn = 1000020; const int maxx = 1000000; const int MOd = 1e9 + 7; const int K = 1000; const int P = 143; int loc[maxn]; class Aho_Corasick { public: int last, next[maxn][26]; short used[maxn][26], step; int deg[maxn], dad[maxn]; ...

#include <bits/stdc++.h> int main(int argc, char const *argv[]) { int h1, a1, c1, h2, a2; std::cin >> h1 >> a1 >> c1; std::cin >> h2 >> a2; std::string s = STRIKE n , h = HEAL n ; int n(0); std::string ans; while (h2 > 0) { n++; if (h1 <= a2 && h2 > a1) { h1 += c1; ...

#include <bits/stdc++.h> using namespace std; int t[123]; int main() { ios::sync_with_stdio(0); cin.tie(0); int a, n; cin >> n >> a; --a; for (int i = 0; i < n; ++i) cin >> t[i]; int l, r; l = r = a; int res = 0; while (l >= 0 || r < n) { if (l >= 0 && r < n) { ...

#include <bits/stdc++.h> using namespace std; int lsone(int n) { return (n & -n); } void mult(long long int a[25][25], long long int b[25][25], long long int c[25][25], int m, int n, int p) { for (int i = 1; i <= m; i++) { for (int j = 1; j <= p; j++) { c[i][j] = 0; for (int ...

#include <bits/stdc++.h> using namespace std; const int N = 2005; char mp[N][N]; int deg[N][N]; int cnt[2], n, m; int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0}; string str = ><v^ , tmp = <>^v ; bool check(int x, int y) { return x >= 1 && x <= n && y >= 1 && y <= m; } int main() { ios ::sync_wit...

#include <bits/stdc++.h> using namespace std; void flash() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } void solve() { long long n; cin >> n; vector<long long> v(n); long long sm = 0; long long mx = 0; for (long long i = 0; i < n; i++) { cin >> v...

#include <bits/stdc++.h> using namespace std; bool SR(int &_x) { return scanf( %d , &_x) == 1; } bool SR(long long &_x) { return scanf( %lld , &_x) == 1; } bool SR(double &_x) { return scanf( %lf , &_x) == 1; } bool SR(char *_s) { return scanf( %s , _s) == 1; } bool RI() { return true; } template <typenam...

#include <bits/stdc++.h> using namespace std; using ll = long long; int n, a[100005], sta[100005]; vector<int> V; int calc(int k) { while (k) { int d = k % 10; k /= 10; if (d != 4 && d != 7) return 0; } return 1; } using pii = pair<int, int>; int tar[100005], to[100005]; ...

#include <bits/stdc++.h> using namespace std; struct node { int lb, rb, l_max, r_max, s_max; }; int n, m, l, r, k, offset = 1 << 19, a[300004], z, t; long long d[600004]; node trn[1100000]; int sgn(long long x) { if (x > 0) return 1; if (x < 0) return -1; return 0; } void update(int po...

#include <bits/stdc++.h> using namespace std; const int inf = 0x7fffffff; const double eps = 1e-10; const double pi = acos(-1.0); inline int read() { int x = 0, f = 1; char ch; ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch...

#include <bits/stdc++.h> const long long int mrx = 1e6 + 5, M = 1e9 + 7; long long int mx = INT_MIN, mn = INT_MAX; using namespace std; long long int x1, x2, s, t1, t2, p, d; long long int poezd, igor; int main() { ios_base::sync_with_stdio(NULL); cin.tie(NULL); cin >> s >> x1 >> x2; cin >> ...

#include <bits/stdc++.h> using namespace std; int n; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; int sl = 0; for (int i = 1; i <= n; ++i) { int x, y; cin >> x >> y; if (x > 0) ++sl; } if (sl == n || sl == 0 || sl == n - 1 || sl == 1) { cout ...

#include <bits/stdc++.h> using namespace std; template <class T> void printQueue(T& q) { while (!q.empty()) { cout << q.top() << endl; q.pop(); } } vector<int> adj[200009]; vector<pair<int, int> > levels; bool visited[200009]; bool cmp(pair<int, int> a, pair<int, int> b) { if (a....

#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; void compute() { long long n; cin >> n; n -= 2; string s[n]; cin >> s[0]; string ans = s[0]; for (long long i = 1; i < n; i++) { cin >> s[i]; if (s[i][0] == ans[ans.size() - 1]) ans.push_ba...

#include <bits/stdc++.h> using namespace std; vector<int> ans; int m; int main() { int n, ans = 0; string s; cin >> n; cin >> s; for (int i = 0; i < n; i++) if (s[i] == < ) ans++; else break; for (int i = n - 1; i >= 0; i--) if (s[i] == > ) ans...

#include <bits/stdc++.h> using namespace std; const long long mod = 1000 * 1000 * 1000 + 7LL; const double EXP = 1e-6; const int MAX = 100001; int main() { int n, k; while (cin >> n >> k) { int a[10001]; for (int i = 1; i <= n; i++) a[i] = 1; a[n] = 0; while (k--) { for...

#include <bits/stdc++.h> using namespace std; char s[100010], s1[100010], s2[100010], s3[100010], s11[100010]; int main() { scanf( %s , &s); int len; len = strlen(s); int sum = 0, a = 0; for (int i = 0; i < len; i++) { sum += s[i] - 0 ; if (s[i] == 0 ) a = 1; } if (sum % ...

#include <bits/stdc++.h> using namespace std; void sprint(string s) { for (int i = 0; i < s.size(); ++i) printf( %c , s[i]); printf( n ); } int main() { int n, k, d; cin >> n >> k >> d; int a[n]; int b[n]; for (int i = 0; i < n; ++i) { scanf( %d , &a[i]); b[i] = 0; }...

#include <bits/stdc++.h> using namespace std; struct myQueue { stack<pair<long long, long long> > s1, s2; int size() { return s1.size() + s2.size(); } bool isEmpty() { return size() == 0; } long long getMax() { if (isEmpty()) { return -2e9; } if (!s1.empty() && !s2.empty())...

#include <bits/stdc++.h> using namespace std; string s1, s2; int len1, len2; int dp[5002][5002]; int func(int p1, int p2) { if ((p1 == len1) || (p2 == len2)) { return 0; } if (dp[p1][p2] != -1) { return dp[p1][p2]; } int ans = 0; if (s1[p1] == s2[p2]) { ans = (1 + ans...

#include <bits/stdc++.h> using namespace std; using namespace std; int get_type(int a, int b, int c) { if (a == 0 && b == 0 && c != 0) return 0; if (a == 0 && b == 0 && c == 0) return -1; if (a == 0) return 1; if (b == 0) return 2; return 3; } int main() { int a1, b1, c1, a2, b2, c2; ...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; struct node { long long v[10]; int tag[10]; void init(int x) { int y = 1; memset(v, 0, sizeof(v)); while (x) { v[x % 10] += y; x /= 10; y *= 10; } } void updtag(int* _tag) { ...

#include<bits/stdc++.h> using namespace std; //#pragma GCC optimize( Ofast,unroll-loops,no-stack-protector ) //#pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) #define pb push_back #define fi first #define se second #define ll long long #define ld long double #def...

#include <bits/stdc++.h> using namespace std; vector<pair<int, pair<int, int> > > horz, vert, tmp; set<int> y_com; map<int, int> y_map; void cleanup(vector<pair<int, pair<int, int> > >& v) { sort(v.begin(), v.end()); for (auto it = v.begin(); it != v.end();) { if (it != v.begin()) { auto...

#include <bits/stdc++.h> using namespace std; const double eps = 1e-7; const int inf = 0x3f3f3f3f; const int hinf = 0x3f3f3f3f; const long long mod = 1000000009; struct node { int l, r; double expe; double add; } sgt[100010 << 2]; int n, m; int a[100010], h[100010], l[100010], r[100010]; ...

#include <bits/stdc++.h> using namespace std; const double eps = 1e-9; const long long int MOD1 = 1e9 + 7; const long long int MAX5 = 1e5; const long long int MAX6 = 1e6; const long long int MAX7 = 1e7; const long long int MAX8 = 1e8; const long long int MAX9 = 1e9; const long long int MAX10 = 1e10; ...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; pair<int, int> mmx[3]; for (int i = 0; i < 3; i++) cin >> mmx[i].first >> mmx[i].second; int a, b, c; a = min(n - mmx[1].first - mmx[2].first, mmx[0].second); b = min(n - a - mmx[2].first, mmx[1].second); c =...

#include<bits/stdc++.h> using namespace :: std; #define ll long long #define mp make_pair #define ld long double #define F first #define S second #define pii pair<int,int> #define pb push_back const int maxn=2e5+500; const int inf=1e9+900; const int mod=1e9+7; pair<int,int> tip,che; ...

#include <bits/stdc++.h> using namespace std; template <typename T> T read1() { T t = 0; char k; bool v = 0; do (k = getchar()) == - && (v = 1); while ( 0 > k || k > 9 ); while ( 0 <= k && k <= 9 ) t = (t << 3) + (t << 1) + (k ^ 0 ), k = getchar(); return v ? -t : t; } ...

#include <bits/stdc++.h> using namespace std; int main() { int c, d, n, m, k; cin >> c >> d >> n >> m >> k; int users = n * m - k; int ans = 1000000000; for (int i = 0; i <= m; i++) for (int j = 0; j <= 10000; j++) { if (i * n + j >= users) { if (c * i + j * d < ans) ans ...

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

#include <bits/stdc++.h> using namespace std; int main() { int i; int n, d, l; cin >> n >> d >> l; int pos = (n + 1) / 2; int neg = n / 2; int a[n + 1]; if (d > (pos * l - neg) || d < (pos - neg * l)) { cout << -1 ; return 0; } if (d > 0) { for (i = 1; i <= n; ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 10; int n, m; bool lie[40]; int ask(int d) { int ret; cout << d << endl; cin >> ret; if (ret == 0) exit(0); return ret; } int main() { cin >> m >> n; for (int i = 0; i < n; i++) if (ask(m) == 1) lie[i] =...

#include <bits/stdc++.h> using namespace std; vector<long long int> v1, v2; vector<char> v4; string s1, s2, s3; long long int visited[2000005]; set<char> st; set<long long int>::iterator it; int main() { long long int a, b, c, d, e, f, i, j, k, cnt1 = 0, cnt2 = 0, sum1 = 0, sum2 = 0, first, ...

#include <bits/stdc++.h> using namespace std; double dp[200 + 50][200 + 50][200 + 50]; double p[200 + 50]; double res; int a[200 + 50]; int n, l, x, kol; int main() { scanf( %d%d%d , &n, &l, &kol); for (int i = 1; i <= n; i++) { scanf( %d , &x); p[i] = (x + 0.0) / 100; } for (i...

#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > out; vector<pair<int, int> >::iterator iter; long long int a[3][200005]; int main() { long long int x[3], y[3], m[3]; int k[3], i, j, bad = 0, prev = 0, n, u = 1, v = 1; bool A, B; scanf( %d , &n); for (i = 1; i <= 2; i+...

#include <bits/stdc++.h> using namespace std; int d[1000000]; int main() { int n, k; scanf( %d%d , &n, &k); for (int i = 0; i < (n); ++i) { int(x); scanf( %d , &x); d[i % k] += x; } int mi = (int)1e9; int id = -1; for (int i = 0; i < (k); ++i) { if (mi > d[i]) {...

#include <bits/stdc++.h> using namespace std; const int dy[] = {-1, 0, 1, 0}, dx[] = {0, 1, 0, -1}; const double EPS = 1e-8; const double PI = acos(-1.0); int popcount(int n) { return __builtin_popcount(n); } int popcount(long long n) { return __builtin_popcountll(n); } template <class T> int SIZE(T a) ...

#include <bits/stdc++.h> using namespace std; int dirty[3009]; int main() { int n, m; cin >> n >> m; for (typeof(0) i = (0); i < (m); i++) cin >> dirty[i]; sort(dirty, dirty + m); if (!m) cout << YES n ; else if ((dirty[0] != 1) && (dirty[m - 1] != n)) { if (m < 3) cou...

#include <bits/stdc++.h> const double pi = acos(-1.0); using namespace std; inline long long MAX2(long long a, long long b) { return (a) > (b) ? (a) : (b); } inline long long MAX3(long long a, long long b, long long c) { return (a) > (b) ? ((a) > (c) ? (a) : (c)) : ((b) > (c) ? (b) : (c)); } inlin...

#include <bits/stdc++.h> using namespace std; unsigned long long B[31][31], res = 0; int main(void) { for (int i = 0; i <= 30; i++) { B[i][0] = B[i][i] = 1; for (int j = 1; j < i; j++) B[i][j] = B[i - 1][j - 1] + B[i - 1][j]; } int n, m, k; cin >> n >> m >> k; for (int b = 4; b < k...

#include <bits/stdc++.h> using namespace std; const int MAXN = 1000005; const int SQRTN = 1003; const int LOGN = 22; const double PI = acos(-1); const int INF = 1e9; int MOD = 1000000007; const int FMOD = 998244353; const double eps = 1e-9; long long gcd(long long a, long long b) { if (a == 0) r...

#include <bits/stdc++.h> using namespace std; const int NMax = 1100000; inline int read() { int x = 0; char ch = getchar(); bool positive = 1; for (; ch < 0 || ch > 9 ; ch = getchar()) if (ch == - ) positive = 0; for (; ch >= 0 && ch <= 9 ; ch = getchar()) x = x * 10 + ch - 0 ; ...

#include <bits/stdc++.h> using namespace std; int n, cnt[100015], x[100015], y[100015], z[100015]; vector<int> a[100015]; int getpos(int i, int u) { if (x[i] == u) return 0; if (y[i] == u) return 1; if (z[i] == u) return 2; } void dfs(int u, int v) { cout << u << ; if (cnt[v] == 0) { ...

#include <bits/stdc++.h> const int INF = 1e7; using namespace std; const int N = 20; int n, m; int c[N]; int a[N]; int like[N]; string s[N]; int T_res = 0; int Lika = 0; bool Check_Res() { int Lik; for (int i = 2; i <= m; i++) { { Lik = 0; for (int j = 0; j <= n - 1; ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); long long n; cin >> n; long long out = n * (n + 1) * (n + 2) / 6; out *= n * (n + 1) * (n + 2) * (n + 3) * (n + 4) / 120; cout << out << n ; return 0; }

#include <bits/stdc++.h> using namespace std; const int m = 320; struct data { int n, x, a[2 * m + 10]; data *next; }; data *head; int get(int value, int limit) { int ret = 0; data *k; for (k = head; k != NULL; k = k->next) { if (k->x > value) break; ret += k->n; } if...

#include <bits/stdc++.h> using namespace std; int dp[150][150]; int main() { int n; cin >> n; for (char a = a ; a <= z ; a++) for (char b = a ; b <= z ; b++) dp[a][b] = -2000000009; for (char c = a ; c <= z ; c++) dp[c][c] = 0; while (n--) { string s; cin >> s; ch...

#include <bits/stdc++.h> using namespace std; using ll = long long; ll modinv(ll a, ll m) { assert(m > 0); if (m == 1) return 0; a %= m; if (a < 0) a += m; assert(a != 0); if (a == 1) return 1; return m - modinv(m, a) * m / a; } template <int MOD_> struct modnum { private: ...

#include <bits/stdc++.h> using namespace std; const int maxn = 1000000 + 50; const int maxm = 1300000 + 100; const int maxt = 3000000 + 100; const int maxk = 10 + 3; const int M = 2010; const long long unit = 1LL; const int INF = 0x3f3f3f3f; const long long Inf = 0x3f3f3f3f3f3f3f3fLL; const double e...

#include <bits/stdc++.h> using namespace std; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n, m; cin >> n >> m; vector<vector<vector<long long>>> g(n); vector<vector<long long>> store(m); for (long long i = 0; i < m; i++) { long long a, b, c...

#include <bits/stdc++.h> using namespace std; int n, m; int main() { cin >> n; int cur = 1; while (n) { if (n == 3) { printf( %d %d %d , cur, cur, cur * n); return 0; } int cnt = n / 2 + n % 2; n -= cnt; while (cnt--) printf( %d , cur); cur *= 2; ...

#include <bits/stdc++.h> const int Max_N(1000005); int N, D; int first[Max_N], ecnt(1), Next[Max_N * 2], To[Max_N * 2]; int degree[Max_N]; std::tuple<int, int> dfs(const int v, const int p = 0) { if (To[first[v]] == p && Next[first[v]] == 0) return std::make_tuple(0, 0); int res(0), max(0), min(D + 1)...

#include <bits/stdc++.h> using namespace std; const long long mxn = 5e5 + 123; const long long inf = 1e9; const long long mod = 998244353; bool om[mxn]; vector<long long> v; long long n, mn = 1e18; ; int main() { int n, m; cin >> n >> m; for (int i = 1; i <= n; i++) if (n % i == 0) v...

#include <bits/stdc++.h> using namespace std; inline long long tmx(long long a, long long b, long long c) { return (a > b && a > c) ? a : ((b > c) ? b : c); } inline long long tmn(long long a, long long b, long long c) { return (a < b && a < c) ? a : ((b < c) ? b : c); } const int MXL = 0x3f3f3f3f; ...

#include <bits/stdc++.h> using namespace std; const int mod = 1000000007; long long f = 0, g = 1; int n; int main() { cin >> n; for (int i = 2; i <= n; i++) { long long k = f; f = 3 * g % mod; g = (k + 2 * g) % mod; } printf( %lld , f); return 0; }

#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3fll; void bad() { cout << NO << n ; exit(0); } const int MAX = 4e5 + 10; vector<int> g[MAX]; int main() { if (!false) ios_base::sync_with_stdio(0); cin.tie(0); int n,...

#include <bits/stdc++.h> using namespace std; const int inf = 1e8; struct node { int x, y, z, s; } pre[12][18][18][18]; int n, a, b, dp[12][18][18][18], h[12]; vector<int> ans; void f(int i, int x, int y, int z, int v, int xx, int yy, int zz, int s) { x = max(0, x); y = max(0, y); z = max(...

#include <bits/stdc++.h> using namespace std; int n, arr[2005], counts[2005]; char c = a ; int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> arr[i]; } for (int i = n - 1; i >= 0; i--) { counts[i] = arr[i]; if (arr[i] != 0) { for (int j = i - 1; j >= 0; j--) {...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; if (n & n - 1) puts( NO ); else puts( YES ); return 0; }

#include <bits/stdc++.h> using namespace std; int main() { ifstream fin( input.txt ); double a, b, c = 1.000000011, d; cin >> a >> b; d = a * pow(c, b); cout.precision(30); cout << d << endl; return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, c = 0; cin >> n; int r = n; int cnt = 0; while (r > 0) { int temp = r % 10; if (temp > 0) cnt++; r = r / 10; c++; } cout << cnt << en...

#include <bits/stdc++.h> using namespace std; char A[102]; int M[102][205][3][52]; int dp(int i, int x, int d, int n) { if (n < 0) return 0; if (!A[i] && n == 0) return abs(x - 102); if (!A[i]) return 0; int &r = M[i][x][d == 1][n]; if (r == -1) { if (A[i] == F ) { r = max(dp(...

#include <bits/stdc++.h> using namespace std; long long n, s, k; string u; long long r[60], dp[2501][60]; signed main() { cin >> n >> s >> k; for (long long i = 0; i < n; ++i) cin >> r[i]; cin >> u; for (long long i = 0; i < n; ++i) for (long long j = 0; j < n; ++j) dp[i][j] = -1e18; ...

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

#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 5; const int MOD = 1e9 + 7.5; char s[MAXN]; int f[MAXN], n; int main() { scanf( %s , s + 1); n = strlen(s + 1); int preb = 0; for (int i = 1; i <= n; ++i) { f[i] = f[i - 1]; if (s[i] == a ) { f[i] = (f[...

#include <bits/stdc++.h> using namespace std; namespace io { void _(int &k) { char c; int e = 1; k = 0; while ((c = getchar()) > 9 || c < 0 ) if (c == - ) e = -1; k = c - 0 ; while ((c = getchar()) <= 9 && c >= 0 ) { k *= 10; k += c - 0 ; } k *= e; } ...