func_code_string stringlengths 59 71.4k |
|---|
#include <bits/stdc++.h> using namespace std; int cnt[1000000 + 1]; const int mod = 1e9 + 7; vector<int> v; void solve() { int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); int mx = a[n - 1]; deque<int> dq; int i = n - 1; for (i = n - 1; i ... |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long INFF = 0x3f3f3f3f3f3f3f3fll; const long long M = 1e9 + 7; const long long maxn = 1e5 + 7; const double eps = 0.00000001; long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } template <typename ... |
#include <bits/stdc++.h> using namespace std; int n, m; int used[1100][1100]; vector<pair<int, int> > solve_l_r(int sx, int sy, int fx, int fy) { vector<pair<int, int> > ret; int len = abs(sx - fx) + 1; if ((fy - sy + 1) % 2 == 1) { int curx = sx, cury = sy; for (int i = 1; i <= fy - sy ... |
#include <bits/stdc++.h> using namespace std; const int INF = 1E9 + 7; template <class C> void mini(C& a4, C b4) { a4 = min(a4, b4); } template <class C> void maxi(C& a4, C b4) { a4 = max(a4, b4); } int n, k, a[57], dp[507][57][57], small, big, res; bool is; int dw[57][57]; int main() { ... |
#include <bits/stdc++.h> using namespace std; const long long N = 2e5 + 7; long long l[N], r[N]; long long a[N]; bool used[N]; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); long long n; cin >> n; string second; cin >> second; for (long long i = 0; i < n; ++i) cin >> a... |
#include <bits/stdc++.h> using namespace std; int main() { long long int n, t, c, i, x, suma, resultado; cin >> n >> t >> c; suma = 0; resultado = 0; for (i = 0; i < n; i++) { cin >> x; if (x > t) suma = 0; else suma++; if (suma >= c) resultado++; } ... |
#include <bits/stdc++.h> using namespace std; int main() { unsigned long long n, i, j, sum, k, temp; scanf( %llu , &n); unsigned long long a[n]; for (i = 0; i < n; i++) { scanf( %llu , &a[i]); } sum = 0; sort(a, a + n); k = n / 2; for (i = 0; i < k; i++) { temp = (a[i... |
#include <bits/stdc++.h> using namespace std; const int N = 100000, LOG = 20; vector<vector<int>> g(N), p(N, vector<int>(LOG)); vector<int> d(N), tin(N), tout(N); int f = 1; void dfs(int u, int pr, int depth) { p[u][0] = pr; tin[u] = f++; for (int i = 1; i < LOG; i++) { p[u][i] = p[p[u][i ... |
#include <bits/stdc++.h> using namespace std; vector<tuple<int, int, int, int> > ask; int mat[105][105]; int main() { int n, m, q, op, r, c, x, i, j; scanf( %d%d%d , &n, &m, &q); for (i = 0; i < q; i++) { scanf( %d , &op); if (op == 1 || op == 2) { scanf( %d , &x); ask.em... |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int arr[n]; for (int i = 1; i <= n; i++) cin >> arr[i]; int ans = 0, ct0 = 0, ct1; for (int i = 1; i <= n; i++) { if (arr[i] == 1) { ct1 = 0; for (int j = i; j <= n; j++) { if (arr[j] ... |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10; int n, ch, x, y; vector<int> path[maxn]; vector<int> ans; int main() { scanf( %d , &n); for (int i = 1; i < n; i++) { scanf( %d%d , &x, &y); path[x].push_back(y); path[y].push_back(x); } ch = 0; fo... |
#include <bits/stdc++.h> using namespace std; using ll = long long; int const N = 200 * 1000 + 16; int const M = 1000 * 1000 * 1000 + 7; int n; int a[320]; int f[616]; int ncr[616][616]; int dp[616][616]; struct dsu { int fa[500]; dsu(int n) { iota(fa, fa + n + 10, 0); } int find(int x) ... |
#include <bits/stdc++.h> using namespace std; const int N = 111; int a[N], b[N]; int main() { cin.tie(0)->sync_with_stdio(0); int t; cin >> t; while (t--) { queue<int> que; int n; cin >> n; string S; cin >> S; S = + S; for (int i = 1; i <= n; i++) { ... |
#include <bits/stdc++.h> using namespace std; long long solve(int n) { if (n < 5) return n * (n - 1) / 2; long long ans = 0; int x = 0; for (int i = 0; i <= 8; i++) { int xx = 5 * pow(10, i); if (n < xx) { if (n < 2 * xx / 10) { if (n != 2 * xx / 10 - 1) ret... |
#include <bits/stdc++.h> using namespace std; const int maxn = 180 + 10; const int oo = 1000000000; int opt[maxn][maxn * 2]; int c[maxn][maxn * 2], cc[maxn][maxn * 2]; int e[maxn][maxn]; int n, kk, d[maxn]; int father[maxn]; int res[maxn]; void dp(int u) { for (int v = 1; v <= n; v++) if (... |
#include <bits/stdc++.h> using namespace std; int f(int x, int p2, int p) { return 2 * sqrt(p2 * p) + x + 1; } int main() { printf( 302 n ); printf( 0 1000000 n ); int a = f(0, 1000000, 300); printf( %d 300 n , a); int kol = 2; for (int i = 299; i >= 1; --i) { printf( %d %d n , f(a, ... |
#include <bits/stdc++.h> using namespace std; namespace Debug { void __print(signed x) { cout << x; } void __print(long x) { cout << x; } void __print(long long x) { cout << x; } void __print(unsigned x) { cout << x; } void __print(unsigned long x) { cout << x; } void __print(unsigned long long x) { cou... |
#include <bits/stdc++.h> using namespace std; int arr[100005]; int main() { int n, j = 1; scanf( %d , &n); int ara[n]; for (int i = 0; i < n; i++) { scanf( %d , &ara[i]); if (arr[ara[i]] != 0 || ara[i] > n) ara[i] = -1; arr[ara[i]]++; } for (int i = 0; i < n; i++) { ... |
#include <bits/stdc++.h> using namespace std; struct node { bool lose, win; node *child[30]; node() { lose = true; win = false; for (int i = 0; i < 30; i++) child[i] = NULL; } void add(queue<char> q) { if (q.empty()) return; queue<char> p = q; char c = q.front... |
#include <bits/stdc++.h> using namespace std; template <class T> void smin(T& a, T val) { if (a > val) a = val; } template <class T> void smax(T& a, T val) { if (a < val) a = val; } template <typename T> inline std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) { bool firs... |
#include <bits/stdc++.h> using namespace std; int a[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; vector<int> parse(string s) { int i, dd, mm, yy; for (int i = 0; i < (int)(s.length()); i++) if (s[i] == . ) s[i] = ; istringstream ss(s); ss >> dd >> mm >> yy; vector<int> ans; ... |
#include <bits/stdc++.h> using namespace std; int main() { int n, s = 0, a[10000] = {0}; cin >> n; for (int i = 0; i < n; i++) { int t; cin >> t; a[t]++; } for (int i = 1; i < 10000; i++) { if (a[i] > 1) { a[i + 1] = a[i + 1] + a[i] - 1; s = s + a[i] - 1; ... |
#include <bits/stdc++.h> inline int getInt() { int s; scanf( %d , &s); return s; } using namespace std; struct Node { long long highest; int mxL; int mxR; int idxL; int idxR; Node(long long h, long long l, long long r, int il, int ir) : highest(h), mxL(l), mxR(r), idx... |
#include <bits/stdc++.h> using namespace std; int a[3222], b[32222]; long long dp[3333][3333]; int main() { int n; cin >> n; for (int i = 1; i <= n; i++) { int x; cin >> a[i]; a[i] -= i; b[i] = a[i]; } sort(b + 1, b + n + 1); for (int i = 1; i <= n; i++) { d... |
#include <bits/stdc++.h> using namespace std; int T, n, cnt; struct poi { double x, y, alp; poi() {} poi(double x, double y) : x(x), y(y) { alp = atan2(y, x); } friend bool operator<(const poi &r1, const poi &r2) { return r1.alp < r2.alp; } friend poi operator+(const poi &r1, const p... |
#include <bits/stdc++.h> using namespace std; template <class X> void temfunc(const X a) { for (auto it = a.begin(); it != a.end(); it++) cout << *it << ; cout << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); ; int t, l, r; cin >> t; while (t--) { ... |
#include <bits/stdc++.h> using namespace std; int main() { int n, k; string s; cin >> n >> k; cin >> s; int j = 0; for (int i = 0; i < n - 1; i++) { if (s.substr(0, i + 1) == s.substr(n - i - 1)) { j = i + 1; } } string a = s.substr(j); cout << s; for (int... |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int ns = 0; bool ok = true; for (int i = 0; i < n; i++) { int val; cin >> val; string type; cin >> type; if (type == South ) { if (ns + val > 20000) ok &= false; e... |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; const int mod = 1e9 + 7; int n, q; long long a[N], w[N], c[N << 1][2]; inline void add(int x, long long v, int id) { if (!id) for (; x <= n; x += x & -x) c[x][id] += v; else for (; x <= n; x += x & -x) c[x][id] = (c[x]... |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; int n, k, a[N]; int main() { scanf( %d%d , &n, &k); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); sort(a + 1, a + 1 + n); int p = n / 2 + 1, t = n / 2 + 1; for (int i = n / 2 + 2; i <= n; i++) if (1ll * (a[i] - a[i... |
#include <bits/stdc++.h> using namespace std; const int maxn = 5, maxm = 100010; int n, m, h[maxm][maxn], v[maxm][maxn]; long long f[maxm][1 << maxn]; int main() { scanf( %d%d , &n, &m); for (int i = 0; i < m - 1; i++) for (int j = 0; j < n; j++) scanf( %d , &h[i][j]); for (int i = 0; i < m;... |
#include <bits/stdc++.h> using namespace std; void dfs(int node, int par, int gp, int p, vector<int> adj[], vector<int> &src, vector<int> &dest, vector<int> &ans) { if (gp % 2 != 0) { src[node - 1] = !src[node - 1]; } if (src[node - 1] != dest[node - 1]) { ans.push_back(node); ... |
#include <bits/stdc++.h> using namespace std; const int MAXN = 200010; int n, m; int a[105][105]; int ans, row[105], col[105]; void caluRow() { for (int i = 1; i <= n; i++) { int mi = 501; for (int j = 1; j <= m; j++) mi = min(mi, a[i][j]); if (mi > 0) { ans += mi; row[... |
#include <bits/stdc++.h> using namespace std; long long a[4 * 100005]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) scanf( %lld , &a[i]); sort(a, a + n); int i = 0, j = n - 1; long long ans = 0; while (i < j) { ans += (a[i] + a[j]) * (a[i] + a[j]); i++; j... |
#include <bits/stdc++.h> using namespace std; vector<int> g[5005]; int h[5005][5005], siz[5005]; int f[5005][5005], fa; int n, m, a[5005], b[5005], k; inline int min(const int x, const int y) { return x > y ? y : x; } void dfs(int x) { int to; siz[x] = 1; h[x][1] = b[x]; f[x][0] = 0, f[x][... |
#include <bits/stdc++.h> using namespace std; struct Result { int u, v, w, z; }; int N, M; vector<vector<int>> edges, distances; vector<vector<pair<int, int>>> D, R; vector<int> enqueued; int best = -1; Result result; int scan() { auto c = getchar(); while (c < 0 || c > 9 ) c = getcha... |
#include <bits/stdc++.h> using namespace std; const int N = 200005; int n, T, a, b; int diff[N]; pair<int, int> prob[N]; void solve() { scanf( %d %d %d %d , &n, &T, &a, &b); int allA = 0, allB = 0; for (int i = 0; i < n; ++i) { scanf( %d , &diff[i]); if (diff[i]) ++allB; ... |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:102400000,102400000 ) using namespace std; vector<int> G[20000]; int fa[20000], c[20000], ans = 0; void dfs(int x, int f, int col, int ori) { if (col != ori) ans++; for (int i = 0; i < G[x].size(); i++) { int u = G[x][i]; if (u == f)... |
#include <bits/stdc++.h> using namespace std; string s; map<int, int> dp; int k; int n; int dp1[1001][1001][2]; int go(int t) { if (t == 1) return 0; int cnt = 0; while (t) { cnt += (t % 2); t /= 2; } return go(cnt) + 1; } int solve(int i, int pre, int q) { if (i >=... |
#include <bits/stdc++.h> using namespace std; long long n, a[1000005]; std::vector<pair<double, pair<long long, long long> > > v; signed main() { scanf( %lld , &n); for (long long i = 1; i <= n; i++) { scanf( %lld , &a[i]); } for (long long i = 1; i <= n; i++) { v.push_back(make_pair... |
#include <bits/stdc++.h> using namespace std; map<char, int> mp; char t[27]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long n, mx = 0, ans = 0, f, f1; string ch; cin >> n; for (int i = 0; i < n; i++) { cin >> ch; t[ch[0] - a ]++; } ... |
#include <bits/stdc++.h> using namespace std; const int N = 3000 + 5; struct node { int val, id; } a[N]; int n; int dp[N * N], tree[N], ranks[N]; inline int lowbit(int x) { return x & -x; } inline int query(int x) { int sum = 0; while (x != 0) { sum += tree[x]; x -= lowbit(x); ... |
#include <bits/stdc++.h> using namespace std; int main() { long long int n, a, b, k1, k2, m1 = 0, m2 = 0; string s; cin >> n >> a >> b >> s; a--; b--; cout << abs(s[a] - s[b]); return 0; } |
#include <bits/stdc++.h> using namespace std; int N, M; vector<vector<char>> v; bool Mastervis[50][50]; bool vis[50][50]; int dx[] = {0, 0, 1, -1}; int dy[] = {1, -1, 0, 0}; bool isCyc(int r, int c, int pr, int pc) { if (vis[r][c]) return true; vis[r][c] = true; Mastervis[r][c] = true; i... |
#include <bits/stdc++.h> using namespace std; int main() { long long t; cin >> t; while (t--) { long long N; cin >> N; vector<long long> a(N); for (auto &x : a) cin >> x; ; long long l = -1; for (int i = 0; i < N - 1; i++) { if (abs(a[i + 1] - a[i]) >= 2... |
#include <bits/stdc++.h> using namespace std; const int maxn = 1 << 21; int n, m; char s[maxn]; char cmd[maxn]; struct lucky { int c4, c7, c47, c74; lucky() { c4 = 0, c7 = 0, c47 = 0, c74 = 0; } void merge(lucky a, lucky b) { c4 = a.c4 + b.c4; c7 = a.c7 + b.c7; c47 = max(a.c47 ... |
#include <bits/stdc++.h> using namespace std; int n; char a[5005][5005]; bool vst[5005]; bool dfs(int s, int k) { if (vst[k]) return false; vst[k] = true; for (int i = 0; i < n; ++i) { if (a[k][i] == 1 ) { if (a[i][s] == 1 ) return printf( %d %d %d n , s + 1, k + 1, i + 1... |
#include <bits/stdc++.h> using namespace std; const int mod = 1000000007; const int maxn = 100010; const int INF = ~0U >> 1; const double eps = 1e-9; void getint(int &ret) { char ch; while (ch = getchar(), ch < 0 || ch > 9 ) ; ret = ch - 0 ; while (ch = getchar(), ch >= 0 && ch <... |
#include <bits/stdc++.h> using namespace std; long long bin(long long x, long long n) { long long res = 1; x %= 1000000007; while (n) { if (n & 1) res = (res * x) % 1000000007; x = (x * x) % 1000000007; n >>= 1; } return res; } const long long MXN = 2e5 + 1; vector<long l... |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a; vector<int> v; for (int i = 0; i < n; ++i) { cin >> a; v.emplace_back(a); } int S = 0; int D = 0; int i = v.begin() - v.begin(); int j = v.end() - v.begin() - 1; int chance = 0;... |
#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { int T; cin >> T; while (T--) { int n; cin >> n; cout << n / 2 << n ; } } |
#include <bits/stdc++.h> using namespace std; const long long MOD = 1000000007; const long long INF = 1000000000; template <class T> inline void read(T &x) { char c; int flag = 1; while ((c = getchar()) < 0 || c > 9 ) if (c == - ) flag *= -1; x = c - 0 ; while ((c = getchar()) >... |
#include <bits/stdc++.h> int main() { int x, y, a, b, cnt = 0; scanf( %d%d%d%d , &x, &y, &a, &b); for (int i = a; i <= x; i++) for (int j = b; j <= y && j < i; j++) cnt++; printf( %d n , cnt); for (int i = a; i <= x; i++) for (int j = b; j <= y && j < i; j++) printf( %d %d n , i, j); ... |
#include <bits/stdc++.h> using namespace std; template <class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } template <class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); const long double... |
#include <bits/stdc++.h> using namespace std; int const maxn = 1001; int n, m, cnt, H[maxn], father[maxn], d[maxn], Dep[maxn], dist[maxn], dist2[maxn], middle_point[maxn], length[maxn]; int max_dep, max_dist; struct Edge { int next, to; } E[maxn << 1]; inline void add(int a, int b) { E[++cnt... |
#include <bits/stdc++.h> using namespace std; long long intersect(long long l1, long long r1, long long l2, long long r2) { long long l = max(l1, l2); long long r = min(r1, r2); return max(r - l, 0LL); } int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); } int main() { long long n, m; ... |
#include <bits/stdc++.h> using namespace std; int main() { pair<int, int> k[3]; char cell[9][9]; int n; cin >> n; char c; int z = 0; while (n) { for (int i = 1; i < 9; i++) { for (int j = 1; j < 9; j++) { cin >> c; if (c == K ) { k[z].first ... |
#include <bits/stdc++.h> using namespace std; int n, i, j, m, k, l, h, g, ye, a, b, rez; int p[300005], f[300005], ct[300005]; int v[300005], nv; bool comp(int x, int y) { return f[x] < f[y]; } int main() { cin >> n >> m; for (i = 1; i <= n; i++) cin >> p[i], f[p[i]] = i; ye = p[n]; for (i =... |
#include <bits/stdc++.h> using namespace std; long long arr[200000 + 10] = {0}; long long dp[200000 + 10] = {0}; int main() { int t; cin >> t; while (t--) { long long n, k, p; cin >> n >> p >> k; for (int i = 1; i <= n; i++) { cin >> arr[i]; } sort(arr + 1, arr ... |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); int q; cin >> q; string s; int n, k; string r = , g = , b = ; vector<string> v; for (int i = 0; i < 1500; i++) { r += RGB ; b += BRG ; g += GBR ; } for (int m = ... |
#include <bits/stdc++.h> #pragma GCC optimize(2) using namespace std; const int INF = 1e9 + 7; const int mod = 1e9 + 9; const int maxn = 3e5 + 7; const int lim = 800667; int tmp; void dfs(int a, int b) { if (b == 0) { tmp = INF; return; } else if (b == 1) { tmp += a - 1; ... |
#include <bits/stdc++.h> using namespace std; const int maxn = 5e5 + 7; const int INF = 1e9 + 7; const int MOD = 1e9 + 7; struct as { int id, x; } a[maxn]; int vis[maxn]; bool cmp(as a, as b) { return a.x < b.x; } vector<int> g[maxn]; vector<int> ans; set<int> tmp; bool check(as a) { int... |
#include <bits/stdc++.h> using namespace std; const int maxn = 5010; char s[maxn]; int dp[maxn][maxn]; int lnk[maxn][26]; int n; const int mod = (int)1e9 + 7; int go(int pos, int x) { if (dp[pos][x] != -1) { return dp[pos][x]; } if (pos == n) { return dp[pos][x] = 1; } dp... |
#include <bits/stdc++.h> using namespace std; const int N = 200035; long long a[N]; long long b[N]; long long c[N]; const long long INF = 1e17; bool can[N]; int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); int n, k; cin >> n >> k; ++n; for (int i = 0; i < n; ++i) c... |
#include <bits/stdc++.h> using namespace std; int n, a, b, k, cnt = 0, ans; string s; vector<int> arr; int main(void) { ios ::sync_with_stdio(0); cin.tie(0); cin >> n >> a >> b >> k >> s; for (int i = 1; i <= n; ++i) { if (s[i - 1] == 0 ) { ++cnt; } else { cnt = 0;... |
#include <bits/stdc++.h> using namespace std; long long Ins, Del, Rep, Exc; string A; string B; int lenA, lenB; long long DP[4001][4001]; int posA[4001][26]; int posB[4001][26]; int main() { ios::sync_with_stdio(false); while (cin >> Ins >> Del >> Rep >> Exc) { cin >> A >> B; A = ... |
#include <bits/stdc++.h> using namespace std; const long long int inf = 1e9 + 7; const long long int mod = 1e9 + 9; long long int mini(long long int a, long long int b) { if (a >= b) return b; return a; } long long int maxi(long long int a, long long int b) { if (a >= b) return a; return b; ... |
#include <bits/stdc++.h> using namespace std; int n, m; int s, t; struct Edge { int from, to, next; int cap, flow; void get(int u, int a, int b, int c, int d) { from = u; to = a; next = b; cap = c; flow = d; } } edge[100050 << 4]; int tol; int head[100050]; ... |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e3; int N, p[MAXN + 1]; set<int> adj[MAXN + 1]; void dfs(int v, int padre) { p[v] = padre; for (auto x : adj[v]) { if (x == padre || p[x]) continue; p[x] = padre; dfs(x, v); } adj[v].clear(); } int main() { ... |
#include <bits/stdc++.h> using namespace std; int euclid(int m, int n) { int amari; if ((amari = m % n) == 0) { return n; } else { return euclid(n, amari); } } int main() { int N; int A[101]; cin >> N; for (int i = 1; i <= N; i++) { cin >> A[i]; } vector... |
#include <bits/stdc++.h> using namespace std; namespace Fread { const int MAXN = 1 << 20; char buffer[MAXN], *S, *T; inline char getchar() { if (S == T) { T = (S = buffer) + fread(buffer, 1, MAXN, stdin); if (S == T) return EOF; } return *S++; } } // namespace Fread inline int r... |
#include <bits/stdc++.h> const int N = 100010; const int inf = 0x3f3f3f3f; using namespace std; int a[N], b[N], c[N], d[N]; int main() { int n, m, k; scanf( %d%d%d , &n, &m, &k); for (int i = 0; i < m; i++) scanf( %d%d%d , a + i, b + i, c + i); long long ret = 0; for (int i = 0; i < k; i++... |
#include <bits/stdc++.h> using namespace std; const int N = 5e5 + 5; int su[N], lst[N], n, i, a, lim; long long ans; pair<int, int> b[N]; int xb; inline int calc(int k) { int i, j; long long s = 0, ans = -1, x, y, z; xb = 0; for (i = 0; i * k < N; ++i) { s += 1ll * i * (su[min(N - 1,... |
#include <bits/stdc++.h> using namespace std; vector<int> s[200050 * 4]; pair<int, int> li[200050]; int n, m, st, qu[200050][3], fa[200050], sg[200050]; inline int Read() { int x = 0; char y; bool z = 0; do y = getchar(), z |= y == - ; while (y < 0 || y > 9 ); do x = x * 10 + y - ... |
#include <bits/stdc++.h> using namespace std; int tu(int val) { return (1 << val); } bool iset(int mask, int id) { if ((mask & tu(id)) != 0) return true; return false; } void doset(int &mask, int id) { mask |= tu(id); } void dounset(int &mask, int id) { mask = mask & (~tu(id)); } template <typenam... |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n, k; cin >> n >> k; set<pair<int, int>> s; map<int, int> m; int temp; for (int i = 0; i < n; i++) { cin >> temp; if (s.size() < k && (!m.count(temp))) { s... |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int a, b; cin >> a >> b; a--; string l = to_string(a); string r = to_string(b); long long int ans1; if (l.length() == 1) { ans1 = a; ... |
#include <bits/stdc++.h> using namespace std; const int maxn = 200001; const int mod = 998244353; int n, m; int sum[maxn << 2]; int y[maxn], x; int vis[maxn]; int fac[maxn << 1], rfac[maxn << 1]; int mul(int a, int b) { return 1LL * a * b % mod; } int qpow(int a, int q) { int res = 1; while ... |
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 5; const int M = 1e9 + 7; long long a[N]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long d; cin >> a[0] >> a[1] >> a[2] >> d; sort(a, a + 3); cout << max(0ll, a[0] - a[1] + d)... |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { long long n, k; cin >> n >> k; if (k == n) { cout << Alice n ; continue; } if (k > n || k % 3 != 0) { if (n % 3 == 0) { cout << Bob n ; } el... |
#include <bits/stdc++.h> using namespace std; long long i, j, k, m, n, p, s, t, x, a[100005]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); for (cin >> t; t--;) { cin >> n >> x; for (i = p = 0; i < n; i++) { cin >> a[i]; if (a[i] == x) p = 1; ... |
#include <bits/stdc++.h> int dr[] = {2, 2, -2, -2, 1, -1, 1, -1}; int dc[] = {1, -1, 1, -1, 2, 2, -2, -2}; int dr1[] = {0, 0, 1, 1, 1, -1, -1, -1}; int dc1[] = {1, -1, 1, 0, -1, 0, 1, -1}; int dr2[] = {0, 0, 1, -1}; int dc2[] = {1, -1, 0, 0}; using namespace std; vector<int> adj[1000005]; int a[100000... |
#include <bits/stdc++.h> using namespace std; const long long INF = 2000000000LL; int main() { int m1, m2, m3, m4, m5; int w1, w2, w3, w4, w5; int hs, hu; int sum; cin >> m1 >> m2 >> m3 >> m4 >> m5; cin >> w1 >> w2 >> w3 >> w4 >> w5; cin >> hs >> hu; sum = max(150, 500 - 2 * m1 - 5... |
/* @uthor: Amit Kumar user -->GitHub: drviruses ; CodeChef: dr_virus_ ; Codeforces: dr_virus_ ;AtCoder,Hackerearth,Hakerrank: dr_virus; */ #include <bits/stdc++.h> #include <chrono> using namespace std; using namespace std::chrono; //#include <boost/multiprecision/cpp_int.hpp> //namespace mp =... |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); vector<int> a(5); string s; long long q = 0; for (int i = 1; i < 5; ++i) { cin >> a[i]; } cin >> s; for (int i = 0; i < (int)s.size(); ++i) { q += a[s[i] - 0 ]; } cout << q; ... |
#include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 7; const int maxn = 2e6 + 5; int n, m, k; int last[30], dp[maxn]; char s[maxn]; int main() { scanf( %d%d%s , &n, &k, s + 1); m = strlen(s + 1); n += m; memset(last, -1, sizeof(last)); dp[0] = 1; for (int i = (1); i... |
#include <bits/stdc++.h> using std::cin; using std::cout; using std::deque; using std::endl; using std::map; using std::max; using std::min; using std::pair; using std::queue; using std::sort; using std::string; using std::vector; int main() { char last = b ; char x = b ; while (... |
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; queue<int> q; set<int> vals; for (int i = 0; i < n; ++i) { int id; cin >> id; if (!vals.count(id)) { if (int(q.size()) >= k) { int cur = q.front(); q.pop(); ... |
#include <bits/stdc++.h> using namespace std; int n, l[605], r[605]; string str, tmp; stack<string> S; int main() { cin >> n; for (int i = 0; i < n; i++) cin >> l[i] >> r[i]; for (int i = n - 1; i >= 0; i--) { if (l[i] == 1) { S.push( () ); continue; } else { in... |
#include <bits/stdc++.h> using namespace std; int a[100005], b[100005]; int n; int main() { scanf( %d n , &n); for (int i = 0; i < n; i++) { scanf( %d , &a[i]); } b[0] = -1000000; for (int i = 1; i <= n; i++) { b[i] = 1000000; } for (int i = 0; i < n; i++) { int j =... |
#include <bits/stdc++.h> using namespace std; struct node { int t, n; } a[200005]; int cmp(const void* a, const void* b) { node* aa = (node*)a; node* bb = (node*)b; if (aa->n > bb->n) { return 1; } else if (aa->n == bb->n) { return bb->t - aa->t; } else { return -1; ... |
#include <bits/stdc++.h> using namespace std; struct tree { int l, r, c, p; }; int n, K, m, r; long long res, a[10000011], b[10000011]; bool cmp1(tree a, tree b) { return a.l < b.l; } bool cmp2(tree a, tree b) { return a.r < b.r; } void update(int x, int l, int r, int c, int p) { if (l == r) { ... |
#include <bits/stdc++.h> using namespace std; int main(int argc, char* argv[]) { ios_base::sync_with_stdio(false); cin.tie(NULL); int k; string str; cin >> str; cin >> k; int temp[50]; memset(temp, 0, sizeof(temp)); int count = 0; for (int i = 0; i < str.size(); ++i) { ... |
#include <bits/stdc++.h> using namespace std; long long inf = 2e18; long long mod = 1e6; const long long M = 1e5; string s; long long a[M]; long long bmm(long long a, long long b) { if (b == 0) return a; return bmm(b, a % b); } int main() { long long n; cin >> n; string s = ; ... |
#include <bits/stdc++.h> using namespace std; int main(int argc, const char *argv[]) { int n, m; scanf( %d %d , &n, &m); int a[n], b[n]; map<int, int> mp_a; map<int, int> mp_b; for (int i = 0; i < n; i++) scanf( %d , &a[i]); for (int i = 0; i < n; i++) { scanf( %d , &b[i]); m... |
#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > vc, va, vb; int a[3], b[3], c[3]; long long n, m, s, p[50], pp[1 << 20]; void fac(int k, vector<pair<int, int> > &v) { int m = sqrt(k); for (int i = 2; i <= m; i++) if (k % i == 0) { int cnt = 0; while (k % i =... |
#include <bits/stdc++.h> using namespace std; long long ans[1000005], anss[1000005][10]; int make(int n) { long long g = 1; if (n % 10 != 0) g = g * (n % 10); n = n / 10; while (n > 0) { if (n % 10 != 0) g = g * (n % 10); n = n / 10; } return g; } long long bit[1000005][11]... |
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c = 0, sum = 0, cn = 0, mx = 0; char s[101]; scanf( %s , s); for (b = 0; b <= strlen(s); b++) { cn++; if (s[b] == A || s[b] == E || s[b] == I || s[b] == O || s[b] == U || s[b] == Y ) { mx = ... |
#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007; long long powmod(long long a, long long b) { long long res = 1; a %= mod; assert(b >= 0); for (; b; b >>= 1) { if (b & 1) res = res * a % mod; a = a * a % mod; } return res; } int n, k, m, x, a,... |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 100; const double pi = acos(-1); inline long long read() { long long x = 0, f = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) f = -1; ch = getchar(); } while (isdigit(ch)) { x = x * 10 + ch... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.