Codeforces Round 904 (Div. 2)

Solutions for Codeforces Round 904 (Div. 2) (contest 1884). 1/5 problems verified against sample I/O. Difficulty range: 800-2800.

5 items

Codeforces Round 904 (Div. 2)

Type: Div. 2 | Problems: 5 | Verified: 1/5 | Rating range: 800-2800 | Time: 11m 8s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Simple Design	800	brute-force, greedy, math	1m 44s	✓
B	Haunted House	1100	binary-search, greedy, math	3m 7s	✗
C	Medium Design	1700	brute-force, data-structures, dp	1m 54s	✗
D	Counting Rhyme	2100	dp, math, number-theory	2m 1s	✗
E	Hard Design	2800	greedy, implementation, math	2m 22s	✗

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

CF 1884E - Hard Design

We are given an array of integers and the ability to increment a contiguous segment of the array in a single operation. Each operation has a cost measured as the square of the segment's length, and we earn coins equal to this cost.

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

CF 1884D - Counting Rhyme

We are given an array of integers a[1..n], each between 1 and n. We need to count the number of pairs (i, j) with i < j such that there is no k for which both a[i] and a[j] are divisible by a[k].

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

CF 1884B - Haunted House

We are given a binary number as a string of length $n$, which may contain leading zeroes. The task is to determine, for each integer $i$ from 1 to $n$, the minimum number of adjacent swaps required to make the number divisible by $2^i$, or indicate if it is impossible.

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

CF 1884C - Medium Design

We are given a very long array, initially all zeros, and a collection of segments on this array. Each segment, if chosen, adds one to every position inside its interval. We are allowed to choose any subset of segments.

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

CF 1884A - Simple Design

For each test case, we are given a starting number x and an integer k. A number is considered beautiful if the sum of its decimal digits is divisible by k. The task is to find the smallest integer y such that y ≥ x and the digit sum of y is divisible by k.