solution stringlengths 53 181k | difficulty int64 0 13 |
|---|---|
#include <bits/stdc++.h>
using namespace std;
int a, ans;
int main() {
cin >> a;
while (a) {
if (a % 8 == 1) ans++;
a /= 8;
}
cout << ans;
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2 * 100 * 1000 + 10;
long long int dp[MAXN][2];
char solved[MAXN][2];
int a[MAXN];
int n;
long long int solve(int x, int step) {
if (x < 0 || x >= n) return 0;
if (x == 0) return -1;
if (solved[x][step] == 2) return dp[x][step];
if (solved[x][step] ... | 4 |
#include <bits/stdc++.h>
inline int read() {
int data = 0, w = 1;
char ch = getchar();
while (ch != '-' && (ch < '0' || ch > '9')) ch = getchar();
if (ch == '-') w = -1, ch = getchar();
while (ch >= '0' && ch <= '9') data = data * 10 + (ch ^ 48), ch = getchar();
return data * w;
}
const int N(1e5 + 10);
int... | 9 |
#include <bits/stdc++.h>
using namespace std;
int n, a, c[1000005];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a);
c[a]++;
}
int sol = 0, p1 = 1, p2 = 1e6, can = 0;
while (can < n) {
p1++;
p2--;
can += c[p1] + c[p2];
sol++;
}
printf("%d\n", sol);
ret... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int N = 1e5 + 10;
int main() {
int t, n, r;
scanf("%d", &t);
while (t--) {
scanf("%d%d", &n, &r);
r--;
int sum = 0;
for (int i = 0; i < n - 1; i++) {
int x;
scanf("%d", &x);
s... | 8 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[52] = {0}, b[52] = {0};
for (int i = 0; i < n * n; i++) {
int k, l;
cin >> k >> l;
if (a[k] + b[l] == 0) {
cout << i + 1 << " ";
a[k]++;
b[l]++;
}
}
cout << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int l[] = {0, 1, 2, 6, 12, 60, 60};
bool isprime(long long a) {
long long i = 2;
if (a == 2 || a == 3) return true;
if (a % 2 == 0) return false;
for (i++; i * i <= a; i += 2) {
if (a % i == 0) return false;
}
return true;
}
int main() {
long long n;
cin... | 4 |
#include <bits/stdc++.h>
#pragma warning(disable : 4996)
#pragma comment(linker, "/STACK:36777216")
using namespace std;
const int inf = 1000000000;
const int N = 2000000;
int d[8002][8002];
map<int, int> mp;
int transfer[1000005];
inline int getSum(int a, int b) {
int y = transfer[a];
int x = transfer[b];
return... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
struct Song {
int len;
int genre;
};
int const MOD = 1000000007;
int memo[1 << 15][4][226];
int n, t, N;
Song songs[20];
int ans(int bitmask, int sum, int genre) {
int& ret = memo[bitmask][genre][sum];
if (ret !=... | 6 |
#include <bits/stdc++.h>
using namespace std;
template <typename Tp>
inline void read(Tp &x) {
x = 0;
int f = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') f = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + ch - '0';
ch = getchar();
}
x *= f;
}
int buf[42];
temp... | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n;
cin >> n;
long long a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
long long mn = 1e18 + 7;
for (int i = 0; i < n - 1; i++) {
mn = mi... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 4e5 + 50;
int n;
int a[maxn];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
}
for (int i = n; i < 2 * n; ++i) {
a[i] = a[i - n];
}
int ans = 0;
int tmp = 0;
for (int i = 0; i < 2 * n; ++i) {
whil... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long cur[100001];
int c[100001];
vector<pair<int, int> > v[100001];
int main() {
memset(cur, -1, sizeof(cur));
map<int, int> memo;
int n, cnt = 0;
scanf("%d", &n);
for (int i = 1, cc, s; i <= n; i++) {
scanf("%d%d", &cc, &s);
if (!memo.count(cc)) memo... | 4 |
#include <bits/stdc++.h>
using namespace std;
char s[2005][2005];
int n, m, cnt, dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0};
void dfs(int x, int y) {
if (x < 1 || x > n || y < 1 || y > m || s[x][y] != '.') return;
int t = -1, sum = 0;
for (int i = 0; i < 4; i++) {
int tx = x + dx[i];
int ty = y + dy[i];
... | 6 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
void input_vec(std::vector<T> &v, int n) {
for (int i = 0; i < n; i++) {
cin >> v[i];
}
}
template <class T>
void show(vector<T> &v) {
for (T x : v) {
cout << x << " ";
}
cout << endl;
}
void solve() {
int n;
cin >> n;
if (n % 2 ==... | 2 |
#include <bits/stdc++.h>
using namespace std;
vector<pair<long long, long long> > v;
long long n;
double calculate(double x) {
double radius = 0.0;
for (long long i = 0; i < n; i++) {
double xi = v[i].first;
double yi = v[i].second;
radius = max(radius,
abs((1.0 * (xi - x) * (xi - x) + ... | 7 |
#include <bits/stdc++.h>
using namespace std;
long long i, m, ans, k, l, j, q, x, n, ma, mi;
vector<int> v, g;
string s;
int main() {
cin >> s;
n = s.size();
for (i = 0; i < n - 4; i++) {
if (s[i] == 'h' && s[i + 1] == 'e' && s[i + 2] == 'a' && s[i + 3] == 'v' &&
s[i + 4] == 'y') {
v.push_back(i... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100003;
int fa[maxn], p[maxn], n;
bool vis[maxn];
int getfa(int x) { return fa[x] == x ? x : fa[x] = getfa(fa[x]); }
int main() {
cin >> n;
if (n & 1) return puts("-1"), 0;
for (int i = 0, x; i < n; vis[p[i++]] = 1)
if (!vis[x = i * 2 % n])
... | 10 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout.setf(ios_base::fixed);
cout.precision(28);
int n, m;
cin >> n >> m;
if (m == 1) {
cout << 1 << endl;
return 0;
}
vector<vector<long double> > prob(n + 1, vector<long double>(n * ... | 7 |
#include <bits/stdc++.h>
using namespace std;
int get() {
char ch;
while (ch = getchar(), (ch < '0' || ch > '9') && ch != '-')
;
if (ch == '-') {
int s = 0;
while (ch = getchar(), ch >= '0' && ch <= '9') s = s * 10 + ch - '0';
return -s;
}
int s = ch - '0';
while (ch = getchar(), ch >= '0' &... | 11 |
#include <bits/stdc++.h>
using namespace std;
struct nodo {
int pudo, sobro, falto;
} m, res;
char A[1000005];
int izq, der, uso, ctos = 1, pregs, saca;
nodo T[2097160];
void crea(int x, int y, int dnde) {
if (x == y) {
m.pudo = 0;
m.falto = 0;
m.sobro = 0;
if (A[x] == '(') {
m.sobro = 1;
... | 6 |
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef long double ld;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Pair vector<pair<ll,ll>>
#define vec vector <ll>
#define all(a) a.begin(),a.end()
#define mo 100000... | 1 |
#include <bits/stdc++.h>
using namespace std;
map<long long, long long> road;
int main() {
long long q, rule, u, v, w, ans;
cin >> q;
while (q--) {
cin >> rule;
if (rule == 1) {
cin >> u >> v >> w;
while (u != v) {
if (u < v) swap(u, v);
road[u] += w;
u /= 2;
}
... | 3 |
#include <bits/stdc++.h>
using namespace std;
char grid[2005][2005];
int visited[2005][2005], ld[2005][2005], rd[2005][2005];
int n, m;
int ans = 0;
struct compare {
bool operator()(pair<int, pair<int, int> > const &e1,
pair<int, pair<int, int> > const &e2) {
return e1.first > e2.first;
}
};
v... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
long long n, m;
cin >> n >> m;
vector<string> names(n);
for (int i = 0; i < n; i++) cin >> names[i];
long long ans = 1L;
long long M = 1000000007L;
for (int i = 0; i < m; i++) {
vector<char> chars;
for (int j = 0; j < n; j++) chars.pus... | 3 |
#include <bits/stdc++.h>
using namespace std;
int n;
struct edge {
int u, v, next;
} edges[210000 * 2];
int head[210000], nCount = 0;
void AddEdge(int U, int V) {
edges[++nCount].u = U;
edges[nCount].v = V;
edges[nCount].next = head[U];
head[U] = nCount;
}
double f[210000];
int size[210000];
void getsize(int ... | 4 |
#include <bits/stdc++.h>
using namespace std;
class node {
public:
char ch;
int cnt;
bool operator<(const node &s) const { return cnt < s.cnt; }
};
node num[100002];
char str[100002];
string ans;
int main() {
int i = 0, j = 0, len = 0, k = 0;
string s;
scanf("%s", str);
scanf("%d", &k);
len = strlen(st... | 2 |
#include <bits/stdc++.h>
using namespace std;
ofstream fout("test.out");
ifstream fin("test.in");
const long long MX = 4e2 + 100, INF = 1e18, INF2 = -1e18, D = 1e9 + 7,
del = 12641;
long long n, m, arr[MX], cnt, flg, ans, xx[8] = {-1, 0, 1, 1, 1, 0, -1, -1},
yy[8]... | 5 |
#include <bits/stdc++.h>
using namespace std;
int vis[1000005];
double a[1000005];
int main() {
int t;
scanf("%d", &t);
while (t--) {
int num = 0;
int n;
scanf("%d", &n);
int m = 0;
for (int i = 0; i < n; i++) {
int x;
scanf("%d", &x);
vis[x]++;
m = max(m, x);
}
... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int n, k, f[2][810], s[N], ps[N];
vector<int> vec[N];
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= k; i++) {
int x, y;
scanf("%d%d", &x, &y);
vec[y].push_back(x - y + 1);
s[x - y + 1]++;
}
memset(f[0], 0xbf, sizeof(f... | 10 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
void solve() {
long long a, b, c;
cin >> a >> b >> c;
cout << a + b + c - 1 << endl;
}
int main() {
;
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long T = 1;
cin >> T;
while (T--) {
solve();
}
}... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
double p = (a / (double)b), q = (c / (double)d);
cout << p / (1 - (1 - p) * (1 - q)) << "\n";
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
int l[1005], r[1005], t[1005], c[1005];
int ti[105];
int main() {
int n, m, i, j, total = 0;
cin >> n >> m;
for (i = 0; i < 105; i++) ti[i] = 1001;
for (i = 1; i <= m; i++) {
cin >> l[i] >> r[i] >> t[i] >> c[i];
}
for (i = 1; i <= n; i++) {
for (j = 1; j... | 2 |
#include <bits/stdc++.h>
using namespace std;
int n, m, til, a[100005];
class segtree {
public:
int son[2];
double sum, laz, mul;
} c[100005 << 1];
inline int read() {
char ch = getchar();
int ret = 0, f = 1;
while (ch > '9' || ch < '0') {
if (ch == '-') f = -f;
ch = getchar();
}
while (ch >= '0'... | 7 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int hh, mm, H, D, C, N, t = 0;
double s = 0, s1 = 0, s2 = 0, s3 = 0;
cin >> hh >> mm >> H >> D >> C >> N;
if (H % N == 0)
t = H / N;
else
t = H / N + 1;
if (hh >= 20) {
s = t * C * 0.8;
printf("%.4lf", s);
} else {
s1 = t * C;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int N = 110;
int n, q, l, r;
char s[N], z[N];
inline int nxt(int idx, int t) {
idx += t;
while (idx >= l && idx <= r && z[idx] == '0' - 1) idx += t;
return idx;
}
int main() {
scanf("%d %d %s", &n, &q, s + 1);
while (q--) {
scanf("%d %d", &l, &r);
fo... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int k;
cin >> k;
for (int j = 1; j <= k; j++) {
long long n, m;
long long s = 0, p = 1;
cin >> n;
s = n * (n + 1) / 2;
m = floor(log2(n));
p = 1;
for (long i = 1; i <= m + 1; i++) p = p * 2;
cout << s - 2 * (p - 1) << endl;... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 7, mod = 1e9 + 7, inf = 1e5 + 7;
const long long linf = (long long)1e18 + 7;
const long double eps = 1e-15, pi = 3.141592;
const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1},
dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
inline int get_int() {
char x = getch... | 7 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<string> a(n);
vector<vector<bool>> visited(n, vector<bool>(m, false));
for (int i = 0; i < n; i++) {
cin >> a[i];
}
bool flag = true;
for (int i = 1; i < (n - 1); i++) {
bool fg = false;
for (int j = 1... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int imax = INT32_MAX;
const int imin = INT32_MIN;
const int mx = 1e6;
const int mod = 1e9 + 7;
template <class T>
void print(vector<T> vec) {
for (T i : vec) cout << i << " ";
cout << "\n";
}
template <class T>
void alloc(vector<vector<T>*> vec, T n) {
for (auto... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ff first
#define ss second
#define pb push_back
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const int mod = 1e9 + 7;
const int cmod = 998244353;
const int N = 1e5 + 5;
const int inf = 1e16 + 2;
int power(int x... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
long long T = 1, i, j;
while (T--) {
long long n;
cin >> n;
vector<long long> v(n);
for (i = 0; i < n; i++) {
cin >> v[i];
}
long long q;
cin >> q;
... | 4 |
#include <bits/stdc++.h>
using namespace std;
long long int scan() {
long long int t = 0;
char c, ch;
ch = getchar();
if (ch == '-') {
c = getchar();
} else {
c = ch;
}
while (c < '0' || c > '9') {
c = getchar();
}
while (c >= '0' && c <= '9') {
t = (t << 3) + (t << 1) + c - '0';
c... | 3 |
#include <bits/stdc++.h>
using namespace std;
int ch[500005][26], cnt[500005], fail[500005], nxt[500005];
bool ed[500005];
int tot;
int pos_to_ed[500005], v[500005], mx[500005];
multiset<int> mp[500005];
inline void insert(string x, int pos) {
int p = 0;
for (int i = 0; i < x.length(); ++i) {
int t = x[i] - 'a'... | 9 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using Graph = vector<vector<long long>>;
con... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int i, j, k, l, pos, temp, temp1, ans = 0;
string str;
vector<long long int> v;
cin >> str;
l = str.length();
for (i = 0; i < str.length(); i++) {
if (str[i] == '@') v.push_back(i);
}
for (i = 0; i < v.size(); i++) {
pos = v[i]... | 5 |
#include <bits/stdc++.h>
using namespace std;
vector<int> tree[100005];
int cat[100005];
bool vis[100005];
int n, m, ans = 0;
void dfs(int root, int num) {
vis[root] = true;
if (cat[root])
num++;
else
num = 0;
if (num > m) return;
if (tree[root].size() == 1 && vis[tree[root][0]]) {
ans++;
retu... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 105;
int t;
int n, m;
int d[N], h[N];
int main() {
cin >> t;
for (int tc = 0; tc < t; ++tc) {
cin >> n >> m;
int maxDH = -2e9;
for (int i = 0; i < n; ++i) {
cin >> d[i] >> h[i];
maxDH = max(maxDH, d[i] - h[i]);
}
int res = 1... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
if (k <= 2) {
cout << 0 << endl;
return 0;
}
long long s = k / 2 + 1;
if (n < s) {
cout << 0 << endl;
} else {
cout << min(k - 1, n) - s + 1 << endl;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, i, j, k;
cin >> n;
if (n <= 9) {
cout << "1" << endl;
cout << n;
} else {
cout << n << endl;
for (i = 1; i <= n; i++)
cout << "1"
<< " ";
}
}
| 0 |
#include <bits/stdc++.h>
int main() {
int n, k, ar[1000], i, count = 0, lo = 0, sum = 0;
scanf("%d %d", &n, &k);
for (i = 0; i < n; i++) {
scanf("%d", &ar[i]);
}
for (i = 0; i < n; i++) {
if (ar[i] <= k)
count++;
else
break;
}
for (i = n - 1; i >= 0; i--) {
if (ar[i] <= k)
... | 0 |
#include <bits/stdc++.h>
using namespace std;
string str;
int main() {
getline(cin, str);
int _at = 0;
for (int i = 1; i < str.length(); i++) {
if (str[i] == 'a' && str[i + 1] == 't' && _at == 0) {
_at = 1;
str[i] = '@';
str[i + 1] = '^';
}
if (str[i] == 'd' && str[i + 1] == 'o' && s... | 2 |
#include <bits/stdc++.h>
long a1, b1, a2, b2, a3, b3;
int Test() {
scanf("%ld%ld%ld%ld%ld%ld", &a1, &b1, &a2, &b2, &a3, &b3);
if (a2 + a3 <= a1 && b2 <= b1 && b3 <= b1) return 1;
if (a2 + a3 <= b1 && b2 <= a1 && b3 <= a1) return 1;
if (a2 + b3 <= a1 && b2 <= b1 && a3 <= b1) return 1;
if (a2 + b3 <= b1 && b2 <... | 2 |
#include <bits/stdc++.h>
using namespace std;
inline void PrintArrInt(int arr[], int s, int e) {
for (int i = (s); i <= (e); i++) printf("%d%c", arr[i], i == e ? '\n' : ' ');
}
const int maxn = 100000 + 5;
char str[maxn];
char ans[maxn][20];
char sta[maxn], dsta[maxn];
int top = 0, dtop = 0, alen[maxn], ista[maxn];
i... | 9 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T POW(T B, T printf) {
if (printf == 0) return 1;
if (printf & 1)
return B * POW(B, printf - 1);
else
return (POW(B, printf / 2) * POW(B, printf / 2));
}
template <typename T>
T BIGMOD(T b, T p, T m) {
if (p == 0)
return 1;
else i... | 0 |
#include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define ull unsigned long long
#define mp make_pair
#define si short int
#define speed ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define pill pair<ll,ll>
#define f first
#define s second
#define pilc pair<ll,char>
#define all(a) (a).begin(),(a... | 6 |
#include <bits/stdc++.h>
using namespace std;
int a[1234567];
int w[1234567];
int main() {
int n, m, q, i;
while (scanf("%d%d", &n, &m) != EOF) {
int k = 0;
memset(a, 0, sizeof(a));
for (i = 0; i < n; i++) {
scanf("%d", &q);
if (q < 1234560) a[q] = 1;
}
i = 1;
while (1) {
i... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000 + 7;
const long long LL_INF = 1ll * INF * INF;
const int MAX_N = 50 + 7;
template <typename T>
inline void addmod(T& a, const long long& b, const int& MOD = INF) {
a = (a + b) % MOD;
if (a < 0) a += MOD;
}
int n;
vector<int> adj[MAX_N];
double... | 10 |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 5;
int type[MAX], val[MAX], tim[MAX];
set<int> help;
map<int, int> mp;
map<int, int> bit[MAX];
void add(int ind, int v) {
while (ind < MAX) {
bit[ind][v]++;
ind += (ind & (-ind));
}
}
void remove(int ind, int v) {
while (ind < MAX) {
... | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long double x, y;
cin >> x >> y;
if (x == y) {
cout << "=";
return 0;
}
long double ans1;
ans1 = y * log(x);
long double ans2;
ans2 = x * log(y);
if (ans1 == ans2) {
cout << "=";
} else if (ans1 > ans2) {
cout << ">";
} els... | 1 |
/*
差不多得了 [流汗黄豆]
*/
// 392699
#include <bits/stdc++.h>
#define min(a, b) ((a) < (b) ? (a) : (b))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define int long long
// using namespace std;
template<class T> void fr(T &a, bool f = 0, char ch = getchar()) {
for (a = 0; ch < '0' || ch > '9'; ch = getchar()) ch ==... | 7 |
#include <bits/stdc++.h>
using namespace std;
void ff() {
std::ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
}
void in_out_txt() {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
bool palindrome(string str) {
string s;
s = str;
reverse(s.begin(), s.end());
if (st... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100;
int n;
long long ai[maxn + 2], lim;
inline long long Ceil(long long a, long long b) {
if (a % b) return a / b + 1;
return a / b;
}
long long FindNext(long long a, long long d) {
if (a < d) return lim;
long long now = Ceil(a, d), res;
if (a % ... | 7 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 400005;
const long long mod = 1e9 + 7;
const long long INF = 1e18;
const double eps = 1e-9;
int q, op, cnt;
long long a, b, last;
long long w[maxn], sum[maxn][25];
int fa[maxn][25];
void add(int u, int val) {
w[++cnt] = val;
if (w[cnt] <= w[u])
fa[c... | 7 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
;
long long res = 0;
long long x, hh, h;
cin >> hh;
;
multiset<long long> ms;
bool stop = false;
for (int i = 0; i < n; i++) {
h = hh;
cin >> x;
if (stop) continue;
ms.insert(x);
long long l = 0;
for ... | 2 |
#include <bits/stdc++.h>
using namespace std;
int dis[60][60][2];
long long ans[60][60][2];
bool inque[60][60][2];
int n, k, f, t;
const int inf = 1e6;
const int mod = 1000000007;
pair<pair<int, int>, int> make_pair(int x, int y, int i) {
return make_pair(make_pair(x, y), i);
}
int c[60][60];
int C(int n, int m) {
... | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) {
int a = 0, b = 0, res = 0;
int n;
cin >> n;
int x[n];
for (int i = 0; i < n; i++) {
cin >> x[i];
if (x[i] == 0) b++;
a += x[i]... | 0 |
#include <bits/stdc++.h>
using namespace std;
char a;
int a1, a2;
int main() {
while (1) {
scanf("%c", &a);
if (a == '-') a1++;
if (a == 'o') a2++;
if (a == '\n') break;
}
if (a1 == 0 || a2 == 0)
printf("YES\n");
else if (a1 % a2 == 0)
printf("YES\n");
else
printf("NO\n");
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
long long exp(long long taban, long long us) {
if (us < 0) return 0;
long long carpan = taban % 1000000007;
long long temp = us;
long long res = 1;
while (temp) {
if (temp % 2) res = (res * carpan) % 1000000007;
temp /= 2;
carpan = (carpan * carpan) % ... | 4 |
#include <bits/stdc++.h>
using namespace std;
long long power(long long b, long long e) {
if (e == 0) return 1;
if (e & 1) return b * power(b * b, e / 2);
return power(b * b, e / 2);
}
long long gcd(long long a, long long b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
bool isPrime(long long n) {... | 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, k;
cin >> n >> k;
long long x, a[n + 1];
long long ans, mi = 1000000000;
a[0] = 0;
for (long long i = 1; i <= n; i++) {
cin >> x;
a[i] = a[i - 1] + x;
if (i >= k &... | 1 |
#include <bits/stdc++.h>
using namespace std;
char s[1000005];
int main() {
int i, j, len, t, now;
scanf("%s", s);
len = strlen(s);
i = 0;
int r1, r2;
while (i < len) {
t = i;
i++;
j = 1;
while (i < len && s[i] == '0') i++, j++;
if (j > t)
now = 1;
else if (j == t) {
for ... | 4 |
#include <bits/stdc++.h>
int main() {
float x;
scanf("%f", &x);
printf("%.0f", ceil(x / 5));
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int maxC = 999999999;
string s, t;
int n, k, res, x, y, cost[505][505], f[505][505], g[505][505];
int cal(int x, int y) {
int len = y - x + 1, res = 0;
for (int i = 0; i < len / 2; i++)
if (s[x + i] != s[y - i]) res++;
return res;
}
void compute_cost() {
f... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int maxb = 22;
const int maxn = (1 << maxb) + 10;
int topol[maxn], sz, n, color[maxn], c = 1;
bool is[maxn], visited[maxn];
void dfs(int v) {
visited[v] = 1;
int sm = (1 << n) - 1 - v;
if (is[v] && !visited[sm]) dfs(sm);
for (int i = 0; i < n; i++)
if ((((... | 8 |
#include <bits/stdc++.h>
using namespace std;
map<int, pair<int, int>> m;
int x, y;
pair<int, int> p, q;
vector<int> v;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a[6] = {4, 8, 15, 16, 23, 42};
for (int i = 0; i < 6; i++) {
for (int j = i + 1; j < 6; j++) {
m[a[i] * a[j]] = {a[i... | 3 |
#include <bits/stdc++.h>
using namespace std;
inline long long read() {
long long ans = 0, w = 1;
char c = getchar();
while (!isdigit(c) && c != '-') c = getchar();
if (c == '-') w = -1, c = getchar();
while (isdigit(c)) ans = (ans << 1) + (ans << 3) + c - '0', c = getchar();
return ans * w;
}
long long sum... | 8 |
#include <bits/stdc++.h>
using namespace std;
const int nax = 3e5;
vector<int> node[nax];
int dist[nax], par[nax];
int main() {
int n, m;
cin >> n >> m;
set<pair<int, int>> edges;
while (m--) {
int a, b;
cin >> a >> b;
a--, b--;
edges.insert({a, b});
edges.insert({b, a});
node[a].push_ba... | 9 |
#include <bits/stdc++.h>
using namespace std;
int days[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
bool check(string in) {
if (in[2] != '-' || in[5] != '-') return false;
int d = 0, m = 0, y = 0;
for (int ctr1 = 0; ctr1 < 10; ctr1++) {
if (ctr1 == 2) {
d = y;
y = 0;
continue;
... | 4 |
#include <bits/stdc++.h>
using namespace std;
int n, a[100009], cre[100009], prec[100009];
set<int> s, setr_2;
multiset<int> set_1;
int main() {
cin >> n;
for (int i = 0; i < n; i++) set_1.insert(0);
if (n <= 2) {
cout << n << endl;
return 0;
}
int res = 0;
for (int i = 0; i < n; i++) {
scanf("%... | 4 |
#include <bits/stdc++.h>
using namespace std;
int P = 998244353;
int main() {
int N, K;
cin >> N >> K;
if (K == 1) {
cout << 0;
return 0;
}
int f[501] = {0};
for (int n = 1; n <= N; n++) {
int g[501] = {0};
g[0] = 1;
for (int i = 1; i <= N; i++)
for (int len = 1; len <= i && len <=... | 6 |
#include <bits/stdc++.h>
using namespace std;
int sum[1000100];
int main() {
string a, b;
cin >> a >> b;
int cnt = 0;
for (int i = 0; i < b.size(); i++) {
if (b[i] == '1') cnt++;
}
sum[0] = a[0] - '0';
for (int i = 1; i < a.size(); i++) {
sum[i] = sum[i - 1] + a[i] - '0';
}
int l = 0, r = b.si... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, b;
cin >> n >> b;
int a[n];
for (int i = 0; i < n; i++) cin >> a[i];
vector<int> v;
v.push_back(b);
for (int i = 0; i < n - 1; i++) {
int flag = 0, max = a[i];
for (int j = i + 1; j < n; j++) {
if (a[j] > max) {
flag =... | 3 |
#include <bits/stdc++.h>
constexpr auto INF = 9223372036854775807;
using namespace std;
auto seed = chrono::high_resolution_clock::now().time_since_epoch().count();
mt19937 mt(seed);
int myrand(int mod) { return mt() % mod; }
inline long long int gcd(long long int a, long long int b) {
if (b == 0) return a;
return ... | 4 |
#include <bits/stdc++.h>
using namespace std;
long long myabs(long long xx) { return max(xx, -xx); }
int main() {
int n, m, q;
scanf("%d%d%d", &n, &m, &q);
long long sa = 0;
for (int i = 0; i < n; i++) {
int tmp;
scanf("%d", &tmp);
if (i % 2)
sa += tmp;
else
sa -= tmp;
}
vector<l... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int M = 1e5;
const int Q = 1e9 + 7;
priority_queue<long long> heap;
int main() {
srand(time(NULL));
int i, n, k;
scanf("%d", &n);
scanf("%d", &k);
for (i = 0; i < k; i++) heap.push(0);
for (i = 0; i < n; i++) {
long long s, m;
scanf(
"%lld"... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e4 + 15, M = 6e5 + 15, OO = 1e6 + 3;
int n, t, ss;
string in, in2, in3;
int cnt[27];
list<int> adj[N];
list<int>::iterator it;
int MOD(int a, int b) {
a %= b;
if (a < 0) a += b;
return a;
}
int main() {
cin >> in3;
n = in3.size();
for (int i = 0; ... | 7 |
#include <bits/stdc++.h>
const int MAXN = 100010;
int n, m, S;
long long T;
int to[40][MAXN];
int dp[2][MAXN];
void predo() {
int *now = dp[0], *lst = dp[1];
for (int i = 0; i < n; ++i) now[i] = i;
for (int i = 1, t; i < n; ++i) {
std::swap(lst, now);
t = std::min(n - i, m);
memcpy(now, lst + i, t << ... | 10 |
#include <bits/stdc++.h>
using namespace std;
int k;
int call(int n) {
if (n == 0) return 0;
if (n == 1) return 1;
if (k % 2 == 0) {
if (n == 2) return 2;
if (n % 2) return 0;
return 1;
} else {
if (n == 3) return 1;
if (n % 2) return 0;
int ans[50] = {0};
ans[call(n - 1)] = 1;
a... | 7 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 5e5 + 10;
const long long inf = 1e18;
int n, q;
int p[maxn];
int w[maxn];
vector<int> G[maxn];
vector<int> Q[maxn];
int id[maxn];
int out[maxn];
int rev[maxn];
int tim;
long long init[maxn];
int v[maxn];
int l[maxn];
int r[maxn];
long long ans[maxn];
long l... | 9 |
#include <bits/stdc++.h>
using namespace std;
int cnts[256];
int main() {
string a, b;
cin >> a >> b;
while (b.size() < a.size()) b += ' ';
int n = a.size();
for (int i = 0; i < n; i++) cnts[a[i]]++;
string pref = "";
for (int i = 0; i < n; i++) {
bool prefdone = (pref > b.substr(0, i));
if (prefd... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
const int inf = 1e9;
int gi() {
int x = 0, o = 1;
char ch = getchar();
while ((ch < '0' || ch > '9') && ch != '-') ch = getchar();
if (ch == '-') o = -1, ch = getchar();
while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
... | 12 |
#include <bits/stdc++.h>
using namespace std;
int dp1[1000 + 10][1000 + 10] = {0};
int dp2[1000 + 10][1000 + 10] = {0};
int dp3[1000 + 10][1000 + 10] = {0};
int dp4[1000 + 10][1000 + 10] = {0};
int a[1000 + 10][1000 + 10];
int m, n;
int main() {
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++) {
for (int j ... | 4 |
#include <bits/stdc++.h>
using namespace std;
map<int, int> vis;
const int MAX = 100100;
int m, n, a[MAX], is[MAX * 2];
long long inv(long long a, long long m) {
if (a == 1) return 1;
return inv(m % a, m) * (m - m / a) % m;
}
int main(void) {
scanf("%d%d", &m, &n);
for (int i = 0; i < n; i++) scanf("%d", &a[i])... | 9 |
#include <bits/stdc++.h>
using namespace std;
long long n;
long long p[200010];
long long dp[200010];
long long exgcd(long long a, long long b, long long &x, long long &y) {
if (b == 0) {
x = 1, y = 0;
return a;
}
long long ret = exgcd(b, a % b, y, x);
y -= a / b * x;
return ret;
}
long long getInv(lo... | 6 |
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, s;
cin >> n >> s;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int flag = 0;
if (a[s] != 0) {
flag++;
a[s] = 0;
}
vector<int> cnt(n + 1);
for (int... | 5 |
#include <bits/stdc++.h>
using namespace std;
int n;
string s;
bool flag = true;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
cin.ignore();
getline(cin, s);
s = "0" + s + "0";
for (int i = 1; i <= n && flag; i++) {
if (s[i - 1] == s[i] && s[i] == s[i + 1] && s[i] == '0') flag = false;
... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int v1, v2;
int t, d;
cin >> v1 >> v2;
cin >> t >> d;
if (d == 0) {
cout << v1 * t << endl;
return 0;
}
if (v1 > v2) {
int temp = v1;
v1 = v2;
v2 = temp;
}
vector<int> ivector1, ivector2;
for (int i = 0; i < t; ++i) {
... | 3 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
using namespace std;
void solve() {
{
string s;
cin >> s;
int k = (int)s.size();
k--;
while (k % 2) {
k--;
}
string curans = string(k, '9');
k = (int)s.size();
if (k % 2) {
cout << curans << ... | 7 |
#include <bits/stdc++.h>
using namespace std;
template <typename A>
ostream& operator<<(ostream& cout, vector<A> const& v);
template <typename A, typename B>
ostream& operator<<(ostream& cout, pair<A, B> const& p) {
return cout << "(" << p.first << ", " << p.second << ")";
}
template <typename A>
ostream& operator<<(... | 10 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.