func_code_string stringlengths 59 71.4k |
|---|
#include <bits/stdc++.h> bool x[1000000] = {0}; int a, b, c; int y[10001]; int main() { for (a = 2; a < 1001; a++) { if (x[a] == 0) { for (b = a * a; b < 1000000; b = b + a) x[b] = 1; } } int qqq[11200]; int p, q, k, z, r, s = 1, t = 13; while (s != 11185) { k = t; p = 0; while (k >= 10) { y[p] = k % 10; k = k / 10; p++; } y[p] = k; z = 0; for (r = 0; r <= p; r++) z = z * 10 + y[r]; if (x[t] == 0 && x[z] == 0 && t != z) { qqq[s] = t; s++; } t++; } while (scanf( %d , &c) == 1) { printf( %d n , qqq[c]); } return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> T BigMod(T b, T p, T m) { if (p == 0) return 1; if (p % 2 == 0) { T s = BigMod(b, p / 2, m); return ((s % m) * (s % m)) % m; } return ((b % m) * (BigMod(b, p - 1, m) % m)) % m; } template <typename T> T ModInv(T b, T m) { return BigMod(b, m - 2, m); } template <typename T> T in() { char ch; T n = 0; bool ng = false; while (1) { ch = getchar(); if (ch == - ) { ng = true; ch = getchar(); break; } if (ch >= 0 && ch <= 9 ) break; } while (1) { n = n * 10 + (ch - 0 ); ch = getchar(); if (ch < 0 || ch > 9 ) break; } return (ng ? -n : n); } template <typename T> T POW(T B, T printf) { if (printf == 0) return 1; if (printf & 1) return B * POW(B, printf - 1); else return (POW(B, printf / 2) * POW(B, printf / 2)); } template <typename T> T Bigmod(T b, T p, T m) { if (p == 0) return 1; else if (!(p & 1)) return (Bigmod(b, p / 2, m) * Bigmod(b, p / 2, m)) % m; else return ((b % m) * Bigmod(b, p - 1, m)) % m; } template <typename T> T Dis(T x1, T y1, T x2, T y2) { return sqrt((x1 - x2 * x1 - x2) + (y1 - y2 * y1 - y2)); } template <typename T> T Angle(T x1, T y1, T x2, T y2) { return atan(double(y1 - y2) / double(x1 - x2)); } template <typename T> T DIFF(T a, T b) { T d = a - b; if (d < 0) return -d; else return d; } template <typename T> T ABS(T a) { if (a < 0) return -a; else return a; } template <typename T> T gcd(T a, T b) { if (a < 0) return gcd(-a, b); if (b < 0) return gcd(a, -b); return (b == 0) ? a : gcd(b, a % b); } template <typename T> T lcm(T a, T b) { if (a < 0) return lcm(-a, b); if (b < 0) return lcm(a, -b); return a * (b / gcd(a, b)); } template <typename T> T euclide(T a, T b, T &x, T &y) { if (a < 0) { T d = euclide(-a, b, x, y); x = -x; return d; } if (b < 0) { T d = euclide(a, -b, x, y); y = -y; return d; } if (b == 0) { x = 1; y = 0; return a; } else { T d = euclide(b, a % b, x, y); T t = x; x = y; y = t - (a / b) * y; return d; } } template <typename T> void ia(T a[], int n) { for (int i = 0; i < n; i++) cin >> a[i]; } template <typename T> void pa(T a[], int n) { for (int i = 0; i < n - 1; i++) cout << a[i] << ; cout << a[n - 1] << endl; } template <typename T> long long int isLeft(T a, T b, T c) { return (a.x - b.x) * (b.y - c.y) - (b.x - c.x) * (a.y - b.y); } int Set(int N, int pos) { return N = N | (1 << pos); } int Reset(int N, int pos) { return N = N & ~(1 << pos); } bool Check(int N, int pos) { return (bool)(N & (1 << pos)); } template <class T, class first> inline T togglebit(T a, first i) { T t = 1; return (a ^ (t << i)); } int toInt(string s) { int sm; stringstream ss(s); ss >> sm; return sm; } int toLlint(string s) { long long int sm; stringstream ss(s); ss >> sm; return sm; } int cdigittoint(char ch) { return ch - 0 ; } bool isVowel(char ch) { ch = toupper(ch); if (ch == A || ch == U || ch == I || ch == O || ch == E ) return true; return false; } bool isConst(char ch) { if (isalpha(ch) && !isVowel(ch)) return true; return false; } double DEG(double x) { return (180.0 * x) / (2.0 * acos(0.0)); } double RAD(double x) { return (x * (double)2.0 * acos(0.0)) / (180.0); } int a[507][507]; int main() { int n, k; scanf( %d%d , &n, &k); int v = n * n; for (int i = 1; i <= n; i++) { for (int j = n; j >= k; j--) { a[i][j] = v--; } } for (int i = 1; i <= n; i++) { for (int j = k - 1; j; j--) a[i][j] = v--; } long long int ans = 0; for (int i = 1; i <= n; i++) ans += a[i][k]; cout << ans << endl; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) cout << a[i][j] << ; printf( n ); ; } } |
#include <bits/stdc++.h> using namespace std; int n, a[200015]; char s[200015]; vector<pair<int, int> > ans; int main() { scanf( %d , &n); for (int i = (1); i <= (n); i++) scanf( %d , &a[i]); scanf( %s , s + 1); sort(a + 1, a + n + 1); int lp = 1, rp = n; for (int i = (1); i <= (n); i++) if (i == 1 || s[i] != s[i - 1]) rp--; lp = rp++; bool flag = 0; for (int l = 1, r; l <= n; l = r + 1) { r = l; while (r < n && s[r + 1] == s[l]) r++; int len = r - l + 1; ans.push_back(make_pair(a[rp++], s[l] == R )); for (int _ = (1); _ <= (len - 1); _++) { ans.push_back(make_pair(a[lp--], (s[1] == L ) ^ flag)); flag ^= 1; } } for (auto x : ans) { printf( %d %c n , x.first, x.second == 0 ? L : R ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e6 + 7; int h[MAXN], fen[MAXN], pre[MAXN], suf[MAXN], cnt[MAXN]; struct query { int id, a, b, pre, suf; } q[MAXN]; bool operator<(query x, query y) { return x.a < y.a; } bool compare(query x, query y) { return x.id < y.id; } void upd(int idx, int val) { if (idx <= 0) return; for (; idx < MAXN; idx += idx & -idx) fen[idx] = max(fen[idx], val); } int get(int idx) { if (idx <= 0) return 0; int ret = 0; for (; idx; idx -= idx & -idx) ret = max(ret, fen[idx]); return ret; } int32_t main() { ios::sync_with_stdio(0); cin.tie(0); int n, m; cin >> n >> m; for (int i = 0; i < n; ++i) cin >> h[i]; for (int i = 0; i < m; ++i) { cin >> q[i].a >> q[i].b; q[i].a--; q[i].id = i; } vector<int> com; for (int i = 0; i < n; ++i) com.push_back(h[i]); for (int i = 0; i < m; ++i) com.push_back(q[i].b); sort(com.begin(), com.end()); com.resize(unique(com.begin(), com.end()) - com.begin()); for (int i = 0; i < n; ++i) h[i] = lower_bound(com.begin(), com.end(), h[i]) - com.begin() + 1; for (int i = 0; i < m; ++i) q[i].b = lower_bound(com.begin(), com.end(), q[i].b) - com.begin() + 1; int LIS = 0; for (int i = 0; i < n; ++i) { pre[i] = get(h[i] - 1) + 1; LIS = max(LIS, pre[i]); upd(h[i], pre[i]); } memset(fen, 0, sizeof fen); for (int i = n - 1; i >= 0; --i) { suf[i] = get(MAXN - h[i] - 1) + 1; upd(MAXN - h[i], suf[i]); if (pre[i] + suf[i] - 1 == LIS) cnt[pre[i]]++; } vector<int> spec; for (int i = 0; i < n; ++i) if (pre[i] + suf[i] - 1 == LIS && cnt[pre[i]] == 1) spec.push_back(i); sort(q, q + m); memset(fen, 0, sizeof fen); int ptr = 0; for (int i = 0; i < n; ++i) { while (ptr < m && q[ptr].a == i) { q[ptr].pre = get(q[ptr].b - 1) + 1; ptr++; } upd(h[i], get(h[i] - 1) + 1); } memset(fen, 0, sizeof fen); ptr = m - 1; for (int i = n - 1; i >= 0; --i) { while (ptr >= 0 && q[ptr].a == i) { q[ptr].suf = get(MAXN - q[ptr].b - 1) + 1; ptr--; } upd(MAXN - h[i], get(MAXN - h[i] - 1) + 1); } sort(q, q + m, compare); for (int i = 0; i < m; ++i) { int ans = LIS - 1; if (!binary_search(spec.begin(), spec.end(), q[i].a)) ans = LIS; cout << max(ans, q[i].pre + q[i].suf - 1) << n ; } } |
#include <bits/stdc++.h> using namespace std; int main() { vector<string> str_list; string str; int max_length = 0, left_more = 0; while (getline(cin, str)) { max_length = max((int)str.size(), max_length); str_list.push_back(str); } cout << string(max_length + 2, * ) << endl; for (auto s : str_list) { int n = max_length - (int)s.size(); int left = 0, right = 0; if (n % 2 == 0 || s.find_first_not_of( ) == string::npos) { left = right = n / 2; right = n - left; } else { left = (n + left_more) / 2; right = n - left; left_more = 1 - left_more; } cout << * << string(left, ) << s << string(right, ) << * << endl; } cout << string(max_length + 2, * ) << endl; } |
#include <bits/stdc++.h> using namespace std; int32_t main() { ios::sync_with_stdio(false); cin.tie(0); long long int n; cin >> n; map<int, int> mp; for (int i = 0; i < n; i++) { int a; cin >> a; mp[a] = i + 1; } for (int i = 1; i <= n; i++) { cout << mp[i] << ; } } |
#include <bits/stdc++.h> using namespace std; template <class T> bool umin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } template <class T> bool umax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } vector<int> b[200009], r[200009]; vector<pair<int, int> > upd[200009][2]; vector<int> last, now; int blue[200009], red[200009], type = 1, TIM, vis[200009][2]; int bin[200009], bout[200009], rin[200009], rout[200009]; void dfsB(int nd, int pr) { bin[nd] = ++TIM; for (int i = 0; i < int(b[nd].size()); i++) { int to = b[nd][i]; if (to == pr) continue; dfsB(to, nd); } bout[nd] = TIM; } void dfsR(int nd, int pr) { rin[nd] = ++TIM; for (int i = 0; i < int(r[nd].size()); i++) { int to = r[nd][i]; if (to == pr) continue; dfsR(to, nd); } rout[nd] = TIM; } struct Two_Rooted_Tree { vector<pair<int, int> > s[200009 << 2]; int st[200009 << 2], en[200009 << 2]; void merge(int nd) { int p1 = 0, p2 = 0; int s1 = s[nd << 1].size(); int s2 = s[nd << 1 | 1].size(); st[nd] = 0; en[nd] = s1 + s2 - 1; while (p1 + p2 < s1 + s2) { if (p1 >= s1) s[nd].push_back(s[nd << 1 | 1][p2++]); else if (p2 >= s2) s[nd].push_back(s[nd << 1][p1++]); else if (s[nd << 1][p1] <= s[nd << 1 | 1][p2]) s[nd].push_back(s[nd << 1][p1++]); else s[nd].push_back(s[nd << 1 | 1][p2++]); } } void build(int tp, int nd, int x, int y) { s[nd].clear(); if (x == y) { st[nd] = 0; en[nd] = -1; for (__typeof((upd[x][tp]).begin()) it = (upd[x][tp]).begin(); it != (upd[x][tp]).end(); it++) { s[nd].push_back(*it); en[nd]++; } sort(s[nd].begin(), s[nd].end()); return; } int mid = (x + y) >> 1; build(tp, nd << 1, x, mid); build(tp, nd << 1 | 1, mid + 1, y); merge(nd); } void tap(int l, int r, int nd, int x, int y) { if (l > y or x > r) return; if (l <= x and y <= r) { while (st[nd] <= en[nd] and s[nd][st[nd]].first < l) { if (!vis[s[nd][st[nd]].second][type]) { vis[s[nd][st[nd]].second][type] = 1; now.push_back(s[nd][st[nd]].second); } st[nd]++; } while (st[nd] <= en[nd] and s[nd][en[nd]].first > r) { if (!vis[s[nd][en[nd]].second][type]) { vis[s[nd][en[nd]].second][type] = 1; now.push_back(s[nd][en[nd]].second); } en[nd]--; } return; } int mid = (x + y) >> 1; tap(l, r, nd << 1, x, mid); tap(l, r, nd << 1 | 1, mid + 1, y); } } B, R; int main() { int n; scanf( %d , &n); for (int i = 1; i < n; i++) { scanf( %d , blue + i); b[i + 1].push_back(blue[i]); b[blue[i]].push_back(i + 1); } for (int i = 1; i < n; i++) { scanf( %d , red + i); r[i + 1].push_back(red[i]); r[red[i]].push_back(i + 1); } dfsB(1, -1); TIM = 0; dfsR(1, -1); TIM = 0; for (int i = 1; i <= n; i++) { int u = i + 1; int v = blue[i]; upd[rin[u]][1].push_back(make_pair(rin[v], i)); upd[rin[v]][1].push_back(make_pair(rin[u], i)); } for (int i = 1; i <= n; i++) { int u = i + 1; int v = red[i]; upd[bin[u]][0].push_back(make_pair(bin[v], i)); upd[bin[v]][0].push_back(make_pair(bin[u], i)); } B.build(0, 1, 1, n); R.build(1, 1, 1, n); int ind; scanf( %d , &ind); last.push_back(ind); vis[ind][0] = 1; printf( Blue n%d n , ind); while (1) { for (int i = 0; i < int(last.size()); i++) { if (type) { int u = blue[last[i]]; int v = last[i] + 1; if (bin[v] <= bin[u] and bout[u] <= bout[v]) swap(u, v); if (bin[u] <= bin[v] and bout[v] <= bout[u]) B.tap(bin[v], bout[v], 1, 1, n); } else { int u = red[last[i]]; int v = last[i] + 1; if (rin[v] <= rin[u] and rout[u] <= rout[v]) swap(u, v); if (rin[u] <= rin[v] and rout[v] <= rout[u]) R.tap(rin[v], rout[v], 1, 1, n); } } if (now.size() == 0) break; sort(now.begin(), now.end()); if (type) printf( Red n ); else printf( Blue n ); type = (1 - type); for (__typeof((now).begin()) it = (now).begin(); it != (now).end(); it++) printf( %d , *it); puts( ); swap(last, now); now.clear(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); string arr; cin >> arr; long long a = 1; long long counter = 1; for (int i = 0; i < arr.size() - 1; i++) { if ((arr[i] - 0 ) + arr[i + 1] - 0 == 9) a++; else if (a % 2 == 1) counter *= (a / 2 + 1), a = 1; else a = 1; } if (a % 2 == 1) counter *= (a / 2 + 1); cout << counter << endl; } |
#include <bits/stdc++.h> using namespace std; long long dp[1001][1001 + 2][2][2]; int n, k, hv = 1002; char s[1001 + 5], l[1001 + 5], r[1001 + 5]; long long go(int pos, int pv, int ch, int f) { if (pos == -1) return (long long)f; long long &ret = dp[pos][pv][ch][f]; if (ch && ret != -1) return ret; ret = 0LL; int mx = s[pos] - 0 ; if (ch) mx = 9; for (int i = 0; i <= mx; i++) { bool nw = ((i == 4) || (i == 7)); ret = (ret + go(pos - 1, (nw) ? pos : pv, ch || (i < mx), f || (nw && (pv != hv) && (pv - pos) <= k))) % 1000000007LL; } return ret; } long long solve(char *str) { strcpy(s, str); n = strlen(s); reverse(s, s + n); return go(n - 1, hv, 0, 0); } void DECbyONE() { int ln = strlen(l); if (ln == 1) { l[0]--; return; } for (int i = ln - 1; i >= 0; i--) { if (l[i] != 0 ) { l[i]--; break; } else l[i] = 9 ; } strcpy(s, l); memset(l, 0, sizeof(l)); int i = 0, kk = 0; while (s[i] == 0 ) i++; for (i; i < ln; i++) l[kk++] = s[i]; l[i] = 0 ; } int main() { int t, N, cs = 1, i, j; ios_base::sync_with_stdio(0), cin.tie(0); memset(dp, -1, sizeof(dp)); cin >> t >> k; while (t--) { cin >> l >> r; DECbyONE(); long long R = solve(r); long long L = solve(l); cout << (R - L + 1000000007LL) % 1000000007LL << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); int n, j; cin >> n; int a[1000020]; for (int i = 0; i < 1000020; i++) { a[i] = 0; } for (int i = 0; i < n; i++) { cin >> j; a[j]++; } j = 0; for (int i = 0; i < 1000020; i++) { if (a[i] != 0) { a[i + 1] += a[i] / 2; a[i] = a[i] % 2; if (a[i] != 0) { j++; } } } cout << j; return 0; } |
#include <bits/stdc++.h> using namespace std; bool comp(pair<long long, long long> &p1, pair<long long, long long> &p2) { if (p1.first == p2.first) { return p1.second < p2.second; } else { return p1.first < p2.first; } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long a1, b1, a2, b2, a3, b3; map<pair<long long, long long>, long long> mp; cin >> a1 >> b1; cin >> a2 >> b2; cin >> a3 >> b3; vector<pair<long long, long long> > vect; vect.push_back({a1, b1}); vect.push_back({a2, b2}); vect.push_back({a3, b3}); sort(vect.begin(), vect.end(), comp); vector<pair<long long, long long> > vect1; for (long long i = vect[0].first; i <= vect[1].first; i++) { if (mp[{i, vect[0].second}] == 0) { mp[{i, vect[0].second}] = 1; vect1.push_back({i, vect[0].second}); } } if (vect[1].second > vect[0].second) { for (long long i = vect[0].second + 1; i <= vect[1].second; i++) { if (mp[{vect[1].first, i}] == 0) { mp[{vect[1].first, i}] = 1; vect1.push_back({vect[1].first, i}); } } } else if (vect[1].second < vect[0].second) { for (long long i = vect[0].second - 1; i >= vect[1].second; i--) { if (mp[{vect[1].first, i}] == 0) { mp[{vect[1].first, i}] = 1; vect1.push_back({vect[1].first, i}); } } } long long h1 = vect[0].second; long long h2 = vect[1].second; if (h2 >= h1) { if (vect[2].second >= h1 and vect[2].second <= h2) { for (long long i = vect[1].first + 1; i <= vect[2].first; i++) { if (mp[{i, vect[2].second}] == 0) { mp[{i, vect[2].second}] = 1; vect1.push_back({i, vect[2].second}); } } } else if (vect[2].second > h2) { for (long long i = vect[1].first + 1; i <= vect[2].first; i++) { if (mp[{i, vect[1].second}] == 0) { mp[{i, vect[1].second}] = 1; vect1.push_back({i, vect[1].second}); } } for (long long i = h2 + 1; i <= vect[2].second; i++) { if (mp[{vect[2].first, i}] == 0) { mp[{vect[2].first, i}] = 1; vect1.push_back({vect[2].first, i}); } } } else if (vect[2].second < h1) { for (long long i = vect[1].first + 1; i <= vect[2].first; i++) { if (mp[{i, vect[0].second}] == 0) { mp[{i, vect[0].second}] = 1; vect1.push_back({i, vect[0].second}); } } for (long long i = h1 - 1; i >= vect[2].second; i--) { if (mp[{vect[2].first, i}] == 0) { mp[{vect[2].first, i}] = 1; vect1.push_back({vect[2].first, i}); } } } } else { if (vect[2].second >= h2 and vect[2].second <= h1) { for (long long i = vect[1].first + 1; i <= vect[2].first; i++) { if (mp[{i, vect[2].second}] == 0) { mp[{i, vect[2].second}] = 1; vect1.push_back({i, vect[2].second}); } } } else if (vect[2].second > h1) { for (long long i = vect[1].first + 1; i <= vect[2].first; i++) { if (mp[{i, vect[0].second}] == 0) { mp[{i, vect[0].second}] = 1; vect1.push_back({i, vect[0].second}); } } for (long long i = h1 + 1; i <= vect[2].second; i++) { if (mp[{vect[2].first, i}] == 0) { mp[{vect[2].first, i}] = 1; vect1.push_back({vect[2].first, i}); } } } else if (vect[2].second < h2) { for (long long i = vect[1].first + 1; i <= vect[2].first; i++) { if (mp[{i, vect[1].second}] == 0) { mp[{i, vect[1].second}] = 1; vect1.push_back({i, vect[1].second}); } } for (long long i = h2 - 1; i >= vect[2].second; i--) { if (mp[{vect[2].first, i}] == 0) { mp[{vect[2].first, i}] = 1; vect1.push_back({vect[2].first, i}); } } } } cout << vect1.size() << n ; for (long long i = 0; i < vect1.size(); i++) { cout << vect1[i].first << << vect1[i].second << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, a[111111], i, k, l, r, s[111111], ans; int main() { cin >> n; if (n % 2 == 0) { cout << -1; return 0; } for (i = 0; i < n; i++) { cout << i << ; } cout << endl; for (i = 0; i < n; i++) cout << i << ; cout << endl; for (i = 0; i < n; i++) cout << (i + i) % n << ; } |
#include <bits/stdc++.h> using namespace std; template <typename T> inline bool ckmin(T &a, const T &b) { return b < a ? a = b, 1 : 0; } template <typename T> inline bool ckmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; } const int N = 3e5 + 10, P = 998244353; int n, c[N]; int add(int first) { return first >= P ? first - P : first; } int sub(int first) { return first < 0 ? first + P : first; } int qpow(int a, int b) { int res = 1; for (; b; b >>= 1, a = 1ll * a * a % P) if (b & 1) res = 1ll * res * a % P; return res; } int main() { scanf( %d , &n); int m = 0; for (int i = 1; i <= n; i++) { int first; scanf( %d , &first); c[first]++; m += first; } c[m] = sub(c[m] - 1); int inv = 1ll * m * (n - 1) % P * qpow(n, P - 2) % P; int f0 = 0, f1 = 0, ans = 0; for (int i = 0; i <= m; i++) { ans = sub(ans - 1ll * c[i] * f1 % P); swap(f0, f1); f1 = sub(1ll * f0 * sub(add(m + 1ll * n * i % P) - 2ll * i % P) % P - 1ll * i * (n - 1) % P * f1 % P); f1 = add(f1 + inv); f1 = 1ll * f1 * qpow(m - i, P - 2) % P; } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, a[100001], b[100001]; map<long long, long long> cntup; map<long long, long long> cntdown; long long ans; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; long long x = (n + 1) / 2; for (long long i = 1; i <= n; ++i) { cin >> a[i] >> b[i]; cntup[a[i]]++; if (a[i] != b[i]) cntdown[b[i]]++; } bool ok = false; ans = (long long)(1e18); for (long long i = 1; i <= n; ++i) { if (cntup[a[i]] + cntdown[a[i]] >= x) { long long curans = x - cntup[a[i]]; if (curans < 0) curans = 0; ans = min(ans, curans); ok = 1; } if (cntup[b[i]] + cntdown[b[i]] >= x) { long long curans = x - cntup[b[i]]; if (curans < 0) curans = 0; ans = min(ans, curans); ok = 1; } } if (!ok) { cout << -1; return 0; } cout << (ans == (long long)(1e18) ? -1 : ans); } |
#include <bits/stdc++.h> using namespace std; template <class T1> void deb(T1 e) { cout << e << endl; } template <class T1, class T2> void deb(T1 e1, T2 e2) { cout << e1 << << e2 << endl; } template <class T1, class T2, class T3> void deb(T1 e1, T2 e2, T3 e3) { cout << e1 << << e2 << << e3 << endl; } template <class T1, class T2, class T3, class T4> void deb(T1 e1, T2 e2, T3 e3, T4 e4) { cout << e1 << << e2 << << e3 << << e4 << endl; } template <class T1, class T2, class T3, class T4, class T5> void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5) { cout << e1 << << e2 << << e3 << << e4 << << e5 << endl; } template <class T1, class T2, class T3, class T4, class T5, class T6> void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5, T6 e6) { cout << e1 << << e2 << << e3 << << e4 << << e5 << << e6 << endl; } template <class T> T Abs(T x) { return x > 0 ? x : -x; } template <class T> inline T sqr(T x) { return x * x; } long long Pow(long long B, long long P) { long long R = 1; while (P > 0) { if (P % 2 == 1) R = (R * B); P /= 2; B = (B * B); } return R; } long long BigMod(long long B, long long P, long long M) { long long R = 1; while (P > 0) { if (P % 2 == 1) { R = (R * B) % M; } P /= 2; B = (B * B) % M; } return R; } long long n, m; vector<pair<long long, long long> > v; long long mod = 1000000007LL; long long stree[4 * 200050]; map<long long, int> M; set<long long> S; void update(int node, int left, int right, int pos, long long val) { if (pos < left || right < pos) return; if (left == right) { stree[node] = val; return; } int mid = (left + right) / 2; update(node * 2, left, mid, pos, val); update(node * 2 + 1, mid + 1, right, pos, val); stree[node] = stree[node * 2] % mod + stree[node * 2 + 1] % mod; return; } long long query(int node, int left, int right, int srch_l, int srch_r) { if (srch_l <= left && right <= srch_r) return stree[node]; if (right < srch_l || left > srch_r) return 0; int mid = (left + right) / 2; long long ret1 = query(node * 2, left, mid, srch_l, srch_r); ret1 %= mod; long long ret2 = query(node * 2 + 1, mid + 1, right, srch_l, srch_r); ret2 %= mod; long long ret = (ret1 + ret2) % mod; return ret; } vector<int> adj[200050]; int main(void) { long long a, b; cin >> n >> m; for (int i = 0; i < m; i++) { cin >> a >> b, v.push_back(make_pair(a, b)); S.insert(a); S.insert(b); } S.insert(0); S.insert(n); int track = 0; for (__typeof((S).begin()) it = (S.begin()); it != (S).end(); ++it) M[*it] = track++; n = (int)M.size() - 1; update(1, 0, n, 0, 1); for (int i = 0; i < (int)v.size(); i++) { long long right = v[i].second; right = M[right]; adj[right].push_back(i); } for (int i = 1; i < (int)M.size(); i++) { long long val = 0; for (int j = 0; j < (int)adj[i].size(); j++) { int indx = adj[i][j]; int left = v[indx].first; int right = v[indx].second; left = M[left]; right = M[right]; val += query(1, 0, n, left, right); val %= mod; } update(1, 0, n, i, val); } deb(query(1, 0, n, n, n)); return 0; } |
#include <bits/stdc++.h> using namespace std; int i, j, k, sm, mx, mn, res, n; int a, b; void read() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; cin >> a >> b; } void solve() { i = a; j = b; while (i) { mx = max(mx, i % 10); i /= 10; } while (j) { mx = max(mx, j % 10); j /= 10; } mx++; i = 0; while (a || b || k) { i *= 10; i += (a % 10 + b % 10 + k) % mx; k = (a % 10 + b % 10 + k) / mx; a /= 10; b /= 10; res++; } cout << res; } int main() { read(); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main(void) { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long n; cin >> n; long long all = 0; long long ans = 0; for (long long i = 0; i < n; i++) { long long x; cin >> x; ans = max(ans, x); all += x; } n = n - 1; long long round = 0; while (true) { if (all > 0) { round++; all -= n; } else break; } cout << max(round, ans) << n ; return (0); } |
#include <bits/stdc++.h> using namespace std; int b[200005]; int arr[200005]; int cnt[200005]; vector<int> v[200005]; int main() { ios_base::sync_with_stdio(); cin.tie(0); int n, m; cin >> n >> m; for (int i = 1; i <= n; i++) v[i].clear(); memset(cnt, 0, sizeof(cnt)); for (int i = 1; i <= n; i++) { cin >> arr[i]; cnt[arr[i]]++; } int ans = 0; sort(arr + 1, arr + n + 1); for (int i = 1; i <= m; i++) cin >> b[i]; for (int i = m; i >= 1; i--) { cnt[i] += cnt[i + 1]; ans = max(ans, (int)ceil(1.0 * cnt[i] / b[i])); } for (int i = 1; i <= n; i++) { v[i % ans].push_back(arr[i]); } cout << ans << endl; for (int i = 0; i < ans; i++) { int len = v[i].size(); cout << len << ; for (int j = 0; j < len; j++) { cout << v[i][j] << ; } cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int mp[510][510], uss[510][510] = {0}, n, m, siz[510] = {0}, gnu[510][510], p, f[510] = {0}; int main() { int ans = 0; cin >> n >> m >> p; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { scanf( %1d , &mp[i][j]); if (mp[i][j] == 1) { gnu[i][siz[i]] = j; siz[i]++; } } if (siz[i] == 0) continue; else ans = ans + gnu[i][siz[i] - 1] - gnu[i][0] + 1; } for (int i = 0; i < n; i++) { for (int j = 0; j < siz[i]; j++) { for (int k = j; k < siz[i]; k++) { uss[i][siz[i] - (k - j) - 1] = max(uss[i][siz[i] - (k - j) - 1], gnu[i][siz[i] - 1] - gnu[i][0] - (gnu[i][k] - gnu[i][j])); } } uss[i][siz[i]] = gnu[i][siz[i] - 1] - gnu[i][0] + 1; } for (int i = 0; i < n; i++) { if (!siz[i]) continue; for (int j = p; j >= 0; j--) { for (int k = 0; k <= siz[i]; k++) { if (j - k >= 0) f[j] = max(f[j], f[j - k] + uss[i][k]); } } } cout << ans - f[p]; } |
#include <bits/stdc++.h> using namespace std; inline long long mod(long long n, long long m) { long long ret = n % m; if (ret < 0) ret += m; return ret; } long long gcd(long long a, long long b) { return (b == 0LL ? a : gcd(b, a % b)); } long long exp(long long a, long long b, long long m) { if (b == 0LL) return 1LL; if (b == 1LL) return mod(a, m); long long k = mod(exp(a, b / 2, m), m); if (b & 1LL) { return mod(a * mod(k * k, m), m); } else return mod(k * k, m); } long long k; bool ok(long long x, vector<long long>& v) { long long cur = 0; long long tot = 1; long long some = 0; for (long long i = 0; i < (long long)v.size(); i++) { if (tot > k) return 0; long long fim = (i == (long long)v.size() - 1) ? -1 : 0; if (cur + v[i] + fim <= x) { cur += v[i] + fim; } else { cur = v[i] + fim; if (cur > x) return 0; tot++; } } if (tot > k) return 0; return 1; } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; cin >> k; vector<long long> v; string s; long long tot = 0; while (cin >> s) { long long tam = 0; for (long long i = 0; i < (long long)s.size();) { while (i < (long long)s.size() and s[i] != - ) { tam++; i++; } if (i < (long long)s.size()) { tam++; v.push_back(tam); tam = 0; i++; } } if (tam) v.push_back(tam + 1); } for (long long x : v) tot += x; long long l = 1, r = tot; long long ans = tot; while (l <= r) { long long mid = (l + r) / 2; if (ok(mid, v)) { ans = mid; r = mid - 1; } else l = mid + 1; } cout << ans << n ; } |
#include <bits/stdc++.h> using namespace std; long long dx[] = {-1, 0, 1, 0}; long long dy[] = {0, 1, 0, -1}; long long spf[10]; long long dist[1001]; void sieve() { long long i, j; for (i = 0; i < 10; i++) spf[i] = i; for (i = 4; i < 10; i += 2) spf[i] = 2; for (i = 3; i * i < 10; i++) { if (spf[i] == i) { for (j = i * i; j < 10; j += i) { if (spf[j] == j) spf[j] = i; } } } } bool isvowel(char c) { switch (c) { case a : case e : case i : case o : case u : case y : return true; default: return false; } } bool cmp(pair<long long, long long> x, pair<long long, long long> y) { return x.first > y.first; } long long isPrime(long long n) { for (long long i = 2; i <= sqrt(n); i++) { if (n % i == 0) { return i; } } return n; } long long sum(long long n) { long long ans = 0; while (n > 0) { long long d = n % 10; ans += d; n /= 10; } return ans; } vector<long long> adj[5001]; vector<long long> adj1[5001]; long long vis[1001]; long long sub[1001]; long long dist1[1001]; long long vis1[1001]; long long cnt; void bfs(long long node) { vis[node] = 1; queue<long long> q; q.push(node); dist[node] = 0; while (!q.empty()) { long long curr = q.front(); q.pop(); for (auto child : adj[curr]) { if (!vis[child]) { vis[child] = 1; dist[child] = dist[curr] + 1; q.push(child); } } } } long long dfs(long long node) { vis[node] = 1; long long curr_size = 1; for (auto child : adj[node]) { if (!vis[child]) { curr_size += dfs(child); } } sub[node] = curr_size; return curr_size; } struct x { long long b; long long c; long long d; }; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long t; t = 1; while (t--) { long long n; cin >> n; long long a[2 * n + 1]; for (long long i = 1; i <= 2 * n; i++) { cin >> a[i]; } long long ans = 0; for (long long i = 1; i < 2 * n; i += 2) { long long j; for (j = i + 1; j <= 2 * n; j++) { if (a[i] == a[j]) { break; } } for (; j > i + 1; j--) { swap(a[j], a[j - 1]); ans++; } } cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main(int argc, char *argv[]) { double m, R, res[100005], tmp = 0; cin >> m >> R; res[0] = 2; res[1] = 2 + sqrt(2); for (int i = 2; i <= 100000; i++) res[i] = 2 * (i - 1) + 2 * sqrt(2); tmp += m * res[0]; if (m == 1) printf( %.9lf , R * tmp); else { for (int i = 1; i <= m - 1; i++) { tmp += 2 * (m - i) * res[i]; } printf( %.9lf n , R * tmp / (m * m)); } return EXIT_SUCCESS; } |
#include <bits/stdc++.h> using namespace std; int n, T; int t[5005]; double p[5005]; double f[5005][5005]; double res; double fastpow(double a, int b) { if (!b) return 1; double res = fastpow(a, b / 2); if (b % 2) return res * res * a; return res * res; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> T; for (int i = 1; i <= n; i++) { cin >> p[i] >> t[i]; p[i] = (1 - p[i] / 100.0); } f[0][0] = 1; for (int i = 1; i <= n; i++) { double pw = fastpow(p[i], t[i] - 1); for (int j = 1; j <= T; j++) { double s = f[i][j - 1]; s = f[i][j - 1]; if (j - 1 >= t[i]) s -= f[i - 1][j - t[i] - 1] * pw; s *= p[i]; if (j >= t[i]) s += f[i - 1][j - t[i]] * pw * p[i]; s += f[i - 1][j - 1] * (1 - p[i]); res += s; f[i][j] = s; } } cout << setprecision(10) << fixed << res << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1005; int n, a[MAXN]; vector<int> ans; int main() { scanf( %d , &n); ans.reserve(n); for (int i = 1; i <= n; ++i) scanf( %d , &a[i]); a[n + 1] = 1; for (int i = 1; i <= n; ++i) if (a[i + 1] == 1) ans.push_back(a[i]); printf( %d n , int(ans.size())); for (int i = 0; i < int(ans.size()); ++i) printf( %d , ans[i]); printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; long long powm(long long base, long long exp, long long mod = 1000000007) { long long ans = 1; while (exp) { if (exp & 1) ans = (ans * base) % mod; exp >>= 1, base = (base * base) % mod; } return ans; } void fastscan(int &x) { register int c = getchar(); x = 0; for (; (c < 48 || c > 57); c = getchar()) ; for (; c > 47 && c < 58; c = getchar()) { x = (x << 1) + (x << 3) + c - 48; } } const int N = 7e4 + 5; const int M = 10; vector<string> data; long long root, NEW; struct node { long long nxt[10], cnt; } trie[1000000]; void insert(string str) { long long v = root; for (int i = 0; i < (str).size(); i++) { long long x = str[i] - 0 ; if (trie[v].nxt[x]) { v = trie[v].nxt[x]; trie[v].cnt++; continue; } trie[v].nxt[x] = ++NEW; v = trie[v].nxt[x]; trie[v].cnt++; } } void go(string str) { for (int k = 0; k < (str).size(); k++) { insert(str.substr(k, (str).size() - k)); } } long long query(string str) { long long v = root, depth = 0; for (int i = 0; i < (str).size(); i++) { depth++; long long x = str[i] - 0 ; if (trie[trie[v].nxt[x]].cnt) { v = trie[v].nxt[x]; continue; } return depth; } return 1000111000111000111LL; } void del(string str) { long long v = root; for (int i = 0; i < (str).size(); i++) { long long x = str[i] - 0 ; if (trie[v].nxt[x]) { v = trie[v].nxt[x]; trie[v].cnt--; continue; } break; } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n; string str; cin >> n; for (int i = 0; i < n; i++) { cin >> str; go(str); data.push_back(str); } for (int i = 0; i < n; i++) { str = data[i]; for (int k = 0; k < (str).size(); k++) { del(str.substr(k, (str).size() - k)); } string cmp = 9999999999 ; for (int k = 0; k < (str).size(); k++) { string y = str.substr(k, (str).size() - k); long long tmp = query(y); if (tmp == 1000111000111000111LL) continue; string z = y.substr(0, tmp); if ((z).size() < (cmp).size()) cmp = z; } go(str); cout << cmp << endl; } } |
#include <bits/stdc++.h> using namespace std; using ld = long double; using ll = long long; void solve() { int n; cin >> n; vector<int> v(n); vector<pair<int, int>> a(n); for (int i = 0; i < n; i++) { cin >> v[i]; a[i] = {v[i], i}; } sort(a.begin(), a.end()); vector<int> p(n); int j = 0; unordered_multiset<int> next; for (int i = 0; i < n; i++) { if (i > 0 && a[i].first != a[i - 1].first) { j++; } p[a[i].second] = j; next.insert(j); } unordered_map<int, int> d; vector<int> dp1(n), dp2(n), dp3(n), cnt(n); for (int i = 0; i < n; i++) { if (next.count(p[i])) { next.erase(next.find(p[i])); } if (d.count(p[i] - 1)) { if (!d.count(p[i])) { dp2[i] = max(dp2[i], dp1[d[p[i] - 1]] + 1); if (!next.count(p[i] - 1)) { dp2[i] = max(dp2[i], dp2[d[p[i] - 1]] + 1); } } if (!next.count(p[i] - 1)) { dp3[i] = max(dp3[i], dp2[d[p[i] - 1]] + 1); } dp3[i] = max(dp3[i], dp1[d[p[i] - 1]] + 1); } if (d.count(p[i])) { dp3[i] = max(dp3[i], dp3[d[p[i]]] + 1); dp2[i] = max(dp2[i], dp2[d[p[i]]] + 1); dp1[i] = dp1[d[p[i]]] + 1; } else { dp1[i] = 1; } dp2[i] = max(dp2[i], dp1[i]); dp3[i] = max(dp3[i], dp2[i]); d[p[i]] = i; } cout << n - *max_element(dp3.begin(), dp3.end()) << n ; } int main() { int n; cin >> n; while (n--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; using ll = long long; const int INF = 0x3f3f3f3f; const ll LINF = 0x3f3f3f3f3f3f3f3fLL; const double EPS = 1e-8; const int MOD = 1000000007; const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1}; const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1}; template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; } template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; } struct IOSetup { IOSetup() { cin.tie(nullptr); ios_base::sync_with_stdio(false); cout << fixed << setprecision(20); } } iosetup; void solve() { int n, k; cin >> n >> k; if (n % 2 == 0) { n += 2; } else { for (int i = 3; i <= n; i += 2) { if (n % i == 0) { n += i; break; } } } --k; cout << 2LL * k + n << n ; } int main() { int t; cin >> t; while (t--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 6e4, maxm = 2e6; int g[maxm]; int a[maxn], L[maxn], R[maxn], dp[maxn], ans[maxn]; int n, m, i, j, k; int main() { scanf( %d%d , &n, &m); for (i = 1; i <= 1e6; i++) g[i] = g[i - 1] ^ i; for (i = 1; i <= n; i++) scanf( %d , &a[i]); for (i = 1; i <= m; i++) scanf( %d%d , &L[i], &R[i]); for (i = 1; i <= n; i++) { dp[i - 1] = 0; for (j = i; j <= n; j++) { dp[j] = g[max(a[i], a[j])] ^ g[min(a[i], a[j]) - 1]; dp[j] = max(dp[j], dp[j - 1]); } for (j = 1; j <= m; j++) if (L[j] <= i) ans[j] = max(ans[j], dp[R[j]]); } for (i = 1; i <= m; i++) printf( %d n , ans[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; const int mxn = 200001, mxk = 8; int n, m, k; pair<int, int> a[mxn]; int first[mxk]; int dp[1 << mxk], p[1 << mxk]; int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> m >> k; for (int i = 1; i <= n; i++) { cin >> a[i].first >> a[n + i].first; a[i].first--, a[i].second = i, a[n + i].second = -i; } sort(a + 1, a + 2 * n + 1); memset(dp, 0xcf, sizeof(dp)); dp[0] = 0; for (int i = 1; i <= 2 * n; i++) { swap(dp, p); memset(dp, 0xcf, sizeof(dp)); int x = find(first, first + k, a[i].second > 0 ? 0 : -a[i].second) - first; first[x] = max(0, a[i].second); int z = 0; for (int j = 0; j < k; j++) z |= !first[j] << j; for (int j = 0; j < (1 << k); j++) if (!(j & z)) for (int l = 0; l < 2; l++) { dp[j] = max(dp[j], p[j ^ (l << x)] + (a[i].first - a[i - 1].first) * ((__builtin_popcount(j) & 1) ^ l)); } } cout << *max_element(dp, dp + (1 << k)) << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; void solve() { int n, m; cin >> n >> m; vector<string> f(n); for (int i = 0; i < n; ++i) { cin >> f[i]; } vector<int> v(m); for (int j = 1; j < m; ++j) { for (int i = 1; i < n; ++i) { if (f[i - 1][j] == X && f[i][j - 1] == X ) { v[j] = 1; } } } for (int i = 1; i < m; ++i) { v[i] += v[i - 1]; } int q; cin >> q; for (int i = 0; i < q; ++i) { int a, b; cin >> a >> b; if (v[b - 1] - v[a - 1] > 0) { cout << NO n ; } else { cout << YES n ; } } } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); solve(); } |
#include <bits/stdc++.h> using namespace std; int a[13], t, ans; const int P = 1e9 + 7; int qp(int a, int b) { int r = 1; for (; b; b >>= 1, a = a * 1ll * a % P) if (b & 1) r = r * 1ll * a % P; return r; } void dfs(int x, int y, bool b) { if (x == t) { if (b) ans = (ans + qp(2, y - 1)) % P; else ans = (ans - qp(2, y - 1)) % P; return; } ++x, dfs(x, y / a[x], !b), dfs(x, y, b); } int main() { int x, y, i; scanf( %d%d , &x, &y); if (y % x) return puts( 0 ), 0; y /= x, x = y; for (i = 2; i * i <= y; ++i) if (!(y % i)) { a[++t] = i; do y /= i; while (!(y % i)); } if (y > 1) a[++t] = y; dfs(0, x, 1), printf( %d , (ans + P) % P); return 0; } |
#include <bits/stdc++.h> using namespace std; const int NMAX = 100000 + 5; const int MMAX = 2000 + 5; const int INF = 1000000000; const int BS = 1000000000 + 7; const long long INFLL = 1000000000ll * 1000000000ll; const long double eps = 1e-6; int main(int argc, char** argv) { if (argc > 1 && strcmp(argv[1], seland ) == 0) { freopen( input.txt , r , stdin); freopen( output.txt , w , stdout); } ios::sync_with_stdio(false); cin.tie(); cout.tie(); long long ans[2] = {0}; int cnt[2][2] = {0}; string s; int index = 0; cin >> s; for (auto c : s) { c -= a ; cnt[c][index % 2]++; ans[0] += cnt[c][(index + 1) % 2]; ans[1] += cnt[c][index % 2]; index++; } cout << ans[0] << << ans[1] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; long long int n; long long int v[N]; vector<long long int> a, b; long long int solve(const vector<long long int> &vet) { long long int max_so_far = INT_MIN, max_ending_here = 0; for (int i = 0; i < vet.size(); i++) { max_ending_here = max_ending_here + vet[i]; if (max_so_far < max_ending_here) max_so_far = max_ending_here; if (max_ending_here < 0) max_ending_here = 0; } return max_so_far; } int main() { scanf( %lld , &n); for (int i = 0; i < n; ++i) { scanf( %lld , &v[i]); } for (int i = 1; i < n; ++i) { a.push_back(abs(v[i] - v[i - 1]) * ((i & 1) ? 1 : -1)); b.push_back(abs(v[i] - v[i - 1]) * ((i & 1) ? -1 : 1)); } printf( %lld n , max(solve(a), solve(b))); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long md = 1e9 + 7; int main() { cout.precision(12); iostream::sync_with_stdio(0); cin.tie(0), cout.tie(0); const int MX = 1e6 + 1; vector<int> pr(MX, 1); vector<int> o; for (int i = 2; i < MX; i++) { if (!pr[i]) continue; o.push_back(i); for (long long j = i * 1ll * i; j < MX; j += i) pr[j] = 0; } long long n, x, y; cin >> n >> x >> y; unordered_map<long long, long long> q; vector<long long> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; long long c = a[i]; for (int j : o) { if (j * 1ll * j > a[i]) break; if (a[i] % j) continue; while (a[i] % j == 0) a[i] /= j; q[j]++; } if (a[i] != 1) q[a[i]]++; a[i] = c; } long long mx = 0; for (auto i : q) mx = max(mx, i.second); if (x <= y) { cout << (n - mx) * x << n ; return 0; } long long ans = (n - q[2]) * y; for (auto i : q) { if (i.second <= q[2]) continue; long long res = 0; bool ch = 1; for (long long e : a) { long long d = (i.first - (e % i.first)) % i.first; res += min(x, y * d); if (res > ans) { ch = 0; break; } } if (ch) ans = min(ans, res); } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m, a, b; cin >> n >> m >> a >> b; int q = m * a; if (q < b) { cout << n * a; } else { int v = n / m; n -= v * m; cout << v * b + min(b, n * a); } } |
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int n = s.length(); int l = n, r = n; bool found = false; for (int i = 0; i < n; i++) { if (found == false && s[i] > a ) { found = true; l = i; } if (found == true && s[i] == a ) { r = i; break; } } for (int i = l; i < r; i++) { s[i] = (char)((int)s[i] - 1); } if (l != n) cout << s; else { s[n - 1] = z ; cout << s; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; if (n & 1) cout << -1 * (n / 2 + 1) << endl; else cout << n / 2 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n, m, i, pos = -1, flag; string s1, s2; cin >> n >> m; cin >> s1; cin >> s2; for (i = 0; i < n; i++) { if (s1[i] == * ) { pos = i; break; } } if (pos == -1) { if (s1 == s2) cout << YES << endl; else cout << NO << endl; } else { if (m < (n - 1)) cout << NO << endl; else { flag = 0; for (i = 0; i < n; i++) { if (i < pos) { if (s1[i] != s2[i]) { cout << NO << endl; flag = 1; break; } } else if (i > pos) { if (s1[i] != s2[m - n + i]) { cout << NO << endl; flag = 1; break; } } } if (flag == 0) cout << YES << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, k; int a[100005]; int maxans, maxnum; int main() { scanf( %d%d , &n, &k); for (int i = 0; i < n; i++) scanf( %d , &a[i]); sort(a, a + n); int l = 0, r = 0; int curk = k, curans = 0, curnum = 0; while (r < n) { while (r < n && curk >= (long long)curans * (a[r] - curnum)) { curk -= curans * (a[r] - curnum); curans++; curnum = a[r++]; } if (curans > maxans) { maxans = curans; maxnum = curnum; } if (l < r) { curk += curnum - a[l++]; curans--; } if (curans > maxans) { maxans = curans; maxnum = curnum; } } printf( %d %d n , maxans, maxnum); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, m; long long a[100001]; long long b[100001]; cin >> n >> m; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); long long x = 0, i = 1, count = 0; while (m > 0) { if (a[x] != i) { if (m - i >= 0) { m -= i; b[count] = i; count++; } else break; } else x++; i++; } cout << count << endl; for (int i = 0; i < count; i++) cout << b[i] << ; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; long long n, m, l, r, a[N], b[N], dp[N]; void prework() { int k = 1; for (int i = 2; i <= n; ++i) if (a[i + 1] - a[i] > a[k + 1] - a[k]) k = i; r = a[k + 1] - a[k] - 1; for (int i = 1; i <= n; ++i) b[i] = a[i + k]; int t = b[1]; for (int i = 1; i <= n; ++i) b[i] -= t; } int check(long long x) { dp[1] = 0; for (int i = 2; i <= n; ++i) { dp[i] = dp[i - 1]; if (dp[i - 1] >= b[i] - 1) dp[i] = max(dp[i], b[i] + x); if (dp[i - 1] >= b[i] - x - 1) dp[i] = max(dp[i], b[i]); if (i > 2 && dp[i - 2] >= b[i] - x - 1) dp[i] = max(dp[i], b[i - 1] + x); } if (dp[n] >= m - x - 1) return 1; dp[2] = max(b[2], x); for (int i = 3; i <= n; ++i) { dp[i] = dp[i - 1]; if (dp[i - 1] >= b[i] - 1) dp[i] = max(dp[i], b[i] + x); if (dp[i - 1] >= b[i] - x - 1) dp[i] = max(dp[i], b[i]); if (dp[i - 2] >= b[i] - x - 1) dp[i] = max(dp[i], b[i - 1] + x); } return dp[n] >= min(m - 1, m + b[2] - x - 1); } int main() { ios::sync_with_stdio(false); cin >> m >> n; for (int i = 1; i <= n; ++i) cin >> a[i], a[i + n] = a[i] + m; if (n == 1) return cout << m - 1 << endl, 0; sort(a + 1, a + n * 2 - 1); prework(); while (l < r) { long long mid = (l + r) >> 1; if (check(mid)) r = mid; else l = mid + 1; } cout << l << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int l = 8 * n + 1; double m = sqrt(l); int k = sqrt(l); if (m == k) cout << YES << endl; else cout << NO << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; long long by = (n / 2) + (n / 3) + (n / 5) + (n / 7) - (n / 6) - (n / 10) - (n / 14) - (n / 15) - (n / 35) - (n / 21); by += (n / 30) + (n / 42) + (n / 70) + (n / 105); by -= (n / 210); cout << n - by << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; bool mark[100]; int main() { int n, A[100][100]; cin >> n; int k = n; for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) cin >> A[i][j]; for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) { if (A[i][j] == 1 or A[i][j] == 3) { mark[i] = true; k--; j = n; } } cout << k << endl; for (int i = 0; i < n; i++) if (!mark[i]) cout << i + 1 << ; } |
#include <bits/stdc++.h> using namespace std; const int MAX = 1e5 + 10; string s[105]; int n, last_hh, last_mm, last_tme, cur_tme, cur_mm, cur_hh, ans = 1, cnt = 0; int calch(int i) { return (s[i][1] - 0 ) * 10 + s[i][2] - 0 ; } int calcm(int i) { return (s[i][4] - 0 ) * 10 + s[i][5] - 0 ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n; for (int i = 1; i <= n + 1; i++) getline(cin, s[i]); for (int i = 2; i <= n + 1; i++) { last_hh = calch(i - 1); if (last_hh == 12) last_hh = 0; last_mm = calcm(i - 1); cur_hh = calch(i); if (cur_hh == 12) cur_hh = 0; cur_mm = calcm(i); last_tme = last_hh * 60 + last_mm; cur_tme = cur_hh * 60 + cur_mm; if (s[i - 1][7] == p ) last_tme += 12 * 60; if (s[i][7] == p ) cur_tme += 12 * 60; if (last_tme > cur_tme) ans++, cnt = 0; else if (last_tme == cur_tme) { cnt++; if (cnt == 10) ans++, cnt = 0; } else cnt = 0; } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6; long long int ans, n, a[N]; string s; int main() { cin >> n >> s; if (n == 1) { cout << Yes ; return 0; } for (int i = 0; i < n; i++) { a[s[i] - a ]++; } for (int i = 0; i < 26; i++) { if (a[i] == 1) { ans++; } } if (ans == n) { cout << No ; return 0; } cout << Yes ; return 0; } |
#include <bits/stdc++.h> using namespace std; string a, str, ans; int n, m; int G[205 * 2][205 * 2]; bool check(int x, int y) { bool f1 = (a[ans[x] - a ] == C ), f2 = (a[ans[y] - a ] == C ); int ta = 2 * x + 2, tb = 2 * y + 2; return !G[ta - f1][tb - (!f2)] && !G[tb - f2][ta - (!f1)]; } bool DFS(int now, bool p) { if (now == n) { cout << ans << endl; return true; } int lw = (p == true) ? 0 : str[now] - a ; for (int i = lw; i < a.length(); i++) { ans[now] = i + a ; bool f = true; for (int j = 0; j <= now; j++) { if (check(j, now) == false) { f = false; break; } } if (f == false) continue; if (DFS(now + 1, p || (ans[now] > str[now]))) return true; } return false; } int main() { cin >> a >> n >> m; for (int i = 1, p1, p2; i <= m; i++) { char t1, t2; scanf( %d %c %d %c , &p1, &t1, &p2, &t2); bool f1 = (t1 == C ), f2 = (t2 == C ); int x = 2 * p1, y = 2 * p2; G[x - f1][y - f2] = G[y - (!f2)][x - (!f1)] = 1; } int c[2] = {0}; for (int i = 0; i < a.length(); i++) c[a[i] == C ] = 1; if (c[1] == 0 || c[0] == 0) { for (int i = 1; i <= n; i++) G[2 * i - c[0]][2 * i - (!c[0])] = 1; } cin >> str; for (int t = 1; t <= 2 * n; t++) { for (int i = 1; i <= 2 * n; i++) { for (int j = 1; j <= 2 * n; j++) if (G[i][t] && G[t][j]) G[i][j] = 1; } } for (int i = 1; i <= n; i++) { int x = 2 * i, y = 2 * i - 1; if (G[x][y] && G[y][x]) { puts( -1 ); return 0; } ans += ; } if (DFS(0, 0) == false) puts( -1 ); return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename _T> inline void _DBG(const char *s, _T x) { cerr << s << = << x << n ; } template <typename _T, typename... args> void _DBG(const char *s, _T x, args... a) { while (*s != , ) cerr << *s++; cerr << = << x << , ; _DBG(s + 1, a...); } vector<int> A; vector<int> modded; int main() { int n; cin >> n; A.resize(n); modded.resize(n); for (int i = 0; i < n; i++) { cin >> A[i]; } int res = 0; for (int i = 0; i < 27; i++) { for (int j = 0; j < n; j++) { modded[j] = A[j] % (1 << (i + 1)); } sort((modded).begin(), (modded).end()); int l, r, cnt = 0; for (int j = 0; j < n; j++) { auto beg = modded.begin() + j + 1; auto end = modded.end(); l = lower_bound(beg, end, (1 << i) - modded[j]) - modded.begin(); r = lower_bound(beg, end, (1 << (i + 1)) - modded[j]) - modded.begin(); cnt += (r - l); l = lower_bound(beg, end, (1 << (i + 1)) + (1 << i) - modded[j]) - modded.begin(); r = upper_bound(beg, end, (1 << (i + 2)) - 2 - modded[j]) - modded.begin(); cnt += (r - l); } if (cnt & 1) { res |= (1 << i); } } cout << res << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int TRIE[200005 * 32 * 2][2]; int isword[200005 * 32 * 2]; int nxt; void ins(string &s) { int v = 0; for (int i = 0; i < s.size(); i++) { if (TRIE[v][s[i] - 0 ] == -1) TRIE[v][s[i] - 0 ] = nxt++; isword[v]++; v = TRIE[v][s[i] - 0 ]; } isword[v]++; } void del(string &s) { int v = 0; int u; for (int i = 0; i < s.size(); i++) { if (isword[v] > 0) isword[v]--; if (isword[v] == 0 && i > 0) TRIE[u][s[i - 1] - 0 ] = -1; u = v; v = TRIE[v][s[i] - 0 ]; } if (isword[v] > 0) isword[v]--; if (isword[v] == 0) TRIE[u][s[31] - 0 ] = -1; } string bin(int a) { string k = ; while (a) { k += to_string(a % 2); a /= 2; } int u = k.length(); for (int i = 0; i < 32 - u; i++) k += 0 ; reverse(k.begin(), k.end()); return k; } long long int query(string &s) { int v = 0; string k = ; for (int i = 0; i < s.size(); i++) { if (TRIE[v][1 - (s[i] - 0 )] != -1) { v = TRIE[v][1 - (s[i] - 0 )]; if (s[i] == 0 ) k += 1 ; else k += 0 ; } else { v = TRIE[v][s[i] - 0 ]; k += s[i]; } } long long int val = 0, bit; for (int i = 0; i <= 31; i++) { bit = (s[i] == k[i]) ? 0 : 1; val <<= 1; val += bit; } return val; } int main() { memset(isword, 0, sizeof(isword)); memset(TRIE, -1, sizeof(TRIE)); isword[0] = 1; nxt = 1; int q, a; string s; cin >> q; string k = bin(0); ins(k); for (int i = 0; i < q; i++) { cin >> s >> a; string k = bin(a); if (s == + ) ins(k); else if (s == - ) del(k); else cout << query(k) << endl; } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) #pragma GCC optimize( Ofast ) using namespace std; int seg[800006][16], x[800006], n, m, t, p, T, ans, pc, L, R, k; vector<int> v; inline int gt(int a, int b) { int k1 = (pow(10, b)); int k2 = (pow(10, b - 1)); if ((k1 % 10) == 9) k1++; if ((k2 % 10) == 9) k2++; return ((a % k1) / (k2)); } inline int Build_Segtree(int h, int l, int r) { if (l > r) return 0; if (l > R) return seg[h][k]; if (r < L) return seg[h][k]; if (l == r) { if (gt(x[l], k)) return seg[h][k] = l; else return seg[h][k] = 0; } int lf = Build_Segtree(h << 1, l, ((l + r) >> 1)); int rg = Build_Segtree((h << 1) + 1, ((l + r) >> 1) + 1, r); if (x[lf] > x[rg]) return seg[h][k] = rg; if (x[lf] <= x[rg]) return seg[h][k] = lf; } inline int get(int h, int l, int r) { if (l > r) return 0; if (l > R) return 0; if (r < L) return 0; if (l >= L && r <= R) return seg[h][k]; int lf = get(h << 1, l, ((l + r) >> 1)); int rg = get((h << 1) + 1, ((l + r) >> 1) + 1, r); if (x[lf] > x[rg]) return rg; if (x[lf] <= x[rg]) return lf; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> n >> m; for (int i = 1; i <= n; i++) { cin >> x[i]; } x[0] = 1999999999; for (int j = 1; j <= 9; j++) { L = 1; R = n; k = j; Build_Segtree(1, 1, n); } for (int i = 1; i <= m; i++) { int q, a, b; cin >> q >> a >> b; if (q == 1) { x[a] = b; for (int j = 1; j <= 9; j++) { L = a; R = a; k = j; Build_Segtree(1, 1, n); } } if (q == 2) { ans = 1999999999; for (int j = 1; j <= 9; j++) { L = a; R = b; k = j; t = get(1, 1, n); p = x[t]; x[t] = 0; L = t; R = t; k = j; Build_Segtree(1, 1, n); L = a; R = b; k = j; T = get(1, 1, n); x[t] = p; L = t; R = t; k = j; Build_Segtree(1, 1, n); if (T) ans = min(ans, x[t] + x[T]); } if (ans == 1999999999) { v.push_back(-1); } else { v.push_back(ans); } } } for (int i = 0; i < v.size(); i++) { printf( %ld n , v[i]); } } |
#include <bits/stdc++.h> using namespace std; int main() { long long int a, b, x, i, j, k, n; cin >> a >> b >> x; string s; n = a + b; if (a >= b) { s = 0 ; a -= 1; } else { s = 1 ; b -= 1; } for (i = 1; i < n; i++) { if (s[i - 1] == 0 && x > 1) { s += 1 ; b -= 1; x -= 1; } else if (s[i - 1] == 1 && x > 1) { s += 0 ; a -= 1; x -= 1; } else if (x == 1 && a != 0 && b != 0) { if (s[i - 1] == 0 && a != 0) { s += 0 ; a -= 1; } else if (s[i - 1] == 1 && b != 0) { s += 1 ; b -= 1; } } else if (a == 0) { s += 1 ; b -= 1; } else if (b == 0) { s += 0 ; a -= 1; } } cout << s << endl; return 0; } |
#include <bits/stdc++.h> #pragma optimization_level 3 #pragma comment(linker, /stack:200000000 ) #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; long double TL = 1.0; bool is_tl = 0; long long CALLS = 0; inline bool IS() { if (++CALLS == 1000) { CALLS = 0; is_tl |= clock() > (TL - 0.1) * CLOCKS_PER_SEC; } return is_tl; } template <typename T> inline void amin(T &a, T b) { if (a > b) a = b; } template <typename T> inline void amax(T &a, T b) { if (a < b) a = b; } template <typename T> inline void print(T a) { for (auto U : a) cout << U << ; cout << n ; } const long long N = 1e6 + 7, NS = 1e3 + 7, lg = 18, sq = 550, inf = 1e9 + 7, mod = 1e9 + 7, SM = 1e2 + 7; const long double eps = 1e-9; mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count()); struct edge { long long to; long long f; long long c; long long get() { return c - f; } }; vector<edge> e; vector<long long> v[N]; vector<pair<pair<long long, long long>, long long> > edges; long long n, m, used[N]; void add_edge(long long a, long long b, long long c) { v[a].push_back(e.size()); edge ed; ed.to = b; ed.f = 0; ed.c = c; e.push_back(ed); v[b].push_back(e.size()); ed.to = a; ed.c = 0; e.push_back(ed); } long long dfs(long long x, long long f) { if (x == n - 1) return f; used[x] = 1; for (auto u : v[x]) { if (used[e[u].to] || e[u].get() <= 0) continue; long long y = dfs(e[u].to, min(f, e[u].get())); if (y) { e[u].f += y; e[u ^ 1].f -= y; return y; } } return 0; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long need; cin >> n >> m >> need; for (long long i = 1; i <= m; i++) { long long a, b, c; cin >> a >> b >> c; a--, b--; edges.push_back({{a, b}, c}); } long double l = 0, r = inf, mid; for (long long it = 0; it < 200; it++) { mid = (l + r) / 2; e.clear(); for (long long i = 0; i < n; i++) v[i].clear(); for (auto u : edges) { long long a = u.first.first, b = u.first.second, c = (long long)((u.second + 0.) / mid); add_edge(a, b, c); } long long ans = 0; while (1) { for (long long i = 0; i < n; i++) used[i] = 0; long long y = dfs(0, inf); if (!y) break; ans += y; } if (ans >= need) l = mid; else r = mid; } cout << fixed << setprecision(10); cout << mid * (0. + need); } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); int t; cin >> t; while (t--) { long long int n, i, j, k, l, sum = 0, g = 0, sum1 = 0, q, one, zero, k1; cin >> n >> k1; string s; cin >> s; for (i = 0; i < k1; i++) { k = i; q = 0; zero = 0, one = 0; while (k <= n - 1) { if (s[k] == ? ) q++; else if (s[k] == 1 ) one++; else zero++; k += k1; } if (one != 0 && zero != 0) { g = 1; break; } else if (zero != 0) { k = i; while (k <= n - 1) { s[k] = 0 ; k += k1; } } else if (one != 0) { k = i; while (k <= n - 1) { s[k] = 1 ; k += k1; } } } for (i = 0; i < k1; i++) { if (s[i] == 1 ) sum++; else if (s[i] == ? ) sum1++; } if (sum > k1 / 2) g = 1; else if (sum < (k1 / 2) && sum1 < ((k1 / 2) - sum)) g = 1; if (g == 1) cout << NO << n ; else cout << YES << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int x, y, z; long long int x1, y1, z1; cin >> x >> y >> z >> x1 >> y1 >> z1; long long int a[6]; for (long long int i = 0; i < 6; i++) cin >> a[i]; long long int sum = 0; if (y < 0) sum += a[0]; if (y > y1) sum += a[1]; if (x < 0) sum += a[4]; if (x > x1) sum += a[5]; if (z < 0) sum += a[2]; if (z > z1) sum += a[3]; cout << sum << n ; } |
#include <bits/stdc++.h> using namespace std; char str[100010]; int main() { int ans[] = {4, 0, 0, 0}; while (~scanf( %s , str)) { int tmp = 0; int len = strlen(str); for (int i = 0; i < len; ++i) { tmp = tmp * 10 + str[i] - 0 ; tmp %= 4; } printf( %d n , ans[tmp]); } return 0; } |
#include <bits/stdc++.h> using namespace std; int a[100000]; int main() { int n, h; cin >> n >> h; for (int i = 0; i < (int)(n); i++) cin >> a[i]; int head = min_element(a, a + n) - a; sort(a, a + n); int ret1 = max(a[0] + a[n - 1] + h, a[n - 1] + a[n - 2]) - min(a[1] + a[2], a[0] + a[1] + h); int ret2 = (a[n - 1] + a[n - 2]) - (a[0] + a[1]); cout << min(ret1, ret2) << endl; if (ret1 < ret2) { for (int i = 0; i < (int)(n); i++) { if (i == head) cout << 2 ; else cout << 1 ; } } else { for (int i = 0; i < (int)(n); i++) cout << 1 ; } cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const double pi = acos(-1.0); const double eps = 1e-9; const long long INF = 100000000000000000; const int MAXN = 3 * 100000; struct T { int left, right, diff; bool operator>(const T& other) { if (diff != other.diff) return diff < other.diff; return left < other.left; } bool operator<(const T& other) const { if (diff != other.diff) return diff > other.diff; return left > other.left; } }; priority_queue<T> q; vector<pair<int, int> > ans; char s[MAXN]; bool u[MAXN]; int a[MAXN]; int l[MAXN]; int r[MAXN]; int n; int main() { cin >> n; scanf( %s , s); for (int i = 0; i < n; ++i) { scanf( %d , &a[i]); l[i] = i - 1; r[i] = i + 1; if (i + 1 == n) r[i] = -1; } for (int i = 0; i < n - 1; ++i) if (s[i] != s[i + 1]) { T t; t.left = i; t.right = i + 1; t.diff = abs(a[i] - a[i + 1]); q.push(t); } while (!q.empty()) { int left = q.top().left; int right = q.top().right; q.pop(); if (u[left] || u[right]) continue; u[left] = u[right] = true; ans.push_back(pair<int, int>(left + 1, right + 1)); left = l[left]; right = r[right]; if (left != -1) r[left] = right; if (right != -1) l[right] = left; if (left != -1 && right != -1 && s[left] != s[right]) { T t; t.left = left; t.right = right; t.diff = abs(a[left] - a[right]); q.push(t); } } cout << ans.size() << endl; for (int i = 0; i < (long long)(ans).size(); ++i) { printf( %d %d n , ans[i].first, ans[i].second); } } |
#include <bits/stdc++.h> using namespace std; void RD(int &x) { scanf( %d , &x); } void RD(long long &x) { scanf( %I64d , &x); } void RD(unsigned int &x) { scanf( %u , &x); } void RD(double &x) { scanf( %lf , &x); } void RD(int &x, int &y) { scanf( %d%d , &x, &y); } void RD(long long &x, long long &y) { scanf( %I64d%I64d , &x, &y); } void RD(unsigned int &x, unsigned int &y) { scanf( %u%u , &x, &y); } void RD(double &x, double &y) { scanf( %lf%lf , &x, &y); } void RD(int &x, int &y, int &z) { scanf( %d%d%d , &x, &y, &z); } void RD(long long &x, long long &y, long long &z) { scanf( %I64d%I64d%I64d , &x, &y, &z); } void RD(unsigned int &x, unsigned int &y, unsigned int &z) { scanf( %u%u%u , &x, &y, &z); } void RD(double &x, double &y, double &z) { scanf( %lf%lf%lf , &x, &y, &z); } void RD(char &x) { x = getchar(); } void RD(char *s) { scanf( %s , s); } void RD(string &s) { cin >> s; } void PR(int x) { printf( %d n , x); } void PR(int x, int y) { printf( %d %d n , x, y); } void PR(long long x) { printf( %I64d n , x); } void PR(unsigned int x) { printf( %u n , x); } void PR(unsigned long long x) { printf( %I64u n , x); } void PR(double x) { printf( %.6lf n , x); } void PR(char x) { printf( %c n , x); } void PR(char *x) { printf( %s n , x); } void PR(string x) { cout << x << endl; } const int mod = 1000000007; const long long inf = ((long long)1) << 60; const int INF = 100000000; const int N = 1000005; vector<pair<int, int> > V; long long Pow[N]; int n, m, K; void init() { Pow[0] = 1; int i; for (i = 1; i <= N - 1; i++) Pow[i] = Pow[i - 1] * 2 % mod; } int main() { init(); while (scanf( %d , &n) != -1) { RD(m, K); V.clear(); int i, x, y, cnt, flag = 1; for (i = 1; i <= m; i++) { RD(x, y); if (y - x != 1 && y - x != K + 1) flag = 0; if (y - x == K + 1) V.push_back(make_pair(x, y)); } if (!flag) { puts( 0 ); continue; } sort(V.begin(), V.end()); if (!K || K >= n - 1) { puts( 1 ); continue; } for (i = 0; i < V.size(); i++) if (!(V[i].first >= V[0].first && V[i].first < V[0].second)) { break; } if (i < V.size()) { puts( 0 ); continue; } long long ans = 0; if (!V.size()) ans++; int t = V.size(); for (i = 1; i <= n; i++) { x = i; y = i + K + 1; cnt = t; if (y > n || t && x > V[0].first) break; if (t && !(x <= V[0].first && V[t - 1].first < y)) continue; if (t && x == V[0].first) cnt--; y = ((y) < (n - K) ? (y) : (n - K)); ans += Pow[y - x - 1 - cnt]; ans %= mod; } PR(ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; char s[1001]; int main(void) { int k, l, r, i, j; cin >> s >> k; l = strlen(s); r = l / k; if (l % k != 0) { cout << NO << endl; return 0; } for (i = 0; i < l; i += r) for (j = 0; j < r / 2; j++) { if (s[i + j] != s[i + r - j - 1]) { cout << NO << endl; return 0; } } cout << YES << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long a[51], us[51]; int main() { long long t, n; cin >> t; while (t--) { cin >> n; for (long long i = 1; i <= n; ++i) cout << i << ; cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; template <class c> struct rge { c b, e; }; template <class c> rge<c> range(c i, c j) { return rge<c>{i, j}; } template <class c> auto dud(c* x) -> decltype(cerr << *x, 0); template <class c> char dud(...); struct debug { template <class c> debug& operator<<(const c&) { return *this; } }; int main() { int n, k, m; scanf( %d%d%d , &n, &k, &m); int interior = 0; vector<pair<int, int>> t; for (int i = 0; i < n; ++i) { int x; scanf( %d , &x); if (t.empty() || t.back().first != x) t.push_back({x, 1}); else { t.back().second++; if (t.back().second == k) { t.pop_back(); ++interior; } } } vector<pair<int, int>> memo = t; int border = 0; int start = 0; while ((int)t.size() - start >= 2 && t[start].first == t.back().first && t[start].second + t.back().second >= k) { int tmp = t[start].second + t.back().second; border += tmp / k; tmp -= tmp / k * k; if (tmp == 0) { ++start; t.pop_back(); } else { t.pop_back(); t[start].second = tmp; } } debug() << [ << interior : << (interior) << ] [ << border : << (border) << ] ; long long answer = (long long)interior * m * k + (long long)border * (m - 1) * k; if ((int)t.size() == start + 1) { long long a = (long long)m * t[start].second; answer += a / k * k; a -= a / k * k; if (a == 0) { debug() << spec case ; vector<pair<int, int>> nowy; for (int i = 0; i < start; ++i) nowy.push_back(memo[i]); for (int i = (int)t.size(); i < (int)memo.size(); ++i) nowy.push_back(memo[i]); debug() << [ << nowy : << (nowy) << ] ; vector<pair<int, int>> dwa; for (pair<int, int> p : nowy) { if (dwa.empty() || dwa.back().first != p.first) dwa.push_back(p); else { dwa.back().second += p.second; answer += dwa.back().second / k * k; dwa.back().second %= k; if (dwa.back().second == 0) dwa.pop_back(); } } } } printf( %lld n , (long long)n * m - answer); } |
#include <bits/stdc++.h> using namespace std; long long int invmod(long long int x, long long int n, long long int mod) { if (n == 0) return 1 % mod; long long int half = invmod(x, n / 2, mod); half = (half * half) % mod; if (n % 2 == 1) half = (half * (x % mod)) % mod; return half; } long long int bin(long long int a[], long long int l, long long int r, long long int x) { if (l <= r) { long long int m = l + (r - l) / 2; if (a[m] == x) return m; else if (a[m] > x) return bin(a, l, m - 1, x); else return bin(a, m + 1, r, x); } else return -1; } long long int power(long long int b, long long int e, long long int m) { if (e == 0) return 1; if (e % 2) return b * power(b * b % m, (e - 1) / 2, m) % m; else return power(b * b % m, e / 2, m); } long long int power(long long int b, long long int e) { if (e == 0) return 1; if (e % 2) return b * power(b * b, (e - 1) / 2); else return power(b * b, e / 2); } long long int ncr(long long int n, long long int r, long long int x) { if (r == 0) return 1; long long int fac[n + 1]; fac[0] = 1; for (long long int i = 1; i <= n; i++) fac[i] = fac[i - 1] * i % x; return (fac[n] * power(fac[r], x - 2, x) % x * power(fac[n - r], x - 2, x) % x) % x; } long long int ncr(long long int n, long long int p) { long long int r = min(p, n - p), rf = 1, ln = 1; for (long long int i = 1; i <= r; i++) rf = rf * i; for (long long int i = 0; i < r; i++) ln = ln * (n - i); return ln / rf; } bool sbs(pair<long long int, long long int> &a, pair<long long int, long long int> &b) { return (a.second < b.second); } bool sbds(pair<long long int, long long int> &a, pair<long long int, long long int> &b) { return (a.second > b.second); } long long int SUM(long long int a[], long long int n) { long long int sum = 0; for (long long int i = 0; i < n; i++) sum += a[i]; return sum; } long long int chkprm(long long int n) { for (long long int i = 2; i <= sqrt(n); i++) if (n % i == 0) return 0; return 1; } long long int dp[2005][2005]; long long int solve(long long int a[], long long int l1, long long int r1, long long int h, long long int l, long long int r, long long int t) { if (l1 == r1) { if (((t + a[l1]) % h) >= l && ((t + a[l1]) % h) <= r) return 1; if (((t + a[l1] - 1) % h) >= l && ((t + a[l1] - 1) % h) <= r) return 1; return 0; } if (dp[l1][t] != -1) return dp[l1][t]; long long int x1 = 0, x2 = 0; if (((t + a[l1]) % h) >= l && ((t + a[l1]) % h) <= r) x1++; if (((t + a[l1] - 1) % h) >= l && ((t + a[l1] - 1) % h) <= r) x2++; dp[l1][t] = max(x1 + solve(a, l1 + 1, r1, h, l, r, (t + a[l1]) % h), x2 + solve(a, l1 + 1, r1, h, l, r, (t + a[l1] - 1) % h)); return dp[l1][t]; } void myth() { long long int n, h, l, r; cin >> n >> h >> l >> r; long long int a[n]; for (long long int xxx = 0; xxx < n; xxx++) cin >> a[xxx]; memset(dp, -1, sizeof(dp)); cout << solve(a, 0, n - 1, h, l, r, 0); } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long int test_case = 1; while (test_case--) { myth(); cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; void debug_out() { cerr << endl; } void clock_out() { cerr << nTime Elapsed : << 1.0 * clock() / CLOCKS_PER_SEC << s n ; } void fileio() { freopen( /home/dwai/Desktop/cp/input.txt , r , stdin); freopen( /home/dwai/Desktop/cp/output.txt , w , stdout); freopen( /home/dwai/Desktop/cp/debug.txt , w , stderr); } void ofileio() { freopen( input.txt , r , stdin); freopen( output.txt , w , stdout); } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << << H; debug_out(T...); } int IT_MAX = 1 << 20; const long long MOD = 1000000007; const int INF = 0x3f3f3f3f; const long long LL_INF = 0x3f3f3f3f3f3f3f3f; const double PI = acos(-1); const double ERR = 1e-10; void solve() { long long n, sx, sy; cin >> n >> sx >> sy; vector<pair<long long, long long> > v(n); long long i; long long d[n]; for (i = 0; i < n; i++) { cin >> v[i].first >> v[i].second; d[i] = abs(v[i].first - sx) + abs(v[i].second - sy); } pair<long long, long long> p; long long m = 0; vector<pair<long long, long long> > pos({{0, 1}, {0, -1}, {1, 0}, {-1, 0}}); for (pair<long long, long long> cord : pos) { long long cx = cord.first + sx, cy = cord.second + sy; long long cm = 0; i = 0; for (pair<long long, long long> x : v) { long long cd = abs(cx - x.first) + abs(cy - x.second); if (cd < d[i]) cm++; i++; } if (cm > m) { m = cm; p = make_pair(cx, cy); } } cout << m << n << p.first << << p.second; } int main() { 42; ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); srand(time(NULL)); long long t = 1; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, fp = 0; cin >> n; vector<int> p(n); bool nice = false; bool entrou = false; for (int i = 0; i < n; i++) { cin >> p[i]; if (i == p[i]) fp = fp + 1; } for (int i = 0; i < n; i++) { if (p[i] != i) { entrou = true; if (p[p[i]] == i) { fp = fp + 2; nice = true; break; } } } if (!nice && entrou) { fp = fp + 1; } cout << fp << endl; } |
#include <bits/stdc++.h> using namespace std; struct disjoint_set { vector<int> p; disjoint_set(int n) : p(n, -1) {} bool share(int a, int b) { return root(a) == root(b); } int sz(int u) { return -p[root(u)]; } int root(int u) { return p[u] < 0 ? u : p[u] = root(p[u]); } bool merge(int u, int v) { u = root(u), v = root(v); if (u == v) return false; if (p[u] > p[v]) swap(u, v); p[u] += p[v], p[v] = u; return true; } }; template <class T> struct graph { struct edge { int from, to; T cost; }; int n; vector<edge> edges; vector<vector<int>> adj; function<bool(int)> ignore; graph(int n) : n(n), adj(n), ignore(nullptr) {} int link(int u, int v, T w = 1) { int id = (int)edges.size(); adj[u].push_back(id), adj[v].push_back(id), edges.push_back({u, v, w}); return id; } int orient(int u, int v, T w = 1) { int id = (int)edges.size(); adj[u].push_back(id), edges.push_back({u, v, w}); return id; } graph reversed() const { graph res(n); for (auto &e : edges) { res.orient(e.to, e.from, e.cost); } return res; } }; template <class T, class U> T &ctmax(T &x, const U &y) { return x = max<T>(x, y); } template <class T, class U> T &ctmin(T &x, const U &y) { return x = min<T>(x, y); } int main() { cin.tie(0)->sync_with_stdio(0); cin.exceptions(ios::badbit | ios::failbit); int n, m; cin >> n >> m; disjoint_set dsu(n << 1); graph<int> g(n); for (auto i = 0; i < m; ++i) { int u, v; cin >> u >> v, --u, --v; dsu.merge(u, v + n), dsu.merge(v, u + n); if (dsu.share(u, u + n)) { cout << -1 n ; return 0; } g.link(u, v); } int res = 0; vector<int> dist(n, -1), vis(n); for (auto s = 0; s < n; ++s) { if (!vis[s]) { vector<int> cur; function<void(int)> dfs = [&](int u) { vis[u] = true; cur.push_back(u); for (auto id : g.adj[u]) { auto &e = g.edges[id]; int v = u ^ e.from ^ e.to; if (!vis[v]) { dfs(v); } } }; dfs(s); auto get_max_dist = [&](int s) { for (auto u : cur) { dist[u] = -1; } deque<int> dq{s}; dist[s] = 0; int res = 0; while (!dq.empty()) { int u = dq.front(); dq.pop_front(); for (auto id : g.adj[u]) { auto &e = g.edges[id]; int v = u ^ e.from ^ e.to; if (!~dist[v]) { dq.push_back(v); res = dist[v] = dist[u] + 1; } } } return res; }; int cur_max = 0; for (auto s : cur) { ctmax(cur_max, get_max_dist(s)); } res += cur_max; } } cout << res << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 101000; int n, m, k[N], g[50][50], cnt[50], tmp[50]; vector<pair<int, int> > v[N]; inline int gcd(int first, int second) { return (!second) ? first : gcd(second, first % second); } inline void init() { int i, j; for (i = 1; i <= 40; ++i) for (j = 1; j <= 40; ++j) g[i][j] = gcd(i, j); } inline bool insert(pair<int, int> p) { int i; for (i = 1; i <= 40; ++i) if (cnt[i] && (p.second - tmp[i]) % g[k[p.first]][i]) return 0; return tmp[k[p.first]] = p.second, ++cnt[k[p.first]], 1; } inline void erase(pair<int, int> p) { --cnt[k[p.first]]; if (!cnt[k[p.first]]) tmp[k[p.first]] = 0; } inline void solve(int first) { int i = 0, j = 0, ans = 0, t = 0; memset(cnt, 0, sizeof(cnt)); while (j < v[first].size()) { while (j < v[first].size() && j - i == v[first][j].first - v[first][i].first && insert(v[first][j])) ++j; ans = max(ans, j - i); erase(v[first][i]), ++i; } cout << ans << endl; } int main() { ios ::sync_with_stdio(false); int i, j, first; init(); cin >> n >> m; for (i = 1; i <= n; ++i) { cin >> k[i]; for (j = 1; j <= k[i]; ++j) cin >> first, v[first].push_back(make_pair(i, j)); } for (i = 1; i <= m; ++i) solve(i); return 0; } |
#include <bits/stdc++.h> using namespace std; void moveLeft() { cout << LEFT << endl; } void moveRight() { cout << RIGHT << endl; } void print(char ch) { cout << PRINT << ch << endl; } int main() { int numberOfCells, currentCell; cin >> numberOfCells >> currentCell; string slogan; cin >> slogan; if (currentCell <= numberOfCells - currentCell) { while (currentCell != 1) { moveLeft(); currentCell--; } while (currentCell <= numberOfCells) { print(slogan[currentCell - 1]); if (currentCell == numberOfCells) { break; } moveRight(); currentCell++; } } else { while (currentCell != numberOfCells) { moveRight(); currentCell++; } while (currentCell >= 1) { print(slogan[currentCell - 1]); if (currentCell == 1) { break; } moveLeft(); currentCell--; } } } |
#include <bits/stdc++.h> using namespace std; const int MaxN = int(2e5); const long double pi = 3.1415926535897932384626433832795; char s[MaxN]; int main() { while (gets(s)) { int len = strlen(s); int l = 0; while (s[l] == 32) ++l; int r = len - 1; while (s[r] == 32) --r; if (l > r) { puts( ); continue; } bool space = false; bool znak = false; for (int i = l; i <= r; i++) { if (isalpha(s[i])) { if (space && !znak) printf( %c , s[i]); else printf( %c , s[i]); znak = false; space = false; } if (s[i] == . || s[i] == , || s[i] == ! || s[i] == ? ) printf( %c , s[i]), znak = true; if (s[i] == 32) space = true; } puts( ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long int mxn = 1e5 + 5; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int t = 1; while (t--) { long long int i, j, k, n, m; cin >> n; map<long long int, long long int> mp, diff; for (i = 0; i < n; i++) { cin >> k; if (mp.find(k) == mp.end()) mp[k] = i, diff[k] = 0; else if (diff[k] == 0 || i - mp[k] == diff[k]) { if (diff[k] == 0) diff[k] = i - mp[k]; mp[k] = i; } else diff[k] = -1; } set<pair<long long int, long long int> > ans; for (auto i : diff) if (i.second != -1) ans.insert(make_pair(i.first, i.second)); cout << ans.size() << n ; for (auto i : ans) cout << i.first << << i.second << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int SIZE = 401; const int MOD = 1000000007; struct matr { long long a[8][8]; }; matr d, f, e; int n; void make() { for (int i = 0; i < 8; i++) for (int j = 0; j < 8; j++) f.a[i][j] = d.a[i][j] = e.a[i][j] = 0; d.a[0][1] = 1; d.a[0][4] = 1; d.a[1][0] = 1; d.a[2][3] = 1; d.a[2][6] = 1; d.a[3][2] = 1; d.a[4][5] = 1; d.a[4][7] = 1; d.a[5][1] = 1; d.a[5][4] = 1; d.a[6][5] = 1; d.a[6][7] = 1; d.a[7][3] = 1; d.a[7][6] = 1; for (int i = 0; i < 8; i++) f.a[0][i] = e.a[i][i] = 1; } void print(matr a) { for (int i = 0; i < 8; i++) { for (int j = 0; j < 8; j++) cout << a.a[i][j] << ; cout << endl; } } matr mul(matr a, matr b) { matr c; for (int i = 0; i < 8; i++) for (int j = 0; j < 8; j++) { c.a[i][j] = 0; for (int z = 0; z < 8; z++) { c.a[i][j] += a.a[i][z] * b.a[z][j]; if (c.a[i][j] >= MOD) c.a[i][j] %= MOD; } } return c; } matr sum(matr a, matr b) { matr c; for (int i = 0; i < 8; i++) for (int j = 0; j < 8; j++) c.a[i][j] = (a.a[i][j] + b.a[i][j]) % MOD; return c; } matr sqr(matr a) { return mul(a, a); } matr pow_(matr p, int n) { if (n <= 1) return p; if (n % 2 == 0) return sqr(pow_(p, n / 2)); return mul(p, sqr(pow_(p, n / 2))); } long long sum(matr a) { long long ans = 0; for (int i = 0; i < 8; i++) ans += a.a[0][i]; return ans; } long long solve_palin(int n) { if (n == 1) return 4; if (n == 2) return 4; return sum(mul(f, pow_(d, n - 2))); } long long solve_one(int n) { if (n == 1) return 4; if (n == 2) return 4; if (n % 2 == 0) return solve_palin(n) / 2; return solve_palin(n) / 2 + solve_palin((n + 1) / 2); } matr clear(matr a) { for (int i = 0; i < 8; i++) for (int j = 0; j < 8; j++) a.a[i][j] = 0; return a; } int log_(int n) { int l = 0; while ((1 << l) <= n) l++; return l - 1; } int log_less(int n) { int l = 0; while ((1 << l) - 1 < n) l++; return l - 1; } int step_2(int n) { return (1 << n); } matr magic_func(int n) { if (n == 0) return e; if (n == 1) return sum(d, e); matr ans; ans = clear(ans); int w = log_less(n); ans = sum(d, e); for (int i = 1; i < w; i++) ans = mul(ans, sum(pow_(d, step_2(i)), e)); return sum(ans, mul(pow_(d, step_2(w)), magic_func(n - step_2(w)))); } long long solve(int n) { if (n == 1) return 4; matr ans; ans = clear(ans); n -= 2; ans = magic_func(n); return sum(mul(f, ans)) + 4; } long long real_ans(int n) { return solve(n) / 2 + solve((n + 1) / 2) / 2; } int l, r; int main() { cin >> l >> r; make(); if (r == 1) { cout << 4; return 0; } if (l == r) { cout << solve_one(l) % MOD; return 0; } long long razn = 0; if (l == 1) { razn = 4; l++; } cout << ((real_ans(r) - real_ans(l - 1) + razn) % MOD + MOD) % MOD; return 0; } |
#include <bits/stdc++.h> using namespace std; vector<pair<int, pair<int, int> > > v; int x; int gcd(int a, int b) { if (b == 0) return a; return gcd(b, a % b); } int arr[500001]; int tree[500001 * 5]; void init(int node, int b, int e) { if (b == e) { tree[node] = arr[b]; return; } int Left = node * 2; int Right = Left + 1; int mid = (b + e) / 2; init(Left, b, mid); init(Right, mid + 1, e); tree[node] = gcd(tree[Left], tree[Right]); } void query(int node, int b, int e, int i, int j) { if (i > e || j < b) return; if (b >= i && e <= j) { if (tree[node] % x != 0) v.push_back(make_pair(node, make_pair(b, e))); return; } int Left = node * 2; int Right = Left + 1; int mid = (b + e) / 2; query(Left, b, mid, i, j); query(Right, mid + 1, e, i, j); } void update(int node, int b, int e, int i, int newvalue) { if (i > e || i < b) return; if (b >= i && e <= i) { tree[node] = newvalue; return; } int Left = node * 2; int Right = Left + 1; int mid = (b + e) / 2; if (i <= mid) update(Left, b, mid, i, newvalue); else update(Right, mid + 1, e, i, newvalue); tree[node] = gcd(tree[Left], tree[Right]); } int rquery(int node, int b, int e) { if (b == e) { if (tree[node] % x == 0) return 0; return 1; } int Left = node * 2; int Right = Left + 1; int mid = (b + e) / 2; if (tree[Left] % x != 0 && tree[Right] % x != 0) return 2; else if (tree[Left] % x != 0) return rquery(Left, b, mid); else return rquery(Right, mid + 1, e); } int main() { int n; scanf( %d , &n); int i; for (i = 1; i <= n; i++) scanf( %d , &arr[i]); int q; scanf( %d , &q); int t, l, r; init(1, 1, n); int ans; while (q--) { v.clear(); scanf( %d , &t); if (t == 1) { scanf( %d%d%d , &l, &r, &x); query(1, 1, n, l, r); if (v.size() < 2) { if (v.size() == 1) { ans = rquery(v[0].first, v[0].second.first, v[0].second.second); if (ans < 2) cout << YES << endl; else cout << NO << endl; } else cout << YES << endl; } else cout << NO << endl; } else { scanf( %d%d , &l, &r); update(1, 1, n, l, r); } } return 0; } |
#include <bits/stdc++.h> template <class T> inline void read(T &x) { x = 0; register char c = getchar(); register bool f = 0; while (!isdigit(c)) f ^= c == - , c = getchar(); while (isdigit(c)) x = x * 10 + c - 0 , c = getchar(); if (f) x = -x; } template <class T> inline void print(T x) { if (x < 0) putchar( - ), x = -x; if (x > 9) print(x / 10); putchar(x % 10 + 0 ); } template <class T> inline void print(T x, char c) { print(x), putchar(c); } const int N = 2e5 + 10; int T, n, m, q, cur, max, lst, a[N], b[N]; long long ans; std::set<int> set[N]; struct edge { int l, r, x; inline bool operator<(const edge &other) const { return l < other.l; } } e[N]; signed main() { read(n), read(q); for (int i = 1; i <= n; i++) read(a[i]), b[++m] = a[i]; std::sort(b + 1, b + n + 1), m = std::unique(b + 1, b + n + 1) - b - 1; for (int i = 1; i <= n; i++) { a[i] = std::lower_bound(b + 1, b + m + 1, a[i]) - b; set[a[i]].insert(i); } for (int i = 1; i <= m; i++) { e[i].l = *set[i].begin(); e[i].r = *--set[i].end(); e[i].x = set[i].size(); } std::sort(e + 1, e + m + 1); if (!q) { lst = 0, cur = 0; for (int i = 1; i <= m; i++) { cur = std::max(cur, e[i].r); if (i == m || e[i + 1].l > cur) { max = 0; for (int j = lst + 1; j <= i; j++) { max = std::max(max, e[j].x); ans += e[j].x; } ans -= max; lst = i, cur = 0; } } print(ans, n ); } } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); string s; cin >> s; int br = 0; for (int i = 0; i < s.size() / 2; i++) { if (s[i] == s[s.size() - i - 1]) continue; br++; } if (br >= 2 || br == 0) { if (s.size() % 2 == 1 && br == 0) { cout << YES ; return 0; } cout << NO << endl; } else { cout << YES << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int A[10010]; int B[10010]; bool check(int st, int ed) { int mx = st; for (int i = st; i <= ed; i++) { if (A[i] > A[mx]) { mx = i; } if (A[i] == A[mx]) { if (st <= i - 1 && A[i - 1] < A[i]) mx = i; if (i + 1 <= ed && A[i + 1] < A[i]) mx = i; } } bool can = false; if (st <= mx - 1 && A[mx - 1] < A[mx]) can = true; if (mx + 1 <= ed && A[mx + 1] < A[mx]) can = true; return can || (st == ed); } void consume(int st, int ed) { int mx = st; for (int i = st; i <= ed; i++) { if (A[i] > A[mx]) { mx = i; } if (A[i] == A[mx]) { if (st <= i - 1 && A[i - 1] < A[i]) mx = i; if (i + 1 <= ed && A[i + 1] < A[i]) mx = i; } } if (mx + 1 <= ed && A[mx + 1] < A[mx]) { for (int i = mx + 1; i <= ed; i++) { printf( %d R n , mx + 1); } for (int j = mx - 1; j >= st; j--) { printf( %d L n , j + 1 + 1); } } else if (st <= mx - 1 && A[mx - 1] < A[mx]) { for (int j = mx - 1; j >= st; j--) { printf( %d L n , j + 1 + 1); } for (int i = mx + 1; i <= ed; i++) { printf( %d R n , st + 1); } } } int main() { for (;;) { int N; if (scanf( %d , &N) == EOF) break; for (int i = 0; i < N; i++) { scanf( %d , &A[i]); } int M; scanf( %d , &M); for (int i = 0; i < M; i++) { scanf( %d , &B[i]); } int j = 0; int sum = 0; bool possible = true; vector<int> part; part.push_back(-1); for (int i = 0; i < N; i++) { sum += A[i]; if (j < M && sum == B[j]) { possible &= check(part.back() + 1, i); part.push_back(i); if (!possible) break; sum = 0; j += 1; } } if (sum > 0 || j < M) possible = false; if (possible) { printf( YES n ); for (int i = part.size() - 2; i >= 0; i--) { consume(part[i] + 1, part[i + 1]); } } else { printf( NO n ); } } } |
#include <bits/stdc++.h> using namespace std; string s[505]; int n, par[505][505], a[505 * 505] = {0}, v[505 * 505] = {0}, p[505 * 505]; bool b[505 * 505] = {0}; int dfs(int x, int y, int k) { par[x][y] = k; int ret = 1; if (x > 0 && par[x - 1][y] == -1 && s[x - 1][y] == . ) ret += dfs(x - 1, y, k); if (x + 1 < n && par[x + 1][y] == -1 && s[x + 1][y] == . ) ret += dfs(x + 1, y, k); if (y > 0 && par[x][y - 1] == -1 && s[x][y - 1] == . ) ret += dfs(x, y - 1, k); if (y + 1 < n && par[x][y + 1] == -1 && s[x][y + 1] == . ) ret += dfs(x, y + 1, k); return ret; } void reset(int bx, int ex, int by, int ey) { int i, j; for (i = bx; i <= ex; i++) { for (j = by; j <= ey; j++) b[par[i][j]] = 0; } } int get_sum(int bx, int ex, int by, int ey) { int i, j, ret = 0, u; for (i = bx; i <= ex; i++) { for (j = by; j <= ey; j++) { if (s[i][j] == X ) continue; u = par[i][j]; if (v[u] == 0 && b[u] == 0) ret += a[u]; b[u] = 1; } } return ret; } int main() { std::ios_base::sync_with_stdio(0); int cases, caseno = 0, i, j, k, t, u, mx, sum, temp, sz = 0; cin >> n >> k; for (i = 0; i <= n - 1; i++) cin >> s[i]; memset(par, -1, sizeof(par)); for (i = 0; i <= n - 1; i++) { for (j = 0; j <= n - 1; j++) { if (s[i][j] == X ) { par[i][j] = sz; a[sz++] = 1; } else if (par[i][j] == -1) { a[sz] = dfs(i, j, sz); sz++; } } } mx = 0; for (i = 0; i <= n - k; i++) { sum = 0; memset(v, 0, sizeof(v)); for (t = i; t <= i + k - 1; t++) { for (j = 0; j <= k - 1; j++) { v[par[t][j]]++; if (v[par[t][j]] == 1) sum += a[par[t][j]]; } } for (j = 0; j <= n - k; j++) { temp = 0; if (j > 0) { for (t = i; t <= i + k - 1; t++) { u = par[t][j - 1]; v[u]--; if (v[u] == 0) sum -= a[u]; } for (t = i; t <= i + k - 1; t++) { u = par[t][j + k - 1]; v[u]++; if (v[u] == 1) sum += a[u]; } } if (i > 0) reset(i - 1, i - 1, j, j + k - 1); if (i + k < n) reset(i + k, i + k, j, j + k - 1); if (j > 0) reset(i, i + k - 1, j - 1, j - 1); if (j + k < n) reset(i, i + k - 1, j + k, j + k); if (i > 0) temp += get_sum(i - 1, i - 1, j, j + k - 1); if (i + k < n) temp += get_sum(i + k, i + k, j, j + k - 1); if (j > 0) temp += get_sum(i, i + k - 1, j - 1, j - 1); if (j + k < n) temp += get_sum(i, i + k - 1, j + k, j + k); mx = max(mx, sum + temp); } } cout << mx << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long a[16], d[40000], vis[40000]; int main() { ios::sync_with_stdio(0); int n, x, i, j, k, l0, m, m0, m1, c; long long l, r, v, ans = 0; cin >> n >> l >> r >> x; for (i = 1; i <= n; i++) cin >> a[i]; sort(a + 1, a + n + 1); for (i = 1, m = 1; i <= n; i++) { m0 = m; for (j = 0; j < m0; j++, m++) { m1 = m; c = 1; while (!(m1 & 1)) c++, m1 = m1 >> 1; d[m] = a[i] + d[j]; if (j && a[i] - a[c] >= x) vis[m] = 1; if (vis[m] && d[m] >= l && d[m] <= r) ans++; } } cout << ans; } |
#include <bits/stdc++.h> using namespace std; template <typename T> inline int read(T &a) { a = 0; char c = getchar(), f = 1; while (c > 9 || c < 0 ) { if (c == - ) f = (~f) + 1; if (c == -1) return -1; c = getchar(); } while (c <= 9 && c >= 0 ) a = (a << 1) + (a << 3) + (c ^ 48), c = getchar(); a *= f; return 1; } template <typename T> inline int write(T a) { if (a < 0) putchar( - ), a = (~a) + 1; if (a / 10) return write(a / 10) & putchar(a % 10 | 48); return putchar(a | 48); } template <typename T> inline int write(T a, char c) { return write(a) + putchar(c); } int n, m; int w[200001]; int x[200001], y[200001]; int need[200001]; bool used[200001]; vector<int> v[200001]; bool ok[200001]; queue<int> q; int ans[200001], cnt; int main() { read(n), read(m); for (int i = 1; i <= n; i++) read(w[i]); for (int i = 1; i <= m; i++) { read(x[i]), read(y[i]), need[x[i]]++, need[y[i]]++; v[x[i]].push_back(i); v[y[i]].push_back(i); } for (int i = 1; i <= n; i++) if (need[i] <= w[i]) { used[i] = 1; for (auto j : v[i]) if (!ok[j]) { ok[j] = 1; q.push(j); } } while (!q.empty()) { int t = q.front(); q.pop(); ans[++cnt] = t; need[x[t]]--, need[y[t]]--; int i = y[t]; if (need[i] <= w[i] && !used[i]) { used[i] = 1; for (auto j : v[i]) if (!ok[j]) { ok[j] = 1; q.push(j); } } i = x[t]; if (need[i] <= w[i] && !used[i]) { used[i] = 1; for (auto j : v[i]) if (!ok[j]) { ok[j] = 1; q.push(j); } } } if (cnt != m) return puts( DEAD ) & 0; puts( ALIVE ); for (int i = cnt; i >= 1; i--) write(ans[i], ); puts( ); } |
#include <bits/stdc++.h> using namespace std; int main() { string s; int i, j, n, k, imp, c, h; int f[200]; { imp = 0; memset(f, 0, sizeof(f)); cin >> k; cin >> s; n = ((int)s.size()); h = n % 2 + n / 2; for (i = 0; i < n; i++) if (isalpha(s[i])) f[s[i] - a ]++; for (i = h - 1; i > -1; i--) { if (s[i] != s[n - i - 1]) { if (isalpha(s[i]) && isalpha(s[n - i - 1])) { imp = 1; break; } else if (isalpha(s[i])) s[n - i - 1] = s[i]; else s[i] = s[n - i - 1]; } else if (s[i] == ? ) { c = 0; for (j = k - 1; j > -1; j--) if (f[j] == 0) { c = j; f[j]++; break; } s[i] = s[n - i - 1] = a + c; } } if (imp == 0) { for (i = 0; i < k; i++) if (!f[i]) { imp = 1; break; } } if (!imp) cout << s << endl; else cout << IMPOSSIBLE << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int N = 1e6 + 5; int n, cnt[3], dp[N], sum = 1; int add(int x, int y) { return (1ll * x + 1ll * y) % mod; } int mul(int x, int y) { return (1ll * x * 1ll * y) % mod; } int del(int x, int y) { return ((1ll * x - 1ll * y) % mod + mod) % mod; } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { int x; scanf( %d , &x); cnt[x]++; } dp[0] = 1; dp[1] = 1; for (int i = 2; i <= cnt[1]; i++) dp[i] = add(dp[i - 1], mul(dp[i - 2], i - 1)); for (int i = 1; i <= cnt[2]; i++) sum = mul(sum, cnt[1] + i); printf( %d , mul(sum, dp[cnt[1]])); } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 7; pair<long long, long long> a[N]; long long top, k, n, avr, mx; int main() { scanf( %d %d %d , &n, &mx, &avr); for (int i = 1; i <= n; i++) { int b, r; scanf( %d %d , &b, &r); a[i] = make_pair(r, b); top += b; } sort(a + 1, a + 1 + n); long long tmp = 0, i = 1; while (top < avr * n) { long long t = min(avr * n - top, mx - a[i].second); top += t; tmp += t * a[i].first; i++; } cout << tmp << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; char ch[55][55]; int main() { int n, m; cin >> n >> m; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) cin >> ch[i][j]; int ret = 0; for (int i = 0; i < n - 1; i++) for (int j = 0; j < m - 1; j++) { bool f = 0, a = 0, c = 0, e = 0; for (int h = i; h < i + 2; h++) for (int k = j; k < j + 2; k++) if (ch[h][k] == f ) f = 1; else if (ch[h][k] == a ) a = 1; else if (ch[h][k] == c ) c = 1; else if (ch[h][k] == e ) e = 1; if (f && a && c && e) ret++; } cout << ret << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { string s; cin >> s; if (s.size() == 1) { if (s[0] == ? ) printf( a n ); else cout << s << n ; } else { int f = 0; for (int i = 0; i < s.size(); i++) { if (s[i] == s[i + 1] && s[i] != ? ) { f = 1; break; } } if (f == 1) printf( -1 n ); else { char ch = a ; for (int i = 0; i < s.size() - 1; i++) { if (s[i] == ? && i == 0) { for (char c = a ; c <= c ; c++) { if (s[i + 1] != c) { s[i] = c; break; } } } else if (s[i] == ? ) { for (char c = a ; c <= c ; c++) { if (s[i + 1] != c && s[i - 1] != c) { s[i] = c; break; } } } } if (s[s.size() - 1] == ? ) { for (char c = a ; c <= c ; c++) { if (s[s.size() - 2] != c) { s[s.size() - 1] = c; break; } } } cout << s << n ; } } } } |
#include <bits/stdc++.h> using namespace std; unsigned long long tcc, n, m; int main() { scanf( %lld , &tcc); while (tcc--) { scanf( %lld %lld , &n, &m); unsigned long long sum = 0, m2 = m, t = 10; while (t-- && m2 <= n) { sum += m2 % 10; m2 += m; } m2 = m * 10; t = n / m2; sum *= t; n -= m2 * t; m2 = m; while (m2 <= n) { sum += m2 % 10; m2 += m; } printf( %lld n , sum); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; const long long SIZE = 100000; const int INF = 0x3f3f3f3f; const long long ll_INF = 0x3f3f3f3f3f3f3f3f; const long double PI = acos(-1); const long long MAXN = numeric_limits<long long>::max(); const long long MAX = 2000000; void solve() { string s; long long k, i = 1; cin >> k; while (((int)(s).size()) < k) { s += to_string(i); i++; } cout << s[k - 1]; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; long long x[100002]; vector<int> P[2 * 100002]; void NoSol() { printf( No n ); exit(0); } long long sqr(int x) { return 1LL * x * x; } int bs(int x, long long val) { int i = -1, sz = P[x].size(), p = 1; while (p < sz) p <<= 1; while (p) { if (i + p < sz && sqr(P[x][i + p]) <= val) i += p; p >>= 1; } return i + 1; } int main() { int n; long long Xmax = 0; scanf( %d , &n); for (int i = 0; i < n / 2; ++i) { scanf( %lld , &x[i * 2 + 1]); Xmax = max(Xmax, x[i * 2 + 1]); if (x[i * 2 + 1] % 4 == 2) NoSol(); } long long s = 0; for (int a = 1; a < Xmax; ++a) for (int b = a + 1; sqr(b) - sqr(a) <= Xmax; ++b) P[sqr(b) - sqr(a)].push_back(a); long long sum = 0; for (int i = 0; i < n / 2; ++i) { long long X = x[i * 2 + 1]; if (P[X].empty()) NoSol(); if (sqr(P[X].back()) <= sum) NoSol(); x[i * 2] = sqr(P[X][bs(X, sum)]) - sum; sum = sum + x[i * 2] + X; } printf( Yes n ); s = 0; for (int i = 0; i < n; ++i) { printf( %lld , x[i]); s += x[i]; long long r = sqrt(s); if (r * r != s) while (1) ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, k, m, a[100100], sum = 0; priority_queue<pair<long long, long long>, vector<pair<long long, long long> >, greater<pair<long long, long long> > > pq; cin >> n >> k; for (int i = 1; i <= n; i++) { cin >> a[i]; sum += a[i]; pq.push(make_pair(a[i], i)); } if (sum < k) { cout << -1 << endl; return 0; } long long last = 0; while (!pq.empty()) { long long x = pq.top().first; if ((x - last) * pq.size() <= k) { k -= (x - last) * pq.size(); last = x; while (!pq.empty()) { if (pq.top().first == x) pq.pop(); else break; } } else break; } long long temp = pq.size(); if (temp == 0) return 0; m = k % temp; long long o = k / temp; for (int i = 1; i <= n; i++) a[i] -= (last + o); deque<long long> dq; m = k % temp; for (int i = 1; i <= n; i++) { if (a[i] > 0) dq.push_back(i); } for (int i = 0; i < m; i++) { if (dq.empty()) return 0; long long x = dq.front(); dq.pop_front(); if (a[x] > 0) dq.push_back(x); a[x]--; } while (!dq.empty()) { if (a[dq.front()] > 0) cout << dq.front() << ; dq.pop_front(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, p, q; unsigned int C[132]; int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } int a[132]; void Init() { C[0] = 1; for (int i = 1; i <= min(p, n - 1); ++i) { a[0] = 0; for (int j = 0; j < i; ++j) a[++a[0]] = n - j; for (int k = 1; k <= i; ++k) { int x = k; for (int j = 1; j <= a[0] && k != 1; ++j) { int Gcd = gcd(x, a[j]); a[j] /= Gcd, x /= Gcd; } } C[i] = 1; for (int j = 1; j <= a[0]; ++j) C[i] = C[i] * a[j]; } } int main() { scanf( %d%d%d , &n, &p, &q), Init(); unsigned int ans = 0; for (int i = 1; i <= q; ++i) { unsigned int tmp = 0, now = 1; for (int j = 0; j <= min(p, n - 1); ++j, now = now * i) tmp += C[j] * now; ans ^= tmp * i; } printf( %u n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> T sgn(T x) { return x < 0 ? -1 : x != 0; } template <typename T> T gcd(T a, T b) { return a ? gcd(b % a, a) : b; } void reads(string& x) { char kk[((long long)5e2 + 123)]; scanf( %s , kk); x = kk; } long long n, m, ans; long long v, r[((long long)5e2 + 123)], c[((long long)5e2 + 123)]; long long lp[(long long)1e6 + 1]; vector<long long> pr; void sieve() { for (long long i = 2; i <= 1e6; ++i) { if (lp[i] == 0) { lp[i] = i; pr.push_back(i); } for (long long j = 0; j < (long long)pr.size() && pr[j] <= lp[i] && i * pr[j] <= 1e6; ++j) lp[i * pr[j]] = pr[j]; } } void solve() { sieve(); scanf( %lld %lld , &n, &m); for (long long i = 0; i < n; i++) for (long long j = 0; j < m; j++) { scanf( %lld , &v); v = (*lower_bound(pr.begin(), pr.end(), v) - v); r[i] += v; c[j] += v; } ans = 1e9; for (long long i = 0; i < n; i++) ans = min(ans, r[i]); for (long long i = 0; i < m; i++) ans = min(ans, c[i]); printf( %lld n , ans); } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long t = 1; while (t--) solve(); } |
#include <bits/stdc++.h> using namespace std; vector<int> v[100005]; bool d[100005]; int s[100005]; void del(int i, int par) { if (v[i].size() <= 2) { d[i] = true; for (int j : v[i]) if (j != par) del(j, i); } } int main() { int n; cin >> n; int a, b; for (int i = 1; i < n; i++) { cin >> a >> b; v[a].push_back(b); v[b].push_back(a); } for (int i = 1; i <= n; i++) { if (v[i].size() == 1) del(i, 0); } for (int i = 1; i <= n; i++) { for (int j : v[i]) if (d[j]) s[i] = min(s[i] + 1, 2); } for (int i = 1; i <= n; i++) if (!d[i]) { int cnt = 0; for (int j : v[i]) if (!d[j] && v[j].size() - s[j] > 1) cnt++; if (cnt > 2) { cout << No n ; return 0; } } cout << Yes n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long int INF = 1e18; const int inf = 1e9; const int MOD = 1e9 + 7; const int nax = 1000000 + 10; int main() { ios::sync_with_stdio(0); double a, b, m, t, dx, dz, mz, mx, vx, vy, vz, ansx, ansz; int pz, px; cin >> a >> b >> m; cin >> vx >> vy >> vz; t = m / abs(vy); dz = t * vz; pz = dz / b; mz = dz - pz * b; if ((int)pz % 2 == 0) ansz = mz; else ansz = b - mz; dx = abs(vx) * t; if (dx <= a / 2) ansx = a / 2 + dx; else { dx -= a / 2; px = dx / a; mx = dx - px * a; if ((int)px % 2 == 0) ansx = a - mx; else ansx = mx; } if (vx < 0) { ansx = a - ansx; } cout << fixed << setprecision(8) << ansx << endl; cout << ansz << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long mod = 1000000007LL; long long large = 2000000000000000000LL; vector<int> p; int f(int x) { return p[x] == x ? x : p[x] = f(p[x]); } vector<vector<pair<int, int> > > adj; int main() { int n, m, a, b; cin >> n >> m >> a >> b; p.assign(n, 0); adj.assign(n, vector<pair<int, int> >()); for (int i = 0; i < n; i++) p[i] = i; for (int i = 0; i < m; i++) { int x, y, z; cin >> x >> y >> z; x--; y--; int t = 0; if (z == b) t = 1; adj[x].push_back(pair<int, int>(y, t)); adj[y].push_back(pair<int, int>(x, t)); if (t == 0) p[f(x)] = f(y); } map<int, int> comp; int sz = 0; for (int i = 0; i < n; i++) { if (comp.find(f(i)) == comp.end()) comp[f(i)] = sz++; } vector<vector<int> > cc(sz, vector<int>()); for (int i = 0; i < n; i++) cc[comp[f(i)]].push_back(i); sz = 0; comp.clear(); for (int i = 0; i < (int)cc.size(); i++) { if ((int)cc[i].size() > 3) comp[f(cc[i][0])] = sz++; } vector<vector<int> > dis(1 << sz, vector<int>(n, 1000000010)); dis[0][0] = 0; priority_queue<pair<int, pair<int, int> >, vector<pair<int, pair<int, int> > >, greater<pair<int, pair<int, int> > > > pq; pq.push(pair<int, pair<int, int> >(0, pair<int, int>(0, 0))); while (!pq.empty()) { pair<int, pair<int, int> > front = pq.top(); pq.pop(); int mask = front.second.first; int u = front.second.second; if (front.first > dis[mask][u]) continue; for (int j = 0; j < (int)adj[u].size(); j++) { int v = adj[u][j].first; int ty = adj[u][j].second; if (ty == 0) { int cost = dis[mask][u] + a; if (dis[mask][v] > cost) { dis[mask][v] = cost; pq.push(pair<int, pair<int, int> >(dis[mask][v], pair<int, int>(mask, v))); } } else { int cost = dis[mask][u] + b; if (f(u) != f(v)) { int vmask = mask; if (comp.find(f(v)) != comp.end()) { if (mask & (1 << comp[f(v)])) continue; } if (comp.find(f(u)) != comp.end()) { vmask |= (1 << comp[f(u)]); } if (dis[vmask][v] > cost) { dis[vmask][v] = cost; pq.push(pair<int, pair<int, int> >(dis[vmask][v], pair<int, int>(vmask, v))); } } } } } vector<int> dp(n, 1000000010); for (int i = 0; i < n; i++) { for (int j = 0; j < (1 << sz); j++) { dp[i] = min(dp[i], dis[j][i]); } } for (int i = 0; i < n; i++) cout << dp[i] << ; cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false), cin.tie(0); int n; string s; cin >> n >> s; if (count(s.begin(), s.end(), s[0]) == s.size() || s.size() == 1) { cout << NO << endl; } else { cout << YES << endl; for (int i = 0; i < s.size() - 1; i++) { if (s[i] != s[i + 1]) { cout << s[i] << s[i + 1]; exit(0); } } } return 0; } |
#include <bits/stdc++.h> using namespace std; int need, e; int mat[128][128]; bool found; int add; int v; int main() { memset(mat, 0, sizeof mat); cin >> need; e = 0; while (e < need) { found = false; for (int i = 1; i <= v && found == false; i++) for (int j = i + 1; j <= v && found == false; j++) { if (mat[i][j] == 1) continue; add = 0; for (int k = 1; k <= v; k++) { if (k == i || k == j) continue; if (mat[i][k] && mat[k][j]) add++; } if (e + add <= need) { found = true; e += add; mat[i][j] = 1; mat[j][i] = 1; } } if (found == false) v++; } cout << v << endl; for (int i = 1; i <= v; i++) { for (int j = 1; j <= v; j++) cout << mat[i][j]; cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> inline void read(T &x) { x = 0; int fu = 1; char c = getchar(); while (c > 57 || c < 48) { if (c == 45) fu = -1; c = getchar(); } while (c <= 57 && c >= 48) { x = (x << 3) + (x << 1) + c - 48; c = getchar(); } x *= fu; } template <typename T> inline void fprint(T x) { if (x < 0) putchar(45), x = -x; if (x > 9) fprint(x / 10); putchar(x % 10 + 48); } template <typename T> inline void fprint(T x, char ch) { fprint(x); putchar(ch); } inline char next_char() { char ch = getchar(); while (ch == 9 || ch == 10 || ch == 32) ch = getchar(); return ch; } template <typename T> inline T mn(T x, T y) { return x < y ? x : y; } template <typename T> inline T mx(T x, T y) { return x > y ? x : y; } template <typename T> inline void chmin(T &x, T y) { (x > y) && (x = y); } template <typename T> inline void chmax(T &x, T y) { (x < y) && (x = y); } long long x, y; inline void MAIN() { read(x); read(y); if (x % y != 0) { fprint(x, 10); return; } else { long long mem = x, ans = 1; for (register long long i = 2; i * i <= y; i++) { x = mem; if (y % i == 0) { while (x % i == 0) x /= i; while (y % i == 0) { y /= i; x *= i; } x /= i; chmax(ans, x); } } x = mem; if (y > 1) { while (x % y == 0) x /= y; chmax(ans, x); } fprint(ans, 10); } } int main() { int T; read(T); while (T--) MAIN(); } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long n; cin >> n; string s = ROYGBIV ; long long x = n - 7; string st = GBIV ; long long i = 0; while (i < x) { s += st[(i % 4)]; i++; } cout << s << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, k, s, a[500009], b[500009]; int chk[500009]; bool ok(int p) { vector<int> c(500009); for (int i = 0; i <= p; i++) c[a[i]]++; for (int i = 0; i < 500009; i++) if (c[i] < chk[i]) return false; return true; } int main() { ios_base::sync_with_stdio(false); cout.tie(0); cin.tie(0); cin >> m >> k >> n >> s; for (int i = 0; i < m; i++) cin >> a[i]; for (int i = 0; i < s; i++) cin >> b[i], chk[b[i]]++; int l = 0, r = m - 1; if (!ok(r)) { cout << -1; return 0; } while (l < r) { int mid = (l + r) >> 1; if (ok(mid)) { r = mid; } else { l = mid + 1; } } vector<pair<int, int>> cut; vector<int> chkk(500009); r = max(r, k - 1); for (int i = 0; i <= r; i++) chkk[a[i]]++; for (int i = 0; i < m; i++) { cut.push_back(make_pair(i, r)); chkk[a[i]]--; while (r + 1 < m && (chkk[a[i]] < chk[a[i]] || r - i < k)) { chkk[a[++r]]++; } if (chkk[a[i]] < chk[a[i]] || r - i < k) { break; } } int fid = -1; for (int i = 0; i < cut.size(); i++) { if (cut[i].first / k + 1 + (m - cut[i].second - 1) / k >= n) { fid = i; break; } } if (fid == -1) { cout << -1; return 0; } vector<int> ans; for (int i = cut[fid].first; i <= cut[fid].second; i++) { if (chk[a[i]] != 0) { chk[a[i]]--; } else { ans.push_back(i); } } cout << cut[fid].second - cut[fid].first + 1 - k + (cut[fid].first % k) << n ; for (int i = 0; i < cut[fid].first % k; i++) cout << i + 1 << ; for (int i = 0; i < cut[fid].second - cut[fid].first + 1 - k; i++) { cout << ans[i] + 1 << ; } } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1005; char s[MAXN][MAXN]; int n, m, pre[MAXN], nex[MAXN]; bool check[MAXN]; int main() { scanf( %d%d n , &n, &m); for (int i = 1; i <= n; ++i) gets(s[i] + 1); for (int j = 0; j <= m + 1; ++j) pre[j] = j - 1, nex[j] = j + 1; int res = 0; for (int j = nex[0]; j <= m; j = nex[j]) { bool ok = 1; for (int i = 1; i <= n - 1; ++i) { if (!check[i] && s[i][j] > s[i + 1][j]) { ok = 0; break; } } if (!ok) { int prevpos = pre[j], nextpos = nex[j]; nex[prevpos] = nextpos; pre[nextpos] = prevpos; ++res; } else { for (int i = 1; i <= n - 1; ++i) if (s[i][j] < s[i + 1][j]) check[i] = 1; } } printf( %d , res); } |
#include <bits/stdc++.h> using namespace std; const int SIZE = 1000009; char s[SIZE]; long long int dsum[SIZE]; int dtotal; long long int usum[SIZE]; int utotal; int main() { int N; scanf( %d%s , &N, s + 1); for (int i = 1; i <= N; i++) { if (s[i] == U ) { ++utotal; usum[utotal] = i + usum[utotal - 1]; } else { ++dtotal; dsum[dtotal] = i + dsum[dtotal - 1]; } } int meetd = 0; int meetu = 0; for (long long int i = 1; i <= N; i++) { meetd += s[i] == D ; int lu = meetu; int rd = dtotal - meetd; int mn = min(lu, rd); long long int ans = (dsum[meetd + mn] - dsum[meetd] - (usum[meetu] - usum[meetu - mn])) * 2; if (s[i] == U ) { if (lu >= rd) ans += N + 1 - i; else ans += (dsum[meetd + mn + 1] - dsum[meetd + mn] - i) * 2 + i; } else { if (rd >= lu) ans += i; else ans += (i - usum[meetu - mn] + usum[meetu - mn - 1]) * 2 + N + 1 - i; } meetu += s[i] == U ; printf( %lld , ans); } printf( n ); } |
#include <bits/stdc++.h> using namespace std; int n, hitung, arr[212]; void swap(int x, int y) { for (int i = y; i > x; i--) { int tmp = arr[i - 1]; arr[i - 1] = arr[i]; arr[i] = tmp; hitung += 1; } } int main() { cin >> n; for (int i = 1; i <= 2 * n; i++) { cin >> arr[i]; } int i = 1; while (i <= 2 * n) { if (arr[i] == arr[i + 1]) { } else { for (int j = i + 2; j <= 2 * n; j++) { if (arr[i] == arr[j]) { swap(i + 1, j); break; } } } i += 2; } cout << hitung << n ; } |
#include <bits/stdc++.h> using namespace std; int n, m; int A[110][110]; char buf[3]; bool mark[110][110][30][2]; bool memo[110][110][30][2]; bool win(int u, int v, int prev, int turn) { bool& ans = memo[u][v][prev][turn]; if (mark[u][v][prev][turn]) return ans; mark[u][v][prev][turn] = true; ans = true; for (int i = 1; i <= n && ans; i++) { if (turn == 0) { if (A[u][i] < prev) continue; ans = !win(i, v, A[u][i], 1 - turn); } else { if (A[v][i] < prev) continue; ans = !win(u, i, A[v][i], 1 - turn); } } return ans; } int main() { memset(A, -1, sizeof(A)); scanf( %d %d , &n, &m); for (int i = 0; i < m; i++) { int x, y; scanf( %d %d %s , &x, &y, buf); A[x][y] = buf[0] - a + 1; } for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { if (win(i, j, 0, 0)) printf( B ); else printf( A ); } printf( n ); } return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.