solution stringlengths 52 181k | difficulty int64 0 6 |
|---|---|
#include<cstdio>
#include<algorithm>
using namespace std;
int bit[100001];
int n,q;
void add(int i,int v){
while(i<=n){
bit[i] += v;
i += i & -i;
}
}
int sum(int i){
int res = 0;
while(i>0){
res += bit[i];
i -= i & -i;
}
return res;
}
int main(){
scanf("%d %d",&n,&q);
fill(bit,bit+n+1,0);
for(int ... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long INF = INT_MAX;
long long ans = INT_MIN;
long long xx[] = {0, 0, 1, 1, 1, -1, -1, -1};
long long yy[] = {-1, 1, -1, 0, 1, -1, 0, 1};
void solve() {
long long n, m;
cin >> n >> m;
if (n == m)
cout << 0;
else {
if (m % n != 0)
cout << -1;
el... | 1 |
#include<bits/stdc++.h>
using namespace std;
const int N=2e3+10;
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();
return x*o;
}
int n,ans=1e9,l[N],r[N],mx[N];
char a[N],b[N];
vo... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k, i, rem, flag = 0, sum = 0, c = 0;
cin >> n >> m >> k;
int ar[n];
for (i = 0; i < n; i++) cin >> ar[i];
sort(ar, ar + n);
for (i = n - 1; i >= 0; i--) {
if (k >= m)
break;
else
k = k + ar[i] - 1;
c++;
}
if (k ... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m;
int c=0;
int a;
cin>>n>>m;
for (int i=0;i<n;i++)
{
cin>>a;
if (a>=m)
c++;
}
cout<<c;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int dp[1010][55][55];
int failS[1010];
int failT[1010];
char c[1010];
char s[1010];
char t[1010];
int main(void) {
cin >> c;
cin >> s;
cin >> t;
int S = strlen(s);
int T = strlen(t);
int C = strlen(c);
int idx;
idx = 0;
for (int i = 1; i <= S; i++) {
w... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, dp1[1 << 10], dp2[1 << 10];
string S;
while(cin >> N, N) {
memset(dp1, 0, sizeof(dp1));
cin >> S;
for(int i = 0, curr = 0; i < N; i++) {
if(S[i] == 'u') {
curr = 0;
} else {
dp1[curr] |= 1 << (S[i] - '0'... | 0 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
typedef pair<pair<int,int>,string> item;
int main(){
int n,i,w,s,S;
for(string f;cin>>n,n;){
vector<item>items;
vector<int>num,result;
for(i=0;i<n;i++)cin>>f>>w>>s,items.push_back(make_pair(make_pair(w,s),f)),num.p... | 0 |
#include <bits/stdc++.h>
using namespace std;
int a[310][310];
int main() {
int n, m, k, i, j, x, y;
cin >> n >> m >> k;
int r = (n * m) / k;
for (i = 1; i <= n; ++i) {
a[i][0] = a[i][m + 1] = 1;
}
x = 1;
y = 1;
bool b = 0;
if (r * (k - 1) > 0) {
cout << r << ' ';
for (i = 1; i <= r * (k -... | 3 |
#include <bits/stdc++.h>
using namespace std;
struct pt {
long long int x1, x2, y1, y2;
};
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int n, i;
pt a, b, c;
cin >> a.x1 >> a.y1 >> a.x2 >> a.y2;
cin >> b.x1 >> b.y1 >> b.x2 >> b.y2;
cin >> c.x1 >> c.y1 >> c.x2 >> c.y2;
if... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 998244853;
int C[4010][4010];
int dp[4010][4010];
int calc(int n, int m) {
if (n - m >= 1) return C[n + m][m];
int tot = n + m, val = 2 - (n - m), x = tot + val >> 1, y = tot - val >> 1;
if (x < 0 || y < 0) return 0;
return C[x + y][x];
}
int main() ... | 5 |
#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 = 10 * x + ch - '0';
ch = getchar();
}
return x * f;
}
int n, m, a[100000 + 5]... | 2 |
//O(NlogN + Qlog^2N)の適当解法(クエリ入れ替えなし)
//意味が分からないバグに悩まされる。→セグメントツリーの子はind*2 + 1とind*2 + 2。間違えてたし気づかなすぎたので、頭ない。
#include<iostream>
#include<string>
#include<algorithm>
#include<functional>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#... | 0 |
#include <bits/stdc++.h>
using namespace std;
int IN() {
int c, x;
while (!isdigit(c = getchar()))
;
x = c - '0';
while (isdigit(c = getchar())) x = (x << 1) + (x << 3) + c - '0';
return x;
}
const int N = 1000 + 19;
int A[N], Max, n;
int main() {
n = IN();
for (int i = 1; i < n + 1; i++) A[i] = IN();... | 2 |
#include <bits/stdc++.h>
using namespace std;
long long maxPrimeFactors(long long n) {
long long maxPrime = -1;
while (n % 2 == 0) {
maxPrime = 2;
n >>= 1;
}
for (int i = 3; i <= sqrt(n); i += 2) {
while (n % i == 0) {
maxPrime = i;
n = n / i;
}
}
if (n > 2) maxPrime = n;
retur... | 2 |
// abc113_c.cc
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
map<int, map<int, int>> mp;
vector<int> p(m), y(m);
for (int i = 0; i < m; i++) {
cin >> p[i] >> y[i];
mp[p[i]][y[i]]++;
}
for (auto& imp : mp) {
int i = 1;
... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
typedef long long int ll;
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n; cin >> n;
vector<int> a(n);
for(int i=0;i<n;i++){
cin >> a[i];
}
int ans=0;
for(int i=0;i<n-1;i++){
if(a[i+1]>a[i])ans++... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int n;
cin >> n;
string second;
string t;
cin >> second;
cin >> t;
int a = 0, b = 0, t1 = 0, t2 = 0;
for (int i = 0; i < second.length(); i++) {
if (second[i] == 'a') a++;
if (t[... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int arr[200] = {}, i, j, k, w, ans = 0;
for (i = 0; i < n; i++) cin >> arr[i];
cin >> w;
sort(arr, arr + n);
for (i = 0; i < n; i++) {
int c = 1;
for (j = i + 1; j < n; j++) {
if (arr[j] - arr[i] <= w)
... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int> > a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i].first;
a[i].second = i;
}
sort((a).begin(), (a).end());
int m = 0;
for (int i = 0; i < n; ++i) {
a[i].first = max(a[i].first, m);
m = a[i].f... | 3 |
#include <bits/stdc++.h>
using namespace std;
inline long long gcd(long long a, long long b) {
if (b == 0) return a;
a %= b;
return gcd(b, a);
}
inline long long max(long long a, long long b) { return ((a > b) ? a : b); }
inline long long min(long long a, long long b) { return ((a > b) ? b : a); }
long long power... | 3 |
#include <bits/stdc++.h>
int main(int argc, char* argv[]) {
printf("black\n");
fflush(stdout);
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 5;
const int nax = 1e6 + 5;
const int pot = 256 * 1024;
void upd(int* tr, int r, int day, int diff) {
day += pot;
tr[day] = min(r, tr[day] + diff);
for (int x = day / 2; x >= 1; x /= 2) tr[x] = tr[2 * x] + tr[2 * x + 1];
}
long long s(int* tr, in... | 2 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n;
cin>>n;
for(int i=1;i<=n;i++){
int a,b,c;
cin>>a>>b>>c;
if(a*a+b*b==c*c || a*a==b*b+c*c || a*a+c*c==b*b){
cout<<"YES"<<endl;
}
else cout<<"NO"<<endl;
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int N, Q;
int a[200005];
long long k[200005], s[200005];
int main() {
ios::sync_with_stdio(0);
cin >> N >> Q;
for (int i = 1; i <= N; i++) {
cin >> a[i];
s[i] = s[i - 1] + a[i];
}
for (int i = 1; i <= Q; i++) cin >> k[i];
int f = 1, res = a[1];
for (in... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long now = 1;
while (1) {
if (n % now != 0) {
cout << n / now + 1 << endl;
return 0;
}
now *= 3;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int n, m, tot, pre[200010 << 1], ans[200010], now[200010], d[200010],
son[200010 << 1], z[200010], s[200010], g[200010];
map<string, int> c[200010];
string ch[200010];
vector<int> a[200010], b[200010];
void put(int x, int y) {
pre[++tot] = now[x];
now[x] = tot;
so... | 5 |
#include <iostream>
using namespace std;
#define rep2(x,from,to) for(int x=(from);x<(to);++(x))
#define rep(x,to) rep2(x,0,to)
int main() {
double a,b,c[] = {0.2, 0.6, 1.1};
int l[4]= {}, r[4] = {};
while(cin >> a >> b) {
bool fa = 1, fb = 1;
rep(i,4) {
if(c[i]>a && fa) {
l[i]++;
fa = 0;
}
if(c[... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int m;
cin >> m;
vector<int> q(m);
for (int i = 0; i < m; i++) cin >> q[i];
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
sort(a.begin(), a.end());
sort(q.begin(), q.end());
reverse(a.begin(), a.end());
int ... | 3 |
#include <bits/stdc++.h>
using namespace std;
map<pair<int, pair<int, int> >, int> was;
int f(int n, int type) {
if (n == 0) return 1;
int h = 0;
if (was.find({n, {h, type}}) != was.end()) return was[{n, {h, type}}];
int ans = 0;
for (int i = (n - 1) / 2; i <= (n) / 2; i++) {
if (type == 1 && (i % 2) == 0... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 5;
bool k[210];
int main() {
int q;
cin >> q;
while (q--) {
int n, x;
cin >> n >> x;
memset(k, false, sizeof k);
for (int i = 1; i <= n; i++) {
int w;
cin >> w;
k[w] = true;
}
for (int i = 1; i <= 205; i... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int C = 350, MAXN = 1e5 + C - 1, MAXC = MAXN / C;
int cnt[MAXC][MAXN];
deque<int> deq[MAXC];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int c = i / C, a;
scanf("%d", &a);
deq[c].push_back(a);
cnt[c][a]++;
}
int q;
ci... | 4 |
#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1000000000 + 7;
const long long int N = 1000000 + 6;
int recur_depth = 0;
template <typename Ostream, typename Cont>
typename enable_if<is_same<Ostream, ostream>::value, Ostream&>::type operator<<(
Ostream& os, const Cont& v) {
os << "[";
f... | 1 |
#include <bits/stdc++.h>
using namespace std;
vector<long long> all;
inline void fast() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
}
const long long nn = 9e18;
class data {
public:
string s;
long long remain;
bool status;
data(string a, long long b, bool c) { s = a, remain = b, status = c; }
};
... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, k, a, ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> k >> a;
ans = max(k + 1, ans);
a--;
while (a != 0) {
k++;
a /= 4;
}
ans = max(k, ans);
}
cout << ans << endl;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,x=1;string S;cin>>N>>S;
for(int i=1;i<N;i++){
if(S.at(i-1)!=S.at(i))x++;
}
cout<<x<<endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'H' || s[i] == 'Q' || s[i] == '9') {
cout << "YES";
return 0;
}
}
cout << "NO";
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int arr[1000][1000];
int values[1000000];
bool good[1000][1000];
int n, m;
bool check(int k) {
memset(good, 0, sizeof good);
for (int i = 0; i < n; i++) {
vector<int> idx;
for (int j = 0; j < m; j++)
if (arr[i][j] >= k) idx.push_back(j);
for (int j = 0... | 4 |
#include <bits/stdc++.h>
using namespace std;
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long LINF = numeric_limits<long long>::max() / 3;
struct Double {
double d;
explicit Double(double x) : d(x) {}
};
ostream& operator<<(ostream& os, const Double x) {
os << fixed << setprecision(20) << ... | 2 |
#include <bits/stdc++.h>
const long long MOD = 1000000007;
const int INF = 1 << 30;
using namespace std;
vector<int> a;
int cc = 0;
int sum1 = 0;
int sum2 = 0;
int all = 0;
int rr = 0;
void done() {
all++;
int ss = 0;
for (int i = 0; i < a.size(); ++i) {
if (a[i] == 1)
ss++;
else
ss--;
}
i... | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n,m;
cin >> n >> m;
ll N=n;
map<ll,ll> mp;
while(n--)
{
ll x;
cin >> x;
//if(mp.find(x)==mp.end())mp[x]=0LL;
mp[x]++;
}
ll M = m;
while (m--)
{
ll b,c;
cin >> b >> c;
//if(mp.find(c)==mp.end())mp[c]=0LL;
mp[c]... | 0 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void input(T &x) {
register char c = getchar();
x = 0;
int neg = 0;
for (; ((c < 48 || c > 57) && c != '-'); c = getchar())
;
if (c == '-') {
neg = 1;
c = getchar();
}
for (; c > 47 && c < 58; c = getchar()) {
x = (x <... | 1 |
#include <bits/stdc++.h>
using namespace std;
long long a[110000];
struct UnionFind {
vector<int> parent, activated;
vector<long long> group_size;
long long mx = 0;
UnionFind(int n) {
group_size = vector<long long>(n);
parent = vector<int>(n);
activated = vector<int>(n);
for (int i = 0; i < n; i... | 3 |
#include <bits/stdc++.h>
using namespace std;
int n;
bool isBelong(int a[], int x) {
for (int i = 0; i < n; i++) {
if (a[i] == x) return true;
}
return false;
}
int main() {
scanf("%d", &n);
int a[1000], b[1000];
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
for (int i = 0; i < n; i++) scanf("%d", &... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int X,Y,Z;
cin>>X>>Y>>Z;
cout<<Z<<" "<<X<<" "<<Y;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const long long infl = 1e18 + 5;
long long int n, m, k, q, x, y, mx = -1, mn = infl, f, val, sz, sm, cnt, ans,
t = 1, i, j, ind = -1;
long long int a[1000004], b[1000004], c[1000004];
std::set<int> v;
std::map<long long int, long long int> mr... | 3 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
mt19937 gen(time(0));
int n, m;
set<int> s;
int cnt[200005], wa[200005];
vector<int> edge[200005];
queue<int> que;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
for (int i = 0, a, b; i < m; i++) {
cin >> a >> b;
... | 4 |
#include<cstdio>
int main(){
int H,W,A,B;
scanf("%d%d%d%d",&H,&W,&A,&B);
for(int i=1;i<=H;i++,puts(""))
for(int j=1;j<=W;j++)
putchar((i<=B)==(j<=A)?'1':'0');
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
double cross(pair<int, int> A, pair<int, int> B, pair<int, int> C) {
double tmp;
tmp = ((B.first - A.first) * (C.second - B.second) -
(C.first - B.first) * (B.second - A.second));
tmp = tmp * 0.5;
return tmp;
}
pair<int, int> p[500];
double area, maxminus, ... | 2 |
#include <bits/stdc++.h>
const int N = 1e4 + 10;
int n, cnt[N];
int q[N], tot;
bool v[N];
bool cmp(int a, int b) { return a < b; }
int main() {
int T;
scanf("%d", &T);
while (T--) {
for (int i = 1; i <= 10000; i++) cnt[i] = 0;
tot = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
int x;
... | 3 |
#include <bits/stdc++.h>
using namespace std;
int n, num, numbers[100005], cant;
set<int> sol, aux;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &num);
cant = 0;
for (auto i = aux.begin(); i != aux.end(); i++) {
numbers[cant++] = (*i | num);
}
aux.clear();
nu... | 1 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <complex>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cmath>
#include <queue>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j;
int n, b, a;
cin >> n >> b >> a;
int bn = b, an = a;
vector<int> s(n + 1);
for (i = 0; i < n; i++) cin >> s[i];
for (i = 0; i < n; i++) {
if (bn == 0 && an == 0) {
break;
} else if (bn == 0) {
an--;
} else if (an ... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200009;
const int MOD = 1e9 + 7;
void add(int &a, int b) {
a += b;
if (a >= MOD) a -= MOD;
}
vector<vector<int>> mul(vector<vector<int>> &A, vector<vector<int>> &B) {
int n = ((int)(A).size());
vector<vector<int>> res(n, vector<int>(n));
for (int ... | 6 |
#include <iostream>
using namespace std;
int main(){
string s;
cin >> s;
int a,b,c,d;
a=(int)(s[0]-'0');
b=(int)(s[1]-'0');
c=(int)(s[2]-'0');
d=(int)(s[3]-'0');
for(int i=0;i<8;i++){
if(a+((i&1)*2-1)*b+(((i>>1)&1)*2-1)*c+(((i>>2)&1)*2-1)*d==7){
cout << a << ((i&1)?'+':'-') << b << ((i&2)?'+'... | 0 |
#include <bits/stdc++.h>
using namespace std;
int zerkalo(int n) {
long long int nn = n, l = 0;
long long int step = 128;
long long int res = 0;
while (nn != 0) {
nn /= 2;
l++;
}
nn = 0;
while (nn < 8) {
nn++;
if (nn <= l) {
res += step * (n % 2);
n /= 2;
}
step /= 2;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
class HashNum {
private:
inline void normalize() {
a_ = (a_ % MA + MA) % MA;
b_ = (b_ % MB + MB) % MB;
}
public:
int a_, b_;
static constexpr int MA = 1e9 + 7, MB = 1e9 + 9;
HashNum(int num = 0) : a_(num), b_(num) { normalize(); }
HashNum(int first, i... | 4 |
#include <bits/stdc++.h>
using namespace std;
template <class T, class L>
bool smax(T &x, L y) {
return x < y ? (x = y, 1) : 0;
}
template <class T, class L>
bool smin(T &x, L y) {
return y < x ? (x = y, 1) : 0;
}
const int maxn = 1e7 + 17, tof = 1e7;
pair<int, long long> ans;
long long po(int x) { return (long lon... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 50 + 5;
int n, h[maxn], ecnt;
struct enode {
int v, n;
enode() {}
enode(int _v, int _n) : v(_v), n(_n) {}
} e[maxn << 1];
inline void addedge(int u, int v) {
ecnt++;
e[ecnt] = enode(v, h[u]);
h[u] = ecnt;
}
double f[maxn][maxn], g[maxn], dp[maxn... | 6 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
long long MOD = 1000000007;
long double EPS = 1e-9;
long long binpow(long long b, long long p, long long mod) {
long long ans =... | 5 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void pr(vector<T> &v) {
for (int i = 0; i < (int)(v).size(); i++) cout << v[i] << " ";
cout << '\n';
;
}
template <typename T>
void pr(vector<vector<T>> &v) {
for (int i = 0; i < (int)(v).size(); i++) {
pr(v[i]);
}
}
template <typename T>... | 3 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-9;
const ll MOD = 1000000007;
const int INF = 1000000000;
const ll... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef unsigned long long ull;
#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const int MOD = (int)1e9 + 7;
const int N = (int)2e5 + 911;
int ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int k1 = 0;
string s0 = "";
for (int i = 0; i < n; i++) {
if (s[i] == '0')
s0 += "0";
else
k1++;
}
if (k1 == 0) {
cout << "0" << endl;
return 0;
} else {
cout << "1" << s0 ... | 1 |
#include <algorithm>
#include <iostream>
#include <string>
#include <random>
#include <cassert>
#include <cstring>
#include <chrono>
#include <map>
using namespace std;
typedef long long ll;
const ll mod = 998244353;
map<string, ll> ans;
ll Solve(string s) {
if (s == "") return 1;
if (ans.count(s)) return ans[s... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int x, y, _x, _y, n, tx, ty;
string s;
bool judge(long long num) {
long long yu = num % n;
long long ax = (num / n) * tx;
long long ay = (num / n) * ty;
long long px = x + ax;
long long py = y + ay;
for (int i = 0; i < yu; i++) {
if (s... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, n, m;
cin >> n >> m >> k;
if (m < n) {
cout << "NO";
return 0;
}
if (k < n) {
cout << "NO";
return 0;
}
cout << "YES";
return 0;
}
| 1 |
#include<cstdio>
#include<cctype>
#include<queue>
#include<algorithm>
#include<cstring>
using namespace std;
#define REP(i, N) for(int i=0;i<(int)(N);++i)
int unit[20];
int need[20];
int nextInt() {int r = 0, ch; while( isspace(ch = getchar())); do {r = r * 10 + ch - '0';}while( isdigit( ch = getchar() ) ); return r... | 0 |
#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
typedef long long ll;
typedef pair<int,int> pii;
#define _overload4(_1,_2,_3,_4,name,...) name
#define _overload3(_1,_2,_3,name,...) name
#define _rep1(n) _rep2(i,n)
#define _rep2(i,n) _rep3(i,0,n)
#define _rep3(i,a,b) for(ll i=a;i<b;++i)
#defin... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
int f[N], a[N], ne[N], sz[N], n, tot, m, k, vis[N];
struct node {
int nu, nv, u, v;
friend bool operator<(const node a, const node b) {
if (a.nu == b.nu) {
return a.nv < b.nv;
}
return a.nu < b.nu;
}
} p[N];
void inint(int n) ... | 3 |
#include <bits//stdc++.h>
using namespace std;
int main(void){
int a,b,c,d,e;
cin>>a>>b>>c>>d>>e;
int ans;
if(a<b&&a<c)
ans=a;
else if(b<c)
ans=b;
else
ans=c;
if(d<e)
ans=ans+d;
else
ans=ans+e;
cout<<ans-50<<endl;
}
| 0 |
#include<stdio.h>
int a[3000000];
int main()
{
int n,i,j,s=0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0,j=1;i<n;i++)
{
if(a[i]==j)
{
s++;j++;}
}
if(j==1)
printf("-1\n");
else
printf("%d\n",n-s);
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 105;
long long n, t, a[maxn];
int main() {
while (~scanf("%I64d %I64d", &n, &t)) {
long long ans = 0;
for (long long i = 1; i <= n; i++) {
scanf("%I64d", &a[i]);
}
for (long long i = 1; i <= n; i++) {
t -= (86400 - a[i]);
... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2020;
const long long mod = 998244353;
const long long g = 3;
const double eps = 1e-8;
template <class T>
void Mul(T &x, T y) {
x = x * y % mod;
}
template <class T>
void Add(T &x, T y) {
x = (x + y) % mod;
}
template <class T>
void Sub(T &x, T y) {
x = ... | 4 |
#include <bits/stdc++.h>
int main(void) {
int n;
long s;
scanf("%d%ld", &n, &s);
if (1.0 * s / n > s / n)
printf("%ld", s / n + 1);
else
printf("%ld", s / n);
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n, m, x, y;
cin >> n >> m >> x >> y;
int two = -1, one = -1;
if (x < y) {
one = x;
} else {
two = y;
}
int dot1 = 0, dot2 = 0, p = 0;
for (int i = 0; i < n; i++) {
string... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int maxi = -1, maxiidx;
for (int i = 0; i < n; i++) {
if (s[i] - 'a' < maxi && maxi != -1) {
cout << "YES" << endl;
cout << maxiidx << " " << i + 1;
return 0;
}
if (s[i] - 'a' > maxi... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int a, x, y;
cin >> a;
while (a--) {
cin >> x >> y;
x = x - 1;
while (x--) {
y = y + 9;
}
cout << y << endl;
}
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
inline long long read() {
long long f = 1, w = 0;
char x = 0;
while (x < '0' || x > '9') {
if (x == '-') f = -1;
x = getchar();
}
while (x != EOF && x >= '0' && x <= '9') {
w = (w << 3) + (w << 1) + (x ^ 48);
x = getchar();
}
return w * f;
}
co... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
int n, k;
pair<int, int> p[maxn];
set<pair<int, int> > s, t;
pair<int, int> operator+(pair<int, int> A, pair<int, int> B) {
return {A.first + B.first, A.second + B.second};
}
bool operator==(pair<int, int> A, pair<int, int> B) {
return A.first ... | 6 |
#include<iostream>
using namespace std;
int main(){
int n,sum,box[]={500,100,50,10,5,1};
while(cin>>n,n){
n=1000-n;
sum=0;
for(int i=0;i<6;i++){
sum+=n/box[i];
n=n-n/box[i]*box[i];
}
cout<<sum<<endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
const ll inf=1e9+7;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll t;
cin>>t;
while(t--)
{
string s;
cin>>s;
bool a=true;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define MOD 1000000007
#define INF 1000000000000000
#define fi first
#define se second
#define all(v) v.begin(),v.end()
int dx[]={0,1,0,-1},dy[]={1,0,-1,0};
#define pb push_back
struct edge{in... | 0 |
#include <bits/stdc++.h>
using namespace std;
int n, l;
int t[100];
int sol;
int main() {
scanf("%d %d", &n, &l);
for (int i = 0; i < n; ++i) scanf("%d", t + i);
for (int i = l; i <= 100; ++i) {
int sum = 0;
for (int j = 0; j < n; ++j) sum += t[j] / i;
sum *= i;
sol = max(sol, sum);
}
printf("... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
std::ios_base::sync_with_stdio(false);
long long int n, k, a, b;
cin >> n >> k >> a >> b;
char s[n];
int i;
for (i = 0; i < n; i++) {
s[i] = '1';
}
if (a < (n / (k + 1)) || b < (n / (k + 1)))
cout << "NO" << endl;
else {
if (a > b)... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int capacity = 0;
int max_capacity = 0;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
capacity -= a;
capacity += b;
if (capacity > max_capacity) max_capacity = capacity;
}
cout << max_capacity << endl;... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int maxn = 1e6 + 1, mod = 1e9 + 7;
struct num {
static const int MA = 1e9 + 7, MB = 1e9 + 9;
int a, b;
num() {}
num(int x) : a((x % MA + MA) % MA), b((x % MB + MB) % MB) {}
num(int x, int y) : a((x % MA + MA) % MA), b((y % MB + MB) % MB... | 6 |
#include <bits/stdc++.h>
using namespace std;
int n;
int res;
pair<int, int> X[501];
int ap[501];
int pos[501];
vector<int> fuck, mooo;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
int a, b;
scanf("%d%d", &a, &b);
X[i] = make_pair(-a, i * 2 - 1);
X[i + n] = make_pair(-a - b, i * 2);
... | 5 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void read(T &x) {
x = 0;
int c = getchar(), f = 1;
for (; !isdigit(c); c = getchar())
if (c == 45) f = -1;
for (; isdigit(c); c = getchar()) (x *= 10) += f * (c - '0');
}
int n, m;
vector<int> G[3000 + 5];
long long f[3000 + 5][3000 + 5... | 6 |
#include <bits/stdc++.h>
using namespace std;
struct node {
int t, i;
friend bool operator<(const node &a, const node &b) { return a.t < b.t; }
} res[100010];
int total[100010];
int number[100010], x[100010], y[100010], ans[100010], n;
int tt[100010][150];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i... | 4 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n; cin>>n;
int br = 0, cur = 1;
for(int i=1; i<=n; i++)
{
int x; cin>>x;
if(x == cur) cur++;
else br++;
}
if(cur == 1) cout<<"-1\n";
else cout<<br<<"\n";
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
long long n, q;
const int MAXN = 100005;
long long s[MAXN], pre[MAXN], gaps[MAXN];
int main() {
ios::sync_with_stdio(0);
cin >> n;
for (int i = 0; i < n; i++) cin >> s[i];
sort(s, s + n);
for (int i = 1; i < n; i++) gaps[i] = s[i] - s[i - 1];
sort(gaps, gaps + n... | 4 |
#include <iostream>
using namespace std;
int main(){
while(1){
int n ; cin >> n ; if(!n) break;
int* a=new int[n];
for(int i=0;i<n;i++) cin >> a[i];
int MAX=a[0];
for(int i=0;i<n;i++){
int temp=0;
for(int j=i;j<n;j++){
temp+=a[j];
if(temp>MAX) MAX=temp;
};
};
cout << MAX << '\n' ;
dele... | 0 |
#include <bits/stdc++.h>
using namespace std;
int INF = 10e9;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<pair<int, int>> g(m);
for (int i = 0; i < m; i++) {
cin >> g[i].first >> g[i].second;
g[i].first--;
g[i].second--;
}
... | 5 |
#include <bits/stdc++.h>
using namespace std;
struct Segment {
int coverTime, coverSize, size;
Segment() {}
Segment(int coverTime, int coverSize, int size)
: coverTime(coverTime), coverSize(coverSize), size(size) {}
Segment operator+(const Segment &rhs) const {
return Segment(0, coverSize + rhs.coverS... | 5 |
#include<iostream>
#include<string>
#include<algorithm>
#include<set>
#include<vector>
#define rep(i,n) for(int i=0;i<int(n);i++)
#define sint(n) scanf("%d",&n);
using namespace std;
int main(){
while(1){
int a,b,c;
sint(a)
sint(b)
sint(c)
if(a==0){break;}
int k;
sint(k)
int buhin[301]={0};
... | 0 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T modinv(T a, T n) {
T i = n, v = 0, d = 1;
while (a > 0) {
T t = i / a, x = a;
a = i % x;
i = x;
x = d;
d = v - t * x;
v = x;
}
return (v + n) % n;
}
long long modpow(long long n, long long k, long long mod) {
lon... | 2 |
#include <bits/stdc++.h>
using namespace std;
long long a[100], x, y;
int q, i, j, k;
int main() {
cin >> q;
while (q--) {
cin >> i >> x;
for (j = 1; j < 61; j++)
if ((1LL << j) > x) break;
if (i == 3) {
for (x = (x + a[j] & ((1LL << j - 1) - 1)) | (1LL << j - 1); x > 1;
x >>= 1, ... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e6 + 1;
const long long M = 1e9 + 7;
int n, a[N], f[N], cnt[N];
vector<int> vc;
vector<pair<int, int> > fac[N];
bool used[N], vis[N];
void init() {
for (int i = 2; i < N; i++) {
if (vis[i]) continue;
fac[i].push_back(pair<int, int>(i, 1));
for (... | 4 |
#include <bits/stdc++.h>
using namespace std;
int dp[2][1009][52][52];
int n, P, L, is1[1009], is2[1009];
int main() {
cin >> n >> P >> L;
int oo = n / L;
if (n % L) oo++;
oo *= 2;
P = min(P, oo);
int aa;
cin >> aa;
while (aa--) {
int x;
cin >> x;
is1[x] = 1;
}
cin >> aa;
while (aa--) ... | 5 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.