Codeforces Round 240 (Div. 1)

Solutions for Codeforces Round 240 (Div. 1) (contest 414). 2/5 problems verified against sample I/O. Difficulty range: 1400-3200.

5 items

Codeforces Round 240 (Div. 1)

Type: Div. 1 | Problems: 5 | Verified: 2/5 | Rating range: 1400-3200 | Time: 8m 52s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Mashmokh and Numbers	1500	constructive-algorithms, number-theory	2m 6s	✗
B	Mashmokh and ACM	1400	combinatorics, dp, number-theory	1m 21s	✓
C	Mashmokh and Reverse Operation	2100	combinatorics, divide-and-conquer	1m 40s	✓
D	Mashmokh and Water Tanks	2300	binary-search, data-structures, greedy	1m 43s	✗
E	Mashmokh's Designed Problem	3200	data-structures	2m 2s	✗

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

CF 414A - Mashmokh and Numbers

Mashmokh wants to pick a sequence of n distinct integers so that his boss, Bimokh, gains exactly k points in a game.

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

CF 414B - Mashmokh and ACM

We are asked to count how many sequences of fixed length we can build from integers between 1 and n, with two constraints. First, the sequence is non-decreasing. Second, every element must divide the next one in the sequence.

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

CF 414C - Mashmokh and Reverse Operation

We are given an array of length $2^n$, where $n$ is at most 20, and a sequence of queries. Each query specifies a number $qi$, which tells us to repeatedly split the array into blocks of size $2^{qi}$, reverse each block, and then join the blocks back together.

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

CF 414D - Mashmokh and Water Tanks

We are given a rooted tree where each vertex represents a water tank. Initially all tanks are empty, but we are allowed to place up to $k$ liters of water, each liter placed into a distinct non-root node.

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

CF 414E - Mashmokh's Designed Problem

We are given a rooted tree with n vertices, where each vertex explicitly lists its children in a defined order. The tree allows three types of queries. The first type asks for the distance between two nodes in terms of the number of edges along the shortest path.