# Div. 1 + Div. 2) Archive

## Codeforces Round #436 (Div. 2), problem: (E) Fire Solution In 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 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; …

## Codeforces Round #436 (Div. 2), problem: (C) Bus Solution In 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)) tank-=end; else ++sum,tank=cap-(end-f); cout<<sum; }

## Codeforces Round #436 (Div. 2), problem: (B) Polycarp and Letters Solution In 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’ && a<=’Z’){ cur=0; reset(); } else if(c-‘a’]==0){ c-‘a’]++; cur++; } if(cur>max){ max=cur; } …

## Codeforces Round #436 (Div. 2), problem: (A) Fair Game Solution In 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 <= n;i++){ cin >> cnt; if(!buck){ ans++; if(A) B = cnt; else A = cnt; } buck++; } if(ans …

## Codeforces Round #429 (Div. 1), problem: (E) In a Trap Solution In Java

import java.io.*; import java.util.*; public class E { int a; static final int LOG = 8; static final int BLOCK = 1 << LOG; static final int LOW_MASK = BLOCK – 1; int head; int …

## Codeforces Round #429 (Div. 1), problem: (D) Destiny Solution In C/C++

#include <bits/stdc++.h> using namespace std; const int maxN = 3e5+10, base = 1e9+7; int N, Q, ans, valmid, A; bool cmp(int x) { return x <= valmid; } struct wavelet_tree { int low, high; wavelet_tree …

## Codeforces Round #429 (Div. 2), problem: (E) On the Bench Solution In C/C++

#include<bits/stdc++.h> #define ll long long int #define LL long long int #define ULL unsigned long long int #define sf(a) scanf(“%d”,&a) #define sl(a) scanf(“%lld”,&a) #define fr first #define sc second #define pii pair<int,int> #define pll pair<LL,LL> …

## Codeforces Round #429 (Div. 2), problem: (D) Leha and another game about graph Solution In C/C++

#include<cstdio> using namespace std; const int MAXN = 300000+5; const int MAXE = MAXN*2; int to, nxt, head, ne; void addEdge(int f, int t) { to = t; nxt = head; head = ne; } …

## Codeforces Round #429 (Div. 2), problem: (C) Leha and Function Solution In C/C++

#include<bits/stdc++.h> using namespace std; int main(){ std::ios::sync_with_stdio(false); int m; cin>>m; int a,b; for(int i=0;i<m;i++) cin>>a; vector<pair<int,int> >br(m); for(int i=0;i<m;i++){ cin>>b; br=make_pair(b,i); } sort(a,a+m); int ans; sort(br.begin(),br.end()); reverse(br.begin(),br.end()); for(int i=0;i<m;i++) ans.second]=a; for(int i=0;i<m;i++) cout<<ans<<” “; return …

## Codeforces Round #429 (Div. 2), problem: (B) Godsend Solution In C/C++

#include<cstdio> int main() { int n;int t;scanf(“%d”,&n); for(int i=1;i<=n;i++) {scanf(“%d”,&t); if(t%2) { printf(“First”); return 0; } } printf(“Second”); return 0; }