Codeforces Round 119 (Div. 2)

Solutions for Codeforces Round 119 (Div. 2) (contest 189). 2/2 problems verified against sample I/O. Difficulty range: 1300-1300.

2 items

Codeforces Round 119 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 1300-1300 | Time: 4m 24s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Cut Ribbon	1300	brute-force, dp	1m 31s	✓
B	Counting Rhombi	1300	brute-force, math	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.