Codeforces Round 970 (Div. 3)

Solutions for Codeforces Round 970 (Div. 3) (contest 2008). 0/1 problems verified against sample I/O. Difficulty range: 2100-2100.

8 items

Codeforces Round 970 (Div. 3)

Type: Div. 3 | Problems: 1 | Verified: 0/1 | Rating range: 2100-2100 | Time: 1m 48s

Problem Name Rating Tags Solve Time Verified
H Sakurako's Test 2100 binary-search, brute-force, greedy 1m 48s ✗
Practice › Codeforces Solutions › Codeforces Round 970 (Div. 3) ›

CF 2008H - Sakurako's Test

We are given an array and a parameter $x$. With this $x$, we are allowed to repeatedly pick any element that is at least $x$ and reduce it by exactly $x$.
codeforces competitive-programming binary-search brute-force greedy math number-theory Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 970 (Div. 3) ›

CF 2008G - Sakurako's Task

This is a Type B (prove) problem. The requirement is to prove that for every point $P$ in the plane and for every choice of the distinguished vertex of the isosceles trapezoid, the sum of the distances from $P$ to the other three vertices is strictly greater than the distance…
codeforces competitive-programming binary-search greedy math number-theory Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 970 (Div. 3) ›

CF 2008E - Alternating String

We are given a string of lowercase letters. An alternating string has a very specific form. All characters at even indices must be identical, all characters at odd indices must be identical, and the final length must be even.
codeforces competitive-programming brute-force data-structures dp greedy implementation strings Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 970 (Div. 3) ›

CF 2008B - Square or Not

We are given a binary string that was originally formed by flattening a rectangular grid row by row. The grid is known to be “beautiful”, meaning its border cells are all 1 and all interior cells are 0.
codeforces competitive-programming brute-force math strings Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 970 (Div. 3) ›

CF 2008F - Sakurako's Box

This is a Type B (prove) problem. The requirement is to prove that for every point $P$ in the plane and for every choice of the distinguished vertex of the isosceles trapezoid, the sum of the distances from $P$ to the other three vertices is strictly greater than the distance…
codeforces competitive-programming combinatorics math number-theory Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 970 (Div. 3) ›

CF 2008D - Sakurako's Hobby

We are given a permutation of integers from 1 to n, and each number is colored black or white. From any starting integer i, we can repeatedly apply the permutation to jump from i to pi, then to p{pi}, and so on.
codeforces competitive-programming dp dsu graphs math Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 970 (Div. 3) ›

CF 2008A - Sakurako's Exam

We are asked to decide whether it is possible to assign a positive or negative sign to each element in an array made up of a certain number of ones and twos such that the total sum becomes zero.
codeforces competitive-programming brute-force constructive-algorithms greedy math Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 970 (Div. 3) ›

CF 2008C - Longest Good Array

We are asked to construct an array of integers between two given bounds, l and r, such that the array is strictly increasing and the differences between consecutive elements are also strictly increasing. Our goal is to find the maximum possible length of such an array.
codeforces competitive-programming binary-search brute-force math Jun 8, 2026