Codeforces Round 176 (Div. 1)

Solutions for Codeforces Round 176 (Div. 1) (contest 286). 2/2 problems verified against sample I/O. Difficulty range: 2200-2800.

2 items

Codeforces Round 176 (Div. 1)

Type: Div. 1 | Problems: 2 | Verified: 2/2 | Rating range: 2200-2800 | Time: 2m 31s

Problem	Name	Rating	Tags	Solve Time	Verified
B	Shifting	2200	implementation	1m 1s	✓
E	Ladies' Shop	2800	constructive-algorithms, fft, math	1m 30s	✓

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

CF 286B - Shifting

We are asked to construct a "beautiful permutation" of the integers from 1 to n, where n can be as large as one million. The permutation is built by repeatedly applying a block-cyclic left shift operation on increasing block sizes.

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

CF 286E - Ladies' Shop

We are given a collection of “bag capacities” $a1 < a2 < dots < an$, each capacity describing a special requirement: the bag can exactly accommodate some multiset of item weights whose sum is exactly that capacity, but it is forbidden to use a configuration whose total…