solution stringlengths 53 181k | difficulty int64 0 27 |
|---|---|
#include <bits/stdc++.h>
using namespace std;
namespace fastIO {
bool IOerror = 0;
inline char nc() {
static char buf[100000], *p1 = buf + 100000, *pend = buf + 100000;
if (p1 == pend) {
p1 = buf;
pend = buf + fread(buf, 1, 100000, stdin);
if (pend == p1) {
IOerror = 1;
return -1;
}
}
... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t, n, m;
cin >> t;
while (t--) {
cin >> n >> m;
int ans = 0;
ans = ((n * m) + 1) / 2;
cout << ans << endl;
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ifstream fin("input.txt");
int i, j;
int ans = 0, a, b, c, x, y;
cin >> x >> y;
a = y;
b = y;
c = y;
while (true) {
if (a < b) {
if (a < c) {
a = (b + c) - 1;
ans++;
if (a >= x) {
ans += 2;
b... | 8 |
#include <bits/stdc++.h>
using namespace std;
const int MaxN = 100010;
int N, M, Q, K, idx[MaxN], inter[MaxN][350], flag[MaxN], cookie;
vector<int> v[MaxN], s[MaxN];
long long a[MaxN], cnt[MaxN], mali[MaxN];
int main(void) {
scanf("%d %d %d", &N, &M, &Q);
for (int i = 0; i < N; ++i) cin >> a[i];
for (int i = 0; i... | 17 |
#include <bits/stdc++.h>
void test();
int main() {
int t;
scanf("%d", &t);
while (t--) {
test();
}
return 0;
}
void test() {
int n, m, i, j, s = 0, count = 0, min = 100;
scanf("%d %d", &n, &m);
int a[n][m];
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
scanf("%d", &a[i][j]);
}
... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int nax = 1e7 + 10;
int isprime[nax], phi[nax], fac[nax];
int erlkgjerlgj[nax];
void add(int i, int v) {
for (i++; i < nax; i += i & -i) erlkgjerlgj[i] += v;
}
int sum(int i) {
int r = 0;
for (i++; i; i -= i & -i) r += erlkgjerlgj[i];
return r;
}
int main() {
... | 19 |
#include <bits/stdc++.h>
int a[111];
char in[1000];
int main() {
int t, m, i, j;
scanf("%d%d", &t, &m);
int aid = 1;
while (t--) {
scanf("%s", in);
int k;
if (in[0] == 'a') {
scanf("%d", &k);
for (i = 0; i <= m - k; i++) {
for (j = i; j < i + k; j++)
if (a[j] != 0) brea... | 8 |
#include <bits/stdc++.h>
using namespace std;
inline void read(int &x) {
int v = 0, f = 1;
char c = getchar();
while (!isdigit(c) && c != '-') c = getchar();
if (c == '-')
f = -1;
else
v = (c & 15);
while (isdigit(c = getchar())) v = (v << 1) + (v << 3) + (c & 15);
x = v * f;
}
inline void read(lo... | 19 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
template <class T>
bool umin(T& a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T>
bool umax(T& a, T b) {
if (a < b) {
a = b... | 18 |
#include <bits/stdc++.h>
using namespace std;
int t, n, x, k, p = 1;
int main() {
cin >> t;
for (int i = 1; i <= t; i++) {
k = 1;
p = 1;
cin >> n;
while (1) {
p = 1;
k++;
for (int j = 1; j <= k; j++) p = 2 * p;
if (n % (p - 1) == 0) {
cout << n / (p - 1) << endl;
... | 1 |
#include <bits/stdc++.h>
int o[100011];
long long _abs(int x) {
if (x < 0) return -x;
return x;
}
int main() {
int i;
int n, k;
int m;
int e = 0;
char inp[13];
long long ans[3];
long long q[3];
scanf("%d %d", &n, &k);
m = n + 1;
o[0] = -10001;
for (i = 0; i <= n; i++) {
scanf("%s", inp);
... | 16 |
#include <bits/stdc++.h>
using namespace std;
const int N = int(3e5) + 99;
int n;
vector<int> g[N];
int d[N];
int dp[N][2];
void dfs(int v, int p) {
vector<int> d1;
dp[v][1] = d[v] - 1;
for (auto to : g[v]) {
if (to == p) continue;
dfs(to, v);
dp[v][0] = max(dp[v][0], dp[to][0]);
if (g[to].size() ... | 14 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, m = 0, a, b, i, k;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a >> b;
m = m + a;
}
k = 0;
while (abs(m) > 500) {
cout << "G";
m = m - 1000;
k++;
}
k = n - k;
while (k) {
cout << "A";
k--;
}
cout... | 7 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
int arr[300004];
int accArr[300004];
int oddNum[1 << 20];
int evenNum[1 << 20];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >... | 8 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, count = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
if (a + b + c >= 2) {
count++;
}
}
cout << count;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1e9 + 7;
const double pi = acos(-1);
const int maxx = 100005;
int trie[maxx][26];
int nxt = 1, ans, n;
multiset<int> finish[maxx];
void Add(string s) {
int node = 0;
for (int i = 0; i < ((long long int)(s).size()); i++) {
if (trie[node][s[i... | 14 |
#include <bits/stdc++.h>
using namespace std;
const long double EPS = 1e-10;
const long long MOD = 1e9 + 7;
const long long OO = 1e18;
long long k, d, f;
long double t;
int dcmp(long double x, long double y) {
return fabs(x - y) <= EPS ? 0 : x < y ? -1 : 1;
}
bool valid(long double x) {
long long u = k + f;
long ... | 9 |
#include <bits/stdc++.h>
int c[1010][1010];
char a[1010][11][11];
int dis[1010], u[1010], f[1010];
int main() {
int n, m, nn, w, i, j, k, p, q, x;
scanf("%d%d%d%d", &n, &m, &nn, &w);
for (k = 0; k < nn; k++) {
for (i = 0; i < n; i++) scanf("%s", a[k][i]);
}
for (p = 0; p < nn; p++) {
for (q = p + 1; q... | 10 |
#include <bits/stdc++.h>
using namespace std;
int n, k;
long long m;
int c[110], cc[110][2];
long long tim[110];
long long f[110][10100];
int sqr(long long x) { return (x * x) % 1000000007; }
int qming(long long a, long long b) {
if (!b) return 1;
if (b & 1) return (sqr(qming(a, b / 2)) * a) % 1000000007;
return ... | 11 |
#include <bits/stdc++.h>
using namespace std;
multiset<long long> mx;
set<int> lr;
long long A[1000010];
long long psum[1000010];
int order[1000010];
int n;
int main(int argc, char const *argv[]) {
cin >> n;
for (int i = 0; i < n; i++) {
scanf("%I64d", A + i);
}
for (int i = 0; i < n; i++) {
scanf("%d",... | 8 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e3 + 5;
int n, m;
int d[MAXN];
set<pair<int, int> > heap;
vector<pair<int, int> > adj[MAXN];
int s, nmax;
void dijk() {
for (int i = 1; i <= n; ++i) d[i] = 1e9;
d[s] = 0;
heap.insert(pair<int, int>(d[s], s));
while (!heap.empty()) {
pair<int, i... | 7 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 5005;
int dp[maxn][maxn];
int a[maxn];
int main() {
int n;
while (scanf("%d", &n) != EOF) {
for (int i = 1; i <= n; i++) {
scanf("%d", a + i);
dp[1][i] = a[i];
}
for (int i = 2; i <= n; i++) {
for (int j = 1; j + i - 1 <= n... | 10 |
#include <bits/stdc++.h>
using namespace std;
template <typename T, typename S>
ostream& operator<<(ostream& os, const pair<T, S>& v) {
os << "(";
os << v.first << "," << v.second << ")";
return os;
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
os << "[";
long long sz = v.size... | 4 |
#include <bits/stdc++.h>
using namespace std;
int n, b, q;
vector<pair<int, int> > v;
int main() {
scanf("%d%d%d", &n, &b, &q);
for (int i = 1; i <= q; i++) {
int x, y;
scanf("%d%d", &x, &y);
v.push_back({x, y});
}
v.push_back({b, n});
sort(v.begin(), v.end());
for (int i = 0; i < v.size() - 1; ... | 17 |
#include <bits/stdc++.h>
const int MAXN = 1000010;
const int mod = 1000000007;
void reduce(int& x) { x += x >> 31 & mod; }
int mul(int a, int b) { return (long long)a * b % mod; }
int pow(int a, int b, int res = 1) {
for (; b; b >>= 1, a = mul(a, a))
if (b & 1) res = mul(res, a);
return res;
}
long long A[MAXN]... | 19 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const double eps = 1e-6;
const int mod = 1000000007;
int modpow(int x, int y, int md = mod) {
if (y == 0) return 1;
int ret = modpow(x, y >> 1, md);
ret = (long long)ret * ret % md;
if (y & 1) ret = (long long)ret * x % md;
return ret;
... | 12 |
#include <bits/stdc++.h>
using namespace std;
string alpha = "abcdefghijklmnopqrstuvwxyz";
const long long mod = 1e9 + 7;
const long long mod1 = 998244353;
const long long inf = 2e18 + 5;
const long long nax = 200010;
char a[] = {'R', 'G', 'B'};
void solve() {
long long n, k, best = inf;
cin >> n >> k;
string s;
... | 7 |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
const int MAXN = 300005... | 7 |
#include <bits/stdc++.h>
using namespace std;
void solution(int n) {
char c[1100];
char d[1100];
cin >> c >> d;
int l1 = 0, l2 = 0;
while (c[l1] != NULL) l1++;
while (d[l2] != NULL) l2++;
int sum1 = 0, sum2 = 0, sum11 = 0, sum22 = 0;
int i;
for (i = 0; i < l1 * l2; i++) {
if (c[i % l1] == 'R' && d... | 5 |
#include <bits/stdc++.h>
using namespace std;
map<int, vector<int> > mp;
map<int, vector<int> >::iterator it;
int ans[100005];
int main() {
int n, in;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &in);
mp[in].push_back(i);
}
int mx_idx = -5;
for (it = mp.begin(); it != mp.end(); it++) ... | 7 |
#include <bits/stdc++.h>
using namespace std;
int a, b[3001] = {0, 1}, s;
int main() {
cin >> a;
for (int i = 1; i <= a; i++)
if (i >= 2)
if (b[i] == 0) {
for (int j = 2; j * i <= a; j++) b[i * j]++;
} else if (b[i] == 2)
s++;
cout << s;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char a, b, c, d, e, f, g, h, i;
cin >> a >> b >> c >> d >> e >> f >> g >> h >> i;
if (a == i && b == h && c == g && d == f) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int hcf(int a, int b) {
if (a % b == 0) return b;
return hcf(b, a % b);
}
int main() {
int n;
cin >> n;
vector<int> m(n), r(n);
for (int i = 0; i < n; i++) cin >> m[i];
for (int i = 0; i < n; i++) cin >> r[i];
int lcm = 1;
for (int i = 0; i < n; i++) lcm =... | 9 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:200000000")
using namespace std;
const int INF = (int)1E9;
const long long INF64 = (long long)1E18;
const double EPS = 1E-9;
const double PI = acos((double)0) * 2;
const int MAXN = 210 * 1000;
string s;
int n;
struct node {
int l, r, par, link;
map<char, int>... | 15 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n) {
vector<int> v;
for (int i = 0; i < n; ++i) {
int t;
cin >> t;
v.push_back(t);
}
sort(v.begin(), v.end());
int ans = 0;
for (int i = 1; i < n; ++i) {
ans += v[i] - v[i - 1] - 1;
}
... | 0 |
#include <bits/stdc++.h>
template <typename T, typename U>
std::istream& operator>>(std::istream& input, std::pair<T, U>& v) {
return input >> v.first >> v.second;
}
template <typename T>
std::istream& operator>>(std::istream& input, std::vector<T>& v) {
for (T& a : v) input >> a;
return input;
}
void answer(unsi... | 3 |
#include <bits/stdc++.h>
using namespace std;
template <class T1, class T2, class T3 = hash<T1>>
using umap = unordered_map<T1, T2, T3>;
template <class T>
using uset = unordered_set<T>;
template <class T>
using vec = vector<T>;
const long long infll = numeric_limits<long long>::max() >> 1;
const int inf = numeric_limi... | 18 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 10;
const long long mod = 1e9 + 7;
int n, m, a[110][110], b[110][110], dp[110][110];
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
int z;
cin >> z;
for (int j = 1; j <= z; j++) {
int x, y;
cin >> x >> y;
... | 21 |
#include <bits/stdc++.h>
using namespace std;
int a[200005];
list<int>* adj = new list<int>[10005];
int main(int argv, char** args) {
long long int n, k, i, last = -1, win = 0, ans;
std::vector<int> v;
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 0) win++;
}
if (win > k) {
co... | 10 |
#include <bits/stdc++.h>
using namespace std;
string s;
int n, k;
vector<char> v;
int main() {
ios::sync_with_stdio(0);
cin >> n >> k;
if (k > n || (n > 1 && k == 1)) {
cout << -1;
return 0;
}
for (int i = 0; i < k; i++) {
char c = 'a' + i;
v.push_back(c);
}
int flag = 0, j = 2;
for (int... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int N = 5e5;
long long int l[N], r[N];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) cin >> l[i];
for (int i = 1; i <= n; i++) cin >> r[i];
vector<int> v;
v.push_back(0);
for (int i = 1; i <= n; i++) {
vector<int> vg;
for (int j = 0;... | 7 |
#include <bits/stdc++.h>
using namespace std;
const int dr[] = {-1, 1, 0, 0, -1, -1, 1, 1};
const int dc[] = {0, 0, 1, -1, -1, 1, -1, 1};
const int MOD = 1e9 + 7;
const int INF = 1e9;
const int N = 1e5 + 5;
const long double pi = acos(-1);
const double eps = 1e-9;
struct query {
int l, r, q;
};
bool cmp(query x, quer... | 10 |
#include <bits/stdc++.h>
using namespace std;
int main() {
unordered_map<long double, int> ch;
int n, z = 0, mx = 0;
int a[200005], b[200005];
long double c;
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
for (int i = 0; i < n; i++) scanf("%d", &b[i]);
for (int i = 0; i < n; i++) {
... | 7 |
#include <bits/stdc++.h>
const int maxn = 0x3f3f3f3f;
const double EI =
2.718281828459045235360287471352662497757247093699959574966967627724076630353547594571382178525166427;
using namespace std;
const int mod = 1e9 + 7;
struct node {
int to, id, flag;
long long val;
node(int a, long long b, int c, int d) {
... | 15 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[2002], b[2002];
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
b[i] = 1;
for (int q = 1; q <= n; q++) {
if (a[i] < a[q]) {
b[i] = b[i] + 1;
}
}
}
for (int i = 1; ... | 0 |
#include <bits/stdc++.h>
using namespace std;
vector<int> ert, inds;
int meg = -1;
void Add(set<int> &bin, int ind, int x) {
meg -= ert[ind];
ert[ind]++;
auto it = bin.insert(x).first;
if (next(it) != bin.end() && (*next(it)) == x + 1) ert[ind]--;
if (it != bin.begin() && (*prev(it)) == x - 1) ert[ind]--;
m... | 15 |
#include <bits/stdc++.h>
using namespace std;
map<long long, int> idx;
int arr[200005];
int hasil[200005];
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long a;
int n, maxi = 0, x = -1;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a;
arr[i] = i;
if (hasil[i] ... | 9 |
#include <bits/stdc++.h>
int N, M;
int **sol;
int max_sol = 0;
int *level, *cost, *income;
int kInvalid = -10000000;
int **alloc_memory() {
sol = (int **)malloc(sizeof(int *) * (N + M + 1));
for (int i = 0; i <= N + M; ++i) {
sol[i] = (int *)malloc(sizeof(int) * (N + 1));
for (int j = 0; j <= N; ++j) {
... | 20 |
#include <bits/stdc++.h>
int main() {
char str[100000];
int n;
scanf("%d %s", &n, str);
int i = 0, a[26] = {0};
if (strlen(str) > 26) {
printf("-1");
return 0;
}
while (str[i]) {
a[str[i] - 'a']++;
i++;
}
int s = 0;
for (i = 0; i < 26; i++) {
if (a[i] > 1) {
s += a[i] - 1;
... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 3 * 110000;
int p[MAXN], sa[MAXN];
int n, q;
struct Node {
int l, r;
int sum;
void modify(int L, int R) {
l = L;
r = R;
}
friend Node operator+(Node a, Node b) {
Node c;
c.modify(a.l, b.r);
c.sum = a.sum + b.sum;
if (sa[a.r... | 9 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int cnt = s.size();
for (int i = 1; i < s.size(); i++) {
if (s[i - 1] == 'R' && s[i] == 'U' || s[i - 1] == 'U' && s[i] == 'R') {
cnt--;
s[i] = 'D';
}
}
cout << cnt << endl;
}
| 0 |
#include <bits/stdc++.h>
int N;
int a[105];
int ans = 0;
int main() {
int i, j, k;
scanf("%d", &N);
for (i = 0; i < N; i++) scanf("%d", &a[i]);
for (i = 0; i < N; i++)
for (j = i; j < N; j++) {
int score = 0;
for (k = 0; k < i; k++) score += a[k];
for (k = i; k <= j; k++) score += 1 - a[k]... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int N = 22;
int n, m, u, v, a[1 << N], dp[1 << N];
int solve(int mask = 0) {
if (mask == (1 << n) - 1) return 0;
int& ret = dp[mask];
if (~ret) return ret;
ret = n;
for (int i = 0; i < n; ++i)
if (!mask || mask & (1 << i)) ret = min(ret, solve(mask | a[i... | 16 |
#include <bits/stdc++.h>
int main() {
int n, i, j, x = 0;
char string[4];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%s", &string);
for (j = 0; j < 3; j++) {
if (string[j] == '+')
x++;
else if (string[j] == '-')
x--;
}
}
printf("%d", x / 2);
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int maxN = 200005;
int main() {
int n, a, b;
map<pair<long long int, long long int>, int> velocityCounter;
map<long long int, int> featureCounter;
cin >> n >> a >> b;
long long int sum = 0;
for (int i = 0; i < n; i++) {
long long int x, vx, vy;
cin... | 12 |
#include <bits/stdc++.h>
using namespace std;
const int infint = 1e9;
const long long inf = 1e9;
const int MOD = (int)1e9 + 7;
const int MAXN = (int)103;
long long n, m, t, C[MAXN][MAXN], dp[2][MAXN][MAXN][MAXN];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m >> t;
C[0][0] = ... | 20 |
#include<bits/stdc++.h>
using namespace std;
set<long long int>st;
const long long int N=1e5+5;
long long int n,k;
long long int arr1[N],pref[N];
void recurse(long long int l,long long int r)
{
long long int mn,mx,i,mid,sum;
sum=pref[r]-pref[l-1];
st.insert(sum);
if(l==r)return;
mn=arr1[l],mx=arr1[r... | 8 |
#include <bits/stdc++.h>
using namespace std;
int N, M, K, C;
vector<pair<int, int> > G[100005];
bool vis[100005], group[100005], F;
void dfs(int v) {
vis[v] = 1;
group[v] = 1;
C++;
for (int i = 0; i < G[v].size(); i++)
if (!vis[G[v][i].first]) {
if (G[v][i].second) dfs(G[v][i].first);
} else {
... | 7 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:64000000")
using namespace std;
const int MAXN = 4010;
const long long INF = (long long)(2e9 + 1e-9);
int a[MAXN][MAXN];
int pr[MAXN][MAXN];
int ok[MAXN][MAXN];
vector<pair<int, int> > v;
set<int> S;
map<int, int> M;
vector<int> w[MAXN];
void rec(int i, int j) {
... | 13 |
#include <bits/stdc++.h>
using namespace std;
long long int n, k, ht, a[200005], par[200005], ct[200005], mark[200005];
vector<long long int> lc[200005];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> ht >> k;
lc[1].push_back(1);
long long int cur = 2;
for (long long int i ... | 13 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
string str;
for (int i = 0, j = 0; i < n; j++, i += j) {
str += s[i];
}
cout << str;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 50 + 10;
int num[maxn << 1];
vector<int> p;
int main() {
int n;
scanf("%d", &n);
int m = n * 2;
for (int i = 0; i < m; i++) scanf("%d", &num[i]);
int ans = 0x3f3f3f3f;
p.clear();
for (int i = 0; i < m; i++) {
for (int j = i + 1; j < m; j++... | 7 |
#include <bits/stdc++.h>
using namespace std;
long long arr[250001];
long long fact(long long a, long long m) {
if (a <= 1)
return 1;
else
return ((a % m) * fact(a - 1, m) % m);
}
long long power(long long a, long long b, long long m) {
if (b == 0 || a == 1) return 1;
if (a % b)
return (a * power(a,... | 8 |
#include <bits/stdc++.h>
using namespace std;
int n, r, c;
int a[1000010], ans[1000010], nxt[1000010];
string s;
void work(int x) {
if (x == 1) {
for (int i = 1; i <= n; ++i) ans[i] = nxt[i];
return;
}
work(x / 2);
for (int i = 1; i <= n; ++i) {
ans[i] = ans[ans[i]];
if (x & 1) ans[i] = nxt[ans[... | 13 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin >> t;
while (t--) {
int i = 0, ans = 0, n, p, k;
cin >> n >> p >> k;
vector<int> prices(n), v(n);
for (i = 0; i < n; i++) cin >> v[i];
sort(v.begin(), v.end());
int pr... | 8 |
#include <bits/stdc++.h>
#pragma optimize("O3")
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e9 + 7;
const int base = 2e5 + 1;
const int MAX = 1e5 + 2;
const double EPS = 1e-9;
const double PI = acos(-1.);
const int MAXN = 3 * 1e6 + 47;
mt19937 rng(chrono::steady_clock::now().time_since_ep... | 11 |
#include <bits/stdc++.h>
using namespace std;
long long n, i, answer, m, apb, apc, bpc, same;
vector<long long> v;
int k, j;
int main() {
cin >> n;
if (n % 3LL) {
cout << 0 << endl;
return 0;
}
n /= 3LL;
for (i = 2LL; i * i <= n; i += 1LL)
if (n % i == 0LL) {
v.push_back(i);
if ((i * i... | 16 |
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using LL = long long;
void solve() {
int n;
cin >> n;
vector<int> a(n);
for (auto &it : a) cin >> it;
sort(a.rbegin(), a.rend());
set<int> b(a.begin(), a.end());
while (true) {
int v = *b.rbegin();
bool t = false;
while ... | 11 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int** arr = new int*[n + 1];
for (int i = 0; i <= n; i++) {
arr[i] = new int[m + 1];
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) cin >> arr[i][j];
}
int** dp = new int*[n + 1];
for (int i = 0;... | 8 |
#include <bits/stdc++.h>
using namespace std;
int a[30], b[30], k[30], p[30];
int n, u, r;
int A[30];
long long sum, ans = -1ll * (int)HUGE_VAL * (int)HUGE_VAL;
void rec(char v, int m) {
if ((u - m) % 2 == 0) {
sum = 0;
for (int i = 0; i < n; ++i) sum += 1ll * A[i] * k[i];
ans = max(ans, sum);
}
if (u... | 12 |
#include <bits/stdc++.h>
using namespace std;
int n, k, cnt;
int a[400010], s[400010], b[400010], vis[400010];
priority_queue<pair<int, int> > Q;
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
for (int i = 1; i <= n; i++) s[i] = 1 << 30;
for (int i = n; i; i--) {
b[i] =... | 10 |
#include <bits/stdc++.h>
using namespace std;
void dbg_out() { cerr << endl; }
template <typename Head, typename... Tail>
void dbg_out(Head H, Tail... T) {
cerr << ' ' << H;
dbg_out(T...);
}
const long double pi = 3.14159265359;
const long long mod = 1000000007;
const long long modc = 998244353;
const long long inf... | 17 |
#include <bits/stdc++.h>
using namespace std;
int n, m, p, q, ans;
char a[40][40];
bool d[256], flag;
string s;
void fill(int x, int y) {
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) {
int t = a[i][j];
if (a[i][j] != 'S' && ((x - i) * (x - i) + (y - j) * (y - j)) <= p * p &&
97 <=... | 7 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 100000000;
inline int fastMin(int x, int y) { return x > y ? y : x; }
inline int fastMax(int x, int y) {
return (((y - x) >> (32 - 1)) & (x ^ y)) ^ y;
}
inline int fastAbs(int x) { return ((x >> (32 - 1)) & (x ^ (-x))) ^ x; }
te... | 9 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
long long n, l, m;
long long a[1000006], b[1000006];
struct mat {
long long m[105];
};
mat m1, m2, m3;
mat cul(mat a, mat b) {
mat tp;
memset(tp.m, 0, sizeof(tp.m));
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
... | 12 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
cin >> q;
while (q--) {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) cin >> v[i];
sort(v.rbegin(), v.rend());
int s = 0;
for (int i = 0; i < n; i++)
if (v[i] >= i + 1)
s++;
else
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int width = 0, height, n;
cin >> n >> height;
int children[n];
for (int i = 0; i < n; i++) {
cin >> children[i];
}
for (int i = 0; i < n; i++) {
if (children[i] <= height)
width += 1;
else
width += 2;
}
cout << width;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
pair<double, double> operator-(const pair<double, double>& a,
const pair<double, double>& b) {
return make_pair(a.first - b.first, a.second - b.second);
}
pair<double, double> operator+(const pair<double, double>& a,
... | 16 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()) {
v.assign(a, vector<T>(b, t));
}
template <class F, class T>
void convert(const F &f, T &t) {
stringstream ss;
ss << f;
ss >> t;
}
void mul(vector<vector<long long> > &a, const ve... | 15 |
#include <bits/stdc++.h>
#pragma warning(disable : 4996)
using namespace std;
const long long p = 3731;
const int N = 1 << 11;
const int M = N - 1;
long long deg[N];
long long h[N], h1[N], h2[N];
long long D1, D2;
vector<vector<vector<long long> > > HM;
char s[1 << 11], s1[1 << 11], s2[1 << 11];
int L, L1, L2;
bool Sea... | 12 |
#include <bits/stdc++.h>
using namespace std;
const int N = 105;
set<int> link[N];
bool vis[N];
int main() {
int n, m;
cin >> n >> m;
int u, v;
for (int i = 0; i < m; i++) {
scanf("%d%d", &u, &v);
link[u].insert(v);
link[v].insert(u);
}
vector<int> Q;
int ret = 0;
while (true) {
Q.clear(... | 4 |
#include <bits/stdc++.h>
using namespace std;
map<long long int, vector<long long int>> m;
long long int res[100005];
void func(long long int f, long long int n) {
long long int sum = 0;
for (auto it = m.rbegin(); it != m.rend(); it++) {
vector<long long int> v = it->second;
for (long long int i = 0; i < v.... | 9 |
#include<bits/stdc++.h>
#define ll long long int
#define pb push_back
#define ff first
#define ss second
using namespace std;
int main(void){
if(0){
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
int t;
cin>>t;
while(t--) {
ll n,i,j,k,x,y,z,attackPower,health;
cin>>attac... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int N = 500000;
struct type {
int mx, cnt;
friend type operator+(const type &a, const type &b) {
type c;
c.mx = max(a.mx, b.mx), c.cnt = 0;
if (c.mx == a.mx) c.cnt += a.cnt;
if (c.mx == b.mx) c.cnt += b.cnt;
return c;
}
};
int s[N + 5];
names... | 18 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
inline int add(int a, int b) {
a += b;
if (a >= 1000000007) a -= 1000000007;
return a;
}
inline int mul(int a, int b) { return (a * 1ll * b) % 1000000007; }
inline int power(int a, int b) {
int rt = 1;
while (b > 0) {
if (b & 1) r... | 2 |
#include <bits/stdc++.h>
using namespace std;
queue<int> q;
set<pair<int, int> > t[100100 << 1];
vector<int> ret;
set<pair<int, int> >::iterator it;
int n, de[100100 << 1], a[100100], b[100100], c[100100], d[100100], dis[100100],
pre[100100];
void insert(int x, pair<int, int> v) {
for (; x <= (*de); x += x & -x) ... | 17 |
#include <bits/stdc++.h>
inline int read() {
int x = 0, f = 0;
char ch = getchar();
while (!isdigit(ch)) f |= ch == '-', ch = getchar();
while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
return !f ? x : -x;
}
namespace Network {
const int inf = 1073741823;
static const int N = 50010, M = 1000010;
int... | 16 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char a[231];
cin >> a;
cout << (strlen(a) + 1) * 25 + 1;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const int maxN = 1e6;
const int mod = 1e9 + 7;
long long gcd(long long a, long long b) {
if (a == 0) {
return b;
}
return gcd(b % a, a);
}
long long int lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
long long int powerp(long lo... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 2e9;
const double eps = 1e-9;
const int maxn = 1e5 + 500, base = 1e9 + 7, maxm = 1e4 + 5;
bool used[maxn];
bool del[26];
pair<int, char> cnt[26];
int main() {
string second;
int k;
cin >> second >> k;
for (int i = 0; i < 26; i++) cnt[i].second = i;
... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
cout << max(n, m) - 1 << " " << min(n, m) << "\n";
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
int n, q, l, r, x, xx;
int St[4 * (int)(3e5 + 10)], Lazy[4 * (int)(3e5 + 10)];
pair<pair<int, int>, int> Q[(int)(3e5 + 10)];
void push(int v, int sol, int sag) {
St[sol] = Lazy[v];
St[sag] = Lazy[v];
Lazy[sol] = Lazy[v];
Lazy[sag] = Lazy[v];
Lazy[v] = -1;
}
void u... | 7 |
#include <bits/stdc++.h>
using namespace std;
int abs(int x) { return x > 0 ? x : -x; }
int main() {
int n, k1, k2;
scanf("%d%d%d", &n, &k1, &k2);
int k = k1 + k2;
int* a = new int[n];
for (int* it = a; it < a + n; ++it) scanf("%d", it);
priority_queue<int> Q;
for (int i = 0, b; i < n; ++i) {
scanf("%... | 7 |
#include <bits/stdc++.h>
using namespace std;
long long a, b, l, r, ans = 100, T;
long long Cal(char c) {
long long count = 0;
char s[100];
for (int i = 0; i < a; i++) s[i] = 'a' + i;
for (int i = a; i < a + b; i++) s[i] = c;
int have[26];
memset(have, 0, 26 * sizeof(int));
for (long long i = a + b - 1; i... | 14 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n, m, k;
vector<string> cmd;
int main() {
ios::sync_with_stdio(false);
cin >> n >> m >> k;
ll maxr = 4 * n * m - 2 * m - 2 * n;
if (maxr < k) {
cout << "NO" << endl;
return 0;
}
cout << "YES" << endl;
int cnt = 0;
for (int i... | 12 |
#include <bits/stdc++.h>
using namespace std;
int p[200005];
pair<pair<int, int>, pair<int, int> > ed[200005];
int sz[200005];
int pc[200005];
int d[200005];
int mpc[30][200005];
vector<pair<int, int> > G[200005];
int findp(int x) {
if (p[x] == x) return x;
return (p[x] = findp(p[x]));
}
int merge(int x, int y) {
... | 13 |
#include <bits/stdc++.h>
using namespace std;
int dx4[] = {-1, 0, 1, 0};
int dy4[] = {0, 1, 0, -1};
int dx8[] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dy8[] = {0, 1, 1, 1, 0, -1, -1, -1};
bool AreEqual(double a, double b) { return (fabs(a - b) < 1e-10); }
template <class T>
bool GetNr(T &_value) {
T _sign = 1;
char ch;
... | 14 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, x, i, j, n, res = 0;
scanf("%d%d", &a, &b);
n = a - b;
if (n < 0) {
printf("0\n");
} else if (n == 0) {
printf("infinity\n");
} else {
for (i = 1; i * i <= n; i++) {
if (n % i == 0) {
if (i * i == n) {
r... | 8 |
#include <bits/stdc++.h>
using namespace std;
int dat[10000000], pos[10000000], s[2][10000000], cnt, rt[100004];
void push(int id) {
if (dat[s[0][id]] >= dat[s[1][id]])
dat[id] = dat[s[0][id]], pos[id] = pos[s[0][id]];
else
dat[id] = dat[s[1][id]], pos[id] = pos[s[1][id]];
}
int merge(int l, int r, int id1,... | 23 |
#include <bits/stdc++.h>
const int inf = 2147483647;
const int ine = -2147482647;
using namespace std;
template <typename _Tp>
inline void _(_Tp &x);
inline int mx(int a, int b) { return a > b ? a : b; }
inline int mn(int a, int b) { return a < b ? a : b; }
int iIn1, iIn2, iIn3, iIn4;
int main() {
scanf("%d%d%d%d", &... | 12 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.