Tag: based on VK Cup Finals)
Codeforces Round #423 (Div....
import java.io.*;
import java.util.*;
import sun.security.pkcs11.Secmod.DbMode;
public class F {
static class Edge...
Codeforces Round #423 (Div....
#include<bits/stdc++.h>
#define pi acos(-1)
#define maxn 1148576
using namespace std;
typedef long long...
Codeforces Round #423 (Div....
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <map>
#include <ctime>
#include...
Codeforces Round #423 (Div....
#include <cstdio>
int main(){
int n, k;
scanf("%d%d", &n, &k);
int l =...
Codeforces Round #423 (Div....
#include<bits/stdc++.h>
using namespace std;
const int maxn=2e6+5;
int main()
{
char a={};
int n,k,i;
cin>>n;
while(n--){
string x;
cin>>x>>k;
int...
Codeforces Round #423 (Div....
#include <iostream>
using namespace std;
int main()
{
int n,a,b,bg=0,d=0,x;
cin>>n>>a>>b;
while(n--){
cin>>x;
if(x==1)
{if(a)a--;
else if(b)b--,bg++;
else if(bg)bg--;
else d++;
}
else...
Codeforces Round #424 (Div....
#include <bits/stdc++.h>
using namespace std;
#define inf 1023456789
#define linf 1023456789123456789ll
#define pii...
Codeforces Round #424 (Div....
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#define LL long long
using namespace...
Codeforces Round #424 (Div....
#include<cstdio>
#include<algorithm>
using namespace std;
int n,a; long long k,ans=0;
int main(){
scanf("%d%lld",&n,&k);
for (int...
Codeforces Round #424 (Div....
#include<bits/stdc++.h>
using namespace std;
const int maxn=2e3+5;
int main(){
int n,k,p,a,b;
int res=INT_MAX,i,j;
cin>>n>>k>>p;
for(i=0;i<n;i++) scanf("%d",a+i);
for(i=0;i<k;i++)...
Codeforces Round #424 (Div....
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin>>k>>n;
int t;
int arr;
set<int>c;
for(int i=0;i<k;i++){
cin>>t;
arr= arr+t;
}
for(int...
Codeforces Round #424 (Div....
#include <bits/stdc++.h>
using namespace std;
string s1, s2, t;
int main() {
cin...