Codeforces Beta Round 37

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

5 items

Codeforces Beta Round 37

Type: Beta | Problems: 5 | Verified: 4/5 | Rating range: 1000-2600 | Time: 8m 37s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Towers	1000	sortings	53s	✓
B	Computer Game	1800	greedy, implementation	1m 56s	✓
C	Old Berland Language	1900	data-structures, greedy, trees	1m 42s	✓
D	Lesson Timetable	2300	combinatorics, dp, math	2m 23s	✗
E	Trial for Chief	2600	graphs, greedy, shortest-paths	1m 43s	✓

Practice › Codeforces Solutions › Codeforces Beta Round 37 ›

CF 37A - Towers

We are given a set of wooden bars, each with a positive integer length. Vasya wants to build towers by stacking bars of the same length. Each tower must consist of bars that are identical in length, but different towers can have different lengths.

Practice › Codeforces Solutions › Codeforces Beta Round 37 ›

CF 37B - Computer Game

The boss starts with max health and regenerates reg health every second. We own several scrolls. Each scroll can only be activated when the boss health is at most some percentage of the original health.

Practice › Codeforces Solutions › Codeforces Beta Round 37 ›

CF 37C - Old Berland Language

We need to construct a binary prefix code.

Practice › Codeforces Solutions › Codeforces Beta Round 37 ›

CF 37D - Lesson Timetable

Each student group attends exactly two lessons. For a group, the classroom used in the first lesson must not exceed the classroom used in the second lesson.

Practice › Codeforces Solutions › Codeforces Beta Round 37 ›

CF 37E - Trial for Chief

We are given a rectangular slab divided into an grid of squares. Each square is either black or white in the final design, which is provided as input. The slab initially starts entirely white.