solution stringlengths 53 181k | difficulty int64 0 27 |
|---|---|
#include <bits/stdc++.h>
using namespace std;
char arr[10008];
void generateString(string &x, int beg, int ending) {
for (int i = beg; i <= ending; i++) {
x.push_back(arr[i]);
}
}
int vis[10008][2];
string currentWord;
int numberOfSuffixes = 0;
bool wordPossibility[32][32][32];
void printConvertion(char x) {
... | 10 |
#include <bits/stdc++.h>
using namespace std;
long long spf[5000001];
long long ans[5000001];
int main() {
long long t, l, r;
cin >> t >> l >> r;
for (int i = 1; i < 5000001; i++) {
spf[i] = i;
}
for (long long i = 2; i * i < 5000001; i++) {
if (spf[i] == i) {
for (long long j = 2 * i; j < 50000... | 10 |
#include <bits/stdc++.h>
using namespace std;
char M[42][42];
int contz[42][42];
int ans[42][42][42][42];
int main() {
int n, m, q;
scanf("%d %d %d", &n, &m, &q);
for (int i = 0; i < n; ++i) scanf("%s", M[i]);
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= m; ++j)
contz[i][j] = (M[i - 1][j - 1] == ... | 11 |
#include <bits/stdc++.h>
using namespace std;
pair<int, int> p[205];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) cin >> p[i].first >> p[i].second;
int ans = 0;
for (int i = 1; i <= n; i++) {
int flag[4] = {0};
for (int j = 1; j <= n; j++) {
if (j == i) continue;
if (p[j].fir... | 2 |
#include <bits/stdc++.h>
using namespace std;
void fre() {
freopen("c://test//input.in", "r", stdin);
freopen("c://test//output.out", "w", stdout);
}
template <class T1, class T2>
inline void gmax(T1 &a, T2 b) {
if (b > a) a = b;
}
template <class T1, class T2>
inline void gmin(T1 &a, T2 b) {
if (b < a) a = b;
... | 13 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 15, MAXL = 11;
struct FN {
int bit[MAXN][MAXL][MAXL][4];
int get(int p, int mod, int rem, int c) {
int ret = 0;
for (p++; p; p -= p & -p) ret += bit[p][mod][rem][c];
return ret;
}
void update(int p, int mod, int rem, int c, int val... | 13 |
#include <bits/stdc++.h>
using namespace std;
using llu = unsigned long long;
const int N = 1e5 + 10;
int n, m;
llu h[N], ngh[N];
int ans[N];
int main() {
scanf("%d%d", &n, &m);
llu All = 0;
h[0] = 1;
for (auto i = 1, _end = n; i <= _end; ++i) {
h[i] = h[i - 1] * 2345678901239ll;
All ^= h[i];
}
whil... | 11 |
#include <bits/stdc++.h>
using namespace std;
vector<int> arr;
bool revisa(int n, int k) {
vector<int> dv;
if (k > n) swap(k, n);
for (int i = 1; i * i <= k; i++) {
if (k % i == 0) {
int div2 = k / i;
dv.push_back(i);
if (div2 != i) dv.push_back(div2);
}
}
for (int i = 1; i < dv.size... | 4 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("-O3")
vector<long long> v[8000000];
long long isithBitSet(long long n, long long k) {
if (n & (1LL << (k)))
return 1;
else
return 0;
}
vector<long long> tempOne;
vector<long long> tempZero;
int main() {
ios_base::sync_with_stdio(0);
cin... | 12 |
#include <bits/stdc++.h>
using namespace std;
map<long long, long long> m;
int main() {
long long n;
cin >> n;
long long a[n + 10];
long long cnt = 0;
for (long long i = 1; i <= n; i++) {
cin >> a[i];
while (m[a[i]]) {
a[m[a[i]]] = 0;
m[a[i]] = 0;
a[i] = a[i] << 1;
cnt++;
}... | 8 |
#include <bits/stdc++.h>
using namespace std;
const long long int N = 2e5 + 5;
const long long int mod = 1e9 + 7;
bool flag;
long long int ans = 0;
vector<long long int> graph[N], degree(N, 0);
vector<bool> vis(N, false);
void dfs(long long int u) {
if (degree[u] != 2) flag = false;
vis[u] = true;
for (long long ... | 7 |
#include <bits/stdc++.h>
using namespace std;
vector<int> dis(vector<vector<int> >& v, int x) {
int n = v.size();
vector<int> visited(n, -1);
queue<int> q;
q.push(x);
visited[x] = 0;
while (q.size()) {
int t = q.front();
int val = visited[t];
q.pop();
for (int i = 0; i < v[t].size(); i++) {
... | 13 |
#include <bits/stdc++.h>
template <typename T>
void MACRO_VAR_Scan(T& t) {
std::cin >> t;
}
template <typename First, typename... Rest>
void MACRO_VAR_Scan(First& first, Rest&... rest) {
std::cin >> first;
MACRO_VAR_Scan(rest...);
}
template <typename T>
void MACRO_VEC_ROW_Init(int n, T& t) {
t.resize(n);
}
tem... | 16 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e3 + 10;
const long long mod = 1e9 + 7;
long long cal[N][N];
void init(int n) {
cal[0][0] = 1;
for (int i = 1; i <= n; i++)
for (int j = 0; j <= i; j++) {
if (!j)
cal[i][j] = 1;
else
cal[i][j] = (cal[i - 1][j - 1] + cal[i -... | 15 |
#include <bits/stdc++.h>
namespace my_std {
using namespace std;
const long long mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T>
inline T rnd(T l, T r) {
return uniform_int_distribution<T>(l, r)(rng);
}
template <typename T>
inline void read(T& t) {
t = 0;
... | 22 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
using dd = double;
using ldd = long double;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n, r;
cin >> n >> r;
vector<ll> arr((ll(1)) << n);
ll sum = 0;
n = ((ll)1) << n;
for (int i = ... | 17 |
#include <bits/stdc++.h>
using namespace std;
const int N = 15e4 + 5, MAX = 1e6 + 5;
int n, q, a[N], fa[N], upb, node[MAX];
set<pair<int, int> > s;
struct factorer {
int tot, p[9];
} fct[MAX];
int find(int u) { return fa[u] == u ? u : fa[u] = find(fa[u]); }
void merge(int u, int v) {
u = find(u), v = find(v);
if ... | 19 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
int a[105];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d", &a[i]);
}
a[++n] = 1001;
int ans = 0;
int len = 1;
int pre = 0;
for (int i = 1; i <= n; ++i) {
if (a[i] == pre + 1) {
pre++;... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
std:
ios::sync_with_stdio(false);
long long N;
cin >> N;
cout << N / 2520 << "\n";
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
void Read(int &p) {
p = 0;
int f = 0;
char c = getchar();
for (; c < '0' || c > '9'; c = getchar()) f |= (c == '-');
for (; c >= '0' && c <= '9'; c = getchar()) p = p * 10 + c - '0';
if (f) p = -p;
}
int n, d, k, A[200005];
int lst[200005], ans;
int stk1[200005]... | 23 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
for (int i = 0; i < t; ++i) {
long long int a, b, c, d;
cin >> a >> b >> c >> d;
if (a - c == 0)
cout << abs(b - d) << endl;
else if (b - d == 0)
... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
const int mo = 1e9 + 7;
int ans, f, n, m, h, s;
int a[maxn], c[maxn], k, sum[maxn];
int b[maxn], flag, tmp;
int dp[maxn];
int main() {
int T;
int cas = 1;
while (cin >> n) {
flag = 0;
cout << n << " ";
for (int i = 1; i <= n - 1; i... | 2 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n;
cin >> n;
long long arr[n];
for (long long i = 0; i < n; i++) {
cin >> arr[i];
}
bool win[n];
win[n - 1] = true;
for (long long j = n - 2; j >= 0; j--) {
if (arr[j] == 1) {
win[j] = !win[j + 1];
}
if (arr[j] ... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int N = 1e6 + 5;
int gcd(int a, int b) {
if (b == 0) return a;
a %= b;
return gcd(b, a);
}
bool compare(long long i, long long j) { return i > j; }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long... | 10 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
int a[205][205];
bool ok_red[205], cached[205];
bool proveri() {
bool ok = true;
for (int i = 1; i < n; i++) {
if (!cached[i]) {
int x[2] = {0, 0};
for (int j = 0; j < m; j++) {
x[a[i][j] ^ a[0][j]]++;
}
ok_red[i] = !(x[0] &... | 14 |
#include <bits/stdc++.h>
using namespace std;
const long double PI = 3.141592653589793;
const long long mod = 1e9 + 7;
int CASE = 1;
const int mxn = 1e5 + 1;
const long long infll = 1e18;
const int infi = 1e9;
bool prime(long long n) {
if (n <= 1) return false;
if (n == 2 or n == 3) return true;
if (n % 2 == 0 or... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 111111;
int bit[maxn][40];
int num[maxn];
int l[maxn], r[maxn], p[maxn], tot;
int main() {
int n;
scanf("%d", &n);
int mx = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &num[i]);
if (num[i] > mx) mx = num[i];
}
tot = 30;
while (!((1 <... | 10 |
#include <bits/stdc++.h>
using namespace std;
long long int arr[501000], cum[501000];
vector<long long int> adj[501000];
long long int f(long long int i, long long int j) {
if (i == j) return arr[i];
long long int ma = -1;
for (long long int k = i; k <= j; k++) {
ma = max(ma, f(i, k) + f(k + 1, j));
}
if ... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
for (int i = 0; i < s.length(); i++) {
int l = 0, r = 0;
for (int j = i; j < s.length(); j++) {
if (s[j] == '(')
l++;
else if (s[j] == ')')
l--;
else {
l--;
r++;
... | 10 |
#include <bits/stdc++.h>
using namespace std;
int n, a, b, num, sum = 0, lev[200001], leaflev[101], r, c, k[200000], m,
u[200000], flag = 0, cnt = 0, q, p, x, y;
pair<int, int> sz[50];
long long int w;
long long dist[100001], summ, suml, sumr;
vector<int> vii[300001];
int ch[50][50];
bool cycle[101], ... | 8 |
#include <bits/stdc++.h>
using namespace std;
const int Inf = 1 << 30;
const int N = 1e2 + 10;
int n, k;
struct node {
int x;
int id;
} a[N];
int ans[N];
bool cmp(node a, node b) { return a.x < b.x; }
map<int, int> q;
int main() {
while (~scanf("%d %d", &n, &k)) {
q.clear();
memset(ans, 0, sizeof(ans));
... | 6 |
#include <bits/stdc++.h>
using namespace std;
int x[103], y[103], vis[104];
vector<int> a[104];
void add(int i, int j) {
a[i].push_back(j);
a[j].push_back(i);
}
bool bl = true;
void dfs(int i, int k) {
vis[i] = k;
if (k == 1)
k = 2;
else
k = 1;
for (int j = 0; j < a[i].size(); j++) {
int ver = a... | 14 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
scanf("%d%d", &a, &b);
printf("%d", (b + a - 1) / a);
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
long long exgcd(long long a, long long b, long long &x, long long &y) {
if (!b) {
x = 1;
y = 0;
return a;
}
long long res = exgcd(b, a % b, y, x);
y -= (a / b) * x;
return res;
}
int n, m, x, y, vx, vy, refx, refy;
long long a, b, coefa, coefb, gcd, c;... | 18 |
#include <bits/stdc++.h>
using namespace std;
int n;
int main() {
cin >> n;
vector<long long> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
vector<long long> sum(1 << n);
vector<int> pos;
for (int i = 0; i < 1 << n; i++) {
for (int j = 0; j < n; j++) {
if ((i >> j) & 1) sum[i] += a[j];
}
}
... | 23 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long i, j, n;
cin >> n;
long long a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
long long max1 = INT_MIN;
long long sum = 0;
long long max1_id = -1;
long long c[n][n];
for (j = 0; j < n; j++) {
sum = 0;
c[j][j] = a[j];
... | 7 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 5;
const long long LINF = LLONG_MAX;
int main() {
int n;
cin >> n;
int a[n];
int r1 = 0, r2 = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] <= 500000) {
r1 = max(r1, a[i] - 1);
}
if (a[i... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
printf("\?9\?\?\?\?<>10\n");
for (int i = 0; i < 9; i++) printf("%d\?\?\?\?<>%d\n", i, (i + 1) % 10);
printf("9\?\?\?\?>>\?\?\?\?0\n");
for (int i = 0; i < 10; i++) printf("\?\?%d>>%d\?\?\n", i, i);
printf("\?\?>>\?\?\?\?\n");
for (int i = 0; i < 9;... | 17 |
#include <bits/stdc++.h>
using namespace std;
int n;
long long k;
long long fib[57];
void input();
void solve();
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
input();
solve();
return 0;
}
void input() { scanf("%d%I64d", &n, &k); }
void solve() {
int i;
fib[0] = fib[1] = 1;
for (i = 2; i <= n... | 11 |
#include <bits/stdc++.h>
using namespace std;
int arr[55];
int main() {
int t, n;
cin >> t;
while (t--) {
cin >> n;
for (int i = 0; i < n; i++) cin >> arr[i];
sort(arr, arr + n);
bool p = true;
for (int i = 1; i < n; i++) {
if (arr[i] - arr[i - 1] <= 1)
continue;
else {
... | 0 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
int a[100];
int b[100];
int count = 0;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (b[i] == a[j]) {
count++;
}
}
}
cou... | 0 |
#include <bits/stdc++.h>
using namespace std;
inline long long read() {
long long d = 0, f = 1;
char s = getchar();
while (s < '0' || s > '9') {
if (s == '-') f = -1;
s = getchar();
}
while (s >= '0' && s <= '9') {
d = d * 10 + s - '0';
s = getchar();
}
return d * f;
}
long long ksm(long l... | 16 |
#include <bits/stdc++.h>
using namespace std;
unordered_map<unsigned long long int, int> m;
bool findPowerOf2(int n) {
if ((m.find(n) != m.end()) && m[n] != 0) {
m[n]--;
return true;
}
if (n == 1) return false;
return findPowerOf2(n / 2) && findPowerOf2(n / 2);
}
int main() {
int q;
cin >> q;
whil... | 2 |
#include <bits/stdc++.h>
using namespace std;
map<int, int> dct;
void solve() {
int n, p, k;
cin >> n >> p >> k;
const int mod = p;
for (int i = 0; i != n; ++i) {
int x;
cin >> x;
long long diff = 1LL * x * k % mod;
x = (1LL * x * x) % mod;
x = (1LL * x * x) % mod;
x -= diff;
if (x <... | 15 |
#include <bits/stdc++.h>
const int maxn = 100000 + 100;
char s[maxn];
int vis[maxn], d[maxn];
int main() {
int n;
scanf("%d", &n);
scanf("%s", s);
memset(d, 0, sizeof(d));
memset(vis, 0, sizeof(vis));
for (int i = 1; i <= n; i++) {
scanf("%d", &d[i]);
}
vis[1] = true;
int now = 1, flag;
while (1... | 2 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
int h1[n], h2[n];
for (int i = 0; i < n; i++) cin >> h1[i];
for (int i = 0; i < n; i++) cin >> h2[i];
long long ax = 0, ay = 0;
for (int i = 0; i < n; i++) {
long long x = max(ax, ay + h1[i]);
long long y = max(ay, ax + ... | 6 |
#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:64000000")
const int infi = 1e9 + 7;
const long long infl = 1e18 + 7;
int ans[100];
int ar[101];
vector<string> name;
int main() {
cin.sync_with_stdio(false);
cin.tie(0);
for (int i = 0; i < (26); ++i) {
for (int j = 0; j < (26); ++... | 7 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 77, L = 26;
int n, S[N][L], t = 1, H[N], A;
char s[N];
multiset<int> D[N];
void insert() {
int m = strlen(s), id = 1;
for (int i = 0; i < m; i++) {
if (S[id][s[i] - 'a'] == 0) {
++t;
S[id][s[i] - 'a'] = t;
}
id = S[id][s[i] - ... | 14 |
#include <bits/stdc++.h>
using namespace std;
const int N = 500005;
struct edge {
int to, nxt, col;
} e[N];
int n, m, cnt = -1, head[N];
int ans[N], dis[N];
queue<int> q;
bool vis[N];
void addedge(int x, int y, int z) {
++cnt;
e[cnt].to = y;
e[cnt].nxt = head[x];
e[cnt].col = z;
head[x] = cnt;
}
void bfs(in... | 17 |
#include <bits/stdc++.h>
using namespace std;
int m[50000], n[50000];
int main() {
int x, y, a, b;
while (~scanf("%d %d %d %d", &x, &y, &a, &b)) {
memset(m, 0, sizeof(m));
memset(n, 0, sizeof(n));
if (x <= b) {
printf("0\n");
continue;
}
int cnt = 0;
if (a <= b) a = b + 1;
fo... | 3 |
#include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (y == 0) return 1;
while (x % y != 0) {
int r = x % y;
x = y;
y = r;
}
return y;
}
int main() {
int a, b, c, d, x, y, x1, y1, x2, y2, g;
cin >> a >> b >> c >> d;
x1 = abs((b * c) - (d * a));
y1 = c * b;
x2 = abs((a * ... | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
;
int n, p;
cin >> n >> p;
string s;
cin >> s;
int i = n - 1;
s[i]++;
while (i >= 0 && i < n) {
if (s[i] - 'a' >= p) {
s[i] = 'a';
i--;
if (i >= 0) s[i]++;
} else if (i >= 1... | 9 |
#include <bits/stdc++.h>
using namespace std;
int a[500005][2], n;
bool check(double t) {
int i;
double d = -1e20;
for (i = 0; i < n; i++) {
if (a[i][1] > 0)
d = max(d, a[i][0] + t * a[i][1]);
else if (a[i][0] + t * a[i][1] <= d)
return true;
}
return false;
}
int main() {
while (~scanf(... | 15 |
#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1000000000 + 7;
const long long int N = 10000000 + 6;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string st1;
string st2;
cin >> st1 >> st2;
int n = st2.size();
int l = 0, r = 0;
for (int i = 0; i < n; i++) ... | 7 |
#include <bits/stdc++.h>
using namespace std;
inline long long next_int() {
int32_t x;
scanf("%d", &x);
return x;
}
inline long long next_long() {
long long x;
scanf("%lld", &x);
return x;
}
const long long maxn = 2e5 + 10;
long long a[maxn], tp[maxn], r[maxn], maxi, suffix[maxn], nxt[maxn], b[maxn];
deque<... | 9 |
#include <bits/stdc++.h>
using namespace std;
int ara[111];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int i, j, k, l, m, n, ans = 0;
cin >> n;
for (i = 1; i <= n; i++) cin >> ara[i];
for (i = 2; i < n; i++) {
if (ara[i - 1] == ara[i + 1] && ara[i - 1] == 1 && ara[i] == 0) {
ara[i + 1]... | 2 |
#include <bits/stdc++.h>
using namespace std;
int nxt() {
int x;
cin >> x;
return x;
}
int main() {
int n = nxt();
vector<int> a(n);
generate(a.begin(), a.end(), nxt);
int mx = *max_element(a.begin(), a.end());
vector<int> p(mx + 1, n - 1);
for (int i = 0; i < int(n); ++i) p[a[i]] = i;
int ans = n -... | 2 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
using namespace std;
const int maxn = 2e5 + 5;
const int mod = 1000000007;
const long long INF = 1e18;
const int MX = 2000000001;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
long long t, q, n, a, b, c, k = 0, l, mr, r, x = 0, ... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n, d, m;
vector<int> v[2];
int len[2];
vector<long long> pre[2];
int ceil(int a, int b) { return (a + b - 1) / b; }
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> d >> m;
for (int i = 1; i <= n; i++) {
... | 10 |
#include <bits/stdc++.h>
using namespace std;
long long n, m, k;
long long series(long long a, long long b) {
long long val1 = (b * (b + 1)) / 2;
if (a > 0) a--;
long long val2 = (a * (a + 1)) / 2;
return val1 - val2;
}
long long solve(long long mid) {
long long ret = 0;
long long val = k;
if (mid <= k) {... | 7 |
#include <bits/stdc++.h>
using namespace std;
const int big = 1e5 + 7;
int l[big], r[big], record[big];
int main() {
int n, num = 0, p = 0, q = 0, large, temp;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d %d", &l[i], &r[i]);
p += l[i];
q += r[i];
}
large = p - q;
if (large < 0) larg... | 3 |
#include <bits/stdc++.h>
using namespace std;
int n, root = 0, curr = 0;
vector<vector<int>> adj, cost;
vector<bool> used;
void dfs(int v) {
used[v] = true;
for (auto u : adj[v])
if (!used[u]) {
curr += cost[v][u];
dfs(u);
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 111;
int last[maxn], n, k, a[maxn], b[maxn], c[maxn];
set<pair<int, int> > q;
vector<int> pos[maxn];
bool was[maxn];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d%d", &a[i], &b[i]);
q.erase(make_pair(-last[a[i]], a... | 12 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
long long fact[1000001];
long long inv[1000001];
long long primes[100007];
long long arr[1000007];
long long modPower(long long b, long long p) {
if (p == 0) return 1;
long long halfpow = modPower(b, p / 2);
long long toReturn = (halfpow... | 9 |
#include <bits/stdc++.h>
using namespace std;
const int Maxn = 100005;
const int Inf = 1000000000;
int n, m;
vector<pair<int, int> > neigh[Maxn];
int zdist[Maxn], bfsdist[Maxn];
int zpar[Maxn], bfspar[Maxn];
pair<int, int> par[Maxn];
set<int> S, nS;
void BFS(int v, int dist[], int par[], bool zer) {
bool ok[10] = {};... | 14 |
#include <bits/stdc++.h>
using namespace std;
const double pi = acos(0.0) * 2.0;
const double eps = 1e-12;
const int step[8][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1},
{1, 1}, {1, -1}, {-1, 1}, {-1, -1}};
template <class T>
inline T abs1(T a) {
return a < 0 ? -a : a;
}
template <class T>
inline ... | 22 |
#include <bits/stdc++.h>
using namespace std;
const long long SIZE = 1e5 * 3 + 10, MOD = 1e9 + 7, phi = 500000002;
map<long long, long long> cnt;
vector<long long> vec;
long long gcd(long long a, long long b, long long& x, long long& y) {
if (a == 0) {
x = 0;
y = 1;
return b;
}
long long x1, y1;
lon... | 12 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j;
int m, l, h;
cin >> m;
int a[m];
for (i = 0; i < m; i++) cin >> a[i];
cin >> l >> h;
int lbeg = -1, hbeg = 101, lint = -1, hint = 101;
int sum = 0;
for (i = 0; i < m; i++) {
sum += a[i];
if (sum >= l && lbeg == -1) lbeg = i +... | 2 |
#include <bits/stdc++.h>
using namespace std;
int n, m, q, u[105], v[105], a[105], b[105], c[105], bt[1 << 13];
long long f[13][1 << 13];
bool check(int x, int y, int s) {
for (int i = 1; i <= m; i++)
if (1 & (s >> u[i])) {
if (!(1 & (s >> v[i]))) {
if (y != u[i] || x != v[i]) return false;
}
... | 18 |
#include <bits/stdc++.h>
using namespace std;
char buf[1 << 20], *p1, *p2;
template <class T>
inline void read(T &n) {
char ch =
(p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 20, stdin), p1 == p2)
? 0
: *p1++);
T w = 1, x = 0;
while (!isdigit(ch)) {
if (ch == '-') w = -1;
... | 15 |
#include <bits/stdc++.h>
using namespace std;
int charcount[26];
int res[26];
int n, tempcount, tnum;
char c;
int main() {
for (int i = 0; i < 1024; ++i) {
scanf("%c", &c);
if (!(c - 'a' >= 0) && (c - 'a' < 26)) {
break;
}
++charcount[c - 'a'];
}
scanf("%d", &n);
for (int i = 0; i < 26; ++... | 6 |
#include <bits/stdc++.h>
using namespace std;
struct __timestamper {};
struct myset {
set<pair<long long, int>> s;
map<int, long long> val;
long long add_all;
public:
void add_to_all(long long x) { add_all += x; }
void insert(int pos, long long x) {
x -= add_all;
val[pos] = x;
s.insert({x, pos})... | 20 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int n, k;
cin >> n >> k;
std::vector<int> a(n);
std::vector<int> b(n);
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < n; i++) cin >> b[i];
int l = 0;
int r = 2001;
while (l < r) {
int count... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int LIM = 50;
const int MAX_BIT = 26;
const int MAX_MASK = 1 << MAX_BIT;
struct state {
char s;
int i, j, pi, pj;
state() {}
state(char s, int i, int j, int pi, int pj)
: s(s), i(i), j(j), pi(pi), pj(pj) {}
};
bool operator<(const state& a, const state& ... | 16 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 50;
char s[maxn], t[maxn], ans[maxn];
int main() {
gets(s);
gets(t);
int k = 0, len = strlen(s);
for (int i = 0; i < len; i++)
if (s[i] != t[i]) k++;
if (k % 2) {
printf("impossible\n");
return 0;
}
int i = 0;
k /= 2;
for... | 3 |
#include <bits/stdc++.h>
using namespace std;
int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
pair<pair<int, int>, pair<int, int> > intersect(pair<int, int> f1,
pair<int, int> f2,
pair<int, in... | 8 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e3;
int d[N][N] = {0}, inq[N][N] = {0};
int n, m;
bool check(vector<string> &a, int x, int y) {
bool x1 = 0, x2 = 0, x3 = 0, x4 = 0;
if (x < 0 || x > n - 1 || y < 0 || y > m - 1) return 0;
if (inq[x][y] || a[x][y] == '.') return 0;
if (x > 0 && y > 0)... | 16 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
int main() {
cin >> n >> m;
if (n == m)
cout << "Yes";
else
cout << "No";
return 0;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 5e4 + 10;
const int SIZE = 256;
int n, q;
int a[maxn];
vector<int> adj[maxn];
int h[maxn];
int par[maxn];
int id;
int trie[maxn][2];
int cnt[maxn];
int L[200 + 10][maxn];
int R[256 + 10][maxn];
int stk[maxn];
int top;
int nx[maxn];
inline void add(int x) {
... | 24 |
#include <bits/stdc++.h>
int brojZaPal[512][512];
int sol[512][512];
int prev[512][512];
bool postoji[512][512];
char s[512];
int o;
int res, solK;
char solution[1024];
int starting;
int min(int a, int b) { return a < b ? a : b; }
int main() {
scanf("%s", &s);
scanf("%d", &starting);
for (int i = 0; i < strlen(s)... | 11 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void pfill(T* pst, const T* ped, T val) {
for (; pst != ped; *(pst++) = val)
;
}
template <typename T>
void pcopy(T* pst, const T* ped, T* pval) {
for (; pst != ped; *(pst++) = *(pval++))
;
}
const int N = 262144;
const int Mod = 998244353;... | 23 |
#include <bits/stdc++.h>
using namespace std;
int cnt = 0, cntq = 0, ans = 0;
int forw[5001][5001], back[5001][5001];
string str;
int main() {
cin >> str;
int len = str.length();
for (int i = 0; i < len; i++) {
cnt = cntq = 0;
if (str[i] == ')') {
continue;
}
if (str[i] == '(') {
cnt =... | 10 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline T abs(T t) {
return t < 0 ? -t : t;
}
const long long modn = 1000000007;
inline long long mod(long long x) { return x % modn; }
int a[100009];
int main() {
int i, j, n;
char c;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf(" %c"... | 8 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int dx[] = {0, 0, 1, -1, 1, -1, 1, -1}, dy[] = {-1, 1, 0, 0, 1, -1, -1, 1};
int n, k;
vector<int> adj[101], adj2[101];
const ll mod = 1e9 + 7;
void dfs(int x, int from = -1) {
for (int y : adj[x])
if (y != from) {
ad... | 17 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
char s[maxn];
int main() {
int n, a, b;
cin >> n >> a >> b;
scanf("%s", s);
int ff = 0, ans = 0;
for (int i = 0; i < n; i++) {
if (a == 0 && b == 0) continue;
if (s[i] == '.') {
if (ff == 0) {
if (a >= b) {
... | 5 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using PP = pair<ll, P>;
const ll n_ = 111 + 100, inf = 1e18, mod = 1e9 + 7, sqrtN = 333, p = 27;
ll dy[4] = {-1, 0, 1, 0}, dx[4] = {0, 1, 0, -1};
ll n, m, k, tc = 1, a, b, c, d, sum, x, y, z, w, base, ans;
ll gcd(ll x, ll y) {
... | 14 |
#include <bits/stdc++.h>
using namespace std;
char a[111][111], b[111][111];
int n, m;
string s;
int main() {
cin >> n >> m;
for (int(i) = 0; (i) < (n); ++(i))
for (int(j) = 0; (j) < (m); ++(j)) {
cin >> a[i][j];
b[j][i] = a[i][j];
}
for (int(i) = 0; (i) < (n); ++(i))
for (int(k) = 0; (k) ... | 3 |
#include <bits/stdc++.h>
using namespace std;
mt19937 rng((long long)chrono::steady_clock::now().time_since_epoch().count());
const long long mod = 1e9 + 7;
long long n, a[200010];
void op_ida(long long Ini, vector<long long> &ans) {
for (long long ini = Ini; ini <= n - 2; ini++) {
long long meio = ini + 1, fim =... | 17 |
#include <bits/stdc++.h>
using namespace std;
long long n, k, s;
void findAns() {
cout << "YES"
<< "\n";
int p = 1;
for (int i = 0; i < k; i++) {
if (i < s % k) {
if (i & 1)
p -= s / k + 1;
else
p += s / k + 1;
} else {
if (i & 1)
p -= s / k;
else
... | 8 |
#include <bits/stdc++.h>
using namespace std;
int ss[100];
int main() {
int n, m, h;
cin >> n >> m >> h;
int sum = 0;
for (int i = 0; i < m; i++) {
cin >> ss[i];
sum += ss[i];
}
if (sum < n) {
cout << "-1.0" << endl;
return 0;
} else if (ss[h - 1] == 1) {
cout << "0.0" << endl;
ret... | 8 |
#include <bits/stdc++.h>
using namespace std;
const int N = 20;
int dp[(1 << N) - 1] = {};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
;
string str;
cin >> str;
int L = str.length();
int val = 1;
int mask;
int c;
for (int i = 0; i < L; i++) {
mask = 0;
for (int k = 0; k <= ... | 14 |
#include <bits/stdc++.h>
using namespace std;
int dx[4] = {-1, 1, 0, 0};
int dy[4] = {0, 0, 1, -1};
int BitSetUp(int x, int idx) { return x = x | (1 << idx); }
int BitUnSet(int x, int idx) { return x = x & (~(1 << idx)); }
bool BitCheking(int x, int idx) { return x & (1 << idx); }
bool PowerOfTwo(int x) { return (x && ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int n, k;
long long a[1000005];
long long dp[1000005];
long long cal(long long now) {
long long ans = 0;
int cnt = 1;
while (now) {
int res = now % 10;
if (res % 3 == 0) ans += a[cnt] * res / 3ll;
now /= 10;
cnt++;
}
return ans;
}
int main() {
sc... | 22 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
int off = 1;
int a[1000006];
int b[1000006];
pair<int, int> t[4000005];
void ubaci(int pos, int koliko) {
pos += off;
t[pos].first += koliko;
t[pos].second += koliko;
pos /= 2;
while (pos > 0) {
t[pos].first = t[pos * 2 + 1].first + t[pos * 2].first;... | 14 |
#include <bits/stdc++.h>
using namespace std;
long long n, k, dp[500002];
string s, t;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k >> s >> t;
s = ';' + s;
t = ';' + t;
dp[0] = 1;
long long ans = 0;
for (int i = 1; i <= n; i++) {
dp[i] = 2 * dp[i - 1];
if (s[i] == 'b') dp... | 12 |
#include <bits/stdc++.h>
using namespace std;
const int K = 5000;
int n, num[K + 3], divp[K + 3][K + 3], ed[K + 3];
long long ans;
int main() {
scanf("%d", &n);
for (int i = 1, k; i <= n; i++) scanf("%d", &k), num[k]++;
for (int i = 1; i <= K; i++) {
for (int j = 1; j <= K; j++) divp[i][j] += divp[i - 1][j];
... | 19 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
if (a % 4 == 1)
cout << "0 A" << endl;
else if (a % 4 == 2)
cout << "1 B" << endl;
else if (a % 4 == 3)
cout << "2 A" << endl;
else
cout << "1 A" << endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
string getMin(string a, string b) {
if (a == "") return b;
if (b == "") return a;
if (a.length() < b.length())
return a;
else if (a.length() > b.length())
return b;
else
return a < b ? a : b;
}
string gao(int n, int k) {
string ans = "";
for (int b... | 14 |
#include <bits/stdc++.h>
using namespace std;
class grav {
private:
char det;
int n = 0;
vector<vector<int> > gr;
public:
grav(string type) {
this->n = 0;
if (type == "lr") {
this->det = 1;
} else if (type == "ly") {
this->det = 2;
}
}
grav(string type, int a) {
this->n = ... | 10 |
#include <bits/stdc++.h>
using namespace std;
string s;
string answer;
void In() { cin >> s; }
void Solve() {
answer = s;
stack<pair<char, int>> stk;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '1')
stk.push({s[i], i});
else {
if (!stk.empty() && stk.top().first == '1')
stk.pop();... | 12 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.