Codeforces Round 119 (Div. 2)

2 problems from Codeforces Round 119 (Div. 2) (contest 189), difficulty 1300-1300. 2/2 solutions verified against sample I/O.

2 items

Codeforces Round 119 (Div. 2)

Div. 2 | 2 problems | 2/2 verified | Difficulty 1300-1300 | 4m 24s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Cut Ribbon	1300	brute-force, dp	80,835	1m 31s	✓
B	Counting Rhombi	1300	brute-force, math	4,218	2m 53s	✓

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

CF 189A - Cut Ribbon

We have a ribbon of total length n. Every cut piece must have one of exactly three allowed lengths: a, b, or c. The goal is not just to split the ribbon successfully, but to maximize how many total pieces we obtain.

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

CF 189B - Counting Rhombi

We are asked to count rhombi inside a rectangle of width w and height h, where each rhombus has its vertices on integer coordinates and diagonals aligned with the axes. Each rhombus must have positive area and be fully contained in the rectangle.