Codeforces Round 202 (Div. 2)

2 problems from Codeforces Round 202 (Div. 2) (contest 349), difficulty 1100-1700. 2/2 solutions verified against sample I/O.

2 items

Codeforces Round 202 (Div. 2)

Div. 2 | 2 problems | 2/2 verified | Difficulty 1100-1700 | 4m 46s

# Problem Rating Tags Accepted Time ✓
A Cinema Line 1100 greedy, implementation 33,722 3m 16s ✓
B Color the Fence 1700 data-structures, dp, greedy 15,116 1m 30s ✓
Practice › Codeforces Solutions › Codeforces Round 202 (Div. 2) ›

CF 349B - Color the Fence

Igor wants to paint the largest possible number on a fence using a limited amount of paint. Each digit from 1 to 9 has a specific paint cost, and zero cannot be used.
codeforces competitive-programming data-structures dp greedy implementation Jun 6, 2026
Practice › Codeforces Solutions › Codeforces Round 202 (Div. 2) ›

CF 349A - Cinema Line

We are given a queue of people waiting to buy cinema tickets. Each person holds a bill worth 25, 50, or 100 rubles, and each ticket costs 25 rubles. The clerk starts with no money and must sell tickets in the exact order of the line, giving correct change if necessary.
codeforces competitive-programming greedy implementation Jun 6, 2026