2018-2019 9th BSUIR Open Programming Championship. Junior

12 problems from 2018-2019 9th BSUIR Open Programming Championship. Junior (contest 102440), difficulty -. 9/12 solutions verified against sample I/O.

12 items

2018-2019 9th BSUIR Open Programming Championship. Junior

Special | 12 problems | 9/12 verified | Difficulty - | 1h 10m

# Problem Rating Tags Accepted Time ✓
A \u0414\u043e\u043c\u0430\u0448\u043d\u044f\u044f \u0430\u043a\u0443\u043b\u0430 9m 48s ✓
B \u041f\u0435\u0440\u0435\u0441\u0442\u0430\u043d\u043e\u0432\u043a\u0443 \u043d\u0430 \u043f\u0440\u043e\u043a\u0430\u0447\u043a\u0443 2m 18s
C A + B = C 8m 50s ✓
D \u041f\u0435\u0442\u044f \u0438 \u043c\u0430\u0441\u0441\u0438\u0432 2m 46s ✓
E The Hitchhiker's Guide to the Galaxy 4m 36s ✓
F Football championship 9m 53s
G \u0420\u0430\u0441\u043a\u0440\u0430\u0441\u043a\u0438 6m 39s ✓
H Policeman from Rublevka 6m 55s ✓
I Shuffle one more time 2m 4s
J Delivery in the city of the future 2m 9s ✓
K \u0410\u0431\u0441\u043e\u043b\u044e\u0442\u043d\u0430\u044f \u0430\u0431\u0441\u043e\u043b\u044e\u0442\u043d\u043e\u0441\u0442\u044c \u043c\u0430\u0441\u0441\u0438\u0432\u0430 5m 53s ✓
L \u0420\u0430\u0437\u0434\u0435\u043b\u0435\u043d\u0438\u0435 \u043a\u0440\u043e\u043b\u0438\u043a\u043e\u0432 8m 19s ✓
Practice › Codeforces Solutions › 2018-2019 9th BSUIR Open Programming Championship. Junior ›

CF 102440H - Policeman from Rublevka

We have an integer array (a1,dots,an), where each element describes the difficulty of one solved crime. Lesha wants to remove one existing element (ap) and insert two new integer values (q) and (r). The resulting array has (n+1) elements.
codeforces competitive-programming Aug 9, 2026
Practice › Codeforces Solutions › 2018-2019 9th BSUIR Open Programming Championship. Junior ›

CF 102440I - Shuffle one more time

The shuffle algorithm itself is missing from the supplied statement. It appears as an image, and the exact operations used to update the 32-bit seed determine the entire solution, including how the seed is recovered from the given permutation.
codeforces competitive-programming Aug 9, 2026
Practice › Codeforces Solutions › 2018-2019 9th BSUIR Open Programming Championship. Junior ›

CF 102440G - Раскраски

The sheet is an (n times m) rectangular grid of cells. A final drawing is simply a subset of cells that have been colored. The coloring process starts at any cell, and every newly colored cell has to share a side with the previously colored cell.
codeforces competitive-programming Aug 9, 2026
Practice › Codeforces Solutions › 2018-2019 9th BSUIR Open Programming Championship. Junior ›

CF 102440C - A + B = C

We are given exactly three integers, and we may reorder them. The goal is to print an ordering x y z such that x + y = z. If no permutation has this property, we print -1 -1 -1. Any valid ordering is accepted. The input values satisfy -2^63 < ai < 2^63.
codeforces competitive-programming Aug 9, 2026
Practice › Codeforces Solutions › 2018-2019 9th BSUIR Open Programming Championship. Junior ›

CF 102440F - Football championship

We have friends numbered from (1) to (n), and friend (i) contributes exactly (i) strength to whichever of three teams receives them. Every friend must belong to exactly one team, and the three team sums must be equal.
codeforces competitive-programming Aug 9, 2026
Practice › Codeforces Solutions › 2018-2019 9th BSUIR Open Programming Championship. Junior ›

CF 102440A - Домашняя акула

We have a sequence of food units, where each position stores a food type. The shark can eat exactly k units in one feeding, and all those units must have the same type. A chosen interval is successful if all food inside it can be partitioned into groups of exactly k equal types.
codeforces competitive-programming Aug 9, 2026
Practice › Codeforces Solutions › 2018-2019 9th BSUIR Open Programming Championship. Junior ›

CF 102440L - Разделение кроликов

We have rabbits numbered from (1) to (n), and every rabbit must receive one of two labels, (0) or (1). The labels cannot be chosen arbitrarily. Whenever (b) divides (a), the labels must satisfy [ f(a)=f(b) text{OR} f(a/b).
codeforces competitive-programming Aug 8, 2026
Practice › Codeforces Solutions › 2018-2019 9th BSUIR Open Programming Championship. Junior ›

CF 102440K - Абсолютная абсолютность массива

We have a binary array. Its absolute value is the absolute difference between the number of ones and the number of zeros. After changing one contiguous segment, including the possibility of changing nothing, we want the largest absolute value that can be obtained.
codeforces competitive-programming Aug 8, 2026
Practice › Codeforces Solutions › 2018-2019 9th BSUIR Open Programming Championship. Junior ›

CF 102440J - Delivery in the city of the future

Think of every grid cell as a vertex of a graph. A direct teleportation is an edge between two vertices when they lie in the same row or column, contain the same letter, and there is at least one more occurrence of that same letter strictly between them.
codeforces competitive-programming Aug 8, 2026
Practice › Codeforces Solutions › 2018-2019 9th BSUIR Open Programming Championship. Junior ›

CF 102440E - The Hitchhiker's Guide to the Galaxy

There is a direct contradiction between the supplied problem statement and its sample output, so a correct editorial cannot be written from the statement exactly as given.
codeforces competitive-programming Aug 8, 2026
Practice › Codeforces Solutions › 2018-2019 9th BSUIR Open Programming Championship. Junior ›

CF 102440D - Петя и массив

We have an array (a) and a nonnegative threshold (k). A subarray is called beautiful if, after deleting at most one element from it, its maximum minus its minimum can be made at most (k).
codeforces competitive-programming Aug 8, 2026
Practice › Codeforces Solutions › 2018-2019 9th BSUIR Open Programming Championship. Junior ›

CF 102440B - Перестановку на прокачку

We start with a permutation p of the numbers from 1 to n. We may delete any elements, but the remaining elements must stay in their original order, so every possible result is a subsequence of the permutation.
codeforces competitive-programming Aug 8, 2026