solution stringlengths 53 181k | difficulty int64 0 27 |
|---|---|
#include <bits/stdc++.h>
using namespace std;
template <class T>
istream& operator>>(istream& ss, vector<T>& v) {
for (int i = 0; i < v.size(); i++) ss >> v[i];
return ss;
}
template <class T>
ostream& operator<<(ostream& ss, const vector<T>& v) {
for (int i = 0; i < v.size(); i++) ss << v[i] << ' ';
return ss;... | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int pp;
cin >> pp;
for (int jiaran = 1; jiaran <= pp; jiaran++) {
int left, right, t = 1;
cin >> left >> right;
int p1 = 1, p2 = 2, temp = 0, p;
int l, r, k1, k2, k;
while (p2 <= right * 2) {
p = 0;
l = left / p1 + (left % ... | 5 |
#include <bits/stdc++.h>
using namespace std;
inline int rei() {
int x;
cin >> x;
return x;
}
inline long long rel() {
long long x;
cin >> x;
return x;
}
inline string res() {
string x;
cin >> x;
return x;
}
long long Pow(long long X, long long R) {
if (R == 0) {
return 1;
}
if (R % 2 == 0) ... | 14 |
#include <bits/stdc++.h>
using namespace std;
const int N = 35, M = 1e9 + 7;
int n, a[N], c[N][N], fac[N], dp[N][2][N][N];
int main() {
scanf("%d", &n);
n++;
for (int i = 1; i <= 30; i++) {
a[i] = n % 2;
n /= 2;
}
c[0][0] = fac[0] = 1;
for (int i = 1; i <= 30; i++) {
c[i][0] = 1;
fac[i] = fa... | 19 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int TESTS = 1;
while (TESTS--) {
long long n;
cin >> n;
map<char, string> m;
m['0'] = "0000";
m['1'] = "0001";
m['2'] = "0010";
m['3'] = "0011";
m['4'] = "0100"... | 10 |
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e6 + 10, INF = 1e18, mod = 998244353, m_log = 22, p = 337;
long long binpow(long long a, long long n) {
if (n == 0) return 1;
if (n % 2 == 1)
return (binpow(a, n - 1) * a) % mod;
else {
long long b = binpow(a, n / 2);
return (b * b) % ... | 10 |
#include <bits/stdc++.h>
using namespace std;
char a[1111][1111];
int n, m;
inline bool rect(int sx, int sy, int fx, int fy) {
for (int i = sx; i <= fx; ++i) {
if (a[i][sy] == '.') return 0;
if (a[i][fy] == '.') return 0;
}
for (int j = sy; j <= fy; ++j) {
if (a[sx][j] == '.') return 0;
if (a[fx][... | 18 |
#include <bits/stdc++.h>
using namespace std;
int a[200005];
int main() {
string s, t;
int n;
cin >> n;
cin >> s >> t;
for (int i = 0; i < n; ++i) a[i] = s[i] - 'a' + t[i] - 'a';
for (int i = n - 1; i; --i) {
if (a[i] >= 26) {
a[i] -= 26;
++a[i - 1];
}
}
for (int i = 0; i < n; ++i) {... | 11 |
#include <bits/stdc++.h>
using namespace std;
void zaroorat() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int main() {
zaroorat();
long long n;
cin >> n;
std::map<char, int> map;
string inp;
cin >> inp;
for (size_t i = 0; i < inp.size(); i++) {
map[inp[i]] += 1;
}
if (map['A']... | 0 |
#include <bits/stdc++.h>
int main() {
char c[11][11];
int p, i, j, k, v;
p = 0;
for (i = 1; i <= 8; i++) {
for (j = 1; j <= 8; j++) {
scanf("%c", &c[i][j]);
}
getchar();
}
for (k = 1; k <= 8; k++) {
for (v = 1; v <= 7; v++) {
if (c[k][v] == c[k][v + 1]) {
p = 1;
}
... | 2 |
#include <bits/stdc++.h>
using namespace std;
int d(int x) {
int z = 0, c = x;
while (c) {
z |= (1 << (c % 10));
c /= 10;
}
return __builtin_popcount(z);
}
void solve() {
int n, k;
cin >> n >> k;
while (d(n) > k) {
int r = 1, c = n;
while (d(c) > k) {
c /= 10;
r *= 10;
}
... | 11 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline void checkMin(T &a, T b) {
if (b < a) a = b;
}
template <typename T>
inline void checkMax(T &a, T b) {
if (a < b) a = b;
}
const int MAX_N = 1024;
int n, m, q;
struct Bit2D {
int n = 1000, bit[MAX_N][MAX_N];
void add(int x, int y, int d)... | 12 |
#include <bits/stdc++.h>
using namespace std;
int main() {
locale loc;
map<string, int> mp;
string x, y, z;
int N;
cin >> N;
mp["polycarp"]++;
int maxAns = 0;
while (N--) {
cin >> x >> y >> z;
transform(x.begin(), x.end(), x.begin(), ::tolower);
transform(z.begin(), z.end(), z.begin(), ::tol... | 4 |
#include <bits/stdc++.h>
using namespace std;
int N, K, in[30010];
vector<vector<int> > cdp(30010, vector<int>(2));
vector<vector<int> > ndp(30010, vector<int>(2));
int f[2][2];
int main() {
scanf("%d%d", &N, &K);
--K;
for (int i = 0; i < N; ++i) scanf("%d", &in[i]);
int mins = 0, maxs = 0;
for (int i = 0; i ... | 19 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:64000000")
using namespace std;
const long long INF = ((1 << 31) - 1);
const long long LLINF = (((1LL << 63) - 1LL));
const double EPS = 1e-9;
const double PI = 3.14159265358979323846;
pair<long long, long long> operator+(const pair<long long, long long>& lhs,
... | 5 |
#include <bits/stdc++.h>
using namespace std;
int VT[5], PT[5];
int solves[5];
int nsolves[5];
int N;
int calcscore(int A[], int totp) {
int total = 0;
for (int i = 0; i < 5; i++) {
if (A[i] == -1) continue;
int pvalue = 500;
for (int j = 1; j < 6; j++, pvalue += 500)
if ((1 << j) * nsolves[i] > t... | 12 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << 2 * n - 1 << " 2 \n1 2";
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
long long int Cube_Root(long long int x) {
long long int l = 1, r = 1000005;
while (l < r) {
long long int mid = (l + r) / 2;
if (mid * mid * mid >= x) {
r = mid;
} else {
l = mid + 1;
}
}
if (l * l * l > x) {
return l - 1;
} else {... | 9 |
#include <bits/stdc++.h>
using namespace std;
vector<vector<long long>> graph(200009);
long long visi[200009];
long long n, m, a, b, c;
void bfs(long long s, vector<long long>& dist) {
for (int i = 1; i <= n; i++) visi[i] = 0;
queue<long long> q;
q.push(s);
visi[s] = 1;
while (!q.empty()) {
long long x = ... | 13 |
#include <bits/stdc++.h>
using namespace std;
int n, k, a, b;
vector<int> c;
long long func(int l, int h) {
long long ans;
long long lb = lower_bound(c.begin(), c.end(), l) - c.begin();
long long ub = upper_bound(c.begin(), c.end(), h) - c.begin();
long long z = ub - lb;
long long mid = (l + h) / 2;
if (z =... | 9 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7, inf = 1061109567;
const long long infll = 4557430888798830399;
const int N = 1005;
int n, k1, k2, p[N], revp[N];
vector<int> g[N];
bool set1[N], set2[N];
int ask(char c, int x) {
x++;
cout << c << " " << x << "\n";
fflush(stdout);
int ans;
... | 11 |
#include <bits/stdc++.h>
using namespace std;
struct Edge {
int v, nxt, w;
} edge[200010 * 2];
int col[200010], fir[200010], sec[200010], head[200010], tot, w[200010];
void Add(int u, int v, int w) {
edge[tot] = (Edge){v, head[u], w};
head[u] = tot++;
edge[tot] = (Edge){u, head[v], w};
head[v] = tot++;
}
bool... | 12 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
vector<int> g[N];
int n, start[N], finish[N];
int dep[N];
void load_tree() {
scanf("%d", &n);
for (long long i = 1; i <= n - 1; i++) {
int u, v;
scanf("%d %d", &u, &v);
g[u].push_back(v);
g[v].push_back(u);
}
}
int Time = 0;
int... | 20 |
#include <bits/stdc++.h>
using namespace std;
const int Maxn = 100 * 1000 + 10;
const long long D = 1000ll * 1000 * 1000 + 7;
pair<int, long long> par[Maxn];
pair<int, long long> find(int v) {
if (v == par[v].first) return par[v];
pair<int, long long> ret = find(par[v].first);
par[v] = pair<int, long long>(ret.fi... | 12 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
void print_2darray(const char* second, T arr, int n, int m) {
cout << "> " << second << endl;
cout << "[" << endl;
for (int i = 0; i < n; i++) {
cout << "{";
for (int j = 0; j < m; j++) {
cout << arr[i][j] << (j == m - 1 ? "" : ",");
... | 18 |
#include <bits/stdc++.h>
using namespace std;
int a[256][256];
int main() {
int n;
scanf("%d", &n);
char s[15];
for (int i = 1; i <= n; i++) {
scanf("%s", s);
int sl = strlen(s);
char f = s[0], l = s[sl - 1];
for (int j = 'a'; j <= 'z'; j++) {
int neu = a[j][f] + sl;
if (a[j][f]) a[j... | 7 |
#include <bits/stdc++.h>
const int N = 1e5 + 5;
long long Mod;
template <class T>
inline void read(T &first) {
first = 0;
T f = 1;
char c = getchar();
while (!isdigit(c)) {
if (c == '-') f = -1;
c = getchar();
}
while (isdigit(c)) {
first = first * 10 + c - '0';
c = getchar();
}
first *=... | 19 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1002;
const long long oo = (int)1e9 + 7;
int vis[maxn][maxn][4];
char mp[maxn][maxn];
char door[maxn][maxn][4];
deque<pair<int, int> > qu;
deque<int> ro;
deque<int> tq;
int n, m;
pair<int, int> st, ed;
map<char, set<int> > indr;
int mx[4] = {-1, 0, 1, 0};
i... | 12 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
int T, n, k;
mt19937 mt(time(0) + (size_t) new int);
bool vis[N];
bool check_1() {
memset(vis, 0, n + 1);
string st;
for (int i = 1; i <= 20 && i < n; ++i) {
int p = mt() % (n - 1) + 2;
while (vis[p]) p = mt() % (n - 1) + 2;
vis[p] = 1;... | 18 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const int N = 2e5 + 1;
long long powmod(long long a, long long b, long long mod) {
long long res = 1;
a %= mod;
for (; b; b >>= 1) {
if (b & 1) res = (res * a) % mod;
a = (a * a) % mod;
}
return res % MOD;
}
in... | 9 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int i, n, s1, cnt = 0;
cin >> n;
cin >> s;
for (i = 0; i < n; i++) {
if (s[i] == 'A') cnt++;
}
s1 = (n - cnt);
if (cnt > s1)
cout << "Anton" << endl;
else if (cnt < s1)
cout << "Danik" << endl;
else
cout << "Friends... | 0 |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const int SIZE = 2e5 + 5;
const int INF = 1LL << 30;
const double eps = 1e-4;
const double PI = 3.1415926535897932;
long long f[200009];
long long inv[200009];
long long pw(long long a, long long b) {
if (b == 0) return 1;
long long h = pw... | 15 |
#include <bits/stdc++.h>
using namespace std;
long long n, a[1000000], ans = 0;
char s[1000000];
void solve() {
long long an = 0, cur = 0, pos = -1;
for (int i = 0; i < n; i++)
if (s[i] == 'A') {
cur += a[i];
if (cur > an) an = cur, pos = i;
} else
cur -= a[i];
an = 0;
for (int i = 0; ... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
int n, d, e;
int main() {
scanf("%d%d%d", &n, &d, &e);
e *= 5;
int ans = INF;
for (int i = 0; i * d <= n; i++) {
int j = (n - i * d) / e;
int tmp = i * d + j * e;
if (tmp <= n) ans = min(ans, n - tmp);
}
printf("%d\n", ans... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int MAXN = 300010;
const int TINY = 1e-13;
int N;
double b[MAXN];
pair<double, int> first[MAXN];
const int MAXS = 24;
int Ls, Rs;
int L[MAXS], R[MAXS];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << setprecision... | 18 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")
using namespace std;
unsigned long long maxi = 1e19;
struct node {
unsigned long long x, k;
int s;
} a[100];
unsigned long long dp[(1 << 20)], b;
bool cmp(node u, node v) { return u.k < v.k; }
unsigned long long ans = maxi;
int n, m;
int main() {
... | 11 |
#include <bits/stdc++.h>
using namespace std;
int arr[1010], n, m, k, i, j, in, res;
int main() {
scanf(" %d %d", &n, &m);
res = 0;
for (i = 1; i <= n; i++) {
scanf(" %d", &k);
for (j = 1; j <= k; j++) {
scanf(" %d", &in);
if (arr[in] == 0) {
arr[in] = 1;
res++;
}
}
... | 0 |
#include <bits/stdc++.h>
using namespace std;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int a, i, cnt[11] = {0};
for (i = 0; i < n; i++) {
cin >> a;
cnt[a]++;
}
long long ans = ((long long)n * (n + 1)) / 2;
for (i = 0; i <= m; i++) {
ans = ans - ((long long)cnt[i] * (1 + cnt[i... | 3 |
#include <bits/stdc++.h>
using namespace std;
void make_cycle(long long m, long long& sum_cycle, vector<long long>& arr,
long long& divider) {
sum_cycle = 0;
if (m && 1) {
arr.resize(11);
arr[0] = 0;
divider = m * 10LL;
for (long long i = 1; i <= 10; i++) {
arr[i] = (m * i) % 1... | 4 |
#include <bits/stdc++.h>
using namespace std;
int fre[26];
int main() {
int tc = 1;
cin >> tc;
while (tc--) {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < s[i].size(); j++) {
fre[s[i][j] - '... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 100032;
const double EPS = 1e-10;
struct point {
long long x, y, id;
void print() { cout << x << " " << y << endl; }
};
point P[MAX], C[MAX], P0;
inline long long triArea2(const point &a, const point &b, const point &c) {
return (a.x * (b.y - c.y) + b.... | 16 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<pair<int, int> > v;
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i <= min(n, m); i++) v.push_back(make_pair(i, min(n, m) - i));
printf("%d\n", v.size());
for (int i = 0; i < v.size(); i++) printf("%d %d\n", v[i].first, v[i].second);
return ... | 7 |
#include <bits/stdc++.h>
using namespace std;
int a[7];
int main() {
for (int i = 0; i < 6; ++i) scanf("%d", a + i);
int p1(min(a[5], a[1]));
int p2(max(a[5], a[1]));
int p3(a[2] + a[1]);
int s(0);
int nl(a[0]);
for (int i = 0; i < p1; ++i) {
s += nl * 2 + 1;
nl++;
}
for (int i = p1; i < p2; +... | 8 |
#include <bits/stdc++.h>
using namespace std;
inline int gi() {
register int data = 0, w = 1;
register char ch = 0;
while (!isdigit(ch) && ch != '-') ch = getchar();
if (ch == '-') w = -1, ch = getchar();
while (isdigit(ch)) data = 10 * data + ch - '0', ch = getchar();
return w * data;
}
const int Mod = 1e9... | 15 |
#include <bits/stdc++.h>
using namespace std;
template <typename T1, typename T2>
istream &operator>>(istream &in, pair<T1, T2> &a) {
in >> a.first >> a.second;
return in;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &out, pair<T1, T2> a) {
out << a.first << " " << a.second;
return out;
}
t... | 14 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
int f[18][200005];
int x[200005], y[200005], c[200005], dep[200005];
vector<int> G[200005], E[200005];
int Lca(int x, int y) {
if (dep[x] > dep[y]) swap(x, y);
for (int i = 0; dep[y] > dep[x]; i++)
if (dep[y] - dep[x] >> i & 1) y = f[i][y];
if (x == y) r... | 16 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int SIZE = 1e6 + 10;
int N;
vector<pair<int, int> > e[SIZE];
long long dp[SIZE][2], num[SIZE];
void dfs1(int x, int lt) {
num[x] = 1;
for (int i = 0; i < (((int)(e[x]).size())); ++i) {
int y = e[x][i].first;
if (y == lt) continue;
... | 15 |
#include <bits/stdc++.h>
using namespace std;
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const ui... | 2 |
#include <bits/stdc++.h>
using namespace std;
template <class T1>
inline void read(T1 &);
template <class T1>
inline void write(T1);
int s[10005];
int b[10005];
int main() {
int t;
read(t);
while (t--) {
int n;
double mini = 100000000000;
int ansa, ansb;
read(n);
memset(s, 0, sizeof(s));
f... | 8 |
#include <bits/stdc++.h>
using namespace std;
long double PI = 3.14159265358979323846;
long long modo = 1e9 + 7;
const long long inf = 1e13;
const long long ms = (1e5) * 2 + 5;
vector<int> vv[101];
int vis[101];
void dfs(int node) {
vis[node] = 1;
for (int i : vv[node]) {
if (!vis[i]) dfs(i);
}
}
int main() {... | 4 |
#include <bits/stdc++.h>
using namespace std;
bitset<350000001> b;
int ss[20000000];
int cnt;
void makeprime(int n) {
for (int i = 2; i <= n; ++i) {
if (!b[i]) cnt++, ss[cnt] = i;
for (int j = 1; j <= cnt && ss[j] * i <= n; ++j) {
b[i * ss[j]] = 1;
if (i % ss[j] == 0) break;
}
}
}
int main()... | 14 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 7;
string s[maxn];
int n, t;
int main() {
for (scanf("%d", &t); t--;) {
int ans = 0;
vector<int> vec[5];
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
cin >> s[i];
int num[5] = {0};
for (auto j : s[i]) num[j - 'a'... | 7 |
#include <bits/stdc++.h>
using namespace std;
pair<int, int> p[200010];
int pos[200010], idx[200010], mp[200010];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) scanf("%d", &p[i].first), p[i].second = i;
sort(p + 1, p + n + 1);
for (int i = 1; i <= n; i++)
pos[i] = p[i].first, ... | 17 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k;
scanf("%d%d%d", &n, &m, &k);
vector<int> r(n + 1, 0), c(m + 1, 0);
vector<int> tr(n + 1, 0), tc(m + 1, 0);
for (int i = 1; i <= k; i++) {
int t, x, a;
cin >> t >> x >> a;
if (t == 1) {
r[x] = a;
tr[x] = i;
} el... | 4 |
#include <bits/stdc++.h>
using namespace std;
namespace fastIO {
bool IOerror = 0;
inline char nc() {
static char buf[100000], *p1 = buf + 100000, *pend = buf + 100000;
if (p1 == pend) {
p1 = buf;
pend = buf + fread(buf, 1, 100000, stdin);
if (pend == p1) {
IOerror = 1;
return -1;
}
}
... | 15 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a = 8;
cin >> n;
if (n > 1) {
n = (n - 1) % 4;
n++;
}
switch (n) {
case 0:
cout << 1;
break;
case 1:
cout << 8;
break;
case 2:
cout << 4;
break;
case 3:
cout << 2;
br... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int N = 200010;
struct node {
int v, nxt;
} e[N * 2];
int head[N], ejs;
void add(int u, int v) {
e[++ejs].v = v;
e[ejs].nxt = head[u];
head[u] = ejs;
}
int a[N], fa[N];
int dep[N], vis[N];
queue<int> q;
inline void bfs(int u) {
dep[u] = 0;
q.push(u);
vis... | 9 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<int> v[3000];
char c[3000][3000];
int main() {
cin >> n >> m;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
cin >> c[i][j];
if (c[i][j] == '1') {
v[j].push_back(i);
}
}
}
bool res = 0;
int al = 0;
... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
;
long long int n, m;
cin >> n >> m;
long long int cnt = 0;
if (n <= 1 and m <= 1) return (cout << 0, 0);
while (1) {
cnt++;
if (n < m) {
n++;
m -= 2;
} else {
m++;
n -... | 3 |
#include <bits/stdc++.h>
using namespace std;
string p;
int tam, pos;
int cambios[1000006], res;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
cin >> p;
tam = p.size();
reverse(p.begin(), p.end());
for (int i = 0; i < tam; i++) {
if (p[i] == '0') continue;
pos = i;
cambios[i] = 1;
whi... | 13 |
#include <bits/stdc++.h>
using namespace std;
int lis[2003][2003];
int ps1[2003];
int ps2[2003];
int main() {
int n;
int v[2003];
scanf("%d", &n);
int qt1 = 0, qt2 = 0;
int p1 = -1;
for (int i = 0; i < n; i++) {
scanf("%d", v + i);
if (v[i] == 1) {
if (p1 == -1) {
p1 = i;
}
... | 10 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
template <class T>
inline void read(T &x) {
x = 0;
int f = 0;
char ch = getchar();
while (!isdigit(ch)) f = ch == '-', ch = getchar();
while (isdigit(ch)) x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
x = f ? -x : x;
}
struct edge {... | 24 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 6;
int n, k;
int Pow10[10], F[10];
long long f[N];
long long cal(int n) {
int t = 0;
long long s = 0;
while (n > 0) {
int x = n % 10;
if (x % 3 == 0) s += 1LL * F[t] * x / 3;
n /= 10;
t++;
}
return s;
}
int main() {
ios ::sync... | 22 |
#include <bits/stdc++.h>
const int maxn = 1e6 + 5;
char a[maxn];
long long b[maxn][3];
int main() {
scanf("%s", a);
int len = strlen(a);
for (int i = 0; i < len; i++) {
if (a[i] == 'o')
b[i][0] = 0;
else
b[i][0] = 1;
}
int lw = 0, rw = 0;
for (int i = 1; i < len; i++) {
if (b[i - 1][... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int GOD = 55;
int N, M;
char a[GOD][GOD];
bool good;
bool was[GOD][GOD];
int dirX[] = {0, 0, -1, 1};
int dirY[] = {1, -1, 0, 0};
bool within(int p, int q) { return p >= 0 && q >= 0 && p < N && q < M; }
bool dfs(int x, int y, int px, int py, char c) {
was[x][y] = tru... | 7 |
#include <bits/stdc++.h>
using namespace std;
int a[16];
int main() {
int n, k;
int t, mi, z;
while (~scanf("%d %d", &n, &k)) {
memset(a, 0, sizeof(a));
for (int i = 0; i < n; i++) {
t = 0, mi = 1 << (k - 1);
for (int j = 0; j < k; j++) {
scanf("%d", &z);
t += z * mi;
m... | 7 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int b[m + 1];
b[0] = 0;
for (int i = 1; i <= m; i++) {
cin >> b[i];
b[i] += b[i - 1];
}
for (int i = 0; i < n; i++) {
cout << (a[i] + b[m... | 4 |
#include <bits/stdc++.h>
using namespace std;
void test_case() {
long long n;
scanf("%lld", &n);
priority_queue<int> nums;
for (long long i = 1; i <= n; i++) {
nums.push(i);
}
puts("2");
for (int i = 1; i < n; i++) {
float b = nums.top();
nums.pop();
float a = nums.top();
nums.pop();
... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string a;
getline(cin, a);
for (int i = a.size() - 1; i > -1; i--) {
if (isalpha(a[i])) {
a[i] = toupper(a[i]);
if (a[i] == 'A' or a[i] == 'E' or a[i] == 'I' or a[i] == 'O' or
a[i] == 'U' or a[i] == 'Y') {
cout << "YES";
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int ans = 0, t[n];
for (int i = 0; i < n; i++) scanf("%d", &t[i]), ans += t[i];
for (int i = 2; i <= n / 3; i++)
if (n % i == 0)
for (int j = 0; j < i; j++) {
int s = 0;
for (int k = j; k < n; k += i) ... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, maxi = 0, maxn = 0;
cin >> a >> b >> c >> d;
maxi = max(3 * a / 10, a - a / 250 * c);
maxn = max(3 * b / 10, b - b / 250 * d);
if (maxi > maxn) {
cout << "Misha";
return 0;
} else if (maxi < maxn) {
cout << "Vasya";
r... | 1 |
#include <bits/stdc++.h>
using namespace std;
long long int dp[506][506], dp1[506][506];
long long int n, m;
vector<string> v(506, "mia_melona");
void mia_kalifa() {
for (long long int i = 1; i <= n; i++) {
for (long long int j = 2; j <= m; j++) {
if (v[i][j] == '.') {
if (v[i][j - 1] == '.') {
... | 7 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100 + 17;
int q;
bool check(string s, string t) {
int a[26] = {};
for (auto i : s) a[i - 'a']++;
for (auto i : t) a[i - 'a']--;
bool flag = false;
for (int i = 0; i < 26; i++)
if (a[i] != 0) flag = true;
return flag;
}
int main() {
ios_bas... | 14 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
scanf("%d %d", &n, &m);
int i, x, y, l = 1, r = n;
for (i = 1; i <= m; i++) {
scanf("%d %d", &x, &y);
if (x > y) swap(x, y);
l = max(l, x);
r = min(r, y);
}
cout << max(0, r - l);
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1000
const short N = 505;
short tc, cs = 1;
short n, x, arr[N], dp[N][N][N];
short vis[N][N][N];
short fun(short pos, short prevmx, short curx) {
if (pos > n) return 0;
short &ret = dp[pos][prevmx][curx];
if (vis[pos][prevmx][curx]... | 8 |
#include <bits/stdc++.h>
using namespace std;
const int N = 6005;
int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
int n, x[N], y[N];
int f[N][4][4][4];
long long ans[2];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) cin >> x[i] >> y[i];
for (int i = 1; i <= n; i++)
for (int j = i + 1; j <= n; j+... | 25 |
#include <bits/stdc++.h>
using namespace std;
const int N = 110, M = 1010;
long double dp[N * M], ps[N * M], l_ps[N * M], l_dp[N * M];
int r[N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m, sum = 0;
cin >> n >> m;
if (m == 1) {
cout << 1 << '\n';
return 0;
}
for (int i = 1; i <... | 15 |
#include <bits/stdc++.h>
using namespace std;
const int N = (1 << 18);
long long n, r, all, c[N];
void solve() {
cin >> n >> r;
for (int i = 0; i < (1 << n); ++i) {
cin >> c[i];
all += c[i];
}
cout << setprecision(6) << fixed << all / (long double)(1 << n) << "\n";
for (int i = 0; i < r; ++i) {
lo... | 17 |
#include <bits/stdc++.h>
using namespace std;
const int nn = 1 << 15;
int root[nn];
int d[nn];
int a[nn];
char s[nn];
int n, m;
int one, t;
int getRoot(int u) {
while (root[u] >= 0) u = root[u];
return u;
}
void Union(int u, int v) {
u = getRoot(u);
v = getRoot(v);
if (u == v) return;
t++;
if (v >= m) {
... | 17 |
#include <bits/stdc++.h>
using int64 = long long;
using uchar = unsigned char;
constexpr int mxdg(65536);
constexpr int p(998244353);
constexpr int proot(3);
inline int io() {
static int _;
return scanf("%d", &_), _;
}
namespace math_template {
using Z = int;
using mZ = long long;
template <class _Tp>
inline void s... | 24 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, numofdig;
cin >> n >> numofdig;
long long int counter = 0, arr = 0;
for (long long int i = 0; i < n; i++) {
cin >> arr;
counter += arr + 1;
}
if (counter - 1 == numofdig)
cout << "YES";
else
cout << "NO";
return ... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e2 + 10, M = 2e5 + 100, MOD = 1e9 + 7, MAXN = 1e5 + 10;
const long long inf = 4e18 + 10;
int dp[N][N][30];
vector<pair<int, int> > v[N];
int go(int i, int j, int k) {
if (dp[i][j][k] != 0) return dp[i][j][k];
for (int x = 0; x < (int)v[i].size(); x++) {
... | 9 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void chkmax(T &first, T second) {
first < second ? first = second : T();
}
template <typename T>
void chkmin(T &first, T second) {
first > second ? first = second : T();
}
template <typename T>
void readint(T &first) {
first = 0;
int f = 1;
c... | 20 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5e5 + 1000;
vector<int> adj[MAXN], com[MAXN];
int nxt[MAXN];
bool mark[MAXN];
int n, m;
int fnxt(int x) { return nxt[x] == x ? x : nxt[x] = fnxt(nxt[x]); }
void dfs(int v, int cnt) {
mark[v] = true;
nxt[v] = v + 1;
com[cnt].push_back(v);
for (int i ... | 13 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000100;
const int INF = 1e9 + 10;
const double Pi = acos(-1.0);
const double EPS = 1e-10;
struct Point {
double x, y;
friend Point operator-(Point A, Point B) { return {A.x - B.x, A.y - B.y}; }
friend double operator*(Point A, Point B) { return A.x *... | 12 |
#include <bits/stdc++.h>
using namespace std;
struct seg {
long long l, r, id;
bool operator<(const seg &t) const {
if (r != t.r) return r < t.r;
return l < t.l;
}
};
struct my_pair {
long long first;
int second;
bool operator==(const my_pair &t) const { return (first == t.first); }
bool operator<... | 12 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
reverse(a.begin(), a.end());
for (int c : ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long max = 0;
long long x;
cin >> x;
if (x != 0) {
cout << 1;
return 0;
}
if (n == 1) {
cout << -1;
return 0;
}
for (int i = 1; i < n; i++) {
long long x;
cin >> x;
if (x > max) {
... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 2000 + 5;
const int MAX_E = 100 * 1000 + 5;
vector<pair<long long, long long> > adj[MAX_N], A, B;
long long N, E, K, PA, push_back, P[MAX_N], Sum[MAX_N][MAX_N];
int SZ[MAX_N][MAX_N], SZA, SZB;
vector<long long> DA, DB;
long long ALLSUM, Ans;
pair<long long... | 21 |
#include <bits/stdc++.h>
using namespace std;
int n, l[100105];
long long dp[100105][11], ans = 0;
int c[100105];
char s[100105];
int main() {
scanf("%s", s + 1);
n = (int)strlen(s + 1);
for (int i = 1; i <= n; i++) {
int k = s[i] - '0';
if (k) dp[i][k] = 1;
for (int j = 0; j < 11; j++)
if (dp[i... | 20 |
#include <bits/stdc++.h>
using namespace std;
vector<int> t(500500);
int main() {
int n, k;
scanf("%d %d", &n, &k);
int kk = k;
int cnt = 0;
for (int i = 0; i < int(n); i++) {
scanf("%d", &t[i + 1]);
if (t[i + 1] < 0) cnt++;
}
if (cnt > k)
printf("-1\n");
else {
k -= cnt;
int j = 1;
... | 10 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int k;
cin >> k;
int n[3];
cin >> n[0] >> n[1] >> n[2];
int t[3];
cin >> t[0] >> t[1] >> t[2];
int ans = 0;
int cn[3];
memcpy(cn, n, sizeof(n));
int N = k * (t[0] + t[1] + t[2]);
int sz = 3000;
int evs... | 11 |
#include <bits/stdc++.h>
using namespace std;
int read() {
int x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-') f = -f;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = (x << 3) + (x << 1) + (c ^ 48);
c = getchar();
}
return x * f;
}
void write(int x) {
if ... | 15 |
#include <bits/stdc++.h>
using namespace std;
using lli = long long;
using ld = long double;
using ii = pair<int, int>;
using vi = vector<int>;
using vii = vector<ii>;
const int N = 1e6 + 5;
lli a, b, c, d;
void testCase() {
cin >> a >> b >> c >> d;
cout << abs(a - c) * abs(b - d) + 1 << '\n';
}
int main() {
cin.... | 8 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int minA = 105, maxA = 0, minB = 105;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
minA = min(minA, a);
maxA = max(maxA, a);
}
for (int i = 0; i < m; i++) {
int b;
cin >> b;
minB = min(minB, b);... | 4 |
#include <bits/stdc++.h>
using namespace std;
long long powmod(long long a, long long l, long long md) {
long long res = 1;
while (l) {
if (l & 1) res = res * a % md;
l /= 2;
a = a * a % md;
}
return res;
}
const long long Nmax = 1000005;
const long long INF = 1000000000;
const long long MOD = 10000... | 11 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n, x[N], y[N], a[N], b[N];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d%d", &x[i], &y[i]), a[i] = x[i], b[i] = y[i];
sort(a + 1, a + 1 + n);
sort(b + 1, b + 1 + n);
int mid = 1 + n >> 1;
bool f1 = 0, f2 = 0,... | 23 |
#include <bits/stdc++.h>
using namespace std;
int n;
int a[100], second, b[20][20], r[5], c[5];
inline int calc() {
int res = 0;
memset(r, 0, sizeof(r));
memset(c, 0, sizeof(c));
int d1 = 0, d2 = 0;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
r[i] += b[i][j];
c[j] += b[i][j];... | 7 |
#include <bits/stdc++.h>
using namespace std;
long long nodeS[70], valueS[70];
long long po[70];
int getL(long long x) {
int lvl = 1;
while (x != 1) {
x /= 2;
lvl++;
}
return lvl;
}
int main() {
po[1] = 1;
for (int i = 2; i < 65; i++) {
po[i] = po[i - 1] * 2;
}
int q;
scanf("%d", &q);
fo... | 13 |
#include <bits/stdc++.h>
std::mt19937 rng(
(int)std::chrono::steady_clock::now().time_since_epoch().count());
template <class Info = int, class T = int>
struct ColorUpdate {
public:
struct Range {
Range(T _l = 0) : l(_l) {}
Range(T _l, T _r, Info _v) : l(_l), r(_r), v(_v) {}
T l, r;
Info v;
b... | 24 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.