Codeforces Beta Round 7

Solutions for Codeforces Beta Round 7 (contest 7). 5/5 problems verified against sample I/O. Difficulty range: 1100-2600.

5 items

Codeforces Beta Round 7

Type: Beta | Problems: 5 | Verified: 5/5 | Rating range: 1100-2600 | Time: 5m 10s

Problem Name Rating Tags Solve Time Verified
A Kalevitch and Chess 1100 brute-force, constructive-algorithms 1m 5s ✓
B Memory Manager 1600 implementation 1m 1s ✓
C Line 1800 math, number-theory 52s ✓
D Palindrome Degree 2200 hashing, strings 1m 5s ✓
E Defining Macros 2600 dp, expression-parsing, implementation 1m 7s ✓
Practice › Codeforces Solutions › Codeforces Beta Round 7 ›

CF 7A - Kalevitch and Chess

The problem asks us to simulate a painter working on an 8×8 chessboard. Every square starts white, and the painter can perform only two operations: paint an entire row black or paint an entire column black. Painting the same square multiple times has no effect beyond the first.
codeforces competitive-programming brute-force constructive-algorithms May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 7 ›

CF 7B - Memory Manager

We are asked to implement a simple memory manager for a linear memory array of size _m_. Each memory cell can either be free or occupied by a block. We are to process a sequence of operations: alloc n, erase x, and defragment.
codeforces competitive-programming implementation May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 7 ›

CF 7C - Line

We are asked to find an integer point on a straight line described by the equation Ax + By + C = 0. The inputs are three integers, A, B, and C, which define the slope and position of the line.
codeforces competitive-programming math number-theory May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 7 ›

CF 7D - Palindrome Degree

We are given a string consisting of letters and digits, and we are asked to compute a special measure for every prefix called the _palindrome degree_.
codeforces competitive-programming hashing strings May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 7 ›

CF 7E - Defining Macros

We are given a set of C-style #define macros and an expression, and we are asked to determine whether the expression becomes "suspicious" after macro substitution.
codeforces competitive-programming dp expression-parsing implementation May 28, 2026