Codeforces Round 146 (Div. 1)

5 problems from Codeforces Round 146 (Div. 1) (contest 235), difficulty 1600-3000. 4/5 solutions verified against sample I/O.

5 items

Codeforces Round 146 (Div. 1)

Div. 1 | 5 problems | 4/5 verified | Difficulty 1600-3000 | 11m 29s

#	Problem	Rating	Tags	Accepted	Time	✓
A	LCM Challenge	1600	number-theory	20,976	2m 32s	✓
B	Let's Play Osu!	2000	dp, math, probabilities	4,306	1m 33s	✓
C	Cyclical Quest	2700	data-structures, string-suffix-structures, strings	2,466	2m 36s	✓
D	Graph Game	3000	graphs	573	2m 41s	✓
E	Number Challenge	2600	combinatorics, dp, implementation	886	2m 7s

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

CF 235A - LCM Challenge

We are asked to pick three positive integers not greater than n such that their least common multiple is maximized. The integers do not have to be distinct, so we could repeat numbers if it helps achieve a larger LCM.

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

CF 235C - Cyclical Quest

We are given one large text string s, which is fixed for the entire input. Then we receive many query strings x. For a query x, we are not interested only in x itself. Any cyclic rotation of x is considered equivalent.

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

CF 235E - Number Challenge

We are asked to evaluate a large sum over all triples of integers chosen independently from three ranges. Concretely, imagine three slots, where the first slot can be filled with any value from 1 to a, the second from 1 to b, and the third from 1 to c.

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

CF 235D - Graph Game

We are asked to compute the expected total cost of a recursive deletion procedure applied to a connected graph with exactly as many edges as nodes.

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

CF 235B - Let's Play Osu!

Each click in the game independently becomes either a successful hit (O) or a miss (X). For a completed sequence, we split it into maximal consecutive blocks of O. If a block has length L, it contributes L² to the score. The total score is the sum of these squared block lengths.