Junior Balkan Olympiad in Informatics 2025. Day 1

3 problems from Junior Balkan Olympiad in Informatics 2025. Day 1 (contest 106147), difficulty -. 1/3 solutions verified against sample I/O.

3 items

Junior Balkan Olympiad in Informatics 2025. Day 1

Special | 3 problems | 1/3 verified | Difficulty - | 1m 33s

#	Problem	Time	✓
A	Powerbank	22s
B	Digging Bot	42s	✓
C	Game on tree	29s

Practice › Codeforces Solutions › Junior Balkan Olympiad in Informatics 2025. Day 1 ›

CF 106147B - Digging Bot

There is a hidden integer $n$ between 1 and 30000. In one experiment we provide a set of allowed step lengths $a1,a2,dots,ak$. The digging bot starts at depth 0 and wants to reach depth $n$. It may repeatedly use any of the given step lengths.

Practice › Codeforces Solutions › Junior Balkan Olympiad in Informatics 2025. Day 1 ›

CF 106147C - Game on tree

I can write the editorial, but there is a mismatch in the problem reference. The title and ID you gave are “Codeforces 106147C - Game on tree”, while the statement structure in the prompt does not include the actual statement text.

Practice › Codeforces Solutions › Junior Balkan Olympiad in Informatics 2025. Day 1 ›

CF 106147A - Powerbank

including a fully correct Python implementation and detailed correctness reasoning.