Codeforces Round 908 (Div. 2)

Solutions for Codeforces Round 908 (Div. 2) (contest 1894). 0/5 problems verified against sample I/O. Difficulty range: 800-2000.

5 items

Codeforces Round 908 (Div. 2)

Type: Div. 2 | Problems: 5 | Verified: 0/5 | Rating range: 800-2000 | Time: 10m 22s

Problem Name Rating Tags Solve Time Verified
A Secret Sport 800 implementation, strings 3m 47s ✗
B Two Out of Three 1000 constructive-algorithms 1m 57s ✗
C Anonymous Informant 1400 constructive-algorithms, graphs, implementation 1m 30s ✗
D Neutral Tonality 1700 constructive-algorithms, data-structures, sortings 1m 38s ✗
E Freedom of Choice 2000 brute-force, data-structures, greedy 1m 30s ✗
Practice › Codeforces Solutions › Codeforces Round 908 (Div. 2) ›

CF 1894A - Secret Sport

We observe a sequence of match outcomes where each character represents a single play won by either player A or player B. These plays are grouped into sets: a set ends as soon as one player accumulates $X$ wins inside that set.
codeforces competitive-programming implementation strings Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 908 (Div. 2) ›

CF 1894E - Freedom of Choice

Working
codeforces competitive-programming brute-force data-structures greedy implementation Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 908 (Div. 2) ›

CF 1894D - Neutral Tonality

We are given two sequences. The first sequence is already fixed in its internal order, and we are not allowed to reorder it.
codeforces competitive-programming constructive-algorithms data-structures sortings two-pointers Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 908 (Div. 2) ›

CF 1894B - Two Out of Three

We are given an array of integers and need to construct a parallel array of labels containing only 1, 2, or 3. The goal is to satisfy exactly two out of three pairing conditions, each involving two indices where the original numbers are equal and the assigned labels form one…
codeforces competitive-programming constructive-algorithms Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 908 (Div. 2) ›

CF 1894C - Anonymous Informant

We are given an array $b$ of length $n$ and a number $k$, which represents the number of operations performed on some hidden original array $a$. Each operation consists of choosing a fixed point $x$ in $a$ and cyclically left-shifting $a$ by $x$ positions.
codeforces competitive-programming constructive-algorithms graphs implementation Jun 9, 2026