# Based on Technocup 2017 – Elimination Round 2)

/Tag: Based on Technocup 2017 - Elimination Round 2)

## Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 – Elimination Round 2), problem: (F) Dirty plates Solution in C/C++

By |2017-04-07T22:11:49+06:00November 21st, 2016|Categories: C/C++, Programming||

Hi Guys , I Just Tried to solve the Dirty plates problem , hope you might like it , please share if you've any better code .   #include <iostream> #include <fstream> #include <set> #include <map> #include <string> #include <vector> #include <bitset> #include <algorithm> [...]

## Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 – Elimination Round 2), problem: (E) Tanya is 5! Solution in C/C++

By |2017-04-07T22:11:49+06:00November 21st, 2016|Categories: C/C++, Programming||

Hi Guys , I Just Tried to solve the Tanya is 5! problem , hope you might like it , please share if you've any better code .     #include <bits/stdc++.h> #define time privet #define F first #define S second using namespace std; [...]

## Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 – Elimination Round 2), problem: (D) Financiers Game Solution in C/C++

By |2017-04-07T22:11:49+06:00November 21st, 2016|Categories: C/C++, Programming||

Hi Guys , I Just Tried to solve the Financiers Game problem , hope you might like it , please share if you've any better code .   #define _CRT_SECURE_NO_DEPRECATE #include <iostream> #include <string> #include <vector> #include <sstream> #include <queue> #include <algorithm> #include <iomanip> [...]

## Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 – Elimination Round 2), problem: (C) Subordinates Solution in C/C++

By |2017-04-07T22:11:49+06:00November 21st, 2016|Categories: C/C++, Programming||

Hi Guys , I Just Tried to solve the Subordinates problem , hope you might like it , please share if you've any better code .   #include<stdio.h> #include<stdlib.h> typedef unsigned u; u Z[222222],R[222222],C[222222]; int main() { u n,s,i,k,fz=0,fnz=0,x,a=-1u; scanf("%u%u",&n,&s);--s; for(i=-1;++i<n;) { scanf("%u",&k); if(!k&&i!=s)++fz; [...]

## Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 – Elimination Round 2), problem: (B) Sea Battle Solution in C/C++

By |2017-04-07T22:11:49+06:00November 21st, 2016|Categories: C/C++, Programming||

Hi Guys , I Just Tried to solve the Sea Battle problem , hope you might like it , please share if you've any better code . #include<stdio.h> #include<stdlib.h> typedef unsigned u; char S[222222];u Q[222222],Qi; int main() { u n,a,b,i,j,k; scanf("%u%u%u%u%s",&n,&a,&b,&k,S); for(i=-1,j=0;++i<n;) { //printf("!%u [...]

## Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 – Elimination Round 2), problem: (A) Road to Cinema Solution in C/C++

By |2017-04-07T22:11:49+06:00November 21st, 2016|Categories: C/C++, Programming||

Hi Guys , I Just Tried to solve the Road to Cinema problem , hope you might like it , please share if you've any better code . #include #include typedef long long unsigned llu; typedef unsigned u; int F(const void*x,const void*y){return*(int*)x-*(int*)y;} u G[222222],C[222222],V[222222]; [...]