func_code_string stringlengths 59 71.4k |
|---|
#include <bits/stdc++.h> using namespace std; int a[111111], b[111111], n, m, k; int main() { while (scanf( %d%d%d , &n, &m, &k) != EOF) { for (int i = 1; i <= n; i++) scanf( %d , &a[i]); for (int i = 1; i <= m; i++) scanf( %d , &b[i]); sort(a + 1, a + 1 + n); sort(b + 1, b + 1 + m); bool yes = 0; for (int i = 0; i <= max(n, m); i++) { if (n - i < 1 || m - i < 1) break; if (a[n - i] > b[m - i]) { yes = 1; printf( YES n ); break; } } if (yes) continue; if (n > m) printf( YES n ); else printf( NO n ); } } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { string s; cin >> s; if (s.size() % 2) cout << NO n ; else { string word1 = , word2 = ; for (int i = 0; i < s.size() / 2; i++) word1 += s[i]; for (int i = s.size() / 2; i < s.size(); i++) word2 += s[i]; if (word1 == word2) cout << YES n ; else cout << NO n ; } } } |
#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); const int MOD = 100, MAX = 1e6 + 5; const long long INF = 1e18 + 5; int main() { string s; cin >> s; long long n = (s[1] - 0 ) + (s[3] - 0 ) * 10 + (s[4] - 0 ) * 100 + (s[2] - 0 ) * 1000 + (s[0] - 0 ) * 10000; long long Ans = 1; for (int i = 0; i < 5; i++) { Ans = (Ans * n) % 100000; } string x = to_string(Ans); reverse(x.begin(), x.end()); while (x.size() != 5) { x += 0 ; } reverse(x.begin(), x.end()); cout << x << endl; } |
#include <bits/stdc++.h> using namespace std; const long long M = 1e10; set<long long> s; void bt(long long x) { if (x >= M) return; s.insert(x); bt(x * 10 + 4); bt(x * 10 + 7); } int main() { bt(0); int l, r; cin >> l >> r; long long c = 0; for (set<long long>::iterator it = s.begin(); it != s.end(); it++) { if (*it >= l) { if (r <= *it) { c += (r - l + 1) * *it; break; } else c += (*it - l + 1) * *it; l = *it + 1; } } cout << c << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX = 2e5 + 5; int n; pair<int, int> a[MAX]; struct par { int a, b; par(int a, int b) : a(a), b(b) {} bool operator<(const par &p) const { return b < p.b; } }; multiset<par> s; multiset<int> sizes; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &a[i].first); a[i].second = i; } sort(a + 1, a + n + 1); int best = 1, opt = a[n].first + 1; for (int i = 1; i <= n; i++) { if (!sizes.empty()) { auto x = sizes.begin(); auto y = sizes.rbegin(); int v = a[i - 1].first + 1; if (*x == *y) { if ((int)sizes.size() > best) { best = sizes.size(); opt = v; } else if ((int)sizes.size() == best && a[i].first < opt) opt = v; } } auto u = s.upper_bound(par(0, a[i].second)); par intervalo = par(a[i].second, a[i].second); vector<par> del; if (u != s.end()) { auto o = *u; if (o.a - 1 == a[i].second) { del.push_back(o); intervalo.b = o.b; } } if (u != s.begin()) { u--; auto o = *u; if (o.b + 1 == a[i].second) { del.push_back(o); intervalo.a = o.a; } } for (auto o : del) { s.erase(s.find(o)); int sz = o.b - o.a + 1; sizes.erase(sizes.find(sz)); } s.insert(intervalo); sizes.insert(intervalo.b - intervalo.a + 1); } printf( %d n , opt); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, h; int main() { cin >> n >> h; for (int i = 1; i < n; i++) { double h1 = h * sqrt(1.0 * i / n); printf( %.12llf , h1); } return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> void dbs(string str, T t) { cerr << str << : << t << n ; } template <class T, class... S> void dbs(string str, T t, S... s) { long long idx = str.find( , ); cerr << str.substr(0, idx) << : << t << , ; dbs(str.substr(idx + 1), s...); } template <class S, class T> ostream& operator<<(ostream& os, const pair<S, T>& p) { return os << ( << p.first << , << p.second << ) ; } template <class T> ostream& operator<<(ostream& os, const vector<T>& p) { os << [ ; for (auto& it : p) os << it << ; return os << ] ; } template <class T> ostream& operator<<(ostream& os, const set<T>& p) { os << [ ; for (auto& it : p) os << it << ; return os << ] ; } template <class S, class T> ostream& operator<<(ostream& os, const map<S, T>& p) { os << [ ; for (auto& it : p) os << it << ; return os << ] ; } template <class T> void prc(T a, T b) { cerr << [ ; for (T i = a; i != b; ++i) { if (i != a) cerr << , ; cerr << *i; } cerr << ] n ; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long t, i, j, k, n, m, q; long long x, y, l, r; string s; long long len; cin >> len; cin >> s; vector<long long> pos(len + 7, -1); long long cur = 1; for (i = 0; i < len; i++) { if (s[i] == 8 ) { pos[cur++] = i; } } long long moves = (len - 11) / 2; cur = min(cur - 1, moves); dbs( cur, pos[cur], pos[cur + 1] , cur, pos[cur], pos[cur + 1]); if (pos[cur + 1] == -1 || pos[cur + 1] - (cur) > moves) { cout << NO << endl; } else { cout << YES << endl; } return 0; } |
#include <bits/stdc++.h> namespace chtholly { char buf[1 << 23], *p1 = buf, *p2 = buf; inline int read() { int x = 0, f = 1; char c = getchar(); for (; !isdigit(c); c = getchar()) f ^= c == - ; for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + (c ^ 0 ); return f ? x : -x; } template <typename mitsuha> inline bool read(mitsuha &x) { x = 0; int f = 1; char c = getchar(); for (; !isdigit(c) && ~c; c = getchar()) f ^= c == - ; if (!~c) return 0; for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + (c ^ 0 ); return x = f ? x : -x, 1; } template <typename mitsuha> inline int write(mitsuha x) { if (!x) return 0 & putchar(48); if (x < 0) putchar( - ), x = -x; int bit[20], i, p = 0; for (; x; x /= 10) bit[++p] = x % 10; for (i = p; i; --i) putchar(bit[i] + 48); return 0; } inline char fuhao() { char c = getchar(); for (; isspace(c); c = getchar()) ; return c; } } // namespace chtholly using namespace chtholly; using namespace std; const int yuzu = 2e5; typedef int fuko[yuzu | 10]; vector<int> lj[yuzu | 10]; fuko a; int zxy; int dfs(int u, int lxy, int fa = 0) { if (a[u] % lxy) return 0; for (; a[u] % lxy == 0; a[u] /= lxy) ; vector<int> v; for (int i : lj[u]) if (i ^ fa) v.push_back(dfs(i, lxy, u)); sort(v.begin(), v.end(), greater<int>()); int llx = 1; if (v.size()) llx += v[0]; if (v.size() > 1) zxy = max(zxy, llx + v[1]); return zxy = max(zxy, llx), llx; } int main() { int i, j, n = read(), u, v; for (i = 1; i <= n; ++i) a[i] = read(); for (i = 1; i < n; ++i) { read(u), read(v); lj[u].push_back(v); lj[v].push_back(u); } for (i = 1; i <= n; ++i) { for (j = 2; j * j <= a[i]; ++j) if (a[i] % j == 0) dfs(i, j); if (a[i] > 1) dfs(i, a[i]); } write(zxy), puts( ); } |
#include <bits/stdc++.h> using namespace std; int main() { int T; cin >> T; while (T--) { long long a, b, c, d; cin >> a >> b >> c >> d; if (c <= d) { if (a <= b * c) cout << a << endl; else { cout << -1 << endl; } } else { long long len = c % d ? c / d + 1 : c / d; long long ans = 0; long long x = (b * d + 2 * a) / 2 / b / d; x = min(x, len); ans = a * x - x * (x - 1) / 2 * b * d; x++; x = min(x, len); ans = max(ans, a * x - x * (x - 1) / 2 * b * d); if (a > b * c) cout << -1 << endl; else { ans = max(ans, a * len - (len - 1) * len / 2 * d * b); cout << ans << endl; } } } } |
#include <bits/stdc++.h> using namespace std; int main() { int n; int flag = 0; scanf( %d , &n); for (int i = 0; i < n; i++) { int num, num1; string str; cin >> str >> num >> num1; if (num >= 2400 && (num1 - num) > 0) { flag = 1; break; } } if (flag) cout << YES n ; else cout << NO n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int limite = 100005; pair<int, int> maximo[limite]; void inserta(int pos, int val) { pair<int, int> valor(val, pos); for (; pos < limite; pos += pos & -pos) maximo[pos] = max(maximo[pos], valor); } int computamaximo(int pos) { pair<int, int> maxi(0, 0); for (; pos > 0; pos -= pos & -pos) maxi = max(maxi, maximo[pos]); return maxi.second; } int n; int a[limite]; long long int sr[limite]; long long int sol = 0; int main() { ios::sync_with_stdio(false); cin >> n; for (int i = 1; i < n; i++) cin >> a[i]; for (int i = n - 1; i >= 1; i--) { if (a[i] == n) sr[i] = n - i; else { int jmin = computamaximo(a[i]); sr[i] = a[i] - i + sr[jmin] - (a[i] - jmin) + (n - a[i]); } sol += sr[i]; inserta(i, a[i]); } cout << sol << endl; } |
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; const long long inf = 1e9; const int MAXM = 1048800; const int MAXN = 1e7 + 1; bool visit[MAXM]; int a[MAXM]; int k; vector<int> v; int main() { int n, i, j, k; cin >> n; n *= 2; for (int i = 0; i < n; i++) { cin >> a[i]; } int ans = INT_MAX, cnt = 0; sort(a, a + n); for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { v.clear(); cnt = 0; for (int k = 0; k < n; k++) { if (k == i or k == j) continue; v.push_back(a[k]); } int nn = v.size(); for (int k = 0; k < nn; k += 2) { cnt += v[k + 1] - v[k]; } ans = min(ans, cnt); } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n; cin >> n; vector<pair<string, int>> v; priority_queue<int, vector<int>, greater<int>> pq; for (int i = 0; i < n; ++i) { string s; cin >> s; int x; if (s != removeMin ) { cin >> x; v.push_back({s, x}); } else v.push_back({s, INT_MIN}); } vector<pair<string, int>> ans; for (int i = 0; i < n; ++i) { if (v[i].first == insert ) ans.push_back({v[i].first, v[i].second}), pq.push(v[i].second); else if (v[i].first == getMin ) { int val = v[i].second; if (pq.empty()) { ans.push_back({ insert , val}); pq.push(val); } while (!pq.empty() && val > pq.top()) { ans.push_back({ removeMin , INT_MIN}); pq.pop(); } if (!pq.empty() && val < pq.top()) { ans.push_back({ insert , val}); pq.push(val); } else if (pq.empty()) { ans.push_back({ insert , val}); pq.push(val); } ans.push_back({ getMin , val}); } else { if (pq.empty()) { ans.push_back({ insert , 0}); pq.push(0); } ans.push_back({ removeMin , INT_MIN}); pq.pop(); } } cout << ans.size() << endl; for (int i = 0; i < ans.size(); ++i) { if (ans[i].first == removeMin ) cout << ans[i].first << endl; else cout << ans[i].first << << ans[i].second << endl; } } |
#include <bits/stdc++.h> using namespace std; vector<int> parent; vector<int> Rank; vector<int> Count; int root(int v) { if (parent[v] == v) return v; return parent[v] = root(parent[v]); } bool DSU(int a, int b) { a = root(a); b = root(b); if (a != b) { if (Rank[b] > Rank[a]) swap(a, b); Rank[a] += Rank[b]; Count[a] += Count[b]; parent[b] = a; return true; } return false; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, m, k; cin >> n >> m >> k; vector<pair<long long int, pair<int, int> > > Edges(m); parent.resize(n + 1); for (int i = 1; i <= n; i++) parent[i] = i; Rank.resize(n + 1, 1); Count.resize(n + 1, 0); for (int i = 0; i < k; i++) { int a; cin >> a; Count[a] = 1; } for (int i = 0; i < m; i++) { int a, b; long long int w; cin >> a >> b >> w; Edges[i] = make_pair(w, make_pair(a, b)); } sort(Edges.begin(), Edges.end()); long long int last = -1; for (int i = 0; i < m; i++) { int a = Edges[i].second.first; int b = Edges[i].second.second; long long int w = Edges[i].first; if (a != b) { DSU(a, b); if (last == -1 && Count[root(a)] == k) { last = w; } } } for (int i = 0; i < k; i++) { cout << last << ; } return 0; } |
#include <bits/stdc++.h> struct { inline operator int() { int x; return scanf( %d , &x), x; } inline operator long long() { long long x; return scanf( %lld , &x), x; } template <class T> inline void operator()(T &x) { x = *this; } template <class T, class... A> inline void operator()(T &x, A &...a) { x = *this; this->operator()(a...); } } read; const int maxn = 120005; long long his[maxn << 2]; int min[maxn << 2], tot[maxn << 2], mot[maxn << 2], pat[maxn << 2]; void modi(int now, int x) { min[now] += x; mot[now] += x; } void pass(int now, int x) { his[now] += 1ll * tot[now] * x; pat[now] += x; } void push(int now) { if (mot[now]) { modi((now << 1), mot[now]); modi((now << 1 | 1), mot[now]); mot[now] = 0; } if (pat[now]) { if (min[(now << 1)] == min[now]) pass((now << 1), pat[now]); if (min[(now << 1 | 1)] == min[now]) pass((now << 1 | 1), pat[now]); pat[now] = 0; } } void modify(int now, int L, int R, int l, int r, int x) { if (r < L or l > R) return; if (l <= L and R <= r) return modi(now, x); push(now); int M = (L + R) >> 1; modify((now << 1), L, M, l, r, x); modify((now << 1 | 1), M + 1, R, l, r, x); his[now] = his[(now << 1)] + his[(now << 1 | 1)]; min[now] = std::min(min[(now << 1)], min[(now << 1 | 1)]); tot[now] = 0; if (min[(now << 1)] == min[now]) tot[now] += tot[(now << 1)]; if (min[(now << 1 | 1)] == min[now]) tot[now] += tot[(now << 1 | 1)]; } long long query(int now, int L, int R, int l, int r) { if (r < L or l > R) return 0; if (l <= L and R <= r) return his[now]; push(now); int M = (L + R) >> 1; return query((now << 1), L, M, l, r) + query((now << 1 | 1), M + 1, R, l, r); } void build(int now, int L, int R) { min[now] = L; tot[now] = 1; if (L == R) return; int M = (L + R) >> 1; build((now << 1), L, M); build((now << 1 | 1), M + 1, R); } void test(int now, int L, int R) { if (L == R) { fprintf(stderr, %d , min[now]); return; } push(now); int M = (L + R) >> 1; test((now << 1), L, M); test((now << 1 | 1), M + 1, R); if (now == 1) fprintf(stderr, n ); } int a[maxn]; long long ans[maxn]; int st1[maxn], sp1; int st2[maxn], sp2; std::vector<std::pair<int, int> > v[maxn]; int main() { int n = read; for (int i = 1; i <= n; i++) read(a[i]); int q = read; for (int i = 1; i <= q; i++) { int l = read, r = read; v[r].push_back(std::pair<int, int>(l, i)); } build(1, 1, n); for (int r = 1; r <= n; r++) { while (sp2 and a[st2[sp2]] > a[r]) modify(1, 1, n, st2[sp2 - 1] + 1, st2[sp2], a[st2[sp2]]), --sp2; st2[++sp2] = r; modify(1, 1, n, st2[sp2 - 1] + 1, st2[sp2], -a[st2[sp2]]); while (sp1 and a[st1[sp1]] < a[r]) modify(1, 1, n, st1[sp1 - 1] + 1, st1[sp1], -a[st1[sp1]]), --sp1; st1[++sp1] = r; modify(1, 1, n, st1[sp1 - 1] + 1, st1[sp1], a[st1[sp1]]); modi(1, -1); pass(1, 1); for (std::pair<int, int> p : v[r]) ans[p.second] = query(1, 1, n, p.first, r); } for (int i = 1; i <= q; i++) printf( %lld n , ans[i]); } |
#include <bits/stdc++.h> using namespace std; int n, a[26]; char pal[111111]; inline bool is_pal(int k, int can) { vector<int> odd(0); for (int i = 0; i < n; ++i) { if (a[i] % k) return 0; if (a[i] % (2 * k)) odd.push_back(i); } if ((int)(odd).size() > 1) return 0; if ((int)(odd).size() == 1 && !can) return 0; int pos = 0; for (int i = 0; i < n; ++i) { for (int j = 0; j < a[i] / (2 * k); ++j) { pal[pos++] = a + i; } } if ((int)(odd).size()) pal[pos++] = a + odd[0]; for (int i = n - 1; i >= 0; --i) { for (int j = 0; j < a[i] / (2 * k); ++j) { pal[pos++] = a + i; } } pal[pos] = 0; return 1; } inline void die(int ans, int reps, char middle) { printf( %d n , ans); for (int i = 0; i < reps; ++i) { printf( %s , pal); if (middle != ! ) printf( %c , middle); } printf( n ); exit(0); } int main() { scanf( %d , &n); for (int i = 0; i < n; ++i) { scanf( %d , &a[i]); } for (int ans = 111111; ans > 1; --ans) { if (ans % 2 == 1) { for (int let = 0; let < n; ++let) { if (a[let] >= ans) { a[let] -= ans; if (is_pal(ans, 0)) { die(ans, ans, a + let); } a[let] += ans; } } } else { for (int let = 0; let < n; ++let) { if (is_pal(ans / 2, 0)) { die(ans, ans / 2, ! ); } } } } if (is_pal(1, 1)) { die(1, 1, ! ); } printf( 0 n ); for (int i = 0; i < n; ++i) { for (int j = 0; j < a[i]; ++j) { printf( %c , a + i); } } printf( n ); } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k; scanf( %d %d , &n, &k); char c[200005]; scanf( %s , c); int ok[26]; memset(ok, 0, sizeof(ok)); for (int i = 0; i < k; i++) { char cc; scanf( %c , &cc); ok[cc - a ] = 1; } long long cnt = 0; long long ans = 0; for (int i = 0; c[i] != 0; i++) { if (ok[c[i] - a ]) cnt++; else { ans += cnt * (cnt + 1) / 2; cnt = 0; } } ans += cnt * (cnt + 1) / 2; printf( %lld n , ans); } |
#include <bits/stdc++.h> using namespace std; string s, t; int l[200005], r[200005]; int dp[30][200005]; void gd() { cout << No ; exit(0); } bool check(int lr, int rl, int c) { return ((lr ? dp[c][lr - 1] : 0) - (rl ? dp[c][rl - 1] : 0) > 0); } int main() { ios_base::sync_with_stdio(0); cin >> s >> t; s = * + s; int n = (int)s.size(); int m = (int)t.size(); for (int i = 1; i < n; ++i) { l[i] = l[i - 1]; if (s[i] == t[l[i]]) ++l[i]; } for (int i = n - 1; i; --i) { r[i] = r[i + 1]; if (s[i] == t[m - 1 - r[i]]) ++r[i]; } if (l[n - 1] != m || r[1] != m) gd(); for (int i = 0; i < 26; ++i) for (int j = 0; j < m; ++j) { char c = i + a ; dp[i][j] = (j ? dp[i][j - 1] : 0) + (t[j] == c); } for (int i = 1; i < n; ++i) { int rg = m - r[i]; int lg = l[i]; if (rg > lg || !check(lg, rg, s[i] - a )) gd(); } cout << Yes ; return 0; } |
#include <bits/stdc++.h> using namespace std; int N, M, K; int color[200002]; vector<int> edge[200002]; int id[200002]; int ite = 1; int siz[200002]; map<int, int> m[200002]; int ans; void dfs(int a) { if (id[a]) { return; } id[a] = ite; for (int i = 0; i < edge[a].size(); i++) { dfs(edge[a][i]); } } int32_t main() { ios_base::sync_with_stdio(false); if (fopen( cf731c.in , r )) { freopen( cf731c.in , r , stdin); freopen( cf731c.out , w , stdout); } cin >> N >> M >> K; for (int i = 0; i < N; i++) { cin >> color[i]; } for (int i = 0; i < M; i++) { int a, b; cin >> a >> b; a--; b--; edge[a].push_back(b); edge[b].push_back(a); } for (int i = 0; i < N; i++) { if (id[i] == 0) { dfs(i); ite++; } } for (int i = 0; i < N; i++) { siz[id[i]]++; m[id[i]][color[i]]++; } for (int i = 1; i < ite; i++) { int mx = -1; for (auto it = m[i].begin(); it != m[i].end(); it++) { mx = max(mx, it->second); } ans += (siz[i] - mx); } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; template <class A, class B> ostream &operator<<(ostream &out, const pair<A, B> &a) { return out << ( << a.first << , << a.second << ) ; } template <class A> ostream &operator<<(ostream &out, const vector<A> &a) { for (const A &it : a) out << it << ; return out; } template <class A, class B> istream &operator>>(istream &in, pair<A, B> &a) { return in >> a.first >> a.second; } template <class A> istream &operator>>(istream &in, vector<A> &a) { for (A &i : a) in >> i; return in; } ifstream cinn( in.txt ); ofstream coutt( out.txt ); int poww(const int &a, int b, const int &m = (1000000007)) { if (b == 0) return 1; int x = poww(a, b / 2, m); x = x * x % m; if (b & 1) x = x * a % m; return x; } int ceil(const int &a, const int &b) { return (a - 1) / b + 1; } int primes[5000005]; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); for (int i = 2; i < 5000005; i++) { if (primes[i]) continue; for (int j = i; j < 5000005; j += i) { int in = j; while (in % i == 0) { in /= i; primes[j]++; } } } for (int i = 1; i < 5000005; i++) primes[i] += primes[i - 1]; int t; cin >> t; while (t--) { int a, b; cin >> a >> b; cout << primes[a] - primes[b] << n ; } } |
#include <bits/stdc++.h> using namespace std; string s; const int MAXN = 100005; int tz[4 * MAXN], tx[4 * MAXN], ty[4 * MAXN]; int cntz(int v, int tl, int tr, int l, int r) { if (l > r) return 0; if (tl == l && r == tr) return tz[v]; int tm = (tl + tr) / 2; return cntz(2 * v, tl, tm, l, min(tm, r)) + cntz(2 * v + 1, tm + 1, tr, max(tm + 1, l), r); } int cnty(int v, int tl, int tr, int l, int r) { if (l > r) return 0; if (tl == l && r == tr) return ty[v]; int tm = (tl + tr) / 2; return cnty(2 * v, tl, tm, l, min(tm, r)) + cnty(2 * v + 1, tm + 1, tr, max(tm + 1, l), r); } int cntx(int v, int tl, int tr, int l, int r) { if (l > r) return 0; if (tl == l && r == tr) return tx[v]; int tm = (tl + tr) / 2; return cntx(2 * v, tl, tm, l, min(tm, r)) + cntx(2 * v + 1, tm + 1, tr, max(tm + 1, l), r); } void buildz(int v, int tl, int tr) { if (tl == tr) tz[v] = (s[tl] == z ); else { int tm = (tl + tr) / 2; buildz(2 * v, tl, tm); buildz(2 * v + 1, tm + 1, tr); tz[v] = tz[2 * v] + tz[2 * v + 1]; } } void buildy(int v, int tl, int tr) { if (tl == tr) ty[v] = (s[tl] == y ); else { int tm = (tl + tr) / 2; buildy(2 * v, tl, tm); buildy(2 * v + 1, tm + 1, tr); ty[v] = ty[2 * v] + ty[2 * v + 1]; } } void buildx(int v, int tl, int tr) { if (tl == tr) tx[v] = (s[tl] == x ); else { int tm = (tl + tr) / 2; buildx(2 * v, tl, tm); buildx(2 * v + 1, tm + 1, tr); tx[v] = tx[2 * v] + tx[2 * v + 1]; } } int main() { cin >> s; int n, l = s.length(); buildz(1, 0, l - 1); buildy(1, 0, l - 1); buildx(1, 0, l - 1); cin >> n; for (int i = 0, a, b; i < n; ++i) { cin >> a >> b; int z = cntz(1, 0, l - 1, a - 1, b - 1); int y = cnty(1, 0, l - 1, a - 1, b - 1); int x = cntx(1, 0, l - 1, a - 1, b - 1); int t = min(x, min(y, z)); z -= t; y -= t; x -= t; if (b - a + 1 <= 2 || (z <= 1 && x <= 1 && y <= 1)) cout << YES n ; else cout << NO n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; int m; cin >> n >> m; int c[m], a[n]; int i, j, k; for (i = 0; i < n; i++) { a[i] = 0; } for (i = 0; i < m; i++) { cin >> c[i]; a[c[i] - 1]++; } k = a[0]; for (i = 0; i < n; i++) { if (k > a[i]) { k = a[i]; } } cout << k; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long inf = 1e18; const long long mod = 1e9 + 7; const long long N = 222; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); long long n, k; vector<long long> adj[N]; long long dp[N][N], dp2[N][N], a[N]; void input() { cin >> n >> k; k++; for (long long i = (1); i <= (n); i++) cin >> a[i]; for (long long i = (1); i <= (n - 1); i++) { long long x, y; cin >> x >> y; ; adj[x].push_back(y); adj[y].push_back(x); } } void dfs(long long cur = 1, long long prev = 0) { for (long long i : adj[cur]) if (i != prev) dfs(i, cur); for (long long p = (k); p >= (0); p--) { if (p >= (k + 1) / 2) { long long mx = -inf; for (long long i : adj[cur]) if (i != prev) { dp2[cur][p] += dp2[i][p - 1]; mx = max(mx, dp[i][p - 1] - dp2[i][p - 1]); } dp[cur][p] = dp2[cur][p] + mx; } else { long long mx = -inf; if (!p) mx = a[cur]; for (long long i : adj[cur]) if (i != prev) { dp[cur][p] += dp2[i][(k - p) - 1]; if (p) mx = max(mx, dp[i][p - 1] - dp2[i][(k - p) - 1]); } dp[cur][p] += mx; dp2[cur][p] = max(dp[cur][p], dp2[cur][p + 1]); } } } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); input(); dfs(); cout << dp2[1][0]; } |
#include <bits/stdc++.h> using namespace std; struct fenwick { long long n, fen[100005]; void resize(int _n) { n = _n + 1; memset(fen, 0, sizeof fen); } int query(int ind) { ind++; int ans = 0; while (ind >= 1) { ans += fen[ind]; ind -= ind & -ind; } return ans; } void update(int ind, int val) { ind++; while (ind <= n) { fen[ind] += val; ind += ind & -ind; } } int query(int l, int r) { return query(r) - query(l - 1); } }; const int maxn = 100001; int n, l, w, x, y, sz[maxn]; long long res; bool blocked[maxn]; vector<pair<int, int> > c, v[maxn]; fenwick tree; void dfs(int node, int pnode, int curw, int curl) { c.push_back(make_pair(curw, curl)); for (auto &i : v[node]) if (i.first != pnode && !blocked[i.first]) dfs(i.first, node, curw + i.second, curl + 1); } long long solve(int node, int curw, int curl) { long long ret = 0; c.clear(); dfs(node, 0, curw, curl); sort(c.begin(), c.end()); for (auto &i : c) tree.update(i.second, 1); for (int i = 0, j = c.size() - 1; i < c.size(); i++) { while (i <= j && c[i].first + c[j].first > w) tree.update(c[j--].second, -1); if (j < i) break; tree.update(c[i].second, -1); ret += tree.query(l - c[i].second); } return ret; } int dfsz(int node, int pnode) { sz[node] = 1; for (auto &i : v[node]) if (i.first != pnode && !blocked[i.first]) sz[node] += dfsz(i.first, node); return sz[node]; } int find(int node, int pnode, int n) { for (auto &i : v[node]) if (i.first != pnode && !blocked[i.first] && 2 * sz[i.first] > n) return find(i.first, node, n); return node; } void decompose(int node) { int centroid = find(node, 0, dfsz(node, 0)); blocked[centroid] = 1; res += solve(centroid, 0, 0); for (auto &i : v[centroid]) if (!blocked[i.first]) res -= solve(i.first, i.second, 1), decompose(i.first); } int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); cin >> n >> l >> w; tree.resize(n + 1); for (int i = 2; i <= n && cin >> x >> y; i++) { v[i].push_back(make_pair(x, y)); v[x].push_back(make_pair(i, y)); } decompose(1); cout << res << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX_N = 1e6 + 5; int arr[MAX_N]; int vis[MAX_N]; void solve() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &arr[i]); vis[i] = 0; } vector<int> stk; for (int i = 1; true; i = i - arr[i]) { if (vis[i]) { vector<int> ans; for (int j = stk.size() - 1; j >= 0; j--) { ans.push_back(stk[j]); if (stk[j] == i) break; } printf( %d n , (int)ans.size()); for (int u : ans) { printf( %d , u); } printf( n ); return; } else { vis[i] = 1; stk.push_back(i); } } } int main() { int testc; scanf( %d , &testc); for (int i = 0; i < testc; i++) { solve(); } } |
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } int main() { long long n; cin >> n; set<long long> st; for (long long i = 1; i * i <= n; i++) { if (n % i == 0) { long long a = n / gcd(n, i); st.insert(((a * (a - 1)) / 2) * (n / a) + a); long long m = (n / i); long long b = n / gcd(n, m); st.insert(((b * (b - 1)) / 2) * (n / b) + b); } } for (auto e : st) cout << e << ; return 0; } |
#include <bits/stdc++.h> int mat[500][500]; int N, K; int main() { scanf( %d%d , &N, &K); int Cnt = 1; int sum = 0; for (int i = 0; i < N; i++) { for (int j = 0; j < K - 1; j++) { mat[i][j] = Cnt++; } } for (int i = 0; i < N; i++) { for (int j = K - 1; j < N; j++) { mat[i][j] = Cnt++; } } for (int i = 0; i < N; i++) { sum += mat[i][K - 1]; } printf( %d n , sum); for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { printf( %d , mat[i][j]); } printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 100010; bool visited[2][maxn]; int d[2][maxn]; string s[2]; int main() { int n, k; cin >> n >> k; cin >> s[0] >> s[1]; int dx[3] = {0, 0, 1}; int dy[3] = {1, -1, k}; queue<pair<bool, int>> q; q.push(make_pair(0, 0)); visited[0][0] = 1; while (q.size()) { pair<bool, int> k = q.front(); q.pop(); bool x = k.first; int y = k.second; for (int i = 0; i < 3; i++) { bool xx = x ^ dx[i]; int yy = y + dy[i]; if (yy >= n) { cout << YES << endl; exit(0); } if (yy >= 0 && s[xx][yy] == - && !visited[xx][yy] && yy > d[x][y]) { q.push(make_pair(xx, yy)); visited[xx][yy] = 1; d[xx][yy] = d[x][y] + 1; } } } cout << NO << endl; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:102400000,102400000 ) using namespace std; unordered_set<int> dict; int main() { long long a, b, x; cin >> x >> a >> b; if (a % x != 0) { a += x - (a % x + x) % x; } if (a > b) { cout << 0 << endl; } else { cout << (b - a + x) / x << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; void solve() { int a, b, n; cin >> n >> a >> b; vector<int> A(n); for (int &x : A) cin >> x; sort(A.begin(), A.end()); if (A[b] - A[b - 1] == 0) { cout << 0 n ; return; } cout << A[b] - A[b - 1] << n ; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); solve(); } |
#include <bits/stdc++.h> using namespace std; inline int read() { register int x = 0, t = 1; register char ch = getchar(); while ((ch < 0 || ch > 9 ) && ch != - ) ch = getchar(); if (ch == - ) t = -1, ch = getchar(); while (ch <= 9 && ch >= 0 ) x = x * 10 + ch - 48, ch = getchar(); return x * t; } int n, m, top, first[301000], dep[301000]; struct mona { int nxt, en; } s[301000 << 1]; inline void Insert(int x, int y) { s[++top] = (mona){first[x], y}, first[x] = top; } inline void Dfs(int k, int fa) { dep[k] = dep[fa] + 1; for (register int i = first[k]; i; i = s[i].nxt) { int en = s[i].en; if (en == fa) continue; Dfs(en, k); } return; } int cnt, rt[301000], Min[301000], ls[301000], rs[301000]; pair<long long, int> val[301000]; long long lz[301000], ans; inline int New(pair<long long, int> x) { int t = ++cnt; val[t] = x, Min[t] = 1; return t; } inline void Pushlz(int x, long long w) { val[x].first += w, lz[x] += w; } inline void Pushdown(int x) { if (!lz[x]) return; if (ls[x]) Pushlz(ls[x], lz[x]); if (rs[x]) Pushlz(rs[x], lz[x]); lz[x] = 0; } inline int Merge(int u, int v) { if (!u || !v) return u | v; int t; if (val[u] < val[v]) Pushdown(u), rs[u] = Merge(rs[u], v), t = u; else Pushdown(v), rs[v] = Merge(u, rs[v]), t = v; if (Min[ls[t]] < Min[rs[t]]) swap(ls[t], rs[t]); Min[t] = Min[rs[t]] + 1; return t; } inline void Dfs2(int k, int fa) { for (register int i = first[k]; i; i = s[i].nxt) { int en = s[i].en; if (en == fa) continue; Dfs2(en, k), rt[k] = Merge(rt[k], rt[en]); } while (rt[k] && val[rt[k]].second >= dep[k]) rt[k] = Merge(ls[rt[k]], rs[rt[k]]); if (!rt[k] && k != 1) puts( -1 ), exit(0); ans += val[rt[k]].first, Pushlz(rt[k], -val[rt[k]].first); } int main() { n = read(), m = read(); for (register int i = 1; i < n; ++i) { int x = read(), y = read(); Insert(x, y), Insert(y, x); } Dfs(1, 0); for (register int i = 1; i <= m; ++i) { int x = read(), y = read(); long long w = read(); if (dep[x] < dep[y]) swap(x, y); rt[x] = Merge(rt[x], New(make_pair(w, dep[y]))); } Dfs2(1, 0), printf( %lld n , ans); } |
#include <bits/stdc++.h> using namespace std; int main() { int n, x; while (cin >> n) { x = n - 10; if (x <= 0 || x > 11) cout << 0 << endl; else if (x == 10) cout << 15 << endl; else cout << 4 << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, u, r; int a[35]; int b[35]; int k[35]; int p[35]; int op[35]; int tmpa[35]; int tmmmma[35]; long long dfs(int index, const int ta[]) { if (index == u) { long long res = 0; for (int i = (0); i < ((n)); ++i) res += (long long)ta[i] * k[i]; return res; } int tta[35]; long long res = -(((long long)1) << 62); if (index == 0 || op[index - 1] != 0) { op[index] = 0; for (int i = (0); i < ((n)); ++i) tta[i] = ta[i] ^ b[i]; res = max(res, dfs(index + 1, tta)); } op[index] = 1; for (int i = (0); i < ((n)); ++i) tta[i] = ta[p[i]] + r; res = max(res, dfs(index + 1, tta)); if ((u - index) % 2 == 0) { long long tmp = 0; for (int i = (0); i < ((n)); ++i) tmp += (long long)ta[i] * k[i]; res = max(res, tmp); } return res; } int main(void) { cin >> n >> u >> r; for (int i = (0); i < ((n)); ++i) cin >> a[i]; for (int i = (0); i < ((n)); ++i) cin >> b[i]; for (int i = (0); i < ((n)); ++i) cin >> k[i]; for (int i = (0); i < ((n)); ++i) cin >> p[i]; for (int i = (0); i < ((n)); ++i) --p[i]; cout << dfs(0, a) << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n, sx, sy, x, y; cin >> n >> sx >> sy; vector<pair<long long int, long long int> > v; v.push_back({sx, sy + 1}); v.push_back({sx, sy - 1}); v.push_back({sx + 1, sy}); v.push_back({sx - 1, sy}); vector<long long int> answer(4, 0); for (long long int i = 1; i <= n; i++) { cin >> x >> y; long long int mnx = min(sx, x); long long int mxx = max(sx, x); long long int mny = min(sy, y); long long int mxy = max(sy, y); for (int j = 0; j < 4; j++) { if (v[j].first >= mnx && v[j].first <= mxx && v[j].second >= mny && v[j].second <= mxy) { answer[j]++; } } } long long int ans = 0; for (int i = 0; i < 4; i++) ans = max(ans, answer[i]); cout << ans << endl; for (int i = 0; i < 4; i++) { if (answer[i] == ans && v[i].first <= 1e9 && v[i].second <= 1e9 && v[i].first >= 0 && v[i].second >= 0) { cout << v[i].first << << v[i].second << endl; return 0; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long t; cin >> t; while (t--) { long long sum = 1; long long sum1 = 0; long long sum2 = 0; long long cnt1 = 0; long long cnt2 = 0; long long res = 0; long long flag = 0; long long n; cin >> n; long long bm = n; string s; string su; while (n--) { cin >> s; su += s; } long long len = su.length(); sort(su.begin(), su.end()); for (long long i = 0; i < len - 1; i++) { if (su[i] == su[i + 1]) { sum += 1; } else { if (sum % bm == 0) { sum = 1; } else { cout << NO << endl; ; flag = 1; break; } } } if (sum % bm != 0 && flag == 0) { cout << NO << endl; ; } else if (flag == 0) { cout << YES << endl; ; } } } |
#include <bits/stdc++.h> using namespace std; const long double eps = (long double)1e-9; const long double PI = (long double)acos(-1.0); const int inf = 1e9 + 5; const long long linf = 1e18L + 5; const int mod = 1e9 + 7; void solve() { int n, q, r, c; cin >> n >> q; unordered_set<int> s[3]; set<pair<int, int> > p; pair<int, int> pr; for (int i = 0; i < q; ++i) { cin >> r >> c; if (s[r].count(c)) { s[r].erase(c); for (int j : {c - 1, c, c + 1}) { if (j < 1 || j > n) continue; if (r == 1) pr = {c, j}; else pr = {j, c}; auto it = p.find(pr); if (it != p.end()) p.erase(it); } } else { s[r].insert(c); for (int j : {c - 1, c, c + 1}) { if (j < 1 || j > n) continue; if (r == 1) pr = {c, j}; else pr = {j, c}; if (s[3 - r].count(j)) p.insert(pr); } } cout << ((int)(p).size() ? no : yes ) << n ; } } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; int test = 1; while (test--) { solve(); cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 260; int m, n, mx[N][10], g[N][26], sl[N], L[N]; char a[N][N]; int kq; unsigned long long o[N], A[N], B[N], pw[N], P[N]; unsigned long long get(int l, int r) { return A[r] - A[l - 1] * pw[r - l + 1]; } unsigned long long Get(int l, int r) { return B[l] - B[r + 1] * pw[r - l + 1]; } unsigned long long GET(int l, int r) { int tg = L[r - l + 1]; return max(mx[l][tg], mx[r - (1 << tg) + 1][tg]); } int main() { ios_base::sync_with_stdio(0); cin >> m >> n; pw[0] = 1; P[0] = 1; for (int i = 1, _c = 250; i <= _c; ++i) { pw[i] = pw[i - 1] * 257; L[i] = log2(i); } for (int i = 1, _c = 25; i <= _c; ++i) P[i] = P[i - 1] * 267; for (int i = 1, _c = m; i <= _c; ++i) for (int j = 1, _c = n; j <= _c; ++j) cin >> a[i][j]; for (int l = 1, _c = n; l <= _c; ++l) for (int r = l, _c = n; r <= _c; ++r) { if (l == r) { memset(o, 0, sizeof(o)); memset(g, 0, sizeof(g)); memset(sl, 0, sizeof(sl)); } for (int i = 1, _c = m; i <= _c; ++i) { int x = a[i][r] - a ; g[i][x]++; if (g[i][x] % 2) sl[i]++; else sl[i]--; if (sl[i] > 1) mx[i][0] = 1; else mx[i][0] = 0; o[i] = o[i] + P[x] * x; } for (int j = 1, _c = log2(m); j <= _c; ++j) for (int i = 1, _c = m; i <= _c; ++i) mx[i][j] = max(mx[i][j - 1], mx[i + (1 << (j - 1))][j - 1]); for (int i = 1, _c = m; i <= _c; ++i) A[i] = A[i - 1] * 257 + o[i]; for (int i = m, _c = 1; i >= _c; --i) B[i] = B[i + 1] * 257 + o[i]; for (int i = 1, _c = m; i <= _c; ++i) if (!mx[i][0]) { int l = i, r = min(m, i + (i - 1)), tg = i; while (l <= r) { int mid = (l + r) / 2; if (get(i, mid) == Get(2 * i - mid, i) && !GET(i, mid)) { tg = mid; l = mid + 1; } else r = mid - 1; } kq += (tg - i + 1); } for (int i = 2, _c = m; i <= _c; ++i) if (!mx[i][0] && !mx[i - 1][0] && o[i] == o[i - 1]) { int l = i, r = min(m, i + (i - 2)), tg = i; while (l <= r) { int mid = (l + r) / 2; if (get(i, mid) == Get(2 * i - 1 - mid, i - 1) && !GET(i, mid)) { tg = mid; l = mid + 1; } else r = mid - 1; } kq += (tg - i + 1); } } cout << kq; } |
#include<bits/stdc++.h> using namespace std; //MACROS #define ll long long #define f(i,a,b) for(i=a;i<b;i++) #define MOD 1000000007 #define pb push_back #define mp make_pair #define INF (int)1e9 #define deb(x) cout << > << #x << : << x << endl; #define cjam(t,x) cout << Case # << t << : << x << endl; #define newl cout<<endl; #define print(x) for(auto y:x) cout<<y<< ; newl; //MACROS // DECIMAL TO BINARY CONVERSION string toBinary(ll n) { string r; while(n!=0) {r=(n%2==0 ? 0 : 1 )+r; n/=2;} return r; } // SEGMENT TREE struct segtree { int size; vector<ll> sums; void init(int n) { size = 1; while(size<n) size*=2; sums.assign(2*size, 0LL); } void set(int i, int v, int x, int lx, int rx) { if(rx-lx == 1) sums[x] = v; else { int m = (lx+rx)/2; if(i<m) { set(i, v, 2*x+1, lx, m); } else { set(i, v, 2*x+2, m, rx); } sums[x] = sums[2*x+1] + sums[2*x+2]; } } void set(int i, int v) { set(i ,v, 0, 0, size); } ll sum(ll l, ll r, ll x, ll lx, ll rx) { if(l>=rx || r<=lx) return(0); if(l<=lx && r>=rx) return(sums[x]); ll m = (lx+rx)/2; ll s1 = sum(l, r, 2*x+1, lx, m); ll s2 = sum(l, r, 2*x+2, m, rx); return(s1+s2); } ll sum(ll l, ll r) { return(sum(l, r, 0, 0, size)); } }; //GRAPH struct graph { bool vis[100000]; vector<ll> adj[100000]; void edge(int a, int b) { adj[a].push_back(b); adj[b].push_back(a); } void dfs(ll s) { int i; vis[s] = 1; cout<<s<< ; f(i,0,adj[s].size()) { if(vis[adj[s][i]] == 0) dfs(adj[s][i]); } } }; //BINARY SEARCH ll bsearch(ll arr[], ll n, ll x) { ll l=0, h=n-1; while(l<=h) { ll m = (l+h)/2; if(arr[m]==x) { return(m); } else if(arr[m]<x) { l = m+1; } else { h = m-1; } } return(-1); } //nCr in Constant Time ll const mod = 1e9+7; ll power(ll a, ll b) { ll res = 1; while(b) { if(b&1) res = (res * a) % mod; a = (a * a) % mod; b /= 2; } return res; } ll inverse(ll x){ return power(x,mod-2); } ll const N = 1e6+55; ll fact[N], ifact[N]; void precompute() { fact[0] = 1; for(ll i=1; i<N; i++) fact[i] = (fact[i-1] * i) % mod; ifact[N-1] = inverse(fact[N-1]); for(ll i=N-2; i>=0; i--) ifact[i] = ((i+1) * ifact[i+1]) % mod; } ll ncr(ll n, ll r) { if(r<0 or r>n) return 0; if(n == r) return 1; ll res = (fact[n] * ifact[n-r]) % mod; res = (res * ifact[r]) % mod; return res; } int sieve[100001]; void prime() { int i,j; std::fill_n(sieve, 100000, 1); for(i=2;i*i<=100000;i++) { if(sieve[i]) { for(j=i*i;j<=100000;j+=i) { sieve[j] = 0; } } } } ////////////////////////// ///////DRIVER CODE//////// ////////////////////////// int main() { #ifndef ONLINE_JUDGE freopen( input.txt , r , stdin); freopen( output.txt , w , stdout); #endif ll x,y,z,n,m,q,tt,t,i,j,k; cin>>tt; t=tt; while(tt--) { cin>>n; std::vector<ll> v; ll f = 1; f(i,0,2*n) { cin>>x; if(x&1) f = 0; v.pb(x); } set<ll> s(v.begin(), v.end()); if(f==0) { cout<< NO <<endl; continue; } if(s.size()!=n) { cout<< NO <<endl; continue; } ll sum = 0; f = 1; auto it = s.rbegin(); f(i,0,n) { x = *(it++); y = (x-sum)/(2*(n-i)); z = (x-sum)%(2*(n-i)); sum+=2*y; if(y<=0 or z>0) { f = 0; break; } } if(f) cout<< YES <<endl; else cout<< NO <<endl; } } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007, inf = 1000000000; const int N = 100010; inline int read() { char ch; while (!isdigit(ch = getchar())) ; int x = ch - 0 ; while (isdigit(ch = getchar())) x = (x << 1) + (x << 3) + ch - 0 ; return x; } int n, cnt; int a[N], last[N]; long long f[N][2]; struct edge { int to, next; } e[N << 1]; void insert(int u, int v) { e[++cnt].to = v; e[cnt].next = last[u]; last[u] = cnt; e[++cnt].to = u; e[cnt].next = last[v]; last[v] = cnt; } void dfs(int x, int fa) { long long t1, t2; if (a[x] == 1) f[x][1] = 1; f[x][0] = f[x][1] ^ 1; for (int i = last[x]; i; i = e[i].next) if (e[i].to != fa) { int y = e[i].to; dfs(y, x); t1 = f[x][0] * (f[y][0] + f[y][1]); t2 = (f[x][1] * (f[y][0] + f[y][1]) + f[x][0] * f[y][1]); f[x][0] = t1 % mod; f[x][1] = t2 % mod; } } int main() { n = read(); for (int i = 1; i < n; i++) insert(read(), i); for (int i = 0; i < n; i++) a[i] = read(); dfs(0, 0); cout << f[0][1] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; string str; cin >> str; vector<int> arr; for (int i = 0; i < str.size(); i++) { if (str[i] == . ) arr.push_back(i + 1); } for (int i = 0; i + 1 < arr.size(); i++) { if (arr[i] + k < arr[i + 1]) { cout << NO << endl; return 0; } } cout << YES << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long a[200001]; int main() { long long t, m = 0, i, n, k, ans; ; scanf( %lld%lld , &n, &k); for (i = 0; i < n; i++) scanf( %lld , &a[i]); sort(a, a + n); for (i = (n + 1) / 2; i < n; i++) { t = m; m += (a[i] - a[i - 1]) * (i - (n - 1) / 2); if (m > k) { ans = a[i - 1] + (k - t) / (i - (n - 1) / 2); break; } } if (i == n) ans = (k - m) / (n - (n - 1) / 2) + a[n - 1]; printf( %lld n , ans); } |
#include <bits/stdc++.h> using namespace std; int n, a[4000005], t[4000005]; long long ans, now; int k; template <class T> inline T Max(T a, T b) { return a > b ? a : b; } int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %d , a + i); int fu = 0, zh = 0; for (int i = 1; i <= n; ++i) { int qwq = a[i] - i; now += qwq < 0 ? -qwq : qwq; if (i == n) continue; if (qwq <= 0) ++fu; else ++t[a[i] - i], ++zh; } ans = now; int las = n; for (int i = 1; i < n; ++i) { now += -zh + fu - (n - a[las]) + a[las] - 1; fu += t[i]; zh -= t[i]; if (a[las] != 1) --fu, ++zh; ++t[i + a[las] - 1]; if (now < ans) ans = now, k = i; --las; } printf( %lld %d n , ans, k); return 0; } |
#include <bits/stdc++.h> using namespace std; void dbvar() { cerr << ] << endl; } template <class H, class... T> void dbvar(H h, T... t) { cerr << to_string(h); if (sizeof...(t)) cerr << , ; dbvar(t...); } const int INF = (int)(1e9); const long long int INFL = (long long int)(1e18); const long double pi = acos(-1.0); const int dx[4] = {-1, 0, 1, 0}; const int dy[4] = {0, 1, 0, -1}; long long int power(long long int n, long long int m) { if (m == 0) return 1; long long int val = power(n, m / 2); if (m % 2 == 0) return (val * val); else return ((val * val) * n); } long long int powermod(long long int n, long long int m, long long int _MOD) { if (m == 0) return 1; long long int val = powermod(n, m / 2, _MOD); val %= _MOD; if (m % 2 == 0) return (val * val) % _MOD; else return (((val * val) % _MOD) * n) % _MOD; } const int mxN = 2e5 + 100; vector<int> tree[mxN]; int depth[mxN], subtree[mxN], ans[mxN]; void dfs(int v, int p) { depth[v] = depth[p] + 1; subtree[v] = 1; for (auto x : tree[v]) { if (x != p) { dfs(x, v); subtree[v] += subtree[x]; } } ans[v] = subtree[v] - depth[v]; } void solve() { int n, k; cin >> n >> k; for (int i = 0; i < n - 1; i++) { int x, y; cin >> x >> y; tree[x].push_back(y); tree[y].push_back(x); } depth[0] = 0; dfs(1, 0); sort(ans + 1, ans + n + 1, greater<int>()); long long int res = 0; for (int i = 1; i <= n - k; i++) res += ans[i]; cout << res << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(0); int t = 1; for (int i = 1; i <= t; i++) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int i, j, test, len; string s; cin >> test; while (test--) { cin >> s; len = s.length(); if (s[len - 2] == p && s[len - 1] == o ) { cout << FILIPINO << endl; } else if (s[len - 4] == d && s[len - 3] == e && s[len - 2] == s && s[len - 1] == u ) { cout << JAPANESE << endl; } else if (s[len - 4] == m && s[len - 3] == a && s[len - 2] == s && s[len - 1] == u ) { cout << JAPANESE << endl; } else { cout << KOREAN << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, a, b; cin >> n >> a >> b; string s; cin >> s; for (int cnt1 = 0; cnt1 <= n / a; ++cnt1) { for (int cnt2 = 0; cnt2 <= n / b; ++cnt2) if (a * cnt1 + b * cnt2 == n) { cout << cnt1 + cnt2 << endl; for (int i = 0; i < cnt1; ++i) { for (int j = 0; j < a; ++j) cout << s[j]; cout << endl; s.erase(0, a); } for (int i = 0; i < cnt2; ++i) { for (int j = 0; j < b; ++j) cout << s[j]; cout << endl; s.erase(0, b); } return 0; } } cout << -1 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; int n; int a[N]; int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; } int ans; for (int i = 30; i >= 0; i--) { int flag = 0; for (int j = 0; j < n; j++) { if ((a[j] >> i) & 1) { flag++; ans = j; } } if (flag == 1) { break; } } cout << a[ans] << ; for (int i = 0; i < n; i++) { if (i != ans) { cout << a[i] << ; } } cout << endl; return 0; } |
#include <bits/stdc++.h> char s[10010]; char s1[10010], s2[10010], s3[10010]; char ans[10010]; int main() { scanf( %s , s + 1); int n = strlen(s + 1); for (int i = 1; i <= n; i++) { int b1 = i / 26 / 26; int b2 = (i / 26) % 26; int b3 = i % 26; s1[i] = b1 + a ; s2[i] = b2 + a ; s3[i] = b3 + a ; } printf( ? %s n , s1 + 1); std::fflush(stdout); scanf( %s , s1 + 1); printf( ? %s n , s2 + 1); std::fflush(stdout); scanf( %s , s2 + 1); printf( ? %s n , s3 + 1); std::fflush(stdout); scanf( %s , s3 + 1); for (int i = 1; i <= n; i++) { int b1 = s1[i] - a ; int b2 = s2[i] - a ; int b3 = s3[i] - a ; ans[b1 * 26 * 26 + b2 * 26 + b3] = s[i]; } printf( ! %s , ans + 1); std::fflush(stdout); } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> A(n), B(n); vector<int> Ai(n - 1), Bi(n - 1); int t = 0; for (int i = 0; i < n; ++i) { cin >> A[i]; if (A[i] != 0) { Ai[t] = A[i]; t++; } } t = 0; for (int i = 0; i < n; ++i) { cin >> B[i]; if (B[i] != 0) { Bi[t] = B[i]; t++; } } int i0 = 0; for (int i = 0; i < n - 1; ++i) { if (Bi[i] == Ai[0]) { i0 = i; break; } } for (int i = 0; i < n - 1; ++i) { if (Bi[(i + i0) % (n - 1)] != Ai[i]) { cout << NO << endl; return 0; } } cout << YES << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1}; bool ckmin(int& a, int b) { return b < a ? a = b, true : false; } bool ckmax(int& a, int b) { return b > a ? a = b, true : false; } const long long linf = 4000000000000000000LL; const long long inf = 1000000007; const long double pi = 3.1415926535; void pv(vector<int> a) { for (auto& x : a) cout << x << ; cout << n ; } void pv(vector<long long> a) { for (auto& x : a) cout << x << ; cout << n ; } void pv(vector<vector<int> > a) { for (int i = (0); i < (int(a.size())); ++i) { cout << i << n ; pv(a[i]); cout << n ; } } void pv(vector<vector<long long> > a) { for (int i = (0); i < (int(a.size())); ++i) { cout << i << n ; pv(a[i]); } cout << n ; } void pv(vector<string> a) { for (auto& x : a) cout << x << n ; cout << n ; } void setIO(string second) { ios_base::sync_with_stdio(0); cin.tie(0); if (int(second.size())) { freopen((second + .in ).c_str(), r , stdin); if (second != test1 ) freopen((second + .out ).c_str(), w , stdout); } } int main() { setIO( ); int n; cin >> n; vector<long long> a(n); for (auto& x : a) cin >> x; vector<int> count(60); for (int i = (0); i < (n); ++i) { int ans = 0; while (!(a[i] & 1)) { ans++; a[i] >>= 1; } a[i] <<= ans; count[ans]++; } int index = max_element(count.begin(), count.end()) - count.begin(); cout << n - count[index] << n ; if (index == 0) { for (int i = (0); i < (n); ++i) { if (a[i] & 1) ; else cout << a[i] << ; } return 0; } for (int i = (0); i < (n); ++i) { if ((((a[i] >> index) & 1)) && !((a[i] >> index - 1) & 1)) { } else { cout << a[i] << ; } } } |
#include <bits/stdc++.h> using namespace std; long long n, k; int main() { scanf( %lld %lld , &n, &k); vector<long long> prime; for (int i = 2; i <= n; ++i) { if (!prime.size()) { prime.push_back(i); continue; } bool isPrime = true; for (int j = 0; j < prime.size(); ++j) { long long now = prime[j]; if (now * now > i) break; if (!(i % now)) { isPrime = false; break; } } if (isPrime) prime.push_back(i); } vector<int> ans; for (int i = 0; i < prime.size(); ++i) { while (!(n % prime[i]) && k > 1 && n > 1) { ans.push_back(prime[i]); --k; n /= prime[i]; } } if (n == 1) { puts( -1 ); return 0; } ans.push_back(n); --k; for (int i = 0; i < ans.size(); ++i) printf( %d%c , ans[i], n [i + 1 == ans.size()]); } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 85 - 69; long long int a[maxn], su[maxn], dp[maxn]; int n; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> n; for (int i = 1; i < n; i++) cin >> a[i]; for (int i = n - 1; i > 0; i--) { su[i] = su[i + 1] + a[i] - (a[i] & 1); if (a[i] == 1) su[i] = 0; } dp[0] = 0; long long int sum = 0, ans = 0; for (int i = 1; i < n; i++) { sum += a[i] - (a[i] & 1); if (a[i] == 1) sum = 0; dp[i] = max(dp[i - 1] + a[i] - (a[i] % 2 == 0), sum); ans = max(ans, dp[i] + su[i + 1]); } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; int n; struct node { int x, y; } a[N]; int cmp(node a, node b) { return a.x < b.x; } double f[55][55][55], ans; int pd(double ans) { memset(f, 127, sizeof f); f[0][0][0] = 0; for (int i = 1; i <= n; i++) { if (a[i].x == a[i - 1].x) { for (int j = 0; j <= i - 1; j++) { int nj = j ? j - 1 : j; for (int k = 0; k <= i - 1; k++) { if (f[i - 1][j][k] + a[i].x - ans * a[i].y < f[i][nj][k]) f[i][nj][k] = f[i - 1][j][k] + a[i].x - ans * a[i].y; if (f[i - 1][j][k] < f[i][j][k + 1]) f[i][j][k + 1] = f[i - 1][j][k]; } } } else { for (int j = 0; j <= i - 1; j++) for (int k = 0; k <= i - 1; k++) f[i - 1][j + k][0] = ((f[i - 1][j + k][0]) < (f[i - 1][j][k]) ? (f[i - 1][j + k][0]) : (f[i - 1][j][k])); for (int j = 0; j <= i - 1; j++) { int nj = j ? j - 1 : j; if (f[i - 1][j][0] + a[i].x - ans * a[i].y < f[i][nj][0]) f[i][nj][0] = f[i - 1][j][0] + a[i].x - ans * a[i].y; if (f[i - 1][j][0] < f[i][j][1]) f[i][j][1] = f[i - 1][j][0]; } } } return f[n][0][0] < 0; } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i].x); for (int i = 1; i <= n; i++) scanf( %d , &a[i].y); sort(a + 1, a + n + 1, cmp); for (double l = 0, r = 1e8 + 1; r - l > 1e-5;) { double m = (l + r) / 2; if (pd(m)) ans = m, r = m; else l = m; } long long as = ceil((ans - 1e-5) * 1000); printf( %I64d n , as); } |
#include <bits/stdc++.h> using namespace std; const long long INF64 = 1e18; clock_t time_p = clock(); void time() { time_p = clock() - time_p; cerr << Time Taken : << (float)(time_p) / CLOCKS_PER_SEC << n ; } void doc() { freopen( input.txt , r , stdin); freopen( output.txt , w , stdout); } void fast() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } int main() { fast(); string s; cin >> s; long long i, j; long long n = s.length(); long long m = 0, idx = -1, x = 0, y = 0; for (i = 0; i < n; i++) { if (s[i] == ( ) { x++; y = 0; for (j = i + 1; j < n; j++) { if (s[j] == ) ) y++; } if (y >= x) { if (x > m) { m = x; idx = i; } } } } vector<long long> ans; for (i = 0; i <= idx; i++) if (s[i] == ( ) ans.emplace_back(i + 1); for (i = n - 1, j = 0; i >= 0 and j < m; i--) if (s[i] == ) ) { ans.emplace_back(i + 1); j++; } sort(ans.begin(), ans.end()); if (ans.size() == 0) { cout << 0 ; exit(0); } cout << 1 << endl << ans.size() << endl; for (auto i : ans) cout << i << ; cout << n ; } |
#include <bits/stdc++.h> using namespace std; int main() { int n = 0, m = 1, i = 0, j = 0, k = 0, x = 0; int area[51][51] = {0}; cin >> n; for (i = 0; i < n; i++) for (x = 0; x < n; x++) cin >> area[i][x]; for (i = 0; i < n; i++) for (x = 0; x < n; x++) if (area[i][x] != 1) { m = 1; for (j = 0; j < n; j++) { if (j == i) continue; for (k = 0; k < n; k++) { if (k == x) continue; if (area[i][x] == area[j][x] + area[i][k]) { m = 0; break; } } if (m == 0) break; } if (m == 1) { cout << NO << endl; return 0; } } cout << YES << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 205; const long long modulo = 1000000007; struct point { long long x, y; }; point operator-(point A, point B) { point C; C.x = A.x - B.x; C.y = A.y - B.y; return C; } bool operator==(point A, point B) { return (A.x == B.x && A.y == B.y); } long long cross(point A, point B) { return (A.x * B.y - A.y * B.x); } long long dot(point A, point B) { return (A.x * B.x + A.y * B.y); } struct Line { long long A, B, C; Line(point P, point R) { A = R.y - P.y; B = P.x - R.x; C = (P.y * R.x) - (P.x * R.y); } }; long long sgn(long long x) { if (x > 0) return 1; if (x < 0) return -1; if (x == 0) return 0; } long long f(Line L, point P) { return sgn(L.A * P.x + L.B * P.y + L.C); } bool OnSegment(point A, point B, point X) { if (f(Line(A, B), X) != 0) return false; if (dot(A - X, B - X) < 0) return true; else return false; } bool intersect(point A, point B, point C, point D) { if (A == C || A == D || B == C || B == D) return false; if (f(Line(A, B), C) * f(Line(A, B), D) >= 0) return false; if (f(Line(C, D), A) * f(Line(C, D), B) >= 0) return false; return true; } point a[MAXN]; long long dp[MAXN][MAXN]; int main() { int N; cin >> N; for (int i = 1; i <= N; i++) { cin >> a[i].x >> a[i].y; } a[N + 1] = a[1]; long long Area = 0; for (int i = 1; i <= N; i++) { Area += cross(a[i], a[i + 1]); } Area = abs(Area); for (int d = 1; d < N - 1; d++) { for (int l = 1; l + d <= N; l++) { int r = l + d; if (d == 1) { dp[l][r] = 1; continue; } else dp[l][r] = 0; bool bad = false; for (int i = 1; i <= N; i++) { if (i != l && i != r && OnSegment(a[l], a[r], a[i])) bad = true; } if (bad) continue; for (int i = 1; i <= N; i++) { int next = i + 1; if (next == N + 1) next = 1; if (intersect(a[l], a[r], a[i], a[next])) bad = true; } if (bad) continue; long long AreaX = 0, AreaY = 0; for (int i = l; i <= r; i++) { int next = i + 1; if (next == r + 1) next = l; AreaX += cross(a[i], a[next]); } int j = 1; while (j <= N) { int next; if (j == l) next = r; else next = j + 1; if (next == N + 1) next = 1; AreaY += cross(a[j], a[next]); j = next; if (j == 1) j = N + 1; } if (Area != abs(AreaX) + abs(AreaY)) continue; for (int i = l + 1; i < r; i++) { dp[l][r] += (dp[l][i] * dp[i][r]) % modulo; dp[l][r] = dp[l][r] % modulo; } } } dp[1][N] = 0; for (int i = 2; i < N; i++) { dp[1][N] += (dp[1][i] * dp[i][N]) % modulo; dp[1][N] = dp[1][N] % modulo; } cout << dp[1][N] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 50; const int maxm = 1e6 + 50; const double eps = 1e-10; const int max_index = 62; const int inf = 0x3f3f3f3f; const int MOD = 1e9 + 7; inline int read() { char c = getchar(); while (!isdigit(c)) c = getchar(); int x = 0; while (isdigit(c)) { x = x * 10 + c - 0 ; c = getchar(); } return x; } const int offset = 2000; struct Point { int x, y; Point(int x = 0, int y = 0) : x(x), y(y) {} bool operator<(const Point &rhs) const { if (x == rhs.x) return y < rhs.y; return x < rhs.x; } } P[205]; std::vector<int> G[maxm]; int n, m; int dis[maxm], vis[maxm]; int get(int x, int y) { return x * m + y; } int ans = 0; void dfs(int u) { vis[u] = 1; int res = 0; for (int i = 0; i < G[u].size(); i++) { int v = G[u][i]; if (vis[v]) { puts( Poor Inna! ); exit(0); } if (!dis[v]) dfs(v); res = max(res, dis[v]); } dis[u] = res + 1; vis[u] = 0; } int dir[4][2] = {0, -1, -1, 0, 0, 1, 0, -1}; char mp[1005][1005]; bool judge(char x, char y) { bool ok = 0; ok |= (x == D && y == I ); ok |= (x == I && y == M ); ok |= (x == M && y == A ); ok |= (x == A && y == D ); return ok; } int main() { n = read(), m = read(); for (int i = 0; i < n; i++) scanf( %s , mp[i]); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { int u = get(i, j); for (int k = 0; k < 2; k++) { int dx = i + dir[k][0], dy = j + dir[k][1]; if (dx < 0 || dy < 0) continue; int v = get(dx, dy); if (judge(mp[dx][dy], mp[i][j])) { G[v].push_back(u); } else if (judge(mp[i][j], mp[dx][dy])) { G[u].push_back(v); } } } } for (int i = 0; i < m * n; i++) { int x = i / m, y = i % m; if (mp[x][y] != D ) continue; dfs(i); ans = max(ans, dis[i]); } if (ans < 4) puts( Poor Dima! ); else printf( %d n , ans / 4); return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 1000000007; int add(int a, int b) { a += b; return a >= mod ? a - mod : a; } const int MN = 1000011; int f[MN][2], n; inline void Main() { f[0][0] = f[0][1] = 1; scanf( %d , &n); for (register int i = (1), _c = (n); i <= _c; i++) for (register int j = (0), _c = (1); j <= _c; j++) if (f[i - 1][j]) { (f[i][j] = add(f[i][j], f[i - 1][j])); if (j != i % 2) (f[i][i % 2] = add(f[i][i % 2], f[i - 1][j])); } register int ans = add(add(f[n][0], f[n][1]), mod - 2); printf( %d n , ans); } int main() { Main(); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, s, ans, tot, tot1, tot2; int siz[200010], du[200010], dep[200010], fa[200010][18]; int q[200010], head[200010], head1[200010], head2[200010], power[18]; bool v[200010]; long long dis[200010]; struct Map { int r, len, next; } line[600010]; struct Map_sp { int r, next; } line1[600010], line2[600010]; void add(int x, int y, int len) { tot++; line[tot].r = y; line[tot].len = len; line[tot].next = head[x]; head[x] = tot; } void add1(int x, int y) { tot1++; line1[tot1].r = y; line1[tot1].next = head1[x]; head1[x] = tot1; } void add2(int x, int y) { tot2++; line2[tot2].r = y; line2[tot2].next = head2[x]; head2[x] = tot2; } void spfa() { for (int i = 1; i <= n; i++) dis[i] = 1e18; int hd = 0, tl = 0; q[tl++] = s, dis[s] = 0, v[s] = true; while (hd != tl) { int x = q[hd]; for (int i = head[x]; i; i = line[i].next) { int rx = line[i].r, len = line[i].len; if (dis[x] + len < dis[rx]) { dis[rx] = dis[x] + len; if (!v[rx]) { v[rx] = true; q[tl++] = rx; if (tl == 200010) tl = 0; } } } v[x] = false; hd++; if (hd == 200010) hd = 0; } } void build(int x) { v[x] = true; for (int i = head[x]; i; i = line[i].next) { int rx = line[i].r; if (dis[x] + line[i].len == dis[rx]) { add1(x, rx), add2(rx, x); du[rx]++; if (!v[rx]) build(rx); } } } void dfs(int x) { siz[x] = 1; for (int i = head[x]; i; i = line[i].next) { int rx = line[i].r; dfs(rx); siz[x] += siz[rx]; } if (x != s) ans = max(ans, siz[x]); } int lca(int x, int y) { if (dep[x] < dep[y]) swap(x, y); int tmp = dep[x] - dep[y]; for (int i = 0; power[i] <= tmp; i++) if (tmp & power[i]) x = fa[x][i]; if (x == y) return x; for (int i = 17; i >= 0; i--) if (fa[x][i] != fa[y][i]) x = fa[x][i], y = fa[y][i]; return fa[x][0]; } void topo() { int hd = 1, tl = 0; q[++tl] = s, dep[s] = 1; while (hd <= tl) { int x = q[hd]; for (int i = head1[x]; i; i = line1[i].next) { int rx = line1[i].r; du[rx]--; if (!du[rx]) { q[++tl] = rx; int LCA = 0; for (int j = head2[rx]; j; j = line2[j].next) if (!LCA) LCA = line2[j].r; else LCA = lca(LCA, line2[j].r); add(LCA, rx, 0); fa[rx][0] = LCA; dep[rx] = dep[LCA] + 1; for (int j = 1; j <= 17; j++) fa[rx][j] = fa[fa[rx][j - 1]][j - 1]; } } hd++; } } inline int read() { int x = 0; char ch = getchar(); while (ch < 0 || ch > 9 ) ch = getchar(); while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x; } int main() { power[0] = 1; for (int i = 1; i <= 17; i++) power[i] = power[i - 1] << 1; n = read(), m = read(), s = read(); for (int i = 1; i <= m; i++) { int u = read(), v = read(), w = read(); add(u, v, w), add(v, u, w); } spfa(); build(s); tot = 0; memset(head, 0, sizeof(head)); topo(); dfs(s); printf( %d , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; if (((n * m) % 2 != 0) || (n == 1 && m > 2) || (m == 1 && n > 2)) { cout << 1 << endl; cout << n << << m << 1 1 << endl; for (int i = 1; i <= m; i++) { for (int j = 1; j <= n; j++) { if (i % 2 == 1) cout << j << << i << endl; else cout << n + 1 - j << << i << endl; } } cout << 1 1 ; return 0; } cout << 0 << endl; if (n % 2 == 0) { for (int i = 1; i <= n; i++) cout << i << << 1 << endl; for (int i = n; i >= 1; i--) { for (int j = 2; j <= m; j++) { if (i % 2 == 0) cout << i << << j << endl; else cout << i << << m + 2 - j << endl; } } cout << 1 1 ; return 0; } if (m % 2 == 0) { for (int i = 1; i <= m; i++) cout << 1 << << i << endl; for (int i = m; i >= 1; i--) { for (int j = 2; j <= n; j++) { if (i % 2 == 0) cout << j << << i << endl; else cout << n + 2 - j << << i << endl; } } cout << 1 1 ; return 0; } return 0; } |
#include <bits/stdc++.h> using namespace std; int pri[200050]; int que[200050]; int ans[200050]; int l[200050]; int r[200050]; int main() { int n; while (scanf( %d , &n) != EOF) { for (int i = 1; i <= n; i++) { scanf( %d , &pri[i]); ans[i] = 0; l[i] = r[i] = 1; } int s = 1, e = 0; for (int i = 1; i <= n; i++) { while (s <= e && pri[que[e]] >= pri[i]) { l[i] = i - que[e] + l[que[e]]; e--; } que[++e] = i; } s = 1, e = 0; for (int i = n; i >= 1; i--) { while (s <= e && pri[que[e]] >= pri[i]) { r[i] = r[que[e]] + que[e] - i; e--; } que[++e] = i; } for (int i = 1; i <= n; i++) { ans[l[i]] = max(ans[l[i]], pri[i]); ans[r[i]] = max(ans[r[i]], pri[i]); ans[r[i] + l[i] - 1] = max(ans[r[i] + l[i] - 1], pri[i]); } for (int i = n - 1; i >= 1; i--) { ans[i] = max(ans[i], ans[i + 1]); } for (int i = 1; i <= n; i++) if (i == 1) printf( %d , ans[i]); else printf( %d , ans[i]); printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 37; long long int c[1037][1037]; int main() { for (int i = 0; i < 1037; i++) { c[i][0] = 1; for (int j = 1; j < i + 1; j++) { c[i][j] = c[i - 1][j - 1] + c[i - 1][j]; } } int n, k; cin >> n >> k; int pole[5] = {0, 0, 1, 2, 9}; long long int vys = 1; for (int i = 2; i < k + 1; i++) { vys += c[n][i] * pole[i]; } cout << vys << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> using lim = numeric_limits<T>; const int maxn = 2e5; int table[maxn * 2 + 2]; int find(int i) { if (table[i] == i) return i; else return table[i] = find(table[i]); } int main() { ios_base::sync_with_stdio(false); cin.tie(0); for (int i = 0; i < 2 * maxn + 2; i++) table[i] = i; int n, m, q; cin >> n >> m >> q; int ans = n + m - 1; while (q--) { int x, y; cin >> x >> y; x = find(x); y = find(y + n); if (x == y) continue; ans--; table[x] = y; } cout << ans << n ; } |
#include <bits/stdc++.h> using namespace std; struct trio { int64_t first, second, trd; friend ostream &operator<<(ostream &o, trio &a) { o << ( << a.first << , << a.second << , << a.trd << ) ; return o; } }; template <typename T> inline T max() { return numeric_limits<T>::max(); } template <typename T> inline T gcd(T a, T b) { return b == 0 ? a : gcd(b, a % b); } template <typename T> inline void get(T &&v) { cin >> v; } template <typename T, typename... Args> inline void get(T &&v, Args &&...args) { cin >> v; get(args...); } template <typename T> inline void put(T &&v) { cout << v << n ; } template <typename T, typename... Args> inline void put(T &&v, Args &&...args) { cout << v << ; put(args...); } template <typename T> inline void putc(T &&a, const string s = ) { { for (auto &v : a) cout << v << s; } cout << n ; } ostream &operator<<(ostream &out, pair<int32_t, int32_t> &a) { out << ( << a.first << , << a.second << ) ; return out; } ostream &operator<<(ostream &out, pair<int64_t, int64_t> &a) { out << ( << a.first << , << a.second << ) ; return out; } vector<int32_t> primes; inline void calc_primes(int32_t lmt) { vector<char> s(lmt); primes.push_back(2); for (int32_t i = 3; i < lmt; i += 2) { if (s[i]) continue; primes.push_back(i); for (int32_t j = i + (i << 1); j < lmt; j += (i << 1)) s[j] = 1; } } inline vector<pair<int32_t, int32_t> > factorize(int32_t n) { vector<pair<int32_t, int32_t> > a; int32_t cnt = __builtin_ctzl(n); a.push_back({2, cnt}); n >>= cnt; for (auto &d : primes) { cnt = 0; while (n % d == 0) n /= d, cnt++; a.push_back({d, cnt}); if (n == 1) break; } if (n != 1) a.push_back({n, 1}); return a; } int64_t mod = 1e9 + 9; inline int64_t mmul(int64_t a, int64_t n) { if (a < 0) a += mod; if (n < 0) n += mod; int64_t r = 0; while (n) { if (n & 1) r = (r + a) % mod; a = (a + a) % mod; n >>= 1; } return r; } inline int64_t mpow(int64_t a, int64_t n) { if (a < 0) a += mod; if (n < 0) n += mod; int64_t r = 1; while (n) { if (n & 1) r = mmul(r, a); a = mmul(a, a); n >>= 1; } return r; } int main() { { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << setprecision(20); }; int64_t n, a, b, k; get(n, a, b, k); int64_t inv_a = mpow(a, mod - 2); int64_t aa = mpow(a, n); int64_t bb = 1; int64_t z = 0; for (int64_t i = 0; i < k; ++i) { char c; cin >> c; int64_t sgn = (c == + ? 1 : -1); z = (z + sgn * mmul(aa, bb)) % mod; aa = mmul(aa, inv_a); bb = mmul(bb, b); } int64_t q = mmul(bb, mpow(inv_a, k)); int64_t s = 0, t = (n + 1) / k; if (q == 1) s = t; else s = mmul((mod + 1 - mpow(q, t)), mpow(mod + 1 - q, mod - 2)); z = mmul(z, s); if (z < 0) z += mod; put(z); return 0; } |
#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; for (; b; b >>= 1) { if (b & 1) res = res * a % mod; a = a * a % mod; } return res; } const int N = 101000; int n, val[N]; pair<int, int> p[N]; long long A, cf, cm, m, s[N]; int main() { scanf( %d%lld%lld%lld%lld , &n, &A, &cf, &cm, &m); for (int i = 1; i < n + 1; i++) { scanf( %d , &p[i].first); p[i].second = i; } sort(p + 1, p + n + 1); p[n + 1].first = A; for (int i = 1; i < n + 1; i++) s[i] = s[i - 1] + p[i].first; long long ans = 0; int ansp = 0, ansl = 0, ansv = 0; if (n * A - s[n] <= m) { ans = A * cm + n * cf; ansp = 0; ansl = 0; ansv = 0; } for (int i = 1; i < n + 1; i++) { long long c = (n - i) * A - (s[n] - s[i]); if (c > m) continue; long long rm = m - c; int l = 1, r = i + 1; while (l + 1 < r) { int md = (l + r) >> 1; long long sm = (long long)p[md].first * md - s[md]; if (sm <= rm) l = md; else r = md; } rm -= ((long long)p[l].first * l - s[l]); long long nv = p[l + 1].first; if (l == i) nv = A; long long mm = min(p[l].first + rm / l, nv); long long ret = mm * cm + (n - i) * cf; if (ret >= ans) { ans = ret; ansp = i; ansl = l; ansv = mm; } } printf( %lld n , ans); for (int i = ansp + 1; i < n + 1; i++) p[i].first = A; for (int i = 1; i < ansl + 1; i++) p[i].first = ansv; for (int i = 1; i < n + 1; i++) val[p[i].second] = p[i].first; for (int i = 1; i < n + 1; i++) printf( %d , val[i]); puts( ); } |
#include <bits/stdc++.h> using namespace std; int n; int x_search(const int &down, const int &up, const int &c) { int l = down, r = up, key = 0; while (l <= r) { int mid = (l + r) / 2, cnt; cout << ? << mid << << 1 << << n << << n << n ; cin >> cnt; if (cnt >= c) { key = mid; l = mid + 1; } else r = mid - 1; } return key; } int u_search(const int &left, const int &right, const int &c) { int l = left, r = right, key = right + 1; while (l <= r) { int mid = (l + r) / 2, cnt; cout << ? << 1 << << 1 << << mid << << n << n ; cin >> cnt; if (cnt >= c) { key = mid; r = mid - 1; } else l = mid + 1; } return key; } int y_search(const int &left, const int &right, const int &c) { int l = left, r = right, key = 0; while (l <= r) { int mid = (l + r) / 2, cnt; cout << ? << 1 << << mid << << n << << n << n ; cin >> cnt; if (cnt >= c) { key = mid; l = mid + 1; } else r = mid - 1; } return key; } int v_search(const int &left, const int &right, const int &c) { int l = left, r = right, key = right + 1; while (l <= r) { int mid = (l + r) / 2, cnt; cout << ? << 1 << << 1 << << n << << mid << n ; cin >> cnt; if (cnt >= c) { key = mid; r = mid - 1; } else l = mid + 1; } return key; } void check(int x_1, int y_1, int u_1, int v_1, int x_2, int y_2, int u_2, int v_2) { if (x_1 > u_1 || y_1 > v_1 || x_2 > u_2 || y_2 > v_2) return; int c1, c2; cout << ? << x_1 << << y_1 << << u_1 << << v_1 << n ; cin >> c1; cout << ? << x_2 << << y_2 << << u_2 << << v_2 << n ; cin >> c2; if (c1 == 1 && c2 == 1) cout << ! << x_1 << << y_1 << << u_1 << << v_1 << << x_2 << << y_2 << << u_2 << << v_2 << n ; } int main() { cin >> n; int x_1 = x_search(1, n, 2), x_2 = x_search(x_1, n, 1), u_2 = u_search(1, n, 2), u_1 = u_search(1, u_2, 1), y_1 = y_search(1, n, 2), y_2 = y_search(y_1, n, 1), v_2 = v_search(1, n, 2), v_1 = v_search(1, v_2, 1); int c; check(x_1, y_1, u_1, v_1, x_2, y_2, u_2, v_2); check(x_1, y_1, u_2, v_1, x_2, y_2, u_1, v_2); check(x_1, y_1, u_1, v_2, x_2, y_2, u_2, v_1); check(x_1, y_1, u_2, v_2, x_2, y_2, u_1, v_1); check(x_1, y_2, u_1, v_1, x_2, y_1, u_2, v_2); check(x_1, y_2, u_2, v_1, x_2, y_1, u_1, v_2); check(x_1, y_2, u_1, v_2, x_2, y_1, u_2, v_1); check(x_1, y_2, u_2, v_2, x_2, y_1, u_1, v_1); } |
#include <bits/stdc++.h> using namespace std; constexpr long long int mod = 1e9 + 7; constexpr long long int MAXN = 1e6 + 3; constexpr long long int inf = 1ll << 32; int main() { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; vector<int> vx(n + 2); int med = 0; for (int c = 1; c <= n; c++) { cin >> vx[c]; vx[c] += vx[c - 1]; } if (vx[n] % 2 == 0) med = vx[n] / 2; else med = vx[n] / 2 + 1; for (int c = 1; c <= n; c++) if (vx[c] >= med) { cout << c; return 0; } } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; int pos[11][1111]; int gra[1111][1111]; int main() { int n, m; cin >> n >> m; int x; for (int i = 0; i < m; i++) { for (int j = 0; j < n; j++) { cin >> x; pos[i][x - 1] = j; } } for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { int flag = 1; for (int k = 0; k < m; k++) { flag &= (pos[k][i] < pos[k][j]); } if (flag == true) gra[i][j] = 1; else gra[i][j] = -INF; } } for (int k = 0; k < n; k++) { for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { gra[i][j] = max(gra[i][j], gra[i][k] + gra[k][j]); } } } int ans = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { ans = max(ans, gra[i][j]); } } cout << ans + 1 << endl; return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; using ll = long long; using ii = pair<int, int>; using uint = unsigned int; const int N = 1e5 + 5, MOD = 1e9 + 7; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; vector<int> deg(n + 1); for (int i = 1, u, v; i < n; i++) { cin >> u >> v; deg[u]++; deg[v]++; } if (find(deg.begin(), deg.end(), 2) == deg.end()) cout << YES n ; else cout << NO n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, x, y; set<pair<int, int> > S, T; int solve(set<pair<int, int> >& s, set<pair<int, int> >& t) { set<pair<int, int> >::iterator it1, it2, it3, it4; it1 = s.begin(); it2 = s.end(); it2--; it3 = t.begin(); it4 = t.end(); it4--; while (it1->first < it2->first || it3->first < it4->first) { int x = it1->first; int xx = (++it1)->first; if (xx > x + 1) { set<pair<int, int> > res_s; set<pair<int, int> > res_t; while (1) { it1 = s.begin(); if (it1->first == xx) break; res_s.insert(make_pair(it1->first, it1->second)); res_t.insert(make_pair(it1->second, it1->first)); s.erase(make_pair(it1->first, it1->second)); t.erase(make_pair(it1->second, it1->first)); } return solve(s, t) + solve(res_s, res_t); } x = it2->first; xx = (--it2)->first; if (xx < x - 1) { set<pair<int, int> > res_s; set<pair<int, int> > res_t; while (1) { it2 = s.end(); it2--; if (it2->first == xx) break; res_s.insert(make_pair(it2->first, it2->second)); res_t.insert(make_pair(it2->second, it2->first)); s.erase(make_pair(it2->first, it2->second)); t.erase(make_pair(it2->second, it2->first)); } return solve(s, t) + solve(res_s, res_t); } int y = it3->first; int yy = (++it3)->first; if (yy > y + 1) { set<pair<int, int> > res_s; set<pair<int, int> > res_t; while (1) { it3 = t.begin(); if (it3->first == yy) break; res_s.insert(make_pair(it3->second, it3->first)); res_t.insert(make_pair(it3->first, it3->second)); s.erase(make_pair(it3->second, it3->first)); t.erase(make_pair(it3->first, it3->second)); } return solve(s, t) + solve(res_s, res_t); } y = it4->first; yy = (--it4)->first; if (yy < y - 1) { set<pair<int, int> > res_s; set<pair<int, int> > res_t; while (1) { it4 = t.end(); it4--; if (it4->first == yy) break; res_s.insert(make_pair(it4->second, it4->first)); res_t.insert(make_pair(it4->first, it4->second)); s.erase(make_pair(it4->second, it4->first)); t.erase(make_pair(it4->first, it4->second)); } return solve(s, t) + solve(res_s, res_t); } } return 1; } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d%d , &x, &y); S.insert(make_pair(x, y)); T.insert(make_pair(y, x)); } printf( %d n , solve(S, T)); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, sn, i, j, sum, temp, nl; map<int, int> myMap; vector<int> t[105]; int main() { cin >> n; j = 0; sn = n * n; for (i = sn; i > sn / 2; i--) { t[j % n].push_back(i); t[j % n].push_back(sn - i + 1); j++; } for (i = 0; i < n; i++) { nl = t[i].size(); for (j = 0; j < nl; j++) cout << t[i][j] << ; cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int Number[12][12]; int Next[110]; double dp[110]; int main() { for (int i = 1; i <= 10; i++) for (int j = 1; j <= 10; j++) Number[i][j] = (10 - i) * 10 + (i % 2 == 0 ? j : 11 - j); for (int i = 1; i <= 10; i++) { for (int j = 1; j <= 10; j++) { int x; scanf( %d , &x); if (x == 0) Next[Number[i][j]] = Number[i][j]; else Next[Number[i][j]] = Number[i - x][j]; } } dp[100] = 0; double c = 1; for (int i = 99; i >= 94; i--) { dp[i] = (c + 6 - (100 - i)) / (100 - i); c += dp[i] + 1; } for (int i = 93; i >= 1; i--) { double temp = 0; for (int j = 1; j <= 6; j++) temp += min(dp[i + j], dp[Next[i + j]]); dp[i] = temp / 6 + 1; } printf( %.10f n , dp[1]); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int a, b, c, d; cin >> a >> b >> c >> d; if (a < b) swap(a, b); if (c < d) swap(c, d); cout << ((a == c && b + d == a) ? Yes n : No n ); } } |
#include <bits/stdc++.h> int main() { int64_t d1, d2, d3; std::cin >> d1 >> d2 >> d3; int64_t dist = d1 + d2 + d3; dist = std::min(dist, 2 * d1 + 2 * d2); dist = std::min(dist, 2 * d1 + 2 * d3); dist = std::min(dist, 2 * d2 + 2 * d3); std::cout << dist << std::endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 2e9; long long gcd(long long a, long long b) { while (b) { a %= b; swap(a, b); } return a; } int main() { long long l, r, x, y; cin >> l >> r >> x >> y; long long d = 1; long long res = 0; map<int, int> m; while (d * d <= y) { if (y % d == 0) { if (!m[min(y / d, d * x)] && d * x >= l && d * x <= r && y / d >= l && y / d <= r && gcd(d * x, y / d) == x) { res++; if (d * x != y / d) res++; m[min(y / d, d * x)]++; } } d++; } cout << res << endl; } |
#include <bits/stdc++.h> using namespace std; const int N = 50010; const int mod = 998244353; int n; const int a[16] = {0, 4, 8, -1, 16, -10, 4, -12, -48, 26, -44, 15, -16, -4, -4, -1}; int f[N] = {0, 0, 0, 24, 4, 240, 204, 1316, 2988, 6720, 26200, 50248, 174280, 436904, 1140888, 3436404}; int main() { for (int i = 16; i <= 50000; i++) for (int j = 0; j <= 15; j++) f[i] = ((f[i] + 1ll * a[j] * f[i - j - 1]) % mod + mod) % mod; scanf( %d , &n); printf( %d n , f[n]); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 5e2; pair<pair<int, int>, bool> pr[maxn][maxn][2]; queue<pair<pair<int, int>, bool> > q; vector<int> neighbor[maxn]; void bfs(int s, int t) { for (int i = 0; i < maxn; i++) for (int j = 0; j < maxn; j++) for (int k = 0; k < 2; k++) pr[i][j][k] = make_pair(make_pair(-1, -1), false); q.push(make_pair(make_pair(s, t), 0)); while (!q.empty()) { int v = q.front().first.second, u = q.front().first.first; bool b = q.front().second; q.pop(); if (!b) { for (int i = 0; i < neighbor[u].size(); i++) if (pr[neighbor[u][i]][v][!b].first.first == -1) { pr[neighbor[u][i]][v][!b] = make_pair(make_pair(u, v), b); q.push(make_pair(make_pair(neighbor[u][i], v), !b)); } } else { for (int i = 0; i < neighbor[v].size(); i++) if (pr[u][neighbor[v][i]][!b].first.first == -1 && neighbor[v][i] != u && (u != s || neighbor[v][i] != t)) { pr[u][neighbor[v][i]][!b] = make_pair(make_pair(u, v), b); q.push(make_pair(make_pair(u, neighbor[v][i]), !b)); } } } } int main() { int n, m; cin >> n >> m; for (int i = 0; i < m; i++) { int u, v; cin >> u >> v; neighbor[u - 1].push_back(v - 1); neighbor[v - 1].push_back(u - 1); } bfs(0, n - 1); if (pr[n - 1][0][0].first.first == -1) cout << -1; else { vector<int> fi, se; pair<pair<int, int>, bool> kl = make_pair(make_pair(n - 1, 0), 0); while (kl.first.first != -1) { if (kl.second) se.push_back(kl.first.second); else fi.push_back(kl.first.first); kl = pr[kl.first.first][kl.first.second][kl.second]; } cout << fi.size() - 1 << endl; for (int i = fi.size() - 1; i > -1; i--) cout << fi[i] + 1 << ; cout << endl; for (int i = se.size() - 1; i > -1; i--) cout << se[i] + 1 << ; cout << 1; } } |
#include <bits/stdc++.h> using namespace std; long long n, m; pair<long long, long long> seg[500000 + 1]; long long dp[20 + 1][500000 + 1]; signed main() { cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(false); cin >> n >> m; for (long long i = 1; i < n + 1; i++) { long long l, r; cin >> l >> r; seg[i] = {l, r}; if (dp[0][l] < r) { dp[0][l] = r; } } for (long long i = 1; i < 500000 + 1; i++) { dp[0][i] = max(dp[0][i], dp[0][i - 1]); if (dp[0][i] < i) dp[0][i] = 0; } for (long long i = 1; i < 20 + 1; i++) { for (long long j = 0; j < 500000 + 1; j++) { dp[i][j] = dp[i - 1][dp[i - 1][j]]; if (dp[i][j] < j) dp[i][j] = 0; } } for (long long j = 1; j < m + 1; j++) { long long x, y; cin >> x >> y; long long ans = 0; for (long long i = 20; i >= 0; i--) { if (dp[i][x] < y and dp[i][x] != 0) { ans += (1 << i); x = dp[i][x]; } } if (dp[0][x] >= y) cout << ans + 1 << n ; else cout << -1 << n ; } } |
#include <bits/stdc++.h> using namespace std; int param[51][51], n, targ; vector<int> visted(51); stack<int> s; bool dfs(int root) { if (root == targ) { return true; } if (visted[root] == 0) s.push(root); visted[root] = 1; int nxt = -1; for (int i = 1; i <= n; i++) { if (param[root][i] == 1 && visted[i] == 0) { nxt = i; } } if (nxt == -1 && s.size() > 1) { s.pop(); nxt = s.top(); } if (nxt != -1) dfs(nxt); else return false; } int GetNumberOfDigits(int i) { return i > 0 ? (int)log2(i) + 1 : 1; } int main() { int n, m, d, mx = 0, ret = 0; vector<int> v; cin >> n >> m; for (int i = int(0); i < int(n); i++) { cin >> d; v.push_back(d); } int tm; mx = m; for (int i = int(0); i < int(n); i++) { tm = m; if (v[i] <= tm) { ret = tm / v[i]; tm -= (ret * v[i]); } else { continue; } for (int j = int(i + 1); j < int(n); j++) { int x = v[j] * ret + tm; if (mx < x) mx = x; } } cout << mx; return 0; } |
#include <bits/stdc++.h> using namespace std; long long int MOD = 1e9 + 7; const int N = 1e6 + 5, M = 1e5 + 10, NM1 = N - 1; long long int OO = 1e18 + 8; int oo = 1e9 + 8; void readFile() {} int n, m, l, r, x, top, arr[N], st[N]; long long int sum[N]; int main() { readFile(); scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , arr + i); for (int i = 1; i <= n + 1; i++) { while (arr[i] < arr[st[top]]) { l = st[top] - st[top - 1]; r = i - st[top]; sum[1] += x = arr[st[top--]]; sum[l + 1] -= x; sum[r + 1] -= x; sum[l + r + 1] += x; } st[++top] = i; } for (int i = 1; i <= n; i++) sum[i] += sum[i - 1]; for (int i = 1; i <= n; i++) sum[i] += sum[i - 1]; scanf( %d , &m); for (int i = 0; i < m; i++) { scanf( %d , &x); printf( %0.12f n , (double)sum[x] / (n - x + 1.0)); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main(void) { int n, k; int v[200001]; scanf( %d%d , &n, &k); for (int i = 0; i < n; i++) scanf( %d , v + i); sort(v, v + n); int l = 1; int r = 1000000000; int m; for (int it = 0; l <= r and it < 50; it++) { m = l + (r - l) / 2; auto i = upper_bound(v, v + n, m); if ((i - v) > k) r = m; else if ((i - v) == k) break; else l = m + 1; } auto i = upper_bound(v, v + n, m); if ((i - v) == k and (m > 0 and m <= 1000000000)) printf( %d n , m); else printf( -1 n ); return 0; } |
#include <bits/stdc++.h> const int MAXN = 2e5 + 7; struct Edge { int t, next; } edge[MAXN << 1]; int head[MAXN], cnt; int size[MAXN]; int dfn[MAXN], pos[MAXN], ts = 0; int n, m; int dist[MAXN], deep[MAXN]; int f[MAXN][19]; int t1 = 1, t2 = 1; struct SegmentTree; struct Questions; SegmentTree *newNode(int, int, SegmentTree *, SegmentTree *); struct SegmentTree { int l, r, mid; SegmentTree *lc, *rc; int val, add, max; static SegmentTree *build(int l, int r) { SegmentTree *ret = NULL; if (l == r) { ret = newNode(l, r, NULL, NULL); ret->val = ret->max = dist[pos[l]]; return ret; } else { int mid = l + (r - l) / 2; ret = newNode(l, r, build(l, mid), build(mid + 1, r)); ret->pushUp(); return ret; } } void pushUp() { max = std::max(lc->max, rc->max); } void pushDown() { if (add) { lc->plus(add), rc->plus(add); add = 0; } } void plus(int a) { if (l == r) val += a; add += a; max += a; } void solveAdd(int left, int right, int delta) { if (l == left && r == right) return plus(delta); pushDown(); if (right <= mid) lc->solveAdd(left, right, delta); else if (left > mid) rc->solveAdd(left, right, delta); else lc->solveAdd(left, mid, delta), rc->solveAdd(mid + 1, right, delta); pushUp(); } int queryMax(int left, int right) { if (l == left && r == right) return max; pushDown(); if (right <= mid) return lc->queryMax(left, right); else if (left > mid) return rc->queryMax(left, right); else return std::max(lc->queryMax(left, mid), rc->queryMax(mid + 1, right)); } } * root, pool[MAXN], *tail = pool; SegmentTree *newNode(int l, int r, SegmentTree *lc, SegmentTree *rc) { SegmentTree *ret = ++tail; ret->l = l, ret->r = r, ret->mid = l + (r - l) / 2; ret->lc = lc, ret->rc = rc; ret->val = 0, ret->add = 0, ret->max = INT_MIN; return ret; } struct Questions { int u, v, mid; } q[MAXN]; struct Ans { int r, node, pos, ans; } a1[MAXN], a2[MAXN]; std::vector<Ans> v1[MAXN], v2[MAXN]; void add(int u, int v) { cnt++; edge[cnt].t = v; edge[cnt].next = head[u]; head[u] = cnt; } void dfs1(int u, int pre) { f[u][0] = pre; dfn[u] = ++ts; size[u] = 1; pos[ts] = u; for (int e = head[u]; e; e = edge[e].next) { int v = edge[e].t; if (v == pre) continue; dist[v] = dist[u] + 1; deep[v] = deep[u] + 1; dfs1(v, u); size[u] += size[v]; } } int getLca(int x, int y) { if (deep[x] > deep[y]) std::swap(x, y); for (int i = 18; i >= 0; i--) { if (deep[f[y][i]] >= deep[x]) y = f[y][i]; } if (x == y) return x; for (int i = 18; i >= 0; i--) { if (f[x][i] != f[y][i]) { x = f[x][i]; y = f[y][i]; } } return f[x][0]; } int getMid(int u, int len) { int e = 0; while (len) { if (len & 1) u = f[u][e]; len >>= 1; e++; } return u; } void dfs2(int u, int pre) { while (a1[t1].r == u && t1 <= m) { a1[t1].ans = root->queryMax(dfn[a1[t1].node], dfn[a1[t1].node] + size[a1[t1].node] - 1); t1++; } while (a2[t2].r == u && t2 <= m) { if (dfn[a2[t2].node] > 1) a2[t2].ans = std::max(a2[t2].ans, root->queryMax(1, dfn[a2[t2].node] - 1)); if (dfn[a2[t2].node] + size[a2[t2].node] - 1 < n) a2[t2].ans = std::max( a2[t2].ans, root->queryMax(dfn[a2[t2].node] + size[a2[t2].node], n)); t2++; } for (int e = head[u]; e; e = edge[e].next) { int v = edge[e].t; if (v == pre) continue; root->solveAdd(dfn[v], dfn[v] + size[v] - 1, -1); if (dfn[v] > 1) root->solveAdd(1, dfn[v] - 1, 1); if (dfn[v] + size[v] - 1 < n) root->solveAdd(dfn[v] + size[v], n, 1); dfs2(v, u); root->solveAdd(dfn[v], dfn[v] + size[v] - 1, 1); if (dfn[v] > 1) root->solveAdd(1, dfn[v] - 1, -1); if (dfn[v] + size[v] - 1 < n) root->solveAdd(dfn[v] + size[v], n, -1); } } bool cmp1(Ans x, Ans y) { if (dfn[x.r] == dfn[y.r]) return dfn[x.node] < dfn[y.node]; return dfn[x.r] < dfn[y.r]; } bool cmp2(Ans x, Ans y) { return x.pos < y.pos; } int main(int argc, char *argv[]) { scanf( %d , &n); int u, v; for (int i = 1; i <= n - 1; i++) { scanf( %d %d , &u, &v); add(u, v); add(v, u); } deep[1] = 1; dfs1(1, 0); root = SegmentTree::build(1, n); for (int j = 1; j <= 18; j++) { for (int i = 1; i <= n; i++) { f[i][j] = f[f[i][j - 1]][j - 1]; } } int lca, len, mid; scanf( %d , &m); for (int i = 1; i <= m; i++) { scanf( %d %d , &u, &v); lca = getLca(u, v); len = dist[u] + dist[v] - 2 * dist[lca]; if (deep[u] < deep[v]) std::swap(u, v); mid = getMid(u, (len - 1) / 2); q[i] = Questions{u, v, mid}; a1[i] = Ans{u, mid, i, INT_MIN}; a2[i] = Ans{v, mid, i, INT_MIN}; } std::sort(a1 + 1, a1 + m + 1, cmp1); std::sort(a2 + 1, a2 + m + 1, cmp1); dfs2(1, 0); std::sort(a1 + 1, a1 + m + 1, cmp2); std::sort(a2 + 1, a2 + m + 1, cmp2); for (int i = 1; i <= m; i++) { printf( %d n , std::max(a1[i].ans, a2[i].ans)); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 998244353; vector<vector<int>> edges; long long DP[200010]; long long fac[200010]; void solve(const int u, const int p) { DP[u] = 1; int tot = 0; for (auto& e : edges[u]) { if (e != p) { tot++; solve(e, u); DP[u] = (DP[u] * DP[e]) % MOD; } } DP[u] = (DP[u] * fac[tot]) % MOD; if (u != 1 && tot) DP[u] = ((tot + 1) * DP[u]) % MOD; } int main() { fac[0] = 1; for (int i = 1; i <= 200000; i++) fac[i] = (fac[i - 1] * i) % MOD; int N, t, f; scanf( %d , &N); edges.assign(N + 5, vector<int>()); for (int i = 0; i < N - 1; i++) { scanf( %d %d , &t, &f); edges[t].push_back(f); edges[f].push_back(t); } solve(1, 1); printf( %d n , int((N * DP[1]) % MOD)); return 0; } |
#include <bits/stdc++.h> long long int lcm, k, ans, a, b; using namespace std; int main() { int n; cin >> n; map<int, int> mp; mp[n] = 1; n++; int c = 1; while (1) { if (mp[n] == 1 && n % 10 != 0) break; else { if (n % 10 == 0) { while (n % 10 == 0) n /= 10; } else { mp[n] = 1; n++; c++; } } } cout << c << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const long double pi = acos(-1); const long long md = 1e9 + 7; long long r, b, i, x, y; int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> r >> b; for (i = 1; i <= r + b; i++) cin >> x >> y; cout << (r == b ? Yes : No ) << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m, kecil, tamp1 = 0, tamp2 = 0, tambah = 0; cin >> n; cin >> m; tamp1 = n; tamp2 = m; while (n != 0) { n = tamp1; if (tambah >= 1) m += tamp2; if (m > n) { cout << -1; return 0; } for (int i = 0; i < m; i++) { if (n == m - i) n -= 1; else n -= 2; } tambah++; } cout << m; } |
#include <bits/stdc++.h> using namespace std; void input(long long ara[], long long n) { for (long long i = 0; i < n; i++) cin >> ara[i]; } void output(long long ara[], long long n) { for (long long i = 0; i < n; i++) cout << ara[i] << ; } long long mx1(long long ara[], long long n) { long long mx = -1; for (long long i = 0; i < n; i++) if (ara[i] > mx) mx = ara[i]; return mx; } long long mn1(long long ara[], long long n) { long long mn = 1e18; for (long long i = 1; i <= n; i++) if (ara[i] < mn) mn = ara[i]; return mn; } int maxSubArraySum(long long a[], long long size) { long long max_so_far = INT_MIN, max_ending_here = 0; for (long long i = 0; i < size; i++) { max_ending_here = max_ending_here + a[i]; if (max_so_far < max_ending_here) max_so_far = max_ending_here; if (max_ending_here < 0) max_ending_here = 0; } return max_so_far; } int main() { (ios_base::sync_with_stdio(false), cin.tie(NULL)); long long t; cin >> t; while (t--) { long long n; cin >> n; long long ara[n + 1]; input(ara, n); long long k = 0, sum = 0; for (long long i = 0; i < n; i++) { sum += ara[i]; if (sum <= 0) { k = 1; } } sum = 0; for (long long i = n - 1; i >= 0; i--) { sum += ara[i]; if (sum <= 0) { k = 1; break; } } if (k == 1) cout << NO << endl; else cout << YES << endl; } } |
#include <bits/stdc++.h> using namespace std; __int128 read() { __int128 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; } void print(__int128 x) { if (x < 0) { putchar( - ); x = -x; } if (x > 9) print(x / 10); putchar(x % 10 + 0 ); } __int128 gcd(__int128 a, __int128 b) { return b ? gcd(b, a % b) : a; } __int128 ex_gcd(__int128 a, __int128 b, __int128& x, __int128& y) { if (b == 0) { x = 1; y = 0; return a; } __int128 d = ex_gcd(b, a % b, x, y); __int128 temp = x; x = y; y = temp - a / b * y; return d; } bool liEu(__int128 a, __int128 b, __int128 c, __int128& x, __int128& y) { __int128 d = ex_gcd(a, b, x, y); if (c % d != 0) return 0; __int128 k = c / d; x *= k; y *= k; return 1; } signed main() { __int128 n, p, w, d; n = read(); p = read(); w = read(); d = read(); __int128 x, y; if (!liEu(w, d, p, x, y)) return (std::cout << -1 n , 0); __int128 t = d / gcd(w, d); __int128 xt = (x % t + t) % t; __int128 yt = (p - w * xt) / d; if (xt >= 0 && yt >= 0 && xt + yt <= n) { print(xt); printf( ); print(yt); printf( ); print(n - xt - yt); printf( n ); return 0; } t = w / gcd(w, d); yt = (y % t + t) % t; xt = (p - d * yt) / w; if (xt >= 0 && yt >= 0 && xt + yt <= n) { print(xt); printf( ); print(yt); printf( ); print(n - xt - yt); printf( n ); return 0; } std::cout << -1 << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const double pi = acos(-1); const double eps = 1e-6; const long long INF = 0x3f3f3f3f3f3f3f3fll; const int inf = 0x3f3f3f3f; const int mod = 998244353; const int maxn = 1e6 + 100; long long qpow(long long a, long long b) { long long ret = 1; a %= mod; while (b) { if (b & 1) ret = ret * a % mod; b /= 2; a = a * a % mod; } return ret; } void solve() { long long w, h; scanf( %lld%lld , &w, &h); cout << qpow(2LL, w + h) << endl; } int main() { solve(); ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n; cin >> n; string s; cin >> s; int depth = 0; for (int i = 0; i < n; i++) { depth += (s[i] == ( ? 1 : -1); } if (depth != 2 && depth != -2) { cout << 0 n ; return 0; } if (depth == 2) { depth = 0; int ans = 0; bool can = true; for (int i = 0; i < n; i++) { if (s[i] == ( ) { if (depth - 1 >= 0) { ans++; } } depth += (s[i] == ( ? 1 : -1); if (depth <= 1) { ans = 0; } if (depth < 0) { can = false; } } if (!can) { cout << 0 n ; return 0; } cout << ans << n ; } else if (depth == -2) { depth = 0; int ans = 0; bool can = true; for (int i = 0; i < n; i++) { if (s[i] == ) ) { ans++; } depth += (s[i] == ( ? 1 : -1); if (depth < 0) { break; } } depth = 0; for (int i = 0; i < n; i++) { depth += (s[i] == ( ? 1 : -1); if (depth < -2) { can = false; } } if (!can) { cout << 0 n ; return 0; } cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = int(1e9) + 7; int n; int a[100000], b[100000]; int who[200005]; bool used[200005] = {}; vector<int> g[200005]; int mul; int far[200005]; int tr[200005]; void dfs(int v) { ++mul; used[v] = true; for (int to : g[v]) { dfs(to); } } int main() { scanf( %d , &n); for (int i = 0; i < (int)(n); ++i) { scanf( %d%d , a + i, b + i); --a[i]; --b[i]; g[b[i]].push_back(a[i]); } memset(who, -1, sizeof who); for (int i = 0; i < (int)(n); ++i) who[a[i]] = i; int ans = 1; for (int i = 0; i < (int)(2 * n); ++i) if (who[i] == -1) { mul = 0; dfs(i); ans = (long long)ans * mul % MOD; } memset(far, -1, sizeof far); for (int i = 0; i < (int)(n); ++i) far[a[i]] = b[i]; for (int _ = 0; _ < (int)(25); ++_) for (int i = 0; i < (int)(2 * n); ++i) { if (far[i] != -1) { far[i] = far[far[i]]; } } for (int i = 0; i < (int)(n); ++i) tr[a[i]] = b[i]; for (int i = 0; i < (int)(2 * n); ++i) if (far[i] != -1 && !used[far[i]]) { int c = 0; for (int x = far[i]; !used[x]; x = tr[x]) { ++c; used[x] = true; } if (c > 1) { ans = 2ll * ans % MOD; } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 40; int num[MAXN]; int a[MAXN]; int pref[MAXN]; bool isneg = false; int n; int max_k; int mabs(int x) { if (x < 0) { return -x; } return x; } void neg() { isneg = !isneg; for (int i = 0; i < MAXN; ++i) { num[i] = -num[i]; a[i] = -a[i]; } } void bin() { int carry = 0; for (int i = 0; i < MAXN; ++i) { if (mabs(num[i] + carry) % 2 == 0) { carry = (num[i] + carry) / 2; num[i] = 0; } else { carry = (num[i] + carry - 1) / 2; num[i] = 1; } } } void calc_pref() { pref[0] = num[0]; for (int i = 1; i < MAXN; ++i) { pref[i] = pref[i - 1] + num[i]; } } int cnt_ones(int from, int to) { if (from < to) { return 0; } return pref[from] - (to > 0 ? pref[to - 1] : 0); } void prepare_num() { int carry = 0; for (int i = 0; i < MAXN; ++i) { if (mabs(num[i] + carry) % 2 == 0) { carry = (num[i] + carry) / 2; } else { carry = (num[i] + carry - 1) / 2; } } if (carry < 0) { neg(); } bin(); } void add(int x, int power) { int k = x < 0 ? -1 : 1; x = k * x; while (x != 0) { num[power++] += k * (x % 2); x /= 2; } } bool try_for(int index) { bool zero_allowed = index != n; int a_i = a[index]; int k = a_i < 0 ? -1 : 1; a_i *= k; int carry = 0; long long cur_num = 0; int power = 0; for (int i = 0; i <= 32; ++i) { int cur_digit = num[index++] - k * (a_i % 2) + carry; a_i /= 2; if (mabs(cur_digit) % 2 == 0) { carry = cur_digit / 2; } else { carry = (cur_digit - 1) / 2; cur_num += 1ll << power; } ++power; if (cnt_ones(MAXN - 1, index) == 0 && carry == -1) { while (cur_num > 0) { cur_num += 1ll << (power++); } break; } } if (cnt_ones(MAXN - 1, index) != 0 || (carry != 0 && carry != -1) || cur_num > max_k || cur_num < -max_k || (cur_num == 0 && !zero_allowed)) { return false; } else { return true; } } int main() { scanf( %d%d , &n, &max_k); for (int i = 0; i <= n; ++i) { scanf( %d , &a[i]); add(a[i], i); } prepare_num(); calc_pref(); int ans = 0; for (int i = 0; i <= n; ++i) { if (cnt_ones(i - 1, 0) > 0) { break; } ans += try_for(i); } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long maxn = 2e5 + 8, inf = 1e18 + 9, mod = 1e9 + 7; char s[maxn]; long long n, m; void solve() { long long i, j, ans = 1; cin >> n >> (s + 1); for (i = 2; i <= n; i++) if (s[i] != s[i - 1]) ans++; cout << min(ans + 2, n) << endl; } signed main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); long long t = 1; while (t--) solve(); return 0; } |
#include <bits/stdc++.h> int main() { int x, y; scanf( %d%d , &x, &y); int i = 1; while (1) { if (y < 2 || ((100 * x) + (10 * y)) < 220) { if (i & 1 == 1) printf( Hanako ); else printf( Ciel ); return 0; } if (i & 1 == 1) { if (x >= 2) { x -= 2; y -= 2; } else { y -= ((220 - (100 * x))) / 10; x = 0; } } else { if (y >= 22) y -= 22; else if (y >= 12) { x--; y -= 12; } else { x -= 2; y -= 2; } } i++; } return 0; } |
#include <bits/stdc++.h> using namespace ::std; const long long maxn = 1e5 + 500; const long long mod = 1e9 + 7; const long long inf = 1e9 + 500; long long out[maxn]; long long in[maxn]; long long a[maxn]; long long b[maxn]; long long dp[2][maxn]; int main() { fill(out, out + maxn, -1); fill(in, in + maxn, -1); long long n, q, t; cin >> n >> q >> t; for (long long i = 0; i < n; i++) { cin >> a[i]; } for (long long i = 0; i < q; i++) { long long v, u; cin >> v >> u; v--; u--; out[u] = v; in[v] = u; } for (long long i = 0; i < n; i++) { for (long long j = 0; j < n; j++) { if (out[j] == -1) { b[j] = a[j]; } else { if (b[out[j]] != 0) { b[j] = b[out[j]] + a[j]; } } } } for (long long i = 0; i < n; i++) { if (b[i] == 0) { cout << 0; return 0; } if (in[i] != -1) { t -= b[i]; } } if (t < 0) { cout << 0; return 0; } dp[1][0] = 1; for (long long i = 0; i < n; i++) { for (long long j = 0; j < b[i]; j++) { dp[i & 1][j] = dp[(i & 1) ^ 1][j]; } for (long long j = b[i]; j <= t; j++) { dp[i & 1][j] = ((long long)dp[(i & 1) ^ 1][j] + dp[(i & 1)][j - b[i]]) % mod; } } cout << dp[(n - 1) & 1][t]; } |
#include <bits/stdc++.h> using namespace std; int main() { int T; cin >> T; while (T--) { long long n, k; cin >> n >> k; long long cur = 1, now = 1, ans = 0; while (now <= k && cur < n) { cur += now; now <<= 1; ans++; } if (cur < n) { ans += (n - cur + k - 1) / k; } printf( %lld n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, a, b; int check(int p) { int res; res = a / p + b / p; if (a / p == 0 || b / p == 0) return 0; if (res >= n) return 1; else return 0; } int main() { int l, r, mid; scanf( %d%d%d , &n, &a, &b); r = a + b; l = 1; while (r - l > 1) { mid = (r + l) / 2; if (check(mid)) l = mid; else r = mid; } printf( %d n , l); return 0; } |
#include <bits/stdc++.h> using namespace std; struct node { int u; long long int cost; node(int _u, long long int _cost) { u = _u; cost = _cost; } bool operator<(const node& p) const { return (long long int)cost < (long long int)p.cost; } }; int numNodes, numEdges; int source; bool p; vector<vector<int> > G; map<pair<int, int>, int> cost; vector<long long int> dist; vector<int> par; void clear() { G.clear(); cost.clear(); dist.clear(); } void dijstkra() { priority_queue<pair<long long int, int>, vector<pair<long long int, int> >, greater<pair<long long int, int> > > q; dist[source] = 0LL; q.push({0LL, source}); while (!q.empty()) { int u = q.top().second; q.pop(); for (auto v : G[u]) { if (dist[u] + cost[{u, v}] < dist[v]) { dist[v] = dist[u] + cost[{u, v}]; par[v] = u; q.push({dist[v], v}); } } } } void find_path(int s, int e) { if ((s == e) || (e == -1)) { if (p) cout << ; p = true; cout << s; } else { find_path(s, par[e]); if (p) cout << ; p = true; cout << e; } } int main() { ios_base::sync_with_stdio(false); p = false; source = 1; cin >> numNodes >> numEdges; dist.resize(numNodes + 1, LLONG_MAX); par.resize(numNodes + 1, -1); G.resize(numNodes + 1); for (int i = 1; i <= numEdges; i++) { int u, v; int w; cin >> u >> v >> w; G[u].push_back(v); G[v].push_back(u); cost[pair<int, int>(u, v)] = w; cost[pair<int, int>(v, u)] = w; } dijstkra(); if (par[numNodes] == -1) { cout << -1 n ; return 0; } find_path(source, numNodes); clear(); } |
#include <bits/stdc++.h> using namespace std; int Id[2 * 105]; int L[2 * 105]; int W[2 * 105]; long long int dp[2 * 105][3005]; bool vis[2 * 105][3005]; int n, l; long long int solve(int LastTp, int Len) { if (Len > l) return 0LL; if (Len == l) return 1LL; if (vis[LastTp][Len] == 1) return dp[LastTp][Len]; vis[LastTp][Len] = 1; long long int ret = 0; for (int i = 1; i <= n; i++) { if (Id[i] == Id[LastTp]) continue; if (W[LastTp] == L[i]) ret = (ret + solve(i, Len + L[i])) % 1000000007; } return dp[LastTp][Len] = ret; } int main() { int N, x, y; scanf( %d %d , &N, &l); for (int i = 1; i <= N; i++) { scanf( %d %d , &x, &y); L[++n] = x; W[n] = y; Id[n] = i; if (x != y) { L[++n] = y; W[n] = x; Id[n] = i; } } long long int Sum = 0; for (int i = 1; i <= n; i++) Sum = (Sum + solve(i, L[i])) % 1000000007; cout << Sum << endl; } |
#include <bits/stdc++.h> using namespace std; long long n; int sum = 1; int main() { cin >> n; for (int i = 1; i < n; i++) sum += i * 12; cout << sum; return 0; } |
#include <bits/stdc++.h> using namespace std; int main(int argc, const char* argv[]) { int n, cnt = 0; cin >> n; int a[100]; memset(a, 0, sizeof(a)); for (int i = 0; i < n; i++) { int k, x = 0; cin >> k; while (k != 0) { x = x + k % 10; k = k / 10; } a[x]++; } for (int i = 1; i < 100; i++) { while (a[i] > 0) { a[i] = a[i] - 1; for (int j = i; j < 100; j++) { if (a[j] > 0 && (i + j) % 3 == 0) { cnt++; a[j]--; break; } } } } cout << cnt; return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.