malteklaes/cpp-code-code_search_net-style · Datasets at Hugging Face

func_code_string stringlengths 59 71.4k
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c = 0; cin >> a >> b; int x[10] = {6, 2, 5, 5, 4, 5, 6, 3, 7, 6}; for (int i = a; i <= b; i++) { int y = i; while (y != 0) { c += x[y % 10]; y = y / 10; } } cout << c; return 0; }
#include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; using pll = pair<ll, ll>; using ld = long double; const int MN = 2e5 + 3, MOD = 1e9 + 7; void solve() { int n, a, b; scanf( %d %d %d , &n, &a, &b); if (a > b) swap(a, b); printf( %d %d n , min(n, max(1, a + b + 1 - n)), min(n, a + b - 1)); } int main() { int t; scanf( %d , &t); while (t--) solve(); return 0; }
#include <bits/stdc++.h> using namespace std; int dx[] = {1, 0, -1, 0}; int dy[] = {0, 1, 0, -1}; const int N = (int)2e5 + 7; const int MOD = (int)1e9 + 7; const int INF = (int)2e7; const long long BIG = 1e18; int a[N], b[N], c[N], d[N]; int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); ; int n, ans = 0; cin >> n; unordered_map<int, int> cnt; for (int i = 0; i < n; i++) cin >> a[i], cnt[a[i]]++; set<pair<int, int> > q; for (auto x : cnt) q.insert(make_pair(x.second, x.first)); while (int(q.size()) >= 3) { vector<pair<int, int> > del; auto it = q.end(); --it; b[ans] = it->second; del.push_back(it); --it; c[ans] = it->second; del.push_back(it); --it; d[ans] = it->second; del.push_back(*it); ++ans; for (auto x : del) { pair<int, int> w = x; q.erase(w); if (w.first != 1) q.insert(make_pair(w.first - 1, w.second)); } } cout << ans << n ; for (int i = 0; i < ans; i++) { vector<int> p = {b[i], c[i], d[i]}; sort(p.begin(), p.end()); cout << p[2] << << p[1] << << p[0] << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 151; int m, n; char gd[N][N]; inline int fab(int x) { return x > 0 ? x : -x; } int main() { while (scanf( %d%d , &m, &n) != -1) { for (int i = 0; i < m; i++) scanf( %s , gd[i]); int ans = 0, x = 0, y = 0; for (int i = 0; i < m; i++) for (int j = (i & 1 ? n - 1 : 0); 0 <= j && j < n; j += (i & 1 ? -1 : 1)) if (gd[i][j] == W ) { ans += fab(i - x) + fab(j - y); x = i; y = j; } printf( %d n , ans); } return 0; }
#include <bits/stdc++.h> using namespace std; long long g, r; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long n, m; cin >> n >> m; vector<int> d; for (int i = 0; i < m; i++) { long long dt; cin >> dt; d.push_back(dt); } sort(d.begin(), d.end()); cin >> g >> r; vector<vector<bool>> vis(m, vector<bool>(g + 1)); vector<vector<int>> dis(m, vector<int>(g + 1, 0)); deque<tuple<int, int>> dq; dq.push_back(make_tuple(0, 0)); long long ans = 1e9; vis[0][0] = 1; while (!dq.empty()) { int i, t; tie(i, t) = dq.front(); dq.pop_front(); if (t == 0) { int ttn = n - d[i]; if (ttn <= g) { ans = min(ans, dis[i][t] * (r + g) + ttn); } } if (t == g) { if (!vis[i][0]) { dq.push_back(make_tuple(i, 0)); dis[i][0] = dis[i][t] + 1; vis[i][0] = 1; } continue; } if (i) { int rs = t + d[i] - d[i - 1]; if (rs <= g && !vis[i - 1][rs]) { dis[i - 1][rs] = dis[i][t]; dq.push_front(make_tuple(i - 1, rs)); vis[i - 1][rs] = 1; } } if (i < m - 1) { int rs = t + d[i + 1] - d[i]; if (rs <= g && !vis[i + 1][rs]) { dis[i + 1][rs] = dis[i][t]; dq.push_front(make_tuple(i + 1, rs)); vis[i + 1][rs] = 1; } } } if (ans == 1e9) { cout << -1 << n ; } else { cout << ans << n ; } }
#include <bits/stdc++.h> using namespace std; void no(int ex = -1) { cout << ex << n ; } void win(bool bl) { if (bl) cout << YES ; else cout << NO ; cout << n ; } const int N = 2 * 100000; const int mod = 998244353; double T, n, m, k, p, res, pr; bool bw; string str; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> T; while (T--) { cin >> n; cin >> pr; bw = false; for (int i = 1; i < n; i++) { cin >> k; if (abs(k - pr) >= 2) { bw = true; p = i; } pr = k; } if (bw) cout << YES << n << p << << p + 1 << n ; else cout << NO << n ; } }
#include <bits/stdc++.h> using namespace std; const int M = 1000000007; const int MM = 998244353; const long double PI = acos(-1); long long power(long long b, long long e, long long m) { if (e == 0) return 1; if (e & 1) return b * power(b * b % m, e / 2, m) % m; return power(b * b % m, e / 2, m); } long long power(long long b, long long e) { if (e == 0) return 1; if (e & 1) return b * power(b * b, e / 2); return power(b * b, e / 2); } template <typename T, typename U> static inline void amin(T &x, U y) { if (y < x) x = y; } template <typename T, typename U> static inline void amax(T &x, U y) { if (x < y) x = y; } template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &p) { return os << ( << p.first << , << p.second << ) ; } template <typename T> struct fenwick { vector<T> bit; int n; void build(int n_) { n = n_; bit.resize(n + 1); for (int i = 1; i <= n; ++i) bit[i] = T(0); } void update(int pos, T val) { for (; pos <= n; pos += pos & -pos) bit[pos] = (bit[pos] + val) % M; } T get(int r) { T x{}; for (; r; r -= r & -r) x = (x + bit[r]) % M; return x; } T query(int l, int r) { return (get(r) - get(l - 1) + M) % M; } }; fenwick<long long> fenw1, fenw2; const int N = 5e5 + 5; int b[N]; long long a[N]; int _runtimeTerror_() { int n; cin >> n; for (int i = 1; i <= n; ++i) cin >> a[i], b[i] = i; sort(b + 1, b + 1 + n, [&](int x, int y) { return a[x] < a[y]; }); long long ans = 0; fenw1.build(n); fenw2.build(n); for (int i = 1; i <= n; ++i) { fenw1.update(b[i], b[i]); fenw2.update(b[i], n - b[i] + 1); long long u = 1LL * (fenw1.get(b[i])) * (n - b[i] + 1) % M; u += 1LL * b[i] * (fenw2.query(b[i] + 1, n)) % M; u %= M; ans += a[b[i]] * 1LL * u % M; ans %= M; } cout << ans << n ; return 0; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int TESTS = 1; while (TESTS--) _runtimeTerror_(); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; const int M = 1e9 + 7; const int INF = 2e9 + 5; const int rx[8] = {-1, 0, 1, 0, 1, 1, -1, -1}; const int ry[8] = {0, -1, 0, 1, 1, -1, 1, -1}; mt19937 gen(chrono::high_resolution_clock::now().time_since_epoch().count()); int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector<pair<long long, long long> > a(n); long long sumx = 0; long long sumy = 0; for (int i = 0; i < n; i++) { cin >> a[i].first >> a[i].second; sumx += a[i].first; sumy += a[i].second; } long long res = 0; for (int i = 0; i < n; i++) { res += (n - 1) * a[i].first * a[i].first - a[i].first * (sumx - a[i].first); res += (n - 1) * a[i].second * a[i].second - a[i].second * (sumy - a[i].second); } cout << res; return 0; }
#include <bits/stdc++.h> using namespace std; vector<vector<int>> g; vector<int> a; int n; vector<map<int, int>> dp; int ans = 0; int gcd(int a, int b) { while (b) { a %= b; swap(a, b); } return a; } void dfs(int v, int p = -1) { for (auto to : g[v]) { if (to != p) { dfs(to, v); if (gcd(a[v], a[to]) != 1) { for (auto i : dp[to]) { int y = gcd(a[v], i.first); if (y != 1) { for (auto c : dp[v]) if (gcd(c.first, i.first) != 1) ans = max(ans, i.second + c.second); } } for (auto i : dp[to]) { int y = gcd(a[v], i.first); if (y != 1) { dp[v][y] = max(dp[v][y], i.second + 1); ans = max(ans, i.second + 1); } } } } } } signed main() { std::ios_base::sync_with_stdio(0), cin.tie(0); cin >> n; g.resize(n); a.resize(n); for (int i = 0; i < n; ++i) { cin >> a[i]; } dp.resize(n); for (int i = 0; i < n - 1; ++i) { int x, y; cin >> x >> y; x--, y--; g[x].push_back(y); g[y].push_back(x); } for (int i = 0; i < n; ++i) { if (a[i] != 1) { ans = 1; dp[i][a[i]] = 1; } } if (!ans) { cout << 0; return 0; } dfs(0); cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1000010; const int md = 1e9 + 7; int mul(int a, int b) { return (long long)a * b % md; } char s[N]; int n, m, nn, x[N], z[N]; bool start[N]; int main() { scanf( %d %d %s , &n, &m, s); nn = strlen(s); for (int i = 0; i < m; i++) { scanf( %d , &x[i]); x[i]--; start[x[i]] = true; } for (int i = 1, l = -1, r = -1; i < nn; i++) { int &k = z[i]; if (i < r) { k = min(r - i, z[i - l]); } for (; i + k < nn && s[k] == s[i + k]; k++) ; if (i + k > r) { l = i; r = i + k; } } for (int i = 0; i < m - 1; i++) { int p = x[i + 1] - x[i]; if (p + z[p] < nn) { puts( 0 ); return 0; } } int ans = 1; int r = -1; for (int i = 0; i < n; i++) { if (start[i]) { r = i + nn; } if (i >= r) { ans = mul(ans, 26); } } printf( %d n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; void solve() { long long int s; cin >> s; long long int tot = 0; while (s >= 10) { tot += s / 10 * 10; s = s / 10 + s % 10; } cout << tot + s << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t = 1; cin >> t; while (t--) { solve(); } }
#include <bits/stdc++.h> using namespace std; const long long MOD = 998244353; const long long EPS = 1e-9; long long mpow(long long a, long long b, long long p = MOD) { a = a % p; long long res = 1; while (b > 0) { if (b & 1) res = (res * a) % p; a = (a * a) % p; b = b >> 1; } return res % p; } const long long N = 1e6 + 5; long long dp[N]; long long fac[N]; long long ncm(long long n, long long m) { if (m > n) return 0; long long ans = fac[n]; ans = (ans * mpow(fac[m], MOD - 2)) % MOD; ans = (ans * mpow(fac[n - m], MOD - 2)) % MOD; return ans; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); fac[0] = 1; for (long long i = 1; i < N; i++) { fac[i] = (i * fac[i - 1]) % MOD; } long long n; cin >> n; long long a[n]; for (long long i = 0; i < n; i++) cin >> a[i]; dp[n] = 1; long long ans = 0; for (long long i = n - 1; i >= 0; i--) { dp[i] = dp[i + 1]; if (a[i] <= 0) continue; for (long long j = i + 1; j < n; j++) { if (j - i < a[i]) continue; long long rem = a[i] - 1; long long oo = j - i - 1; long long c = ncm(oo, rem) * dp[j + 1]; ans += c; ans %= MOD; dp[i] += c; dp[i] %= MOD; } } cout << ans; }
#include <bits/stdc++.h> using namespace std; template <class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } template <class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } const long long MOD = (long long)(1e9) + 7; long long getVal(pair<pair<int, int>, long long> p) { return (p.second * (p.first.second - p.first.first + 1)) % MOD; } void pr(stack<pair<pair<int, int>, long long>> st) { cout << st.top().first.first << << st.top().first.second << << st.top().second << n ; st.pop(); if (!st.empty()) pr(st); } int main() { ios::sync_with_stdio(0); cin.tie(0); string second; cin >> second; vector<int> v; int cur = 0; for (int i = 0; i < (int)second.size(); i++) { if (second[i] == 1 ) { v.push_back(cur); cur = 0; } else { cur++; } } if ((int)v.size() == 0) { return cout << (int)second.size() << n , 0; ; } long long factor = ((long long)(v[0] + 1) * (cur + 1)) % MOD; v.erase(v.begin()); stack<pair<pair<int, int>, long long>> st; long long cursum = 0; for (int i = 0; i < (int)v.size(); i++) { long long ori = cursum; while (!st.empty()) { if (v[i] >= st.top().first.first) { cursum -= getVal(st.top()); cursum %= MOD; cursum += MOD; cursum %= MOD; if (v[i] < st.top().first.second) { st.top().first.first = v[i] + 1; cursum += getVal(st.top()); cursum %= MOD; break; } else { st.pop(); } } else { break; } } st.push(make_pair(make_pair(0, v[i]), (ori + 1) % MOD)); cursum += getVal(st.top()); cursum %= MOD; } cursum++; cursum %= MOD; long long res = (factor * cursum) % MOD; return cout << res << n , 0; ; }
#include <bits/stdc++.h> using namespace std; long long M = 1e15 + 37; const long long N = 1000 + 10; const long long IM = 1e18; const long long PI = 3.14159265; void PV(vector<long long> v) { for (long long i = 0; i < v.size(); i++) cout << v[i] << ; cout << n ; } void PA(long long v[], long long n, long long x = 0) { for (long long i = x; i < n + x; i++) cout << v[i] << ; cout << n ; } void IN(long long a[], long long n, long long x = 0) { for (long long i = x; i < n + x; i++) cin >> a[i]; } inline void PTN(long long n = 1, long long a = 0, long long b = 0, long long c = 0) { if (n--) cout << a << ; if (n--) cout << b << ; if (n--) cout << c << ; cout << n ; } inline void op() {} signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); op(); long long i, j, x, y, u, l; long long tt = 1; { i = j = x = y = u = l = 0; string s; cin >> s; l = s.size(); for (i = 0; i < l; i++) { char c; if (i && s[i] == s[i - 1]) { for (c = a ; c <= z ; c++) { if (c != s[i]) { if (i < l) { if (c != s[i + 1]) { s[i] = c; break; } } } } } } cout << s << n ; } return 0; }
#include <bits/stdc++.h> int dp[1000 + 1][3]; int v[1000 + 1]; inline int getmin(int a, int b) { if (a < b) return a; return b; } int main() { int n, i; scanf( %d , &n); for (i = 1; i <= n; i++) scanf( %d , &v[i]); dp[1][0] = 1; if (v[1] % 2 == 1) dp[1][1] = 0; else dp[1][1] = n; if (v[1] >= 2) dp[1][2] = 0; else dp[1][2] = n; for (i = 2; i <= n; i++) { dp[i][0] = getmin(dp[i - 1][0], getmin(dp[i - 1][1], dp[i - 1][2])) + 1; if (v[i] % 2 == 1) dp[i][1] = getmin(dp[i - 1][0], dp[i - 1][2]); else dp[i][1] = n; if (v[i] >= 2) dp[i][2] = getmin(dp[i - 1][0], dp[i - 1][1]); else dp[i][2] = n; } printf( %d , getmin(dp[n][0], getmin(dp[n][1], dp[n][2]))); return 0; }
#include <bits/stdc++.h> using namespace std; template <typename T, typename U> static inline void amn(T &x, U y) { if (y < x) x = y; } template <typename T, typename U> static inline void amx(T &x, U y) { if (x < y) x = y; } const long long MOD = 1e9 + 7; const long long INF = 1e18; const long long N = 5e5 + 5; long long top(long long x, long long y) { long long f = x / y; if (x % y) f++; return f; } bool cmp(pair<long long, long long> &a, pair<long long, long long> &b) { return a.first < b.first; } void solve() { long long n, m, x; cin >> n >> m >> x; vector<pair<long long, long long> > v; for (long long i = 1; i <= n; i++) { v.push_back({0, i}); } long long sa = top(n, m), sb = n / m; long long A = (n % m) * sa; for (long long i = 1; i <= x; i++) { for (long long j = 0; j < A; j++) { v[j].first++; } for (long long j = 0; j < A; j += sa) { cout << sa; for (long long k = j; k < j + sa; k++) { cout << << v[k].second; } cout << endl; } for (long long j = A; j < n; j += sb) { cout << sb; for (long long k = j; k < j + sb; k++) { cout << << v[k].second; } cout << endl; } sort(v.begin(), v.end(), cmp); } cout << endl; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long test_case = 1; cin >> test_case; while (test_case--) { solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; int binarySearch(int a[], int l, int r, int x); int main() { int n, m, i, temp; vector<int> v1; vector<int> v2; scanf( %d %d , &n, &m); for (i = 0; i < n; i++) { scanf( %d , &temp); v1.push_back(temp); } for (i = 0; i < m; i++) { scanf( %d , &temp); v2.push_back(temp); } for (i = 0; i < n; i++) { if (find(v2.begin(), v2.end(), v1[i]) != v2.end()) { printf( %d , v1[i]); } } printf( n ); return 0; }
#include <bits/stdc++.h> using namespace std; const int MAX = 2e4 + 3; const long long MOD = 998244353; int a[MAX]; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, k; cin >> n >> k; int s = 2 * n, mid = n, one = 0, left = 0; for (int i = 1; i <= k; i++) { cin >> a[i]; if (a[i] % 2) { a[i]--; left++; } } for (int i = 1; i <= k; i++) { if (a[i] >= 4) { int need = a[i] / 4; if (mid <= need) { a[i] -= mid * 4; mid = 0; } else { a[i] %= 4; mid -= need; } } } if (mid == 0) { for (int i = 1; i <= k; i++) s -= a[i] / 2; s -= left; if (s >= 0) cout << YES ; else cout << NO ; return 0; } for (int i = 1; i <= k; i++) { if (a[i] == 2) { if (s) { s--; continue; } if (mid) { mid--; left--; continue; } left += 2; } } if (s + mid * 2 >= left) cout << YES ; else cout << NO ; }
#include <bits/stdc++.h> using namespace std; int main() { int n, a[200005]; scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d , &a[i]); int s, t, m = 0; for (s = 0; s < n;) { t = s + 1; while (a[t] <= a[t - 1] * 2 && t < n) t++; int res = t - s; m = max(m, res); s = t; } printf( %d , m); return 0; }
#include <bits/stdc++.h> using namespace std; int cmp(string s1, string s2) { if (s1 == rock && s2 == scissors ) return 1; if (s1 == scissors && s2 == paper ) return 1; if (s1 == paper && s2 == rock ) return 1; return 0; } int main() { string s1, s2, s3; cin >> s1 >> s2 >> s3; if (cmp(s1, s2) && cmp(s1, s3)) { putchar( F ); return 0; } if (cmp(s2, s1) && cmp(s2, s3)) { putchar( M ); return 0; } if (cmp(s3, s1) && cmp(s3, s2)) { putchar( S ); return 0; } putchar( ? ); }
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 7; const long long mod = 1e9 + 7; long long mpow(long long a, long long b) { long long res = 1; while (b) { if (b % 2 == 1) { res = res * a; } b = b / 2; a = a * a; } return res; } long long pow1(long long a, long long b) { long long res = 1; while (b) { if (b % 2 == 1) res = res * a % mod; b = b / 2; a = a * a % mod; } return res; } int main() { long long k; cin >> k; long long b = 1; b = mpow(2LL, k - 1) - 1 + mpow(2, k) - 1 - (mpow(2, k - 1)); long long ans = pow1(4, b); ans = ans * 6 % mod; cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; template <class T> long long ToInt(const T &x) { stringstream s; s << x; long long r; s >> r; return r; } template <class T> string ToString(const T &x) { stringstream s; s << x; return s.str(); } int main() { string str, str2; cin >> str; if (str.length() == 1) return cout << 1 << endl, 0; long long N = str[0] - 0 ; N++; for (int i = 1; i < str.length(); i++) str2 += 0 ; string temp = ToString(N); str2 = temp + str2; printf( %lld n , ToInt(str2) - ToInt(str)); }
#include <bits/stdc++.h> using namespace std; int a, b, c, d, e, f, g, h, i, j, k; int father[100005][20]; vector<int> tree[100005]; int deep[100005]; int que[100005], num[100005]; int K; int an; void soso(int x) { int ii, jj, kk; que[++que[0]] = x; deep[x] = deep[father[x][0]] + 1; for (ii = 0; ii < tree[x].size(); ii++) { jj = tree[x][ii]; if (jj == father[x][0]) continue; father[jj][0] = x; soso(jj); } } void Build_LCA() { int ii, jj, kk; for (jj = 1; jj <= 19; jj++) for (ii = 1; ii <= a; ii++) father[ii][jj] = father[father[ii][jj - 1]][jj - 1]; } int LCA(int x, int y) { int ii, jj, kk; if (deep[x] < deep[y]) swap(x, y); for (ii = 18; ii >= 0; ii--) if (deep[father[x][ii]] >= deep[y]) x = father[x][ii]; if (x == y) return x; for (ii = 18; ii >= 0; ii--) if (father[x][ii] != father[y][ii]) x = father[x][ii], y = father[y][ii]; return father[x][0]; } int Dis(int x, int y) { int u = LCA(x, y); return deep[x] + deep[y] - 2 * deep[u]; } int Add(set<pair<int, int> >& E, int x, int vv) { int R = 0; set<pair<int, int> >::iterator now; if (vv == 1) E.insert(make_pair(num[x], x)); now = E.find(make_pair(num[x], x)); set<pair<int, int> >::iterator now1 = now; set<pair<int, int> >::iterator pre, next; if (now != E.begin()) { pre = --now; R += Dis((pre).second, x); } now = now1; next = ++now; if (next != E.end()) { R += Dis((next).second, x); } now = now1; if (now != E.begin() && next != E.end()) R -= Dis((pre).second, (next).second); if (vv == -1) E.erase(now); return R * vv; } bool Check(int x) { int ii, jj, kk; int now = 0; set<pair<int, int> > GG; for (ii = 1; ii <= x - 1; ii++) now += Add(GG, ii, 1); for (ii = x; ii <= a; ii++) { now += Add(GG, ii, 1); set<pair<int, int> >::iterator in = GG.end(); in--; int tmp = Dis((GG.begin()).second, (in).second); if (now + tmp <= (K << 1)) return true; now += Add(GG, ii - x + 1, -1); } return false; } int main() { cin >> a >> K; K--; for (i = 1; i < a; i++) { cin >> c >> d; tree[c].push_back(d); tree[d].push_back(c); } soso(1); Build_LCA(); for (i = 1; i <= a; i++) num[que[i]] = i; int low = 1, high = a, mid; while (low <= high) { mid = (low + high) >> 1; if (Check(mid)) { an = max(an, mid); low = mid + 1; } else high = mid - 1; } cout << an << endl; return 0; }
#include <bits/stdc++.h> using namespace std; long long int a[505], b[505]; void solve() { long long int n; cin >> n; for (long long int i = 1; i <= n; i++) cin >> a[i]; for (long long int i = 1; i <= n; i++) cin >> b[i]; long long int x = (n + 1) / 2; if (n % 2 == 1 && a[x] != b[x]) { cout << No n ; return; } multiset<pair<long long int, long long int> > m; if (n % 2) { for (long long int i = 1; i < x; i++) m.insert({a[x + i], a[x - i]}); for (long long int i = 1; i < x; i++) { pair<long long int, long long int> p = {b[x + i], b[x - i]}; if (m.find(p) != m.end()) { m.erase(m.find(p)); continue; } swap(p.first, p.second); if (m.find(p) != m.end()) { m.erase(m.find(p)); continue; } cout << No n ; return; } } else { for (long long int i = 0; i < x; i++) m.insert({a[x - i], a[x + i + 1]}); for (long long int i = 0; i < x; i++) { pair<long long int, long long int> p = {b[x - i], b[x + i + 1]}; if (m.find(p) != m.end()) { m.erase(m.find(p)); continue; } swap(p.first, p.second); if (m.find(p) != m.end()) { m.erase(m.find(p)); continue; } cout << No n ; return; } } cout << Yes n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int qc; cin >> qc; for (long long int i = 1; i <= qc; i++) solve(); }
#include <bits/stdc++.h> #define ll long long #define f(n) for(ll i=0;i<n;i++) #define mod 998244353 #define vl vector<ll> #define pb push_back #define mk make_pair #define forn(i, n) for (int i = 0; i < int(n); i++) #define nl n #define IOS ios_base::sync_with_stdio(false); #include <iostream> using namespace std; void solve() { ll n; cin>>n; ll a[n]; for(ll i=0;i<n;i++) { cin>>a[i]; } sort(a,a+n); ll v=0,s=0; for(int i=2;i<n;i++) { s+=a[i-2]; v-=(a[i]*(i-1)); v+=s; } cout<<v<<endl; } void init_code() { #ifndef ONLINE_JUDGE freopen( input.txt , r , stdin); freopen( output.txt , w , stdout); #endif } int main() { init_code(); IOS cin.tie(NULL); cout.tie(NULL); ll t; cin>>t; //t=1; while(t--) { solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; using ll = long long int; typedef vector<ll> vi; typedef vector<vi> vvi; typedef pair<ll,ll> ii; typedef vector<ii> vii; typedef vector<vii> vvii; #define F first #define S second ll min(ll x, ll y){ return ((x < y) ? x : y); } ll max(ll x, ll y){ return ((x > y) ? x : y); } const ll INF = 1e18; double findavg (ll x, ll itr){ ll sum = 0; for (ll i = 0; itr > i; i++){ ll mvs = 0; ll cur = 0; while (x > cur){ ll rd = rand()%2; if (rd){ cur++; }else cur = 0; mvs++; } cout << mvs << endl; sum += mvs; } double ans = (double)sum/(double)itr; cout << x: << x << << itr: << itr << endl; cout << ans << endl; return ans; } int main(){ ll t; cin >> t; while (t--){ ll k; cin >> k; if (k%2 == 1){ cout << -1 n ; continue; } vi v; for (ll i = 1; 63 > i; i++){ ll bm = 1; bm <<= i; if (k & bm){ v.push_back(1); for (ll j = 0; i > j+1; j++){ if (j) v.push_back(0); else v.push_back(1); } } } cout << v.size() << endl; for (auto i: v) cout << i << ; cout << endl; } }
#include <bits/stdc++.h> using namespace std; int main() { long long n, a, b, c; cin >> n >> a >> b >> c; long long x = n % 4; long long y = 4 - x; if (n % 4 == 0) cout << 0 << n ; else { if (y == 1) { cout << min(min(a, b + c), 3 * c) << n ; } else if (y == 2) { cout << min(min(2 * a, 2 * c), b) << n ; } else if (y == 3) { cout << min(min(c, 3 * a), b + a) << n ; } } }
#include <bits/stdc++.h> using namespace std; struct debugger { template <typename T> debugger& operator,(const T& v) { cerr << v << ; return this; } } dbg; inline long long gcd(long long a, long long b) { a = ((a) < 0 ? -(a) : (a)); b = ((b) < 0 ? -(b) : (b)); while (b) { a = a % b; swap(a, b); } return a; } long long ext_gcd(long long A, long long B, long long X, long long* Y) { long long x2, y2, x1, y1, x, y, r2, r1, q, r; x2 = 1; y2 = 0; x1 = 0; y1 = 1; for (r2 = A, r1 = B; r1 != 0; r2 = r1, r1 = r, x2 = x1, y2 = y1, x1 = x, y1 = y) { q = r2 / r1; r = r2 % r1; x = x2 - (q * x1); y = y2 - (q * y1); } X = x2; Y = y2; return r2; } inline long long modInv(long long a, long long m) { long long x, y; ext_gcd(a, m, &x, &y); x %= m; if (x < 0) x += m; return x; } inline long long bigmod(long long a, long long p, long long m) { long long res = 1 % m, x = a % m; while (p) { if (p & 1) res = (res * x) % m; x = (x * x) % m; p >>= 1; } return res; } int dir4[4][2] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}}; const long long inf = 100000000000000LL; const long long mod = 1000000007; const double pi = 2 * acos(0.0); const double eps = 1e-11; const int Size = 300505; int N; int Map[105]; int A[105]; vector<int> POS[105]; vector<int> G1, GX, G2; vector<int> mset1, mset2; char res[105]; bool solve() { int cnt1 = 0, cntx = 0; for (long long s = (1); s <= (100); ++s) { if (Map[s] == 1) { cnt1++; G1.push_back(s); } else if (Map[s] == 2) { G2.push_back(s); } else if (Map[s] > 2) { cntx++; GX.push_back(s); } } for (long long i = (0); i <= (cnt1 / 2 - 1); ++i) { int v = G1.back(); mset1.push_back(POS[v][0]); G1.pop_back(); } for (long long i = (0); i <= (cnt1 / 2 - 1); ++i) { int v = G1.back(); mset2.push_back(POS[v][0]); G1.pop_back(); } if (cnt1 % 2 == 1) { int v = G1.back(); mset1.push_back(POS[v][0]); G1.pop_back(); if (cntx == 0) return false; int xx = GX.back(); GX.pop_back(); mset2.push_back(POS[xx][0]); for (long long i = (1); i <= (((long long)(POS[xx]).size()) - 1); ++i) { mset1.push_back(POS[xx][i]); } } for (long long i = (0); i <= (((long long)(G2).size()) - 1); ++i) { int v = G2[i]; for (long long j = (0); j <= (((long long)(POS[v]).size()) - 1); ++j) { mset1.push_back(POS[v][j]); } } for (long long i = (0); i <= (((long long)(GX).size()) - 1); ++i) { int v = GX[i]; for (long long j = (0); j <= (((long long)(POS[v]).size()) - 1); ++j) { mset1.push_back(POS[v][j]); } } for (long long i = (0); i <= (((long long)(mset1).size()) - 1); ++i) { int p = mset1[i]; res[p] = A ; } for (long long i = (0); i <= (((long long)(mset2).size()) - 1); ++i) { int p = mset2[i]; res[p] = B ; } if (((long long)(mset1).size()) + ((long long)(mset2).size()) != N) return false; res[N] = 0 ; printf( YES n ); printf( %s n , res); return true; } int main() { scanf( %d , &N); for (long long i = (0); i <= (N - 1); ++i) { scanf( %d , &A[i]); Map[A[i]]++; POS[A[i]].push_back(i); } if (!solve()) { printf( NO n ); } return 0; }
#include <bits/stdc++.h> using namespace std; long long mod = 1000000007; long long fin(long long a, long long b) { long long ans = 1; a %= mod; while (b) { if (b % 2 == 1) { ans = (ans * a) % mod; } a = (a * a) % mod; b = b / 2; } return ans; } int main() { long long x, k; cin >> x >> k; if (x == 0) cout << 0 n ; else { x %= mod; cout << (((2 * x - 1) * fin(2, k) + mod) % mod + 1 + mod) % mod << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; int main(){ ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); //freopen( input.txt , r ,stdin); //freopen( output.txt , w ,stdout); int T; cin>>T; for(int t=0;t<T;t++){ int n,k; cin>>n>>k; if(n==1&&k==1){cout<<0<<endl;continue;} if(k<=3){ if(k==2){ int m=n-1; cout<<m<<endl; cout<<1<< ; for(int i=3;i<=n;i++) cout<<i<< ; cout<<endl; }else{ if(k==1){ cout<<n-1<<endl; for(int i=2;i<=n;i++) cout<<i<< ; cout<<endl; } else{ cout<<n-2<<endl; cout<<1<< ; for(int i=4;i<=n;i++) cout<<i<< ; cout<<endl; } } }else{ if(k%2==0){ int m=n-k/2; cout<<m<<endl; for(int i=k/2;i<=n;i++) if(i!=k)cout<<i<< ; cout<<endl; }else{ int m=n-k/2-1; cout<<m<<endl; for(int i=k/2+1;i<=n;i++) if(i!=k)cout<<i<< ; cout<<endl; } } } return 0; }
#include <bits/stdc++.h> using namespace std; long long n, m, A; long long b[200005]; long long beki[200005]; long long pow(long long a, long long n) { if (n == 0) return 1; if (n % 2) { return ((a % 998244353) * (pow(a, n - 1) % 998244353)) % 998244353; } else { return pow((a * a) % 998244353, n / 2) % 998244353; } } int main(void) { cin >> n >> m >> A; for (int i = 1; i <= m; i++) cin >> b[i]; long long inv2 = pow(2, 998244353 - 2); long long ans = 1; for (int i = 1; i <= m; i++) { long long l = b[i] - b[i - 1]; long long tmp = (pow(A, 2 * l) + 998244353 - pow(A, l)) % 998244353; tmp = inv2, tmp %= 998244353; tmp += pow(A, l), tmp %= 998244353; ans = tmp, ans %= 998244353; } ans = pow(A, n - 2 b[m]), ans %= 998244353; cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; void init_code() {} long long int c[207]; bool adj[207][207]; long long int n; void dfs(long long int u, long long int cu) { if (~c[u]) { if (c[u] ^ cu) { cout << NO << n ; exit(0); } return; } c[u] = cu; for (long long int v = 0; v < n; v++) if (adj[u][v]) dfs(v, cu ^ 1); } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); init_code(); cin >> n; string str; cin >> str; for (long long int i = 0; i < n; i++) { for (long long int j = i + 1; j < n; j++) { if (str[j] < str[i]) adj[i][j] = adj[j][i] = 1; } } memset(c, -1, sizeof(c)); for (long long int i = 0; i < n; i++) { if (c[i] < 0) dfs(i, 0); } cout << YES << n ; for (long long int i = 0; i < n; i++) cout << c[i]; return 0; }
#include <bits/stdc++.h> using namespace std; template <typename A> using VE = vector<A>; template <typename A> using USET = unordered_set<A>; template <typename A> using HEAP = priority_queue<A>; template <typename A, typename B> using PA = pair<A, B>; template <typename A, typename B> using UMAP = unordered_map<A, B>; template <typename A> using RHEAP = priority_queue<A, vector<A>, greater<A> >; template <typename A> A MAX(const A &a) { return a; } template <typename A> A MIN(const A &a) { return a; } template <typename A> A MAX(const A a, const A b) { return max_element(a, b); } template <typename A> A MIN(const A a, const A b) { return min_element(a, b); } template <typename A, typename... B> A MAX(const A &a, const B &...b) { return max(a, MAX(b...)); } template <typename A, typename... B> A MIN(const A &a, const B &...b) { return min(a, MIN(b...)); } template <typename A, typename B = typename std::iterator_traits<A>::value_type> B MAX(A a, A b) { return max_element(a, b); } template <typename A, typename B = typename std::iterator_traits<A>::value_type> B MIN(A a, A b) { return min_element(a, b); } mt19937 rng( (unsigned int)chrono::steady_clock::now().time_since_epoch().count()); const int N = 100010, M = 1010; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cout << fixed << setprecision(10); int T; cin >> T; while (T--) { int n; cin >> n; int idx = 0; map<int, int> mp; vector<int> a(n); for (auto &u : a) { cin >> u; if (!mp.count(u)) mp[u] = ++idx; u = mp[u]; } int p = -1; for (int i = 0; i < n; i++) if (a[i] == a[(i + 1) % n]) { p = i; break; } vector<int> c(n); if (p == -1) { for (int i = 0, j = 1; i + 1 < n; i += 2) { c[i] = j; j = 3 - j; c[i + 1] = j; j = 3 - j; } if (c.back() == 0) { if (c[n - 2] != c[0]) c.back() = 3; else c.back() = 3 - c[0]; } } else { rotate(a.begin(), a.begin() + p + 1, a.end()); c[0] = 1; for (int i = 1; i < n; i++) if (a[i] != a[i - 1]) c[i] = 3 - c[i - 1]; else c[i] = 1; } cout << MAX(c.begin(), c.end()) << n ; int j; if (p == -1) j = 0; else j = n - p - 1; for (int i = 0; i < n; i++, j++) cout << c[j % n] << ; cout << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; int a[27], c[27], d[27]; int main() { int count, i, n, max, co, t, index, k; char str[1010], ch, b[1010]; ch = getchar(); while (ch != n ) { a[ch - a + 1]++; ch = getchar(); } count = 0; for (i = 1; i <= 26; i++) if (a[i] != 0) count++; scanf( %d , &n); if (n < count) printf( -1 n ); else if (n == count) { max = 0; for (i = 1; i <= 26; i++) if (a[i] > max) max = a[i]; printf( %d n , max); for (i = 1; i <= 26; i++) if (a[i] != 0) printf( %c , i + a - 1); printf( n ); } else { t = 0; for (i = 1; i <= 26; i++) { if (a[i] != 0) b[t++] = i + a - 1; c[i] = 1; } copy(a, a + 27, d); for (k = n - count; k > 0; k--) { max = 0; index = 0; for (i = 1; i <= 26; i++) if (d[i] > max) { max = d[i]; index = i; } c[index]++; b[t++] = index + a - 1; if (a[index] % c[index] != 0) d[index] = a[index] / c[index] + 1; else d[index] = a[index] / c[index]; } max = 0; for (i = 1; i <= 26; i++) { if (d[i] > max) max = d[i]; } printf( %d n , max); b[t] = 0; puts(b); } return 0; }
#include <bits/stdc++.h> using namespace std; const long long maxn = 2e5 + 5, mod = 1e9 + 7, inf = 1e18; long long n, m, ans[maxn], h[maxn], par[20][maxn], mx[20][maxn], pw2[20], p[maxn], sz[maxn], ip[maxn]; vector<pair<long long, long long>> v1[maxn], v2[maxn]; vector<pair<long long, pair<long long, long long>>> adj[maxn], g[maxn]; vector<pair<pair<long long, long long>, pair<long long, long long>>> vec; set<pair<long long, long long>> s[maxn]; long long get_par(long long u) { if (p[u] == 0) return u; p[u] = get_par(p[u]); return p[u]; } bool merge(long long u, long long v) { u = get_par(u); v = get_par(v); if (u == v) return 0; if (sz[u] < sz[v]) swap(u, v); p[v] = u; sz[u] += sz[v]; return 1; } void dfs(long long u) { for (long long i = 1; i < 20; i++) { long long v = par[i - 1][u]; if ((v == 0) \|\| (par[i - 1][v] == 0)) break; par[i][u] = par[i - 1][v]; mx[i][u] = max(mx[i - 1][u], mx[i - 1][v]); } for (auto j : g[u]) { long long v = j.first, w = j.second.first; if (j.first == par[0][u]) continue; ip[v] = j.second.second; mx[0][v] = w; par[0][v] = u; h[v] = h[u] + 1ll; dfs(v); } } void build_mst() { sort(vec.begin(), vec.end()); for (auto i : vec) { long long u = i.second.first, v = i.second.second, w = i.first.first; if (merge(u, v)) { g[u].push_back({v, {w, i.first.second}}); g[v].push_back({u, {w, i.first.second}}); } } dfs(1); } long long get_pr(long long v, long long d) { for (long long i = 0; i < 20; i++) { if ((pw2[i] & d) == 0) continue; v = par[i][v]; } return v; } long long get_mx(long long v, long long d) { long long MX = 0; for (long long i = 0; i < 20; i++) { if ((pw2[i] & d) == 0) continue; MX = max(MX, mx[i][v]); v = par[i][v]; } return MX; } long long get_lca(long long u, long long v) { if (h[u] > h[v]) swap(u, v); if (h[u] != h[v]) v = get_pr(v, h[v] - h[u]); if (u == v) return u; for (long long i = 19; i >= 0; i--) { if (par[i][v] == par[i][u]) continue; u = par[i][u]; v = par[i][v]; } return par[0][u]; } void DFS(long long u) { for (pair<long long, long long> i : v1[u]) s[u].insert(i); for (auto j : g[u]) { if (j.first == par[0][u]) continue; DFS(j.first); if (s[j.first].size() == 0) continue; if (s[j.first].size() > s[u].size()) s[u].swap(s[j.first]); for (auto j2 : s[j.first]) s[u].insert(j2); s[j.first].clear(); } for (pair<long long, long long> i : v2[u]) s[u].erase(i); if (u == 1) return; if (s[u].size() == 0) { ans[ip[u]] = -1; return; } ans[ip[u]] = (s[u].begin()).first - 1ll; } int main() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); pw2[0] = 1; for (long long i = 1; i < 20; i++) pw2[i] = (pw2[i - 1] 2ll); cin >> n >> m; for (long long i = 0; i < m; i++) { long long u, v, w; cin >> u >> v >> w; adj[u].push_back({v, {w, i}}); adj[v].push_back({u, {w, i}}); vec.push_back({{w, i}, {u, v}}); } build_mst(); for (auto j : vec) { long long u = j.second.first, v = j.second.second, w = j.first.first, i = j.first.second; if (h[u] > h[v]) swap(u, v); if (par[0][v] == u) continue; long long lca = get_lca(u, v); v1[u].push_back({w, v}); v1[v].push_back({w, u}); v2[lca].push_back({w, v}); v2[lca].push_back({w, u}); ans[i] = max(get_mx(u, h[u] - h[lca]), get_mx(v, h[v] - h[lca])) - 1; } DFS(1); for (long long i = 0; i < m; i++) cout << ans[i] << ; }
#include <bits/stdc++.h> using namespace std; int main() { int n, v; cin >> n; for (int i = 0; i < n; i++) { cin >> v; if (v == 1) { cout << -1; return 0; } } cout << 1; }
#include <bits/stdc++.h> using namespace std; int main() { cout << INTERCAL << endl; }
#include <bits/stdc++.h> using namespace std; int main() { set<int> s; int n; cin >> n; for (int i = 0; i < n; i++) { int x; cin >> x; s.insert(x); } set<int>::iterator it, it1, it2; it = s.begin(); it1 = it; it1++; it2 = s.end(); it2--; if (s.size() == 1) cout << 0 << endl; else if (s.size() == 2) { int e = it1 - (it); if (e % 2 == 0) e /= 2; cout << e; } else if (s.size() == 3) { int a = (it); int b = (it1); int c = (*it2); if (b - a == c - b) cout << b - a << endl; else cout << -1 << endl; } else cout << -1 << endl; }
#include <bits/stdc++.h> using namespace std; const int N = 2000010; int n, ans, q[N], x[N], y[N]; struct node { int a, b, m, id; }; vector<node> a[N]; bool cmp(node x, node y) { return x.a < y.a; } void Work() { scanf( %d , &n); for (int i = 1, x, y, z; i <= n; i++) { scanf( %d%d%d , &x, &y, &z); a[x + y - z].push_back((node){x, y, z, i}); q[i] = x + y - z; } ans = 0; for (int i = 1; i <= n; i++) if (a[q[i]].size()) { sort(a[q[i]].begin(), a[q[i]].end(), cmp); for (int j = 0, px = -1e9; j < (int)a[q[i]].size(); j++) { node b = a[q[i]][j]; if (b.b < q[i] - px) px = min(b.a, q[i]), ans++; x[b.id] = b.a - px; y[b.id] = b.m - x[b.id]; } a[q[i]].clear(); } cout << ans << n ; for (int i = 1; i <= n; i++) cout << x[i] << << y[i] << n ; } int main() { int T = 1; scanf( %d , &T); while (T--) Work(); return 0; }
#include <bits/stdc++.h> using namespace std; int d8x[8] = {1, -1, 0, 0, 1, 1, -1, -1}; int d8y[8] = {0, 0, 1, -1, 1, -1, 1, -1}; const int M = 1e9 + 7; const int N = 1e3, Nx = 500; int a[N + 1], c[N + 1]; bool isPrime[N + 1]; void sieve(int x) { for (int i = 0; i <= x; i++) isPrime[i] = true; isPrime[0] = false; isPrime[1] = false; for (int i = 2; i * i <= x; i++) { if (isPrime[i]) { for (int j = i * i; j <= x; j += i) isPrime[j] = false; } } } template <class type> type gcd(type a, type b) { if (b == 0) return a; return gcd(b, a % b); } template <class type> type MODEXPO(type a, type b, int mod) { if (b == 0) return 1; else if (b % 2 == 0) return MODEXPO((a * a) % mod, b / 2, mod); else return (a * MODEXPO((a * a) % mod, (b - 1) / 2, mod)) % mod; } void fast() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); } int main() { fast(); int n; cin >> n; int ans = 1; for (int i = 0; i <= n - 1; i++) cin >> a[i], a[i]--; for (int i = 0; i <= n - 1; i++) { memset(c, 0, sizeof c); int l = 0, x = i; while (!c[x]) c[x] = 1, l++, x = a[x]; if (x != i) { ans = -1; break; } if (l % 2 == 0) l /= 2; ans *= l / gcd(l, ans); } cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; using ll = long long; const int inf = 1e9 + 7; const ll longinf = 1LL << 60; const ll mod = 1e9 + 7; template <typename T, typename S> struct LazySegmentTree { private: int n; vector<T> node; vector<S> lazy; T E0; S E1; inline void updatef(S& lazy, S& value) { lazy += value; } inline void calculatef(T& node, S& lazy, int len) { node += lazy; } inline T queryf(T& x, T& y) { return max(x, y); } public: LazySegmentTree(int sz, T nodeE, S lazyE) : E0(nodeE), E1(lazyE) { n = 1; while (n < sz) n <<= 1; node.resize(2 * n - 1, E0); lazy.resize(2 * n - 1, E1); } LazySegmentTree(vector<T>& v, T E0, S E1) : E0(E0), E1(E1) { n = 1; int sz = v.size(); while (n < sz) n <<= 1; node.resize(2 * n - 1, E0); lazy.resize(2 * n - 1, E1); for (int i = (int)(0); i < (int)(sz); ++i) node[i + n - 1] = v[i]; for (int i = n - 2; i >= 0; --i) { node[i] = queryf(node[2 * i + 1], node[2 * i + 2]); } } void eval(int k, int l, int r) { if (lazy[k] == E1) return; calculatef(node[k], lazy[k], r - l); if (r - l > 1) { updatef(lazy[2 * k + 1], lazy[k]); updatef(lazy[2 * k + 2], lazy[k]); } lazy[k] = E1; } void update(int a, int b, S x, int k = 0, int l = 0, int r = -1) { if (r < 0) r = n; eval(k, l, r); if (r <= a \|\| b <= l) return; if (a <= l && r <= b) { updatef(lazy[k], x); eval(k, l, r); } else { update(a, b, x, 2 * k + 1, l, (l + r) / 2); update(a, b, x, 2 * k + 2, (l + r) / 2, r); node[k] = queryf(node[2 * k + 1], node[2 * k + 2]); } } T query(int a, int b, int k = 0, int l = 0, int r = -1) { if (r < 0) r = n; eval(k, l, r); if (r <= a \|\| b <= l) return E0; if (a <= l && r <= b) return node[k]; T xl = query(a, b, 2 * k + 1, l, (l + r) / 2); T xr = query(a, b, 2 * k + 2, (l + r) / 2, r); return queryf(xl, xr); } }; int main() { cin.tie(0); ios::sync_with_stdio(false); int n, m, p; cin >> n >> m >> p; vector<pair<int, pair<int, ll>>> v(n + p); for (int i = (int)(0); i < (int)(n); ++i) { int x, y; cin >> x >> y; v[i] = {x, {-inf, -y}}; } vector<pair<int, int>> b(m); for (int i = (int)(0); i < (int)(m); ++i) { cin >> b[i].first >> b[i].second; } for (int i = (int)(0); i < (int)(p); ++i) { int x, y, z; cin >> x >> y >> z; v[n + i] = {x, {y, z}}; } sort(b.begin(), b.end()); vector<ll> c(m); for (int i = (int)(0); i < (int)(m); ++i) c[i] = -b[i].second; LazySegmentTree<ll, ll> sg(c, -longinf, 0); sort(v.begin(), v.end()); ll ans = -longinf; for (auto e : v) { if (e.second.second < 0) { ans = max(sg.query(0, m) + e.second.second, ans); } else { int idx = lower_bound(b.begin(), b.end(), pair<int, int>{e.second.first, inf}) - b.begin(); sg.update(idx, m, e.second.second); } } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; void solve() { int n; cin >> n; vector<pair<int, int> > v(n); for (int i = 0; i < n; i++) cin >> v[i].first; bool is0 = false, is1 = false; for (int i = 0; i < n; i++) { cin >> v[i].second; if (v[i].second) is1 = true; else is0 = true; } if (is0 && is1) { cout << Yes n ; return; } for (int i = 1; i < n; i++) if (v[i - 1] > v[i]) { cout << No n ; return; } cout << Yes n ; } int main() { ios::sync_with_stdio(false); int t; cin >> t; while (t--) solve(); }
#include <bits/stdc++.h> using namespace std; int n, m; int mat[1000010]; int row(int r) { int s = r * m, e = s + m; bool eq = false, dif = false; for (int i = s, idx = 0; i < e; i++, idx++) { if (mat[i] == -1) continue; int a = mat[i] / 2; int b = idx & 1; if (a == b) eq = true; if (a != b) dif = true; } if (eq && dif) return 0; if (eq \|\| dif) return 1; return 2; } int col(int c) { int s = c, e = n * m + c; bool eq = false, dif = false; for (int i = s, idx = 0; i < e; i += m, idx++) { if (mat[i] == -1) continue; int a = min(mat[i], 3 - mat[i]); int b = idx & 1; if (a == b) eq = true; if (a != b) dif = true; } if (eq && dif) return 0; if (eq \|\| dif) return 1; return 2; } int main() { while (cin >> n >> m) { char ch; for (int i = 0; i < n * m; i++) { cin >> ch; if (ch == . ) mat[i] = -1; else mat[i] = (int)(ch - 1 ); } int res = 1; for (int i = 0; i < n; i++) { res = row(i); if (res >= 1000003) res -= 1000003; } for (int i = 0; i < m; i++) { res = col(i); if (res >= 1000003) res -= 1000003; } cout << res % 1000003 << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 100; int n, x, t; long long ans, s[N]; int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %d , &x); t = 0; while (x) { t += x % 2; x /= 2; } ++s[t]; } for (int i = 1; i <= N; ++i) ans += s[i] * (s[i] - 1) / 2; cout << ans; }
#include <bits/stdc++.h> using namespace std; int n, i, j; vector<string> koutsompolio; int main() { cin >> n; string lol; bool r, f; for (i = 0; i <= n; i++) { getline(cin, lol); koutsompolio.push_back(lol); } for (i = 1; i <= n; i++) { r = false; f = false; if ((koutsompolio[i][0] == m ) && (koutsompolio[i][1] == i ) && ((koutsompolio[i][2] == a )) && (koutsompolio[i][3] == o ) && (koutsompolio[i][4] == . )) { r = true; } if ((koutsompolio[i][koutsompolio[i].size() - 1] == . ) && (koutsompolio[i][koutsompolio[i].size() - 2] == a ) && ((koutsompolio[i][koutsompolio[i].size() - 3] == l )) && (koutsompolio[i][koutsompolio[i].size() - 4] == a ) && (koutsompolio[i][koutsompolio[i].size() - 5] == l )) { f = true; } if ((f == false) && (r == true)) { cout << Rainbow s n ; } else if ((f == true) && (r == false)) { cout << Freda s n ; } else { cout << OMG>.< I don t know! n ; } } }
#include <bits/stdc++.h> using namespace std; void solve() { int x{}; cin >> x; if (x % 3 == 0 \|\| x % 7 == 0) { cout << YES << endl; return; } int ms{x / 3}; int ml{x / 7}; for (int i{0}; i <= ms; ++i) { for (int j{0}; j <= ml; ++j) { int chunks{3 * i + 7 * j}; if (chunks == x) { cout << YES << endl; return; } } } cout << NO << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int t{}; cin >> t; while (t > 0) { solve(); t--; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long k; cin >> k; long long cnt = 0; for (double a = 2 + 2. / 3; a < (2 * k) / sqrt(3); a += 2) { double b = 1e-8 + (-a + sqrt((16 * k * k) / 3. - (3 * a * a))) / 2. - 2. / 3; if (b > 0) cnt += ((int)b + 2) / 2; } cout << 1 + 6 * cnt << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int cmpint(const void a, const void b) { if (((int )a)[0] == ((int )b)[0]) return ((int )a)[1] - ((int )b)[1]; return ((int )a)[0] - ((int )b)[0]; } int prim[500005] = {0}; bool isprim[5000005] = {0}; int prim_len; void count_prim() { int i, j, l; prim[0] = 2; prim_len = 1; for (i = 3; i < 5000000; i += 2) if (isprim[i] == 0) { prim[prim_len] = i; prim_len++; l = i * 2; if (i < 10000) for (j = i * i; j < 5000000; j += l) isprim[j] = 1; } } int a[100005]; int main() { int i, j, n, m, k, l, o, p; scanf( %d , &n); count_prim(); m = 0; for (i = (0); i < (prim_len); i++) { k = prim[i]; l = 0; while (k > 0) { l = l * 10 + k % 10; k /= 10; } if (l != prim[i] && isprim[l] == 0 && l % 2 == 1) { m++; a[m] = prim[i]; } if (m > n) break; } printf( %d n , a[n]); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); vector<long> A; long N, L, R, M, T, Sum, Min = 2147483647; cin >> N; A.resize(N); for (long i = 0; i < N; ++i) cin >> A[i]; for (long M = 1; M <= 100; ++M) { Sum = 0; for (long i = 0; i < N; ++i) Sum += min(min(abs(A[i] - M + 1), abs(A[i] - M - 1)), abs(A[i] - M)); if (Sum < Min) { Min = Sum; T = M; } } cout << T << << Min; return 0; }
#include <bits/stdc++.h> const int mod = 1e6 + 3; int add(int a, int b) { return (a += b) >= mod ? a -= mod : a; } int sub(int a, int b) { return add(a, mod - b); } int mul(int a, int b) { return int(1LL * a * b % mod); } int pow(int a, int64_t n) { int res = 1; while (n > 0) { if (n & 1) { res = mul(res, a); } a = mul(a, a); n >>= 1; } return res; } int inv(int a) { return pow(a, mod - 2); } int main() { const int n = 11; std::vector<int> f(n + 1); for (int i = 1; i <= n; ++i) { std::cout << ? << i << std::endl; std::cin >> f[i]; if (f[i] == 0) { std::cout << ! << i << std::endl; return 0; } } std::vector<std::vector<int> > a(1 + n, std::vector<int>(1 + n)); for (int i = 1; i <= n; ++i) { for (int j = 1; j <= n; ++j) { a[i][j] = pow(i, j - 1); } } for (int j = 1, i = 1; j <= n; ++j) { bool was = false; for (int k = i; k <= n; ++k) { if (a[k][j] != 0) { was = true; std::swap(a[i], a[k]); std::swap(f[i], f[k]); break; } } if (!was) { continue; } for (int k = i + 1; k <= n; ++k) { int coeff = mul(sub(0, inv(a[k][j])), a[i][j]); for (int t = j; t <= n; ++t) { a[k][t] = add(mul(coeff, a[k][t]), a[i][t]); } assert(a[k][j] == 0); f[k] = add(f[i], mul(coeff, f[k])); } i++; } std::vector<int> x(1 + n); for (int i = n; i >= 1; --i) { assert(a[i][i] != 0); int res = f[i]; for (int j = i + 1; j <= n; ++j) { res = sub(res, mul(a[i][j], x[j])); } x[i] = mul(res, inv(a[i][i])); } for (int i = 0; i < mod; ++i) { int p = 1, s = 0; for (int j = 1; j <= n; ++j) { s = add(s, mul(x[j], p)); p = mul(p, i); } if (s == 0) { std::cout << ? << i << std::endl; int v; std::cin >> v; assert(v == 0); std::cout << ! << i << std::endl; return 0; } } std::cout << ! << -1 << std::endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, sticks; cin >> n; while (n--) { cin >> sticks; if (sticks % 2 == 0) cout << (sticks / 2) << endl; else cout << (1 + (sticks - 1) / 2) << endl; } }
#include <bits/stdc++.h> using namespace std; const double PI = 2 * acos(0.0); mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count()); const string DIGITS = 0123456789 ; const string ALPH = abcdefghijklmnopqrstuvwxyz ; template <class T0, class T1> inline ostream &operator<<(ostream &out, pair<T0, T1> &a) { return out << { << a.first << , << a.second << } ; } template <class T0, class T1, class T2> inline ostream &operator<<(ostream &out, tuple<T0, T1, T2> &a) { return out << { << get<0>(a) << , << get<1>(a) << , << get<2>(a) << } ; } template <class T0, class T1, class T2, class T3> inline ostream &operator<<(ostream &out, tuple<T0, T1, T2, T3> &a) { return out << { << get<0>(a) << , << get<1>(a) << , << get<2>(a) << , << get<3>(a) << } ; } template <class T> inline ostream &operator<<(ostream &out, vector<T> &a) { out << [ ; for (long long i = 0; i < (long long)(a.size()); ++i) out << a[i] << vector<string>{ , , ] }[i + 1 == a.size()]; return out; } void smain(); signed main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout << setprecision(10) << fixed; smain(); return 0; } void smain() { long long t; cin >> t; while (t--) { long long n, k; string s; cin >> n >> k >> s; vector<long long> p(2); map<long long, long long> mp; for (long long i = 0; i < s.size(); i++) { p[s[i] - 0 ]++; long long u = p[0] - p[1]; mp[u]++; } long long v = p[0] - p[1]; if (v == 0) { if (mp[k] != 0) { cout << -1 << n ; } else { cout << mp[k] << n ; } continue; } long long sum = 0; for (auto h : mp) { if ((k - h.first) % abs(v) == 0 && (k - h.first) / v >= 0) { sum += h.second; } } if (k == 0) sum++; cout << sum << n ; } }
#include <bits/stdc++.h> using namespace std; int n, ans, dp[105], a[105]; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); if (n % 2 == 0 \|\| n == 1) { printf( -1 ); return 0; } for (int i = n; i >= 2; i--) { ans += max(a[i], a[i - 1]); a[(i - 1) / 2] -= min(a[(i - 1) / 2], max(a[i], a[i - 1])); i--; } printf( %d , ans + a[1]); }
#include <iostream> #include <vector> #include <algorithm> #include <string> #include <map> #include <unordered_set> #include <unordered_map> #include <cmath> #include <random> #include <chrono> #include <set> #include <queue> #include <stack> #include <deque> #include <cstring> const long long big = 998244353; using namespace std; long long power(long long a, long long n) { if (n == 0) return 1; if (n % 2 == 1) return (power(a, n - 1) * a) % big; else { long long b = power(a, n / 2); return (b * b) % big; } } int gcd(int a, int b) { if (b == 0) return a; else return gcd(b, a % b); } int t2[1000000]; void build_min(int a[], int v, int tl, int tr) { if (tl >= tr) t2[v] = a[tl]; else { int tm = (tl + tr) / 2; build_min(a, v * 2, tl, tm); build_min(a, v * 2 + 1, tm + 1, tr); t2[v] = min(t2[v * 2], t2[v * 2 + 1]); } } int sum_min (int v, int tl, int tr, int l, int r) { if (l > r) return 1000000; if (l == tl && r == tr) return t2[v]; int tm = (tl + tr) / 2; return min(sum_min (v2, tl, tm, l, min(r,tm)) , sum_min (v2+1, tm+1, tr, max(l,tm+1), r)); } int t[1000000]; void build_max(int a[], int v, int tl, int tr) { if (tl >= tr) t[v] = a[tl]; else { int tm = (tl + tr) / 2; build_max(a, v * 2, tl, tm); build_max(a, v * 2 + 1, tm + 1, tr); t[v] = max(t[v * 2], t[v * 2 + 1]); } } void update(int v, int tl, int tr, int l, int r, int add) { if (l > r) return; if (l == tl && tr == r) t[v] += add; else { int tm = (tl + tr) / 2; update(v * 2, tl, tm, l, min(r, tm), add); update(v * 2 + 1, tm + 1, tr, max(l, tm + 1), r, add); } } int get(int v, int tl, int tr, int pos) { if (tl == tr) return t[v]; int tm = (tl + tr) / 2; if (pos <= tm) return t[v] + get(v * 2, tl, tm, pos); else return t[v] + get(v * 2 + 1, tm + 1, tr, pos); } int sum_max (int v, int tl, int tr, int l, int r) { if (l > r) return -1000000; if (l == tl && r == tr) return t[v]; int tm = (tl + tr) / 2; return max(sum_max (v2, tl, tm, l, min(r,tm)) , sum_max (v2+1, tm+1, tr, max(l,tm+1), r)); } class Cmp { public: bool operator()(vector<long long>& a, vector<long long>& b) { return a.size() > b.size(); } }; void solve() { long long n, k; cin >> n >> k; vector<long long> sa(n); for (int i = 0; i < n; ++i) { cin >> sa[i]; } vector<long long> tmp(n); for (int i = 0; i < n; ++i) { tmp[sa[i]] = i; } long long cur = 0; vector<long long> s(n); s[sa[0]] = 0; for (int i = 1; i < n; ++i) { long long j = sa[i - 1]; long long l = sa[i]; if (l == n - 1 \|\| (j < n - 1 && tmp[j + 1] > tmp[l + 1])) cur++; s[sa[i]] = cur; } long long dif = k; for (long long i: s) { // cout << i << ; if (k - i - 1 < dif) { dif = k - i - 1; } } if (dif < 0) { cout << 0; return; } else if (dif == 0) { cout << 1; return; } else { long long ans = 1; for (int i = 1; i <= dif; ++i) { ans = (n + i); ans %= big; ans = power(i, big - 2); ans %= big; } cout << ans; } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long t = 1; // cin >> t; //cout.precision(20); while (t--) { solve(); } }
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cout.tie(0), cin.tie(0); int t; cin >> t; while (t--) { int n, m; cin >> n >> m; vector<string> ar(n); long long cnt = 0; vector<vector<int>> dp(n + 1, vector<int>(m + 1, 0)); for (int i = 0; i < n; i++) { cin >> ar[i]; for (int j = 0; j < m; j++) { dp[i][j] = (ar[i][j] == * ); cnt += (ar[i][j] == * ); } } for (int i = 0; i < n; i++) { for (int j = 1; j < m; j++) { dp[i][j] += dp[i][j - 1]; } } // 1st Sol. : from base to head but with binary search on answer - O(N^3 . Log(N)). // 2nd Sol. : let * in position [i, j] be the head of k-tree and try to go downward - O(N^3). for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (ar[i][j] == * ) { int rows = i + 1; int cols_left = j - 1; int cols_right = j + 1; int temp = 0; bool ok = true; while (rows < n && ok) { int cur = dp[rows][cols_right]; if (cols_left - 1 >= 0) { cur -= dp[rows][cols_left - 1]; } if (cur == cols_right - cols_left + 1) { temp++; rows++; cols_left--; cols_right++; } else { ok = false; } } cnt += temp; } } } cout << cnt << n ; } }
#include <bits/stdc++.h> using namespace std; struct pt { long long x, y; } a[3005]; long long n, m, q, lim, las, pre[3005], suf[3005], rc[3005][3005], c, x, y, z, v, ans; long long cmp(pt x, pt y) { return x.y < y.y \|\| (x.y == y.y && x.x < y.x); } long long cb(long long x) { return (x + 1) * x >> 1; } int main() { scanf( %lld , &n), scanf( %lld , &m), scanf( %lld , &q), scanf( %lld , &lim); for (long long i = 1; i <= q; i++) scanf( %lld , &a[i].x), scanf( %lld , &a[i].y); sort(a + 1, a + q + 1, cmp); for (long long i = 1; i <= q; i++) rc[a[i].x][++rc[a[i].x][0]] = i; a[q + 1].y = m + 1; for (long long i = 1; i <= n; i++) { memset(pre, 255, sizeof pre), memset(suf, 255, sizeof suf), las = 0; for (long long j = 1; j <= q; j++) if (a[j].x >= i) suf[pre[j] = las] = j, las = j; suf[pre[q + 1] = las] = q + 1, v = cb(m), x = y = suf[0], c = 1; while (suf[x] > -1) { while (c + 1 < lim && suf[suf[y]] > -1) c++, y = suf[y]; if (c < lim) v -= (a[x].y - a[pre[x]].y) * (a[suf[y]].y - a[x].y); x = suf[x], c--; } x = suf[0]; while (x) v -= cb(a[x].y - a[pre[x]].y - 1), x = suf[x]; for (long long j = n; j >= i; j--) { ans += v; if (!v) break; if (j > i) for (long long u = 1; u <= rc[j][0]; u++) if (x = y = z = rc[j][u]) { c = 1; while (c < lim && pre[pre[x]] > -1) x = pre[x], c++; while (pre[x] != z) { while (c < lim && suf[suf[y]] > -1) y = suf[y], c++; if (c == lim) v -= (a[x].y - a[pre[x]].y) * (a[suf[y]].y - a[y].y); if (c < lim) break; x = suf[x], c--; } x = pre[z], y = suf[z], suf[pre[y] = x] = y; } } } printf( %lld , ans); }
#include <bits/stdc++.h> using namespace std; long long int a[1000005], b[1000005]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long int n, i; cin >> n; a[1] = 1; b[1] = 0; for (i = 2; i <= n; i++) { if (i % 2 == 0) { a[i] = a[i - 1]; b[i] = (b[i - 1] + (a[i] + 1)); a[i] %= 1000000007; b[i] %= 1000000007; } else { b[i] = b[i - 1]; a[i] = (a[i - 1] + (b[i] + 1)); a[i] %= 1000000007; b[i] %= 1000000007; } } long long int ans = b[n] + a[n]; ans %= 1000000007; cout << ans << n ; return 0; }
#include <bits/stdc++.h> using namespace std; const int MAX_N = 300 * 1000 + 10; long long dist[MAX_N], dist1[MAX_N]; vector<pair<int, int>> adj[MAX_N]; set<pair<long long, int>> s; bool inPath[MAX_N]; pair<int, int> mx; int nxt[MAX_N]; bool dfs_path(int u, int par = -1) { for (auto x : adj[u]) { int v = x.first; if (v != par && dfs_path(v, u)) inPath[u] = true, nxt[u] = v; } return inPath[u]; } long long dfs_dist(int u, int par = -1) { if (inPath[u]) for (auto x : adj[u]) { int v = x.first, w = x.second; if (v == nxt[u]) dist1[v] = dist1[u] + w, dist[u] = dfs_dist(v, u) + w; } for (auto x : adj[u]) { int v = x.first, w = x.second; if (v != par && !inPath[v]) dist1[v] = dist1[u] + w, dist[v] = dist[u] + w, dfs_dist(v, u); } return dist[u]; } bool cmp(pair<int, int> a, pair<int, int> b) { if (min(a.first, b.first) < 0) return a.first < 0 ? true : false; return dist1[a.first] + dist[a.second] < dist1[b.first] + dist[b.second]; } void rem_block(int u, int par = -1) { s.erase({dist[u], u}); for (auto x : adj[u]) { int v = x.first; if (v != par) rem_block(v, u); } } void add_block(int u, int par = -1) { s.insert({dist[u], u}); for (auto x : adj[u]) { int v = x.first; if (v != par) add_block(v, u); } } void dfs(int u, int par = -1) { if (inPath[u]) { s.erase({dist[u], u}); for (auto x : adj[u]) { int v = x.first; if (v != par && v != nxt[u]) rem_block(v, u), dfs(v, u), add_block(v, u); } for (auto x : adj[u]) { int v = x.first; if (v != par && v != nxt[u]) rem_block(v, u); } for (auto it = s.rbegin(); it != s.rend(); it++) if (it->second != nxt[u]) { mx = max(make_pair(u, it->second), mx, cmp); break; } if (nxt[u] != u) dfs(nxt[u], u); } else if (!s.empty()) { mx = max(make_pair(u, (*s.rbegin()).second), mx, cmp); for (auto x : adj[u]) { int v = x.first; if (v != par) dfs(v, u); } } } int main() { ios_base ::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); int n, m; cin >> n >> m; for (int i = 1; i < n; i++) { int u, v, w; cin >> u >> v >> w; u--, v--; adj[u].push_back({v, w}); adj[v].push_back({u, w}); } inPath[n - 1] = true, nxt[n - 1] = n - 1, mx = {-1, -1}; dfs_path(0), dfs_dist(0), add_block(0), dfs(0); for (int i = 0; i < m; i++) { int x; cin >> x; cout << min(dist1[mx.first] + dist[mx.second] + x, dist[0]) << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long i = -1, k, l; cin >> k >> l; while (l % k == 0) { l /= k; i++; } if (i >= 0 && l == 1) cout << YES << endl << i << endl; else cout << NO << endl; }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; while (n--) { int a, b; cin >> a >> b; int sum = 0; int h; for (int i = 1; i < a; i++) { sum += i; if (sum >= b) { sum -= i; h = i - 1; break; } } int s = a - h - 1; int sb = a - (b - sum) + 1; for (int i = 1; i <= a; i++) { if (i == s \|\| i == sb) cout << b ; else cout << a ; } cout << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; long long int c1, c2, x, y, l, r, mid; int main() { ios::sync_with_stdio(false); cin >> c1 >> c2 >> x >> y; l = c1 + c2; r = 2000000009; while (l < r) { mid = (l + r) / 2; if ((mid - (mid / x) >= c1) && (mid - (mid / y) >= c2) && (mid - (mid / (x * y)) >= (c1 + c2))) r = mid; else l = mid + 1; } cout << l << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int a[16] = {15, 14, 12, 13, 8, 9, 10, 11, 0, 1, 2, 3, 4, 5, 6, 7}; int n; cin >> n; cout << a[n]; return 0; }
#include <bits/stdc++.h> using namespace std; multiset<long long> h[1000005]; int main() { int q; scanf( %d , &q); while (q--) { char op, s[20]; long long a; scanf( %c , &op); if (op == + ) { scanf( %lld , &a); int idx = 0, k = 0; for (long long x = a; x > 0; x /= 10, k++) { int d = x % 10; idx \|= (d & 1) << k; } h[idx].insert(a); } else if (op == - ) { scanf( %lld , &a); int idx = 0, k = 0; for (long long x = a; x > 0; x /= 10, k++) { int d = x % 10; idx \|= (d & 1) << k; } h[idx].erase(h[idx].find(a)); } else { scanf( %s , s); reverse(s, s + strlen(s)); int idx = 0; for (int k = 0; s[k]; k++) idx \|= (s[k] - 0 ) << k; printf( %d n , (int)h[idx].size()); } } }
#include <bits/stdc++.h> using namespace std; int n, pre = -1; priority_queue<pair<int, int> > q; const int M = 3000000 * 4, N = 1e9; int tree[M], lson[M], rson[M], val[M], size, k, root; void updata(int &root, int l, int r, int x, int v) { if (!root) root = ++size; if (l == r) { val[root] = tree[root] = v; return; } int mid = (l + r) / 2; if (x <= mid) updata(lson[root], l, mid, x, v); else updata(rson[root], mid + 1, r, x, v); tree[root] = max(tree[lson[root]], tree[rson[root]]) + val[root]; } void add(int &root, int l, int r, int x, int y) { if (!root \|\| y < l \|\| r < x) return; if (x <= l && r <= y) { tree[root]++; val[root]++; return; } int mid = (l + r) / 2; add(lson[root], l, mid, x, y); add(rson[root], mid + 1, r, x, y); tree[root] = max(tree[lson[root]], tree[rson[root]]) + val[root]; } int ask(int &root, int l, int r, int x, int y) { if (!root \|\| y < l \|\| r < x) return 0; if (x <= l && r <= y) return tree[root]; int mid = (l + r) / 2; return max(ask(lson[root], l, mid, x, y), ask(rson[root], mid + 1, r, x, y)) + val[root]; } int main() { scanf( %d%d , &n, &k); for (int i = 1; i <= n; i++) { int l, r; scanf( %d%d , &l, &r); l = max(0, l); q.push(make_pair(-r, -l)); q.push(make_pair(-l, 1)); } while (!q.empty()) { int l = -q.top().second, r = -q.top().first; q.pop(); if (l >= 0) add(root, 0, N, l, r); else { if (r == pre) continue; int u = ask(root, 0, N, pre, pre), v = ask(root, 0, N, 0, r - k); if (l == -1 \|\| u < v) { pre = r; updata(root, 0, N, r, v); if (r + root <= N) q.push(make_pair(-r - k, 2)); } } } cout << tree[1] << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long int p; cin >> p; for (long long int z = 0; z < p; z++) { long long int n; cin >> n; while (1) { break; } string a; cin >> a; long long int re = 0, ro = 0, be = 0, bo = 0; for (long long int i = 0; i < n; i++) { if (i % 2 == 0) { if (a[i] % 2 == 0) { re++; } else ro++; } else { if (a[i] % 2 == 0) { be++; } else bo++; } } while (1) { break; } if (n % 2 == 0) { if (be > 0) cout << 2 n ; else cout << 1 n ; while (1) { break; } } else { while (1) { break; } if (ro > 0) cout << 1 n ; else cout << 2 n ; while (1) { break; } } } }
#include <bits/stdc++.h> using namespace std; void solve() { int n; cin >> n; string s; cin >> s; int l = -1, r = -1; for (int i = 0; i < n; i++) { int cnt1 = 0, cnt2 = 0; if (s[i] == a ) ++cnt1; else ++cnt2; for (int j = i + 1; j < n; j++) { if (s[j] == a ) ++cnt1; else ++cnt2; if (cnt1 == cnt2) { l = i + 1, r = j + 1; break; } } } cout << l << << r << n ; return; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int tt; cin >> tt; while (tt--) { solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; int N, M; int tam[200005], ans[200005]; map<pair<int, int>, bool> ex; int main() { cin.tie(0); ios_base::sync_with_stdio(0); cin >> N >> M; for (int m = 0; m < M; m++) { int u, v; cin >> u >> v; tam[u]++; tam[v]++; ex[{u, v}] = 1; ex[{v, u}] = 1; } for (int i = 1; i <= N; i++) if (tam[i] < N - 1) { cout << YES n ; for (int j = 1; j <= N; j++) if (i != j && !ex[{i, j}]) { ans[i] = 1; ans[j] = 2; int id = 3; for (int k = 1; k <= N; k++) if (!ans[k]) ans[k] = id++; for (int i = 1; i <= N; i++) cout << ans[i] << n [i == N]; for (int i = 1; i <= N; i++) cout << (ans[i] == 2 ? 1 : ans[i]) << n [i == N]; exit(0); } } cout << NO n ; return 0; }
#include <bits/stdc++.h> using namespace std; int a, d[101], b, f, g, h, j, k, l, n, i; string s, x; int main() { cin >> s >> x; a = s.size(); b = x.size(); if (s == x) { cout << YES ; return 0; } if (a != b) { cout << NO ; return 0; } for (i = 0; i < a; i++) { if (s[i] == 1 ) { k++; } if (x[i] == 1 ) { j++; } } if (k > 0 && j > 0) cout << YES ; else cout << NO ; }
#include <bits/stdc++.h> using namespace std; const int MAXN = 1505; const int dx[] = {1, -1, 0, 0}; const int dy[] = {0, 0, 1, -1}; int n, m; pair<int, int> start; char a[MAXN][MAXN]; bool vis[MAXN][MAXN]; pair<int, int> sm[MAXN][MAXN]; bool dfs(int x, int y, pair<int, int> shift) { if (vis[x][y]) { return !(sm[x][y] == shift); } vis[x][y] = true; sm[x][y] = shift; for (int i = 0; i < 4; i++) { int nx = x + dx[i]; int ny = y + dy[i]; pair<int, int> nshift = shift; if (nx >= n) { nx = 0; nshift.first++; } if (ny >= m) { ny = 0; nshift.second++; } if (nx < 0) { nx = n - 1; nshift.first--; } if (ny < 0) { ny = m - 1; nshift.second--; } if (a[nx][ny] != # ) if (dfs(nx, ny, nshift)) return true; } return false; } int main() { scanf( %d %d%*c , &n, &m); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { scanf( %c , &a[i][j]); if (a[i][j] == S ) start.first = i, start.second = j; } scanf( n ); } if (dfs(start.first, start.second, pair<int, int>(0, 0))) printf( Yes ); else printf( No ); return 0; }
#include <bits/stdc++.h> using namespace std; int n; int deg[1001]; int main() { cin >> n; for (int i = 0; i < n - 1; i++) { int a, b; cin >> a >> b; deg[a]++; deg[b]++; } int ans = 0; for (int i = 1; i <= n; i++) if (deg[i] == 1) ans++; cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; pair<long long, long long> a[100100]; vector<long long> v, v2; int main() { int n, i; cin >> n; long long Answer = 0; for (i = 0; i < n; i++) { cin >> a[i].first >> a[i].second; v.push_back(a[i].first); v2.push_back(a[i].second); } sort(v.rbegin(), v.rend()); sort(v2.rbegin(), v2.rend()); for (i = 0; i < n; i++) { Answer += max(v[i], v2[i]) + 1; } cout << Answer; return 0; }
#include <bits/stdc++.h> using namespace std; int A[10005], B[10005]; long long int dp[10005]; int main() { int n, C; scanf( %d %d , &n, &C); for (int i = 0; i < n; i++) scanf( %d , &A[i]); for (int i = 0; i < n; i++) scanf( %d , &B[i]); for (int i = n - 1; i >= 0; i--) { for (int j = n; j >= 0; j--) { dp[j] += (long long int)j * (long long int)C + B[i]; if (j > 0) dp[j] = min(dp[j], dp[j - 1] + A[i]); } } long long int ret = dp[0]; for (int j = 0; j <= n; j++) ret = min(ret, dp[j]); printf( %lld n , ret); return 0; }
#include <bits/stdc++.h> using namespace std; int n, m, k; char hh[25]; string s; map<string, int> ma; int fr[100005]; int ax[100005]; int bx[100005]; int main() { scanf( %d%d%d , &n, &k, &m); int i, j, a, b; for (i = 1; i <= n; i++) { scanf( %s , hh); s = hh; ma[s] = i; } for (i = 1; i <= n; i++) scanf( %d , &ax[i]); for (i = 1; i <= k; i++) { scanf( %d , &a); bx[i] = 1e9; for (j = 1; j <= a; j++) { scanf( %d , &b); bx[i] = min(bx[i], ax[b]); fr[b] = i; } } long long res = 0; for (i = 1; i <= m; i++) { scanf( %s , hh); s = hh; res += bx[fr[ma[s]]]; } printf( %lld , res); return 0; }
#include <bits/stdc++.h> long long MOD = 1e9 + 7; using namespace std; int main() { long long n, t; cin >> n >> t; long long a[200010], x[200010], b[200010]; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n; i++) { cin >> x[i]; x[i]--; if ((i > 0 && x[i] < x[i - 1]) \|\| x[i] < i) { cout << No ; return 0; } } int c[200010] = {}; for (int i = 0; i < n; i++) { long long temp = x[i]; c[x[i]] = 1; if (temp == i) { if (i > 0) b[i] = max(a[i] + t, b[i - 1] + 1); else b[i] = a[i] + t; if (i < n - 1 && b[i] >= a[i + 1] + t) { cout << No ; return 0; } } else { if (i > 0) b[i] = max(a[i + 1] + t, b[i - 1] + 1); else b[i] = a[i + 1] + t; } if (i < n - 1 && c[i] && b[i] >= a[i + 1] + t) { cout << No ; return 0; } } cout << Yes << endl; for (int i = 0; i < n; i++) { printf( %lld , b[i]); } return 0; }
#include <bits/stdc++.h> using namespace std; int counts[26]; int main() { string s; cin >> s; int N = s.size(); for (int i = 0; i < N; i++) counts[s[i] - a ]++; for (int i = 0; i < 26; i++) { if (counts[i] % 2 == 1) { int k = -1; for (int j = 25; j >= 0 && k < 0; j--) if (counts[j] % 2 == 1) k = j; if (k != -1) counts[i]++, counts[k]--; } } int pos = 0; int middle = -1; for (int i = 0; i < 26; i++) { if (counts[i] % 2 == 1) { middle = i; } for (int j = 0; j + 1 < counts[i]; j += 2) { s[pos++] = a + i; s[N - pos] = a + i; } } if (middle != -1) s[N / 2] = middle + a ; cout << s << endl; }
#include <bits/stdc++.h> using namespace std; const int oo = 0x3f3f3f3f; const double eps = 1e-9; void bset(int &b, int i) { b \|= (1 << i); } void bunset(int &b, int i) { b = (b & ~(1 << i)); } int bget(int b, int i) { return b & (1 << i); } int bcnt(int b) { return __builtin_popcount(b); } map<char, int> color2id = {{ R , 0}, { G , 1}, { B , 2}, { Y , 3}, { W , 4}}; int pos(int col, int val) { return 5 * col + val; } int best; int cards; int stepmask[10]; int group[12][25], gn[12]; const int maxN = 100; int N; void check(int step, int hints) { if (best <= hints) return; for (int g = int(gn[step]) - 1; g >= (0); g--) { if (bcnt(group[step][g]) > 1) continue; group[step][g] = group[step][--gn[step]]; } if (gn[step] == 0) { best = min(best, hints); return; } if (step >= 10) return; gn[step + 1] = gn[step]; for (int g = (0); g < (gn[step]); g++) { group[step + 1][g] = group[step][g]; } check(step + 1, hints); gn[step + 1] = gn[step]; for (int g = (0); g < (gn[step]); g++) { int a = group[step][g] & stepmask[step]; int b = group[step][g] & ~stepmask[step]; if (!a \|\| !b) { group[step + 1][g] = group[step][g]; } else { group[step + 1][g] = a; group[step + 1][gn[step + 1]++] = b; } } check(step + 1, hints + 1); } int main() { ios::sync_with_stdio(false); for (int c = (0); c < (5); c++) { for (int v = (0); v < (5); v++) bset(stepmask[c], pos(c, v)); for (int v = (0); v < (5); v++) bset(stepmask[v + 5], pos(c, v)); } cin >> N; for (int i = (0); i < (N); i++) { char c; int v; cin >> c >> v; int a = color2id.at(c), b = v - 1; bset(cards, pos(a, b)); } best = 8; gn[0] = 1; group[0][0] = cards; check(0, 0); cout << best << endl; }
#include <bits/stdc++.h> int main() { int n; scanf( %d , &n); if (n == 1) { printf( -1 ); return 0; } printf( %d %d %d , n, n + 1, n * (n + 1)); }
#include <bits/stdc++.h> using namespace std; template <class T> inline void umax(T &a, T b) { if (a < b) a = b; } const int maxn = 100 + 10; const int INF = 1e9 + 7; char a[maxn][maxn]; int c[maxn], d[maxn]; inline void solve(void) { int n; cin >> n; for (int i = (0); i < (n); i++) cin >> a[i]; for (int i = (0); i < (n); i++) cin >> c[i]; vector<int> ans; for (int i = (0); i < (n); i++) { if (d[i] != c[i]) continue; queue<int> v; v.push(i); while (!v.empty()) { int node = v.front(); ans.push_back(node); v.pop(); for (int j = (0); j < (n); j++) { if (a[node][j] == 1 ) { d[j]++; if (d[j] == c[j]) v.push(j); } } } } cout << ans.size() << endl; for (int i = (0); i < (ans.size()); i++) cout << ans[i] + 1 << ; } void init() { ios::sync_with_stdio(false); cin.tie(nullptr); } int main(int argc, const char *argv[]) { solve(); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, xC = 0, XC = 0, i, f = 0; char c; char remain; cin >> n; string o = ; for (i = 0; i < n; i++) { cin >> c; if (c == x ) { xC++; o = o + x ; if (xC == n / 2) { remain = X ; i++; break; } } else { XC++; o = o + X ; if (XC == n / 2) { remain = x ; i++; break; } } } while (i < n) { cin >> c; if (c != remain) { f++; } o = o + remain; i++; } cout << f << endl; cout << o; return 0; }
#include <bits/stdc++.h> template <class T> bool MX(T &l, const T &r) { return l < r ? l = r, 1 : 0; } template <class T> bool MN(T &l, const T &r) { return l > r ? l = r, 1 : 0; } using namespace std; const long long MOD = 1e9 + 7; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, a, b, ans = 0, c; cin >> n >> a >> b; vector<int> s(n / 2); for (int i = 0; i < (int)n / 2; ++i) cin >> s[i]; reverse(s.begin(), s.end()); if (n % 2) { cin >> c; if (c == 2) ans += min(a, b); } for (int i = 0; i < (int)n / 2; ++i) { cin >> c; if (s[i] == 0) { if (c == 2) ans += a; if (c == 1) { cout << -1 << endl; return 0; } } else if (s[i] == 1) { if (c == 2) ans += b; if (c == 0) { cout << -1 << endl; return 0; } } else { if (c == 2) ans += 2 * min(a, b); if (c == 1) ans += b; if (c == 0) ans += a; } } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const long long N = 5 * 1e5 + 100; long long n, m, nxt[N], MAX[N]; char s[N], t[N]; inline void add(long long &a, long long b, long long mod) { a = ((a + b >= mod) ? a + b - mod : a + b); } inline void del(long long &a, long long b, long long mod) { a = ((a - b < 0) ? a - b + mod : a - b); } inline void mul(long long &a, long long b, long long mod) { a = a * b % mod; } inline long long m_pow(long long a, long long b, long long mod) { long long ans = 1; while (b) { if (b & 1) mul(ans, a, mod); b >>= 1; mul(a, a, mod); } return ans; } inline long long read() { long long f = 1, x = 0; char s = getchar(); while (s < 0 \|\| s > 9 ) { if (s == - ) f = -1; s = getchar(); } while (s >= 0 && s <= 9 ) { x = x * 10 + s - 0 ; s = getchar(); } return x * f; } struct Hash { long long a, b; } z[N]; Hash h[N], x, th[N]; Hash operator+(Hash a, Hash b) { add(a.a, b.a, 998244353); add(a.b, b.b, 342914237); return a; } Hash operator-(Hash a, Hash b) { del(a.a, b.a, 998244353); del(a.b, b.b, 342914237); return a; } Hash operator(Hash a, Hash b) { mul(a.a, b.a, 998244353); mul(a.b, b.b, 342914237); return a; } Hash operator(Hash a, long long b) { mul(a.a, b, 998244353); mul(a.b, b, 342914237); return a; } bool operator==(Hash a, Hash b) { return a.a == b.a && a.b == b.b; } Hash ask(long long l, long long r) { return h[r] - h[l - 1] * z[r - l + 1]; } void check(long long a, long long b, long long c, long long d) { assert(b + 1 == c); if (a > b \|\| c > d \|\| d > n \|\| a <= 0) return; if (ask(a, b) + ask(c, d) == x) { vector<long long> X, Y; if (b - a < d - c) swap(a, c), swap(b, d); for (long long i = b; i >= a; i--) X.push_back(s[i] - 0 ); for (long long i = d; i >= c; i--) Y.push_back(s[i] - 0 ); for (long long i = 0; i < (long long)Y.size(); i++) X[i] += Y[i]; long long tmp = 0; for (long long i = 0; i < (long long)X.size(); i++) { X[i] += tmp; tmp = X[i] / 10; X[i] %= 10; } if (tmp) X.push_back(tmp); if ((long long)X.size() != m) return; bool bl = 1; for (long long i = 1; i <= m; i++) if (X[(long long)X.size() - i] != t[i] - 0 ) bl = 0; if (!bl) return; if (b > d) swap(a, c), swap(b, d); printf( %lld %lld n%lld %lld n , a, b, c, d); exit(0); } } long long find(long long i) { if (s[i] != t[1]) return 0; long long l = 1, r = m; while (l < r) { long long mid = l + ((r - l + 1) >> 1); if (ask(i, i + mid - 1) == th[mid]) l = mid; else r = mid - 1; } return l; } signed main() { scanf( %s%s , s + 1, t + 1); n = strlen(s + 1); m = strlen(t + 1); for (long long i = 1; i <= m; i++) { x = x * 10 + (Hash){t[i] - 0 , t[i] - 0 }; th[i] = x; } z[0] = (Hash){1, 1}; for (long long i = 1; i <= n; i++) z[i] = z[i - 1] * (Hash){10, 10}; for (long long i = 1; i <= n; i++) h[i] = h[i - 1] * 10 + (Hash){s[i] - 0 , s[i] - 0 }; for (long long i = 1; i <= n; i++) { check(i, i + m - 1, i + m, i + m + m - 1); check(i, i + m - 1, i + m, i + m + m - 2); check(i, i + m - 2, i + m - 1, i + m + m - 2); check(i, i + m - 2, i + m - 1, i + m + m - 3); } for (long long i = 1; i <= n; i++) { long long pos = find(i); if (pos == m) continue; check(i, i + m - 1, i + m, i + 2 * m - pos - 1); check(i, i + m - 1, i + m, i + 2 * m - pos - 2); check(i - (m - pos), i - 1, i, i + m - 1); check(i - (m - pos - 1), i - 1, i, i + m - 1); } assert(0); }
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10; char buf[1 << 15], fs, ft; inline char getc() { return (ft == fs && (ft = (fs = buf) + fread(buf, 1, 1 << 15, stdin), ft == fs)) ? 0 : fs++; } template <typename T> inline void read(T &x) { x = 0; T f = 1, ch = getchar(); while (!isdigit(ch) && ch ^ - ) ch = getchar(); if (ch == - ) f = -1, ch = getchar(); while (isdigit(ch)) x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar(); x = f; } template <typename T> inline void write(T &x) { if (!x) { putchar( 0 ), putchar( n ); return; } if (x < 0) putchar( - ), x = -x; T num = 0, ch[16]; while (x) ch[++num] = x % 10 + 48, x /= 10; while (num) putchar(ch[num--]); putchar( n ); } int q[maxn], now; long long f[2][maxn], a[maxn], d[maxn], sum[maxn]; inline long long getUp(int j, int k) { return (f[now ^ 1][j] + sum[j]) - (f[now ^ 1][k] + sum[k]); } inline long long getDw(int j, int k) { return j - k; } int main() { int n, m, p; read(n); read(m); read(p); for (int i = 2; i <= n; ++i) read(d[i]), d[i] += d[i - 1]; for (int i = 1; i <= m; ++i) { int h; long long t; read(h); read(t); a[i] = t - d[h]; } sort(a + 1, a + m + 1); for (int i = 1; i <= m; ++i) sum[i] = sum[i - 1] + a[i], f[0][i] = 1e18; long long ans = 1e18; now = 1; for (int t = 1; t <= p; ++t) { int l = 1, r = 1; q[1] = 0; for (int i = 1; i <= m; ++i) { while (l < r && getUp(q[l + 1], q[l]) <= a[i] * getDw(q[l + 1], q[l])) ++l; f[now][i] = f[now ^ 1][q[l]] + (long long)a[i] * (i - q[l]) - (sum[i] - sum[q[l]]); while (l < r && getUp(i, q[r]) * getDw(q[r], q[r - 1]) <= getUp(q[r], q[r - 1]) * getDw(i, q[r])) --r; q[++r] = i; } ans = min(ans, f[now][m]); now ^= 1; } write(ans); return 0; }
#include <bits/stdc++.h> using namespace std; long long int gcd(long long int a, long long int b) { if (a == 0) return b; return gcd(b % a, a); } int main() { long long int n, a[100001], sum = 0, m; cin >> n; for (int i = 0; i < n; ++i) cin >> a[i]; sort(a, a + n); for (int i = 1; i < n; ++i) { sum += i * a[i] - a[i - 1]; a[i] += a[i - 1]; } sum = 2 * sum + a[n - 1]; m = gcd(sum, n); cout << sum / m << << n / m; }
#include <bits/stdc++.h> using namespace std; class Solution { public: int count(vector<int>& pieces, int p) { int n = pieces.size(); preprocess(n); vector<vector<vector<int>>> cur( n + 1, vector<vector<int>>(n + 1, vector<int>(n + 1, 0))); vector<vector<vector<int>>> nxt( n + 1, vector<vector<int>>(n + 1, vector<int>(n + 1, 0))); cur[0][0][0] = 1; for (int i = 0; i < n; ++i) { vector<int> cv; if (pieces[i] == -1) { cv.push_back(0); cv.push_back(1); } else { cv.push_back(pieces[i]); } for (auto& vv : nxt) { for (auto& v : vv) { fill(v.begin(), v.end(), 0); } } for (int j = 0; j <= i; ++j) { for (int k = 0; k <= j; ++k) { for (int l = 0; l <= i - j; ++l) { if (cur[j][k][l] == 0) { continue; } for (auto c : cv) { if (c == 0) { int nj = j + 1; nxt[nj][k + 1][l] = add(nxt[nj][k + 1][l], multiply(cur[j][k][l], multiply(1LL << j, multiply(1LL << (i - j - l), csums[l][0])))); nxt[nj][k][l] = add(nxt[nj][k][l], multiply(cur[j][k][l], multiply(1LL << j, multiply(1LL << (i - j - l), csums[l][1])))); } else { int nj = j; nxt[nj][k][l + 1] = add( nxt[nj][k][l + 1], multiply(cur[j][k][l], multiply(1LL << (i - j), multiply(1LL << (j - k), csums[k][0])))); nxt[nj][k][l] = add( nxt[nj][k][l], multiply(cur[j][k][l], multiply(1LL << (i - j), multiply(1LL << (j - k), csums[k][1])))); } } } } } cur.swap(nxt); } long long res = 0; for (int i = 0; i <= n; ++i) { for (int j = 0; j <= i; ++j) { for (int k = 0; k <= n - i; ++k) { if ((j + k) % 2 == p) { res = add(res, cur[i][j][k]); } } } } return res; } private: const static int M = 1e9 + 7; vector<int> fv; vector<int> ifv; vector<vector<int>> cs; vector<vector<int>> csums; long long add(long long a, long long b) { long long res = (a + b) % M; return res; } long long multiply(long long a, long long b) { return (a * b) % M; } long long pow(long long x, long long e) { long long res = 1; while (e > 0) { if (e & 1) { res = multiply(res, x); } x = multiply(x, x); e >>= 1; } return res; } void preprocess(int n) { fv.clear(); fv.resize(n + 1); ifv.clear(); ifv.resize(n + 1); cs.clear(); cs.resize(n + 1); csums.clear(); csums.resize(n + 1); for (auto& v : csums) { v.resize(2); fill(v.begin(), v.end(), 0); } fv[0] = 1; for (int i = 1; i <= n; ++i) { fv[i] = multiply(fv[i - 1], i); } ifv[0] = 1; ifv[n] = pow(fv[n], M - 2); for (int i = n - 1; i >= 1; --i) { ifv[i] = multiply(ifv[i + 1], i + 1); } for (int i = 1; i <= n; ++i) { cs[i].resize(i + 1); for (int j = 0; j <= i; ++j) { cs[i][j] = multiply(multiply(fv[i], ifv[j]), ifv[i - j]); } } csums[0][0] = 1; for (int i = 1; i <= n; ++i) { for (int j = 0; j <= i; ++j) { if (j % 2) { csums[i][1] = add(csums[i][1], cs[i][j]); } else { csums[i][0] = add(csums[i][0], cs[i][j]); } } } } }; int main(int argc, char** argv) { ios::sync_with_stdio(false); cin.tie(0); int n; int p; cin >> n >> p; vector<int> nums(n); for (int i = 0; i < n; ++i) { cin >> nums[i]; } Solution sol; cout << sol.count(nums, p) << endl; return 0; }
#include <bits/stdc++.h> using namespace std; using namespace chrono; struct stopwatch { time_point<high_resolution_clock> last_tick; bool notock = false; void tick() { last_tick = high_resolution_clock::now(); } void tock() const { duration<double> dur = high_resolution_clock::now() - last_tick; cerr << Time: << dur.count() << n ; } stopwatch() { tick(); } stopwatch(int) { tick(); notock = true; } ~stopwatch() { if (!notock) { tock(); } } }; template <int m> struct modint { unsigned x; modint() : x(0) {} modint(long long arg) { arg %= m; if (arg < 0) { x = arg + m; } else { x = arg; } } modint& operator+=(const modint& other) { x += other.x; if (x >= m) { x -= m; } return this; } modint& operator=(const modint& other) { x = (x * 1ll * other.x) % m; return this; } modint& operator-=(const modint& other) { x += m - other.x; if (x >= m) { x -= m; } return this; } modint operator+(const modint& other) const { modint tmp = this; tmp += other; return tmp; } modint operator-(const modint& other) const { modint tmp = this; tmp -= other; return tmp; } modint operator(const modint& other) const { modint tmp = this; tmp = other; return tmp; } explicit operator int() const { return x; } modint& operator++() { ++x; if (x == m) { x = 0; } return this; } modint& operator--() { if (x == 0) { x = m - 1; } else { --x; } return this; } modint operator++(int) { modint tmp = this; ++this; return tmp; } modint operator--(int) { modint tmp = this; --this; return tmp; } bool operator==(const modint& other) const { return x == other.x; } bool operator!=(const modint& other) const { return x != other.x; } template <class T> modint operator^(T arg) const { if (arg == 0) { return 1; } if (arg == 1) { return x; } auto t = this ^ (arg >> 1); t = t; if (arg & 1) { t = this; } return t; } template <class T> modint operator^=(T arg) { return this = this ^ arg; } }; const int MOD = 1051131; const int TOT = 700752; int m, s, n; long long t; valarray<modint<MOD> > a; valarray<modint<MOD> > em_inv_slow(int m, int n, const valarray<modint<MOD> >& a) { int k = 0; valarray<modint<MOD> > b(n); for (int i = 0; i < m; i++) { int w = 1 << (m - i - 1); int c = 1 << i; modint<MOD> mult = modint<MOD>(2) ^ (TOT - i - 1); for (int j = 0; j < w; j++) { modint<MOD> t = a[k] mult; b[slice(j + 0, c, 2 * w)] -= valarray<modint<MOD> >(t, c); b[slice(j + w, c, 2 * w)] += valarray<modint<MOD> >(t, c); k++; } } modint<MOD> t = (modint<MOD>(2) ^ (TOT - m)); b += a[n - 1] * t; return b; } void em_inv(int m, int n, valarray<modint<MOD> >& a) { int k = 0; valarray<long long> bll(n); for (int i = 0; i < m; i++) { const int w = 1 << (m - i - 1); long long mult = (int)(modint<MOD>(2) ^ (TOT - i - 1)); for (int j0 = 0; j0 < n; j0 += w + w) { for (int j = 0; j < w; j++) bll[j + j0] -= (int)a[k + j] * mult; for (int j = 0; j < w; j++) bll[j + j0 + w] += (int)a[k + j] * mult; } k += w; } modint<MOD> t = (modint<MOD>(2) ^ (TOT - m)) * a[n - 1]; for (int i = 0; i < n; i++) a[i] = bll[i]; a += t; } valarray<modint<MOD> > em_slow(int m, int n, const valarray<modint<MOD> >& a) { int k = 0; valarray<modint<MOD> > b(n); for (int i = 0; i < m; i++) { int w = 1 << (m - i - 1); int c = 1 << i; for (int j = 0; j < w; j++) { b[k] -= a[slice(j + 0, c, 2 * w)].sum(); b[k] += a[slice(j + w, c, 2 * w)].sum(); k++; } } b[k++] += a.sum(); return b; } valarray<modint<MOD> > em(int m, int n, const valarray<modint<MOD> >& a) { int k = 0; valarray<modint<MOD> > b(n); for (int i = 0; i < m; i++) { const int w = 1 << (m - i - 1); for (int j0 = 0; j0 < n; j0 += w + w) { for (int j = 0; j < w; j++) b[k + j] -= a[j + j0]; for (int j = 0; j < w; j++) b[k + j] += a[j + j0 + w]; } k += w; } b[k++] += a.sum(); return b; } valarray<modint<MOD> > eigenvals(int m, int n, long long t) { int k = 0; valarray<modint<MOD> > b(n); for (int i = 0; i < m; i++) { int w = 1 << (m - i - 1); modint<MOD> x = 1 + (i - 1) * (n / 2); b[slice(k, w, 1)] = x ^ t; k += w; } b[k++] = modint<MOD>(1 + (n / 2) * m) ^ t; return b; } void pr(const valarray<modint<MOD> >& a) { for (modint<MOD> x : a) cerr << (int)x << ; cerr << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); cerr.tie(nullptr); stopwatch sw(0); cin >> m >> t >> s; n = 1 << m; a.resize(n); for (int i = 0; i < s; i++) { int x; cin >> x; a[i] = x; } sw.tock(); for (int i = s; i < n; i++) a[i] = a[i - s] * 101 + 10007; sw.tock(); a = em(m, n, a); sw.tock(); { valarray<modint<MOD> > b = eigenvals(m, n, t); sw.tock(); for (int i = 0; i < n; i++) a[i] = a[i] * b[i]; sw.tock(); } em_inv(m, n, a); sw.tock(); int xr = 0; for (modint<MOD> x : a) xr ^= (int)x; sw.tock(); cout << xr << n ; }
#include <bits/stdc++.h> using namespace std; int main() { int T, money; cin >> T >> money; int n; int g; vector<int> lista; for (int i = 1; i <= T; i++) { cin >> n; int brk = 0; for (int j = 0; j < n; j++) { cin >> g; if (brk == 0 && money > g) { lista.push_back(i); brk = 1; } } } cout << lista.size() << endl; for (int i = 0; i < lista.size(); i++) { cout << lista[i] << ; } return 0; }
#include <bits/stdc++.h> #pragma GCC optimize(3, inline , Ofast ) using namespace std; int p[1010]; bool vis[1010]; void dfs(int pos) { if (vis[pos]) return (void)(printf( %d , pos)); else vis[pos] = 1, dfs(p[pos]); } int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &p[i]); for (int i = 1; i <= n; i++) memset(vis, 0, sizeof vis), dfs(i); }
#include <bits/stdc++.h> using namespace std; const int maxn = 100100; bool vis[maxn]; long long val[3][maxn]; long long mii[3]; vector<int> g[maxn]; vector<int> a; int ans[maxn]; int d[maxn]; void dfs(int now) { a.push_back(now); vis[now] = 1; for (int i = 0; i < g[now].size(); i++) { if (vis[g[now][i]]) continue; dfs(g[now][i]); } } int main() { int n; scanf( %d , &n); for (int j = 0; j < 3; j++) { for (int i = 1; i <= n; i++) { scanf( %d , &val[j][i]); } } for (int i = 0; i < n - 1; i++) { int f, t; scanf( %d%d , &f, &t); g[f].push_back(t); g[t].push_back(f); d[f]++; d[t]++; if (d[f] > 2 \|\| d[t] > 2) { printf( -1 n ); return 0; } } vector<int> temp; temp.push_back(0); temp.push_back(1); temp.push_back(2); for (int i = 1; i <= n; i++) { if (d[i] == 1) { dfs(i); break; } } long long mi = 1ll << 60; for (int _ = 0; _ < 6; _++) { long long now = 0; for (int i = 0; i < n; i++) { now += val[temp[i % 3]][a[i]]; } if (now < mi) { mi = now; for (int j = 0; j < 3; j++) { mii[j] = temp[j]; } } next_permutation(temp.begin(), temp.end()); } printf( %lld n , mi); for (int i = 0; i < n; i++) { ans[a[i]] = mii[i % 3]; } for (int i = 1; i <= n; i++) { printf( %d , ans[i] + 1); } puts( ); return 0; }
#include <bits/stdc++.h> using namespace std; int dp[510][510]; long long MOD; vector<string> v; long long nc2(long long num) { return (num * (num - 1)) / 2; } int recur(int ones, int zeros) { if (ones == 0 and zeros == 0) return 1; if (dp[ones][zeros] != -1) { return dp[ones][zeros] % MOD; } long long ret = 0; if (ones > 1) { ret = (ret + ((recur(ones - 2, zeros) * nc2(ones)) % MOD)) % MOD; } if (zeros > 1) { ret = (ret + ((recur(ones + 2, zeros - 2) * nc2(zeros)) % MOD)) % MOD; } if (ones >= 1 && zeros >= 1) { ret = (ret + ((recur(ones, zeros - 1) * ((ones * zeros) % MOD)) % MOD)) % MOD; } dp[ones][zeros] = ret % MOD; return dp[ones][zeros]; } int solve(int n, int m) { int ones = 0; int zeros = 0; for (int i = 0; i < n; i++) { int cnt = 0; for (int j = 0; j < m; j++) { if (v[j][i] == 1 ) cnt++; } if (cnt == 1) ones++; if (cnt == 0) zeros++; } memset(dp, -1, sizeof(dp)); int res = recur(ones, zeros); return res; } int main() { int n, m; cin >> n >> m >> MOD; string line = ; for (int i = 0; i < m; i++) { cin >> line; v.push_back(line); } int res = solve(n, m); cout << res << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 10; inline int read() { char ch = getchar(); int x = 0, f = 1; while (ch < 0 \|\| ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = (x << 1) + (x << 3) - 0 + ch; ch = getchar(); } return x * f; } int n, k, size[N]; long long ans, f[N][5]; vector<int> g[N]; void dfs(int u, int fa, int d) { size[u] = 1; f[u][d % k] = 1; for (auto &v : g[u]) { if (v == fa) continue; dfs(v, u, d + 1); size[u] += size[v]; ans += 1ll * (n - size[v]) * size[v]; for (int i = 0; i < k; i++) { for (int j = 0; j < k; j++) { int z = ((i + j - 2 * d) % k + k) % k; z = (k - z) % k; ans += 1ll * z * f[u][i] * f[v][j]; } } for (int i = 0; i < k; i++) f[u][i] += f[v][i]; } } int main() { n = read(), k = read(); for (int i = 1; i <= n - 1; i++) { int a = read(), b = read(); g[a].push_back(b); g[b].push_back(a); } dfs(1, 0, 0); printf( %lld n , ans / k); }
#include <bits/stdc++.h> using namespace std; int main(void) { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; string a[n], b[n]; map<string, int> m; for (int i = 0; i < n; ++i) { cin >> a[i]; ++m[a[i]]; } for (int i = 0; i < n; ++i) { cin >> b[i]; --m[b[i]]; } int ans = 0; vector<string> v = { XXXL , XXXS , XXL , XXS , XL , XS , S , L , M }; ans = (abs(m[ XXXL ]) + abs(m[ XXXS ])) / 2; ans += (abs(m[ XXL ]) + abs(m[ XXS ])) / 2; ans += (abs(m[ XL ]) + abs(m[ XS ])) / 2; ans += (abs(m[ S ]) + abs(m[ L ]) + abs(m[ M ])) / 2; cout << ans; }
#include <bits/stdc++.h> using namespace std; long long n, q, ans[50005], sum[50005], a[50005], p[50005], x[50005], cont, pos, us[50005]; int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n >> q; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 2; i <= n; i++) cin >> p[i]; for (int i = 0; i < q; i++) cin >> x[i]; for (int i = 1; i <= n; i++) { pos = i; cont = 1; while (pos != 1) { us[pos] = cont; cont++; pos = p[pos]; } us[pos] = cont; for (int j = 0; j < q; j++) { sum[j] += us[x[j]]; if (us[x[j]]) { ans[j]++; j += a[i] - 1; } } pos = i; cont = 1; while (pos != 1) { us[pos] = 0; cont++; pos = p[pos]; } us[pos] = 0; } for (int i = 0; i < q; i++) cout << sum[i] - ans[i] << << ans[i] << n ; return 0; }
#include <bits/stdc++.h> using namespace std; string S, T; int n, m; int nxt[200005][30]; unsigned long long hashS[200005][30], hashT[200005][30], bpw[200005]; unsigned long long ht; int base = 10007; int f[30]; vector<int> ans; bool chk(int p) { memset(f, 0, sizeof(f)); int ps, pt; unsigned long long hps, hpt, temp = 0; for (int j = 1; j <= 26; j++) { if (nxt[p][j] > p + m - 1) continue; ps = j; pt = T[(nxt[p][j] - p) + 1] - a + 1; if (f[ps] == pt) continue; else if (f[ps] && f[ps] != pt) return 0; else { f[ps] = pt; f[pt] = ps; hps = hashS[p + m - 1][ps] - bpw[m] * hashS[p - 1][ps]; hpt = hashT[m][pt]; if (hps != hpt \|\| hashS[p + m - 1][pt] - bpw[m] * hashS[p - 1][pt] != hashT[m][ps]) { return 0; } temp += hps * pt; if (ps != pt) temp += ps * hashT[m][ps]; } } return temp == ht; } int main() { scanf( %d%d , &n, &m); cin >> S >> T; S = % + S; T = % + T; for (int i = 1; i <= m; i++) { ht = ht * base + T[i] - a + 1; } for (int i = 1; i <= 26; i++) { nxt[n + 1][i] = n + 1; } for (int i = n; i >= 1; i--) { for (int j = 1; j <= 26; j++) { if (S[i] == a + j - 1) nxt[i][j] = i; else nxt[i][j] = nxt[i + 1][j]; } } bpw[0] = 1; for (int i = 1; i <= n; i++) { bpw[i] = bpw[i - 1] * base; } for (int i = 1; i <= n; i++) { for (int j = 1; j <= 26; j++) { hashS[i][j] = hashS[i - 1][j] * base + (S[i] == ( a + j - 1) ? 1 : 0); } } for (int i = 1; i <= m; i++) { for (int j = 1; j <= 26; j++) { hashT[i][j] = hashT[i - 1][j] * base + (T[i] == ( a + j - 1) ? 1 : 0); } } for (int i = 1; i <= n - m + 1; i++) { if (chk(i)) ans.push_back(i); } cout << ans.size() << endl; for (int i = 0; i < ans.size(); i++) { printf( %d , ans[i]); } return 0; }
#include <bits/stdc++.h> int main() { int t, n; scanf( %d , &t); while (t--) { scanf( %d , &n); if (n == 1) { printf( -1 n ); } else { printf( 2 ); for (int i = 1; i < n; i++) { printf( 7 ); } printf( n ); } } }
#include <bits/stdc++.h> using namespace std; inline long long read() { long long x = 0, f = 1; char c = getchar(); while ((c < 0 \|\| c > 9 ) && (c != - )) c = getchar(); if (c == - ) f = -1, c = getchar(); while (c >= 0 && c <= 9 ) x = x * 10 + c - 0 , c = getchar(); return x * f; } const int N = 3e4 + 10; int n; vector<int> e[N]; int cnt, p[N], fa[N], vis[N]; bool flag[N]; inline void dfs(int u) { vis[u] = 1; for (auto v : e[u]) { if (v == fa[u]) continue; fa[v] = u; if (!vis[v]) dfs(v); else { for (int now = u; now != v; now = fa[now]) flag[p[++cnt] = now] = 1; flag[p[++cnt] = v] = 1; } if (cnt) break; } } long long f[N], g[N], siz[N]; inline void dfs(int u, int fa) { siz[u] = 1; for (auto v : e[u]) { if (v == fa \|\| flag[v]) continue; dfs(v, u), f[u] += g[v], siz[u] += siz[v]; } g[u] = f[u] + siz[u]; } long long dp[N], last[N], pre[N], ans; inline void dfs(int u, int fa, long long sum) { ans = max(ans, sum + n + f[u]); for (auto v : e[u]) if (v != fa) dfs(v, u, sum + n - siz[v] + f[u] - g[v]); } inline void solve() { long long sum = 0; for (register int i = (1); i <= (cnt * 2); i++) last[i] = siz[p[i]], pre[i] = pre[i - 1] + last[i], sum += f[p[i]]; for (register int i = (2); i <= (cnt - 1); i++) { for (register int l = (1); l <= (cnt * 2 - i + 1); l++) { int r = l + i - 1; long long tmp = pre[r] - pre[l - 1]; dp[l] = max(last[l] + tmp, last[l + 1] + tmp); } for (register int j = (1); j <= (cnt * 2 - i + 1); j++) last[j] = dp[j]; } ans = 0; for (register int i = (1); i <= (cnt); i++) { ans = max(ans, n + sum / 2 + dp[i + 1]); for (auto v : e[p[i]]) if (!flag[v]) dfs(v, p[i], n - siz[v] + sum / 2 - f[p[i]] + f[p[i]] - g[v] + dp[i + 1]); } printf( %lld n , ans); } int main() { n = read(); for (register int i = (1); i <= (n); i++) { int x = read() + 1, y = read() + 1; e[x].push_back(y), e[y].push_back(x); } dfs(1); for (register int i = (1); i <= (cnt); i++) dfs(p[i], 0); for (register int i = (1); i <= (cnt); i++) p[cnt + i] = p[i]; solve(); }
#include <bits/stdc++.h> using namespace std; long long inv_euclid(long long a, long long m = 998244353) { long long m0 = m; long long y = 0, x = 1; if (m == 1) return 0; while (a > 1) { long long q = a / m; long long t = m; m = a % m, a = t; t = y; y = x - q * y; x = t; } if (x < 0) x += m0; return x; } long long power(long long x, long long y, long long p) { long long 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; } long long max(long long a, long long b) { if (a > b) return a; return b; } long long min(long long a, long long b) { if (a < b) return a; return b; } long long ssum(long long n) { return (n * (n + 1)) / 2; } long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } long long lcm(long long a, long long b) { return (a * b) / (gcd(a, b)); } void solve() { long long n; cin >> n; vector<long long> v(n); for (long long i = 0; i < n; i++) cin >> v[i]; while (v.size() && v[v.size() - 1] == 0) v.pop_back(); reverse(v.begin(), v.end()); while (v.size() && v[v.size() - 1] == 0) v.pop_back(); long long ans = 0; for (auto i : v) ans += (i == 0); cout << ans << n ; } int main() { long long tttt; cin >> tttt; while (tttt--) { solve(); } }
#include <bits/stdc++.h> using namespace std; void solve() { long long n, m, k, i, j, count = 0, sum = 0, maxi = 0, mini = 1e18, flag = 0; cin >> n; vector<long long> res; vector<char> temp; string a, b; cin >> a >> b; if (a == b) { cout << 0 << n ; return; } if (n == 1 && a[0] != b[0]) { cout << 1 << << 1 << n ; return; } for (i = 0; i < n / 2; i++) { temp.push_back(a[i]); if (a[n - i - 1] == 1 ) temp.push_back( 0 ); else temp.push_back( 1 ); } if (n % 2) temp.push_back(a[n / 2]); i = 0; j = n - 1; while (j > 0) { if (temp[i] == b[j]) { res.push_back(0); res.push_back(j); } else res.push_back(j); j--; i++; } if (j == 0) { if (temp[i] == b[j]) ; else res.push_back(0); } cout << res.size() << ; for (i = 0; i < res.size(); i++) { cout << res[i] + 1 << ; } cout << n ; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long t = 1; cin >> t; while (t--) { solve(); } }
#include <bits/stdc++.h> using namespace std; const int maxn = 5005; int u[maxn], v[maxn], w[maxn], dp[maxn][maxn], parent[maxn][maxn], x[maxn]; int main() { int n, m, t, pos; cin >> n >> m >> t; for (int i = 0; i < m; i++) { cin >> u[i] >> v[i] >> w[i]; } memset(dp, 0x3f, sizeof(dp)); dp[1][1] = 0; for (int i = 2; i <= n; i++) { for (int j = 0; j < m; j++) { if (dp[i - 1][u[j]] + w[j] < dp[i][v[j]]) { dp[i][v[j]] = dp[i - 1][u[j]] + w[j]; parent[i][v[j]] = u[j]; } } if (dp[i][n] <= t) pos = i; } int id = n; for (int i = pos; i >= 1; i--) { x[i] = id; id = parent[i][id]; } cout << pos << endl; for (int i = 1; i <= pos; i++) cout << x[i] << ; return 0; }
#include <bits/stdc++.h> using namespace std; int k, n, m; const int dx[4] = {-1, 1, 0, 0}; const int dy[4] = {0, 0, -1, 1}; int bx, by, s, ansx[1000000], ansy[1000000]; bool g[510][510]; char ansc[1000000]; int dfs(int x, int y) { if (x > 0 && y > 0 && x <= n && y <= m && g[x][y] == 0) { g[x][y] = 1; s++; ansc[s] = B ; ansx[s] = x; ansy[s] = y; int nx, ny; for (int i = 0; i < 4; i++) { nx = x + dx[i]; ny = y + dy[i]; dfs(nx, ny); } if (bx != x \|\| by != y) { s++; ansc[s] = D ; ansx[s] = x; ansy[s] = y; s++; ansc[s] = R ; ansx[s] = x; ansy[s] = y; } } } int main() { cin >> n >> m; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { char c; cin >> c; if (c == # ) g[i][j] = true; } for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) if (!g[i][j]) bx = i, by = j, dfs(i, j); cout << s << endl; for (int i = 1; i <= s; i++) printf( %c %d %d n , ansc[i], ansx[i], ansy[i]); return 0; }
#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; int n, c1, c2; long long f[501]; long long c[501][501]; long long dp[501][501]; long long gao(int a, int b) { if (a == 0 && b == 0) { return 1; } if (dp[a][b] == -1) { long long& cur = dp[a][b] = 0; if (a > 0) { if (a >= 1) { for (int i = 0; i <= b; ++i) { cur = (cur + gao(a - 1, b - i) * c[b][i] % MOD * f[i]) % MOD; } } if (a >= 2) { for (int i = 0; i <= b; ++i) { cur = (cur + gao(a - 2, b - i) * c[b][i] % MOD * (a - 1) % MOD * f[i + 1]) % MOD; } } } else { for (int i = 0; i < b; ++i) { cur = (cur + gao(a, b - i - 1) * c[b - 1][i] % MOD * f[i]) % MOD; } } } return dp[a][b] % MOD; } int main() { for (int i = f[0] = 1; i <= 500; ++i) { f[i] = f[i - 1] * i % MOD; } for (int i = 0; i <= 500; ++i) { c[i][0] = c[i][i] = 1; for (int j = 1; j < i; ++j) { c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % MOD; } } c1 = c2 = 0; scanf( %d , &n); for (int i = 0; i < n; ++i) { int x; scanf( %d , &x); ++(x == 1 ? c1 : c2); } memset(dp, -1, sizeof(dp)); int res = gao(c1, c2) % MOD; printf( %d n , res); return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int a, b, c = 0; cin >> a >> b; int x[10] = {6, 2, 5, 5, 4, 5, 6, 3, 7, 6}; for (int i = a; i <= b; i++) { int y = i; while (y != 0) { c += x[y % 10]; y = y / 10; } } cout << c; return 0; }

#include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; using pll = pair<ll, ll>; using ld = long double; const int MN = 2e5 + 3, MOD = 1e9 + 7; void solve() { int n, a, b; scanf( %d %d %d , &n, &a, &b); if (a > b) swap(a, b); printf( %d %d n , min(n, max(1, a + b + 1 - n)), min(n, a + b - 1)); } int main() { int t; scanf( %d , &t); while (t--) solve(); return 0; }

#include <bits/stdc++.h> using namespace std; int dx[] = {1, 0, -1, 0}; int dy[] = {0, 1, 0, -1}; const int N = (int)2e5 + 7; const int MOD = (int)1e9 + 7; const int INF = (int)2e7; const long long BIG = 1e18; int a[N], b[N], c[N], d[N]; int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); ; int n, ans = 0; cin >> n; unordered_map<int, int> cnt; for (int i = 0; i < n; i++) cin >> a[i], cnt[a[i]]++; set<pair<int, int> > q; for (auto x : cnt) q.insert(make_pair(x.second, x.first)); while (int(q.size()) >= 3) { vector<pair<int, int> > del; auto it = q.end(); --it; b[ans] = it->second; del.push_back(*it); --it; c[ans] = it->second; del.push_back(*it); --it; d[ans] = it->second; del.push_back(*it); ++ans; for (auto x : del) { pair<int, int> w = x; q.erase(w); if (w.first != 1) q.insert(make_pair(w.first - 1, w.second)); } } cout << ans << n ; for (int i = 0; i < ans; i++) { vector<int> p = {b[i], c[i], d[i]}; sort(p.begin(), p.end()); cout << p[2] << << p[1] << << p[0] << n ; } return 0; }

#include <bits/stdc++.h> using namespace std; const int N = 151; int m, n; char gd[N][N]; inline int fab(int x) { return x > 0 ? x : -x; } int main() { while (scanf( %d%d , &m, &n) != -1) { for (int i = 0; i < m; i++) scanf( %s , gd[i]); int ans = 0, x = 0, y = 0; for (int i = 0; i < m; i++) for (int j = (i & 1 ? n - 1 : 0); 0 <= j && j < n; j += (i & 1 ? -1 : 1)) if (gd[i][j] == W ) { ans += fab(i - x) + fab(j - y); x = i; y = j; } printf( %d n , ans); } return 0; }

#include <bits/stdc++.h> using namespace std; long long g, r; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long n, m; cin >> n >> m; vector<int> d; for (int i = 0; i < m; i++) { long long dt; cin >> dt; d.push_back(dt); } sort(d.begin(), d.end()); cin >> g >> r; vector<vector<bool>> vis(m, vector<bool>(g + 1)); vector<vector<int>> dis(m, vector<int>(g + 1, 0)); deque<tuple<int, int>> dq; dq.push_back(make_tuple(0, 0)); long long ans = 1e9; vis[0][0] = 1; while (!dq.empty()) { int i, t; tie(i, t) = dq.front(); dq.pop_front(); if (t == 0) { int ttn = n - d[i]; if (ttn <= g) { ans = min(ans, dis[i][t] * (r + g) + ttn); } } if (t == g) { if (!vis[i][0]) { dq.push_back(make_tuple(i, 0)); dis[i][0] = dis[i][t] + 1; vis[i][0] = 1; } continue; } if (i) { int rs = t + d[i] - d[i - 1]; if (rs <= g && !vis[i - 1][rs]) { dis[i - 1][rs] = dis[i][t]; dq.push_front(make_tuple(i - 1, rs)); vis[i - 1][rs] = 1; } } if (i < m - 1) { int rs = t + d[i + 1] - d[i]; if (rs <= g && !vis[i + 1][rs]) { dis[i + 1][rs] = dis[i][t]; dq.push_front(make_tuple(i + 1, rs)); vis[i + 1][rs] = 1; } } } if (ans == 1e9) { cout << -1 << n ; } else { cout << ans << n ; } }

#include <bits/stdc++.h> using namespace std; void no(int ex = -1) { cout << ex << n ; } void win(bool bl) { if (bl) cout << YES ; else cout << NO ; cout << n ; } const int N = 2 * 100000; const int mod = 998244353; double T, n, m, k, p, res, pr; bool bw; string str; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> T; while (T--) { cin >> n; cin >> pr; bw = false; for (int i = 1; i < n; i++) { cin >> k; if (abs(k - pr) >= 2) { bw = true; p = i; } pr = k; } if (bw) cout << YES << n << p << << p + 1 << n ; else cout << NO << n ; } }

#include <bits/stdc++.h> using namespace std; const int M = 1000000007; const int MM = 998244353; const long double PI = acos(-1); long long power(long long b, long long e, long long m) { if (e == 0) return 1; if (e & 1) return b * power(b * b % m, e / 2, m) % m; return power(b * b % m, e / 2, m); } long long power(long long b, long long e) { if (e == 0) return 1; if (e & 1) return b * power(b * b, e / 2); return power(b * b, e / 2); } template <typename T, typename U> static inline void amin(T &x, U y) { if (y < x) x = y; } template <typename T, typename U> static inline void amax(T &x, U y) { if (x < y) x = y; } template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &p) { return os << ( << p.first << , << p.second << ) ; } template <typename T> struct fenwick { vector<T> bit; int n; void build(int n_) { n = n_; bit.resize(n + 1); for (int i = 1; i <= n; ++i) bit[i] = T(0); } void update(int pos, T val) { for (; pos <= n; pos += pos & -pos) bit[pos] = (bit[pos] + val) % M; } T get(int r) { T x{}; for (; r; r -= r & -r) x = (x + bit[r]) % M; return x; } T query(int l, int r) { return (get(r) - get(l - 1) + M) % M; } }; fenwick<long long> fenw1, fenw2; const int N = 5e5 + 5; int b[N]; long long a[N]; int _runtimeTerror_() { int n; cin >> n; for (int i = 1; i <= n; ++i) cin >> a[i], b[i] = i; sort(b + 1, b + 1 + n, [&](int x, int y) { return a[x] < a[y]; }); long long ans = 0; fenw1.build(n); fenw2.build(n); for (int i = 1; i <= n; ++i) { fenw1.update(b[i], b[i]); fenw2.update(b[i], n - b[i] + 1); long long u = 1LL * (fenw1.get(b[i])) * (n - b[i] + 1) % M; u += 1LL * b[i] * (fenw2.query(b[i] + 1, n)) % M; u %= M; ans += a[b[i]] * 1LL * u % M; ans %= M; } cout << ans << n ; return 0; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int TESTS = 1; while (TESTS--) _runtimeTerror_(); return 0; }

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; const int M = 1e9 + 7; const int INF = 2e9 + 5; const int rx[8] = {-1, 0, 1, 0, 1, 1, -1, -1}; const int ry[8] = {0, -1, 0, 1, 1, -1, 1, -1}; mt19937 gen(chrono::high_resolution_clock::now().time_since_epoch().count()); int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector<pair<long long, long long> > a(n); long long sumx = 0; long long sumy = 0; for (int i = 0; i < n; i++) { cin >> a[i].first >> a[i].second; sumx += a[i].first; sumy += a[i].second; } long long res = 0; for (int i = 0; i < n; i++) { res += (n - 1) * a[i].first * a[i].first - a[i].first * (sumx - a[i].first); res += (n - 1) * a[i].second * a[i].second - a[i].second * (sumy - a[i].second); } cout << res; return 0; }

#include <bits/stdc++.h> using namespace std; vector<vector<int>> g; vector<int> a; int n; vector<map<int, int>> dp; int ans = 0; int gcd(int a, int b) { while (b) { a %= b; swap(a, b); } return a; } void dfs(int v, int p = -1) { for (auto to : g[v]) { if (to != p) { dfs(to, v); if (gcd(a[v], a[to]) != 1) { for (auto i : dp[to]) { int y = gcd(a[v], i.first); if (y != 1) { for (auto c : dp[v]) if (gcd(c.first, i.first) != 1) ans = max(ans, i.second + c.second); } } for (auto i : dp[to]) { int y = gcd(a[v], i.first); if (y != 1) { dp[v][y] = max(dp[v][y], i.second + 1); ans = max(ans, i.second + 1); } } } } } } signed main() { std::ios_base::sync_with_stdio(0), cin.tie(0); cin >> n; g.resize(n); a.resize(n); for (int i = 0; i < n; ++i) { cin >> a[i]; } dp.resize(n); for (int i = 0; i < n - 1; ++i) { int x, y; cin >> x >> y; x--, y--; g[x].push_back(y); g[y].push_back(x); } for (int i = 0; i < n; ++i) { if (a[i] != 1) { ans = 1; dp[i][a[i]] = 1; } } if (!ans) { cout << 0; return 0; } dfs(0); cout << ans; return 0; }

#include <bits/stdc++.h> using namespace std; const int N = 1000010; const int md = 1e9 + 7; int mul(int a, int b) { return (long long)a * b % md; } char s[N]; int n, m, nn, x[N], z[N]; bool start[N]; int main() { scanf( %d %d %s , &n, &m, s); nn = strlen(s); for (int i = 0; i < m; i++) { scanf( %d , &x[i]); x[i]--; start[x[i]] = true; } for (int i = 1, l = -1, r = -1; i < nn; i++) { int &k = z[i]; if (i < r) { k = min(r - i, z[i - l]); } for (; i + k < nn && s[k] == s[i + k]; k++) ; if (i + k > r) { l = i; r = i + k; } } for (int i = 0; i < m - 1; i++) { int p = x[i + 1] - x[i]; if (p + z[p] < nn) { puts( 0 ); return 0; } } int ans = 1; int r = -1; for (int i = 0; i < n; i++) { if (start[i]) { r = i + nn; } if (i >= r) { ans = mul(ans, 26); } } printf( %d n , ans); return 0; }

#include <bits/stdc++.h> using namespace std; void solve() { long long int s; cin >> s; long long int tot = 0; while (s >= 10) { tot += s / 10 * 10; s = s / 10 + s % 10; } cout << tot + s << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t = 1; cin >> t; while (t--) { solve(); } }

#include <bits/stdc++.h> using namespace std; const long long MOD = 998244353; const long long EPS = 1e-9; long long mpow(long long a, long long b, long long p = MOD) { a = a % p; long long res = 1; while (b > 0) { if (b & 1) res = (res * a) % p; a = (a * a) % p; b = b >> 1; } return res % p; } const long long N = 1e6 + 5; long long dp[N]; long long fac[N]; long long ncm(long long n, long long m) { if (m > n) return 0; long long ans = fac[n]; ans = (ans * mpow(fac[m], MOD - 2)) % MOD; ans = (ans * mpow(fac[n - m], MOD - 2)) % MOD; return ans; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); fac[0] = 1; for (long long i = 1; i < N; i++) { fac[i] = (i * fac[i - 1]) % MOD; } long long n; cin >> n; long long a[n]; for (long long i = 0; i < n; i++) cin >> a[i]; dp[n] = 1; long long ans = 0; for (long long i = n - 1; i >= 0; i--) { dp[i] = dp[i + 1]; if (a[i] <= 0) continue; for (long long j = i + 1; j < n; j++) { if (j - i < a[i]) continue; long long rem = a[i] - 1; long long oo = j - i - 1; long long c = ncm(oo, rem) * dp[j + 1]; ans += c; ans %= MOD; dp[i] += c; dp[i] %= MOD; } } cout << ans; }

#include <bits/stdc++.h> using namespace std; template <class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } template <class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } const long long MOD = (long long)(1e9) + 7; long long getVal(pair<pair<int, int>, long long> p) { return (p.second * (p.first.second - p.first.first + 1)) % MOD; } void pr(stack<pair<pair<int, int>, long long>> st) { cout << st.top().first.first << << st.top().first.second << << st.top().second << n ; st.pop(); if (!st.empty()) pr(st); } int main() { ios::sync_with_stdio(0); cin.tie(0); string second; cin >> second; vector<int> v; int cur = 0; for (int i = 0; i < (int)second.size(); i++) { if (second[i] == 1 ) { v.push_back(cur); cur = 0; } else { cur++; } } if ((int)v.size() == 0) { return cout << (int)second.size() << n , 0; ; } long long factor = ((long long)(v[0] + 1) * (cur + 1)) % MOD; v.erase(v.begin()); stack<pair<pair<int, int>, long long>> st; long long cursum = 0; for (int i = 0; i < (int)v.size(); i++) { long long ori = cursum; while (!st.empty()) { if (v[i] >= st.top().first.first) { cursum -= getVal(st.top()); cursum %= MOD; cursum += MOD; cursum %= MOD; if (v[i] < st.top().first.second) { st.top().first.first = v[i] + 1; cursum += getVal(st.top()); cursum %= MOD; break; } else { st.pop(); } } else { break; } } st.push(make_pair(make_pair(0, v[i]), (ori + 1) % MOD)); cursum += getVal(st.top()); cursum %= MOD; } cursum++; cursum %= MOD; long long res = (factor * cursum) % MOD; return cout << res << n , 0; ; }

#include <bits/stdc++.h> using namespace std; long long M = 1e15 + 37; const long long N = 1000 + 10; const long long IM = 1e18; const long long PI = 3.14159265; void PV(vector<long long> v) { for (long long i = 0; i < v.size(); i++) cout << v[i] << ; cout << n ; } void PA(long long v[], long long n, long long x = 0) { for (long long i = x; i < n + x; i++) cout << v[i] << ; cout << n ; } void IN(long long a[], long long n, long long x = 0) { for (long long i = x; i < n + x; i++) cin >> a[i]; } inline void PTN(long long n = 1, long long a = 0, long long b = 0, long long c = 0) { if (n--) cout << a << ; if (n--) cout << b << ; if (n--) cout << c << ; cout << n ; } inline void op() {} signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); op(); long long i, j, x, y, u, l; long long tt = 1; { i = j = x = y = u = l = 0; string s; cin >> s; l = s.size(); for (i = 0; i < l; i++) { char c; if (i && s[i] == s[i - 1]) { for (c = a ; c <= z ; c++) { if (c != s[i]) { if (i < l) { if (c != s[i + 1]) { s[i] = c; break; } } } } } } cout << s << n ; } return 0; }

#include <bits/stdc++.h> int dp[1000 + 1][3]; int v[1000 + 1]; inline int getmin(int a, int b) { if (a < b) return a; return b; } int main() { int n, i; scanf( %d , &n); for (i = 1; i <= n; i++) scanf( %d , &v[i]); dp[1][0] = 1; if (v[1] % 2 == 1) dp[1][1] = 0; else dp[1][1] = n; if (v[1] >= 2) dp[1][2] = 0; else dp[1][2] = n; for (i = 2; i <= n; i++) { dp[i][0] = getmin(dp[i - 1][0], getmin(dp[i - 1][1], dp[i - 1][2])) + 1; if (v[i] % 2 == 1) dp[i][1] = getmin(dp[i - 1][0], dp[i - 1][2]); else dp[i][1] = n; if (v[i] >= 2) dp[i][2] = getmin(dp[i - 1][0], dp[i - 1][1]); else dp[i][2] = n; } printf( %d , getmin(dp[n][0], getmin(dp[n][1], dp[n][2]))); return 0; }

#include <bits/stdc++.h> using namespace std; template <typename T, typename U> static inline void amn(T &x, U y) { if (y < x) x = y; } template <typename T, typename U> static inline void amx(T &x, U y) { if (x < y) x = y; } const long long MOD = 1e9 + 7; const long long INF = 1e18; const long long N = 5e5 + 5; long long top(long long x, long long y) { long long f = x / y; if (x % y) f++; return f; } bool cmp(pair<long long, long long> &a, pair<long long, long long> &b) { return a.first < b.first; } void solve() { long long n, m, x; cin >> n >> m >> x; vector<pair<long long, long long> > v; for (long long i = 1; i <= n; i++) { v.push_back({0, i}); } long long sa = top(n, m), sb = n / m; long long A = (n % m) * sa; for (long long i = 1; i <= x; i++) { for (long long j = 0; j < A; j++) { v[j].first++; } for (long long j = 0; j < A; j += sa) { cout << sa; for (long long k = j; k < j + sa; k++) { cout << << v[k].second; } cout << endl; } for (long long j = A; j < n; j += sb) { cout << sb; for (long long k = j; k < j + sb; k++) { cout << << v[k].second; } cout << endl; } sort(v.begin(), v.end(), cmp); } cout << endl; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long test_case = 1; cin >> test_case; while (test_case--) { solve(); } return 0; }

#include <bits/stdc++.h> using namespace std; int binarySearch(int a[], int l, int r, int x); int main() { int n, m, i, temp; vector<int> v1; vector<int> v2; scanf( %d %d , &n, &m); for (i = 0; i < n; i++) { scanf( %d , &temp); v1.push_back(temp); } for (i = 0; i < m; i++) { scanf( %d , &temp); v2.push_back(temp); } for (i = 0; i < n; i++) { if (find(v2.begin(), v2.end(), v1[i]) != v2.end()) { printf( %d , v1[i]); } } printf( n ); return 0; }

#include <bits/stdc++.h> using namespace std; const int MAX = 2e4 + 3; const long long MOD = 998244353; int a[MAX]; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, k; cin >> n >> k; int s = 2 * n, mid = n, one = 0, left = 0; for (int i = 1; i <= k; i++) { cin >> a[i]; if (a[i] % 2) { a[i]--; left++; } } for (int i = 1; i <= k; i++) { if (a[i] >= 4) { int need = a[i] / 4; if (mid <= need) { a[i] -= mid * 4; mid = 0; } else { a[i] %= 4; mid -= need; } } } if (mid == 0) { for (int i = 1; i <= k; i++) s -= a[i] / 2; s -= left; if (s >= 0) cout << YES ; else cout << NO ; return 0; } for (int i = 1; i <= k; i++) { if (a[i] == 2) { if (s) { s--; continue; } if (mid) { mid--; left--; continue; } left += 2; } } if (s + mid * 2 >= left) cout << YES ; else cout << NO ; }

#include <bits/stdc++.h> using namespace std; int main() { int n, a[200005]; scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d , &a[i]); int s, t, m = 0; for (s = 0; s < n;) { t = s + 1; while (a[t] <= a[t - 1] * 2 && t < n) t++; int res = t - s; m = max(m, res); s = t; } printf( %d , m); return 0; }

#include <bits/stdc++.h> using namespace std; int cmp(string s1, string s2) { if (s1 == rock && s2 == scissors ) return 1; if (s1 == scissors && s2 == paper ) return 1; if (s1 == paper && s2 == rock ) return 1; return 0; } int main() { string s1, s2, s3; cin >> s1 >> s2 >> s3; if (cmp(s1, s2) && cmp(s1, s3)) { putchar( F ); return 0; } if (cmp(s2, s1) && cmp(s2, s3)) { putchar( M ); return 0; } if (cmp(s3, s1) && cmp(s3, s2)) { putchar( S ); return 0; } putchar( ? ); }

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 7; const long long mod = 1e9 + 7; long long mpow(long long a, long long b) { long long res = 1; while (b) { if (b % 2 == 1) { res = res * a; } b = b / 2; a = a * a; } return res; } long long pow1(long long a, long long b) { long long res = 1; while (b) { if (b % 2 == 1) res = res * a % mod; b = b / 2; a = a * a % mod; } return res; } int main() { long long k; cin >> k; long long b = 1; b = mpow(2LL, k - 1) - 1 + mpow(2, k) - 1 - (mpow(2, k - 1)); long long ans = pow1(4, b); ans = ans * 6 % mod; cout << ans << endl; return 0; }

#include <bits/stdc++.h> using namespace std; template <class T> long long ToInt(const T &x) { stringstream s; s << x; long long r; s >> r; return r; } template <class T> string ToString(const T &x) { stringstream s; s << x; return s.str(); } int main() { string str, str2; cin >> str; if (str.length() == 1) return cout << 1 << endl, 0; long long N = str[0] - 0 ; N++; for (int i = 1; i < str.length(); i++) str2 += 0 ; string temp = ToString(N); str2 = temp + str2; printf( %lld n , ToInt(str2) - ToInt(str)); }

#include <bits/stdc++.h> using namespace std; int a, b, c, d, e, f, g, h, i, j, k; int father[100005][20]; vector<int> tree[100005]; int deep[100005]; int que[100005], num[100005]; int K; int an; void soso(int x) { int ii, jj, kk; que[++que[0]] = x; deep[x] = deep[father[x][0]] + 1; for (ii = 0; ii < tree[x].size(); ii++) { jj = tree[x][ii]; if (jj == father[x][0]) continue; father[jj][0] = x; soso(jj); } } void Build_LCA() { int ii, jj, kk; for (jj = 1; jj <= 19; jj++) for (ii = 1; ii <= a; ii++) father[ii][jj] = father[father[ii][jj - 1]][jj - 1]; } int LCA(int x, int y) { int ii, jj, kk; if (deep[x] < deep[y]) swap(x, y); for (ii = 18; ii >= 0; ii--) if (deep[father[x][ii]] >= deep[y]) x = father[x][ii]; if (x == y) return x; for (ii = 18; ii >= 0; ii--) if (father[x][ii] != father[y][ii]) x = father[x][ii], y = father[y][ii]; return father[x][0]; } int Dis(int x, int y) { int u = LCA(x, y); return deep[x] + deep[y] - 2 * deep[u]; } int Add(set<pair<int, int> >& E, int x, int vv) { int R = 0; set<pair<int, int> >::iterator now; if (vv == 1) E.insert(make_pair(num[x], x)); now = E.find(make_pair(num[x], x)); set<pair<int, int> >::iterator now1 = now; set<pair<int, int> >::iterator pre, next; if (now != E.begin()) { pre = --now; R += Dis((*pre).second, x); } now = now1; next = ++now; if (next != E.end()) { R += Dis((*next).second, x); } now = now1; if (now != E.begin() && next != E.end()) R -= Dis((*pre).second, (*next).second); if (vv == -1) E.erase(now); return R * vv; } bool Check(int x) { int ii, jj, kk; int now = 0; set<pair<int, int> > GG; for (ii = 1; ii <= x - 1; ii++) now += Add(GG, ii, 1); for (ii = x; ii <= a; ii++) { now += Add(GG, ii, 1); set<pair<int, int> >::iterator in = GG.end(); in--; int tmp = Dis((*GG.begin()).second, (*in).second); if (now + tmp <= (K << 1)) return true; now += Add(GG, ii - x + 1, -1); } return false; } int main() { cin >> a >> K; K--; for (i = 1; i < a; i++) { cin >> c >> d; tree[c].push_back(d); tree[d].push_back(c); } soso(1); Build_LCA(); for (i = 1; i <= a; i++) num[que[i]] = i; int low = 1, high = a, mid; while (low <= high) { mid = (low + high) >> 1; if (Check(mid)) { an = max(an, mid); low = mid + 1; } else high = mid - 1; } cout << an << endl; return 0; }

#include <bits/stdc++.h> using namespace std; long long int a[505], b[505]; void solve() { long long int n; cin >> n; for (long long int i = 1; i <= n; i++) cin >> a[i]; for (long long int i = 1; i <= n; i++) cin >> b[i]; long long int x = (n + 1) / 2; if (n % 2 == 1 && a[x] != b[x]) { cout << No n ; return; } multiset<pair<long long int, long long int> > m; if (n % 2) { for (long long int i = 1; i < x; i++) m.insert({a[x + i], a[x - i]}); for (long long int i = 1; i < x; i++) { pair<long long int, long long int> p = {b[x + i], b[x - i]}; if (m.find(p) != m.end()) { m.erase(m.find(p)); continue; } swap(p.first, p.second); if (m.find(p) != m.end()) { m.erase(m.find(p)); continue; } cout << No n ; return; } } else { for (long long int i = 0; i < x; i++) m.insert({a[x - i], a[x + i + 1]}); for (long long int i = 0; i < x; i++) { pair<long long int, long long int> p = {b[x - i], b[x + i + 1]}; if (m.find(p) != m.end()) { m.erase(m.find(p)); continue; } swap(p.first, p.second); if (m.find(p) != m.end()) { m.erase(m.find(p)); continue; } cout << No n ; return; } } cout << Yes n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int qc; cin >> qc; for (long long int i = 1; i <= qc; i++) solve(); }

#include <bits/stdc++.h> #define ll long long #define f(n) for(ll i=0;i<n;i++) #define mod 998244353 #define vl vector<ll> #define pb push_back #define mk make_pair #define forn(i, n) for (int i = 0; i < int(n); i++) #define nl n #define IOS ios_base::sync_with_stdio(false); #include <iostream> using namespace std; void solve() { ll n; cin>>n; ll a[n]; for(ll i=0;i<n;i++) { cin>>a[i]; } sort(a,a+n); ll v=0,s=0; for(int i=2;i<n;i++) { s+=a[i-2]; v-=(a[i]*(i-1)); v+=s; } cout<<v<<endl; } void init_code() { #ifndef ONLINE_JUDGE freopen( input.txt , r , stdin); freopen( output.txt , w , stdout); #endif } int main() { init_code(); IOS cin.tie(NULL); cout.tie(NULL); ll t; cin>>t; //t=1; while(t--) { solve(); } return 0; }

#include <bits/stdc++.h> using namespace std; using ll = long long int; typedef vector<ll> vi; typedef vector<vi> vvi; typedef pair<ll,ll> ii; typedef vector<ii> vii; typedef vector<vii> vvii; #define F first #define S second ll min(ll x, ll y){ return ((x < y) ? x : y); } ll max(ll x, ll y){ return ((x > y) ? x : y); } const ll INF = 1e18; double findavg (ll x, ll itr){ ll sum = 0; for (ll i = 0; itr > i; i++){ ll mvs = 0; ll cur = 0; while (x > cur){ ll rd = rand()%2; if (rd){ cur++; }else cur = 0; mvs++; } cout << mvs << endl; sum += mvs; } double ans = (double)sum/(double)itr; cout << x: << x << << itr: << itr << endl; cout << ans << endl; return ans; } int main(){ ll t; cin >> t; while (t--){ ll k; cin >> k; if (k%2 == 1){ cout << -1 n ; continue; } vi v; for (ll i = 1; 63 > i; i++){ ll bm = 1; bm <<= i; if (k & bm){ v.push_back(1); for (ll j = 0; i > j+1; j++){ if (j) v.push_back(0); else v.push_back(1); } } } cout << v.size() << endl; for (auto i: v) cout << i << ; cout << endl; } }

#include <bits/stdc++.h> using namespace std; int main() { long long n, a, b, c; cin >> n >> a >> b >> c; long long x = n % 4; long long y = 4 - x; if (n % 4 == 0) cout << 0 << n ; else { if (y == 1) { cout << min(min(a, b + c), 3 * c) << n ; } else if (y == 2) { cout << min(min(2 * a, 2 * c), b) << n ; } else if (y == 3) { cout << min(min(c, 3 * a), b + a) << n ; } } }

#include <bits/stdc++.h> using namespace std; struct debugger { template <typename T> debugger& operator,(const T& v) { cerr << v << ; return *this; } } dbg; inline long long gcd(long long a, long long b) { a = ((a) < 0 ? -(a) : (a)); b = ((b) < 0 ? -(b) : (b)); while (b) { a = a % b; swap(a, b); } return a; } long long ext_gcd(long long A, long long B, long long* X, long long* Y) { long long x2, y2, x1, y1, x, y, r2, r1, q, r; x2 = 1; y2 = 0; x1 = 0; y1 = 1; for (r2 = A, r1 = B; r1 != 0; r2 = r1, r1 = r, x2 = x1, y2 = y1, x1 = x, y1 = y) { q = r2 / r1; r = r2 % r1; x = x2 - (q * x1); y = y2 - (q * y1); } *X = x2; *Y = y2; return r2; } inline long long modInv(long long a, long long m) { long long x, y; ext_gcd(a, m, &x, &y); x %= m; if (x < 0) x += m; return x; } inline long long bigmod(long long a, long long p, long long m) { long long res = 1 % m, x = a % m; while (p) { if (p & 1) res = (res * x) % m; x = (x * x) % m; p >>= 1; } return res; } int dir4[4][2] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}}; const long long inf = 100000000000000LL; const long long mod = 1000000007; const double pi = 2 * acos(0.0); const double eps = 1e-11; const int Size = 300505; int N; int Map[105]; int A[105]; vector<int> POS[105]; vector<int> G1, GX, G2; vector<int> mset1, mset2; char res[105]; bool solve() { int cnt1 = 0, cntx = 0; for (long long s = (1); s <= (100); ++s) { if (Map[s] == 1) { cnt1++; G1.push_back(s); } else if (Map[s] == 2) { G2.push_back(s); } else if (Map[s] > 2) { cntx++; GX.push_back(s); } } for (long long i = (0); i <= (cnt1 / 2 - 1); ++i) { int v = G1.back(); mset1.push_back(POS[v][0]); G1.pop_back(); } for (long long i = (0); i <= (cnt1 / 2 - 1); ++i) { int v = G1.back(); mset2.push_back(POS[v][0]); G1.pop_back(); } if (cnt1 % 2 == 1) { int v = G1.back(); mset1.push_back(POS[v][0]); G1.pop_back(); if (cntx == 0) return false; int xx = GX.back(); GX.pop_back(); mset2.push_back(POS[xx][0]); for (long long i = (1); i <= (((long long)(POS[xx]).size()) - 1); ++i) { mset1.push_back(POS[xx][i]); } } for (long long i = (0); i <= (((long long)(G2).size()) - 1); ++i) { int v = G2[i]; for (long long j = (0); j <= (((long long)(POS[v]).size()) - 1); ++j) { mset1.push_back(POS[v][j]); } } for (long long i = (0); i <= (((long long)(GX).size()) - 1); ++i) { int v = GX[i]; for (long long j = (0); j <= (((long long)(POS[v]).size()) - 1); ++j) { mset1.push_back(POS[v][j]); } } for (long long i = (0); i <= (((long long)(mset1).size()) - 1); ++i) { int p = mset1[i]; res[p] = A ; } for (long long i = (0); i <= (((long long)(mset2).size()) - 1); ++i) { int p = mset2[i]; res[p] = B ; } if (((long long)(mset1).size()) + ((long long)(mset2).size()) != N) return false; res[N] = 0 ; printf( YES n ); printf( %s n , res); return true; } int main() { scanf( %d , &N); for (long long i = (0); i <= (N - 1); ++i) { scanf( %d , &A[i]); Map[A[i]]++; POS[A[i]].push_back(i); } if (!solve()) { printf( NO n ); } return 0; }

#include <bits/stdc++.h> using namespace std; long long mod = 1000000007; long long fin(long long a, long long b) { long long ans = 1; a %= mod; while (b) { if (b % 2 == 1) { ans = (ans * a) % mod; } a = (a * a) % mod; b = b / 2; } return ans; } int main() { long long x, k; cin >> x >> k; if (x == 0) cout << 0 n ; else { x %= mod; cout << (((2 * x - 1) * fin(2, k) + mod) % mod + 1 + mod) % mod << n ; } return 0; }

#include <bits/stdc++.h> using namespace std; int main(){ ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); //freopen( input.txt , r ,stdin); //freopen( output.txt , w ,stdout); int T; cin>>T; for(int t=0;t<T;t++){ int n,k; cin>>n>>k; if(n==1&&k==1){cout<<0<<endl;continue;} if(k<=3){ if(k==2){ int m=n-1; cout<<m<<endl; cout<<1<< ; for(int i=3;i<=n;i++) cout<<i<< ; cout<<endl; }else{ if(k==1){ cout<<n-1<<endl; for(int i=2;i<=n;i++) cout<<i<< ; cout<<endl; } else{ cout<<n-2<<endl; cout<<1<< ; for(int i=4;i<=n;i++) cout<<i<< ; cout<<endl; } } }else{ if(k%2==0){ int m=n-k/2; cout<<m<<endl; for(int i=k/2;i<=n;i++) if(i!=k)cout<<i<< ; cout<<endl; }else{ int m=n-k/2-1; cout<<m<<endl; for(int i=k/2+1;i<=n;i++) if(i!=k)cout<<i<< ; cout<<endl; } } } return 0; }

#include <bits/stdc++.h> using namespace std; long long n, m, A; long long b[200005]; long long beki[200005]; long long pow(long long a, long long n) { if (n == 0) return 1; if (n % 2) { return ((a % 998244353) * (pow(a, n - 1) % 998244353)) % 998244353; } else { return pow((a * a) % 998244353, n / 2) % 998244353; } } int main(void) { cin >> n >> m >> A; for (int i = 1; i <= m; i++) cin >> b[i]; long long inv2 = pow(2, 998244353 - 2); long long ans = 1; for (int i = 1; i <= m; i++) { long long l = b[i] - b[i - 1]; long long tmp = (pow(A, 2 * l) + 998244353 - pow(A, l)) % 998244353; tmp *= inv2, tmp %= 998244353; tmp += pow(A, l), tmp %= 998244353; ans *= tmp, ans %= 998244353; } ans *= pow(A, n - 2 * b[m]), ans %= 998244353; cout << ans << endl; return 0; }

#include <bits/stdc++.h> using namespace std; void init_code() {} long long int c[207]; bool adj[207][207]; long long int n; void dfs(long long int u, long long int cu) { if (~c[u]) { if (c[u] ^ cu) { cout << NO << n ; exit(0); } return; } c[u] = cu; for (long long int v = 0; v < n; v++) if (adj[u][v]) dfs(v, cu ^ 1); } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); init_code(); cin >> n; string str; cin >> str; for (long long int i = 0; i < n; i++) { for (long long int j = i + 1; j < n; j++) { if (str[j] < str[i]) adj[i][j] = adj[j][i] = 1; } } memset(c, -1, sizeof(c)); for (long long int i = 0; i < n; i++) { if (c[i] < 0) dfs(i, 0); } cout << YES << n ; for (long long int i = 0; i < n; i++) cout << c[i]; return 0; }

#include <bits/stdc++.h> using namespace std; template <typename A> using VE = vector<A>; template <typename A> using USET = unordered_set<A>; template <typename A> using HEAP = priority_queue<A>; template <typename A, typename B> using PA = pair<A, B>; template <typename A, typename B> using UMAP = unordered_map<A, B>; template <typename A> using RHEAP = priority_queue<A, vector<A>, greater<A> >; template <typename A> A MAX(const A &a) { return a; } template <typename A> A MIN(const A &a) { return a; } template <typename A> A MAX(const A *a, const A *b) { return *max_element(a, b); } template <typename A> A MIN(const A *a, const A *b) { return *min_element(a, b); } template <typename A, typename... B> A MAX(const A &a, const B &...b) { return max(a, MAX(b...)); } template <typename A, typename... B> A MIN(const A &a, const B &...b) { return min(a, MIN(b...)); } template <typename A, typename B = typename std::iterator_traits<A>::value_type> B MAX(A a, A b) { return *max_element(a, b); } template <typename A, typename B = typename std::iterator_traits<A>::value_type> B MIN(A a, A b) { return *min_element(a, b); } mt19937 rng( (unsigned int)chrono::steady_clock::now().time_since_epoch().count()); const int N = 100010, M = 1010; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cout << fixed << setprecision(10); int T; cin >> T; while (T--) { int n; cin >> n; int idx = 0; map<int, int> mp; vector<int> a(n); for (auto &u : a) { cin >> u; if (!mp.count(u)) mp[u] = ++idx; u = mp[u]; } int p = -1; for (int i = 0; i < n; i++) if (a[i] == a[(i + 1) % n]) { p = i; break; } vector<int> c(n); if (p == -1) { for (int i = 0, j = 1; i + 1 < n; i += 2) { c[i] = j; j = 3 - j; c[i + 1] = j; j = 3 - j; } if (c.back() == 0) { if (c[n - 2] != c[0]) c.back() = 3; else c.back() = 3 - c[0]; } } else { rotate(a.begin(), a.begin() + p + 1, a.end()); c[0] = 1; for (int i = 1; i < n; i++) if (a[i] != a[i - 1]) c[i] = 3 - c[i - 1]; else c[i] = 1; } cout << MAX(c.begin(), c.end()) << n ; int j; if (p == -1) j = 0; else j = n - p - 1; for (int i = 0; i < n; i++, j++) cout << c[j % n] << ; cout << n ; } return 0; }

#include <bits/stdc++.h> using namespace std; int a[27], c[27], d[27]; int main() { int count, i, n, max, co, t, index, k; char str[1010], ch, b[1010]; ch = getchar(); while (ch != n ) { a[ch - a + 1]++; ch = getchar(); } count = 0; for (i = 1; i <= 26; i++) if (a[i] != 0) count++; scanf( %d , &n); if (n < count) printf( -1 n ); else if (n == count) { max = 0; for (i = 1; i <= 26; i++) if (a[i] > max) max = a[i]; printf( %d n , max); for (i = 1; i <= 26; i++) if (a[i] != 0) printf( %c , i + a - 1); printf( n ); } else { t = 0; for (i = 1; i <= 26; i++) { if (a[i] != 0) b[t++] = i + a - 1; c[i] = 1; } copy(a, a + 27, d); for (k = n - count; k > 0; k--) { max = 0; index = 0; for (i = 1; i <= 26; i++) if (d[i] > max) { max = d[i]; index = i; } c[index]++; b[t++] = index + a - 1; if (a[index] % c[index] != 0) d[index] = a[index] / c[index] + 1; else d[index] = a[index] / c[index]; } max = 0; for (i = 1; i <= 26; i++) { if (d[i] > max) max = d[i]; } printf( %d n , max); b[t] = 0; puts(b); } return 0; }

#include <bits/stdc++.h> using namespace std; const long long maxn = 2e5 + 5, mod = 1e9 + 7, inf = 1e18; long long n, m, ans[maxn], h[maxn], par[20][maxn], mx[20][maxn], pw2[20], p[maxn], sz[maxn], ip[maxn]; vector<pair<long long, long long>> v1[maxn], v2[maxn]; vector<pair<long long, pair<long long, long long>>> adj[maxn], g[maxn]; vector<pair<pair<long long, long long>, pair<long long, long long>>> vec; set<pair<long long, long long>> s[maxn]; long long get_par(long long u) { if (p[u] == 0) return u; p[u] = get_par(p[u]); return p[u]; } bool merge(long long u, long long v) { u = get_par(u); v = get_par(v); if (u == v) return 0; if (sz[u] < sz[v]) swap(u, v); p[v] = u; sz[u] += sz[v]; return 1; } void dfs(long long u) { for (long long i = 1; i < 20; i++) { long long v = par[i - 1][u]; if ((v == 0) || (par[i - 1][v] == 0)) break; par[i][u] = par[i - 1][v]; mx[i][u] = max(mx[i - 1][u], mx[i - 1][v]); } for (auto j : g[u]) { long long v = j.first, w = j.second.first; if (j.first == par[0][u]) continue; ip[v] = j.second.second; mx[0][v] = w; par[0][v] = u; h[v] = h[u] + 1ll; dfs(v); } } void build_mst() { sort(vec.begin(), vec.end()); for (auto i : vec) { long long u = i.second.first, v = i.second.second, w = i.first.first; if (merge(u, v)) { g[u].push_back({v, {w, i.first.second}}); g[v].push_back({u, {w, i.first.second}}); } } dfs(1); } long long get_pr(long long v, long long d) { for (long long i = 0; i < 20; i++) { if ((pw2[i] & d) == 0) continue; v = par[i][v]; } return v; } long long get_mx(long long v, long long d) { long long MX = 0; for (long long i = 0; i < 20; i++) { if ((pw2[i] & d) == 0) continue; MX = max(MX, mx[i][v]); v = par[i][v]; } return MX; } long long get_lca(long long u, long long v) { if (h[u] > h[v]) swap(u, v); if (h[u] != h[v]) v = get_pr(v, h[v] - h[u]); if (u == v) return u; for (long long i = 19; i >= 0; i--) { if (par[i][v] == par[i][u]) continue; u = par[i][u]; v = par[i][v]; } return par[0][u]; } void DFS(long long u) { for (pair<long long, long long> i : v1[u]) s[u].insert(i); for (auto j : g[u]) { if (j.first == par[0][u]) continue; DFS(j.first); if (s[j.first].size() == 0) continue; if (s[j.first].size() > s[u].size()) s[u].swap(s[j.first]); for (auto j2 : s[j.first]) s[u].insert(j2); s[j.first].clear(); } for (pair<long long, long long> i : v2[u]) s[u].erase(i); if (u == 1) return; if (s[u].size() == 0) { ans[ip[u]] = -1; return; } ans[ip[u]] = (*s[u].begin()).first - 1ll; } int main() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); pw2[0] = 1; for (long long i = 1; i < 20; i++) pw2[i] = (pw2[i - 1] * 2ll); cin >> n >> m; for (long long i = 0; i < m; i++) { long long u, v, w; cin >> u >> v >> w; adj[u].push_back({v, {w, i}}); adj[v].push_back({u, {w, i}}); vec.push_back({{w, i}, {u, v}}); } build_mst(); for (auto j : vec) { long long u = j.second.first, v = j.second.second, w = j.first.first, i = j.first.second; if (h[u] > h[v]) swap(u, v); if (par[0][v] == u) continue; long long lca = get_lca(u, v); v1[u].push_back({w, v}); v1[v].push_back({w, u}); v2[lca].push_back({w, v}); v2[lca].push_back({w, u}); ans[i] = max(get_mx(u, h[u] - h[lca]), get_mx(v, h[v] - h[lca])) - 1; } DFS(1); for (long long i = 0; i < m; i++) cout << ans[i] << ; }

#include <bits/stdc++.h> using namespace std; int main() { int n, v; cin >> n; for (int i = 0; i < n; i++) { cin >> v; if (v == 1) { cout << -1; return 0; } } cout << 1; }

#include <bits/stdc++.h> using namespace std; int main() { cout << INTERCAL << endl; }

#include <bits/stdc++.h> using namespace std; int main() { set<int> s; int n; cin >> n; for (int i = 0; i < n; i++) { int x; cin >> x; s.insert(x); } set<int>::iterator it, it1, it2; it = s.begin(); it1 = it; it1++; it2 = s.end(); it2--; if (s.size() == 1) cout << 0 << endl; else if (s.size() == 2) { int e = *it1 - (*it); if (e % 2 == 0) e /= 2; cout << e; } else if (s.size() == 3) { int a = (*it); int b = (*it1); int c = (*it2); if (b - a == c - b) cout << b - a << endl; else cout << -1 << endl; } else cout << -1 << endl; }

#include <bits/stdc++.h> using namespace std; const int N = 2000010; int n, ans, q[N], x[N], y[N]; struct node { int a, b, m, id; }; vector<node> a[N]; bool cmp(node x, node y) { return x.a < y.a; } void Work() { scanf( %d , &n); for (int i = 1, x, y, z; i <= n; i++) { scanf( %d%d%d , &x, &y, &z); a[x + y - z].push_back((node){x, y, z, i}); q[i] = x + y - z; } ans = 0; for (int i = 1; i <= n; i++) if (a[q[i]].size()) { sort(a[q[i]].begin(), a[q[i]].end(), cmp); for (int j = 0, px = -1e9; j < (int)a[q[i]].size(); j++) { node b = a[q[i]][j]; if (b.b < q[i] - px) px = min(b.a, q[i]), ans++; x[b.id] = b.a - px; y[b.id] = b.m - x[b.id]; } a[q[i]].clear(); } cout << ans << n ; for (int i = 1; i <= n; i++) cout << x[i] << << y[i] << n ; } int main() { int T = 1; scanf( %d , &T); while (T--) Work(); return 0; }

#include <bits/stdc++.h> using namespace std; int d8x[8] = {1, -1, 0, 0, 1, 1, -1, -1}; int d8y[8] = {0, 0, 1, -1, 1, -1, 1, -1}; const int M = 1e9 + 7; const int N = 1e3, Nx = 500; int a[N + 1], c[N + 1]; bool isPrime[N + 1]; void sieve(int x) { for (int i = 0; i <= x; i++) isPrime[i] = true; isPrime[0] = false; isPrime[1] = false; for (int i = 2; i * i <= x; i++) { if (isPrime[i]) { for (int j = i * i; j <= x; j += i) isPrime[j] = false; } } } template <class type> type gcd(type a, type b) { if (b == 0) return a; return gcd(b, a % b); } template <class type> type MODEXPO(type a, type b, int mod) { if (b == 0) return 1; else if (b % 2 == 0) return MODEXPO((a * a) % mod, b / 2, mod); else return (a * MODEXPO((a * a) % mod, (b - 1) / 2, mod)) % mod; } void fast() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); } int main() { fast(); int n; cin >> n; int ans = 1; for (int i = 0; i <= n - 1; i++) cin >> a[i], a[i]--; for (int i = 0; i <= n - 1; i++) { memset(c, 0, sizeof c); int l = 0, x = i; while (!c[x]) c[x] = 1, l++, x = a[x]; if (x != i) { ans = -1; break; } if (l % 2 == 0) l /= 2; ans *= l / gcd(l, ans); } cout << ans; return 0; }

#include <bits/stdc++.h> using namespace std; using ll = long long; const int inf = 1e9 + 7; const ll longinf = 1LL << 60; const ll mod = 1e9 + 7; template <typename T, typename S> struct LazySegmentTree { private: int n; vector<T> node; vector<S> lazy; T E0; S E1; inline void updatef(S& lazy, S& value) { lazy += value; } inline void calculatef(T& node, S& lazy, int len) { node += lazy; } inline T queryf(T& x, T& y) { return max(x, y); } public: LazySegmentTree(int sz, T nodeE, S lazyE) : E0(nodeE), E1(lazyE) { n = 1; while (n < sz) n <<= 1; node.resize(2 * n - 1, E0); lazy.resize(2 * n - 1, E1); } LazySegmentTree(vector<T>& v, T E0, S E1) : E0(E0), E1(E1) { n = 1; int sz = v.size(); while (n < sz) n <<= 1; node.resize(2 * n - 1, E0); lazy.resize(2 * n - 1, E1); for (int i = (int)(0); i < (int)(sz); ++i) node[i + n - 1] = v[i]; for (int i = n - 2; i >= 0; --i) { node[i] = queryf(node[2 * i + 1], node[2 * i + 2]); } } void eval(int k, int l, int r) { if (lazy[k] == E1) return; calculatef(node[k], lazy[k], r - l); if (r - l > 1) { updatef(lazy[2 * k + 1], lazy[k]); updatef(lazy[2 * k + 2], lazy[k]); } lazy[k] = E1; } void update(int a, int b, S x, int k = 0, int l = 0, int r = -1) { if (r < 0) r = n; eval(k, l, r); if (r <= a || b <= l) return; if (a <= l && r <= b) { updatef(lazy[k], x); eval(k, l, r); } else { update(a, b, x, 2 * k + 1, l, (l + r) / 2); update(a, b, x, 2 * k + 2, (l + r) / 2, r); node[k] = queryf(node[2 * k + 1], node[2 * k + 2]); } } T query(int a, int b, int k = 0, int l = 0, int r = -1) { if (r < 0) r = n; eval(k, l, r); if (r <= a || b <= l) return E0; if (a <= l && r <= b) return node[k]; T xl = query(a, b, 2 * k + 1, l, (l + r) / 2); T xr = query(a, b, 2 * k + 2, (l + r) / 2, r); return queryf(xl, xr); } }; int main() { cin.tie(0); ios::sync_with_stdio(false); int n, m, p; cin >> n >> m >> p; vector<pair<int, pair<int, ll>>> v(n + p); for (int i = (int)(0); i < (int)(n); ++i) { int x, y; cin >> x >> y; v[i] = {x, {-inf, -y}}; } vector<pair<int, int>> b(m); for (int i = (int)(0); i < (int)(m); ++i) { cin >> b[i].first >> b[i].second; } for (int i = (int)(0); i < (int)(p); ++i) { int x, y, z; cin >> x >> y >> z; v[n + i] = {x, {y, z}}; } sort(b.begin(), b.end()); vector<ll> c(m); for (int i = (int)(0); i < (int)(m); ++i) c[i] = -b[i].second; LazySegmentTree<ll, ll> sg(c, -longinf, 0); sort(v.begin(), v.end()); ll ans = -longinf; for (auto e : v) { if (e.second.second < 0) { ans = max(sg.query(0, m) + e.second.second, ans); } else { int idx = lower_bound(b.begin(), b.end(), pair<int, int>{e.second.first, inf}) - b.begin(); sg.update(idx, m, e.second.second); } } cout << ans << endl; return 0; }

#include <bits/stdc++.h> using namespace std; void solve() { int n; cin >> n; vector<pair<int, int> > v(n); for (int i = 0; i < n; i++) cin >> v[i].first; bool is0 = false, is1 = false; for (int i = 0; i < n; i++) { cin >> v[i].second; if (v[i].second) is1 = true; else is0 = true; } if (is0 && is1) { cout << Yes n ; return; } for (int i = 1; i < n; i++) if (v[i - 1] > v[i]) { cout << No n ; return; } cout << Yes n ; } int main() { ios::sync_with_stdio(false); int t; cin >> t; while (t--) solve(); }

#include <bits/stdc++.h> using namespace std; int n, m; int mat[1000010]; int row(int r) { int s = r * m, e = s + m; bool eq = false, dif = false; for (int i = s, idx = 0; i < e; i++, idx++) { if (mat[i] == -1) continue; int a = mat[i] / 2; int b = idx & 1; if (a == b) eq = true; if (a != b) dif = true; } if (eq && dif) return 0; if (eq || dif) return 1; return 2; } int col(int c) { int s = c, e = n * m + c; bool eq = false, dif = false; for (int i = s, idx = 0; i < e; i += m, idx++) { if (mat[i] == -1) continue; int a = min(mat[i], 3 - mat[i]); int b = idx & 1; if (a == b) eq = true; if (a != b) dif = true; } if (eq && dif) return 0; if (eq || dif) return 1; return 2; } int main() { while (cin >> n >> m) { char ch; for (int i = 0; i < n * m; i++) { cin >> ch; if (ch == . ) mat[i] = -1; else mat[i] = (int)(ch - 1 ); } int res = 1; for (int i = 0; i < n; i++) { res *= row(i); if (res >= 1000003) res -= 1000003; } for (int i = 0; i < m; i++) { res *= col(i); if (res >= 1000003) res -= 1000003; } cout << res % 1000003 << endl; } return 0; }

#include <bits/stdc++.h> using namespace std; const int N = 100; int n, x, t; long long ans, s[N]; int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %d , &x); t = 0; while (x) { t += x % 2; x /= 2; } ++s[t]; } for (int i = 1; i <= N; ++i) ans += s[i] * (s[i] - 1) / 2; cout << ans; }

#include <bits/stdc++.h> using namespace std; int n, i, j; vector<string> koutsompolio; int main() { cin >> n; string lol; bool r, f; for (i = 0; i <= n; i++) { getline(cin, lol); koutsompolio.push_back(lol); } for (i = 1; i <= n; i++) { r = false; f = false; if ((koutsompolio[i][0] == m ) && (koutsompolio[i][1] == i ) && ((koutsompolio[i][2] == a )) && (koutsompolio[i][3] == o ) && (koutsompolio[i][4] == . )) { r = true; } if ((koutsompolio[i][koutsompolio[i].size() - 1] == . ) && (koutsompolio[i][koutsompolio[i].size() - 2] == a ) && ((koutsompolio[i][koutsompolio[i].size() - 3] == l )) && (koutsompolio[i][koutsompolio[i].size() - 4] == a ) && (koutsompolio[i][koutsompolio[i].size() - 5] == l )) { f = true; } if ((f == false) && (r == true)) { cout << Rainbow s n ; } else if ((f == true) && (r == false)) { cout << Freda s n ; } else { cout << OMG>.< I don t know! n ; } } }

#include <bits/stdc++.h> using namespace std; void solve() { int x{}; cin >> x; if (x % 3 == 0 || x % 7 == 0) { cout << YES << endl; return; } int ms{x / 3}; int ml{x / 7}; for (int i{0}; i <= ms; ++i) { for (int j{0}; j <= ml; ++j) { int chunks{3 * i + 7 * j}; if (chunks == x) { cout << YES << endl; return; } } } cout << NO << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int t{}; cin >> t; while (t > 0) { solve(); t--; } return 0; }

#include <bits/stdc++.h> using namespace std; int main() { long long k; cin >> k; long long cnt = 0; for (double a = 2 + 2. / 3; a < (2 * k) / sqrt(3); a += 2) { double b = 1e-8 + (-a + sqrt((16 * k * k) / 3. - (3 * a * a))) / 2. - 2. / 3; if (b > 0) cnt += ((int)b + 2) / 2; } cout << 1 + 6 * cnt << endl; return 0; }

#include <bits/stdc++.h> using namespace std; int cmpint(const void *a, const void *b) { if (((int *)a)[0] == ((int *)b)[0]) return ((int *)a)[1] - ((int *)b)[1]; return ((int *)a)[0] - ((int *)b)[0]; } int prim[500005] = {0}; bool isprim[5000005] = {0}; int prim_len; void count_prim() { int i, j, l; prim[0] = 2; prim_len = 1; for (i = 3; i < 5000000; i += 2) if (isprim[i] == 0) { prim[prim_len] = i; prim_len++; l = i * 2; if (i < 10000) for (j = i * i; j < 5000000; j += l) isprim[j] = 1; } } int a[100005]; int main() { int i, j, n, m, k, l, o, p; scanf( %d , &n); count_prim(); m = 0; for (i = (0); i < (prim_len); i++) { k = prim[i]; l = 0; while (k > 0) { l = l * 10 + k % 10; k /= 10; } if (l != prim[i] && isprim[l] == 0 && l % 2 == 1) { m++; a[m] = prim[i]; } if (m > n) break; } printf( %d n , a[n]); return 0; }

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); vector<long> A; long N, L, R, M, T, Sum, Min = 2147483647; cin >> N; A.resize(N); for (long i = 0; i < N; ++i) cin >> A[i]; for (long M = 1; M <= 100; ++M) { Sum = 0; for (long i = 0; i < N; ++i) Sum += min(min(abs(A[i] - M + 1), abs(A[i] - M - 1)), abs(A[i] - M)); if (Sum < Min) { Min = Sum; T = M; } } cout << T << << Min; return 0; }

#include <bits/stdc++.h> const int mod = 1e6 + 3; int add(int a, int b) { return (a += b) >= mod ? a -= mod : a; } int sub(int a, int b) { return add(a, mod - b); } int mul(int a, int b) { return int(1LL * a * b % mod); } int pow(int a, int64_t n) { int res = 1; while (n > 0) { if (n & 1) { res = mul(res, a); } a = mul(a, a); n >>= 1; } return res; } int inv(int a) { return pow(a, mod - 2); } int main() { const int n = 11; std::vector<int> f(n + 1); for (int i = 1; i <= n; ++i) { std::cout << ? << i << std::endl; std::cin >> f[i]; if (f[i] == 0) { std::cout << ! << i << std::endl; return 0; } } std::vector<std::vector<int> > a(1 + n, std::vector<int>(1 + n)); for (int i = 1; i <= n; ++i) { for (int j = 1; j <= n; ++j) { a[i][j] = pow(i, j - 1); } } for (int j = 1, i = 1; j <= n; ++j) { bool was = false; for (int k = i; k <= n; ++k) { if (a[k][j] != 0) { was = true; std::swap(a[i], a[k]); std::swap(f[i], f[k]); break; } } if (!was) { continue; } for (int k = i + 1; k <= n; ++k) { int coeff = mul(sub(0, inv(a[k][j])), a[i][j]); for (int t = j; t <= n; ++t) { a[k][t] = add(mul(coeff, a[k][t]), a[i][t]); } assert(a[k][j] == 0); f[k] = add(f[i], mul(coeff, f[k])); } i++; } std::vector<int> x(1 + n); for (int i = n; i >= 1; --i) { assert(a[i][i] != 0); int res = f[i]; for (int j = i + 1; j <= n; ++j) { res = sub(res, mul(a[i][j], x[j])); } x[i] = mul(res, inv(a[i][i])); } for (int i = 0; i < mod; ++i) { int p = 1, s = 0; for (int j = 1; j <= n; ++j) { s = add(s, mul(x[j], p)); p = mul(p, i); } if (s == 0) { std::cout << ? << i << std::endl; int v; std::cin >> v; assert(v == 0); std::cout << ! << i << std::endl; return 0; } } std::cout << ! << -1 << std::endl; return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int n, sticks; cin >> n; while (n--) { cin >> sticks; if (sticks % 2 == 0) cout << (sticks / 2) << endl; else cout << (1 + (sticks - 1) / 2) << endl; } }

#include <bits/stdc++.h> using namespace std; const double PI = 2 * acos(0.0); mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count()); const string DIGITS = 0123456789 ; const string ALPH = abcdefghijklmnopqrstuvwxyz ; template <class T0, class T1> inline ostream &operator<<(ostream &out, pair<T0, T1> &a) { return out << { << a.first << , << a.second << } ; } template <class T0, class T1, class T2> inline ostream &operator<<(ostream &out, tuple<T0, T1, T2> &a) { return out << { << get<0>(a) << , << get<1>(a) << , << get<2>(a) << } ; } template <class T0, class T1, class T2, class T3> inline ostream &operator<<(ostream &out, tuple<T0, T1, T2, T3> &a) { return out << { << get<0>(a) << , << get<1>(a) << , << get<2>(a) << , << get<3>(a) << } ; } template <class T> inline ostream &operator<<(ostream &out, vector<T> &a) { out << [ ; for (long long i = 0; i < (long long)(a.size()); ++i) out << a[i] << vector<string>{ , , ] }[i + 1 == a.size()]; return out; } void smain(); signed main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout << setprecision(10) << fixed; smain(); return 0; } void smain() { long long t; cin >> t; while (t--) { long long n, k; string s; cin >> n >> k >> s; vector<long long> p(2); map<long long, long long> mp; for (long long i = 0; i < s.size(); i++) { p[s[i] - 0 ]++; long long u = p[0] - p[1]; mp[u]++; } long long v = p[0] - p[1]; if (v == 0) { if (mp[k] != 0) { cout << -1 << n ; } else { cout << mp[k] << n ; } continue; } long long sum = 0; for (auto h : mp) { if ((k - h.first) % abs(v) == 0 && (k - h.first) / v >= 0) { sum += h.second; } } if (k == 0) sum++; cout << sum << n ; } }

#include <bits/stdc++.h> using namespace std; int n, ans, dp[105], a[105]; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); if (n % 2 == 0 || n == 1) { printf( -1 ); return 0; } for (int i = n; i >= 2; i--) { ans += max(a[i], a[i - 1]); a[(i - 1) / 2] -= min(a[(i - 1) / 2], max(a[i], a[i - 1])); i--; } printf( %d , ans + a[1]); }

#include <iostream> #include <vector> #include <algorithm> #include <string> #include <map> #include <unordered_set> #include <unordered_map> #include <cmath> #include <random> #include <chrono> #include <set> #include <queue> #include <stack> #include <deque> #include <cstring> const long long big = 998244353; using namespace std; long long power(long long a, long long n) { if (n == 0) return 1; if (n % 2 == 1) return (power(a, n - 1) * a) % big; else { long long b = power(a, n / 2); return (b * b) % big; } } int gcd(int a, int b) { if (b == 0) return a; else return gcd(b, a % b); } int t2[1000000]; void build_min(int a[], int v, int tl, int tr) { if (tl >= tr) t2[v] = a[tl]; else { int tm = (tl + tr) / 2; build_min(a, v * 2, tl, tm); build_min(a, v * 2 + 1, tm + 1, tr); t2[v] = min(t2[v * 2], t2[v * 2 + 1]); } } int sum_min (int v, int tl, int tr, int l, int r) { if (l > r) return 1000000; if (l == tl && r == tr) return t2[v]; int tm = (tl + tr) / 2; return min(sum_min (v*2, tl, tm, l, min(r,tm)) , sum_min (v*2+1, tm+1, tr, max(l,tm+1), r)); } int t[1000000]; void build_max(int a[], int v, int tl, int tr) { if (tl >= tr) t[v] = a[tl]; else { int tm = (tl + tr) / 2; build_max(a, v * 2, tl, tm); build_max(a, v * 2 + 1, tm + 1, tr); t[v] = max(t[v * 2], t[v * 2 + 1]); } } void update(int v, int tl, int tr, int l, int r, int add) { if (l > r) return; if (l == tl && tr == r) t[v] += add; else { int tm = (tl + tr) / 2; update(v * 2, tl, tm, l, min(r, tm), add); update(v * 2 + 1, tm + 1, tr, max(l, tm + 1), r, add); } } int get(int v, int tl, int tr, int pos) { if (tl == tr) return t[v]; int tm = (tl + tr) / 2; if (pos <= tm) return t[v] + get(v * 2, tl, tm, pos); else return t[v] + get(v * 2 + 1, tm + 1, tr, pos); } int sum_max (int v, int tl, int tr, int l, int r) { if (l > r) return -1000000; if (l == tl && r == tr) return t[v]; int tm = (tl + tr) / 2; return max(sum_max (v*2, tl, tm, l, min(r,tm)) , sum_max (v*2+1, tm+1, tr, max(l,tm+1), r)); } class Cmp { public: bool operator()(vector<long long>& a, vector<long long>& b) { return a.size() > b.size(); } }; void solve() { long long n, k; cin >> n >> k; vector<long long> sa(n); for (int i = 0; i < n; ++i) { cin >> sa[i]; } vector<long long> tmp(n); for (int i = 0; i < n; ++i) { tmp[sa[i]] = i; } long long cur = 0; vector<long long> s(n); s[sa[0]] = 0; for (int i = 1; i < n; ++i) { long long j = sa[i - 1]; long long l = sa[i]; if (l == n - 1 || (j < n - 1 && tmp[j + 1] > tmp[l + 1])) cur++; s[sa[i]] = cur; } long long dif = k; for (long long i: s) { // cout << i << ; if (k - i - 1 < dif) { dif = k - i - 1; } } if (dif < 0) { cout << 0; return; } else if (dif == 0) { cout << 1; return; } else { long long ans = 1; for (int i = 1; i <= dif; ++i) { ans *= (n + i); ans %= big; ans *= power(i, big - 2); ans %= big; } cout << ans; } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long t = 1; // cin >> t; //cout.precision(20); while (t--) { solve(); } }

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cout.tie(0), cin.tie(0); int t; cin >> t; while (t--) { int n, m; cin >> n >> m; vector<string> ar(n); long long cnt = 0; vector<vector<int>> dp(n + 1, vector<int>(m + 1, 0)); for (int i = 0; i < n; i++) { cin >> ar[i]; for (int j = 0; j < m; j++) { dp[i][j] = (ar[i][j] == * ); cnt += (ar[i][j] == * ); } } for (int i = 0; i < n; i++) { for (int j = 1; j < m; j++) { dp[i][j] += dp[i][j - 1]; } } // 1st Sol. : from base to head but with binary search on answer - O(N^3 . Log(N)). // 2nd Sol. : let * in position [i, j] be the head of k-tree and try to go downward - O(N^3). for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (ar[i][j] == * ) { int rows = i + 1; int cols_left = j - 1; int cols_right = j + 1; int temp = 0; bool ok = true; while (rows < n && ok) { int cur = dp[rows][cols_right]; if (cols_left - 1 >= 0) { cur -= dp[rows][cols_left - 1]; } if (cur == cols_right - cols_left + 1) { temp++; rows++; cols_left--; cols_right++; } else { ok = false; } } cnt += temp; } } } cout << cnt << n ; } }

#include <bits/stdc++.h> using namespace std; struct pt { long long x, y; } a[3005]; long long n, m, q, lim, las, pre[3005], suf[3005], rc[3005][3005], c, x, y, z, v, ans; long long cmp(pt x, pt y) { return x.y < y.y || (x.y == y.y && x.x < y.x); } long long cb(long long x) { return (x + 1) * x >> 1; } int main() { scanf( %lld , &n), scanf( %lld , &m), scanf( %lld , &q), scanf( %lld , &lim); for (long long i = 1; i <= q; i++) scanf( %lld , &a[i].x), scanf( %lld , &a[i].y); sort(a + 1, a + q + 1, cmp); for (long long i = 1; i <= q; i++) rc[a[i].x][++rc[a[i].x][0]] = i; a[q + 1].y = m + 1; for (long long i = 1; i <= n; i++) { memset(pre, 255, sizeof pre), memset(suf, 255, sizeof suf), las = 0; for (long long j = 1; j <= q; j++) if (a[j].x >= i) suf[pre[j] = las] = j, las = j; suf[pre[q + 1] = las] = q + 1, v = cb(m), x = y = suf[0], c = 1; while (suf[x] > -1) { while (c + 1 < lim && suf[suf[y]] > -1) c++, y = suf[y]; if (c < lim) v -= (a[x].y - a[pre[x]].y) * (a[suf[y]].y - a[x].y); x = suf[x], c--; } x = suf[0]; while (x) v -= cb(a[x].y - a[pre[x]].y - 1), x = suf[x]; for (long long j = n; j >= i; j--) { ans += v; if (!v) break; if (j > i) for (long long u = 1; u <= rc[j][0]; u++) if (x = y = z = rc[j][u]) { c = 1; while (c < lim && pre[pre[x]] > -1) x = pre[x], c++; while (pre[x] != z) { while (c < lim && suf[suf[y]] > -1) y = suf[y], c++; if (c == lim) v -= (a[x].y - a[pre[x]].y) * (a[suf[y]].y - a[y].y); if (c < lim) break; x = suf[x], c--; } x = pre[z], y = suf[z], suf[pre[y] = x] = y; } } } printf( %lld , ans); }

#include <bits/stdc++.h> using namespace std; long long int a[1000005], b[1000005]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long int n, i; cin >> n; a[1] = 1; b[1] = 0; for (i = 2; i <= n; i++) { if (i % 2 == 0) { a[i] = a[i - 1]; b[i] = (b[i - 1] + (a[i] + 1)); a[i] %= 1000000007; b[i] %= 1000000007; } else { b[i] = b[i - 1]; a[i] = (a[i - 1] + (b[i] + 1)); a[i] %= 1000000007; b[i] %= 1000000007; } } long long int ans = b[n] + a[n]; ans %= 1000000007; cout << ans << n ; return 0; }

#include <bits/stdc++.h> using namespace std; const int MAX_N = 300 * 1000 + 10; long long dist[MAX_N], dist1[MAX_N]; vector<pair<int, int>> adj[MAX_N]; set<pair<long long, int>> s; bool inPath[MAX_N]; pair<int, int> mx; int nxt[MAX_N]; bool dfs_path(int u, int par = -1) { for (auto x : adj[u]) { int v = x.first; if (v != par && dfs_path(v, u)) inPath[u] = true, nxt[u] = v; } return inPath[u]; } long long dfs_dist(int u, int par = -1) { if (inPath[u]) for (auto x : adj[u]) { int v = x.first, w = x.second; if (v == nxt[u]) dist1[v] = dist1[u] + w, dist[u] = dfs_dist(v, u) + w; } for (auto x : adj[u]) { int v = x.first, w = x.second; if (v != par && !inPath[v]) dist1[v] = dist1[u] + w, dist[v] = dist[u] + w, dfs_dist(v, u); } return dist[u]; } bool cmp(pair<int, int> a, pair<int, int> b) { if (min(a.first, b.first) < 0) return a.first < 0 ? true : false; return dist1[a.first] + dist[a.second] < dist1[b.first] + dist[b.second]; } void rem_block(int u, int par = -1) { s.erase({dist[u], u}); for (auto x : adj[u]) { int v = x.first; if (v != par) rem_block(v, u); } } void add_block(int u, int par = -1) { s.insert({dist[u], u}); for (auto x : adj[u]) { int v = x.first; if (v != par) add_block(v, u); } } void dfs(int u, int par = -1) { if (inPath[u]) { s.erase({dist[u], u}); for (auto x : adj[u]) { int v = x.first; if (v != par && v != nxt[u]) rem_block(v, u), dfs(v, u), add_block(v, u); } for (auto x : adj[u]) { int v = x.first; if (v != par && v != nxt[u]) rem_block(v, u); } for (auto it = s.rbegin(); it != s.rend(); it++) if (it->second != nxt[u]) { mx = max(make_pair(u, it->second), mx, cmp); break; } if (nxt[u] != u) dfs(nxt[u], u); } else if (!s.empty()) { mx = max(make_pair(u, (*s.rbegin()).second), mx, cmp); for (auto x : adj[u]) { int v = x.first; if (v != par) dfs(v, u); } } } int main() { ios_base ::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); int n, m; cin >> n >> m; for (int i = 1; i < n; i++) { int u, v, w; cin >> u >> v >> w; u--, v--; adj[u].push_back({v, w}); adj[v].push_back({u, w}); } inPath[n - 1] = true, nxt[n - 1] = n - 1, mx = {-1, -1}; dfs_path(0), dfs_dist(0), add_block(0), dfs(0); for (int i = 0; i < m; i++) { int x; cin >> x; cout << min(dist1[mx.first] + dist[mx.second] + x, dist[0]) << endl; } return 0; }

#include <bits/stdc++.h> using namespace std; int main() { long long i = -1, k, l; cin >> k >> l; while (l % k == 0) { l /= k; i++; } if (i >= 0 && l == 1) cout << YES << endl << i << endl; else cout << NO << endl; }

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; while (n--) { int a, b; cin >> a >> b; int sum = 0; int h; for (int i = 1; i < a; i++) { sum += i; if (sum >= b) { sum -= i; h = i - 1; break; } } int s = a - h - 1; int sb = a - (b - sum) + 1; for (int i = 1; i <= a; i++) { if (i == s || i == sb) cout << b ; else cout << a ; } cout << endl; } return 0; }

#include <bits/stdc++.h> using namespace std; long long int c1, c2, x, y, l, r, mid; int main() { ios::sync_with_stdio(false); cin >> c1 >> c2 >> x >> y; l = c1 + c2; r = 2000000009; while (l < r) { mid = (l + r) / 2; if ((mid - (mid / x) >= c1) && (mid - (mid / y) >= c2) && (mid - (mid / (x * y)) >= (c1 + c2))) r = mid; else l = mid + 1; } cout << l << endl; return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int a[16] = {15, 14, 12, 13, 8, 9, 10, 11, 0, 1, 2, 3, 4, 5, 6, 7}; int n; cin >> n; cout << a[n]; return 0; }

#include <bits/stdc++.h> using namespace std; multiset<long long> h[1000005]; int main() { int q; scanf( %d , &q); while (q--) { char op, s[20]; long long a; scanf( %c , &op); if (op == + ) { scanf( %lld , &a); int idx = 0, k = 0; for (long long x = a; x > 0; x /= 10, k++) { int d = x % 10; idx |= (d & 1) << k; } h[idx].insert(a); } else if (op == - ) { scanf( %lld , &a); int idx = 0, k = 0; for (long long x = a; x > 0; x /= 10, k++) { int d = x % 10; idx |= (d & 1) << k; } h[idx].erase(h[idx].find(a)); } else { scanf( %s , s); reverse(s, s + strlen(s)); int idx = 0; for (int k = 0; s[k]; k++) idx |= (s[k] - 0 ) << k; printf( %d n , (int)h[idx].size()); } } }

#include <bits/stdc++.h> using namespace std; int n, pre = -1; priority_queue<pair<int, int> > q; const int M = 3000000 * 4, N = 1e9; int tree[M], lson[M], rson[M], val[M], size, k, root; void updata(int &root, int l, int r, int x, int v) { if (!root) root = ++size; if (l == r) { val[root] = tree[root] = v; return; } int mid = (l + r) / 2; if (x <= mid) updata(lson[root], l, mid, x, v); else updata(rson[root], mid + 1, r, x, v); tree[root] = max(tree[lson[root]], tree[rson[root]]) + val[root]; } void add(int &root, int l, int r, int x, int y) { if (!root || y < l || r < x) return; if (x <= l && r <= y) { tree[root]++; val[root]++; return; } int mid = (l + r) / 2; add(lson[root], l, mid, x, y); add(rson[root], mid + 1, r, x, y); tree[root] = max(tree[lson[root]], tree[rson[root]]) + val[root]; } int ask(int &root, int l, int r, int x, int y) { if (!root || y < l || r < x) return 0; if (x <= l && r <= y) return tree[root]; int mid = (l + r) / 2; return max(ask(lson[root], l, mid, x, y), ask(rson[root], mid + 1, r, x, y)) + val[root]; } int main() { scanf( %d%d , &n, &k); for (int i = 1; i <= n; i++) { int l, r; scanf( %d%d , &l, &r); l = max(0, l); q.push(make_pair(-r, -l)); q.push(make_pair(-l, 1)); } while (!q.empty()) { int l = -q.top().second, r = -q.top().first; q.pop(); if (l >= 0) add(root, 0, N, l, r); else { if (r == pre) continue; int u = ask(root, 0, N, pre, pre), v = ask(root, 0, N, 0, r - k); if (l == -1 || u < v) { pre = r; updata(root, 0, N, r, v); if (r + root <= N) q.push(make_pair(-r - k, 2)); } } } cout << tree[1] << endl; return 0; }

#include <bits/stdc++.h> using namespace std; int main() { long long int p; cin >> p; for (long long int z = 0; z < p; z++) { long long int n; cin >> n; while (1) { break; } string a; cin >> a; long long int re = 0, ro = 0, be = 0, bo = 0; for (long long int i = 0; i < n; i++) { if (i % 2 == 0) { if (a[i] % 2 == 0) { re++; } else ro++; } else { if (a[i] % 2 == 0) { be++; } else bo++; } } while (1) { break; } if (n % 2 == 0) { if (be > 0) cout << 2 n ; else cout << 1 n ; while (1) { break; } } else { while (1) { break; } if (ro > 0) cout << 1 n ; else cout << 2 n ; while (1) { break; } } } }

#include <bits/stdc++.h> using namespace std; void solve() { int n; cin >> n; string s; cin >> s; int l = -1, r = -1; for (int i = 0; i < n; i++) { int cnt1 = 0, cnt2 = 0; if (s[i] == a ) ++cnt1; else ++cnt2; for (int j = i + 1; j < n; j++) { if (s[j] == a ) ++cnt1; else ++cnt2; if (cnt1 == cnt2) { l = i + 1, r = j + 1; break; } } } cout << l << << r << n ; return; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int tt; cin >> tt; while (tt--) { solve(); } return 0; }

#include <bits/stdc++.h> using namespace std; int N, M; int tam[200005], ans[200005]; map<pair<int, int>, bool> ex; int main() { cin.tie(0); ios_base::sync_with_stdio(0); cin >> N >> M; for (int m = 0; m < M; m++) { int u, v; cin >> u >> v; tam[u]++; tam[v]++; ex[{u, v}] = 1; ex[{v, u}] = 1; } for (int i = 1; i <= N; i++) if (tam[i] < N - 1) { cout << YES n ; for (int j = 1; j <= N; j++) if (i != j && !ex[{i, j}]) { ans[i] = 1; ans[j] = 2; int id = 3; for (int k = 1; k <= N; k++) if (!ans[k]) ans[k] = id++; for (int i = 1; i <= N; i++) cout << ans[i] << n [i == N]; for (int i = 1; i <= N; i++) cout << (ans[i] == 2 ? 1 : ans[i]) << n [i == N]; exit(0); } } cout << NO n ; return 0; }

#include <bits/stdc++.h> using namespace std; int a, d[101], b, f, g, h, j, k, l, n, i; string s, x; int main() { cin >> s >> x; a = s.size(); b = x.size(); if (s == x) { cout << YES ; return 0; } if (a != b) { cout << NO ; return 0; } for (i = 0; i < a; i++) { if (s[i] == 1 ) { k++; } if (x[i] == 1 ) { j++; } } if (k > 0 && j > 0) cout << YES ; else cout << NO ; }

#include <bits/stdc++.h> using namespace std; const int MAXN = 1505; const int dx[] = {1, -1, 0, 0}; const int dy[] = {0, 0, 1, -1}; int n, m; pair<int, int> start; char a[MAXN][MAXN]; bool vis[MAXN][MAXN]; pair<int, int> sm[MAXN][MAXN]; bool dfs(int x, int y, pair<int, int> shift) { if (vis[x][y]) { return !(sm[x][y] == shift); } vis[x][y] = true; sm[x][y] = shift; for (int i = 0; i < 4; i++) { int nx = x + dx[i]; int ny = y + dy[i]; pair<int, int> nshift = shift; if (nx >= n) { nx = 0; nshift.first++; } if (ny >= m) { ny = 0; nshift.second++; } if (nx < 0) { nx = n - 1; nshift.first--; } if (ny < 0) { ny = m - 1; nshift.second--; } if (a[nx][ny] != # ) if (dfs(nx, ny, nshift)) return true; } return false; } int main() { scanf( %d %d%*c , &n, &m); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { scanf( %c , &a[i][j]); if (a[i][j] == S ) start.first = i, start.second = j; } scanf( n ); } if (dfs(start.first, start.second, pair<int, int>(0, 0))) printf( Yes ); else printf( No ); return 0; }

#include <bits/stdc++.h> using namespace std; int n; int deg[1001]; int main() { cin >> n; for (int i = 0; i < n - 1; i++) { int a, b; cin >> a >> b; deg[a]++; deg[b]++; } int ans = 0; for (int i = 1; i <= n; i++) if (deg[i] == 1) ans++; cout << ans << endl; return 0; }

#include <bits/stdc++.h> using namespace std; pair<long long, long long> a[100100]; vector<long long> v, v2; int main() { int n, i; cin >> n; long long Answer = 0; for (i = 0; i < n; i++) { cin >> a[i].first >> a[i].second; v.push_back(a[i].first); v2.push_back(a[i].second); } sort(v.rbegin(), v.rend()); sort(v2.rbegin(), v2.rend()); for (i = 0; i < n; i++) { Answer += max(v[i], v2[i]) + 1; } cout << Answer; return 0; }

#include <bits/stdc++.h> using namespace std; int A[10005], B[10005]; long long int dp[10005]; int main() { int n, C; scanf( %d %d , &n, &C); for (int i = 0; i < n; i++) scanf( %d , &A[i]); for (int i = 0; i < n; i++) scanf( %d , &B[i]); for (int i = n - 1; i >= 0; i--) { for (int j = n; j >= 0; j--) { dp[j] += (long long int)j * (long long int)C + B[i]; if (j > 0) dp[j] = min(dp[j], dp[j - 1] + A[i]); } } long long int ret = dp[0]; for (int j = 0; j <= n; j++) ret = min(ret, dp[j]); printf( %lld n , ret); return 0; }

#include <bits/stdc++.h> using namespace std; int n, m, k; char hh[25]; string s; map<string, int> ma; int fr[100005]; int ax[100005]; int bx[100005]; int main() { scanf( %d%d%d , &n, &k, &m); int i, j, a, b; for (i = 1; i <= n; i++) { scanf( %s , hh); s = hh; ma[s] = i; } for (i = 1; i <= n; i++) scanf( %d , &ax[i]); for (i = 1; i <= k; i++) { scanf( %d , &a); bx[i] = 1e9; for (j = 1; j <= a; j++) { scanf( %d , &b); bx[i] = min(bx[i], ax[b]); fr[b] = i; } } long long res = 0; for (i = 1; i <= m; i++) { scanf( %s , hh); s = hh; res += bx[fr[ma[s]]]; } printf( %lld , res); return 0; }

#include <bits/stdc++.h> long long MOD = 1e9 + 7; using namespace std; int main() { long long n, t; cin >> n >> t; long long a[200010], x[200010], b[200010]; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n; i++) { cin >> x[i]; x[i]--; if ((i > 0 && x[i] < x[i - 1]) || x[i] < i) { cout << No ; return 0; } } int c[200010] = {}; for (int i = 0; i < n; i++) { long long temp = x[i]; c[x[i]] = 1; if (temp == i) { if (i > 0) b[i] = max(a[i] + t, b[i - 1] + 1); else b[i] = a[i] + t; if (i < n - 1 && b[i] >= a[i + 1] + t) { cout << No ; return 0; } } else { if (i > 0) b[i] = max(a[i + 1] + t, b[i - 1] + 1); else b[i] = a[i + 1] + t; } if (i < n - 1 && c[i] && b[i] >= a[i + 1] + t) { cout << No ; return 0; } } cout << Yes << endl; for (int i = 0; i < n; i++) { printf( %lld , b[i]); } return 0; }

#include <bits/stdc++.h> using namespace std; int counts[26]; int main() { string s; cin >> s; int N = s.size(); for (int i = 0; i < N; i++) counts[s[i] - a ]++; for (int i = 0; i < 26; i++) { if (counts[i] % 2 == 1) { int k = -1; for (int j = 25; j >= 0 && k < 0; j--) if (counts[j] % 2 == 1) k = j; if (k != -1) counts[i]++, counts[k]--; } } int pos = 0; int middle = -1; for (int i = 0; i < 26; i++) { if (counts[i] % 2 == 1) { middle = i; } for (int j = 0; j + 1 < counts[i]; j += 2) { s[pos++] = a + i; s[N - pos] = a + i; } } if (middle != -1) s[N / 2] = middle + a ; cout << s << endl; }

#include <bits/stdc++.h> using namespace std; const int oo = 0x3f3f3f3f; const double eps = 1e-9; void bset(int &b, int i) { b |= (1 << i); } void bunset(int &b, int i) { b = (b & ~(1 << i)); } int bget(int b, int i) { return b & (1 << i); } int bcnt(int b) { return __builtin_popcount(b); } map<char, int> color2id = {{ R , 0}, { G , 1}, { B , 2}, { Y , 3}, { W , 4}}; int pos(int col, int val) { return 5 * col + val; } int best; int cards; int stepmask[10]; int group[12][25], gn[12]; const int maxN = 100; int N; void check(int step, int hints) { if (best <= hints) return; for (int g = int(gn[step]) - 1; g >= (0); g--) { if (bcnt(group[step][g]) > 1) continue; group[step][g] = group[step][--gn[step]]; } if (gn[step] == 0) { best = min(best, hints); return; } if (step >= 10) return; gn[step + 1] = gn[step]; for (int g = (0); g < (gn[step]); g++) { group[step + 1][g] = group[step][g]; } check(step + 1, hints); gn[step + 1] = gn[step]; for (int g = (0); g < (gn[step]); g++) { int a = group[step][g] & stepmask[step]; int b = group[step][g] & ~stepmask[step]; if (!a || !b) { group[step + 1][g] = group[step][g]; } else { group[step + 1][g] = a; group[step + 1][gn[step + 1]++] = b; } } check(step + 1, hints + 1); } int main() { ios::sync_with_stdio(false); for (int c = (0); c < (5); c++) { for (int v = (0); v < (5); v++) bset(stepmask[c], pos(c, v)); for (int v = (0); v < (5); v++) bset(stepmask[v + 5], pos(c, v)); } cin >> N; for (int i = (0); i < (N); i++) { char c; int v; cin >> c >> v; int a = color2id.at(c), b = v - 1; bset(cards, pos(a, b)); } best = 8; gn[0] = 1; group[0][0] = cards; check(0, 0); cout << best << endl; }

#include <bits/stdc++.h> int main() { int n; scanf( %d , &n); if (n == 1) { printf( -1 ); return 0; } printf( %d %d %d , n, n + 1, n * (n + 1)); }

#include <bits/stdc++.h> using namespace std; template <class T> inline void umax(T &a, T b) { if (a < b) a = b; } const int maxn = 100 + 10; const int INF = 1e9 + 7; char a[maxn][maxn]; int c[maxn], d[maxn]; inline void solve(void) { int n; cin >> n; for (int i = (0); i < (n); i++) cin >> a[i]; for (int i = (0); i < (n); i++) cin >> c[i]; vector<int> ans; for (int i = (0); i < (n); i++) { if (d[i] != c[i]) continue; queue<int> v; v.push(i); while (!v.empty()) { int node = v.front(); ans.push_back(node); v.pop(); for (int j = (0); j < (n); j++) { if (a[node][j] == 1 ) { d[j]++; if (d[j] == c[j]) v.push(j); } } } } cout << ans.size() << endl; for (int i = (0); i < (ans.size()); i++) cout << ans[i] + 1 << ; } void init() { ios::sync_with_stdio(false); cin.tie(nullptr); } int main(int argc, const char *argv[]) { solve(); return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int n, xC = 0, XC = 0, i, f = 0; char c; char remain; cin >> n; string o = ; for (i = 0; i < n; i++) { cin >> c; if (c == x ) { xC++; o = o + x ; if (xC == n / 2) { remain = X ; i++; break; } } else { XC++; o = o + X ; if (XC == n / 2) { remain = x ; i++; break; } } } while (i < n) { cin >> c; if (c != remain) { f++; } o = o + remain; i++; } cout << f << endl; cout << o; return 0; }

#include <bits/stdc++.h> template <class T> bool MX(T &l, const T &r) { return l < r ? l = r, 1 : 0; } template <class T> bool MN(T &l, const T &r) { return l > r ? l = r, 1 : 0; } using namespace std; const long long MOD = 1e9 + 7; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, a, b, ans = 0, c; cin >> n >> a >> b; vector<int> s(n / 2); for (int i = 0; i < (int)n / 2; ++i) cin >> s[i]; reverse(s.begin(), s.end()); if (n % 2) { cin >> c; if (c == 2) ans += min(a, b); } for (int i = 0; i < (int)n / 2; ++i) { cin >> c; if (s[i] == 0) { if (c == 2) ans += a; if (c == 1) { cout << -1 << endl; return 0; } } else if (s[i] == 1) { if (c == 2) ans += b; if (c == 0) { cout << -1 << endl; return 0; } } else { if (c == 2) ans += 2 * min(a, b); if (c == 1) ans += b; if (c == 0) ans += a; } } cout << ans << endl; return 0; }

#include <bits/stdc++.h> using namespace std; const long long N = 5 * 1e5 + 100; long long n, m, nxt[N], MAX[N]; char s[N], t[N]; inline void add(long long &a, long long b, long long mod) { a = ((a + b >= mod) ? a + b - mod : a + b); } inline void del(long long &a, long long b, long long mod) { a = ((a - b < 0) ? a - b + mod : a - b); } inline void mul(long long &a, long long b, long long mod) { a = a * b % mod; } inline long long m_pow(long long a, long long b, long long mod) { long long ans = 1; while (b) { if (b & 1) mul(ans, a, mod); b >>= 1; mul(a, a, mod); } return ans; } inline long long read() { long long f = 1, x = 0; char s = getchar(); while (s < 0 || s > 9 ) { if (s == - ) f = -1; s = getchar(); } while (s >= 0 && s <= 9 ) { x = x * 10 + s - 0 ; s = getchar(); } return x * f; } struct Hash { long long a, b; } z[N]; Hash h[N], x, th[N]; Hash operator+(Hash a, Hash b) { add(a.a, b.a, 998244353); add(a.b, b.b, 342914237); return a; } Hash operator-(Hash a, Hash b) { del(a.a, b.a, 998244353); del(a.b, b.b, 342914237); return a; } Hash operator*(Hash a, Hash b) { mul(a.a, b.a, 998244353); mul(a.b, b.b, 342914237); return a; } Hash operator*(Hash a, long long b) { mul(a.a, b, 998244353); mul(a.b, b, 342914237); return a; } bool operator==(Hash a, Hash b) { return a.a == b.a && a.b == b.b; } Hash ask(long long l, long long r) { return h[r] - h[l - 1] * z[r - l + 1]; } void check(long long a, long long b, long long c, long long d) { assert(b + 1 == c); if (a > b || c > d || d > n || a <= 0) return; if (ask(a, b) + ask(c, d) == x) { vector<long long> X, Y; if (b - a < d - c) swap(a, c), swap(b, d); for (long long i = b; i >= a; i--) X.push_back(s[i] - 0 ); for (long long i = d; i >= c; i--) Y.push_back(s[i] - 0 ); for (long long i = 0; i < (long long)Y.size(); i++) X[i] += Y[i]; long long tmp = 0; for (long long i = 0; i < (long long)X.size(); i++) { X[i] += tmp; tmp = X[i] / 10; X[i] %= 10; } if (tmp) X.push_back(tmp); if ((long long)X.size() != m) return; bool bl = 1; for (long long i = 1; i <= m; i++) if (X[(long long)X.size() - i] != t[i] - 0 ) bl = 0; if (!bl) return; if (b > d) swap(a, c), swap(b, d); printf( %lld %lld n%lld %lld n , a, b, c, d); exit(0); } } long long find(long long i) { if (s[i] != t[1]) return 0; long long l = 1, r = m; while (l < r) { long long mid = l + ((r - l + 1) >> 1); if (ask(i, i + mid - 1) == th[mid]) l = mid; else r = mid - 1; } return l; } signed main() { scanf( %s%s , s + 1, t + 1); n = strlen(s + 1); m = strlen(t + 1); for (long long i = 1; i <= m; i++) { x = x * 10 + (Hash){t[i] - 0 , t[i] - 0 }; th[i] = x; } z[0] = (Hash){1, 1}; for (long long i = 1; i <= n; i++) z[i] = z[i - 1] * (Hash){10, 10}; for (long long i = 1; i <= n; i++) h[i] = h[i - 1] * 10 + (Hash){s[i] - 0 , s[i] - 0 }; for (long long i = 1; i <= n; i++) { check(i, i + m - 1, i + m, i + m + m - 1); check(i, i + m - 1, i + m, i + m + m - 2); check(i, i + m - 2, i + m - 1, i + m + m - 2); check(i, i + m - 2, i + m - 1, i + m + m - 3); } for (long long i = 1; i <= n; i++) { long long pos = find(i); if (pos == m) continue; check(i, i + m - 1, i + m, i + 2 * m - pos - 1); check(i, i + m - 1, i + m, i + 2 * m - pos - 2); check(i - (m - pos), i - 1, i, i + m - 1); check(i - (m - pos - 1), i - 1, i, i + m - 1); } assert(0); }

#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10; char buf[1 << 15], *fs, *ft; inline char getc() { return (ft == fs && (ft = (fs = buf) + fread(buf, 1, 1 << 15, stdin), ft == fs)) ? 0 : *fs++; } template <typename T> inline void read(T &x) { x = 0; T f = 1, ch = getchar(); while (!isdigit(ch) && ch ^ - ) ch = getchar(); if (ch == - ) f = -1, ch = getchar(); while (isdigit(ch)) x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar(); x *= f; } template <typename T> inline void write(T &x) { if (!x) { putchar( 0 ), putchar( n ); return; } if (x < 0) putchar( - ), x = -x; T num = 0, ch[16]; while (x) ch[++num] = x % 10 + 48, x /= 10; while (num) putchar(ch[num--]); putchar( n ); } int q[maxn], now; long long f[2][maxn], a[maxn], d[maxn], sum[maxn]; inline long long getUp(int j, int k) { return (f[now ^ 1][j] + sum[j]) - (f[now ^ 1][k] + sum[k]); } inline long long getDw(int j, int k) { return j - k; } int main() { int n, m, p; read(n); read(m); read(p); for (int i = 2; i <= n; ++i) read(d[i]), d[i] += d[i - 1]; for (int i = 1; i <= m; ++i) { int h; long long t; read(h); read(t); a[i] = t - d[h]; } sort(a + 1, a + m + 1); for (int i = 1; i <= m; ++i) sum[i] = sum[i - 1] + a[i], f[0][i] = 1e18; long long ans = 1e18; now = 1; for (int t = 1; t <= p; ++t) { int l = 1, r = 1; q[1] = 0; for (int i = 1; i <= m; ++i) { while (l < r && getUp(q[l + 1], q[l]) <= a[i] * getDw(q[l + 1], q[l])) ++l; f[now][i] = f[now ^ 1][q[l]] + (long long)a[i] * (i - q[l]) - (sum[i] - sum[q[l]]); while (l < r && getUp(i, q[r]) * getDw(q[r], q[r - 1]) <= getUp(q[r], q[r - 1]) * getDw(i, q[r])) --r; q[++r] = i; } ans = min(ans, f[now][m]); now ^= 1; } write(ans); return 0; }

#include <bits/stdc++.h> using namespace std; long long int gcd(long long int a, long long int b) { if (a == 0) return b; return gcd(b % a, a); } int main() { long long int n, a[100001], sum = 0, m; cin >> n; for (int i = 0; i < n; ++i) cin >> a[i]; sort(a, a + n); for (int i = 1; i < n; ++i) { sum += i * a[i] - a[i - 1]; a[i] += a[i - 1]; } sum = 2 * sum + a[n - 1]; m = gcd(sum, n); cout << sum / m << << n / m; }

#include <bits/stdc++.h> using namespace std; class Solution { public: int count(vector<int>& pieces, int p) { int n = pieces.size(); preprocess(n); vector<vector<vector<int>>> cur( n + 1, vector<vector<int>>(n + 1, vector<int>(n + 1, 0))); vector<vector<vector<int>>> nxt( n + 1, vector<vector<int>>(n + 1, vector<int>(n + 1, 0))); cur[0][0][0] = 1; for (int i = 0; i < n; ++i) { vector<int> cv; if (pieces[i] == -1) { cv.push_back(0); cv.push_back(1); } else { cv.push_back(pieces[i]); } for (auto& vv : nxt) { for (auto& v : vv) { fill(v.begin(), v.end(), 0); } } for (int j = 0; j <= i; ++j) { for (int k = 0; k <= j; ++k) { for (int l = 0; l <= i - j; ++l) { if (cur[j][k][l] == 0) { continue; } for (auto c : cv) { if (c == 0) { int nj = j + 1; nxt[nj][k + 1][l] = add(nxt[nj][k + 1][l], multiply(cur[j][k][l], multiply(1LL << j, multiply(1LL << (i - j - l), csums[l][0])))); nxt[nj][k][l] = add(nxt[nj][k][l], multiply(cur[j][k][l], multiply(1LL << j, multiply(1LL << (i - j - l), csums[l][1])))); } else { int nj = j; nxt[nj][k][l + 1] = add( nxt[nj][k][l + 1], multiply(cur[j][k][l], multiply(1LL << (i - j), multiply(1LL << (j - k), csums[k][0])))); nxt[nj][k][l] = add( nxt[nj][k][l], multiply(cur[j][k][l], multiply(1LL << (i - j), multiply(1LL << (j - k), csums[k][1])))); } } } } } cur.swap(nxt); } long long res = 0; for (int i = 0; i <= n; ++i) { for (int j = 0; j <= i; ++j) { for (int k = 0; k <= n - i; ++k) { if ((j + k) % 2 == p) { res = add(res, cur[i][j][k]); } } } } return res; } private: const static int M = 1e9 + 7; vector<int> fv; vector<int> ifv; vector<vector<int>> cs; vector<vector<int>> csums; long long add(long long a, long long b) { long long res = (a + b) % M; return res; } long long multiply(long long a, long long b) { return (a * b) % M; } long long pow(long long x, long long e) { long long res = 1; while (e > 0) { if (e & 1) { res = multiply(res, x); } x = multiply(x, x); e >>= 1; } return res; } void preprocess(int n) { fv.clear(); fv.resize(n + 1); ifv.clear(); ifv.resize(n + 1); cs.clear(); cs.resize(n + 1); csums.clear(); csums.resize(n + 1); for (auto& v : csums) { v.resize(2); fill(v.begin(), v.end(), 0); } fv[0] = 1; for (int i = 1; i <= n; ++i) { fv[i] = multiply(fv[i - 1], i); } ifv[0] = 1; ifv[n] = pow(fv[n], M - 2); for (int i = n - 1; i >= 1; --i) { ifv[i] = multiply(ifv[i + 1], i + 1); } for (int i = 1; i <= n; ++i) { cs[i].resize(i + 1); for (int j = 0; j <= i; ++j) { cs[i][j] = multiply(multiply(fv[i], ifv[j]), ifv[i - j]); } } csums[0][0] = 1; for (int i = 1; i <= n; ++i) { for (int j = 0; j <= i; ++j) { if (j % 2) { csums[i][1] = add(csums[i][1], cs[i][j]); } else { csums[i][0] = add(csums[i][0], cs[i][j]); } } } } }; int main(int argc, char** argv) { ios::sync_with_stdio(false); cin.tie(0); int n; int p; cin >> n >> p; vector<int> nums(n); for (int i = 0; i < n; ++i) { cin >> nums[i]; } Solution sol; cout << sol.count(nums, p) << endl; return 0; }

#include <bits/stdc++.h> using namespace std; using namespace chrono; struct stopwatch { time_point<high_resolution_clock> last_tick; bool notock = false; void tick() { last_tick = high_resolution_clock::now(); } void tock() const { duration<double> dur = high_resolution_clock::now() - last_tick; cerr << Time: << dur.count() << n ; } stopwatch() { tick(); } stopwatch(int) { tick(); notock = true; } ~stopwatch() { if (!notock) { tock(); } } }; template <int m> struct modint { unsigned x; modint() : x(0) {} modint(long long arg) { arg %= m; if (arg < 0) { x = arg + m; } else { x = arg; } } modint& operator+=(const modint& other) { x += other.x; if (x >= m) { x -= m; } return *this; } modint& operator*=(const modint& other) { x = (x * 1ll * other.x) % m; return *this; } modint& operator-=(const modint& other) { x += m - other.x; if (x >= m) { x -= m; } return *this; } modint operator+(const modint& other) const { modint tmp = *this; tmp += other; return tmp; } modint operator-(const modint& other) const { modint tmp = *this; tmp -= other; return tmp; } modint operator*(const modint& other) const { modint tmp = *this; tmp *= other; return tmp; } explicit operator int() const { return x; } modint& operator++() { ++x; if (x == m) { x = 0; } return *this; } modint& operator--() { if (x == 0) { x = m - 1; } else { --x; } return *this; } modint operator++(int) { modint tmp = *this; ++*this; return tmp; } modint operator--(int) { modint tmp = *this; --*this; return tmp; } bool operator==(const modint& other) const { return x == other.x; } bool operator!=(const modint& other) const { return x != other.x; } template <class T> modint operator^(T arg) const { if (arg == 0) { return 1; } if (arg == 1) { return x; } auto t = *this ^ (arg >> 1); t *= t; if (arg & 1) { t *= *this; } return t; } template <class T> modint operator^=(T arg) { return *this = *this ^ arg; } }; const int MOD = 1051131; const int TOT = 700752; int m, s, n; long long t; valarray<modint<MOD> > a; valarray<modint<MOD> > em_inv_slow(int m, int n, const valarray<modint<MOD> >& a) { int k = 0; valarray<modint<MOD> > b(n); for (int i = 0; i < m; i++) { int w = 1 << (m - i - 1); int c = 1 << i; modint<MOD> mult = modint<MOD>(2) ^ (TOT - i - 1); for (int j = 0; j < w; j++) { modint<MOD> t = a[k] * mult; b[slice(j + 0, c, 2 * w)] -= valarray<modint<MOD> >(t, c); b[slice(j + w, c, 2 * w)] += valarray<modint<MOD> >(t, c); k++; } } modint<MOD> t = (modint<MOD>(2) ^ (TOT - m)); b += a[n - 1] * t; return b; } void em_inv(int m, int n, valarray<modint<MOD> >& a) { int k = 0; valarray<long long> bll(n); for (int i = 0; i < m; i++) { const int w = 1 << (m - i - 1); long long mult = (int)(modint<MOD>(2) ^ (TOT - i - 1)); for (int j0 = 0; j0 < n; j0 += w + w) { for (int j = 0; j < w; j++) bll[j + j0] -= (int)a[k + j] * mult; for (int j = 0; j < w; j++) bll[j + j0 + w] += (int)a[k + j] * mult; } k += w; } modint<MOD> t = (modint<MOD>(2) ^ (TOT - m)) * a[n - 1]; for (int i = 0; i < n; i++) a[i] = bll[i]; a += t; } valarray<modint<MOD> > em_slow(int m, int n, const valarray<modint<MOD> >& a) { int k = 0; valarray<modint<MOD> > b(n); for (int i = 0; i < m; i++) { int w = 1 << (m - i - 1); int c = 1 << i; for (int j = 0; j < w; j++) { b[k] -= a[slice(j + 0, c, 2 * w)].sum(); b[k] += a[slice(j + w, c, 2 * w)].sum(); k++; } } b[k++] += a.sum(); return b; } valarray<modint<MOD> > em(int m, int n, const valarray<modint<MOD> >& a) { int k = 0; valarray<modint<MOD> > b(n); for (int i = 0; i < m; i++) { const int w = 1 << (m - i - 1); for (int j0 = 0; j0 < n; j0 += w + w) { for (int j = 0; j < w; j++) b[k + j] -= a[j + j0]; for (int j = 0; j < w; j++) b[k + j] += a[j + j0 + w]; } k += w; } b[k++] += a.sum(); return b; } valarray<modint<MOD> > eigenvals(int m, int n, long long t) { int k = 0; valarray<modint<MOD> > b(n); for (int i = 0; i < m; i++) { int w = 1 << (m - i - 1); modint<MOD> x = 1 + (i - 1) * (n / 2); b[slice(k, w, 1)] = x ^ t; k += w; } b[k++] = modint<MOD>(1 + (n / 2) * m) ^ t; return b; } void pr(const valarray<modint<MOD> >& a) { for (modint<MOD> x : a) cerr << (int)x << ; cerr << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); cerr.tie(nullptr); stopwatch sw(0); cin >> m >> t >> s; n = 1 << m; a.resize(n); for (int i = 0; i < s; i++) { int x; cin >> x; a[i] = x; } sw.tock(); for (int i = s; i < n; i++) a[i] = a[i - s] * 101 + 10007; sw.tock(); a = em(m, n, a); sw.tock(); { valarray<modint<MOD> > b = eigenvals(m, n, t); sw.tock(); for (int i = 0; i < n; i++) a[i] = a[i] * b[i]; sw.tock(); } em_inv(m, n, a); sw.tock(); int xr = 0; for (modint<MOD> x : a) xr ^= (int)x; sw.tock(); cout << xr << n ; }

#include <bits/stdc++.h> using namespace std; int main() { int T, money; cin >> T >> money; int n; int g; vector<int> lista; for (int i = 1; i <= T; i++) { cin >> n; int brk = 0; for (int j = 0; j < n; j++) { cin >> g; if (brk == 0 && money > g) { lista.push_back(i); brk = 1; } } } cout << lista.size() << endl; for (int i = 0; i < lista.size(); i++) { cout << lista[i] << ; } return 0; }

#include <bits/stdc++.h> #pragma GCC optimize(3, inline , Ofast ) using namespace std; int p[1010]; bool vis[1010]; void dfs(int pos) { if (vis[pos]) return (void)(printf( %d , pos)); else vis[pos] = 1, dfs(p[pos]); } int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &p[i]); for (int i = 1; i <= n; i++) memset(vis, 0, sizeof vis), dfs(i); }

#include <bits/stdc++.h> using namespace std; const int maxn = 100100; bool vis[maxn]; long long val[3][maxn]; long long mii[3]; vector<int> g[maxn]; vector<int> a; int ans[maxn]; int d[maxn]; void dfs(int now) { a.push_back(now); vis[now] = 1; for (int i = 0; i < g[now].size(); i++) { if (vis[g[now][i]]) continue; dfs(g[now][i]); } } int main() { int n; scanf( %d , &n); for (int j = 0; j < 3; j++) { for (int i = 1; i <= n; i++) { scanf( %d , &val[j][i]); } } for (int i = 0; i < n - 1; i++) { int f, t; scanf( %d%d , &f, &t); g[f].push_back(t); g[t].push_back(f); d[f]++; d[t]++; if (d[f] > 2 || d[t] > 2) { printf( -1 n ); return 0; } } vector<int> temp; temp.push_back(0); temp.push_back(1); temp.push_back(2); for (int i = 1; i <= n; i++) { if (d[i] == 1) { dfs(i); break; } } long long mi = 1ll << 60; for (int _ = 0; _ < 6; _++) { long long now = 0; for (int i = 0; i < n; i++) { now += val[temp[i % 3]][a[i]]; } if (now < mi) { mi = now; for (int j = 0; j < 3; j++) { mii[j] = temp[j]; } } next_permutation(temp.begin(), temp.end()); } printf( %lld n , mi); for (int i = 0; i < n; i++) { ans[a[i]] = mii[i % 3]; } for (int i = 1; i <= n; i++) { printf( %d , ans[i] + 1); } puts( ); return 0; }

#include <bits/stdc++.h> using namespace std; int dp[510][510]; long long MOD; vector<string> v; long long nc2(long long num) { return (num * (num - 1)) / 2; } int recur(int ones, int zeros) { if (ones == 0 and zeros == 0) return 1; if (dp[ones][zeros] != -1) { return dp[ones][zeros] % MOD; } long long ret = 0; if (ones > 1) { ret = (ret + ((recur(ones - 2, zeros) * nc2(ones)) % MOD)) % MOD; } if (zeros > 1) { ret = (ret + ((recur(ones + 2, zeros - 2) * nc2(zeros)) % MOD)) % MOD; } if (ones >= 1 && zeros >= 1) { ret = (ret + ((recur(ones, zeros - 1) * ((ones * zeros) % MOD)) % MOD)) % MOD; } dp[ones][zeros] = ret % MOD; return dp[ones][zeros]; } int solve(int n, int m) { int ones = 0; int zeros = 0; for (int i = 0; i < n; i++) { int cnt = 0; for (int j = 0; j < m; j++) { if (v[j][i] == 1 ) cnt++; } if (cnt == 1) ones++; if (cnt == 0) zeros++; } memset(dp, -1, sizeof(dp)); int res = recur(ones, zeros); return res; } int main() { int n, m; cin >> n >> m >> MOD; string line = ; for (int i = 0; i < m; i++) { cin >> line; v.push_back(line); } int res = solve(n, m); cout << res << endl; return 0; }

#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 10; inline int read() { char ch = getchar(); int x = 0, f = 1; while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = (x << 1) + (x << 3) - 0 + ch; ch = getchar(); } return x * f; } int n, k, size[N]; long long ans, f[N][5]; vector<int> g[N]; void dfs(int u, int fa, int d) { size[u] = 1; f[u][d % k] = 1; for (auto &v : g[u]) { if (v == fa) continue; dfs(v, u, d + 1); size[u] += size[v]; ans += 1ll * (n - size[v]) * size[v]; for (int i = 0; i < k; i++) { for (int j = 0; j < k; j++) { int z = ((i + j - 2 * d) % k + k) % k; z = (k - z) % k; ans += 1ll * z * f[u][i] * f[v][j]; } } for (int i = 0; i < k; i++) f[u][i] += f[v][i]; } } int main() { n = read(), k = read(); for (int i = 1; i <= n - 1; i++) { int a = read(), b = read(); g[a].push_back(b); g[b].push_back(a); } dfs(1, 0, 0); printf( %lld n , ans / k); }

#include <bits/stdc++.h> using namespace std; int main(void) { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; string a[n], b[n]; map<string, int> m; for (int i = 0; i < n; ++i) { cin >> a[i]; ++m[a[i]]; } for (int i = 0; i < n; ++i) { cin >> b[i]; --m[b[i]]; } int ans = 0; vector<string> v = { XXXL , XXXS , XXL , XXS , XL , XS , S , L , M }; ans = (abs(m[ XXXL ]) + abs(m[ XXXS ])) / 2; ans += (abs(m[ XXL ]) + abs(m[ XXS ])) / 2; ans += (abs(m[ XL ]) + abs(m[ XS ])) / 2; ans += (abs(m[ S ]) + abs(m[ L ]) + abs(m[ M ])) / 2; cout << ans; }

#include <bits/stdc++.h> using namespace std; long long n, q, ans[50005], sum[50005], a[50005], p[50005], x[50005], cont, pos, us[50005]; int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n >> q; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 2; i <= n; i++) cin >> p[i]; for (int i = 0; i < q; i++) cin >> x[i]; for (int i = 1; i <= n; i++) { pos = i; cont = 1; while (pos != 1) { us[pos] = cont; cont++; pos = p[pos]; } us[pos] = cont; for (int j = 0; j < q; j++) { sum[j] += us[x[j]]; if (us[x[j]]) { ans[j]++; j += a[i] - 1; } } pos = i; cont = 1; while (pos != 1) { us[pos] = 0; cont++; pos = p[pos]; } us[pos] = 0; } for (int i = 0; i < q; i++) cout << sum[i] - ans[i] << << ans[i] << n ; return 0; }

#include <bits/stdc++.h> using namespace std; string S, T; int n, m; int nxt[200005][30]; unsigned long long hashS[200005][30], hashT[200005][30], bpw[200005]; unsigned long long ht; int base = 10007; int f[30]; vector<int> ans; bool chk(int p) { memset(f, 0, sizeof(f)); int ps, pt; unsigned long long hps, hpt, temp = 0; for (int j = 1; j <= 26; j++) { if (nxt[p][j] > p + m - 1) continue; ps = j; pt = T[(nxt[p][j] - p) + 1] - a + 1; if (f[ps] == pt) continue; else if (f[ps] && f[ps] != pt) return 0; else { f[ps] = pt; f[pt] = ps; hps = hashS[p + m - 1][ps] - bpw[m] * hashS[p - 1][ps]; hpt = hashT[m][pt]; if (hps != hpt || hashS[p + m - 1][pt] - bpw[m] * hashS[p - 1][pt] != hashT[m][ps]) { return 0; } temp += hps * pt; if (ps != pt) temp += ps * hashT[m][ps]; } } return temp == ht; } int main() { scanf( %d%d , &n, &m); cin >> S >> T; S = % + S; T = % + T; for (int i = 1; i <= m; i++) { ht = ht * base + T[i] - a + 1; } for (int i = 1; i <= 26; i++) { nxt[n + 1][i] = n + 1; } for (int i = n; i >= 1; i--) { for (int j = 1; j <= 26; j++) { if (S[i] == a + j - 1) nxt[i][j] = i; else nxt[i][j] = nxt[i + 1][j]; } } bpw[0] = 1; for (int i = 1; i <= n; i++) { bpw[i] = bpw[i - 1] * base; } for (int i = 1; i <= n; i++) { for (int j = 1; j <= 26; j++) { hashS[i][j] = hashS[i - 1][j] * base + (S[i] == ( a + j - 1) ? 1 : 0); } } for (int i = 1; i <= m; i++) { for (int j = 1; j <= 26; j++) { hashT[i][j] = hashT[i - 1][j] * base + (T[i] == ( a + j - 1) ? 1 : 0); } } for (int i = 1; i <= n - m + 1; i++) { if (chk(i)) ans.push_back(i); } cout << ans.size() << endl; for (int i = 0; i < ans.size(); i++) { printf( %d , ans[i]); } return 0; }

#include <bits/stdc++.h> int main() { int t, n; scanf( %d , &t); while (t--) { scanf( %d , &n); if (n == 1) { printf( -1 n ); } else { printf( 2 ); for (int i = 1; i < n; i++) { printf( 7 ); } printf( n ); } } }

#include <bits/stdc++.h> using namespace std; inline long long read() { long long x = 0, f = 1; char c = getchar(); while ((c < 0 || c > 9 ) && (c != - )) c = getchar(); if (c == - ) f = -1, c = getchar(); while (c >= 0 && c <= 9 ) x = x * 10 + c - 0 , c = getchar(); return x * f; } const int N = 3e4 + 10; int n; vector<int> e[N]; int cnt, p[N], fa[N], vis[N]; bool flag[N]; inline void dfs(int u) { vis[u] = 1; for (auto v : e[u]) { if (v == fa[u]) continue; fa[v] = u; if (!vis[v]) dfs(v); else { for (int now = u; now != v; now = fa[now]) flag[p[++cnt] = now] = 1; flag[p[++cnt] = v] = 1; } if (cnt) break; } } long long f[N], g[N], siz[N]; inline void dfs(int u, int fa) { siz[u] = 1; for (auto v : e[u]) { if (v == fa || flag[v]) continue; dfs(v, u), f[u] += g[v], siz[u] += siz[v]; } g[u] = f[u] + siz[u]; } long long dp[N], last[N], pre[N], ans; inline void dfs(int u, int fa, long long sum) { ans = max(ans, sum + n + f[u]); for (auto v : e[u]) if (v != fa) dfs(v, u, sum + n - siz[v] + f[u] - g[v]); } inline void solve() { long long sum = 0; for (register int i = (1); i <= (cnt * 2); i++) last[i] = siz[p[i]], pre[i] = pre[i - 1] + last[i], sum += f[p[i]]; for (register int i = (2); i <= (cnt - 1); i++) { for (register int l = (1); l <= (cnt * 2 - i + 1); l++) { int r = l + i - 1; long long tmp = pre[r] - pre[l - 1]; dp[l] = max(last[l] + tmp, last[l + 1] + tmp); } for (register int j = (1); j <= (cnt * 2 - i + 1); j++) last[j] = dp[j]; } ans = 0; for (register int i = (1); i <= (cnt); i++) { ans = max(ans, n + sum / 2 + dp[i + 1]); for (auto v : e[p[i]]) if (!flag[v]) dfs(v, p[i], n - siz[v] + sum / 2 - f[p[i]] + f[p[i]] - g[v] + dp[i + 1]); } printf( %lld n , ans); } int main() { n = read(); for (register int i = (1); i <= (n); i++) { int x = read() + 1, y = read() + 1; e[x].push_back(y), e[y].push_back(x); } dfs(1); for (register int i = (1); i <= (cnt); i++) dfs(p[i], 0); for (register int i = (1); i <= (cnt); i++) p[cnt + i] = p[i]; solve(); }

#include <bits/stdc++.h> using namespace std; long long inv_euclid(long long a, long long m = 998244353) { long long m0 = m; long long y = 0, x = 1; if (m == 1) return 0; while (a > 1) { long long q = a / m; long long t = m; m = a % m, a = t; t = y; y = x - q * y; x = t; } if (x < 0) x += m0; return x; } long long power(long long x, long long y, long long p) { long long 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; } long long max(long long a, long long b) { if (a > b) return a; return b; } long long min(long long a, long long b) { if (a < b) return a; return b; } long long ssum(long long n) { return (n * (n + 1)) / 2; } long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } long long lcm(long long a, long long b) { return (a * b) / (gcd(a, b)); } void solve() { long long n; cin >> n; vector<long long> v(n); for (long long i = 0; i < n; i++) cin >> v[i]; while (v.size() && v[v.size() - 1] == 0) v.pop_back(); reverse(v.begin(), v.end()); while (v.size() && v[v.size() - 1] == 0) v.pop_back(); long long ans = 0; for (auto i : v) ans += (i == 0); cout << ans << n ; } int main() { long long tttt; cin >> tttt; while (tttt--) { solve(); } }

#include <bits/stdc++.h> using namespace std; void solve() { long long n, m, k, i, j, count = 0, sum = 0, maxi = 0, mini = 1e18, flag = 0; cin >> n; vector<long long> res; vector<char> temp; string a, b; cin >> a >> b; if (a == b) { cout << 0 << n ; return; } if (n == 1 && a[0] != b[0]) { cout << 1 << << 1 << n ; return; } for (i = 0; i < n / 2; i++) { temp.push_back(a[i]); if (a[n - i - 1] == 1 ) temp.push_back( 0 ); else temp.push_back( 1 ); } if (n % 2) temp.push_back(a[n / 2]); i = 0; j = n - 1; while (j > 0) { if (temp[i] == b[j]) { res.push_back(0); res.push_back(j); } else res.push_back(j); j--; i++; } if (j == 0) { if (temp[i] == b[j]) ; else res.push_back(0); } cout << res.size() << ; for (i = 0; i < res.size(); i++) { cout << res[i] + 1 << ; } cout << n ; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long t = 1; cin >> t; while (t--) { solve(); } }

#include <bits/stdc++.h> using namespace std; const int maxn = 5005; int u[maxn], v[maxn], w[maxn], dp[maxn][maxn], parent[maxn][maxn], x[maxn]; int main() { int n, m, t, pos; cin >> n >> m >> t; for (int i = 0; i < m; i++) { cin >> u[i] >> v[i] >> w[i]; } memset(dp, 0x3f, sizeof(dp)); dp[1][1] = 0; for (int i = 2; i <= n; i++) { for (int j = 0; j < m; j++) { if (dp[i - 1][u[j]] + w[j] < dp[i][v[j]]) { dp[i][v[j]] = dp[i - 1][u[j]] + w[j]; parent[i][v[j]] = u[j]; } } if (dp[i][n] <= t) pos = i; } int id = n; for (int i = pos; i >= 1; i--) { x[i] = id; id = parent[i][id]; } cout << pos << endl; for (int i = 1; i <= pos; i++) cout << x[i] << ; return 0; }

#include <bits/stdc++.h> using namespace std; int k, n, m; const int dx[4] = {-1, 1, 0, 0}; const int dy[4] = {0, 0, -1, 1}; int bx, by, s, ansx[1000000], ansy[1000000]; bool g[510][510]; char ansc[1000000]; int dfs(int x, int y) { if (x > 0 && y > 0 && x <= n && y <= m && g[x][y] == 0) { g[x][y] = 1; s++; ansc[s] = B ; ansx[s] = x; ansy[s] = y; int nx, ny; for (int i = 0; i < 4; i++) { nx = x + dx[i]; ny = y + dy[i]; dfs(nx, ny); } if (bx != x || by != y) { s++; ansc[s] = D ; ansx[s] = x; ansy[s] = y; s++; ansc[s] = R ; ansx[s] = x; ansy[s] = y; } } } int main() { cin >> n >> m; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { char c; cin >> c; if (c == # ) g[i][j] = true; } for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) if (!g[i][j]) bx = i, by = j, dfs(i, j); cout << s << endl; for (int i = 1; i <= s; i++) printf( %c %d %d n , ansc[i], ansx[i], ansy[i]); return 0; }

#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; int n, c1, c2; long long f[501]; long long c[501][501]; long long dp[501][501]; long long gao(int a, int b) { if (a == 0 && b == 0) { return 1; } if (dp[a][b] == -1) { long long& cur = dp[a][b] = 0; if (a > 0) { if (a >= 1) { for (int i = 0; i <= b; ++i) { cur = (cur + gao(a - 1, b - i) * c[b][i] % MOD * f[i]) % MOD; } } if (a >= 2) { for (int i = 0; i <= b; ++i) { cur = (cur + gao(a - 2, b - i) * c[b][i] % MOD * (a - 1) % MOD * f[i + 1]) % MOD; } } } else { for (int i = 0; i < b; ++i) { cur = (cur + gao(a, b - i - 1) * c[b - 1][i] % MOD * f[i]) % MOD; } } } return dp[a][b] % MOD; } int main() { for (int i = f[0] = 1; i <= 500; ++i) { f[i] = f[i - 1] * i % MOD; } for (int i = 0; i <= 500; ++i) { c[i][0] = c[i][i] = 1; for (int j = 1; j < i; ++j) { c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % MOD; } } c1 = c2 = 0; scanf( %d , &n); for (int i = 0; i < n; ++i) { int x; scanf( %d , &x); ++(x == 1 ? c1 : c2); } memset(dp, -1, sizeof(dp)); int res = gao(c1, c2) % MOD; printf( %d n , res); return 0; }