Abbyy Cup 2.0 - Final (unofficial)

19 problems from Abbyy Cup 2.0 - Final (unofficial) (contest 207), difficulty 1600-2700. 7/19 solutions verified against sample I/O.

19 items

Abbyy Cup 2.0 - Final (unofficial)

Special | 19 problems | 7/19 verified | Difficulty 1600-2700 | 38m 59s

# Problem Rating Tags Accepted Time ✓
A1 Beaver's Calculator 1.0 1600 greedy 370 1m 9s ✓
A2 Beaver's Calculator 1.0 1800 greedy 305 1m 11s ✓
A3 Beaver's Calculator 1.0 2000 greedy 276 3m 21s
B1 Military Trainings 1600 357 49s
B2 Military Trainings 1900 238 2m 8s ✓
B3 Military Trainings 1700 214 4m 19s
C1 Game with Two Trees 2100 136 3m 32s
C2 Game with Two Trees 2200 105 3m 56s
C3 Game with Two Trees 2700 data-structures 164 3m 6s
D1 The Beaver's Problem - 3 1800 124 2m 5s
D10 The Beaver's Problem - 3 2100 86 51s ✓
D2 The Beaver's Problem - 3 2000 117 2m 51s
D3 The Beaver's Problem - 3 2000 148 3m 2s ✓
D4 The Beaver's Problem - 3 2100 173 1m 44s
D5 The Beaver's Problem - 3 1600 156 1m 12s ✓
D6 The Beaver's Problem - 3 2100 88 1m 16s ✓
D7 The Beaver's Problem - 3 1600 111 30s
D8 The Beaver's Problem - 3 2300 100 29s
D9 The Beaver's Problem - 3 1800 98 1m 28s
Practice › Codeforces Solutions › Abbyy Cup 2.0 - Final (unofficial) ›

CF 207D1 - The Beaver's Problem - 3

In this problem, we are given a document whose subject is one of three categories, numbered 1, 2, or 3. Each document contains a unique identifier, a title, and a body of text.
codeforces competitive-programming Jun 3, 2026
Practice › Codeforces Solutions › Abbyy Cup 2.0 - Final (unofficial) ›

CF 207D4 - The Beaver's Problem - 3

We are given a single document consisting of an identifier, a title line, and then a body of text. Every document belongs to exactly one of three possible topics, labeled 1, 2, or 3, but the correct label is not provided in the input.
codeforces competitive-programming Jun 3, 2026
Practice › Codeforces Solutions › Abbyy Cup 2.0 - Final (unofficial) ›

CF 207D9 - The Beaver's Problem - 3

We are given a single document consisting of three parts: an identifier number that is irrelevant for classification, a title line, and then the full text content of the document. Every document belongs to exactly one of three fixed topics labeled 1, 2, and 3.
codeforces competitive-programming Jun 3, 2026
Practice › Codeforces Solutions › Abbyy Cup 2.0 - Final (unofficial) ›

CF 207D8 - The Beaver's Problem - 3

Error in message stream
codeforces competitive-programming Jun 3, 2026
Practice › Codeforces Solutions › Abbyy Cup 2.0 - Final (unofficial) ›

CF 207D7 - The Beaver's Problem - 3

We are asked to classify a text document into one of three subjects, numbered 1, 2, or 3, given a training set of labeled documents. Each document in the input consists of an identifier, a title, and a body of text.
codeforces competitive-programming Jun 3, 2026
Practice › Codeforces Solutions › Abbyy Cup 2.0 - Final (unofficial) ›

CF 207D6 - The Beaver's Problem - 3

We are given a single document consisting of three parts: a numeric identifier, a short title line, and then the full text content. The identifier is irrelevant for classification.
codeforces competitive-programming Jun 3, 2026
Practice › Codeforces Solutions › Abbyy Cup 2.0 - Final (unofficial) ›

CF 207D5 - The Beaver's Problem - 3

Each document is a short piece of text that belongs to exactly one of three possible topics. The input gives us a single document consisting of an identifier, a title line, and a body of text. The identifier is irrelevant for classification, it only exists for bookkeeping.
codeforces competitive-programming Jun 3, 2026
Practice › Codeforces Solutions › Abbyy Cup 2.0 - Final (unofficial) ›

CF 207D3 - The Beaver's Problem - 3

The problem asks us to classify documents into one of three subjects, labeled 1, 2, or 3. Each document has a unique identifier, a title, and a body of text.
codeforces competitive-programming Jun 3, 2026
Practice › Codeforces Solutions › Abbyy Cup 2.0 - Final (unofficial) ›

CF 207D2 - The Beaver's Problem - 3

The problem requires building a classifier that predicts the subject of a document based on its contents. Each document belongs to exactly one of three subjects, labeled 1, 2, or 3.
codeforces competitive-programming Jun 3, 2026
Practice › Codeforces Solutions › Abbyy Cup 2.0 - Final (unofficial) ›

CF 207D10 - The Beaver's Problem - 3

We are given a stream of documents, where each document is a short text consisting of a name and a body. Each document belongs to exactly one of three hidden classes.
codeforces competitive-programming Jun 3, 2026
Practice › Codeforces Solutions › Abbyy Cup 2.0 - Final (unofficial) ›

CF 207C3 - Game with Two Trees

We are maintaining two rooted trees that grow over time. Each operation attaches a new node to one of the trees by adding a single directed edge from an existing node to a fresh node, and that edge is labeled with a lowercase letter.
codeforces competitive-programming data-structures Jun 3, 2026
Practice › Codeforces Solutions › Abbyy Cup 2.0 - Final (unofficial) ›

CF 207C2 - Game with Two Trees

We are given two dynamically growing rooted trees. Each operation adds a child to a specified vertex, labeling the connecting edge with a lowercase letter.
codeforces competitive-programming Jun 3, 2026
Practice › Codeforces Solutions › Abbyy Cup 2.0 - Final (unofficial) ›

CF 207C1 - Game with Two Trees

We are asked to maintain two dynamically growing rooted trees with labeled edges, and after each operation, compute the number of "good combinations.
codeforces competitive-programming Jun 3, 2026
Practice › Codeforces Solutions › Abbyy Cup 2.0 - Final (unofficial) ›

CF 207B3 - Military Trainings

We are given a column of n tanks numbered 1 to n. Each tank i has a message receiving radius a[i]. During the exercise, exactly n messages must be sent from the front of the column to the back. After each message, the last tank in the message path moves to the front.
codeforces competitive-programming Jun 3, 2026
Practice › Codeforces Solutions › Abbyy Cup 2.0 - Final (unofficial) ›

CF 207B2 - Military Trainings

We are given a line of tanks, each occupying a fixed position in a row from left to right. Each tank has a parameter that determines how far it can receive a message when it is the recipient.
codeforces competitive-programming Jun 3, 2026
Practice › Codeforces Solutions › Abbyy Cup 2.0 - Final (unofficial) ›

CF 207B1 - Military Trainings

We are asked to simulate a training exercise where a line of tanks must pass messages from the front to the end, following specific rules. Initially, the tanks are numbered from 1 to n, and each tank i has a message receiving radius ai.
codeforces competitive-programming Jun 3, 2026
Practice › Codeforces Solutions › Abbyy Cup 2.0 - Final (unofficial) ›

CF 207A3 - Beaver's Calculator 1.0

We are asked to schedule problems brought by multiple scientists for a special calculator. Each scientist provides a sequence of problems that must be solved in the given order.
codeforces competitive-programming greedy Jun 3, 2026
Practice › Codeforces Solutions › Abbyy Cup 2.0 - Final (unofficial) ›

CF 207A1 - Beaver's Calculator 1.0

We are given several scientists, each producing a sequence of computational tasks. Every task has a fixed resource requirement, and within each scientist’s list the tasks must be executed in the given order.
codeforces competitive-programming greedy May 29, 2026
Practice › Codeforces Solutions › Abbyy Cup 2.0 - Final (unofficial) ›

CF 207A2 - Beaver's Calculator 1.0

We are given several independent sequences of integers, one sequence per scientist. Each sequence must be kept in its original internal order, but we are allowed to interleave these sequences arbitrarily when forming one global list.
codeforces competitive-programming greedy May 29, 2026