Codeforces Beta Round 55 (Div. 2)

Solutions for Codeforces Beta Round 55 (Div. 2) (contest 59). 3/5 problems verified against sample I/O. Difficulty range: 800-2000.

5 items

Codeforces Beta Round 55 (Div. 2)

Type: Div. 2 | Problems: 5 | Verified: 3/5 | Rating range: 800-2000 | Time: 8m 58s

Problem Name Rating Tags Solve Time Verified
A Word 800 implementation, strings 1m 11s ✓
B Fortune Telling 1200 implementation, number-theory 1m 57s ✗
C Title 1600 expression-parsing 1m 53s ✓
D Team Arrangement 2000 constructive-algorithms, greedy, implementation 2m 39s ✗
E Shortest Path 2000 graphs, shortest-paths 1m 18s ✓
Practice › Codeforces Solutions › Codeforces Beta Round 55 (Div. 2) ›

CF 59A - Word

The task is to normalize the case of a single word so that either all letters are lowercase or all are uppercase.
codeforces competitive-programming implementation strings May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 55 (Div. 2) ›

CF 59B - Fortune Telling

Marina can pick any subset of flowers from the field. Each flower has a certain number of petals, and she will pluck all petals from all chosen flowers one by one. The phrases alternate between "Loves" and "Doesn't love", starting from "Loves" on the first petal.
codeforces competitive-programming implementation number-theory May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 55 (Div. 2) ›

CF 59C - Title

We are given a string template consisting of lowercase letters and question marks. The final string must satisfy three conditions simultaneously. First, it must be a palindrome, so characters mirrored around the center must match.
codeforces competitive-programming expression-parsing May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 55 (Div. 2) ›

CF 59D - Team Arrangement

We have 3n students ranked by personal performance. Higher-ranked students become captains earlier. When a captain forms a team, they choose two currently unassigned students according to their personal preference list.
codeforces competitive-programming constructive-algorithms greedy implementation May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 55 (Div. 2) ›

CF 59E - Shortest Path

We are asked to navigate a graph of cities connected by bidirectional roads, with a twist: certain sequences of three consecutive cities are forbidden due to superstition. Formally, there are n nodes and m edges, all unweighted, representing cities and roads.
codeforces competitive-programming graphs shortest-paths May 28, 2026