Codeforces Round 156 (Div. 2)

5 problems from Codeforces Round 156 (Div. 2) (contest 255), difficulty 800-2200. 5/5 solutions verified against sample I/O.

5 items

Codeforces Round 156 (Div. 2)

Div. 2 | 5 problems | 5/5 verified | Difficulty 800-2200 | 10m 7s

# Problem Rating Tags Accepted Time ✓
A Greg's Workout 800 implementation 31,192 2m 19s ✓
B Code Parsing 1200 implementation 5,459 2m 19s ✓
C Almost Arithmetical Progression 1500 brute-force, dp 5,049 2m 19s ✓
D Mr. Bender and Square 1800 binary-search, implementation, math 2,198 1m 19s ✓
E Furlo and Rublo and Game 2200 games, implementation, math 977 1m 51s ✓
Practice › Codeforces Solutions › Codeforces Round 156 (Div. 2) ›

CF 255A - Greg's Workout

Greg performs exercises in a fixed repeating order. The first exercise trains the chest, the second trains the biceps, the third trains the back, then the pattern repeats again: chest, biceps, back, and so on.
codeforces competitive-programming implementation May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 156 (Div. 2) ›

CF 255B - Code Parsing

We are given a string consisting solely of the characters "x" and "y". Two operations can be applied repeatedly in a specific order. The first operation swaps a consecutive "y" followed by "x" into "x" then "y". The second operation removes a consecutive "x" followed by "y".
codeforces competitive-programming implementation May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 156 (Div. 2) ›

CF 255C - Almost Arithmetical Progression

We are given a sequence of integers and asked to find the longest subsequence that forms an almost arithmetical progression.
codeforces competitive-programming brute-force dp May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 156 (Div. 2) ›

CF 255D - Mr. Bender and Square

We are asked to simulate the spread of a signal across an n × n grid. Initially, a single cell at row x and column y is turned on, and in each second, any cell that is side-adjacent to a turned-on cell also turns on.
codeforces competitive-programming binary-search implementation math May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 156 (Div. 2) ›

CF 255E - Furlo and Rublo and Game

We have several independent piles of coins. A move picks one pile with size x and replaces it with some smaller value y such that $$x^{1/4} le y le x^{1/2}$$ and y < x. The player who cannot make a move loses.
codeforces competitive-programming games implementation math May 29, 2026