2018-2019 9th BSUIR Open Programming Championship. Final

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

11 items

2018-2019 9th BSUIR Open Programming Championship. Final

Special | 11 problems | 11/11 verified | Difficulty - | 33m 49s

#	Problem	Time	✓
A	Template for Search	7m 5s	✓
B	Redistribution of Digits	2m 24s	✓
C	Partial Sums	4m 57s	✓
D	Lis on Circle	2m 2s	✓
E	Very Simple Sum	1m 55s	✓
F	Random XOR	1m 49s	✓
G	Sum of Distances in Cactus	2m 19s	✓
H	Not A + B	56s	✓
I	Cutting	3m 13s	✓
J	Paternity Testing	4m 28s	✓
K	Chess Positions	2m 41s	✓

Practice › Codeforces Solutions › 2018-2019 9th BSUIR Open Programming Championship. Final ›

CF 102441C - Partial Sums

We start with an (n times m) binary matrix (A0). One operation replaces every cell by the parity of the rectangle from the upper-left corner to that cell.

Practice › Codeforces Solutions › 2018-2019 9th BSUIR Open Programming Championship. Final ›

CF 102441A - Template for Search

We are given a pattern containing lowercase letters, ?, and . A lowercase letter must appear literally, ? can represent any one lowercase letter, and can represent any sequence of lowercase letters, including the empty sequence.

Practice › Codeforces Solutions › 2018-2019 9th BSUIR Open Programming Championship. Final ›

CF 102441I - Cutting

We start with a positive integer written in decimal notation. A cut chooses a position between two digits, so the number is split into two non-empty decimal parts. After interpreting both parts as integers, we replace the original number with their absolute difference.

Practice › Codeforces Solutions › 2018-2019 9th BSUIR Open Programming Championship. Final ›

CF 102441H - Not A + B

For each test case, we receive two positive integers a and b. We have to print some integer c between 1 and 50 such that c is different from a + b. There is no requirement to find the smallest or largest valid value, so any value satisfying the condition is accepted.

Practice › Codeforces Solutions › 2018-2019 9th BSUIR Open Programming Championship. Final ›

CF 102441K - Chess Positions

We need to print an arbitrary 8 by 8 chessboard containing queens, bishops, knights, rooks, or empty cells. White pieces are uppercase and black pieces are lowercase.

Practice › Codeforces Solutions › 2018-2019 9th BSUIR Open Programming Championship. Final ›

CF 102441J - Paternity Testing

We have a rooted tree with vertex 1 as the root. Vertices are numbered from 1 to (n). For a query interval ([l,r]), every vertex (v) with (lle vle r) contributes the number of vertices from the same interval that lie in the subtree of (v).

Practice › Codeforces Solutions › 2018-2019 9th BSUIR Open Programming Championship. Final ›

CF 102441G - Sum of Distances in Cactus

We have a connected cactus graph with up to (10^5) vertices. A cactus is sparse and has a particularly useful structure: every biconnected component is either a single bridge or one simple cycle.

Practice › Codeforces Solutions › 2018-2019 9th BSUIR Open Programming Championship. Final ›

CF 102441F - Random XOR

We have an array a of n integers. Each element is independently selected with probability P = X / Y. The selected elements are XORed together, producing a random integer s. If nothing is selected, the XOR is zero.

Practice › Codeforces Solutions › 2018-2019 9th BSUIR Open Programming Championship. Final ›

CF 102441E - Very Simple Sum

For every ordered quadruple of indices ((x,y,z,w)), we form two values. The first is the ordinary sum [ S=ax+ay+az+aw, ] and the second is the bitwise XOR [ X=bxoplus byoplus bzoplus bw.

Practice › Codeforces Solutions › 2018-2019 9th BSUIR Open Programming Championship. Final ›

CF 102441D - Lis on Circle

There are (n) players sitting around a circle, numbered from (1) to (n). Player (1) gets the first turn, then player (2), and so on, wrapping from (n) back to (1). Each player owns several cards, and every card has an integer value.

Practice › Codeforces Solutions › 2018-2019 9th BSUIR Open Programming Championship. Final ›

CF 102441B - Redistribution of Digits

We have a multiset of nonzero decimal digits. Every occurrence matters, so if the input contains three copies of 7, all three copies must be used exactly once. We also have n upper bounds.