Codeforces Beta Round 7

5 problems from Codeforces Beta Round 7 (contest 7), difficulty 1100-2600. 5/5 solutions verified against sample I/O.

5 items

Codeforces Beta Round 7

Beta | 5 problems | 5/5 verified | Difficulty 1100-2600 | 5m 10s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Kalevitch and Chess	1100	brute-force, constructive-algorithms	8,023	1m 5s	✓
B	Memory Manager	1600	implementation	2,956	1m 1s	✓
C	Line	1800	math, number-theory	5,477	52s	✓
D	Palindrome Degree	2200	hashing, strings	4,470	1m 5s	✓
E	Defining Macros	2600	dp, expression-parsing, implementation	777	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.

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.

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.

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_.

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.