Codeforces Round 188 (Div. 1)

5 problems from Codeforces Round 188 (Div. 1) (contest 317), difficulty 1600-3100. 4/5 solutions verified against sample I/O.

5 items

Codeforces Round 188 (Div. 1)

Div. 1 | 5 problems | 4/5 verified | Difficulty 1600-3100 | 5m 50s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Perfect Pair	1600	brute-force	4,938	1m 1s	✓
B	Ants	2000	brute-force, implementation	1,659	1m 21s	✓
C	Balance	2500	constructive-algorithms, dfs-and-similar, graphs	550	1m 26s
D	Game with Powers	2300	dp, games	1,256	1m 1s	✓
E	Princess and Her Shadow	3100	constructive-algorithms, shortest-paths	172	1m 1s	✓

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

CF 317B - Ants

We are asked to simulate the dispersal of ants on a two-dimensional integer grid. Initially, all n ants are placed at the origin (0, 0).

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

CF 317C - Balance

We are given a set of n vessels, each capable of holding up to v liters of water. Some vessels are connected by tubes that allow water to be transferred in integer amounts.

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

CF 317E - Princess and Her Shadow

We have a two-dimensional integer grid representing a forest. Each cell can be empty or contain a tree. The Princess starts at a cell (vx, vy) and her Shadow starts at (sx, sy).

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

CF 317D - Game with Powers

We are given a set of integers from 1 to n. Two players alternate turns, and each move consists of selecting a number that has not been eliminated yet.

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

CF 317A - Perfect Pair

We are given two integers, $x$ and $y$, and a target threshold $m$. A pair is considered m-perfect if at least one of the two numbers is greater than or equal to $m$.