Codeforces Round 167 (Div. 2)

5 problems from Codeforces Round 167 (Div. 2) (contest 272), difficulty 1000-2200. 3/5 solutions verified against sample I/O.

5 items

Codeforces Round 167 (Div. 2)

Div. 2 | 5 problems | 3/5 verified | Difficulty 1000-2200 | 6m 49s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Dima and Friends	1000	implementation, math	27,670	1m 28s
B	Dima and Sequence	1400	implementation, math	4,288	1m 9s	✓
C	Dima and Staircase	1500	data-structures, implementation	7,200	1m 9s	✓
D	Dima and Two Sequences	1600	combinatorics, math, sortings	2,833	1m 20s	✓
E	Dima and Horses	2200	combinatorics, constructive-algorithms, graphs	1,296	1m 43s

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

CF 272A - Dima and Friends

Dima and his friends are deciding who will clean the apartment using a counting game. Everyone, including Dima, shows a number of fingers between one and five. They then count around the circle starting from Dima, with the total count equal to the sum of all fingers shown.

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

CF 272C - Dima and Staircase

The problem presents a staircase of n steps, where each step has a certain height given in a non-decreasing array a. Dima throws boxes vertically onto the staircase. Each box has a width w and a height h, and it covers the first w stairs.

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

CF 272E - Dima and Horses

We are asked to partition a group of horses into two parties in such a way that no horse has more than one enemy in the same party. The input lists the number of horses n and a number of enemy pairs m, followed by m pairs of horse indices indicating mutual enmity.

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

CF 272D - Dima and Two Sequences

We are given two lists of points. The first list fixes points on distinct vertical positions, so the i-th point is tied to index i but has an x-coordinate given by a[i].

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

CF 272B - Dima and Sequence

We are given a sequence of positive integers and a function that maps each integer to a non-negative value. The function is defined recursively: it sends zero to zero, it ignores factors of two, and every time we encounter an odd number we effectively contribute one unit and…