Codeforces Round 256 (Div. 2)

5 problems from Codeforces Round 256 (Div. 2) (contest 448), difficulty 800-2200. 5/5 solutions verified against sample I/O.

5 items

Codeforces Round 256 (Div. 2)

Div. 2 | 5 problems | 5/5 verified | Difficulty 800-2200 | 7m 28s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Rewards	800	implementation	25,900	1m 14s	✓
B	Suffix Structures	1400	implementation, strings	17,313	1m 44s	✓
C	Painting Fence	1900	divide-and-conquer, dp, greedy	10,790	1m 31s	✓
D	Multiplication Table	1800	binary-search, brute-force	16,661	1m 14s	✓
E	Divisors	2200	brute-force, dfs-and-similar, implementation	1,635	1m 45s	✓

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

CF 448E - Divisors

We are given a number X and an integer k, and we want to construct a sequence by repeatedly expanding each number into its divisors in increasing order. Formally, we define X0 as a sequence containing just X.

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

CF 448B - Suffix Structures

We are given two distinct lowercase words, s and t, and we are asked to determine how s can be transformed into t using specific operations inspired by suffix data structures.

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

CF 448C - Painting Fence

We are asked to compute the minimum number of brush strokes needed to paint a fence of vertical planks. Each plank has a width of 1 meter and an individual height. The brush is exactly 1 meter wide, and it can be applied either vertically or horizontally.

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

CF 448A - Rewards

We are given a fixed number of shelves and a collection of rewards split into two categories, cups and medals. Each category is further divided into three ranks, but for the placement logic those ranks do not matter beyond counting total items in each category.

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

CF 448D - Multiplication Table

We are working with a conceptual multiplication grid where the cell in row i and column j contains the value i × j. Instead of explicitly building this table, we imagine listing all n × m values and sorting them in non-decreasing order.