Codeforces Round 510 (Div. 2)

3 problems from Codeforces Round 510 (Div. 2) (contest 1042), difficulty 1100-2300. 1/3 solutions verified against sample I/O.

3 items

Codeforces Round 510 (Div. 2)

Div. 2 | 3 problems | 1/3 verified | Difficulty 1100-2300 | 10m 10s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Benches	1100	binary-search, implementation	14,077	2m 16s	✓
C	Array Product	1700	constructive-algorithms, greedy, math	4,969	5m 5s
E	Vasya and Magic Matrix	2300	dp, math, probabilities	2,080	2m 49s

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

CF 1042E - Vasya and Magic Matrix

We are given a grid where every cell has a numeric value, and a chip starts at a specific cell. From its current position, the chip can only move to cells that have strictly smaller values than the current one.

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

CF 1042C - Array Product

We are given an array of integers, and we repeatedly reduce it until only one value remains. Each reduction step either merges two positions by multiplying their values and storing the result into one of the positions, or removes a single element entirely, but that removal…

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

CF 1042A - Benches

We are given several benches, each already occupied by some number of people. Then a group of new people arrives, and each of them must choose a bench and sit there.