Codeforces Round 160 (Div. 1)

5 problems from Codeforces Round 160 (Div. 1) (contest 261), difficulty 1400-2800. 3/5 solutions verified against sample I/O.

5 items

Codeforces Round 160 (Div. 1)

Div. 1 | 5 problems | 3/5 verified | Difficulty 1400-2800 | 10m 32s

# Problem Rating Tags Accepted Time ✓
A Maxim and Discounts 1400 greedy, sortings 5,608 3m 10s ✓
B Maxim and Restaurant 1900 dp, math, probabilities 1,612 2m 19s
C Maxim and Matrix 2000 constructive-algorithms, dp, math 836 1m 11s ✓
D Maxim and Increasing Subsequence 2600 dp 714 2m 12s
E Maxim and Calculator 2800 brute-force, dp, two-pointers 438 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”.
codeforces competitive-programming greedy sortings May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 160 (Div. 1) ›

CF 261B - Maxim and Restaurant

Codeforces 261B: Maxim and Restaurant
codeforces competitive-programming dp math probabilities May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 160 (Div. 1) ›

CF 261C - Maxim and Matrix

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.
codeforces competitive-programming constructive-algorithms dp math May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 160 (Div. 1) ›

CF 261D - Maxim and Increasing Subsequence

Codeforces 261D: Maxim and Increasing Subsequence
codeforces competitive-programming dp May 29, 2026
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 competitive-programming brute-force dp two-pointers May 29, 2026