Codeforces Round 1089 (Div. 2)

7 problems from Codeforces Round 1089 (Div. 2) (contest 2210), difficulty 800-2700. 2/7 solutions verified against sample I/O.

7 items

Codeforces Round 1089 (Div. 2)

Div. 2 | 7 problems | 2/7 verified | Difficulty 800-2700 | 17m 52s

#	Problem	Rating	Tags	Accepted	Time	✓
A	A Simple Sequence	800	constructive-algorithms, dp, greedy	22,139	1m 22s	✓
B	Simply Sitting on Chairs	900	data-structures, greedy	17,463	1m 54s	✓
C1	A Simple GCD Problem (Easy Version)	1200	greedy, number-theory	12,720	7m 4s
C2	A Simple GCD Problem (Hard Version)	2100	dp, greedy, number-theory	2,137	2m 11s
D	A Simple RBS Problem	2100	constructive-algorithms, math, strings	2,019	1m 34s
E	Binary Strings are Simple?	2700	constructive-algorithms, implementation, interactive	316	1m 45s
F	A Simple Problem	2700	binary-search, data-structures, greedy	214	2m 2s

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

CF 2210C1 - A Simple GCD Problem (Easy Version)

We are given an array of integers where every element can potentially be changed once. However, each position has a strict constraint: any replacement value must lie in the range from 1 up to the original value at that position, and it must differ from the original value.

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

CF 2210F - A Simple Problem

We are given a permutation of integers from 1 to n and a series of queries, each asking about a contiguous subarray of this permutation.

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

CF 2210E - Binary Strings are Simple?

We are dealing with an interactive reconstruction problem where the hidden object is a binary string of length $n$. We do not observe the string directly.

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

CF 2210C2 - A Simple GCD Problem (Hard Version)

We are given two arrays of equal length. Think of the first array as the current values written on a line of positions, and the second array as upper bounds that control how far each position is allowed to be changed.

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

CF 2210D - A Simple RBS Problem

We are given two balanced bracket strings of equal length. Both strings are guaranteed to be regular bracket sequences, meaning every prefix has at least as many opening brackets as closing ones and the total counts match.

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

CF 2210B - Simply Sitting on Chairs

We have a row of $n$ chairs, all initially unmarked. A permutation $p$ of length $n$ is given, meaning each number from $1$ to $n$ appears exactly once. We start from the first chair and move right. At each chair, if it is already marked, the game stops immediately.

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

CF 2210A - A Simple Sequence

We are asked to construct a permutation of integers from 1 to $n$ such that the sequence of consecutive remainders is non-increasing.