func_code_string stringlengths 59 71.4k |
|---|
#include <bits/stdc++.h> using namespace std; int f[123]; int l[123]; int t[123][123]; int h[123][123]; int main() { int n, m, H; cin >> n >> m >> H; for (int i = 0; i < m; i++) scanf( %d , f + i); for (int i = 0; i < n; i++) scanf( %d , l + i); for (int i = 0; i < n; i++) for (int... |
#include <bits/stdc++.h> using namespace std; int main() { long long n, i, j, a[100100], p = 1; scanf( %lld , &n); for (i = 0; i < n; i++) scanf( %lld , &a[i]); sort(a, a + n); for (i = 0; i < n; i++) { if (a[i] >= p) p++; } printf( %lld n , p); return 0; } |
#include <bits/stdc++.h> using namespace std; string toString(int n) { ostringstream ost; ost << n; ost.flush(); return ost.str(); } int toInt(string s) { int r = 0; istringstream sin(s); sin >> r; return r; } int main() { int n; cin >> n; int arr[100]; map<in... |
#include <bits/stdc++.h> using namespace std; int t; int main() { cin >> t; while (t--) { int n, nrp = 0, nri = 0; cin >> n; while (n--) { int x; cin >> x; if (x % 2) nri++; else nrp++; } if (nrp == 0) if (nri % 2) ... |
#include <bits/stdc++.h> using namespace std; long long n, parent[100002]; long long pl[100002], ans, dp[100002][22][5]; vector<long long> gr[100002]; long long ast[65]; void dfs(long long v) { for (long long i = 0; i <= 20; i++) { long long x = ((pl[v] >> i) & 1); dp[v][i][x]++; } l... |
#include <bits/stdc++.h> using namespace std; const int N = 1e9 + 7; int main() { string s; cin >> s; int ans = 0; int t = 0; for (int i = s.length() - 1; i >= 0; i--) { if (s[i] == b ) t = (t + 1) % N; else { ans = (ans + t) % N; t = (t * 2) % N; } ... |
#include <bits/stdc++.h> using namespace std; inline int read(void) { int x = 0; char c = getchar(); while (c > 9 || c < 0 ) c = getchar(); while (c >= 0 && c <= 9 ) x = x * 10 + (c - 0 ), c = getchar(); return x; } const int N = 150010, M = 300010; int n, m, c; int loc[N], p[N]; ... |
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) #pragma GCC target( sse4 ) using namespace std; static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL; template <typename T, typename U> static void amin(T &x, U y) { if (y < x) x = y; } template <typename T, typen... |
#include <bits/stdc++.h> using namespace std; int N, M; vector<pair<int, int> > V; int main(int argc, const char *argv[]) { cin >> N >> M; for (int i = 0, x, y; i < M; i++) { cin >> x >> y; V.push_back(pair<int, int>(x, y)); } sort(V.begin(), V.end()); vector<pair<int, int> > cur... |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long t; cin >> t; while (t--) { int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = n - 1; i >= 0; i--) ... |
#include <bits/stdc++.h> using namespace std; int main() { char a[1000]; cin >> a; int n = strlen(a), i, up = 1; for (i = 1; i < n; i++) if (a[i] >= a && a[i] <= z ) up = 0; if (up) { for (i = 1; i < n; i++) a[i] = a[i] + a - A ; if (a[0] >= A && a[0] <= Z ) a[... |
#include <bits/stdc++.h> using namespace std; template <typename T1, typename T2> inline T1 max(T1 a, T2 b) { return a < b ? b : a; } template <typename T1, typename T2> inline T1 min(T1 a, T2 b) { return a < b ? a : b; } const char lf = n ; namespace ae86 { const int bufl = 1 << 15; cha... |
#include <bits/stdc++.h> using namespace std; const int maxn = 102400; long long n, ans, c00, c01, c10, c11; string a, b; int main() { cin >> n >> a >> b; for (int i = 0; i < n; i++) { if (a[i] == 0 && b[i] == 0 ) c00++; else if (a[i] == 0 && b[i] == 1 ) c01++; ... |
#include <bits/stdc++.h> using namespace std; char s[5010]; int mat[5010][5010]; int dp[5010][5010]; int n; void findAllPalindromes() { for (int i = 0; i < n; i++) { for (int j = 0; i - j >= 0 && i + j < n; j++) { if (s[i - j] == s[i + j]) mat[i - j][i + j] = 1; else ... |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; void read(long long &x) { char ch = getchar(); x = 0; while (!isdigit(ch)) ch = getchar(); while (isdigit(ch)) x = x * 10 + ch - 48, ch = getchar(); } const long long N = 105, mod = 1e9 + 9; long long n, now, m, sz[N... |
#include <bits/stdc++.h> using namespace std; struct node { int id, v; } tree[4 * 100005]; int in[100005]; void build(int nod, int s, int e) { if (s == e) { tree[nod].id = s; tree[nod].v = in[s]; return; } int mid = (s + e) / 2, l = 2 * nod, r = l + 1; build(l, s, mid); ... |
#include <bits/stdc++.h> using namespace std; template <class T> inline void checkmin(T &a, const T &b) { if (b < a) a = b; } template <class T> inline void checkmax(T &a, const T &b) { if (b > a) a = b; } const int maxn = 1e3 + 10; const int inf = 1e9 + 10; const long long mod = 1e9 + 7; ... |
#include <bits/stdc++.h> using namespace std; const int maxint = -1u >> 1; template <class T> bool get_max(T& a, const T& b) { return b > a ? a = b, 1 : 0; } template <class T> bool get_min(T& a, const T& b) { return b < a ? a = b, 1 : 0; } const int maxn = 1000000 + 5; int n, m, r1, r2, sv[... |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10; long long a[maxn], b[maxn]; int main() { int n, m; cin >> n >> m; int t; long long sum_n = 0, sum_m = 0; long long cnt_n = 0, cnt_m = 0; for (int i = 0; i < n; i++) { cin >> a[i]; } for (int i = 0; i <... |
#include <bits/stdc++.h> using namespace std; const double PI = 2.0 * acos(0.0); const double EPS = 1e-6; int a[455]; int b[455]; vector<int> G[455]; int boss[455]; void init() { for (int i = 1; i < 455; i++) boss[i] = i; } int find_boss(int x) { return boss[x] = (boss[x] == x ? x : find_bos... |
#include <bits/stdc++.h> using namespace std; double t0; double error(long long t1, long long t2, long long x1, long long x2) { double c = (t1 * x1 + t2 * x2) / double(x1 + x2); if (c >= t0) return c - t0; return 1e9; } int main() { long long t1, t2, x1, x2; cin >> t1 >> t2 >> x1 >> x2 >> ... |
#include <bits/stdc++.h> using namespace std; using ll = long long; ll A[19], cnt, dp[19][4][3][2][2][504][2]; const int p3[]{1, 3, 9}; ll dfs(int pos, int level2, int level3, int level5, int level7, int sum, bool limit) { ll ans = 0; if (dp[pos][level2][level3][level5][level7][sum][limit] !=... |
#include <bits/stdc++.h> using namespace std; const int N = 1100; char str[N]; int G[N][N]; int sum_r[N], sum_c[N]; int n, m; bool vis[N][N]; bool no() { int r0 = n, c0 = m; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { sum_r[i] += G[i][j]; } if (sum_r[i... |
#include <bits/stdc++.h> using namespace std; int main() { stack<int> q; string str; cin >> str; int open = 0, count = 0, rcount = 0; for (int i = 0; i < str.length(); ++i) { if (str[i] == ( ) open++; else if (str[i] == ) ) { if (open != 0) open--; ... |
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:102400000,102400000 ) const int MOD = 1e9 + 7; const int N = 1e5 + 7; int n, m, x, L, R; long long pre[N][6]; long long sum[N << 2][6]; int laz[N << 2]; inline void pushup(int rt) { for (int i = int(0); i <= int(5); ++i)... |
#include <bits/stdc++.h> using namespace std; using ll = long long; const int N = int(2.1e5); vector<pair<int, int>> g[N]; int n, q; ll res = 0; class dsu { public: using T = int; vector<int> p; vector<ll> sz; int n; dsu(int _n) : n(_n) { p.resize(n); sz.resize(n); ... |
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; k = min(k, 26); string s = ab ; for (int i = 0; i < k - 2; i++) { s += char(99 + i); } string s1 = ; for (int i = 0; i < n / k; i++) { s1 += s; } for (int i = 0; i < n % k; i++)... |
#include <bits/stdc++.h> using namespace std; typedef struct node { struct node* b[3]; int flag[3]; } node; node* root; vector<int> ans; int bit[32], bit_n[32]; void calc(int u) { memset(bit_n, 0, sizeof(bit_n)); memset(bit, 0, sizeof(bit)); int j = 0, num; for (num = u; num > 0; n... |
#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0, f = 1; char ch = getchar(); for (; !isdigit(ch); ch = getchar()) if (ch == - ) f = -1; for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - 0 ; return x * f; } int n, k, a[201010]; long long f[201010][2];... |
#include <bits/stdc++.h> using namespace std; const long long N = 2e6 + 10; const long long mod = 1e9 + 7; struct Dsu { long long fa[N << 1], d[N << 1]; struct Tmp { long long x, y, add; }; stack<Tmp> s; long long find(long long x) { while (x != fa[x]) x = fa[x]; return x; ... |
#include <bits/stdc++.h> #pragma GCC target( avx2 ) #pragma GCC optimization( O3 ) #pragma GCC optimization( unroll-loops ) using namespace std; const long long int inf = 1e18; const long long int ninf = -1e18; const long long int mod = 1000000007; const long long int MOD = 998244353; template <typena... |
#include <bits/stdc++.h> using namespace std; int main() { int n, ed[26][26] = {}, pos[26][26] = {}; static char s[200100], t[200100]; scanf( %d%s%s , &n, s, t); int ans = 0; for (int i = 0; i < (n); ++i) { ans += s[i] != t[i]; ed[s[i] - a ][t[i] - a ] += 1; pos[s[i] - a ][t... |
#include <bits/stdc++.h> using namespace std; int readInt() { int a; scanf( %d , &a); return a; } long long readLong() { long long a; scanf( %lld , &a); return a; } void readString(char *s) { scanf( %s , s); } const int N = 100005; char s[N]; vector<pair<int, int>> comp; int... |
#include <bits/stdc++.h> using namespace std; int main() { long long n, a, d; long long t, v; double prev = 0; scanf( %I64d%I64d%I64d , &n, &a, &d); for (int i = 1; i <= n; i++) { scanf( %I64d%I64d , &t, &v); double tt = sqrt((2 * d) / (a * 1.0)); if (tt * a > v) { tt =... |
#include <bits/stdc++.h> using namespace std; long double x1, x2, y, y2, r1, r2, ab, s = 0, al, be; const long double pi = acos(-1); void inp() { cin >> x1 >> y >> r1; cin >> x2 >> y2 >> r2; ab = sqrt((x1 - x2) * (x1 - x2) + (y - y2) * (y - y2)); } void out() { if (ab >= (r1 + r2)) { c... |
#include <bits/stdc++.h> using namespace std; int dp[2][100100]; int visit[100100]; int v[100100]; int main() { int i, j; int n, m; while (scanf( %d %d , &n, &m) != EOF) { memset(dp, 0, sizeof(dp)); for (i = 1; i <= n; i++) { scanf( %d , &v[i]); if (v[i] < 0) { ... |
#include <bits/stdc++.h> int n, a[500005], L[500005], f[500005][22], g[500005][22]; long long ans; int get(int x, int y) { if (x < 0) return 0; int k = (int)log2(y - x + 1); return L[f[x][k]] <= L[f[y + 1 - (1 << k)][k]] ? f[x][k] : f[y + 1 - (1 << k)... |
#include <bits/stdc++.h> using namespace std; int main() { int n, m, k; cin >> n >> m >> k; if (n <= m && n <= k) { cout << Yes ; } else { cout << No ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 4; int n, q, A[N], P[N], R[N], res[N], S[N * 2]; map<int, int> M; vector<int> Q[N]; inline void Add(int le, int ri, int val) { le--; ri--; for (le += n, ri += n; le < ri; le >>= 1, ri >>= 1) { if (le & 1) S[le++] ^= val; ... |
#include <bits/stdc++.h> using namespace std; int main() { long long n, l, x, y; set<long long> Set; while (cin >> n >> l >> x >> y) { for (int i = 1; i <= n; ++i) { long long t; scanf( %I64d , &t); Set.insert(t); } bool checkx = 0; bool checky = 0; ... |
#include <bits/stdc++.h> using namespace std; int N; int main() { int T; scanf( %d , &T); while (T--) { cin >> N; printf( %d n , (N > 2 ? N - 2 : 0)); } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; constexpr long long MOD = 1000000007LL; template <class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } template <class T> inline bool chmin(T &a, T b) { if (a > b... |
#include <bits/stdc++.h> using namespace std; const int N = 500, INF = 1 << 30; int nxt[N], a[N][N], n, x, Rank[N][N], now; char s[10]; queue<int> q; void init() { scanf( %d , &n); for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) scanf( %d , &a[i][j]); puts( B ); fflush(stdout... |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int T; cin >> T; while (T--) { int n; cin >> n; int mid = sqrt(n + 0.5); vector<int> ans; ans.push_back(0); for (int i = 1; i <= mid; i++) { ... |
#include <bits/stdc++.h> using namespace std; int main() { int x, y, n, a, b; cin >> x >> y >> n; long double d = 10000000000, t, q; t = (long double)x / y; for (int i = 1; i <= n; i++) { q = abs(t - floor(t * i) / i); if (q < d) { a = floor(t * i); b = i; d =... |
#include <bits/stdc++.h> using namespace std; struct state { int x, y, d; state(){}; state(int _x, int _y, int _d) { x = _x, y = _y, d = _d; }; }; int main() { int r, c; int dx[4] = {1, 0, -1, 0}; int dy[4] = {0, 1, 0, -1}; while (cin >> r >> c) { char temp; int map[1010]... |
#include <bits/stdc++.h> using namespace std; const int INPUT_MAXCHARS = 1 << 16; char buffer[INPUT_MAXCHARS]; struct FastReader { char *p; FastReader() { fread(buffer, 1, sizeof buffer, stdin); p = buffer; } int next() { int remchars = INPUT_MAXCHARS - (p - buffer); if (... |
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5+5; typedef long long ll; char s[maxn],f[maxn]; int t[maxn<<2],lz[maxn<<2]; void pushup(int rt){ t[rt]=t[rt<<1]+t[rt<<1|1]; } void pushdown(int rt,int l,int r){ if(lz[rt]!=-1){ int mid=l+r>>1; t[rt<<1]=lz[rt]*(mi... |
#include <bits/stdc++.h> using namespace std; int main() { int a, b, i = 0, j = 0; cin >> a >> b; if (a > b) { i = b; a = a - b; j = a / 2; } else if (a < b) { i = a; b = b - a; j = b / 2; } else { i = a; j = 0; } cout << i << << j; }... |
#include <bits/stdc++.h> using namespace std; int n, m; int l[200000], r[200000]; int a[200000], b[200000], c[200000]; int d[800000], p[800000]; set<int> se; map<int, int> ma; int rev[800000]; int mac = 0; long long ans = 0; int ansi, ansj; pair<int, int> fen[800000]; void fenUpdate(int pos, p... |
#include <bits/stdc++.h> using namespace std; const long long mo = 998244353; const long long g = 3; const int N = 500000; int n, ax, bx, rev[N + 10]; long long aa[N + 10], bb[N + 10], c[N + 10], fac[N + 10], inv[N + 10]; long long mul(long long x, long long y) { long long z = 1; while (y) { ... |
#include <bits/stdc++.h> using namespace std; int main() { long long m, b; cin >> m >> b; long long Max = 0; for (long long i = b; i >= 0; i--) { long long p = (m * b - m * i + 1) * (i + 1) * (m * b - m * i + i) / 2; Max = max(p, Max); } printf( %I64d , Max); return 0; } |
#include <bits/stdc++.h> using namespace std; const int L = 1 << 20; const int R = 1 << 21; const int Maxn = 200005; int tree[R], A, B; int d[Maxn]; char s[Maxn]; bool vowel(char x) { x = tolower(x); if (x == a || x == e || x == i || x == o || x == u ) return 1; return 0; } int ... |
#include <bits/stdc++.h> using namespace std; int T; int h, c, t; int main() { scanf( %d , &T); while (T--) { scanf( %d%d%d , &h, &c, &t); if (t * 2 <= (h + c)) printf( %d n , 2); else { long long lef = (h - t) / (2 * t - (h + c)); double a1 = (1.0 * h * (lef + ... |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; int gi() { int x = 0, o = 1; char ch = getchar(); while ((ch < 0 || ch > 9 ) && ch != - ) ch = getchar(); if (ch == - ) o = -1, ch = getchar(); while (ch >= 0 && ch <= 9 ) x = x * 10 + ch - 0 , ch = getchar(); r... |
#include <bits/stdc++.h> template <typename T> inline void SWAP(T &a, T &b) { T tmp = a; a = b; b = tmp; } template <typename T> inline T ABS(const T &val) { return val < 0 ? -val : val; } template <typename T> inline T MAX(const T &a, const T &b) { return a > b ? a : b; } templa... |
#include <bits/stdc++.h> using namespace std; int main() { string s, t; cin >> s >> t; if (s == monday && (t == thursday || t == wednesday || t == monday )) cout << YES ; else if (s == tuesday && (t == friday || t == thursday || t == tuesday )) cout << YES ; ... |
#include <bits/stdc++.h> using namespace std; int main() { int n, m, t, timer = 0; scanf( %d%d%d , &n, &m, &t); deque<int> q; vector<int> col(n); char isOk = false; for (int i = 0, j = 0; i < n; i++) { int x, y, z, start; scanf( n%d:%d:%d , &x, &y, &z); start = x * 3600 + ... |
#include <bits/stdc++.h> struct vit { int price; char vit[4]; }; int main() { int i, n, min; scanf( %d , &n); struct vit t[n]; for (i = 0; i < n; i++) { scanf( %d %s , &t[i].price, t[i].vit); } int A = 300001, B = 300001, C = 300001, AB = 300001, AC = 300001, BC = 300001, ... |
#include <bits/stdc++.h> using namespace std; int f[200][200], c[500010], n, i, j, ans; char a[500010], b[500010], str[20]; int main() { cin >> n; for (i = 1; i <= n; i++) { scanf( %s , str); a[i] = str[0], b[i] = str[strlen(str) - 1], c[i] = strlen(str); } memset(f, -1, sizeof(f)); ... |
#include <bits/stdc++.h> using namespace std; struct Edge { long long to, dis, next, cost; } edge[24050]; long long num = -1; bool vis[10010]; long long mincost; long long pre[10010], head[10010], cost[10010], last[10010], flow[10010], n, k, a[110], b[110], s, t, maxflow; long long to[110]; ... |
#include <bits/stdc++.h> using namespace std; const int INF = 1 << 29; const double EPS = 1e-9; const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1}; int n, m; int main() { cin >> n >> m; int ans = 0; for (int i = 0; i <= n; i++) { int tmp = 0; int a1 = i; int b1 = (m - 2 * i);... |
#include <bits/stdc++.h> using namespace std; int n; struct hdm { int first, second, id; hdm(){}; hdm(int first, int second, int id) : first(first), second(second), id(id){}; }; vector<hdm> v1, v2; bool cmp1(hdm A, hdm B) { return (A.second < B.second); } bool cmp2(hdm A, hdm B) { return (A.fi... |
#include <bits/stdc++.h> using namespace std; using ll = long long; const ll base = 1000000007; int n; ll p2[1000000]; class reimu { public: ll sum, sum2; int sz; ll ans = 0; void operator+=(reimu x) { (sum2 += x.sum2) %= base; (sum += x.sum) %= base; sz += x.sz; } ... |
#include <bits/stdc++.h> using namespace std; double PI = acos(-1); long long int mod = 998244353; double eps = 1e-8; long long int exp(long long int x, long long int y) { if (y < 0) return 0; long long int ret = 1; for (; y; y >>= 1, x = (x * x) % mod) { if (y & 1) ret = (ret * x) % mod; ... |
#include <bits/stdc++.h> using namespace std; bool isPrime(int N) { for (int i = 2; i * i <= N; ++i) { if (N % i == 0) return false; } return true; } bool sortinrev(const pair<int, int> &a, const pair<int, int> &b) { return (a.first > b.first); } int gcd(int a, int b) { if (b == 0)... |
#include <bits/stdc++.h> using namespace std; template <class T, class L> bool smax(T& x, L y) { return x < y ? (x = y, 1) : 0; } template <class T, class L> bool smin(T& x, L y) { return x > y ? (x = y, 1) : 0; } const int maxn = 2e6 + 17; pair<int, pair<int, int> > a[maxn]; int n, m, par[m... |
#include <bits/stdc++.h> const long long base1 = 131; const long long base2 = 233; const long long mod1 = 998244353; const long long mod2 = 1e9 + 7; const long long MaxN = 1e6 + 50; template <class t> inline void read(t &s) { s = 0; register long long f = 1; register char c = getchar(); wh... |
#include <bits/stdc++.h> using namespace std; const int MAX = 2e6 + 5; char s1[MAX], s2[MAX]; int main() { cin >> s1 + 1; cin >> s2 + 1; int len1 = strlen(s1 + 1); int len2 = strlen(s2 + 1); int i = 1, j = 1; for (; i <= len1 && j <= len2;) { if (s1[i] == s2[j]) i++, j++; ... |
#include <bits/stdc++.h> using namespace std; const long double eps = 1e-9; long double PI = acos((long double)-1.0); struct io_s { bool negative; char ch; inline bool isdigitx(char c) { return c >= 0 && c <= 9 ; } inline char nextchar() { static char buf[100000], *p1 = buf, *p2 = buf; ... |
#include <bits/stdc++.h> using namespace std; const int MXN = 200; const int MXK = 5; int bans = -1; int t[MXN][MXK]; int a[MXK]; int n; int c[MXK]; int cc[] = {500, 1000, 1500, 2000, 2500, 3000}; int cat(int c, int n) { if (c * 2 > n) { return 0; } if (c * 4 > n && c * 2 <= n) { ... |
#include <bits/stdc++.h> using namespace std; int n, l, r, id[1010][1010]; bool tag[1010][1010]; struct node { int x, y; pair<vector<node>, int> e() { vector<node> v; int c = 0; v.push_back((node){x + 1, y}); if (x > 0) v.push_back((node){x - 1, y}); else c+... |
#include <bits/stdc++.h> using namespace std; template <typename T> void print(T x) { cout << x << endl; } template <typename T1, typename T2> void print2(T1 x, T2 y) { cout << x << << y << endl; } template <typename T1, typename T2, typename T3> void print3(T1 x, T2 y, T3 z) { cout <<... |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int dp[10000]; for (int i = 0; i < n; i++) cin >> dp[i]; dp[1] = min(dp[1], dp[0]); for (int i = 2; i < n; i++) dp[i] = min(dp[i], max(dp[i - 1], dp[i - 2])); cout << dp[n - 1] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> T max(T a, T b, T c) { return max(a, max(b, c)); } template <class T> T min(T a, T b, T c) { return min(a, min(b, c)); } const double PI = 2.0 * acos(0.0); const int mx[] = {0, 1, 0, -1}; const int my[] = {-1, 0, 1, 0}; int c... |
#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); using ll = long long; template <typename T> void DEBUG(string label, T value) { cerr << [ << label << = << value << ] n ; } map<string, int> encode; map<int, string> decode; in... |
#include <bits/stdc++.h> using namespace std; int p[201], bag[201]; int n, l, k; double mem[202][202][202]; double solve(int r, int bagwon, int prizewon) { if (mem[r][bagwon][prizewon] >= -.5) return mem[r][bagwon][prizewon]; if (r == n) return mem[r][bagwon][prizewon] = bagwon ... |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; for (int i = 0; i < m; i++) { if (i >= (m - n % m)) cout << n / m + 1 << ; else cout << n / m << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long int mod = 1e9 + 7; vector<string> v(100005); long long int n, m; long long int check(string s, string str) { long long int count = 0; for (long long int i = 0; i < s.size(); i++) { if (str[i] != s[i]) count++; } return count; ... |
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, d; cin >> a >> b >> c >> d; printf( %d , ((a ^ b) & (c | d)) ^ ((b & c) | (a ^ d))); return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const int maxn = 1010; int Dp[maxn][maxn], dp[maxn][maxn], f[maxn][maxn], g[maxn][maxn]; int a[maxn][maxn]; int n, m; int main() { while (~scanf( %d%d , &n, &m)) { for (int i = 1; i <= n; ++i) for (int j = 1; j <= ... |
#include <bits/stdc++.h> using namespace std; string s; int n, m, t, x, g; int f[100005]; string b[15]; int l[15]; int main() { cin >> s; n = s.length(); scanf( %d n , &m); for (int i = 0; i < m; i++) { cin >> b[i]; l[i] = b[i].length(); scanf( n ); } f[0] = 0; ... |
#include <bits/stdc++.h> using namespace std; int main() { int N, M, k; string in; list<string> ret; cin >> N >> M; cin >> in >> k; if (k == 0) { for (int i = 0; i < N; i++) in[i] = ((in[i] - 0 ) ^ 1) + 0 ; ret.push_back(in); } else { long long s = (1LL << k) - 1; ... |
#include <bits/stdc++.h> const double eps = (1e-9); using namespace std; int dcmp(long double a, long double b) { return fabsl(a - b) <= eps ? 0 : (a > b) ? 1 : -1; } int getBit(long long num, int idx) { return ((num >> idx) & 1ll) == 1; } int setBit1(int num, int idx) { return num | (1 << idx); } lon... |
#include <bits/stdc++.h> using namespace std; const int N = 520, M = 512; int f[N], g[N]; int a[int(1e6)]; int n; int main() { scanf( %d , &n); for (register int i = 1; i <= n; ++i) scanf( %d , a + i); for (register int i = 1; i < M; ++i) f[i] = 1e9; f[0] = -1; for (register int i = 1; i... |
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10; int m, n, q, x; int ans; int a[N], b[N]; char s[N], p[N], t[N]; int main() { int T; scanf( %d , &T); while (T--) { int pt1, pt2; pt1 = pt2 = 0; memset(a, 0, sizeof(a)); memset(b, 0, sizeof(b)); ... |
#include <bits/stdc++.h> using namespace std; inline long long getnum() { char c = getchar(); long long num, sign = 1; for (; c < 0 || c > 9 ; c = getchar()) if (c == - ) sign = -1; for (num = 0; c >= 0 && c <= 9 ;) { c -= 0 ; num = num * 10 + c; c = getchar(); } ... |
#include <bits/stdc++.h> using namespace std; long long a[100005], n, cont[100005]; int main() { cin >> n; for (int i = 0; i < n; i++) cin >> a[i], cont[50 + a[i]]++; long long res = 0; for (int i = 0; i <= 10; i++) { if (i == 0) { long long x = cont[50]; res += (x * (x - 1))... |
#include <bits/stdc++.h> using namespace std; int S, l[100], r[100], N, w[200]; double a[100], b[100], f[100][100], ans[100]; void init() { scanf( %d , &N); for (int i = 1; i <= N; i++) scanf( %d%d , &l[i], &r[i]), w[++S] = l[i], w[++S] = r[i]; } void calc(int p, int L, int R) { int t = 0,... |
#include <bits/stdc++.h> using namespace std; int main() { long long n; int m; cin >> n >> m; long long cnt = 0; if (m == 1) { cout << n * n << endl; return 0; } if (m < n) { for (int i = 1; i <= m; i++) for (int j = 1; j <= m; j++) if ((i * i + j * j)... |
#include <bits/stdc++.h> const long double eps = 1e-10; const int MOD = 1000000007; using namespace std; int a[200005], K, n; int main() { scanf( %d %d , &n, &K); for (int i = 0; i < n; ++i) scanf( %d , a + i); sort(a, a + n); int ret = 0; for (int i = 0; i < n - 1; ++i) { int b = a[... |
#include <bits/stdc++.h> using namespace std; const int maxn = 501; int n, vis[maxn][maxn], a[maxn][maxn], x, y, s, cnt; char p[3000010]; int d[4][2] = {0, 1, 1, 0, -1, 0, 0, -1}; bool J(int x, int y, int i) { while (true) { x += d[i][0]; y += d[i][1]; if (!x || !y || x > n || y > n) r... |
#include <bits/stdc++.h> using namespace std; long long fact_a[1000005]; long long factorial() { fact_a[0] = fact_a[1] = 1; for (long long i = 2; i < 1000005; i++) fact_a[i] = (fact_a[i - 1] * i); } long long power(long long x, long long n) { long long result = 1; while (n > 0) { if (n %... |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); string s, t; cin >> s; size_t a, b, c, d, n; n = s.length(); t.reserve(n); a = s.find( 0 ); b = s.find( 1 ); c = s.find( 2 ); d = c; for (size_t i = 0; i < n; i++) { ... |
#include <bits/stdc++.h> using namespace std; void solve() { long long n; long long a[2]; cin >> a[0] >> a[1]; sort(a, a + 2); n = 2 * a[0]; if (n < a[1]) { n = a[1]; } n *= n; cout << n << endl; } int main() { int t; cin >> t; while (t--) { solve(); ... |
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for(int i = 0; i < n; i++) #define rep2(i, x, n) for(int i = x; i <= n; i++) #define rep3(i, x, n) for(int i = x; i >= n; i--) #define each(e, v) for(auto &e: v) #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end()... |
#include <bits/stdc++.h> using namespace std; int main() { int i, j; char a[100010]; scanf( %s , &a); int n = strlen(a); int b = 10 * (a[n - 2] - 0 ) + (a[n - 1] - 0 ); if (b % 4 == 0) cout << 4 ; else cout << 0 ; return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /stack:256000000 ) using namespace std; int main() { int n; cin >> n; if (n % 2 == 0) { puts( -1 ); } else { for (int(i) = 0; (i) < (n); (i)++) printf( %d , i); printf( n ); for (int(i) = 0; (i) < (n); (i)++) printf( %d ,... |
#include <bits/stdc++.h> long long max(long long a, long long b) { return a > b ? a : b; } long long min(long long a, long long b) { return a < b ? a : b; } void swap(long long &a, long long &b) { long long tmp = a; a = b; b = tmp; } long long lowbit(long long &x) { return x & (-x); } void read(... |
#include <bits/stdc++.h> using namespace std; template <class T> inline bool getmin(T *a, const T &b) { if (b < *a) { *a = b; return true; } return false; } template <class T> inline bool getmax(T *a, const T &b) { if (b > *a) { *a = b; return true; } return f... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.