Codeforces Beta Round 77 (Div. 2 Only)

Solutions for Codeforces Beta Round 77 (Div. 2 Only) (contest 96). 2/2 problems verified against sample I/O. Difficulty range: 900-1300.

2 items

Codeforces Beta Round 77 (Div. 2 Only)

Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 900-1300 | Time: 6m 15s

Problem Name Rating Tags Solve Time Verified
A Football 900 implementation, strings 1m 24s ✓
B Lucky Numbers (easy) 1300 binary-search, bitmasks, brute-force 4m 51s ✓
Practice › Codeforces Solutions › Codeforces Beta Round 77 (Div. 2 Only) ›

CF 96A - Football

We are given a string made only of '0' and '1'. Each character represents the team of a football player standing in a line. A dangerous situation happens if at least seven consecutive players belong to the same team.
codeforces competitive-programming implementation strings May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 77 (Div. 2 Only) ›

CF 96B - Lucky Numbers (easy)

We need to find the smallest number greater than or equal to a given integer such that: 1. Every digit is either 4 or 7. 2. The count of 4s equals the count of 7s. These numbers are called super lucky numbers. For example, 47 is valid because it contains one 4 and one 7.
codeforces competitive-programming binary-search bitmasks brute-force May 28, 2026