Codeforces Round 152 (Div. 2)

Solutions for Codeforces Round 152 (Div. 2) (contest 248). 3/5 problems verified against sample I/O. Difficulty range: 800-2600.

5 items

Codeforces Round 152 (Div. 2)

Type: Div. 2 | Problems: 5 | Verified: 3/5 | Rating range: 800-2600 | Time: 11m 52s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Cupboards	800	implementation	1m 34s	✓
B	Chilly Willy	1400	math, number-theory	2m 53s	✓
C	Robo-Footballer	2000	binary-search, geometry	2m	✗
D	Sweets for Everyone!	2300	binary-search, greedy, implementation	3m 8s	✓
E	Piglet's Birthday	2600	dp, math, probabilities	2m 17s	✗

Practice › Codeforces Solutions › Codeforces Round 152 (Div. 2) ›

CF 248A - Cupboards

We are given a set of cupboards, each with two doors: left and right. Each door can be either open or closed. The initial state of each door is given in the input. Karlsson wants all left doors to be in the same position and all right doors to be in the same position.

Practice › Codeforces Solutions › Codeforces Round 152 (Div. 2) ›

CF 248B - Chilly Willy

We are looking for the smallest positive integer that has exactly n digits and is divisible by every one of the numbers 2, 3, 5, and 7 at the same time. In other words, we want the minimal n-digit number that is a multiple of the least common multiple of those four integers.

Practice › Codeforces Solutions › Codeforces Round 152 (Div. 2) ›

CF 248C - Robo-Footballer

We are working inside a rectangular football field where the left side contains a goal segment on the vertical line $x = 0$, and the right side contains a horizontal wall at height $y = yw$.

Practice › Codeforces Solutions › Codeforces Round 152 (Div. 2) ›

CF 248D - Sweets for Everyone!

We are given a one-dimensional street made of n consecutive sections. Each section is either a house that must receive exactly one kilogram of sweets, a shop that can provide at most one kilogram of sweets, or empty space that only matters for movement.

Practice › Codeforces Solutions › Codeforces Round 152 (Div. 2) ›

CF 248E - Piglet's Birthday

We are asked to compute the expected number of shelves that have no untasted honey pots after a series of actions. Each shelf starts with some number of honey pots. Winnie moves a small number of pots from one shelf to another, tasting them in the process.