Codeforces Round 1049 (Div. 2)

7 problems from Codeforces Round 1049 (Div. 2) (contest 2140), difficulty 800-2900. 4/7 solutions verified against sample I/O.

7 items

Codeforces Round 1049 (Div. 2)

Div. 2 | 7 problems | 4/7 verified | Difficulty 800-2900 | 12m 22s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Shift Sort	800	greedy, sortings	22,250	1m 42s	✓
B	Another Divisibility Problem	900	constructive-algorithms, math, number-theory	22,116	1m 42s
C	Ultimate Value	1500	data-structures, games, greedy	12,363	2m 6s	✓
D	A Cruel Segment's Thesis	2000	data-structures, greedy, sortings	4,888	1m 36s
E1	Prime Gaming (Easy Version)	2200	bitmasks, combinatorics, dp	2,108	1m 59s	✓
E2	Prime Gaming (Hard Version)	2500	bitmasks, combinatorics, dp	1,237	1m 59s
F	Sum Minimisation	2900	number-theory	313	1m 18s	✓

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

CF 2140F - Sum Minimisation

We are given an array of integers and a special operation that can decrease some of its elements. For any chosen set of $k$ distinct indices, we sum the selected elements, take the remainder of this sum modulo $k$, and then decrease the smallest $y$ elements by 1, where $y$ is…

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

CF 2140E2 - Prime Gaming (Hard Version)

We have a sequence of n piles. The number of stones in each pile can be any integer from 1 to m. The game itself does not depend on the stone values while moves are being made. Players only choose positions to delete.

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

CF 2140E1 - Prime Gaming (Easy Version)

We have a row of n piles. Each pile contains either 1 or 2 stones because this is the easy version and m ≤ 2. The game does not modify pile values. Players only remove piles.

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

CF 2140D - A Cruel Segment's Thesis

We are given several intervals on a number line. Each interval represents a “resource” with a left and right boundary. Initially none of these intervals are used. We repeatedly pick two unused intervals, and from each chosen interval we pick one point inside it.

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

CF 2140C - Ultimate Value

We are given a game played on an array of integers where two players take turns performing a single action: either end the game immediately or swap two elements at positions $l$ and $r$, which adds $r-l$ to a running cost.

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

CF 2140A - Shift Sort

We are given a binary string, which is a sequence of 0s and 1s, and the goal is to sort it into non-decreasing order using a specific operation.

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

CF 2140B - Another Divisibility Problem

We are given a number $x$, and we must construct another positive integer $y$ such that a specific divisibility condition holds. The construction depends on forming a new number by concatenating the decimal representation of $x$ followed immediately by $y$.