Codeforces Beta Round 46 (Div. 2)

Solutions for Codeforces Beta Round 46 (Div. 2) (contest 49). 5/5 problems verified against sample I/O. Difficulty range: 800-2300.

5 items

Codeforces Beta Round 46 (Div. 2)

Type: Div. 2 | Problems: 5 | Verified: 5/5 | Rating range: 800-2300 | Time: 8m 21s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Sleuth	800	implementation	1m 21s	✓
B	Sum	1500	math	1m 24s	✓
C	Disposition	1700	constructive-algorithms, math	1m 48s	✓
D	Game	1800	brute-force, dp, implementation	1m 47s	✓
E	Common ancestor	2300	dp	2m 1s	✓

Practice › Codeforces Solutions › Codeforces Beta Round 46 (Div. 2) ›

CF 49B - Sum

We are given two integers, _a_ and _b_, written in some unknown base _p_. Vasya wants to compute the sum _a + b_ in all valid bases and determine which base gives the sum with the largest number of digits.

Practice › Codeforces Solutions › Codeforces Beta Round 46 (Div. 2) ›

CF 49C - Disposition

We need to build a permutation of numbers from 1 to n. Position j contains volume p(j). A positive integer i is called a divisor of the disposition if there exists some position j such that both j and p(j) are divisible by i.

Practice › Codeforces Solutions › Codeforces Beta Round 46 (Div. 2) ›

CF 49D - Game

The game is played on a one-dimensional stripe of squares, each either black or white. Vasya paints the initial configuration, and Petya can then perform moves to achieve an alternating pattern, where no two adjacent squares share the same color.

Practice › Codeforces Solutions › Codeforces Beta Round 46 (Div. 2) ›

CF 49E - Common ancestor

Each DNA string evolves by repeatedly applying rules of the form a -> bc. One character is replaced by exactly two characters, and this operation can be repeated any number of times. Starting from some ancestor string, evolution only increases the length.