Codeforces Round 256 (Div. 2)

Solutions for Codeforces Round 256 (Div. 2) (contest 448). 2/3 problems verified against sample I/O. Difficulty range: 800-2200.

3 items

Codeforces Round 256 (Div. 2)

Type: Div. 2 | Problems: 3 | Verified: 2/3 | Rating range: 800-2200 | Time: 3m 43s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Rewards	800	implementation	1m 14s	✓
D	Multiplication Table	1800	binary-search, brute-force	1m 14s	✓
E	Divisors	2200	brute-force, dfs-and-similar, implementation	1m 15s	✗

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.

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

CF 448E - Divisors

We are given a single starting integer $X$, and we repeatedly expand it into a sequence. One expansion step replaces every number in the sequence by all of its positive divisors, written in increasing order.