solution stringlengths 53 181k | difficulty int64 0 27 |
|---|---|
#include <bits/stdc++.h>
using namespace std;
double d;
int n, m, k;
double a[222222];
double b[222222];
double ans = 0;
int main() {
cin >> n >> m >> k;
if (k >= m) {
cout << "1\n";
return 0;
}
for (int i = 0; i < n; ++i) a[i] = i + 1;
for (int i = n; i < n + m; ++i) a[i] = i + 1 - n;
for (int i = ... | 16 |
#include <bits/stdc++.h>
using namespace std;
int n;
int a[100005];
int main() {
scanf("%d", &n);
for (int i = (0); i < (n); i++) {
scanf("%d", a + i);
}
vector<int> res;
int bs = 0;
while (true) {
bool need = false;
for (int k = (0); k < (n); k++)
if (a[k]) need = true;
if (!need) bre... | 19 |
#include <bits/stdc++.h>
using namespace std;
namespace yetanother {
int n;
int a[100100];
int dpfor[100100][61];
int dpbac[100100][61];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i <= 60; i++) {
if (a[0] + 30 <= i) {
... | 12 |
#include <bits/stdc++.h>
using namespace std;
void ga(int N, int *A) {
for (int i(0); i < N; i++) scanf("%d", A + i);
}
long long N, A[(1 << 17)], d, a, b, c, B, H, f;
long long pc(long long M) { return M / a; }
int main(void) {
scanf("%lld%lld%lld%lld", &N, &a, &b, &c);
B = pc(N);
if (N >= b) {
H = N - b;
... | 9 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i <= n; i += 1234567) {
for (int j = 0; i + j <= n; j += 123456) {
if ((n - i - j) % 1234 == 0) {
puts("YES");
return 0;
}
}
}
puts("NO");
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (a == 0)
return b;
else
return gcd(b, b % a);
}
long long cnk(long long n, long long k, long long mod) {
if (k > n) return 0;
double result = 1;
long long lal = 0;
for (long long lol = n; lol > n - k; lol--) {... | 6 |
#include <bits/stdc++.h>
using namespace std;
struct Fenwick {
int a[101010], n;
void init(int sz) {
n = sz;
memset(a, 0, (n + 1) * sizeof(a[0]));
}
void add(int j) {
for (int k = j; k <= n; k += k & -k) a[k]++;
}
int calc(int j) {
int rlt = 0;
for (int k = j; k; k -= k & -k) rlt += a[k]... | 19 |
#include <bits/stdc++.h>
using namespace std;
const int Imx = 2147483647;
const int mod = 1000000007;
const long long Lbig = 2e18;
inline long long getnum() {
register long long r = 0;
register bool ng = 0;
register char c;
c = getchar();
while (c != '-' && (c < '0' || c > '9')) c = getchar();
if (c == '-')... | 16 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int k = 1;
int all = 0;
int s = 0;
while (all + k <= n) {
n -= k;
s++;
if (k == 1)
k = 2;
else
k = 1;
}
cout << s << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 500008;
int fa[maxn], a[maxn], n;
int p[maxn][21], cnt[maxn];
struct Tseg {
int size, s[maxn << 2], n;
inline int update(int i, int j) { return a[i] < a[j] ? i : j; }
void init(int len, int a[]) {
n = len;
size = 1;
while (size < n + 2) si... | 9 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using tpl = tuple<int, int, int>;
using pcc = pair<char, char>;
const int inf = 9999999;
const ll mod = 1e9 + 7;
int dr[] = {-1, 0, 1, 0};
int dc[] = {0, 1, 0, -1};
int kr[] = {-1, 1, -2, -2, -1, 1, 2, 2};
int kc[] = {-2, -2... | 3 |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
register int x = 0, t = 1;
register char ch = getchar();
while ((ch < '0' || ch > '9') && ch != '-') ch = getchar();
if (ch == '-') t = -1, ch = getchar();
while (ch <= '9' && ch >= '0') x = x * 10 + ch - 48, ch = getchar();
return x * t;
}
i... | 20 |
#include <bits/stdc++.h>
using namespace std;
int num[205];
int main() {
ios::sync_with_stdio(false);
int T, n;
set<int> ss;
cin >> T;
while (T--) {
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> num[i];
}
ss.clear();
for (int i = 0; i < n; ++i) {
ss.insert(num[i] - num[(i + 1)... | 2 |
#include <bits/stdc++.h>
double t[5], temp;
double x_1, y_1, r1, x2, y2, r2, x3, y3, r3, X = 0.0, Y = 0.0;
int f = 0;
double check(double dx, double dy) {
double ret = 0.0;
t[0] = sqrt(((dx - x_1) * (dx - x_1)) + ((dy - y_1) * (dy - y_1))) / r1;
t[1] = sqrt(((dx - x2) * (dx - x2)) + ((dy - y2) * (dy - y2))) / r2;... | 18 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
cout << (n - 2) * (n - 2) << endl;
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
const int M = 5e3 + 3;
int n, p, dp[M][M], ans[M], cnt[M], now;
string s;
bool mark[M][M], markp[M][M], palin[M][M];
bool ispal(int l, int r) {
if (l == r || l > r) return true;
if (markp[l][r]) return palin[l][r];
markp[l][r] = true;
if (s[l] == s[r] && ispal(l + 1... | 11 |
#include <bits/stdc++.h>
using namespace std;
int n, x, y, result;
int discover(int vals[], int size) {
int from = 0, to = size;
while (from + 1 < to) {
int mid = (from + to) / 2;
cout << "? " << (mid - from);
for (int i = from; i < mid; i++) {
cout << " " << vals[i];
}
cout << "\n";
c... | 16 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1234567;
int fenw[N];
void modify(int x, int v) {
while (x < N) {
fenw[x] += v;
x = (x | (x - 1)) + 1;
}
}
int find_sum(int x) {
int v = 0;
while (x > 0) {
v += fenw[x];
x &= x - 1;
}
return v;
}
int a[N], b[N], dir[N];
int k;
vecto... | 16 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
while(t--) {
int r, c;
cin >> r >> c;
char b[r][c+1];
for(int i=0; i<r; i++) cin >> b[i];
int ll[r][c], rl[r][c];
for(int i=0; i<r; i++) {
int lcntr=0, rcntr=0;
for(int j=... | 6 |
#include <bits/stdc++.h>
using namespace std;
long long ans = 0, powi[52];
long long mytree(long long h, long long n, bool lft) {
if (h == 0) return 0;
if (n <= powi[h - 1]) {
if (lft) {
return mytree(h - 1, n, false) + 1;
} else {
return mytree(h - 1, n, false) + powi[h];
}
} else {
i... | 9 |
#include <bits/stdc++.h>
using namespace std;
long long k, a, b;
int M = 1e9 + 7;
int d[2001][2001];
void exgcd(int a, int b, int &x, int &y) {
if (b == 0) {
x = 1;
y = 0;
} else {
exgcd(b, a % b, y, x);
y -= a / b * x;
}
}
int inv(int t, int m) {
int x, y;
exgcd(t, m, x, y);
return (x + m) ... | 14 |
#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
const double eps = 1e-12;
inline int sgn(long double u) {
if (u > eps)
return 1;
else if (u < -eps)
return -1;
else
return 0;
}
long double x, y, z;
long double a[12];
string ans[12];
pair<long double, int> u[12];
int main() {... | 16 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m, ans = 0, c = 0;
cin >> n >> m;
long long books[n], upay[m];
for (long long i = 0; i < n; i++) {
cin >> books[i];
}
sort(books, books + n);
for (long long i = 1; i < m; i++) {
long long k = 0;
for (long long j = 0; j < n... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200010;
int N, QAQ, k, s[maxn];
long long nu[maxn << 2], a, b;
struct Node {
int le, ri;
long long nua, nub;
} A[maxn << 2];
void Build(int i, int le, int ri) {
A[i].le = le, A[i].ri = ri;
A[i].nua = A[i].nub = 0LL;
if (le == ri) {
s[le] = i;
... | 9 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
long long dp[maxn][35];
long long sum[maxn][35];
int f[maxn][35];
int n;
long long k;
void init() {
for (int i = 0; i < maxn - 1; i++) {
for (int j = 0; j < 35; j++) {
dp[i][j] = 1e18;
}
}
}
void DP() {
for (long long j = 1; (1LL... | 13 |
#include <bits/stdc++.h>
inline int read() {
int data = 0, w = 1;
char ch = getchar();
while (ch != '-' && (ch < '0' || ch > '9')) ch = getchar();
if (ch == '-') w = -1, ch = getchar();
while (ch >= '0' && ch <= '9') data = data * 10 + (ch ^ 48), ch = getchar();
return data * w;
}
const int N(20), M(1 << 16... | 16 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long i, j, k, l, m, n, h;
cin >> n;
j = 0;
vector<long long> v(n);
for (i = 0; i < n; i++) {
cin >> v[i];
j += v[i];
}
string s1 = "";
i = 0;
while (j > 0) {
if (v[i] > 0 && i + 1 < n) {
j--;
s1 += "P";
v[i]-... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s = "<3";
cin >> n;
string temp;
while (n--) {
cin >> temp;
s += temp;
s += "<3";
}
string comp;
cin >> comp;
int j = 0;
for (int i = 0; i < comp.size() && j < s.size();) {
if (s[j] == comp[i]) {
i++;
... | 7 |
#include <bits/stdc++.h>
double t1, t2, t0;
int dblcmp(double n) { return n < -1e-12 ? -1 : n > 1e-12; }
double fun(int y1, int y2) { return (t1 * y1 + t2 * y2) / (y1 + y2); }
int main() {
int x1, x2;
while (scanf("%lf %lf %d %d %lf", &t1, &t2, &x1, &x2, &t0) != EOF) {
if (dblcmp(t1 - t2) == 0) {
printf("... | 11 |
#include <bits/stdc++.h>
using namespace std;
int x[110];
int main() {
int t;
scanf("%d", &t);
while (t--) {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &x[i]);
int ans = 1;
for (int i = 1; i <= n; i++) {
if (i > 1 && x[i - 1] && x[i])
ans += 5;
else if... | 0 |
#include <bits/stdc++.h>
template <typename T>
T gcd(T a, T b) {
if (b <= a) std::swap(a, b);
while (a) {
T a0 = a;
a = b % a0;
b = a0;
}
return b;
}
using namespace std;
int main() {
long long w, h, x, y, a, b;
{
cin >> w >> h >> x >> y >> a >> b;
long long d = gcd(a, b);
a /= d;
... | 9 |
#include <bits/stdc++.h>
using namespace std;
const int sz = 1500000;
const long long MAX = 10000000000000000;
template <typename T>
T abs(T a) {
return a < 0 ? -a : a;
}
struct point {
long double y, len;
long long ind;
point(long double cy = 0, long long cind = 0, long double clen = 0)
: y(cy), ind(cind... | 8 |
#include <bits/stdc++.h>
using namespace std;
vector<pair<long long int, long long int> > vec[100000];
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second < b.second);
}
long long int visited[100000];
long long int dfs(long long int i, long long int ma) {
visited[i] = 1;
long long ... | 10 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
map<int,long long>x;
long long ans=0;
for(int i=1;i<=n;i++)
{
int v;
cin>>v;
ans += x[v] * (n-i+1);
x[v]+=i;
//cout<<ans<<endl;
... | 8 |
#include <bits/stdc++.h>
using namespace std;
long long read() {
char x = getchar();
long long ans = 0, flag = 1;
while (!isdigit(x))
if (x == '-')
flag = -1, x = getchar();
else
x = getchar();
while (isdigit(x)) ans = ans * 10 + x - '0', x = getchar();
return ans * flag;
}
const long long... | 19 |
#include <bits/stdc++.h>
#pragma GCC optimize(2)
const int inf = 0x3f3f3f3f, Inf = 0x7fffffff;
const long long INF = 0x7fffffffffffffff;
const double eps = 1e-8;
unsigned int seed = 19260817;
const unsigned int _RAND_MAX_ = 4294967295u;
__inline__ __attribute__((always_inline)) unsigned int Rand() {
return seed = see... | 14 |
#include <bits/stdc++.h>
using namespace std;
int t;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> t;
for (int q = 0; q < t; q++) {
string a;
int len;
cin >> len >> a;
bool palin = true;
for (int i = 0; i < len / 2; i++) {
if (a[i] != a[len - i - 1] && abs((int)a... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, i, j, k, count;
string s = "";
cin >> s;
bool f = 1;
for (i = 0; i < s.size(); i++) {
bool flag[26] = {0};
f = 1;
count = 0;
for (j = i; j < i + 26; j++) {
if (s[j] == '?') continue;
if (!flag[s[j] - 'A']) ... | 5 |
#include <bits/stdc++.h>
inline int Time(int a, int b, int m) {
return (b < a) ? 2 * m - 2 + b - a : b - a;
}
inline int min(int a, int b) { return (a < b) ? a : b; }
inline int mirror(int a, int m) { return m - 1 - (a - m + 1); }
inline int state(int t, int m) { return t % (2 * m - 2); }
int main() {
int n = 0;
... | 5 |
#include <bits/stdc++.h>
using namespace std;
long long q, n;
void solve() {
long long n, k;
cin >> n >> k;
long long left = 1, right = 2e9 + 1e6;
while (left <= right) {
long long mid = (left + right) / 2;
if (mid % n == 0) {
if (mid - (mid / n) < k) {
left = mid + 1;
} else {
... | 4 |
#include <bits/stdc++.h>
using namespace std;
class Forest {
public:
int n, m;
vector<vector<int> > adj, par;
vector<int> dep, tin;
int timer;
Forest(int n_, int m_, vector<pair<int, int> > edge) {
n = n_;
m = m_;
adj.resize(n);
for (int i = 0; i < m; i++) {
int u = edge[i].first;
... | 25 |
#include <bits/stdc++.h>
const int N = 5005;
char s[N];
int main() {
int i, j, n, lb, clb, qm, ans;
gets(s);
n = strlen(s);
ans = 0;
for (i = 0; i < n; i++) {
clb = lb = qm = 0;
for (j = i; j < n; j++) {
if (s[j] == '(')
lb++, clb++;
else {
if (s[j] == ')')
lb--;
... | 10 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int> > v;
while (n--) {
int x, y;
cin >> x >> y;
v.push_back(make_pair(y, x));
}
int ans = 0, c = 0;
sort(v.begin(), v.end());
for (int i = 0; i < v.size(); i++) {
if (v[i].second > c) {
an... | 8 |
#include <bits/stdc++.h>
char num[300010];
int main() {
int n, t, c, m;
scanf("%d%d%s", &n, &t, num + 1);
for (c = 1; num[c] != '.'; c++)
;
for (m = c + 1; m < n + 1 && num[m] < '5'; m++)
;
if (m == n + 1)
puts(num + 1);
else {
while (t--) {
if (m == c + 1) {
num[c] = 0;
... | 9 |
#include <bits/stdc++.h>
using namespace std;
struct Edge {
long long en, cap, flow, next;
} edge[1000000];
long long head[50005], tot, now[50005];
long long source, sink, tot_num;
long long pre[50005], dis[50005], gap[50005];
void add_edge(long long st, long long en, long long cap) {
edge[tot].en = en;
edge[tot]... | 21 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long int n, m;
cin >> n >> m;
map<long long int, long long int> mp;
vector<long long int> v;
vector<long long int> u;
long long int x;
for (long long int i = 0; i < m; i++) {
for (long long int j = 0; j < n; j++) {
cin >> x;
... | 3 |
#include <bits/stdc++.h>
using namespace std;
int la[8][8] = {0}, cnt = 0;
vector<int> ans[8][8];
int ten[9] = {1, 10, 100, 1000, 10000, 100000, 1000000, 10000000, 100000000};
int k, m;
inline bool merge(int st, int ed, int i) {
int t1, t2, tmp;
t1 = ans[st][ed - i].size();
t2 = ans[ed - i + 1][ed].size();
int ... | 19 |
#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
const int N = 1505, K = 11;
struct kek
{
int sz = 0;
pii val[K];
void add(int c, int k)
... | 21 |
#include <bits/stdc++.h>
using namespace std;
int p[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47};
int main() {
string s;
vector<int> m;
for (int i = 0; i < 15; i++) {
cout << p[i] << endl;
cin >> s;
if (s == "yes") m.push_back(p[i]);
}
if (m.size() == 0) cout << "prime";
if (m.si... | 6 |
#include <bits/stdc++.h>
using namespace std;
long long power(long long base, long long exp) {
long long res = 1;
while (exp > 0) {
if (exp % 2 == 1) res = (res * base);
base = (base * base);
exp /= 2;
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
ci... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
const int LogN = 21;
int n, q, all, leaf;
struct Edge {
int to, val;
};
vector<Edge> G[N];
template <typename _Tp>
inline void IN(_Tp& x) {
char ch;
bool flag = 0;
x = 0;
while (ch = getchar(), !isdigit(ch))
if (ch == '-') flag = 1;
wh... | 25 |
#include <bits/stdc++.h>
const int N = 1e5 + 100, M = 1e6 + 100, SQ = sqrt(2e5), LG = 23, base = 2,
second = 1e2 + 100;
const long long mod = 1e9 + 7, MOD = 1e9 + 9;
const long long INF = 1e9, inf = 1e18, super_inf = ~0ull / 4;
using namespace std;
long long n, k, a[N], sum;
vector<long long> v, ans;
bool fla... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int bs1 = 17680321;
const int bs2 = 19260817;
const int bs3 = 19491001;
int n, m, LR, BT, LT, TR, RB, BL, a[400100], col[400100], p;
bool vis[400100];
vector<int> v[400100], u[400100];
char s[10];
void V(int x, int y) { v[x].push_back(y), v[y].push_back(x); }
void U(i... | 23 |
/* ॐ Shree ॐ */
/* ॐ ॐ ॐ
ॐ भूर् भुवः स्वः
तत् सवितुर्वरेण्यं
भर्गो देवस्य धीमहि
धियो यो नः प्रचोदयात्
*/
/* It does not matter how slow you go SO LONG AS YOU DON'T STOP */
/*
██▓███ ▄▄▄ ██▀███ ██▓ ██ ▄█▀ ██████ ██░ ██ ██▓▄▄▄█████▓ ██████ ██░ ██ ▄▄▄ ██▀█... | 4 |
#include <bits/stdc++.h>
using namespace std;
bool mayus(string s) {
for (int i = 0; i < s.size(); i++)
if (toupper(s[i]) != s[i]) return false;
return true;
}
bool mayus2(string s) {
for (int i = 1; i < s.size(); i++)
if (toupper(s[i]) != s[i]) return false;
return true;
}
int main() {
string s;
ge... | 2 |
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
using namespace std;
const long long mod = 998244353;
long double PI = acosl(-1);
const int nmax = 2e6 + 5;
const int MAXLG = log2(nmax) + 1;
int upor[nmax];
int lim = 1000000;
const int N = 1e6 +... | 12 |
#include <bits/stdc++.h>
using namespace std;
void fastio() {
cin.tie(nullptr);
cin.sync_with_stdio(false);
}
using LL = long long;
using LD = long double;
const LL MOD = 1e9 + 7;
const LL INF = LLONG_MAX;
const LL N = 2e5 + 1;
int main() {
fastio();
LL t;
cin >> t;
while (t--) {
LL n;
cin >> n;
... | 7 |
#include <bits/stdc++.h>
#define vi vector<int>
#define vvi vector<vi>
#define vll vector<ll>
#define vpii vector<pair<int, int>>
#define pii pair<int, int>
#define ar array
#define vvll vector<vll>
#define repa(i, b, n) for (int i = b; i < n; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1e9
#define M... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int N = 432;
int n, m, h, t, r, dp[N][N], dx[N], dy[N], ans = -1, vis[N][N], cnt[N][N];
vector<pair<int, int>> adj[N][N];
queue<pair<int, int>> q;
bool check(int x) { return x < N && x >= 0; }
void make_edge() {
for (int x = 0; x <= r; x++)
for (int y = 0; y + x... | 13 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 5;
int N, A[MAXN];
long long cal(long long x) {
long long ans = 0, cur = 0;
for (int i = 1; i <= N; ++i) {
cur = (cur + A[i]) % x;
ans += min(cur, x - cur);
}
return ans;
}
long long solve(long long x) {
long long ans = LLONG_MAX;
... | 10 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
multiset<int> req;
vector<int> ans;
int n, m, T;
int id = 0;
bool t = false;
cin >> n >> m >> T;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
for (int j = 0; j < (int)s.length(); j++) s[j] -= '0';
int time = ((s[0]) * 10 +... | 13 |
#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > v;
int main() {
ios_base::sync_with_stdio(false);
int i, j, n, m, k, t;
cin >> t;
while (t--) {
string s;
cin >> n >> m >> s;
for (i = 0; i < n; i += 2) {
if (s[i] == ')') {
j = i;
k = i;
while (s[j] ... | 9 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, m;
cin >> n >> m;
vector<vector<int>> g(n, vector<int>(m));
bool ok = 1;
for (int i = 0; i < n; ++i) {
int c = 0;
for (int j = 0; j < m; ++j) {
cin >> g[i][j],... | 7 |
#include <bits/stdc++.h>
using namespace std;
string s;
int cnt;
bool flag;
int main() {
cin >> s;
if (s.size() >= 7) {
for (int i = s.size() - 1; i >= 0; i--) {
if (s[i] == '0')
cnt++;
else if (s[i] == '1' && cnt >= 6)
flag = true;
}
}
if (flag)
cout << "yes";
else
... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
int t_;
cin >> t_;
while (t_--) {
long long n, m;
cin >> n >> m;
vector<vector<long long>> a(n, vector<long long>(m, 0));
for (long long i = 0; i < n; i++) {
for (long long j = ... | 7 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
int getbit(T s, int i) {
return (s >> i) & 1;
}
template <class T>
T onbit(T s, int i) {
return s | (T(1) << i);
}
template <class T>
T offbit(T s, int i) {
return s & (~(T(1) << i));
}
template <class T>
int cntbit(T s) {
return __builtin_popcoun... | 11 |
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 400;
int n, m;
char hor[MAX_N];
char ver[MAX_N];
int f[MAX_N][MAX_N];
int id(int i, int j) { return i * m + j; }
int main() {
while (scanf("%d%d", &n, &m) != EOF) {
memset(f, 0, sizeof f);
scanf("%s%s", hor, ver);
for (int i = 0; i < n; i++) ... | 6 |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int f = 1, sum = 0;
char x = getchar();
for (; (x < '0' || x > '9'); x = getchar())
if (x == '-') f = -1;
for (; x >= '0' && x <= '9'; x = getchar()) sum = sum * 10 + x - '0';
return f * sum;
}
int n, t, s;
int a[200005], biao[200005];
mult... | 21 |
#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e7;
const int MAXM = 1 << 20;
const int MAXN = 19;
double a[MAXN][MAXN];
double dp[MAXM];
bool used[MAXM];
int n;
double solve(long long mask) {
if (mask == 1) return 1.0;
if (!(mask & 1)) return 0.0;
if (used[mask]) return dp[mask];
double re... | 14 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, a[101] = {0};
cin >> n >> k;
for (int i = 0; i < n; ++i) {
int p;
cin >> p;
a[p]++;
}
int max_cutlery = *max_element(a, a + 101);
int min_dishes = (max_cutlery - 1) / k + 1;
int min_cutlery = min_dishes * k;
int lost = 0;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
long long int ff(long long int v) {
if (v % 2LL == 0LL)
return (v / 2) * (v + 1);
else
return ((v + 1) / 2) * v;
}
long long int cnt(long long int n, long long int x, long long int y,
long long int t) {
long long int res = t * t + (t + 1) * (... | 10 |
#include <bits/stdc++.h>
using namespace std;
int arr[10005], h[10005];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
int t, n, i;
string st;
cin >> t;
while (t--) {
cin >> st;
int ans = 0, cnt = 0;
n = st.length();
for (i = 0; i < n; i++) {
if (st... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
for (__typeof((n)) i = (0); i < (n); i += 1) {
int x;
cin >> x;
if (x % 2 == 0) {
x--;
}
cout << x << " ";
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char str[500];
while (scanf(" %s", str) != EOF) {
int pnum = 0, mbottom = 0, mtop = 0;
int len = strlen(str);
for (int i = 0; i < len; i++) {
if (str[i] == '+') {
pnum++;
if (pnum > mtop) mtop = pnum;
if (pnum < mbo... | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, max = 0;
cin >> n;
vector<long long> v(n), out(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
max = v[n - 1];
out[n - 1] = 0;
for (int i = n - 2; i >= 0; i--) {
if (v[i] <= max) {
out[i] = (max - v[i] + 1);
} else {
... | 3 |
#include <bits/stdc++.h>
using namespace std;
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
void err(istream_iterator<string> it) { cout << endl; }
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << " ";
err(++it, ar... | 7 |
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 35;
const int M = 1e6 + 16;
inline int func(int x, int y, int mny, int mxy, int mnz, int mxz) {
int z = -y - x;
return max({abs(y - mny), abs(y - mxy), abs(z - mnz), abs(z - mxz)});
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cou... | 18 |
#include <bits/stdc++.h>
using namespace std;
const int N = 22;
int d[N], spos[N], n, m;
vector<pair<int, int> > res;
void solveRev(int id, int a, int b, int c) {
if (id > m) return;
solveRev(id + 1, a, c, b);
for (int i = spos[id]; i < spos[id + 1]; ++i)
res.push_back(pair<int, int>(a, c));
solveRev(id + 1... | 17 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1000010;
const int INf = 0x7f7f7f7f;
int n, a[N], f[N][2], g[N][2];
int main() {
int t;
scanf("%d", &t);
while (t--) {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", a + i);
f[i][0] = f[i][1] = INf;
}
f[1][0] = f[... | 20 |
#include <bits/stdc++.h>
using namespace std;
int n;
int a[100000];
int sum;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
if (sum % n)
cout << n - 1;
else
cout << n;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
bool cmp(pair<int, int> &a, pair<int, int> &b) {
if (a.first == b.first) return a.second < b.second;
return a.first < b.first;
}
int main() {
vector<pair<int, int> > v(3);
set<pair<int, int> > ans;
cin >> v[0].first >> v[0].second;
cin >> v[1].first >> v[1].seco... | 8 |
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
ostream& operator<<(ostream& os, const pair<A, B>& p) {
return os << '(' << p.first << ", " << p.second << ')';
}
template <typename C>
ostream& operator<<(ostream& os, const vector<C>& v) {
for (__typeof((v).begin()) __it = (v).begin()... | 15 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f7f7f7f;
const int MAXN = 305;
const double eps = 1e-10;
int maze[MAXN][MAXN];
int dis[2][MAXN * MAXN];
int n, m, p;
struct node {
int x, y, len, id;
node(int x = 0, int y = 0, int len = 0, int id = 0)
: x(x), y(y), len(len), id(id) {}
};
vector... | 15 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T getint() {
T x = 0, p = 1;
char ch;
do {
ch = getchar();
} while (ch <= ' ');
if (ch == '-') p = -1, ch = getchar();
while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
return x * p;
}
template <typename T1, typena... | 9 |
#include <bits/stdc++.h>
using namespace std;
const long long MN = 1e5 + 7;
const long long MK = 1500;
long long n, m, lv[MN], rv[MN], w[MN], lazy[MN << 2], mark[MN];
bitset<MK> a[MN << 2], p;
vector<long long> g[MN], to;
void sh(long long u, long long x) {
bitset<MK> s = a[u];
a[u] = (s >> (m - x)) | (s << x);
}
v... | 20 |
#include <bits/stdc++.h>
using namespace std;
int hours[100007], konta[100007];
bool vis[100007];
vector<int> v[100007], v2[100007];
vector<int> scc[100007], graph[100007];
vector<int> topsort;
void dfs(int s) {
vis[s] = true;
for (int i = 0; i < v[s].size(); i++) {
int ve = v[s][i];
if (!vis[ve]) {
d... | 11 |
#include <bits/stdc++.h>
using namespace std;
clock_t startTime;
double getCurrentTime() {
return (double)(clock() - startTime) / CLOCKS_PER_SEC;
}
template <typename T, typename U>
inline ostream &operator<<(ostream &_out, const pair<T, U> &_p) {
_out << _p.first << " " << _p.second;
return _out;
}
template <typ... | 9 |
#include <bits/stdc++.h>
#pragma warning(disable : 4996)
using namespace std;
int n, m, p;
void doprint(vector<vector<int>> &a, int swapy) {
if (!swapy) {
for (auto e : a) {
for (auto f : e) printf("%c", f ? '*' : '.');
printf("\n");
}
} else {
for (int i = 0; i < a[0].size(); i++) {
f... | 23 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a = 0;
string x, y;
cin >> x >> y;
for (int i = 0; x[i] != '\0'; i++) {
if (x[i] < y[i]) {
a = 1;
break;
}
}
if (a == 1)
cout << "-1";
else {
for (int i = 0; y[i] != '\0'; i++) {
if (x[i] >= y[i])
cout... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, c;
cin >> n >> k >> c;
int array[c];
for (int i = 0; i < c; ++i) cin >> array[i];
int cnt = 0;
for (int i = 0; i <= n; i += k) {
if (i != 0) cnt++;
for (int j = 0; j < c; ++j) {
if (array[j] < i + k && array[j] >= i + 1) {
... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 19;
const int N = 2e5 + 25;
struct Trie {
int sz;
vector<int> val, lazy;
Trie(int k) {
sz = 1 << (k + 1);
val.resize(sz, inf);
lazy.resize(sz, 0);
}
void push(int v) {
if (lazy[v]) {
val[v] += lazy[v];
if (val[v] >... | 20 |
#include <bits/stdc++.h>
using namespace std;
char p[1011][1011];
long long val[1011][1011];
long long S[26][1011][1011];
struct pic {
int a, b, c, d, e;
};
void update(int e, int a, int b, int c, int d) {
S[e][a][b]++;
S[e][c + 1][b]--;
S[e][a][d + 1]--;
S[e][c + 1][d + 1]++;
}
long long query(long long f[10... | 18 |
#include <bits/stdc++.h>
using namespace std;
int x[10], y[10];
set<int> s;
int main() {
for (int i = 0; i < 6; i++) {
cin >> x[i];
y[x[i]]++;
s.insert(x[i]);
}
for (int i = 1; i <= 9; i++) {
if (y[i] == 4) {
if (s.size() == 3) {
cout << "Bear" << endl;
return 0;
} else... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int oo = 0x3f3f3f3f;
template <typename Comp>
struct segment_tree {
int n, neutral;
Comp cmp;
vector<int> nodes;
segment_tree(int n, int neutral)
: n(n), neutral(neutral), cmp(Comp()), nodes(2 * n, neutral) {}
int merge(int x, int y) { return cmp(x, y)... | 23 |
#include <bits/stdc++.h>
using namespace std;
char s[1000010];
char a[1000010], b[1000010];
int v[200] = {0};
int main() {
int n;
cin >> n >> s;
for (int i = 0; i < n; i++) v[s[i]]++;
int l = 1, r = n;
for (int i = 1; i < 128; i++)
if (v[i] & 1) a[l++] = i, v[i]--;
for (int i = 1; i < 128; i++)
if (... | 10 |
#include <bits/stdc++.h>
using namespace std;
long long ma, mi, ans, s[500001], a[500001];
int n;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%lld", &a[i]);
long long ma = -1e9, mi = 1e9;
for (int i = 2; i <= n; i++) {
s[i] = s[i - 1] + abs(a[i] - a[i - 1]) * (i & 1 ? -1 : 1);
ma =... | 8 |
#include <bits/stdc++.h>
using namespace std;
int n, m, ans;
int main() {
scanf("%d%d", &n, &m);
printf("%d\n", min((n + m) / 3, min(n, m)));
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long int sum = 0;
int size, a;
cin >> size;
int mid = (size - 1) / 2;
for (int i = 0; i < size; i++) {
for (int j = 0; j < size; j++) {
cin >> a;
if (i == j || i + j == size - 1 || i == mid || j == mid) {
sum += a;
}
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int t[6], cnt[111];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
int sum = 0, maxV = 0, minV = INT_MAX;
for (int i = 1; i <= 5; ++i) {
cin >> t[i];
sum += t[i];
cnt[t[i]]++;
}
int res = sum;
for (int i = 1; i <= 5; ++i)
if (cnt[t[i... | 0 |
#include <bits/stdc++.h>
using namespace std;
bool rv[19];
bool sw[19];
struct node {
int64_t s, e, v, level;
};
node tree[(1 << 19) * 2];
void tree_init(int64_t at, int64_t s, int64_t e, int64_t level) {
if (0)
for (int64_t i = level; i < 19; i++) printf(" ");
if (0) printf("#%ld: [%ld, %ld] (%ld)\n", at, s,... | 16 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.