Codeforces Round 252 (Div. 2)

Solutions for Codeforces Round 252 (Div. 2) (contest 441). 1/3 problems verified against sample I/O. Difficulty range: 1000-2400.

3 items

Codeforces Round 252 (Div. 2)

Type: Div. 2 | Problems: 3 | Verified: 1/3 | Rating range: 1000-2400 | Time: 4m 27s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Valera and Antique Items	1000	implementation	1m 21s	✓
D	Valera and Swaps	2100	constructive-algorithms, dsu, graphs	1m 26s	✗
E	Valera and Number	2400	bitmasks, dp, math	1m 40s	✗

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

CF 441A - Valera and Antique Items

Valera wants to buy exactly one antique item from a set of sellers. Each seller offers multiple items with a current auction price. Valera can only secure a deal if he offers strictly more than the current price of an item, and he has a fixed budget v.

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

CF 441D - Valera and Swaps

We are given a permutation, which we can think of as a row of numbered positions, where each position contains a distinct value from 1 to n. A swap operation exchanges two positions, and after a sequence of swaps we obtain another permutation.

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

CF 441E - Valera and Number

We are asked to model a simple randomized iterative process. We start with a number $x$ and perform $k$ steps. In each step, a random number between 1 and 100 is drawn. With probability $p/100$, the current number is doubled; otherwise, it is incremented by 1.