Codeforces Testing Round 1

Solutions for Codeforces Testing Round 1 (contest 52). 3/3 problems verified against sample I/O. Difficulty range: 900-2200.

3 items

Codeforces Testing Round 1

Type: Special | Problems: 3 | Verified: 3/3 | Rating range: 900-2200 | Time: 5m 34s

Problem	Name	Rating	Tags	Solve Time	Verified
A	123-sequence	900	implementation	1m 38s	✓
B	Right Triangles	1600	combinatorics	1m 38s	✓
C	Circular RMQ	2200	data-structures	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.