solution stringlengths 53 181k | difficulty int64 0 27 |
|---|---|
#include <bits/stdc++.h>
using namespace std;
char s[5555];
int q;
int is[5555][5555] = {};
int main() {
scanf("%s", s);
int n = strlen(s);
for (int len = 1; len < n + 1; len++) {
for (int i = n - len; i >= 0; i--) {
int j = i + len - 1;
if (s[i] == s[j]) {
if (len <= 3)
is[i][j]... | 10 |
#include <bits/stdc++.h>
using namespace std;
int **e, *used;
vector<int> number;
bool dfs(int v) {
used[v] = 1;
for (int i = 1; i <= e[v][0]; i++) {
if (used[e[v][i]] == 0 && dfs(e[v][i]) == false) {
return false;
} else if (used[e[v][i]] == 1) {
return false;
}
}
used[v] = 2;
number.... | 7 |
#include <bits/stdc++.h>
using namespace std;
const int N = 500005;
int n;
int num;
long long ans = 0;
priority_queue<int> q;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &num);
q.push(num);
if (num < q.top()) {
ans += (long long)q.top() - (long long)num;
q.pop();... | 14 |
#include <bits/stdc++.h>
using namespace std;
long long pol[200][200];
int main() {
ios_base::sync_with_stdio(0);
int n;
cin >> n;
pol[0][0] = 1;
pol[1][1] = 1;
for (int i = 2; i <= n + 1; i++) {
int ok = 1;
for (int j = 0; j <= i - 1; j++) pol[i][j + 1] += pol[i - 1][j];
for (int j = 0; j <= i ... | 14 |
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios::sync_with_stdio(false);
int d[8][2] = {{1, 0}, {1, 1}, {1, -1}, {0, 1},
{0, -1}, {-1, -1}, {-1, 1}, {-1, 0}};
int answ = 0, n, sx, sy, p = 0;
cin >> n >> sx >> sy;
int a[n][2];
for (int i = 0; i < n; i++) cin >> a[i][0] ... | 5 |
#include <bits/stdc++.h>
int main() {
int n;
std::cin >> n;
std::map<std::pair<std::string, int>,
std::vector<std::pair<std::string, int> > >
g;
std::pair<std::string, int> start;
for (int i = 0; i < n; ++i) {
std::pair<std::string, int> cur;
std::cin >> cur.first >> cur.second;
i... | 11 |
#include <bits/stdc++.h>
using namespace std;
const long long int maxn = (3e5) + 10, mod = 1e9 + 7;
long long int n, a[maxn], dp_D[maxn], dp_U[maxn], pd_D[maxn], pd_U[maxn];
vector<long long int> v[maxn];
void pre_DFS1(long long int x, long long int p) {
pd_D[x] = a[x];
for (auto u : v[x]) {
if (u == p) continu... | 18 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char a;
int n, cnt[26] = {0};
bool OK = true;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (a >= 'A' && a <= 'Z') a += 32;
if (a >= 'a' && a <= 'z') cnt[a - 97]++;
}
for (int i = 0; i < 26; i++) {
if (cnt[i] == 0) {
O... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (m > n) swap(n, m);
if (n == 7 && m == 4)
cout << 21 << endl;
else if (n == 10 && m == 4)
cout << 30 << endl;
else if (m == 1)
cout << (n / 3 * 2 + (n % 3 > 1)) << endl;
else if (n % 4 == 0 && m % 4 == 0)
... | 13 |
#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 2e5 + 5;
const long long oo = 1LL << 60;
inline long long read() {
char ch = getchar();
long long x = 0, f = 1;
while (ch > '9' || ch < '0') {
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 +... | 13 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, x;
cin >> a >> b >> x;
if (x == 1) {
for (int i = 1; i <= a; i++) cout << "0";
for (int i = 1; i <= b; i++) cout << "1";
return 0;
}
int toggle = 0;
if (a >= b)
cout << "01";
else {
cout << "10";
toggle = 1;
}
... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, x, y, n;
cin >> n;
while (n--) {
cin >> a >> b >> x >> y;
cout << max(max(max(b * x, b * (a - x - 1)), a * y), a * (b - y - 1))
<< endl;
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
struct PR {
long long int vl, idx;
PR() {}
PR(long long int _vl, long long int _idx) { vl = _vl, idx = _idx; }
bool operator<(const PR &o) const {
if (vl == o.vl) {
return idx < o.idx;
}
return vl < o.vl;
}
};
long long int n, ara[100010];
multis... | 10 |
#include <bits/stdc++.h>
using namespace std;
int ar[2000000], a[200000];
void up(int r, int l1, int l2, int p) {
if (p > l2 || p < l1) return;
ar[r]++;
if (l1 == l2) return;
int m = (l1 + l2) / 2;
up(r << 1, l1, m, p);
up((r << 1) + 1, m + 1, l2, p);
}
int qu(int r, int l1, int l2, int q) {
if (l1 == l2)... | 8 |
#include <bits/stdc++.h>
using namespace std;
vector<int> tree[10000];
int main() {
int n;
cin >> n;
int a, b;
for (int i = 0; i < n - 1; i++) {
cin >> a >> b;
--a;
--b;
tree[a].push_back(b);
tree[b].push_back(a);
}
uint64_t totalSum = 0;
uint64_t compensation = 0;
uint64_t localSum ... | 5 |
#include <bits/stdc++.h>
using namespace std;
inline long long read() {
char ch = getchar();
if (!(~ch)) return 0;
int f = 1;
while (ch > '9' || ch < '0') {
if (ch == '-') f = -1;
ch = getchar();
}
long long x = 0;
while (ch >= '0' && ch <= '9') {
x = (x << 3) + (x << 1) + (ch ^ 48);
ch = ... | 10 |
#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
int n, m, X, q[N], l[N], r[N];
int a[N], na[N], b[N], nb[N];
struct ZKW {
int nn, t[N * 4];
void init(int *a, int n) {
for (nn = 1; nn <= n; nn <<= 1)
;
for (int i = 1; i <= n; i++) t[i + nn] = a[i];
for (int i = nn - 1; i >= 1; i... | 26 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
const int N = 4004;
vector<int> g[N];
int a[N];
int beg[N], len[N], dp[N][N];
int mpow(int base, int exp);
void ipgraph(int n, int m);
void dfs(int u, int par);
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int i, n, k, j;
... | 11 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long n, k;
cin >> n >> k;
vector<vector<char>> shape(n, vector<char>(n));
for (int i = (0); i < (n); ++i) {
for (int j = (0); j < (n); ++j) {
cin >> shape[i][j];
}
}
... | 11 |
#include <bits/stdc++.h>
using namespace std;
struct p {
int a, b;
};
p point[1005];
int main() {
int t;
while ((scanf("%d", &t) != -1)) {
int flag = 0;
int ta, tb;
for (int i = 0; i < t; i++) {
scanf("%d %d", &point[i].a, &point[i].b);
if (point[i].a != point[i].b)
flag = 1;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, *a, s = 0;
cin >> n >> m;
a = new int[n];
for (int i = 0; i < n; i++) a[i] = 0;
for (int i = 0; i < m; i++) {
int q, w, e;
cin >> q >> w >> e;
a[q - 1] -= e;
a[w - 1] += e;
}
for (int i = 0; i < n; i++)
if (a[i] < 0) ... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2010;
int sum = 0, w[N], f[N * 2][N];
string s[N];
bool compare(string a, string b) { return (a < b); }
int min(int a, int b) { return (a < b ? a : b); }
int work(int l, int r) {
int d = ++sum;
if (l < r) {
int i, j, left, right, b = l;
for (i = l ... | 17 |
#include <bits/stdc++.h>
int n;
std::vector<int> a;
std::vector<long long> ans;
std::map<std::vector<int>, long long> res;
std::vector<long long> chain;
std::vector<std::vector<long long>> chaint;
void dfs(int r, int x, std::vector<long long> g) {
if (r == 0) {
long long v = 0;
for (int i = 0; i < (1 << n); +... | 18 |
#include <bits/stdc++.h>
using namespace std;
const int maxN = 1e6 + 1117;
vector<int> g[maxN];
queue<int> q;
bool mark[maxN];
int n, m, st, ex, dis[maxN], len[maxN], p, sum;
vector<int> bt;
void bfs(int v) {
mark[v] = true;
q.push(v);
while (q.empty() == false) {
int u = q.front();
q.pop();
for (int ... | 7 |
#include <bits/stdc++.h>
using namespace std;
int f(string s) {
cout << s << endl;
int w;
cin >> w;
if (w == 0) exit(0);
return w;
}
int main() {
const int N = 300;
int st = f(string(N, 'a'));
int n = 2 * N - (st + f(string(N, 'b')));
string t(n, 'a');
int A = N - st, B = n - A;
st = B;
for (int... | 15 |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0, f = 1;
char c = getchar();
while (c != '-' && (c < '0' || c > '9')) c = getchar();
if (c == '-') f = -1, c = getchar();
while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
return f * x;
}
const int N = 2e2 + 7;
const ... | 11 |
#include <bits/stdc++.h>
using namespace std;
ifstream first("test.in");
ofstream g("test.out");
char second[200005];
long long n, ans;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) cin >> second[i];
for (int i = 1; i <= n; i += 2) {
if (second[i] == second[... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long n, l[100009], r[100009], c;
int main() {
cin >> n;
c = n;
for (int i = 0; i < n; i++) cin >> l[i] >> r[i];
sort(l, l + n);
sort(r, r + n);
for (int j = 0; j < n; j++) {
c += max(l[j], r[j]);
}
cout << c;
return 0;
}
| 11 |
#include <bits/stdc++.h>
using namespace std;
const int N = 21;
const int M = 1e6 + 50;
const int INF = 0x3f3f3f3f;
double eps = 1e-6;
char str[N][N];
int a[N][N], s[N][N], c[N][N];
int dp[1 << N];
int n, m;
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) scanf("%s", str[i]);
for (int i = 0; i < n... | 17 |
#include <bits/stdc++.h>
using namespace std;
int v[1024];
int main() {
int m, n, sum = 0;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) scanf("%d", &v[i]);
int a, b;
for (int i = 1; i <= m; i++) {
scanf("%d%d", &a, &b);
sum += min(v[a], v[b]);
}
printf("%d\n", sum);
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
int g(int n) {
int maxi = 1;
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0) {
if (i == n / i)
maxi = max(maxi, i);
else
maxi = max(maxi, max(i, n / i));
}
}
return maxi;
}
int main() {
unordered_map<int, int> umap;
for (... | 7 |
#include <bits/stdc++.h>
using namespace std;
const unsigned int M = 1000000007;
long long int ceil_div(long long int a, long long int b) {
return (a + b - 1) / b;
}
void fun() {
int a, b, n, i, j, x, nb, q, k;
cin >> n;
string str;
cin >> str;
if (n == 2) {
if (str[0] >= str[1]) {
cout << "NO" <<... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
string t;
string a, b, c, d, e;
cin >> t;
cin >> a >> b >> c >> d >> e;
if (t[0] == a[0] or t[0] == b[0] or t[0] == c[0] or t[0] == d[0] or
t[0] == e[0] or t[1] == a[1] or t[1] == b[1] ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int pp[110][110];
int main() {
int a, b;
while (~scanf("%d %d", &a, &b)) {
for (int i = 1; i <= a; i++) {
for (int j = 1; j <= b; j++) {
cin >> pp[i][j];
}
}
int flag;
while (a > 0 && !(a & 1)) {
flag = 1;
a /= 2;
fo... | 5 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
using ll = long long;
const char E = '\n';
const int N = 305;
const ll mod = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int a, b, n;
for (int i = 1; i <= 300; i++) {
cout << 'a';
}
cout << endl;
... | 15 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
vector<int> g[N];
map<int, int> mp[2], p;
int root, n, ans[N], sz[N];
bool big[N];
void dfs(int u) {
sz[u] = 1, ans[u] = n - 1;
for (auto v : g[u]) {
dfs(v);
sz[u] += sz[v];
}
++mp[0][sz[u]];
}
void add(int u, int c) {
++mp[c][sz[u]]... | 25 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5;
const int mod = 1e9;
vector<int> graph[1000];
bool used[1000];
vector<int> ans;
void dfs(int v) {
used[v] = 1;
ans.push_back(v);
for (auto to : graph[v]) {
if (used[to]) continue;
dfs(to);
return;
}
}
void solve() {
int n;
cin >... | 8 |
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(0) * 2;
const double EPS = 1e-8;
const long long MOD = 1e9 + 7;
const int MAXN = 1e5 + 5;
const int oo = 1e9;
const double foo = 1e30;
template <class T>
int getbit(T s, int i) {
return (s >> i) & 1;
}
template <class T>
T onbit(T s, int i) {
retu... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t = 1;
cin >> t;
while (t--) {
long long n;
cin >> n;
cout << n - 1 << "\n";
for (long long i = 1; i < n; i++) {
cout << i + 1 << " ";
}
cout << "\n";
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n;
cin >> n;
if (n == 1 || n == 2) {
cout << "No";
} else {
cout << "Yes", cout << endl;
int eve = n / 2;
int odd = n - eve;
cout << eve << " ";
for (int i = ... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long t, n;
cin >> t;
while (t--) {
cin >> n;
if (n <= 30) {
cout << "NO" << endl;
} else if (n == 36 || n == 40 || n == 44) {
cout << "YES" << endl;
cout << 6 << " " << 10 << " " << 15 << " " << n - 31 << endl;
} els... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
long long num[maxn];
string s[100] = {
"4", "7", "44", "47", "77",
"444", "447", "477", "777", "4444",
"4447", "4477", "4777", "7777", "44444",
"44447", ... | 3 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
long long dx[] = {-1, 0, 1, 0, 1, -1, 1, -1};
long long dy[] = {0, -1, 0, 1, 1, -1, -1, 1};
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long n, mxp, reg;
cin >> n >> mxp >> reg;
long long last = mxp;... | 10 |
#include <bits/stdc++.h>
using namespace std;
void print_vector(vector<int> v);
void print_array(int* array, int start, int end);
int islands[30010], x, n, dd;
int memo[30010][400];
int solve(int pos, int d) {
if (d == 0) return 0;
if (pos > 30000) return 0;
if (memo[pos][d - dd + 200] != -1) return memo[pos][d -... | 11 |
#include <bits/stdc++.h>
using namespace std;
int main() {
map<int, string> m;
m[0] = "January", m[1] = "February", m[2] = "March", m[3] = "April",
m[4] = "May", m[5] = "June", m[6] = "July", m[7] = "August",
m[8] = "September", m[9] = "October", m[10] = "November", m[11] = "December";
int k, i, n;
string s... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100 + 5;
int a[maxn];
int main() {
int n;
cin >> n;
int ans = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
sort(a, a + n);
printf("%d", a[n - 1]);
for (int i = 1; i < n - 1; ++i) printf(" %d", a[i]);
printf(" %d\n", a[0]);
return ... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 10;
struct Node {
int l, r, k, id;
bool operator<(const Node &a) const { return r < a.r; }
} a[MAXN], b[MAXN];
set<pair<int, int> > st;
int n, m, ans[MAXN];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for... | 13 |
#include <bits/stdc++.h>
const int INF = 1e9;
using namespace std;
int main() {
long long n, ans = 0, numb;
char f;
cin >> n >> f;
if (n % 2 == 0) {
if (n / 2 % 2 == 0)
numb = n / 2;
else
numb = n / 2 + 1;
} else {
if ((n - 1) / 2 % 2 == 0)
numb = n / 2 + 1;
else
numb =... | 4 |
#include <bits/stdc++.h>
using namespace std;
int n, i, j;
int x, y, r;
int F1[50], F2[50];
int printN(int a) {
if (a < 0) {
cout << "(0-";
printN(-a);
cout << ")";
} else if (a <= 50)
cout << a;
else {
cout << "(50+";
printN(a - 50);
cout << ")";
}
return 0;
}
int printF(int *F, i... | 14 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e15;
const int N = 250010;
int n, uD, nxt[N], d[N];
long long ans = 0, sum[N], f[2][N];
vector<pair<int, int> > e[N];
vector<int> deg[N];
bool vis[N];
struct Heap {
priority_queue<long long> In, Out;
inline void push(long long x) { In.push(x); }
... | 26 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int c, d, tmp, plus, kurang, nilai, a, b, k, n = 0, min = 0, sum = 1, cek,
simpan[100], cetak[100];
char s;
simpan[0] = 1;
while (s != '=') {
scanf("%c", &s);
if (s == '?') n++;
if (s == '-') {
... | 10 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, cnt = 0;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) cin >> a[i];
vector<int> vec;
for (int i = 1; i < (n - 1); i++) {
if (a[i] == 0 && a[i - 1] == 1 && a[i + 1] == 1) vec.push_back(i + 1);
}
sort(vec.begin(), vec.end());
for (i... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int N=1500;
array<int,N>a[N],b[N];
array<int,N>c[N],d,f;
vector<int>ans;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int n,m;cin>>n>>m;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
cin>>a[i][j];
... | 18 |
#include <bits/stdc++.h>
using namespace std;
int a[100001] = {0}, b[100001] = {0}, n, x, y;
int main() {
cin >> n >> x;
int answer = -1;
while (n--) {
cin >> y;
if (a[y]) answer = 0;
if (answer && (a[x & y] || b[y])) answer = 1;
if (answer && answer != 1 && b[x & y]) answer = 2;
a[y] = b[x & ... | 4 |
#include <bits/stdc++.h>
using namespace std;
struct pnt {
int x, y, id;
pnt(int x = 0, int y = 0, int id = -1) : x(x), y(y), id(id) {}
void in(int i) {
scanf("%d %d", &x, &y);
id = i;
}
int dist(const pnt &p) { return abs(x + y - p.x - p.y); }
void out() { printf("%d %d\n", x, y); }
} p[4];
const i... | 22 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, count = 0, i, a = 0, count1 = 0;
vector<int> inp;
string in;
cin >> n;
cin >> in;
char ch;
for (i = 0; i < n; i++) {
ch = a + '0';
if (in[i] != ch) count++;
a = 1 - a;
}
a = 1;
for (i = 0; i < n; i++) {
ch = a + '0';
... | 10 |
#include <bits/stdc++.h>
using namespace std;
const int m = 256;
int n, Q, sl, fh, ans, rt_num, fa[50010], dep[50010], vis[50010], lst[50010],
val[50010], f[50010][m], mx[50010][m];
int t, h[50010];
struct Tre {
int to, nxt;
} e[50010 << 1];
struct Trie {
int sn[2];
} tre[1 << 10];
int rd() {
sl = 0;
fh = 1... | 24 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 100;
int trie[N][26], tot, fail[N], fg[N], L[N];
char s[N], t[N];
int cnt[N], st[N], nex[N], ans[N];
queue<int> Q[N];
void insert(int ix) {
int len = strlen(t + 1), p = 0;
for (int i = 1; i <= len; i++) {
int c = t[i] - 'a';
if (!trie[p][c]) ... | 17 |
#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
inline void read(long long &x) {
x = 0;
long long f = 1;
char s = getchar();
while (s < '0' || s > '9') {
if (s == '-') f = -1;
s = getchar();
}
while (s >= '0' && s <= '9') {
x = (x << 3) + (x << 1) + (s ^ 48);
s = getcha... | 9 |
#include <bits/stdc++.h>
const int maxn = 510;
using namespace std;
const int dis[2][4] = {{-1, 0, 1, 0}, {0, 1, 0, -1}};
struct Node {
int x, y, d;
Node(int _x, int _y, int _d) : x(_x), y(_y), d(_d) {}
bool operator<(const Node &b) const {
if (d != b.d)
return d < b.d;
else if (x != b.x)
retu... | 8 |
#include <bits/stdc++.h>
using namespace std;
struct debugger {
template <typename T>
debugger& operator,(const T& v) {
cerr << v << " ";
return *this;
}
} dbg;
struct circle {
double x, y, r, a1, a2, d;
} cir[100010];
bool cmp(circle c1, circle c2) {
if (c1.a1 == c2.a1) {
if (c1.a2 == c2.a2) retu... | 17 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<long long> avals, bvals;
int at = 0;
bool bad(ll a1, ll b1, ll a2, ll b2, ll a3, ll b3) {
return 1.0 * (b1 - b3) * (a2 - a1) < 1.0 * (b1 - b2) * (a3 - a1);
}
void add_line(ll a, ll b) {
while ((int)avals.size() >= 2 &&
bad(avals[ava... | 13 |
#include <bits/stdc++.h>
struct p {
int c, kol;
};
void swap(struct p *a, struct p *b) {
struct p c = *a;
*a = *b;
*b = c;
}
void divide(struct p *arr, int l, int r) {
if (r - l < 1) return;
int i = l - 1;
int j = r;
int razd = (rand() % (r - l)) + l;
swap(&arr[r], &arr[razd]);
while (j > i) {
d... | 8 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const long long lINF = 1e11;
const int P = 1e9 + 7, Q = 1e9 + 9;
const int base = 41;
const double PI = 3.141592653589793238;
const double eps = 1e-7;
int gcd(int a, int b) { return (b ? gcd(b, a % b) : a); }
int arr[100000];
int main() {
int n;
sca... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, i, j, x, y, t;
cin >> n;
x = n * n;
for (j = 1; j <= n * n / 2; j++) {
printf("%d ", j);
printf("%d ", x);
x--;
if (j % (n / 2) == 0) puts("");
}
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
string s[105];
int a[105][105];
int rr[] = {-1, 0, 1, 1, 1, 0, -1, -1};
int cc[] = {1, 1, 1, 0, -1, -1, -1, 0};
class Node {
public:
int r, c;
};
int main(void) {
int t, n, m, cs = 0, i, j, k, x, cnt, flag = 0, tmp;
cin >> n >> m;
Node u, v;
int ur, uc, vr, vc;
... | 3 |
#include <bits/stdc++.h>
using namespace std;
string s;
int k;
set<pair<string, int> > ms;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> s >> k;
for (int i = 0; i < s.size(); i++) ms.insert({s.substr(i, 1), i + 1});
for (int i = 0; i < k - 1; i++) {
if (ms.empty()) {
cout << "No ... | 13 |
#include <bits/stdc++.h>
using namespace std;
void read(long long &x) { scanf("%lld", &x); }
void read(long long &x, long long &y) { scanf("%lld%lld", &x, &y); }
void read(long long &x, long long &y, long long &z) {
scanf("%lld%lld%lld", &x, &y, &z);
}
void print(long long x) { printf("%lld ", x); }
void println(long... | 7 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e2 + 15;
bool vis[maxn][maxn][8][6][32], mp[maxn][maxn];
int f[8][2] = {{0, 1}, {1, 1}, {1, 0}, {1, -1},
{0, -1}, {-1, -1}, {-1, 0}, {-1, 1}},
a[32], N;
void DFS(int x, int y, int fa, int cut, int nl) {
if (vis[x][y][fa][cut][nl] |... | 11 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
long long a, b;
cin >> a >> b;
if (a == b) {
if (a % 2)
cout << -a << endl;
else
cout << a << endl;
} else if (a % 2) {
long long dis = b - a + 1;
if (dis % 2)
... | 1 |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
void Dzielniki(int x, vector<int>& d) {
for (int i = 1; i * i <= x; ++i) {
if (x % i == 0) d.push_back(i);
if (x % (x / i) == 0 && i * i != x) d.push_back(x / i);
}
}
int Szukaj1(vector<int>& a, int x) {
int l = 0, p = a.size(... | 12 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
void solve() {
int n;
cin >> n;
int a[n], pre[n];
cin >> a[0];
pre[0] = a[0];
int res = pre[0];
for (long long i = 1; i <= n - 1; i++) {
cin >> a[i];
pre[i] = pre[i - 1] ^ a[i];
res = max(res, pre[i]);
}
for (long... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int l, r, a, b, k;
scanf("%d%d%d%d%d", &l, &r, &a, &b, &k);
for (int i = a; i <= b; ++i)
if (l <= 1LL * i * k && 1LL * i * k <= r) {
printf("YES\n");
return 0;
}
printf("NO\n");
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
const int DY[] = {-1, 0, 1, 0};
const int DX[] = {0, 1, 0, -1};
vector<int> G[31];
long long X[31], Y[31];
void dfs(int u, int dep, long long x, long long y, int prever, int predir) {
X[u] = x;
Y[u] = y;
assert(abs(x) < 1ll << 60);
assert(abs(y) < 1ll << 60);
int ... | 12 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[7], sum = 0;
for (int i = 1; i <= 6; i++) {
cin >> a[i];
sum += a[i];
}
if (sum % 2 == 1) {
cout << "NO";
return 0;
}
sort(a + 1, a + 7);
for (int i = 1; i <= 4; i++) {
for (int j = i + 1; j <= 5; j++) {
for (int k ... | 2 |
#include <bits/stdc++.h>
using namespace std;
int a[100010], b[100010], n;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
for (int i = 1; i <= n; ++i) scanf("%d", &b[i]);
if (a[1] != b[1] || a[n] != b[n]) {
printf("No");
return 0;
}
for (int i = 1; i < n; ++i) a[i] = ... | 14 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
const long long inf = 0x3f3f3f3f3f3f3f3fll;
using namespace std;
void d1(long long x) { cout << x << endl; }
void d2(long long x, long long y) { cout << x << " " << y << endl; }
void d3(long long x, long long y, long long z) {
cout << x << " " << y << " " << z <<... | 8 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100;
int n, a[maxn];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n;
for (int i = 0; i < n; ++i) cin >> a[i];
vector<pair<int, int>> ans;
int cur = 0;
while (cur < n && a[cur] == 0) cur += 1;
if (cur == n) {
cout <<... | 4 |
#include <bits/stdc++.h>
using namespace std;
const unsigned int mod = 1e7 + 7;
const long long int N = 1e5;
long long int lazy[400009], segtree[400009], y = 0, n, col[200009], cnt,
a[2009];
bool visit[1000] = {false}, vis[10009] = {false};
vector<long long int> v[1000];
int... | 6 |
#include <bits/stdc++.h>
using namespace std;
int x;
bool dig[10];
inline bool is(int num) {
while (num > 0) {
if (dig[num % 10]) return true;
num /= 10;
}
return false;
}
int main() {
cin >> x;
int n = x;
memset(dig, 0, sizeof dig);
while (n > 0) {
dig[n % 10] = true;
n /= 10;
}
int a... | 5 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
void chkmax(T &a, T b) {
if (a < b) a = b;
}
template <class T>
void chkmin(T &a, T b) {
if (a > b) a = b;
}
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;
int n, kk;
vector<int> v[105];
int dp[105][25][25];
void dfs(int y, int p = 0) {
int ep... | 17 |
#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
const long long minf = -(1e18);
pair<int, int> arr[200001];
bool sortx(pair<int, int> a, pair<int, int> b) {
if (a.first == b.first)
return a.second < b.second;
else
return a.first < b.first;
}
bool sorty(pair<int, int> a, pair<int, i... | 6 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
char a[5001], b[5001];
int dp[5002][5002] = {0};
int ans = 0;
void solve() {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (a[i - 1] == b[j - 1]) {
dp[i][j] = max(dp[i - 1][j - 1] + 2, 0);
}
dp[i][j] = max(max(dp[... | 10 |
#include <bits/stdc++.h>
using namespace std;
long long Max(long long a, long long b) { return a > b ? a : b; }
long long Min(long long a, long long b) { return a < b ? a : b; }
int main() {
int d, l, v1, v2;
scanf("%d%d%d%d", &d, &l, &v1, &v2);
printf("%lf\n", double(l - d) / double(v1 + v2));
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, ans = 0;
cin >> a >> b >> c;
c -= c % 4;
b -= b % 2;
if (a * 2 <= b and a * 4 <= c) ans = a + a * 2 + a * 4;
if (b * 2 <= c and b / 2 <= a)
if (b + b * 2 + b / 2 > ans) ans = b + b * 2 + b / 2;
if (c / 4 <= a and c / 2 <= b)
i... | 0 |
#include <bits/stdc++.h>
const long long N = 1e6;
using namespace std;
int query(string s) {
cout << s << endl;
fflush(stdout);
int n;
cin >> n;
return n;
}
string gena(int n) {
string s;
for (int i = 0; i < n; i++) s += 'a';
return s;
}
string genb(int n) {
string s;
for (int i = 0; i < n; i++) s +... | 15 |
#include <bits/stdc++.h>
using namespace std;
long long powe(long long a, long long b) {
long long M = 1000000007;
if (b == 0) return 1;
if (b % 2 == 0) {
return powe((a * a) % M, b / 2);
} else {
return (a * (powe(((a * a) % M), (b - 1) / 2)) % M);
}
}
long long gcd(long long a, long long b) {
if (... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 10;
inline char gc() {
return getchar();
static const int maxs = 1 << 16;
static char buf[maxs], *p1 = buf, *p2 = buf;
return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, maxs, stdin), p1 == p2)
? EOF
: *p1++;
}
inlin... | 16 |
#include <bits/stdc++.h>
using namespace std;
long long factorials[200000 + 453];
long long inverses[200000 + 453];
long long mod = 1000000007;
long long add(long long a, long long b) {
return ((a % mod) + (b % mod)) % mod;
}
long long sub(long long a, long long b) {
return ((a % mod) - (b % mod) + mod) % mod;
}
lo... | 14 |
#include <bits/stdc++.h>
int A, B, F;
char P[22][22];
bool chk(int a, int b, int c, int d, int p, int q, int r, int s) {
int i, j, f;
f = 0;
for (i = a; i <= b; i++) {
for (j = c; j <= d; j++) {
if (P[i][j] != P[i - a + p][j - c + r]) {
f = 1;
break;
}
}
if (f) break;
}
... | 10 |
#include <bits/stdc++.h>
using namespace std;
int main() {
unsigned int a, b, x;
cin >> a >> b;
x = min(a, b);
unsigned long int fact = 1;
while (x > 1) {
fact = fact * x;
x--;
}
cout << fact;
return (0);
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void checkmin(T &a, const T &b) {
if (b < a) a = b;
}
template <class T>
inline void checkmax(T &a, const T &b) {
if (b > a) a = b;
}
const long long INF = 1e18 + 10;
const int MAX_N = 3e5 + 10;
long long H[MAX_N], Hash[MAX_N];
int n, a[MAX_N];... | 17 |
#include <bits/stdc++.h>
using namespace std;
void build(unsigned int *A, vector<unsigned int> tree[], unsigned int index,
unsigned int s, unsigned int e) {
if (s == e)
tree[index].push_back(A[s]);
else {
unsigned int mid = (s + e) / 2;
build(A, tree, 2 * index, s, mid);
build(A, tree, 2 ... | 10 |
#include <bits/stdc++.h>
using namespace std;
int a[5010];
long long sum[5010];
int main() {
int n;
scanf("%d", &n);
int i, j, k;
for (i = 0; i < n; i++) scanf("%d", &a[i]);
sum[0] = (long long)a[0];
for (i = 1; i < n; i++) sum[i] = sum[i - 1] + (long long)a[i];
sum[n] = sum[n - 1];
int d0, d1, d2, dd0,... | 10 |
#include <bits/stdc++.h>
using namespace std;
vector<string> inivector;
string init;
int main() {
cin >> init;
int stringend = init.size() - 1;
for (int i = 0; i <= stringend; ++i) {
string tmp = "";
for (int j = i; j <= stringend; ++j) {
tmp += init[j];
inivector.push_back(tmp);
}
}
i... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
std::ios_base::sync_with_stdio(false);
long long int t;
cin >> t;
while (t--) {
long long int a, b;
cin >> a >> b;
long long int c = b % a;
long long int d = b / a;
cout << ((d + 1) * (d + 1) * c) + ((d) * (d) * (a - c)) << "\n";
}... | 2 |
#include <bits/stdc++.h>
namespace io {
int F() {
int F = 1, n = 0;
char ch;
while ((ch = getchar()) != '-' && (ch < '0' || ch > '9'))
;
ch == '-' ? F = 0 : n = ch - '0';
while ((ch = getchar()) >= '0' && ch <= '9') n = n * 10 + ch - '0';
return F ? n : -n;
}
long long G() {
long long F = 1, n = 0;
... | 19 |
#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1& arg1) {
cerr << name << ": " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1& arg1, Args&... args) {
const char* comma = strchr(names + 1, ',');
cerr.write(names, ... | 12 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const int MAXN = 3e5 + 10;
long long ex[MAXN], ey[MAXN], w[MAXN], str[MAXN], wtr[MAXN], n, m, k, d[MAXN];
vector<int> ng[MAXN];
bool updTr[MAXN];
int other(int id, int x) { return ex[id] + ey[id] - x; }
set<pair<long long, int> > s;
int main() {
... | 12 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, k, n, rev = 0, r, c1 = 0, c2 = 0, x, z, a[1000], ans = 0;
string s;
set<char> ch;
cin >> n >> s;
for (i = 0; i < n; i++) {
if (s[i] > 96) {
ch.insert(s[i]);
} else {
x = ch.size();
ans = max(ans, x);
ch.clear();
... | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.