solution stringlengths 52 181k | difficulty int64 0 6 |
|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c;
cin >> n >> a >> b >> c;
int ans = 0;
for (int i = 0; i <= min(a, 2 * n); i += 2) {
for (int j = 0; j <= min(b, n - i / 2); ++j) {
int k = min(c, (n - i / 2 - j) / 2);
if (i / 2 + j + 2 * k == n) ans++;
}
}
cout <... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
if (n == 1) {
if (k > 0) {
cout << 0 << endl;
} else {
cout << s << endl;
}
return 0;
}
if (s[0] != '1' && k > 0) {
s[0] = '1';
k--;
}
for (int i = 1; i < s.size(... | 2 |
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const long long infinity = (1000000000 + 11);
void solve() {}
void Task() {
int test;
cin >> test;
for (int i = 1; i <= test; i++) {
solve();
}
}
bool isnum(string str) {
if ((str[0] == '0' && str.size() != 1) || str.size() == 0) {
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int n, k;
vector<int> a;
vector<int> b;
void solve() {
int ans = 0;
for (int i = 0; i <= k; i++) {
int left = b[i], right = b[i + 1];
if (a[left] > a[right]) {
cout << -1;
return;
}
vector<int> lis(0);
for (int j = left + 1; j < right; j+... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int n, q, a[N], tag[N << 2], mn[N << 2], mx[N << 2];
long long sum[N << 2];
void up(int x) {
sum[x] = sum[(x << 1)] + sum[(x << 1 | 1)];
mn[x] = min(mn[(x << 1)], mn[(x << 1 | 1)]);
mx[x] = max(mx[(x << 1)], mx[(x << 1 | 1)]);
}
void cov(int x,... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A[3];
for(int i=0;i<3;i++) cin>>A[i];
sort(A,A+3);
cout<<((A[0]==A[1])?A[2]:A[0])<<endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
vector<int> v[N];
int n, m, p[N], pre[N];
int f(int x) { return pre[x] == x ? x : pre[x] = f(pre[x]); }
signed main() {
scanf("%d %d", &n, &m);
for (register int i = (1); i <= (m); ++i) pre[i] = i;
int ans = n - 1;
for (register int i = (1); ... | 5 |
#include <bits/stdc++.h>
using namespace std;
int a[] = {1, 2, 4, 3};
int b[] = {1, 3, 4, 2};
int c[] = {1, 4, 1, 4};
int d[] = {1, 1, 1, 1};
int main() {
string s;
cin >> s;
int n = s.length();
int rem = 0;
for (int i = 0; i < n; i++) {
rem = (rem * 10 + s[i] - '0') % 4;
}
int ans = a[rem] + b[rem] +... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100000;
const int inf = (int)1e9 + 1;
const long long big = (long long)1e18 + 1;
const int P = 239;
const int MOD = (int)1e9 + 7;
const int MOD1 = (int)1e9 + 9;
const double eps = 1e-9;
const double pi = atan2(0, -1);
const int ABC = 26;
string a[N];
int cnt[N... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
if (!(cin >> N)) return 1;
vector<char> used(1001, 0);
vector<int> V(N, 0);
vector<vector<int> > E(N, vector<int>(N, 0));
for (int i = 0; i < int(3); ++i) V[i] = i;
for (int i = 0; i < int(3); ++i)
for (int j = 0; j < int(i); ++j)
... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, c;
cin >> a >> c;
int ans = 0;
int b[a][c];
vector<int> m1, m2;
for (int i = 0; i < a; i++) {
int k = 0;
for (int t = 0; t < c; t++) {
int temp;
cin >> temp;
b[i][t] = temp;
if (temp == 1) {
k++;
... | 2 |
#include <bits/stdc++.h>
using namespace std;
int i,j,k,n,m,x,y,t,a[100010];
int main(){
scanf("%d",&n);for (i=1;i<=n;i++)scanf("%d",&a[i]);
sort(a+1,a+1+n,greater<int>());
while (a[t]>=t)t++;t--;
if ((a[t]-t)%2==0){
j=0;
for (;a[t+j]>=t;j++);
if (j%2==1)printf("Second\n");
else printf("First\n");
}
else ... | 0 |
#include<iostream>
using namespace std;
#define int long long
signed main(){
int t;
cin>>t;
while(t--){
int n,m;
cin>>n>>m;
int a[n+10];
int b[n+10];
for(int i=1;i<=n;++i)
cin>>a[i];
for(int i=1;i<n;++i)
cin>>b[i];
int mind=10000000000000;
int day=0;
int money=0;
for(int i=1;i<n;++i){
mi... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int V = 300100;
struct Node {
int l, r, s;
} tr[4 * V];
void init(int id, int l, int r) {
tr[id].l = l;
tr[id].r = r;
tr[id].s = 0;
if (l == r) return;
int mid = (l + r) / 2;
init(id * 2, l, mid);
init(id * 2 + 1, mid + 1, r);
}
void update(int id, int... | 2 |
#include <bits/stdc++.h>
using namespace std;
using namespace std;
const int maxn = 200010;
int n, m, q, cnt, top, tim, now, x, y;
int lst[maxn], dfn[maxn], low[maxn];
int ss[maxn], bel[maxn];
int c[maxn], tot;
int dep[maxn], fa[maxn][20];
int f[maxn], g[maxn];
bool vis[maxn], ins[maxn];
struct edge {
int to, nxt;
} ... | 5 |
#include <bits/stdc++.h>
#define INF (2e9)
#define FOR(i, a, b) for (ll (i) = (a); (i) < (b); ++(i))
#define REP(i, n) FOR(i, 0, n)
using namespace std;
template<class T>
bool chmax(T& a, const T& b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template<class T>
bool chmin(T& a, ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
int n, m;
cin >> n;
vector<pair<int, int> > v1(n + 1);
for (int i = 1; i <= n; i++) {
cin >> v1[i].first >> v1[i].second;
}
cin >> m;
vector<pair<int, int> > v2(m + 1);
for ... | 2 |
#include <bits/stdc++.h>
#define range(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i, a) range(i, 0, a)
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector <int> p(n, -1);
rep (i, k) {
int a, b;
cin >> a >> b;
p[--a] = --b;
}
vector <vector <vector ... | 0 |
#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(nam... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int _ = 2e5 + 5, yl = 1e9 + 7;
int n, rt, siz[_], ch[3][_], f[_], g[_], d[_], cnt;
vector<int> e[_];
long long F(int x);
long long G(int x, int y);
long long F(int x) {
if (x == 0) return 1;
if (siz[x] & 1) return 0;
if (!g[x]) return siz[x] / 2;
if (f[x] != -... | 5 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loo... | 0 |
#include <iostream>
#include <cstring>
using namespace std;
#define MOD 1000000LL
typedef unsigned long long ll;
int n;
ll dp[1002];
string s[1002];
string utf[4][4] = {
{"0xxxxxxx","","",""},
{"110yyyyx","10xxxxxx","",""},
{"1110yyyy","10yxxxxx","10xxxxxx",""},
{"11110yyy","10yyxxxx","10xxxxxx","10xxxxxx"}
};
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int test;
int n, a, b;
int t[200007];
map<int, int> m;
map<int, int> nr;
vector<int> g[200007], G[200007];
bitset<200007> czy;
stack<int> s;
int w[200007];
void dfs(int v) {
czy[v] = 1;
for (int i = 0; i < (G[v].size()); ++i) {
int u = G[v][i];
if (!czy[u]) dfs(... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 3;
int n, m, dp[N], vis[2][N];
vector<int> adj[2][N];
vector<pair<int, int>> e;
void dfs(int u, int dir) {
vis[dir][u] = 1;
for (int v : adj[dir][u])
if (!vis[dir][v]) dfs(v, dir);
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.t... | 5 |
#include <bits/stdc++.h>
using namespace std;
void readfile() {
ios_base ::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
const long long nmax = (long long)5e5 + 20;
long long n;
map<long long, long long> has;
vector<long long> nums;
map<long long, long long> pows;
void pre() {
long long p = 1;
for (long ... | 5 |
#include <bits/stdc++.h>
const long long mod = 1e9 + 7;
using namespace std;
void test_case() {
int n, m, k;
cin >> n >> m >> k;
vector<vector<char>> table(n, vector<char>(m, '0'));
int horizontal = 0;
if (n % 2 == 1) horizontal = m / 2;
int max_h = n * (m / 2);
if (max_h < k)
cout << "NO\n";
else i... | 4 |
#include <bits/stdc++.h>
using namespace std;
int n, k, m;
double ans[100006], f[1 << 20 + 4];
double a[100006], eps = 1e-12;
int read() {
int x = 0, c;
while (!isdigit(c = getchar()))
;
while (x = x * 10 + c - '0', isdigit(c = getchar()))
;
return x;
}
int main() {
n = read();
k = read();
m = n;
... | 5 |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int f = 1, x = 0;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-') f = -1;
c = getchar();
}
while (c >= '0' && c <= '9')
x = (x << 3) + (x << 1) + (c ^ '0'), c = getchar();
return f * x;
}
const int N = 2e6 + 520;
in... | 3 |
#include <bits/stdc++.h>
using namespace std;
void codeforces_463_A() {
char c[1001];
scanf("%s", c);
for (int i = 0; i < strlen(c); i++) {
printf("%c", c[i]);
}
for (int i = 0; i < strlen(c); i++) {
printf("%c", c[strlen(c) - 1 - i]);
}
}
void codeforces_463_B() {
int n;
cin >> n;
int b[10000... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 1;
int n;
char olimp[20];
int main() {
scanf("%d\n", &n);
while (n--) {
scanf("IAO'%s\n", olimp);
int len = strlen(olimp);
int year = atoi(olimp);
int ten = 10, first = 0;
for (int i = 1; i < len; i++) {
first += ten;
... | 2 |
#include <bits/stdc++.h>
using namespace std;
long long a, b, x, y, z;
int main() {
cin >> a >> b;
cin >> x >> y >> z;
long long numY = x * 2;
long long numB = y;
numY += y;
numB += 3 * z;
cout << max(0LL, numB - b) + max(0LL, numY - a) << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int days[20] = {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}, in[10];
int getint(string s, int &now) {
int o = 0;
for (; now < s.size() && s[now] >= '0' && s[now] <= '9'; now++)
o = o * 10 + (s[now] - '0');
return o;
}
int main() {
int n, m, now = 0;
boo... | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> m >> n;
vector<long long> v;
long long x;
for (long long i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
}
sort(v.begin(), v.end());
long long dp = INT_MAX;
for (long long i = 0; i <= n - m; i++) {
dp = min(dp... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x[6];
for (int i = 0; i < 6; i++) scanf("%d", x + i);
for (int i = 0; i < 3; i++)
if (x[i] == x[i + 3]) {
puts("YES");
return 0;
}
puts("NO");
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
char s[5005];
int nxt[5005][26];
int dp[5005][5005];
const int MOD = 1e9 + 7;
void add(int &x, int v) {
x += v;
if (x >= MOD) x -= MOD;
}
int main(void) {
int n;
scanf("%d", &n);
scanf("%s", s + 1);
int p[26] = {};
for (int i = 0; i < 26; i++) p[i] = n + 1;
... | 4 |
#include <bits/stdc++.h>
using namespace std;
long long int powe(long long int x, long long int y) {
long long int res = 1;
while (y > 0) {
if (y & 1) {
res = (res * x) % 1000000007;
}
y = y >> 1;
x = (x * x) % 1000000007;
}
return res % 1000000007;
}
long long int p[10000001][2], ans[1000... | 3 |
#include<bits/stdc++.h>
using namespace std;
const int N = 5020;
const int mod=1e9+7;
typedef long long ll;
inline int add(int a,int b){a+=b;return a>=mod?a-mod:a;}
inline int sub(int a,int b){a-=b;return a<0?a+mod:a;}
inline int mul(int a,int b){return 1ll*a*b%mod;}
inline int qpow(int a,int b){int ret=1;for(;b;b>>=1,... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
long long a[N], s[N];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%I64d", &a[i]);
}
sort(a + 1, a + n + 1);
for (int i = 1; i <= n; i++) {
s[i] = s[i - 1] + a[i];
}
long long mx = 0;
for (int i =... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, v = 0, i;
cin >> n;
string s;
for (i = 0; i < n; i++) {
cin >> s;
if (s == "++X") {
++v;
} else if (s == "X++") {
v++;
} else if (s == "--X") {
--v;
} else if (s == "X--") {
v--;
}
}
cout << v;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
long long n, l, r, dp[200005][3], p[3];
const long long modu = 1000000007;
int main() {
scanf("%lld%lld%lld", &n, &l, &r);
while (l % 3 != 0) ++p[l % 3], ++l;
while (r % 3 != 0) ++p[r % 3], --r;
p[0] = p[0] + 1 + (r - l) / 3;
p[1] = p[1] + (r - l) / 3;
p[2] = p[... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
long long int fast_exp(int b, int p) {
if (p == 0) return 1LL;
if (p & 1) return (1LL * b * fast_exp(b, p - 1)) % mod;
return fast_exp((1LL * b * b) % mod, p / 2);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
st... | 2 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n, a, i;
priority_queue<int, vector<int>, greater<int>> p;
vector<string> v;
string s;
cin >> n;
while (n--) {
cin >> s;
if (s != "removeMin") cin >> a;
if (s == "insert") {
v.push_back(s + " " + to_string(a));
p.... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 500005;
int ar[MAXN];
stack<int> stk;
int nid[MAXN];
int nxt[MAXN];
int instk[MAXN];
vector<int> ans;
map<int, int> table;
int cnt = 0;
int n;
int find(int pos) {
map<int, int> nxt;
map<int, int> instk;
while (stk.size()) {
stk.pop();
}
for (i... | 5 |
#include <bits/stdc++.h>
const int N = 300005;
struct Node {
int l, r, x;
} a[N];
int tree[N << 2], lazy[N << 2];
void init() {
memset(tree, 0, sizeof(tree));
memset(lazy, -1, sizeof(lazy));
}
void pushdown(int now) {
if (lazy[now] == -1) return;
tree[now << 1] = tree[now << 1 | 1] = lazy[now << 1] = lazy[now... | 1 |
#include <bits/stdc++.h>
using namespace std;
using lli = long long;
const lli OO = 1e18;
void fast() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
lli di[8] = {-1, 1, 0, 0, -1, 1, -1, 1};
lli dj[8] = {0, 0, -1, 1, 1, 1, -1, -1};
lli frq[100001 + 7];
string ys = "YES", no = "NO";
vector<vector<lli>> a... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
const int PR = 3;
int gr[105][8192], vgr[105][8192];
int dp[105][8192], vdp[105][8192];
int perm[105][2][105];
int power(int x, int t) {
t %= MOD - 1;
t += t < 0 ? MOD - 1 : 0;
int ret = 1;
while (t > 0) {
if (t & 1) ret = 1LL * ret * ... | 6 |
#include <bits/stdc++.h>
using namespace std;
long long h[100005], a, r, m, s[100005];
int n;
long long solve(long long cur) {
int l = 1, rr = n;
while (l < rr) {
int mid = (l + rr) / 2;
if (h[mid] < cur)
l = mid + 1;
else
rr = mid;
}
long long miss = cur * ((long long)l - 1) - s[l - 1];... | 5 |
#include <bits/stdc++.h>
int main(void) {
int h;
scanf("%d", &h);
char str[256];
scanf("%s", &str);
int x = 0, X = 0;
for (int i = 0; i < h; i++) {
if (str[i] == 'x') {
x++;
} else {
X++;
}
}
int d = X - x, t = 0;
for (int i = 0; i < h; i++) {
if (str[i] == 'x') {
if ... | 1 |
#include<iostream>
#include<vector>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
struct BIT{
int siz;
vector<int> node;
BIT(int n){
siz = n;
node.resize(siz+1, 0);
}
int query(int i){
int ret = 0;
while(i > 0){
ret += node[i];
... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int cnt[105];
int dp[105][80];
int main(){
int n;
cin>>n;
rep(i,105)cnt[i]=1;
for(int i=1; i<=n; ++i){
int x=i;
for(int j=2; j*j<=x; ++j){
... | 0 |
#include <bits/stdc++.h>
using namespace std;
bool dp[51 * 10001];
int main() {
int n, d, x, cnt = 0, sum = 0, w = 0;
cin >> n >> d;
dp[0] = 1;
for (int i = 0; i < n; i++) {
cin >> x;
for (int j = (sum += x); j >= x; j--) {
if (dp[j - x]) dp[j] = true;
}
}
while (true) {
int j = w + d;... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int socks = n, ans = 0;
for (int i = 1; i <= 1000000; i++) {
if (i % m == 0) socks++;
if (socks > 0) socks--;
if (socks == 0) {
ans = i;
break;
}
}
cout << ans << "\n";
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char word[1001];
scanf("%s", &word);
if (word[0] >= 'a' && word[0] <= 'z') {
word[0] = word[0] - 32;
}
printf("%s\n", word);
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int N = 1e5 + 5;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
long long t = 1;
while (t--) {
long long n;
cin >> n;
long long p = 2, ans = 0;
for (long long i = (1); i <= (n); i++)... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int p[4], a, b, min = 1001;
for (int i = 0; i < 4; i++) {
cin >> p[i];
if (p[i] < min) {
min = p[i];
}
}
cin >> a >> b;
if (min > b) {
cout << b - a + 1;
return 0;
}
int c = min - a;
if (c > 0) {
cout << c;
} else... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int sx = 150;
int sy = 150;
int dx[4] = { 1, 0, -1, 0 };
int dy[4] = { 0, 1, 0, -1 };
/*
int dd[7][7][2];
int dt[7][7][2];
int df[7][7][2];
dd[1][2][0] = 3;
dd[1][2][1] = 2;
dt[1][2][0] = 2;
d... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 5, M = 4e6 + 5, _n = 1e6;
int n, m, a[N], b[N], lz[M], it[M], q;
void Down(int k) {
int &tmp = lz[k];
it[((k) << 1)] += tmp;
lz[((k) << 1)] += tmp;
it[((k) << 1) + 1] += tmp;
lz[((k) << 1) + 1] += tmp;
tmp = 0;
}
void update(int k, int l, int... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 5e2 + 5;
const int inf = 1e9;
bool table[maxn][maxn];
int sum[maxn][maxn];
int hasStar[maxn][maxn];
int n, m, k;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
int Sum(int r1, int c1, int r2, int c2) {
return sum[r2][c2] + sum[r1 - 1][c1 - 1] - sum[r... | 6 |
#include <bits/stdc++.h>
#pragma GCC optimize("O2")
using namespace std;
const int N = 3e5 + 10;
const long long mod = 1e9 + 7;
const long long mod2 = 998244353;
const long long inf = 8e18;
const int LOG = 22;
long long pw(long long a, long long b, long long M) {
return (!b ? 1
: (b & 1 ? (a * pw(a * a %... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5;
long long n;
inline void init() {}
inline void solve() {
init();
string a, b;
cin >> a >> b;
long long cnt_00 = 0, cnt_10 = 0, cnt_01 = 0, cnt_11 = 0;
for (long long i = 0; i < n; i++) {
if (a[i] == '0' && b[i] == '0') {
cnt_00++;
... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 4e5 + 100;
const long long mod = 1e9 + 7;
bool is_pri[310];
int pri[310];
int cnt = 0;
int rtl[maxn << 2], rtr[maxn << 2], rtv[maxn << 2], lazy[maxn << 2];
long long rtn[maxn << 2], lazy1[maxn << 2];
int pre_pri[310];
int qmod(int a, int b) {
long long an... | 6 |
#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
long long dx[] = {0, 0, -1, 1};
long long dy[] = {1, -1, 0, 0};
long long inf = 1e18;
bool check(long long a, long long b) {
if (a % b == 0) return 1;
return 0;
}
long long fgcd(long long a, long long b) {
if (b == 0) return a;
return fgcd(b... | 3 |
#include <bits/stdc++.h>
using namespace std;
bool is_vowel(char a) {
return (a == 'a' || a == 'e' || a == 'i' || a == 'o' || a == 'u');
}
int main() {
string str[3];
for (int i = 0; i < 3; i++) getline(cin, str[i]);
bool c[3] = {false};
int count = 0;
for (int i = 0; i < str[0].size(); i++) {
if (is_vo... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a1, a2, a3, b1, b2, b3, c1, c2, c3;
cin >> a1 >> a2 >> a3 >> b1 >> b2 >> b3 >> c1 >> c2 >> c3;
int sum = (a2 + a3 + b1 + b3 + c1 + c2) / 2;
a1 = sum - a2 - a3;
b2 = sum - b1 - b3;
c3 = sum - c1 - c2;
cout << a1 << " " << a2 << " " << a3 << end... | 2 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
void SME(int N, int L, vector<int> a){
deque<int> Q;
for(int i=0;i<N;i++){
if( Q.size() && Q.front() <= i - L ) Q.pop_front();
while( Q.size() && a[i] < a[ Q.back() ] ) Q.pop_back();
Q.push_back( i );
if( ... | 0 |
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#define N 100010
using namespace std;
long long num[N];
int main()
{
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%lld",&num[i]);
sort(num+1,num+n+1,greater<int>());
for(int i=2;i<=n+1;i++)
if(i-1<=num[i-1] && i>num[i])
{
int x=i-... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A[6], Temp, Found = 0, l = 0;
for (int i = 0; i < 6; i++) {
cin >> A[i];
}
Temp = A[0] + A[1] + A[2] + A[3] + A[4] + A[5];
for (int i = 0; i < 3; i++) {
for (int j = i + 1; j < 5; j++) {
for (int k = j + 1; k < 6; k++) {
if (... | 1 |
#include <iostream>
#include <cmath>
using namespace std;
#define EPS (1e-10)
int p, q, a, n;
double lhs;
int dfs(int n, int cdnm, int sdnm, double sum) {
int res = 0;
for (int i = cdnm; i * sdnm <= a; i += 1) {
double rhs = sum + 1.0 / i;
if (abs(lhs-rhs) < EPS) {res++; continue;}
if (lhs < rhs) con... | 0 |
#include <bits/stdc++.h>
using namespace std;
const long long maxN = 1e5 + 7, MOD = 1e9 + 9, INF = 1e9 + 7, N = 1007,
sqr = 383008016;
pair<long long, long long> res[10];
long long n, m;
set<pair<long long, long long> > q;
vector<pair<long long, long long> > p;
long double ans, tmp;
long double dis(pair... | 2 |
#include <bits/stdc++.h>
using namespace std;
map<string, vector<vector<int> > > mp;
map<string, int> mp2;
int check(string s, vector<string> s2) {
int ans = mp[s].size();
for (int i = 0; i < mp[s].size(); i++) {
if (mp[s][i].size() != s2.size()) {
ans--;
continue;
}
for (int j = 0; j < mp[s... | 4 |
#include <cstdio>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
int q;
scanf("%d",&q);
rep(tt,q){
int n,cnt=0;
scanf("%d",&n);
while(true){
int d[7]={},tmp=n,i,mx=-1;
for(i=0;tmp>0;i++){
d[i]=tmp%10;
tmp/=10;
}
if(i<=1) break;
for(int j=1;j<i... | 0 |
#include <bits/stdc++.h>
using namespace std;
template <class c>
struct rge {
c b, e;
};
template <class c>
rge<c> range(c i, c j) {
return rge<c>{i, j};
}
template <class c>
auto dud(c* x) -> decltype(cerr << *x, 0);
template <class c>
char dud(...);
struct debug {
template <class c>
debug& operator<<(const c&... | 2 |
#include <bits/stdc++.h>
using namespace std;
bool dp[500][5001];
pair<pair<int, int>, int> pr[500][5001];
int d, s;
int main() {
cin >> d >> s;
dp[0][0] = true;
pr[0][0] = make_pair(make_pair(-1, -1), -1);
queue<pair<int, int> > P;
P.push(make_pair(0, 0));
while (!P.empty()) {
int i = P.front().first, ... | 1 |
#include <iostream>
#include <iomanip>
#include <math.h>
using namespace std;
const double eps = 1e-10;
class Point {
public:
double x, y;
Point(double _x = 0., double _y = 0.) : x(_x), y(_y) {}
};
istream& operator >> (istream& in, Point& P)
{
in >> P.x >> P.y;
return in;
}
ostream& operator << (o... | 0 |
#include <bits/stdc++.h>
int main() {
long n, i, yes, no, a, b, c, d, e, max = -100000000;
char name[10005] = {'\0'}, std[10005] = {'\0'};
scanf("%ld\n", &n);
for (i = 1; i <= n; i++) {
scanf("%s %ld %ld %ld %ld %ld %ld %ld\n", &name, &yes, &no, &a, &b, &c, &d,
&e);
if (yes * 100 + no * (-50) ... | 1 |
#include <bits/stdc++.h>
using namespace std;
const long long L = 5e18;
long long gcd(long long a, long long b, long long *x, long long *y) {
if (b == 0LL) {
(*x) = 1LL;
(*y) = 0LL;
return a;
}
long long x1, y1;
long long g = gcd(b, a % b, &x1, &y1);
(*x) = y1;
(*y) = x1 - (a / b) * y1;
return... | 3 |
#include <bits/stdc++.h>
using namespace std;
template <typename item>
item abs(item i) {
if (i < 0) i = -i;
return i;
}
char *s;
int n;
int pos;
int main() {
cin >> n;
cin >> pos;
s = new char[n + 2];
cin >> s + 1;
int cnt = 0;
if (n == 1) {
cout << 0;
return 0;
}
if (n % 2 == 1 and pos == ... | 3 |
#include <bits/stdc++.h>
using namespace std;
const long long int p_mod = 9999999999999983;
const long double pi = 3.14159265358979323;
const long long int N = 1e6 + 9;
const long long int mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r) {
uniform_int_distribu... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int t;
cin >> t;
while (t) {
int n, m, k, value = 0;
cin >> n >> m >> k;
int pc = n / k;
if (pc >= m)
cout << m << endl;
else {
int ar[100] = {0};
int rem = m - pc;
for (int i = 0; (i < k - 1 && rem > 0); i+... | 1 |
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <complex>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
using namespace std;
typedef pair<int,int> P;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int n, dist[100100], branch[100100], sz[100100];
vector<int> a[100100];
int *f[100100], fromRoot[100100];
void visit(int x, int par, int idBranch) {
branch[x] = idBranch;
sz[idBranch]++;
for (int i = 0; i < int(a[x].size()); i++) {
int y = a[x][i];
if (y == pa... | 5 |
#include <bits/stdc++.h>
const int mod = 998244353, N = 3e5 + 5;
int n, nxt[N << 1], to[N << 1], head[N], cnt, f[N][3];
int read() {
int x = 0, f = 1;
char s;
while ((s = getchar()) > '9' || s < '0')
if (s == '-') f = -1;
while (s >= '0' && s <= '9')
x = (x << 1) + (x << 3) + (s ^ 48), s = getchar();
... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100006;
struct pi {
int x;
int y;
} pp[maxn], pp2[maxn];
int cmp(pi a, pi b) { return a.x < b.x; }
int cmp1(pi a, pi b) { return a.y < b.y; }
int main() {
int i, j, n, m;
cin >> n >> m;
for (i = 1; i <= n; i++) {
int x, y, x1, y1;
scanf("%... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int count = 0;
if (a[0] == 0) count++;
for (int i = 1; i < n; i++) {
if (a[i] == 0) {
count++;
} else if (a[i] == 2 && a[i - 1] == 2) {
count++;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int mxN = 1e4 + 2;
vector<int> adj[mxN], cnt(mxN);
int main() {
long long int n, a, b, m, i, j, cn = 0, sm = 0, mx = INT_MIN, mn = INT_MAX, k;
string s;
cin >> n >> m;
for (i = 0; i <= 10000; i++)
for (j = i; j <= 10000; j++) {
if (__builtin_popcount... | 4 |
#include <bits/stdc++.h>
using namespace std;
string arr[4];
bool go(char** a, int n, int m, int startR, int startC, string s) {
for (int i = 0; i < s.length(); ++i) {
if (s[i] == '0') {
if (arr[0] == "up")
--startR;
else if (arr[0] == "down")
++startR;
else if (arr[0] == "right"... | 2 |
#include <bits/stdc++.h>
using namespace std;
long long int dp[5005][2];
long long int inf = 1000000000000000000;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long int n, k;
cin >> k >> n;
vector<long long int> b;
for (long long int i = 0; i < n; i++) {
long long int... | 5 |
#include <bits/stdc++.h>
using namespace std;
struct struc {
string name;
vector<string> cont;
vector<int> count;
};
int main() {
int k, n, m, q, a;
struc ms;
bool bol, bol2;
string s;
char s2[3];
scanf("%d%d%d%d\n", &k, &n, &m, &q);
vector<struc> art;
vector<int> v2;
vector<string> v1;
pair<s... | 3 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string S;
cin >> S;
int len = S.length();
vector<int> v(len);
S = S + "X";
for ( int i = 0; i < len; ){
int i0 = i;
int R = 0, L = 0;
// RR...RLL...L の連続数を調べる
while ( S[i] == 'R' ){
R++;
i++;
}
while ( S[... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
;
long long int n, m;
cin >> n >> m;
long long int ans = 0;
while (m != n) {
if (m < n)
m++;
else {
if (m % 2 == 0)
m /= 2;
else
m++;
}
ans++;
}
... | 2 |
#include <cstdio>
using namespace std;
int a[100010];
int main() {
int N;
scanf("%d", &N);
for(int i=0;i<N;++i) {
scanf("%d", &a[i]);
}
int ans=0;
for(int i=0;i<N;++i) {
if (a[a[i]-1]-1==i) ans++;
}
printf("%d\n",ans/2);
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const double g = 10.0, eps = 1e-12;
const int N = 100000 + 10, maxn = 1000 + 10, inf = 0x3f3f3f3f,
INF = 0x3f3f3f3f3f3f3f3f;
int a[N], n;
int cal(int x) {
int ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] > a[(i - x + n) % n]) ans++;
}
return ans;
}
... | 3 |
#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <stdlib.h>
#include <string.h>
#define rep(i, n) for(int i=0;i<n;i++)
#define FOR(i, j, n) for(int i=j;i<n;i++)
int N;
char data[1000][1000];
int dp[1000][1000];
int search() {
int max = 0;
FOR(i, 1, N) {
FOR(j, 1, N) {
i... | 0 |
#include <cstdio>
using namespace std;
int main(){
int n,x;
scanf("%d%d",&n,&x);
printf("%d\n",(n+x-1)/x);
return 0;
} | 0 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:256000000")
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll my_exp(ll a, ll b, ll MOD = numeric_limits<ll>::max()) {
a %= MOD;
return b ? (((b % 2 == 1 ? a : 1) * my_exp(a * a, b / 2, MOD)) % MOD) : 1;
}
bool... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, m, i, count, j, flag;
char ch;
cin >> n >> m;
count = 0;
while (n--) {
j = 0;
while (j < m) {
i = 0;
flag = 1;
while (i < 2) {
cin >> ch;
if (ch == '1' && flag) {
flag = 0;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
char p[1100][1100];
bool used[1100][1100], now[1100][1100], f = false;
int kl[1100][1100], kol;
int n, m, ans;
int dfs(int, int);
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) cin >> p[i][j];
for (int i = 1; i <= n; i++)
... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int M = 3000001;
const int P = 1e9 + 7;
int n, m, k, b[M], d[M], pre[M], tag[M], maxi, res, sz, SZ, c[M], CT;
struct vv {
int si, so, res, cnt;
} a[M];
bool cmp(vv a, vv b) { return a.si < b.si; }
void pd(int now) {
d[now * 2] += tag[now];
d[now * 2 + 1] += tag[... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, L, a;
while (~scanf("%d%d%d", &n, &L, &a)) {
int t, l;
int ans = 0;
int last = 0;
for (int i = 0; i < n; i++) {
scanf("%d%d", &t, &l);
ans += (t - last) / a;
last = t + l;
}
ans += (L - last) / a;
printf(... | 1 |
#include<bits/stdc++.h>
using namespace std ;
#define Next( i, x ) for( register int i = head[x]; i; i = e[i].next )
#define rep( i, s, t ) for( register int i = (s); i <= (t); ++ i )
#define drep( i, s, t ) for( register int i = (t); i >= (s); -- i )
#define re register
#define int long long
int gi() {
char cc = getc... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.