func_code_string stringlengths 59 71.4k |
|---|
#include <bits/stdc++.h> using namespace std; const int N = 4e5 + 100; vector<int> adj[N]; int n, sz[N]; int get(int cur, int fr) { sz[cur] = 1; int ret = 0; for (auto v : adj[cur]) { if (v == fr) continue; ret |= get(v, cur); sz[cur] += sz[v]; } if (!ret && sz[cur] > n /... |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int g[4]; int i = 0; for (i = 0; i < 4; i++) { cin >> g[i]; } sort(g, g + 4); long long a = 0, b = 0, c = 0, k = 0; k = g[3]; a = g[0]; b = g[1]; c = g[2]... |
#include <bits/stdc++.h> using namespace std; const long long int inf = 2000000000; const long double eps = 0.0000001; const long double pi = acos(-1.0); const long long int MOD = 998244353; const long long int N = 1e5 + 5; signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); ... |
#include <bits/stdc++.h> using namespace std; long long int mem[1000]; int k; map<long long int, long long int> first; long long int f(long long int x) { if (first.find(x) != first.end()) return first[x]; if (x % 2 == 0) return f(x / 2); else return f(x / 2) + 1; } int main() { ... |
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; vector<int> a(n), g(256, -1); for (int &e : a) cin >> e; for (int i = 0; i < n; i++) { if (g[a[i]] != -1) a[i] = g[a[i]]; else { int temp = max(0, a[i] - k + 1); for (int j = a... |
#include <bits/stdc++.h> using namespace std; int add(int x, int y) { x += y; while (x >= 1000000007) x -= 1000000007; while (x < 0) x += 1000000007; return x; } int mul(int x, int y) { return (x * 1ll * y) % 1000000007; } int binpow(int x, int y) { int z = 1; while (y) { if (y &... |
#include <bits/stdc++.h> using namespace std; long long MOD = int(1e9) + 7; int debug = 1; int main() { int a, b, c, l; cin >> a >> b >> c >> l; int cnt = 0; int m; long long n, total = 0; for (int i = 0; i < l + 1; i++) { n = i; n = ((n + 2) * (n + 1)) / 2; total += n;... |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { long long n, k, a, ans, y; cin >> n >> k; long long s[n + 10]; vector<long long> v; for (int i = 0; i < n; i++) cin >... |
#include <bits/stdc++.h> using namespace std; long long int n; map<pair<long long int, long long int>, long long int> val; long long int get_lca(long long int x, long long int y) { vector<long long int> a, b; a.clear(); b.clear(); while (x > 0) { a.push_back(x); x >>= 1; } wh... |
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 10; char s[maxn]; int n; long long ans; namespace SAM { int fa[maxn], ch[maxn][26], mxlen[maxn], cend[maxn], cnode, root, lst; vector<int> g[maxn]; vector<int> len[maxn]; inline int getnewnode() { fa[cnode] = -1; memset(ch[... |
#include <bits/stdc++.h> using namespace std; char a[1005], b[1005]; int main() { int n, i; scanf( %d , &n); scanf( %s , a + 1); scanf( %s , b + 1); int ans1 = n, ans2 = 0; sort(a + 1, a + 1 + n); sort(b + 1, b + 1 + n); int lab = 1, cnt = 1; while (lab <= n) { if (a[cnt]... |
#include <bits/stdc++.h> template <unsigned P> class modint { static_assert(1 <= P); using mint = modint<P>; protected: unsigned v; public: modint() : v() {} template <typename T, typename std::enable_if<std::is_signed<T>::value && ... |
#include <bits/stdc++.h> int inf = 0x3f3f3f3f; using namespace std; int n, m, x, y, f[200010], degree, cnt; vector<pair<int, int>> ans, edge1, wron; vector<pair<int, int>> edge; vector<pair<int, int>> v[200010]; int find(int x) { if (f[x] == x) return x; return f[x] = find(f[x]); } int jihe(in... |
#include <bits/stdc++.h> using namespace std; bool sortcol(const vector<int>& v1, const vector<int>& v2) { return v1[0] < v2[0]; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); ; int n, m; cin >> n >> m; int a[n + 1], b[m + 1]; for (int i = 1; i <= n; i++) cin >> a[i... |
#include <bits/stdc++.h> using namespace std; const int maxn = 500008; int n, m, cnt; int day[] = {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; int get(int x) { int ret = 0; for (int i = 0; i < x; ++i) ret += day[i]; return ret; } struct Node { int year, month, date; int hour, m... |
#include <bits/stdc++.h> using namespace std; const int DN = 3e5 + 5; int n, m, sol, f, cnt, mi = 1e9, sum; char ch[6], a[5][5], car; string s[DN], r[DN]; void solve1() { cnt++; sum = 0; int f, mi; for (int i = 1; i <= n; i++) { f = 0; for (int j = 1; j <= m; j++) { car =... |
#include <bits/stdc++.h> using namespace std; const long long int md = 1e9 + 7; const long long int N = 55; long long int a[N]; long long int dp[N][N]; vector<pair<long long int, long long int>> v; long long int mask; long long int rec(long long int n, long long int k) { long long int s = 0; if ... |
#include <bits/stdc++.h> using namespace std; int main() { long long a, b, temp, count = 0; cin >> a >> b; while (a >= 1 && b >= 1) { if (a > b) { count += a / b; a %= b; } else if (b > a) { count += b / a; b %= a; } else { count++; break... |
#include <bits/stdc++.h> using namespace std; const int N = 55, inF = 1e9 + 100; int n, h, m, l[N], r[N], x[N], c[N], dp[N][N][N]; int get(int i, int j, int dex, int h) { int res = 0; for (int q = 0; q < m; q++) if (l[q] <= dex && l[q] >= i && r[q] <= j && r[q] >= dex && x[q] < h) res += c... |
#include <bits/stdc++.h> using namespace std; const unsigned mod = 3853518419u; const unsigned base = 85429482u; int n; string s; basic_string<int> e[300005]; int p[19][300005], du[300005]; unsigned bp[300005]; unsigned hu[19][300005], hd[19][300005]; void dfs(int x, int par) { p[0][x] = par; ... |
#include <bits/stdc++.h> using namespace std; int N, X, ans; int A[100002]; int B[100002]; int main() { scanf( %d%d , &N, &X); for (int i = 1; i <= N; i++) scanf( %d , &A[i]); for (int i = 1; i <= N; i++) scanf( %d , &B[i]); sort(A + 1, A + N + 1); sort(B + 1, B + N + 1); for (int i = ... |
#include <bits/stdc++.h> using namespace std; inline int qpow(int b, long long e) { int a = 1; for (; e; e >>= 1, b = (long long)b * b) if (e & 1) a = (long long)a * b; return a; } const int maxn = 2222; int a[maxn]; vector<int> odd, even; void solve() { int n; cin >> n; odd.... |
#include <bits/stdc++.h> using namespace std; long long n; map<pair<long long, long long>, pair<long long, long long> > mp; pair<long long, long long> count(long long x, long long y) { if (mp.find(make_pair(x, y)) != mp.end()) return mp[make_pair(x, y)]; long long temp = 1; while (x / 10 >= temp) te... |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); string s; cin >> s; int dp[10][10][10][10]; for (int i = 0; i < 10; i++) for (int j = 0; j < 10; j++) for (int k = 0; k < 10; k++) for (int l = 0; l < 10; l++) ... |
#include <bits/stdc++.h> using namespace std; const int INF = 2 * 1e9; const double PI = acos(-1); vector<int> a; int p[10000001]; int m = 10000000; int main() { int n; cin >> n; for (int i = 2; i * i <= m; i++) { if (!p[i]) { for (int j = i * i; j <= m; j += i) p[j] = 1; }... |
#include <bits/stdc++.h> #pragma warning(disable : 4996) using namespace std; long long cntPair(long long v) { return v * (v - 1) / 2LL; } int main() { int n, d; cin >> n >> d; vector<pair<int, int> > v(n); for (int i = 0; i < n; i++) { cin >> v[i].first; v[i].second = i + 1; } ... |
#include <bits/stdc++.h> using namespace std; vector<long long> al[100001]; long long vis[100001]; long long no(long long num) { long long min = num % 10, max = num % 10; while (num > 0) { long long a = num % 10; num /= 10; if (min > a) min = a; if (max < a) max = a; } re... |
#include <bits/stdc++.h> using namespace std; int color[200010]; vector<int> save[200010]; int mark[200010]; map<long long, long long> mark_color; int main() { int n, m, k, cnt = 0; scanf( %d %d %d , &n, &m, &k); memset(mark, 0, sizeof(mark)); for (int i = (1); i < (n + 1); i++) scanf( %d , ... |
#include <bits/stdc++.h> using namespace std; int main() { long int sum, i, j, k, n; char str[200002]; scanf( %ld , &n); scanf( %s , &str[0]); for (i = 0; i < n; i++) { if (str[i] == 0 ) { j++; } else k++; } if (j > k) j = k; sum = n - 2 * j; printf( ... |
#include <bits/stdc++.h> using namespace std; const int S = 100003; int n, a[S], f[353][S], nn, bl[S], fr[353], to[353], m, bg[353], ed[353], las = 0; deque<int> q[353]; void read(int &s) { s = 0; char c = getchar(), t = 1; while (c != - && (c < 0 || c > 9 )) c = getchar(); if (c ==... |
#include <bits/stdc++.h> using namespace std; int main(){ int t,n; scanf( %d ,&t); while(t--){ scanf( %d ,&n); double ans=0; vector<double>miners; vector<double>diamonds; for(int i=0;i<2*n;i++){ double a,b; scanf( %lf%lf ,&a,&b); ... |
#include <bits/stdc++.h> using namespace std; const int N = 1050000, P = 998244353, inv2 = (P + 1) / 2; int n, m, U, cnt[N], f[N], g[N], ans; char s[21][100005]; inline void read(int &i) { i = 0; char c = getchar(); bool j = 0; for (; !isdigit(c); c = getchar()) if (c == - ) j = 1; ... |
#include <bits/stdc++.h> using namespace std; int main() { int k; cin >> k; cout << 7 + (3 * (k - 1)) << endl; cout << 1 << << 1 << endl; cout << 0 << << 1 << endl; cout << 0 << << 0 << endl; cout << 1 << << 0 << endl; cout << 2 << << 2 << endl; cout << 2 << ... |
#include <bits/stdc++.h> using namespace std; int main() { int q; cin >> q; while (q--) { long long n, m; cin >> n >> m; long long ans; if (n < m) { ans = 0; } else if (n == m) ans = m % 10; else { int d = m % 10; int rem[10]; r... |
#include <bits/stdc++.h> using namespace std; template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) { os << { ; string sep; for (const auto &x : v) os << sep << x, sep = , ; return os << } ; } template <typename T, size_t size> ostream &operator<<(ostream &os, const ... |
#include <bits/stdc++.h> using namespace std; int main() { string x; cin >> x; int i, j; int len = x.size(); int count = 0; for (i = 0; i < len; i++) { for (j = 1; j <= len - i; j++) { string z = x.substr(i, j); if (z == Danil || z == Olya || z == Slava || z == A... |
#include <bits/stdc++.h> using namespace std; int n, s1, s2; int a[100005]; bool check(int x) { int l = -1e9, r = 1e9; for (int i = n; i >= 1; i--) { if (l <= a[i] && a[i] <= r) { l = a[i] - x; r = a[i] + x; } else { l = max(l, a[i] - x); r = min(r, a[i] + x);... |
#include <bits/stdc++.h> signed main(void) { int totNums, cnt = 0; long long tot = 0, num; bool zero = false; std::cin >> totNums; for (int i = 0; i < totNums; i++) { std::cin >> num; if (num == 0) { ++tot; zero = true; } else if (num > 0) tot += num - 1; ... |
#include <bits/stdc++.h> using namespace std; void __print(int first) { cerr << first; } void __print(long first) { cerr << first; } void __print(long long first) { cerr << first; } void __print(unsigned first) { cerr << first; } void __print(unsigned long first) { cerr << first; } void __print(unsigned l... |
#include <bits/stdc++.h> using namespace std; const int INF = 1 << 30; const int maxn = 105; const int MOD = 1e9 + 7; const double eps = 1e-6; const double pi = acos(-1); long long n, m; long long T[maxn][maxn]; long long f[maxn]; void Mul_mat(long long fin[][maxn], long long b[][maxn]) { long l... |
#include <bits/stdc++.h> using namespace std; pair<int, int> operator-(const pair<int, int>& lhs, const pair<int, int>& rhs) { return pair<int, int>(lhs.first - rhs.first, lhs.second - rhs.second); } int x[19] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4, 1, 2, 3, 4, 2, 3, 4}; int y[19] = {0, 0, 0, 1, 1, 1, 1, 2... |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); long long n; cin >> n; long long a[n]; map<long long, long long> m, ans; vector<long long> v; for (long long i = 0; i < n; i++) { cin >> a[i]; if (m[a[i]] == 0 && a[i] <= n) { m[a... |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; char c; int sum = 0; if (n % 2 == 0) { int f = 1; for (int i = 1; i <= n; i++) { cin >> c; if (c == ( ) sum++; else sum--; if (sum < -1) break; } ... |
#include <bits/stdc++.h> using namespace std; int main() { int test; cin >> test; while (test--) { long long x1, x2, y1, y2; cin >> x1 >> y1 >> x2 >> y2; cout << (long long)((x2 - x1) * (y2 - y1)) + 1 << n ; } } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; int arr[4] = {1, 3, 6, 10}; while (t--) { int x; cin >> x; int num1 = x % 10; int num2 = 0; while (x != 0) { x = x / 10; num2++; } cout << (num1 - 1) * 10 + arr[num2 ... |
#include <bits/stdc++.h> using namespace std; int main() { int vv[3003] = {0}, vvv[3003] = {0}; int n, v, m = -1, k; cin >> n >> v; while (n--) { int a, b; cin >> a >> b; vv[a] += b; vvv[a + 1] += b; m = max(m, a + 1); } int ans = 0, mm; for (int i = 0; i <=... |
#include <bits/stdc++.h> using namespace std; mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count()); #pragma GCC optimize( Ofast ) #pragma GCC optimize( -O3 ) #pragma GCC optmize( sse, sse2, sse3, sse4, avx, abx, avx2, sse4.1 ) #pragma GCC optmize( fast-math ) #pragma GCC optimize( ... |
#include <bits/stdc++.h> using namespace std; int n, a[111111], b[111111], c[111111], d[111111]; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); } for (int i = 1; i <= n; i++) { scanf( %d , &b[i]); } for (int i = 1; i <= n; i++) { c[i] = a... |
#include <bits/stdc++.h> using namespace std; long long n, ans; string str; long long solve() { cin >> n >> str; long long x = -1, y = -1; long long i = 0; while (i < n) { if (str[i] == 1 ) { x = i; break; } i++; } i = n - 1; while (i >= 0) { ... |
#include <bits/stdc++.h> using namespace std; const int MAXN = 100000 + 10; int a[MAXN], n; int main() { scanf( %d , &n); for (int i = 0; i < n; ++i) scanf( %d , a + i); if (a[n - 1] == 1) { puts( NO ); return 0; } if (n == 1 && a[0] == 0) { puts( YES n0 ); return 0; ... |
#include <bits/stdc++.h> using namespace std; int jie[2000050], i, ni[2000050], j, g[1000050], su[1000050], m; bool vis[1000050]; int qmi(int di, int zhi) { int ret = 1, x = di; while (zhi) { if (zhi & 1) ret = 1LL * ret * x % 1000000007; x = 1LL * x * x % 1000000007; zhi >>= 1; } ... |
#include <bits/stdc++.h> using namespace std; int main() { char a[100000]; int len, i, flag = 0, m; cin >> a; len = strlen(a); for (i = 0; i <= (len / 2); i++) { m = int(a[i]); if ((m == 65) || (m == 72) || (m == 73) || (m == 77) || (m == 79) || (m == 84) || (m == 85) || (m... |
#include <bits/stdc++.h> int main() { int n, i, j, cnt = 0, sum = 0, cost; scanf( %d %d , &n, &cost); int ara[n], ara2[100000]; for (i = 0; i < n; i++) { scanf( %d , &ara[i]); } std::sort(ara, ara + n); int x = 0, z = 0; for (i = 1; i <= cost; i++) { sum += i; cnt++; ... |
#include <bits/stdc++.h> using namespace std; #define REP(i,a,n) for(int i=(a); i<(int)(n); i++) #define rep(i,n) REP(i,0,n) #define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it) #define ALLOF(c) (c).begin(), (c).end() typedef long long ll; typedef unsigned long long ull; i... |
#include <bits/stdc++.h> using namespace std; long long N, M; struct MATRIX { int dim; long long MAT[100][100]; MATRIX(int N, int x = -1) { dim = N; for (int i = 0; i < dim; i++) for (int j = 0; j < dim; j++) { if (x != -1 && i == j) MAT[i][j] = x; e... |
#include <bits/stdc++.h> using namespace std; int n, k; map<int, int> mapa; int arr[400100]; int main() { scanf( %d %d , &n, &k); for (int i = 0; i < n; i++) scanf( %d , &arr[i]); long long res = 0; int ini = 0, fin = 0; int x, y; while (fin < n) { mapa[arr[fin]]++; x = map... |
#include <bits/stdc++.h> using namespace std; vector<unordered_set<long long>> v1(2e5), v2(2e5); void solve() { long long n, m; cin >> n >> m; for (auto i = 0; i < m; i++) { long long a, b; cin >> a >> b; a--; b--; v1[min(a, b)].insert(max(a, b)); } v2 = v1; l... |
#include <bits/stdc++.h> using namespace std; long long n, m, q; long long gcd(long long a, long long b) { if (a < b) swap(a, b); if (b == 0) return a; return gcd(b, a % b); } int main() { cin >> n >> m >> q; long long v = gcd(n, m); long long innersize = n / v; long long outersize... |
#include <bits/stdc++.h> #pragma optimize( Ofast ) using namespace std; using ll = long long int; using ull = unsigned long long int; using dd = double; using ldd = long double; using si = short int; using pii = pair<int, int>; using pll = pair<ll, ll>; int main() { ios_base::sync_with_stdio(0);... |
#include <bits/stdc++.h> using namespace std; int main() { int m = 0, k = 0, p = 0, i = 1; string s; cin >> s; int n, a[27]; cin >> n; for (i = 1; i < 27; i++) cin >> a[i], m = max(m, a[i]); for (i = 0; i < s.length(); i++) k += a[s[i] - 96] * (i + 1); while (n--) i++, p += i * m; ... |
#include <bits/stdc++.h> int v[1000005]; int main() { int i, j, k; int n, m, a, b; int f[1010]; while (~scanf( %d , &n)) { memset(v, 0, sizeof(v)); a = b = 0; for (i = 0; i < n; i++) { scanf( %d , &f[i]); v[f[i]]++; if (v[f[i]] > b) { a = f[i]; ... |
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; vector<string> S(26); for (auto ch : s) { S[ch - a ] += ch; if (S[ch - a ].size() == 100) { cout << S[ch - a ] << endl; return 0; } } int n = s.size(); int f[n + 1][n + 1];... |
#include <bits/stdc++.h> using namespace std; char buf[200010]; char a[200010]; int n, t; int l; int digp; set<int> s; int main() { scanf( %d%d , &n, &t); scanf( %s , buf); for (int i = n - 1; 0 <= i; --i) { if (buf[i] == . ) { digp = n - 1 - i; continue; } ... |
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; cout << k * (6 * n - 1) << endl; for (int i = 0; i < n; i++) { cout << (6 * i + 1) * k << << (6 * i + 2) * k << << (6 * i + 3) * k << << (6 * i + 5) * k << endl; } return 0; } ... |
#include <bits/stdc++.h> using namespace std; long long power(long long x, long long y, long long p) { long long res = 1; x = x % p; while (y > 0) { if (y & 1) { res = (res * x) % p; } y = y >> 1; x = (x * x) % p; } return res; } long long modInverse(long long... |
#include <bits/stdc++.h> const int N = 1000001; using namespace std; char sub[N], s[N], l[N]; int a[10]; int main() { scanf( %s , s); int i, j, len1, len2; len1 = strlen(s); for (i = 0; i < len1; i++) a[s[i] - 0 ]++; scanf( %s , sub); len2 = strlen(sub); for (i = 0; i < len2; i++)... |
#include <bits/stdc++.h> #pragma GCC optimize( unroll-loops ) using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); const int N = 40500; int h, lgn, n, t, r, x, y, a[N], dis[N], lp[N], dp[N][17]; vector<pair<int, int> > e1, e2; vector<int> g[N]; bool mark[N]; int lg... |
#include <bits/stdc++.h> using namespace std; const int MOD = (int)1e9 + 7; const int MAXK = 405; int dp[MAXK][2 * MAXK]; inline void mod(int &x) { if (x >= MOD) x -= MOD; } inline void add(int &x, int y) { x += y; mod(x); } int main() { int i, k; ios::sync_with_stdio(false); c... |
#include <bits/stdc++.h> using namespace std; const long long int N = 4e5 + 2, inf = 1e12 + 7; vector<pair<int, int> > vec[N]; pair<int, pair<int, int> > edg[N]; long long int n, dis[N], dis2[N], st[N], ed[N]; long long int T[2 * N], lzy[2 * N], tim; void dfs(int u, int pr) { st[u] = ++tim; for (a... |
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; void Anivia_kid() { long long n; cin >> n; long long res = 1 + 3 * n * (n + 1); cout << res << n ; return; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int q = 1; while (q-... |
#include <bits/stdc++.h> using namespace std; const int N = 100000; const int inf = (int)1e9 + 1; const long long big = (long long)1e18 + 1; const int P = 239; const int MOD = (int)1e9 + 7; const int MOD1 = (int)1e9 + 9; const double eps = 1e-9; const double pi = atan2(0, -1); const int ABC = 26; ... |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; string s; bool flag = false; cin >> s; stringstream ss(s); char arr[2 * n]; int min0 = 10; int max0 = 0; int min1 = 10; int max1 = 0; for (int i = 0; i < 2 * n; i++) { arr[i] = s.at(i); ... |
#include <bits/stdc++.h> using namespace std; void a15hx() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n, l, r, x; cin >> n >> l >> r >> x; long long diff[n]; for (long long i = 0; i < n; i++) { cin >> diff[i]; } long long ways = 0; for (long long... |
#include <bits/stdc++.h> using namespace std; template <typename T> inline T read(register T& t) { register T f = 1; register char ch = getchar(); t = 0; while (ch < 0 || ch > 9 ) { if (ch == - ) f = -f; ch = getchar(); } while (ch >= 0 && ch <= 9 ) t = t * 10 + ch - 0 ... |
#include <bits/stdc++.h> using namespace std; const int N = 2; const int MO = 1e9 + 7; const int K = 5e8 + 4; struct Matrix { int a[N][N]; Matrix(bool ident = 0) { for (int i = int(0); i <= int((N)-1); i++) for (int j = int(0); j <= int((N)-1); j++) a[i][j] = 0; if (ident) { ... |
#include <bits/stdc++.h> using namespace std; const int maxn = 200005; const long long inf = 1e15; long long dp[maxn], num[maxn], ans; vector<int> G[maxn]; void dfs(int u, int fa) { for (int i = 0; i < G[u].size(); i++) { int v = G[u][i]; if (v == fa) continue; dfs(v, u); num[u] ... |
#include <bits/stdc++.h> using namespace std; long long quickpow(long long a, long long n, long long m) { long long ans = 1; while (n) { if (n & 1) ans = (ans * a) % m; a = (a * a) % m; n >>= 1; } return ans; } bool is_prime(long long p) { if (p < 2) return false; for (... |
#include <bits/stdc++.h> using namespace std; void fre() { freopen( c://test//input.in , r , stdin); freopen( c://test//output.out , w , stdout); } template <class T1, class T2> inline void gmax(T1 &a, T2 b) { if (b > a) a = b; } template <class T1, class T2> inline void gmin(T1 &a, T2 b) ... |
#include <bits/stdc++.h> #pragma GCC optimize(3) using namespace std; const int Mod = 1e9 + 7; const int N = 3e5 + 100; const int INF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3f; inline long long dpow(long long a, long long b) { long long r = 1, t = a; while (b) { if (b & 1) r = ... |
#include <bits/stdc++.h> using namespace std; int n, k, a[1005][1005], d[1005][1005], ans, D[10005]; pair<int, int> b[100005]; int ch(int x, int y) { for (int i = 1; i <= k; i++) { if (d[i][y] > d[i][x]) return 0; } return 1; } int main() { cin >> n >> k; for (int i = 1; i <= k; i+... |
#include <bits/stdc++.h> using namespace std; int a[105]; int main() { int n, l, i, j, cnt, area, ans; scanf( %d%d , &n, &l); for (i = 1; i <= n; i++) scanf( %d , &a[i]); ans = 0; for (i = l; i <= 100; i++) { cnt = 0; for (j = 1; j <= n; j++) cnt += a[j] / i; area = cnt * i; ... |
#include <bits/stdc++.h> using namespace std; inline long long read() { register long long x = 0, f = 1; register char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) f = -1; c = getchar(); } while (c >= 0 && c <= 9 ) x = x * 10 + c - 48, c = getchar(); return x * f;... |
#include <bits/stdc++.h> using namespace std; int32_t main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long t = 1; long long arr[7] = {1, 2, 3, 1, 3, 2, 1}; while (t--) { long long a, b, c; cin >> a >> b >> c; long long full = min({a / 3, b / ... |
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; const long long mod = 1e9 + 7; const long long inf = 1e9 + 7; vector<vector<int> > g; vector<bool> used; int main() { int n, m; cin >> n >> m; g.resize(n); used.resize(n, false); for (int i = 0; i < m; ++i) { ... |
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; int fib(int n) { int b = 1; int c = 1; while (n--) { c = (c + b) % MOD; swap(b, c); } return c; } int main() { int n, m; cin >> n >> m; int a = fib(n); int b = fib(m); cout << (a + b - 1)... |
#include <bits/stdc++.h> void start(int *ST, int *END, int n, char *A) { int i, kol_vo = 0; for (i = n; i > 0; i--) { if (A[i] == A && END[0] == -1) { kol_vo++; END[0] = i; } if (A[i] == B && END[1] == -1) END[1] = i; kol_vo++; ; if (A[i] == C && END[2... |
#include <bits/stdc++.h> using namespace std; int a[10100], b[1010]; int main() { int n, m, c, ans; scanf( %d%d%d , &n, &m, &c); ans = (n + m + c) / 2; if (n + c >= ans && m + c >= ans) printf( %d n , ans * 2); else printf( %d n , min(n + c, m + c) * 2); } |
#include <bits/stdc++.h> using namespace std; int main() { int n, t; cin >> n >> t; if (t == 10) { if (n < 2) { cout << -1 n ; return 0; } cout << 1; for (int i = 0; i < n - 1; i++) cout << 0; cout << n ; return 0; } cout << t; for (int ... |
#include <bits/stdc++.h> using namespace std; inline int in() { int32_t x; scanf( %d , &x); return x; } inline long long lin() { long long x; scanf( %lld , &x); return x; } char ch[4000010]; inline string get() { scanf( %s , ch); return string(ch); } inline void read(in... |
#include <bits/stdc++.h> using namespace std; const double pi = acos(-1.0); bool getcell(vector<vector<bool>>& b, int i, int j) { if (i >= b.size() || j >= b[0].size() || i < 0 || j < 0) return false; return b[i][j]; } bool isPlus(vector<vector<bool>>& b, int i, int j) { return getcell(b, i + 1, j... |
#include <bits/stdc++.h> using namespace std; char str[200000 + 5]; long long f[200000 + 5]; struct node { int nxt[26]; int fa; long long len; } t[200000 + 10]; long long ans = 0; int last, tot; vector<int> g[200000 + 5]; void insrt(int x) { int nd = ++tot; f[nd] = 1; int p = l... |
#include <bits/stdc++.h> using namespace std; const long long int maximum_no = 1e18 + 1; string A, B, C, curr; long long int a, b, c, f[100005]; char solve(int n, long long int k) { if (n == 0) { if (k > f[0]) return . ; return curr[k - 1]; } if (k <= a) return A[k - 1]; if (k <= ... |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int len, k; cin >> len >> k; string s; cin >> s; sort(s.begin(), s.end()); if (s[0] != s[k - 1]) cout << s[k - 1] << endl; else { cout << s[k - 1]; ... |
#include <bits/stdc++.h> using namespace std; int main() { float i = 0; int e; double answer; cin >> i; for (int k = 0; k < i; k++) { cin >> e; answer += e; } cout << answer / i; } |
#include <bits/stdc++.h> using namespace std; const int N = 500005; int n, m[N], t[N]; struct People { int a, b, c, cnt; } p[N], ran[N]; int read() { int x = 0; char c = getchar(); while (!isdigit(c)) c = getchar(); while (isdigit(c)) x = x * 10 + c - 0 , c = getchar(); return x; ... |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC optimize( unroll-loops ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using uint8 = unsigned char; using uint16 = unsigned short int; using uint32 = unsigned int; using uint64 = unsigned long long; using ... |
#include <bits/stdc++.h> using namespace std; string str; string l; map<string, int> m; string Greedy_Solve() { string res = ; for (int i = 0; i < l.length(); i += 10) { str = l.substr(i, 10); res += m[str] + 0 ; } return res; } int main() { cin >> l; for (int i = 0;... |
#include <bits/stdc++.h> using namespace std; long long n, m, k; long long ans; int main() { cin >> n >> m >> k; if (k > n + m - 2) { cout << -1 << endl; return 0; } if (k > n - 1) { long long x = k; x -= (n - 1); ans = m / (x + 1); } else ans = n / (k + 1... |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; if (n % 2 == 0) { cout << 4 << << n - 4 << endl; } if (n % 2 == 1) { cout << 9 << << n - 9 << endl; } } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const double EPS = 0.000000001; const double PI = 3.141592653589793; const long long LLINF = 99999999999999999LL; const int MAX_N = 100005; const int MOD = 1000000007; int N, M, n, cnt, ans; vector<int> v[MAX_N], w[MAX_N], SCC[M... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.