Codeforces Round 752 (Div. 1)

Solutions for Codeforces Round 752 (Div. 1) (contest 1603). 2/6 problems verified against sample I/O. Difficulty range: 1300-3200.

6 items

Codeforces Round 752 (Div. 1)

Type: Div. 1 | Problems: 6 | Verified: 2/6 | Rating range: 1300-3200 | Time: 10m 53s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Di-visible Confusion	1300	constructive-algorithms, math, number-theory	1m 44s	✓
B	Moderate Modular Mode	1600	constructive-algorithms, math, number-theory	2m	✗
C	Extreme Extension	2300	dp, greedy, math	1m 51s	✗
D	Artistic Partition	3000	divide-and-conquer, dp, number-theory	1m 37s	✗
E	A Perfect Problem	3200	combinatorics, dp, math	1m 47s	✓
F	October 18, 2017	2700	combinatorics, dp, implementation	1m 54s	✗

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

CF 1603F - October 18, 2017

We are asked to count sequences of length $n$ where each element is an integer in the range $[0, 2^k)$, with the restriction that no non-empty subsequence has a bitwise XOR equal to $x$. Essentially, we are avoiding a certain XOR pattern.

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

CF 1603A - Di-visible Confusion

We are given a sequence of integers, and the goal is to completely erase it using a very particular operation. At each step, we can pick an element whose value is not divisible by its 1-based index plus one, and remove it.

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

CF 1603E - A Perfect Problem

We are asked to count sequences of length $n$, where each position is an integer between $1$ and $n+1$, under a very strong structural constraint. The constraint is not applied to the full sequence alone, but to every possible subsequence.

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

CF 1603D - Artistic Partition

We are asked to partition the integers from 1 to n into k contiguous segments such that a certain cost function is minimized. The cost of a segment from l to r is defined as the number of pairs (i, j) with l ≤ i ≤ j ≤ r whose greatest common divisor is at least l.

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

CF 1603B - Moderate Modular Mode

We are given two even integers, which we can think of as fixed numbers, x and y. Our task is to find an integer n such that when we take n mod x, the result is equal to y mod n.

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

CF 1603C - Extreme Extension

We are given an array of positive integers, and for every contiguous segment of this array we want to measure how “far” it is from being non-decreasing under a very specific operation.