Tag: Codeforces Round #436 (Div. 2)
Codeforces Round #436 (Div....
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int N = 3005, INF =...
Codeforces Round #436 (Div....
#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...
Codeforces Round #436 (Div....
#include<stdio.h>
int a, b, sum, flag;
int main(void)
{
int n, i, p,...
Codeforces Round #436 (Div....
#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))...
Codeforces Round #436 (Div....
#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' &&...
Codeforces Round #436 (Div....
#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...