func_code_string stringlengths 59 71.4k |
|---|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { int n, j, temp, cnt = 0; cin >> n; string s; cin >> s; for (int i = 0; i < n; i++) { temp = 0; for (int j = 0; ... |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, m, k; cin >> n >> m >> k; vector<vector<int> > g(n); vector<int> deg(n); for (int i = 0; i < m; i++) { int x, y; cin >> x >> y; --x; --y; ... |
#include <bits/stdc++.h> int main() { int i, n, *a, t, j, flag; long m; scanf( %d , &n); scanf( %ld , &m); a = (int*)calloc(n, sizeof(int)); for (i = 0; i < n; i++) scanf( %d , &a[i]); for (i = 0; i < n; i++) for (j = 0; j < n - i - 1; j++) if (a[j + 1] > a[j]) { t ... |
#include <bits/stdc++.h> using namespace std; const int i32INF = 1 << 30; const long long i64INF = 1LL << 60; const double mINF = 1e100; const double EPS = 1e-9; int nextint() { int a; scanf( %d , &a); return a; } int n; vector<int> v; int difs[23][23]; bool isGood[1 << 23]; bool sol... |
#include <bits/stdc++.h> using namespace std; int n, m, h, t, x, y; vector<int> s[100100]; int a[100100], b[100100]; bool bj[100100][2]; void out(int u, int v) { int su = s[u].size(), sv = s[v].size(); int same = 0, i = 0, j = 0; while (i < su && j < sv) { if (s[u][i] == s[v][j]) s... |
#include <bits/stdc++.h> using namespace std; vector<int> pr; vector<bool> used(1000001, false); vector<int> d(1000001, 0); void sieve() { for (long long i = 2; i <= 1000000; i++) { for (long long k = i * i; k <= 1000000; k += i) used[k] = true; } for (int i = 2; i <= 1000000; i++) if ... |
#include <bits/stdc++.h> using namespace std; const int maxn = 4e5 + 4; const int oo = 1e8 + 7; int n, a[maxn], cc, p; long long s[maxn]; int main() { cin >> n; a[1] = 1; a[2] = 2 * n; a[n + 1] = 2; a[n + 2] = 2 * n - 1; int cc = 3; for (int i = 3; i <= (n); ++i) { if (i % ... |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; int n, c[N], k = 1e5; char a[N], b[N]; void solve(int p, int coef) { if (a[p - 1] + coef < 0 || a[p - 1] + coef > 9 ) { solve(p - 1, -coef); } a[p - 1] += coef; a[p] += coef; printf( %d %d n , p - 1, coef); ... |
#include <bits/stdc++.h> using namespace std; void print_ans(int x1, int y1, int x2, int y2) { long long int ans; ans = (x1 - x2) * (y1 - y2); if (ans < 0) ans = -ans; cout << ans; return; } int main() { int n, x[4], y[4], i; cin >> n; if (n < 2) cout << -1 ; else { ... |
#include <bits/stdc++.h> using namespace std; bool vv[2000][2000]; int main() { int n; string s; cin >> s; long long left[2000], right[2000]; for (int i = 0; i < s.length(); i++) { vv[i][i] = true; } int sm = 1, cp = s.length() - 1; for (; sm < s.length(); sm++) { for (... |
#include <bits/stdc++.h> using namespace std; priority_queue<pair<long long, pair<long long, long long>>> pq; int main() { std::ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int T = 1; while (T--) { bool flag = true, cond = true; long long n, i, j, x, y, ind, k, m, mn = INT... |
#include <bits/stdc++.h> using namespace std; string s[50005]; bool cmp(const string &a, const string &b) { return a + b < b + a; } int main() { int n, i; cin >> n; for (i = 0; i < n; i++) cin >> s[i]; sort(s, s + n, cmp); string ans = accumulate(s, s + n, string()); cout << ans; ret... |
#include <bits/stdc++.h> using namespace std; const int Maxs = 300 * 1000 + 5, Maxn = 300 * 1000 + 5; int n, dp[Maxs]; string s, t; long long ans; vector<pair<int, string> > adj[Maxn]; void kmp() { dp[0] = -1; for (int i = 0; i < t.size(); i++) { int pt = i; while (dp[pt] != -1 && t[dp... |
#include <bits/stdc++.h> using namespace std; int calc(long long n, long long k, long long a1, long long a2, long long a3) { long long sum; if (a2 < a3) { swap(a2, a3); } if (a1 < a2) { swap(a1, a2); } if (a2 < a3) { swap(a2, a3); } if (a1 < 0 || a2 < 0 || a3 < 0) {... |
#include <bits/stdc++.h> using namespace std; int n, q, f[1000010], mn, rt, ans; int cnt, head[1000010], to[2000010], nxt[2000010]; void add(int x, int y) { cnt++; to[cnt] = y; nxt[cnt] = head[x]; head[x] = cnt; } void dfs(int x, int fa, int now) { f[x] = now; for (int i = head[x]; i... |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); long long n, a, b; cin >> n >> a >> b; for (long long i = 0; i <= n; ++i) { if (a * i > n) { break; } long long cur = a * i; if (n - cur >= 0 && (n - cur) % b ... |
#include <bits/stdc++.h> using namespace std; int t; long long r, g, b, k = 0; long long a[4]; int main() { cin >> t; while (t--) { cin >> a[1] >> a[2] >> a[3]; sort(a + 1, a + 1 + 3); k = a[1] + a[2]; if (a[3] >= k) cout << k << endl; else { k -= a[3]; ... |
#include <bits/stdc++.h> using namespace std; const int maxN = 1000 * 1000 + 50; vector<int> v[maxN]; int cnt; bool mark[maxN]; void dfs(int s) { mark[s] = 1; cnt++; for (int i = 0; i < v[s].size(); i++) if (mark[v[s][i]] == 0) dfs(v[s][i]); } int main() { int n, m, k, sum = 0, com... |
#include <bits/stdc++.h> using namespace std; int main() { string x; int i; cin >> x; for (i = 0; x[i]; i++) { if (i == 0 && x[i] == 57) x[i] = x[i]; else if (x[i] >= 53) x[i] = (57 - x[i]) + 48; cout << x[i]; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long N = 105; struct Point { long long x, y; Point() { x = y = 0; } Point(long long _x, long long _y) { x = _x; y = _y; } void input() { cin >> x >> y; } Point operator+(const Point &a) const { return Point(x + a.x, y + a... |
#include <bits/stdc++.h> using namespace std; int i, j, n, k, tot, ans, sum; int a[100005]; string st; char ch; int main() { ios::sync_with_stdio(false); cin >> n; if (n == 2) { cout << 3 << endl; return 0; } if (n == 3) { cout << 5 << endl; return 0; } fo... |
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair <int, int> ii; const int Maxn = 200005; const ll Inf = 1000000000000000000ll; int T; int n; vector <int> neigh[Maxn]; int a[Maxn]; int mylvl[Maxn]; vector <ii> L[Maxn]; int mxlvl; ll best[Maxn]; ll dp[M... |
#include <bits/stdc++.h> const long long md = (1e9 + 7); const long long fakmd = 998244353; using namespace std; long long n, m; pair<long long, long long> a[100100]; long long ans[100100]; int32_t main() { cin >> n >> m; long long it = 1; long long sum = 0; for (long long i = 1; i <= m; i... |
#include <bits/stdc++.h> using namespace std; template <class T> void clear(T &x) { T t; x.swap(t); } template <class T> void miz(T &a, T b) { if (b < a) a = b; } template <class T> void maz(T &a, T b) { if (b > a) a = b; } template <class T> T gcd(T a, T b) { while (b) { ... |
#include <bits/stdc++.h> using namespace std; int main() { unsigned long long k, d, t; cin >> k >> d >> t; if (k % d == 0) { printf( %lld n , t); } else { unsigned long long num = k / d; unsigned long long num1 = k % d; unsigned long long t1 = (num + 1) * d; double onez... |
#include <bits/stdc++.h> using namespace std; const int MAXN = 5e3 + 51, MOD = 998244353; int n, res; int p[MAXN][MAXN], fact[MAXN], finv[MAXN]; inline int read() { register int num = 0, neg = 1; register char ch = getchar(); while (!isdigit(ch) && ch != - ) { ch = getchar(); } if (... |
#include <bits/stdc++.h> using namespace std; int pgcd(int a, int b) { if (b % a == 0) return a; pgcd(b % a, a); } int main() { int o = 0, gcd, az[1001], t[5000], j, k = 0, m, x, y, i, a, b, n; cin >> a >> b >> n; gcd = pgcd(a, b); for (i = 1; i * i <= gcd; i++) { if (gcd % i == 0)... |
#include <bits/stdc++.h> using namespace std; int x, y, x2, y2; int v; vector<int> mass1, mass2; int check1(int ind) { if (ind == -1 || ind == (int)mass1.size()) { return 1e9; } return abs(mass1[ind] - x) + abs(x2 - mass1[ind]) + (y2 - y + v - 1) / v; } int check2(int ind) { if (ind ... |
#include <bits/stdc++.h> using namespace std; const int MOD = 998244353; const int N = 2000 + 10; int n; int pa, pb, p, q; int cp[N][N]; int strong[N]; int f[N]; void add(int &t, int s) { t += s; if (t >= MOD) t -= MOD; } void mul(int &t, int s) { t = (long long)t * s % MOD; } int pow(in... |
#include <bits/stdc++.h> using namespace std; template <typename T> vector<T>& operator--(vector<T>& v) { for (auto& i : v) --i; return v; } template <typename T> vector<T>& operator++(vector<T>& v) { for (auto& i : v) ++i; return v; } template <typename T> istream& operator>>(istream&... |
#include <bits/stdc++.h> using namespace std; long long Tc, a, b, n, m; int main() { long long ans = 0; cin >> n >> m; if (m % n != 0) { cout << -1 n ; return 0; } m /= n; while (m % 2 == 0) { m /= 2; ans++; } while (m % 3 == 0) { m /= 3; ans++;... |
#include <bits/stdc++.h> using namespace std; const int maxN = (int)2e5 + 5; const int maxM = (int)2e5 + 5; inline int readInt() { char c; int tmp = 0, x = 1; c = getchar(); while (c > 9 || c < 0 ) { if (c == - ) x = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { ... |
#include <bits/stdc++.h> using namespace std; const long long N = 200005, m1 = 998244353, m2 = 1e9 + 9; char s[N], c[N]; long long n, z[N], p1[N] = {1}, p2[N] = {1}, a[N]; pair<long long, long long> tr[N << 2]; struct Hash { long long h1[N], h2[N]; char s[N]; void init() { h1[0] = h2[0] = ... |
#include <bits/stdc++.h> using namespace std; template <class T> inline int size(const T& c) { return c.size(); } using namespace std; int fastMax(int x, int y) { return (((y - x) >> (32 - 1)) & (x ^ y)) ^ y; } int fastMin(int x, int y) { return (((y - x) >> (32 - 1)) & (x ^ y)) ^ x; } const int max... |
#include <bits/stdc++.h> using namespace std; const int MaxN = 100000; int a[MaxN]; int color[MaxN]; bool f = true; int n; int main() { int n, k; cin >> n >> k; for (int i = 1; i <= n; ++i) cin >> a[i]; sort(a + 1, a + n + 1); reverse(a + 1, a + n + 1); while (n % k) { a[n + ... |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const int maxn = 200050; long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } int isprime(int x) { for (int i = 2; i <= sqrt(x); i++) { if (x % i == 0) return 0; } return 1; } int judge(char ch... |
#include <bits/stdc++.h> using namespace std; signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long a, b; cin >> a >> b; if (a == b) { cout << infinity << n ; return 0; } if (a < b) { cout << 0 << n ; return 0; } ... |
#include <bits/stdc++.h> using namespace std; int main() { long i, j, t, a, b, m, n, c, d, y, x, k, s; t = 1; while (t--) { string s1, s2; cin >> s1 >> s2; if (s1 == s2) cout << s1; else cout << 1; } } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c; scanf( %d%d%d , &a, &b, &c); int aweek = a / 3; int bweek = b / 2; int cweek = c / 2; int ans = min(aweek, min(bweek, cweek)); ans -= 2; ans = max(ans, 0); a -= ans * 3; b -= ans * 2; c -= ans * 2; ... |
#include <bits/stdc++.h> using namespace std; const int maxn = 5e5 + 10; int n, m, q, times[maxn]; long long a[maxn]; int main() { scanf( %d%d%d , &n, &m, &q); for (int i = 1; i <= n; ++i) { int x; scanf( %d , &x); a[i] = (long long)(times[x]++) * m + x; } sort(a + 1, a + 1 +... |
#include <bits/stdc++.h> using namespace std; template <typename _T> inline void _DBG(const char *s, _T x) { cerr << s << = << x << n ; } template <typename _T, typename... args> void _DBG(const char *s, _T x, args... a) { while (*s != , ) cerr << *s++; cerr << = << x << , ; _DBG... |
#include <bits/stdc++.h> using namespace std; int arr[100002][2]; long long dp[100002][2][2]; int n; long long solve(int idx, int arga3, int dir) { if (idx == 1 && dir == 0) return 0; if (idx == n && dir == 1) return 0; long long &ret = dp[idx][arga3][dir]; if (ret != -1) return ret; ret =... |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { string s; cin >> s; int zero = 0, one = 0; for (char i : s) if (i == 0 ) zero++; else one++; ... |
#include <bits/stdc++.h> using namespace std; vector<pair<pair<int, int>, pair<int, int> > > way[222222]; queue<int> turn; bool was[222222]; int i, n, m, ans[222222], cost[222222]; int main() { cin >> n >> m; for (i = 1; i <= m; i++) { int a, b, c; cin >> a >> b >> c; cost[a] += c;... |
#include <bits/stdc++.h> using namespace std; vector<int> a[4]; vector<long long> sum[4]; int hasha[200050], hashb[200050]; int c[200050]; int main() { ios::sync_with_stdio(false); cin.tie(0); int n, m, k, t; cin >> n >> m >> k; memset(hasha, 0, sizeof(hasha)); memset(hashb, 0, sizeo... |
#include <bits/stdc++.h> using namespace std; using namespace std::chrono; const long long int N = 10e5 + 10; const long long int M = 32767; long long int a[100050] = {0}; long long int b[100050] = {0}; int main() { long long int t; cin >> t; while (t--) { int n, k; int segment = 0... |
#include <bits/stdc++.h> using namespace std; int c[100]; int main() { int n, k, a; cin >> n; for (int i = 1; i <= n; i++) { cin >> k; for (int j = 1; j <= k; j++) { cin >> a; c[a]++; } } for (int i = 1; i <= 100; i++) { if (c[i] == n) cout << i << ; ... |
#include <bits/stdc++.h> using namespace std; void solve() { string a, b; cin >> a >> b; if (a.size() < b.size()) a = string(b.size() - a.size(), 0 ) + a; if (a.size() > b.size()) b = string(a.size() - b.size(), 0 ) + b; if (a < b) cout << < << endl; else if (a > b) cout << ... |
#include <bits/stdc++.h> using namespace std; long long n, a[1005]; map<long long, int> x; int ans; void f(long long a, long long b) { long long cur = a + b; vector<long long> q; q.push_back(a); q.push_back(b); int len = 2; x[a]--; x[b]--; while (x[cur] > 0) { x[cur]--; ... |
#include <bits/stdc++.h> using namespace std; inline void writeln2() { cout << n ; } inline void writeln() { cout << n ; } inline void readln() {} template <typename T> inline void read(T&); template <typename T> inline void priws(T); template <typename T> inline void print(T); void err(vector... |
#include <bits/stdc++.h> #pragma 03 using namespace std; int mod = 998244353; int add(int a, int b) { a += b; if (a < 0) a += mod; if (a >= mod) a -= mod; return a; } int main() { int n, m; string s, t; cin >> n >> m >> s >> t; int pw = 1, res = 0, ans = 0; for (int i = 0... |
#include <bits/stdc++.h> using namespace std; void striker() { int n; cin >> n; string s; cin >> s; int left_arr[n]; int right_arr[n]; for (int i = 0; i < 2 * n; i++) { if (i < n) left_arr[i] = s[i]; else right_arr[i - n] = s[i]; } bool flag = false; ... |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); long long n, sx, sy; cin >> n >> sx >> sy; vector<pair<long long, long long>> vec(n); for (int i = 0; i < n; i++) { cin >> vec[i].first >> vec[i].second; } long long ans1 = 0, an... |
#include <bits/stdc++.h> using namespace std; int i, j, k, n, m, an; int f[(1 << 24)], g[(1 << 24)], h[(1 << 24)]; char p[3]; int main() { scanf( %d , &n); for (i = 1; i <= n; i++) { scanf( %s , p); int s = 0; for (j = 0; j <= 2; j++) s |= 1 << (p[j] - a ); g[s]++; } m... |
#include <bits/stdc++.h> using namespace std; int p[100010] = {0}, d[100010], n, k, a[100010], ans = 0, ac[100010], flag = 1; void solve(int x) { if (x > n) return; if (p[x] == 0 || (p[x] == x + 1 && flag)) { if (p[x] == 0) flag = 0, ans += (x != n), solve(x + 1); else solve(x ... |
#include <bits/stdc++.h> using namespace std; int main() { double d, h, v, e; cin >> d >> h >> v >> e; double ans = 3.14159265359 * d * d * h / (4 * v - 3.14159265359 * d * d * e); if (ans < 0) cout << NO << n ; else { cout.precision(17); cout << YES ... |
#include <bits/stdc++.h> const int INF = 0x3f3f3f3f; const int maxn = 1e5 + 50; const int Mod = 1e6 + 3; using namespace std; const char YES[] = YES , NO[] = NO ; int n; int s[maxn]; bool find(int &st) { st = n - 2; if (st <= 0) return false; while (st > 0 && s[st] != 0) st--; return s... |
#include <bits/stdc++.h> using namespace std; long long n, m; long long ban[300000]; long long cnt[300000]; long long used[300000]; long long dp[300000]; long long g[300000]; long long fi; vector<long long> vec[300000]; vector<long long> GCD[300000]; vector<long long> ans; long long gcd(long lon... |
#include <bits/stdc++.h> using namespace std; int prime[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59}; int fack[62]; int dp[110][1 << 17]; int pre[110][1 << 17]; int x[110][1 << 17]; int n; int a[110]; void init() { memset(fack, 0, sizeof(fack)); for (int i = 1; i <= 60;... |
#include <bits/stdc++.h> using namespace std; using LL = long long; const int MAXN = 11; const int MAXM = 1e4 + 5; int n, m, ex[MAXN]; int cnt[30]; char w[MAXN][MAXM]; void solve() { scanf( %d %d , &n, &m); for (int i = 0; i < n; i++) scanf( %d , &ex[i]); for (int i = 0; i < n; i++) scanf( %... |
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { if (a == 0 || b == 0) return abs(a - b); long long res = a % b; while (res) { a = b; b = res; res = a % b; } return b; } long long lcm(long long a, long long b) { return a * b / gcd(a, b... |
#include <bits/stdc++.h> using namespace std; const int IN = 2e5 + 7; int sum[IN]; int main() { string str; cin >> str; int n; scanf( %d , &n); memset(sum, 0, sizeof(sum)); if (str[0] == str[1]) sum[0] = 1; else sum[0] = 0; int k = str.size(); for (int i = 1; i < ... |
#include <bits/stdc++.h> using namespace std; const int maxn = 200005; map<string, int> f; vector<pair<int, string> > v; int n, cnt = 0; int main() { scanf( %d , &n); for (int i = 0; i < n; ++i) { string s; cin >> s; f[s] = ++cnt; } for (map<string, int>::iterator it = f.be... |
#include <bits/stdc++.h> using namespace std; void fast() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } long long max(long long num) { long long max = 1, rem; while (num > 0) { rem = num % 10; num /= 10; if (rem > max) { max = rem; } ... |
#include <bits/stdc++.h> using namespace std; int main() { int r, c, x = 0, y, z; cin >> r >> c; while (r != 0) { if (r % 2 != 0) { for (int i = 0; i < c; i++) { cout << # ; } cout << n ; } else { if (!x) { for (int i = 0; i < c - 1; i++... |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); vector<long long> tmp; int n, k; cin >> n >> k; long long mas[n], ans = 0; for (int i = 0; i < (int)(n); ++i) cin >> mas[i]; vector<pair<long long, long long> > ext; string s; ... |
#include <bits/stdc++.h> char Puz[105][105], ch; bool flag[105][105], ok; int i, j, k, n, m; int main() { scanf( %d%d , &n, &m); scanf( %c , &ch); for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) { scanf( %c , &ch); Puz[i][j] = ch; } scanf( %c , &ch); } m... |
#include <bits/stdc++.h> using namespace std; template <typename T1, typename T2> inline void chmin(T1& a, T2 b) { if (a > b) a = b; } template <typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; } const long long MOD = 998244353; const long long MAX = 200060; const... |
#include <bits/stdc++.h> using namespace std; long long int n, a[100] = {}, r = 0, s = 0, m; int main() { ios_base::sync_with_stdio(0); for (long long int i = 1; i <= 5; i++) { cin >> m; a[m]++; s += m; if (a[m] == 2 || a[m] == 3) r = max(r, m * a[m]); } cout << s - r; ... |
#include <bits/stdc++.h> const int BUFFSIZE = 10240; char BUFF[BUFFSIZE + 1], *p = BUFF; int CHAR, SIGN, BYTES = 0; using namespace std; char s1[(int)1e6 + 10]; char s2[(int)1e6 + 10]; vector<int> buf[26]; int main() { scanf( %s %s , s1, s2); int l1 = strlen(s1); int l2 = strlen(s2); for... |
#include <bits/stdc++.h> using namespace std; const int maxn = 30; struct Node { int pos, val; bool operator<(const Node& a) const { return val < a.val; } } p[maxn]; int ans[maxn]; int n; int main() { cin >> n; for (int i = 1; i <= n; ++i) cin >> p[i].val, p[i].pos = i; sort(p + 1, p +... |
#include <bits/stdc++.h> using namespace std; constexpr int N = 3e3 + 1; int a[N], nxt[N], prv[N], lst[N]; uint16_t dp[N][N]; int main() { cin.tie(0), ios::sync_with_stdio(0); int t, n; cin >> t; while (t--) { cin >> n; for (int i = 0; i < n; ++i) { cin >> a[i], --a[i]; ... |
#include <bits/stdc++.h> using namespace std; pair<int, int> T[4 * 200005]; void update(int n, int b, int e, int p, int v) { if (b == p && e == p) { T[n] = make_pair(v, p); } else { int m = (b + e) / 2; if (p <= m) update(2 * n, b, m, p, v); else update(2 * n + 1, m... |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx ) const int N = (int)5e5 + 7, inf = (int)1e9 + 7, mod = (int)1e9 + 7; const long long linf = (long long)1e18 + 7; const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1}, dy[] = {0, 1, 0, -1, 1, ... |
#include <bits/stdc++.h> using namespace std; int h, q; char s[10]; unordered_map<int, int> a; double ans; void add(int v, int x) { if (a.count(v) == 0) a[v] = x; else a[v] += x; return; } void addToRoot(int v, int x) { while (v > 0) { add(v, x); v >>= 1; } ... |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long n, m, x = 0, y, i = 1; cin >> n >> m; if (!m) { cout << n << << n; return 0; } y = (n - 2 * m); if (y < 0) y = 0; n--; while (x < m && n > 0) ... |
#include <bits/stdc++.h> using namespace std; const int N = 322228; long long a[N]; int n, k; int cou[N]; bool solve(int l, int r) { long long need = cou[l % k]; long long tl = l - k >= 0 ? a[l - k] + 1 : -1000000000000ll; long long tr = r + k < n ? a[r + k] - 1 : 1000000000000ll; if (tr - t... |
#include <bits/stdc++.h> using namespace std; int getSum(vector<int> BITree[], int index, int n) { int sum = 0; index = index + 1; while (index > 0) { sum += BITree[n][index]; index -= index & (-index); } return sum; } void updateBIT(vector<int> BITree[], int n, int index, int va... |
#include <bits/stdc++.h> using namespace std; const int N = 500010; int main() { int n; cin >> n; int a[111][111] = {0}; int ans1 = 0, ans2 = 0; vector<int> mids; for (int i = 1; i <= n; i++) { cin >> a[i][0]; for (int j = 1; j <= a[i][0]; j++) { cin >> a[i][j]; ... |
#include <bits/stdc++.h> int read() { int x = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * f; } using namespace std; ... |
#include <bits/stdc++.h> using namespace std; long long mod = 1000000007; int main() { long long n, k; cin >> n >> k; map<int, int, greater<int> > st; long long n1 = n; for (int i = 0; n1 > 0; ++i) { if (n1 & 1) st[i] = 1; n1 >>= 1; } k -= (int)(st.size()); if (k < 0) {... |
#include <bits/stdc++.h> long long x, y; int maxdis(long long x, long long n, long long s) { if (x > (s >> 1)) x = s - x; if (x * n > s) return maxdis(s % x, (x * n + s % x) / s, x); else return (x > (s - x * (n - 1)) ? x : (s - x * (n - 1))); } int a, n, p, h; int main() { int t; ... |
#include <bits/stdc++.h> using namespace std; int main() { string s; while (cin >> s) { int N = s.size(); int l = N - 1; for (; l > 0; --l) { for (int i = 0; i + l <= N; ++i) { string sub = s.substr(i, l); size_t head = s.find(sub); if (head != string:... |
#include <bits/stdc++.h> using namespace std; long long n, so7, so4, kiemtra7; bool check = true; int main() { cin >> n; if (n % 7 == 0) { so7 = n / 7; for (int i = 1; i <= so7; i++) cout << 7 ; } else { int r = n % 4; if (r == 0) { kiemtra7 = (n - 4) / 28; i... |
#include <bits/stdc++.h> using namespace std; int main() { int n, b; cin >> n; for (int i = 0; i < n; i++) { cin >> b; int a[b + 1]; for (int j = 0; j < b; j++) cin >> a[j]; sort(a, a + b); int mn = 999999; for (int j = 1; j < b; j++) { mn = min(a[j] - a[j - 1... |
#include <bits/stdc++.h> using namespace std; static const int INF = 500000000; template <class T> void debug(T a, T b) { for (; a != b; ++a) cerr << *a << ; cerr << endl; } long long int n; pair<long long int, int> factor[100]; long long int tot[100]; int m = 0; long long int ans; bool... |
#include <bits/stdc++.h> using namespace std; long long n, k, x[5], a[30], d = 0; long long mod = 1000000007ll, fc[30]; long long C[30][30]; bool vis[30]; long long first(long long s1, long long s2, long long s3, long long ind, long long q, long long t) { if (t == 1) { if (s1 == ... |
/*--------------------------------------------------------------- ∧＿∧ ∧＿∧ （´<_｀ ） （ ´_ゝ`） / ⌒i ／ ＼ | | / /￣￣￣￣/ | ＿_(__ﾆつ/ ＿/ .| .|＿＿＿＿ ＼/＿＿＿＿/ （u ⊃ --------------------------------------------------------------*/ #include<bits/stdc++.h> #d... |
#ifdef Prateek #include Prateek.h #else #include <bits/stdc++.h> using namespace std; #define debug(...) 42 #endif #define int ll #define all(c) begin(c),end(c) using ll = long long; const int MOD = 1e9+7, N = 1e5 + 10; struct edge{ int u, v, w; }; int32_t main(){ io... |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { long long a, b, c; cin >> a >> b >> c; if (a < c) cout << 1 << ; else cout << -1 << ; if (c < a * b) cout << b << endl; else cout << -1 << e... |
#include <bits/stdc++.h> using namespace std; static int n; static vector<int> ve; int main() { while (scanf( %d , &n) != EOF) { ve.clear(); ve.resize(n); for (int i = 0; i < n; i++) scanf( %d , &ve[i]); if (n == 1 && ve[n - 1] != 15 && ve[n - 1] != 0) { printf( -1 n ); ... |
#include <bits/stdc++.h> const int N = 100005; int K, n, maxb, t; int c[N]; int read() { int x = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar... |
#include <bits/stdc++.h> const int maxn(505); char ans[maxn]; int main() { int n; scanf( %d , &n); int nr(1), nc(1); ans[(n - 1) * 2] = 0 ; for (int i(0); i < n - 1; ++i) { printf( ? %d %d %d %d n , nr, nc + 1, n, n); fflush(stdout); char tmp[5]; scanf( %s , tmp); ... |
#include <bits/stdc++.h> using namespace std; template <typename A, typename B> inline void smin(A &a, const B &b) { if (a > b) a = b; } struct point { double x, y, z; inline point(double x = 0, double y = 0, double z = 0) : x(x), y(y), z(z) {} inline point operator-(point a) { return point(x ... |
#include <bits/stdc++.h> using namespace std; const int N = 255; const int md = 1e9 + 7; char c[N][N]; int as, n, m, d, mk, f[2][(1 << 17) + 1][2]; void upd(int &x, int y) { x += y; x >= md ? x -= md : 0; } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) scanf( %s , c[i]... |
#include <bits/stdc++.h> using namespace std; const long long maxn = 100000000000; long long Ceil(long long a, long long b) { return (a / b) + ((a % b) != 0); } int main() { long long t; cin >> t; while (t--) { long long n; cin >> n; long long cb = 0, rem = 0, total = 0; whil... |
#include <bits/stdc++.h> int main() { int t; scanf( %d , &t); while (t--) { unsigned int a, b, c, d; scanf( %u %u %u %u , &a, &b, &c, &d); if (a <= b) printf( %u n , b); else if (c <= d) printf( -1 n ); else { unsigned long long f = (a - b)... |
#include <bits/stdc++.h> using namespace std; int main() { long long t; cin >> t; while (t--) { long long kkkk = 1; unsigned long long n, i, k, a, j, cont = 0, cont1 = 0, cont2 = 0, x; cin >> n >> k; vector<int> vec; for (i = 0; i < n; i++) { cin >> a; vec.p... |
#include <bits/stdc++.h> using namespace std; const int dr[] = {0, -1, 0, 1, -1, 1, 1, -1}; const int dc[] = {1, 0, -1, 0, 1, 1, -1, -1}; const double eps = 1e-9; template <class T> void print(const vector<T> &v) { ostringstream os; for (int i = 0; i < (int)v.size(); ++i) { if (i) os << ; ... |
#include <bits/stdc++.h> using namespace std; string v[12] = { x^y^z , x^z^y , (x^y)^z , (x^z)^y , y^x^z , y^z^x , (y^x)^z , (y^z)^x , z^x^y , z^y^x , (z^x)^y , (z^y)^x }; pair<long double, long double> sol[12]; const long double EPS = 1e-12; long double cmp(pair... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.