solution stringlengths 53 181k | difficulty int64 0 27 |
|---|---|
#include <bits/stdc++.h>
using namespace std;
int a[200010];
int main() {
int n, t, h;
cin >> t;
while (t--) {
long long ans = 0;
cin >> h >> n;
for (int i = 0; i < n; ++i) {
scanf("%d", a + i);
}
a[n] = 0;
a[n + 1] = 0;
int x = h, i = 1;
ans = 0;
while (x > 2) {
if... | 8 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long n, x, y;
string s;
cin >> n >> x >> y >> s;
int cnt(0);
s = '1' + s;
for (int i(1); i <= n; ++i) cnt += s[i - 1] == '1' && s[i] == '0';
long long best(cnt * y);
for (int ... | 7 |
#include <bits/stdc++.h>
using namespace std;
int power(int a, int b, int m, int ans = 1) {
for (; b; b >>= 1, a = 1LL * a * a % m)
if (b & 1) ans = 1LL * ans * a % m;
return ans;
}
function<int(pair<pair<int, int>, pair<int, int> >,
pair<pair<int, int>, pair<int, int> >)>
cmp[2];
pair<pair<int... | 17 |
#include <bits/stdc++.h>
using namespace std;
map<pair<long long, long long>, pair<long long, long long> > f;
void get(long long z, long long &x, long long &y) {
long long base = 1;
y = 0;
while (z >= 10) {
y += (z % 10) * base;
z /= 10;
base *= 10;
}
x = z;
}
pair<long long, long long> dfs(long l... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100005;
int G, R, n;
int d[MAXN], m;
long long s[MAXN];
int itv[MAXN][4];
int b[MAXN * 4];
int st[MAXN * 4], ed[MAXN * 4];
long long rm[MAXN];
int fst[MAXN * 4];
int f(int x) {
int l = 1, r = m;
while (l < r) {
int mid = (l + r) / 2;
if (ed[mid]... | 20 |
#include <bits/stdc++.h>
using namespace std;
double dist(pair<double, double> a, pair<double, double> b) {
return sqrt((a.first - b.first) * (a.first - b.first) +
(a.second - b.second) * (a.second - b.second));
}
double man(pair<double, double> a, pair<double, double> b) {
return abs(a.first - b.firs... | 11 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string f, s;
int a = 0, d = 0, t;
cin >> f >> s;
t = s.size();
for (int i = 0; i <= t; i += 2) {
if (s[i] == '8' && f[i] == '[') {
d++;
} else if (s[i] == '[' && f[i] == '(') {
d++;
} else if (s[i] == '(' && f[i] == '8') {
... | 9 |
#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, const U &b) {
if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, const U &b) {
if (a < b) a = b;
}
char s[101];
int num[8];
int main() {
int n, m, k;
scanf("%d %d %d", &n, &m, &k);
... | 18 |
#include <bits/stdc++.h>
using namespace std;
int x, y, u, v, d = 1, a, b;
int main() {
for (scanf("%d%d", &a, &b); a; b /= 4, d *= 2, --a) {
if (b % 4 == 0)
u = y, v = x;
else if (b % 4 == 1)
u = x, v = y + d;
else if (b % 4 == 2)
u = x + d, v = y + d;
else
u = 2 * d - y - 1, ... | 7 |
#include <bits/stdc++.h>
using namespace std;
template <typename _T>
inline void read(_T &f) {
f = 0;
_T fu = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-') {
fu = -1;
}
c = getchar();
}
while (c >= '0' && c <= '9') {
f = (f << 3) + (f << 1) + (c & 15);
c = getch... | 17 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, x2, y2, turn;
scanf("%d%d%d%d", &x, &y, &x2, &y2);
turn = 0;
while (1) {
if (!turn) {
if (!x)
y--;
else if (!y)
x--;
else {
if (y2 > y)
x--;
else
y--;
}
if (... | 9 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t, n, x, a, b, total = 0;
cin >> t;
while (t--) {
cin >> n >> x >> a >> b;
total = n - (abs(a - b) + 1);
if (total >= x) {
cout << x + abs(a - b) << endl;
} else {
cout <... | 0 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 9223372036854775807ll;
long long n, m, cg, cs, ans = INF;
struct edge {
long long x, y, g, s;
bool operator<(const edge b) const {
return g < b.g || (g == b.g && s < b.s);
}
} e[50005];
long long fa[205];
vector<long long> add, mst, edg;
long... | 14 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
cout << "I hate";
for (int i = 2; i <= a; i++) {
if (i % 2 == 0)
cout << " that I love";
else
cout << " that I hate";
}
cout << " it";
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
bool oddsAndEnds(vector<int> arr, int n) {
if ((n % 2 == 1) && (arr[0] % 2 == 1) && (arr[n - 1] % 2 == 1)) {
return true;
}
return false;
}
int main(int argc, char const *argv[]) {
int n;
bool odd;
cin >> n;
vector<int> arr(n);
for (int i = 0; i < arr.si... | 2 |
#include <bits/stdc++.h>
using namespace std;
int n, m, h;
int main() {
scanf("%d%d%d", &n, &m, &h);
int sum = 0, th = 0;
for (int i = 1; i <= m; i++) {
int x;
scanf("%d", &x);
if (i == h)
th = x;
else
sum += x;
}
if (sum + th < n) {
puts("-1");
return 0;
}
double pro =... | 8 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const int N = 2e5 + 5;
int pref[N];
const int dx[] = {0, -1, 1, 0};
const int dy[] = {1, 0, 0, -1};
const long long inf = 1e18;
long long a[32], b[N];
bool f(long long x, long long n) {
long long h = 0;
for (long long i = 0; i < n; i++) {
... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (~scanf("%d", &n)) {
printf("%d %d\n", n / 7 * 2 + (n % 7 == 6 ? 1 : 0),
n / 7 * 2 + ((n % 7) > 2 ? 2 : n % 7));
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
for (T e : v) {
os << e << ' ';
}
return os;
}
template <typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
return os << "(" << p.firs... | 15 |
#include <bits/stdc++.h>
using namespace std;
long long a[100010];
long long s[100010];
int main() {
int T;
cin >> T;
while (T--) {
long long ans = 0, minn = 0;
int n;
scanf("%d", &n);
long long summ = 0;
for (register int i = 1; i <= n; i++) scanf("%lld", &a[i]), summ += a[i];
minn = min(... | 5 |
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
bool comp(pair<int, pair<int, char>> a, pair<int, pair<int, char>> b) {
if (a.first < b.first) {
return 1;
}
if (a.first == b... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = (1 << 20);
const int MAXMASK = (1 << 24);
const int inv_mask = MAXMASK - 1;
inline int inv(int mask) { return inv_mask ^ mask; }
int n;
string a[MAXN];
int m[MAXN];
void read() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
m[i] = 0;
... | 19 |
#include <bits/stdc++.h>
const int N = 3605, mo = 998244353;
int H, W, n, i, j, ch, cw, r1, c1, r2, c2, fh[N][N], fw[N][N], gh[N][N],
gw[N][N], C[N][N], fac[N], ans;
bool bh[N], bw[N];
int main() {
for (i = ** C = 1; i < N; ++i)
for (j = *C[i] = 1; j <= i; ++j)
C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) ... | 18 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s1;
cin >> s1;
int sum = 0, a[s1.size() + 1];
a[0] = 0;
int k = 1;
for (int i = 0; i < s1.size(); i++) {
a[k] = s1[i] - 97;
k++;
}
for (int i = 1; i < s1.size() + 1; i++) {
int b;
b = abs(a[i] - a[i - 1]);
int c = 26 -... | 0 |
#include <bits/stdc++.h>
using namespace std;
int Q;
long long A, B, M;
bool f(int K) {
if (K == 1) {
if (A == B) {
printf("%d %lld\n", 1, A);
return true;
}
return false;
}
if (K == 2) {
if (B - A <= M) {
printf("%d %lld %lld\n", 2, A, B);
return true;
}
return fal... | 14 |
#include <bits/stdc++.h>
using namespace std;
int t, a[3], ans;
int main() {
cin >> t;
while (t--) {
ans = 0;
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
reverse(a, a + 3);
for (int i = 0; i < 3; i++) {
if (a[i]) {
ans++;
a[i]--;
}
}
if (a[0] and a[1]) {
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long n, i;
cin >> n;
long long ar[n], j;
for (i = 0; i < n; ++i) cin >> ar[i];
sort(ar, ar + n);
j = 1;
for (i = 0; i < n; ++i) {
if (ar[i] >= j) ++j;
}
cout << j << endl;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long int n, m, k;
long long int p[100000];
cin >> n >> m >> k;
for (int i = 0; i < m; i++) {
cin >> p[i];
}
long long int kol = (p[0] / k);
if (p[0] % k != 0) {
kol++;
}
long long int ... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int P = 1e9 + 7;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long qpow(long long a, long long n) {
long long r = 1 % P;
for (a %= P; n; a = a * a % P, n >>= 1)
if (n & 1) r = r * a % P;
return r;
}
long long inv(long long x... | 17 |
#include<bits/stdc++.h>
#define ll long long
#define Il inline
#define Re register
#define mem(u,v) memset(u,v,sizeof(u))
#define rep(i,a,b) for(Re ll i=(a);i<=(b);i++)
#define drep(i,a,b) for(Re ll i=(a);i>=(b);i--)
#define go(u) for(ll i=head[u],v=e[i].to;i;i=e[i].nxt,v=e[i].to)
#define writesp(x) write(x),putchar(' ... | 10 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5, M = 1e5 + 5;
int tree1[4 * N], tree2[4 * N], lazy2[4 * N];
int query1(int i, int l, int r, int L, int R) {
if (r < L || R < l) return 0;
if (L <= l && r <= R) return tree1[i];
int m = (l + r) / 2;
return max(query1(2 * i + 1, l, m, L, R), quer... | 23 |
#include <bits/stdc++.h>
using namespace std;
struct node {
int t;
int t2;
int pos;
};
long long ans = 1e18;
int s, g, r;
int vis[10005][1005];
queue<node> q;
int d[10005];
int n, m;
node Back(node u) {
if (u.pos == 1) return {-1, -1, -1};
int w = d[u.pos] - d[u.pos - 1];
if (w + u.t > g) return {-1, -1, -1... | 16 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
long long int n, d, h;
cin >> n >> d >> h;
if (n == 2) {
if (d != 1 || h != 1)
cout << -1;
else
cout << "1 2";
} else {
if (d < h || d > 2 * h || d == 1)
cout << -1;
else {
... | 8 |
#include <bits/stdc++.h>
using namespace std;
queue<int> q;
int n, m, s, idx, tot;
int ea[333333 * 2], eb[333333 * 2], ed[333333 * 2], ec[333333], vis[333333],
tag[333333 * 2], cnt[333333 * 2], oud[333333 * 2];
void add(int x, int y, int z) {
tot++;
ea[tot] = y;
eb[tot] = ec[x];
ec[x] = tot;
ed[tot] = z;
... | 11 |
#include <bits/stdc++.h>
int main() {
int len, t;
char s[200005];
int i;
int point;
int place;
scanf("%d %d\n", &len, &t);
for (i = 0; i < len; i++) {
s[i] = getchar();
if (s[i] == '.') point = i;
}
int cur;
for (cur = point + 1; cur < len; cur++)
if (s[cur] >= '5') break;
if (cur == l... | 9 |
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string... | 15 |
#include <bits/stdc++.h>
using namespace std;
map<long long, long long> mp;
map<long long, long long>::iterator it;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long a = 0, b = 0, c, d, e, f = 0, l, g, m, n, k, i, j, t, p, q, sum = 0,
ssum, pp;
cin >> n >> k;
... | 14 |
#include <bits/stdc++.h>
long long int hash[1000005], i, j, n, h, yer, cvp[12000], a[78800];
long long int ters(long long int a) {
int cvp[20] = {0}, i = 0, j, sonuc = 0, k = 1;
while (a) {
cvp[i] = a % 10;
a /= 10;
i++;
}
for (j = i - 1; j >= 0; j--) {
sonuc += k * cvp[j];
k *= 10;
}
re... | 8 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
const int X = 20;
int kc;
vector<int> adj[N];
int dep[N], par[N][X];
int st[N], en[N];
int ord[N];
void dfs(int v) {
st[v] = ++kc;
ord[kc] = v;
dep[v] = dep[par[v][0]] + 1;
for (int i = 1; i < X; i++) {
par[v][i] = par[par[v][i - 1]][i - 1... | 16 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2 * 1000 * 100 + 10;
const double EPS = 1e-9;
const long long MOD = 1000 * 1000 * 1000 + 7;
vector<int> ans;
vector<char> cl;
bool check_cycle(int v, vector<vector<int> > &g) {
cl[v] = 1;
for (size_t i = 0; i < g[v].size(); ++i) {
int to = g[v][i];
... | 7 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
const int maxn = 200100;
set<int> sset;
int p[maxn], f[maxn][20], g[maxn], h[maxn];
int llg[maxn];
int Inv(int a) {
return a <= 1 ? 1 : 1ll * Inv(MOD % a) * (MOD - MOD / a) % MOD;
}
int query(int L, int R, int x = 0) {
if (L == R) return x;
... | 16 |
#include <bits/stdc++.h>
using namespace std;
long long a[100005], b[100005];
map<long long, long long> mp1, mp2;
int main() {
int n, m, y1, y2;
scanf("%d%d", &n, &y1);
for (int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
}
scanf("%d%d", &m, &y2);
long long ans = 0;
for (int i = 1; i <= m; i++) {
... | 17 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:16777216")
using namespace std;
int main() {
char a[10] = {0};
char b[10] = {0};
char bb = 1;
int hj = 0;
scanf("%c", &bb);
do {
a[hj] = bb;
hj++;
scanf("%c", &bb);
} while (bb != ':');
a[hj] = 0;
scanf("%s", &b);
int begA = -1;
... | 8 |
#include <bits/stdc++.h>
using namespace std;
inline long long Pow(long long a, long long b) {
long long res = 1;
while (b) {
if (b & 1) res = res * a % 1000000007;
a = a * a % 1000000007;
b >>= 1;
}
return res;
}
long long fac[2000005], inv[2000005], f[2000005];
inline long long C(long long b, long... | 16 |
#include <bits/stdc++.h>
using namespace std;
void print(int l, int r) {
bool mark = false;
for (int i = l, j = r; i <= j; mark = !mark) {
if (!mark) {
cout << i << ' ';
i++;
} else {
cout << j << ' ';
j--;
}
}
}
int main() {
ios_base::sync_with_stdio(0);
int n, k;
cin >>... | 4 |
#include <bits/stdc++.h>
using namespace std;
int a[100000];
int b[100000];
int t;
int n;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i - 1] != a[i]) {
b[a[i]] = 0;
}
b[a[i]]++;
t = max(t, min(b[1], b[2]) * 2);
}
cout << t << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
long long mulmod(long long a, long long b, long long c) {
long long x = 0, y = a % c;
while (b > 0) {
if (b % 2 == 1) {
x = (x + y) % c;
}
y = (y * 2) % c;
b /= 2;
}
return x % c;
}
long long modulo(long long a, long long b, long long c) {
lo... | 6 |
#include <bits/stdc++.h>
using namespace std;
char linea[1010];
char lineb[1010];
int m[1010][1010];
int ta, tb;
int leta[30], letb[30];
void printM() {
for (int i = 0; i < ta + 1; i++) {
for (int j = 0; j < tb + 1; j++) {
printf("%d", m[i][j]);
}
puts("");
}
}
int main() {
gets(linea);
gets(l... | 4 |
#include <bits/stdc++.h>
using namespace std;
map<int, vector<int> > mm;
int a[100100];
int b[100100];
int main() {
int n, m;
scanf("%d %d", &n, &m);
int x;
for (int i = 0; i < n; i++) {
scanf("%d", &x);
mm[x].push_back(i);
}
int ans = 1;
for (int i = 0; i < m; i++) {
scanf("%d", &x);
auto... | 7 |
#include <bits/stdc++.h>
using namespace std;
const int N = 131420;
int n, k, x;
vector<int> rem[N];
bool Gao(vector<int> &arr, int lid, int rid, int lv, int rv) {
int s = rid - lid + 1, h = s >> 1;
long long vd = rv - 1LL - lv;
if (s == 0) {
return lv < rv;
}
if (vd < s) {
return 0;
}
if (lv < -h... | 14 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int del, n;
cin >> del >> n;
string wall;
for (int i = 0; i < del; i++) {
cin >> wall;
}
vector<char> v;
int c = 0;
v.push_back(wall[0]);
for (int i = 1; i < n; i++) {
if (wall[i] != v[c]) {
c++;
v.push_back(wall[i]);
}... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c, a, x = 1;
cin >> n >> m;
int arr[201] = {};
vector<pair<int, int> > res;
for (int i = 0; i < m; i++) {
cin >> c;
for (int j = 0; j < c; j++) {
cin >> a;
arr[a] = x;
x++;
}
}
int emp = n;
for (int i = 1;... | 10 |
#include <bits/stdc++.h>
using namespace std;
const int N = 200001;
struct node {
int nxt, to;
} e[N << 1];
int head[N], cnt = 0, siz[N], son[N], fa[N], max_son, col[N], a[N], maxx, n, x,
y, Son;
long long sum, ans[N];
void add(int u, int v) {
e[++cnt].nxt = head[u];
head[u] = cnt;
e[cnt].to = v;
}... | 15 |
#include <bits/stdc++.h>
using namespace std;
const int mxn = 400005;
const int mod = 1e9 + 7;
long long ans;
int n, m, num, cir, r, cnt;
int head[mxn], que[mxn];
struct edge {
int to, next;
long long w;
} f[mxn << 2];
long long p[105], circle[mxn], dis[mxn], dig[2], pw[105];
inline void add(int u, int v, long long... | 18 |
#include <bits/stdc++.h>
using namespace std;
const int N = 200200;
int a[N], l[N], r[N];
int main() {
int n, k, x;
scanf("%d%d%d", &n, &k, &x);
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
}
for (int i = 1; i < n; ++i) {
l[i] = a[i - 1] | l[i - 1];
}
for (int i = n - 2; i >= 0; --i) {
r[... | 9 |
#include <bits/stdc++.h>
const int N = 2e5 + 10, mod = 998244353;
int a[N], b[N], c[N], d[N], f0[N], f1[N], f2[N], G[N], g[5][N], rev[N], n, L,
ans;
using namespace std;
int power(int a, long long b) {
int res = 1, c = a;
while (b) {
if (b & 1) res = 1ll * res * c % mod;
b >>= 1, c = 1ll * c * c % mod;
... | 26 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
;
int n;
cin >> n;
long long ans = 0;
for (int i = 1; i <= n; i++) {
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
int x = x1 - x2;
if (x < 0) x *= -1;
int y = y1 - y2;
x++;
if (y < 0)... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int t;
cin >> t;
while (t--) {
long long int n;
cin >> n;
long long int a[n];
map<long long int, long long int> m;
for (long long int i = 0; i < n; i++) {
cin >> a[i];
m[a[i]]++;
}
vector<long long int> v;... | 10 |
#include <bits/stdc++.h>
const int INF = 1 << 29;
int solve(int a, int b, int c, int n) {
int diff1 = a - c, diff2 = b - c;
int ans = 0;
if (diff1 < 0 || diff2 < 0)
return -1;
else
ans = n - diff1 - diff2 - c;
if (ans > 0)
return ans;
else
return -1;
}
int main() {
std::ios_base::sync_with... | 2 |
#include <bits/stdc++.h>
using namespace std;
void tach(int i, int j, vector<int>& tap, vector<int>& trai,
vector<int>& phai) {
trai.clear();
phai.clear();
for (int k = 0; k < tap.size(); k++) {
if (tap[k] == i or tap[k] == j) continue;
printf("2 %d %d %d\n", i, j, tap[k]);
fflush(stdout);
... | 15 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, mini = 1000000001;
cin >> n;
long long int k[n], track, p[n];
for (long long int i = 0; i < n; i++) {
cin >> k[i];
p[i] = k[i];
}
sort(k, k + n);
if (k[0] == k[1])
cout << "Still Rozdil";
else {
for (int i = 0; i... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i, t;
cin >> n;
vector<pair<long long, long long> > v;
for (i = 0; i < 2 * n; i++) {
long long a;
cin >> a;
v.push_back({a, i});
}
sort(v.begin(), v.end());
long long sum = 0;
for (i = 0; i < 2 * n; i += 2) {
if (i =... | 4 |
#include <bits/stdc++.h>
using namespace std;
int a[200000];
int l[200000];
int r[200000];
int d[200000];
int id[200000];
int cc[200001];
int main() {
ios::sync_with_stdio(false);
int m, n, k, t;
cin >> m >> n >> k >> t;
for (int i = 0; i < m; i++) {
cin >> a[i];
}
for (int i = 0; i < k; i++) {
cin ... | 11 |
#include <bits/stdc++.h>
using namespace std;
char buf[1005][5];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> buf[i];
}
for (int i = 0; i < n; i++) {
string best = "2012";
for (int j = 0; j < 4; j++) {
for (int t = '0'; t <= '9'; t++) {
string cur = buf[i];
... | 9 |
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-10, INFTY = 1e10;
int N, M;
int roomX[505], roomY[505], roomZ[505];
int X[505], Y[505], price[505];
int ceil(int x, int y) {
if (x % y == 0)
return x / y;
else
return x / y + 1;
}
int floor(int x, int y) { return x / y; }
int cost(int room,... | 8 |
#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;
long long a[n];
unordered_set<int> v;
for (int i = 0; i < n; i++) {
cin >> a[i];
int index = (i + a[i]) % n;
if (... | 8 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000009;
void solve() {
int m, n;
cin >> m >> n;
long double ans = m;
for (int i = m - 1; i > 0; --i) {
long double d = i;
d /= m;
ans -= pow(d, n);
}
cout << setprecision(10) << ans << "\n";
}
int main() {
ios_base::sync_with_st... | 8 |
#include <bits/stdc++.h>
int N, A[1000], K;
static constexpr int MOD = 998244353;
int subtask(int D) {
static int dp[1001][1001];
for (int i = 0; i <= N; ++i) dp[i][1] = i;
for (int i = 2; i <= K; ++i) {
for (int j = 0; j < i; ++j) dp[j][i] = 0;
for (int j = i; j <= N; ++j) {
dp[j][i] = dp[j - 1][i]... | 17 |
#include <bits/stdc++.h>
using namespace std;
vector<int> adj[2 * 1024];
int ncomp;
int comp[2 * 1024];
int vis[2 * 1024], stck[2 * 1024], t, high[2 * 1024];
int num;
void dfscc(int u) {
int i, v;
high[u] = vis[u] = num--;
stck[t++] = u;
for (i = 0; i < (int)adj[u].size(); i++) {
v = adj[u][i];
if (!vis... | 11 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
void add(int& x, int y) { ((x += y) >= MOD) && (x -= MOD); }
int mul(int x, int y) { return x * 1ll * y % MOD; }
int K;
bool read() {
if (scanf("%d", &K) < 1) {
return 0;
}
return 1;
}
const int MAXK = 400 + 10;
int dp[MAXK][MAXK];
int C[2... | 20 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s[7];
map<string, int> m;
s[0] = "monday";
s[1] = "tuesday";
s[2] = "wednesday";
s[3] = "thursday";
s[4] = "friday";
s[5] = "saturday";
s[6] = "sunday";
for (int i = 0; i < 7; i++) {
m[s[i]] = i;
}
string s1, s2;
cin >> s1 >... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int ans = 1;
cin >> n;
vector<int> a;
for (int i = 0; i < n; i++) {
int ta;
cin >> ta;
a.push_back(ta);
}
sort(a.begin(), a.end());
for (int i = 0; i < n; i++) {
if (a[i] >= ans) {
ans++;
}
}
cout << ans << e... | 4 |
#include <bits/stdc++.h>
using namespace std;
long long a, b, c, d, e, i, j, ii, jj, zx, xc, f[150009], bo[150009], K, B,
msh[150009], p[150009], pi, cnt, ans, jm, X, pas, dep[150009], MX, za,
dp[150009];
pair<long long, long long> segK[600009], segB[600009];
vector<long long> v[150009];
long long op;
void dfs(... | 19 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int a, b, c, d;
cin >> a >> b >> c >> d;
int mp = a;
int mt = c;
int vp = b;
int vt = d;
int p = mp;
int t = mt;
int mr = max((3 * p) / 10, p - ((p / 250) * t));
p = vp;
t = vt;
... | 1 |
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#include<bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <uno... | 0 |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0, y = 0;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') y = 1;
ch = getchar();
}
while (ch >= '0' && ch <= '9')
x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
return y ? -x : x;
}
template <typen... | 13 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, ele;
cin >> n;
a = 1, b = 2;
bool f = 1;
for (int i = 0; i < n; i++) {
cin >> ele;
if (a == ele) {
b = abs(6 - (a + b));
} else if (b == ele) {
a = abs(6 - (a + b));
} else {
f = 0;
break;
}
... | 1 |
#include <bits/stdc++.h>
using namespace std;
struct Node {
int s;
pair<int, int> e[26];
};
int N;
Node trie[300001];
int precalc(int n) {
trie[n].s = 1;
for (int i = int(0); i < int(26); i++) {
if (~trie[n].e[i].first) trie[n].s += precalc(trie[n].e[i].second);
}
return trie[n].s;
}
int merge(Node &l, ... | 17 |
#include <bits/stdc++.h>
using namespace std;
int a[6];
int main() {
int m, x, y, i;
scanf("%d", &m);
for (i = 0; i < m; ++i) {
scanf("%d%d", &x, &y);
++a[x], ++a[y];
}
if (m != 5)
printf("WIN");
else {
for (i = 1; i <= 5; ++i) {
if (a[i] != 2) {
printf("WIN");
return 0... | 5 |
#include <bits/stdc++.h>
using namespace std;
vector<int> zboroi[505050];
int dp[1010101];
int main() {
ios::sync_with_stdio(false);
int n, c;
cin >> n >> c;
int t, t2;
for (int ctr1 = 0; ctr1 < n; ctr1++) {
cin >> t;
for (int ctr2 = 0; ctr2 < t; ctr2++) {
cin >> t2;
zboroi[ctr1].push_back... | 14 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, s = 0;
cin >> n >> k;
int a[100005];
for (int i = 0; i < n; i++) {
int x;
cin >> x;
a[x % k]++;
}
for (int i = 1; i < (k + 1) / 2; i++) {
s = s + min(a[i], a[k - i]);
}
if (k % 2 == 0) s = s + (a[k / 2] / 2);
cout << ... | 4 |
#include <bits/stdc++.h>
int main() {
int n, m;
scanf("%d %d", &n, &m);
if (n > m) {
int t = n;
n = m;
m = t;
}
long long ans;
if (n == 1) {
ans = m / 6 * 6;
m %= 6;
if (m == 4) {
ans += 2;
} else if (m == 5) {
ans += 4;
}
} else if (n == 2) {
if (m == 2) {
... | 14 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
long long n, k, m, p[N], rnk[N], sz[N], a[N];
int prv[N], nxt[N], base[N];
set<int> st;
void init(int n) {
for (int i = 0; i < n; i++)
p[i] = i, sz[i] = 1, prv[i] = i - 1, nxt[i] = i + 1;
}
int _find(int x) { return (p[x] == x ? x : p[x] = _find... | 15 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
int n = s.size();
cout << "3" << endl;
cout << "L"
<< " "
<< "2" << endl;
cout << "R 2" << endl;
cout << "R " << 2 * n - 1;
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 15;
char s[MAXN], t[MAXN];
int n, m, tag;
inline int read() {
int r = 0, z = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') z = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
r = r * 10 + ch - '0';
... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int N = 300005;
int f[N][26];
int main() {
int n, m;
scanf("%d %d", &n, &m);
string s;
cin >> s;
s = '*' + s;
for (int i = 1; i <= n; i++) {
f[i][s[i] - 'a']++;
}
vector<vector<int>> g(n + 1);
vector<int> in_deg(n + 1, 0);
for (int i = 0; i < m... | 9 |
#include <bits/stdc++.h>
using namespace std;
int arr[100005], pos[100005];
int N;
vector<pair<int, int> > sol;
bool primi[100005];
void GeneraPrimi() {
memset(primi, true, sizeof(primi));
primi[0] = primi[1] = false;
for (int i = 2; i < 100005; i++)
if (primi[i])
for (int j = 2 * i; j < 100005; j += i)... | 10 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
long long int ss = 0;
int c = 0;
cin >> s;
if (s.size() == 1)
cout << c << endl;
else {
for (int i = 0; i < s.size(); i++) {
int x = s[i] - '0';
ss += x;
}
c+... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int logn = 17;
const int maxn = 100000;
const int ts = 1 << 17;
vector<int> g[maxn];
int tin[maxn], tout[maxn];
string str[maxn];
unordered_map<string, int> bank;
int n, _time = 0;
int ver[maxn], d[maxn];
int color[maxn];
long long ans[maxn];
unordered_set<int> cnt[ma... | 16 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> m >> n;
double ans = 0, d[m + 1];
d[0] = 0;
for (int i = 1; i <= m; ++i) {
d[i] = pow((double)i / m, n) - d[i - 1];
ans += i * (d[i]);
d[i] += d[i - 1];
}
printf("%lf", ans);
return 0;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void prn(Arg1&& arg1) {
cout << arg1 << "\n";
}
template <typename Arg1, typename... Args>
void prn(Arg1&& arg1, Args&&... args) {
cout << arg1 << " ";
prn(args...);
}
template <typename Arg1>
void prs(Arg1&& arg1) {
cout << arg1 << " ";
}
t... | 15 |
#include <bits/stdc++.h>
void read(int& x) {
x = 0;
char c;
do c = getchar();
while (c < '0' || c > '9');
while (c >= '0' && c <= '9') {
x = x * 10 + c - '0';
c = getchar();
}
}
using namespace std;
struct edge {
int t, c, nx;
long long w;
} e[9000 * 2 + 5];
int a[3000 + 5], h[3000 + 5], en = 1;... | 15 |
#include <bits/stdc++.h>
using namespace std;
long long arr[200009] = {0};
long long brr[200009] = {0};
void update(long long data, int idx) {
while (idx <= 200007) {
brr[idx] += data;
idx += (idx & -idx);
}
}
double read(int idx) {
long long sum = 0;
while (idx > 0) {
sum += brr[idx];
idx -= (i... | 8 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
bool bit(int mask, int pos) { return (mask >> pos) & 1; }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<vector<int> > d(n, vector<int>(n, inf));
vector<int> deg(n);
vector<int> used(n);
for (i... | 16 |
#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:102400000,102400000")
template <class Z>
inline bool checkmax(Z &a, Z b) {
if (a == -1 || a < b) {
a = b;
return true;
}
return false;
}
template <class Z>
inline bool checkmin(Z &a, Z b) {
if (a == -1 || a > b) {
a = b;
... | 10 |
#include <bits/stdc++.h>
using namespace std;
string name[6] = {"Power", "Time", "Space", "Soul", "Reality", "Mind"};
string color[6] = {"purple", "green", "blue", "orange", "red", "yellow"};
long long used[6];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
long long n;
string s;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int a, i, j, k, x, y, m[36001];
long long ans, t;
string s;
int main() {
cin >> a >> s;
for (i = 0; i < s.size(); i++) {
for (k = 0, j = i; j < s.size(); j++) {
k += s[j] - '0';
m[k]++;
}
}
if (a == 0) {
t = s.size() * (s.size() + 1) / 2;
... | 8 |
#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;
bool mark[MAXN];
char... | 15 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char** argv) {
int n, s;
cin >> n >> s;
if (s < n + n) {
puts("NO");
return 0;
}
puts("YES");
for (int i = 1; i < n; i++) cout << 2 << " ";
cout << s - (n - 1) * 2 << "\n";
cout << 1;
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = (long long)(1e9 + 7);
int n;
long long f[22], s, inv[55];
long long nCr(long long n, long long r) {
if (r > n) return 0;
if (n - r < r) r = n - r;
n %= mod;
long long ans = 1;
for (int(i) = 0; (i) < (int)(r); (i)++) {
ans = (ans * (n - i)... | 15 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.