Codeforces Round 155 (Div. 2)

Solutions for Codeforces Round 155 (Div. 2) (contest 254). 2/5 problems verified against sample I/O. Difficulty range: 1200-2300.

5 items

Codeforces Round 155 (Div. 2)

Type: Div. 2 | Problems: 5 | Verified: 2/5 | Rating range: 1200-2300 | Time: 37m 47s

Problem Name Rating Tags Solve Time Verified
A Cards with Numbers 1200 constructive-algorithms, sortings 2m 30s ✗
B Jury Size 1500 brute-force, implementation 14m 52s ✓
C Anagram 1800 greedy, strings 14m 52s ✓
D Rats 2300 brute-force, dfs-and-similar, graphs 3m 1s ✗
E Dormitory 2100 dp, implementation 2m 32s ✗
Practice › Codeforces Solutions › Codeforces Round 155 (Div. 2) ›

CF 254A - Cards with Numbers

We have 2n cards laid out in a sequence. Every card has an integer written on it, and each card also has an index from 1 to 2n. The task is to divide all cards into exactly n pairs such that both cards inside every pair contain the same number.
codeforces competitive-programming constructive-algorithms sortings May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 155 (Div. 2) ›

CF 254B - Jury Size

Each Olympiad happens on a fixed calendar date in 2013. Before that date, a group of jury members must work continuously for several days. If an Olympiad needs p people and t preparation days, then exactly p people are busy on each of the t days immediately before the Olympiad.
codeforces competitive-programming brute-force implementation May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 155 (Div. 2) ›

CF 254C - Anagram

We have two uppercase strings of equal length. We may replace characters in the first string, and after all replacements the final string only needs to be an anagram of the second string.
codeforces competitive-programming greedy strings May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 155 (Div. 2) ›

CF 254D - Rats

The problem presents a rectangular basement of a store as an n × m grid, where some cells are walls, some are empty, and some contain sleeping rats.
codeforces competitive-programming brute-force dfs-and-similar graphs implementation shortest-paths May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 155 (Div. 2) ›

CF 254E - Dormitory

Vasya receives food every morning. The food from day i can only be eaten on day i or day i + 1. Every day Vasya himself must consume exactly v kilograms.
codeforces competitive-programming dp implementation May 29, 2026