Voronezh State University - Sitronics contest II

12 problems from Voronezh State University - Sitronics contest II (contest 104882), difficulty -. 8/12 solutions verified against sample I/O.

12 items

Voronezh State University - Sitronics contest II

Special | 12 problems | 8/12 verified | Difficulty - | 9m 11s

# Problem Rating Tags Accepted Time ✓
A A+B? 37s ✓
B Before contest 51s ✓
C Creative archery 52s ✓
D Delicious pies 26s
E Efficient synchronization 51s ✓
F Fine arts museum 57s ✓
G Grandma's Cubes 34s
H Have fun taking tests 36s
I Ideal 2B 46s ✓
J Just a map editor 1m 22s ✓
K Key anagram 24s
L Line without beginning, line without end 55s ✓
Practice › Codeforces Solutions › Voronezh State University - Sitronics contest II ›

CF 104882L - Line without beginning, line without end

We are trying to recover an unknown straight line in the plane, known to have the form $y = kx + b$, where both parameters are real numbers bounded between $-100$ and $100$.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › Voronezh State University - Sitronics contest II ›

CF 104882J - Just a map editor

We are given an $n times m$ rectangular grid and must fill each cell with either 0 or 1. A cell belongs to a connected component if it is part of a maximal group of equal values where movement is allowed only between side-adjacent cells.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › Voronezh State University - Sitronics contest II ›

CF 104882K - Key anagram

Codeforces 104882K: Key anagram
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › Voronezh State University - Sitronics contest II ›

CF 104882I - Ideal 2B

We are given a non-negative integer up to one trillion and we need to print a shortened representation of it. The goal is not just compression, but a very specific kind of approximation: we want a string no longer than four characters that represents a number which does not…
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › Voronezh State University - Sitronics contest II ›

CF 104882H - Have fun taking tests

We are dealing with an interactive multiple-choice test. The test contains $n$ questions, and each question has exactly two possible answers, where exactly one is correct. We do not know the correct answers in advance, and we cannot query them directly.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › Voronezh State University - Sitronics contest II ›

CF 104882F - Fine arts museum

We are given up to eight “trees”, each defined by two parameters. Each tree consists of a vertical trunk and a triangular crown drawn with ASCII characters.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › Voronezh State University - Sitronics contest II ›

CF 104882E - Efficient synchronization

We are maintaining a collection of k independent versions of the same array of size n. Initially, all k arrays are identical and equal to a given base array. Over time, we process two kinds of operations that are timestamped.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › Voronezh State University - Sitronics contest II ›

CF 104882G - Grandma's Cubes

We are given a sequence of dice outcomes, one per throw. At each position Masha is allowed to announce any number from 1 to 6, independent of the real roll, and her score is the sum of all announced numbers. The twist is a “surveillance rule” tied to the value 6.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › Voronezh State University - Sitronics contest II ›

CF 104882D - Delicious pies

We are given a row of pies indexed from left to right, where each pie is either cabbage or mushroom. Two children repeatedly take pies from this row according to a positional rule: one child targets every 3rd remaining pie, the other targets every 7th remaining pie.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › Voronezh State University - Sitronics contest II ›

CF 104882C - Creative archery

We are building a square target made of unit blocks, where the side length is an even integer $x$. The square is not uniformly colored. Instead, it consists of concentric square “rings”.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › Voronezh State University - Sitronics contest II ›

CF 104882B - Before contest

Two players assign a numeric score to the same problem using two different formulas. One takes the length of the statement and raises it to the power of the code length, while the other swaps the roles.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › Voronezh State University - Sitronics contest II ›

CF 104882A - A+B?

We are counting integer pairs $(a, b)$ that satisfy a simple linear constraint: their sum is fixed to a given value $n$, and both numbers must lie inside a symmetric interval centered at zero.
codeforces competitive-programming Jun 28, 2026