Codeforces Round 655 (Div. 2)

4 problems from Codeforces Round 655 (Div. 2) (contest 1372), difficulty 800-2900. 1/4 solutions verified against sample I/O.

4 items

Codeforces Round 655 (Div. 2)

Div. 2 | 4 problems | 1/4 verified | Difficulty 800-2900 | 14m 47s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Omkar and Completion	800	constructive-algorithms, implementation	33,480	6m 44s
B	Omkar and Last Class of Math	1300	greedy, math, number-theory	36,364	1m 29s
E	Omkar and Last Floor	2900	dp, greedy, two-pointers	1,432	2m 3s	✓
F	Omkar and Modes	2700	binary-search, divide-and-conquer, interactive	497	4m 31s

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

CF 1372A - Omkar and Completion

We are asked to construct an integer array of length n where every element is positive, does not exceed 1000, and satisfies a global restriction on sums: if we pick any three positions (they may coincide), the sum of two chosen elements is never equal to any element of the array.

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

CF 1372F - Omkar and Modes

We are given a hidden array of length $n$, already sorted in nondecreasing order, and containing at most $k le 25000$ distinct values. Our only way to inspect it is by querying a segment $[l,r]$.

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

CF 1372E - Omkar and Last Floor

We are asked to design the last floor of Omkar's house, represented as an $n times m$ grid initially filled with zeros. Each row is subdivided into contiguous intervals. In each interval, we are allowed to change exactly one zero into a one.

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

CF 1372B - Omkar and Last Class of Math

The proposed solution does not answer the exercise that was asked. The exercise is: Compute the pseudo-quotient $q(x)$ and pseudo-remainder $r(x)$ for the given polynomials $u(x)$ and $v(x)$ over the integers.