Codeforces Round 160 (Div. 1)

Solutions for Codeforces Round 160 (Div. 1) (contest 261). 3/3 problems verified against sample I/O. Difficulty range: 1400-2800.

5 items

Codeforces Round 160 (Div. 1)

Type: Div. 1 | Problems: 3 | Verified: 3/3 | Rating range: 1400-2800 | Time: 6m 1s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Maxim and Discounts	1400	greedy, sortings	3m 10s	✓
C	Maxim and Matrix	2000	constructive-algorithms, dp, math	1m 11s	✓
E	Maxim and Calculator	2800	brute-force, dp, two-pointers	1m 40s	✓

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

CF 261A - Maxim and Discounts

We are given a list of item prices and a collection of discount types. Each discount type describes how many items must be placed in a “paid group”.

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

CF 261B - Maxim and Restaurant

Codeforces 261B: Maxim and Restaurant

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

We are given a very large range of possible values for a parameter m, and for each such value a deterministic procedure produces a matrix filled using bitwise XOR rules. The matrix has size (m + 1) by (m + 1), and the filling follows a fixed recursive or constructive pattern.

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

CF 261D - Maxim and Increasing Subsequence

Codeforces 261D: Maxim and Increasing Subsequence

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

CF 261E - Maxim and Calculator

We are given a very small computational system that starts from two registers: the first register begins at 1 and the second at 0. From this starting point we can repeatedly apply two operations. One operation increments the second register by 1.

Codeforces Round 160 (Div. 1)

Codeforces Round 160 (Div. 1)

CF 261A - Maxim and Discounts

CF 261B - Maxim and Restaurant

CF 261C - Maxim and Matrix

CF 261D - Maxim and Increasing Subsequence

CF 261E - Maxim and Calculator