Codeforces Beta Round 36

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

5 items

Codeforces Beta Round 36

Type: Beta | Problems: 5 | Verified: 2/5 | Rating range: 1300-2600 | Time: 9m 36s

Problem Name Rating Tags Solve Time Verified
A Extra-terrestrial Intelligence 1300 implementation 1m 21s ✓
B Fractal 1600 implementation 1m 52s ✓
C Bowls 2200 geometry, implementation 2m 5s ✗
D New Game with a Chess Piece 2300 games 1m 43s ✗
E Two Paths 2600 constructive-algorithms, dsu, graphs 2m 35s ✗
Practice › Codeforces Solutions › Codeforces Beta Round 36 ›

CF 36A - Extra-terrestrial Intelligence

We are given a binary string representing Vasya's observations over several days. A character '1' means a signal was received on that day, while '0' means no signal appeared.
codeforces competitive-programming implementation May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 36 ›

CF 36B - Fractal

We start with an n × n pattern consisting of black cells (*) and white cells (.). This pattern acts like a template.
codeforces competitive-programming implementation May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 36 ›

CF 36C - Bowls

Each bowl is a frustum, a cone with its tip cut off. A bowl is described by its height h, bottom radius r, and top radius R. The bowls are stacked in the given order, always sharing the same vertical axis.
codeforces competitive-programming geometry implementation May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 36 ›

CF 36D - New Game with a Chess Piece

We are asked to analyze a two-player game on an rectangular board. The players take turns moving a single chess piece starting in the top-left corner. On each turn, a player can move the piece one cell right, one cell down, or diagonally cells down-right.
codeforces competitive-programming games May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 36 ›

CF 36E - Two Paths

Each paper describes an undirected edge between two cities. We are told that all papers came from exactly two travel journals.
codeforces competitive-programming constructive-algorithms dsu graphs implementation May 28, 2026