Codeforces Round 633 (Div. 2)

2 problems from Codeforces Round 633 (Div. 2) (contest 1339), difficulty 900-1200. 1/2 solutions verified against sample I/O.

2 items

Codeforces Round 633 (Div. 2)

Div. 2 | 2 problems | 1/2 verified | Difficulty 900-1200 | 4m 46s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Filling Diamonds	900	brute-force, dp, implementation	34,204	56s	✓
B	Sorted Adjacent Differences	1200	constructive-algorithms, sortings	28,340	3m 50s

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

CF 1339B - Sorted Adjacent Differences

We are given several independent arrays, and for each one we must reorder its elements into a sequence where the absolute differences between neighboring elements never decrease as we move from left to right.

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

CF 1339A - Filling Diamonds

The task describes a fixed triangular strip that grows with a parameter $n$. For each $n$, the shape consists of $4n-2$ unit triangles arranged in a long belt-like region.