Codeforces Beta Round 96 (Div. 1)

Solutions for Codeforces Beta Round 96 (Div. 1) (contest 132). 3/5 problems verified against sample I/O. Difficulty range: 1300-2700.

5 items

Codeforces Beta Round 96 (Div. 1)

Type: Div. 1 | Problems: 5 | Verified: 3/5 | Rating range: 1300-2700 | Time: 9m 16s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Turing Tape	1300	implementation	1m 39s	✓
B	Piet	2100	implementation	1m 56s	✓
C	Logo Turtle	1800	dp	1m 52s	✓
D	Constants in the language of Shakespeare	2100	constructive-algorithms, dp, greedy	2m 2s	✗
E	Bits of merry old England	2700	flows, graphs	1m 47s	✗

Practice › Codeforces Solutions › Codeforces Beta Round 96 (Div. 1) ›

CF 132A - Turing Tape

We are given the final text printed by INTERCAL's strange "Turing Tape" output procedure. Each printed character was produced from one integer of an unknown array. The encoding process depends on the previous printed character, so every step is linked to the one before it.

Practice › Codeforces Solutions › Codeforces Beta Round 96 (Div. 1) ›

CF 132B - Piet

We are asked to simulate a simplified Piet interpreter on a small rectangular grid. Each cell is a pixel with a color between 0 and 9, where 0 is black and other digits are colored blocks.

Practice › Codeforces Solutions › Codeforces Beta Round 96 (Div. 1) ›

CF 132C - Logo Turtle

The turtle starts at coordinate 0 on a number line and initially faces the positive direction. Each command changes its state in one of two ways. If the command is F, the turtle moves one unit in the direction it is currently facing.

Practice › Codeforces Solutions › Codeforces Beta Round 96 (Div. 1) ›

CF 132D - Constants in the language of Shakespeare

We are asked to represent a positive integer given in binary as a sum of powers of two, with the option of using negative powers, such that the total number of terms is minimized. Formally, we want to write the number as a sum of expressions of the form +2^x or -2^x.

Practice › Codeforces Solutions › Codeforces Beta Round 96 (Div. 1) ›

CF 132E - Bits of merry old England

The task is to print a given sequence of integers using a limited number of variables and two operations: assigning a variable to an integer, and printing a variable. Each assignment carries a cost equal to the number of set bits in the assigned number, while printing is free.