Codeforces Round #436 (Div. 2) Archive

#include<cstdio> #include<algorithm> #include<cstring> using namespace std; const int N = 3005, INF = 0x3f3f3f3f; int n, m, q, f; bool vis; struct Edge { int to; Edge *next; Edge () {} Edge (int to, Edge …

#include<iostream> #include<cstdio> #include<algorithm> #include<bitset> using namespace std; struct node{ int t,d,p,tot; }a; int f; bool cmp(node x,node y){ return x.d<y.d; } bitset<150> ans; int cc; int main(){ int n; scanf(“%d”,&n); for (int i=1;i<=n;++i){ scanf(“%d%d%d”,&a.t,&a.d,&a.p); a.tot=i; …

#include<stdio.h> int a, b, sum, flag; int main(void) { int n, i, p, k; scanf(“%d”, &n); for(i=1;i<=n;i++) { scanf(“%d”, &a); sum]++; } k = 0; for(i=1;i<=n;i++) { if(sum==0) b = i; } printf(“%d\n”, k); p …

#include <bits/stdc++.h> using namespace std; int main(){ int k,sum=0,end,cap,f,tank; for(cin>>end>>cap>>f>>k,tank=cap;k–;f=end-f) if(tank<f||cap<end-f) return cout<<-1,0; else if(tank>=end+(k?end-f:0)) tank-=end; else ++sum,tank=cap-(end-f); cout<<sum; }

#include <stdio.h> int c; void reset(){ for(int i=0;i<26;i++){ c=0; } } int main(){ int n,i,cur=0,max=0; scanf(“%d”,&n); char a; scanf(“%s”,a); reset(); for(i=0;i<n;i++){ if(a>=’A’ && a<=’Z’){ cur=0; reset(); } else if(c-‘a’]==0){ c-‘a’]++; cur++; } if(cur>max){ max=cur; } …

#include<cstdio> #include<iostream> using namespace std; int n,cnt,ans,A,B; int buck; int main(){ scanf(“%d”,&n); for(int i = 1;i <= n;i++){ cin >> cnt; if(!buck){ ans++; if(A) B = cnt; else A = cnt; } buck++; } if(ans …