РСО-Алания 2018-2023. Избранное

15 problems from РСО-Алания 2018-2023. Избранное (contest 104820), difficulty -. 11/15 solutions verified against sample I/O.

15 items

РСО-Алания 2018-2023. Избранное

Special | 15 problems | 11/15 verified | Difficulty - | 19m 19s

#	Problem	Time	✓
A	\u0414\u043e\u0433\u043e\u043d\u044f\u043b\u043a\u0438	1m 8s	✓
B	\u0421\u043f\u0443\u0441\u043a \u0441 \u0433\u043e\u0440\u044b	1m 30s
C	\u041e\u0446\u0435\u043d\u043e\u0447\u043d\u043e\u0435	1m 5s	✓
D	\u0414\u0438\u0433\u043e\u0440\u0441\u043a\u0430\u044f \u043f\u043e\u0441\u043b\u0435\u0434\u043e\u0432\u0430\u0442\u0435\u043b\u044c\u043d\u043e\u0441\u0442\u044c	1m 22s	✓
E	\u0422\u0435\u043f\u043b\u043e	1m 9s	✓
F	\u041a\u0440\u0430\u0441\u0438\u0432\u043e\u0435 \u0447\u0438\u0441\u043b\u043e	52s	✓
G	\u0416\u0430\u0434\u043d\u043e\u0435 \u0434\u0435\u043b\u0435\u043d\u0438\u0435	56s	✓
H	\u041e\u043f\u0435\u0440\u0430\u0446\u0438\u043e\u043d\u043d\u0430\u044f \u0441\u0438\u0441\u0442\u0435\u043c\u0430 MACS_MS	1m 32s
I	\u0421\u0435\u043a\u0446\u0438\u044f \u043f\u043e \u0432\u043e\u043b\u044c\u043d\u043e\u0439 \u0431\u043e\u0440\u044c\u0431\u0435	1m 20s	✓
J	\u041f\u0440\u043e\u0433\u0443\u043b\u043a\u0430	1m 54s
K	\u0412\u044b\u0431\u043e\u0440 \u043d\u0435 \u0432\u0435\u043b\u0438\u043a	1m 43s	✓
L	\u041d\u0435\u0438\u0437\u0432\u0435\u0441\u0442\u043d\u043e\u0435	1m 10s	✓
M	[](https://codeforces.com/problemset/problem/104820/M)	1m 32s
N	\u041c\u0443\u0437\u044b\u043a\u0430\u043b\u044c\u043d\u043e\u0435	1m 8s	✓
O	\u0428\u043b\u044f\u0433\u0435\u0440	58s	✓

Practice › Codeforces Solutions › РСО-Алания 2018-2023. Избранное ›

CF 104820M - "Обычный кузнечик". Версия 2.0

We are working with a point on a number line from 1 to n. A frog starts at position 1 and wants to reach position n. At each move, it can jump forward by exactly 1 or exactly 2 steps.

Practice › Codeforces Solutions › РСО-Алания 2018-2023. Избранное ›

CF 104820O - Шлягер

We are asked to count how many binary $n times n$ grids exist under a local restriction: each cell is either 0 or 1, and we are forbidden from placing two 1s in adjacent cells that share a side. Diagonal adjacency does not matter, only up, down, left, and right.

Practice › Codeforces Solutions › РСО-Алания 2018-2023. Избранное ›

CF 104820N - Музыкальное

We are given several music genres, each genre having a fixed number of songs. The task is to decide whether it is possible to arrange all songs in a single playlist so that no two adjacent songs belong to the same genre.

Practice › Codeforces Solutions › РСО-Алания 2018-2023. Избранное ›

CF 104820K - Выбор не велик

We are given a grid whose rows and columns are not uniform in size. Each row has a positive height given by array A, and each column has a positive width given by array B.

Practice › Codeforces Solutions › РСО-Алания 2018-2023. Избранное ›

CF 104820J - Прогулка

We are given a tree with $n$ vertices, meaning there is exactly one simple path between any two nodes. On this tree we consider adding exactly one extra edge, connecting any two vertices that are not already directly connected. This creates exactly one cycle in the graph.

Practice › Codeforces Solutions › РСО-Алания 2018-2023. Избранное ›

CF 104820L - Неизвестное

We are given $n$ colors of balls. For each color $i$, there are $ai$ indistinguishable balls of that color in a box. There is also a requirement array $b$, where $bi$ tells us how many balls of color $i$ we want to guarantee. We draw $x$ balls from the box without looking.

Practice › Codeforces Solutions › РСО-Алания 2018-2023. Избранное ›

CF 104820H - Операционная система MACS_MS

We are given an array of integers and asked to count how many pairs of positions produce a XOR value that lies inside a fixed numeric interval $[A, B]$.

Practice › Codeforces Solutions › РСО-Алания 2018-2023. Избранное ›

CF 104820I - Секция по вольной борьбе

We are given the first $N$ terms of the sequence $an = frac{1}{n}$, which produces the values $1, frac{1}{2}, frac{1}{3}, dots, frac{1}{N}$.

Practice › Codeforces Solutions › РСО-Алания 2018-2023. Избранное ›

CF 104820G - Жадное деление

We are distributing three different types of candies to three friends, where each friend only accepts one specific type. The first friend only takes Snickers, the second only Mars, and the third only Bounty.

Practice › Codeforces Solutions › РСО-Алания 2018-2023. Избранное ›

CF 104820D - Дигорская последовательность

The sequence starts from a single digit string and grows by repeatedly taking the previous string, appending the decimal representation of the current index, and then appending the previous string again.

Practice › Codeforces Solutions › РСО-Алания 2018-2023. Избранное ›

CF 104820F - Красивое число

We are asked to construct a number with exactly n digits, where each digit must be from 1 to 9. There is no digit 0 allowed anywhere, so we are working entirely in the range of positive digit strings.

Practice › Codeforces Solutions › РСО-Алания 2018-2023. Избранное ›

CF 104820E - Тепло

We are given a string over lowercase Latin letters. We are allowed to repeatedly pick any position and replace its character with any other letter. Each replacement has cost 1, and we want to minimize the total cost.

Practice › Codeforces Solutions › РСО-Алания 2018-2023. Избранное ›

CF 104820B - Спуск с горы

We are given a rectangular grid representing a mountain surface. Each cell contains an integer value, which can be positive or negative.

Practice › Codeforces Solutions › РСО-Алания 2018-2023. Избранное ›

CF 104820A - Догонялки

Two players start on a number line: Alice is at position $a$, Bob is at position $b$, with $a < b$. Each second Alice moves to the right by a fixed integer speed $c$, and Bob moves to the right by a fixed integer speed $d$.

Practice › Codeforces Solutions › РСО-Алания 2018-2023. Избранное ›

CF 104820C - Оценочное

We are given two grading systems: one uses scores from 1 to n, the other uses scores from 1 to m. Some scores in the first system are considered equivalent to some scores in the second system, but the problem does not give us arbitrary pairs.