Codeforces Beta Round 89 (Div. 2)

Solutions for Codeforces Beta Round 89 (Div. 2) (contest 118). 4/5 problems verified against sample I/O. Difficulty range: 1000-2000.

5 items

Codeforces Beta Round 89 (Div. 2)

Type: Div. 2 | Problems: 5 | Verified: 4/5 | Rating range: 1000-2000 | Time: 10m 4s

Problem Name Rating Tags Solve Time Verified
A String Task 1000 implementation, strings 1m 38s ✓
B Present from Lena 1000 constructive-algorithms, implementation 1m 42s ✓
C Fancy Number 1900 brute-force, greedy, sortings 2m 51s ✓
D Caesar's Legions 1700 dp 1m 37s ✓
E Bertown roads 2000 dfs-and-similar, graphs 2m 16s ✗
Practice › Codeforces Solutions › Codeforces Beta Round 89 (Div. 2) ›

CF 118A - String Task

We receive a single string containing uppercase and lowercase English letters. The task is to transform this string according to three rules. First, every vowel must be removed. The vowels in this problem are A, O, Y, E, U, I in both uppercase and lowercase forms.
codeforces competitive-programming implementation strings May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 89 (Div. 2) ›

CF 118B - Present from Lena

We need to print a symmetric diamond made from numbers. The middle row contains numbers increasing from 0 up to n, then decreasing back to 0. Every row above and below follows the same pattern with a smaller maximum value.
codeforces competitive-programming constructive-algorithms implementation May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 89 (Div. 2) ›

CF 118C - Fancy Number

We are given a string of digits representing a car number. The number is considered beautiful if at least k positions contain the same digit. We may change any digit into another digit, and changing digit a into digit b costs The task has two objectives.
codeforces competitive-programming brute-force greedy sortings strings May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 89 (Div. 2) ›

CF 118D - Caesar's Legions

We are asked to count the number of ways to line up Caesar’s soldiers, consisting of a given number of footmen and horsemen, so that no more than a fixed number of the same type stand consecutively.
codeforces competitive-programming dp May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 89 (Div. 2) ›

CF 118E - Bertown roads

We are given a connected undirected graph representing the road network of Bertown, where junctions are nodes and roads are edges.
codeforces competitive-programming dfs-and-similar graphs May 28, 2026