Codeforces Beta Round 77 (Div. 1 Only)

Solutions for Codeforces Beta Round 77 (Div. 1 Only) (contest 95). 5/5 problems verified against sample I/O. Difficulty range: 1600-2500.

5 items

Codeforces Beta Round 77 (Div. 1 Only)

Type: Div. 1 | Problems: 5 | Verified: 5/5 | Rating range: 1600-2500 | Time: 7m 52s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Hockey	1600	implementation, strings	1m 15s	✓
B	Lucky Numbers	1800	dp, greedy	1m 52s	✓
C	Volleyball	1900	shortest-paths	1m 21s	✓
D	Horse Races	2500	dp, math	2m	✓
E	Lucky Country	2500	dp, dsu, graphs	1m 24s	✓

Practice › Codeforces Solutions › Codeforces Beta Round 77 (Div. 1 Only) ›

CF 95A - Hockey

We are given a string representing a hockey team name and a list of forbidden substrings. Our task is to modify the original string so that any letter that is part of a forbidden substring can be replaced with another letter of our choosing.

Practice › Codeforces Solutions › Codeforces Beta Round 77 (Div. 1 Only) ›

CF 95B - Lucky Numbers

We need to construct the smallest number that is at least n and satisfies two conditions simultaneously. Every digit must be either 4 or 7, and the total count of 4s must equal the total count of 7s. The input is a decimal string that can be extremely long, up to 10^5 digits.

Practice › Codeforces Solutions › Codeforces Beta Round 77 (Div. 1 Only) ›

CF 95C - Volleyball

The problem presents a weighted undirected graph where nodes represent junctions and edges represent roads with a given length. At each junction, there is a taxi that can carry a passenger up to a maximum distance and charges a fixed cost.

Practice › Codeforces Solutions › Codeforces Beta Round 77 (Div. 1 Only) ›

CF 95D - Horse Races

We are given several intervals of integers. For every interval $[l, r]$, we must count how many numbers contain two lucky digits, either 4 or 7, whose positions differ by at most k. Positions are counted inside the decimal representation of the number.

Practice › Codeforces Solutions › Codeforces Beta Round 77 (Div. 1 Only) ›

CF 95E - Lucky Country

We are given a set of islands connected by bidirectional roads. The islands form regions: each region is a connected component, and islands in different regions have no path between them.