Codeforces Beta Round 16 (Div. 2 Only)

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

5 items

Codeforces Beta Round 16 (Div. 2 Only)

Type: Div. 2 | Problems: 5 | Verified: 5/5 | Rating range: 800-1900 | Time: 7m 6s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Flag	800	implementation	1m 8s	✓
B	Burglar and Matches	900	greedy, implementation, sortings	1m 13s	✓
C	Monitor	1800	binary-search, number-theory	1m 37s	✓
D	Logging	1900	implementation, strings	1m 34s	✓
E	Fish	1900	bitmasks, dp, probabilities	1m 34s	✓

Practice › Codeforces Solutions › Codeforces Beta Round 16 (Div. 2 Only) ›

CF 16A - Flag

We are given a rectangular grid representing a country’s flag. Each cell in the grid has a color, encoded as a digit from 0 to 9. The dimensions of the flag are rows by columns. The goal is to determine whether the flag is “striped” according to the new ISO standard.

Practice › Codeforces Solutions › Codeforces Beta Round 16 (Div. 2 Only) ›

CF 16B - Burglar and Matches

We have a burglar who can carry exactly n matchboxes. In the warehouse, there are m containers. Each container i has a_i matchboxes, and every matchbox in that container contains b_i matches.

Practice › Codeforces Solutions › Codeforces Beta Round 16 (Div. 2 Only) ›

CF 16C - Monitor

We start with a monitor whose dimensions are a × b. Both values are integers. We want to shrink this monitor so that the new dimensions keep the exact aspect ratio x : y.

Practice › Codeforces Solutions › Codeforces Beta Round 16 (Div. 2 Only) ›

CF 16D - Logging

We are given a sequence of log entries in the exact order they were written. Originally every entry had both a date and a time, but the dates were lost, so only the 12-hour clock timestamps remain.

Practice › Codeforces Solutions › Codeforces Beta Round 16 (Div. 2 Only) ›

CF 16E - Fish

We have n fish in a lake. Every day, exactly one unordered pair of currently alive fish is chosen uniformly at random. When fish i meets fish j, fish i eats fish j with probability a[i][j], and fish j eats fish i with probability a[j][i] = 1 - a[i][j].