Codeforces Round 205 (Div. 2)

5 problems from Codeforces Round 205 (Div. 2) (contest 353), difficulty 1200-2200. 3/5 solutions verified against sample I/O.

5 items

Codeforces Round 205 (Div. 2)

Div. 2 | 5 problems | 3/5 verified | Difficulty 1200-2200 | 15m 21s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Domino	1200	implementation, math	19,990	4m 19s	✓
B	Two Heaps	1900	combinatorics, constructive-algorithms, greedy	2,433	2m 40s	✓
C	Find Maximum	1600	implementation, math, number-theory	5,262	4m 34s
D	Queue	2000	constructive-algorithms, dp	3,187	1m 10s	✓
E	Antichain	2200	dp, graph-matchings, greedy	672	2m 38s

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

CF 353A - Domino

We have a row of domino tiles. Each tile has a number on its upper half and a number on its lower half. For every tile, we may either leave it as it is or rotate it by 180 degrees. Rotating a tile simply swaps its upper and lower values. Each rotation costs one second.

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

CF 353C - Find Maximum

We are given an array of non-negative integers a with length n and a number m in binary form. We want to select a subset of indices from 0 to n-1 and sum the corresponding a[i] values, but with a twist: the subset corresponds to the binary representation of some integer x…

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

CF 353E - Antichain

Codeforces 353E: Antichain

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

CF 353D - Queue

We are given a line of schoolchildren represented as a string of letters M and F, where M indicates a boy and F a girl. Each second, any boy standing immediately in front of a girl swaps positions with her. This process repeats until no boy is in front of a girl.

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

CF 353B - Two Heaps

Each cube contains a two digit number. We must split the 2n cubes into two heaps of exactly n cubes each. After the split, Valera may choose any cube from the first heap and any cube from the second heap.