Codeforces Round 708 (Div. 2)

Solutions for Codeforces Round 708 (Div. 2) (contest 1497). 1/7 problems verified against sample I/O. Difficulty range: 800-2500.

7 items

Codeforces Round 708 (Div. 2)

Type: Div. 2 | Problems: 7 | Verified: 1/7 | Rating range: 800-2500 | Time: 21m 13s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Meximization	800	brute-force, data-structures, greedy	6m 18s	✗
B	M-arrays	1200	constructive-algorithms, greedy, math	2m 22s	✗
C1	k-LCM (easy version)	1200	constructive-algorithms, math	2m 55s	✗
C2	k-LCM (hard version)	1600	constructive-algorithms, math	1m 53s	✗
D	Genius	2500	bitmasks, dp, graphs	3m 24s	✗
E1	Square-Free Division (easy version)	1700	data-structures, dp, greedy	1m 45s	✓
E2	Square-Free Division (hard version)	2500	data-structures, dp, greedy	2m 36s	✗

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

CF 1497E2 - Square-Free Division (hard version)

We are given an array of positive integers, and we are asked to split it into the fewest possible contiguous segments such that within any segment, no pair of numbers multiplies to a perfect square.

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

CF 1497D - Genius

We are given a set of problems, each associated with a complexity, a tag, and a score. The complexity of the $i$-th problem is $ci = 2^i$, which grows exponentially. You start with IQ $0$ and can select any problem first.

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

CF 1497A - Meximization

We are given an array of nonnegative integers and we want to reorder it to maximize the sum of MEX values over all prefixes. A prefix is any initial segment of the array. The MEX of a set is the smallest nonnegative integer not present in that set.

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

CF 1497E1 - Square-Free Division (easy version)

We are given several independent test cases. Each test case provides an array of positive integers, and we want to split this array into the smallest possible number of contiguous parts.

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

CF 1497C2 - k-LCM (hard version)

We are given two integers for each test case: a target sum and a required count of positive integers. The task is to split the sum into exactly that many positive parts. The additional constraint is not about the sum but about the least common multiple of all chosen parts.

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

CF 1497C1 - k-LCM (easy version)

The problem asks for three positive integers that sum to a given number $n$ and whose least common multiple does not exceed half of $n$. The input gives a number of test cases, each specifying a single integer $n$.

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

CF 1497B - M-arrays

We are given a multiset of numbers and a modulus $m$. The task is to rearrange all numbers into as few sequences as possible, where each sequence must satisfy a local compatibility rule: whenever two consecutive elements appear in the same sequence, their sum must be divisible…