solution stringlengths 53 181k | difficulty int64 0 13 |
|---|---|
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const long long INF = 0x7ffffffffffffffll;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 5;
const int maxv = 1e3 + 5;
const double pi = acos(-1.0);
const double eps = 1e-9;
int t, n, res[105];
char f[105][2][1005];
char in[1005], did[1005];
map... | 9 |
#include <bits/stdc++.h>
using namespace std;
int n, X[100013], Y[100013];
long double t[90];
int gcd(int a, int b) { return a == 0 ? b : gcd(b % a, a); }
int main() {
t[0] = 1;
for (int i = 1; i < 90; i++) t[i] = t[i - 1] * 2;
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%d%d", &X[i], &Y[i]);
long dou... | 10 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double x;
scanf("%lf", &x);
double diff = 12345;
int da = -1, db = -1;
for (int a = 1; a <= 10; a++)
for (int b = 1; b <= 10; b++) {
double u = (a * b) / sqrt(4 * a * a + b * b);
u = fabs(u - x);
if (u < diff) {
diff = u;... | 5 |
#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
const int N = 1e6 + 10;
const long long mod = 1e9 + 7;
const int base = 131;
const double pi = acos(-1);
const double eps = 1e-8;
long long vis[N], num[N], n, m, k, x, y, z;
long long a[N], b[N];
long long ex, ey, cnt, ans, sum, flag, t, ff;
map<... | 4 |
#include <bits/stdc++.h>
using namespace std;
long long i, j, k, N, M, K;
long long t[100000], a[100000], b[100000], c[100000], ans[100000], ansc[100000];
int check() {
for (i = 1; i <= M; i++) {
if (t[i] == 2) {
long long m = -1 * 1000000000;
for (j = a[i]; j <= b[i]; j++) {
m = max(m, ans[j]... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
int n, k, l[maxn], r[maxn];
char c[maxn];
vector<int> v;
void dfs(int u) {
if (!u) return;
dfs(l[u]);
v.push_back(u);
dfs(r[u]);
}
int f[maxn], g[maxn];
void calc(int u, int cst) {
if (!u || cst > k) return;
calc(l[u], cst + 1);
if (... | 8 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
const int inf = 1e7;
const int MAXM = 3e5 + 5;
const int MAXN = 1e6 + 4;
int main() {
long long n, i, j, k;
long long a, b;
long long x = 0, y = 0;
cin >> a >> b;
for (i = 1; i * i <= a; i++) {
x++;
}
for (i = 1; i * (i + 1) <= b... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int tests;
cin >> tests;
while (tests--) {
int item;
cin >> item;
vector<int> v;
set<int> s;
int temp;
for (int i = 0; i < item; i++) {
cin >> temp;
v.push_back(temp);
s.insert(temp);
}
int distinct = 0;
... | 0 |
#include <bits/stdc++.h>
char s[200010];
int tree[26][200010 << 2];
bool vis[200010];
inline void PushUp(int t, int rt) {
tree[t][rt] = tree[t][rt << 1] + tree[t][rt << 1 | 1];
}
void Update(int t, int x, int L, int R, int rt) {
if (L == R)
tree[t][rt] = 1;
else {
int mid = (L + R) >> 1;
if (mid >= x)... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long n, a;
cin >> n;
for (long i = 9; i >= 1; i--) {
if (n % i == 0) {
a = i;
break;
}
}
int t = n / a;
cout << t << endl;
for (long i = 1; i <= t; i++) cout << a << " ";
}
| 0 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast", "unroll-loops", "omit-frame-pointer", "inline")
#pragma GCC option("arch=native", "tune=native", "no-zero-upper")
#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC target("sse4")
using namespace std;
vector<int> psn[(long long)(2e5 + 5)];
vector<pai... | 11 |
#include <bits/stdc++.h>
using namespace std;
template <typename T1, typename T2>
ostream& operator<<(ostream& cout, const pair<T1, T2>& a) {
return cout << "(" << a.first << "; " << a.second << ")";
}
template <typename T>
ostream& operator<<(ostream& cout, const vector<T>& a) {
if (a.size() == 0) {
return cou... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string s;
cin >> s;
int i, j;
int ans = 0;
int m1;
int n1;
int p1;
for (i = 0; i < s.length(); i++) {
m1 = 0;
n1 = 0;
p1 = 0;
for (j = i; j < s.length(); j++) {
... | 5 |
#include <bits/stdc++.h>
using namespace std;
long long a[1509][1509], maxp[1509][1509], maxs[1509][1509], s[1509][1509],
dp[1509][1509];
long long i, j, k, l, n, m, res = -10000000000;
int main() {
scanf("%I64d %I64d", &n, &m);
for (i = 1; i <= n; i++) {
maxp[i][0] = -10000000000;
maxs[i][m + 1] = -100... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (n == 1)
cout << m;
else if (n - m > m - 1 && n - m != 0)
cout << m + 1;
else
cout << m - 1;
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
using namespace std;
const int inf = -1u / 2;
const int N = 5010;
bool dp1[N][N], dp2[N][N];
int dp3[N][N];
int mx1[N], mx2[N];
vector<int> idx1, idx2;
string s1, s2;
int lcp(string &s, int id1, int id2) {
int ans = 0;
while (id1 < s.length() and id2 < s.length() and s[... | 7 |
#include <bits/stdc++.h>
template <class T>
inline T read(const T sample) {
T x = 0;
int f = 1;
char s;
while ((s = getchar()) > '9' || s < '0')
if (s == '-') f = -1;
while (s >= '0' && s <= '9')
x = (x << 1) + (x << 3) + (s ^ 48), s = getchar();
return x * f;
}
template <class T>
inline void write(... | 7 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long t;
long long a1, b1;
long long a2, b2;
long long lin, sin;
long long lre, sre;
cin >> t;
for (long long i = 0; i < t; i++) {
cin >> a1 >> b1;
cin >> a2 >> b2;
if (a1 < b1) {
sin = a1;
lin = b1;
} else {
... | 0 |
#include <bits/stdc++.h>
using namespace std;
void zoz() {
cin.tie(0);
std::ios::sync_with_stdio(false);
}
int main() {
zoz();
long long x, y, t, index = 0, maxx = -1e7, arr[1000];
cin >> x >> y;
for (int i = 1; i <= x; i++) {
cin >> arr[i];
}
for (int i = x; i >= 0; i--) {
if ((ceil((double)arr... | 1 |
#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7, n, m, a[500005];
vector<long long> v1, vis;
int main() {
scanf("%lld %lld", &n, &m);
string s1[n + 1];
for (long long i = 0; i < n; i++) cin >> s1[i];
long long flag = 1;
for (long long i = 0; i < n; i++)
for (long long j = 0; j < m; j... | 2 |
#include <bits/stdc++.h>
using namespace std;
vector<int> box[100100];
int f[100100], b[100100], a[100100];
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> f[i];
box[f[i]].push_back(i);
}
for (int i = 1; i <= m; i++) cin >> b[i];
int mark = 0;
for (int i = 1; i <= m; i+... | 3 |
#include <bits/stdc++.h>
char str[100];
int m, n, a[1000000], f[22][1 << 21];
int common(int x, int y) {
if (x == 0 || y == n + 1) return 0;
for (int i = m; i >= 0; i--) {
int s1 = a[x] & ((1 << i) - 1);
int s2 = a[y] >> (m - i);
if (s1 == s2) return i;
}
return 0;
}
int main() {
int i, spent, sav... | 10 |
#include <bits/stdc++.h>
template <class T1, class T2>
inline bool cmin(T1 &a, const T2 &b) {
return b < a ? (a = b, true) : false;
}
template <class T1, class T2>
inline bool cmax(T1 &a, const T2 &b) {
return a < b ? (a = b, true) : false;
}
template <class Type>
Type read() {
Type a;
bool b;
unsigned char c... | 12 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
const int mod = 1e9 + 7;
int n, m, q, tin[N], tout[N], timer, a[N], p[N], used[N];
vector<int> g[N];
bitset<1001> pr, cur;
struct node {
bitset<1001> b;
int add;
node() {
add = 0;
b.reset();
}
} T[N * 4];
void dfs(int v = 1, int pr = 0... | 10 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100012;
char S[N];
int main() {
long long c = 1LL;
int w = 1;
cin >> S;
S[strlen(S)] = 200;
for (int i = (1); i < (strlen(S) + 1); ++i) {
if (S[i] - '0' + S[i - 1] - '0' == 9) {
++w;
} else {
if (w > 1) {
if (w % 2 == 1) c... | 3 |
#include <bits/stdc++.h>
using namespace std;
const long long max_n = 300011, max_a = 1000011;
int n, k, used[max_n], m, cnt[max_n];
long long mx;
void get_cnt() {
for (int i = 1; i < max_n; ++i) {
for (int q = i * 2; q < max_n; q += i) {
++cnt[q];
}
}
}
int main() {
get_cnt();
cin >> n >> k;
fo... | 8 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int ans = 1;
cin >> n;
int k = 1;
ans = n / 2 + 1;
cout << ans;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int t;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> t;
for (int i = 0; i < t; i++) {
long long n, x, kolOne = 0, kolZero = 0;
long long diff = 0, ans = 0;
string s;
cin >> n >> x >> s;
for (int j = 0; j < s.size();... | 4 |
#include <bits/stdc++.h>
using namespace std;
long long a[200007];
long long x[200007];
int main() {
int n, q, i, j, k;
long long sum = 0;
cin >> n >> q;
for (i = 0; i < n; i++) cin >> a[i], sum += a[i];
for (i = 0; i < q; i++) cin >> x[i];
for (i = 1; i < n; i++) a[i] += a[i - 1];
long long cum = 0;
fo... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
int t = a.size();
for (int i = 0; i < a.size(); i++) {
if (a[i] == '0') {
a.erase(a.begin() + i);
break;
}
}
if (t == a.size()) {
for (int i = a.size() - 1; i >= 0; i--) {
if (a[i] == '1') {
... | 1 |
#include <bits/stdc++.h>
using namespace std;
fstream fout;
const double pi = 3.141592653589793;
array<int, 2> pLusminus = {-1, 1};
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(false);
if (0) {
fout.open("o.txt", ios::out);
if (!fout) cout << "noo!\nfilee!\n\n";
}
int t = 1;
whi... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if ((a == b) && a > 0 || (a == b + 1 || b == a + 1))
cout << "YES";
else
cout << "NO";
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int n, p[105], d;
bool g[105][105];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p[i];
p[i]--;
g[i][i] = true;
}
for (int i = 0; i < n; i++) {
cin >> d;
if (i + d < n) {
g[i][i + d] = g[i + d][i] = true;
}
if (i - d >... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 2005;
int n, k;
string c, d;
int main() {
int T;
cin >> T;
while (T--) {
cin >> n >> k >> c;
c = "#" + c;
d = c;
for (int i = 1; i <= n; i++)
if ((i + 1) / 2 < k)
if (i % 2)
d[i] = '(';
else
d[i... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k, i, j, ans;
cin >> n >> k;
string s;
cin >> s;
long long int a[26] = {0};
for (i = 0; i < n; i++) {
j = s[i] - 'A';
a[j]++;
}
j = INT_MAX;
for (i = 0; i < k; i++) {
if (a[i] < j) j = a[i];
}
ans = k * j;
co... | 0 |
#include <bits/stdc++.h>
using namespace std;
static const int INF = 0x3f3f3f3f;
static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
template <typename T, typename U>
static void amin(T &x, U y) {
if (y < x) x = y;
}
template <typename T, typename U>
static void amax(T &x, U y) {
if (x < y) x = y;
}
template <int M... | 9 |
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
const int MAXN = 100;
const int MINVAL = 1;
const int MAXVAL = 1000;
int n;
int a[MAXN];
int solve() {
int ret = 0, cur = 0;
for (int i = (0); i < (n); ++i) {
if (i - 1 >= 0 && a[i - 1] < a[i] - 1 || i == ... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
long long int total = 0, coin = 0, val, hand = 0;
for (int i = 1; i <= n; i++) {
cin >> val;
if (val < 0) {
val *= -1;
total -= val;
if (total < 0) {
... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
const int inf = 0x3f3f3f3f;
long long gcd(long long a, long long b) {
return (a % b) ? (gcd(b, a % b)) : b;
}
const int maxn = 1e6 + 5;
int pa(int x) {
int ans = 0;
while (x) {
ans += x % 10;
x /= 10;
}
return ans;
}
vector<int> ... | 8 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, p;
string s, number;
cin >> n;
string name[n];
int taxi[n], pizza[n], cg[n], tax, pizz, cgc, taxmax = -1, pizzmax = -1,
cgcmax = -1;
int taxifinal[n], pizzafinal[n], cgcfinal[n], ct = 0, cp = 0,... | 2 |
#include <bits/stdc++.h>
using namespace std;
void think() {
long long n;
cin >> n;
vector<long long> a(n);
for (long long i = 0; i < n; i++) {
cin >> a[i];
}
long long ans = 0;
unordered_map<long long, long long> mp;
mp[a[0]]++;
for (long long i = 1; i < n; i++) {
long long x = a[i];
a[i]... | 3 |
#include <bits/stdc++.h>
using namespace std;
const long long N = 105;
long long a[N], b[N];
int main() {
long long n, k, x, i, j, p, j1, ans = 0;
cin >> n >> k >> x;
for (i = 1; i <= n; i++) cin >> a[i];
for (i = 0; i <= n; i++) {
long long l = i;
long long r = i + 1;
long long cur = x;
long lo... | 3 |
#include <bits/stdc++.h>
using namespace std;
long long int powmod(long long int a, int b, int n) {
long long int rm = 1;
while (b) {
if (b % 2) {
rm = (rm * a) % n;
}
a = (a * a) % n;
b /= 2;
}
return rm;
}
const int N = 100000 + 200;
vector<int> edge[N];
int L[N] = {0}, maxdp = 0;
long l... | 7 |
#include <bits/stdc++.h>
using namespace std;
int n, X, Y, x, y, m, l, r, u, d, i;
int main() {
cin >> n >> X >> Y;
for (; i < n; i++) {
cin >> x >> y;
if (x < X) l++;
if (x > X) r++;
if (y < Y) d++;
if (y > Y) u++;
}
m = max(max(l, r), max(d, u));
if (m == l)
X--;
else if (m == r)
... | 2 |
#include <bits/stdc++.h>
#pragma GCC optimize("-O3")
using namespace std;
long long MOD = 1e9 + 7;
long long mpow(long long a, long long b) {
if (b >= (MOD - 1)) b %= (MOD - 1);
if (b == 0) return 1;
long long t1 = mpow(a, b / 2);
t1 *= t1;
t1 %= MOD;
if (b % 2) t1 *= a;
t1 %= MOD;
return t1;
}
long lon... | 7 |
#include <bits/stdc++.h>
std::pair<int, int> e[1000005];
int d[305];
int main() {
int n, t = 0;
scanf("%d", &n);
for (int i = 1; i <= n; ++i) scanf("%d", &d[i]);
for (int i = 1, x = 1; i <= n; ++i) {
for (int j = x; j < x + d[i]; ++j)
for (int k = j + 1; k <= x + d[n]; ++k) e[++t] = std::make_pair(j, ... | 8 |
#include <bits/stdc++.h>
using namespace std;
long long sum;
int main() {
int m, a, b;
int maxi = 0;
int y;
cin >> m >> a >> b;
int x;
x = 0;
sum += m + 1;
do {
while (x - b < 0 && x + a <= m) {
x = x + a;
maxi = max(maxi, x);
sum += m + 1 - maxi;
}
y = x;
while (y + a ... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int N = 300005;
char s1[N], s2[N], s[N];
int main() {
int len, i, set = 0;
scanf("%s", s1);
scanf("%s", s2);
len = strlen(s1);
sort(s1, s1 + len);
sort(s2, s2 + len);
int len2 = len / 2;
int len1 = len - len2;
for (i = 0; i < len2; i++) s2[i] = s2[le... | 5 |
#include <bits/stdc++.h>
using namespace std;
long long n, m = 0, k = 0;
bool test = false, test1 = false;
long long const N = 1e5 + 7;
long long const oo = 1000000007;
long long nChoosek(long long n, long long k) {
if (k > n) return 0;
if (k * 2 > n) k = n - k;
if (k == 0) return 1;
long long result = n;
for... | 0 |
#include <bits/stdc++.h>
using namespace std;
mt19937 mt(1904262252);
int get_difference(int m, vector<int> v) {
if (v.size() * 2 > m) {
vector<int> nxtv;
for (int i = 0; i < m; ++i) {
if (!binary_search(v.begin(), v.end(), i)) {
nxtv.push_back(i);
}
}
v = nxtv;
}
if (v.size() ... | 9 |
#include <bits/stdc++.h>
using namespace std;
template <class TH>
void _dbg(const char *sdbg, TH h) {
cerr << sdbg << " = " << h << "\n";
}
template <class TH, class... TA>
void _dbg(const char *sdbg, TH h, TA... a) {
while (*sdbg != ',') cerr << *sdbg++;
cerr << " = " << h << ", ";
_dbg(sdbg + 1, a...);
}
cons... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<pair<int, int>> arr(m);
pair<int, int> p;
for (int i = 0; i < m; i++) {
cin >> p.second >> p.first;
arr[i] = p;
}
sort(arr.begin(), arr.end(), [](pair<int, int> ... | 0 |
#include <bits/stdc++.h>
using namespace std;
struct P {
int x, y, z;
bool operator<(const P &a) const { return x > a.x; }
};
int a, b, c, i, k, o[3][800002], n, m, d, e,
dy[15] = {0, 0, -1, 1, -1, 1, -1, 1}, dx[15] = {-1, 1, 0, 0, 1, 1, -1, -1};
int l[100100];
long long x, y, z, v1, v2;
P u[200600];
int j[60];... | 5 |
#include <bits/stdc++.h>
using namespace std;
char s[1005];
int main() {
int ret = 0;
int p = 0;
while (gets(s)) {
if (s[0] == '+')
p++;
else if (s[0] == '-')
p--;
else {
int cnt = 0;
while (s[cnt] != ':') cnt++;
ret += (strlen(s) - cnt - 1) * p;
}
}
printf("%d\n"... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int maxN = 405;
int dp[maxN][maxN];
int fact[maxN];
int f[maxN];
int cnk[maxN][maxN];
int tst;
int mod;
int n;
int sum(int a, int b) {
int s = a + b;
if (s >= mod) s -= mod;
return s;
}
int sub(int a, int b) {
int s = a - b;
if (s < 0) s += mod;
return s;
... | 9 |
#include <bits/stdc++.h>
using namespace std;
const int Size = 1 << 18;
inline char getch() {
static char buf[Size], *p1 = buf, *p2 = buf;
return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, Size, stdin), p1 == p2)
? EOF
: *p1++;
}
int read() {
int s = 0, f = 1;
char c = getch();
whi... | 9 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long res = 0;
int n, t, rf = INT_MAX, rl = -INT_MAX, rmx = 0, bf = INT_MAX, bl = -INT_MAX,
bmx = 0, pl = 0;
cin >> n;
char c;
bool p = false;
while (n--) {
cin >> t >> c;
... | 7 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
if (a + b == c + d || a + c == d + b || a + d == c + b || a == c + b + d ||
c == a + b + d || b == c + d + a || d == a + b + c)
cout << "YES\n";
else
cout << "NO\n";
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int tc;
cin >> tc;
for (int i = 1; i <= tc; i++) {
int n;
cin >> n;
vector<int> a(n);
int coins = 1e9 + 7;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
auto check = [&... | 6 |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
const int mod = 998244353;
const int MK = 77, MX = 4002;
int N1, N2, K, res[2][MK], ans, fa[MX];
int s[MX][MK], f[MX][MK];
vector<int> G[MX];
void dfs1(int u, int f) {
fa[u] = f;
int *cur = s[u];
memset(cur, 0, sizeof(int) * (K + 1));
cur[0] = ... | 10 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double d = 16.180339887498949;
double x[] = {0, 13.090169943749475, 8.090169943749475, 3.090169943749475};
double y[] = {0, -9.510565162951535, 5.877852522924732, -9.510565162951535};
int n;
scanf("%d", &n);
printf("%d\n", 4 * n + 1);
for (int i =... | 7 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n, i, j, k, l, m, x, z, y, t, x1, y1, z1, f, q;
cin >> n;
set<pair<long long, long long> > s;
set<pair<long long, long long> >::iterator it;
map<long long, long long> mp1, mp2;
f... | 6 |
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int tests = 1;
cin >> tests;
while (tests--) {
long long int n;
cin >> n;
long long int a[n];
for (long long int i = 0; i < n; i++) cin >> a[i];
map<l... | 3 |
#include <bits/stdc++.h>
void C() {
long long n, p, w, d;
std::cin >> n >> p >> w >> d;
for (long long y = 0; y < w; y++) {
long long x = p - y * d;
if (x >= 0 && x % w == 0 && x / w + y <= n) {
std::cout << x / w << ' ' << y << ' ' << n - x / w - y << '\n';
return;
}
}
std::cout << -1... | 6 |
#include <bits/stdc++.h>
int min(int a, int b) {
if (a < b)
return a;
else
return b;
}
int main() {
int i, n, a, b, c, d, x, y, f = 0, idx, ans;
scanf("%d", &n);
for (i = 1; i <= 4; i++) {
scanf("%d %d %d %d", &a, &b, &c, &d);
x = min(a, b);
y = min(c, d);
if ((x + y) <= n && f == 0) {... | 1 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int maxn = 1e6 + 10;
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int main(int argc, char const *argv[]) {
int n, k;
while (cin >>... | 2 |
#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > graph(30001);
int visited[30001] = {0};
bool dfs(int pos, int end) {
if (pos == end) {
return true;
} else {
for (int x = 0; x < graph[pos].size(); x++) {
if (visited[graph[pos][x]] == 0) {
visited[graph[pos][x]] = 1;
i... | 1 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int t; cin >> t;
while (t--) {
int n; cin >> n;
int x; bool neg = 0;
for (int i = 0; i < n; i++) {
cin >> x;
neg |= (x < 0);
}
if (neg) cout << "NO\n";
else ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int p = 0, q = 0, r = 0;
int z;
for (int i = 0; i < n; i++) {
cin >> z;
p = p + z;
cin >> z;
q = q + z;
cin >> z;
r = r + z;
}
if (p == 0 && q == 0 && r == 0) {
cout << "YES";
} else {
cout << "NO... | 1 |
#include <bits/stdc++.h>
using namespace std;
int n;
vector<string> v;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
string command;
cin >> command;
if (command == "cd") {
string dir;
cin >> dir;
if (dir[0] == '/') {
v.clear();
string s;
dir += '/';
... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int oo = 0x3f3f3f3f;
const long long ooo = 9223372036854775807ll;
const int _cnt = 1000 * 1000 + 7;
const int _p = 1000 * 1000 * 1000 + 7;
const int N = 100005;
const double PI = acos(-1.0);
const double eps = 1e-9;
int o(int x) { return x % _p; }
int gcd(int a, int b... | 12 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, i, j, m, a, b;
cin >> n;
long long total = 0;
map<int, int> x;
for (i = 0; i < n; i++) {
cin >> a >> b;
x[a] = b;
}
cin >> m;
map<int, int> y;
for (i = 0; i < m; i++) {
cin >... | 1 |
#include <bits/stdc++.h>
using namespace std;
int n, k, m;
string s[100005];
int is_vol(char c) {
string t = "aeiou";
for (int i = 0; i < t.size(); i++) {
if (c == t[i]) return 1;
}
return 0;
}
int ok(vector<string> v) {
if (v.size() == 0) return 1;
set<string> v2;
for (int i = 0; i < v.size(); i++) {... | 4 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long int n;
cin >> n;
int c_2 = 0, c_3 = 0, c_5 = 0;
while (!(n % 2)) {
++c_2;
n /= 2;
}
while (!(n % 3)) {
++c_3;
n /= 3;
}
while (!(n % 5)) {
++c_5;
n /= 5;
}
if (n != 1) {
cout << "-1" << endl;
retur... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a, b;
cin >> n >> a >> b;
n *= 6;
bool flag = false;
if (a > b) {
swap(a, b);
flag = true;
}
long long ans = (long long)9e18;
long long ax = -1, ay = -1;
for (long long xx = 1; xx <= n; xx++) {
long long x = xx;
lo... | 6 |
#include <bits/stdc++.h>
using namespace std;
long long a, n, res;
int main() {
scanf("%lld%lld", &a, &n);
n += a;
for (long long l = 1; l <= n; l++) {
long long c = n / l, r = n / c;
long long x = a % c, y = a / c - x;
if (y >= 0 && (n - x) / c >= (n + y + c) / (c + 1))
res += max(
mi... | 9 |
#include <bits/stdc++.h>
using namespace std;
long long int modpow(long long int a, long long int n, long long int temp) {
long long int res = 1, y = a;
while (n > 0) {
if (n & 1) res = (res * y) % temp;
y = (y * y) % temp;
n /= 2;
}
return res % temp;
}
int main() {
int p = 1, n = 0, x, y, N = 0,... | 5 |
#include <bits/stdc++.h>
using namespace std;
int n, m, ans, a[10001000], vis[10001000];
bool hav[10001000];
void dfs(int x) {
if (vis[x]) return;
vis[x] = 1;
for (int i = 0; i < n; i++)
if (x & (1 << i)) dfs(x ^ (1 << i));
if (hav[x]) dfs(x ^ ((1 << n) - 1));
return;
}
int main() {
scanf("%d%d", &n, &m... | 8 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:16000000")
using namespace std;
const int Maxn = 200005;
const int Maxm = 21;
const int Maxmy = 500005;
int n;
vector<int> neigh[Maxn];
int L[Maxn], P[Maxn][Maxm];
int distA[Maxn], distB[Maxn];
int trunk[Maxn];
vector<int> my[Maxmy];
long long res;
vector<pair<pa... | 8 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 700 + 7;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
int a[maxn];
int g[maxn][maxn];
int n;
struct as {
int l, r, v;
bool operator<(const as& b) const {
if (l < b.l) return true;
if (l > b.l) return false;
if (r < b.r) return true;
... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int max_n = 111, inf = 1000111222;
const int max_v = 100011;
namespace flow {
struct edge {
int v;
long long res_cap;
edge() {}
edge(int v, long long res_cap) : v(v), res_cap(res_cap) {}
};
vector<edge> all;
vector<int> g[max_v];
void add_edge(int u, int v, lo... | 9 |
#include <bits/stdc++.h>
using namespace std;
int a[21021020];
char aa[] = "RGB";
char bb[] = "GBR";
char cc[] = "BRG";
int sa[2102020];
int sb[2020220];
int sc[2020200];
int main() {
int T;
cin >> T;
while (T--) {
int n, m;
cin >> n >> m;
getchar();
char c;
char last;
a[1] = 1;
int ju... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 10;
const long long inf = 1e9 + 7;
long long mod = 1e9 + 7;
struct node {
int l = 0, r = 0, fa = 0, v = 0;
char op;
bool tmp;
} a[maxn];
int dfs1(int u) {
int x, y;
if (a[u].l != 0) {
x = dfs1(a[u].l);
}
if (a[u].r != 0) {
y = df... | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, t, i, c, cnt = 0, e = 0, j = 0;
cin >> n >> t >> c;
long long a[n + 5];
for (i = 1; i <= n; i++) {
cin >> a[i];
++j;
if (j == c) {
if (a[i] <= t) ++e;
if (e == c) ++cnt;
if (a[i - c + 1] <= t) --e;
--j;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
long long int power(long long int x, long long int n) {
if (n == 0) return 1;
if (n % 2) return x * power(x * x, (n - 1) / 2);
return power(x * x, n / 2);
}
long lo... | 4 |
#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 P[16] ... | 6 |
#include <bits/stdc++.h>
using namespace std;
using ull = uint64_t;
using ll = int64_t;
using PII = pair<int, int>;
using VI = vector<int>;
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
te... | 4 |
#include <bits/stdc++.h>
using namespace std;
long long n, m, s, p[100005];
char a[100005], b[100005], c[100005];
signed main() {
scanf("%lld%lld%s%s", &n, &m, a + 1, b + 1);
for (long long i = 1; i <= n; i++)
if (a[i] != b[i]) p[++s] = i;
if (m < (s + 1) / 2) return puts("-1"), 0;
if (m >= s) {
for (lo... | 4 |
#include <bits/stdc++.h>
using namespace std;
int solve() {
int n, x, count = 2;
string s;
cin >> s;
cout << s[0];
for (int i = 1; i < s.size(); i++) {
if (s[i] != s[i - 1] || count > 1) {
cout << s[i];
count = 1;
} else
count++;
}
return (0);
}
int main() {
ios::sync_with_stdi... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long powmod(long long a, long long b, long long mod) {
if (b == 0 || a == 1) {
if (mod == 1)
return 0;
else
return 1;
}
if (b % 2 == 0) {
long long k = powmod(a, b / 2, mod);
return (k * k) % mod;
} else {
long long k = powmod(a,... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 34;
int n, a[N], mn = 1e9, sum, less0, x;
int main() {
cin >> n;
for (int i = 0; i < n * 2 - 1; i++) {
cin >> x;
if (abs(x) < mn) mn = abs(x);
sum += abs(x);
if (x < 0) less0++;
}
if (less0 % 2 && n % 2 == 0) sum -= mn * 2;
cout... | 5 |
#include <bits/stdc++.h>
using namespace std;
vector<int> phnode[1000010];
int ph = 0;
int node[1000010];
int num[1000010];
int low[1000010];
bool chk[1000010];
int cnt = 0;
long long sccost[1000010];
vector<long long> cost[1000010];
vector<int> edge[1000010];
vector<long long> phcost[1000010];
vector<int> phedge[10000... | 6 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using PII = pair<int, int>;
using VPII = vector<PII>;
using PLL = pair<ll, ll>;
using VPLL = vector<PII>;
using VI = vector<int>;
using VVI = vector<VI>;
using Vll = vector<ll>;
using VVll = vector<Vll>;
using VC = vector<char>;... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 10000 + 5;
int main() {
int n, m;
int ant = 0;
set<int> s;
scanf("%d %d", &n, &m);
int c, a;
for (int i = 0; i < m; i++) {
s.clear();
int key = 0;
scanf("%d", &c);
for (int j = 1; j <= c; j++) {
scanf("%d", &a);
if (k... | 2 |
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
struct pt {
double x, y;
pt(){};
pt(double _x, double _y) : x(_x), y(_y){};
pt operator+(pt const& p) { return pt(x + p.x, y + p.y); }
pt operator-(pt const& p) { return pt(x - p.x, y - p.y); }
pt operator*(pt const& p) { return pt(x ... | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char arr[4][4];
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
cin >> arr[i][j];
}
}
bool found = false;
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
int w = 0, b = 0;
for (int k = i; k < i + 2... | 1 |
#include <bits/stdc++.h>
using namespace std;
int s[20];
bool r[20];
vector<pair<int, int> > ans;
void Hanoi(int a, int b, int n, bool last) {
--n;
if (n < 0) return;
int c = 6 - a - b;
if (last && s[n] > 1 && !r[n]) {
if (n == 0) {
Hanoi(a, b, n, false);
for (int i = 1; i < s[n]; ++i) ans.push_... | 8 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7, INF = 1e9 + 7;
int n, m, ans[N], mx[N << 2];
map<int, int> R;
vector<int> V;
struct Node {
int l, r, t, id;
void in() { scanf("%d%d%d", &l, &r, &t); }
} a[N], b[N];
bool cmp(Node a, Node b) { return a.l < b.l || a.l == b.l && a.id < b.id; }
void u... | 8 |
#include <bits/stdc++.h>
using namespace std;
vector<int> vis(2e5 + 10, 0), dis(2e5 + 10, 0), par(2e5 + 10, -1);
int dp[5001][5001];
int dp2[5001][5001];
class graph {
private:
int v;
list<pair<int, int> >* adj;
list<pair<int, int> >* radj;
public:
graph(int x) {
v = x + 1;
adj = new list<pair<int, i... | 5 |
#include <bits/stdc++.h>
using namespace std;
int k, n, a[222222], old[222222];
int main() {
scanf("%d%d", &n, &k);
for (int i = 0; i <= n; ++i) {
int first;
scanf("%d", &a[i]);
old[i] = a[i];
}
for (int i = 0; i < n; ++i) {
int add = abs(a[i]) / 2;
if (a[i] < 0) add *= -1;
a[i + 1] += a... | 7 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.