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 n, k; cin >> n >> k; int arr[n]; for (int i = 0; i < n; i++) { cin >> arr[i]; } int ans = 0; for (int i = 1; i < n; i++) { int a = max(0, k - (arr[i] + arr[i - 1])); arr[i] += a; ans += a; } cout << ans << n ; for (int i = 0; i < n; i++) cout << arr[i] << ; }
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int c = 0, i; for (i = 4; i < s.size(); i++) { if (s[i - 4] == D && s[i - 3] == a && s[i - 2] == n && s[i - 1] == i && s[i] == l ) c++; } for (i = 3; i < s.size(); i++) { if (s[i - 3] == O && s[i - 2] == l && s[i - 1] == y && s[i] == a ) c++; } for (i = 4; i < s.size(); i++) { if (s[i - 4] == S && s[i - 3] == l && s[i - 2] == a && s[i - 1] == v && s[i] == a ) c++; } for (i = 2; i < s.size(); i++) { if (s[i - 2] == A && s[i - 1] == n && s[i] == n ) c++; } for (i = 5; i < s.size(); i++) { if (s[i - 5] == N && s[i - 4] == i && s[i - 3] == k && s[i - 2] == i && s[i - 1] == t && s[i] == a ) c++; } if (c == 1) cout << YES ; else cout << NO ; }
#include <bits/stdc++.h> using namespace std; const int N = 100001; int main(void) { char arr1[N] = {0}; char arr2[N] = {0}; char str1[2] = {0}, str2[2] = {0}; scanf( %[^ n]s , arr1); scanf( %[^ n]s , arr2); if (strlen(arr1) != strlen(arr2)) { cout << NO n ; return 0; } int a = 0; for (int i = 0, j = 0, k = 0; i < strlen(arr1); i++) { if (arr1[i] != arr2[i]) { a++; if (a <= 2) { str1[j++] = arr1[i]; str2[k++] = arr2[i]; } } } if (a == 2) { if ((str1[1] == str2[0]) && (str1[0] == str2[1])) cout << YES n ; else cout << NO n ; } else cout << NO n ; return 0; }
#include <bits/stdc++.h> using namespace std; int n, k; int main() { cin >> n >> k; if (n / 2 > k) return !printf( -1 ); if (n == 1) { if (k == 0) printf( 1 ); else printf( -1 ); return 0; } int t = k - (n - 2) / 2; printf( %d %d , t, 2 * t); for (int i = 1; i <= n - 2; ++i) printf( %d , i + 2 * t); return 0; }
#include <bits/stdc++.h> using namespace std; void input() {} void solve() { long long int n, m; cin >> n >> m; long long int a[n][m]; long long int flag = 1, temp = 0; for (long long int i = 0; i < n; i++) { for (long long int j = 0; j < m; j++) { char ch; cin >> ch; if (ch == A ) { a[i][j] = 1; } else { a[i][j] = 0; } if (a[i][j]) { flag = 0; } temp += a[i][j]; } } if (temp == n * m) { cout << 0 ; return; } if (flag) { cout << MORTAL ; return; } for (long long int i = 0; i < 1; i++) { long long int cnt1 = 0, cnt2 = 0; for (long long int j = 0; j < m; j++) { if (a[0][j]) { cnt1++; } if (a[n - 1][j]) { cnt2++; } } if (cnt1 == m \|\| cnt2 == m) { cout << 1 ; return; } } for (long long int j = 0; j < 1; j++) { long long int cnt1 = 0, cnt2 = 0; for (long long int i = 0; i < n; i++) { if (a[i][0]) { cnt1++; } if (a[i][m - 1]) { cnt2++; } } if (cnt1 == n \|\| cnt2 == n) { cout << 1 ; return; } } for (long long int i = 1; i < n - 1; i++) { long long int cnt = 0; for (long long int j = 0; j < m; j++) { if (a[i][j]) { cnt++; } } if (cnt == m) { cout << 2 ; return; } } for (long long int j = 1; j < m - 1; j++) { long long int cnt = 0; for (long long int i = 0; i < n; i++) { if (a[i][j]) { cnt++; } } if (cnt == n) { cout << 2 ; return; } } if (a[0][m - 1] \|\| a[0][0] \|\| a[n - 1][0] \|\| a[n - 1][m - 1]) { cout << 2 ; return; } long long int cnt = 0; for (long long int i = 0; i < n; i++) { cnt += a[i][0]; cnt += a[i][m - 1]; } for (long long int i = 0; i < m; i++) { cnt += a[0][i]; cnt += a[n - 1][i]; } if (cnt) { cout << 3 ; } else { cout << 4 ; } } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); input(); int t = 1, i = 1; cin >> t; while (t--) { solve(); cout << n ; } }
#include <bits/stdc++.h> using namespace std; long long pow(long long p, long long r, long long m) { long long ans = 1; while (r > 0) { if (r & 1) { ans = ((ans % m) * (p % m)) % m; } r = r >> 1; p = ((p % m) * (p % m)) % m; } return ans; } string con(string s) { for (long long i = 0; i < s.length(); i++) { s[i] = toupper(s[i]); } return s; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); ; long long t; cin >> t; while (t--) { string s; cin >> s; stack<long long> s1; for (char i : s) { if (!s1.empty() && i == B ) s1.pop(); else s1.push(i); } cout << s1.size() << n ; } }
#include <bits/stdc++.h> using namespace std; string dna = ACGT ; string word[20]; set<string> words; map<string, int> mp; string pm[110]; pair<int, int> graph[110][20][4]; long long dp[1010][110][20]; int main() { ios::sync_with_stdio(false); int N, K, i, j, k, l, x; cin >> N >> K; for (i = 0; i < K; i++) cin >> word[i]; for (i = 0; i < K; i++) words.insert(word[i]); for (i = 0; i < K; i++) for (j = 1; j <= word[i].length(); j++) mp[word[i].substr(0, j)] = 0; mp[ ] = 0; int s = 0; for (auto itr = mp.begin(); itr != mp.end(); itr++) { (itr->second) = s; pm[s] = (itr->first); s++; } for (i = 0; i < s; i++) { for (j = 0; j < pm[i].length() + 1; j++) { for (k = 0; k < 4; k++) { string s = pm[i] + dna[k]; int nextst = -1; for (l = 0;; l++) { if (mp.find(s.substr(l)) != mp.end()) { nextst = mp[s.substr(l)]; break; } } bool cover = false; for (l = 0; l < pm[i].length() - j + 1; l++) if (words.find(s.substr(l)) != words.end()) cover = true; graph[i][j][k] = make_pair(-1, -1); int nextcover = j + 1; if (cover) nextcover = 0; if (nextcover >= 10 \|\| nextcover > pm[nextst].length()) continue; graph[i][j][k] = make_pair(nextst, nextcover); } } } int start = mp[ ]; dp[0][start][0] = 1; for (i = 0; i < N; i++) { for (j = 0; j < s; j++) { for (k = 0; k < 10; k++) { if (dp[i][j][k] != 0) { for (x = 0; x < 4; x++) { pair<int, int> p = graph[j][k][x]; if (p.first != -1) { int i2 = i + 1, j2 = p.first, k2 = p.second; dp[i2][j2][k2] = (dp[i][j][k] + dp[i2][j2][k2]) % 1000000009ll; } } } } } } long long ans = 0; for (i = 0; i < s; i++) ans = (ans + dp[N][i][0]) % 1000000009ll; cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 100005; vector<int> v[2][N]; int a[N], q[N], n; bool vst[2][N]; void bfs(int val) { int i, j, qh = 0, qe = 0, k = val - 1, s, out; for (i = 1; i <= n; i++) if (a[i] == val) q[qe++] = i, vst[k][i] = 1; while (qh < qe) { out = q[qh++]; if (val != 2 \|\| a[out] != 1) for (i = 0, s = v[k][out].size(); i < s; i++) if (!vst[k][j = v[k][out][i]]) q[qe++] = j, vst[k][j] = 1; } } int main() { int i, j, e; while (2 == scanf( %d%d , &n, &e)) { for (i = 1; i <= n; i++) scanf( %d , a + i), v[0][i].clear(), v[1][i].clear(); while (e--) { scanf( %d%d , &i, &j); v[0][i].push_back(j); v[1][j].push_back(i); } memset(vst, 0, sizeof vst); bfs(1); bfs(2); for (i = 1; i <= n; i++) puts(vst[0][i] && vst[1][i] ? 1 : 0 ); } return 0; }
#include <bits/stdc++.h> using namespace std; bool isPossible(long long k, long long x, long long y, long long p, long long q) { p = p * k; q = q * k; if (x > p \|\| y > q) { return false; } if (q - y < p - x) { return false; } return true; } long long solve(long long x, long long y, long long p, long long q) { long long low = 1; long long high = 1e9; while (low < high) { long long mid = low + (high - low) / 2; if (!isPossible(mid, x, y, p, q)) { low = mid + 1; } else { high = mid; } } if (!isPossible(low, x, y, p, q)) { return -1; } return (q * low - y); } int main() { long long t; cin >> t; while (t--) { long long x, y, p, q; cin >> x >> y >> p >> q; cout << solve(x, y, p, q) << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; inline bool eq(double a, double b) { return fabs(a - b) < 1e-9; } const long long int inf = 1e15; inline int two(int n) { return 1 << n; } inline int test(int n, int b) { return (n >> b) & 1; } inline void set_bit(int& n, int b) { n \|= two(b); } inline void unset_bit(int& n, int b) { n &= ~two(b); } inline int last_bit(int n) { return n & (-n); } inline int ones(int n) { int res = 0; while (n && ++res) n -= n & (-n); return res; } string str; string sol(int n) { string ans; for (int i = (0); i < (n); i++) { ans = ans + (i < n / 2 ? 4 : 7 ); } return ans; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> str; int n = str.length(); if (n & 1) { cout << sol(n + 1) << endl; } else { int ind = -1, c4 = 0, c7 = 0; for (int i = (0); i < (n); i++) { if (str[i] > 7 ) { if (ind == -1) { cout << sol(n + 2) << endl; return 0; } else { str[ind] = 7 ; str[i] = 4 ; c7++; if (abs(c4 - c7) > n - i - 1) { cout << sol(n + 2) << endl; return 0; } else { int j = i + 1; for (int k = (j); k < (n); k++) { str[k] = 4 ; c4++; } for (int k = (n - 1); k >= (i + 1); k--) { if (c4 > c7) { str[k] = 7 ; c4--; c7++; } else { break; } } cout << str << endl; return 0; } } } else if (str[i] != 4 && str[i] != 7 ) { if (str[i] < 4 ) { str[i] = 4 ; c4++; } else { str[i] = 7 ; c7++; } if (abs(c4 - c7) > n - i - 1) { cout << sol(n + 2) << endl; return 0; } else { int j = i + 1; for (int k = (j); k < (n); k++) { str[k] = 4 ; c4++; } for (int k = (n - 1); k >= (i + 1); k--) { if (c4 > c7) { str[k] = 7 ; c4--; c7++; } else { break; } } cout << str << endl; return 0; } } else { if (str[i] == 4 ) { ind = i; c4++; } else c7++; } } if (c4 > c7) { for (int i = (ind); i >= (0); i--) { if (c4 > c7) { str[i] = 7 ; c4--; c7++; } else { break; } } cout << str << endl; } else if (c7 > c4) { int cc4 = 0, cc7 = 0; for (int i = 0; i <= ind; i++) { if (str[i] == 4 ) cc4++; else cc7++; } c4 = cc4, c7 = cc7; for (int i = (ind); i >= (0); i--) { if (str[i] == 4 ) { if (abs(c4 - c7 - 1) <= n - i - 1) { str[i] = 7 ; c4--; c7++; int j = i + 1; for (int k = (j); k < (n); k++) { str[k] = 4 ; c4++; } for (int k = (n - 1); k >= (i + 1); k--) { if (c4 > c7) { str[k] = 7 ; c4--; c7++; } else { break; } } cout << str << endl; return 0; } c4--; } else { c7--; } } cout << sol(n + 2) << endl; } else { cout << str << endl; } } return 0; }
#include <bits/stdc++.h> using namespace std; int d, m, n, x[25], a[30005]; vector<long long> ok; long long L, R; map<long long, vector<long long> > ans; map<long long, vector<long long> > zip; vector<long long> calc(long long lim) { if (zip.find(lim) != zip.end()) return zip[lim]; vector<long long> ret(m, 0); if (lim == 0) { ret[0] = 1; return ret; } for (int beg = 0; beg < d && beg <= lim; beg++) { long long nxt_lim = (lim - beg) / d; vector<long long> R = calc(nxt_lim); for (int i = 0; i < m; i++) { int a = (i + x[beg]); if (a >= m) a -= m; ret[a] += R[i]; } } return zip[lim] = ret; } void rec(long long lim, vector<long long> mask, bool F) { if (mask.size() == 1) { if (ans.find(lim) == ans.end()) { ans[lim] = vector<long long>(m, 0); } for (int i = 0; i < m; i++) { if (((mask[0] >> i) & 1LL)) { if (F) ans[lim][i]++; else ans[lim][i]--; } } return; } for (int beg = 0; beg < d && beg <= lim; beg++) { long long nxt_lim = (lim - beg) / d; vector<long long> vec; int zan = mask.size(); int bb = (d - beg); int xx = 1 + (zan - bb + d - 1) / d; vec.resize(xx, 0LL); long long B = (1LL << m) - 1; int cur = beg; int id = 0; for (int i = 0; i < mask.size(); i++) { int add = x[cur]; long long nw = 0; nw = (mask[i] >> add) \| (mask[i] << (m - add)); B &= nw; if (cur == d - 1 \|\| i == mask.size() - 1) { vec[id++] = B; B = (1LL << m) - 1; } cur++; if (cur == d) cur = 0; } assert(id == xx); rec(nxt_lim, vec, F); } } int main() { cin >> d >> m; for (int i = 0; i < d; i++) { cin >> x[i]; } cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; ok.push_back((2LL << a[i]) - 1LL); } cin >> L >> R; L--; R--; rec(R - n + 1, ok, true); if (L - 1 >= 0) rec(L - 1, ok, false); long long ret = 0; for (map<long long, vector<long long> >::iterator it = ans.begin(); it != ans.end(); it++) { vector<long long> tbl = calc(it->first); for (int i = 0; i < m; i++) { ret += tbl[i] * it->second[i]; } } cout << ret << endl; }
#include <bits/stdc++.h> int gcd(int a, int b) { return !b ? a : gcd(b, a % b); } long long pow(long long a, int p) { long long ans = 1; while (p) { if (p & 1) ans = a; a = a; p >>= 1; } return ans; } int main() { int n, l, r; scanf( %d%d%d , &n, &l, &r); if (n == 1) { printf( %d n , r - l + 1); return 0; } if (n == 2) { printf( %lld n , (long long)(r - l + 1) * (r - l)); return 0; } if (n > 30) { printf( 0 n ); return 0; } n--; int M = 1; while (pow(M + 1, n) <= r) M++; long long ans = 0; for (int y = 1; y <= M; y++) { for (int x = y + 1; x <= M; x++) if (gcd(x, y) == 1) { int py = pow(y, n), px = pow(x, n); int L = 1, R = l / py + 1; int RR = r / px; while (L < R) { int M = (L + R) / 2; if (M * py < l) L = M + 1; else R = M; } if (L <= RR) ans += RR - L + 1; } } printf( %lld n , ans << 1); return 0; }
#include <bits/stdc++.h> using namespace std; int32_t main() { long long int n, m; cin >> n >> m; long long int a[n], b[m]; long long int aux[n]; for (long long int i = 0; i < n; ++i) { cin >> a[i]; if (i == 0) aux[i] = a[i]; else aux[i] = aux[i - 1] + a[i]; } for (long long int i = 0; i < m; ++i) cin >> b[i]; long long int j = 0; for (long long int i = 0; i < m; ++i) { while (j < n && aux[j] < b[i]) ++j; if (j == 0) cout << j + 1 << << b[i] << endl; else cout << j + 1 << << b[i] - aux[j - 1] << endl; } }
#include <bits/stdc++.h> using namespace std; int n, m; set<long long> bms[6]; long long to_bit(string &s) { long long x = 0; for (long long i = 0; i < n; i++) { if (s[i] == 0 ) continue; x \|= (1LL << i); } return x; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> m; bms[0].insert(0); for (int j = 1; j <= n; j++) { for (int i = min(j, 5); i >= 1; i--) { for (long long x : bms[i - 1]) { bms[i].insert(x \| (1LL << (j - 1))); } } } int c; long long x; string s; set<long long> poss; cin >> s >> c; x = to_bit(s); for (long long bm : bms[c]) { poss.insert(~(x ^ bm)); } for (int i = 1; i < m; i++) { cin >> s >> c; x = to_bit(s); set<long long> tposs; for (long long bm : bms[c]) { if (!poss.count(~(x ^ bm))) continue; tposs.insert(~(x ^ bm)); } poss = tposs; } cout << poss.size() << n ; return 0; }
#include <bits/stdc++.h> using namespace std; int n, m; int g[100000], cnt[100000]; int v[100000], b[100000]; int s[100005], sc[100005], sz; bool used[100005] = {}, dead[100005] = {}, marked[100005] = {}; int main() { scanf( %d%d , &n, &m); for (int i = 0; i < (int)(n); ++i) scanf( %d , g + i), --g[i], cnt[i] = 1; for (int i = 0; i < (int)(m); ++i) scanf( %d , v + i); for (int i = 0; i < (int)(m); ++i) scanf( %d , b + i); int prevAns = 0; for (int q = 0; q < (int)(m); ++q) { int a = (v[q] + prevAns - 1) % n; int ans = 0; int rem = b[q]; --rem; if (!used[a]) { ans = 1; used[a] = true; } while (true) { sz = 0; while (used[g[a]]) { if (marked[a] \|\| dead[a]) break; s[sz] = a; marked[a] = true; rem -= cnt[a]; a = g[a]; ++sz; } if (marked[a] \|\| dead[a]) { for (int i = 0; i < (int)(sz); ++i) dead[s[i]] = true; for (int i = 0; i < (int)(sz); ++i) marked[s[i]] = false; break; } for (int i = 0; i < (int)(sz); ++i) marked[s[i]] = false; for (int i = sz - 1; i >= 0; --i) { cnt[s[i]] += cnt[g[s[i]]]; g[s[i]] = g[g[s[i]]]; } rem -= cnt[a]; if (rem < 0) { break; } a = g[a]; used[a] = true; ++ans; } printf( %d n , ans); prevAns = ans; } return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXN = 200010; int a[MAXN]; int b[MAXN]; int tmp[MAXN]; int main() { int n; cin >> n; int aidx; for (int i = 0; i < n; i++) { cin >> tmp[i]; if (tmp[i] == 0) aidx = i; } for (int i = 0; i < n; i++) a[i] = tmp[(i + aidx) % n]; int bidx; for (int i = 0; i < n; i++) { cin >> tmp[i]; if (tmp[i] == 0) bidx = i; } for (int i = 0; i < n; i++) b[i] = tmp[(i + bidx) % n]; for (int i = 0; i < n - 1; i++) { a[i] = a[i + 1]; b[i] = b[i + 1]; } for (int i = 0; i < n - 1; i++) if (b[i] == a[0]) bidx = i; for (int i = 0; i < n - 1; i++) if (a[i] != b[(i + bidx) % (n - 1)]) { cout << NO << endl; return 0; } cout << YES << endl; }
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1.0); const double eps = 1e-11; const int INF = 101e7; template <class T> T sqr(T first) { return first * first; } template <class T> T abs(T first) { return (first < 0) ? -first : first; } int main() { int n, m, h; cin >> n >> m >> h; n--; int sh = 0, sum = 0; for (int _b = (m), i = (1); i <= _b; i++) { if (i == h) { cin >> sh; sh--; } else { int k; cin >> k; sum += k; } } if (n > sh + sum) { cout << -1 n ; return 0; } double c = 1; for (int i = 0, _n = (n); i < _n; i++) { c *= (double(sum) / (sum + sh)); sum--; } printf( %.8f n , 1 - c); return 0; }
#include <bits/stdc++.h> using namespace std; void solve() { long long k; cin >> k; long long i = 0, prev = 0; while (k > prev + (9 * pow(10, i) * (i + 1))) { prev += 9 * pow(10, i) * (i + 1); i++; } k -= prev; long long temp; temp = pow(10, i) + (k / (i + 1)) - 1; if (k % (i + 1) != 0) { temp++; } if (k % (i + 1) == 0) { cout << temp % 10 << n ; } else { long long ans = temp / pow(10, i + 1 - (k % (i + 1))); ans %= 10; cout << ans << n ; } } int main() { ios_base ::sync_with_stdio(false); cin.tie(NULL); long long t = 1; while (t--) { solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; const int64_t N = 1e3 + 5, M = 1e9 + 7; int64_t a[N][N]; int main() { ios::sync_with_stdio(0), cin.tie(0); int64_t n, m, s = 0; cin >> n >> m; for (int64_t i = 0; i < n; i++) for (int64_t j = 0; j < m; j++) cin >> a[i][j]; for (int64_t i = n - 2; i; i--) for (int64_t j = m - 2; j; j--) if (!a[i][j]) a[i][j] = min(a[i + 1][j], a[i][j + 1]) - 1; for (int64_t i = 0; i < n; i++) for (int64_t j = 1; j < m; j++) if (a[i][j] <= a[i][j - 1]) return cout << -1, 0; for (int64_t j = 0; j < m; j++) for (int64_t i = 1; i < n; i++) if (a[i][j] <= a[i - 1][j]) return cout << -1, 0; for (int64_t i = 0; i < n; i++) for (int64_t j = 0; j < m; j++) s += a[i][j]; cout << s; }
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5; long long line[maxn]; int sum, q1, q2; int flag1, k, qw, wa, flag2; int main() { int n, zz = 1; cin >> n; for (int i = (int)(1); i < (int)(n + 1); i++) cin >> line[i]; while (zz <= n) { q1 = 0, q2 = 0, flag1 = 0, k = 0, wa = 0, flag2 = 0; sum++; for (int i = (int)(zz); i < (int)(n + 1); i++) { qw = i; if (line[i] != -1 && flag1 == 0) { q1 = line[i]; flag1 = 1; continue; } if (flag1 == 1 && line[i] == -1) { k++; continue; } if (line[i] == -1 && flag1 == 0) { wa++; continue; } if (line[i] != -1 && flag1 == 1) { q2 = line[i]; flag2 = 1; break; } } zz = qw; if (qw > n) break; if (qw == n && (flag2 == 0 \|\| flag1 == 0)) break; if ((q2 - q1) % (k + 1) != 0) continue; long long d = (q2 - q1) / (k + 1); if (q1 - wa * d <= 0) continue; zz = qw + 1; while (zz <= n) { if (line[zz] == -1) { if (line[zz - 1] + d <= 0) break; line[zz] = line[zz - 1] + d; zz++; } else { if (line[zz] - line[zz - 1] != d) break; zz++; } } } cout << sum << endl; return 0; }
#include <bits/stdc++.h> using namespace std; long long n, m, a, b = 1, c, can[100000 * 10], cc, M, tmp[100000 * 10], ans = 0x3f3f3f3f3f3f3f3f, XH; inline long long cheng(long long u, long long v) { long long res = 0; for (; v; v >>= 1) { if (v & 1) res = (res + u) % M; u = u * 2 % M; } return res; } struct Jz { long long num[2][2]; Jz() { memset(num, 0, sizeof(num)); } Jz operator(const Jz &u) const { Jz res; long long i, j, k; for (i = 0; i < 2; i++) { for (j = 0; j < 2; j++) { for (k = 0; k < 2; k++) { res.num[i][j] = (res.num[i][j] + cheng(num[i][k], u.num[k][j])) % M; } } } return res; } } dw; inline Jz po(Jz u, long long v) { Jz res; res.num[0][0] = res.num[1][1] = 1; for (; v;) { if (v & 1) res = res u; u = u * u; v >>= 1; } return res; } inline long long ask(long long u) { Jz res = po(dw, u); return res.num[0][0]; } int main() { dw.num[0][1] = dw.num[1][0] = dw.num[1][1] = 1; long long i, j, k, t; cin >> n; t = n % 100000; for (i = 1;; i++) { if (t == a) can[++cc] = i; c = (a + b) % 100000; a = b, b = c; if (!a && b == 1) break; } for (M = 100000 * 10, XH = 150000; M <= (long long)1e13; M = 10, XH = 10) { t = n % M, k = 0; for (i = 1; i <= cc; i++) { for (j = 0; j <= 9; j++) { if (ask(can[i] + XH * j) % M == t) { tmp[++k] = can[i] + XH * j; } } } for (i = 1; i <= k; i++) can[i] = tmp[i]; cc = k; } if (!cc) { puts( -1 ); return 0; } for (i = 1; i <= cc; i++) ans = min(ans, can[i]); cout << ans - 1; }
#include <bits/stdc++.h> using namespace std; int store[20][1 << 20]; struct trie { int k; struct Node { Node* ch[2]; Node() { ch[0] = ch[1] = NULL; } }; Node* root; trie(int k) : k(k) { root = new Node(); } void insert(int x) { Node* cur = root; for (int i = k - 1; i >= 0; i--) { int side = x >> i & 1; if (!cur->ch[side]) cur->ch[side] = new Node(); cur = cur->ch[side]; } } void eval() { vector<int> ret(1 << k); for (int i = 0; i <= k; i++) fill(store[i], store[i] + (1 << k), 1 << 30); function<vector<pair<int, int> >(Node, int)> dfs = [&](Node node, int h) { if (!node) return vector<pair<int, int> >(); if (h == 0) { vector<pair<int, int> > ret = {{0, 0}}; return ret; } vector<pair<int, int> > A = dfs(node->ch[0], h - 1), B = dfs(node->ch[1], h - 1); vector<pair<int, int> > ret(1 << h); for (int x = 0; x < (1 << h); x++) { int add = 1 << (h - 1); int rem = x & (add - 1); if (x >> (h - 1) & 1) { ret[x].first = node->ch[1] ? B[rem].first : A[rem].first + add; ret[x].second = node->ch[0] ? A[rem].second + add : B[rem].second; } else { ret[x].first = node->ch[0] ? A[rem].first : B[rem].first + add; ret[x].second = node->ch[1] ? B[rem].second + add : A[rem].second; } if (!A.empty() && !B.empty()) { if (x >> (h - 1) & 1) store[h][x] = min(store[h][x], A[rem].first + add - B[rem].second); else store[h][x] = min(store[h][x], B[rem].first + add - A[rem].second); } assert(max(ret[x].first, ret[x].second) < (1 << h) && min(ret[x].first, ret[x].second) >= 0); } return ret; }; dfs(root, k); } }; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, k; cin >> n >> k; trie T(k); for (int i = 0; i < n; i++) { int x; cin >> x; T.insert(x); } T.eval(); for (int x = 0; x < (1 << k); x++) { int ans = 1 << 30; for (int h = k; h; h--) { ans = min(ans, store[h][x & ((1 << h) - 1)]); } cout << ans << ; } cout << n ; }
#include <bits/stdc++.h> using namespace std; int main() { int n, a[101], x = 0; string s1, s2; cin >> s1 >> s2; for (int i = 0; i < s1.size(); i++) { if (s1[i] != s2[i]) a[i] = 1; else a[i] = 0; x++; } for (int i = 0; i < x; i++) { cout << a[i]; } return 0; }
#include <bits/stdc++.h> using namespace std; struct app { int x, y; }; int main() { int n, m; scanf( %d , &n); scanf( %d , &m); int m1, m2; vector<app> arr(n); for (__typeof(0) i = 0; i <= n - 1; i++) { scanf( %d , &arr[i].x); scanf( %d , &arr[i].y); if (i == 0) { m1 = arr[i].x; m2 = arr[i].y; } else { if (arr[i].x * m2 < arr[i].y * m1) { m1 = arr[i].x; m2 = arr[i].y; } } } double ans = m * m1; ans = ans * 1.0 / m2 * 1.0; cout << fixed << setprecision(8) << ans; printf( n ); return 0; }
#include <bits/stdc++.h> using namespace std; const int oo = 0x3f3f3f3f; const double eps = 1e-9; const int MOD = 1000003; int R, C; char grid[600000]; int main() { scanf( %d%d , &R, &C); for (int i = (0); i < (R); i++) { grid[i] = new char[C + 5]; scanf( %s , grid[i]); } int res = 1; for (int i = (0); i < (R); i++) { int b1 = 1, b2 = 1; for (int j = (0); j < (C); j++) { if (grid[i][j] == 1 \|\| grid[i][j] == 2 ) { if (j % 2) { b1 = 0; } else { b2 = 0; } } else if (grid[i][j] == 3 \|\| grid[i][j] == 4 ) { if (j % 2) { b2 = 0; } else { b1 = 0; } } } res = (res (b1 + b2)) % MOD; } for (int j = (0); j < (C); j++) { int b1 = 1, b2 = 1; for (int i = (0); i < (R); i++) { if (grid[i][j] == 1 \|\| grid[i][j] == 4 ) { if (i % 2) { b1 = 0; } else { b2 = 0; } } else if (grid[i][j] == 2 \|\| grid[i][j] == 3 ) { if (i % 2) { b2 = 0; } else { b1 = 0; } } } res = (res * (b1 + b2)) % MOD; } cout << res << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); long long n; cin >> n; long long s = 0; for (int i = 0; i < n; ++i) { long long x; cin >> x; s += x; } long long add = (s - n * (n - 1) / 2) / n; long long cnt = s - (n * (n - 1) / 2 + add * n); for (int i = 0; i < n; ++i) { cout << i + add + int(i < cnt) << ; } }
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7, maxn = 2e3 + 5; long long f[maxn][maxn][2][2]; long long g[maxn]; long long n, m; long long upd(const long long &x) { if (x < 0) return x + mod; if (x >= mod) return x - mod; return x; } void add(long long &x, const long long &y) { x = upd(x + upd(y)); } long long jc[maxn], inv[maxn]; long long ksm(long long x, long long k) { long long ans = 1; while (k) { if (k & 1) ans = ans * x % mod; x = x * x % mod; k >>= 1; } return ans; } void init(long long n) { jc[0] = 1; for (long long i(1), endi(n); i <= endi; i++) jc[i] = jc[i - 1] * i % mod; inv[n] = ksm(jc[n], mod - 2); for (long long i(n - 1), endi(0); i >= endi; i--) inv[i] = inv[i + 1] * (i + 1) % mod; } long long C(long long n, long long m) { if (n < 0 \|\| m < 0 \|\| n < m) return 0; return jc[n] * inv[m] % mod * inv[n - m] % mod; } signed main() { scanf( %lld%lld , &n, &m); init(n); f[1][0][0][0] = 1; f[1][1][0][1] = 1; for (long long i(2), endi(n); i <= endi; i++) for (long long j(0), endj(n); j <= endj; j++) { if (j) { add(f[i][j][0][0], f[i - 1][j - 1][0][0]); add(f[i][j][1][0], f[i - 1][j - 1][0][1]); if (i != n) { add(f[i][j][0][1], f[i - 1][j - 1][0][0] + f[i - 1][j - 1][1][0]); add(f[i][j][1][1], f[i - 1][j - 1][0][1] + f[i - 1][j - 1][1][1]); } } add(f[i][j][0][0], f[i - 1][j][0][0] + f[i - 1][j][1][0]); add(f[i][j][1][0], f[i - 1][j][0][1] + f[i - 1][j][1][1]); } for (long long i(0), endi(n); i <= endi; i++) { add(g[i], f[n][i][0][0] + f[n][i][1][0]); g[i] = g[i] * jc[n - i] % mod; } long long ans = 0; for (long long i(m), endi(n); i <= endi; i++) { add(ans, ((i - m) & 1 ? -1 : 1) * g[i] * C(i, m) % mod); } cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; template <typename T> bool chmax(T &x, const T &y) { return (x < y) ? (x = y, true) : false; }; template <typename T> bool chmin(T &x, const T &y) { return (x > y) ? (x = y, true) : false; }; constexpr long long int MOD = 10; constexpr long long int INF = 2e18; int main() { int t; cin >> t; while (t--) { int n, m; cin >> n >> m; vector<long long int> p(n); for (long long int i = 0; i < (n); i++) cin >> p[i], p[i]--; vector<long long int> cnt(n, 0); for (long long int i = 0; i < (n); i++) { cnt[(p[i] - i + n) % n]++; } vector<long long int> ans; for (long long int i = 0; i < (n); i++) { if (n - cnt[i] <= m) { ans.push_back((-i + n) % n); } else if (n - cnt[i] <= m * 2) { int x = 0; vector<long long int> q(n); for (long long int j = 0; j < (n); j++) q[j] = p[(j - i + n) % n]; vector<long long int> f(n, 0); for (long long int j = 0; j < (n); j++) { if (f[j] == 0) { int now = j; while (f[now] == 0) { f[now] = 1; now = q[now]; x++; } x--; } } if (x <= m) ans.push_back((-i + n) % n); } } sort(ans.begin(), ans.end()); cout << ans.size(); for (auto i : ans) cout << << i; cout << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const long long int K = 998244353; long long int mu(long long int a, long long int n) { if (n == 0) return 1; long long int q = mu(a, n / 2); if (n % 2 == 0) return q * q % K; return q * q % K * a % K; } long long int d[55][55][55][55], inv[5305]; int isLiked[55], weight[55]; int n, m, total; long long int a, b; long long int calc(int w, int A, int B, int m, int i) { if (w * isLiked[i] + weight[i] < 0 \|\| A + a < 0 \|\| b - B < 0) return 0; if (m == 0) { return w * isLiked[i] + weight[i]; } if (d[w][A][B][m] != -1) return d[w][A][B][m]; long long int deno = inv[w * isLiked[i] + A - B + weight[i] + a + b]; long long int res = 0; res += (A + a) * calc(w, A + 1, B, m - 1, i) % K; res %= K; res += (b - B) * calc(w, A, B + 1, m - 1, i) % K; res %= K; res += (weight[i] + w * isLiked[i]) * calc(w + 1, A, B, m - 1, i) % K; res %= K; res = res * deno % K; return d[w][A][B][m] = res % K; } long long int solve(int i) { memset(d, -1, sizeof(d)); a = 0, b = 0; for (int j = 1; j <= n; j++) { if (j == i) continue; if (isLiked[j] == 1) { a += weight[j]; } else { b += weight[j]; } } return calc(0, 0, 0, m, i); } int main() { ios::sync_with_stdio(0); cin.tie(NULL); for (int i = 1; i <= 5300; i++) { inv[i] = mu(i, K - 2); } cin >> n >> m; for (int i = 1; i <= n; i++) { cin >> isLiked[i]; if (!isLiked[i]) isLiked[i] = -1; } for (int i = 1; i <= n; i++) { cin >> weight[i]; } for (int i = 1; i <= n; i++) { cout << solve(i) << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); void setIO(string name) { ios_base::sync_with_stdio(false); cin.tie(nullptr); cin.exceptions(istream::failbit); } const int inf = 0x3f3f3f3f, mod = 1e9 + 7, maxn = 1e5 + 5; vector<vector<pair<int, int>>> adj; vector<long long> pass, sub, weight, cost; void dfs(int c, int p) { if (p != -1 && adj[c].size() == 1) { sub[c] = 1; } for (auto i : adj[c]) { if (i.first != p) { dfs(i.first, c); pass[i.second] = sub[i.first]; sub[c] += sub[i.first]; } } } int main() { setIO( 1 ); int t; cin >> t; while (t--) { int n; cin >> n; long long s; cin >> s; adj = vector<vector<pair<int, int>>>(n); pass = sub = weight = cost = vector<long long>(n); for (int i = 0; i < n - 1; ++i) { int a, b; cin >> a >> b >> weight[i] >> cost[i]; --a, --b; adj[a].push_back({b, i}); adj[b].push_back({a, i}); } dfs(0, -1); pair<long long, long long> total; priority_queue<pair<long long, int>> one, two; for (int i = 0; i < n - 1; ++i) { if (cost[i] == 1) { total.first += pass[i] * weight[i]; one.push({pass[i] * (weight[i] - weight[i] / 2), i}); } else { total.second += pass[i] * weight[i]; two.push({pass[i] * (weight[i] - weight[i] / 2), i}); } } vector<long long> costs; while (total.first) { costs.push_back(total.first); pair<long long, int> cur = one.top(); one.pop(); total.first -= cur.first; weight[cur.second] /= 2; one.push( {pass[cur.second] * (weight[cur.second] - weight[cur.second] / 2), cur.second}); } costs.push_back(0); long long sol = 1e18, cnt = 0; while (total.second) { long long lo = 0, hi = (int)costs.size() - 1, mid, res = -1; while (lo <= hi) { mid = (lo + hi) / 2; if (costs[mid] + total.second <= s) { res = mid; hi = mid - 1; } else { lo = mid + 1; } } if (res != -1) { sol = min(sol, res + 2 * cnt); } pair<long long, int> cur = two.top(); two.pop(); total.second -= cur.first; weight[cur.second] /= 2; two.push( {pass[cur.second] * (weight[cur.second] - weight[cur.second] / 2), cur.second}); ++cnt; } long long lo = 0, hi = costs.size(), mid, res = -1; while (lo <= hi) { mid = (lo + hi) / 2; if (costs[mid] <= s) { res = mid; hi = mid - 1; } else { lo = mid + 1; } } if (res != -1) { sol = min(sol, res + 2 * cnt); } cout << min(sol, res + 2 * cnt) << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int M[33][33]; int S[33][33]; int m; int n; int solve(int sid) { memcpy(S, M, sizeof(int) * 33 * 33); for (int i = 0; i < m; i++) { if ((1 << i) & sid) { for (int k = m - 1; k < n; k++) { for (int l = i; l < i + m; l++) { S[k][l] = -1; } } } } int ret = 0; for (int i = 0; i < n; i++) ret += S[m - 1][i]; for (int i = 0; i < m - 1; i++) { for (int j = 0; j < n; j++) { S[i][j] += S[m + i][j]; } } for (int i = 0; i < m - 1; i++) { int row1 = S[i][m - 1], row2 = S[i][m - 1] -1; for (int j = 0; j < m - 1; j++) { row1 += abs(S[i][j] + S[i][m + j]); row2 += abs(S[i][j] - S[i][m + j]); } ret += max(row1, row2); } return ret; } int main() { cin >> n; m = (n + 1) / 2; for (size_t i = 0; i < n; ++i) { for (size_t j = 0; j < n; ++j) { cin >> M[i][j]; } } int sol = -10000000; for (size_t i = 0; i < (1 << m); ++i) { sol = max(solve(i), sol); } cout << sol << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 100005; const int INF = 1 << 30; const double eps = 1e-6; const int mod = 1000000007; string s; void getVal(int& a, int& b, char x) { a = b = -1; for (int i = 0; i < s.size(); i++) { if (s[i] != x) continue; if (a == -1) a = i; b = i; } } int main() { cin >> s; int n = s.size(); int la, ra, lb, rb, lc, rc; bool ok = true; getVal(la, ra, a ); if (la == -1 \|\| ra == -1) ok = false; getVal(lb, rb, b ); if (lb == -1 \|\| rb == -1) ok = false; getVal(lc, rc, c ); if (lc == -1 \|\| rc == -1) ok = false; if (ra + 1 != lb \|\| rb + 1 != lc) ok = false; else if (rc - lc != rb - lb && rc - lc != ra - la) ok = false; puts(ok ? YES : NO ); return 0; }
#include <bits/stdc++.h> using namespace std; int N, i; double H, K, x, y, xp, yp; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> N >> K >> x >> y; for (i = 1; i < N; i++) { cin >> xp >> yp; H += sqrt((xp - x) * (xp - x) + (yp - y) * (yp - y)) * K / 50; x = xp; y = yp; } cout << fixed << setprecision(12) << H << n ; }
#include <bits/stdc++.h> #pragma comment(linker, /STACK:2000000 ) #pragma comment(linker, /HEAP:2000000 ) using namespace std; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n; cin >> n; long long m[n][n], a[n]; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { cin >> m[i][j]; } } long long x = sqrt((m[0][1] * m[0][2]) / m[1][2]); cout << x << ; for (int i = 1; i < n; i++) { cout << m[0][i] / x << ; } return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 600, oo = 2e9; int nn[N], mm[N], n, m; int check() { int mn = oo; for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { if (nn[i] == mm[j]) mn = min(mn, nn[i]); } } if (mn == oo) return -1; return mn; } int main() { ios::sync_with_stdio(false); int mn1 = oo, mn2 = oo, mnb1 = oo, mnb2 = oo; cin >> n >> m; for (int i = 0; i < n; ++i) { cin >> nn[i]; mn1 = min(mn1, nn[i]); if (nn[i]) mnb1 = min(mnb1, nn[i]); } for (int i = 0; i < m; ++i) { cin >> mm[i]; mn2 = min(mn2, mm[i]); if (mm[i]) mnb2 = min(mnb2, mm[i]); } int mini = min(mn1, mn2), maxi = max(mn1, mn2); if (check() != -1) cout << check(); else if (!mn1) { cout << min(mn2 * 10, mnb1 * 10 + mn2); } else if (!mn2) cout << min(mn1 * 10, mnb2 * 10 + mn1); else cout << mini * 10 + maxi; return 0; }
#include <bits/stdc++.h> using namespace std; string s, t, temp; bool check(int mid, vector<int>& v) { temp = s; for (int i = 0; i < mid; i++) { temp[v[i]] = # ; } int x = 0; for (int i = 0; i < temp.size(); i++) { if (t[x] == temp[i]) { x++; } if (x == t.size()) return true; } return false; } int main() { cin >> s >> t; vector<int> v; for (int i = 0; i < s.size(); i++) { int a; cin >> a; v.push_back(a - 1); } int low = 0, high = s.size(); while (high - low > 1) { int mid = low + (high - low) / 2; if (check(mid, v)) low = mid; else high = mid; } cout << low << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int da[100010], db[100010], ida[100010], idb[100010]; map<int, int> mp; map<int, int>::iterator it; void solve(int n) { for (int i = 1; i <= n; i++) { int ret = 0x3fffffff; it = mp.lower_bound(i - 1); if (it != mp.end()) ret = min(ret, it->first - (i - 1)); if (it != mp.begin()) { --it; ret = min(ret, (i - 1) - it->first); } printf( %d n , ret); mp[i - ida[db[i]]]--; if (mp[i - ida[db[i]]] == 0) mp.erase(i - ida[db[i]]); mp[i + n - ida[db[i]]]++; } } int main() { int n; while (scanf( %d , &n) != EOF) { mp.clear(); for (int i = 1; i <= n; i++) { scanf( %d , &da[i]); ida[da[i]] = i; } for (int i = 1; i <= n; i++) { scanf( %d , &db[i]); idb[db[i]] = i; } for (int i = 1; i <= n; i++) mp[i - ida[db[i]]]++; solve(n); } return 0; }
#include <bits/stdc++.h> using namespace std; long long modexpo(long long x, long long p) { long long res = 1; x = x % 1000000007; while (p) { if (p % 2) res = res * x; p >>= 1; x = x * x % 1000000007; res %= 1000000007; } return res; } struct compare { bool operator()(const pair<long long, long long> a, const pair<long long, long long> b) const { return a.first < b.first; } }; const long long nax = 2005; long long n, m; vector<pair<long long, long long>> robber, light, moves; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> m; robber.assign(n, {0, 0}); light.assign(m, {0, 0}); for (long long i = 0; i < n; i++) { cin >> robber[i].first >> robber[i].second; } for (long long i = 0; i < m; i++) { cin >> light[i].first >> light[i].second; } for (long long i = 0; i < n; i++) { for (long long j = 0; j < m; j++) { long long a = light[j].first - robber[i].first + 1; long long b = light[j].second - robber[i].second + 1; a = max(a, 0LL); b = max(b, 0LL); moves.push_back({a, b}); } } long long sz = moves.size(); sort(moves.begin(), moves.end()); vector<long long> suf(sz); suf[sz - 1] = moves[sz - 1].second; for (long long i = sz - 2; i >= 0; i--) { suf[i] = max(suf[i + 1], moves[i].second); } long long ans = suf[0]; for (long long i = 0; i < sz; i++) { ans = min(ans, moves[i].first + (i + 1 < sz ? suf[i + 1] : 0)); } cout << ans << n ; }
#include <bits/stdc++.h> using namespace std; const long long N = 3e5 + 5; struct Ans { long long a, b, c; }; void solve() { long long a, b, c; cin >> a >> b >> c; long long ans = 1e9; auto x = Ans{a, b, c}; for (long long aa = 1; aa <= 2 * a; aa++) { for (long long bb = aa; bb <= 2 * b; bb += aa) { long long op1 = bb * (c / bb); long long op2 = op1 + bb; long long diff = abs(a - aa) + abs(b - bb); long long y = diff + abs(c - op1); long long z = diff + abs(c - op2); if (y < ans) { ans = y; x.a = aa; x.b = bb; x.c = op1; } if (z < ans) { ans = z; x.a = aa; x.b = bb; x.c = op2; } } } cout << ans << n ; cout << x.a << << x.b << << x.c << n ; } int main(int argc, char *argv[]) { long long t; ios::sync_with_stdio(0); cin.tie(0); std::cout << std::fixed; std::cout << std::setprecision(15); cin >> t; for (long long z = 0; z < (long long)t; ++z) solve(); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { long long n, k; cin >> n >> k; int a[n]; int ma = INT_MIN; for (int i = 0; i < n; i++) { cin >> a[i]; if (a[i] > ma) ma = a[i]; } int m2 = INT_MIN; vector<int> v1, v2; for (int i = 0; i < n; i++) { a[i] = ma - a[i]; if (m2 < a[i]) m2 = a[i]; v1.push_back(a[i]); } for (int i = 0; i < n; i++) { a[i] = m2 - a[i]; } if (k % 2) { for (int i = 0; i < v1.size(); i++) cout << v1[i] << ; cout << endl; } else { for (int i = 0; i < n; i++) cout << a[i] << ; cout << endl; } } }
#include <bits/stdc++.h> using namespace std; vector<pair<long long, long long> > xy; vector<pair<long long, long long> > ab; vector<long long> x; vector<long long> y; string str, str1, str2, star[2000]; long long ara[200005], ara2[200005]; bool flagar[200005], flagar2[200005]; bool compare(pair<long long, long long> i, pair<long long, long long> j) { return (i.first < j.first); } bool compare2(pair<long long, long long> i, pair<long long, long long> j) { return (i.first > j.first); } long long gcd(long long a, long long b) { if (a % b == 0) return b; return gcd(b, a % b); } long long dp[2005][2005]; int main() { long long int n, ans, temp, t, j, i, m, h, h2, m2, c, a, b, mx, d, k, x1, r, l, mn; cin >> str >> k; n = str.length(); a = b = 0; for (i = n - 1; i >= 0; i--) { if (str[i] - 0 == 0) a++; else b++; if (a == k) { cout << b; return 0; } } if (a < k) { b = n - 1; } cout << b; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 2005, M = 200005; struct node { int x, y; } d[N]; int h, w, n, mod = 1e9 + 7; long long c[M] = {1, 1}, inv[M] = {1, 1}, ni[M] = {1, 1}, f[N]; long long quick_mod(long long a, long long b) { long long ans = 1; while (b) { if (b & 1) ans = ans * a % mod; b >>= 1; a = a * a % mod; } return ans; } void init() { for (int i = 2; i < M; i++) { c[i] = c[i - 1] * i % mod; ni[i] = (mod - mod / i) * ni[mod % i] % mod; inv[i] = ni[i] * inv[i - 1] % mod; } } long long C(int n, int m) { if (n < m) return 0; if (n == m \|\| m == 0) return 1; return c[n] * inv[m] % mod * inv[n - m] % mod; } bool cmp(node a, node b) { if (a.x != b.x) return a.x < b.x; return a.y < b.y; } int main() { init(); scanf( %d%d%d , &h, &w, &n); for (int i = 0; i < n; i++) scanf( %d%d , &d[i].x, &d[i].y); sort(d, d + n, cmp); d[n].x = h; d[n].y = w; for (int i = 0; i <= n; i++) { f[i] = C(d[i].x + d[i].y - 2, d[i].x - 1); for (int j = 0; j < i; j++) { if (d[j].x > d[i].x \|\| d[j].y > d[i].y) continue; f[i] = (f[i] - f[j] * C(d[i].x - d[j].x + d[i].y - d[j].y, d[i].x - d[j].x)) % mod; } f[i] = (f[i] + mod) % mod; } printf( %lld n , f[n]); return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXINT = 2147483647; const long long MAXLL = 9223372036854775807LL; const int MAX = 400000; long long n, q, col, pref[MAX], l, r, sum, ans, t[MAX]; string s; int main() { cin >> n >> q; cin >> s; for (int i = 0; i < n; i++) { if (s[i] == 1 ) col++; pref[i] = col; } t[0] = 0; for (int i = 1; i <= 100005; i++) t[i] = (t[i - 1] + t[i - 1] + 1) % 1000000007; for (int i = 0; i < q; i++) { ans = 0, col = 0; cin >> l >> r; l--, r--; if (l == 0) sum = pref[r]; else sum = pref[r] - pref[l - 1]; if (t[r - l + 1] >= t[r - l + 1 - sum]) ans += t[r - l + 1] - t[r - l + 1 - sum]; else ans += t[r - l + 1] + 1000000007 - t[r - l + 1 - sum]; cout << ans << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; using ll = int64_t; using vll = vector<ll>; using vvll = vector<vll>; using pll = pair<ll, ll>; using vpll = vector<pll>; ll a, n; vll inp; void func() { cin >> a; string s; cin >> s; n = s.length(); inp.resize(n); for (ll i = 0; i < n; i++) { inp[i] = s[i] - 0 ; } vll cnt(9 * n + 1, 0); for (ll i = 0; i < n; i++) { ll x = 0; for (ll j = i; j < n; j++) { x += inp[j]; cnt[x]++; } } ll ans = 0; if (a == 0) { ll total = accumulate(cnt.begin(), cnt.end(), 0ll); ans = 2 * (cnt[0] * total); ans -= cnt[0] * cnt[0]; } else { for (ll i = 1; i < 9 * n + 1; i++) { if (i > a) break; if (a % i == 0) { ll j = a / i; if (j < 9 * n + 1) { ans += cnt[i] * cnt[j]; } } } } cout << ans << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); ; ll t = 1; for (ll i = 1; i <= t; i++) { func(); } }
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) #pragma GCC optimize( unroll-loops ) using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); const int maxn = 300007; int n, a[maxn]; static pair<int, int> tree[maxn << 2][20]; inline int min(int u, int v) { return u > v ? v : u; } inline int max(int u, int v) { return u > v ? u : v; } inline void pushup(int num, int val) { tree[num][val] = { min(tree[num << 1][val].first, tree[num << 1 \| 1][val].first), max(tree[num << 1][val].second, tree[num << 1 \| 1][val].second)}; } pair<int, int> query(int num, int l, int r, int val, int L, int R) { if (L <= l && r <= R) { return tree[num][val]; } int md = (l + r) >> 1; if (md >= L && md >= R) { return query(num << 1, l, md, val, L, R); } if (md < R && md < L) { return query(num << 1 \| 1, md + 1, r, val, L, R); } if (md < R && md >= L) { pair<int, int> tmp = query(num << 1, l, md, val, L, R), tmp2 = query(num << 1 \| 1, md + 1, r, val, L, R); return {min(tmp.first, tmp2.first), max(tmp.second, tmp2.second)}; } } void build(int num, int l, int r, int val) { if (l == r) { if (!val) { tree[num][0] = {max(l - a[l], 1), min(l + a[l], 3 * n)}; } else { pair<int, int> rg = query(1, 1, 3 * n, val - 1, l, l); tree[num][val] = query(1, 1, 3 * n, val - 1, rg.first, rg.second); } return; } int md = (l + r) >> 1; build(num << 1, l, md, val); build(num << 1 \| 1, md + 1, r, val); pushup(num, val); } inline int calc(int u) { int ret = 0; pair<int, int> cnt = {u, u}; for (int i = 16; i > -1; --i) { pair<int, int> tmp = query(1, 1, 3 * n, i, cnt.first, cnt.second); if (tmp.second - tmp.first < n - 1) { ret += (1 << i); cnt = tmp; } } return ret; } int main() { scanf( %d , &n); if (n == 1) { puts( 0 ); return 0; } for (int i = 1; i <= n; ++i) { scanf( %d , &a[i]); a[i + n] = a[i + 2 * n] = a[i]; } for (int i = 0; i < 17; ++i) { build(1, 1, 3 * n, i); } for (int i = n + 1; i <= 2 * n; ++i) { printf( %d , calc(i) + 1); } return 0; }
#include <bits/stdc++.h> using namespace std; template <class T> inline void read(T& x) { bool fu = 0; char c; for (c = getchar(); c <= 32; c = getchar()) ; if (c == - ) fu = 1, c = getchar(); for (x = 0; c > 32; c = getchar()) x = x * 10 + c - 0 ; if (fu) x = -x; }; inline char getc() { char c; for (c = getchar(); c <= 32; c = getchar()) ; return c; } const int mod = 1000000007; int n, i, j, k, w; char st[1000010]; int a[1000010]; bool vis[100010][2]; long long T[100010], p[100010][2], l[100010][2], g[100010][2], s[100010][2], v[100010][2]; void get(int i, bool l0) { if (vis[i][l0]) return; vis[i][l0] = 1; if (i > w) { g[i][l0] = 1; return; } bool l2; long long c, LA = 0, Y; bool fir = 1; for (int j = 4; j <= 7; j += 3) if (l0 \|\| (j <= a[i])) { c = j * T[w - i] % mod; l2 = l0 \|\| (j < a[i]); get(i + 1, l2); g[i][l0] = ((g[i][l0]) + (g[i + 1][l2]) % mod) % mod; s[i][l0] = ((s[i][l0]) + (s[i + 1][l2] + c * g[i + 1][l2]) % mod) % mod; v[i][l0] = ((v[i][l0]) + (v[i + 1][l2]) % mod) % mod; v[i][l0] = ((v[i][l0]) + ((2 * s[i + 1][l2] - p[i + 1][l2] - l[i + 1][l2]) % mod * c) % mod) % mod; v[i][l0] = ((v[i][l0]) + (c * c % mod * (g[i + 1][l2] - 1) % mod) % mod) % mod; Y = (p[i + 1][l2] + c) % mod; if (!fir) v[i][l0] = ((v[i][l0]) + (LA * Y % mod) % mod) % mod; if (fir) fir = 0, p[i][l0] = Y; LA = l[i][l0] = (l[i + 1][l2] + c) % mod; fir = 0; } } long long solve() { scanf( %s , st + 1); w = strlen(st + 1); for (i = 1; i <= w; i++) a[i] = st[i] - 0 ; T[0] = 1; for (i = 1; i <= w; i++) T[i] = T[i - 1] * 10 % mod; memset(vis, 0, sizeof(vis)); memset(p, 0, sizeof(p)); memset(l, 0, sizeof(l)); memset(g, 0, sizeof(g)); memset(s, 0, sizeof(s)); memset(v, 0, sizeof(v)); get(1, 0); return v[1][0]; } int main() { long long s0 = solve(); long long s1 = solve(); s0 = (s1 - s0) % mod; if (s0 < 0) s0 += mod; cout << s0 << endl; scanf( n ); return 0; }
#include <bits/stdc++.h> using namespace std; int n, p, a[100005], fqn[100005], fqo[100005], mx, cur, exc = 0, lesdan = 0, mnvl[100005], gmod = 0, rekt = 0; int mc[100005], vl[100005]; vector<int> ok; map<int, int> fq; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> p; for (int i = 0; i < n; i++) { cin >> a[i]; fq[a[i]]++; } sort(a, a + n + 1, greater<int>()); mx = a[0]; cur = max(mx - (n - 1), 0); for (auto u : fq) if (u.second >= p) exc++; for (int i = 0; i < n; i++) { if (a[i] < cur) break; rekt = i; vl[i] = n - (a[i] - cur) - i; mnvl[i] = vl[i]; if (i != 0) mnvl[i] = min(mnvl[i], mnvl[i - 1]); mc[((vl[i] % p) + p) % p]++; } int gp = n - 1 - rekt; int cnt = 0; while (cur < mx) { while (a[rekt] < cur) { mc[((vl[rekt] % p) + p) % p]--; rekt--; gp++; } if (mnvl[rekt] + cnt > 0 && (mc[gmod] + gp / p) == 0) ok.push_back(cur); cur++; gmod--; gmod += p; gmod %= p; cnt++; } cout << ok.size() << endl; for (auto u : ok) cout << u << ; cout << endl; cout.flush(); return 0; }
#include <bits/stdc++.h> using namespace std; int n, m; struct EDGE { int to, w; EDGE las; } e[100005]; int ne; EDGE last[100005]; void link(int u, int v, int w) { e[ne] = {v, w, last[u]}; last[u] = e + ne++; } long long dis[100005], f[100005]; void adjust() { for (int i = 1; i <= n; ++i) for (EDGE ei = last[i]; ei; ei = ei->las) ei->w += dis[i] - dis[ei->to]; for (int i = 1; i <= n; ++i) f[i] += dis[i]; } void SP0() { static priority_queue<pair<long long, int>, vector<pair<long long, int> >, greater<pair<long long, int> > > q; memset(dis, 127, sizeof(long long) (n + 1)); dis[1] = 0; q.push(make_pair(0, 1)); while (!q.empty()) { int x = q.top().second; long long s = q.top().first; q.pop(); if (s != dis[x]) continue; for (EDGE ei = last[x]; ei; ei = ei->las) if (s + ei->w < dis[ei->to]) { dis[ei->to] = s + ei->w; q.push(make_pair(dis[ei->to], ei->to)); } } adjust(); } void SP1() { static vector<int> b[100005]; memset(dis, 127, sizeof(long long) (n + 1)); dis[1] = 0; b[0].push_back(1); for (int i = 0; i < n; ++i) { for (int j = 0; j < b[i].size(); ++j) { int x = b[i][j]; if (dis[x] < i) continue; for (EDGE *ei = last[x]; ei; ei = ei->las) if (i + ei->w < n && i + ei->w < dis[ei->to]) { dis[ei->to] = i + ei->w; b[dis[ei->to]].push_back(ei->to); } } b[i].clear(); } adjust(); } int main() { int Q; scanf( %d%d%d , &n, &m, &Q); for (int i = 0; i < m; ++i) { int u, v, w; scanf( %d%d%d , &u, &v, &w); link(u, v, w); } SP0(); while (Q--) { int op; scanf( %d , &op); if (op == 1) { int v; scanf( %d , &v); printf( %lld n , dis[v] > 100000000000000 ? -1 : f[v]); } else { int c; scanf( %d , &c); for (int i = 0; i < c; ++i) { int id; scanf( %d , &id), --id; e[id].w++; } SP1(); } } return 0; }
#include <bits/stdc++.h> using namespace std; vector<int> adj[105]; bool visited[105]; int df[1005]; int ans = 0, k = 0; void dfs(int i, int parent) { visited[i] = true; for (int j = 0; j < adj[i].size(); j++) { if (!visited[adj[i][j]]) dfs(adj[i][j], i); } } int main() { int n, m; cin >> n >> m; for (int i = 1; i <= m; i++) { int u, v; cin >> u >> v; adj[u].push_back(v); adj[v].push_back(u); } for (int i = 1; i <= n; i++) { if (!visited[i]) k++, dfs(i, 0); } if (n == m && k == 1) cout << FHTAGN! n ; else cout << NO n ; }
#include <bits/stdc++.h> using namespace std; long long m, n, x, y, p, q; int main() { cin >> n; for (long long k = 0; k < n; k++) { cin >> x >> y >> p >> q; m += (p - x + 1) * (q - y + 1); } cout << m; }
#include <bits/stdc++.h> using namespace std; struct data { int x; int y; }; int main() { long long n; cin >> n; vector<data> info; long long smallest = 9999999999; long long largest2 = -1; for (int i = 0; i < n; i++) { data temp; cin >> temp.x >> temp.y; if (temp.y < smallest) { smallest = temp.y; } if (temp.x > largest2) { largest2 = temp.x; } info.push_back(temp); } long long m; cin >> m; vector<data> info2; long long largest = -1; long long smallest2 = 9999999999; for (int i = 0; i < m; i++) { data temp; cin >> temp.x >> temp.y; if (temp.x > largest) { largest = temp.x; } if (temp.y < smallest2) { smallest2 = temp.y; } info2.push_back(temp); } cout << max(max(largest - smallest, largest2 - smallest2), (long long)0) << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int MAX = 1010; int n, t, pop = -1, p[2 * MAX], para[2 * MAX], odw[2 * MAX]; inline void dodaj_pare(int a, int b) { para[a] = b; para[b] = a; } void wczytaj_dane() { int m; cin >> n >> m; for (int i = 0; i < (2 * n); i++) cin >> p[i]; fill(para, para + 2 * n, -1); while (m--) { int a, b; cin >> a >> b; dodaj_pare(a - 1, b - 1); } cin >> t; } void wypisz(int x) { assert(!odw[x]); odw[x] = true; cout << (x + 1) << n ; fflush(stdout); } int najsilniejszy_sparowany() { int x = -1; for (int i = 0; i < (2 * n); i++) if ((!odw[i]) && para[i] != -1 && (x == -1 \|\| p[x] < p[i])) x = i; return x; } int najsilniejszy() { int x = -1; for (int i = 0; i < (2 * n); i++) if ((!odw[i]) && (x == -1 \|\| p[x] < p[i])) x = i; assert(x != -1); return x; } int rozwiaz() { int x = najsilniejszy_sparowany(); if (x != -1) return x; return najsilniejszy(); } void moj_ruch() { if (pop != -1 && para[pop] != -1 && (!odw[para[pop]])) { wypisz(para[pop]); return; } wypisz(rozwiaz()); } inline int wczytaj() { int x; cin >> x; if (x == -1) exit(1); return x - 1; } void twoj_ruch() { int x = wczytaj(); odw[x] = true; pop = x; } void zrob_test() { wczytaj_dane(); fill(odw, odw + 2 * n, false); if (t == 1) { for (int q = 0; q < (n); q++) { moj_ruch(); twoj_ruch(); } } else { for (int q = 0; q < (n); q++) { twoj_ruch(); moj_ruch(); } } } int main() { zrob_test(); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int N; scanf( %d , &N); static int X[100]; for (int i = 0; i < N; i++) scanf( %d , &X[i]); vector<int> Ans; for (int i = 0, Count = 0, First = 0; i < N; i++) { if (X[i] < 0) Count++; if (i == N - 1 \|\| (Count == 2 && X[i + 1] < 0)) { Ans.push_back(i - First + 1); First = i + 1; Count = 0; } } int M = Ans.size(); printf( %d n , M); for (int i = 0; i < M; i++) { printf( %d , Ans[i]); putchar((i + 1 == M) ? n : ); } return 0; }
#include <bits/stdc++.h> using namespace std; long long bigmod(long long b, long long p, long long m) { if (p == 0) return 1; long long my = bigmod(b, p / 2, m); my = my; my %= m; if (p & 1) my = b, my %= m; return my; } int setb(int n, int pos) { return n = n \| (1 << pos); } int resb(int n, int pos) { return n = n & ~(1 << pos); } bool checkb(int n, int pos) { return (bool)(n & (1 << pos)); } struct info { int x, y, idx; info() {} info(int _x, int _y, int _idx) { x = _x; y = _y; idx = _idx; } bool operator<(const info &p) const { if (y == p.y) return x < p.x; else return y < p.y; } }; info ara[200005]; bool taken[200005]; int n; int last[2]; bool fuck() { int i; last[0] = last[1] = -1; for (i = 1; i <= n; i++) { if (last[0] > last[1]) swap(last[0], last[1]); if (ara[i].x > last[1]) { last[1] = ara[i].y; continue; } if (ara[i].x > last[0]) { last[0] = ara[i].y; continue; } return 0; } return 1; } int main() { int x, y, i; scanf( %d , &n); for (i = 1; i <= n; i++) { scanf( %d %d , &x, &y); ara[i] = info(x, y, i); } sort(ara + 1, ara + n + 1); bool f = fuck(); if (f) puts( YES ); else puts( NO ); return 0; }
#include <bits/stdc++.h> using namespace std; bool check(string& a) { for (int i = 1; i < a.size(); i++) { if (abs(a[i] - a[i - 1]) == 1) return false; } return true; } string gen(string a) { if (check(a)) return a; while (next_permutation(a.begin(), a.end())) { if (check(a)) return a; } return ; } string print(string& t, map<char, int>& cnt) { string res; for (auto it : t) { res += string(cnt[it], it); } return res; } void solve() { string in; cin >> in; map<char, int> cnt; for (char i : in) cnt[i]++; string res; for (auto it : cnt) { res += it.first; } if (res.size() <= 8) { string temp = gen(res); if (temp.empty()) { cout << No answer << endl; return; } cout << print(temp, cnt) << endl; return; } string t; for (int i = 0; i < res.size(); i += 2) { t += res[i]; } for (int i = 1; i < res.size(); i += 2) { t += res[i]; } cout << print(t, cnt) << endl; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t = 1; cin >> t; while (t--) { solve(); } }
#include <bits/stdc++.h> using namespace std; int max2[205][6005]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); fill_n(max2[0], 205 * 6005, -1); max2[0][0] = 0; int n, k; cin >> n >> k; for (int i = 0; i < n; i++) { long long int a; cin >> a; int p2 = 0, p5 = 0; while (a % 2 == 0) { a /= 2; p2++; } while (a % 5 == 0) { a /= 5; p5++; } for (int pos = k - 1; pos >= 0; pos--) { for (int s = p5; s < 6005; s++) { if (max2[pos][s - p5] != -1) { max2[pos + 1][s] = max(max2[pos + 1][s], max2[pos][s - p5] + p2); } } } } int best = 0; for (int i = 0; i < 6005; i++) { best = max(best, min(i, max2[k][i])); } cout << best << n ; return 0; }
#include <bits/stdc++.h> using namespace std; inline long long read() { long long x = 0, f = 0; char ch = getchar(); while (!isdigit(ch)) f \|= (ch == - ), ch = getchar(); while (isdigit(ch)) x = x * 10 + ch - 0 , ch = getchar(); return f ? -x : x; } inline void write(long long x) { if (x < 0) x = -x, putchar( - ); if (x >= 10) write(x / 10); putchar(x % 10 + 0 ); } long long n, now[4][4] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}; inline long long find(long long x, long long y) { return (x / 4) * (n / 4) + y / 4 + 1; } signed main() { n = read(); for (register long long i = 0; i <= n - 1; i++) { for (register long long j = 0; j <= n - 1; j++) { long long at = find(i, j); cout << (at - 1) * 16 + now[i % 4][j % 4] << ; } puts( ); } return 0; }
#include <bits/stdc++.h> using namespace std; int row[1010]; int main() { int n, m, k; scanf( %d %d %d , &n, &m, &k); memset(row, 0x3f3f3f3f, sizeof row); long long ans = 0; for (int i = (0); i < (n); ++i) { int r, c; scanf( %d %d , &r, &c); row[r] = min(c, row[r]); } for (int i = 1; i <= m; ++i) ans += ((row[i] == 0x3f3f3f3f) ? 0 : row[i]); cout << min(ans, (long long)k) << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10; const int INF = 0x3f3f3f3f; const int inf = -INF; const int mod = 1e9 + 7; const double pi = acos(-1.0); string s; int pre[N]; int dp[N][2]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int T; cin >> T; while (T--) { int n, k; cin >> n >> k; cin >> s; pre[0] = 0; for (int i = 0; i <= n; i++) { dp[i][0] = dp[i][1] = 0; } s = + s; for (int i = 1; i <= n; i++) pre[i] = pre[i - 1] + s[i] - 0 ; for (int i = 1; i <= n; i++) { int t = max(0, i - k); dp[i][0] = min(dp[i - 1][0], dp[i - 1][1]) + (s[i] == 1 ); dp[i][1] = min(pre[i - 1], dp[t][1] + pre[i - 1] - pre[t]) + (s[i] == 0 ); } int ans = min(dp[n][0], dp[n][1]); cout << ans << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int main(void) { double d, l, v1, v2; cin >> d >> l >> v1 >> v2; printf( %.10lf , double((l - d) / (v1 + v2))); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, rej = 0; cin >> n; vector<int> a(n); for (size_t i = 0; i < n; i++) cin >> a[i]; sort(a.begin(), a.end()); for (int i = 0; i < n; i++) if (a[i] == a[0] \|\| a[i] == a[n - 1]) rej++; cout << n - rej; }
#include <bits/stdc++.h> using namespace std; const long long N = 1e5 + 5; long long read() { long long x = 0, f = 1; char ch; while (!isdigit(ch = getchar())) (ch == - ) && (f = -f); for (x = ch ^ 48; isdigit(ch = getchar()); x = (x << 3) + (x << 1) + (ch ^ 48)) ; return x * f; } template <class T> void Max(T &a, T b) { a = a > b ? a : b; } template <class T> void Min(T &a, T b) { a = a < b ? a : b; } long long n, l[4], r[4], L[4], R[4], x[N], y[N], z[N]; bool check(long long p, bool type) { for (long long i = 0; i <= 3; ++i) l[i] = -6e18, r[i] = 6e18; for (long long i = 1; i <= n; ++i) { Max(l[0], x[i] + y[i] + z[i] - p); Min(r[0], x[i] + y[i] + z[i] + p); Max(l[1], -x[i] + y[i] + z[i] - p); Min(r[1], -x[i] + y[i] + z[i] + p); Max(l[2], x[i] - y[i] + z[i] - p); Min(r[2], x[i] - y[i] + z[i] + p); Max(l[3], x[i] + y[i] - z[i] - p); Min(r[3], x[i] + y[i] - z[i] + p); } for (long long i = 0; i <= 3; ++i) if (l[i] > r[i]) return 0; for (long long A = 0, flag; A <= 1; ++A) { L[0] = l[0] - 3 * A, R[0] = r[0] - 3 * A; for (long long i = 1; i <= 3; ++i) L[i] = l[i] - A, R[i] = r[i] - A; for (long long i = 0; i <= 3; ++i) L[i] = (L[i] + 1) >> 1, R[i] >>= 1; flag = 1; for (long long i = 0; i <= 3; ++i) if (L[i] > R[i]) { flag = 0; break; } if (flag == 0) continue; long long L0 = L[1] + L[2] + L[3], R0 = R[1] + R[2] + R[3]; if (R[0] >= L0 && R0 >= L[0]) { if (type) { long long a = L[1], b = L[2], c = L[3]; if (a + b + c < L[0]) a += min(R[1] - L[1], L[0] - a - b - c); if (a + b + c < L[0]) b += min(R[2] - L[2], L[0] - a - b - c); if (a + b + c < L[0]) c += min(R[3] - L[3], L[0] - a - b - c); printf( %lld %lld %lld n , b + c + A, a + c + A, a + b + A); } return 1; } } return 0; } void solve() { n = read(); for (long long i = 1; i <= n; ++i) x[i] = read(), y[i] = read(), z[i] = read(); long long l = 0, r = 6e18, mid, ans; while (l <= r) { mid = (l + r) >> 1; if (check(mid, 0)) ans = mid, r = mid - 1; else l = mid + 1; } check(ans, 1); } signed main() { long long T = read(); while (T-- > 0) solve(); return 0; }
#include <bits/stdc++.h> using namespace std; long long int hell = 9223372036854775807; bool a[40000000]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int t; t = 1; while (t--) { for (long long int i = 1; i < 4000000; i++) { a[i] = true; } for (long long int i = 2; i * i < 4000000; i++) { if (a[i]) for (long long int j = i * i; j < 4000000; j = j + i) a[j] = false; } long long int n; cin >> n; vector<long long int> v; long long int k = 0; for (long long int i = 2; i * i <= n; i++) { if (n % i == 0 && a[i]) { v.push_back(i); if (n % (i * i) == 0) v.push_back(i); } if (n % i == 0) k++; } if (k == 0) cout << 1 << endl << 0; else if (v.size() > 1) { if (v[0] * v[1] < n) cout << 1 << endl << v[0] * v[1]; else cout << 2 ; } else cout << 2 ; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int a[6]; for (int i = 0; i < 6; i++) { cin >> a[i]; } cout << (a[0] + a[1] + a[2]) * (a[0] + a[1] + a[2]) - (a[0] * a[0]) - (a[2] * a[2]) - (a[4] * a[4]) << endl; }
#include <bits/stdc++.h> using namespace std; const int N = 5050; const int inf = 0x37373737; int L[N], R[N], size[N], tot, n, i, a, b, cnt, j, k; int d[N], root; int dp[N][N]; vector<pair<int, int> > vec[N]; vector<int> e[N]; void dfs(int x, int fa) { int i, j, k; if (e[x].size() == 1) size[x] = 1; for (i = 0; i < e[x].size(); i++) if (e[x][i] != fa) { dfs(e[x][i], x); for (j = size[x]; j >= 0; j--) for (k = 0; k <= size[e[x][i]]; k++) dp[x][j + k] = min(dp[x][j + k], dp[x][j] + dp[e[x][i]][k]); size[x] += size[e[x][i]]; } for (i = 0; i <= size[x]; i++) dp[x][i] = min(dp[x][i], dp[x][size[x] - i] + 1); } int main() { scanf( %d , &n); for (i = 1; i < n; i++) { scanf( %d%d , &a, &b); e[a].push_back(b); e[b].push_back(a); d[a]++; d[b]++; } if (n == 2) { printf( 1 ); return 0; } for (i = 1; i <= n; i++) if (d[i] != 1) break; root = i; for (i = 1; i <= n; i++) for (j = 1; j <= n; j++) dp[i][j] = inf; dfs(root, 0); printf( %d n , dp[root][size[root] / 2]); }
#include <bits/stdc++.h> using namespace std; template <typename T> void read(T &x) { T 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(); } x *= f; } template <typename T> void prll(T x) { if (x < 0) putchar( - ), x = -x; if (x > 9) prll(x / 10); putchar(x % 10 + 0 ); } struct Change { int x, y, Ans; } q[2005]; char s[2005][2005]; int up[2005][2005], down[2005][2005]; int dp[2005][2005]; int n, m, Q; struct Deque { int s, t, deq[2005]; Deque() { s = 1, t = 0; } bool empty() { return s > t; } void push_back(int x) { deq[++t] = x; } void pop_back() { t--; } void pop_front() { s++; } void clear() { s = 1, t = 0; } int front() { return deq[s]; } int back() { return deq[t]; } } q1, q2; bool check(const int x, const int len) { q1.clear(); q2.clear(); for (int i = 1; i < len; i++) { while (!q1.empty() && up[x][q1.back()] >= up[x][i]) q1.pop_back(); q1.push_back(i); while (!q2.empty() && down[x][q2.back()] >= down[x][i]) q2.pop_back(); q2.push_back(i); } for (int i = len; i <= m; i++) { while (!q1.empty() && q1.front() <= i - len) q1.pop_front(); while (!q2.empty() && q2.front() <= i - len) q2.pop_front(); while (!q1.empty() && up[x][q1.back()] >= up[x][i]) q1.pop_back(); q1.push_back(i); while (!q2.empty() && down[x][q2.back()] >= down[x][i]) q2.pop_back(); q2.push_back(i); if (up[x][q1.front()] + down[x][q2.front()] - 1 >= len) return true; } return false; } int main() { read(n); read(m); read(Q); for (int i = 1; i <= n; i++) scanf( %s , s[i] + 1); for (int i = 1; i <= Q; i++) { read(q[i].x); read(q[i].y); s[q[i].x][q[i].y] = X ; q[i].Ans = 0; } for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { if (s[i][j] != . ) s[i][j] = 0; if (s[i][j]) up[i][j] = up[i - 1][j] + 1; } } for (int i = n; i >= 1; i--) { for (int j = 1; j <= m; j++) if (s[i][j]) down[i][j] = down[i + 1][j] + 1; } int res = 0; for (int i = 1; i <= n; i++) if (s[i][1]) dp[i][1] = 1, res = max(res, dp[i][1]); for (int i = 1; i <= m; i++) if (s[1][i]) dp[1][i] = 1, res = max(res, dp[i][1]); for (int i = 2; i <= n; i++) { for (int j = 2; j <= m; j++) if (s[i][j]) dp[i][j] = min(dp[i - 1][j], min(dp[i][j - 1], dp[i - 1][j - 1])) + 1, res = max(res, dp[i][j]); } for (int i = Q; i >= 1; i--) { q[i].Ans = res; if (i == 1) break; int x = q[i].x, y = q[i].y; s[x][y] = 1; for (int i = 1; i <= n; i++) if (s[i][y]) up[i][y] = up[i - 1][y] + 1; for (int i = n; i >= 1; i--) if (s[i][y]) down[i][y] = down[i + 1][y] + 1; int l = 0, r = m, mid, ans; while (l <= r) { mid = (l + r) >> 1; if (check(x, mid)) l = mid + 1, ans = mid; else r = mid - 1; } res = max(ans, res); } for (int i = 1; i <= Q; i++) printf( %d n , q[i].Ans); return 0; }
#include <bits/stdc++.h> int main() { int i, j, k, l, y, m, n; char s[101], t[101]; scanf( %d , &y); for (i = y + 1;; i++) { n = i; j = n % 10; n = n / 10; k = n % 10; n = n / 10; l = n % 10; n = n / 10; if (n != l && n != k && n != j && l != k && l != j && k != j) { printf( %d n , i); return 0; } } return 0; }
#include <bits/stdc++.h> using namespace std; inline int read() { int s = 0, t = 1; char ch = getchar(); while (ch < 0 \|\| ch > 9 ) { if (ch == - ) t = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) s = (s << 3) + (s << 1) + (ch ^ 48), ch = getchar(); return s * t; } const int N = 3005; int n, m, T, K, w[N], s[N], U[N], pr[N], su[N]; long long Sum, Ans; vector<int> G[N]; int C(int n) { return n * (n + 1) / 2; } void Add(int i, int t) { Sum += (1ll * (i - U[i]) * (su[i] - i) + C(su[i] - i - 1)) * t; } int main() { n = read(), m = read(), T = read(), K = read(); for (int i = 1; i <= T; i++) { int x = read(), y = read(); G[y].push_back(x); } if (K == 0) return cout << 1ll * n * (n + 1) / 2 * m * (m + 1) / 2, 0; for (int l = 1; l <= m; l++) { memset(w, 0, sizeof(w)), Sum = 0; for (int r = l; r <= m; r++) for (auto x : G[r]) w[x]++; for (int i = 1; i <= n; i++) if (i == 1 \|\| w[i]) { U[i] = i, pr[i] = i - 1, su[i] = i + 1, s[i] = 0; while (pr[i] && !w[pr[i]]) pr[i]--; if (i > 1) pr[i] = max(pr[i], 1); while (su[i] <= n && !w[su[i]]) su[i]++; while (U[i] && s[i] + w[U[i]] < K) s[i] += w[U[i]], U[i] = pr[U[i]]; Add(i, +1); } for (int r = m; r >= l; r--) { Ans += Sum; for (auto x : G[r]) { int t = x; w[x]--; if (x != 1 && !w[x]) { t = su[x], pr[su[x]] = pr[x]; Add(x, -1), Add(pr[x], -1), su[pr[x]] = su[x], Add(pr[x], +1); } for (int j = 1, i = t; j <= K && i <= n; j++, i = su[i]) { if (U[i] < x) s[i]--; Add(i, -1); while (U[i] && s[i] + w[U[i]] < K) s[i] += w[U[i]], U[i] = pr[U[i]]; Add(i, +1); } } } } cout << 1ll * n * (n + 1) / 2 * m * (m + 1) / 2 - Ans; return 0; }
#include <bits/stdc++.h> using namespace std; inline char gc() { static char buf[100000], p1 = buf, p2 = buf; return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2) ? EOF : p1++; } inline int read() { int x = 0; char ch = getchar(); bool positive = 1; for (; !isdigit(ch); ch = getchar()) if (ch == - ) positive = 0; for (; isdigit(ch); ch = getchar()) x = x 10 + ch - 0 ; return positive ? x : -x; } inline void write(long long x) { if (x < 0) x = -x, putchar( - ); if (x > 9) write(x / 10); putchar(x % 10 + 0 ); } inline void writeln(long long x) { write(x); puts( ); } struct Node { int x, y, w; } a, b, c, g[6005]; int n, x, y, S, m[5][5], f[5][5][5]; long long now1, now2, ans1, ans2, ans3; inline int gcd(int x, int y) { return x % y ? gcd(y, x % y) : y; } int main() { n = read(); for (int i = 1; i <= n; i++) { g[i].x = read(); g[i].y = read(); } for (int i = 1; i <= n; i++) { memset(f, 0, sizeof f); a.x = (g[i].x + 3) % 4 + 1; a.y = (g[i].y + 3) % 4 + 1; for (int j = 1; j <= n; j++) { if (i != j) { if (abs(g[i].x - g[j].x) * abs(g[i].y - g[j].y)) { f[(g[j].x + 3) % 4 + 1][(g[j].y + 3) % 4 + 1] [(gcd(abs(g[i].x - g[j].x), abs(g[i].y - g[j].y)) + 3) % 4 + 1]++; } else { f[(g[j].x + 3) % 4 + 1][(g[j].y + 3) % 4 + 1] [(abs(g[i].x - g[j].x) + abs(g[i].y - g[j].y) + 3) % 4 + 1]++; } } } for (int j = 0; j < 16; j++) { b.x = j / 4 + 1; b.y = j % 4 + 1; for (b.w = 1; b.w <= 4; b.w++) { now1 = f[b.x][b.y][b.w]; f[b.x][b.y][b.w]--; for (int k = 0; k < 16; k++) { c.x = k / 4 + 1; c.y = k % 4 + 1; S = a.x * (b.y - c.y) + b.x * (c.y - a.y) + c.x * (a.y - b.y); if (S & 1) continue; S /= 2; for (c.w = (b.w + 1) % 2 + 1; c.w <= 4; c.w += 2) { now2 = now1 * f[c.x][c.y][c.w]; a.w = gcd(abs(b.x - c.x) + 4, abs(b.y - c.y) + 4); if ((S + (a.w + b.w + c.w) / 2) & 1) continue; if (b.w % 2 + c.w % 2) { ans1 += now2; } else { ans2 += now2; } } } f[b.x][b.y][b.w]++; } } } writeln(ans1 / 2 + ans2 / 6); return 0; }
#include <bits/stdc++.h> using namespace std; int n; vector<stack<int>> ids; vector<int> b; string answer; int segtree_size; template <typename T> struct segtree { int segtree_size; vector<T> segtree; T identity; T (UpdateFn)(T, T); void InitSegtree(int main_size, T (UpdateFunction)(T, T), T fun_identity) { segtree_size = 1; while (segtree_size < main_size) segtree_size = 2; segtree_size = 2; segtree.resize(segtree_size); UpdateFn = UpdateFunction; this->identity = fun_identity; } void UpdateAllParents() { for (int i = segtree_size / 2 - 1; i > 0; i--) segtree[i] = UpdateFn(segtree[i * 2], segtree[i * 2 + 1]); } void ChangeValue(int index, T value) { segtree[index + segtree_size / 2] = value; } T GetValue(int index) { return segtree[index + segtree_size / 2]; } void Update(int pos, T value) { for (segtree[pos += segtree_size / 2] = value; pos > 1; pos /= 2) segtree[pos / 2] = UpdateFn(segtree[pos], segtree[pos ^ 1]); } T Query(int start, int finish) { T ans = this->identity; for (start += segtree_size / 2, finish += segtree_size / 2; start < finish; start /= 2, finish /= 2) { if (start % 2 == 1) ans = UpdateFn(ans, segtree[start++]); if (finish % 2 == 0) ans = UpdateFn(ans, segtree[finish--]); } return UpdateFn(ans, segtree[start]); } void Destroy() { segtree.clear(); } }; struct segtree<int> tree; void In() { cin >> n; ids.resize(n + 1); b.resize(n); tree.InitSegtree( n + 1, [](int a, int b) -> int { return max(a, b); }, INT_MIN); int a; for (int i = 0; i < n; i++) { cin >> a; tree.ChangeValue(i, a); } tree.UpdateAllParents(); for (int i = 0; i < n; i++) cin >> b[i]; } void Solve() { answer = NO ; for (int i = 0; i < n; i++) ids[tree.GetValue(i)].push(i); for (int i = n - 1; i >= 0; i--) { if (ids[b[i]].empty()) return; int a_idx = ids[b[i]].top(); ids[b[i]].pop(); if (tree.Query(a_idx + 1, n) > b[i]) return; tree.Update(a_idx, 0); } answer = YES ; } void Out() { cout << answer << endl; tree.Destroy(); ids.clear(); b.clear(); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { In(); Solve(); Out(); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long n, i; cin >> n; long long a[n + 1]; for (i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); long long ans = 0, sum = 0; for (i = 0; i < n; i++) { if (sum <= a[i]) { ans++; sum += a[i]; } } cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; inline int dcmp(double a, double b) { return fabs(a - b) < (1e-9) ? 0 : a < b ? -1 : +1; } int main() { int tc; scanf( %d , &tc); while (tc--) { int n; scanf( %d , &n); printf( %d n , n / 2); } return 0; }
#include <bits/stdc++.h> using namespace std; const long long inf = 4e18; long long ver[305][305], hor[305][305], ver2[305][305], hor2[305][305]; int con[305][305]; pair<pair<int, int>, pair<int, int> > ans; long long dif = inf, cur, a, b; int main(void) { memset(ver, 0, sizeof(ver)); memset(hor, 0, sizeof(hor)); memset(ver2, 0, sizeof(ver2)); memset(hor2, 0, sizeof(hor2)); int n, m, t, i, j, k, l, r, mid, it; int eq, asc, des; scanf( %d %d %d , &n, &m, &t); scanf( %d %d %d , &eq, &asc, &des); for ((i) = (1); (i) <= (n); ++(i)) { for ((j) = (1); (j) <= (m); ++(j)) { scanf( %d , &con[i][j]); if (j > 1) { hor[i][j] = hor[i][j - 1]; hor2[i][j] = hor2[i][j - 1]; if (con[i][j] == con[i][j - 1]) { hor[i][j] += eq; hor2[i][j] += eq; } else if (con[i][j - 1] < con[i][j]) { hor[i][j] += asc; hor2[i][j] += des; } else { hor[i][j] += des; hor2[i][j] += asc; } } if (i > 1) { ver[i][j] = ver[i - 1][j]; ver2[i][j] = ver2[i - 1][j]; if (con[i][j] == con[i - 1][j]) { ver[i][j] += eq; ver2[i][j] += eq; } else if (con[i - 1][j] < con[i][j]) { ver[i][j] += asc; ver2[i][j] += des; } else { ver[i][j] += des; ver2[i][j] += asc; } } } } for ((i) = (1); (i) <= (n - 2); ++(i)) { for ((j) = (1); (j) <= (m - 2); ++(j)) { for ((k) = (i + 2); (k) <= (n); ++(k)) { l = j + 2; r = m; while (l < r) { mid = (l + r + 1) / 2; a = hor[i][mid] - hor[i][j] + hor2[k][mid] - hor2[k][j]; b = ver2[k][j] - ver2[i][j] + ver[k][mid] - ver[i][mid]; cur = a + b; if (cur < t) l = mid; else r = mid - 1; } for ((it) = (l - 3); (it) <= (l + 3); ++(it)) { if (it < j + 2) continue; else if (m < it) break; a = hor[i][it] - hor[i][j] + hor2[k][it] - hor2[k][j]; b = ver2[k][j] - ver2[i][j] + ver[k][it] - ver[i][it]; cur = a + b; if (abs(cur - t) <= dif) { dif = abs(cur - t); ans = make_pair(make_pair(i, j), make_pair(k, it)); if (dif == 0) goto PRINT; } } } } } PRINT:; printf( %d %d %d %d n , ans.first.first, ans.first.second, ans.second.first, ans.second.second); return 0; }
#include <bits/stdc++.h> using namespace std; int const N = 1e6 + 2; int a[N]; int main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; for (int i = 0; i < (int)(n); ++i) cin >> a[i]; for (int i = 0; i < (int)((1 << n)); ++i) { long long sum = 0; for (int j = 0; j < (int)(n); ++j) if (i & (1 << j)) sum += a[j]; else sum -= a[j]; sum %= 360; if (!sum) return cout << YES , 0; } cout << NO << endl; }
#include <bits/stdc++.h> using namespace std; vector<long long> ft(1, 1LL); int n, ans[3], hg, xxx = 0; vector<int> graph[200005], vis(200005); queue<int> q; void dfs(int node, int par, int i, int h) { if (h >= hg) hg = h, ans[i] = node; for (auto child : graph[node]) if (child != par) dfs(child, node, i, h + 1); } int dfs2(int node, int par, int dest) { if (node == dest) { q.push(node); vis[node] = 1; return 1; } for (auto child : graph[node]) { if (child == par) continue; if (dfs2(child, node, dest)) { q.push(node), vis[node] = 1; return 1; } } return 0; } void solve() { cin >> n; for (long long i = 0; i < n - 1; i++) { int node1, node2; cin >> node1 >> node2; graph[node1].push_back(node2), graph[node2].push_back(node1); } dfs(1, 0, 0, 0); hg = 0; dfs(ans[0], 0, 1, 0); xxx = hg; dfs2(ans[0], 0, ans[1]); hg = 0; while (q.size()) { int p = q.front(); if (vis[p] >= hg and p != ans[0] and p != ans[1]) hg = vis[p], ans[2] = p; q.pop(); for (auto child : graph[p]) { if (vis[child] == 0) vis[child] = vis[p] + 1, q.push(child); } } cout << xxx + hg - 1 << n ; cout << ans[1] << << ans[2] << << ans[0]; } signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int t = 1; while (t--) { solve(); } }
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f, maxn = 200007; const long long MOD = 1004535809; const long long LINF = 0x3f3f3f3f3f3f3f3fLL; const long long P = 19260817; char nc() { static char buf[100000], p1 = buf, p2 = buf; return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2) ? EOF : p1++; } inline long long read() { long long x = 0, f = 1; char ch = getchar(); while (ch < 0 \|\| ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) x = ((x << 3) + (x << 1) + ch - 0 ) % MOD, ch = getchar(); return x f; } void write(int x) { if (!x) putchar( 0 ); if (x < 0) x = -x, putchar( - ); static int sta[20]; register int tot = 0; while (x) sta[tot++] = x % 10, x /= 10; while (tot) putchar(sta[--tot] + 48); } int n; char s[maxn]; int sump[maxn], sums[maxn]; int main() { scanf( %s , s + 1); n = strlen(s + 1); int f1 = 0, f2 = 0; for (int i = 1; i <= n; i++) { if (s[i] == ( ) f2 = 1; if (f2 == 1 && s[i] == ) ) f1 = 1; } if (f1 == 0) { printf( 0 ); return 0; } for (int i = 1; i <= n; i++) { sump[i] = sump[i - 1] + (s[i] == ( ); } for (int i = n; i >= 1; i--) { sums[i] = sums[i + 1] + (s[i] == ) ); } for (int i = 1; i <= n; i++) { if (sump[i] == sums[i]) { printf( 1 n%d n , 2 * sump[i]); for (int j = 1; j <= i; j++) { if (s[j] == ( ) printf( %d , j); } for (int j = i; j <= n; j++) { if (s[j] == ) ) printf( %d , j); } return 0; } } for (int i = 1; i <= n; i++) { if (sump[i] == sums[i + 1]) { printf( 1 n%d n , 2 * sump[i]); for (int j = 1; j <= i; j++) { if (s[j] == ( ) printf( %d , j); } for (int j = i + 1; j <= n; j++) { if (s[j] == ) ) printf( %d , j); } return 0; } } return 0; }
#include <bits/stdc++.h> using namespace std; bool bysec(const pair<int64_t, int64_t> &a, pair<int64_t, int64_t> &b) { return a.first > b.first; } void solve() { int64_t n, x, an = 0; cin >> n; pair<int64_t, int64_t> A[n]; for (int64_t i = 0; i < n; i++) cin >> x, A[i] = {x, i + 1}; sort(A, A + n, bysec); for (int64_t i = 0; i < n; i++) an += i * A[i].first + 1; cout << an << n ; for (int64_t i = 0; i < n; i++) cout << A[i].second << ; cout << n ; } signed main() { int64_t T = 1; while (T--) solve(); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { char s[100]; int n, t; cin >> n >> t; if (n == 1 && t == 10) cout << -1; else { if (t < 10) s[0] = t + 48; else s[0] = 1 ; for (int i = 1; i < n; i++) { s[i] = 0 ; } for (int i = 0; i < n; i++) { cout << s[i]; } } }
#include <bits/stdc++.h> using namespace std; inline long long read() { long long sum = 0, ff = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) ff = -1; ch = getchar(); } while (isdigit(ch)) sum = sum * 10 + (ch ^ 48), ch = getchar(); return sum * ff; } const long long N = 16; const long long mo = 1e9 + 7; long long n, m, f[1 << N][5], g[1 << N], a[N], b[N], ans; inline long long ksm(long long x, long long y) { long long ret = 1; while (y) { if (y & 1) ret = ret * x % mo; x = x * x % mo; y >>= 1ll; } return ret; } signed main() { n = read(); m = read(); for (long long i = 1; i <= n; i++) { a[i] = read(); b[i] = read(); } for (long long i = 1; i <= 3; i++) f[0][i] = 1; for (long long i = 0; i < (1 << n); i++) for (long long j = 1; j <= n; j++) { if (i & (1 << j - 1)) continue; for (long long k = 1; k <= 3; k++) if (b[j] != k) f[i \| (1 << j - 1)][b[j]] = (f[i \| (1 << j - 1)][b[j]] + f[i][k]) % mo; } for (long long i = 0; i < (1 << n); i++) { long long tot = 0; for (long long j = 1; j <= n; j++) if (i & (1 << j - 1)) tot += a[j]; if (tot == m) ans = (ans + f[i][1] + f[i][2] + f[i][3]) % mo; } printf( %lld n , ans * ksm(2ll, mo - 2) % mo); return 0; }
#include <bits/stdc++.h> using namespace std; struct V { vector<int> lnk; int p; int countBad(); }; V tab[400000]; int V::countBad() { int c = 0; for (__typeof((lnk).begin()) it = (lnk).begin(); it != (lnk).end(); ++it) if (tab[it].p == p) ++c; return c; } int main() { int n, m; scanf( %d%d , &n, &m); for (int(i) = 0; (i) < (m); ++(i)) { int a, b; cin >> a >> b; tab[a - 1].lnk.push_back(b - 1); tab[b - 1].lnk.push_back(a - 1); } for (int(i) = 0; (i) < (n); ++(i)) tab[i].p = 0; queue<int> Q; for (int(i) = 0; (i) < (n); ++(i)) { if (tab[i].countBad() > 1) Q.push(i); } while (!Q.empty()) { int curr = Q.front(); Q.pop(); if (tab[curr].countBad() > 1) { tab[curr].p ^= 1; for (__typeof((tab[curr].lnk).begin()) it = (tab[curr].lnk).begin(); it != (tab[curr].lnk).end(); ++it) Q.push(it); } } for (int(i) = 0; (i) < (n); ++(i)) { printf( %d , tab[i].p); } printf( n ); return 0; }
#include <bits/stdc++.h> using namespace std; int n; char dir[200005]; int l[200005], r[200005], ll, rl; int ans = 0x7fffffff; int main() { cin >> n; getchar(); for (int i = 1; i <= n; i++) scanf( %c , &dir[i]); for (int i = 1; i <= n; i++) if (dir[i] == L ) scanf( %d , &l[++ll]); else scanf( %d , &r[++rl]); if (ll == 0 \|\| rl == 0) { puts( -1 ); return 0; } int nowl = 1, nowr = 1; for (nowl = 1; nowl <= ll; nowl++) { do { nowr++; } while (nowr <= rl && r[nowr] < l[nowl]); nowr--; if (l[nowl] - r[nowr] > 0) ans = min(ans, l[nowl] - r[nowr]); } if (ans == 0x7fffffff) { puts( -1 ); return 0; } else cout << (ans >> 1) << endl; return 0; }
#include <bits/stdc++.h> using namespace std; using ll = int64_t; using ull = uint64_t; using ld = long double; using vi = vector<int64_t>; using pii = pair<int64_t, int64_t>; ll powr(ll a, ll b) { ll res = 1; while (b) { if (b & 1) res = (res * a); a = (a * a); b >>= 1; } return res; } void solve() { int64_t n, k; cin >> n >> k; k++; int64_t a[n]; for (int64_t i = 0; i < n; i++) { cin >> a[i]; a[i] = powr(10, a[i]); } sort(a, a + n); int64_t ans = 0; for (int64_t i = 0; i < n - 1 && k > 0; i++) { int64_t den = min(k, (a[i + 1] / a[i]) - 1); ans += a[i] * den; k -= den; } if (k > 0) { ans += a[n - 1] * k; } cout << ans << n ; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int64_t t; cin >> t; while (t--) solve(); }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; pair<long long int, long long int> a[100005]; for (int i = 0; i < n; i++) { cin >> a[i].first; a[i].second = i + 1; } sort(a, a + n); if (n % 2 == 0) { cout << n / 2 << endl; } else { cout << n / 2 + 1 << endl; } for (int i = 0; i < n; i += 2) { cout << a[i].second << ; } cout << endl << n / 2 << endl; for (int i = 1; i < n; i += 2) { cout << a[i].second << ; } }
#include <bits/stdc++.h> using namespace std; inline long long read() { long long f = 1, ans = 0; char c = getchar(); while (c < 0 \|\| c > 9 ) { if (c == - ) f = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { ans = ans * 10 + c - 0 ; c = getchar(); } return f * ans; } const long long MAXN = 4e5 + 11; long long phi[MAXN], N, A[MAXN], id[MAXN], pri[MAXN], mu[MAXN], v[MAXN], inv[MAXN], V[MAXN]; vector<long long> vec[MAXN], Vec[MAXN]; void Init() { mu[1] = 1, phi[1] = 1; V[1] = 1; for (long long i = 2; i <= N; i++) { if (!v[i]) { pri[++pri[0]] = i, v[i] = i, mu[i] = -1, phi[i] = i - 1; V[i] = inv[i - 1] * i % 1000000007; } for (long long j = 1; j <= pri[0] && i <= N / pri[j]; j++) { v[i * pri[j]] = pri[j]; if (!(i % pri[j])) { phi[i * pri[j]] = phi[i] * pri[j]; V[i * pri[j]] = V[i]; mu[i * pri[j]] = 0; break; } phi[i * pri[j]] = phi[i] * (pri[j] - 1); mu[i * pri[j]] = -mu[i]; V[i * pri[j]] = V[i] * V[pri[j]] % 1000000007; } } return; } long long ksm(long long a, long long b) { long long ans = 1; while (b) { if (b & 1) ans = a, ans %= 1000000007; a = a, a %= 1000000007; b >>= 1; } return ans; } long long in[MAXN], out[MAXN], rev[MAXN], dep[MAXN], tot, Log[MAXN], F[MAXN], sta[MAXN], Q[MAXN], q[MAXN], f[MAXN]; vector<long long> C; void dfs(long long u, long long fath) { in[u] = ++tot, rev[tot] = u, dep[u] = dep[fath] + 1; for (auto v : vec[u]) if (v != fath) { dfs(v, u); rev[++tot] = u; } out[u] = tot; } bool cmp(long long x, long long y) { return in[x] < in[y]; } struct RMQ { long long Minn[MAXN][21], ps[MAXN][21]; void init() { for (long long i = 1; i <= tot; i++) Minn[i][0] = dep[rev[i]], ps[i][0] = rev[i]; for (long long j = 1; (1 << j) <= tot; j++) for (long long i = 1; i + (1 << j) - 1 <= tot; i++) { if (Minn[i][j - 1] <= Minn[i + (1 << (j - 1))][j - 1]) Minn[i][j] = Minn[i][j - 1], ps[i][j] = ps[i][j - 1]; else Minn[i][j] = Minn[i + (1 << (j - 1))][j - 1], ps[i][j] = ps[i + (1 << (j - 1))][j - 1]; } return; } long long Qlca(long long u, long long v) { if (in[u] > in[v]) swap(u, v); long long L = in[u], R = in[v], len = R - L + 1, k = Log[len]; long long w1 = Minn[L][k], w2 = Minn[R - (1 << k) + 1][k]; if (w1 <= w2) return ps[L][k]; return ps[R - (1 << k) + 1][k]; } } S; void ins(long long x) { if (sta[0] == 1) { if (sta[1] != x) sta[++sta[0]] = x; return; } long long now = S.Qlca(x, sta[sta[0]]); while (sta[0] > 1 && dep[sta[sta[0] - 1]] >= dep[now]) Vec[sta[sta[0] - 1]].push_back(sta[sta[0]]), sta[0]--; if (dep[sta[sta[0]]] > dep[now]) Vec[now].push_back(sta[sta[0]]), sta[0]--; if (sta[sta[0]] != now) sta[++sta[0]] = now; sta[++sta[0]] = x; return; } void build() { sta[0] = 0; sta[++sta[0]] = 1; for (long long i = 1; i <= Q[0]; i++) ins(Q[i]); while (sta[0] > 1) Vec[sta[sta[0] - 1]].push_back(sta[sta[0]]), sta[0]--; return; } long long S1[MAXN], S2[MAXN], res, D; void Clear() { for (auto v : C) Vec[v].clear(), S1[v] = S2[v] = 0; C.clear(); return; } void dfs1(long long u) { long long now1 = 0, now2 = 0; C.push_back(u); for (auto v : Vec[u]) { dfs1(v); if (!(A[u] % D)) now2 += (S1[v] * phi[A[u]]) % 1000000007, now2 -= phi[A[u]] * S2[v] % 1000000007 * dep[u] % 1000000007, now2 = ((now2 % 1000000007) + 1000000007) % 1000000007; now1 -= 2 * dep[u] * S2[u] % 1000000007 * S2[v] % 1000000007, now1 = (now1 % 1000000007 + 1000000007) % 1000000007; now1 += S1[u] * S2[v], now1 += S2[u] * S1[v], now1 %= 1000000007; S1[u] += S1[v], S2[u] += S2[v]; S1[u] %= 1000000007, S2[u] %= 1000000007; } if (!(A[u] % D)) S1[u] += dep[u] * phi[A[u]] % 1000000007, S2[u] += phi[A[u]]; S1[u] %= 1000000007, S2[u] %= 1000000007; res += (now1 + now2) * 2 % 1000000007; return; } signed main() { N = read(); for (long long i = 1; i <= N; i++) A[i] = read(), id[A[i]] = i; inv[1] = 1; for (long long i = 2; i <= N; i++) inv[i] = (1000000007 - 1000000007 / i) * inv[1000000007 % i] % 1000000007; for (long long i = 1; i < N; i++) { long long u = read(), v = read(); vec[u].push_back(v), vec[v].push_back(u); } Init(); dfs(1, 0); Log[0] = -1; for (long long i = 1; i <= tot; i++) Log[i] = Log[i >> 1] + 1; S.init(); for (long long i = 1; i <= N; i++) { D = i; Q[0] = 0, sta[0] = 0; bool ff = 0; for (long long j = i; j <= N; j += i) Q[++Q[0]] = id[j]; sort(Q + 1, Q + Q[0] + 1, cmp); build(); res = 0; dfs1(1); F[i] = res; Clear(); } for (long long i = 1; i <= N; i++) for (long long j = i; j <= N; j += i) f[i] += mu[j / i] * F[j], f[i] = (f[i] % 1000000007 + 1000000007) % 1000000007; long long Ans = 0; for (long long i = 1; i <= N; i++) Ans += V[i] * f[i], Ans %= 1000000007; printf( %lld n , Ans * ksm(N * (N - 1) % 1000000007, 1000000007 - 2) % 1000000007); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<pair<int, int>> v(n); for (int i = 0; i < n; i++) cin >> v[i].first >> v[i].second; sort(v.begin(), v.end()); for (int i = 0; i < n - 1; i++) { if (v[i].second > v[i + 1].second && v[i].first != v[i + 1].first) { cout << Happy Alex ; return 0; } } cout << Poor Alex ; return 0; }
#include <bits/stdc++.h> using namespace std; int cnt[2]; int main() { ios::sync_with_stdio(false); string s; cin >> s; for (int i = s.size() - 1; i >= -1; i--) { if (i > -1) cnt[s[i] - 0 ]++; if (s[i] == 1 && (i == 0 \|\| s[i - 1] == 0 )) { int req = cnt[1] - cnt[0]; for (int j = i; j < s.size() && s[j] == 1 && req > 0; j++) { cnt[0]++; req--; s[j] = 0 ; } } } cout << s << n ; return 0; }
#include <bits/stdc++.h> using namespace std; const int nax = 3e5 + 5; int nxt[nax][20]; int reach[20]; int main() { int n, q; cin >> n >> q; vector<int> arr(n); for (int i = 0; i < n; i++) cin >> arr[i]; for (int bit = 0; bit < 19; bit++) reach[bit] = n; for (int i = n - 1; i >= 0; i--) { for (int bit = 0; bit < 19; bit++) { nxt[i][bit] = n; } for (int bit = 0; bit < 19; bit++) { if (arr[i] & (1 << bit)) { nxt[i][bit] = min(nxt[i][bit], reach[bit]); if (reach[bit] < n) { for (int j = 0; j < 19; j++) { nxt[i][j] = min(nxt[i][j], nxt[reach[bit]][j]); } } reach[bit] = i; } } } while (q--) { int x, y; cin >> x >> y; x--; y--; bool res = false; for (int bit = 0; bit < 19; bit++) { if (arr[y] & (1 << bit)) { if (nxt[x][bit] <= y) { res = true; break; } } } (res ? cout << Shi n : cout << Fou n ); } }
#include <bits/stdc++.h> using namespace std; int n, m, k, ta, tb, i, ans[100005], tc, ca[2][1005]; vector<int> va[2][1005], vb[2], ve; int main() { scanf( %d%d%d , &n, &m, &k); for (int a = 0; a < k; a++) { scanf( %d%d , &ta, &tb); ta--; tb--; vb[0].push_back(ta); vb[1].push_back(tb); ca[0][ta]++; ca[1][tb]++; ans[a] = -1; } for (int a = 0; a < n; a++) i = max(i, ca[0][a]); for (int a = 0; a < m; a++) i = max(i, ca[1][a]); for (int a = 0; a < n; a++) for (int b = 0; b < i; b++) va[0][a].push_back(-1); for (int a = 0; a < m; a++) for (int b = 0; b < i; b++) va[1][a].push_back(-1); for (int a = 0; a < k; a++) { tc = -1; ta = -1; tb = -1; for (int c = 0; c < i; c++) { if (va[0][vb[0][a]][c] == -1 && va[1][vb[1][a]][c] == -1) { tc = c; break; } else if (va[1][vb[1][a]][c] == -1) ta = c; else if (va[0][vb[0][a]][c] == -1) tb = c; } if (tc != -1) tb = tc; ve.clear(); ve.push_back(a); while (1) { tc = va[ve.size() % 2][vb[ve.size() % 2][ve.back()]] [(ve.size() & 1) ? tb : ta]; if (tc == -1) break; ve.push_back(tc); } for (int c = 0; c < ve.size(); c++) if (ans[ve[c]] != -1) { va[c % 2][vb[c % 2][ve[c]]][ans[ve[c]]] = -1; va[1 - c % 2][vb[1 - c % 2][ve[c]]][ans[ve[c]]] = -1; } for (int c = 0; c < ve.size(); c++) { ans[ve[c]] = (c & 1) ? ta : tb; va[c % 2][vb[c % 2][ve[c]]][(c & 1) ? ta : tb] = ve[c]; va[1 - c % 2][vb[1 - c % 2][ve[c]]][(c & 1) ? ta : tb] = ve[c]; } } printf( %d n , i); for (int a = 0; a < k; a++) printf( %d%c , ans[a] + 1, a == k - 1 ? n : ); return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 1000 + 100; int n, k; long long C[maxn][maxn]; void Init() { C[0][0] = 1; for (int i = 1; i < maxn; ++i) { for (int j = 0; j <= i; ++j) { if (j == 0 \|\| j == i) { C[i][j] = 1; } else { C[i][j] = C[i - 1][j - 1] + C[i - 1][j]; } } } } int main() { ios::sync_with_stdio(false); Init(); while (scanf( %d%d , &n, &k) != EOF) { long long ans = 0; if (k >= 1) { ans += 1; } if (k >= 2) { ans += C[n][2]; } if (k >= 3) { ans += C[n][3] * 2; } if (k >= 4) { ans += C[n][4] * 9; } printf( %I64d n , ans); } return 0; }
#include <bits/stdc++.h> using namespace std; const int INF = 2147483647; const long long LLINF = 9223372036854775807LL; int l, r, p; bool isprime(int x) { for (int i = 2; i * i <= x; ++i) if (x % i == 0) return false; return true; } const int maxn = 3000010; int a[maxn]; int acnt = 0; bool prime[110]; void gen(long long val, int lst) { if (lst < p) gen(val, lst + 1); if (prime[lst] && val * lst <= r) { a[acnt++] = val * lst; gen(val * lst, lst); } } int dp[maxn]; bool can[maxn]; int cinf = 110; int main() { for (int i = 0; i < 110; ++i) prime[i] = isprime(i); scanf( %d%d%d , &l, &r, &p); a[acnt++] = 1; gen(1, 2); sort(a, a + acnt); for (int i = 0; i < acnt; ++i) dp[i] = cinf; dp[0] = 0; for (int j = 0; j < p; ++j) { int ptr = 0; for (int i = 0; i < acnt; ++i) { if (dp[i] > p) continue; can[i] \|= dp[i] <= p; if (a[i] * (long long)j <= r) { int needval = a[i] * j; while (a[ptr] != needval) ++ptr; int wh = ptr; dp[wh] = min(dp[wh], dp[i] + 1); } ++dp[i]; } } int ans = 0; for (int i = 0; i < acnt; ++i) if (a[i] >= l) ans += can[i]; printf( %d n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; void speed() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); } void convertString(string &s, char t) { if (t == L ) { for (int i = 0; s[i] != 0 ; i++) if (s[i] >= 65 && s[i] <= 90) s[i] += 32; } else { for (int i = 0; s[i] != 0 ; i++) if (s[i] >= 97 && s[i] <= 122) s[i] -= 32; } } int compare_two_values(double a, double b) { if (fabs(a - b) <= 1e-10) return 0; return a > b ? 1 : -1; } int main() { speed(); short n, d, c = 0; cin >> n >> d; for (char i = a ; n > 0; n--) { cout << i; c++; if (c == 26 \|\| c == d) c = 0, i = a ; else i++; } return 0; }
#include <bits/stdc++.h> using namespace std; string s, ans; bool flag = 0; int main() { cin >> s; for (int i = 0; i < s.length(); ++i) { if (s[i] == / ) { if (!flag) { ans += s[i]; flag = 1; } } else { ans += s[i]; flag = 0; } } if (ans.length() > 1 && ans[ans.length() - 1] == / ) ans = ans.substr(0, ans.length() - 1); cout << ans << endl; }
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 7; struct Graph { int head[N], v[N << 1], w[N << 1], next[N << 1], e; void clear() { e = 0; memset(head, -1, sizeof(head)); } void add(int u, int v, int w) { this->v[e] = v; this->w[e] = w; next[e] = head[u]; head[u] = e++; } } G; int n, a[N], ans[N], id[N]; long long pre[N]; void dfs(int u, int d, long long sum) { id[d] = u; pre[d] = sum; int p = lower_bound(pre + 1, pre + 1 + d, sum - a[u]) - pre; ans[id[d - 1]]++; ans[id[p - 1]]--; for (int e = G.head[u]; ~e; e = G.next[e]) { int v = G.v[e], w = G.w[e]; dfs(v, d + 1, sum + w); ans[u] += ans[v]; } } int main() { cin >> n; for (int i = 1; i <= n; i++) { scanf( %d , a + i); } G.clear(); for (int i = 2; i <= n; i++) { int p, w; scanf( %d%d , &p, &w); G.add(p, i, w); } dfs(1, 1, 0); for (int i = 1; i <= n; i++) { printf( %d%c , ans[i], n [i == n]); } return 0; }
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; ++i) { cin >> a[i]; } set<int> vals; set<int> cur; for (int i = 0; i < n; ++i) { { set<int> cur2; transform(cur.begin(), cur.end(), inserter(cur2, cur2.end()), [&a, i](int x) { return x \| a[i]; }); cur = cur2; } cur.insert(a[i]); copy(cur.begin(), cur.end(), inserter(vals, vals.begin())); } cout << vals.size() << n ; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { string p; int i; bool work = false; cin >> p; for (i = 0; i < p.size(); i++) if (p[i] == H \|\| p[i] == Q \|\| p[i] == 9 ) work = true; if (work) cout << YES ; else cout << NO ; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long int q; cin >> q; while (q--) { long long int n, m; cin >> n >> m; char s[n][m]; for (long long int i = 0; i < n; i++) { for (long long int j = 0; j < m; j++) { cin >> s[i][j]; } } long long int r[n], c[m]; for (long long int i = 0; i < n; i++) { long long int temp = 0; for (long long int j = 0; j < m; j++) { if (s[i][j] == * ) { temp++; } } r[i] = temp; } for (long long int i = 0; i < m; i++) { long long int temp = 0; for (long long int j = 0; j < n; j++) { if (s[j][i] == * ) { temp++; } } c[i] = temp; } long long int ans = INT_MAX; for (long long int i = 0; i < n; i++) { for (long long int j = 0; j < m; j++) { long long int temp; temp = n + m - r[i] - c[j]; if (s[i][j] == . ) { temp--; } ans = min(ans, temp); } } cout << ans << endl; } }
#include <bits/stdc++.h> using namespace std; int a[300005]; int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); int Sum = 0; for (int i = 1; i <= n; i++) Sum += a[i]; int indx = 0; int Taken = 0; while (Sum > 2 * Taken) { indx++; Taken += a[indx]; } cout << indx << endl; }
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; long long ans = 0; for (int i = (0); i < (n); ++i) { long long t, T, x, cost; cin >> t >> T >> x >> cost; if (t >= T) { ans += cost + m * x; continue; } long long aux1 = cost; if (m > (T - t)) aux1 += m * x; long long aux2 = (long long)ceil((double)(m - (T - t)) / (T - t)) + 1; aux2 *= cost; ans += min(aux1, aux2); } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0, fl = 1; char st = getchar(); while (st < 0 \|\| st > 9 ) { if (st == - ) fl = -1; st = getchar(); } while (st >= 0 && st <= 9 ) x = x * 10 + st - 0 , st = getchar(); return x * fl; } const int N = 1e6 + 10, mod = 1e9 + 9; int n, b, w; long long ans, fac[8005], invfac[8005]; inline long long ksm(long long x, long long y) { long long res = 1; while (y) { if (y & 1) res = res * x % mod; x = x * x % mod; y >>= 1; } return res; } inline long long C(int x, int y) { return fac[x] * invfac[y] % mod * invfac[x - y] % mod; } int main() { ans = 1; n = read(); w = read(); b = read(); fac[0] = 1; fac[1] = 1; for (int i = 2; i <= 8000; i++) fac[i] = fac[i - 1] * i % mod; invfac[0] = invfac[1] = 1; invfac[8000] = ksm(fac[8000], mod - 2); for (int i = 7999; i >= 2; i--) { invfac[i] = invfac[i + 1] * (i + 1) % mod; } ans = fac[w] * fac[b] % mod; ans = ans * (w - 1) % mod; ans = ans * C(w + b - 3, n - 3) % mod; printf( %lld , ans); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); int n; cin >> n; int w, b; cin >> w >> b; vector<int> ve; for (int i = 0; i < n; i++) { int x; cin >> x; ve.push_back(x); } int res = 0; for (int i = 0, j = n - 1; i <= j; i++, j--) { if (ve[i] == ve[j] && ve[i] == 2) { res += (i == j ? 1 : 2) * min(w, b); } else if (ve[i] == ve[j]) continue; else if (ve[i] != ve[j]) { if (ve[i] == 2) res += (ve[j] == 0 ? w : b); else if (ve[j] == 2) res += (ve[i] == 0 ? w : b); else { cout << -1 << endl; return 0; } } } cout << res << endl; return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; int arr[n]; for (int i = 0; i < n; i++) { cin >> arr[i]; } int ans = 0; for (int i = 1; i < n; i++) { int a = max(0, k - (arr[i] + arr[i - 1])); arr[i] += a; ans += a; } cout << ans << n ; for (int i = 0; i < n; i++) cout << arr[i] << ; }

#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int c = 0, i; for (i = 4; i < s.size(); i++) { if (s[i - 4] == D && s[i - 3] == a && s[i - 2] == n && s[i - 1] == i && s[i] == l ) c++; } for (i = 3; i < s.size(); i++) { if (s[i - 3] == O && s[i - 2] == l && s[i - 1] == y && s[i] == a ) c++; } for (i = 4; i < s.size(); i++) { if (s[i - 4] == S && s[i - 3] == l && s[i - 2] == a && s[i - 1] == v && s[i] == a ) c++; } for (i = 2; i < s.size(); i++) { if (s[i - 2] == A && s[i - 1] == n && s[i] == n ) c++; } for (i = 5; i < s.size(); i++) { if (s[i - 5] == N && s[i - 4] == i && s[i - 3] == k && s[i - 2] == i && s[i - 1] == t && s[i] == a ) c++; } if (c == 1) cout << YES ; else cout << NO ; }

#include <bits/stdc++.h> using namespace std; const int N = 100001; int main(void) { char arr1[N] = {0}; char arr2[N] = {0}; char str1[2] = {0}, str2[2] = {0}; scanf( %[^ n]s , arr1); scanf( %[^ n]s , arr2); if (strlen(arr1) != strlen(arr2)) { cout << NO n ; return 0; } int a = 0; for (int i = 0, j = 0, k = 0; i < strlen(arr1); i++) { if (arr1[i] != arr2[i]) { a++; if (a <= 2) { str1[j++] = arr1[i]; str2[k++] = arr2[i]; } } } if (a == 2) { if ((str1[1] == str2[0]) && (str1[0] == str2[1])) cout << YES n ; else cout << NO n ; } else cout << NO n ; return 0; }

#include <bits/stdc++.h> using namespace std; int n, k; int main() { cin >> n >> k; if (n / 2 > k) return !printf( -1 ); if (n == 1) { if (k == 0) printf( 1 ); else printf( -1 ); return 0; } int t = k - (n - 2) / 2; printf( %d %d , t, 2 * t); for (int i = 1; i <= n - 2; ++i) printf( %d , i + 2 * t); return 0; }

#include <bits/stdc++.h> using namespace std; void input() {} void solve() { long long int n, m; cin >> n >> m; long long int a[n][m]; long long int flag = 1, temp = 0; for (long long int i = 0; i < n; i++) { for (long long int j = 0; j < m; j++) { char ch; cin >> ch; if (ch == A ) { a[i][j] = 1; } else { a[i][j] = 0; } if (a[i][j]) { flag = 0; } temp += a[i][j]; } } if (temp == n * m) { cout << 0 ; return; } if (flag) { cout << MORTAL ; return; } for (long long int i = 0; i < 1; i++) { long long int cnt1 = 0, cnt2 = 0; for (long long int j = 0; j < m; j++) { if (a[0][j]) { cnt1++; } if (a[n - 1][j]) { cnt2++; } } if (cnt1 == m || cnt2 == m) { cout << 1 ; return; } } for (long long int j = 0; j < 1; j++) { long long int cnt1 = 0, cnt2 = 0; for (long long int i = 0; i < n; i++) { if (a[i][0]) { cnt1++; } if (a[i][m - 1]) { cnt2++; } } if (cnt1 == n || cnt2 == n) { cout << 1 ; return; } } for (long long int i = 1; i < n - 1; i++) { long long int cnt = 0; for (long long int j = 0; j < m; j++) { if (a[i][j]) { cnt++; } } if (cnt == m) { cout << 2 ; return; } } for (long long int j = 1; j < m - 1; j++) { long long int cnt = 0; for (long long int i = 0; i < n; i++) { if (a[i][j]) { cnt++; } } if (cnt == n) { cout << 2 ; return; } } if (a[0][m - 1] || a[0][0] || a[n - 1][0] || a[n - 1][m - 1]) { cout << 2 ; return; } long long int cnt = 0; for (long long int i = 0; i < n; i++) { cnt += a[i][0]; cnt += a[i][m - 1]; } for (long long int i = 0; i < m; i++) { cnt += a[0][i]; cnt += a[n - 1][i]; } if (cnt) { cout << 3 ; } else { cout << 4 ; } } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); input(); int t = 1, i = 1; cin >> t; while (t--) { solve(); cout << n ; } }

#include <bits/stdc++.h> using namespace std; long long pow(long long p, long long r, long long m) { long long ans = 1; while (r > 0) { if (r & 1) { ans = ((ans % m) * (p % m)) % m; } r = r >> 1; p = ((p % m) * (p % m)) % m; } return ans; } string con(string s) { for (long long i = 0; i < s.length(); i++) { s[i] = toupper(s[i]); } return s; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); ; long long t; cin >> t; while (t--) { string s; cin >> s; stack<long long> s1; for (char i : s) { if (!s1.empty() && i == B ) s1.pop(); else s1.push(i); } cout << s1.size() << n ; } }

#include <bits/stdc++.h> using namespace std; string dna = ACGT ; string word[20]; set<string> words; map<string, int> mp; string pm[110]; pair<int, int> graph[110][20][4]; long long dp[1010][110][20]; int main() { ios::sync_with_stdio(false); int N, K, i, j, k, l, x; cin >> N >> K; for (i = 0; i < K; i++) cin >> word[i]; for (i = 0; i < K; i++) words.insert(word[i]); for (i = 0; i < K; i++) for (j = 1; j <= word[i].length(); j++) mp[word[i].substr(0, j)] = 0; mp[ ] = 0; int s = 0; for (auto itr = mp.begin(); itr != mp.end(); itr++) { (itr->second) = s; pm[s] = (itr->first); s++; } for (i = 0; i < s; i++) { for (j = 0; j < pm[i].length() + 1; j++) { for (k = 0; k < 4; k++) { string s = pm[i] + dna[k]; int nextst = -1; for (l = 0;; l++) { if (mp.find(s.substr(l)) != mp.end()) { nextst = mp[s.substr(l)]; break; } } bool cover = false; for (l = 0; l < pm[i].length() - j + 1; l++) if (words.find(s.substr(l)) != words.end()) cover = true; graph[i][j][k] = make_pair(-1, -1); int nextcover = j + 1; if (cover) nextcover = 0; if (nextcover >= 10 || nextcover > pm[nextst].length()) continue; graph[i][j][k] = make_pair(nextst, nextcover); } } } int start = mp[ ]; dp[0][start][0] = 1; for (i = 0; i < N; i++) { for (j = 0; j < s; j++) { for (k = 0; k < 10; k++) { if (dp[i][j][k] != 0) { for (x = 0; x < 4; x++) { pair<int, int> p = graph[j][k][x]; if (p.first != -1) { int i2 = i + 1, j2 = p.first, k2 = p.second; dp[i2][j2][k2] = (dp[i][j][k] + dp[i2][j2][k2]) % 1000000009ll; } } } } } } long long ans = 0; for (i = 0; i < s; i++) ans = (ans + dp[N][i][0]) % 1000000009ll; cout << ans << endl; return 0; }

#include <bits/stdc++.h> using namespace std; const int N = 100005; vector<int> v[2][N]; int a[N], q[N], n; bool vst[2][N]; void bfs(int val) { int i, j, qh = 0, qe = 0, k = val - 1, s, out; for (i = 1; i <= n; i++) if (a[i] == val) q[qe++] = i, vst[k][i] = 1; while (qh < qe) { out = q[qh++]; if (val != 2 || a[out] != 1) for (i = 0, s = v[k][out].size(); i < s; i++) if (!vst[k][j = v[k][out][i]]) q[qe++] = j, vst[k][j] = 1; } } int main() { int i, j, e; while (2 == scanf( %d%d , &n, &e)) { for (i = 1; i <= n; i++) scanf( %d , a + i), v[0][i].clear(), v[1][i].clear(); while (e--) { scanf( %d%d , &i, &j); v[0][i].push_back(j); v[1][j].push_back(i); } memset(vst, 0, sizeof vst); bfs(1); bfs(2); for (i = 1; i <= n; i++) puts(vst[0][i] && vst[1][i] ? 1 : 0 ); } return 0; }

#include <bits/stdc++.h> using namespace std; bool isPossible(long long k, long long x, long long y, long long p, long long q) { p = p * k; q = q * k; if (x > p || y > q) { return false; } if (q - y < p - x) { return false; } return true; } long long solve(long long x, long long y, long long p, long long q) { long long low = 1; long long high = 1e9; while (low < high) { long long mid = low + (high - low) / 2; if (!isPossible(mid, x, y, p, q)) { low = mid + 1; } else { high = mid; } } if (!isPossible(low, x, y, p, q)) { return -1; } return (q * low - y); } int main() { long long t; cin >> t; while (t--) { long long x, y, p, q; cin >> x >> y >> p >> q; cout << solve(x, y, p, q) << endl; } return 0; }

#include <bits/stdc++.h> using namespace std; inline bool eq(double a, double b) { return fabs(a - b) < 1e-9; } const long long int inf = 1e15; inline int two(int n) { return 1 << n; } inline int test(int n, int b) { return (n >> b) & 1; } inline void set_bit(int& n, int b) { n |= two(b); } inline void unset_bit(int& n, int b) { n &= ~two(b); } inline int last_bit(int n) { return n & (-n); } inline int ones(int n) { int res = 0; while (n && ++res) n -= n & (-n); return res; } string str; string sol(int n) { string ans; for (int i = (0); i < (n); i++) { ans = ans + (i < n / 2 ? 4 : 7 ); } return ans; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> str; int n = str.length(); if (n & 1) { cout << sol(n + 1) << endl; } else { int ind = -1, c4 = 0, c7 = 0; for (int i = (0); i < (n); i++) { if (str[i] > 7 ) { if (ind == -1) { cout << sol(n + 2) << endl; return 0; } else { str[ind] = 7 ; str[i] = 4 ; c7++; if (abs(c4 - c7) > n - i - 1) { cout << sol(n + 2) << endl; return 0; } else { int j = i + 1; for (int k = (j); k < (n); k++) { str[k] = 4 ; c4++; } for (int k = (n - 1); k >= (i + 1); k--) { if (c4 > c7) { str[k] = 7 ; c4--; c7++; } else { break; } } cout << str << endl; return 0; } } } else if (str[i] != 4 && str[i] != 7 ) { if (str[i] < 4 ) { str[i] = 4 ; c4++; } else { str[i] = 7 ; c7++; } if (abs(c4 - c7) > n - i - 1) { cout << sol(n + 2) << endl; return 0; } else { int j = i + 1; for (int k = (j); k < (n); k++) { str[k] = 4 ; c4++; } for (int k = (n - 1); k >= (i + 1); k--) { if (c4 > c7) { str[k] = 7 ; c4--; c7++; } else { break; } } cout << str << endl; return 0; } } else { if (str[i] == 4 ) { ind = i; c4++; } else c7++; } } if (c4 > c7) { for (int i = (ind); i >= (0); i--) { if (c4 > c7) { str[i] = 7 ; c4--; c7++; } else { break; } } cout << str << endl; } else if (c7 > c4) { int cc4 = 0, cc7 = 0; for (int i = 0; i <= ind; i++) { if (str[i] == 4 ) cc4++; else cc7++; } c4 = cc4, c7 = cc7; for (int i = (ind); i >= (0); i--) { if (str[i] == 4 ) { if (abs(c4 - c7 - 1) <= n - i - 1) { str[i] = 7 ; c4--; c7++; int j = i + 1; for (int k = (j); k < (n); k++) { str[k] = 4 ; c4++; } for (int k = (n - 1); k >= (i + 1); k--) { if (c4 > c7) { str[k] = 7 ; c4--; c7++; } else { break; } } cout << str << endl; return 0; } c4--; } else { c7--; } } cout << sol(n + 2) << endl; } else { cout << str << endl; } } return 0; }

#include <bits/stdc++.h> using namespace std; int d, m, n, x[25], a[30005]; vector<long long> ok; long long L, R; map<long long, vector<long long> > ans; map<long long, vector<long long> > zip; vector<long long> calc(long long lim) { if (zip.find(lim) != zip.end()) return zip[lim]; vector<long long> ret(m, 0); if (lim == 0) { ret[0] = 1; return ret; } for (int beg = 0; beg < d && beg <= lim; beg++) { long long nxt_lim = (lim - beg) / d; vector<long long> R = calc(nxt_lim); for (int i = 0; i < m; i++) { int a = (i + x[beg]); if (a >= m) a -= m; ret[a] += R[i]; } } return zip[lim] = ret; } void rec(long long lim, vector<long long> mask, bool F) { if (mask.size() == 1) { if (ans.find(lim) == ans.end()) { ans[lim] = vector<long long>(m, 0); } for (int i = 0; i < m; i++) { if (((mask[0] >> i) & 1LL)) { if (F) ans[lim][i]++; else ans[lim][i]--; } } return; } for (int beg = 0; beg < d && beg <= lim; beg++) { long long nxt_lim = (lim - beg) / d; vector<long long> vec; int zan = mask.size(); int bb = (d - beg); int xx = 1 + (zan - bb + d - 1) / d; vec.resize(xx, 0LL); long long B = (1LL << m) - 1; int cur = beg; int id = 0; for (int i = 0; i < mask.size(); i++) { int add = x[cur]; long long nw = 0; nw = (mask[i] >> add) | (mask[i] << (m - add)); B &= nw; if (cur == d - 1 || i == mask.size() - 1) { vec[id++] = B; B = (1LL << m) - 1; } cur++; if (cur == d) cur = 0; } assert(id == xx); rec(nxt_lim, vec, F); } } int main() { cin >> d >> m; for (int i = 0; i < d; i++) { cin >> x[i]; } cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; ok.push_back((2LL << a[i]) - 1LL); } cin >> L >> R; L--; R--; rec(R - n + 1, ok, true); if (L - 1 >= 0) rec(L - 1, ok, false); long long ret = 0; for (map<long long, vector<long long> >::iterator it = ans.begin(); it != ans.end(); it++) { vector<long long> tbl = calc(it->first); for (int i = 0; i < m; i++) { ret += tbl[i] * it->second[i]; } } cout << ret << endl; }

#include <bits/stdc++.h> int gcd(int a, int b) { return !b ? a : gcd(b, a % b); } long long pow(long long a, int p) { long long ans = 1; while (p) { if (p & 1) ans *= a; a *= a; p >>= 1; } return ans; } int main() { int n, l, r; scanf( %d%d%d , &n, &l, &r); if (n == 1) { printf( %d n , r - l + 1); return 0; } if (n == 2) { printf( %lld n , (long long)(r - l + 1) * (r - l)); return 0; } if (n > 30) { printf( 0 n ); return 0; } n--; int M = 1; while (pow(M + 1, n) <= r) M++; long long ans = 0; for (int y = 1; y <= M; y++) { for (int x = y + 1; x <= M; x++) if (gcd(x, y) == 1) { int py = pow(y, n), px = pow(x, n); int L = 1, R = l / py + 1; int RR = r / px; while (L < R) { int M = (L + R) / 2; if (M * py < l) L = M + 1; else R = M; } if (L <= RR) ans += RR - L + 1; } } printf( %lld n , ans << 1); return 0; }

#include <bits/stdc++.h> using namespace std; int32_t main() { long long int n, m; cin >> n >> m; long long int a[n], b[m]; long long int aux[n]; for (long long int i = 0; i < n; ++i) { cin >> a[i]; if (i == 0) aux[i] = a[i]; else aux[i] = aux[i - 1] + a[i]; } for (long long int i = 0; i < m; ++i) cin >> b[i]; long long int j = 0; for (long long int i = 0; i < m; ++i) { while (j < n && aux[j] < b[i]) ++j; if (j == 0) cout << j + 1 << << b[i] << endl; else cout << j + 1 << << b[i] - aux[j - 1] << endl; } }

#include <bits/stdc++.h> using namespace std; int n, m; set<long long> bms[6]; long long to_bit(string &s) { long long x = 0; for (long long i = 0; i < n; i++) { if (s[i] == 0 ) continue; x |= (1LL << i); } return x; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> m; bms[0].insert(0); for (int j = 1; j <= n; j++) { for (int i = min(j, 5); i >= 1; i--) { for (long long x : bms[i - 1]) { bms[i].insert(x | (1LL << (j - 1))); } } } int c; long long x; string s; set<long long> poss; cin >> s >> c; x = to_bit(s); for (long long bm : bms[c]) { poss.insert(~(x ^ bm)); } for (int i = 1; i < m; i++) { cin >> s >> c; x = to_bit(s); set<long long> tposs; for (long long bm : bms[c]) { if (!poss.count(~(x ^ bm))) continue; tposs.insert(~(x ^ bm)); } poss = tposs; } cout << poss.size() << n ; return 0; }

#include <bits/stdc++.h> using namespace std; int n, m; int g[100000], cnt[100000]; int v[100000], b[100000]; int s[100005], sc[100005], sz; bool used[100005] = {}, dead[100005] = {}, marked[100005] = {}; int main() { scanf( %d%d , &n, &m); for (int i = 0; i < (int)(n); ++i) scanf( %d , g + i), --g[i], cnt[i] = 1; for (int i = 0; i < (int)(m); ++i) scanf( %d , v + i); for (int i = 0; i < (int)(m); ++i) scanf( %d , b + i); int prevAns = 0; for (int q = 0; q < (int)(m); ++q) { int a = (v[q] + prevAns - 1) % n; int ans = 0; int rem = b[q]; --rem; if (!used[a]) { ans = 1; used[a] = true; } while (true) { sz = 0; while (used[g[a]]) { if (marked[a] || dead[a]) break; s[sz] = a; marked[a] = true; rem -= cnt[a]; a = g[a]; ++sz; } if (marked[a] || dead[a]) { for (int i = 0; i < (int)(sz); ++i) dead[s[i]] = true; for (int i = 0; i < (int)(sz); ++i) marked[s[i]] = false; break; } for (int i = 0; i < (int)(sz); ++i) marked[s[i]] = false; for (int i = sz - 1; i >= 0; --i) { cnt[s[i]] += cnt[g[s[i]]]; g[s[i]] = g[g[s[i]]]; } rem -= cnt[a]; if (rem < 0) { break; } a = g[a]; used[a] = true; ++ans; } printf( %d n , ans); prevAns = ans; } return 0; }

#include <bits/stdc++.h> using namespace std; const int MAXN = 200010; int a[MAXN]; int b[MAXN]; int tmp[MAXN]; int main() { int n; cin >> n; int aidx; for (int i = 0; i < n; i++) { cin >> tmp[i]; if (tmp[i] == 0) aidx = i; } for (int i = 0; i < n; i++) a[i] = tmp[(i + aidx) % n]; int bidx; for (int i = 0; i < n; i++) { cin >> tmp[i]; if (tmp[i] == 0) bidx = i; } for (int i = 0; i < n; i++) b[i] = tmp[(i + bidx) % n]; for (int i = 0; i < n - 1; i++) { a[i] = a[i + 1]; b[i] = b[i + 1]; } for (int i = 0; i < n - 1; i++) if (b[i] == a[0]) bidx = i; for (int i = 0; i < n - 1; i++) if (a[i] != b[(i + bidx) % (n - 1)]) { cout << NO << endl; return 0; } cout << YES << endl; }

#include <bits/stdc++.h> using namespace std; const double PI = acos(-1.0); const double eps = 1e-11; const int INF = 101e7; template <class T> T sqr(T first) { return first * first; } template <class T> T abs(T first) { return (first < 0) ? -first : first; } int main() { int n, m, h; cin >> n >> m >> h; n--; int sh = 0, sum = 0; for (int _b = (m), i = (1); i <= _b; i++) { if (i == h) { cin >> sh; sh--; } else { int k; cin >> k; sum += k; } } if (n > sh + sum) { cout << -1 n ; return 0; } double c = 1; for (int i = 0, _n = (n); i < _n; i++) { c *= (double(sum) / (sum + sh)); sum--; } printf( %.8f n , 1 - c); return 0; }

#include <bits/stdc++.h> using namespace std; void solve() { long long k; cin >> k; long long i = 0, prev = 0; while (k > prev + (9 * pow(10, i) * (i + 1))) { prev += 9 * pow(10, i) * (i + 1); i++; } k -= prev; long long temp; temp = pow(10, i) + (k / (i + 1)) - 1; if (k % (i + 1) != 0) { temp++; } if (k % (i + 1) == 0) { cout << temp % 10 << n ; } else { long long ans = temp / pow(10, i + 1 - (k % (i + 1))); ans %= 10; cout << ans << n ; } } int main() { ios_base ::sync_with_stdio(false); cin.tie(NULL); long long t = 1; while (t--) { solve(); } return 0; }

#include <bits/stdc++.h> using namespace std; const int64_t N = 1e3 + 5, M = 1e9 + 7; int64_t a[N][N]; int main() { ios::sync_with_stdio(0), cin.tie(0); int64_t n, m, s = 0; cin >> n >> m; for (int64_t i = 0; i < n; i++) for (int64_t j = 0; j < m; j++) cin >> a[i][j]; for (int64_t i = n - 2; i; i--) for (int64_t j = m - 2; j; j--) if (!a[i][j]) a[i][j] = min(a[i + 1][j], a[i][j + 1]) - 1; for (int64_t i = 0; i < n; i++) for (int64_t j = 1; j < m; j++) if (a[i][j] <= a[i][j - 1]) return cout << -1, 0; for (int64_t j = 0; j < m; j++) for (int64_t i = 1; i < n; i++) if (a[i][j] <= a[i - 1][j]) return cout << -1, 0; for (int64_t i = 0; i < n; i++) for (int64_t j = 0; j < m; j++) s += a[i][j]; cout << s; }

#include <bits/stdc++.h> using namespace std; const int maxn = 2e5; long long line[maxn]; int sum, q1, q2; int flag1, k, qw, wa, flag2; int main() { int n, zz = 1; cin >> n; for (int i = (int)(1); i < (int)(n + 1); i++) cin >> line[i]; while (zz <= n) { q1 = 0, q2 = 0, flag1 = 0, k = 0, wa = 0, flag2 = 0; sum++; for (int i = (int)(zz); i < (int)(n + 1); i++) { qw = i; if (line[i] != -1 && flag1 == 0) { q1 = line[i]; flag1 = 1; continue; } if (flag1 == 1 && line[i] == -1) { k++; continue; } if (line[i] == -1 && flag1 == 0) { wa++; continue; } if (line[i] != -1 && flag1 == 1) { q2 = line[i]; flag2 = 1; break; } } zz = qw; if (qw > n) break; if (qw == n && (flag2 == 0 || flag1 == 0)) break; if ((q2 - q1) % (k + 1) != 0) continue; long long d = (q2 - q1) / (k + 1); if (q1 - wa * d <= 0) continue; zz = qw + 1; while (zz <= n) { if (line[zz] == -1) { if (line[zz - 1] + d <= 0) break; line[zz] = line[zz - 1] + d; zz++; } else { if (line[zz] - line[zz - 1] != d) break; zz++; } } } cout << sum << endl; return 0; }

#include <bits/stdc++.h> using namespace std; long long n, m, a, b = 1, c, can[100000 * 10], cc, M, tmp[100000 * 10], ans = 0x3f3f3f3f3f3f3f3f, XH; inline long long cheng(long long u, long long v) { long long res = 0; for (; v; v >>= 1) { if (v & 1) res = (res + u) % M; u = u * 2 % M; } return res; } struct Jz { long long num[2][2]; Jz() { memset(num, 0, sizeof(num)); } Jz operator*(const Jz &u) const { Jz res; long long i, j, k; for (i = 0; i < 2; i++) { for (j = 0; j < 2; j++) { for (k = 0; k < 2; k++) { res.num[i][j] = (res.num[i][j] + cheng(num[i][k], u.num[k][j])) % M; } } } return res; } } dw; inline Jz po(Jz u, long long v) { Jz res; res.num[0][0] = res.num[1][1] = 1; for (; v;) { if (v & 1) res = res * u; u = u * u; v >>= 1; } return res; } inline long long ask(long long u) { Jz res = po(dw, u); return res.num[0][0]; } int main() { dw.num[0][1] = dw.num[1][0] = dw.num[1][1] = 1; long long i, j, k, t; cin >> n; t = n % 100000; for (i = 1;; i++) { if (t == a) can[++cc] = i; c = (a + b) % 100000; a = b, b = c; if (!a && b == 1) break; } for (M = 100000 * 10, XH = 150000; M <= (long long)1e13; M *= 10, XH *= 10) { t = n % M, k = 0; for (i = 1; i <= cc; i++) { for (j = 0; j <= 9; j++) { if (ask(can[i] + XH * j) % M == t) { tmp[++k] = can[i] + XH * j; } } } for (i = 1; i <= k; i++) can[i] = tmp[i]; cc = k; } if (!cc) { puts( -1 ); return 0; } for (i = 1; i <= cc; i++) ans = min(ans, can[i]); cout << ans - 1; }

#include <bits/stdc++.h> using namespace std; int store[20][1 << 20]; struct trie { int k; struct Node { Node* ch[2]; Node() { ch[0] = ch[1] = NULL; } }; Node* root; trie(int k) : k(k) { root = new Node(); } void insert(int x) { Node* cur = root; for (int i = k - 1; i >= 0; i--) { int side = x >> i & 1; if (!cur->ch[side]) cur->ch[side] = new Node(); cur = cur->ch[side]; } } void eval() { vector<int> ret(1 << k); for (int i = 0; i <= k; i++) fill(store[i], store[i] + (1 << k), 1 << 30); function<vector<pair<int, int> >(Node*, int)> dfs = [&](Node* node, int h) { if (!node) return vector<pair<int, int> >(); if (h == 0) { vector<pair<int, int> > ret = {{0, 0}}; return ret; } vector<pair<int, int> > A = dfs(node->ch[0], h - 1), B = dfs(node->ch[1], h - 1); vector<pair<int, int> > ret(1 << h); for (int x = 0; x < (1 << h); x++) { int add = 1 << (h - 1); int rem = x & (add - 1); if (x >> (h - 1) & 1) { ret[x].first = node->ch[1] ? B[rem].first : A[rem].first + add; ret[x].second = node->ch[0] ? A[rem].second + add : B[rem].second; } else { ret[x].first = node->ch[0] ? A[rem].first : B[rem].first + add; ret[x].second = node->ch[1] ? B[rem].second + add : A[rem].second; } if (!A.empty() && !B.empty()) { if (x >> (h - 1) & 1) store[h][x] = min(store[h][x], A[rem].first + add - B[rem].second); else store[h][x] = min(store[h][x], B[rem].first + add - A[rem].second); } assert(max(ret[x].first, ret[x].second) < (1 << h) && min(ret[x].first, ret[x].second) >= 0); } return ret; }; dfs(root, k); } }; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, k; cin >> n >> k; trie T(k); for (int i = 0; i < n; i++) { int x; cin >> x; T.insert(x); } T.eval(); for (int x = 0; x < (1 << k); x++) { int ans = 1 << 30; for (int h = k; h; h--) { ans = min(ans, store[h][x & ((1 << h) - 1)]); } cout << ans << ; } cout << n ; }

#include <bits/stdc++.h> using namespace std; int main() { int n, a[101], x = 0; string s1, s2; cin >> s1 >> s2; for (int i = 0; i < s1.size(); i++) { if (s1[i] != s2[i]) a[i] = 1; else a[i] = 0; x++; } for (int i = 0; i < x; i++) { cout << a[i]; } return 0; }

#include <bits/stdc++.h> using namespace std; struct app { int x, y; }; int main() { int n, m; scanf( %d , &n); scanf( %d , &m); int m1, m2; vector<app> arr(n); for (__typeof(0) i = 0; i <= n - 1; i++) { scanf( %d , &arr[i].x); scanf( %d , &arr[i].y); if (i == 0) { m1 = arr[i].x; m2 = arr[i].y; } else { if (arr[i].x * m2 < arr[i].y * m1) { m1 = arr[i].x; m2 = arr[i].y; } } } double ans = m * m1; ans = ans * 1.0 / m2 * 1.0; cout << fixed << setprecision(8) << ans; printf( n ); return 0; }

#include <bits/stdc++.h> using namespace std; const int oo = 0x3f3f3f3f; const double eps = 1e-9; const int MOD = 1000003; int R, C; char *grid[600000]; int main() { scanf( %d%d , &R, &C); for (int i = (0); i < (R); i++) { grid[i] = new char[C + 5]; scanf( %s , grid[i]); } int res = 1; for (int i = (0); i < (R); i++) { int b1 = 1, b2 = 1; for (int j = (0); j < (C); j++) { if (grid[i][j] == 1 || grid[i][j] == 2 ) { if (j % 2) { b1 = 0; } else { b2 = 0; } } else if (grid[i][j] == 3 || grid[i][j] == 4 ) { if (j % 2) { b2 = 0; } else { b1 = 0; } } } res = (res * (b1 + b2)) % MOD; } for (int j = (0); j < (C); j++) { int b1 = 1, b2 = 1; for (int i = (0); i < (R); i++) { if (grid[i][j] == 1 || grid[i][j] == 4 ) { if (i % 2) { b1 = 0; } else { b2 = 0; } } else if (grid[i][j] == 2 || grid[i][j] == 3 ) { if (i % 2) { b2 = 0; } else { b1 = 0; } } } res = (res * (b1 + b2)) % MOD; } cout << res << endl; return 0; }

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); long long n; cin >> n; long long s = 0; for (int i = 0; i < n; ++i) { long long x; cin >> x; s += x; } long long add = (s - n * (n - 1) / 2) / n; long long cnt = s - (n * (n - 1) / 2 + add * n); for (int i = 0; i < n; ++i) { cout << i + add + int(i < cnt) << ; } }

#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7, maxn = 2e3 + 5; long long f[maxn][maxn][2][2]; long long g[maxn]; long long n, m; long long upd(const long long &x) { if (x < 0) return x + mod; if (x >= mod) return x - mod; return x; } void add(long long &x, const long long &y) { x = upd(x + upd(y)); } long long jc[maxn], inv[maxn]; long long ksm(long long x, long long k) { long long ans = 1; while (k) { if (k & 1) ans = ans * x % mod; x = x * x % mod; k >>= 1; } return ans; } void init(long long n) { jc[0] = 1; for (long long i(1), endi(n); i <= endi; i++) jc[i] = jc[i - 1] * i % mod; inv[n] = ksm(jc[n], mod - 2); for (long long i(n - 1), endi(0); i >= endi; i--) inv[i] = inv[i + 1] * (i + 1) % mod; } long long C(long long n, long long m) { if (n < 0 || m < 0 || n < m) return 0; return jc[n] * inv[m] % mod * inv[n - m] % mod; } signed main() { scanf( %lld%lld , &n, &m); init(n); f[1][0][0][0] = 1; f[1][1][0][1] = 1; for (long long i(2), endi(n); i <= endi; i++) for (long long j(0), endj(n); j <= endj; j++) { if (j) { add(f[i][j][0][0], f[i - 1][j - 1][0][0]); add(f[i][j][1][0], f[i - 1][j - 1][0][1]); if (i != n) { add(f[i][j][0][1], f[i - 1][j - 1][0][0] + f[i - 1][j - 1][1][0]); add(f[i][j][1][1], f[i - 1][j - 1][0][1] + f[i - 1][j - 1][1][1]); } } add(f[i][j][0][0], f[i - 1][j][0][0] + f[i - 1][j][1][0]); add(f[i][j][1][0], f[i - 1][j][0][1] + f[i - 1][j][1][1]); } for (long long i(0), endi(n); i <= endi; i++) { add(g[i], f[n][i][0][0] + f[n][i][1][0]); g[i] = g[i] * jc[n - i] % mod; } long long ans = 0; for (long long i(m), endi(n); i <= endi; i++) { add(ans, ((i - m) & 1 ? -1 : 1) * g[i] * C(i, m) % mod); } cout << ans; return 0; }

#include <bits/stdc++.h> using namespace std; template <typename T> bool chmax(T &x, const T &y) { return (x < y) ? (x = y, true) : false; }; template <typename T> bool chmin(T &x, const T &y) { return (x > y) ? (x = y, true) : false; }; constexpr long long int MOD = 10; constexpr long long int INF = 2e18; int main() { int t; cin >> t; while (t--) { int n, m; cin >> n >> m; vector<long long int> p(n); for (long long int i = 0; i < (n); i++) cin >> p[i], p[i]--; vector<long long int> cnt(n, 0); for (long long int i = 0; i < (n); i++) { cnt[(p[i] - i + n) % n]++; } vector<long long int> ans; for (long long int i = 0; i < (n); i++) { if (n - cnt[i] <= m) { ans.push_back((-i + n) % n); } else if (n - cnt[i] <= m * 2) { int x = 0; vector<long long int> q(n); for (long long int j = 0; j < (n); j++) q[j] = p[(j - i + n) % n]; vector<long long int> f(n, 0); for (long long int j = 0; j < (n); j++) { if (f[j] == 0) { int now = j; while (f[now] == 0) { f[now] = 1; now = q[now]; x++; } x--; } } if (x <= m) ans.push_back((-i + n) % n); } } sort(ans.begin(), ans.end()); cout << ans.size(); for (auto i : ans) cout << << i; cout << endl; } return 0; }

#include <bits/stdc++.h> using namespace std; const long long int K = 998244353; long long int mu(long long int a, long long int n) { if (n == 0) return 1; long long int q = mu(a, n / 2); if (n % 2 == 0) return q * q % K; return q * q % K * a % K; } long long int d[55][55][55][55], inv[5305]; int isLiked[55], weight[55]; int n, m, total; long long int a, b; long long int calc(int w, int A, int B, int m, int i) { if (w * isLiked[i] + weight[i] < 0 || A + a < 0 || b - B < 0) return 0; if (m == 0) { return w * isLiked[i] + weight[i]; } if (d[w][A][B][m] != -1) return d[w][A][B][m]; long long int deno = inv[w * isLiked[i] + A - B + weight[i] + a + b]; long long int res = 0; res += (A + a) * calc(w, A + 1, B, m - 1, i) % K; res %= K; res += (b - B) * calc(w, A, B + 1, m - 1, i) % K; res %= K; res += (weight[i] + w * isLiked[i]) * calc(w + 1, A, B, m - 1, i) % K; res %= K; res = res * deno % K; return d[w][A][B][m] = res % K; } long long int solve(int i) { memset(d, -1, sizeof(d)); a = 0, b = 0; for (int j = 1; j <= n; j++) { if (j == i) continue; if (isLiked[j] == 1) { a += weight[j]; } else { b += weight[j]; } } return calc(0, 0, 0, m, i); } int main() { ios::sync_with_stdio(0); cin.tie(NULL); for (int i = 1; i <= 5300; i++) { inv[i] = mu(i, K - 2); } cin >> n >> m; for (int i = 1; i <= n; i++) { cin >> isLiked[i]; if (!isLiked[i]) isLiked[i] = -1; } for (int i = 1; i <= n; i++) { cin >> weight[i]; } for (int i = 1; i <= n; i++) { cout << solve(i) << endl; } return 0; }

#include <bits/stdc++.h> using namespace std; mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); void setIO(string name) { ios_base::sync_with_stdio(false); cin.tie(nullptr); cin.exceptions(istream::failbit); } const int inf = 0x3f3f3f3f, mod = 1e9 + 7, maxn = 1e5 + 5; vector<vector<pair<int, int>>> adj; vector<long long> pass, sub, weight, cost; void dfs(int c, int p) { if (p != -1 && adj[c].size() == 1) { sub[c] = 1; } for (auto i : adj[c]) { if (i.first != p) { dfs(i.first, c); pass[i.second] = sub[i.first]; sub[c] += sub[i.first]; } } } int main() { setIO( 1 ); int t; cin >> t; while (t--) { int n; cin >> n; long long s; cin >> s; adj = vector<vector<pair<int, int>>>(n); pass = sub = weight = cost = vector<long long>(n); for (int i = 0; i < n - 1; ++i) { int a, b; cin >> a >> b >> weight[i] >> cost[i]; --a, --b; adj[a].push_back({b, i}); adj[b].push_back({a, i}); } dfs(0, -1); pair<long long, long long> total; priority_queue<pair<long long, int>> one, two; for (int i = 0; i < n - 1; ++i) { if (cost[i] == 1) { total.first += pass[i] * weight[i]; one.push({pass[i] * (weight[i] - weight[i] / 2), i}); } else { total.second += pass[i] * weight[i]; two.push({pass[i] * (weight[i] - weight[i] / 2), i}); } } vector<long long> costs; while (total.first) { costs.push_back(total.first); pair<long long, int> cur = one.top(); one.pop(); total.first -= cur.first; weight[cur.second] /= 2; one.push( {pass[cur.second] * (weight[cur.second] - weight[cur.second] / 2), cur.second}); } costs.push_back(0); long long sol = 1e18, cnt = 0; while (total.second) { long long lo = 0, hi = (int)costs.size() - 1, mid, res = -1; while (lo <= hi) { mid = (lo + hi) / 2; if (costs[mid] + total.second <= s) { res = mid; hi = mid - 1; } else { lo = mid + 1; } } if (res != -1) { sol = min(sol, res + 2 * cnt); } pair<long long, int> cur = two.top(); two.pop(); total.second -= cur.first; weight[cur.second] /= 2; two.push( {pass[cur.second] * (weight[cur.second] - weight[cur.second] / 2), cur.second}); ++cnt; } long long lo = 0, hi = costs.size(), mid, res = -1; while (lo <= hi) { mid = (lo + hi) / 2; if (costs[mid] <= s) { res = mid; hi = mid - 1; } else { lo = mid + 1; } } if (res != -1) { sol = min(sol, res + 2 * cnt); } cout << min(sol, res + 2 * cnt) << endl; } return 0; }

#include <bits/stdc++.h> using namespace std; int M[33][33]; int S[33][33]; int m; int n; int solve(int sid) { memcpy(S, M, sizeof(int) * 33 * 33); for (int i = 0; i < m; i++) { if ((1 << i) & sid) { for (int k = m - 1; k < n; k++) { for (int l = i; l < i + m; l++) { S[k][l] *= -1; } } } } int ret = 0; for (int i = 0; i < n; i++) ret += S[m - 1][i]; for (int i = 0; i < m - 1; i++) { for (int j = 0; j < n; j++) { S[i][j] += S[m + i][j]; } } for (int i = 0; i < m - 1; i++) { int row1 = S[i][m - 1], row2 = S[i][m - 1] * -1; for (int j = 0; j < m - 1; j++) { row1 += abs(S[i][j] + S[i][m + j]); row2 += abs(S[i][j] - S[i][m + j]); } ret += max(row1, row2); } return ret; } int main() { cin >> n; m = (n + 1) / 2; for (size_t i = 0; i < n; ++i) { for (size_t j = 0; j < n; ++j) { cin >> M[i][j]; } } int sol = -10000000; for (size_t i = 0; i < (1 << m); ++i) { sol = max(solve(i), sol); } cout << sol << endl; return 0; }

#include <bits/stdc++.h> using namespace std; const int maxn = 100005; const int INF = 1 << 30; const double eps = 1e-6; const int mod = 1000000007; string s; void getVal(int& a, int& b, char x) { a = b = -1; for (int i = 0; i < s.size(); i++) { if (s[i] != x) continue; if (a == -1) a = i; b = i; } } int main() { cin >> s; int n = s.size(); int la, ra, lb, rb, lc, rc; bool ok = true; getVal(la, ra, a ); if (la == -1 || ra == -1) ok = false; getVal(lb, rb, b ); if (lb == -1 || rb == -1) ok = false; getVal(lc, rc, c ); if (lc == -1 || rc == -1) ok = false; if (ra + 1 != lb || rb + 1 != lc) ok = false; else if (rc - lc != rb - lb && rc - lc != ra - la) ok = false; puts(ok ? YES : NO ); return 0; }

#include <bits/stdc++.h> using namespace std; int N, i; double H, K, x, y, xp, yp; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> N >> K >> x >> y; for (i = 1; i < N; i++) { cin >> xp >> yp; H += sqrt((xp - x) * (xp - x) + (yp - y) * (yp - y)) * K / 50; x = xp; y = yp; } cout << fixed << setprecision(12) << H << n ; }

#include <bits/stdc++.h> #pragma comment(linker, /STACK:2000000 ) #pragma comment(linker, /HEAP:2000000 ) using namespace std; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n; cin >> n; long long m[n][n], a[n]; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { cin >> m[i][j]; } } long long x = sqrt((m[0][1] * m[0][2]) / m[1][2]); cout << x << ; for (int i = 1; i < n; i++) { cout << m[0][i] / x << ; } return 0; }

#include <bits/stdc++.h> using namespace std; const int N = 600, oo = 2e9; int nn[N], mm[N], n, m; int check() { int mn = oo; for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { if (nn[i] == mm[j]) mn = min(mn, nn[i]); } } if (mn == oo) return -1; return mn; } int main() { ios::sync_with_stdio(false); int mn1 = oo, mn2 = oo, mnb1 = oo, mnb2 = oo; cin >> n >> m; for (int i = 0; i < n; ++i) { cin >> nn[i]; mn1 = min(mn1, nn[i]); if (nn[i]) mnb1 = min(mnb1, nn[i]); } for (int i = 0; i < m; ++i) { cin >> mm[i]; mn2 = min(mn2, mm[i]); if (mm[i]) mnb2 = min(mnb2, mm[i]); } int mini = min(mn1, mn2), maxi = max(mn1, mn2); if (check() != -1) cout << check(); else if (!mn1) { cout << min(mn2 * 10, mnb1 * 10 + mn2); } else if (!mn2) cout << min(mn1 * 10, mnb2 * 10 + mn1); else cout << mini * 10 + maxi; return 0; }

#include <bits/stdc++.h> using namespace std; string s, t, temp; bool check(int mid, vector<int>& v) { temp = s; for (int i = 0; i < mid; i++) { temp[v[i]] = # ; } int x = 0; for (int i = 0; i < temp.size(); i++) { if (t[x] == temp[i]) { x++; } if (x == t.size()) return true; } return false; } int main() { cin >> s >> t; vector<int> v; for (int i = 0; i < s.size(); i++) { int a; cin >> a; v.push_back(a - 1); } int low = 0, high = s.size(); while (high - low > 1) { int mid = low + (high - low) / 2; if (check(mid, v)) low = mid; else high = mid; } cout << low << endl; return 0; }

#include <bits/stdc++.h> using namespace std; int da[100010], db[100010], ida[100010], idb[100010]; map<int, int> mp; map<int, int>::iterator it; void solve(int n) { for (int i = 1; i <= n; i++) { int ret = 0x3fffffff; it = mp.lower_bound(i - 1); if (it != mp.end()) ret = min(ret, it->first - (i - 1)); if (it != mp.begin()) { --it; ret = min(ret, (i - 1) - it->first); } printf( %d n , ret); mp[i - ida[db[i]]]--; if (mp[i - ida[db[i]]] == 0) mp.erase(i - ida[db[i]]); mp[i + n - ida[db[i]]]++; } } int main() { int n; while (scanf( %d , &n) != EOF) { mp.clear(); for (int i = 1; i <= n; i++) { scanf( %d , &da[i]); ida[da[i]] = i; } for (int i = 1; i <= n; i++) { scanf( %d , &db[i]); idb[db[i]] = i; } for (int i = 1; i <= n; i++) mp[i - ida[db[i]]]++; solve(n); } return 0; }

#include <bits/stdc++.h> using namespace std; long long modexpo(long long x, long long p) { long long res = 1; x = x % 1000000007; while (p) { if (p % 2) res = res * x; p >>= 1; x = x * x % 1000000007; res %= 1000000007; } return res; } struct compare { bool operator()(const pair<long long, long long> a, const pair<long long, long long> b) const { return a.first < b.first; } }; const long long nax = 2005; long long n, m; vector<pair<long long, long long>> robber, light, moves; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> m; robber.assign(n, {0, 0}); light.assign(m, {0, 0}); for (long long i = 0; i < n; i++) { cin >> robber[i].first >> robber[i].second; } for (long long i = 0; i < m; i++) { cin >> light[i].first >> light[i].second; } for (long long i = 0; i < n; i++) { for (long long j = 0; j < m; j++) { long long a = light[j].first - robber[i].first + 1; long long b = light[j].second - robber[i].second + 1; a = max(a, 0LL); b = max(b, 0LL); moves.push_back({a, b}); } } long long sz = moves.size(); sort(moves.begin(), moves.end()); vector<long long> suf(sz); suf[sz - 1] = moves[sz - 1].second; for (long long i = sz - 2; i >= 0; i--) { suf[i] = max(suf[i + 1], moves[i].second); } long long ans = suf[0]; for (long long i = 0; i < sz; i++) { ans = min(ans, moves[i].first + (i + 1 < sz ? suf[i + 1] : 0)); } cout << ans << n ; }

#include <bits/stdc++.h> using namespace std; const long long N = 3e5 + 5; struct Ans { long long a, b, c; }; void solve() { long long a, b, c; cin >> a >> b >> c; long long ans = 1e9; auto x = Ans{a, b, c}; for (long long aa = 1; aa <= 2 * a; aa++) { for (long long bb = aa; bb <= 2 * b; bb += aa) { long long op1 = bb * (c / bb); long long op2 = op1 + bb; long long diff = abs(a - aa) + abs(b - bb); long long y = diff + abs(c - op1); long long z = diff + abs(c - op2); if (y < ans) { ans = y; x.a = aa; x.b = bb; x.c = op1; } if (z < ans) { ans = z; x.a = aa; x.b = bb; x.c = op2; } } } cout << ans << n ; cout << x.a << << x.b << << x.c << n ; } int main(int argc, char *argv[]) { long long t; ios::sync_with_stdio(0); cin.tie(0); std::cout << std::fixed; std::cout << std::setprecision(15); cin >> t; for (long long z = 0; z < (long long)t; ++z) solve(); return 0; }

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { long long n, k; cin >> n >> k; int a[n]; int ma = INT_MIN; for (int i = 0; i < n; i++) { cin >> a[i]; if (a[i] > ma) ma = a[i]; } int m2 = INT_MIN; vector<int> v1, v2; for (int i = 0; i < n; i++) { a[i] = ma - a[i]; if (m2 < a[i]) m2 = a[i]; v1.push_back(a[i]); } for (int i = 0; i < n; i++) { a[i] = m2 - a[i]; } if (k % 2) { for (int i = 0; i < v1.size(); i++) cout << v1[i] << ; cout << endl; } else { for (int i = 0; i < n; i++) cout << a[i] << ; cout << endl; } } }

#include <bits/stdc++.h> using namespace std; vector<pair<long long, long long> > xy; vector<pair<long long, long long> > ab; vector<long long> x; vector<long long> y; string str, str1, str2, star[2000]; long long ara[200005], ara2[200005]; bool flagar[200005], flagar2[200005]; bool compare(pair<long long, long long> i, pair<long long, long long> j) { return (i.first < j.first); } bool compare2(pair<long long, long long> i, pair<long long, long long> j) { return (i.first > j.first); } long long gcd(long long a, long long b) { if (a % b == 0) return b; return gcd(b, a % b); } long long dp[2005][2005]; int main() { long long int n, ans, temp, t, j, i, m, h, h2, m2, c, a, b, mx, d, k, x1, r, l, mn; cin >> str >> k; n = str.length(); a = b = 0; for (i = n - 1; i >= 0; i--) { if (str[i] - 0 == 0) a++; else b++; if (a == k) { cout << b; return 0; } } if (a < k) { b = n - 1; } cout << b; return 0; }

#include <bits/stdc++.h> using namespace std; const int N = 2005, M = 200005; struct node { int x, y; } d[N]; int h, w, n, mod = 1e9 + 7; long long c[M] = {1, 1}, inv[M] = {1, 1}, ni[M] = {1, 1}, f[N]; long long quick_mod(long long a, long long b) { long long ans = 1; while (b) { if (b & 1) ans = ans * a % mod; b >>= 1; a = a * a % mod; } return ans; } void init() { for (int i = 2; i < M; i++) { c[i] = c[i - 1] * i % mod; ni[i] = (mod - mod / i) * ni[mod % i] % mod; inv[i] = ni[i] * inv[i - 1] % mod; } } long long C(int n, int m) { if (n < m) return 0; if (n == m || m == 0) return 1; return c[n] * inv[m] % mod * inv[n - m] % mod; } bool cmp(node a, node b) { if (a.x != b.x) return a.x < b.x; return a.y < b.y; } int main() { init(); scanf( %d%d%d , &h, &w, &n); for (int i = 0; i < n; i++) scanf( %d%d , &d[i].x, &d[i].y); sort(d, d + n, cmp); d[n].x = h; d[n].y = w; for (int i = 0; i <= n; i++) { f[i] = C(d[i].x + d[i].y - 2, d[i].x - 1); for (int j = 0; j < i; j++) { if (d[j].x > d[i].x || d[j].y > d[i].y) continue; f[i] = (f[i] - f[j] * C(d[i].x - d[j].x + d[i].y - d[j].y, d[i].x - d[j].x)) % mod; } f[i] = (f[i] + mod) % mod; } printf( %lld n , f[n]); return 0; }

#include <bits/stdc++.h> using namespace std; const int MAXINT = 2147483647; const long long MAXLL = 9223372036854775807LL; const int MAX = 400000; long long n, q, col, pref[MAX], l, r, sum, ans, t[MAX]; string s; int main() { cin >> n >> q; cin >> s; for (int i = 0; i < n; i++) { if (s[i] == 1 ) col++; pref[i] = col; } t[0] = 0; for (int i = 1; i <= 100005; i++) t[i] = (t[i - 1] + t[i - 1] + 1) % 1000000007; for (int i = 0; i < q; i++) { ans = 0, col = 0; cin >> l >> r; l--, r--; if (l == 0) sum = pref[r]; else sum = pref[r] - pref[l - 1]; if (t[r - l + 1] >= t[r - l + 1 - sum]) ans += t[r - l + 1] - t[r - l + 1 - sum]; else ans += t[r - l + 1] + 1000000007 - t[r - l + 1 - sum]; cout << ans << n ; } return 0; }

#include <bits/stdc++.h> using namespace std; using ll = int64_t; using vll = vector<ll>; using vvll = vector<vll>; using pll = pair<ll, ll>; using vpll = vector<pll>; ll a, n; vll inp; void func() { cin >> a; string s; cin >> s; n = s.length(); inp.resize(n); for (ll i = 0; i < n; i++) { inp[i] = s[i] - 0 ; } vll cnt(9 * n + 1, 0); for (ll i = 0; i < n; i++) { ll x = 0; for (ll j = i; j < n; j++) { x += inp[j]; cnt[x]++; } } ll ans = 0; if (a == 0) { ll total = accumulate(cnt.begin(), cnt.end(), 0ll); ans = 2 * (cnt[0] * total); ans -= cnt[0] * cnt[0]; } else { for (ll i = 1; i < 9 * n + 1; i++) { if (i > a) break; if (a % i == 0) { ll j = a / i; if (j < 9 * n + 1) { ans += cnt[i] * cnt[j]; } } } } cout << ans << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); ; ll t = 1; for (ll i = 1; i <= t; i++) { func(); } }

#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) #pragma GCC optimize( unroll-loops ) using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); const int maxn = 300007; int n, a[maxn]; static pair<int, int> tree[maxn << 2][20]; inline int min(int u, int v) { return u > v ? v : u; } inline int max(int u, int v) { return u > v ? u : v; } inline void pushup(int num, int val) { tree[num][val] = { min(tree[num << 1][val].first, tree[num << 1 | 1][val].first), max(tree[num << 1][val].second, tree[num << 1 | 1][val].second)}; } pair<int, int> query(int num, int l, int r, int val, int L, int R) { if (L <= l && r <= R) { return tree[num][val]; } int md = (l + r) >> 1; if (md >= L && md >= R) { return query(num << 1, l, md, val, L, R); } if (md < R && md < L) { return query(num << 1 | 1, md + 1, r, val, L, R); } if (md < R && md >= L) { pair<int, int> tmp = query(num << 1, l, md, val, L, R), tmp2 = query(num << 1 | 1, md + 1, r, val, L, R); return {min(tmp.first, tmp2.first), max(tmp.second, tmp2.second)}; } } void build(int num, int l, int r, int val) { if (l == r) { if (!val) { tree[num][0] = {max(l - a[l], 1), min(l + a[l], 3 * n)}; } else { pair<int, int> rg = query(1, 1, 3 * n, val - 1, l, l); tree[num][val] = query(1, 1, 3 * n, val - 1, rg.first, rg.second); } return; } int md = (l + r) >> 1; build(num << 1, l, md, val); build(num << 1 | 1, md + 1, r, val); pushup(num, val); } inline int calc(int u) { int ret = 0; pair<int, int> cnt = {u, u}; for (int i = 16; i > -1; --i) { pair<int, int> tmp = query(1, 1, 3 * n, i, cnt.first, cnt.second); if (tmp.second - tmp.first < n - 1) { ret += (1 << i); cnt = tmp; } } return ret; } int main() { scanf( %d , &n); if (n == 1) { puts( 0 ); return 0; } for (int i = 1; i <= n; ++i) { scanf( %d , &a[i]); a[i + n] = a[i + 2 * n] = a[i]; } for (int i = 0; i < 17; ++i) { build(1, 1, 3 * n, i); } for (int i = n + 1; i <= 2 * n; ++i) { printf( %d , calc(i) + 1); } return 0; }

#include <bits/stdc++.h> using namespace std; template <class T> inline void read(T& x) { bool fu = 0; char c; for (c = getchar(); c <= 32; c = getchar()) ; if (c == - ) fu = 1, c = getchar(); for (x = 0; c > 32; c = getchar()) x = x * 10 + c - 0 ; if (fu) x = -x; }; inline char getc() { char c; for (c = getchar(); c <= 32; c = getchar()) ; return c; } const int mod = 1000000007; int n, i, j, k, w; char st[1000010]; int a[1000010]; bool vis[100010][2]; long long T[100010], p[100010][2], l[100010][2], g[100010][2], s[100010][2], v[100010][2]; void get(int i, bool l0) { if (vis[i][l0]) return; vis[i][l0] = 1; if (i > w) { g[i][l0] = 1; return; } bool l2; long long c, LA = 0, Y; bool fir = 1; for (int j = 4; j <= 7; j += 3) if (l0 || (j <= a[i])) { c = j * T[w - i] % mod; l2 = l0 || (j < a[i]); get(i + 1, l2); g[i][l0] = ((g[i][l0]) + (g[i + 1][l2]) % mod) % mod; s[i][l0] = ((s[i][l0]) + (s[i + 1][l2] + c * g[i + 1][l2]) % mod) % mod; v[i][l0] = ((v[i][l0]) + (v[i + 1][l2]) % mod) % mod; v[i][l0] = ((v[i][l0]) + ((2 * s[i + 1][l2] - p[i + 1][l2] - l[i + 1][l2]) % mod * c) % mod) % mod; v[i][l0] = ((v[i][l0]) + (c * c % mod * (g[i + 1][l2] - 1) % mod) % mod) % mod; Y = (p[i + 1][l2] + c) % mod; if (!fir) v[i][l0] = ((v[i][l0]) + (LA * Y % mod) % mod) % mod; if (fir) fir = 0, p[i][l0] = Y; LA = l[i][l0] = (l[i + 1][l2] + c) % mod; fir = 0; } } long long solve() { scanf( %s , st + 1); w = strlen(st + 1); for (i = 1; i <= w; i++) a[i] = st[i] - 0 ; T[0] = 1; for (i = 1; i <= w; i++) T[i] = T[i - 1] * 10 % mod; memset(vis, 0, sizeof(vis)); memset(p, 0, sizeof(p)); memset(l, 0, sizeof(l)); memset(g, 0, sizeof(g)); memset(s, 0, sizeof(s)); memset(v, 0, sizeof(v)); get(1, 0); return v[1][0]; } int main() { long long s0 = solve(); long long s1 = solve(); s0 = (s1 - s0) % mod; if (s0 < 0) s0 += mod; cout << s0 << endl; scanf( n ); return 0; }

#include <bits/stdc++.h> using namespace std; int n, p, a[100005], fqn[100005], fqo[100005], mx, cur, exc = 0, lesdan = 0, mnvl[100005], gmod = 0, rekt = 0; int mc[100005], vl[100005]; vector<int> ok; map<int, int> fq; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> p; for (int i = 0; i < n; i++) { cin >> a[i]; fq[a[i]]++; } sort(a, a + n + 1, greater<int>()); mx = a[0]; cur = max(mx - (n - 1), 0); for (auto u : fq) if (u.second >= p) exc++; for (int i = 0; i < n; i++) { if (a[i] < cur) break; rekt = i; vl[i] = n - (a[i] - cur) - i; mnvl[i] = vl[i]; if (i != 0) mnvl[i] = min(mnvl[i], mnvl[i - 1]); mc[((vl[i] % p) + p) % p]++; } int gp = n - 1 - rekt; int cnt = 0; while (cur < mx) { while (a[rekt] < cur) { mc[((vl[rekt] % p) + p) % p]--; rekt--; gp++; } if (mnvl[rekt] + cnt > 0 && (mc[gmod] + gp / p) == 0) ok.push_back(cur); cur++; gmod--; gmod += p; gmod %= p; cnt++; } cout << ok.size() << endl; for (auto u : ok) cout << u << ; cout << endl; cout.flush(); return 0; }

#include <bits/stdc++.h> using namespace std; int n, m; struct EDGE { int to, w; EDGE *las; } e[100005]; int ne; EDGE *last[100005]; void link(int u, int v, int w) { e[ne] = {v, w, last[u]}; last[u] = e + ne++; } long long dis[100005], f[100005]; void adjust() { for (int i = 1; i <= n; ++i) for (EDGE *ei = last[i]; ei; ei = ei->las) ei->w += dis[i] - dis[ei->to]; for (int i = 1; i <= n; ++i) f[i] += dis[i]; } void SP0() { static priority_queue<pair<long long, int>, vector<pair<long long, int> >, greater<pair<long long, int> > > q; memset(dis, 127, sizeof(long long) * (n + 1)); dis[1] = 0; q.push(make_pair(0, 1)); while (!q.empty()) { int x = q.top().second; long long s = q.top().first; q.pop(); if (s != dis[x]) continue; for (EDGE *ei = last[x]; ei; ei = ei->las) if (s + ei->w < dis[ei->to]) { dis[ei->to] = s + ei->w; q.push(make_pair(dis[ei->to], ei->to)); } } adjust(); } void SP1() { static vector<int> b[100005]; memset(dis, 127, sizeof(long long) * (n + 1)); dis[1] = 0; b[0].push_back(1); for (int i = 0; i < n; ++i) { for (int j = 0; j < b[i].size(); ++j) { int x = b[i][j]; if (dis[x] < i) continue; for (EDGE *ei = last[x]; ei; ei = ei->las) if (i + ei->w < n && i + ei->w < dis[ei->to]) { dis[ei->to] = i + ei->w; b[dis[ei->to]].push_back(ei->to); } } b[i].clear(); } adjust(); } int main() { int Q; scanf( %d%d%d , &n, &m, &Q); for (int i = 0; i < m; ++i) { int u, v, w; scanf( %d%d%d , &u, &v, &w); link(u, v, w); } SP0(); while (Q--) { int op; scanf( %d , &op); if (op == 1) { int v; scanf( %d , &v); printf( %lld n , dis[v] > 100000000000000 ? -1 : f[v]); } else { int c; scanf( %d , &c); for (int i = 0; i < c; ++i) { int id; scanf( %d , &id), --id; e[id].w++; } SP1(); } } return 0; }

#include <bits/stdc++.h> using namespace std; vector<int> adj[105]; bool visited[105]; int df[1005]; int ans = 0, k = 0; void dfs(int i, int parent) { visited[i] = true; for (int j = 0; j < adj[i].size(); j++) { if (!visited[adj[i][j]]) dfs(adj[i][j], i); } } int main() { int n, m; cin >> n >> m; for (int i = 1; i <= m; i++) { int u, v; cin >> u >> v; adj[u].push_back(v); adj[v].push_back(u); } for (int i = 1; i <= n; i++) { if (!visited[i]) k++, dfs(i, 0); } if (n == m && k == 1) cout << FHTAGN! n ; else cout << NO n ; }

#include <bits/stdc++.h> using namespace std; long long m, n, x, y, p, q; int main() { cin >> n; for (long long k = 0; k < n; k++) { cin >> x >> y >> p >> q; m += (p - x + 1) * (q - y + 1); } cout << m; }

#include <bits/stdc++.h> using namespace std; struct data { int x; int y; }; int main() { long long n; cin >> n; vector<data> info; long long smallest = 9999999999; long long largest2 = -1; for (int i = 0; i < n; i++) { data temp; cin >> temp.x >> temp.y; if (temp.y < smallest) { smallest = temp.y; } if (temp.x > largest2) { largest2 = temp.x; } info.push_back(temp); } long long m; cin >> m; vector<data> info2; long long largest = -1; long long smallest2 = 9999999999; for (int i = 0; i < m; i++) { data temp; cin >> temp.x >> temp.y; if (temp.x > largest) { largest = temp.x; } if (temp.y < smallest2) { smallest2 = temp.y; } info2.push_back(temp); } cout << max(max(largest - smallest, largest2 - smallest2), (long long)0) << endl; return 0; }

#include <bits/stdc++.h> using namespace std; const int MAX = 1010; int n, t, pop = -1, p[2 * MAX], para[2 * MAX], odw[2 * MAX]; inline void dodaj_pare(int a, int b) { para[a] = b; para[b] = a; } void wczytaj_dane() { int m; cin >> n >> m; for (int i = 0; i < (2 * n); i++) cin >> p[i]; fill(para, para + 2 * n, -1); while (m--) { int a, b; cin >> a >> b; dodaj_pare(a - 1, b - 1); } cin >> t; } void wypisz(int x) { assert(!odw[x]); odw[x] = true; cout << (x + 1) << n ; fflush(stdout); } int najsilniejszy_sparowany() { int x = -1; for (int i = 0; i < (2 * n); i++) if ((!odw[i]) && para[i] != -1 && (x == -1 || p[x] < p[i])) x = i; return x; } int najsilniejszy() { int x = -1; for (int i = 0; i < (2 * n); i++) if ((!odw[i]) && (x == -1 || p[x] < p[i])) x = i; assert(x != -1); return x; } int rozwiaz() { int x = najsilniejszy_sparowany(); if (x != -1) return x; return najsilniejszy(); } void moj_ruch() { if (pop != -1 && para[pop] != -1 && (!odw[para[pop]])) { wypisz(para[pop]); return; } wypisz(rozwiaz()); } inline int wczytaj() { int x; cin >> x; if (x == -1) exit(1); return x - 1; } void twoj_ruch() { int x = wczytaj(); odw[x] = true; pop = x; } void zrob_test() { wczytaj_dane(); fill(odw, odw + 2 * n, false); if (t == 1) { for (int q = 0; q < (n); q++) { moj_ruch(); twoj_ruch(); } } else { for (int q = 0; q < (n); q++) { twoj_ruch(); moj_ruch(); } } } int main() { zrob_test(); return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int N; scanf( %d , &N); static int X[100]; for (int i = 0; i < N; i++) scanf( %d , &X[i]); vector<int> Ans; for (int i = 0, Count = 0, First = 0; i < N; i++) { if (X[i] < 0) Count++; if (i == N - 1 || (Count == 2 && X[i + 1] < 0)) { Ans.push_back(i - First + 1); First = i + 1; Count = 0; } } int M = Ans.size(); printf( %d n , M); for (int i = 0; i < M; i++) { printf( %d , Ans[i]); putchar((i + 1 == M) ? n : ); } return 0; }

#include <bits/stdc++.h> using namespace std; long long bigmod(long long b, long long p, long long m) { if (p == 0) return 1; long long my = bigmod(b, p / 2, m); my *= my; my %= m; if (p & 1) my *= b, my %= m; return my; } int setb(int n, int pos) { return n = n | (1 << pos); } int resb(int n, int pos) { return n = n & ~(1 << pos); } bool checkb(int n, int pos) { return (bool)(n & (1 << pos)); } struct info { int x, y, idx; info() {} info(int _x, int _y, int _idx) { x = _x; y = _y; idx = _idx; } bool operator<(const info &p) const { if (y == p.y) return x < p.x; else return y < p.y; } }; info ara[200005]; bool taken[200005]; int n; int last[2]; bool fuck() { int i; last[0] = last[1] = -1; for (i = 1; i <= n; i++) { if (last[0] > last[1]) swap(last[0], last[1]); if (ara[i].x > last[1]) { last[1] = ara[i].y; continue; } if (ara[i].x > last[0]) { last[0] = ara[i].y; continue; } return 0; } return 1; } int main() { int x, y, i; scanf( %d , &n); for (i = 1; i <= n; i++) { scanf( %d %d , &x, &y); ara[i] = info(x, y, i); } sort(ara + 1, ara + n + 1); bool f = fuck(); if (f) puts( YES ); else puts( NO ); return 0; }

#include <bits/stdc++.h> using namespace std; bool check(string& a) { for (int i = 1; i < a.size(); i++) { if (abs(a[i] - a[i - 1]) == 1) return false; } return true; } string gen(string a) { if (check(a)) return a; while (next_permutation(a.begin(), a.end())) { if (check(a)) return a; } return ; } string print(string& t, map<char, int>& cnt) { string res; for (auto it : t) { res += string(cnt[it], it); } return res; } void solve() { string in; cin >> in; map<char, int> cnt; for (char i : in) cnt[i]++; string res; for (auto it : cnt) { res += it.first; } if (res.size() <= 8) { string temp = gen(res); if (temp.empty()) { cout << No answer << endl; return; } cout << print(temp, cnt) << endl; return; } string t; for (int i = 0; i < res.size(); i += 2) { t += res[i]; } for (int i = 1; i < res.size(); i += 2) { t += res[i]; } cout << print(t, cnt) << endl; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t = 1; cin >> t; while (t--) { solve(); } }

#include <bits/stdc++.h> using namespace std; int max2[205][6005]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); fill_n(max2[0], 205 * 6005, -1); max2[0][0] = 0; int n, k; cin >> n >> k; for (int i = 0; i < n; i++) { long long int a; cin >> a; int p2 = 0, p5 = 0; while (a % 2 == 0) { a /= 2; p2++; } while (a % 5 == 0) { a /= 5; p5++; } for (int pos = k - 1; pos >= 0; pos--) { for (int s = p5; s < 6005; s++) { if (max2[pos][s - p5] != -1) { max2[pos + 1][s] = max(max2[pos + 1][s], max2[pos][s - p5] + p2); } } } } int best = 0; for (int i = 0; i < 6005; i++) { best = max(best, min(i, max2[k][i])); } cout << best << n ; return 0; }

#include <bits/stdc++.h> using namespace std; inline long long read() { long long x = 0, f = 0; char ch = getchar(); while (!isdigit(ch)) f |= (ch == - ), ch = getchar(); while (isdigit(ch)) x = x * 10 + ch - 0 , ch = getchar(); return f ? -x : x; } inline void write(long long x) { if (x < 0) x = -x, putchar( - ); if (x >= 10) write(x / 10); putchar(x % 10 + 0 ); } long long n, now[4][4] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}; inline long long find(long long x, long long y) { return (x / 4) * (n / 4) + y / 4 + 1; } signed main() { n = read(); for (register long long i = 0; i <= n - 1; i++) { for (register long long j = 0; j <= n - 1; j++) { long long at = find(i, j); cout << (at - 1) * 16 + now[i % 4][j % 4] << ; } puts( ); } return 0; }

#include <bits/stdc++.h> using namespace std; int row[1010]; int main() { int n, m, k; scanf( %d %d %d , &n, &m, &k); memset(row, 0x3f3f3f3f, sizeof row); long long ans = 0; for (int i = (0); i < (n); ++i) { int r, c; scanf( %d %d , &r, &c); row[r] = min(c, row[r]); } for (int i = 1; i <= m; ++i) ans += ((row[i] == 0x3f3f3f3f) ? 0 : row[i]); cout << min(ans, (long long)k) << endl; return 0; }

#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10; const int INF = 0x3f3f3f3f; const int inf = -INF; const int mod = 1e9 + 7; const double pi = acos(-1.0); string s; int pre[N]; int dp[N][2]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int T; cin >> T; while (T--) { int n, k; cin >> n >> k; cin >> s; pre[0] = 0; for (int i = 0; i <= n; i++) { dp[i][0] = dp[i][1] = 0; } s = + s; for (int i = 1; i <= n; i++) pre[i] = pre[i - 1] + s[i] - 0 ; for (int i = 1; i <= n; i++) { int t = max(0, i - k); dp[i][0] = min(dp[i - 1][0], dp[i - 1][1]) + (s[i] == 1 ); dp[i][1] = min(pre[i - 1], dp[t][1] + pre[i - 1] - pre[t]) + (s[i] == 0 ); } int ans = min(dp[n][0], dp[n][1]); cout << ans << endl; } return 0; }

#include <bits/stdc++.h> using namespace std; int main(void) { double d, l, v1, v2; cin >> d >> l >> v1 >> v2; printf( %.10lf , double((l - d) / (v1 + v2))); return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int n, rej = 0; cin >> n; vector<int> a(n); for (size_t i = 0; i < n; i++) cin >> a[i]; sort(a.begin(), a.end()); for (int i = 0; i < n; i++) if (a[i] == a[0] || a[i] == a[n - 1]) rej++; cout << n - rej; }

#include <bits/stdc++.h> using namespace std; const long long N = 1e5 + 5; long long read() { long long x = 0, f = 1; char ch; while (!isdigit(ch = getchar())) (ch == - ) && (f = -f); for (x = ch ^ 48; isdigit(ch = getchar()); x = (x << 3) + (x << 1) + (ch ^ 48)) ; return x * f; } template <class T> void Max(T &a, T b) { a = a > b ? a : b; } template <class T> void Min(T &a, T b) { a = a < b ? a : b; } long long n, l[4], r[4], L[4], R[4], x[N], y[N], z[N]; bool check(long long p, bool type) { for (long long i = 0; i <= 3; ++i) l[i] = -6e18, r[i] = 6e18; for (long long i = 1; i <= n; ++i) { Max(l[0], x[i] + y[i] + z[i] - p); Min(r[0], x[i] + y[i] + z[i] + p); Max(l[1], -x[i] + y[i] + z[i] - p); Min(r[1], -x[i] + y[i] + z[i] + p); Max(l[2], x[i] - y[i] + z[i] - p); Min(r[2], x[i] - y[i] + z[i] + p); Max(l[3], x[i] + y[i] - z[i] - p); Min(r[3], x[i] + y[i] - z[i] + p); } for (long long i = 0; i <= 3; ++i) if (l[i] > r[i]) return 0; for (long long A = 0, flag; A <= 1; ++A) { L[0] = l[0] - 3 * A, R[0] = r[0] - 3 * A; for (long long i = 1; i <= 3; ++i) L[i] = l[i] - A, R[i] = r[i] - A; for (long long i = 0; i <= 3; ++i) L[i] = (L[i] + 1) >> 1, R[i] >>= 1; flag = 1; for (long long i = 0; i <= 3; ++i) if (L[i] > R[i]) { flag = 0; break; } if (flag == 0) continue; long long L0 = L[1] + L[2] + L[3], R0 = R[1] + R[2] + R[3]; if (R[0] >= L0 && R0 >= L[0]) { if (type) { long long a = L[1], b = L[2], c = L[3]; if (a + b + c < L[0]) a += min(R[1] - L[1], L[0] - a - b - c); if (a + b + c < L[0]) b += min(R[2] - L[2], L[0] - a - b - c); if (a + b + c < L[0]) c += min(R[3] - L[3], L[0] - a - b - c); printf( %lld %lld %lld n , b + c + A, a + c + A, a + b + A); } return 1; } } return 0; } void solve() { n = read(); for (long long i = 1; i <= n; ++i) x[i] = read(), y[i] = read(), z[i] = read(); long long l = 0, r = 6e18, mid, ans; while (l <= r) { mid = (l + r) >> 1; if (check(mid, 0)) ans = mid, r = mid - 1; else l = mid + 1; } check(ans, 1); } signed main() { long long T = read(); while (T-- > 0) solve(); return 0; }

#include <bits/stdc++.h> using namespace std; long long int hell = 9223372036854775807; bool a[40000000]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int t; t = 1; while (t--) { for (long long int i = 1; i < 4000000; i++) { a[i] = true; } for (long long int i = 2; i * i < 4000000; i++) { if (a[i]) for (long long int j = i * i; j < 4000000; j = j + i) a[j] = false; } long long int n; cin >> n; vector<long long int> v; long long int k = 0; for (long long int i = 2; i * i <= n; i++) { if (n % i == 0 && a[i]) { v.push_back(i); if (n % (i * i) == 0) v.push_back(i); } if (n % i == 0) k++; } if (k == 0) cout << 1 << endl << 0; else if (v.size() > 1) { if (v[0] * v[1] < n) cout << 1 << endl << v[0] * v[1]; else cout << 2 ; } else cout << 2 ; } return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int a[6]; for (int i = 0; i < 6; i++) { cin >> a[i]; } cout << (a[0] + a[1] + a[2]) * (a[0] + a[1] + a[2]) - (a[0] * a[0]) - (a[2] * a[2]) - (a[4] * a[4]) << endl; }

#include <bits/stdc++.h> using namespace std; const int N = 5050; const int inf = 0x37373737; int L[N], R[N], size[N], tot, n, i, a, b, cnt, j, k; int d[N], root; int dp[N][N]; vector<pair<int, int> > vec[N]; vector<int> e[N]; void dfs(int x, int fa) { int i, j, k; if (e[x].size() == 1) size[x] = 1; for (i = 0; i < e[x].size(); i++) if (e[x][i] != fa) { dfs(e[x][i], x); for (j = size[x]; j >= 0; j--) for (k = 0; k <= size[e[x][i]]; k++) dp[x][j + k] = min(dp[x][j + k], dp[x][j] + dp[e[x][i]][k]); size[x] += size[e[x][i]]; } for (i = 0; i <= size[x]; i++) dp[x][i] = min(dp[x][i], dp[x][size[x] - i] + 1); } int main() { scanf( %d , &n); for (i = 1; i < n; i++) { scanf( %d%d , &a, &b); e[a].push_back(b); e[b].push_back(a); d[a]++; d[b]++; } if (n == 2) { printf( 1 ); return 0; } for (i = 1; i <= n; i++) if (d[i] != 1) break; root = i; for (i = 1; i <= n; i++) for (j = 1; j <= n; j++) dp[i][j] = inf; dfs(root, 0); printf( %d n , dp[root][size[root] / 2]); }

#include <bits/stdc++.h> using namespace std; template <typename T> void read(T &x) { T 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(); } x *= f; } template <typename T> void prll(T x) { if (x < 0) putchar( - ), x = -x; if (x > 9) prll(x / 10); putchar(x % 10 + 0 ); } struct Change { int x, y, Ans; } q[2005]; char s[2005][2005]; int up[2005][2005], down[2005][2005]; int dp[2005][2005]; int n, m, Q; struct Deque { int s, t, deq[2005]; Deque() { s = 1, t = 0; } bool empty() { return s > t; } void push_back(int x) { deq[++t] = x; } void pop_back() { t--; } void pop_front() { s++; } void clear() { s = 1, t = 0; } int front() { return deq[s]; } int back() { return deq[t]; } } q1, q2; bool check(const int x, const int len) { q1.clear(); q2.clear(); for (int i = 1; i < len; i++) { while (!q1.empty() && up[x][q1.back()] >= up[x][i]) q1.pop_back(); q1.push_back(i); while (!q2.empty() && down[x][q2.back()] >= down[x][i]) q2.pop_back(); q2.push_back(i); } for (int i = len; i <= m; i++) { while (!q1.empty() && q1.front() <= i - len) q1.pop_front(); while (!q2.empty() && q2.front() <= i - len) q2.pop_front(); while (!q1.empty() && up[x][q1.back()] >= up[x][i]) q1.pop_back(); q1.push_back(i); while (!q2.empty() && down[x][q2.back()] >= down[x][i]) q2.pop_back(); q2.push_back(i); if (up[x][q1.front()] + down[x][q2.front()] - 1 >= len) return true; } return false; } int main() { read(n); read(m); read(Q); for (int i = 1; i <= n; i++) scanf( %s , s[i] + 1); for (int i = 1; i <= Q; i++) { read(q[i].x); read(q[i].y); s[q[i].x][q[i].y] = X ; q[i].Ans = 0; } for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { if (s[i][j] != . ) s[i][j] = 0; if (s[i][j]) up[i][j] = up[i - 1][j] + 1; } } for (int i = n; i >= 1; i--) { for (int j = 1; j <= m; j++) if (s[i][j]) down[i][j] = down[i + 1][j] + 1; } int res = 0; for (int i = 1; i <= n; i++) if (s[i][1]) dp[i][1] = 1, res = max(res, dp[i][1]); for (int i = 1; i <= m; i++) if (s[1][i]) dp[1][i] = 1, res = max(res, dp[i][1]); for (int i = 2; i <= n; i++) { for (int j = 2; j <= m; j++) if (s[i][j]) dp[i][j] = min(dp[i - 1][j], min(dp[i][j - 1], dp[i - 1][j - 1])) + 1, res = max(res, dp[i][j]); } for (int i = Q; i >= 1; i--) { q[i].Ans = res; if (i == 1) break; int x = q[i].x, y = q[i].y; s[x][y] = 1; for (int i = 1; i <= n; i++) if (s[i][y]) up[i][y] = up[i - 1][y] + 1; for (int i = n; i >= 1; i--) if (s[i][y]) down[i][y] = down[i + 1][y] + 1; int l = 0, r = m, mid, ans; while (l <= r) { mid = (l + r) >> 1; if (check(x, mid)) l = mid + 1, ans = mid; else r = mid - 1; } res = max(ans, res); } for (int i = 1; i <= Q; i++) printf( %d n , q[i].Ans); return 0; }

#include <bits/stdc++.h> int main() { int i, j, k, l, y, m, n; char s[101], t[101]; scanf( %d , &y); for (i = y + 1;; i++) { n = i; j = n % 10; n = n / 10; k = n % 10; n = n / 10; l = n % 10; n = n / 10; if (n != l && n != k && n != j && l != k && l != j && k != j) { printf( %d n , i); return 0; } } return 0; }

#include <bits/stdc++.h> using namespace std; inline int read() { int s = 0, t = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) t = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) s = (s << 3) + (s << 1) + (ch ^ 48), ch = getchar(); return s * t; } const int N = 3005; int n, m, T, K, w[N], s[N], U[N], pr[N], su[N]; long long Sum, Ans; vector<int> G[N]; int C(int n) { return n * (n + 1) / 2; } void Add(int i, int t) { Sum += (1ll * (i - U[i]) * (su[i] - i) + C(su[i] - i - 1)) * t; } int main() { n = read(), m = read(), T = read(), K = read(); for (int i = 1; i <= T; i++) { int x = read(), y = read(); G[y].push_back(x); } if (K == 0) return cout << 1ll * n * (n + 1) / 2 * m * (m + 1) / 2, 0; for (int l = 1; l <= m; l++) { memset(w, 0, sizeof(w)), Sum = 0; for (int r = l; r <= m; r++) for (auto x : G[r]) w[x]++; for (int i = 1; i <= n; i++) if (i == 1 || w[i]) { U[i] = i, pr[i] = i - 1, su[i] = i + 1, s[i] = 0; while (pr[i] && !w[pr[i]]) pr[i]--; if (i > 1) pr[i] = max(pr[i], 1); while (su[i] <= n && !w[su[i]]) su[i]++; while (U[i] && s[i] + w[U[i]] < K) s[i] += w[U[i]], U[i] = pr[U[i]]; Add(i, +1); } for (int r = m; r >= l; r--) { Ans += Sum; for (auto x : G[r]) { int t = x; w[x]--; if (x != 1 && !w[x]) { t = su[x], pr[su[x]] = pr[x]; Add(x, -1), Add(pr[x], -1), su[pr[x]] = su[x], Add(pr[x], +1); } for (int j = 1, i = t; j <= K && i <= n; j++, i = su[i]) { if (U[i] < x) s[i]--; Add(i, -1); while (U[i] && s[i] + w[U[i]] < K) s[i] += w[U[i]], U[i] = pr[U[i]]; Add(i, +1); } } } } cout << 1ll * n * (n + 1) / 2 * m * (m + 1) / 2 - Ans; return 0; }

#include <bits/stdc++.h> using namespace std; inline char gc() { static char buf[100000], *p1 = buf, *p2 = buf; return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2) ? EOF : *p1++; } inline int read() { int x = 0; char ch = getchar(); bool positive = 1; for (; !isdigit(ch); ch = getchar()) if (ch == - ) positive = 0; for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - 0 ; return positive ? x : -x; } inline void write(long long x) { if (x < 0) x = -x, putchar( - ); if (x > 9) write(x / 10); putchar(x % 10 + 0 ); } inline void writeln(long long x) { write(x); puts( ); } struct Node { int x, y, w; } a, b, c, g[6005]; int n, x, y, S, m[5][5], f[5][5][5]; long long now1, now2, ans1, ans2, ans3; inline int gcd(int x, int y) { return x % y ? gcd(y, x % y) : y; } int main() { n = read(); for (int i = 1; i <= n; i++) { g[i].x = read(); g[i].y = read(); } for (int i = 1; i <= n; i++) { memset(f, 0, sizeof f); a.x = (g[i].x + 3) % 4 + 1; a.y = (g[i].y + 3) % 4 + 1; for (int j = 1; j <= n; j++) { if (i != j) { if (abs(g[i].x - g[j].x) * abs(g[i].y - g[j].y)) { f[(g[j].x + 3) % 4 + 1][(g[j].y + 3) % 4 + 1] [(gcd(abs(g[i].x - g[j].x), abs(g[i].y - g[j].y)) + 3) % 4 + 1]++; } else { f[(g[j].x + 3) % 4 + 1][(g[j].y + 3) % 4 + 1] [(abs(g[i].x - g[j].x) + abs(g[i].y - g[j].y) + 3) % 4 + 1]++; } } } for (int j = 0; j < 16; j++) { b.x = j / 4 + 1; b.y = j % 4 + 1; for (b.w = 1; b.w <= 4; b.w++) { now1 = f[b.x][b.y][b.w]; f[b.x][b.y][b.w]--; for (int k = 0; k < 16; k++) { c.x = k / 4 + 1; c.y = k % 4 + 1; S = a.x * (b.y - c.y) + b.x * (c.y - a.y) + c.x * (a.y - b.y); if (S & 1) continue; S /= 2; for (c.w = (b.w + 1) % 2 + 1; c.w <= 4; c.w += 2) { now2 = now1 * f[c.x][c.y][c.w]; a.w = gcd(abs(b.x - c.x) + 4, abs(b.y - c.y) + 4); if ((S + (a.w + b.w + c.w) / 2) & 1) continue; if (b.w % 2 + c.w % 2) { ans1 += now2; } else { ans2 += now2; } } } f[b.x][b.y][b.w]++; } } } writeln(ans1 / 2 + ans2 / 6); return 0; }

#include <bits/stdc++.h> using namespace std; int n; vector<stack<int>> ids; vector<int> b; string answer; int segtree_size; template <typename T> struct segtree { int segtree_size; vector<T> segtree; T identity; T (*UpdateFn)(T, T); void InitSegtree(int main_size, T (*UpdateFunction)(T, T), T fun_identity) { segtree_size = 1; while (segtree_size < main_size) segtree_size *= 2; segtree_size *= 2; segtree.resize(segtree_size); UpdateFn = UpdateFunction; this->identity = fun_identity; } void UpdateAllParents() { for (int i = segtree_size / 2 - 1; i > 0; i--) segtree[i] = UpdateFn(segtree[i * 2], segtree[i * 2 + 1]); } void ChangeValue(int index, T value) { segtree[index + segtree_size / 2] = value; } T GetValue(int index) { return segtree[index + segtree_size / 2]; } void Update(int pos, T value) { for (segtree[pos += segtree_size / 2] = value; pos > 1; pos /= 2) segtree[pos / 2] = UpdateFn(segtree[pos], segtree[pos ^ 1]); } T Query(int start, int finish) { T ans = this->identity; for (start += segtree_size / 2, finish += segtree_size / 2; start < finish; start /= 2, finish /= 2) { if (start % 2 == 1) ans = UpdateFn(ans, segtree[start++]); if (finish % 2 == 0) ans = UpdateFn(ans, segtree[finish--]); } return UpdateFn(ans, segtree[start]); } void Destroy() { segtree.clear(); } }; struct segtree<int> tree; void In() { cin >> n; ids.resize(n + 1); b.resize(n); tree.InitSegtree( n + 1, [](int a, int b) -> int { return max(a, b); }, INT_MIN); int a; for (int i = 0; i < n; i++) { cin >> a; tree.ChangeValue(i, a); } tree.UpdateAllParents(); for (int i = 0; i < n; i++) cin >> b[i]; } void Solve() { answer = NO ; for (int i = 0; i < n; i++) ids[tree.GetValue(i)].push(i); for (int i = n - 1; i >= 0; i--) { if (ids[b[i]].empty()) return; int a_idx = ids[b[i]].top(); ids[b[i]].pop(); if (tree.Query(a_idx + 1, n) > b[i]) return; tree.Update(a_idx, 0); } answer = YES ; } void Out() { cout << answer << endl; tree.Destroy(); ids.clear(); b.clear(); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { In(); Solve(); Out(); } return 0; }

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

#include <bits/stdc++.h> using namespace std; inline int dcmp(double a, double b) { return fabs(a - b) < (1e-9) ? 0 : a < b ? -1 : +1; } int main() { int tc; scanf( %d , &tc); while (tc--) { int n; scanf( %d , &n); printf( %d n , n / 2); } return 0; }

#include <bits/stdc++.h> using namespace std; const long long inf = 4e18; long long ver[305][305], hor[305][305], ver2[305][305], hor2[305][305]; int con[305][305]; pair<pair<int, int>, pair<int, int> > ans; long long dif = inf, cur, a, b; int main(void) { memset(ver, 0, sizeof(ver)); memset(hor, 0, sizeof(hor)); memset(ver2, 0, sizeof(ver2)); memset(hor2, 0, sizeof(hor2)); int n, m, t, i, j, k, l, r, mid, it; int eq, asc, des; scanf( %d %d %d , &n, &m, &t); scanf( %d %d %d , &eq, &asc, &des); for ((i) = (1); (i) <= (n); ++(i)) { for ((j) = (1); (j) <= (m); ++(j)) { scanf( %d , &con[i][j]); if (j > 1) { hor[i][j] = hor[i][j - 1]; hor2[i][j] = hor2[i][j - 1]; if (con[i][j] == con[i][j - 1]) { hor[i][j] += eq; hor2[i][j] += eq; } else if (con[i][j - 1] < con[i][j]) { hor[i][j] += asc; hor2[i][j] += des; } else { hor[i][j] += des; hor2[i][j] += asc; } } if (i > 1) { ver[i][j] = ver[i - 1][j]; ver2[i][j] = ver2[i - 1][j]; if (con[i][j] == con[i - 1][j]) { ver[i][j] += eq; ver2[i][j] += eq; } else if (con[i - 1][j] < con[i][j]) { ver[i][j] += asc; ver2[i][j] += des; } else { ver[i][j] += des; ver2[i][j] += asc; } } } } for ((i) = (1); (i) <= (n - 2); ++(i)) { for ((j) = (1); (j) <= (m - 2); ++(j)) { for ((k) = (i + 2); (k) <= (n); ++(k)) { l = j + 2; r = m; while (l < r) { mid = (l + r + 1) / 2; a = hor[i][mid] - hor[i][j] + hor2[k][mid] - hor2[k][j]; b = ver2[k][j] - ver2[i][j] + ver[k][mid] - ver[i][mid]; cur = a + b; if (cur < t) l = mid; else r = mid - 1; } for ((it) = (l - 3); (it) <= (l + 3); ++(it)) { if (it < j + 2) continue; else if (m < it) break; a = hor[i][it] - hor[i][j] + hor2[k][it] - hor2[k][j]; b = ver2[k][j] - ver2[i][j] + ver[k][it] - ver[i][it]; cur = a + b; if (abs(cur - t) <= dif) { dif = abs(cur - t); ans = make_pair(make_pair(i, j), make_pair(k, it)); if (dif == 0) goto PRINT; } } } } } PRINT:; printf( %d %d %d %d n , ans.first.first, ans.first.second, ans.second.first, ans.second.second); return 0; }

#include <bits/stdc++.h> using namespace std; int const N = 1e6 + 2; int a[N]; int main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; for (int i = 0; i < (int)(n); ++i) cin >> a[i]; for (int i = 0; i < (int)((1 << n)); ++i) { long long sum = 0; for (int j = 0; j < (int)(n); ++j) if (i & (1 << j)) sum += a[j]; else sum -= a[j]; sum %= 360; if (!sum) return cout << YES , 0; } cout << NO << endl; }

#include <bits/stdc++.h> using namespace std; vector<long long> ft(1, 1LL); int n, ans[3], hg, xxx = 0; vector<int> graph[200005], vis(200005); queue<int> q; void dfs(int node, int par, int i, int h) { if (h >= hg) hg = h, ans[i] = node; for (auto child : graph[node]) if (child != par) dfs(child, node, i, h + 1); } int dfs2(int node, int par, int dest) { if (node == dest) { q.push(node); vis[node] = 1; return 1; } for (auto child : graph[node]) { if (child == par) continue; if (dfs2(child, node, dest)) { q.push(node), vis[node] = 1; return 1; } } return 0; } void solve() { cin >> n; for (long long i = 0; i < n - 1; i++) { int node1, node2; cin >> node1 >> node2; graph[node1].push_back(node2), graph[node2].push_back(node1); } dfs(1, 0, 0, 0); hg = 0; dfs(ans[0], 0, 1, 0); xxx = hg; dfs2(ans[0], 0, ans[1]); hg = 0; while (q.size()) { int p = q.front(); if (vis[p] >= hg and p != ans[0] and p != ans[1]) hg = vis[p], ans[2] = p; q.pop(); for (auto child : graph[p]) { if (vis[child] == 0) vis[child] = vis[p] + 1, q.push(child); } } cout << xxx + hg - 1 << n ; cout << ans[1] << << ans[2] << << ans[0]; } signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int t = 1; while (t--) { solve(); } }

#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f, maxn = 200007; const long long MOD = 1004535809; const long long LINF = 0x3f3f3f3f3f3f3f3fLL; const long long P = 19260817; char nc() { static char buf[100000], *p1 = buf, *p2 = buf; return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2) ? EOF : *p1++; } inline long long read() { long long x = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) x = ((x << 3) + (x << 1) + ch - 0 ) % MOD, ch = getchar(); return x * f; } void write(int x) { if (!x) putchar( 0 ); if (x < 0) x = -x, putchar( - ); static int sta[20]; register int tot = 0; while (x) sta[tot++] = x % 10, x /= 10; while (tot) putchar(sta[--tot] + 48); } int n; char s[maxn]; int sump[maxn], sums[maxn]; int main() { scanf( %s , s + 1); n = strlen(s + 1); int f1 = 0, f2 = 0; for (int i = 1; i <= n; i++) { if (s[i] == ( ) f2 = 1; if (f2 == 1 && s[i] == ) ) f1 = 1; } if (f1 == 0) { printf( 0 ); return 0; } for (int i = 1; i <= n; i++) { sump[i] = sump[i - 1] + (s[i] == ( ); } for (int i = n; i >= 1; i--) { sums[i] = sums[i + 1] + (s[i] == ) ); } for (int i = 1; i <= n; i++) { if (sump[i] == sums[i]) { printf( 1 n%d n , 2 * sump[i]); for (int j = 1; j <= i; j++) { if (s[j] == ( ) printf( %d , j); } for (int j = i; j <= n; j++) { if (s[j] == ) ) printf( %d , j); } return 0; } } for (int i = 1; i <= n; i++) { if (sump[i] == sums[i + 1]) { printf( 1 n%d n , 2 * sump[i]); for (int j = 1; j <= i; j++) { if (s[j] == ( ) printf( %d , j); } for (int j = i + 1; j <= n; j++) { if (s[j] == ) ) printf( %d , j); } return 0; } } return 0; }

#include <bits/stdc++.h> using namespace std; bool bysec(const pair<int64_t, int64_t> &a, pair<int64_t, int64_t> &b) { return a.first > b.first; } void solve() { int64_t n, x, an = 0; cin >> n; pair<int64_t, int64_t> A[n]; for (int64_t i = 0; i < n; i++) cin >> x, A[i] = {x, i + 1}; sort(A, A + n, bysec); for (int64_t i = 0; i < n; i++) an += i * A[i].first + 1; cout << an << n ; for (int64_t i = 0; i < n; i++) cout << A[i].second << ; cout << n ; } signed main() { int64_t T = 1; while (T--) solve(); return 0; }

#include <bits/stdc++.h> using namespace std; int main() { char s[100]; int n, t; cin >> n >> t; if (n == 1 && t == 10) cout << -1; else { if (t < 10) s[0] = t + 48; else s[0] = 1 ; for (int i = 1; i < n; i++) { s[i] = 0 ; } for (int i = 0; i < n; i++) { cout << s[i]; } } }

#include <bits/stdc++.h> using namespace std; inline long long read() { long long sum = 0, ff = 1; char ch = getchar(); while (!isdigit(ch)) { if (ch == - ) ff = -1; ch = getchar(); } while (isdigit(ch)) sum = sum * 10 + (ch ^ 48), ch = getchar(); return sum * ff; } const long long N = 16; const long long mo = 1e9 + 7; long long n, m, f[1 << N][5], g[1 << N], a[N], b[N], ans; inline long long ksm(long long x, long long y) { long long ret = 1; while (y) { if (y & 1) ret = ret * x % mo; x = x * x % mo; y >>= 1ll; } return ret; } signed main() { n = read(); m = read(); for (long long i = 1; i <= n; i++) { a[i] = read(); b[i] = read(); } for (long long i = 1; i <= 3; i++) f[0][i] = 1; for (long long i = 0; i < (1 << n); i++) for (long long j = 1; j <= n; j++) { if (i & (1 << j - 1)) continue; for (long long k = 1; k <= 3; k++) if (b[j] != k) f[i | (1 << j - 1)][b[j]] = (f[i | (1 << j - 1)][b[j]] + f[i][k]) % mo; } for (long long i = 0; i < (1 << n); i++) { long long tot = 0; for (long long j = 1; j <= n; j++) if (i & (1 << j - 1)) tot += a[j]; if (tot == m) ans = (ans + f[i][1] + f[i][2] + f[i][3]) % mo; } printf( %lld n , ans * ksm(2ll, mo - 2) % mo); return 0; }

#include <bits/stdc++.h> using namespace std; struct V { vector<int> lnk; int p; int countBad(); }; V tab[400000]; int V::countBad() { int c = 0; for (__typeof((lnk).begin()) it = (lnk).begin(); it != (lnk).end(); ++it) if (tab[*it].p == p) ++c; return c; } int main() { int n, m; scanf( %d%d , &n, &m); for (int(i) = 0; (i) < (m); ++(i)) { int a, b; cin >> a >> b; tab[a - 1].lnk.push_back(b - 1); tab[b - 1].lnk.push_back(a - 1); } for (int(i) = 0; (i) < (n); ++(i)) tab[i].p = 0; queue<int> Q; for (int(i) = 0; (i) < (n); ++(i)) { if (tab[i].countBad() > 1) Q.push(i); } while (!Q.empty()) { int curr = Q.front(); Q.pop(); if (tab[curr].countBad() > 1) { tab[curr].p ^= 1; for (__typeof((tab[curr].lnk).begin()) it = (tab[curr].lnk).begin(); it != (tab[curr].lnk).end(); ++it) Q.push(*it); } } for (int(i) = 0; (i) < (n); ++(i)) { printf( %d , tab[i].p); } printf( n ); return 0; }

#include <bits/stdc++.h> using namespace std; int n; char dir[200005]; int l[200005], r[200005], ll, rl; int ans = 0x7fffffff; int main() { cin >> n; getchar(); for (int i = 1; i <= n; i++) scanf( %c , &dir[i]); for (int i = 1; i <= n; i++) if (dir[i] == L ) scanf( %d , &l[++ll]); else scanf( %d , &r[++rl]); if (ll == 0 || rl == 0) { puts( -1 ); return 0; } int nowl = 1, nowr = 1; for (nowl = 1; nowl <= ll; nowl++) { do { nowr++; } while (nowr <= rl && r[nowr] < l[nowl]); nowr--; if (l[nowl] - r[nowr] > 0) ans = min(ans, l[nowl] - r[nowr]); } if (ans == 0x7fffffff) { puts( -1 ); return 0; } else cout << (ans >> 1) << endl; return 0; }

#include <bits/stdc++.h> using namespace std; using ll = int64_t; using ull = uint64_t; using ld = long double; using vi = vector<int64_t>; using pii = pair<int64_t, int64_t>; ll powr(ll a, ll b) { ll res = 1; while (b) { if (b & 1) res = (res * a); a = (a * a); b >>= 1; } return res; } void solve() { int64_t n, k; cin >> n >> k; k++; int64_t a[n]; for (int64_t i = 0; i < n; i++) { cin >> a[i]; a[i] = powr(10, a[i]); } sort(a, a + n); int64_t ans = 0; for (int64_t i = 0; i < n - 1 && k > 0; i++) { int64_t den = min(k, (a[i + 1] / a[i]) - 1); ans += a[i] * den; k -= den; } if (k > 0) { ans += a[n - 1] * k; } cout << ans << n ; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int64_t t; cin >> t; while (t--) solve(); }

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; pair<long long int, long long int> a[100005]; for (int i = 0; i < n; i++) { cin >> a[i].first; a[i].second = i + 1; } sort(a, a + n); if (n % 2 == 0) { cout << n / 2 << endl; } else { cout << n / 2 + 1 << endl; } for (int i = 0; i < n; i += 2) { cout << a[i].second << ; } cout << endl << n / 2 << endl; for (int i = 1; i < n; i += 2) { cout << a[i].second << ; } }

#include <bits/stdc++.h> using namespace std; inline long long read() { long long f = 1, ans = 0; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) f = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { ans = ans * 10 + c - 0 ; c = getchar(); } return f * ans; } const long long MAXN = 4e5 + 11; long long phi[MAXN], N, A[MAXN], id[MAXN], pri[MAXN], mu[MAXN], v[MAXN], inv[MAXN], V[MAXN]; vector<long long> vec[MAXN], Vec[MAXN]; void Init() { mu[1] = 1, phi[1] = 1; V[1] = 1; for (long long i = 2; i <= N; i++) { if (!v[i]) { pri[++pri[0]] = i, v[i] = i, mu[i] = -1, phi[i] = i - 1; V[i] = inv[i - 1] * i % 1000000007; } for (long long j = 1; j <= pri[0] && i <= N / pri[j]; j++) { v[i * pri[j]] = pri[j]; if (!(i % pri[j])) { phi[i * pri[j]] = phi[i] * pri[j]; V[i * pri[j]] = V[i]; mu[i * pri[j]] = 0; break; } phi[i * pri[j]] = phi[i] * (pri[j] - 1); mu[i * pri[j]] = -mu[i]; V[i * pri[j]] = V[i] * V[pri[j]] % 1000000007; } } return; } long long ksm(long long a, long long b) { long long ans = 1; while (b) { if (b & 1) ans *= a, ans %= 1000000007; a *= a, a %= 1000000007; b >>= 1; } return ans; } long long in[MAXN], out[MAXN], rev[MAXN], dep[MAXN], tot, Log[MAXN], F[MAXN], sta[MAXN], Q[MAXN], q[MAXN], f[MAXN]; vector<long long> C; void dfs(long long u, long long fath) { in[u] = ++tot, rev[tot] = u, dep[u] = dep[fath] + 1; for (auto v : vec[u]) if (v != fath) { dfs(v, u); rev[++tot] = u; } out[u] = tot; } bool cmp(long long x, long long y) { return in[x] < in[y]; } struct RMQ { long long Minn[MAXN][21], ps[MAXN][21]; void init() { for (long long i = 1; i <= tot; i++) Minn[i][0] = dep[rev[i]], ps[i][0] = rev[i]; for (long long j = 1; (1 << j) <= tot; j++) for (long long i = 1; i + (1 << j) - 1 <= tot; i++) { if (Minn[i][j - 1] <= Minn[i + (1 << (j - 1))][j - 1]) Minn[i][j] = Minn[i][j - 1], ps[i][j] = ps[i][j - 1]; else Minn[i][j] = Minn[i + (1 << (j - 1))][j - 1], ps[i][j] = ps[i + (1 << (j - 1))][j - 1]; } return; } long long Qlca(long long u, long long v) { if (in[u] > in[v]) swap(u, v); long long L = in[u], R = in[v], len = R - L + 1, k = Log[len]; long long w1 = Minn[L][k], w2 = Minn[R - (1 << k) + 1][k]; if (w1 <= w2) return ps[L][k]; return ps[R - (1 << k) + 1][k]; } } S; void ins(long long x) { if (sta[0] == 1) { if (sta[1] != x) sta[++sta[0]] = x; return; } long long now = S.Qlca(x, sta[sta[0]]); while (sta[0] > 1 && dep[sta[sta[0] - 1]] >= dep[now]) Vec[sta[sta[0] - 1]].push_back(sta[sta[0]]), sta[0]--; if (dep[sta[sta[0]]] > dep[now]) Vec[now].push_back(sta[sta[0]]), sta[0]--; if (sta[sta[0]] != now) sta[++sta[0]] = now; sta[++sta[0]] = x; return; } void build() { sta[0] = 0; sta[++sta[0]] = 1; for (long long i = 1; i <= Q[0]; i++) ins(Q[i]); while (sta[0] > 1) Vec[sta[sta[0] - 1]].push_back(sta[sta[0]]), sta[0]--; return; } long long S1[MAXN], S2[MAXN], res, D; void Clear() { for (auto v : C) Vec[v].clear(), S1[v] = S2[v] = 0; C.clear(); return; } void dfs1(long long u) { long long now1 = 0, now2 = 0; C.push_back(u); for (auto v : Vec[u]) { dfs1(v); if (!(A[u] % D)) now2 += (S1[v] * phi[A[u]]) % 1000000007, now2 -= phi[A[u]] * S2[v] % 1000000007 * dep[u] % 1000000007, now2 = ((now2 % 1000000007) + 1000000007) % 1000000007; now1 -= 2 * dep[u] * S2[u] % 1000000007 * S2[v] % 1000000007, now1 = (now1 % 1000000007 + 1000000007) % 1000000007; now1 += S1[u] * S2[v], now1 += S2[u] * S1[v], now1 %= 1000000007; S1[u] += S1[v], S2[u] += S2[v]; S1[u] %= 1000000007, S2[u] %= 1000000007; } if (!(A[u] % D)) S1[u] += dep[u] * phi[A[u]] % 1000000007, S2[u] += phi[A[u]]; S1[u] %= 1000000007, S2[u] %= 1000000007; res += (now1 + now2) * 2 % 1000000007; return; } signed main() { N = read(); for (long long i = 1; i <= N; i++) A[i] = read(), id[A[i]] = i; inv[1] = 1; for (long long i = 2; i <= N; i++) inv[i] = (1000000007 - 1000000007 / i) * inv[1000000007 % i] % 1000000007; for (long long i = 1; i < N; i++) { long long u = read(), v = read(); vec[u].push_back(v), vec[v].push_back(u); } Init(); dfs(1, 0); Log[0] = -1; for (long long i = 1; i <= tot; i++) Log[i] = Log[i >> 1] + 1; S.init(); for (long long i = 1; i <= N; i++) { D = i; Q[0] = 0, sta[0] = 0; bool ff = 0; for (long long j = i; j <= N; j += i) Q[++Q[0]] = id[j]; sort(Q + 1, Q + Q[0] + 1, cmp); build(); res = 0; dfs1(1); F[i] = res; Clear(); } for (long long i = 1; i <= N; i++) for (long long j = i; j <= N; j += i) f[i] += mu[j / i] * F[j], f[i] = (f[i] % 1000000007 + 1000000007) % 1000000007; long long Ans = 0; for (long long i = 1; i <= N; i++) Ans += V[i] * f[i], Ans %= 1000000007; printf( %lld n , Ans * ksm(N * (N - 1) % 1000000007, 1000000007 - 2) % 1000000007); return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<pair<int, int>> v(n); for (int i = 0; i < n; i++) cin >> v[i].first >> v[i].second; sort(v.begin(), v.end()); for (int i = 0; i < n - 1; i++) { if (v[i].second > v[i + 1].second && v[i].first != v[i + 1].first) { cout << Happy Alex ; return 0; } } cout << Poor Alex ; return 0; }

#include <bits/stdc++.h> using namespace std; int cnt[2]; int main() { ios::sync_with_stdio(false); string s; cin >> s; for (int i = s.size() - 1; i >= -1; i--) { if (i > -1) cnt[s[i] - 0 ]++; if (s[i] == 1 && (i == 0 || s[i - 1] == 0 )) { int req = cnt[1] - cnt[0]; for (int j = i; j < s.size() && s[j] == 1 && req > 0; j++) { cnt[0]++; req--; s[j] = 0 ; } } } cout << s << n ; return 0; }

#include <bits/stdc++.h> using namespace std; const int nax = 3e5 + 5; int nxt[nax][20]; int reach[20]; int main() { int n, q; cin >> n >> q; vector<int> arr(n); for (int i = 0; i < n; i++) cin >> arr[i]; for (int bit = 0; bit < 19; bit++) reach[bit] = n; for (int i = n - 1; i >= 0; i--) { for (int bit = 0; bit < 19; bit++) { nxt[i][bit] = n; } for (int bit = 0; bit < 19; bit++) { if (arr[i] & (1 << bit)) { nxt[i][bit] = min(nxt[i][bit], reach[bit]); if (reach[bit] < n) { for (int j = 0; j < 19; j++) { nxt[i][j] = min(nxt[i][j], nxt[reach[bit]][j]); } } reach[bit] = i; } } } while (q--) { int x, y; cin >> x >> y; x--; y--; bool res = false; for (int bit = 0; bit < 19; bit++) { if (arr[y] & (1 << bit)) { if (nxt[x][bit] <= y) { res = true; break; } } } (res ? cout << Shi n : cout << Fou n ); } }

#include <bits/stdc++.h> using namespace std; int n, m, k, ta, tb, i, ans[100005], tc, ca[2][1005]; vector<int> va[2][1005], vb[2], ve; int main() { scanf( %d%d%d , &n, &m, &k); for (int a = 0; a < k; a++) { scanf( %d%d , &ta, &tb); ta--; tb--; vb[0].push_back(ta); vb[1].push_back(tb); ca[0][ta]++; ca[1][tb]++; ans[a] = -1; } for (int a = 0; a < n; a++) i = max(i, ca[0][a]); for (int a = 0; a < m; a++) i = max(i, ca[1][a]); for (int a = 0; a < n; a++) for (int b = 0; b < i; b++) va[0][a].push_back(-1); for (int a = 0; a < m; a++) for (int b = 0; b < i; b++) va[1][a].push_back(-1); for (int a = 0; a < k; a++) { tc = -1; ta = -1; tb = -1; for (int c = 0; c < i; c++) { if (va[0][vb[0][a]][c] == -1 && va[1][vb[1][a]][c] == -1) { tc = c; break; } else if (va[1][vb[1][a]][c] == -1) ta = c; else if (va[0][vb[0][a]][c] == -1) tb = c; } if (tc != -1) tb = tc; ve.clear(); ve.push_back(a); while (1) { tc = va[ve.size() % 2][vb[ve.size() % 2][ve.back()]] [(ve.size() & 1) ? tb : ta]; if (tc == -1) break; ve.push_back(tc); } for (int c = 0; c < ve.size(); c++) if (ans[ve[c]] != -1) { va[c % 2][vb[c % 2][ve[c]]][ans[ve[c]]] = -1; va[1 - c % 2][vb[1 - c % 2][ve[c]]][ans[ve[c]]] = -1; } for (int c = 0; c < ve.size(); c++) { ans[ve[c]] = (c & 1) ? ta : tb; va[c % 2][vb[c % 2][ve[c]]][(c & 1) ? ta : tb] = ve[c]; va[1 - c % 2][vb[1 - c % 2][ve[c]]][(c & 1) ? ta : tb] = ve[c]; } } printf( %d n , i); for (int a = 0; a < k; a++) printf( %d%c , ans[a] + 1, a == k - 1 ? n : ); return 0; }

#include <bits/stdc++.h> using namespace std; const int maxn = 1000 + 100; int n, k; long long C[maxn][maxn]; void Init() { C[0][0] = 1; for (int i = 1; i < maxn; ++i) { for (int j = 0; j <= i; ++j) { if (j == 0 || j == i) { C[i][j] = 1; } else { C[i][j] = C[i - 1][j - 1] + C[i - 1][j]; } } } } int main() { ios::sync_with_stdio(false); Init(); while (scanf( %d%d , &n, &k) != EOF) { long long ans = 0; if (k >= 1) { ans += 1; } if (k >= 2) { ans += C[n][2]; } if (k >= 3) { ans += C[n][3] * 2; } if (k >= 4) { ans += C[n][4] * 9; } printf( %I64d n , ans); } return 0; }

#include <bits/stdc++.h> using namespace std; const int INF = 2147483647; const long long LLINF = 9223372036854775807LL; int l, r, p; bool isprime(int x) { for (int i = 2; i * i <= x; ++i) if (x % i == 0) return false; return true; } const int maxn = 3000010; int a[maxn]; int acnt = 0; bool prime[110]; void gen(long long val, int lst) { if (lst < p) gen(val, lst + 1); if (prime[lst] && val * lst <= r) { a[acnt++] = val * lst; gen(val * lst, lst); } } int dp[maxn]; bool can[maxn]; int cinf = 110; int main() { for (int i = 0; i < 110; ++i) prime[i] = isprime(i); scanf( %d%d%d , &l, &r, &p); a[acnt++] = 1; gen(1, 2); sort(a, a + acnt); for (int i = 0; i < acnt; ++i) dp[i] = cinf; dp[0] = 0; for (int j = 0; j < p; ++j) { int ptr = 0; for (int i = 0; i < acnt; ++i) { if (dp[i] > p) continue; can[i] |= dp[i] <= p; if (a[i] * (long long)j <= r) { int needval = a[i] * j; while (a[ptr] != needval) ++ptr; int wh = ptr; dp[wh] = min(dp[wh], dp[i] + 1); } ++dp[i]; } } int ans = 0; for (int i = 0; i < acnt; ++i) if (a[i] >= l) ans += can[i]; printf( %d n , ans); return 0; }

#include <bits/stdc++.h> using namespace std; void speed() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); } void convertString(string &s, char t) { if (t == L ) { for (int i = 0; s[i] != 0 ; i++) if (s[i] >= 65 && s[i] <= 90) s[i] += 32; } else { for (int i = 0; s[i] != 0 ; i++) if (s[i] >= 97 && s[i] <= 122) s[i] -= 32; } } int compare_two_values(double a, double b) { if (fabs(a - b) <= 1e-10) return 0; return a > b ? 1 : -1; } int main() { speed(); short n, d, c = 0; cin >> n >> d; for (char i = a ; n > 0; n--) { cout << i; c++; if (c == 26 || c == d) c = 0, i = a ; else i++; } return 0; }

#include <bits/stdc++.h> using namespace std; string s, ans; bool flag = 0; int main() { cin >> s; for (int i = 0; i < s.length(); ++i) { if (s[i] == / ) { if (!flag) { ans += s[i]; flag = 1; } } else { ans += s[i]; flag = 0; } } if (ans.length() > 1 && ans[ans.length() - 1] == / ) ans = ans.substr(0, ans.length() - 1); cout << ans << endl; }

#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 7; struct Graph { int head[N], v[N << 1], w[N << 1], next[N << 1], e; void clear() { e = 0; memset(head, -1, sizeof(head)); } void add(int u, int v, int w) { this->v[e] = v; this->w[e] = w; next[e] = head[u]; head[u] = e++; } } G; int n, a[N], ans[N], id[N]; long long pre[N]; void dfs(int u, int d, long long sum) { id[d] = u; pre[d] = sum; int p = lower_bound(pre + 1, pre + 1 + d, sum - a[u]) - pre; ans[id[d - 1]]++; ans[id[p - 1]]--; for (int e = G.head[u]; ~e; e = G.next[e]) { int v = G.v[e], w = G.w[e]; dfs(v, d + 1, sum + w); ans[u] += ans[v]; } } int main() { cin >> n; for (int i = 1; i <= n; i++) { scanf( %d , a + i); } G.clear(); for (int i = 2; i <= n; i++) { int p, w; scanf( %d%d , &p, &w); G.add(p, i, w); } dfs(1, 1, 0); for (int i = 1; i <= n; i++) { printf( %d%c , ans[i], n [i == n]); } return 0; }

#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; ++i) { cin >> a[i]; } set<int> vals; set<int> cur; for (int i = 0; i < n; ++i) { { set<int> cur2; transform(cur.begin(), cur.end(), inserter(cur2, cur2.end()), [&a, i](int x) { return x | a[i]; }); cur = cur2; } cur.insert(a[i]); copy(cur.begin(), cur.end(), inserter(vals, vals.begin())); } cout << vals.size() << n ; return 0; }

#include <bits/stdc++.h> using namespace std; int main() { string p; int i; bool work = false; cin >> p; for (i = 0; i < p.size(); i++) if (p[i] == H || p[i] == Q || p[i] == 9 ) work = true; if (work) cout << YES ; else cout << NO ; return 0; }

#include <bits/stdc++.h> using namespace std; int main() { long long int q; cin >> q; while (q--) { long long int n, m; cin >> n >> m; char s[n][m]; for (long long int i = 0; i < n; i++) { for (long long int j = 0; j < m; j++) { cin >> s[i][j]; } } long long int r[n], c[m]; for (long long int i = 0; i < n; i++) { long long int temp = 0; for (long long int j = 0; j < m; j++) { if (s[i][j] == * ) { temp++; } } r[i] = temp; } for (long long int i = 0; i < m; i++) { long long int temp = 0; for (long long int j = 0; j < n; j++) { if (s[j][i] == * ) { temp++; } } c[i] = temp; } long long int ans = INT_MAX; for (long long int i = 0; i < n; i++) { for (long long int j = 0; j < m; j++) { long long int temp; temp = n + m - r[i] - c[j]; if (s[i][j] == . ) { temp--; } ans = min(ans, temp); } } cout << ans << endl; } }

#include <bits/stdc++.h> using namespace std; int a[300005]; int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); int Sum = 0; for (int i = 1; i <= n; i++) Sum += a[i]; int indx = 0; int Taken = 0; while (Sum > 2 * Taken) { indx++; Taken += a[indx]; } cout << indx << endl; }

#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; long long ans = 0; for (int i = (0); i < (n); ++i) { long long t, T, x, cost; cin >> t >> T >> x >> cost; if (t >= T) { ans += cost + m * x; continue; } long long aux1 = cost; if (m > (T - t)) aux1 += m * x; long long aux2 = (long long)ceil((double)(m - (T - t)) / (T - t)) + 1; aux2 *= cost; ans += min(aux1, aux2); } cout << ans << endl; return 0; }

#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0, fl = 1; char st = getchar(); while (st < 0 || st > 9 ) { if (st == - ) fl = -1; st = getchar(); } while (st >= 0 && st <= 9 ) x = x * 10 + st - 0 , st = getchar(); return x * fl; } const int N = 1e6 + 10, mod = 1e9 + 9; int n, b, w; long long ans, fac[8005], invfac[8005]; inline long long ksm(long long x, long long y) { long long res = 1; while (y) { if (y & 1) res = res * x % mod; x = x * x % mod; y >>= 1; } return res; } inline long long C(int x, int y) { return fac[x] * invfac[y] % mod * invfac[x - y] % mod; } int main() { ans = 1; n = read(); w = read(); b = read(); fac[0] = 1; fac[1] = 1; for (int i = 2; i <= 8000; i++) fac[i] = fac[i - 1] * i % mod; invfac[0] = invfac[1] = 1; invfac[8000] = ksm(fac[8000], mod - 2); for (int i = 7999; i >= 2; i--) { invfac[i] = invfac[i + 1] * (i + 1) % mod; } ans = fac[w] * fac[b] % mod; ans = ans * (w - 1) % mod; ans = ans * C(w + b - 3, n - 3) % mod; printf( %lld , ans); return 0; }

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); int n; cin >> n; int w, b; cin >> w >> b; vector<int> ve; for (int i = 0; i < n; i++) { int x; cin >> x; ve.push_back(x); } int res = 0; for (int i = 0, j = n - 1; i <= j; i++, j--) { if (ve[i] == ve[j] && ve[i] == 2) { res += (i == j ? 1 : 2) * min(w, b); } else if (ve[i] == ve[j]) continue; else if (ve[i] != ve[j]) { if (ve[i] == 2) res += (ve[j] == 0 ? w : b); else if (ve[j] == 2) res += (ve[i] == 0 ? w : b); else { cout << -1 << endl; return 0; } } } cout << res << endl; return 0; }