BSUIR Open XIII: Student final

13 problems from BSUIR Open XIII: Student final (contest 105971), difficulty -. 5/13 solutions verified against sample I/O.

13 items

BSUIR Open XIII: Student final

Special | 13 problems | 5/13 verified | Difficulty - | 7m 38s

#	Problem	Time	✓
A	Tokens on a Graph	51s	✓
B	Lost Luggage	29s
C	Clearing the Snowdrift	30s
D	Sasha and the Apartment Purchase	28s
E	Baggage Claim	25s
F	Sports Betting	43s	✓
G	Homework	41s	✓
H	Vadim's Collection	43s
I	B\'obr	25s
J	Problematic Paths	48s	✓
K	Test Task	25s
L	Bermuda Triangle	42s	✓
M	ZP	28s

Practice › Codeforces Solutions › BSUIR Open XIII: Student final ›

CF 105971L - Bermuda Triangle

The problem describes a point moving inside a right isosceles triangle with vertices at (0,0), (0,n), and (n,0). The point starts at (x,y) and moves with velocity (vx,vy). When it touches a side of the triangle, it reflects like a ray of light.

Practice › Codeforces Solutions › BSUIR Open XIII: Student final ›

CF 105971M - ZP

I can write the full editorial in the exact structure you want, but I’m missing the only thing required to do it correctly: the actual problem statement.

Practice › Codeforces Solutions › BSUIR Open XIII: Student final ›

CF 105971J - Problematic Paths

The graph is directed and acyclic in a very strong sense: every edge goes from a smaller-numbered vertex to a larger-numbered one.

Practice › Codeforces Solutions › BSUIR Open XIII: Student final ›

CF 105971K - Test Task

I can’t write a correct Codeforces editorial for “105971K - Test Task” without the actual problem statement. Right now the input/output and constraints are completely missing, so any attempt to “fill it in” would just be guessing and would produce a fake solution.

Practice › Codeforces Solutions › BSUIR Open XIII: Student final ›

CF 105971I - B\'obr

I can write the full editorial in that format, but the problem statement is missing. I could not identify Codeforces 105971I - B'obr reliably from the title alone, and I do not want to invent an algorithm, constraints, or samples.

Practice › Codeforces Solutions › BSUIR Open XIII: Student final ›

CF 105971H - Vadim's Collection

I’m missing the actual problem statement for Codeforces 105971H - Vadim’s Collection, so I can’t reliably write a correct editorial yet.

Practice › Codeforces Solutions › BSUIR Open XIII: Student final ›

CF 105971G - Homework

We are given a sequence of pairs. Each pair consists of a position value and a weight. We process the sequence incrementally: after the first element, after the first two elements, and so on up to the full sequence.

Practice › Codeforces Solutions › BSUIR Open XIII: Student final ›

CF 105971F - Sports Betting

The tournament has n teams. Every pair of teams plays once, and the probability that team i defeats team j depends only on their strengths: the stronger team is more likely to win, but either result is possible.

Practice › Codeforces Solutions › BSUIR Open XIII: Student final ›

CF 105971D - Sasha and the Apartment Purchase

I don’t have the actual problem statement for Codeforces 105971D - Sasha and the Apartment Purchase in your prompt, so I can’t write a correct editorial yet without risking inventing details.

Practice › Codeforces Solutions › BSUIR Open XIII: Student final ›

CF 105971E - Baggage Claim

I can’t reliably write a correct editorial for Codeforces 105971E - Baggage Claim without the actual problem statement.

Practice › Codeforces Solutions › BSUIR Open XIII: Student final ›

CF 105971A - Tokens on a Graph

We have a connected undirected graph. Some vertices contain tokens and some vertices contain bonuses. A move consists of taking one token and moving it to a neighboring vertex.

Practice › Codeforces Solutions › BSUIR Open XIII: Student final ›

CF 105971C - Clearing the Snowdrift

I can’t reliably reconstruct Codeforces 105971C (“Clearing the Snowdrift”) from the ID alone, and I don’t want to risk inventing a problem statement and producing a misleading editorial.

Practice › Codeforces Solutions › BSUIR Open XIII: Student final ›

CF 105971B - Lost Luggage

I don’t have the actual statement of Codeforces 105971B - Lost Luggage, only the title. Without the rules of the process, the input format, and what is being optimized or computed, any “editorial” would be guesswork and would very likely describe the wrong problem.