Codeforces Round 170 (Div. 1)

5 problems from Codeforces Round 170 (Div. 1) (contest 277), difficulty 1400-2800. 2/5 solutions verified against sample I/O.

5 items

Codeforces Round 170 (Div. 1)

Div. 1 | 5 problems | 2/5 verified | Difficulty 1400-2800 | 9m 3s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Learning Languages	1400	dfs-and-similar, dsu	21,564	1m 34s	✓
B	Set of Points	2300	constructive-algorithms, geometry	847	1m 51s
C	Game	2400	games, implementation	491	2m 33s
D	Google Code Jam	2800	dp, probabilities	372	1m 33s
E	Binary Tree on Plane	2400	flows, trees	1,479	1m 32s	✓

Practice › Codeforces Solutions › Codeforces Round 170 (Div. 1) ›

CF 277D - Google Code Jam

Vasya is participating in a programming round with several problems, each split into a Small and a Large input. Completing the Small input of a problem gives him a guaranteed number of points in a certain amount of time.

Practice › Codeforces Solutions › Codeforces Round 170 (Div. 1) ›

CF 277B - Set of Points

We are asked to construct a set of n points on the 2D plane such that the largest convex polygon that can be formed from these points has exactly m vertices. No three points may lie on a straight line.

Practice › Codeforces Solutions › Codeforces Round 170 (Div. 1) ›

CF 277E - Binary Tree on Plane

We are given a set of points in the plane, each with distinct coordinates, and we are asked to connect them into a directed rooted binary tree with the additional geometric constraint that every edge must go downward in the plane.

Practice › Codeforces Solutions › Codeforces Round 170 (Div. 1) ›

CF 277C - Game

Every interior grid line of the paper is divided into unit segments by the lattice points. A cut along a grid line marks all unit segments touched by the knife as already cut. The crucial observation is that the geometry of the paper never changes.

Practice › Codeforces Solutions › Codeforces Round 170 (Div. 1) ›

CF 277A - Learning Languages

We are asked to ensure that every employee at BerCorp can communicate with every other employee, either directly through a shared language or indirectly via a chain of translators.