Codeforces Beta Round 49 (Div. 2)

Solutions for Codeforces Beta Round 49 (Div. 2) (contest 53). 4/5 problems verified against sample I/O. Difficulty range: 1100-2500.

5 items

Codeforces Beta Round 49 (Div. 2)

Type: Div. 2 | Problems: 5 | Verified: 4/5 | Rating range: 1100-2500 | Time: 13m 28s

Problem Name Rating Tags Solve Time Verified
A Autocomplete 1100 implementation 3m 28s ✓
B Blog Photo 1700 binary-search, implementation 2m 21s ✓
C Little Frog 1200 constructive-algorithms 1m 35s ✓
D Physical Education 1500 sortings 2m 6s ✓
E Dead Ends 2500 bitmasks, dp 3m 58s ✗
Practice › Codeforces Solutions › Codeforces Beta Round 49 (Div. 2) ›

CF 53A - Autocomplete

We are asked to implement a simplified autocomplete function. The input consists of a string s, which represents the text the user has typed so far, followed by a list of previously visited pages.
codeforces competitive-programming implementation May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 49 (Div. 2) ›

CF 53B - Blog Photo

We are given the dimensions of an uploaded photo, height h and width w. We want to cut out a smaller rectangle from it. The cut rectangle must satisfy three conditions.
codeforces competitive-programming binary-search implementation May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 49 (Div. 2) ›

CF 53C - Little Frog

We have n mounds placed on a straight line at positions 1, 2, ..., n. The frog wants to visit every mound exactly once, so we must output a permutation of these positions.
codeforces competitive-programming constructive-algorithms May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 49 (Div. 2) ›

CF 53D - Physical Education

We have two arrays representing the order of students in a line. Array a is the desired arrangement, and array b is the current arrangement. In one operation we may swap two neighboring students. We must output any sequence of adjacent swaps that transforms b into a.
codeforces competitive-programming sortings May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 49 (Div. 2) ›

CF 53E - Dead Ends

We are given an undirected connected graph representing roads between junctions. The mayor wants to remove some roads so that the remaining graph becomes a tree, meaning it stays connected and contains exactly n - 1 edges.
codeforces competitive-programming bitmasks dp May 28, 2026