Educational Codeforces Round 182 (Rated for Div. 2)

7 problems from Educational Codeforces Round 182 (Rated for Div. 2) (contest 2144), difficulty 800-2700. 2/7 solutions verified against sample I/O.

7 items

Educational Codeforces Round 182 (Rated for Div. 2)

Div. 2 | 7 problems | 2/7 verified | Difficulty 800-2700 | 13m 2s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Cut the Array	800	brute-force, constructive-algorithms, math	21,671	1m 43s
B	Maximum Cost Permutation	1000	constructive-algorithms, greedy	18,465	2m 10s
C	Non-Descending Arrays	1300	combinatorics, dp, math	14,978	1m 29s	✓
D	Price Tags	1800	brute-force, dp, math	6,997	1m 53s
E1	Looking at Towers (easy version)	2200	combinatorics, dp	2,557	3m 7s
E2	Looking at Towers (difficult version)	2500	combinatorics, data-structures, dp	1,436	1m 28s
F	Bracket Groups	2700	brute-force, constructive-algorithms, dp	918	1m 12s	✓

Practice › Codeforces Solutions › Educational Codeforces Round 182 (Rated for Div. 2) ›

CF 2144E1 - Looking at Towers (easy version)

We are given an array of tower heights, and we consider subsequences formed by deleting some elements while preserving order. For any chosen subsequence, we “scan” it from the left and record every element that is strictly larger than all previously seen elements.

Practice › Codeforces Solutions › Educational Codeforces Round 182 (Rated for Div. 2) ›

CF 2144F - Bracket Groups

We are given several bracket strings, each of length at most $k$, and we must assign every string to exactly one group. For each group we also construct a single “reference” regular bracket sequence of length exactly $k$.

Practice › Codeforces Solutions › Educational Codeforces Round 182 (Rated for Div. 2) ›

CF 2144E2 - Looking at Towers (difficult version)

We are given a sequence of tower heights and need to count subsequences that preserve the "visibility from left" and "visibility from right" sets.

Practice › Codeforces Solutions › Educational Codeforces Round 182 (Rated for Div. 2) ›

CF 2144D - Price Tags

We are running a clearance sale for a store with multiple items, each with a fixed original price. The store allows a uniform discount via division by an integer factor $x 1$, where the new price of an item is the ceiling of its original price divided by $x$.

Practice › Codeforces Solutions › Educational Codeforces Round 182 (Rated for Div. 2) ›

CF 2144B - Maximum Cost Permutation

We are given an array p of length n where some positions contain integers from 1 to n and others are zeros. No positive integer appears more than once.

Practice › Codeforces Solutions › Educational Codeforces Round 182 (Rated for Div. 2) ›

CF 2144A - Cut the Array

We are given an array of non-negative integers and are asked to split it into three contiguous non-empty subarrays: a prefix, a middle part, and a suffix. For each subarray, we calculate the sum modulo 3.

Practice › Codeforces Solutions › Educational Codeforces Round 182 (Rated for Div. 2) ›

CF 2144C - Non-Descending Arrays

We are given two integer arrays of the same length, a and b. At each index, we can either leave the elements as they are or swap a[i] with b[i]. After performing any subset of these swaps, both arrays must be non-descending for the subset to be considered "good.