Codeforces Round 125 (Div. 1)

Solutions for Codeforces Round 125 (Div. 1) (contest 198). 1/3 problems verified against sample I/O. Difficulty range: 1700-2700.

3 items

Codeforces Round 125 (Div. 1)

Type: Div. 1 | Problems: 3 | Verified: 1/3 | Rating range: 1700-2700 | Time: 6m 48s

Problem	Name	Rating	Tags	Solve Time	Verified
A	About Bacteria	1700	implementation, math	1m 28s	✓
D	Cube Snake	2700	constructive-algorithms	2m 13s	✗
E	Gripping Story	2400	binary-search, data-structures, sortings	3m 7s	✗

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

CF 198A - About Bacteria

We are asked to model the growth of bacteria under a specific rule. In the first experiment, each bacterium multiplies by a factor of k every second and then b extra bacteria appear due to some abnormal effect.

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

CF 198D - Cube Snake

We must fill an $n times n times n$ cube with the integers from $1$ to $n^3$. Consecutive numbers must always occupy cubes that share a face, so the numbering forms a Hamiltonian path through the 3D grid. The second requirement is the unusual one.

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

CF 198E - Gripping Story

We are given a scenario where Qwerty's ship has an initial magnetic gripper and is surrounded by n scattered grippers from two crashed ships. Each gripper has a location, a mass, a power, and a radius.