solution stringlengths 53 181k | difficulty int64 0 27 |
|---|---|
#include <bits/stdc++.h>
using namespace std;
long long int n;
vector<long long int> v;
map<long long int, long long int> mp, ck;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
long long int a, b;
cin >> a >> b;
ck[a]++;
ck[b]++;
ck[b + 1]++;
mp[a]++;
mp[b + 1]--;
if (ck[a] == ... | 7 |
#include <bits/stdc++.h>
const int MAX = 10010;
using namespace std;
int k;
long long dp[6][MAX];
long long calc(int q, long long n) {
if (n > 10000) return calc(q, 10000);
if (dp[q][n] != -1) return dp[q][n];
long long x = n - 1;
for (long long i = 1; i <= n + 1; i++) {
if (x > 10004205361450474LL) break;
... | 22 |
#include <bits/stdc++.h>
char a[105];
int main() {
int n, k, sch = 0, ans = 0;
scanf("%d%d%s", &n, &k, a);
a[n] = 'E';
for (int i = 0; i <= n; i++) {
if (a[i] != a[i - 1]) {
if (sch > ans) ans = sch;
sch = 0;
}
if (a[i] == 'N') sch++;
}
if (ans > k) {
printf("NO");
return 0;
... | 12 |
#include <bits/stdc++.h>
using namespace std;
const long long int N = 2e5 + 5;
void solve() {
long long int n, i;
cin >> n;
string s;
cin >> s;
vector<pair<char, long long int> > a(n);
for (i = 0; i < n; i++) {
a[i].first = s[i];
a[i].second = i;
}
sort(a.begin(), a.end());
long long int ans =... | 10 |
#include <bits/stdc++.h>
using namespace std;
long long modF(long long n) {
long long mod = 256;
return (n % mod + mod) % mod;
}
long long FUNCREV(long long n) {
vector<long long> dp(8, 0);
long long dpC = 0;
while (n > 1) {
dp[dpC++] = n % 2;
n = n / 2;
}
if (n != 0) dp[dpC++] = n;
long long an... | 5 |
#include <bits/stdc++.h>
using namespace std;
mt19937 gen(chrono::system_clock::now().time_since_epoch().count());
const int N = 2e5 + 10;
const long long MOD = 1e9 + 7;
const int rx[8] = {-1, -1, -1, 0, 1, 1, 1, 0};
const int ry[8] = {-1, 0, 1, 1, 1, 0, -1, -1};
const long double eps = 1e-7;
const double pi = acos(-1.... | 8 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, sum = 0;
cin >> n;
int *d = new int[n - 1];
for (int i = 0; i < n - 1; i++) cin >> d[i];
cin >> a >> b;
for (int i = a; i < b; i++) sum += d[i - 1];
cout << sum;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios ::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int sum = 0;
sort(v.begin(), v.end());
for (int i = 0; i < n; i += 2) {
sum += abs(v[i] - v[i + 1]);
}
cout... | 0 |
#include <bits/stdc++.h>
using namespace std;
int t;
long long n, d, x, s;
double y, z;
int main() {
cin >> t;
while (t--) {
cin >> n >> d;
if (n >= d)
cout << "YES" << endl;
else {
x = sqrt(d) - 1;
y = (1.0 * d) / (x + 1);
s = ceil(y);
if (s + x <= n)
cout << "YES"... | 3 |
#include <bits/stdc++.h>
using namespace std;
void read(int &x) {
int v = 0, f = 1;
char c = getchar();
while (!isdigit(c) && c != '-') c = getchar();
if (c == '-')
f = -1;
else
v = v * 10 + c - '0';
while (isdigit(c = getchar())) v = v * 10 + c - '0';
x = v * f;
}
void read(long long &x) {
long... | 17 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
long long int i, n, t, m, j;
cin >> t;
while (t--) {
cin >> n >> m;
long long int a[n + 2][m + 2];
long long int ans[n + 2][m + 2];
for (i = 1; i <= n; i++) {
for (j = 1; j <= m; j++) {
... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
const int MOD = 1e9 + 7;
inline int msb(int n) {
int b = 1;
while (b < 32) {
n |= n >> b;
b <<= 1;
}
return (n + 1) >> 1;
}
int A[N];
int res[N];
vector<int> bas[N];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, q;
c... | 16 |
#include <bits/stdc++.h>
using namespace std;
long long a, b, c, d, e, f, g, h, i, j, k;
long long F[305][305][305], C[305][305];
long long an[305][305] = {
{0, 0},
{0, 2, 1},
{0, 32, 30, 80, 109},
{0, 6824, 59808, 147224, 415870, 1757896, 1897056, 4898872, 7593125},
{0, 776830421, 290516100, 746623... | 19 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void mini(T &a, T b) {
if (b < a) a = b;
}
template <class T>
inline void maxi(T &a, T b) {
if (b > a) a = b;
}
int main() {
int n, m, a, b;
int G[1000][1000];
memset(G, 0, sizeof G);
cin >> n >> m;
for (int i = 0; i < m; i++) {
c... | 5 |
#include <bits/stdc++.h>
using namespace std;
bool ok = 0;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
int w, h, i, j, k, star = 0;
cin >> w >> h;
string s[w];
for (i = 0; i < w; i++) {
cin >> s[i];
for (j = 0; j < h; j++)
if (s[i][j] == '*') star++;
}
for (i ... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100111;
struct task {
int i, j, k;
};
inline bool compare(task a, task b) { return a.i > b.i; }
int n, a[maxn], m, sum[maxn], pr[maxn], parent[maxn], ans[maxn], start2[maxn];
vector<int> start[maxn];
task tasks[maxn];
int getpar(int v) {
if (parent[v] =... | 21 |
#include <bits/stdc++.h>
int main() {
int n;
scanf("%d", &n);
if (n == 2)
printf("2");
else
printf("1");
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int a[105], ans;
int main() {
scanf("%d", &a[0]);
for (int i = 1; i <= a[0]; ++i) {
scanf("%d", &a[i]);
ans += i * a[i];
}
printf("%d\n", ans);
}
| 12 |
#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;
}
int n;
const int maxn =... | 13 |
#include <bits/stdc++.h>
using namespace std;
const long double pi = 2 * acos(0.0);
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;
return 1;
}
return 0;
}
template <class T, class TT>
bool pa... | 5 |
#include <bits/stdc++.h>
using namespace std;
int INP, AM, REACHEOF;
const int BUFSIZE = (1 << 12) + 17;
char BUF[BUFSIZE + 1], *inp = BUF;
const int MN = 100111;
int n, a[MN];
long long f[MN], g[MN];
vector<int> ke[MN];
bool cmp(int u, int v) {
if (f[u] != f[v]) return f[u] > f[v];
if (g[u] != g[v]) return g[u] > ... | 13 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
long long ans = 0;
for (int i = (0); i < (n); ++i) {
long long t, T, x, cost;
cin >> t >> T >> x >> cost;
if (t >= T) {
ans += cost + m * x;
continue;
}
long long aux1 = cost;
if (m > (T - t))... | 11 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long i, a, s, d, otv = 0;
cin >> a;
map<long long, long long> ch;
map<long long, long long>::iterator ii;
vector<long long> dva;
for (i = 0; i < a; i++) {
cin >> d;
ch[d]++;
}
d = 1;
for (i = 0; i < 62; i++) {
dva.push_back(d)... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans_1, ans_2;
scanf("%d", &n);
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
ans_1 = i;
ans_2 = n / i;
}
}
printf("%d %d\n", ans_1, ans_2);
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n, m;
cin >> n >> m;
long long a[n], b[m];
for (long long i = 0; i < n; i++) cin >> a[i];
for (long long j = 0; j < m; j++) cin >> b[j];
for (long long ans = 0; ans <= 2e9; ans++) {
bool done = true;
for (long long i = 0; i < n; ... | 8 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a_v, a_e, a_s;
cin >> a_v >> a_e >> a_s;
vector<vector<pair<int, int>>> graph(a_v);
map<int, bool> res;
vector<long long int> reslist;
long long int a, b, l;
for (int i = 0; i < a_e; i++) {
cin >> a >> b >> l;
graph[a - 1].push_back(ma... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
scanf("%d%d", &a, &b);
int res = 0;
int c[10] = {6, 2, 5, 5, 4, 5, 6, 3, 7, 6};
for (int i = a; i <= b; i++) {
int t = i;
while (t) {
res += c[t % 10];
t /= 10;
}
}
printf("%d\n", res);
return 0;
}
| 2 |
#include <bits/stdc++.h>
#pragma optimize("O3")
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e18 + 7;
const int base = 2e5 + 1;
const long long MAX = 1e6;
const double EPS = 1e-9;
const double PI = acos(-1.);
const int MAXN = 2 * 1e5 + 147;
mt19937 rng(chrono::steady_clock::now().time_sinc... | 1 |
#include <bits/stdc++.h>
using namespace std;
void rvereseArray(int arr[], int start, int end) {
while (start < end) {
int temp = arr[start];
arr[start] = arr[end];
arr[end] = temp;
start++;
end--;
}
}
int main() {
int n;
cin >> n;
int arr[n], arr2[n], cont = 0, l = -1, r = -1;
vector<in... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int arr[3][100005];
int n;
scanf("%d", &n);
for (int i = 0; i < 3; i++) {
for (int j = 0; j < n - i; j++) scanf("%d", &arr[i][j]);
sort(arr[i], arr[i] + n - i);
}
for (int i = 0; i < n; i++) {
if (arr[0][i] != arr[1][i]) {
printf("... | 3 |
#include <bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template <class T>
ostream& prnt(ostream& out, T v) {
out << v.size() << '\n';
for (auto e : v) out << e << ' ';
return out;
}
template <class T>
ostream& operator<<(ostream& out, vector<T> v) {
return prnt(out, v);
}
template <cla... | 17 |
#include <bits/stdc++.h>
using namespace std;
int main() {
if (0) {
freopen("PA.INP", "r", stdin);
freopen("PA.OUT", "w", stdout);
}
ios_base::sync_with_stdio(false);
cin.tie(0);
long long r;
cin >> r;
r--;
pair<long long, long long> res;
for (int x = (1); x <= int(sqrt(r)); x++)
if (r % x... | 4 |
#include <bits/stdc++.h>
const int N = 2000005;
const int M = 10005;
const long long mod = 1000000007;
const double PI = acos(-1.0);
const double eps = 1e-10;
using namespace std;
int f[N], s[N], st;
long long m;
long long cal(int* f, long long x, long long y, long long h) {
int id = 0;
while (1) {
f[h] = id++;... | 14 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100000 + 10;
const int mod = 1000000000 + 7;
char s[maxn];
long long b[maxn];
int main() {
int n;
while (scanf("%d", &n) != EOF) {
scanf("%s", s);
int f[26];
memset(f, 0, sizeof(f));
for (int i = 0; i < n; i++) {
f[s[i] - 'A']++;
... | 7 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n, m;
string s;
cin >> n >> m >> s;
vector<int> pref(n);
for (int i = 0; i < m; ++i) {
int p;
cin >> p;
++pref[p - 1];
}
for (int i = n - 1; i > 0; --i) {
pref[i - 1] +... | 5 |
#include <bits/stdc++.h>
using namespace std;
bool rev(long long x, long long y) { return x > y; }
void input_arr(long long a[], long long n) {
for (long long i = 0; i < n; i += 1) cin >> a[i];
}
void print_vec(vector<long long> &v) {
for (auto i : v) cout << i << " ";
cout << endl;
}
void print_arr(long long a[]... | 3 |
#include <bits/stdc++.h>
using namespace std;
long long A[11];
long long dp[101][11];
long long c[101][101];
long long mod = 1e9 + 7;
long long C(int n, int k) {
if (n < 0 || k > n) return 0;
if (k == 0 || n == k) return 1;
if (c[n][k] != -1) return c[n][k];
return c[n][k] = (C(n - 1, k) + C(n - 1, k - 1)) % mo... | 11 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 10, inf = 1e9;
pair<int, int> a[MAXN], b[MAXN];
int l[MAXN];
double dist(pair<int, int> x, pair<int, int> y) {
long long px = x.first - y.first, py = y.second - x.second;
px *= px;
py *= py;
return sqrt(px + py);
}
int main() {
int n, m, x1,... | 11 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
scanf("%d", &q);
while (q--) {
int n;
scanf("%d", &n);
int arr[n], sorted_arr[n];
for (int i = 0; i < n; i++) scanf("%d", &arr[i]);
memcpy(sorted_arr, arr, sizeof(arr));
sort(sorted_arr, sorted_arr + n);
unordered_map<in... | 12 |
#include <bits/stdc++.h>
using namespace std;
int n, q;
char s1[500200];
string s[500200];
struct node {
int st, in;
node() { st = -1, in = -1; }
};
node nd[500200];
int k = 0;
pair<int, pair<int, int> > sortt[500200];
pair<int, pair<int, int> > t2[500200];
int pl[500200];
int t1[500200];
vector<int> p[500200];
vec... | 20 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e3 + 5;
const long long mod = 1e9 + 7;
int a[maxn];
int b[maxn];
vector<int> u;
int T, n, k;
bool cal(long long x) {
long long ans = 1;
for (int i = 1; i <= n; i++) {
int p = upper_bound(a + 1, a + n + 1, x) - a - 1;
x++;
ans = (p - i + 1) ... | 11 |
#include <bits/stdc++.h>
long long int p = 0, len;
long long int f(char s[]) {
long long int cnt = 0, i, r, d, val = 0;
len = strlen(s);
if (len <= 3) {
if (len == 3)
val = (s[0] - '0') * 100 + (s[1] - '0') * 10 + (s[2] - '0');
else if (len == 2)
val = (s[0] - '0') * 10 + (s[1] - '0');
els... | 11 |
#include <bits/stdc++.h>
using namespace std;
int mapp[51][51], rec[51][51], ans(1000000007);
inline long long read() {
int s(0);
bool w(1);
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') w = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') s = s * 10 + ch - '0', ch = getchar... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000;
pair<int, int> b[100100];
vector<int> q;
pair<int, pair<int, int> > a[100100];
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> a[i].first >> a[i].second.first;
a[i].second.first = 1 - a[i].second.first;
... | 9 |
#include <bits/stdc++.h>
using namespace std;
int n, k, amin, amax, a[1 << 20];
long long sum = 0;
int main() {
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
sum += a[i];
}
sort(a, a + n);
int moves = k;
for (int i = 0; i < n;) {
int j = i;
int g = 1e9 + 5;
wh... | 12 |
#include <bits/stdc++.h>
using namespace std;
long long int power(long long int x, long long int y, long long int p) {
long long int res = 1;
x = x % p;
if (x == 0) return 0;
while (y > 0) {
if (y & 1) res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int main() {
long long int... | 3 |
#include <bits/stdc++.h>
using namespace std;
long long n, a, b, k, d[5555][5555], ans, l, r, x;
int main() {
cin >> n >> a >> b >> k;
d[a][0] = 1;
for (long long i = 1; i <= k; i++) {
for (long long j = 1; j <= n; j++)
if (j != b) {
long long len = ((j - b) >= 0 ? (j - b) : -(j - b)) - 1;
... | 11 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1000010;
const int P = 1e9 + 7;
int n;
int ans[N];
char s[N];
int pw[N], hsh[N];
int subHash(int lst, int len);
int main() {
scanf("%d%s", &n, s + 1);
pw[0] = 1;
for (int i = 1; i <= n; ++i) {
pw[i] = pw[i - 1] * 26LL % P;
hsh[i] = (hsh[i - 1] * ... | 19 |
#include <bits/stdc++.h>
using namespace std;
vector<int> cnt[200005];
int ans[200005];
int main(int argc, char** argv) {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
int t;
cin >> t;
cnt[t].push_back(i);
}
int now = 0;
for (int i = 1; i <= n; i++) {
while (now > 2 && !cnt[now].size()) {
... | 11 |
#include <bits/stdc++.h>
using namespace std;
int n, cp[202], ok[202], sz[202], opt = 9999, cur;
vector<int> v[202], sel[3];
void tri(int st) {
cur = -1;
for (int i = (1); i <= (n); i++) ok[i] = 0;
for (int i = (0); i <= (2); i++) sel[i].clear();
for (int i = (1); i <= (n); i++)
if (ok[i] == sz[i]) sel[cp[i... | 9 |
#include <bits/stdc++.h>
using namespace std;
int N;
map<int, int> dp;
string s;
int main() {
int ctr_z, ctr_o, mvalue;
ctr_z = ctr_o = mvalue = 0;
cin >> N >> s;
for (int i = 0; i < N; i++) {
if (s[i] == '0')
ctr_z += 1;
else
ctr_o += 1;
if (ctr_z - ctr_o == 0) {
mvalue = i + 1;
... | 7 |
#include <bits/stdc++.h>
using namespace std;
const int N = 310;
const int mod = 1e9 + 7;
long long Pow(int m, int n) {
long long res = 1;
for (int i = 0; i < n; i++) res = (res * m) % mod;
return res;
}
int main() {
int m, n, k;
cin >> m >> n >> k;
if (k == 1 || k > m)
cout << Pow(n, m);
else if (k =... | 8 |
#include <iostream>
#include <vector>
using namespace std;
void merge (vector<int> &p, const vector<int> &q) {
int n = p.size();
for (int i = 1; i < n; i++){
p[i] ^= q[i - 1];
}
p[0] ^= q[n - 1];
}
int calc_ans (const vector<int> &p) {
int n = p.size();
int ans = 0;
for (int i = n / 2; i < n; i++)... | 17 |
#include <bits/stdc++.h>
using namespace std;
char s[1000000 + 13];
int cou[10];
int m7[10] = {1869, 1968, 1689, 6198, 1698, 1986, 1896};
int main() {
scanf("%s", s);
int l = (int)strlen(s);
for (int i = 0; i < l; i++) cou[s[i] - '0']++;
cou[1]--;
cou[6]--;
cou[8]--;
cou[9]--;
int tt = 0, t10 = 0;
for... | 8 |
#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
os << "[";
for (long long i = 0; i < v.size(); ++i) {
os << v[i];
if (i != v.size() - 1) os << ", ";
}
os << "]";
return os;
}
template <typename T>
os... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 10;
long long n;
char s[MAXN];
inline pair<long long, pair<long long, long long> > find(long long x) {
long long rt = ((n + 1) >> 1), delta = ((n + 1) >> 2);
long long fa = -1, ls = -1, rs = -1;
while (rt != x) {
fa = rt;
if (rt < x)
... | 11 |
#include <bits/stdc++.h>
using namespace std;
int n, k, z[510][510], used[510][510], second[250000], u[250000], ans = -1;
char a[510][510];
vector<int> v;
void dfs(int i, int j, int t) {
used[i][j] = t;
if (i + 1 < n && !used[i + 1][j] && a[i + 1][j] == '.') dfs(i + 1, j, t);
if (j + 1 < n && !used[i][j + 1] && a... | 16 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
cout << max(abs(s[0] - t[0]), abs(s[1] - t[1])) << endl;
while (s != t) {
if (s[0] < t[0]) {
cout << "R";
s[0] += 1;
} else if (s[0] > t[0]) {
cout << "L";
s[0] -= 1;
}
if (s[1] < t[1])... | 2 |
#include <bits/stdc++.h>
using namespace std;
void doit(vector<int>& v, bool p) {
vector<int> ans;
ans.reserve(v.size());
if (v.size() % 2) {
if (p) {
for (int i = 5; i < (int)v.size(); i += 2) {
ans.push_back(v[i]);
}
ans.push_back(v[1]);
ans.push_back(v[3]);
ans.push_ba... | 14 |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
const long long MAX = 4005;
const double PI = 3.1415926;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long n;
cin >> n;
long long arr[n];
for (long long i = 0; i < n; ++i) {
cin >> arr[i];
... | 7 |
#include <bits/stdc++.h>
using namespace std;
const int N = 85;
const double eps = 1e-9;
int n, ct;
int l[N], r[N], b[N << 1];
double f[2][N][N], ans[N][N];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d%d", &l[i], &r[i]), b[++ct] = l[i], b[++ct] = r[i];
sort(b + 1, b + ct + 1);
ct = u... | 22 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 600000;
char S[maxn];
static int t, n, H;
bool Chk(int mid) {
int lef = t;
int th = H;
int maxh = 0;
for (int i = 1; i <= n; i++)
if (S[i] == 'H') maxh = i;
int maxS = 0;
int tmp = mid;
for (int i = 1; i <= n; i++)
if (S[i] == 'S') {
... | 15 |
#include <bits/stdc++.h>
using namespace std;
int a[502], dp[502][502], n, i, j, r, l;
int main() {
cin >> n;
for (i = 0; i < n; i++) cin >> a[i];
for (i = 0; i <= n; i++) dp[i][i] = dp[i][i + 1] = 1;
for (j = 2; j <= n; j++)
for (l = 0; l + j <= n; l++) {
r = j + l;
dp[l][r] = dp[l + 1][r];
... | 15 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 1000;
const long long INF64 = 1e18 + 1000;
const int N = 100 * 1000 + 10;
const int M = 1000;
const int MOD = 1e9 + 7;
const double EPS = 1e-9;
long long gcd(long long a, long long b) { return a == 0 ? b : gcd(b % a, a); }
int main() {
ios_base::sync... | 7 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
const long long int maxn = 2e5 + 16, maxk = 55, md = 1e9 + 7, inf = 2e16;
long long int gcd(long long int a, long long int b) {
if (a < b) swap(a, b);
if (b == 0) return a;
return gcd(b, a % b);
}
long long int tav(long long int n, long l... | 16 |
#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const long long N = 3e5 + 100;
vector<long long> g[N];
set<long long> unused;
void dfs(long long v, long long bad = -1) {
set<long long> cur = unused;
unused.clear();
for (auto u : g[v]) {
if (cu... | 16 |
#include <bits/stdc++.h>
using namespace std;
string s;
string t;
int n;
int main() {
cin >> s;
cin >> t;
string res = s;
n = s.length();
bool ct = true;
for (int i = n - 1; 0 <= i; i--) {
if (s[i] == t[i]) {
res[i] = '1';
continue;
}
if (ct)
res[i] = t[i];
else
res[i... | 3 |
#include <bits/stdc++.h>
#define ls x<<1
#define rs x<<1|1
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
using namespace std;
typedef long long ll;
const int N=2e3+5;
const int mod=1e9+7;
int n,m,t,q;
int ans[N];
int L[20],R[20],U[20],D[20];
ll num[N],sum[N];
int main(){
... | 11 |
#include <bits/stdc++.h>
using namespace std;
int cnt(int y, int m, int d) {
if (m < 3) y--, m += 12;
return 365 * y + y / 4 - y / 100 + y / 400 + (153 * m - 457) / 5 + d - 306;
}
int main() {
int a, b, c, t1, t2;
scanf("%d:%d:%d", &a, &b, &c);
t1 = cnt(a, b, c);
scanf("%d:%d:%d", &a, &b, &c);
t2 = cnt(a,... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 5;
int n, m, limit;
vector<int> V[N], a[N];
int fa[N], dep[N], vis[N];
bool finished;
template <typename T>
inline void chkmax(T &x, T y) {
x = max(x, y);
}
template <typename T>
inline void chkmin(T &x, T y) {
x = min(x, y);
}
template <typename T>
... | 18 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
//TIAS MONDAL
const ll maxn=1e5+10;
const ll mod=1e9+7;
const ll m2=1e9+7;
const ll INF64 = ll(1e18);
const ll max2=1e3+10;
const ll N = 1000001;
const ll MAXN=2e5+10;
const ll ALPHABET_SIZE = 2;
int main()
{
/*#ifndef ONLINE... | 3 |
#include <bits/stdc++.h>
using namespace std;
long long n, tot, ans, now;
long long head[100005], nx[200005], to[200005], w[200005];
long long sum[100005], sz[100005];
struct node {
long long zhi, id, qwq;
};
vector<node> a[100005];
long long read() {
char aa = getchar();
long long pp = 1, kk = 0;
while (aa < '... | 15 |
#include <bits/stdc++.h>
using namespace std;
int val[1001][1001];
int n;
int main() {
int vali = 0, n = 0, q = 0, tmp, ans = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) {
scanf("%d", &val[i][j]);
if (i == j) ans = (ans + val[i][j]) % 2;
}
cin >> q;
for (int... | 8 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long mod = (int)1e9 + 7;
const int N = 3e5 + 100;
int n, m, k, p;
int w[N];
long long tot[N];
long long ans[N];
struct Node {
int a, b, id;
} q[N];
bool cmp(Node x1, Node x2) { return x1.b < x2.b; }
int main() {
scanf("%d", &n);
... | 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 n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (n == 1 || n == 2) {
cout << 0 << endl;
} else {
i... | 4 |
#include <bits/stdc++.h>
using namespace std;
int arr[11111];
int out[11111];
int temp[11111];
int main() {
int n, k;
scanf("%d %d", &n, &k);
for (int i = (1); i < (n); ++i) arr[i] = 1;
arr[n] = 0;
int qtd = 0;
int ct = 5;
while (arr[1] != n - 1) {
memcpy(temp, arr, sizeof arr);
out[qtd++] = n;
... | 8 |
#include <bits/stdc++.h>
using namespace std;
const int NMAX = 1e5;
int n;
int total[NMAX + 5];
int low[NMAX + 5];
char c[5 * NMAX + 5];
int suply[5 * NMAX + 5];
int demand[5 * NMAX + 5];
int main() {
scanf("%d\n", &n);
for (int i = 1; i <= n; i++) {
fgets(c + 1, 5 * NMAX + 5, stdin);
for (int j = 1; c[j] =... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
const int H = (int)1e9 + 7;
char a[N];
char s[20000];
int n[200], u[200], when[200][200], ans[200];
int h[200][200];
int st[N];
int main() {
srand(time(NULL));
gets(a);
int alen = strlen(a), m;
scanf("%d ", &m);
for (int i = 0; i < ((int)(m... | 14 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline bool getmax(T& a, const T& b) {
return b > a ? (a = b, true) : false;
}
template <typename T>
inline bool getmin(T& a, const T& b) {
return b < a ? (a = b, true) : false;
}
const int maxn = 1e5 + 5;
const int maxm = 2e5 + 15;
const int INF =... | 22 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string str = "6789TJQKA";
char fir[5], sec[5], trump;
scanf("%c %s %s", &trump, fir, sec);
if (fir[1] == trump && fir[1] != sec[1])
printf("YES\n");
else if (fir[1] != sec[1])
printf("NO\n");
else {
int one = 0, two = 0;
while (1) {
... | 2 |
#include <bits/stdc++.h>
using namespace std;
int n;
int a[100005];
int dp[100005][2][2];
int solve(int idx, int prf, int sf) {
if (idx == n) return 0;
int &ret = dp[idx][prf][sf];
if (ret != -1) return ret;
ret = 0;
if (prf && !sf) {
ret = max(solve(idx + 1, 1, 0) + (a[idx]) * (-1),
max(sol... | 10 |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0, f = 1;
char c = getchar();
while (!isdigit(c)) {
if (c == '-') f = -f;
c = getchar();
}
while (isdigit(c)) {
x = x * 10 + c - '0';
c = getchar();
}
return x * f;
}
const int maxn = 1e2 + 5;
int vis[maxn], NOW, num... | 18 |
#include <bits/stdc++.h>
using namespace std;
long long int insig;
void Out(vector<long long int> x) {
for (long long int i = 0; i < x.size(); i++) {
cout << x[i] << " ";
}
cout << endl;
}
int main() {
long long int T;
cin >> T;
long long int N, M;
long long int ans;
for (long long int i = 0; i < T;... | 12 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void dout() { cerr << endl; }
template <typename Head, typename... Tail>
void dout(Head H, Tail... T) {
cerr << H << ' ';
dout(T...);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
vector<int> k(n);... | 12 |
#include <bits/stdc++.h>
using namespace std;
long long days[] = {0, 1, 2, 3, 1, 3, 2, 1};
long long a, b, c;
bool judge(long long k, long long st) {
long long ta = 0, tb = 0, tc = 0;
if (st + k - 1 < 7) {
for (long long i = 0; i < k; i++) {
long long typ = days[(st + i - 1) % 7 + 1];
if (typ == 1)
... | 6 |
#include <bits/stdc++.h>
using namespace std;
char mx[] = {'R', 'O', 'Y', 'G', 'B', 'V'};
int cl[] = {0, 1, 2, 3, 4, 5};
int p[3][6] = {1, 2, 4, 5, 6, 3, 5, 3, 1, 4, 2, 6, 4, 6, 3, 2, 5, 1};
int pos[6];
int q = 0;
int rr[6];
int used[6];
bool was[6][6][6][6][6][6];
void pr(int id) {
int res[6];
for (int i = 0; i < ... | 9 |
#include <bits/stdc++.h>
using namespace std;
const int start = 48;
const int maxn = 1e5 + 5;
int n;
int a[maxn];
int s1[maxn], s2[maxn], ss1, ss2;
int d[maxn], dn;
struct NODE {
int s, t;
} ans[maxn];
int ansn;
bool cmp(NODE a, NODE b) {
if (a.s == b.s) return a.t < b.t;
return a.s < b.s;
}
void addans(int s, in... | 11 |
#include <bits/stdc++.h>
using namespace std;
long long T = 0, n = 0, m = 0, a, b, c;
pair<pair<long long, long long>, long long> d[1000001];
pair<long long, long long> tree[7000001];
long long mark[7000001];
void push_down(long long p) {
if (!mark[p]) return;
tree[p + p].first += mark[p];
tree[p + p + 1].first +... | 16 |
#include <bits/stdc++.h>
using namespace std;
void read_file() {}
int main() {
read_file();
int n;
int p[100000 + 9];
while (cin >> n) {
for (int k = 0; k < n; k++) cin >> p[k];
int i = 0;
while (i + 1 < n && p[i] < p[i + 1]) i++;
if (i + 1 == n) {
printf("yes\n%d %d\n", 1, 1);
conti... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
struct E {
int v, w, ne;
} edge[maxn << 1];
int n, head[maxn], tot = 1;
bool vis[maxn];
vector<int> ans;
void dfs(int x) {
vis[x] = true;
if (vis[(x * 2) % n] == false) dfs((x * 2) % n);
if (vis[(x * 2 + 1) % n] == false) dfs((x * 2 + 1) % ... | 20 |
#include <bits/stdc++.h>
using namespace std;
int n;
const int UNKNOWN = -1;
int DP_WHITE[51][51][51][51];
int DP_COST[51][51][51][51];
string grid[51];
bool white(int x1, int x2, int y1, int y2) {
if (DP_WHITE[x1][x2][y1][y2] != UNKNOWN) return DP_WHITE[x1][x2][y1][y2];
if (x1 < x2 - 1) {
DP_WHITE[x1][x2][y1][... | 15 |
#include <bits/stdc++.h>
using namespace std;
const unsigned long long MOD = 257;
const int maxn = 200;
const int max_len = 200;
struct widget;
struct Box {
string name;
long long x, y;
vector<Box *> box_inside;
vector<widget *> widget_inside;
long long border, space;
bool type;
vector<Box *> parent;
vo... | 15 |
#include <bits/stdc++.h>
using namespace std;
int a[101][2501];
const int delta = 1000000007;
int main() {
string s = "abcdefghijklmnopqrstuvwxyz";
for (int i = 1; i <= 101; i++) {
for (int j = 0; j <= 2500; j++) {
if (j / i >= 26) {
a[i][j] = 0;
} else if (i == 1)
a[i][j] = 1;
... | 12 |
#include <bits/stdc++.h>
using namespace std;
int flag[1010][1010];
int m;
int n;
int main() {
int len = 60;
scanf("%d", &m);
int n = 1;
int idx = 3;
while (m) {
if (m & 1) {
flag[n][idx] = flag[idx][n] = 1;
idx++;
for (int i = 1; i < len - 1; i++) {
flag[idx - 1][idx] = flag[idx... | 11 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, num, ans = 1;
vector<int> v;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> num;
v.push_back(num);
}
sort(v.begin(), v.end());
int prev = v[0];
for (int i = 1; i < n; i++) {
if (v[i] == prev) ans++;
prev = v[i];
}
cout... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int c1, c2, c3, c4, c5;
scanf("%d%d%d%d%d", &c1, &c2, &c3, &c4, &c5);
int s{c1 + c2 + c3 + c4 + c5};
if (s % 5 || s == 0)
puts("-1");
else
printf("%d\n", s / 5);
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
void run_case() {
int n;
cin >> n;
vector<string> v(2);
for (int i = 0; i < 2; i++) {
cin >> v[i];
}
for (int i = 0; i < n; i++) {
if (v[0][i] == '1' && v[1][i] == '1') {
cout << "NO" << endl;
return;
}
}
cout << "YES" << endl;
}
int ... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long x, a = 0LL;
int main() {
scanf("%lld", &x);
;
for (long long int i = (long long int)2; i <= x; i++) {
if (i & 1)
a = a * 3 - 3;
else
a = a * 3 + 3;
a = a % 1000000007;
}
printf("%lld\n", a);
}
| 7 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
int pos = 0;
int l, r;
for (int i = 0; i < t.size() and pos < s.size(); i++) {
if (t[i] == s[pos]) {
pos++;
l = i;
}
}
if (pos != s.size()) {
cout << "0\n";
return 0;
}
pos = s.size() - 1... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 207;
int N;
char s[maxn];
int f[37];
bool book[37];
int main() {
scanf("%d", &N);
scanf("%s", s + 1);
int ans = 0, re = 0;
int t;
for (int i = 1; i <= N; i++) {
if (s[i] <= 'Z')
memset(f, 0, sizeof(f)), memset(book, 0, sizeof(book)), re ... | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.