Codeforces Round 139 (Div. 2)

5 problems from Codeforces Round 139 (Div. 2) (contest 225), difficulty 1100-2200. 0/5 solutions verified against sample I/O.

5 items

Codeforces Round 139 (Div. 2)

Div. 2 | 5 problems | 0/5 verified | Difficulty 1100-2200 | 15m 45s

# Problem Rating Tags Accepted Time ✓
A Dice Tower 1100 constructive-algorithms, greedy 14,238 2m 18s
B Well-known Numbers 1600 binary-search, greedy, number-theory 3,394 3m 27s
C Barcode 1700 dp, matrices 10,162 5m 19s
D Snake 2200 bitmasks, dfs-and-similar, graphs 1,049 2m 19s
E Unsolvable 2100 math, number-theory 902 2m 22s
Practice › Codeforces Solutions › Codeforces Round 139 (Div. 2) ›

CF 225C - Barcode

Codeforces 225C: Barcode
codeforces competitive-programming dp matrices Jun 4, 2026
Practice › Codeforces Solutions › Codeforces Round 139 (Div. 2) ›

CF 225E - Unsolvable

Codeforces 225E: Unsolvable
codeforces competitive-programming math number-theory Jun 4, 2026
Practice › Codeforces Solutions › Codeforces Round 139 (Div. 2) ›

CF 225D - Snake

Codeforces 225D: Snake
codeforces competitive-programming bitmasks dfs-and-similar graphs implementation Jun 4, 2026
Practice › Codeforces Solutions › Codeforces Round 139 (Div. 2) ›

CF 225A - Dice Tower

Codeforces 225A: Dice Tower
codeforces competitive-programming constructive-algorithms greedy Jun 4, 2026
Practice › Codeforces Solutions › Codeforces Round 139 (Div. 2) ›

CF 225B - Well-known Numbers

We are given two integers, s and k. The task is to express s as a sum of distinct numbers taken from the k-bonacci sequence. The sequence behaves like Fibonacci, but instead of summing the previous two values, each term is the sum of the previous k terms.
codeforces competitive-programming binary-search greedy number-theory May 29, 2026