Codeforces Round 924 (Div. 2)

Solutions for Codeforces Round 924 (Div. 2) (contest 1928). 2/6 problems verified against sample I/O. Difficulty range: 800-2900.

6 items

Codeforces Round 924 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 2/6 | Rating range: 800-2900 | Time: 15m 28s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Rectangle Cutting	800	geometry, math	5m 37s	✗
B	Equalize	1200	binary-search, greedy, sortings	2m	✗
C	Physical Education Lesson	1600	brute-force, math, number-theory	1m 45s	✓
D	Lonely Mountain Dungeons	1900	brute-force, data-structures, greedy	2m 3s	✓
E	Modular Sequence	2300	brute-force, constructive-algorithms, dp	1m 38s	✗
F	Digital Patterns	2900	combinatorics, data-structures, implementation	2m 25s	✗

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

CF 1928F - Digital Patterns

We are given a grid-like scarf made by interweaving horizontal threads with vertical threads. Each horizontal thread has a transparency coefficient, as does each vertical thread. When interwoven, the cell at row i and column j has transparency equal to a[i] + b[j].

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

CF 1928A - Rectangle Cutting

We are given a rectangle with sides $a$ and $b$, and we are asked whether it is possible to cut this rectangle along a line parallel to one of its sides into two smaller rectangles with integer dimensions, and then use these two pieces to form a rectangle that is different in…

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

CF 1928D - Lonely Mountain Dungeons

We are asked to assemble an army from multiple races, each with a certain number of creatures. Each creature pair from the same race, if they are placed in different squads, contributes a fixed amount b to the army’s strength.

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

CF 1928E - Modular Sequence

We are building a sequence starting from a fixed initial value, and each next value is determined by choosing between two operations. One operation increases the current value by a fixed step size y, and the other replaces the current value by its remainder when divided by y.

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

CF 1928B - Equalize

The problem gives us an array of integers and asks us to maximize the number of equal elements after adding a permutation of numbers from 1 to n to the array.

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

CF 1928C - Physical Education Lesson

We are given a scenario in which students line up according to a repeating "first-$k$-th" pattern. The sequence starts with numbers $1$ to $k$, then reverses from $k-1$ down to $2$, and this whole block repeats every $2k-2$ positions.