Datasets:
malteklaes
/
cpp-code-code_search_net-style

Dataset card Data Studio Files
xet
Community
1
func_code_string
stringlengths
59
71.4k
#include <bits/stdc++.h> using namespace std; int main(int argc, char const *argv[]) { long long n; cin >> n; vector<long long> a(n); for (int i = 0; i < n - 1; ++i) { long long u, v; cin >> u >> v; a[u - 1]++; a[v - 1]++; } for (int i = 0; i < n; ++i) { if (a[i] == 2) return cout << NO , 0; } cout << YES ; return 0; }
#include <bits/stdc++.h> using namespace std; double dp[2020][2020]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, t; double p; cin >> n >> p >> t; dp[0][0] = 1; for (int i = 1; i <= t; i++) dp[i][0] = dp[i - 1][0] * (1 - p); for (int i = 1; i <= t; i++) { for (int j = 1; j <= i; j++) dp[i][j] = dp[i - 1][j] * (j >= n ? 1 : (1 - p)) + dp[i - 1][j - 1] * p; } double ans = 0; for (int i = 1; i <= (n < t ? n : t); i++) ans += i * (dp[t][i]); printf( %.10lf , ans); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; long long ans = 0; for (int i = (0); i < (n); ++i) { long long t, T, x, cost; cin >> t >> T >> x >> cost; if (t >= T) { ans += cost + m * x; continue; } long long aux1 = cost; if (m > (T - t)) aux1 += m * x; long long aux2 = (long long)ceil((double)(m - (T - t)) / (T - t)) + 1; aux2 *= cost; ans += min(aux1, aux2); } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 200010; struct E { int to, nxt; } e[N << 1]; int n, m, head[N], cnt, l[N], r[N], ans[N], ans_cnt, fa[N]; bool b[N]; int Write[20], WRI; void judge() { freopen( .in , r , stdin); freopen( .out , w , stdout); } int read() { int d = 0, f = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) f = -1; c = getchar(); } while (c >= 0 && c <= 9 ) d = d * 10 + c - 48, c = getchar(); return d * f; } void write(int x) { if (!x) { putchar( 0 ); return; } if (x < 0) putchar( - ), x = -x; for (WRI = 1; x; x /= 10, WRI++) Write[WRI] = x % 10; for (int i = WRI - 1; i; i--) putchar((char)(Write[i] + 48)); } void add(int x, int y) { e[++cnt] = (E){y, head[x]}; head[x] = cnt; } void addedge(int x, int y) { add(x, y); add(y, x); } void del(int x) { b[x] = 1; r[l[x]] = r[x]; l[r[x]] = l[x]; } void bfs(int ljj) { queue<int> q; int sum = 1; q.push(ljj); while (!q.empty()) { int u = q.front(); q.pop(); for (int i = head[u]; i; i = e[i].nxt) { int v = e[i].to; fa[v] = u; } for (int i = r[0]; i <= n; i = r[i]) if (fa[i] != u && !b[i]) { q.push(i); del(i); sum++; } } ans[++ans_cnt] = sum; } int main() { n = read(); m = read(); for (int i = 1; i <= m; i++) addedge(read(), read()); for (int i = 0; i <= n; i++) l[i] = i - 1, r[i] = i + 1; for (int i = 1; i <= n; i = r[i]) if (!b[i]) { del(i); bfs(i); } sort(ans + 1, ans + 1 + ans_cnt); write(ans_cnt); puts( ); for (int i = 1; i <= ans_cnt; i++) write(ans[i]), putchar( ); return 0; }
#include <bits/stdc++.h> using namespace std; int l, r, n, k, m, now, tot, all; int a[200000], s[200000]; struct fk { int num, val; bool operator==(const fk &b) { return (num + b.num == k && val == b.val); } } tp[200000]; int main() { scanf( %d%d%d , &n, &k, &m); for (int i = 1; i <= n; ++i) scanf( %d , a + i); all = 0; tp[0].num = tp[0].val = -1; for (int i = 1; i <= n; ++i) { if (a[i] == tp[all].val) { ++tp[all].num; if (tp[all].num == k) --all; } else { tp[++all].val = a[i]; tp[all].num = 1; } } n = 0; for (int i = 1; i <= all; ++i) n += tp[i].num; int p = 0; for (int i = 1; i <= all; ++i) { if (tp[i] == tp[all - i + 1]) p = i; else break; } long long ans = 0, temp; if (p >= (all + 1) / 2) { if (m % 2) for (int i = 1; i <= all; ++i) ans += tp[i].num; } else if (all % 2 == 1 && p == all / 2) { temp = m % k * tp[p + 1].num % k; if (temp % k == 0) ans = 0; else { ans = (long long)p * k; ans = ans + temp; } } else { ans = (long long)m * n; for (int i = 1; i <= p; ++i) ans -= (long long)p * k * (m - 1); ans -= (tp[p + 1].val == tp[all - p].val && tp[p + 1].num + tp[all - p].num >= k) ? (long long)k * (m - 1) : 0; } printf( %I64d n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n; int ans = 0; scanf( %d , &n); for (int i = 1; i <= n; i++) for (int j = i; j <= n; j++) { int k = i ^ j; if (k <= n && k >= 1 && k >= j && i + j > k) ans++; } printf( %d , ans); }
#include <bits/stdc++.h> using namespace std; int main() { string s; int n, c = 0; cin >> n; for (int i = 0; i < n; i++) { cin >> s; c = s == Tetrahedron ? c += 4 : c; c = s == Cube ? c += 6 : c; c = s == Octahedron ? c += 8 : c; c = s == Dodecahedron ? c += 12 : c; c = s == Icosahedron ? c += 20 : c; } cout << c; return 0; }
#include <bits/stdc++.h> using namespace std; void imprimirVector(vector<int> v) { if (!v.empty()) { int p = v.size(); cout << [ ; for (int i = 0; i < (int)(p - 1); i++) cout << v[i] << , ; cout << v[p - 1] << ] << endl; } else cout << [] << endl; } int toNumber(string s) { int Number; if (!(istringstream(s) >> Number)) Number = 0; return Number; } string toString(int number) { ostringstream ostr; ostr << number; return ostr.str(); } int main() { long long n; cin >> n; vector<bool> v(n + 1, false); vector<long long> a(n); vector<long long> ans(n); vector<long long> faltan; for (int i = 0; i < (int)(n); i++) { cin >> a[i]; if (a[i] <= n && !v[a[i]]) { ans[i] = a[i]; v[a[i]] = true; } else faltan.push_back(i); } for (int i = (1); i < (int)(n + 1); i++) { if (!v[i]) { long long r = faltan.back(); faltan.pop_back(); ans[r] = i; } } for (int i = 0; i < (int)(n); i++) { if (i) cout << ; cout << ans[i]; } cout << endl; return 0; }
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) #pragma GCC optimize( -Ofast , -funroll-all-loops , -ffast-math ) using namespace std; using LL = long long; constexpr LL mod = 1e9 + 7; long long ex_gcd(long long a, long long b, long long &x, long long &y) { if (!b) { x = 1; y = 0; return a; } long long ret = ex_gcd(b, a % b, y, x); y -= a / b * x; return ret; } LL mul(LL u, LL v, LL p) { return (u * v - LL((long double)u * v / p) * p + p) % p; } LL bin(LL x, LL n, LL MOD) { LL ret = MOD != 1; for (x %= MOD; n; n >>= 1, x = x * x % MOD) if (n & 1) ret = ret * x % MOD; return ret; } LL norm(LL x) { return x >= mod ? (x - mod) : x; } inline LL get_inv(LL x, LL p) { return bin(x, p - 2, p); } inline long long get_inv(long long a) { long long x, y; ex_gcd(a, mod, x, y); return norm(x + mod); } template <class T> inline void umin(T &x, T y) { x = x > y ? y : x; } template <class T> inline void umax(T &x, T y) { x = x < y ? y : x; } template <class T> inline void dec(T &x, T y) { x -= y; if (x < 0) x += mod; } template <class T> inline void add(T &x, T y) { x += y; if (x >= mod) x -= mod; } template <typename T> void read(T &x) { cin >> x; } template <typename T, typename... Args> void read(T &first, Args &...args) { read(first); read(args...); } template <class T> LL ctz(T a) { return sizeof(T) > 2 ? __builtin_ctzll(a) : __builtin_ctz(a); } template <class T> inline T gcd(T _a, T _b) { T a = abs(_a), b = abs(_b); LL shift = ctz(a | b); for (b >>= ctz(b), a >>= ctz(a); a; a -= b, a >>= ctz(a)) if (a < b) swap(a, b); return b << shift; } const double PI = acos(-1.0); constexpr LL INF = 0x3f3f3f3f; constexpr long long linf = 0x3f3f3f3f3f3f3f3f; constexpr unsigned long long base = 2333, P_1 = 19260817, P_2 = 999998639; constexpr LL maxn = 1e6 + 10; LL n, ans, a[maxn], s[maxn]; vector<LL> v[maxn]; int32_t main() { std::ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr), cout << fixed << setprecision(10); cin >> n; for (LL i = (1), _i = (n + 1); i < _i; ++i) cin >> a[i], v[a[i]].emplace_back(i); LL mx = 0, mx_num = 0; for (LL i = 1; i <= n; i++) { if (int32_t(v[i].size()) > mx) mx_num = i, mx = int32_t(v[i].size()); else if (int32_t(v[i].size()) == mx) mx_num = -1; } if (mx_num == -1) { cout << n << 12 ; } else { s[0] = 0; for (LL i = 1; i <= n; i++) { s[i] = s[i - 1] + (a[i] == mx_num); } for (LL i = 1; i <= n; i++) { if (int32_t(v[i].size()) and i != mx_num) { vector<LL> tp(400010), p(400010); tp[0] = 200000; for (LL j = 1; j <= n; j++) { tp[j] = tp[j - 1] + (a[j] == mx_num) - (a[j] == i); } for (LL j = n; j >= 0; j--) { if (!p[tp[j]]) p[tp[j]] = j; else umax(ans, p[tp[j]] - j); } } } cout << ans << 12 ; } return 0; }
#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); } string toBin(long long a) { string res = ; while (a) { res += char((a & 1) + 0 ); a >>= 1; } reverse(res.begin(), res.end()); return res; } const int mod = 1e9 + 7; long long expo(long long base, long long pow) { long long ans = 1; while (pow != 0) { if (pow & 1 == 1) { ans = ans * base; ans = ans % mod; } base *= base; base %= mod; pow /= 2; } return ans; } long long inv(long long x) { return expo(x, mod - 2); } double pi = 3.141592653589793238462643; double error = 0.0000001; const int M = 100001; int main() { int k, a, b, v; cin >> k >> a >> b >> v; int tot = 0; int box = 0; while (true) { int sect = min(b + 1, k); b -= (sect - 1); tot += sect * v; box++; if (tot >= a) break; } cout << box; }
#include <bits/stdc++.h> using namespace std; const int maxn = 1000010; long long N, S; long long fa[maxn], q[maxn], d[maxn], head, tail, sz[maxn], son[maxn]; bool check(long long Mid) { long long tN = N, now = 1, p = 1, res = 0; while (tN) { res += min(p, tN) * now; if (res > S) return false; tN -= min(p, tN); p *= Mid; now++; } return true; } int main() { cin >> N >> S; long long Mn = N + N - 1; long long Mx = N * (N + 1) / 2; if (S < Mn || S > Mx) return puts( NO ), 0; long long L = 1, R = N - 1, Mid, res; while (L <= R) { Mid = (L + R) / 2; if (check(Mid)) res = Mid, R = Mid - 1; else L = Mid + 1; } puts( YES ); for (int i = 1; i <= N; i++) sz[i] = 1; long long Now = Mx, D = 2; for (int i = N;; i--) { if (Now == S) break; if (sz[D] == sz[D - 1] * res) D++; if (Now - S >= i - D) { sz[D]++; sz[i]--; Now -= (i - D); } else { sz[i]--; sz[i - (Now - S)]++; Now = S; } } head = tail = 1; q[head] = 1; d[1] = 1; long long p = 1; for (int i = 2; i <= N; i++) { if (sz[i] == 0) break; L = p + 1; R = p + sz[i]; for (int j = L; j <= R; j++) { while (d[q[head]] != i - 1 || son[q[head]] == res) { head++; } fa[j] = q[head]; son[q[head]]++; q[++tail] = j; d[j] = i; } p = R; } for (int i = 2; i <= N; i++) printf( %lld , fa[i]); }
#include <bits/stdc++.h> using namespace std; const int inf = 1e9 + 7; const int maxN = 2e6 + 5; string s[maxN]; int type[maxN]; int n; pair<int, int> rang[3]; int sum[maxN]; bool in_range(int x, int type) { return x >= rang[type].first && x <= rang[type].second; } int conv(string s) { if (s[0] == 0 ) return inf; int pow = 1; int ans = 0; for (int i = ((int)s.size() - 1); i >= (0); --i) { if (s[i] < 0 || s[i] > 9 ) { return inf; } ans += (s[i] - 0 ) * pow; pow *= 10; } return ans; } vector<string> change[3]; vector<string> empty1, empty0, _0to1_; bool used[maxN]; void print(vector<string> wek) { for (auto w : wek) cout << w << ; cout << endl; } int main() { ios_base::sync_with_stdio(0); cin >> n; for (int i = (0); i <= ((n)-1); ++i) { cin >> s[i] >> type[i]; sum[type[i]]++; } rang[1] = pair<int, int>(1, sum[1]); rang[0] = pair<int, int>(sum[1] + 1, n); for (int i = (0); i <= ((n)-1); ++i) { int x = conv(s[i]); bool b = (s[i][0] == 0 ); if (x <= n && !b) { if (!in_range(x, type[i])) { if (type[i] == 0) _0to1_.push_back(s[i]); else change[type[i]].push_back(s[i]); } used[x] = true; } else { change[type[i]].push_back(s[i]); } } for (int i = (1); i <= (sum[1]); ++i) { if (!used[i]) { empty1.push_back(to_string(i)); } } for (int i = (sum[1] + 1); i <= (n); ++i) { if (!used[i]) empty0.push_back(to_string(i)); } for (int i = (0); i <= (1); ++i) { vector<string> wek; for (auto v : change[i]) if (conv(v) <= n) wek.push_back(v); for (auto v : change[i]) if (conv(v) > n) wek.push_back(v); change[i] = wek; } vector<string> result; string tmp = to_string(n + 1); string prev = tmp; bool pom = false; for (auto v : change[1]) { if ((int)empty1.size() != 0) { result.push_back( move + v + + empty1.back()); empty1.pop_back(); int x = conv(v); if (x <= n && in_range(x, 0)) { empty0.push_back(v); } } else { if ((int)empty0.size() != 0) { result.push_back( move + _0to1_.back() + + empty0.back()); empty0.pop_back(); result.push_back( move + v + + _0to1_.back()); _0to1_.pop_back(); int x = conv(v); if (x <= n && in_range(x, 0)) { empty0.push_back(v); } } else { result.push_back( move + v + + prev); result.push_back( move + _0to1_.back() + + v); prev = _0to1_.back(); _0to1_.pop_back(); pom = true; } } } if (pom) { result.push_back( move + tmp + + prev); } for (auto v : change[0]) { result.push_back( move + v + + empty0.back()); empty0.pop_back(); } cout << (int)result.size() << endl; for (auto v : result) cout << v << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, m; scanf( %d%d , &n, &m); int k = min(n, m); if (k & 1) printf( Akshat ); else printf( Malvika ); return 0; }
#include <bits/stdc++.h> using namespace std; char a[1000005]; char c[1000005]; bool H(char a[], char c[], int i, int x) { int d = 0; for (int q = 0; q < i; q += x) { int s = 0; for (int o = 0; o < x; o++) { if (a[o + q] > c[o]) return 1; else if (a[o + q] == c[o]) s++; else if (a[o + q] < c[o]) break; } if (s == x) d++; } if (d == i / x) return 1; return 0; } int main() { int x, i = 0; cin >> x; while (cin >> a[i]) { i++; } bool K = 0; for (int j; j < i; j++) { if (a[j] != 9 ) { K = 1; break; } } if (i % x == 0 && K) { bool A; for (int j = 0; j < x; j++) { c[j] = a[j]; } A = H(a, c, i, x); if (A) { for (int j = x - 1; j >= 0; j--) { if (c[j] == 9 ) c[j] = 0 ; else { c[j] += 1; break; } } } for (int j = 0; j < i / x; j++) { for (int v = 0; v < x; v++) cout << c[v]; } } else { if (!K) i++; while (i % x != 0) { i++; } for (int j = 0; j < i / x; j++) { cout << 1 ; for (int p = 0; p < x - 1; p++) { cout << 0 ; } } } return 0; }
#include <bits/stdc++.h> using namespace std; const long long int MOD = 1000000007; const long long int INF = LONG_MAX; const vector<vector<long long int> > adj4({{0, 1}, {0, -1}, {1, 0}, {-1, 0}}); const vector<vector<long long int> > adj8( {{0, 1}, {0, -1}, {1, 0}, {-1, 0}, {-1, -1}, {1, -1}, {-1, 1}, {1, 1}}); struct DisjointSet { vector<long long int> roots; vector<long long int> sizes; DisjointSet(long long int n) { sizes = vector<long long int>(n, 1); roots = vector<long long int>(n); for (long long int i = 0; i < (n); ++i) roots[i] = i; } long long int root(long long int a) { return roots[a] == a ? a : root(roots[a]); } void join(long long int a, long long int b) { long long int ra = root(a); long long int rb = root(b); if (sizes[a] > sizes[b]) { roots[rb] = ra; sizes[ra] += sizes[rb]; } else { roots[ra] = rb; sizes[rb] += sizes[ra]; } } }; long long int gcd(long long int a, long long int b) { return b == 0 ? a : gcd(b, a % b); } bool isprime(long long int n) { if (n == 2 || n == 3) return true; if (n < 2 || n % 2 == 0 || n % 3 == 0) return false; for (long long int i = 6; (i - 1) * (i - 1) <= n; i += 6) { if (n % (i - 1) == 0 || n % (i + 1) == 0) { return false; } } return true; } vector<bool> sprime; void genPrime(long long int sz) { sprime = vector<bool>(sz, true); sprime[0] = false; sprime[1] = false; for (long long int i = (2); i < (sz); ++i) { for (long long int j = i * i; j < sz; j += i) { sprime[j] = false; } } } vector<long long int> facts; bool factGenFlag = false; void genFact(long long int n) { factGenFlag = true; facts = vector<long long int>(n + 1); facts[0] = 1; for (long long int i = (1); i < (n + 1); ++i) { facts[i] = facts[i - 1] * i; } } void genFactMod(long long int n, long long int mod) { factGenFlag = true; facts = vector<long long int>(n + 1); facts[0] = 1; for (long long int i = (1); i < (n + 1); ++i) { facts[i] = facts[i - 1] * i % mod; } } long long int fact(long long int a, long long int n) { if (factGenFlag && a < 3) return facts[n]; long long int r = 1; for (long long int i = (a); i < (n + 1); ++i) { r *= i; } return r; } long long int factMod(long long int a, long long int n, long long int mod) { if (factGenFlag && a < 3) return facts[n]; long long int r = 1; for (long long int i = (a); i < (n + 1); ++i) { r *= i; r %= mod; } return r; } long long int powMod(long long int a, long long int b, long long int mod) { long long int n = 1; long long int p = a; while (b > 0) { if (b % 2 == 1) { n *= p; n %= mod; } p *= p; p %= mod; b /= 2; } return n; } long long int modularInverse(long long int a, long long int mod) { return powMod(a, mod - 2, mod); } long long int ent(long long int a, long long int b) { long long int r = fact(a - b + 1, a); long long int d = fact(2, b); long long int ent = r / d; return ent; } long long int entMod(long long int a, long long int b, long long int mod) { long long int r = factMod(a - b + 1, a, mod); long long int d = factMod(2, b, mod); long long int ent = r * modularInverse(d, mod) % mod; return ent; } long long int bsfunction(long long int n) { return 0; } long long int binarysearch(long long int left, long long int right, long long int target) { if (left == right) { return left; } long long int mid = (left + right > 0) ? (left + right) / 2 : (left + right - 1) / 2; long long int val = bsfunction(mid); if (val > target) { return binarysearch(left, mid, target); } else if (val == target) { return mid; } else { return binarysearch(mid + 1, right, target); } } vector<long long int> topores; vector<bool> topovisperm; vector<bool> topovistemp; vector<vector<long long int> > topograph; bool topoimp; void toposortvisit(long long int step) { if (topovisperm[step]) return; if (topovistemp[step]) { topoimp = true; return; } topovistemp[step] = true; for (long long int p : topograph[step]) { toposortvisit(p); if (topoimp) return; } topovisperm[step] = true; topores.push_back(step); } void toposort() { long long int n = topograph.size(); topoimp = false; topovistemp = vector<bool>(n, false); topovisperm = vector<bool>(n, false); topores = vector<long long int>(); topores.reserve(n); for (long long int i = 0; i < (n); ++i) { if (!topovisperm[i]) { toposortvisit(i); if (topoimp) { return; } } } } stringstream sss; void MAIN() { string s; cin >> s; string second = s; reverse((second).begin(), (second).end()); while (!s.empty() && s.compare(second) == 0) { second.erase(second.begin()); s.pop_back(); } cout << (s.size()) << endl; } const long long int TESTCASEN = 1; int main() { ios_base::sync_with_stdio(false); cin.tie(0); sss << R ( ) ; for (long long int i = 0; i < (TESTCASEN); ++i) { MAIN(); } return 0; }
#include <bits/stdc++.h> using namespace std; char s[5005]; int main() { int i, j, k; scanf( %s , s); int len, n, m; len = strlen(s); int Q, D, ans; ans = 0; for (i = 0; i < len; i++) { Q = 0; D = 0; for (j = i; j < len; j++) { Q += s[j] == ( ; Q -= s[j] == ) ; D += s[j] == ? ; if (Q == D) ans++; if (D > Q) swap(Q, D); if (Q + D < 0) break; } } printf( %d , ans); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 5; vector<int> g[2 * N]; vector<pair<int, int> > mark[N]; int n, m; long long val[N]; struct Bit { long long c[N]; int lowbit(int x) { return x & -x; } long long Sum(int x) { long long res = 0; while (x > 0) { res += c[x]; x -= lowbit(x); } return res; } void Add(int x, int d) { while (x <= n) { c[x] += d; x += lowbit(x); } } } b; void dfs(int u, int fa, int dep) { for (auto it : mark[u]) { b.Add(max(n - dep - it.first, 1), it.second); } val[u] = b.Sum(max(n - dep, 1)); for (auto v : g[u]) { if (v == fa) continue; dfs(v, u, dep + 1); } for (auto it : mark[u]) { b.Add(max(n - dep - it.first, 1), -it.second); } } int main() { scanf( %d , &n); for (int i = 1; i < n; i++) { int x, y; scanf( %d %d , &x, &y); g[x].push_back(y); g[y].push_back(x); } scanf( %d , &m); for (int i = 1; i <= m; i++) { int u, d, x; scanf( %d %d %d , &u, &d, &x); mark[u].push_back({d, x}); } dfs(1, 0, 0); for (int i = 1; i <= n; i++) { printf( %lld , val[i]); } }
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; template <class T1, class T2> inline void remin(T1& a, T2 b) { a = min(a, (T1)b); } const int maxN = 1 << 18, maxTS = maxN * 2, INF = 1 << 30; vector<int> G[maxN]; int A[maxN], pat[maxN], whole[maxN], ile[maxN], sz[maxN], res, bord; void dfs0(int v, int fat) { sz[v] = 1; ile[v] = A[v] >= bord; for (int u : G[v]) if (u != fat) { dfs0(u, v); sz[v] += sz[u]; ile[v] += ile[u]; } } void dfs(int v, int fat) { int t[2] = {0, 0}; whole[v] = pat[v] = 1; for (int u : G[v]) if (u != fat) { dfs(u, v); if (whole[u] != 0) { if (whole[v] != 0) whole[v] += whole[u]; pat[v] += whole[u]; continue; } whole[v] = 0; if (pat[u] >= t[0]) t[1] = t[0], t[0] = pat[u]; else if (pat[u] > t[1]) t[1] = pat[u]; } if (A[v] >= bord) { pat[v] += t[0]; int prop = pat[v] + t[1]; if (sz[1] - sz[v] == ile[1] - ile[v]) prop += sz[1] - sz[v]; res = max(res, prop); } else pat[v] = whole[v] = 0; } void solve() { int n, k; scanf( %d%d , &n, &k); for (int i = (1); i < (n + 1); i++) scanf( %d , A + i); for (int i = (1); i < (n); i++) { int a, b; scanf( %d%d , &a, &b); G[a].push_back(b); G[b].push_back(a); } int a = 1, b = INF; while (b - a > 1) { bord = (a + b) / 2; res = 0; dfs0(1, 0); dfs(1, 0); res >= k ? a = bord : b = bord; } printf( %d n , a); } int main() { int t = 1; for (int tid = (1); tid < (t + 1); tid++) { solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; int n, k; vector<bool> is_important; vector<vector<int> > graph; vector<int> used; vector<int> res; bool dfs(int v) { used[v] = 1; bool f_p = is_important[v]; for (int u : graph[v]) { if (used[u] == 0) { f_p = dfs(u) || f_p; } else if (used[u] == 1) { cout << -1 << endl; exit(0); } } used[v] = 2; res.push_back(v); return f_p; } int main() { cin >> n >> k; is_important.assign(n, false); used.assign(n, 0); graph.resize(n); for (int i = 0; i < k; i++) { int x; cin >> x; is_important[x - 1] = true; } for (int i = 0; i < n; i++) { int m; cin >> m; for (int j = 0; j < m; j++) { int v; cin >> v; graph[i].push_back(v - 1); } } for (int i = 0; i < n; i++) { if (is_important[i] && used[i] == 0) dfs(i); } cout << res.size() << endl; for (int i = 0; i < res.size(); i++) { cout << res[i] + 1 << ; } return 0; }
#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); } int lcm(int a, int b) { return a * (b / gcd(a, b)); } const int maxSize = 100000 + 5; int main() { int n, k; cin >> n >> k; vector<long long int> arr(n); for (int i = 0; i < n; i++) { cin >> arr[i]; } vector<long long int> pwr; long long int limit = 1e14; long long int ans = 1; pwr.push_back(1); if (abs(k) > 1) { while (ans * k <= limit) { ans *= k; pwr.push_back(ans); } } else if (k == -1) { pwr.push_back(-1); } map<long long int, long long int> make_pair; long long int sum = 0; ans = 0; for (int i = 0; i < n; i++) { make_pair[sum]++; sum += arr[i]; for (auto pw : pwr) { if (make_pair.count(sum - pw) > 0) { ans += make_pair[sum - pw]; } } } cout << ans; }
#include <bits/stdc++.h> const int mod = 1000000007; const int inf = 1000000009; const long long int INF = 1000000000000000009; const long long big = 1000000000000000; const long double eps = 0.0000000001; using namespace std; queue<int> K; vector<int> H; vector<int> P[100005]; int S[100005], G[100005]; int k; bool czy = true, jak = false, korzen = false; map<int, int> M; int L[100005]; int n; void check(int u, int p) { if (M[L[u]] && P[u].size() != M[L[u]]) jak = false; M[L[u]] = P[u].size(); for (auto v : P[u]) if (v != p) { L[v] = L[u] + 1; check(v, u); } } void czysc() { for (int i = 1; i <= n; i++) { L[i] = 0; M[i] = 0; } } void funkcja() { while (K.size()) { if (K.size() == 1) korzen = true; while (K.size()) { int u = K.front(); K.pop(); for (auto v : P[u]) { if (!S[v]) { S[v] = S[u]; H.push_back(v); } G[v]++; } } int ile = -1, ile2 = -1, skad; for (auto v : H) { if (ile == -1) { ile = G[v]; ile2 = P[v].size(); skad = v; } else if (ile != G[v] || ile2 != P[v].size()) { czy = false; jak = true; k = v; check(S[v], 0); czysc(); if (!jak) { k = skad; check(S[skad], 0); czysc(); } return; } K.push(v); k = v; } H.clear(); } } int main() { ios::sync_with_stdio(false); cin.tie(); cout.tie(); cin >> n; if (n == 1) { cout << 1; return 0; } for (int i = 1; i < n; i++) { int a, b; cin >> a >> b; P[a].push_back(b); P[b].push_back(a); } for (int i = 1; i <= n; i++) if (P[i].size() == 1) { K.push(i); S[i] = i; } funkcja(); if (!korzen) { jak = true; check(S[k], 0); k = S[k]; } jak = true; check(k, 0); if (jak) cout << k; else cout << -1; return 0; }
#include <bits/stdc++.h> using namespace std; template <typename Arg1> void debug_out(const char* name, Arg1&& arg1) { cout << name << = << arg1 << ] << n ; } template <typename Arg1, typename... Args> void debug_out(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, , ); cout.write(names, comma - names) << = << arg1 << , ; debug_out(comma + 1, args...); } mt19937_64 rang( chrono::high_resolution_clock::now().time_since_epoch().count()); const long long mod = 1e9 + 7; const long long N = 3e5, M = N; void Solve_main() { long long n, m, k; cin >> n >> k >> m; vector<long long> v(n), temp(n); map<long long, long long> make_pair; for (long long i = (0); i < (n); ++i) { cin >> v[i]; temp[i] = v[i] % m; make_pair[temp[i]]++; } long long mx = INT_MIN, modulo = -1; for (auto it : make_pair) { if (it.second > mx) { modulo = it.first; mx = it.second; } } vector<long long> res; for (long long i = (0); i < (n); ++i) { if (temp[i] == modulo) { res.emplace_back(v[i]); } } if (((long long)(res).size()) < k) { cout << ((0) ? Yes : No ) << n ; ; } else { cout << ((1) ? Yes : No ) << n ; ; for (long long i = (0); i < (k); ++i) { cout << res[i] << ; } } } int32_t main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); srand(chrono::high_resolution_clock::now().time_since_epoch().count()); long long tc = 1; for (long long i = 0; i < tc; i++) { Solve_main(); } cerr << [time: << 1.0 * clock() / CLOCKS_PER_SEC << s] ; return 0; }
#include <bits/stdc++.h> using namespace std; string itos(int x) { stringstream ss; ss << x; return ss.str(); } int n, m, d[300010], vis[300010]; pair<int, int> a[300010]; vector<int> e[300010], res; int dfs(int now) { if (vis[now]) return 0; vis[now] = 1; d[now] = (d[now] == 1); for (auto x : e[now]) { int y = (a[x].first == now ? a[x].second : a[x].first); if (dfs(y)) { res.push_back((x)); d[now] ^= 1; } } return d[now] == 1; } int main() { ios_base::sync_with_stdio(false); cin >> n >> m; for (int i = 0; i < n; i++) cin >> d[i]; for (int i = 0, u, v; i < m;) { cin >> u >> v; a[++i] = make_pair((--u), (--v)); e[u].push_back((i)), e[v].push_back((i)); } int cnt1, free; cnt1 = count_if(d, d + 300010, [](int x) { return x == 1; }), free = count_if(d, d + 300010, [](int x) { return x == -1; }); if (cnt1 % 2 && not free) { cout << -1 << endl; return 0; } if (cnt1 % 2) *find(d, d + 300010, -1) = 1; dfs(0); cout << res.size() << endl; for (int i = 0; i < res.size(); i++) cout << res[i] << (i + 1 == res.size() ? n : ); return 0; }
#include <bits/stdc++.h> using namespace std; const long long INF = 2000000000000000000LL; const int inf = 0x3f3f3f3f; const long double EPS = 1e-9; string a, b; inline void solve() { vector<long long> mapa(26); for (long long i = 0; i < a.size(); i++) { mapa[a[i] - a ]++; } for (int i = 0; i < b.size(); i++) { vector<long long> mapb(26); for (long long j = i; j < b.size(); j++) { mapb[b[j] - a ]++; if (mapa == mapb) { printf( YES n ); return; } } } printf( NO n ); } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; int test, tc = 0; cin >> test; while (test--) { cin >> a >> b; solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 10; vector<int> sol; set<int> fac; int main() { ios_base::sync_with_stdio, cin.tie(0), cout.tie(0); int n; cin >> n; while (n--) { int a, b; cin >> a >> b; cout << a + b << endl; } }
#include <bits/stdc++.h> using namespace std; void sll(long long &x) { register char c = getchar(); x = 0; int neg = 0; for (; ((c < 48 || c > 57) && c != - ); c = getchar()) ; if (c == - ) { neg = 1; c = getchar(); } for (; c > 47 && c < 58; c = getchar()) { x = (x << 1) + (x << 3) + c - 48; } if (neg) x = -x; } void wll(long long a) { if (a < 0) { putchar( - ); a = -a; } char snum[100]; int i = 0; do { snum[i++] = a % 10 + 48; a = a / 10; } while (a != 0); --i; while (i >= 0) putchar(snum[i--]); putchar( n ); } void wi(int a) { if (a < 0) { putchar( - ); a = -a; } char snum[100]; int i = 0; do { snum[i++] = a % 10 + 48; a = a / 10; } while (a != 0); --i; while (i >= 0) putchar(snum[i--]); putchar( n ); } void wl(long a) { if (a < 0) { putchar( - ); a = -a; } char snum[100]; int i = 0; do { snum[i++] = a % 10 + 48; a = a / 10; } while (a != 0); --i; while (i >= 0) putchar(snum[i--]); putchar( n ); } void sl(long &x) { register char c = getchar(); x = 0; int neg = 0; for (; ((c < 48 || c > 57) && c != - ); c = getchar()) ; if (c == - ) { neg = 1; c = getchar(); } for (; c > 47 && c < 58; c = getchar()) { x = (x << 1) + (x << 3) + c - 48; } if (neg) x = -x; } void si(int &x) { register char c = getchar(); x = 0; int neg = 0; for (; ((c < 48 || c > 57) && c != - ); c = getchar()) ; if (c == - ) { neg = 1; c = getchar(); } for (; c > 47 && c < 58; c = getchar()) { x = (x << 1) + (x << 3) + c - 48; } if (neg) x = -x; } long long power(long long a, long long b, long long mod) { long long ret = 1; while (b) { if (b & 1) ret = ret * a % mod; a = a * a % mod; b >>= 1; } return ret; } long long gcd(long long a, long long b) { while (b) b ^= a ^= b ^= a %= b; return a; } int main() { long long t, i, j, k, l; long long a, b, c, d; sll(a); sll(b); sll(c); sll(l); t = (l + 1) * (l + 2) * (l + 3) / 6; long long ans = 0; for (i = 0; i <= l; i++) { long long x = min(l - i, i + a - b - c); if (x >= 0) { x = ((x + 1) * (x + 2)) >> 1; ans += x; } x = min(l - i, i + c - b - a); if (x >= 0) { x = ((x + 1) * (x + 2)) >> 1; ans += x; } x = min(l - i, i + b - c - a); if (x >= 0) { x = ((x + 1) * (x + 2)) >> 1; ans += x; } } wll(t - ans); return 0; }
#include<bits/stdc++.h> #define rep(i,n) for(int i=0 ; i<n ; i++) #define ll long long #define pb push_back #define mp make_pair #define all(x) x.begin(),x.end() using namespace std; const ll MX=1e6+2; const ll MOD=1e9+7; int main(){ int t; cin>>t; while(t--){ ll n; cin>>n; ll s=floor(log10(n))+1; vector<ll> A; rep(i,9){ ll a=i+1,b=i+1; rep(j,s-1){ b*=10; b+=a; } A.pb(b); } ll ans=0; for(auto el:A){ if(el<=n)ans++; } ll an=9*(s-1)+ans; cout<<an<<endl; } }
#include <bits/stdc++.h> int main() { int n; scanf( %d , &n); for (int i = 1; i <= n - n / 3; i++) printf( 1 %d n , i); for (int i = 1; i <= n / 3; i++) printf( 4 %d n , 2 * i); return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5, maxf = 1 << 18; const int mod = 998244353; namespace usual { int fac[maxf + 5], ifac[maxf + 5]; int add(int ta, int tb) { return ta + tb >= mod ? ta + tb - mod : ta + tb; } int sub(int ta, int tb) { return ta < tb ? ta - tb + mod : ta - tb; } int ksm(long long ta, int tp) { int s = 1; for (; tp; ta = ta * ta % mod, tp >>= 1) if (tp & 1) s = ta * s % mod; return s; } void make_fac(int len) { fac[0] = 1; for (int i = 1; i <= len; i++) fac[i] = 1ll * fac[i - 1] * i % mod; ifac[len] = ksm(fac[len], mod - 2); for (int i = len; i; i--) ifac[i - 1] = 1ll * ifac[i] * i % mod; } int inv(int i) { return 1ll * ifac[i] * fac[i - 1] % mod; } } // namespace usual using namespace usual; namespace poly { int pa[maxf + 5], pb[maxf + 5]; int rev[maxf + 5], g[maxf + 5], invg[maxf + 5]; void Cpy(int *A, int *B, int len) { for (int i = 0; i < len; i++) A[i] = B[i]; } void Rev(int *A, int len) { for (int i = 0; i < len - i; i++) swap(A[i], A[len - i]); } void Cl(int *A, int len) { memset(A, 0, len * 4); } void make_tt(int *T, int len, int da) { int tmp = ksm(da, (mod - 1) / len); for (int i = len >> 1; i; i >>= 1, tmp = 1ll * tmp * tmp % mod) { T[i] = 1; for (int j = 1; j < i; j++) T[i + j] = 1ll * T[i + j - 1] * tmp % mod; } } void pre_poly(int len) { make_tt(g, len, 3); make_tt(invg, len, 332748118); } void make_rev(int len) { for (int i = 1; i < len; i++) rev[i] = (rev[i >> 1] >> 1) | (i & 1 ? len >> 1 : 0); } void NTT(int *T, int len, bool ok) { int *tt, ny; for (int i = 1; i < len; i++) if (i < rev[i]) swap(T[i], T[rev[i]]); for (int i = 1; i < len; i <<= 1) { tt = ok ? g + i : invg + i; for (int j = 0; j < len; j += i << 1) for (int l = 0; l < i; l++) { ny = 1ll * T[i + j + l] * tt[l] % mod; T[i + j + l] = sub(T[j + l], ny); T[j + l] = add(T[j + l], ny); } } } void Mult(int *A, int *B, int *C, int len) { Cpy(pa, A, len); Cpy(pb, B, len); make_rev(len); NTT(pa, len, 1); NTT(pb, len, 1); for (int i = 0; i < len; i++) pa[i] = 1ll * pa[i] * pb[i] % mod; NTT(pa, len, 0); int invn = ksm(len, mod - 2); for (int i = 0; i < len; i++) C[i] = 1ll * pa[i] * invn % mod; } void Inv(int *T, int *Ans, int len) { static int tf[maxf + 5], tg[maxf + 5]; int invn; Cl(tf, len << 1); Cl(tg, len << 1); Cl(Ans, len << 1); Ans[0] = ksm(T[0], mod - 2); for (int i = 2; i <= len; i <<= 1) { Cpy(tf, Ans, i); Cpy(tg, T, i); make_rev(i << 1); NTT(tf, i << 1, 1); NTT(tg, i << 1, 1); for (int j = 0; j < i << 1; j++) tf[j] = 1ll * tf[j] * sub(2, 1ll * tf[j] * tg[j] % mod) % mod; NTT(tf, i << 1, 0); invn = ksm(i << 1, mod - 2); for (int j = 0; j < i; j++) Ans[j] = 1ll * tf[j] * invn % mod; } } void diff(int *T, int len) { for (int i = 1; i < len; i++) T[i - 1] = 1ll * T[i] * i % mod; T[len - 1] = 0; } void inte(int *T, int len) { for (int i = len - 1; i; i--) T[i] = 1ll * T[i - 1] * inv(i) % mod; T[0] = 0; } void Ln(int *T, int *Ans, int len) { static int invT[maxf + 5]; Cl(invT, len << 1); Cl(Ans, len << 1); Inv(T, invT, len); Cpy(Ans, T, len); diff(Ans, len); Mult(Ans, invT, Ans, len << 1); Cl(Ans + len, len); inte(Ans, len); } void Exp(int *T, int *Ans, int len) { static int lnT[maxf + 5]; Cl(Ans, len << 1); Ans[0] = 1; for (int i = 2; i <= len; i <<= 1) { Ln(Ans, lnT, i); for (int j = 0; j < i; j++) lnT[j] = sub(T[j], lnT[j]); lnT[0] = add(lnT[0], 1); Mult(Ans, lnT, Ans, i << 1); Cl(Ans + i, i); } } void Ksm(int *T, int *Ans, int len, int tp) { static int ts[maxf + 5]; Ln(T, ts, len); for (int i = 0; i < len; i++) ts[i] = 1ll * ts[i] * tp % mod; Exp(ts, Ans, len); } } // namespace poly using namespace poly; int n, len = 1; int F[maxf + 5]; int T[maxf + 5], H[maxf + 5]; int powH[maxf + 5], invH[maxf + 5]; int S1[maxf + 5], S2[maxf + 5]; void make_F() { for (int i = 0; i <= n; i++) T[i] = sub(0, ifac[i + 2]); Inv(T, F, len); for (int i = 0; i <= n; i++) F[i] = F[i + 1]; Cl(F + n - 1, len - n + 1); } void make_H() { Cl(T, len); T[0] = 1; T[1] = 1; Ln(T, H, len); for (int i = 0; i <= n; i++) T[i] = H[i + 1]; Inv(T, H, len); Cl(H + n + 1, len - n - 1); Ksm(H, powH, len, n - 1); Cl(powH + n + 1, len - n - 1); for (int i = 0; i <= n; i++) T[i] = sub(0, H[i + 1]); T[n] = 0; Inv(T, invH, len); Cl(invH + n + 1, len - n - 1); Cpy(S1, H, n + 1); diff(S1, n + 1); Mult(powH, invH, S2, len << 1); Cl(S2 + n + 1, (len << 1) - n - 1); Mult(S1, S2, S1, len << 1); Cl(S1 + n + 1, (len << 1) - n - 1); Mult(S1, invH, S1, len << 1); Cl(S1 + n + 1, (len << 1) - n - 1); n -= 2; for (int i = 1; i <= n; i++) F[i] = sub(F[i], 1ll * add(S1[i + 1], 1ll * (n - i + 1) * S2[i + 1] % mod) * inv(n + 1) % mod); F[0] = n; } int main() { scanf( %d , &n); if (n == 1) { printf( 1 n ); return 0; } n += 2; while (len <= n + 1) len <<= 1; make_fac(len << 1); pre_poly(len << 1); make_F(); make_H(); for (int i = 0; i <= n; i++) if (i & 1) T[i] = sub(0, ifac[i]); else T[i] = ifac[i]; for (int i = 0; i <= n; i++) F[i] = 1ll * F[i] * fac[i] % mod; Rev(F, n + 1); Cl(T + n + 1, (len << 1) - n - 1); Mult(F, T, F, len << 1); for (int i = 0; i < n; i++) printf( %lld , 1ll * fac[n] * ifac[i] % mod * F[n - i + 1] % mod); printf( n ); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, m, k; scanf( %d%d%d , &n, &m, &k); bool hole[n + 1]; bool contain[n + 1]; memset(hole, false, sizeof hole); memset(contain, false, sizeof contain); int first; while (m--) { scanf( %d , &first); hole[first] = true; } int u, v; contain[1] = true; while (k--) { scanf( %d%d , &u, &v); if (contain[u] && hole[u]) continue; else if (contain[v] && hole[v]) continue; else { swap(contain[u], contain[v]); } } for (int i = 1; i <= n; i++) { if (contain[i]) { return !printf( %d , i); } } return 0; }
#include <bits/stdc++.h> using namespace std; using i64 = long long; using u64 = unsigned long long; struct debug { ~debug() { cerr << endl; } template <class c> debug& operator<<(c x) { cerr << x; return *this; } template <class c, class d> debug& operator<<(pair<c, d> x) { *this << ( << x.first << , << x.second << ) ; return *this; } template <class c> debug& operator<<(vector<c> x) { *this << [ ; int f = 0; for (auto it : x) { *this << (f ? , : ); *this << it; f = 1; } *this << ] ; return *this; } }; const int MOD = 998244353; const int N = 5e5; i64 add(i64 a, i64 b) { if (a + b >= MOD) return a + b - MOD; else return a + b; } i64 mul(i64 a, i64 b) { i64 c = a * b; if (c >= MOD) c %= MOD; return c; } vector<i64> fact(N + 5); vector<i64> inv_fact(N + 5); i64 mod_inverse(i64 x) { int p = MOD - 2; i64 ret = 1; while (p) { if (p & 1) { ret = mul(ret, x); } x = mul(x, x); p /= 2; } return ret; } i64 nCr(int n, int r) { if (r > n) return 0; i64 ret = mul(fact[n], inv_fact[r]); ret = mul(ret, inv_fact[n - r]); return ret; } int main() { fact[0] = 1; inv_fact[0] = mod_inverse(1); for (int i = 1; i <= N; i++) { fact[i] = mul(fact[i - 1], i); inv_fact[i] = mod_inverse(fact[i]); } int n, k; scanf( %d%d , &n, &k); i64 ans = 0; for (int i = 1; i <= n; i++) { ans = add(ans, nCr(n / i - 1, k - 1)); } printf( %lld n , ans); }
#include <bits/stdc++.h> using namespace std; int main() { double m, R; cin >> m >> R; double answer = (m * (m + 1) * (m + 2) / 3 - m) * 2; answer += (sqrt(2.0) - 2) * ((m * m - m) + (m * m - m - (m - 1) * 2)); answer /= (m * m); answer *= R; cout << setprecision(7) << answer << endl; return 0; }
#include <bits/stdc++.h> const double PI = 3.1415926535897932384626433832795; using namespace std; long long mod = 1e9 + 7; bool visited[3005]; vector<vector<int> > G; bool cycle[3005]; int dp[3005], P[3005]; void dfs(int u, int v) { visited[u] = true; int sz = G[u].size(); for (int i = 0; i < sz; ++i) { if (v == G[u][i]) continue; if (visited[G[u][i]] && !cycle[G[u][i]]) { cycle[G[u][i]] = true; for (int j = u; j != G[u][i]; j = P[j]) cycle[j] = true; break; } if (visited[G[u][i]]) continue; P[G[u][i]] = u; dfs(G[u][i], u); } } void dfs2(int u, int v, int len) { dp[u] = len; int sz = G[u].size(); for (int i = 0; i < sz; ++i) { if (cycle[G[u][i]] || v == G[u][i]) continue; dfs2(G[u][i], u, len + 1); } } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.precision(12); cout << fixed; int N, a, b; cin >> N; G.resize(N + 1); for (int i = 0; i < N; ++i) { cin >> a >> b; G[a].push_back(b); G[b].push_back(a); } P[1] = 0; dfs(1, 0); for (int i = 1; i <= N; ++i) if (cycle[i]) dfs2(i, 0, 0); for (int i = 1; i <= N; ++i) cout << dp[i] << ; cout << n ; return 0; }
#include <bits/stdc++.h> using namespace std; char a[55]; char s[1005][55]; bool can[1005]; int have[30]; int tmp[30]; int pos[55], tot; int len, n, ans, rest; set<char> se; int main() { scanf( %d , &len); scanf( %s , a + 1); scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %s , s[i] + 1); for (int i = 1; i <= len; i++) if (a[i] != * ) se.insert(a[i]); for (int i = 1; i <= len; i++) if (a[i] == * ) pos[++tot] = i; for (int i = 1; i <= n; i++) { can[i] = 1; for (int j = 1; j <= tot; j++) if (se.find(s[i][pos[j]]) != se.end()) { can[i] = 0; break; } for (int j = 1; j <= len; j++) if (a[j] != * && a[j] != s[i][j]) { can[i] = 0; break; } if (can[i]) rest++; } for (int i = 1; i <= 26; i++) if (se.find( a + i - 1) == se.end()) { for (int j = 1; j <= n; j++) if (can[j]) for (int k = 1; k <= tot; k++) if (s[j][pos[k]] == a + i - 1) { have[i]++; break; } } for (int i = 1; i <= 26; i++) if (se.find( a + i - 1) == se.end() && have[i] == rest) ans++; printf( %d , ans); return 0; }
#include <bits/stdc++.h> using namespace std; const int inf = 987654321; const long long int INF = 123456789987654321; FILE *fin, *fout; int N, M; vector<vector<int> > V; int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } int main() { scanf( %d %d , &N, &M); V = vector<vector<int> >(N, vector<int>(M)); int mx = 0; for (int i = 0; i < N; i++) { for (int j = 0; j < M; j++) { scanf( %d , &V[i][j]); mx = max(mx, V[i][j]); } } int g = 0; for (int i = 0; i < N - 1; i++) { vector<int> D; for (int j = 0; j < M; j++) { D.push_back(V[i + 1][j] - V[i][j]); } for (int j = 0; j < (int)D.size() - 1; j++) { g = gcd(g, abs(D[j + 1] - D[j])); } } for (int i = 0; i < M - 1; i++) { vector<int> D; for (int j = 0; j < N; j++) { D.push_back(V[j][i + 1] - V[j][i]); } for (int j = 0; j < (int)D.size() - 1; j++) { g = gcd(g, abs(D[j + 1] - D[j])); } } if (g == 0) g = 1000000007; if (g <= mx) { printf( NO ); return 0; } vector<int> a(N), b(M); a[0] = 0, b[0] = V[0][0]; for (int i = 1; i < M; i++) { b[i] = ((long long int)V[0][i] - (long long int)a[0] + (long long int)g) % g; } for (int i = 1; i < N; i++) { a[i] = ((long long int)V[i][0] - (long long int)b[0] + (long long int)g) % g; } printf( YES n%d n , g); for (int i = 0; i < N; i++) printf( %d , a[i]); printf( n ); for (int i = 0; i < M; i++) printf( %d , b[i]); }
#include <bits/stdc++.h> using namespace std; bool deb_mode = 0; class debugger { vector<string> vars; public: template <typename T> debugger &operator,(const T v) { stringstream ss; ss << v, vars.push_back(ss.str()); return *this; } void printall() { int j = 0, l = vars.size(); for (int i = 0; i < (l - 1); i++) { if (i) cout << , ; for (j; j < vars[l - 1].size(); j++) { if (vars[l - 1][j] == , ) { j++; break; } cout << vars[l - 1][j]; } cout << = << vars[i]; } vars.clear(); } } Dbug; template <typename T1, typename T2> inline ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << ( << p.first << , << p.second << ) ; } template <typename T> inline ostream &operator<<(ostream &os, const vector<T> &v) { bool first = true; os << { ; for (unsigned int i = 0; i < v.size(); i++) { if (!first) os << , ; os << v[i]; first = false; } return os << } ; } template <typename T> inline ostream &operator<<(ostream &os, const set<T> &v) { bool first = true; os << { ; for (typename set<T>::const_iterator ii = v.begin(); ii != v.end(); ++ii) { if (!first) os << , ; os << *ii; first = false; } return os << } ; } template <typename T1, typename T2> inline ostream &operator<<(ostream &os, const map<T1, T2> &v) { bool first = true; os << { ; for (typename map<T1, T2>::const_iterator ii = v.begin(); ii != v.end(); ++ii) { if (!first) os << , ; os << *ii; first = false; } return os << } ; } template <typename T> void getarray(T a[], int b, int e) { for (int i = b; i < e + b; i++) cin >> a[i]; } template <typename T> void printarray(T a[], int b, int e) { for (int i = b; i < e - 1 + b; i++) cout << a[i] << ; if (e - 1 + b >= 0) cout << a[e - 1 + b] << n ; } template <typename T> void printV(vector<T> v) { int sz = v.size(); if (sz) cout << v[0]; for (int i = 1; i < sz; i++) cout << << v[i]; printf( n ); } template <typename T> T gcd(T a, T b) { if (b == 0) return a; return gcd(b, a % b); } template <typename T> T BigMod(T b, T p, T m) { if (p == 0) return 1; if (p % 2 == 0) { T s = BigMod(b, p / 2, m); return ((s % m) * (s % m)) % m; } return ((b % m) * (BigMod(b, p - 1, m) % m)) % m; } template <typename T> T ModInv(T b, T m) { return BigMod(b, m - 2, m); } template <class T> inline void read(T &x) { bool Minus = 0; char c; for (c = getchar(); c <= 32; c = getchar()) ; if (c == - ) Minus = 1, c = getchar(); for (x = 0; c > 32; c = getchar()) x = x * 10 + c - 0 ; if (Minus) x = -x; } char getc() { char c; for (c = getchar(); c <= 32; c = getchar()) ; return c; } int CI(int &_x) { return scanf( %d , &_x); } int CI(int &_x, int &_y) { return scanf( %d %d , &_x, &_y); } int CI(int &_x, int &_y, int &_z) { return scanf( %d %d %d , &_x, &_y, &_z); } int CI(int &_a, int &_b, int &_c, int &_d) { return scanf( %d %d %d %d , &_a, &_b, &_c, &_d); } template <class T> string toString(T n) { ostringstream oss; oss << n; return oss.str(); } int toInt(string s) { int r = 0; istringstream sin(s); sin >> r; return r; } long long int toLong(string s) { long long int r = 0; istringstream sin(s); sin >> r; return r; } bool isVowel(char ch) { ch = tolower(ch); if (ch == a || ch == e || ch == i || ch == o || ch == u ) return true; return false; } bool isUpper(char c) { return c >= A && c <= Z ; } bool isLower(char c) { return c >= a && c <= z ; } int dr8[8] = {+1, -1, +0, +0, +1, -1, -1, +1}; int dc8[8] = {+0, +0, -1, +1, +1, +1, -1, -1}; int dr4[4] = {+0, +0, +1, -1}; int dc4[4] = {-1, +1, +0, +0}; int kn8r[8] = {+1, +2, +2, +1, -1, -2, -2, -1}; int kn8c[8] = {+2, +1, -1, -2, -2, -1, +1, +2}; const double EPS = 1e-9; const int INF = (1 << 30) - 1; const long long int LINF = (1ll << 62) - 1; const int mod = (int)1e9 + 7; const int MAX = (int)1e5; int main() { if (deb_mode) srand(int(time(NULL))); int i, j, k, l, n, m, q, a, b, c; cin >> n; int t; cin >> t; string S1, S2; vector<char> V(n); cin >> S1 >> S2; int mil = 0; for (i = 0; i < n; i++) { if (S1[i] == S2[i]) { V[i] = S1[i]; mil++; } else V[i] = ; } t = n - t; if (t > mil) { i = 0; t = t - mil; t *= 2; for (; i < n && t != 0; i++) { if (V[i] == ) { if (t & 1) { V[i] = S1[i]; t--; } else { V[i] = S2[i]; t--; } } } if (t > 0) { cout << -1 n ; return 0; } } else if (t < mil) { i = 0; t = mil - t; for (; i < n && t != 0; i++) { if (V[i] == S1[i] && V[i] == S2[i]) { V[i] = ; t--; } } if (t > 0) { cout << -1 << n ; return 0; } } for (i = 0; i < n; i++) { if (V[i] == ) { char ch = a ; int p = 0; while (ch == S1[i] || ch == S2[i]) { ch++; } V[i] = ch; } cout << V[i]; } printf( n ); if (deb_mode) cerr << TIME = << clock() << ms << n ; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long a, b; cin >> a >> b; while (a > 0 && b > 0) { if (a >= 2 * b) { a = a - (a / (2 * b)) * (2 * b); } else if (b >= 2 * a) { b = b - (b / (2 * a)) * (2 * a); } else { break; } } cout << a << << b; }
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; int a[N], n, ans[N], b[N]; int main() { scanf( %d , &n); if (n == 1) { printf( 1 n ); return 0; } for (int i = 1; i <= n; i++) scanf( %d , &a[i]); for (int i = 1; i <= n; i++) { b[0] = 0; int to = (int)sqrt((double)a[i]), k = 0; for (int j = 1; j <= to; j++) if (a[i] % j == 0) { if (j > 1) b[++b[0]] = j, k = max(k, ans[j]); if (j * j != a[i]) b[++b[0]] = a[i] / j, k = max(k, ans[a[i] / j]); } for (int j = 1; j <= b[0]; j++) ans[b[j]] = max(ans[b[j]], k + 1); } for (int i = 1; i <= (int)1e5; i++) ans[0] = max(ans[0], ans[i]); printf( %d n , ans[0]); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { string s1, s2; cin >> s1 >> s2; int flag = 0; for (int i = 0, j = s2.length() - 1; i < s1.length(), j >= 0; i++, j--) { if (s1[i] == s2[j]) { flag++; } } if (flag == s1.length()) cout << YES << endl; else cout << NO ; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 5e5 + 5, MOD = 1e9 + 7; bool c[11]; int main() { int n, k; scanf( %d %d , &n, &k); long long ans[n]; pair<int, pair<int, int>> a[n]; priority_queue<int> pq; for (int i = 0; i < n; i++) { scanf( %d , &a[i].first); } for (int i = 0; i < n; i++) { scanf( %d , &a[i].second.first); a[i].second.second = i; ans[i] = a[i].second.first; } if (!k) { for (int i = 0; i < n; i++) { printf( %lld , ans[i]); } return 0; } sort(a, a + n); long long sum = a[0].second.first; pq.push(-a[0].second.first); for (int i = 1; i < n; i++) { ans[a[i].second.second] += sum; if (pq.size() == k) { if (abs(pq.top()) < a[i].second.first) { sum -= (abs(pq.top())); pq.pop(); pq.push(-a[i].second.first); sum += a[i].second.first; } } else { pq.push(-a[i].second.first); sum += a[i].second.first; } } for (int i = 0; i < n; i++) { printf( %lld , ans[i]); } return 0; }
#include <bits/stdc++.h> using namespace std; int n, a[1001], k; int main() { scanf( %d%d , &n, &k); n = 2 * n + 1; for (int i = 1; i <= n; ++i) scanf( %d , &a[i]); for (int i = 2; i < n; i += 2) if (k && a[i - 1] + 1 < a[i] && a[i] > a[i + 1] + 1) { a[i]--; k--; } for (int i = 1; i <= n; ++i) printf( %d , a[i]); }
#include <bits/stdc++.h> using namespace std; void File() { freopen( output.txt , w , stdout); freopen( input.txt , r , stdin); } void yAsEr_HaFiz() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } int dx[] = {0, 0, 1, -1, 1, -1, 1, -1}; int dy[] = {1, -1, 0, 0, -1, 1, 1, -1}; int const N = 2e5 + 9, MOD = 1e9 + 7, oo = 1e9 + 7; long long n, m, a, n1, n2; int main() { long long l, r; cin >> l >> r; cout << YES << n ; for (long long i = l; i <= r; i += 2) cout << i << << i + 1 << n ; return 0; }
#include<bits/stdc++.h> using namespace std; #ifdef LOCAL #include debug.h #endif #ifdef LOCAL #define debug(...) cerr << [ << #__VA_ARGS__ << ]: , debug_out(__VA_ARGS__) #else #define debug(...) 42 #endif #define endl n typedef long long ll; typedef long double ld; typedef vector<int> vi; typedef std::vector<vector<int> > vvi; typedef pair<int, int> pi; typedef pair<ll, ll> pll; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll; typedef vector<vll> vvll; typedef vector<vi> vvi; typedef vector<double> vd; typedef vector<vector<double>> vvd; typedef vector<ld> vld; typedef vector<vld> vvld; typedef vector<bool> vb; typedef vector<vb> vvb; typedef vector<char> vch; typedef vector<vch> vvch; #define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++) #define repi(i, a, b) for (int i = (int)(a); i >= (int)(b); i--) #define pb push_back #define fi first #define se second #define all(a) a.begin(), a.end() #define sz(a) (int)(a.size()) template<typename T> void umin(T &a, T b) { a = min(a, b); } template<typename T> void umax(T &a, T b) { a = max(a, b); } ll nxt() { ll x; cin >> x; return x; } void setIO(string s) { #ifndef LOCAL ios_base::sync_with_stdio(0); cin.tie(0); freopen((s+ .in ).c_str(), r ,stdin); freopen((s+ .out ).c_str(), w ,stdout); #endif } void yes() { cout << yes n ; } void no() { cout << no n ; } void flush() { debug( ################# ); } const ll mod = 1e9 + 7; const ll INF = 1e9; void solve() { int m, k; cin >> m >> k; vi cnt(k + 1); rep(i, 1, k + 1) { cnt[i] = nxt(); } int mx = *max_element(all(cnt)); int mxid = -1; rep(i, 1, k + 1) if (cnt[i] == mx) mxid = i; int lo = 1, hi = 200005; while (lo < hi) { int mid = (lo + hi) / 2; ll one = 1LL * mid * mid - 1LL * (mid / 2) * (mid / 2); ll two = 1LL * mid * ((mid + 1) / 2); if (one >= m && two >= mx) { hi = mid; } else { lo = mid + 1; } } int n = lo; vvi a(n + 1, vi(n + 1)); vpi filling_order; rep(i, 1, k + 1) filling_order.pb({cnt[i], i}); sort(all(filling_order)); reverse(all(filling_order)); vi order; for (auto it : filling_order) { rep(i, 0, it.fi) order.pb(it.se); } assert(sz(order) == m); int ptr = 0; int done = 0; for (int row = 2; row <= n; row += 2) { for (int col = 1; col <= n; col += 2) { if (done >= mx) break; a[row][col] = order[ptr++]; done++; } } if (done < mx) { for (int row = 1; row <= n; row += 2) { for (int col = 1; col <= n; col += 2) { if (done >= mx) break; a[row][col] = order[ptr++]; done++; } } } else { for (int row = 2; row <= n; row += 2) for (int col = 1; col <= n; col += 2) { if (ptr >= m) break; if (a[row][col] == 0) a[row][col] = order[ptr++]; } } //all reds are filled //fill all non-filled for (int row = 1; row <= n; row++) { int add = 2; if (row % 2 == 1) { add = 1; } for (int col = 1; col <= n; col += add) { if (a[row][col] == 0 && ptr < m) { a[row][col] = order[ptr++]; } } } cout << n << endl; for (int row = 1; row <= n; row++) { for (int col = 1; col <= n; col++) { cout << a[row][col] << ; } cout << endl; } flush(); for (int row = 1; row <= n; row++) for (int col = 1; col <= n; col++) { debug(row, col); if (row + 1 <= n && col + 1 <= n && a[row][col] != 0 && a[row + 1][col + 1] != 0) assert(a[row][col] != a[row + 1][col + 1]); if (row + 1 <= n && col - 1 >= 1 && a[row][col] != 0 && a[row + 1][col - 1] != 0) assert(a[row][col] != a[row + 1][col - 1]); if (row + 1 <= n && col + 1 <= n) assert(a[row][col] == 0 or a[row][col + 1] == 0 or a[row + 1][col] == 0 or a[row + 1][col + 1] == 0); } } int32_t main(){ // setIO( trapped ); ios_base::sync_with_stdio(false); cin.tie(NULL); cout << fixed << setprecision(10); int T = 1; cin >> T; for (int tc = 1; tc <= T; tc++) { // cout << Case # << tc << : ; solve(); } }
#include <bits/stdc++.h> #define FAST std::ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); #define hell 1000000007 #define pb push_back #define endl n #define rep(i, s, n) for(ll i = s; i < (n); ++i) #define F first #define S second #define ll long long #define sz(a) a.size() #define pii std::pair<int, int> #define pll std::pair<ll, ll> #define vi vector<int> #define vl vector<ll> #define vvi vector<vi > #define vii vector<pii > #define vll vector<pll > #define INF INT_MAX #define inf 9e18 #define N int(2e5+5) #define all(v) v.begin(),v.end() #define mod 998244353 using namespace std; ll add(ll a,ll b) { return (a%hell+b%hell)%hell; } ll mul(ll a,ll b) { return ((a%hell)*(b%hell))%hell; } ll n; ll fast_pow(ll a,ll b) { ll ans=1; while(b) { if(b&1)ans=ans*a; a=a*a; b>>=1; } return ans; } void solve() { ll x,s=0,p;vi v; while(n>0) { // x=log2(n+2)*1ll-2; for(x=0;(1ll<<(x+2))-2<=n;x++); x-=1; p=(1ll<<(x+2))-2; n-=p; v.pb(x);s+=1+x; } cout<<s<<endl; for(auto i:v){cout<<1<< ;rep(j,0,i)cout<<0<< ;} } int main() { FAST ll test=1; cin>>test; while(test--) { cin>>n; if(n&1){cout<<-1<<endl;continue;} solve(); cout<<endl; } return 0; }
#include <bits/stdc++.h> using std::abs; using std::array; using std::cerr; using std::cin; using std::cout; using std::generate; using std::make_pair; using std::map; using std::max; using std::max_element; using std::min; using std::min_element; using std::pair; using std::reverse; using std::set; using std::sort; using std::string; using std::unique; using std::vector; template <typename T> T input() { T res; cin >> res; {}; return res; } template <typename IT> void input_seq(IT b, IT e) { std::generate(b, e, input<typename std::remove_reference<decltype(*b)>::type>); } bool bad(char a) { return a != a and a != e and a != i and a != o and a != u ; } bool bad(string a) { return a.size() >= 3 and bad(a[a.size() - 1]) and bad(a[a.size() - 2]) and bad(a[a.size() - 3]) and not(a[a.size() - 1] == a[a.size() - 2] and a[a.size() - 2] == a[a.size() - 3]); } int main() { std::iostream::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); string s = input<string>(); string b = ; for (char ch : s) { b += ch; if (bad(b)) { b.pop_back(); cout << b << ; b.clear(); b += ch; } } if (b != ) cout << b; cout << n ; return 0; }
#include <bits/stdc++.h> using namespace std; long long int n, k; long long int i; long long int sum = 0; long long int cheng = 1; long long int ans[200010]; struct xxx { long long int num; long long int id; bool operator<(const struct xxx &node) const { return num > node.num; } } xxx[200010]; int main() { scanf( %lld%lld , &n, &k); for (i = 0; i < n; i++) { xxx[i].id = i; scanf( %lld , &xxx[i].num); } sort(xxx, xxx + n); for (i = 0; i < k; i++) sum = sum + xxx[i].num; for (i = 0; i < k; i++) ans[i] = xxx[i].id; sort(ans, ans + k); for (i = 0; i < k - 1; i++) cheng = cheng * (ans[i + 1] - ans[i]) % 998244353; printf( %lld %lld , sum, cheng); return 0; }
#include <bits/stdc++.h> using namespace std; const int mod = 1000000007; int a[105], n, K, sn; struct Mat { int a[105][105]; Mat() { memset(a, 0, sizeof(a)); } Mat operator*(const Mat &b) const { Mat c = Mat(); for (int i = 0; i <= sn; i++) for (int j = 0; j <= sn; j++) for (int k = 0; k <= sn; k++) c.a[i][j] = (c.a[i][j] + (long long)a[i][k] * b.a[k][j]) % mod; return c; } } ret, mp; int q_pow(int x, int n) { int ret = 1; for (; n; n >>= 1, x = (long long)x * x % mod) if (n & 1) ret = (long long)ret * x % mod; return ret; } void q_pow(int K) { for (; K; K >>= 1, mp = mp * mp) if (K & 1) ret = ret * mp; } int main() { scanf( %d%d , &n, &K); int now = 0; for (int i = 1; i <= n; i++) scanf( %d , &a[i]), sn += a[i] == 1; for (int i = n - sn + 1; i <= n; i++) now += a[i] == 1; ret.a[0][now] = 1; for (int i = 0; i <= sn; i++) { mp.a[i][i - 1] = i * (n - sn * 2 + i); mp.a[i][i + 1] = (sn - i) * (sn - i); mp.a[i][i] = (n * (n - 1) >> 1) - i * (n - sn * 2 + i) - (sn - i) * (sn - i); } q_pow(K); printf( %I64d n , ((long long)ret.a[0][sn] * q_pow(q_pow(n * (n - 1) >> 1, mod - 2), K) % mod + mod) % mod); }
#include <bits/stdc++.h> using namespace std; int main() { int n, s, sum = 0, big; cin >> n >> s; int arr[n]; for (int i = 0; i < n; i++) { cin >> arr[i]; sum += arr[i]; } sort(arr, arr + n); big = arr[n - 1]; if (sum - big <= s) cout << YES ; else cout << NO ; return 0; }
#include <bits/stdc++.h> const int N = 26, M = 50006; int n, a[3][N], b[2 * N], f[N][M * N]; int main() { std::cin >> n; std::multiset<int> nums; for (int i = 1; i <= 2 * n; ++i) { std::cin >> b[i]; } std::sort(b + 1, b + 2 * n + 1); a[1][1] = b[1], a[2][n] = b[2]; int sum = 0; f[0][0] = 19260817; for (int i = 3; i <= 2 * n; ++i) { sum += b[i]; nums.insert(b[i]); for (int k = n - 1; k; --k) { for (int j = sum; j >= b[i]; --j) { if (!f[k][j] && f[k - 1][j - b[i]]) { f[k][j] = i; } } } } for (int i = sum / 2; ~i; --i) { if (f[n - 1][i]) { for (int k = n; k != 1; i -= b[f[--k][i]]) { int val = b[f[k - 1][i]]; a[1][k] = val; nums.erase(nums.find(val)); } } } for (int j = n - 1; !nums.empty();) { int val = *nums.begin(); a[2][j--] = val; nums.erase(nums.find(val)); } for (int i = 1; i <= 2; ++i) for (int j = 1; j <= n; ++j) printf( %d%c , a[i][j], n [j == n]); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 100010; long long f[N]; const int mod = 1000000007; int main() { string s; cin >> s; s += , ; long long ans = 1; int l = s.size(); f[0] = 1, f[1] = 1, f[2] = 2; for (int i = 3; i <= l; i++) f[i] = (f[i - 1] + f[i - 2]) % mod; long long now = 0, nn = -1; int c = 1; for (int i = 0; i < l; i++) { if (s[i] == m || s[i] == w ) { c = 0; break; } if (s[i] == u ) { if (nn == 1) now++; else { ans = ans * f[now] % mod; now = 1, nn = 1; } } else if (s[i] == n ) { if (nn == 2) now++; else { ans = ans * f[now] % mod; now = 1, nn = 2; } } else { ans = ans * f[now] % mod; now = 0, nn = -1; } } if (c == 0) cout << 0 n ; else cout << ans % mod << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int n, s[50005], ans[50005]; pair<int, int> t[50005]; int main() { scanf( %d , &n); for (int i = (1); i <= (n); i++) scanf( %d , &s[i]); s[n + 1] = s[1]; for (int i = (1); i <= (n); i++) t[i] = make_pair(s[i] + s[i + 1], i); sort(t + 1, t + n + 1); for (int i = (1); i <= (n); i++) ans[t[i].second] = i; for (int i = (1); i <= (n); i++) printf( %d%c , ans[i] - 1, i == n ? n : ); return 0; }
#include <bits/stdc++.h> using namespace std; int n, i, j, p[3005], a; int main() { scanf( %d , &n); for (i = 1; i <= n; i++) scanf( %d , &p[i]); for (i = 1; i < n; i++) for (j = i + 1; j <= n; j++) if (p[i] > p[j]) a++; printf( %d n , a * 2 - a % 2); return 0; }
#include <bits/stdc++.h> using namespace std; void die(string S) { puts(S.c_str()); exit(0); } char occ[10][10]; bool T[4][3][3] = {{{1, 1, 1}, {0, 1, 0}, {0, 1, 0}}, {{0, 1, 0}, {0, 1, 0}, {1, 1, 1}}, {{1, 0, 0}, {1, 1, 1}, {1, 0, 0}}, {{0, 0, 1}, {1, 1, 1}, {0, 0, 1}}}; int n, m; int ans; int occur, occuc; char res[10][10]; void Solve(int step) { if (step > ans) { ans = step; memcpy(res, occ, sizeof(occ)); } for (int type = 0; type < 4; type++) { bool fl = true; for (int i = occur; i < n - 2 && fl; i++) for (int j = (i == occur ? occuc : 0); j < m - 2 && fl; j++) { bool f = true; for (int k = 0; k < 3; k++) for (int l = 0; l < 3; l++) if (occ[i + k][j + l] != . && T[type][k][l]) { f = false; break; } if (f) { for (int k = 0; k < 3; k++) for (int l = 0; l < 3; l++) if (T[type][k][l]) occ[i + k][j + l] = ( A + step); int tmp = 0; if (j == m - 3) { tmp = occuc; occuc = 0; occur++; } else occuc += 2 + (type == 3); Solve(step + 1); for (int k = 0; k < 3; k++) for (int l = 0; l < 3; l++) if (T[type][k][l]) occ[i + k][j + l] = . ; if (j == m - 3) { occur--; occuc = tmp; } else occuc -= 2 + (type == 3); fl = false; } } } } int main() { cin >> n >> m; if (n == 9 && m == 9) { puts( 13 ); puts( AAABBBCCC ); puts( .AD.BE.C. ); puts( .AD.BE.C. ); puts( FDDDEEE.H ); puts( FFFGGGHHH ); puts( FIIIGJJJH ); puts( .KILG.JM. ); puts( .KILLLJM. ); puts( KKKL..MMM ); return 0; } for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) occ[i][j] = res[i][j] = . ; Solve(0); cout << ans << endl; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) cout << res[i][j]; puts( ); } return 0; }
#include <bits/stdc++.h> using namespace std; map<int, int> mp; long long v[500000]; long long f[100005], p[100005]; bool chk(int n) { while (n) { int t = n % 10; if (t == 4 || t == 7) { n /= 10; } else return false; } return true; } void egcd(long long a, long long b, long long &x, long long &y) { if (b == 0) { x = 1; y = 0; } else { egcd(b, a % b, x, y); long long k = a / b; k = x - k * y; x = y; y = k; } } long long r(long long d) { long long x, y; egcd(d, 1000000007, x, y); x %= 1000000007; if (x < 0) x += 1000000007; return x; } long long C(int a, int b) { if (a == 0 || b == 0) return 1; long long tmp = p[a] * r(p[b]); tmp = ((tmp % 1000000007) * r(p[a - b])) % 1000000007; return tmp; } int main() { int n, k; while (scanf( %d%d , &n, &k) != -1) { int i, j; int m = 0; mp.clear(); for (i = 0; i < n; i++) { int x; scanf( %d , &x); if (chk(x)) mp[x]++; else m++; } map<int, int>::iterator it; int cnt = 0; for (it = mp.begin(); it != mp.end(); it++) { v[cnt++] = it->second; } memset(f, 0, sizeof(f)); f[0] = 1; for (i = 0; i < cnt; i++) { for (j = k; j - 1 >= 0; j--) { f[j] = (f[j] + f[j - 1] * v[i]) % 1000000007; } } long long ans = 0; p[0] = 1; for (i = 1; i <= n; i++) p[i] = (p[i - 1] * i) % 1000000007; for (i = 0; i <= k && i <= m; i++) { ans = (ans + f[k - i] * C(m, i)) % 1000000007; } printf( %I64d n , ans); } return 0; }
#include <bits/stdc++.h> using namespace std; void solve(); int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int TESTS = 1; while (TESTS--) { solve(); } return 0; } void solve() { string s, t; cin >> s >> t; long long a[10]; memset(a, 0, sizeof(a)); if (s.length() == 1 && s[0] == 0 ) { if (t == s) { cout << OK ; return; } else { cout << WRONG_ANSWER ; return; } } for (long long i = 0; i < s.length(); i++) { a[s[i] - 0 ]++; } string ans; if (a[0] == 0) { ans = s; sort(ans.begin(), ans.end()); if (ans == t) { cout << OK ; return; } else { cout << WRONG_ANSWER ; return; } } else { long long index; for (long long i = 1; i < 10; i++) { if (a[i] != 0) { index = i; break; } } a[index]--; for (long long i = 0; i < 10; i++) { if (a[i] != 0) { while (a[i]--) { char temp = 0 + i; ans += string(1, temp); } } } sort(ans.begin(), ans.end()); char t2 = 0 + index; string rtans = string(1, t2); rtans += ans; if (rtans == t) { cout << OK ; return; } else { cout << WRONG_ANSWER ; return; } } return; }
#include <bits/stdc++.h> using namespace std; int a[100001]; int main() { int n, x = 0; cin >> n; for (int i = 2; i <= n; i++) { if (a[i] == 0) { x++; a[i] = x; for (int j = i; j <= n; j += i) a[j] = x; } } for (int i = 2; i <= n; i++) cout << a[i] << ; }
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; int n; double edge; while (t) { cin >> n; n = n * 2; edge = sin(3.1415926535897932384626 / n / 2); edge = 0.5 / edge; cout << setprecision(12); cout << edge << endl; --t; } return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1e3 + 7; struct node { int x1, y1, x2, y2; node() {} node(int _x1, int _y1, int _x2, int _y2) : x1(_x1), y1(_y1), x2(_x2), y2(_y2) {} } q[N]; int n, m, r[N], r1[N], c[N], c1[N]; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &r[i]); for (int i = 1; i <= n; i++) scanf( %d , &c[i]); for (int i = 1; i <= n; i++) { if (r[i] == i && c[i] == i) continue; int x, y; for (int j = i; j <= n; j++) if (r[j] == i) r[j] = r[i], x = j; for (int j = i; j <= n; j++) if (c[j] == i) c[j] = c[i], y = j; q[++m] = node(x, i, i, y); } printf( %d n , m); for (int i = 1; i <= m; i++) printf( %d %d %d %d n , q[i].x1, q[i].y1, q[i].x2, q[i].y2); }
#include <bits/stdc++.h> using namespace std; int n, k, a[10010]; long long ans; int main() { scanf( %d%d , &n, &k); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); sort(a + 1, a + n + 1); for (int i = 1; i <= k; i++) ans += a[i]; printf( %lld n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; long long int power(long long int x, long long int y, long long int p) { long long int res = 1; x = x % p; if (x == 0) return 0; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } bool sortinrev(const pair<int, int>& a, const pair<int, int>& b) { if (a.first == b.first) return b.second > a.second; return a.first > b.first; } void run(vector<int> v) { for (int i = 0; i < v.size(); i++) cout << v[i] << ; cout << endl; } int modInverse(long long int a, long long int m) { long long int m0 = m; long long int y = 0, x = 1; if (m == 1) return 0; while (a > 1) { long long int q = a / m; long long int t = m; m = a % m, a = t; t = y; y = x - q * y; x = t; } if (x < 0) x += m0; return x; } void numberOfNodes(int n, vector<long long int> adj[], vector<long long int>& count1, int s, int e) { vector<long long int>::iterator u; count1[s] = 1; for (u = adj[s].begin(); u != adj[s].end(); u++) { if (*u == e) continue; numberOfNodes(n, adj, count1, *u, s); count1[s] += count1[*u]; } } void solve() { int n, k, unhappy = 0; cin >> n >> k; vector<pair<int, int>> edges; vector<int> adj[n + 1]; unordered_map<int, int> mp[n + 1]; vector<bool> vis(n + 1, 0); for (int i = 0; i < k; i++) { int x, y; cin >> x >> y; if (mp[x].find(y) == mp[x].end()) { mp[x][y]++; mp[y][x]++; edges.push_back({x, y}); adj[x].push_back(y); adj[y].push_back(x); } } unhappy += (k - edges.size()); k -= unhappy; queue<int> q; int ans = 0; for (int i = 1; i <= n; i++) { if (!vis[i]) { q.push(i); vector<int> vec; vis[i] = 1; vec.push_back(i); while (!q.empty()) { int p = q.front(); q.pop(); for (int j = 0; j < adj[p].size(); j++) { if (!vis[adj[p][j]]) { vec.push_back(adj[p][j]); vis[adj[p][j]] = 1; q.push(adj[p][j]); } } } ans += (vec.size() - 1); } } cout << unhappy + k - ans << endl; } int main() { int t; t = 1; while (t--) { solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const double esp = 0.0000000001; const double PI = acos(-1.0); const int mod = 1e9 + 7; const int MY = 1400 + 5; const int MX = 1010 + 5; int num, n, k; vector<int> G[MX]; int d[MX * MX], g[MX][MX], vis[MX]; struct node { int x, y; } P[MX]; bool dfs(int cnt, int m) { if (cnt > n) return true; if (vis[cnt]) return dfs(cnt + 1, m); for (int i = 0; i < (int)G[cnt].size(); ++i) { m += !vis[G[cnt][i]]; vis[G[cnt][i]]++; } if (m <= k && dfs(cnt + 1, m)) return true; int temp = m; for (int i = 0; i < (int)G[cnt].size(); ++i) { vis[G[cnt][i]]--; m -= !vis[G[cnt][i]]; } if (G[cnt].size() != 1) { vis[cnt]++; if (m + 1 <= k && m + 1 < temp && dfs(cnt + 1, m + 1)) return true; vis[cnt]--; } return false; } bool judge(int dist) { memset(vis, false, sizeof(vis)); for (int i = 1; i <= n; ++i) G[i].clear(); for (int i = 1; i < n; ++i) for (int j = i + 1; j <= n; ++j) if (g[i][j] > dist) { G[i].push_back(j); G[j].push_back(i); } return dfs(1, 0); } int binary_search(int le, int rt) { int mid; while (le < rt) { mid = (le + rt) >> 1; if (judge(d[mid])) rt = mid; else le = mid + 1; } return le; } int main() { while (~scanf( %d%d , &n, &k)) { num = 0; d[0] = 0; for (int i = 1; i <= n; ++i) scanf( %d%d , &P[i].x, &P[i].y); for (int i = 1; i < n; ++i) for (int j = i + 1; j <= n; ++j) d[++num] = g[i][j] = (P[i].x - P[j].x) * (P[i].x - P[j].x) + (P[i].y - P[j].y) * (P[i].y - P[j].y); sort(d, d + num + 1); num = unique(d, d + num + 1) - d - 1; int mx = binary_search(0, num); judge(d[mx]); bool first = false; for (int i = n; i >= 1; --i) if (vis[i]) { if (first) putchar( ); printf( %d , i); k--; first = true; } for (int i = n; i >= 1 && k > 0; --i) if (!vis[i]) { if (first) putchar( ); printf( %d , i); k--; first = true; } cout << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const long long int MAXN = 2e5 + 51; long long int n, r; long long int prefix[MAXN], f[MAXN]; inline long long int read() { register long long int num = 0, neg = 1; register char ch = getchar(); while (!isdigit(ch) && ch != - ) { ch = getchar(); } if (ch == - ) { neg = -1; ch = getchar(); } while (isdigit(ch)) { num = (num << 3) + (num << 1) + (ch - 0 ); ch = getchar(); } return num * neg; } int main() { n = read(); for (register int i = 1; i <= n; i++) { prefix[i] = prefix[i - 1] + read(); } r = prefix[n]; for (register int i = n - 1; i >= 1; i--) { f[i] = r, r = max(r, prefix[i] - f[i]); } printf( %lld n , f[1]); }
#include <bits/stdc++.h> using namespace std; const long long int INF = 2e18; const long long int N = 2e5 + 5; bool isPrime(long long int n) { if (n <= 1) return false; if (n <= 3) return true; if (n % 2 == 0 || n % 3 == 0) return false; for (long long int i = 5; i * i <= n; i = i + 6) { if (n % i == 0 || n % (i + 2) == 0) return false; } return true; } long long int factorial(long long int n) { long long int ans = 1; for (long long int i = 1; i <= n; i++) ans = (ans * i) % 1000000007; return ans; } long long int exp(long long int x, long long int n) { long long int res = 1; while (n > 0) { if (n % 2 == 1) res = (res * x) % 1000000007; x = (x * x) % 1000000007; n = n / 2; } return res; } void null() { long long int n; cin >> n; char a[n][n]; for (long long int i = 0; i < n; i++) { for (long long int j = 0; j < n; j++) { cin >> a[i][j]; } } long long int ans = 0; if (a[0][1] == a[1][0]) { if (a[n - 1][n - 2] == a[n - 2][n - 1]) { if (a[n - 1][n - 2] == a[0][1]) { cout << 2 << n ; cout << 1 << << 2 << n ; cout << 2 << << 1 << n ; return; } else { cout << 0 << n ; return; } } if (a[n - 1][n - 2] != a[n - 2][n - 1]) { if (a[n - 1][n - 2] == a[0][1]) { cout << 1 << n ; cout << n << << n - 1 << n ; return; } else if (a[n - 2][n - 1] == a[0][1]) { cout << 1 << n ; cout << n - 1 << << n << n ; return; } } } else { if (a[n - 1][n - 2] == a[n - 2][n - 1]) { if (a[0][1] == a[n - 1][n - 2]) { cout << 1 << n ; cout << 1 << << 2 << n ; return; } else { cout << 1 << n ; cout << 2 << << 1 << n ; return; } } else { cout << 2 << n ; if (a[0][1] == a[n - 1][n - 2]) { cout << 1 << << 2 << n ; cout << n - 1 << << n << n ; return; } else if (a[0][1] == a[n - 2][n - 1]) { cout << 1 << << 2 << n ; cout << n << << n - 1 << n ; return; } } } } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long int t = 1; clock_t start, end; start = clock(); cin >> t; while (t--) { null(); } end = clock(); double time_taken = double(end - start) / double(CLOCKS_PER_SEC); }
#include <bits/stdc++.h> using namespace std; void optimise() { ios_base::sync_with_stdio(false); cin.tie(NULL); } void solve() { string s; cin >> s; string s2; cin >> s2; sort(s.begin(), s.end()); for (long long int i = 0; i < s.size(); i++) { for (long long int j = i + 1; j < s.size(); j++) { string k = s; swap(k[i], k[j]); if (stoll(k) >= stoll(s) && stoll(k) <= stoll(s2)) s = k; } } cout << s; } signed main() { optimise(); long long int t = 1; while (t--) { solve(); } }
#include <bits/stdc++.h> using namespace std; template <class T> inline T modinv(T a, T n) { T i = n, v = 0, d = 1; while (a > 0) { T t = i / a, x = a; a = i % x; i = x; x = d; d = v - t * x; v = x; } return (v + n) % n; } long long modpow(long long n, long long k, long long mod) { if (k == 0) return 1LL; long long ans = 1; while (k > 0) { if (k & 1) ans = (ans * n) % mod; k >>= 1; n = (n * n) % mod; } return ans % mod; } template <class T> struct Fraction { T a, b; Fraction(T a = 0, T b = 1); string toString(); }; template <class T> Fraction<T>::Fraction(T a, T b) { T d = GCD(a, b); a /= d; b /= d; if (b < 0) a = -a, b = -b; this->a = a; this->b = b; } template <class T> string Fraction<T>::toString() { ostringstream sout; sout << a << / << b; return sout.str(); } template <class T> Fraction<T> operator+(Fraction<T> p, Fraction<T> q) { return Fraction<T>(p.a * q.b + q.a * p.b, p.b * q.b); } template <class T> Fraction<T> operator-(Fraction<T> p, Fraction<T> q) { return Fraction<T>(p.a * q.b - q.a * p.b, p.b * q.b); } template <class T> Fraction<T> operator*(Fraction<T> p, Fraction<T> q) { return Fraction<T>(p.a * q.a, p.b * q.b); } template <class T> Fraction<T> operator/(Fraction<T> p, Fraction<T> q) { return Fraction<T>(p.a * q.b, p.b * q.a); } template <class T> string str(T Number) { string Result; ostringstream convert; convert << Number; Result = convert.str(); return Result; } int StringToNumber(const string &Text) { istringstream ss(Text); int result; return ss >> result ? result : 0; } template <class T> inline vector<pair<T, int> > FACTORISE(T n) { vector<pair<T, int> > R; for (T i = 2; n > 1;) { if (n % i == 0) { int C = 0; for (; n % i == 0; C++, n /= i) ; R.push_back(make_pair(i, C)); } i++; if (i > n / i) i = n; } if (n > 1) R.push_back(make_pair(n, 1)); return R; } template <class T> inline T TOTIENT(T n) { vector<pair<T, int> > R = FACTORISE(n); T r = n; for (int i = 0; i < R.size(); i++) r = r / R[i].first * (R[i].first - 1); return r; } template <class T> inline T gcd(T a, T b) { return b ? gcd(b, a % b) : a; } double rnd(float d) { return floor(d + 0.49); } int main() { string s; cin >> s; int k = ({ int x; scanf( %d , &x); x; }); long long ans = 0; long long n = ((int)(s).size()); long long t = (modpow(2, n, 1000000007) - 1 + 1000000007); long long inv = modpow(t + 1000000007, 1000000007 - 2, 1000000007); for (long long i = 0; i < n; i++) { if ((s[i] - 48) % 5 == 0) { ans = (ans + modpow(2, i, 1000000007)) % 1000000007; } } cout << (ans * (modpow(2, (k)*n, 1000000007) - 1 + 1000000007) % 1000000007 * inv) % 1000000007 << n ; return 0; }
#include <bits/stdc++.h> using namespace std; int a[50], p[50], b[50]; bool cmp(int x, int y) { if (a[x] < a[y]) return 1; return 0; } int main() { int n; scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , &a[i]); p[i] = i; } sort(p, p + n, cmp); for (int i = 0; i < n - 1; i++) { b[p[i + 1]] = a[p[i]]; } b[p[0]] = a[p[n - 1]]; for (int i = 0; i < n; i++) { printf( %d , b[i]); } return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 100; int f[maxn]; int a[maxn]; char s[maxn]; int main() { int d; scanf( %d , &d); scanf( %s , s); int len = strlen(s); a[1] = s[0] - 0 ; for (int i = 1; i < len; i++) { a[i + 1] = a[i] + (s[i] - 0 ); } for (int i = 1; i <= len; i++) { for (int j = 0; j < i; j++) { f[a[i] - a[j]]++; } } long long ans = 0; for (int i = 1; i < maxn; i++) { if (d % i) continue; if ((d / i) >= maxn) continue; ans += (long long)f[i] * f[d / i]; } if (d == 0) { ans = 0; for (int i = 0; i < maxn; i++) ans += (long long)f[0] * f[i]; ans *= 2; ans -= (long long)f[0] * f[0]; } printf( %I64d n , ans); }
#include <bits/stdc++.h> using namespace std; const int kN = 2e5 + 10; int N, M; struct Ele { long long len; char c; void read() { len = 0; char s[30]; scanf( %s , s); for (int i = 0; s[i]; i++) { if (s[i] == - ) { c = s[i + 1]; break; } else { len *= 10; len += s[i] - 0 ; } } } bool operator==(const Ele &e) const { return len == e.len && c == e.c; } bool operator!=(const Ele &e) const { return !((*this) == e); } }; Ele A[kN], B[kN], T[kN]; int tn; void merge(Ele a[], int &n) { int p = 0; for (int i = 1; i <= n; i++) { if (p && a[p].c == a[i].c) { a[p].len += a[i].len; } else { p++; a[p] = a[i]; } } n = p; } bool check(int i, int j) { return i >= 1 && i <= N && A[i].len >= B[j].len && A[i].c == B[j].c; } int lst[kN]; int main() { scanf( %d %d , &N, &M); for (int i = 1; i <= N; i++) A[i].read(); for (int i = 1; i <= M; i++) B[i].read(); merge(A, N); merge(B, M); for (int i = 2; i < M; i++) T[++tn] = B[i]; long long ans = 0; if (M == 1) { for (int i = 1; i <= N; i++) { if (A[i].c == B[1].c && A[i].len >= B[1].len) { ans += A[i].len - B[1].len + 1; } } } else { lst[1] = 0; for (int i = 2; i <= tn; i++) { int p = lst[i - 1]; while (p && T[p + 1] != T[i]) p = lst[p]; if (T[p + 1] == T[i]) p++; lst[i] = p; } int j = 0; for (int i = 1; i <= N; i++) { while (j < tn && j && T[j + 1] != A[i]) j = lst[j]; if (tn && T[j + 1] == A[i]) j++; if (j == tn) { if (check(i + 1, M) && check(i - tn, 1)) { ans++; } j = lst[j]; } } } printf( %I64d n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 200005; vector<int> g[N]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, s; cin >> n >> s; for (int i = 0; i < n - 1; ++i) { int a, b; cin >> a >> b; g[a].push_back(b); g[b].push_back(a); } int leaves = 0; for (int i = 1; i <= n; ++i) { if (g[i].size() == 1) leaves++; } long double ans = (long double)(2 * s) / (long double)leaves; cout << fixed << setprecision(8) << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; void fast() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } long long gcd(long long a, long long b) { if (b == 0) return a; else gcd(b, a % b); } long long lcd(long long a, long long b) { return (a * b) / gcd(a, b); } int main() { int t; cin >> t; while (t--) { int n, a[100] = {0}; vector<int> v; cin >> n; for (int i = 0; i < 2 * n; i++) { int temp; cin >> temp; if (a[temp] == 0) v.push_back(temp); a[temp] = 1; } for (int i = 0; i < v.size(); i++) cout << v[i] << ; cout << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int n, a[1010], b[1010], cnt, x[1010], y[1010], z[1010], w[1010]; int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %d , &a[i]); for (int i = 1; i <= n; ++i) scanf( %d , &b[i]); for (int i = 1; i <= n; ++i) { if (a[i] == i && b[i] == i) continue; ++cnt; for (int j = i; j <= n; ++j) if (a[j] == i) x[cnt] = j, y[cnt] = i, swap(a[j], a[i]); for (int j = i; j <= n; ++j) if (b[j] == i) z[cnt] = i, w[cnt] = j, swap(b[j], b[i]); } printf( %d n , cnt); for (int i = 1; i <= cnt; ++i) printf( %d %d %d %d n , x[i], y[i], z[i], w[i]); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { double a, b, c, d; cin >> a >> b >> c >> d; cout << (long long)ceil((ceil(b / c) * a) / d) << endl; return 0; }
#include <bits/stdc++.h> using namespace std; void fast() { ios_base::sync_with_stdio(false); cin.tie(NULL); } map<int, int> mpi; map<string, int> mps; map<int, vector<int> > path; map<int, int> visited; set<int> st; vector<int> v; map<int, int>::iterator iti; map<string, int>::iterator its; set<int>::iterator sit; vector<int>::iterator itv; void fresh() { mpi.clear(); mps.clear(); st.clear(); v.clear(); path.clear(); visited.clear(); } int main() { fast(); int n, a, b, c, d, x1, x2, y1, y2; int tst; cin >> tst; while (tst--) { cin >> n >> a >> b >> c >> d; bool flag = false; for (int i = c - d; i <= c + d; i++) { if ((i / n) >= (a - b) && (i / n) <= (a + b)) { int x = ceil((float)i / (float)n); if (x >= (a - b) && x <= (a + b)) { flag = true; break; } } } if (flag) { cout << YES << endl; ; } else cout << NO << endl; ; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; long long ans = 1; for (long long int i = 2; i * i <= n; i++) { long long int temp = 0; while (n % i == 0) { temp++; n /= i; } ans *= (temp + 1); } if (n > 1) ans *= 2; cout << ans << endl; }
#include <bits/stdc++.h> using namespace std; bool isGeometrical(int *a, int n) { if (a[0] == 0) { for (int i = 0; i < n; i++) if (a[i] != 0) return false; return true; } for (int i = 0; i < n - 1; i++) if (a[i + 1] * a[0] != a[i] * a[1]) return false; return true; } int main() { int n; scanf( %d , &n); int a[100000], num0 = 0, pos0 = -1; for (int i = 0; i < n; i++) { scanf( %d , a + i); if (a[i] == 0) { num0++; if (pos0 == -1) pos0 = i; } } if (n <= 2) { printf( %d n , isGeometrical(a, n) ? 0 : 1); return 0; } if (n == 3) { int ans = 2; if (isGeometrical(a, n)) ans = 0; else { int b[2]; b[0] = a[0], b[1] = a[1]; if (isGeometrical(b, 2)) ans = 1; b[0] = a[0], b[1] = a[2]; if (isGeometrical(b, 2)) ans = 1; b[0] = a[1], b[1] = a[2]; if (isGeometrical(b, 2)) ans = 1; } printf( %d n , ans); return 0; } if (num0 >= 2) { int cnt = 0; for (int i = 1; i < n; i++) if (a[i] != 0) cnt++; printf( %d n , min(cnt, 2)); return 0; } if (num0 == 1) { for (int i = pos0; i < n - 1; i++) a[i] = a[i + 1]; printf( %d n , isGeometrical(a, n - 1) ? 1 : 2); return 0; } if (isGeometrical(a, n)) { puts( 0 ); return 0; } if (isGeometrical(a + 1, n - 1)) { puts( 1 ); return 0; } swap(a[0], a[1]); if (isGeometrical(a + 1, n - 1)) { puts( 1 ); return 0; } swap(a[0], a[1]); int cnt = 0; for (int i = 0; i < n - 1; i++) { if (a[i + 1] * a[0] != a[i] * a[1]) { cnt++; a[i + 1] = a[i]; } if (cnt == 2) break; } printf( %d n , cnt); return 0; }
#include <bits/stdc++.h> using namespace std; int n, kk, a, b; double dp[1123][111][111]; int arr[111]; void solve() { scanf( %d , &n); ; scanf( %d , &kk); ; kk = min(kk, 1000); double dd = n * (n + 1) / 2; double ans = 0.0; for (int i = 0; i < n; i++) { scanf( %d , &arr[i]); ; for (int j = i + 1; j < n; j++) { dp[0][i][j] = 1.0; } } for (int k = 1; k <= kk; k++) { for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { dp[k][i][j] += dp[k - 1][i][j] * ((i * (i + 1)) / 2 + ((n - 1 - j) * (n - j)) / 2 + ((j - i - 1) * (j - i)) / 2); for (int sum = j; sum <= i + (n - 1); sum++) { a = (sum - n + 1 > 0 ? sum - n + 1 : 0); b = (i < sum - j ? i : sum - j); dp[k][i][j] += (1.0 - dp[k - 1][sum - j][sum - i]) * (b - a + 1); } for (int sum = i; sum <= i + (j - 1); sum++) { a = (sum - j + 1 > 0 ? sum - j + 1 : 0); b = (i < sum - i ? i : sum - i); dp[k][i][j] += dp[k - 1][sum - i][j] * (b - a + 1); } for (int sum = (i + 1) + j; sum <= j + (n - 1); sum++) { a = (i + 1 > sum - n + 1 ? i + 1 : sum - n + 1); b = (j < sum - j ? j : sum - j); dp[k][i][j] += dp[k - 1][i][sum - j] * (b - a + 1); } dp[k][i][j] /= dd; } } } for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { if (arr[i] > arr[j]) { ans += dp[kk][i][j]; } else { ans += 1 - dp[kk][i][j]; } } } printf( %.11f n , ans); } int main() { solve(); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10, mod = 1e9 + 7, L = 20; vector<int> G[N], g[N]; int h[N], x[5 * N], y[5 * N], par[N][L]; map<int, bool> mp[N]; void dfs(int v, int p) { par[v][0] = p; for (int i = 1; i < L; i++) par[v][i] = par[par[v][i - 1]][i - 1]; for (int u : g[v]) if (u != p && h[u] == -1) h[u] = h[v] + 1; for (int u : g[v]) if (h[u] == h[v] + 1) dfs(u, v); } int pr(int v, int x) { for (int i = 0; i < L; i++) if ((1 << i) & x) v = par[v][i]; return v; } int lca(int u, int v) { if (h[u] > h[v]) swap(u, v); v = pr(v, h[v] - h[u]); if (u == v) return v; for (int i = L - 1; i >= 0; i--) if (par[v][i] != par[u][i]) u = par[u][i], v = par[v][i]; return par[v][0]; } int solve(int u, int v) { int p = lca(u, v); int ret = h[u] + h[v] - 2 * h[p]; if (p == u || p == v) return ret; int x = pr(u, h[u] - h[p] - 1), y = pr(v, h[v] - h[p] - 1); if (x > y) swap(x, y); if (mp[x][y]) ret--; return ret; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); memset(h, -1, sizeof(h)); int n, m, q; cin >> n >> m >> q; h[0] = 0; for (int i = 0; i < m; i++) { cin >> x[i] >> y[i]; x[i]--; y[i]--; if (x[i] > y[i]) swap(x[i], y[i]); g[x[i]].push_back(y[i]); g[y[i]].push_back(x[i]); mp[x[i]][y[i]] = true; } dfs(0, 0); for (int i = 0; i < q; i++) { int x, y; cin >> x >> y; x--; y--; cout << solve(x, y) << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; long long blk = 300; struct data { long long l, r, i; data() { l = r = i = 0; } data(long long v1, long long v2, long long v3) { l = v1; r = v2; i = v3; } bool operator<(const data &x) const { if (l / blk != x.l / blk) return (l / blk < x.l / blk); else return (r < x.r); } }; long long num[100005], num2[100005]; data query[100005]; long long freq[1048600], freq2[1048600]; long long output[100005]; int main() { long long a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t; scanf( %lld %lld %lld , &a, &b, &c); num[0] = 0; for (i = 1; i <= a; i++) { scanf( %lld , &num[i]); num2[i] = num[i]; num[i] ^= num[i - 1]; } for (i = a - 1; i >= 1; i--) num2[i] ^= num2[i + 1]; for (i = 1; i <= b; i++) { scanf( %lld %lld , &d, &e); query[i] = data(d, e, i); } sort(query + 1, query + b + 1); memset(freq, 0, sizeof(freq)); l = 1; r = 0; long long ans = 0; num[a + 1] = 0; freq[0]++; freq2[num2[1]]++; for (i = 1; i <= b; i++) { freq2[num2[r + 1]]--; while (r < query[i].r) { r++; ans += freq[c ^ num[r]]; freq[num[r]]++; freq2[num2[r]]++; } while (r > query[i].r) { freq[num[r]]--; freq2[num2[r]]--; ans -= freq[c ^ num[r]]; r--; } freq2[num2[r + 1]]++; freq[num[l - 1]]--; while (l < query[i].l) { freq2[num2[l]]--; freq[num[l]]--; ans -= freq2[c ^ num2[l]]; l++; } while (l > query[i].l) { l--; ans += freq2[c ^ num2[l]]; freq2[num2[l]]++; freq[num[l]]++; } freq[num[l - 1]]++; output[query[i].i] = ans; } for (i = 1; i <= b; i++) { printf( %lld n , output[i]); } return 0; }
#include <bits/stdc++.h> using namespace std; const int tam = 100010; const int MOD = 1000000007; const int MOD1 = 998244353; const double EPS = 1e-9; const double PI = acos(-1); int ar[3000000]; int main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; for (int i = 0; i < n; i++) ar[i] = i + 1; for (int i = 2; i < n + 1; i++) { for (int j = (n + i - 2) - (n % i == 0 ? i : n % i); j > i - 3; j -= i) { ar[min(n + i - 2, j + i)] = ar[j]; } } for (int i = n - 1; i < 2 * n - 1; i++) { if (i > n - 1) cout << ; cout << ar[i]; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { string str; int n; cin >> n >> str; bool flag = true; int fs = 0, ss = 0; for (int i = 0; i < n; i++) { if (str[i] != 4 && str[i] != 7 ) { flag = false; } } for (int i = 0; i < n / 2; i++) { fs += str[i] - 0 ; } for (int i = n / 2; i < n; i++) { ss += str[i] - 0 ; } if (fs != ss) flag = false; if (flag) cout << YES << endl; else cout << NO << endl; return 0; }
#include <bits/stdc++.h> inline int gi() { register int x = 0, f = 0; register char ch = getchar(); while (!isdigit(ch)) f ^= ch == - , ch = getchar(); while (isdigit(ch)) x = x * 10 + ch - 0 , ch = getchar(); return f ? -x : x; } std::set<std::pair<int, int> > st[100010]; std::bitset<200010> bit, I, B, C; inline bool nmd(int n, int g) { for (int i = 1; i < n; ++i) for (auto j : st[i]) { int a = j.first, b = j.second; a = (a + g - 1) % n + 1, b = (b + g - 1) % n + 1; if (st[i].find({a, b}) == st[i].end() && st[i].find({b, a}) == st[i].end()) return 0; } puts( Yes ); exit(0); } int main() { long long n = gi(), m = gi(), a, b, c; for (int i = 1; i <= m; ++i) { a = gi(), b = gi(); if (a > b) std::swap(a, b); c = std::min(b - a, a + n - b); if (b - a != c) std::swap(a, b); if (c * 2 == n) st[c].insert({b, a}), st[c].insert({a, b}); else st[c].insert({a, b}); } for (int i = 1; i * i <= n; ++i) if (n % i == 0) { nmd(n, i); if (i * i != n && i != 1) nmd(n, n / i); } puts( No ); return 0; }
#include <bits/stdc++.h> using namespace std; const int MAX_N = 1e5 + 5; const int M = 1e6; const long long INF = (long long)(1e18); const int inf = 1e9; const long long MOD = 1000000007LL; long long n, m; long long a[MAX_N]; long long ans[MAX_N]; long long suff[MAX_N]; void solve() {} int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> m; long long s = 0LL; for (long long i = 1; i <= m; i++) { cin >> a[i]; s += a[i]; } bool ok = true; for (long long i = 1; i <= m; i++) { if (i - 1 + a[i] > n) { ok = false; break; } } if (s < n || !ok) { cout << -1; return 0; } for (long long i = m; i >= 1; i--) { suff[i] = suff[i + 1] + a[i]; ans[i] = max(i, n - suff[i] + 1); } for (long long i = 1; i <= m; i++) { cout << ans[i] << ; } return 0; }
#include <bits/stdc++.h> using namespace std; #pragma warning(disable : 4996) struct E { int to; vector<long long> w; }; const long long INF = 1e18; const int N = 3e5 + 5, L = 20; vector<E> g[N]; long long t[N], d[2][2][N][L]; int anc[N][L], tin[N], tout[N]; int timer = 0, n; void deep(int node) { for (E e : g[node]) { if (e.to != anc[node][0]) { anc[e.to][0] = node; deep(e.to); t[node] = min(t[node], t[e.to] + e.w[0] + e.w[1]); } } } void walk(int node, long long u) { u = min(u, t[node]); t[node] = u; for (E e : g[node]) { if (e.to != anc[node][0]) walk(e.to, u + e.w[0] + e.w[1]); } } void dfs(int node) { tin[node] = timer++; for (int i = 1; i < L; i++) { anc[node][i] = anc[anc[node][i - 1]][i - 1]; for (int x = 0; x < 2; x++) { for (int y = 0; y < 2; y++) { for (int z = 0; z < 2; z++) { d[x][z][node][i] = min(d[x][z][node][i], d[x][y][node][i - 1] + d[y][z][anc[node][i - 1]][i - 1]); } } } } for (E e : g[node]) { if (e.to != anc[node][0]) { anc[e.to][0] = node; for (int i = 0; i < 2; i++) { d[i][i][e.to][0] = min(e.w[i], e.w[1 - i] + t[node] + t[e.to]); d[i][1 - i][e.to][0] = min(e.w[1 - i] + t[e.to], t[node] + e.w[i]); } dfs(e.to); } } tout[node] = timer; } bool upper(int a, int b) { return tin[a] <= tin[b] && tout[a] >= tout[b]; } long long calc(int x, int a, int y, int b) { long long dp[2]; dp[x] = 0; dp[1 - x] = t[a]; if (a == b) return dp[y]; for (int i = L - 1; i >= 0; i--) { if (!upper(anc[a][i], b)) { long long ndp[2] = {INF, INF}; for (int j = 0; j < 2; j++) { for (int k = 0; k < 2; k++) { ndp[k] = min(ndp[k], dp[j] + d[j][k][a][i]); } } for (int j = 0; j < 2; j++) dp[j] = ndp[j]; a = anc[a][i]; } } return min(dp[0] + d[0][y][a][0], dp[1] + d[1][y][a][0]); } int getLca(int a, int b) { if (upper(a, b)) return a; for (int i = L - 1; i >= 0; i--) { if (!upper(anc[a][i], b)) a = anc[a][i]; } return anc[a][0]; } long long getAns(int a, int b) { int x = a % 2, y = b % 2; a /= 2; b /= 2; int l = getLca(a, b); long long ans = min(calc(x, a, 0, l) + calc(y, b, 0, l), calc(x, a, 1, l) + calc(y, b, 1, l)); return ans; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; for (int i = 0; i < n; i++) { cin >> t[i]; } for (int i = 0; i < n - 1; i++) { int x, y; long long w1, w2; cin >> x >> y >> w1 >> w2; x--, y--; g[x].push_back({y, {w1, w2}}); g[y].push_back({x, {w1, w2}}); } for (int i = 0; i < 2; i++) { for (int j = 0; j < 2; j++) { for (int k = 0; k < n; k++) { for (int h = 0; h < L; h++) { d[i][j][k][h] = INF; } } } } deep(0); walk(0, INF); dfs(0); int q; cin >> q; while (q--) { int a, b; cin >> a >> b; a--, b--; cout << getAns(a, b) << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int n, k; cin >> n >> k; long long ans = 0; for (int i = 0; i < k && n >= 2; i++) { ans += n - 1 + n - 2; n -= 2; } cout << ans; }
#include <bits/stdc++.h> using namespace std; char src[2002], tar[2002]; int ans[2002 * 4], n; int get(int l, int r, char ch) { for (int i = l; i <= r; i++) if (src[i] == ch) return i; return -1; } void reverse(int l, int r) { for (int i = l; i < r - i + l; i++) swap(src[i], src[r - i + l]); } void doswap(int la, int lb) { reverse(la + lb + 1, n); reverse(1, n); reverse(2, n); } void work() { int step = 0; for (int i = n; i >= 1; i--) { int p = get(n - i + 1, n, tar[i]); if (p == -1) { puts( -1 ); return; } else { ans[++step] = n; ans[++step] = p - 1; ans[++step] = 1; doswap(n - i, p - n + i - 1); } } printf( %d n , step); for (int i = 1; i <= step; i++) printf( %d , ans[i]); putchar( n ); } int main() { scanf( %d , &n); scanf( %s , src + 1); scanf( %s , tar + 1); work(); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 100100; int main() { ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); int t; cin >> t; for (int hh = 1; hh <= t; hh++) { int a, b, c, r, aa, bb; cin >> aa >> bb >> c >> r; int r1, r2; r1 = c - r; r2 = c + r; a = min(aa, bb); b = max(aa, bb); if (a >= r2) { cout << b - a << endl; continue; } if (b <= r1) { cout << b - a << endl; continue; } if (a >= r1 && b <= r2) { cout << 0 << endl; continue; } if (a < r1 && b > r2) { cout << r1 - a + b - r2 << endl; continue; } if (a < r1 && b <= r2) { cout << r1 - a << endl; continue; } if (a >= r1 && b > r2) { cout << b - r2 << endl; continue; } } return 0; }
#include <bits/stdc++.h> using namespace std; const int mxn = 300001; int n; long long a[mxn], dp[mxn]; map<int, int> first[mxn]; void answer() { cin >> n; long long ret = 0; for (int i = 1; i <= n; i++) { cin >> a[i]; first[i].clear(); if (first[i - 1].count(a[i])) { int x = first[i - 1][a[i]]; ret += (dp[i] = (x ? dp[x - 1] : 0) + 1); swap(first[i], first[x - 1]); first[i][a[x - 1]] = x - 1; } else { dp[i] = 0; } first[i][a[i]] = i; } cout << ret << n ; } int main() { ios::sync_with_stdio(0); cin.tie(0); int t; cin >> t; for (int i = 0; i < t; i++) answer(); return 0; }
#include <bits/stdc++.h> using namespace std; void solve() { int n; cin >> n; vector<int> a(n); int prev = -1; bool invalid = false; for (int i = 0; i < n; i++) { cin >> a[i]; invalid = (prev > a[i]) || (a[i] > i + 1); prev = a[i]; } if (invalid) { cout << -1 << endl; return; } int mex = a.back(); vector<int> ans(n); bool first = true; for (int i = 0, cnt = 0; i < n; i++) { if (first && i == mex) { first = false; cnt++; } ans[i] = cnt++; } for (int i = n - 1; ~i; i--) { if (ans[a[i]] == a[i]) { swap(ans[a[i]], ans[i + 1]); } } for (int i = 0; i < n; i++) { cout << ans[i] << n [i + 1 == n]; } } int main() { ios::sync_with_stdio(false); cin.tie(0); int t = 1; while (t--) { solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXN = (1 << 20) + 50; const int MAXLOG = 21; long long int a[MAXN]; long long int data[MAXLOG][MAXN]; long long int answer[2][MAXN]; long long int n; void build(int s = 0, int e = (1 << n), int h = 0) { if (e - s < 2) { data[h][s] = a[s]; return; } int mid = (s + e) / 2; build(s, mid, h + 1); build(mid, e, h + 1); merge(data[h + 1] + s, data[h + 1] + mid, data[h + 1] + mid, data[h + 1] + e, data[h] + s); for (int i = s; i < mid; i++) { long long int now = lower_bound(data[h + 1] + mid, data[h + 1] + e, a[i]) - (data[h + 1] + mid); answer[0][h] += now; } for (int i = mid; i < e; i++) { long long int now = lower_bound(data[h + 1] + s, data[h + 1] + mid, a[i]) - (data[h + 1] + s); answer[1][h] += now; } } int main() { scanf( %I64d , &n); for (int i = 0; i < (1 << n); i++) { scanf( %I64d , a + i); } build(); long long int q; scanf( %I64d , &q); while (q--) { long long int ans = 0; long long int cur; scanf( %I64d , &cur); for (int i = n - cur; i < n; ++i) { swap(answer[0][i], answer[1][i]); } for (int i = 0; i < n; i++) { ans += answer[0][i]; } printf( %I64d n , ans); } }
#include <bits/stdc++.h> using namespace std; const int N = 200005; int n, a[N], cnt[N], sum[N]; vector<int> pos[N]; set<int> S; int main() { scanf( %d , &n); for (int i = (1); i <= (n); ++i) scanf( %d , &a[i]), ++cnt[a[i]], pos[a[i]].push_back(i); int tt = 0, mx = 0; for (int i = (1); i <= (n); ++i) { if (cnt[i] > cnt[mx]) { mx = i; tt = 0; } if (cnt[i] == cnt[mx]) { ++tt; } } if (tt > 1) { printf( %d n , n); return 0; } for (int i = (1); i <= (n + 1); ++i) sum[i] = sum[i - 1] + (a[i] == mx), a[i] == mx && (S.insert(i), 0); int ans = 0; for (int i = (1); i <= (n); ++i) if (i != mx && ((int)(pos[i]).size())) { vector<int> v; for (auto x : pos[i]) { { auto it = S.lower_bound(x); if (it != S.begin()) { v.push_back(*prev(it)); S.erase(prev(it)); } if (it != S.end()) { v.push_back(*it); S.erase(*it); } } { auto it = S.lower_bound(x); if (it != S.begin()) { v.push_back(*prev(it)); S.erase(prev(it)); } if (it != S.end()) { v.push_back(*it); S.erase(*it); } } } vector<int> t(v); for (auto x : pos[i]) v.push_back(x); { auto it = S.lower_bound(*min_element(v.begin(), v.end())); if (it != S.begin()) { --it; v.push_back(*it); } v.push_back(0); it = S.upper_bound(*max_element(v.begin(), v.end())); if (it != S.end()) { v.push_back(*it); } v.push_back(n + 1); } sort(v.begin(), v.end()); map<int, int> fi; fi[sum[v[0]]] = v[0]; int s = 0; for (int j = (1); j <= (((int)(v).size()) - 1); ++j) { if (fi.count(sum[v[j] - 1] + s)) { ans = max(ans, v[j] - 1 - fi[sum[v[j] - 1] + s]); } if (a[v[j]] == i) --s; if (!fi.count(sum[v[j]] + s)) fi[sum[v[j]] + s] = v[j]; } for (auto x : t) S.insert(x); } printf( %d n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; int n, k; long long a[1 << 24], dp[1 << 24], b[2]; int main() { cin >> n; for (int i = 0; i < n; i++) cin >> a[1 << i]; cin >> k; for (int i = 0; i < k; i++) cin >> b[i]; for (int i = 1; i < (1 << n); i++) { long long s = 0; int t = i; while (t) { s += (a[t & (-t)]); t -= t & (-t); } for (int j = 0; j < k; j++) { if (s == b[j]) { dp[i] = -1; break; } } } dp[0] = 1; for (int i = 1; i < (1 << n); i++) { if (dp[i] == -1) { dp[i] = 0; continue; } for (int j = 0; j < n; j++) { if (1 & (i >> j)) { dp[i] += dp[i ^ (1 << j)]; } } if (dp[i] >= 1000000007ll) dp[i] %= 1000000007ll; } cout << dp[(1 << n) - 1] << endl; }
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( O3 ) #pragma GCC optimize( no-stack-protector ) #pragma GCC optimize( unroll-loops ) #pragma GCC optimize( fast-math ) #pragma GCC target( sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native ) mt19937 rng(time(NULL)); const int inf = 1e9 + 100; const long long linf = 2e18; const long long maxn = 2e5 + 100; const int mod = 1e9 + 7; vector<int> g[maxn]; int c[maxn]; bool f = 1; void dfs(int v, int cl) { c[v] = cl; for (int i : g[v]) { if (c[i] == 0) dfs(i, cl == 1 ? 2 : 1); else if (c[i] == cl) f = 0; } } int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n, m; cin >> n >> m; vector<pair<int, int> > ans(m); for (int i = 0; i < m; ++i) { cin >> ans[i].first >> ans[i].second; g[ans[i].first - 1].push_back(ans[i].second - 1); g[ans[i].second - 1].push_back(ans[i].first - 1); } for (int i = 0; i < n; ++i) if (!c[i]) dfs(i, 1); if (f) { cout << YES n ; for (auto i : ans) { if (c[i.first - 1] == 2) cout << 1; else cout << 0; } } else cout << NO ; return 0; }
#include <bits/stdc++.h> using namespace std; void wldd() { long long n, a, b; cin >> n >> a >> b; b = b % n; long long sum = 0; if (b < 0) { sum = n + a + b; } else { sum = a + b; } if (sum % n == 0) cout << n << n ; else cout << abs(sum % n) << n ; } int32_t main() { wldd(); return 0; }
#include <bits/stdc++.h> using namespace std; int sgn(double x) { return (x > 1e-8) - (x < -1e-8); } int count_bit(int x) { return x == 0 ? 0 : count_bit(x >> 1) + (x & 1); } template <class T> inline void to_min(T &a, const T b) { if (b < a) a = b; } template <class T> inline void to_max(T &a, const T b) { if (b > a) a = b; } const int maxn = 200000 + 10; int n, a[3], w[maxn]; bool used[maxn]; int rearray(int n) { int newn = 0; for (int i = 0; i < (n); ++i) { if (!used[i]) { w[newn++] = w[i]; } } return newn; } int solve() { int r = a[2] + a[1] + a[0]; if (r < w[n - 1]) { return -1; } int ret = 0; int l = a[2] + a[1]; while (n >= 0 && w[n - 1] > l) { ++ret; --n; } r = l; l = a[2] + a[0]; memset(used, 0, sizeof(used)); int max_idx = upper_bound(w, w + n, a[0]) - w - 1; while (n >= 0 && w[n - 1] > l) { ++ret; --n; if (max_idx >= 0) { used[max_idx--] = true; } } n = rearray(n); r = l; l = max(a[2], a[1] + a[0]); memset(used, 0, sizeof(used)); max_idx = upper_bound(w, w + n, a[1]) - w - 1; while (n >= 0 && w[n - 1] > l) { ++ret; --n; if (max_idx >= 0) { used[max_idx--] = true; } } n = rearray(n); if (a[1] + a[0] > a[2]) { r = a[1] + a[0]; l = a[2]; memset(used, 0, sizeof(used)); max_idx = upper_bound(w, w + n, a[2]) - w - 1; while (n >= 0 && w[n - 1] > l) { ++ret; --n; if (max_idx >= 0) { used[max_idx--] = true; } } n = rearray(n); } memset(used, 0, sizeof(used)); int idx_3 = n - 1; int idx_2 = upper_bound(w, w + n, a[1]) - w; int idx_1 = upper_bound(w, w + n, a[1]) - w - 1; int idx_0 = 0; while (true) { while (idx_3 >= 0 && used[idx_3]) --idx_3; if (idx_3 < 0) break; used[idx_3--] = true; ++ret; if (idx_1 >= idx_0) { while (idx_1 >= idx_0 && used[idx_1]) --idx_1; if (idx_1 >= idx_0) { used[idx_1--] = true; } while (idx_0 <= idx_1 && w[idx_0] <= a[0] && used[idx_0]) ++idx_0; if (idx_0 <= idx_1 && w[idx_0] <= a[0]) { used[idx_0++] = true; } } else { if (!used[idx_2] && w[idx_2] <= a[0] + a[1]) { used[idx_2++] = true; } } } return ret; } int main() { ios::sync_with_stdio(false); cout << fixed << setprecision(8); cin >> n; for (int i = 0; i < (3); ++i) { cin >> a[i]; } sort(a, a + 3); for (int i = 0; i < (n); ++i) { cin >> w[i]; } sort(w, w + n); cout << solve() << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int n; int main() { scanf( %d , &n); printf( +------------------------+ n ); printf( | ); if (n >= 1) printf( O. ); else printf( #. ); for (int i = 2; i <= 11; i++) if ((i - 2) * 3 + 4 + 1 <= n) printf( O. ); else printf( #. ); printf( |D|) n ); printf( | ); if (n >= 2) printf( O. ); else printf( #. ); for (int i = 2; i <= 11; i++) if ((i - 2) * 3 + 4 + 2 <= n) printf( O. ); else printf( #. ); printf( |.| n ); if (n >= 3) printf( |O.......................| n ); else printf( |#.......................| n ); printf( | ); if (n >= 4) printf( O. ); else printf( #. ); for (int i = 2; i <= 11; i++) if ((i - 2) * 3 + 4 + 3 <= n) printf( O. ); else printf( #. ); printf( |.|) n ); printf( +------------------------+ n ); return 0; }
#include <bits/stdc++.h> using namespace std; template <class T> T gcd(T a, T b) { if (!b) return a; while (b ^= a ^= b ^= a %= b) ; return a; } template <class T> T max(const T& t1, const T& t2, const T& t3) { return max(max(t1, t2), t3); } template <class T> T max(const T& t1, const T& t2, const T& t3, const T& t4) { return max(max(t1, t2), max(t3, t4)); } long long fpow(long long x, long long y, long long mod = 0x7fffffffffffffffll) { long long ret = 1; while (y) { if (y & 1) ret *= x, ret %= mod; x *= x; x %= mod; y >>= 1; } return ret; } void ex_gcd(long long a, long long b, long long& x, long long& y) { if (b == 0) { x = a; y = 0; return; } ex_gcd(b, a % b, y, x); y = y - a / b * x; } long long modrev(long long x, long long mod) { long long x1, x2; ex_gcd(x, mod, x1, x2); return x1; } unsigned long long T_rand() { return (unsigned long long)(rand()); } unsigned long long Rand() { return (T_rand() << 48) | (T_rand() << 32) | (T_rand() << 16) | T_rand(); } template <class T> bool PRE_INPUT_INTENGER(T& ret) { ; ret = 0; char c = getchar(); if (c == -1) return 0; bool f = 0; while ((c < 0 || c > 9 ) && (c != -1) && (c != - )) c = getchar(); if (c == - ) { f = 1; c = getchar(); } while (c >= 0 && c <= 9 ) ret *= 10, ret += c - 0 , c = getchar(); if (f) ret = -ret; if (c == -1) return 0; return 1; } bool input(int& ret) { return PRE_INPUT_INTENGER(ret); } bool input(long long& ret) { return PRE_INPUT_INTENGER(ret); } bool input(unsigned long long& ret) { return PRE_INPUT_INTENGER(ret); } bool input(unsigned int& ret) { return PRE_INPUT_INTENGER(ret); } template <class T> bool PRE_INPUT_DOUBLE(T& ret) { ; ret = 0; char c = getchar(); if (c == -1) return 0; bool f = 0; while ((c < 0 || c > 9 ) && (c != -1) && (c != . ) && (c != - )) c = getchar(); bool isright = 0; if (c == - ) { f = 1; c = getchar(); } T t = 1; while ((c >= 0 && c <= 9 ) || (c == . )) { if (c == . ) isright = 1; else { ret *= 10, ret += c - 0 ; if (isright) t *= 10; } c = getchar(); } ret /= t; if (f) ret = -ret; if (c == -1) return 0; return 1; } bool input(double& ret) { return PRE_INPUT_DOUBLE(ret); } bool input(float& ret) { return PRE_INPUT_DOUBLE(ret); } bool IS_SPECIAL_CHAR(const char& ret) { return (ret == || ret == n || ret == t || ret == r || ret == v ); } bool input(char& ret) { ; ret = getchar(); if (ret == -1) return 0; while (IS_SPECIAL_CHAR(ret)) ret = getchar(); return ~ret; } bool input(char* ret) { ; char c; if (!input(c)) return 0; *ret++ = c; while (!IS_SPECIAL_CHAR(*(ret - 1))) *ret++ = getchar(); *(ret - 1) = 0; return 1; } template <class T1, class T2> bool input(T1& t1, T2& t2) { return input(t1) && input(t2); } template <class T1, class T2, class T3> bool input(T1& t1, T2& t2, T3& t3) { return input(t1) && input(t2) && input(t3); } template <class T1, class T2, class T3, class T4> bool input(T1& t1, T2& t2, T3& t3, T4& t4) { return input(t1) && input(t2) && input(t3) && input(t4); } template <class T1, class T2, class T3, class T4, class T5> bool input(T1& t1, T2& t2, T3& t3, T4& t4, T5& t5) { return input(t1) && input(t2) && input(t3) && input(t4) && input(t5); } template <class T> void input(T* a, int n) { for (int i = 0; i <= n - 1; i++) input(a[i]); } template <class T> void PRE_OUTPUT_INTENGER(const T& t) { ; if (!t) { putchar( 0 ); return; } T key = t; int tt[25]; if (key < 0) { putchar( - ); key = -key; } int cnt = 0; while (key) tt[cnt++] = key % 10, key /= 10; while (cnt) putchar(tt[--cnt] + 0 ); ; } void output(const int& t) { PRE_OUTPUT_INTENGER(t); } void output(const long long& t) { PRE_OUTPUT_INTENGER(t); } void output(const unsigned long long& t) { PRE_OUTPUT_INTENGER(t); } void output(const unsigned int& t) { PRE_OUTPUT_INTENGER(t); } template <class T> void PRE_OUTPUT_DOUBLE(const T& key) { ; printf( %.*f , 6, key); ; } void output(const double& t) { PRE_OUTPUT_DOUBLE(t); } void output(const float& t) { PRE_OUTPUT_DOUBLE(t); } void output(const char* ch) { ; int cnt = 0; while (ch[cnt]) putchar(ch[cnt++]); ; } void output(const char& c) { ; putchar(c); ; } void output(const string& s) { output(s.c_str()); } template <class T1, class T2> void output(const T1& t1, const T2& t2) { output(t1); output(t2); } template <class T1, class T2, class T3> void output(const T1& t1, const T2& t2, const T3& t3) { output(t1); output(t2); output(t3); } template <class T1, class T2, class T3, class T4> void output(const T1& t1, const T2& t2, const T3& t3, const T4& t4) { output(t1); output(t2); output(t3); output(t4); } template <class T1, class T2, class T3, class T4, class T5> void output(const T1& t1, const T2& t2, const T3& t3, const T4& t4, const T5& t5) { output(t1); output(t2); output(t3); output(t4); output(t5); } template <class T1, class T2, class T3, class T4, class T5, class T6> void output(const T1& t1, const T2& t2, const T3& t3, const T4& t4, const T5& t5, const T6& t6) { output(t1); output(t2); output(t3); output(t4); output(t5); output(t6); } template <class T1, class T2, class T3, class T4, class T5, class T6, class T7> void output(const T1& t1, const T2& t2, const T3& t3, const T4& t4, const T5& t5, const T6& t6, const T7& t7) { output(t1); output(t2); output(t3); output(t4); output(t5); output(t6); output(t7); } template <class T> void printal(T* a, int n) { for (int i = 0; i < n - 1; i++) output(a[i], ); output(a[n - 1], n ); } template <class T> void printel(T* a, int n) { for (int i = 0; i < n; i++) output(a[i], n ); } template <class T> void inputal(T* a, int n) { for (int i = 0; i <= n - 1; i++) input(a[i]); } const int maxn = 1e5 + 10; struct Node { string s; int cnt; char last; bool operator<(const Node& t) const { if (cnt < t.cnt) return true; if (last < t.last) return true; return false; } bool operator==(const Node& t) const { return cnt == t.cnt && last == t.last; } }; Node node[maxn]; const char* vowel = aeiou ; bool is_vowel(char c) { switch (c) { case a : case e : case i : case o : case u : return true; default: return false; } } map<int, map<char, vector<int>>> mp; int ans[4 * maxn]; int main() { int n; input(n); for (int i = 0; i <= n - 1; i++) { cin >> node[i].s; node[i].cnt = 0; for (const char& c : node[i].s) { if (is_vowel(c)) { ++node[i].cnt; node[i].last = c; } } if (mp.count(node[i].cnt) == 0) { mp[node[i].cnt] = map<char, vector<int>>(); } if (mp[node[i].cnt].count(node[i].last) == 0) { mp[node[i].cnt][node[i].last] = vector<int>(); } mp[node[i].cnt][node[i].last].push_back(i); } vector<pair<int, int>> has_same; map<int, vector<int>> single; for (const pair<int, map<char, vector<int>>>& t : mp) { for (const pair<char, vector<int>>& t2 : t.second) { for (int i = 0; i < t2.second.size(); i += 2) { if (i == t2.second.size() - 1) { if (single.count(t.first) == 0) { single[t.first] = vector<int>(); } single[t.first].push_back(t2.second[i]); } else { has_same.push_back(make_pair(t2.second[i], t2.second[i + 1])); } } } } int cnt = 0; int last_double_idx = 0; for (const pair<int, vector<int>>& t : single) { int last_single_idx = 0; if (last_double_idx == has_same.size()) break; while (t.second.size() - last_single_idx > 1) { if (last_double_idx == has_same.size()) break; pair<int, int>& cur = has_same[last_double_idx++]; ans[cnt++] = t.second[last_single_idx++]; ans[cnt++] = cur.first; ans[cnt++] = t.second[last_single_idx++]; ans[cnt++] = cur.second; } } while (last_double_idx + 1 < has_same.size()) { ans[cnt++] = has_same[last_double_idx].first; ans[cnt++] = has_same[last_double_idx + 1].first; ans[cnt++] = has_same[last_double_idx].second; ans[cnt++] = has_same[last_double_idx + 1].second; last_double_idx += 2; } output(cnt / 4); putchar( n ); for (int i = 0; i < cnt; i += 2) { output(node[ans[i]].s, , node[ans[i + 1]].s); putchar( n ); } }
#include <bits/stdc++.h> using namespace std; int main() { int n, m, x, y; int a[1005], b[1005], c[1005], d[1005]; cin >> n >> m >> x >> y; for (int i = 1; i <= m; i++) { cin >> a[i] >> b[i] >> c[i] >> d[i]; } int dp[1005][11]; int temp, i, j, k, t; for (int i = 0; i <= n; i++) { dp[i][0] = 0; } for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) { temp = -1; t = a[j] / b[j]; for (k = 0; k <= t; k++) if (k * c[j] <= i) { temp = max(temp, dp[i - k * c[j]][j - 1] + k * d[j]); } dp[i][j] = temp; } } int Max = -1; for (int l = 0; l <= n; l++) { Max = max(Max, dp[l][m] + ((n - l) / x) * y); } cout << Max << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { long long int a, b, ans = 0; cin >> a >> b; ans = min(a, b); ans = min(ans, (a + b) / 3); cout << ans << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; struct node { long long x; int c; friend bool operator<(node x, node y) { return x.x < y.x; } } a[400001]; long long leftdata[400001], rightdata[400001]; int n; long long ans; long long max1, max2, l1, r1, ttt; void work1() { long long tans; l1 = 0; for (int i = 1; i <= n; ++i) if (a[i].c == 0) { tans = ans; if (l1 != 0) ans += a[i].x - l1; l1 = a[i].x; } l1 = 0; for (int i = 1; i <= n; ++i) if (a[i].c == 1) { tans = ans; if (l1 != 0) ans += a[i].x - l1; l1 = a[i].x; } cout << ans << endl; } void work2() { long long tans; long long f1 = 0, f2 = 0; int sum = 0; for (int i = 1; i <= n; ++i) { if (a[i].c == 2) { max2 = max(a[i].x - r1, max2); max1 = max(a[i].x - l1, max1); sum++; if (sum == 1) { tans = ans; if (f1 != 0) ans = ans + a[i].x - f1; if (f2 != 0) ans = ans + a[i].x - f2; } else { long long t1 = a[i].x + a[i].x - ttt - ttt; long long t2 = (a[i].x + a[i].x - ttt - ttt) - max1 + (a[i].x - ttt) - max2; long long yzc = min(t1, t2); ans = ans + yzc; } l1 = r1 = ttt = a[i].x; max1 = 0; max2 = 0; } else if (a[i].c == 0) { if (f1 == 0) f1 = a[i].x; if (max1 < a[i].x - l1) max1 = a[i].x - l1; l1 = a[i].x; } else { if (f2 == 0) f2 = a[i].x; if (max2 < a[i].x - r1) max2 = a[i].x - r1; r1 = a[i].x; } } f1 = 0; f2 = 0; for (int i = n; i >= 1; --i) { if (a[i].c == 2) { tans = ans; if (f1 != 0) ans = ans + f1 - a[i].x; if (f2 != 0) ans = ans + f2 - a[i].x; break; } else if (a[i].c == 0) { if (f1 == 0) f1 = a[i].x; } else { tans = ans; if (f2 == 0) f2 = a[i].x; } } cout << ans << endl; } int main() { scanf( %d , &n); char tmp[123]; int sumx = 0; for (int i = 1; i <= n; ++i) { long long x; scanf( %lld , &x); scanf( %s , tmp); a[i].x = x; if (tmp[0] == R ) a[i].c = 0; else if (tmp[0] == B ) a[i].c = 1; else a[i].c = 2, sumx++; } sort(a + 1, a + n + 1); ans = max1 = max2 = l1 = r1 = ttt = 0; if (sumx == 0) work1(); else work2(); return 0; }
#include <bits/stdc++.h> using namespace std; int n, d, h; vector<pair<int, int> > ans; int main() { ios::sync_with_stdio(0); cin >> n >> d >> h; if (2 * h < d || (d == 1 && n > 2)) { cout << -1 << n ; return 0; } for (int i = 2; i <= h + 1; i++) ans.push_back(make_pair(i - 1, i)); int idx = 1; bool done = false; for (int i = h + 2; i <= d + 1; i++) { ans.push_back(make_pair(idx, i)); done = true; idx = i; } if (done) idx = 1; else idx = 2; for (int i = d + 2; i <= n; i++) ans.push_back(make_pair(idx, i)); for (int i = 0; i < ans.size(); i++) cout << ans[i].first << << ans[i].second << n ; return 0; }