Codeforces Round 935 (Div. 3)

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

8 items

Codeforces Round 935 (Div. 3)

Type: Div. 3 | Problems: 8 | Verified: 5/8 | Rating range: 800-2600 | Time: 9m 25s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Setting up Camp	800	greedy, math	55s	✓
B	Fireworks	900	math, number-theory	1m 25s	✓
C	Left and Right Houses	1200	brute-force	48s	✓
D	Seraphim the Owl	1300	dp, greedy	1m 20s	✓
E	Binary Search	1700	binary-search, constructive-algorithms, greedy	1m 21s	✗
F	Kirill and Mushrooms	1900	data-structures, sortings	1m 9s	✗
G	Cook and Porridge	2500	binary-search, constructive-algorithms, data-structures	1m 10s	✓
H	GCD is Greater	2600	brute-force, data-structures, math	1m 17s	✗

Practice › Codeforces Solutions › Codeforces Round 935 (Div. 3) ›

CF 1945A - Setting up Camp

We are given a group of participants who must be assigned into tents, where each tent can hold at most three people. The participants come in three types with different constraints on how they are willing to share a tent.

Practice › Codeforces Solutions › Codeforces Round 935 (Div. 3) ›

CF 1945B - Fireworks

Two firework machines start at time zero and then keep launching fireworks periodically. The first machine fires at times that are multiples of a, and the second fires at multiples of b.

Practice › Codeforces Solutions › Codeforces Round 935 (Div. 3) ›

CF 1945C - Left and Right Houses

We are given a village with n houses aligned in a row. Each resident has a preference for which side of a street they want to live on: left (0) or right (1).

Practice › Codeforces Solutions › Codeforces Round 935 (Div. 3) ›

CF 1945D - Seraphim the Owl

We are given a queue of n people waiting to ask Seraphim the Owl a question. Kirill arrives at the end of the line and wants to move forward so that he is among the first m people.

Practice › Codeforces Solutions › Codeforces Round 935 (Div. 3) ›

CF 1945E - Binary Search

We are given a permutation of size $n$, meaning every number from $1$ to $n$ appears exactly once, but in some arbitrary order. Along with it, we are given a target value $x$ that definitely exists somewhere in the array.

Practice › Codeforces Solutions › Codeforces Round 935 (Div. 3) ›

CF 1945F - Kirill and Mushrooms

Kirill wants to gather mushrooms under a Wise Oak to brew an elixir. Each mushroom has a magic power, and the strength of an elixir made from a group of mushrooms is the product of the count of mushrooms and the minimum magic power among them.

Practice › Codeforces Solutions › Codeforces Round 935 (Div. 3) ›

CF 1945G - Cook and Porridge

We are simulating a queue of students where the front of the queue is repeatedly served for a limited number of minutes. Each student, once served, leaves to “process” their porridge for a fixed number of minutes, and then returns to the queue.

Practice › Codeforces Solutions › Codeforces Round 935 (Div. 3) ›

CF 1945H - GCD is Greater

We are given an array of integers, and two players split the array into two groups. Kirill is allowed to choose a subset that is neither too small nor too large, specifically at least two elements and at most $n-2$ elements. Those chosen elements form the red group.