Codeforces Round 167 (Div. 2)

Solutions for Codeforces Round 167 (Div. 2) (contest 272). 2/3 problems verified against sample I/O. Difficulty range: 1400-2200.

3 items

Codeforces Round 167 (Div. 2)

Type: Div. 2 | Problems: 3 | Verified: 2/3 | Rating range: 1400-2200 | Time: 5m 30s

Problem	Name	Rating	Tags	Solve Time	Verified
B	Dima and Sequence	1400	implementation, math	1m 30s	✓
C	Dima and Staircase	1500	data-structures, implementation	1m 28s	✓
E	Dima and Horses	2200	combinatorics, constructive-algorithms, graphs	2m 32s	✗

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

CF 272B - Dima and Sequence

We are given an array of positive integers. For every number x, a recursive function f(x) is defined as: $f(0)=0,quad f(2x)=f(x),quad f(2x+1)=f(x)+1$ The task is to count how many index pairs (i, j) with i < j satisfy f(ai) = f(aj).

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

CF 272C - Dima and Staircase

We have a staircase where the height of stair i is a[i], and the heights are already sorted in non-decreasing order. Boxes are dropped one after another. A box with width w covers exactly the first w stairs, meaning its horizontal span is above stairs 1..w.

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

CF 272E - Dima and Horses

We are given an undirected graph where each vertex represents a horse and each edge represents mutual enmity. We must color every vertex with one of two colors, corresponding to the two parties, such that every horse has at most one enemy inside its own party.