solution stringlengths 53 181k | difficulty int64 0 27 |
|---|---|
#include <bits/stdc++.h>
using namespace std;
uint64_t mysqrt(uint64_t k) {
uint64_t lo = 1;
uint64_t hi = k;
while (lo <= hi) {
uint64_t mid = lo + (hi - lo) / 2;
if (mid * mid > k)
hi = mid - 1;
else if (mid * mid < k)
lo = mid + 1;
else
return mid;
}
return hi;
}
int main(... | 16 |
#include <bits/stdc++.h>
using namespace std;
const int N = 75;
int dp[N][N][N][N];
int r, c, k;
int mat[N][N];
int fun(int i, int j, int cnt, int rem) {
if (i == r) {
if (rem != 0)
return INT_MIN;
else
return 0;
}
if (j == c) return fun(i + 1, 0, 0, rem);
if (cnt == c / 2) return fun(i + 1,... | 13 |
#include <bits/stdc++.h>
int main() {
int n, m;
int arr[1005] = {0};
scanf("%d %d", &n, &m);
int val;
int mini = 1005;
for (int i = 0; i < 1005; i++) {
arr[i] = 0;
}
for (int i = 0; i < m; i++) {
scanf("%d", &val);
arr[val] += 1;
}
for (int i = 1; i <= n; i++) {
if (arr[i] < mini) {
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int N, Q;
long double X[10101], Y[10101];
long double A[10101];
long double R[10101];
long double SX = 0, SY = 0;
long double D;
int main() {
int i, j, k, l, r, x, y;
string s;
cin >> N >> Q;
for (i = 1; i <= N; i++) {
cin >> X[i] >> Y[i];
}
double SA = 0;
... | 18 |
#include <bits/stdc++.h>
using namespace std;
const int N = 300005;
vector<int> v[N];
vector<int> d(N, -1);
vector<int> p(N, 0);
vector<int> sz(N, 1);
vector<int> res(N, 1);
int find_set(int a) {
if (a == p[a])
return a;
else
return p[a] = find_set(p[a]);
}
void merge_sets(int a, int b) {
a = find_set(a);... | 13 |
#include <bits/stdc++.h>
using namespace std;
int n;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
int x;
if (i <= n / 2 + 1)
x = n / 2 + 1 - i;
else
x = i - n / 2 - 1;
for (int i = 0; i < x; i++) printf("*");
for (int i = 0; i < n - x * 2; i++) printf("D");
for (i... | 0 |
#include <bits/stdc++.h>
using namespace std;
int n, m, q;
string s[50005];
set<int> st1[50005], st2[50005];
int main() {
ios::sync_with_stdio(false);
cin >> q;
while (q--) {
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> s[i];
for (int j = 0; j < m; j++) {
if (s[i][j] == '*') {
... | 5 |
#include <bits/stdc++.h>
using namespace std;
int a[4], p[4], length[4], q[4], pos[4];
int main() {
int n, m, top = 0;
scanf("%d%d", &n, a);
p[0] = 1;
for (int i = 2; i <= n; i++) {
scanf("%d", &m);
if (m != a[top]) {
a[++top] = m;
p[top] = i;
} else {
length[top]++;
}
if (... | 10 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, a(1);
cin >> n >> t;
if (n == 1 && t == 10) {
cout << -1 << endl;
} else {
cout << t;
if (t == 10) a++;
for (a; a < n; a++) cout << 0;
}
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
bool cmp(long long a, long long b) { return (a > b); }
long long ceil(const long long &a, const long long &b) {
if (a % b == 0) return a / b;
return a / b + 1;
}
long long mod = 1000000007;
const long long N = 100005;
int main() {
ios_base::sync_with_stdio(0);
cin.t... | 2 |
#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:167177216")
vector<int> g[111], aa[111];
int i, j, n, m, k, t, l, r, tek, kol, a, b, used[111], u[111], was[111], kolo;
void dfs(int v) {
was[v] = 1;
used[v] = tek;
for (int i = 0; i < g[v].size(); i++) {
int to = g[v][i];
if (!... | 7 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, s;
cin >> a >> b >> s;
if (a >= 0 && b >= 0) {
if ((a + b) % 2 == 0) {
if (s % 2 == 0) {
if (s >= (a + b))
cout << "Yes\n";
else
cout << "No\n";
} else
cout << "No\n";
} else ... | 2 |
#include <bits/stdc++.h>
using namespace std;
set<int> s[2];
set<int> sdouble;
int cntdouble[2];
long long sum[2];
int n;
void upd(int id);
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
int tp, x;
scanf("%d%d", &tp, &x);
if (x > 0) {
sum[0] += x;
s[0].insert(x);
cntdoubl... | 14 |
#include <bits/stdc++.h>
int main() {
int n, k, l, c, d, p, nl, np;
scanf("%d%d%d%d%d%d%d%d", &n, &k, &l, &c, &d, &p, &nl, &np);
int vol, slices;
vol = k * l;
slices = c * d;
int i = 0;
while (vol >= 0 && slices >= 0 && p >= 0) {
vol -= n * nl;
p -= n * np;
slices -= n * 1;
i = i + 1;
}
... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
namespace MCMF {
int head[8888];
int ecnt, S, T;
struct Edge {
int nxt, to, val, cost;
} edge[8888 << 4];
void add(int a, int b, int c, int d) {
edge[++ecnt] = {head[a], b, c, d};
head[a] = ecnt;
}
void adde(int a, int b, int c, int d) {
... | 20 |
#include <bits/stdc++.h>
using namespace std;
long long int linebug[510][510];
int main() {
long long int lines, prog, maxbug, mod;
cin >> prog >> lines >> maxbug >> mod;
int pbug[prog];
for (int i = 0; i < prog; i++) {
cin >> pbug[i];
}
for (int i = 0; i < 510; i++) {
memset(linebug[i], 0, sizeof(l... | 10 |
#include <bits/stdc++.h>
const double pi = acos(-1.0);
using namespace std;
int n;
struct node {
long long a, b, h;
};
struct DD {
long long h;
int i;
};
node data[100010];
bool cmp(const node &a, const node &b) {
if (b.b == a.b) return a.a > b.a;
return a.b > b.b;
}
long long ans[100010];
priority_queue<DD> ... | 12 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100100;
double ans, f[2][N];
int now, n, k;
int main() {
scanf("%d%d", &n, &k);
now = 0;
for (int i = n - 1; i >= 0; i--) {
now ^= 1;
for (int j = 1; j <= 600; j++)
f[now][j] =
f[now ^ 1][j] * (j * 1.0 / (j + 1.0) / k + (k - 1) * ... | 19 |
#include <bits/stdc++.h>
using namespace std;
const int N = 3010;
int n, tmp, mx, ans = 1e9;
vector<pair<int, int>> nei[N];
void read_input() {
cin >> n;
for (int i = 1; i < n; i++) {
int u, v;
cin >> u >> v;
nei[u].push_back({v, 1});
nei[v].push_back({u, 0});
}
}
void dfs(int v, int p, int k) {
... | 13 |
#include <bits/stdc++.h>
using namespace std;
int t, k;
long long memo[1024][1024][2];
pair<int, int> check[1024];
int len;
char s[1024];
long long countNum(int pos, int last, bool done, bool free) {
if (free && memo[pos][last][done] >= 0) return (memo[pos][last][done]);
if (pos == 0) {
return (done);
}
lon... | 17 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
inline int read() {
int w = 1, s = 0;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') w = -1;
ch = getchar();
}
while (isdigit(ch)) {
s = s * 10 + ch - '0';
ch = getchar();
}
return w * s;
}
inline long long ... | 16 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
long long n, m;
long long ans;
cin >> n >> m;
if (n > m) {
swap(n, m);
}
if (n == 1) {
if (m % 6 <= 3) {
ans = m - m % 6;
} else {
ans = m - (6 - (m % 6));
}
} else if (n == 2 && m == 2) {... | 14 |
#include <bits/stdc++.h>
using namespace std;
const unsigned long long M = 1e9 + 10;
const unsigned long long N = 1e9 + 10;
map<unsigned long long, unsigned long long> cnt;
unsigned long long combination(unsigned long long n, unsigned long long m) {
unsigned long long i, j;
unsigned long long sum = 1;
if (n == 0 ... | 7 |
#include <bits/stdc++.h>
using namespace std;
int n, ans, a[200010];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
for (int l = 1; l <= n; l++) {
long long xx = 1, tmp = 0;
for (; xx <= a[l]; xx <<= 1)
;
for (int r = l + 1; r < n; r++) {
tmp += a[r];
... | 17 |
#include <bits/stdc++.h>
using namespace std;
bool arr[55][55];
bool visited[55][55];
signed main() {
ios::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
long long int n;
cin >> n;
arr[1][1] = 1;
arr[1][2] = 0;
visited[1][1] = 1;
for (long long int i = 3; i <= n; i += 2) {
cout << "? " << 1 <<... | 16 |
#include <bits/stdc++.h>
using namespace std;
template <typename _typer>
inline _typer read() {
_typer init = 0;
char ch = getchar(), k = 0;
for (; !isdigit(ch); ch = getchar()) k = (ch == '-');
for (; isdigit(ch); ch = getchar())
init = (init << 3) + (init << 1) + (ch ^ 48);
return k ? -init : init;
}
co... | 16 |
#include <bits/stdc++.h>
using namespace std;
int arr[1000];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
memset(arr, -1, sizeof(arr));
int p, n;
cin >> p >> n;
for (int i = 0; i < n; ++i) {
int tmp;
cin >> tmp;
tmp = tmp % p;
if (~arr[tmp]) {
cout << i + 1 << ... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int S1 = 4000;
const int S0 = 3;
const int TMP1 = 4999;
const int TMP2 = 4998;
const int MAXD = 10 + 5;
int D, P;
const int MAXC = 5e3 + 50;
int cell[MAXC];
int log2(int v) {
int r;
for (r = 0; v != 0; r++) {
if ((1 << r) >= v) return r;
if (v & (1 << r)) ... | 25 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200000 + 10;
const long long INF = 1000000000000000000;
long long a[maxn];
long long b[maxn];
vector<int> G[maxn];
long long dp[maxn];
long long dfs(int u, int v) {
if (b[u] == -INF) {
b[u] = a[u];
for (int i = 0; i < G[u].size(); ++i) {
if ... | 10 |
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-9;
const int oo = 0x3f3f3f3f;
const long long ooLL = 0x3f3f3f3f3f3f3f3fLL;
int dist[3010];
bool visited[3010];
vector<vector<int> > g;
int cycle(int node, int parent) {
visited[node] = true;
for (int i = 0, (N) = static_cast<int>((g[node]).size());... | 8 |
#include <bits/stdc++.h>
using namespace std;
int a[1 << 20], b[1 << 20];
bool vis[1 << 20];
int n, m;
pair<int, int> calc(int x, int lim) {
if (x > n || a[x] <= lim) {
return make_pair(1e9, x);
}
pair<int, int> res = make_pair(a[x], x);
res = min(res, calc(x << 1, lim));
res = min(res, calc(x << 1 | 1, l... | 16 |
#include <bits/stdc++.h>
using namespace std;
int d[20][20];
int in[20];
int sum = 0;
const int INF = 1000000000;
int dp[1 << 15];
int s = 0;
int getans(int n) {
int i, j, k;
queue<int> Q;
for (i = 1; i < n; i++)
if (in[i] && d[0][i] >= INF) return -1;
int tot = (1 << n) - 1;
for (i = 0; i <= tot; i++) dp... | 16 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
bool mini(T &a, T b) {
return a > b ? (a = b, true) : false;
}
template <class T>
bool maxi(T &a, T b) {
return a < b ? (a = b, true) : false;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.precision(10);
cout << fixed;
... | 12 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1000000 + 5;
const int LIM = 1000000 + 5;
int n;
int v[N];
long long sum = 0LL;
long long cnt = 0LL;
inline void print() {
long double ans = (long double)sum / (long double)cnt;
cout << fixed << setprecision(4) << ans << "\n";
exit(0);
}
vector<int> wher... | 10 |
#include <bits/stdc++.h>
using namespace std;
const int N = 210;
int n, sum[2];
vector<int> rep[N];
bool mark[N], p;
int main() {
cin >> n;
for (int i = 0, j; i < 2 * n; i++) cin >> j, rep[j].push_back(i);
for (int i = 10; i < 100; i++)
if (rep[i].size() > 1)
for (int j = 0; j < 2; j++) {
mark[r... | 11 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[6];
for (int i = 0; i < 6; i++) cin >> a[i];
for (int i = 0; i < 3; i++) {
for (int j = i + 1; j < 4; j++) {
for (int k = j + 1; k < 5; k++) {
int sum1 = a[i] + a[j] + a[k];
int sum2 = 0;
for (int h = 0; h < 6; h++)... | 2 |
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
mt19937 rng(
(unsigned int)chrono::steady_clock::now().time_since_epoch().count());
long long power(long long a, long long b) {
long long result = 1;
while (b > 0) {
if (b % 2 == 1) {
result *= a;
}
a *= a;
b /= 2;... | 10 |
#include <bits/stdc++.h>
using namespace std;
namespace io {
inline void readl(long long &x) {
x = 0;
long long f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-') f = -f;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = x * 10 + c - '0';
c = getchar();
}
x *= f;
}
i... | 7 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int inf = 1e9;
long long powm(long long a, long long p, long long m) {
long long r = 1 % m;
while (p) {
if (p & 1) r = r * a % m;
p >>= 1;
a = a * a % m;
}
return r;
}
int main() {
int n, a[26] = {}, t = inf;
scanf("%d"... | 17 |
#include <bits/stdc++.h>
using namespace std;
const int Len = 30;
struct BigNumber {
int X[Len];
void Set(int A) {
memset(X, 0, sizeof(X));
X[0] = A;
}
void Output() {
int P = Len - 1;
while (P && !X[P]) P--;
printf("%d", X[P]);
while (P) {
static int A[8];
P--;
for (in... | 17 |
#include <bits/stdc++.h>
using namespace std;
namespace io {
const int l = 1 << 20;
char buf[l], *s, *t, c;
inline void gc() {
if (s == t) {
t = (s = buf) + fread(buf, 1, l, stdin);
c = s == t ? EOF : *s++;
} else
c = *s++;
}
template <class IT>
inline void gi(IT &x) {
x = 0;
gc();
while (c < '0' ... | 15 |
#include <bits/stdc++.h>
int l;
int h[15];
int main() {
int flag1 = 0, flag2 = 0;
;
memset(h, 0, sizeof(h));
for (int i = 0; i < 6; ++i) {
scanf("%d", &l);
h[l]++;
if (h[l] == 4) flag1 = 1;
if (h[l] == 6) flag2 = 1;
}
for (int i = 1; i < 10; ++i)
if (h[i] == 2) flag2 = 1;
if (flag1 && ... | 3 |
#include <bits/stdc++.h>
using namespace std;
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
const int INF = 1 << 29;
inline int two(int n) { return 1 << n; }
inline int test(int n, int b) { return (n >> b) & 1; }
inline void set_bit(int& n, int b) { n |= two(b); }
inline void unset_bit(int& n, int b... | 10 |
#include <bits/stdc++.h>
using namespace std;
int dp[50][50];
int dp1[50][50][50][50];
int check(int x1, int y1, int x2, int y2) {
int cnt = dp[x2][y2] - dp[x1 - 1][y2] - dp[x2][y1 - 1] + dp[x1 - 1][y1 - 1];
return (cnt == 0);
}
int solve(int r1, int r2, int c1, int c2) {
if (r1 > r2 || c1 > c2) return 0;
int& ... | 11 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int k = 0;
if (n % 2)
k += (n - 3) / 2 + 1;
else
k += n / 2;
printf("%d\n", k);
if (n % 2) n -= 3, printf("%d ", 3);
for (int i = 0; i < n / 2; i++) printf("%d ", 2), k++;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
long long MOD = 998244353;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n >> MOD;
long long ans = 0;
long long fact[n + 1];
fact[0] = 1;
for (int i = 1; i <= n; ++i) {
fact[i] = fact[i - 1] * i % MOD;
}
for... | 8 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 5;
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
bool mm[N];
vector<int> primes(1, 2);
long double nk[N][N];
void sieve() {
for (int i = 4; i < N; i += 2) mm[i] = 1;
for (int i = 3; i * i <= N; i += 2)
if (!mm[i])
for (int j = ... | 19 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e3 + 5;
int n, m;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (!isdigit(ch)) (ch == '-') && (f = -f), ch = getchar();
while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
return x * f;
}
double f[MAXN][MAXN];
inline dou... | 19 |
#include <bits/stdc++.h>
using namespace std;
double dp[110][110][110];
double R, S, P;
int main() {
int r, s, p;
cin >> r >> s >> p;
dp[r][s][p] = 1.0;
for (int i = r; i >= 0; i--) {
for (int j = s; j >= 0; j--) {
for (int k = p; k >= 0; k--) {
double sum = i * j + i * k + j * k;
if (... | 11 |
#include <bits/stdc++.h>
int exceed(int a, int b, int n);
int main() {
int T;
scanf("%d", &T);
int a, b, n;
while (T--) {
scanf("%d %d %d", &a, &b, &n);
printf("%d\n", exceed(a, b, n));
}
}
int exceed(int a, int b, int n) {
int count = 0, cycle = 0;
while (a <= n && b <= n) {
if (a <= b && cyc... | 0 |
#include<bits/stdc++.h>
#define ci const int&
#define TOT(tc,ql,qr) ((qr>=0?s[qr][tc]:0)-(ql>0?s[ql-1][tc]:0))
using namespace std;
struct elem{
int l,r;
long long num;
};
int T,n,C,Q,p[30010],li[30010][5],ri[30010][5],l,r,mid,qi,nc,ni,opl[5],opr[5],sz;
long long qj,s[120010][5];
vector<elem>L[5],tl[30010][5],tr[3001... | 24 |
#include <bits/stdc++.h>
using namespace std;
long long w1, w2, h1, h2;
int main() {
scanf("%lld%lld%lld%lld", &w1, &h1, &w2, &h2);
printf("%lld\n", (h1 + h2) * 2 + (w1 + w2 + w1 - w2 + 4));
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int l, r, a;
cin >> l >> r >> a;
cout << min((l + a) * 2, min((r + a) * 2, (l + r + a) / 2 * 2));
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100;
const int MAXM = 100;
map<string, int> persona;
vector<string> nombre;
vector<string> mensaje;
vector<int> lista_posible[MAXM + 2];
int dp[MAXM + 2][MAXN + 2];
int sol[MAXM + 2][MAXN + 2];
int N;
void init() {
persona.clear();
nombre.clear();
men... | 14 |
#include <cstdio>
#include <iostream>
#include <cassert>
#include <string>
#include <algorithm>
#include <cstring>
#include <utility>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <numeric>
#include <cmath>
#include <deque>
#include <functional>
#include <unordered_map>
#def... | 14 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e+9;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
vector<char> stek(1, '#');
int n = s.size();
for (int i = 0; i < n; i++) {
if (s[i] == stek[stek.size() - 1])
stek.pop_back();
else
... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false), cout.tie(0), cin.tie(0);
int n = 100000;
vector<bool> P(n + 1);
vector<long long> A, B;
for (long long i = 2; i <= n; ++i)
if (!P[i]) {
if (i * i > n)
B.push_back(i);
else
A.push_back(i... | 18 |
#include <bits/stdc++.h>
using namespace std;
long long int val(int s, int e, string str) {
long long int retVal = 0, mul = str[s] - '0';
for (int i = s; i <= e; ++i) {
if (str[i] == '*') {
mul *= str[i + 1] - '0';
} else if (str[i] == '+') {
retVal += mul;
mul = str[i + 1] - '0';
}
... | 13 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 20100403;
long long n, m, q, num, len1, len2;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
int main() {
cin >> n >> m >> q;
num = gcd(n, m);
len1 = n / num;
len2 = m / num;
while (q--) {
long long sx, sy, ex, ey;
... | 6 |
#include <bits/stdc++.h>
using namespace std;
int Dye(long long x) {
printf("? %lld\n", x);
fflush(stdout);
int ans;
scanf("%i", &ans);
return ans;
}
long long SolveFrom(long long x, long long n) {
long long top = n - 1, bot = 1, mid, ans = n, f = 1;
Dye(x);
while (top >= bot) {
mid = top + bot >> 1... | 19 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int N = 3e5 + 7;
namespace pcf {
unsigned int ar[(1000010 >> 6) + 5] = {0};
int len = 0;
int primes[1000010];
int counter[1000010];
int phi_dp[100000][100];
bitset<1000010> isComp;
void Sieve(int N) {
int i, j, sq = sqrt(N);
isComp[1] = tr... | 16 |
#include <bits/stdc++.h>
using namespace std;
long long n, m, tt, ans[1001000], num[1001000], le[1001000], ri[1001000];
struct Node {
long long ls, rs, sum, bj;
void clear() { sum = bj = 0; }
} node[1001000 << 1];
vector<pair<long long, long long> > lq[1001000], rq[1001000];
void build(long long now, long long l, l... | 17 |
#include <bits/stdc++.h>
char s[100005];
int vis[300];
int flag[30];
int main() {
int n, m;
while (~scanf("%d%d", &n, &m)) {
scanf("%s", s);
memset(vis, 0, sizeof(vis));
for (int i = 0; i < strlen(s); i++) vis[s[i]] = 1;
int k = 0;
for (int i = 50; i <= 200; i++)
if (vis[i] == 1) flag[k++]... | 7 |
#include <bits/stdc++.h>
using namespace std;
int n, d, arr[105], m, ans = 0;
int main() {
scanf("%d%d", &n, &d);
for (int i = 0; i < (n); ++i) scanf("%d", &arr[i]);
scanf("%d", &m);
sort(arr, arr + n);
if (m <= n) {
for (int i = 0; i < (m); ++i) ans += arr[i];
} else {
for (int i = 0; i < (n); ++i)... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string only_a, only_b;
for (int i = 1; i <= 300; i++) {
only_a += 'a';
only_b += 'b';
}
cout << only_a << endl;
int x;
cin >> x;
if (x == 0) return 0;
cout << only_b << endl;
int y;
cin >> y;
if (y == 0) return 0;
int n = 600 - x... | 15 |
#include <bits/stdc++.h>
using namespace std;
long long d[] = {0, 9, 99, 999, 9999, 99999,
999999, 9999999, 99999999, 999999999, 9999999999};
int digi(int x) {
int cnt = 0;
while (x) {
cnt++;
x /= 10;
}
return cnt;
}
long long f(long long x, int conta) { retu... | 8 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
const int N = 100010, INF = 0x3f3f3f3f;
int T;
long long l[N], cnt = 0;
string s[N];
void solve() {
long long t;
cin >> t;
string str;
while (t) {
str += t % 10 + '0';
t /= 10;
}
reverse(str.begin(), str.end());
int ans = ... | 5 |
#include <bits/stdc++.h>
const int maxn = 1000010, mod = 1000000007;
int n, k, a[maxn], s[maxn], *t = s, l[maxn], r[maxn];
int main() {
scanf("%d%d", &n, &k);
--k;
*t = -1;
for (int i = 0; i < n; i++) {
scanf("%d", a + i);
while (t > s && a[*t] < a[i]) r[*t--] = i;
l[i] = *t;
*++t = i;
}
whi... | 17 |
#include <bits/stdc++.h>
using namespace std;
int a1, b1, a2, b2, a3, b3;
bool good(int x1, int y1, int x2, int y2) { return (x1 <= x2 && y1 <= y2); }
int f(int A, int B, int C, int D) {
if (good(A + C, max(B, D), a3, b3) || good(max(A, C), B + D, a3, b3))
return true;
return false;
}
int main() {
cin >> a3 >... | 4 |
#include <bits/stdc++.h>
using namespace std;
void file(bool opt) {
if (opt && fopen("in.txt", "r")) {
freopen("in.txt", "r", stdin);
}
}
int n, m;
int sum = 0;
int r = 0;
int a[200000 + 5];
vector<int> que[200000 + 5];
int s[400000 + 5];
bool check(int up) {
for (int i = 1; i <= up; i++) s[i] = 0;
for (int... | 12 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, *pn, mx = 0;
cin >> n;
pn = (int*)malloc(sizeof(int) * n);
memset(pn, 0, sizeof(int) * n);
for (int i = 0; i < n; i++) cin >> pn[i];
for (int i = 0; i <= n - 1; i++)
for (int j = i; j < n; j++) {
int tmp = 0, *tp;
tp = (int*)m... | 4 |
#include <bits/stdc++.h>
using namespace std;
long long n, k, a[1010], tong[1010], ans;
int main() {
scanf("%I64d%I64d", &n, &k);
long long a = 1, b = 3, c = 2 * n + 2 * k;
long long A = (long long)(sqrt(b * b + 4 * a * c) - b) / (2 * a);
ans = n - A;
printf("%I64d", ans);
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
long long n, m, s, ans = 0;
int main() {
long long i, j, a, b, c, d;
cin >> n >> m >> s;
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
for (a = 0; a <= j && a < m - j; a++) {
if (s % (2 * a + 1) == 0 && (s / (2 * a + 1)) % 2 == 1) {
b... | 13 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000 * 1000 * 1000 + 7;
const double EPS = 1e-9;
int bit_count(int first) {
return first == 0 ? 0 : 1 + bit_count(first & (first - 1));
}
inline int last_bit(int first) { return first & -first; }
inline int sign(double first) {
return first < -EPS ? -1 :... | 12 |
#include <bits/stdc++.h>
using namespace std;
int deg[100000], s[100000];
int main() {
int n;
cin >> n;
stack<int> st;
for (int i = 0; i < n; ++i) {
cin >> deg[i] >> s[i];
if (deg[i] == 1) {
st.push(i);
}
}
vector<pair<int, int> > ed;
while (st.size()) {
int u = st.top();
st.pop(... | 7 |
#include <bits/stdc++.h>
const int N = 200010;
const int M = 3010;
const int moder = 998244353;
const int MAX = 64010;
int dp[2][M], dp1[M];
int a[N], w[N];
int ans[2][MAX];
int premod[2][MAX];
int n, m;
int sum = 0, sump = 0, sumn = 0;
int powermod(int a, int exp) {
int ret = 1;
for (; exp > 0; exp >>= 1) {
if... | 15 |
#include <bits/stdc++.h>
using namespace std;
long long s, x;
bool bitX[40], bitS[40];
long long dp[41][2];
int maxBit;
long long solve(int bit, bool carry) {
if (bit == maxBit) return !carry;
if (dp[bit][carry] != -1) return dp[bit][carry];
long long ans;
if (bitX[bit]) {
if (carry) {
if (bitS[bit])
... | 9 |
#include <bits/stdc++.h>
using namespace std;
int n, a, b, c;
int main() {
while (~scanf("%d", &n)) {
scanf("%d%d%d", &a, &b, &c);
if (n == 1)
printf("0\n");
else if (n == 2)
printf("%d\n", min(a, b));
else {
int ans = min(a, b);
if (ans < c) {
printf("%d\n", ans * (n -... | 1 |
#include <bits/stdc++.h>
using namespace std;
int x, pt, ans, cnt[20];
int n, res;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> x;
cnt[x]++;
}
pt = min(cnt[1], cnt[2]);
ans += pt;
cnt[1] -= pt;
cnt[3] += pt;
cnt[2] -= pt;
if (cnt[1] > 0) {
pt = (cnt[1] / 3) * 2;
ans += ... | 13 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n, s, t;
cin >> n >> s >> t;
cout << max(n - s, n - t) + 1;
}
int main(void) {
int t;
cin >> t;
while (t--) {
solve();
cout << "\n";
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 * 1 + 5, inf = 1e9 + 5;
int n, maxi;
stack<int> stk;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int a; n > 0; n--) {
cin >> a;
maxi = max(maxi, a);
if (!stk.empty() && stk.top() == a)
stk.po... | 14 |
#include <bits/stdc++.h>
using namespace std;
const unsigned int maxn = 2000;
constexpr unsigned long long mod = 1e9 + 7;
class Number {
public:
Number() = default;
Number(const unsigned long long v) : val(v % mod) {}
friend inline Number operator+(const Number l, const Number r) {
return (l.val + mod) + r.v... | 11 |
#include <bits/stdc++.h>
using namespace std;
long long int fastMax(long long int x, long long int y) {
return (((y - x) >> (32 - 1)) & (x ^ y)) ^ y;
}
long long int fastMin(long long int x, long long int y) {
return (((y - x) >> (32 - 1)) & (x ^ y)) ^ x;
}
const long long int MAXN = 2e5 + 10;
const long long int L... | 19 |
#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 = 5e5 + 5, M = N << 1;
long long n, m, res[N];
char ch[2];
long lon... | 23 |
#include <bits/stdc++.h>
using namespace std;
int a[1001], b[51];
int main() {
int n, q, e = 1;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> q;
a[q] = 1;
}
for (int i = 1; i <= 1000; i++) {
if (a[i] != 0) {
b[e] = i;
e++;
}
}
for (int i = 1; i < e - 1; i++) {
if ((b[i] +... | 1 |
#include <bits/stdc++.h>
int inp() {
char c = getchar();
int neg = 1;
while (c < '0' || c > '9') {
if (c == '-') neg = -1;
c = getchar();
}
int sum = 0;
while (c >= '0' && c <= '9') {
sum = sum * 10 + c - '0';
c = getchar();
}
return sum * neg;
}
int f[100010][5];
int t[20], g[20];
int m... | 13 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1010, p = 1e9 + 7;
int n, m, a[N], cnt, c[N][N], sz[N], sum[N];
int power(int a, int b) {
int ret = 1;
while (b) {
if (b & 1) ret = 1ll * ret * a % p;
a = 1ll * a * a % p;
b >>= 1;
}
return ret;
}
int add(int a, int b) { return ((a + b) % p... | 11 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int i, k, g;
getline(cin, s);
k = 1;
g = -1;
for (i = 0; i < s.length(); i++)
if (s[i] == '@') {
g = i;
if (k > 1)
k = 0;
else {
cout << "No solution";
return 0;
}
} else
k++;
... | 7 |
#include <bits/stdc++.h>
using namespace std;
pair<long double, long double> get(long double a, long double b,
long double c) {
long double d = b * b - 4 * a * c;
long double qd = (d <= 0 ? 0 : sqrt(d));
long double r1 = (-b + qd) / (2 * a);
long double r2 = (-b - qd) / (2 * a... | 16 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long n, a;
cin >> n;
vector<long> even, odd;
while (n--) {
cin >> a;
if (a % 2 == 0)
even.push_back(a);
else
odd.push_back(a);
}
sort(odd.begin(), odd.end());
sort(even.begin(), even.end());
reverse(odd.begin(), odd.end()... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
if (n % 2 == 0) {
int a = n / 2;
if (a % 2 == 1)
cout << a - 2 << " " << a + 2;
else
cout << a - 1 << " " << a + 1;
return 0;
}
cout << n / 2 << " " << n / ... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long getR(long long x) {
long long l = 0;
long long r = 666666666;
long long mid;
long long res = 0;
while (l <= r) {
mid = (l + r) >> 1;
long long sum = (6 + 6 * mid) * mid / 2;
if (sum >= x) {
r = mid - 1;
} else {
l = mid + 1;
... | 13 |
#include <bits/stdc++.h>
using namespace std;
const int B = 400;
int n, a[200010], s[200010], sta[200010], tp, l, r, mid, ans, Ans, ss[200010],
p[400010];
vector<int> v[200010];
int main() {
Ans = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]), v[a[i]].push_back(i);
int ma = 0, maa;
f... | 22 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<long long> arr(n);
set<int> ans;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
string s;
cin >> s;
... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1;
int main() {
ios::sync_with_stdio(0), cin.tie(0);
long long n;
cin >> n;
long long o, d = sqrt(n) + 3;
for (o = 2; o <= d; o++)
if (o < n and n % o == 0) break;
d = o;
while (d < n) d *= o;
if (d == o or n % o) return cout << "NO" << ... | 11 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
scanf("%d", &q);
long long int n, s, t;
while (q--) {
scanf("%lld %lld %lld", &n, &s, &t);
long long int x = s + t - n;
printf("%lld\n", max(s - x, t - x) + 1);
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int n, m, k, x, y, tot, minx, maxx, miny, maxy, ans, val[1005][1005],
vis[1005][1005];
int dx[4] = {-1, 1, 0, 0}, dy[4] = {0, 0, -1, 1};
char str[1005][1005];
void dfs(int x, int y) {
if (vis[x][y] != tot) vis[x][y] = tot;
int tx, ty;
for (int i = 0; i < 4; i++) {... | 9 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e6 + 20;
const long long inf = 1e10;
long long a[320], b[320];
int main() {
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= n; i++) cin >> b[i];
vector<pair<int,... | 7 |
#include <bits/stdc++.h>
using namespace std;
long long c[1005][105];
long long tenk[1005];
long long tenm[1005];
int main(int argc, const char* argv[]) {
long long n, k, m;
cin >> n >> k >> m;
tenk[0] = tenm[0] = 1;
for (int i = 1; i <= n; i++) {
tenk[i] = (tenk[i - 1] * 10) % k;
tenm[i] = (tenm[i - 1]... | 14 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
string S;
cin >> S;
int L = S.length();
bool haszero = false;
int sum = 0, temp, haseven = 0;
char c;
for (int i = 0; i < S.length(); i++) {
c = S[i];
temp = c - '0';
if (temp % 2 == 0) {
haseven++;
}
if (temp == 0) {
... | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.