Codeforces Round 125 (Div. 1)

5 problems from Codeforces Round 125 (Div. 1) (contest 198), difficulty 1400-2700. 2/5 solutions verified against sample I/O.

5 items

Codeforces Round 125 (Div. 1)

Div. 1 | 5 problems | 2/5 verified | Difficulty 1400-2700 | 6m 23s

#	Problem	Rating	Tags	Accepted	Time	✓
A	About Bacteria	1700	implementation, math	3,329	35s
B	Jumping on Walls	1400	shortest-paths	5,169	1m 37s	✓
C	Delivering Carcinogen	2400	binary-search, geometry	428	45s
D	Cube Snake	2700	constructive-algorithms	117	2m
E	Gripping Story	2400	binary-search, data-structures, sortings	554	1m 26s	✓

Practice › Codeforces Solutions › Codeforces Round 125 (Div. 1) ›

CF 198A - About Bacteria

The problem involves modeling bacterial growth in a test tube according to a discrete-time recurrence. Each bacterium splits into k bacteria every second, and an additional b bacteria are added due to abnormal effects.

Practice › Codeforces Solutions › Codeforces Round 125 (Div. 1) ›

CF 198C - Delivering Carcinogen

We are asked to compute the minimum time for Qwerty's ship to intercept a moving planet in a 2D plane. The star Diatar is at the origin, Persephone orbits the star in a perfect circle of radius $R$ at constant linear speed $vp$, and Qwerty's ship starts at some arbitrary…

Practice › Codeforces Solutions › Codeforces Round 125 (Div. 1) ›

CF 198E - Gripping Story

Every gripper is located at a fixed point in space. Qwerty's ship is also fixed. A gripper can pull another gripper into the ship if two conditions hold simultaneously.

Practice › Codeforces Solutions › Codeforces Round 125 (Div. 1) ›

CF 198D - Cube Snake

We are asked to fill an $n times n times n$ cube with numbers from 1 to $n^3$ in such a way that two conditions hold simultaneously. First, the numbers must form a "snake": each consecutive number must occupy a cube that is a face neighbor of the previous number.

Practice › Codeforces Solutions › Codeforces Round 125 (Div. 1) ›

CF 198B - Jumping on Walls

We have two vertical walls, each represented by a string of length n. Position i on a wall is either safe (-) or blocked (X). The ninja starts at position 0 of the left wall. Every second he may move to one of three positions: 1. One cell upward on the same wall. 2.