VK Cup 2022 - Квалификация (Engine)

Solutions for VK Cup 2022 - Квалификация (Engine) (contest 1769). 3/8 problems verified against sample I/O. Difficulty range: 800-2300.

8 items

VK Cup 2022 - Квалификация (Engine)

Type: Special | Problems: 8 | Verified: 3/8 | Rating range: 800-2300 | Time: 19m 16s

Problem Name Rating Tags Solve Time Verified
A \u0423\u0437\u043a\u0430\u044f \u0434\u043e\u0440\u043e\u0433\u0430 800 *special, math 3m 33s ✗
B1 \u041a\u043e\u043f\u0438\u0440\u043e\u0432\u0430\u043d\u0438\u0435 \u0444\u0430\u0439\u043b\u043e\u0432 I 1000 *special, brute-force, implementation 1m 47s ✓
B2 \u041a\u043e\u043f\u0438\u0440\u043e\u0432\u0430\u043d\u0438\u0435 \u0444\u0430\u0439\u043b\u043e\u0432 II 1400 *special, binary-search, brute-force 2m 8s ✓
C1 \u041f\u043e\u0434\u043a\u0440\u0443\u0442\u043a\u0430 I 1200 *special, brute-force, dp 1m 36s ✗
C2 \u041f\u043e\u0434\u043a\u0440\u0443\u0442\u043a\u0430 II 1300 *special, dp 2m 24s ✗
D1 \u0418\u0433\u0440\u0430 \u0432 \u0414\u0435\u0432\u044f\u0442\u043a\u0443 I 1800 *special, brute-force, dp 1m 26s ✓
D2 \u0418\u0433\u0440\u0430 \u0432 \u0414\u0435\u0432\u044f\u0442\u043a\u0443 II 2200 *special, brute-force 4m 8s ✗
D3 \u0418\u0433\u0440\u0430 \u0432 \u0414\u0435\u0432\u044f\u0442\u043a\u0443 III 2300 *special, brute-force 2m 14s ✗
Practice › Codeforces Solutions › VK Cup 2022 - Квалификация (Engine) ›

CF 1769D2 - Игра в Девятку II

We are dealing with a deterministic two-player card game played with a fixed 36-card deck. The deck is split between two players, and the game evolves by repeatedly placing cards onto a shared table under strict adjacency rules: a card can only be played if it either is a nine…
codeforces competitive-programming *special brute-force Jun 9, 2026
Practice › Codeforces Solutions › VK Cup 2022 - Квалификация (Engine) ›

CF 1769D3 - Игра в Девятку III

This is a Type B (prove inequality) problem, not Type C. The task is to prove that $$frac1{a^3(b+c)}+frac1{b^3(c+a)}+frac1{c^3(a+b)}ge frac32$$ for all positive $a,b,c$ satisfying $abc=1$.
codeforces competitive-programming *special brute-force Jun 9, 2026
Practice › Codeforces Solutions › VK Cup 2022 - Квалификация (Engine) ›

CF 1769D1 - Игра в Девятку I

We have a two-player card game using a 36-card deck, where each player gets 18 cards. The cards are numbered 6 through Ace in four suits. Alice moves first. On their turn, a player can play: - Any 9, at any time.
codeforces competitive-programming *special brute-force dp Jun 9, 2026
Practice › Codeforces Solutions › VK Cup 2022 - Квалификация (Engine) ›

CF 1769C2 - Подкрутка II

This is a Type B (prove inequality) problem, not Type C. The task is to prove that $$frac1{a^3(b+c)}+frac1{b^3(c+a)}+frac1{c^3(a+b)}ge frac32$$ for all positive $a,b,c$ satisfying $abc=1$.
codeforces competitive-programming *special dp Jun 9, 2026
Practice › Codeforces Solutions › VK Cup 2022 - Квалификация (Engine) ›

CF 1769A - Узкая дорога

We are given a line of scooters sorted by their initial distance to a destination point. Scooter $1$ starts closest, scooter $n$ farthest. Each scooter has a fixed nominal speed equal to its index, so higher-index scooters try to move faster.
codeforces competitive-programming *special math Jun 9, 2026
Practice › Codeforces Solutions › VK Cup 2022 - Квалификация (Engine) ›

CF 1769C1 - Подкрутка I

We are given a multiset of “events”, where each event originally belongs to a specific day. The array is sorted, and each value tells us on which day a commit happened.
codeforces competitive-programming *special brute-force dp greedy Jun 9, 2026
Practice › Codeforces Solutions › VK Cup 2022 - Квалификация (Engine) ›

CF 1769B2 - Копирование файлов II

We are asked to model copying multiple files sequentially from one server to another, tracking progress in two ways: per-file and overall. Each file has a size in bytes, and we simulate copying byte by byte.
codeforces competitive-programming *special binary-search brute-force math Jun 9, 2026
Practice › Codeforces Solutions › VK Cup 2022 - Квалификация (Engine) ›

CF 1769B1 - Копирование файлов I

We are asked to simulate the progress of copying multiple files from one server to another. Each file has a size in bytes, and copying is sequential, one byte at a time.
codeforces competitive-programming *special brute-force implementation math Jun 9, 2026