Voronezh State University - Sitronics contest, 2022

10 problems from Voronezh State University - Sitronics contest, 2022 (contest 104115), difficulty -. 10/10 solutions verified against sample I/O.

10 items

Voronezh State University - Sitronics contest, 2022

Special | 10 problems | 10/10 verified | Difficulty - | 7m 16s

#	Problem	Time	✓
A	\u0411\u0438\u0442\u0432\u0430 \u0437\u0430 \u043f\u0443\u043b\u044c\u0442	49s	✓
B	\u0417\u0430\u043c\u043e\u0449\u0435\u043d\u0438\u0435 \u0442\u0440\u0430\u043f\u0435\u0446\u0438\u044f\u043c\u0438	50s	✓
C	\u0427\u0442\u043e-\u0442\u043e \u043f\u0440\u043e \u043f\u043e\u0441\u043b\u0435\u0434\u043e\u0432\u0430\u0442\u0435\u043b\u044c\u043d\u043e\u0441\u0442\u044c	46s	✓
D	Xor-\u0438\u0437\u0430\u0446\u0438\u044f	55s	✓
E	21 \u043e\u0447\u043a\u043e	35s	✓
F	\u041d\u043e \u0432\u044b \u043e\u0431\u043e \u043c\u043d\u0435 \u0441\u043b\u044b\u0448\u0430\u043b\u0438	40s	✓
G	\u0414\u0438\u0441\u043a\u0440\u0438\u043c\u0438\u043d\u0430\u043d\u0442 \u0438\u043b\u0438 \u0442\u0435\u043e\u0440\u0435\u043c\u0430 \u0412\u0438\u0435\u0442\u0430?	43s	✓
H	\u0425\u0430\u043b\u044f\u0432\u043a\u0430	44s	✓
I	\u0414\u0435\u043b\u0435\u043d\u0438\u0435 \u0441\u0442\u0440\u043e\u043a\u0438	28s	✓
J	\u0421\u043a\u043e\u0431\u043a\u0430, \u0441\u043a\u043e\u0431\u043a\u0430, \u0441\u043a\u043e\u0431\u043a\u0430...	46s	✓

Practice › Codeforces Solutions › Voronezh State University - Sitronics contest, 2022 ›

CF 104115J - Скобка, скобка, скобка...

We are dealing with sequences formed from bracket-like operations where we build a structure step by step and are asked to compute the probability that the resulting sequence satisfies correctness conditions of a bracket system.

Practice › Codeforces Solutions › Voronezh State University - Sitronics contest, 2022 ›

CF 104115H - Халявка

We are given an $n times n$ grid where each cell must be assigned a letter from 'a' to 'z', and these letters define a priority ordering, with 'a' being the highest priority and 'z' the lowest. A robot starts at cell $(1,1)$.

Practice › Codeforces Solutions › Voronezh State University - Sitronics contest, 2022 ›

CF 104115I - Деление строки

We are given a string consisting of lowercase English letters and asked whether it can be split into exactly k contiguous non-empty pieces such that every piece contains the same number of consonant letters. A consonant here means any letter except a, e, i, o, u, y.

Practice › Codeforces Solutions › Voronezh State University - Sitronics contest, 2022 ›

CF 104115G - Дискриминант или теорема Виета?

We are given a quadratic equation with integer coefficients $a, b, c$, all of them nonzero. We are allowed to replace any subset of these three coefficients with new nonzero integers.

Practice › Codeforces Solutions › Voronezh State University - Sitronics contest, 2022 ›

CF 104115E - 21 очко

We are given a partially observed state of a standard 52-card deck and a hand of cards already taken by a player.

Practice › Codeforces Solutions › Voronezh State University - Sitronics contest, 2022 ›

CF 104115D - Xor-изация

We are maintaining an array of non-negative integers under two types of operations. The first operation applies a bitwise XOR with a given value to every element in a contiguous subarray.

Practice › Codeforces Solutions › Voronezh State University - Sitronics contest, 2022 ›

CF 104115F - Но вы обо мне слышали

There is a row of $n$ chests numbered from 1 to $n$. Exactly one chest $k$ contains treasure, while all others are empty. A pirate starts opening chests but has not yet discovered where the treasure is located.

Practice › Codeforces Solutions › Voronezh State University - Sitronics contest, 2022 ›

CF 104115B - Замощение трапециями

We are given two geometric pieces, each described as a quadrilateral with a very specific structure: a right trapezoid.

Practice › Codeforces Solutions › Voronezh State University - Sitronics contest, 2022 ›

CF 104115A - Битва за пульт

We are given a set of time intervals representing TV programs. Each program has a start time, an end time, and one of three types. Type 1 programs are preferred by Petya, type 2 by Masha, and type 3 by both of them simultaneously.

Practice › Codeforces Solutions › Voronezh State University - Sitronics contest, 2022 ›

CF 104115C - Что-то про последовательность

We start with an infinite sequence of natural numbers written in order, essentially 1, 2, 3, 4, 5 and so on. We are interested in how this sequence changes after a series of deletion operations. Each operation is defined by a step value y.