Codeforces Testing Round 1

3 problems from Codeforces Testing Round 1 (contest 52), difficulty 900-2200. 3/3 solutions verified against sample I/O.

3 items

Codeforces Testing Round 1

Special | 3 problems | 3/3 verified | Difficulty 900-2200 | 5m 34s

#	Problem	Rating	Tags	Accepted	Time	✓
A	123-sequence	900	implementation	10,575	1m 38s	✓
B	Right Triangles	1600	combinatorics	2,406	1m 38s	✓
C	Circular RMQ	2200	data-structures	11,224	2m 18s	✓

Practice › Codeforces Solutions › Codeforces Testing Round 1 ›

CF 52A - 123-sequence

We are given a list of integers where every number is either 1, 2, or 3. The goal is to transform the sequence so that all numbers are the same, and we want to do this using the smallest number of replacements possible.

Practice › Codeforces Solutions › Codeforces Testing Round 1 ›

CF 52B - Right Triangles

We are given a rectangular grid where each cell is either empty or marked with . Every cell represents a point located at the center of that cell. We need to count how many right triangles can be formed such that:

Practice › Codeforces Solutions › Codeforces Testing Round 1 ›

CF 52C - Circular RMQ

We have an array arranged in a circle. Every operation works on a segment between two indices, but the segment may wrap around the end of the array.