solution stringlengths 53 181k | difficulty int64 0 27 |
|---|---|
#include <bits/stdc++.h>
using namespace std;
const int inf = (int)1e9 + 7;
const int N = (int)2e5 + 7;
int n;
int cnt[4];
string s, t;
int main() {
cin >> n >> s >> t;
for (int i = 0; i < n * 2; ++i) {
cnt[(s[i] - '0') * 2 + (t[i] - '0')]++;
}
int a1 = 0, a2 = 0;
for (int t = 1; t <= n * 2; ++t) {
if... | 7 |
#include <bits/stdc++.h>
using namespace std;
struct node {
long long y, next;
} a[200010];
long long len = 0, last[100010];
long long n, dfn[100010], z = 0;
struct trnode {
long long dep, fa[20];
} tr[100010];
void ins(long long x, long long y) {
a[++len].y = y;
a[len].next = last[x];
last[x] = len;
}
void d... | 20 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 20;
const int M = 1e6 + 20;
int a[N], dp1[N], dp2[N], dp3[N], p[N], b[N];
int main() {
cout.tie(0);
int t;
scanf("%d", &t);
while (t--) {
int n;
scanf("%d", &n);
vector<pair<int, int> > v;
for (int i = 0; i < n; i++) {
scanf... | 16 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:32000000")
using namespace std;
const double pi = 3.1415926535897932384626433832795;
template <class T>
inline T Sqr(const T &x) {
return x * x;
}
template <class T>
inline T Abs(const T &x) {
return x >= 0 ? x : -x;
}
int n, k;
int a[105];
bool was[105];
voi... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int maxx = 505;
int dp[maxx][maxx], n, a[maxx];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i], dp[i][i] = 1, dp[i + 1][i + 1] = 1, dp[i][i + 1] = 1;
for (int k = 2; k <= n; k++) {
... | 11 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
unordered_map<char, string> umap = {
{'>', "1000"}, {'<', "1001"}, {'+', "1010"}, {'-', "1011"},
{'.', "1100"}, {',', "1101"}, {'[', "1110"}, {']', "1111"}};
string input, binary;
cin >> inp... | 4 |
#include <bits/stdc++.h>
using namespace std;
namespace {
int CC_;
const int SZ = 1E6;
const double EPS = 1E-9;
const double PI = 2 * acos(0.0);
const long long MOD = 1000000007;
template <class T>
void DA(T i, T e) {
while (i != e) {
cout << "Con>>( " << ++CC_ << " ) " << *i++ << endl;
}
}
template <class T>
v... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 5e3 + 9;
vector<int> g[MAX], v;
int n;
bitset<MAX> tmp, ans;
int dfs(int v, int p) {
int ret = 1;
for (auto u : g[v])
if (u != p) ret += dfs(u, v);
return ret;
}
int main() {
cin >> n;
for (int i = 1, v, u; i < n; i++)
cin >> v >> u, v--, u... | 7 |
#include <bits/stdc++.h>
using namespace std;
const long long mod1 = 675685497, mod2 = 965936261;
string s, t;
int k;
long long ans;
bool used[2000];
set<pair<long long, long long> > q[2000];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> s >> t >> k;
for (int i = 0; i < t.size(); ... | 10 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, a, b, boxes = 0, matches = 0;
cin >> n >> m;
vector<pair<int, int> > v(m);
for (int i = 0; i < m; i++) {
cin >> a >> b;
v[i] = make_pair(b, a);
}
sort(v.rbegin(), v.rend());
for (int i = 0; i < m; i++) {
if (boxes + v[i].seco... | 1 |
#include <bits/stdc++.h>
using namespace std;
long long v[10000][2], k;
int main() {
long long a, b, x, y;
cin >> x >> y >> a >> b;
for (long long i = a; i <= x; i++) {
for (long long j = b; j <= y; j++) {
if (i > j) {
v[k][0] = i;
v[k][1] = j;
k++;
}
}
}
cout << k ... | 3 |
#include <bits/stdc++.h>
const int uninitialized = -1;
struct Node {
Node* left;
Node* right;
int leftBorder, rightBorder;
int value;
Node() : left(0), right(0), value(0) {}
};
Node* build(int leftBorder, int rightBorder) {
Node* result = new Node;
result->leftBorder = leftBorder;
result->rightBorder = ... | 7 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
long long sol;
long long a[100005];
vector<int> pos[100005];
long long cambio(int x, int y) {
long long sum = 0;
for (int i = 0; i < pos[x].size(); i++) {
if (pos[x][i] == 0) {
if (a[1] == x) continue;
sum += abs(a[1] - y);
} else if (pos[x... | 10 |
#include <bits/stdc++.h>
using namespace std;
const int N = 105;
int n, arr[N], cnt[2];
bool mark[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
if (arr[i] != 0) mark[arr[i]] = 1;
}
for (int i = 1; i <= n; i++) {
... | 10 |
#include <bits/stdc++.h>
static const int MAXN = 1002;
int n, x, y;
inline bool ask(const std::vector<int> &s) {
printf("? %lu", s.size());
for (int u : s) printf(" %d", u + 1);
putchar('\n');
fflush(stdout);
int ans;
scanf("%d", &ans);
if (ans == -1)
exit(0);
else {
int even = (s.size() & 1) ? ... | 16 |
#include <bits/stdc++.h>
using namespace std;
const int maxh = 100000001;
char a[maxh], b[maxh];
int main() {
int m, n;
scanf("%s", a + 1);
scanf("%s", b + 1);
n = strlen(a + 1);
m = strlen(b + 1);
int mile[] = {0, 0};
int t = 0;
for (int i = 1; i <= m; i++) {
t ^= (a[i] - '0');
t ^= (b[i] - '0'... | 10 |
#include <bits/stdc++.h>
using namespace std;
const long double pi = 3.1415926535897932384626433832795l;
template <typename T>
inline auto sqr(T x) -> decltype(x * x) {
return x * x;
}
template <typename T>
inline T abs(T x) {
return x > T() ? x : -x;
}
template <typename T1, typename T2>
inline bool umx(T1& a, T2 ... | 7 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
using vpii = vector<pii>;
using vvpii = vector<vpii>;
using vi = vector<ll>;
using vvi = vector<vi>;
const ll MOD = 998244353;
void exteucl(ll& e, ll x, ll& f, ll y, ll& ggt) {
ll p_0 = x;
ll p_1 = y;
ll s_0 = 1;
ll s_... | 15 |
#include <bits/stdc++.h>
using namespace std;
double INF = 1e10;
void comp(double r, double v, double a, double b, double &minT, double &maxT) {
if (v == 0) {
if ((r - a) * (r - b) < 0)
minT = -INF, maxT = INF;
else
minT = INF, maxT = -INF;
} else {
double ta = (a - r) / v, tb = (b - r) / v;... | 15 |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0;
int f = 1;
char c = getchar();
while (!isdigit(c)) {
if (c == '-') f = -1;
c = getchar();
}
while (isdigit(c)) {
x = x * 10 + c - '0';
c = getchar();
}
return x *= f;
}
int n, d, e, m, ans, w[20];
bool f[1000000... | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int s = 0, s1, min = 400;
for (int i = 0; i < n; ++i) {
cin >> a[i];
s += a[i];
}
if (n == 1) {
cout << a[0] << "\n";
return 0;
}
for (int i = 0; i < n; ++i) {
s1 = a[i];
for (int j = i; j < n... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int v[17];
v[1] = 1;
v[2] = 0;
v[3] = 18;
v[4] = 0;
v[5] = 1800;
v[6] = 0;
v[7] = 670320;
v[8] = 0;
v[9] = 734832000;
v[10] = 0;
v[11] = 890786230;
v[12] = 0;
v[13] = 695720788;
v[14] = 0;
v[15] = 150347555;
v[16] = 0;... | 11 |
#include <bits/stdc++.h>
using namespace std;
using ld = long double;
using ll = long long;
const double EPS = 1e-6;
const ll N = 1000010;
string s[110];
ll a[100][30];
void shift(string& s) {
char c = s[0];
for (ll i = 0; i <= max(0, (int)s.size() - 2); ++i) {
s[i] = s[i + 1];
}
s[s.size() - 1] = c;
}
int ... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int w1, w2, h1, h2, m;
cin >> w1;
cin >> h1;
cin >> w2;
cin >> h2;
int j = (w1 + w2 + h1 + h2 + h1 + h2 + 4);
if (w1 == w2)
cout << j << endl;
else {
m = (w1 - w2);
cout << j + m << endl;
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
enum State {
ST_WHITESPACE,
ST_WORD,
};
int common(string const &a, string const &b) {
int ans = 0;
while (ans < min(a.size(), b.size()) && a[ans] == b[ans]) {
++ans;
}
return ans;
}
int count(string const &word, set<string, greater<string>> const &dict) {
... | 11 |
#include <bits/stdc++.h>
using namespace std;
int ar[100000 + 5];
vector<int> divisor[100000 + 5];
int cnt[100000 + 5];
void sieve() {
int mx = 0;
divisor[1].push_back(1);
for (int i = 2; i <= 100000; i++) {
divisor[i].push_back(1);
for (int j = 2 * i; j <= 100000; j += i) divisor[j].push_back(i);
div... | 12 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int i, j;
map<int, int> mp;
string a[n];
for (i = 0; i < n; i++) cin >> a[i];
int max, s, t, k, b[n], l;
for (j = 0; j < m; j++) {
max = 0, k = 0, t = -1;
for (i = 0; i < n; i++) {
if (max < a[i][j]) {
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, sum = 0;
cin >> n >> k;
int counts = 0;
for (int i = 1; i <= n; i++) {
sum += 5 * i;
if ((240 - sum) >= k) {
counts++;
} else
break;
}
cout << counts;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1e6 + 1;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const long long int LINF = 1e18;
const long long int N = 100001;
void snake_bite() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout << fixed;
}
void solve() {
int n;
cin >> n;
vec... | 4 |
#include <bits/stdc++.h>
using namespace std;
struct DSU {
vector<int> rank, parent;
DSU(int n) {
rank.resize(n, 1);
parent.resize(n);
iota(parent.begin(), parent.end(), 0);
}
int find(const int u) {
return parent[u] == u ? u : (parent[u] = find(parent[u]));
}
int size(int u) { return rank[f... | 7 |
#include <bits/stdc++.h>
using namespace std;
struct tvshow {
int t, s;
};
bool comp(tvshow &a, tvshow &b) {
if (a.t != b.t) return a.t < b.t;
return a.s > b.s;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, i, count;
bool f = true;
cin >> n;
vector<tvshow> A(0);
tvshow o;
... | 7 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 1000;
int n, q, s, si[maxn], tq, tc, cur, temp, ctt[maxn * 2], li[maxn * 2],
vis[maxn * 2], curl = 1, curr = 0, now, ans[maxn];
int read() {
int x = 0, f = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') f = -1;
ch = ge... | 18 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int a[N], ma[N], b[N], p[N];
vector<int> q[N];
int main() {
int n, m;
scanf("%d %d", &n, &m);
for (int i = 0; i < n; i++) scanf("%d", a + i);
for (int i = 0; i < m; i++) scanf("%d", b + i);
for (int i = 0; i < m; i++) scanf("%d", p + i);
m... | 16 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int t;
cin >> t;
while (t--) {
int l, r, k;
cin >> l >> r >> k;
l--;
r--;
int length = r - l + 1;
string tempS = s.substr(l, r - l + 1);
for (int i = l; i <= r; ++i) {
tempS[(i - l + k) % length] =... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int vis[105];
int term[105];
int n, k;
while (cin >> n >> k) {
for (int i = 1; i <= n; i++) {
cin >> vis[i];
term[i] = vis[i];
}
int maxs = -1;
for (int b = 1; b <= n; b++) {
int c;
for (int i = (1 - b) / k; i <= ... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int MX = (1 << 20);
int to_number(string str) {
int ret = 0, st = 0;
if (str[0] == '-') st = 1;
for (int j = st; j < str.length(); j++) ret *= 10, ret += str[j] - '0';
if (st) ret *= -1;
return ret;
}
int n, arr[MX], K, q = 0, pref = 0;
string tt;
bool is[MX... | 14 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int maxn = 101000;
long long sten[maxn], sfou[maxn], ssev[maxn];
long long sum[maxn][2], squ[maxn][2], num[maxn][2];
int r[maxn], len;
long long ans;
char s[maxn];
bool vis[maxn][2];
void pre() {
sten[1] = 1;
for (int i = 2; i < maxn; i++)... | 20 |
#include <bits/stdc++.h>
using namespace std;
long long n, m, d, dp[105][105][3], sol;
bool b[105];
int main() {
cin >> n >> m >> d;
for (int i = 1; i < d; i++) dp[1][i][0] = 1;
for (int i = d; i <= m; i++) dp[1][i][1] = 1;
for (int i = 2; i <= n; i++) {
for (int j = n - 1; j >= 0; j--) {
long long va... | 8 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> a(n);
if (n < 4) {
cout << -1 << '\n';
return;
}
if (n == 4) {
cout << "3 1 4 2 \n";
return;
}
int odd = n - !(n % 2), even = 6;
while (odd >= 1) {
cout << odd << ' ';
odd -= 2;
}
cout... | 8 |
#include <bits/stdc++.h>
using namespace std;
const double eps = 0.0000000000001;
const int mod = 1000000007;
int n, m;
vector<double> cra;
vector<double> crb;
struct P {
long long x;
long long y;
P() {}
P(long long _x, long long _y) {
x = _x;
y = _y;
}
P operator-(const P &b) const { return P(x - b... | 16 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e6 + 3;
int n, k, a[N], sz[N], m;
char r[N];
string s[N];
int main() {
scanf("%d\n", &n);
for (int i = 1; i <= n; ++i) {
cin >> s[i];
sz[i] = s[i].size();
scanf("%d", &k);
for (int j = 0; j < k; ++j) {
int x;
scanf("%d", &x);
... | 9 |
#include <bits/stdc++.h>
#pragma GCC target("sse4,avx")
void run(std::istream &in, std::ostream &out) {
int a1, b1, c1;
int a2, b2, c2;
in >> a1 >> b1 >> c1;
in >> a2 >> b2 >> c2;
if (a1 == 0 && b1 == 0 && c1 != 0) {
out << "0" << std::endl;
return;
}
if (a2 == 0 && b2 == 0 && c2 != 0) {
out <... | 12 |
#include <bits/stdc++.h>
using namespace std;
int sum[55][20004];
deque<pair<int, int> > que;
int dp[55][20005];
int main() {
int n, m, k;
cin >> n >> m >> k;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
int num;
cin >> num;
sum[i][j] = sum[i][j - 1] + num;
}
}
for (... | 16 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int N = 1e6 + 9;
long long fac[N];
long long BigMod(long long a, long long n) {
if (n == 0) return 1;
long long x = BigMod(a, n / 2);
x = (x * x) % mod;
if (n & 1) x = (a * x) % mod;
return x;
}
long long ModInv(long long a) { return... | 7 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void UpdateMax(T& a, T b) {
if (a < b) a = b;
}
template <typename T>
void UpdateMin(T& a, T b) {
if (a > b) a = b;
}
template <typename T>
inline void read(T& x) {
x = 0;
char c = getchar();
int flag = 1;
while (!isdigit(c)) {
if (c ==... | 16 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n;
cin >> n;
vector<long long> s(n);
for (long long i = 0; i < n; i++) {
cin >> s[i];
}
long long cnt = 1;
long long ans = 0;
stack<long long> sk;
for (long long i = 1; i < n; i++) {
if (cnt > s[i]) {
ans += cnt - s[i... | 9 |
#include <bits/stdc++.h>
using namespace std;
const int N = int(1e5) + 10;
int n, a[N], b[N], sub[N], prv[N];
bool was[N], has[N];
vector<int> ans;
int main() {
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
has[a[i]] = 1;
b[a[i]]++;
if (b[a[i]] == 2) sub[a[i]] = i - prv[a[i]];
if (b[a[i]... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, i, k, sum = 0, l;
cin >> n;
char s[1001];
char v[1001];
cin >> s;
cin >> v;
for (i = 0; i < n; i++) {
k = s[i] - 48;
l = v[i] - 48;
sum += min(abs(max(k, l) - min(k, l)), abs(max(k, l) - min(k, l) - 10));
}
cout <<... | 0 |
#include <bits/stdc++.h>
using namespace std;
const long long N = 1 << 20, MOD = 1e9 + 7;
long long n, a[105], m, vis[N], dp[N], team[25];
char action[25];
long long solve(long long mask, long long turn) {
if (turn == m) return 0;
if (vis[mask]) return dp[mask];
vis[mask] = 1;
if (team[turn] == 1) {
dp[mask... | 14 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
const int maxs = 61;
long long a[maxn];
int rn, r[maxs][maxn], x[maxn], ind[maxn], is[maxn];
int main() {
int n;
scanf("%d", &n);
long long all = 0;
for (int i = 0; i < n; ++i) {
scanf("%I64d", &a[i]);
all ^= a[i];
}
for (int t =... | 19 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 7;
int n, k, t, a[N], b[N], c[N];
char sa[N], sb[N];
void solve(int l, int r) {
if (l == r) {
if ((a[l] ^ t) != b[1]) c[++k] = 1;
return;
}
int now = r, m = abs(r - l) + 1, dir = l < r ? -1 : 1, tmp = m;
while (now - dir != l && (a[now] ^... | 9 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, q;
cin >> n >> q;
if (n % 2 == 0) {
if (q > n / 2) {
cout << (q - (n / 2)) * 2 << endl;
} else {
cout << (q * 2 - 1) << endl;
}
} else {
if (q > (n + 1) / 2) {
cout << (q - (n + 1) / 2) * 2 << endl;
} e... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 5;
int n, a[N];
vector<int> zeros;
int lft[N], rgt[N];
int tg[N << 2], mx[N << 2];
inline void pushdown(int x, int l, int r) {
if (tg[x] != 0)
if (l ^ r) {
mx[x << 1] += tg[x], mx[x << 1 | 1] += tg[x];
tg[x << 1] += tg[x], tg[x << 1 | 1... | 25 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
int n, first, a = 1000000005, b;
long long ans = 1, mod = 1e9 + 7;
set<int> q;
string s;
int32_t main() {
ios_base ::sync_with_stdio(0);
cin.tie();
cout.tie();
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> s >> first;
if (s == ... | 13 |
#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18 + 7;
const long long mod = 1e9 + 7;
const double eps = 1e-9;
const double PI = 2 * acos(0.0);
const double E = 2.71828;
long long n, m;
long long l, r, p;
vector<int> a[1000005];
long long res = 0;
long long go(long long l, long long r, long long ... | 17 |
#include <bits/stdc++.h>
using namespace std;
inline long long rd() {
char c;
long long sign = 1;
while ((c = getchar()) < '0' || c > '9')
if (c == '-') sign = -1;
long long res = c - '0';
while ((c = getchar()) >= '0' && c <= '9') res = res * 10 + c - '0';
return res * sign;
}
const int MAXN = 100010;
... | 21 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,k;
cin>>b>>a>>k;
if(k==0){
cout<<"Yes"<<endl;
for(int i=0;i<a;i++)cout<<1;
for(int i=a;i<a+b;i++)cout<<0;cout<<endl;
for(int i=0;i<a;i++)cout<<1;
for(int i=a;i<a+b;i++)cout<<0;cout<<endl;
return 0;
}
if(a-1==0){
cout<<"No"<<endl;
ret... | 11 |
#include <bits/stdc++.h>
using namespace std;
long long a, b, c, d, n, m, k, q, t;
char second;
int main() {
ios::sync_with_stdio(false);
t = 1;
cin >> t;
for (int i = 0; i < t; i++) {
cin >> n;
long long mi, ma;
mi = 1;
ma = 2;
if (n == 1) {
cout << "! 1 1" << endl;
continue;
... | 10 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
vector<tuple<int, int, int> > edges;
vector<int> g[N];
int vis[N];
int in[N], order[N], n, m;
bool nocycle(int u, int root) {
vis[u] = root;
bool res = false;
for (int i = 0; i < g[u].size(); ++i) {
int v = g[u][i];
if (vis[v] == root) re... | 14 |
#include <bits/stdc++.h>
using namespace std;
long long f[41][41][2];
long long n, t;
bool sw[41];
int main() {
scanf("%I64d%I64d", &n, &t);
n++;
if (!t) {
printf("0\n");
return 0;
}
long reu = 0;
while (t != 1) {
if (t % 2 != 0) {
printf("0\n");
return 0;
}
t /= 2;
reu++... | 12 |
#include <bits/stdc++.h>
using std::min;
int rank[1200001], sa[1200001], tax[1200001], tp[1200001], n, m, head[300001],
nxt[600001], b[600001], k, dep[300001], fa[300001], size[300001],
son[300001], top[300001];
int a[1200001], q, top1, top2, toptem, st[600001][21], loga[600001],
dfn[300001], now, height[12... | 22 |
#include <bits/stdc++.h>
using namespace std;
char alpha[26] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i',
'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r',
's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
string s;
int t;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int ... | 9 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
vector<int> w(200000, 0);
for (int i = 0; i < n; i++) cin >> v[i], w[v[i]]++;
for (int i = 1; i < w.size() - 1; i++) {
if (w[i] >= 1 && i != 1) {
if (w[i - 1] == 0) w[i - 1] = 1, w[i]--;
}
if (w[i... | 7 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long t;
t = 1;
while (t--) {
long long n, k;
cin >> n >> k;
int lb = 1;
int ub = n;
int ans;
while (lb <= ub) {
long long mid = lb + ub >> 1;
l... | 7 |
#include <bits/stdc++.h>
int ans, n, v[10] = {1}, r1[10], r2[10], p[10], r3[10];
void dfs(int u) {
if (u == ans && v[u] == n) {
printf("%d\n", ans);
for (int i = 0; i < u; i++)
if (r2[i] + 1)
printf("lea e%cx, [e%cx + %d*e%cx]\n", r1[i] + 'a', r2[i] + 'a', p[i],
r3[i] + 'a');
... | 17 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline T gi() {
T f = 1, x = 0;
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 f * x;
}
const int INF = 0x3f3f3f3f, N ... | 24 |
#include <bits/stdc++.h>
using namespace std;
int n;
int a[105];
int main(void) {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int t;
cin >> t;
while (t--) {
cin >> n;
int mx = 0, sum = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i];
sum += a[i];
mx = max(mx, a[i]);
}
... | 10 |
#include <bits/stdc++.h>
using namespace std;
unsigned long long pal(int x) {
unsigned long long ans = x;
while (x > 0) {
ans = (ans * 10) + (x % 10);
x /= 10;
}
return ans;
}
int main() {
unsigned long long k, p, zcy = 0;
cin >> k >> p;
for (int i = 1; i <= k; i++) {
zcy += pal(i);
}
cout... | 5 |
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-8;
pair<int, int> operator+(const pair<int, int> &a, const pair<int, int> &b) {
return make_pair(a.first + b.first, a.second + b.second);
}
int from[200007], n;
pair<int, int> p[200007];
vector<int> ch[200007];
pair<int, int> F[200007][2];
bool vis[2... | 19 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 2e18;
const long long N = 5e2 + 5;
const long long mod = 1e9 + 7;
long long x, p, c, q, mx, ans, cnt;
int main() {
cin >> x;
ans = p = x;
while (p) mx += p % 10, p /= 10;
while (true) {
p = x, q = 0;
while (p) {
q++;
p /= 10... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, z, w, i, j;
char line[100];
cin >> x >> y;
cin >> line;
for (i = 0; i < y; i++) {
for (j = 0; j < x; j++) {
if (j != x - 1) {
if (line[j] == 'B' && line[j + 1] == 'G') {
line[j] = 'G';
line[j + 1] = 'B';... | 0 |
#include <bits/stdc++.h>
using namespace std;
int n, k, m, f[1005][2];
long long a[1005][1005], tmp[1005][1005];
int main() {
scanf("%d", &k);
n = (1 << k);
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) scanf("%lld", &a[i][j]);
scanf("%d", &m);
for (int i = 1; i <= m; i++) scanf("%d%d", &f[i][0]... | 27 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int ans = 0;
long long int a, mat[4005] = {0}, count[100005] = {0};
string s;
cin >> a >> s;
long long int n = s.length();
for (int i = 0; i < int(n); ++i) mat[i + 1] =... | 8 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k;
map<int, int> students;
vector<int> values;
cin >> n;
for (long long int i = 0; i < n; i++) {
cin >> k;
students.insert(make_pair(i, 0));
values.push_back(k);
}
long long int pos = 0;
for (long long int i = 0; i <... | 2 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long maxn = 2e5 + 9;
void init() {}
void test_case(long long tc) {
long long n, m;
cin >> n >> m;
vector<pair<long long, long long> > arr(m);
long long mex = 1e18;
for (long long i = 0; i <= m - 1; ++i) {
long long l, ... | 9 |
#include <bits/stdc++.h>
using namespace std;
int ini() {
int x;
scanf("%d", &x);
return x;
}
long long inl() {
long long x;
scanf("%lld", &x);
return x;
}
void file_mamager() {}
char ss[20005], tt[20005];
int scn[30][20005], tcn[30][20005];
int main() {
int t = ini();
while (t--) {
int n = ini();
... | 18 |
#include <bits/stdc++.h>
bool map[600][600];
char s[600];
int main() {
int i, j, n, m, a, b, flag;
scanf("%d%d", &n, &m);
for (i = 0; i < m; i++) {
scanf("%d%d", &a, &b);
map[a][b] = map[b][a] = 1;
}
for (i = 1; i <= n; i++) {
flag = 1;
for (j = 1; j <= n; j++)
if (!map[i][j] && i != j) ... | 10 |
#include <bits/stdc++.h>
using namespace std;
char m[60][60];
int cnt[10];
bool judge(int n) {
int i, j;
if (cnt[4] == 0) {
bool z = 1;
for (i = 0; i < 10; i++)
if (cnt[i] != 0) z = 0;
if (z == 1)
return true;
else
return false;
} else {
vector<int> x;
vector<int> y;
... | 9 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int main() {
int n, a, b, i, l;
while (3 == scanf("%d%d%d", &n, &a, &b)) {
l = 0;
if (b) {
if (a + b + 1 > n)
puts("-1");
else {
putchar('1');
for (i = 1; i <= b; i++) printf(" %d", 1 << i);
for (... | 9 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
const long long INF = 2e18;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long t;
cin >> t;
while (t--) {
long long n, i, k;
cin >> n >> k;
long long a[n]... | 5 |
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e6;
long long f[N], g[N], h[N];
int32_t main() {
long long n = ({
long long x;
scanf("%lld", &x);
x;
});
set<long long> st;
for (long long i = 1; i <= n; i++) {
f[i] = ({
long long x;
scanf("%lld", &x);
x;
}... | 9 |
#include <bits/stdc++.h>
using namespace std;
int T, n;
deque<int> dq;
int main() {
scanf("%d", &T);
while (T--) {
scanf("%d", &n);
getchar();
int cnt = 0, cur = -1, ans = 0;
for (int i = 0, c; i < n; i++) {
c = getchar() - '0';
if (c == cur || cur == -1) {
cur = c;
cnt++... | 9 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1000000007;
long long modx(long long a) { return (a % MOD + MOD) % MOD; }
long long times(long long a, long long b) { return modx(modx(a) * modx(b)); }
long long add(long long a, long long b) { return modx(modx(a) + modx(b)); }
lo... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
int sL = L;
int arr[N - 1];
for (int i = 1; i < N; i++) cin >> arr[i - 1];
int Max = 0;
int imax = 0;
do {
Max = 0;
imax = 0;
for (int i = 0; i < N - 1; i++)
if (arr[i] > Max) {
Max = arr[i];
... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
cout.tie(0);
long long t;
cin >> t;
while (t--) {
long long n, k;
cin >> n >> k;
{
long long x = INT_MIN;
for (long long i = 1; i <= sqrt(n); i++) {
if (n % i == 0) {
if (i <= k) x = max(x, i);
... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
int a = 0, b = 0;
vector<pair<int, int> > move(4);
move[0].first = 1;
move[0].second = 0;
move[1].first = 0;
move[1].second = 1;
move[2].first = -1;
move[2].second = 0;
move[3].first = 0;
move[3].second = -1;
i... | 6 |
#include <bits/stdc++.h>
using namespace std;
long long n, dp[20000][10];
char s[5][20000];
long long mod = 1000000007;
void add(long long &a, long long b) {
a += b;
if (a >= mod) a -= mod;
}
int main() {
cin >> n;
for (long long i = 0; i < 3; i++) cin >> s[i];
dp[0][0] = 1;
long long ans = 0;
for (long l... | 13 |
#include <bits/stdc++.h>
using namespace std;
inline void read(int &x) {
char ch;
bool flag = false;
for (ch = getchar(); !isdigit(ch); ch = getchar())
if (ch == '-') flag = true;
for (x = 0; isdigit(ch); x = x * 10 + ch - '0', ch = getchar())
;
x = flag ? -x : x;
}
inline void write(int x) {
static... | 21 |
#include <bits/stdc++.h>
using namespace std;
int k[110], f[110];
vector<int> vudka;
map<int, int> mp;
int main() {
int n, i, j, m, fl = 0, rafi, tamu;
cin >> n >> m;
for (int i = 0; i < m; i++) scanf("%d%d", &k[i], &f[i]);
if (m == 0) {
if (n == 1)
cout << 1 << "\n";
else
cout << -1 << "\n"... | 7 |
#include <bits/stdc++.h>
using namespace std;
template <class T, class D>
class Range {
class It {
public:
It(const T& v, const T& e, const D& s) : v_(v), e_(e), s_(s), end_(false) {
checkEnd();
};
T operator*() { return v_; }
It& operator++() {
if (!end_) {
v_ += s_;
ch... | 13 |
#include <bits/stdc++.h>
using namespace std;
long long n, x, y, dp[10000010];
void init() { cin >> n >> x >> y; }
void solve() {
dp[1] = x;
for (int i = 2; i <= n; ++i) {
dp[i] = dp[i - 1] + x;
if (!(i % 2) && dp[i / 2] + y < dp[i])
dp[i] = dp[i / 2] + y;
else if ((i % 2) && dp[i / 2 + 1] + y + x... | 12 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
char now = 'a';
cin >> s;
int count = 0;
for (int i = 0; i < s.length(); i++) {
if (abs(now - s[i]) <= 13)
count = count + abs(now - s[i]);
else
count += 26 - abs(now - s[i]);
now = s[i];
}
cout << count;
return... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int M = 55;
int read() {
int x = 0, flag = 1;
char c;
while ((c = getchar()) < '0' || c > '9')
if (c == '-') flag = -1;
while (c >= '0' && c <= '9')
x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
return x * flag;
}
int n, m, K, a[M], b[M], c[M];
... | 15 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int N = 5e5 + 10;
char ans[101][101];
int f[101][101];
int fx[] = {-1, +0, +1, +0, +1, +1, -1, -1, +0};
int fy[] = {+0, -1, +0, +1, +1, -1, +1, -1, +0};
int n;
void balsal() {
for (int i = 0; i < 4; i++) {
for (int j = 0; j < n - 1; j++)... | 5 |
#include <bits/stdc++.h>
using namespace std;
inline long long in() {
int32_t x;
scanf("%d", &x);
return x;
}
inline long long lin() {
long long x;
scanf("%lld", &x);
return x;
}
const long long maxn = 1e6 + 10;
vector<pair<long long, long long> > V[2];
long long ret = -1;
vector<long long> ans;
inline void... | 11 |
#include <bits/stdc++.h>
using namespace std;
struct person {
int p, c;
} s[3005];
bool operator<(person a, person b) { return a.c < b.c; }
int n, m;
long long ans;
int p[3005];
bool v[3005];
int main() {
int i, j;
scanf("%d%d", &n, &m);
for (i = 1; i <= n; i++) {
scanf("%d%d", &s[i].p, &s[i].c);
p[s[i]... | 9 |
#include <bits/stdc++.h>
int n;
double p = 1;
struct Node {
double w, s, x;
bool operator<(const Node &b) const { return w < b.w; }
} a;
std::priority_queue<Node> q;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
int x;
scanf("%d", &x);
p *= x / 100.0;
a.s = a.x = 1 - x / 100.0;
... | 19 |
#include <bits/stdc++.h>
int oo[1 + 500000 * 2 + 1 + 500000], oh[1 + 500000 * 2 + 1 + 500000];
int link(int o, int h) {
static int _ = 1;
oo[_] = o, oh[_] = h;
return _++;
}
int dsu[(1 << 20)];
int find(int i) { return dsu[i] < 0 ? i : (dsu[i] = find(dsu[i])); }
int join(int i, int j) {
i = find(i);
j = find(... | 17 |
#include <bits/stdc++.h>
int main(int argc, char **argv) {
unsigned int l = 0, r = 0, n = 0;
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
int x, y;
scanf("%d %d", &x, &y);
if (x < 0)
++l;
else if (x > 0)
++r;
}
if ((l == 1) || (r == 1) || ((l == 0) && (r != 0)) || ((l != 0) && (r... | 0 |
#include <bits/stdc++.h>
const int BEAUCOUP = 200000;
int main() {
std::ios::sync_with_stdio(false);
int nbReq;
std::cin >> nbReq;
char suitR[4] = "RGB";
char suitG[4] = "GBR";
char suitB[4] = "BRG";
for (int q = 0; q < nbReq; q++) {
int N, K;
std::cin >> N >> K;
std::string str;
std::cin ... | 7 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.