Вузовско-академическая олимпиада по информатике 2021

7 problems from Вузовско-академическая олимпиада по информатике 2021 (contest 103064), difficulty -. 6/7 solutions verified against sample I/O.

7 items

Вузовско-академическая олимпиада по информатике 2021

Special | 7 problems | 6/7 verified | Difficulty - | 7m 58s

# Problem Rating Tags Accepted Time ✓
A \u0421\u043d\u043e\u0432\u0430 \u0418\u0418 59s ✓
B \u041a\u0430\u043a \u043f\u0440\u043e\u0439\u0442\u0438 \u0432 \u0441\u0442\u043e\u043b\u043e\u0432\u0443\u044e 59s ✓
C Baba is You 2m 39s
D \u041e\u043d \u0432\u0430\u043c \u043d\u0435 \u0444\u0435\u0440\u0437\u044c 53s ✓
E \u0421\u0438\u043b\u0430 \u0435\u0441\u0442\u044c, \u0443\u043c \u0442\u043e\u0436\u0435 \u043d\u0443\u0436\u0435\u043d 53s ✓
F \u0422\u0440\u0443\u0434\u043d\u044b\u0439 \u0432\u044b\u0431\u043e\u0440 47s ✓
G Ulearn 48s ✓
Practice › Codeforces Solutions › Вузовско-академическая олимпиада по информатике 2021 ›

CF 103064G - Ulearn

We are given a repeated workflow that transforms each programming task from start to finish. Every task goes through four stages in order.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › Вузовско-академическая олимпиада по информатике 2021 ›

CF 103064F - Трудный выбор

We are given a collection of candidate groups of friends, where each group has a known size. Separately, we are given several “counting-out” procedures, where each procedure is defined by a number of steps, and the selection is done on a circle of people.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › Вузовско-академическая олимпиада по информатике 2021 ›

CF 103064C - Baba is You

Let $(a{ij})$ be an $mtimes n$ contingency table with fixed row sums $sum{j=1}^n a{ij}=ri quad (1le ile m)$ and column sums $sum{i=1}^m a{ij}=cj quad (1le jle n),$ where $sumi ri=sumj cj$.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › Вузовско-академическая олимпиада по информатике 2021 ›

CF 103064D - Он вам не ферзь

We are given a square grid of size $M times M$, with up to $N$ white kings placed on distinct cells. For each test case, we must count how many empty cells can host a black queen such that two conditions hold simultaneously.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › Вузовско-академическая олимпиада по информатике 2021 ›

CF 103064E - Сила есть, ум тоже нужен

Each employee in the company is a node in a rooted tree. Employee 1 is the root, and every other employee has exactly one direct manager, forming a hierarchy where edges point from a manager to their direct subordinates.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › Вузовско-академическая олимпиада по информатике 2021 ›

CF 103064A - Снова ИИ

We are working with a function built from integer floor division, applied twice. For a fixed number $N$, every candidate value $X$ in the range $[1, N]$ is tested by first computing $lfloor N / X rfloor$, and then applying the same operation again using that result as a divisor.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › Вузовско-академическая олимпиада по информатике 2021 ›

CF 103064B - Как пройти в столовую

We are given a rectangular grid that represents a building corridor system. Each cell of the grid is either empty, a wall, a key, a locked door, or the starting position. From the starting cell, a person moves according to a fixed sequence of directions.
codeforces competitive-programming Jul 4, 2026