solution stringlengths 53 181k | difficulty int64 0 27 |
|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t = 1;
while (t--) {
int n, i = 0, j = 1, k = 0;
cin >> n;
string s[n];
string s1, s2;
for (i = 0; i < n; i++) cin >> s[i];
s1 = s[0];
for (i = 1; i < n; i++) {
if (s[i] == s1)
j++;
else {
s2 = s[i... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000;
const int MAXN = 3000005;
vector<pair<int, int> > adj[MAXN];
vector<int> ids[MAXN];
int n;
vector<long long> dist;
int used[MAXN];
int mycost[MAXN];
struct mypair {
long long first;
int second;
mypair(long long x, long long y) : first(x), s... | 12 |
#include <bits/stdc++.h>
using namespace std;
long long mul(long long a, long long b, long long p) {
long long res = 0;
while (b) {
if (b & 1) res = (res + a) % p;
b >>= 1;
a = (a + a) % p;
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long lon... | 15 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m, p;
cin >> n >> p >> m;
vector<pair<long long, long long>> v;
for (long long i = 0; i < n; i++) {
long long a, b;
cin >> a >> b;
v.push_back({a, b});
}
long long ans = 0;
long long bal = 0;
long long lastn = 1;
for (... | 12 |
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-8;
bool cmp(string s1, string s2) { return (s1 + s2) < (s2 + s1); }
int main() {
long long int n;
cin >> n;
vector<string> v(n);
for (long long int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end(), cmp);
for (long long int ... | 9 |
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long n;
cin >> n;
vector<long long> v(n);
for (long long i = 0; i < n; ++i) {
cin >> v[i];
}
sort(v.begin(), v.end());
long long ans = 0;
vector<long long> used(n, 0);
for... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int Maxn = 1e5 + 10;
int a[Maxn];
char c[Maxn];
int n;
int f[Maxn][2];
bool done[Maxn][2];
int F(int i, int les) {
if (i == n) return 0;
if (done[i][les]) return f[i][les];
done[i][les] = true;
f[i][les] = F(i + 1, les || c[i] == '1');
if (les || c[i] == '1'... | 8 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
cout << min((a[n - 2] - a[0]), (a[n - 1] - a[1]));
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
struct edge {
int u, v;
int next;
} e[100010];
int n, m, cnt, ans;
int head[100010], d[100010], c[100010];
bool vis[100010];
void add(int a, int b) {
e[cnt].u = a;
e[cnt].v = b;
e[cnt].next = head[a];
head[a] = cnt++;
}
int gethead(int p) {
if (c[p] == p)
... | 14 |
#include <bits/stdc++.h>
using namespace std;
long long n;
int main() {
cin >> n;
for (long long i = 2; i * i <= n; i++)
while (n % (i * i) == 0)
if (n % i == 0) n /= i;
cout << n << endl;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
long long n, g, k;
cin >> n >> g >> k;
long long l = (n + 1) / 2;
long long u = l / g;
int k1 = 0;
if (l % g == 0) {
k1++;
}
long long t1 = u * g + (u - k1) * k + l % g;
if (t1 <= n)... | 6 |
#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
std::istream& operator>>(std::istream& i, pair<T, U>& p) {
i >> p.first >> p.second;
return i;
}
template <typename T>
std::istream& operator>>(std::istream& i, vector<T>& t) {
for (auto& v : t) {
i >> v;
}
return i;
}
templat... | 17 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
vector<int> adj[N], radj[N << 1], ans;
int vis[N], rvis[N << 1], par[N << 1];
bool is_cycle(int v) {
vis[v] = 1;
for (auto it : adj[v]) {
if (vis[it] == 0) {
if (is_cycle(it)) return true;
} else if (vis[it] == 1) {
return true... | 13 |
#include <bits/stdc++.h>
using namespace std;
int n, x, y, i, base = 1e9 + 7;
int a[1000100], t[1000100];
int query(int k) {
int ans = 0;
for (; k > 0; k -= k & -k) ans = (ans + t[k]) % base;
return ans;
}
void update(int k, int x) {
for (; k <= 1000000; k += k & -k) t[k] = (t[k] + x) % base;
}
int main() {
s... | 12 |
#include <bits/stdc++.h>
using namespace std;
const int MN = 5120;
int as[MN];
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
const int MP = 1e5;
bool nop[MP];
int primes[MP];
int P;
bool bad[MP];
unordered_set<int> bs;
int val(int x) {
int v = 0;
for (int j = 0; j < P; ++j) {
int p = primes[j];
if... | 10 |
#include <bits/stdc++.h>
using namespace std;
const int maxN = 1e5 + 5;
const int INF = 1e9 + 5;
const int MOD = 1e9 + 7;
int q, i;
long long n, m, rem, c, res;
long long l, r, mid;
bool isVal(long long k) {
rem = k * m;
c = 1;
res = 1;
for (i = 1; i <= k && rem > 0 && res < n; i++) {
c *= k - i + 1;
c ... | 18 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, mapn[60][60], x, y, cnt[60];
while (cin >> n) {
memset(mapn, 0, sizeof(mapn));
for (int i = 1; i <= n * (n - 1) / 2 - 1; i++) {
cin >> x >> y;
mapn[x][y] = mapn[y][x] = 1;
cnt[x]++;
}
for (int i = 1; i <= n; i++) {
... | 5 |
#include <bits/stdc++.h>
const int C = 100001;
using ll = long long;
int dp[C], p[C], ptr[C], presence[C], alld = 0;
ll all[C];
void supfactor(int *pr, int v) {
int i, j;
pr[1] = 1;
for (i = 2; i * i < v; i++) {
if (pr[i] == 0) {
for (j = i; j < v; j += i)
if (pr[j] == 0) pr[j] = i;
}
}
... | 21 |
#include <bits/stdc++.h>
using namespace std;
long long path[100010];
vector<pair<int, int> > mp[100010];
void dfs(int x, int father) {
path[x] = 0;
for (int i = 0; i < mp[x].size(); i++) {
int v = mp[x][i].first;
if (v != father) {
dfs(v, x);
path[x] =
(path[x] > path[v] + mp[x][i].se... | 10 |
#include <bits/stdc++.h>
using namespace std;
const int N = 200100;
int a[N];
int cnt, sta[N], ot[N];
void dfs(int l, int r, int o) {
if (o == cnt) {
if (ot[o] == 1)
for (int i = l; i <= r; ++i) printf("%d ", a[i]);
else
for (int i = r; i >= l; --i) printf("%d ", a[i]);
return;
}
if (ot[o]... | 9 |
#include <bits/stdc++.h>
using namespace std;
struct Firework {
int x, y, d;
Firework(int x, int y, int d) : x(x), y(y), d(d) {}
bool operator<(const Firework& p) const {
return x != p.x ? x < p.x : y != p.y ? y < p.y : d < p.d;
}
};
const int dx[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int dy[] = {1, 1, 0, -... | 11 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a1, b1, c1, a2, b2, c2;
cin >> a1 >> b1 >> c1 >> a2 >> b2 >> c2;
if (a1 && b1 && a2 && b2) {
if (a1 * b2 == a2 * b1) {
if (a2 * c1 == a1 * c2)
cout << -1;
... | 12 |
#include <bits/stdc++.h>
using namespace std;
pair<long long, long long> p[2555];
long long minm(long long a, long long b) {
if (a > b) return b;
return a;
}
long long maxm(long long a, long long b) {
if (a > b) return a;
return b;
}
int main() {
long long n, x1, y1, x2, y2, i, j, k, dist1, dist2, maxer[2555]... | 8 |
#include <bits/stdc++.h>
using namespace std;
const long long maxn = (1 << 20);
long long tree[2 * maxn];
long long lazy[2 * maxn];
void push(long long k) {
if (k >= 2 * maxn || k < 0) return;
if (lazy[k] == 0) return;
for (long long i = k * 2; i <= k * 2 + 1; i++) {
if (i >= 2 * maxn) continue;
lazy[i] +... | 14 |
#include <bits/stdc++.h>
using namespace std;
double const pi = 3.1415926536;
int const N = 1000005;
void FAST() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
void TXT() {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
int main() {
FAST();
int n;
cin >> n;
char a[n][n]... | 6 |
#include <bits/stdc++.h>
using namespace std;
string s, a, b[1001];
int ans, pos[1001], cnt, z;
int main() {
cin >> s;
pos[0] = 0;
cnt++;
for (int i = 1; i < s.size(); i++) {
if (s[i] >= 'A' && s[i] <= 'Z' && (s[i - 1] < 'A' || s[i - 1] > 'Z')) {
pos[cnt] = i;
cnt++;
}
}
for (int i = 0; ... | 9 |
#include <bits/stdc++.h>
using namespace std;
string a, b;
int f(string x, string y) {
for (int i = 0; i < x.size(); i++) {
if (x[i] != y[i]) return 0;
}
return 1;
}
int main() {
cin >> a >> b;
if (a.size() != b.size()) {
cout << max(a.size(), b.size());
} else {
if (f(a, b)) {
cout << -1;... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, n, a[100000], x, d;
cin >> n >> x;
for (i = 0; i < n; i++) cin >> a[i];
d = 0;
sort(a, a + n);
while (a[(n - 1) / 2] != x) {
a[n++] = x;
sort(a, a + n);
d++;
}
cout << d;
}
| 7 |
#include <bits/stdc++.h>
int lucky(int n) {
int flag = 0;
while (n != 0) {
if (n % 10 == 4 || n % 10 == 7)
flag = 1;
else {
flag = 0;
break;
}
n /= 10;
}
if (flag == 0)
return 0;
else
return 1;
}
int main(void) {
int n;
scanf("%d", &n);
int i, flag = 0;
if (lu... | 2 |
#include <bits/stdc++.h>
using namespace std;
unsigned long long n, k, a[200005];
char cas[200005];
priority_queue<int> q;
int main() {
cin >> n >> k;
for (unsigned long long i = 1; i <= n; ++i) cin >> a[i];
scanf("%s", cas + 1);
unsigned long long ans = 0, used = 0;
for (unsigned long long i = 1; i <= n;) {
... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
if (k > (n / 2 + n % 2)) {
cout << (k - n / 2 - n % 2) * 2 << endl;
} else {
cout << k * 2 - 1 << endl;
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const int N = 4e5 + 5;
int n, m;
int a[N], b[N];
vector<int> v[N];
set<int> s[N];
int parent[N];
vector<vector<int> > ans;
int depth[N];
vector<int> levels[N];
bool visited[N];
bool done[N];
void dfs(int node, int parent, int dist) {
::parent[node] = parent;
depth[node]... | 15 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100;
int TC, N, M;
int A[MAXN + 10][MAXN + 10];
vector<int> adj[20];
int par[20];
vector<pair<int, int>> AA[20];
int main() {
scanf("%d", &TC);
for (int j = 0; j < 16; j++) {
if (__builtin_popcount(j) == 3) {
if (j & 1) AA[j].push_back({1, 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 = getchar();
}
f ... | 23 |
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
int minV = min(a, b);
int maxV = max(a, b);
if (maxV % minV == 0) {
return minV;
} else {
return gcd(minV, maxV % minV);
}
}
int main() {
int n;
cin >> n;
deque<int> dq;
for (int i = 0; i < n; i++) {
int inp;
cin >> ... | 4 |
#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
const double pii = 2 * pi;
const double eps = 1e-6;
const long long MOD = 1e9 + 7;
void dfs(int ind, vector<bool>& vis, vector<vector<int>>& tr, vector<int>& sc) {
if (vis[ind]) {
vis[ind] = false;
for (int i = 0; i < tr[ind].size(); ... | 9 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int kMaxN = 2e5 + 3;
vector<int> edges[kMaxN];
bitset<kMaxN> visited;
int nim[kMaxN];
int mext[kMaxN];
int levels[kMaxN];
vector<int> nim_nodes[kMaxN];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m;
... | 24 |
#include <bits/stdc++.h>
using namespace std;
mt19937 rnd;
long long inf = 1000000687;
const long long maxn = 1 << 17, md = 1000000007;
vector<long long> gc(2 * maxn, 1), mx(2 * maxn, inf), cn(2 * maxn, 0),
a(maxn, inf);
long long gcd(long long a, long long b) {
if (a < b) swap(a, b);
if (b == 0) return a;
re... | 13 |
#include <bits/stdc++.h>
using namespace std;
int x[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
int y[8] = {-1, 0, 1, -1, 1, -1, 0, -1};
const int MOD = 1e9 + 7, N = 2e5 + 5;
const double pi = acos(-1);
long long fact[N], inv[N], freq[30];
bool arr[1005][1005];
long long fp(long long b, long long p) {
if (p == 0) return 1;
l... | 3 |
#include <bits/stdc++.h>
int main() {
double n, a, s;
while (scanf("%lf%lf%lf", &n, &a, &s) != EOF) {
double t, v, max = 0;
while (n--) {
scanf("%lf%lf", &t, &v);
double time = t;
double sum = v * v * 1.0 / (2.0 * a);
if (sum <= s) {
sum = s - sum;
time += (v * 1.0 / ... | 8 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
const long long inf = 1e15;
int n, q;
set<int> hs;
long long lz[4 * maxn], lz1[4 * maxn], nxt[4 * maxn], lz2[4 * maxn], p[20], cnt;
pair<long long, long long> bt[4 * maxn];
void make(int u, int l, long long v, long long nx) {
bt[u] = {v, l};
nx... | 23 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string check;
cin >> check;
map<int, int> mindex;
int ret = 0;
mindex[0] = -1;
vector<int> bal(n);
bal[0] = (check[0] == '1' ? 1 : -1);
mindex[bal[0]] = 0;
for (int i = 1; i < n; i++) {
bal[i] = bal[i - 1] + (check[i] ... | 7 |
#include <bits/stdc++.h>
using namespace std;
char s[200005];
int T, n;
int main() {
scanf("%d", &T);
for (; T--;) {
scanf("%s", s + 1);
n = strlen(s + 1);
int ans = 0;
for (int i = 1; i <= n; i++) {
if (s[i] == 'A')
ans++;
else {
if (ans == 0)
ans++;
el... | 3 |
#include <bits/stdc++.h>
int main() {
std::ios::sync_with_stdio(0);
std::cin.tie(NULL), std::cout.tie(NULL);
int t = 0;
scanf("%d", &t);
while (t--) {
int n = 0, x = 0;
scanf("%d%d", &n, &x);
if (n == 1 || n == 2) {
printf("1\n");
continue;
}
n -= 2;
int y = (n + x - 1) / x... | 0 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void rd(T& x) {
long long f = 0, c;
while (!isdigit(c = getchar())) f ^= !(c ^ 45);
x = (c & 15);
while (isdigit(c = getchar())) x = x * 10 + (c & 15);
if (f) x = -x;
}
template <typename T>
void pt(T x, long long c = -1) {
if (x < 0) putch... | 16 |
#include <bits/stdc++.h>
using namespace std;
const int mn = 3e5 + 10;
int a[mn * 2], ans[mn * 2][2];
int main() {
int n, q, i;
scanf("%d%d", &n, &q);
for (i = 0; i < n; i++) scanf("%d", a + i);
int m = 0;
for (i = 1; i < n; i++) {
if (a[i] > m) m = i;
}
for (i = 0; i < m; i++) {
ans[i][0] = a[i];... | 7 |
#include <bits/stdc++.h>
using namespace std;
int n, q, m, b;
int a[200005], t[200005], l[200005], r[200005];
int ans[105];
int main() {
scanf("%d %d %d", &n, &q, &m);
for (int ii = 1; ii <= n; ii++) scanf("%d", &a[ii]);
for (int ii = 0; ii < q; ii++) scanf("%d %d %d", &t[ii], &l[ii], &r[ii]);
for (int ii = 0; ... | 10 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast", "unroll-loops")
using namespace std;
template <class T>
inline void sort(T &a) {
sort((a).begin(), (a).end());
}
template <class T>
inline void rsort(T &a) {
sort((a).rbegin(), (a).rend());
}
template <class T>
inline void reverse(T &a) {
reverse((a).begin(),... | 11 |
#include <bits/stdc++.h>
int hd[2000000];
int ind[2000000];
int lst[4000000];
int twd[4000000];
int ans;
int n, k;
int cnt;
void ade(int f, int t) {
cnt++;
twd[cnt] = t;
lst[cnt] = hd[f];
hd[f] = cnt;
return;
}
int dfs(int x, int f) {
if (ind[x] == 1) return 0;
std::vector<int> V;
V.clear();
for (int ... | 16 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
if (n == 1)
cout << "a" << endl;
else {
string str = "";
str += "aa";
for (long long i = 2; i < n; i++) {
if (str[i - 1] == 'a' && str[i - 2] == 'a')
str += 'b';
else if (str[i - 1] == 'b' && st... | 2 |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0);
;
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
set<int> S;
for (int i = 1; i < n + 1; i++) {
S.insert(i);
}
vector<int> ans;
int prev = 0... | 4 |
#include <bits/stdc++.h>
using namespace std;
int l, n, ans, a[100 + 5], b[100 + 5], vis[3000 + 5][100 + 5][5],
memo[3000 + 5][100 + 5][5];
int dp(int now, int last, int state) {
if (now == l) return 1;
if (now > l) return 0;
if (memo[now][last][state] > -1) return memo[now][last][state];
int i, k, ret = 0;... | 10 |
#include <bits/stdc++.h>
using namespace std;
void getint(int &v) {
char ch, fu = 0;
for (ch = '*'; (ch < '0' || ch > '9') && ch != '-'; ch = getchar())
;
if (ch == '-') fu = 1, ch = getchar();
for (v = 0; ch >= '0' && ch <= '9'; ch = getchar()) v = v * 10 + ch - '0';
if (fu) v = -v;
}
double p[500010], B... | 14 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e6 + 5;
string a, b, c = " ";
int n, z[N], ext[N], f[N], nxt[N], mxi;
int main() {
getline(cin, a), getline(cin, b);
if (a.size() != b.size()) {
printf("-1 -1\n");
return 0;
}
n = a.size(), a = ' ' + a, b = ' ' + b;
for (int i = n; i; i--) c... | 17 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
long long v[100005];
cin >> n >> m;
for (int i = 0; i < n; i++) cin >> v[i];
long long s = 0;
for (int i = 0; i < m; i++) {
long long q, num;
cin >> q;
cin >> num;
if (q == 3) {
cout << abs(v[num - 1] + s) << endl;
... | 4 |
#include <bits/stdc++.h>
using namespace std;
void tefa() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
void end() {}
int main() {
tefa();
int n, z = 0, o = 0;
string s;
cin >> n >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '1')
o++;
else
z++;
}
if (o) {
cou... | 0 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000000000000LL;
void scanInt(int &x) {
register int c = getchar();
x = 0;
int neg = 0;
for (; ((c < 48 || c > 57) && c != '-'); c = getchar())
;
if (c == '-') {
neg = 1;
c = getchar();
}
for (; c > 47 && c < 58; c = getcha... | 13 |
#include <bits/stdc++.h>
using namespace std;
template <class A>
inline A Min(A &a, A &b) {
return a < b ? a : b;
}
template <class A>
inline A Max(A &a, A &b) {
return a > b ? a : b;
}
struct DATA {
double l;
long j;
DATA(double l, long j) {
this->l = l;
this->j = j;
}
};
long n, w, m;
vector<DATA>... | 11 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK: 2000000")
using namespace std;
long long power(long long a, long long n) {
if (n == 1) return a % 1000000007;
if (n == 0) return 1;
if (n & 1)
return ((a % 1000000007) * (power((a * a) % 1000000007, n / 2)) %
1000000007) %
100000... | 16 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k, i, x, y;
cin >> n >> k;
vector<pair<long long, long long> > a;
for (i = 0; i < n; i++) {
cin >> x;
y = i + 1;
a.push_back(make_pair(x, y));
}
vector<long long> v;
sort(a.begin(), a.end());
for (i = 0; i < n; i++) {
... | 2 |
#include <bits/stdc++.h>
using namespace std;
int n, k;
vector<int> a;
char x;
int main() {
a.push_back(0);
scanf("%d %d\n", &n, &k);
for (int i = 0; i < n; ++i) {
cin >> x;
a.push_back((int)x - 48);
}
++n;
for (int i = 2; i < n && k; ++i)
if (a[i] == 7 && a[i - 1] == 4) {
if (a[i - 2] == ... | 7 |
#include <bits/stdc++.h>
using namespace std;
int DEBUG = 0;
int a[1100][1100];
int s1[1100];
int s2[1100];
int N[1100];
int fl[1100];
int lf[1100];
int main() {
if (DEBUG) {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
int n;
cin >> n;
for (int i = 0; i < (int)n; i++)
f... | 8 |
#include <bits/stdc++.h>
using namespace std;
long long n, A, B;
int a[100000 + 10], k;
long long get(int l, int r) {
int mid = (l + r) / 2;
long long num = 0, ans = 0;
int p1, p2;
p1 = lower_bound(a + 1, a + k + 1, l) - a;
p2 = upper_bound(a + 1, a + k + 1, r) - a;
num = p2 - p1;
if (num == 0)
ans = ... | 9 |
#include <bits/stdc++.h>
using namespace std;
inline long long rint() {
long long x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-') f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = x * 10 + c - '0';
c = getchar();
}
return x * f;
}
inline long long gcd... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 5e5 + 5;
int p[maxn], s[maxn];
int ma[maxn];
int main() {
int n, m, k;
while (cin >> n >> m >> k) {
memset(ma, 0, sizeof(ma));
for (int i = 1; i <= n; i++) cin >> p[i];
for (int i = 1; i <= n; i++) {
cin >> s[i];
ma[s[i]] = max(p... | 3 |
#include <bits/stdc++.h>
using namespace std;
int mod = 1e9 + 9;
long long int inf = 1000ll * 1000 * 1000 * 1000;
const int maxn = 2e5 + 20;
long long int h[maxn], d[maxn];
struct node {
long long int val;
long long int mxpre;
long long int mxsuf;
long long int sum;
} seg[maxn * 4];
node mrg(node lft, node rit,... | 15 |
#include <bits/stdc++.h>
using namespace std;
int A[5] = {2, 3, 1, 2, 1};
int main() {
ios::sync_with_stdio(false);
int x;
cin >> x;
x--;
cout << A[x] << endl;
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 2E5 + 10;
int n;
int a[MAX];
vector<int> g[MAX];
bool mark[MAX];
int sub, root;
int res;
vector<int> cir;
bool found;
void dfs(int u) {
mark[u] = false;
sub++;
for (auto v : g[u])
if (mark[v]) dfs(v);
}
void dfs1(int u, int p) {
mark[u] = false;
... | 9 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
struct node {
int l, r, blk, id;
friend bool operator<(node a, node b) {
return a.blk == b.blk ? a.r < b.r : a.l < b.l;
}
} p[maxn];
int cnt[maxn], n, m, l = 1, r, up[maxn], dn[maxn], bc, t[maxn], sn = 256;
long long a[maxn], ans, sum[max... | 15 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
long long ans = -1ll;
int idx = -1;
for (int i = 0; i < n; i++) {
long long ttl = v[i];
vector<long long> v2 = v;
for (int j = i - 1; j >= 0; j... | 7 |
#include <bits/stdc++.h>
using namespace std;
long long int powr(long long a, long long b) {
if (b == 0) {
return 1;
}
if (b % 2 == 0) {
return powr(((a % 1000000007) * (a % 1000000007)) % 1000000007, b / 2);
} else {
if (b == 1) {
return a;
} else {
return (a * powr(((a % 1000000007... | 7 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int n, m, k[100010], v[100010][2], av[100010][2], ap[100010], in[100010][2],
vis[100010], tg[100010], cnt;
pair<int, int> ans, res[100010], dp[100010][2];
vector<int> lk[100010];
int Nx(const int& x, const int& y) { return in[x][in[x][0] == y]; ... | 21 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int T;
scanf("%d",&T);
while(T--)
{
long long int n;
scanf("%lld",&n);
int ans=1;
while(n>1)
{
if(n%2!=0)
{
ans=0;
break;
}
else
n=n/2;
}
if(ans==0)
{
printf("YES\n");
}
else
printf("NO\n");
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
struct hash_pair {
template <class T1, class T2>
size_t operator()(const pair<T1, T2>& p) const {
auto hash1 = hash<T1>{}(p.first);
auto hash2 = hash<T2>{}(p.second);
return hash1 ^ hash2;
}
};
long long t;
long long mod = 1e9 + 7;
long long BigMod(long lo... | 10 |
#include <bits/stdc++.h>
using namespace std;
struct node {
int p, id;
int t;
friend bool operator<(const node &a, const node &b) { return a.p > b.p; }
} a[1010], b[1010];
vector<node> ans[1010];
int n, m;
int main() {
scanf("%d%d", &n, &m);
int an = 0, bn = 0;
for (int i = 0; i < n; i++) {
int p, t;
... | 9 |
#include <bits/stdc++.h>
using namespace std;
const int eps = 1e6 + 5;
const double pi = acos(-1.0);
const int inf = 1 << 29;
int f[1005];
int c[1005];
int n;
int vis[1005];
void dfs(int x) {
int sign = 0;
for (int i = 1; i <= n; i++) {
if (f[i] == x) {
dfs(i);
sign = 1;
}
}
if (!sign)
c... | 4 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
long long cnt(long long a, long long b) { return a / b + (a % b > 0); }
int intlog(double base, double x) { return ceil(log(x) / log(base)); }
long long binpow(long long a, long long pow) {
if (pow == 0) return 1;
if (pow == 1) return a;
if... | 9 |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000 * 1000 * 1000 + 7;
long long fac[1000001];
long long dp[1000001];
int main() {
fac[0] = 1;
for (int i = 1; i <= 1000000; i++) {
fac[i] = (i * fac[i - 1]) % MOD;
}
dp[0] = 0;
dp[1] = 0;
dp[2] = 0;
dp[3] = 2;
for (int i = 4; i <=... | 7 |
#include <bits/stdc++.h>
using namespace std;
int x[2000000], dif[2000000], cid[2000000];
int N, K;
bool cmp(int a, int b) {
if (x[a] == x[b]) return dif[a] > dif[b];
return x[a] < x[b];
}
int l[2000000], r[2000000];
int C;
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
cin >> N >> K;
for (int i = 0; i <... | 10 |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e6 + 6;
int t, n;
vector<int> v(MAX);
vector<bool> check(MAX);
void file_io(char *input, char *output) {
freopen(input, "r", stdin);
freopen(output, "w", stdout);
}
void fast_io() {
ios::sync_with_stdio(false);
cin.tie(0);
}
void input() {
cin >> ... | 8 |
#include <bits/stdc++.h>
using namespace std;
int n, k, a[10005];
int f(double q) {
int j;
double sum = 0, s = 0, t;
for (j = 0; j < n; j++) {
if ((double)a[j] < q) {
sum += q - (double)a[j];
} else {
s += (double)a[j] - q;
}
}
if (s - s * (double)(k) / (100.0) > sum) {
return 1;
... | 8 |
#include <bits/stdc++.h>
using namespace std;
struct data {
int x, y;
};
int p, q, l, r, f[2010], s[2010], cnt;
data a[100];
int main() {
int i, j, u, v;
scanf("%d %d %d %d", &p, &q, &l, &r);
for (i = 1; i <= p; i++) {
scanf("%d %d", &u, &v);
for (j = u; j <= v; j++) f[j] = 1;
}
s[0] = f[0];
for (... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
long long number;
cin >> number;
for (long long i = 0; i < number; i++) {
long long input;
cin >> input;
if (input == 1) {
cout << "-1" << endl;
return 0;
}
}
cout << "1" << endl;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
char s[10][10001];
int X[10];
pair<int, vector<int>> Calculate(int n, int m, int mask) {
vector<pair<int, int>> v(m);
for (int k = 0; k < m; ++k) {
int c = 0;
for (int i = 0; i < n; ++i) {
if (s[i][k] == '0') {
continue;
}
c += ((mask &... | 14 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000;
pair<int, int> operator+(pair<int, int> x, pair<int, int> y) {
return make_pair(x.first + y.first, x.second + y.second);
}
pair<int, int> operator-(pair<int, int> x, pair<int, int> y) {
return make_pair(x.first - y.first, x.second - y.second)... | 19 |
//******************************************
// Author : Nessipbek Mynbayev
// Created On : Sat Jan 09 2021 01:25:40
// File : ThreeBags.cpp
//******************************************
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
int main()
{
ios_ba... | 11 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 10;
int pre[maxn], sz[maxn], sz2[maxn], ans, n, k, choose[maxn], f[maxn];
char s[maxn];
vector<int> a[maxn];
bool op[maxn];
int qry(int x) {
if (choose[x] == 0)
return sz2[x];
else if (choose[x] == 1)
return sz[x] - sz2[x];
else
retu... | 16 |
#include <bits/stdc++.h>
int main() {
long long int ans[505], i, j, k, l, n, m, a[505][505], r[505], av[505] = {0},
sum, x;
scanf("%lld", &n);
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++) scanf("%lld", &a[i][j]);
for (i = 1; i <= n; i++) ... | 9 |
#include <bits/stdc++.h>
using namespace std;
int func() { return 0; }
int main_() {
int k, l, m, n, d;
cin >> k >> l >> m >> n >> d;
int ans = 0;
for (int i = (1); i < (d + 1); i += (1)) {
if (i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0) {
ans += 1;
}
}
cout << ans;
return 0;
}
int... | 0 |
#include <bits/stdc++.h>
char s[3][2000];
char rd[11];
unsigned char now = 0;
int main() {
scanf("%s", rd);
for (int i = 0; rd[i]; ++i) {
for (int i = 0; i <= 1000; ++i) s[0][i] = s[1][i] = s[2][i] = '.';
s[1][0] = 'X';
s[0][0] = 'X';
printf("%s\n", s[2]);
--now;
for (int j = 2; j <= 1000; j... | 14 |
#include <bits/stdc++.h>
using namespace std;
int arr[105];
int main() {
int n, a, b, c, i, j, k, l, brr[105], f = 1, sum = 0, mx = 0, bad = 0;
for (i = 0; i < 5; i++) {
cin >> brr[i];
arr[brr[i]]++;
sum += brr[i];
}
sort(brr, brr + 5);
for (i = 1; i < 5; i++) {
if (brr[i] != brr[i - 1]) {
... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int maxn = 20010;
char s[maxn];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
while (t--) {
int n;
int l1, r1, l2, r2;
cin >> n >> s;
int nb[2];
memset(nb, 0, sizeof nb);
int mid = n / ... | 7 |
#include <bits/stdc++.h>
using namespace std;
long long fact[1001];
pair<long long, long long> add_pair(pair<long long, long long> a,
pair<long long, long long> b) {
return make_pair(a.first + b.first, a.second + b.second);
}
bool cmp(pair<long long, long long> a, pair<long long, l... | 7 |
#include <bits/stdc++.h>
long long P, q;
long long a = -1, b = -1, c = -1;
int main() {
scanf("%I64d", &P);
q = sqrt(P);
for (long long i = 2; i <= q; i++) {
if (P % i == 0) {
a = i;
break;
}
}
if (a == -1) {
printf("1\n0\n");
return 0;
}
P /= a;
q = sqrt(P);
for (long long... | 6 |
#include <bits/stdc++.h>
using namespace std;
map<char, long long> check;
int main() {
long long test;
cin >> test;
while (test--) {
long long n, i, j, cc = 0;
cin >> n;
long long ans = n;
while (n > 9) {
long long rem = n % 10;
ans += n / 10;
n = rem + n / 10;
}
cout << ... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int SI = 2e5 + 100;
long long exgcd(long long a, long long b, long long &x, long long &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
long long r = exgcd(b, a % b, y, x);
y -= (a / b) * x;
return r;
}
bool min_ans(long long a, long long b, long lon... | 11 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int x, y;
x = min(a, b);
if (a > b) {
a = a - x;
y = a / 2;
} else {
b = b - x;
y = b / 2;
}
cout << x << " " << y << endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<pair<int, int> > G[10010];
int dep[10010];
int s[2][10010];
int tot[2];
bool f[2][10010];
int up[10010];
vector<int> ans;
void dfs(int x, int p) {
for (int i = 0; i < (int)G[x].size(); i++) {
int y = G[x][i].first, id = G[x][i].second;
if (y == p)... | 21 |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 2e5 + 10;
long long n, a[MAX], maxi, mini, mid, c, k;
string s;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
mini = a[n / 2];
maxi = a[n - 1] + k + 10;
while (maxi - mini > 1) {
mid = (mini + maxi) / 2;... | 6 |
#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
void getprime(int);
string decToBinary(long long);
bool spsort(const pair<long long, long long> &a,
const pair<long long, long long> &b) {
if (a.first != b.first)
return (a.first > b.first);
else
return (a.second < b.seco... | 5 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.