Friday, November 15, 2024
Sponsors

Tag: Codeforces Round #436 (Div. 2)

Codeforces Round #436 (Div....

C/C++
#include<cstdio> #include<algorithm> #include<cstring> using namespace std; const int N = 3005, INF =...
Read more

Codeforces Round #436 (Div....

C/C++
#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...
Read more

Codeforces Round #436 (Div....

Uncategorized
#include<stdio.h> int a, b, sum, flag; int main(void) { int n, i, p,...
Read more

Codeforces Round #436 (Div....

C/C++
#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))...
Read more

Codeforces Round #436 (Div....

C/C++
#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' &&...
Read more

Codeforces Round #436 (Div....

C/C++
#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...
Read more

Advertisement

spot_img

EDITOR PICKS

POPULAR POSTS

POPULAR CATEGORY

© E-Blogarithm 2016