Codeforces Round 192 (Div. 2)

2 problems from Codeforces Round 192 (Div. 2) (contest 330), difficulty 800-1300. 1/2 solutions verified against sample I/O.

2 items

Codeforces Round 192 (Div. 2)

Div. 2 | 2 problems | 1/2 verified | Difficulty 800-1300 | 3m 29s

# Problem Rating Tags Accepted Time ✓
A Cakeminator 800 brute-force, implementation 31,431 1m 33s ✓
B Road Construction 1300 constructive-algorithms, graphs 19,380 1m 56s
Practice › Codeforces Solutions › Codeforces Round 192 (Div. 2) ›

CF 330A - Cakeminator

We are given a small rectangular grid representing a cake. Each cell is either an ordinary cake cell (.) or contains a strawberry (S).
codeforces competitive-programming brute-force implementation Jun 6, 2026
Practice › Codeforces Solutions › Codeforces Round 192 (Div. 2) ›

CF 330B - Road Construction

We have a graph with n cities and no roads initially. Some pairs of cities are forbidden, meaning we are not allowed to build a road directly between them. We must add the smallest possible number of roads so that two conditions hold.
codeforces competitive-programming constructive-algorithms graphs Jun 6, 2026