Codeforces Round 113 (Div. 2)

Solutions for Codeforces Round 113 (Div. 2) (contest 166). 5/5 problems verified against sample I/O. Difficulty range: 1100-2500.

5 items

Codeforces Round 113 (Div. 2)

Type: Div. 2 | Problems: 5 | Verified: 5/5 | Rating range: 1100-2500 | Time: 11m 49s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Rank List	1100	binary-search, implementation, sortings	1m 31s	✓
B	Polygons	2100	geometry, sortings	3m 7s	✓
C	Median	1500	greedy, math, sortings	1m 37s	✓
D	Shoe Store	2500	dp, graph-matchings, greedy	2m 34s	✓
E	Tetrahedron	1500	dp, math, matrices	3m	✓

Practice › Codeforces Solutions › Codeforces Round 113 (Div. 2) ›

CF 166A - Rank List

We are given the final results of a programming contest. Each team has two values attached to it: how many problems it solved and its total penalty time. The ranking rule is the standard ICPC-style ordering. A team ranks higher if it solved more problems.

Practice › Codeforces Solutions › Codeforces Round 113 (Div. 2) ›

CF 166B - Polygons

We are asked to determine whether one polygon is completely contained inside another. Polygon A is strictly convex, meaning all internal angles are less than 180 degrees and no three consecutive points are collinear.

Practice › Codeforces Solutions › Codeforces Round 113 (Div. 2) ›

CF 166C - Median

We start with an array of integers and a target value x. We may append any number of extra integers to the array, and we want the median of the final array to become exactly x. The task is to compute the smallest number of added elements needed to make that happen.

Practice › Codeforces Solutions › Codeforces Round 113 (Div. 2) ›

CF 166D - Shoe Store

We have a collection of shoes, where every shoe has a unique size and a price. We also have customers, where each customer has a budget and a foot size. A customer can buy a shoe only if two conditions hold.

Practice › Codeforces Solutions › Codeforces Round 113 (Div. 2) ›

CF 166E - Tetrahedron

We are asked to count the number of ways an ant can start at vertex D of a tetrahedron and return to D after exactly n steps, moving along edges at every step. The tetrahedron has four vertices labeled A, B, C, D, and each vertex is connected to the other three.