Codeforces Round 128 (Div. 2)

5 problems from Codeforces Round 128 (Div. 2) (contest 203), difficulty 1200-2300. 4/5 solutions verified against sample I/O.

5 items

Codeforces Round 128 (Div. 2)

Div. 2 | 5 problems | 4/5 verified | Difficulty 1200-2300 | 6m 39s

# Problem Rating Tags Accepted Time ✓
A Two Problems 1200 brute-force, implementation 4,423 1m 6s ✓
B Game on Paper 1300 brute-force, implementation 2,786 1m 41s ✓
C Photographer 1400 greedy, sortings 6,063 1m 5s ✓
D Hit Ball 1700 geometry, implementation, math 1,513 1m 20s
E Transportation 2300 greedy, sortings, two-pointers 309 1m 27s ✓
Practice › Codeforces Solutions › Codeforces Round 128 (Div. 2) ›

CF 203A - Two Problems

There are two independent tasks available during a contest that lasts from minute 0 up to minute t minus 1. Each task has a score that decreases linearly with time.
codeforces competitive-programming brute-force implementation May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 128 (Div. 2) ›

CF 203B - Game on Paper

We have an n × n grid that starts completely white. Cells are painted black one by one, and every move paints a different cell. After each move, we want to know whether the board already contains a completely black 3 × 3 square.
codeforces competitive-programming brute-force implementation May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 128 (Div. 2) ›

CF 203C - Photographer

Each client describes a fixed amount of work Valera must perform: a certain number of low quality photos and a certain number of high quality photos.
codeforces competitive-programming greedy sortings May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 128 (Div. 2) ›

CF 203D - Hit Ball

We are asked to simulate a three-dimensional billiard-like scenario where a ball travels inside a rectangular corridor with perfectly reflecting walls, floor, and ceiling.
codeforces competitive-programming geometry implementation math May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 128 (Div. 2) ›

CF 203E - Transportation

We are tasked with transporting robots across a fixed distance using a limited fuel supply. Each robot has three characteristics: the number of other robots it can carry, the amount of fuel it consumes to move on its own, and the maximum distance it can travel.
codeforces competitive-programming greedy sortings two-pointers May 29, 2026