Codeforces Round 901 (Div. 2)

Solutions for Codeforces Round 901 (Div. 2) (contest 1875). 1/7 problems verified against sample I/O. Difficulty range: 900-2800.

7 items

Codeforces Round 901 (Div. 2)

Type: Div. 2 | Problems: 7 | Verified: 1/7 | Rating range: 900-2800 | Time: 10m 36s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Jellyfish and Undertale	900	brute-force, greedy	1m 20s	✓
B	Jellyfish and Game	1200	brute-force, greedy, implementation	34s	✗
C	Jellyfish and Green Apple	1400	bitmasks, greedy, math	5m 14s	✗
D	Jellyfish and Mex	1600	dp	30s	✗
E	Jellyfish and Math	2400	bitmasks, dfs-and-similar, dp	52s	✗
F	Jellyfish and EVA	2300	dp, graphs, greedy	1m 10s	✗
G	Jellyfish and Miku	2800	dp, math, probabilities	56s	✗

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

CF 1875C - Jellyfish and Green Apple

We are given a collection of green apple pieces, each weighing exactly 1 kilogram. The goal is to distribute these pieces among a fixed number of people so that each person ends up with the same total weight.

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

CF 1875A - Jellyfish and Undertale

We are asked to maximize the time until a bomb explodes. The bomb has a timer b initially, which decreases by 1 every second. You have n tools, each capable of increasing the timer by xi when used, but the timer cannot exceed a maximum value a.

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

CF 1875F - Jellyfish and EVA

The solution correctly restates the exercise in terms of the frequency test and the chi-square statistic for $b$ categories. It identifies the expected value $E(chi^2)=b-1$ and explains why the observed value $1.06$ for the first 2000 decimal digits is unusually small.

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

CF 1875E - Jellyfish and Math

Codeforces 1875E: Jellyfish and Math

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

CF 1875D - Jellyfish and Mex

We are given an array of nonnegative integers. The task is to remove elements from the array one by one, and after each removal, we add the MEX of the remaining array to a running total. The goal is to minimize this total by choosing the deletion order optimally.

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

CF 1875B - Jellyfish and Game

We are asked to simulate a turn-based exchange game between two players, Jellyfish and Gellyfish. Jellyfish owns an array of apples with integer values, and Gellyfish owns a different array.