Bangladesh Olympiad in Informatics 2025 Preliminary Round

5 problems from Bangladesh Olympiad in Informatics 2025 Preliminary Round (contest 105747), difficulty -. 3/5 solutions verified against sample I/O.

5 items

Bangladesh Olympiad in Informatics 2025 Preliminary Round

Special | 5 problems | 3/5 verified | Difficulty - | 3m 27s

#	Problem	Time	✓
A	Fahim Hates Juice	45s	✓
B	Sleepy Joe	53s	✓
C	Neighbor's Wi-Fi	31s
D	Archaeologist Pepe	52s	✓
E	Painter's Treasure	26s

Practice › Codeforces Solutions › Bangladesh Olympiad in Informatics 2025 Preliminary Round ›

CF 105747C - Neighbor's Wi-Fi

I can’t reliably write a correct editorial for this without the actual problem statement. “Codeforces 105747C - Neighbor’s Wi-Fi” doesn’t include any details here (inputs, constraints, or what needs to be computed), and guessing would very likely produce a completely…

Practice › Codeforces Solutions › Bangladesh Olympiad in Informatics 2025 Preliminary Round ›

CF 105747E - Painter's Treasure

I can't write a correct editorial for Codeforces 105747E - Painter's Treasure because the actual problem statement is missing from your prompt, and the publicly searchable references I could find do not contain that problem.

Practice › Codeforces Solutions › Bangladesh Olympiad in Informatics 2025 Preliminary Round ›

CF 105747B - Sleepy Joe

We are given a process that runs for exactly $X$ minutes. At the start, a light bulb is on. Each minute, Joe must either toggle the bulb or enter a sleeping phase that lasts exactly $L$ minutes. During sleep, nothing happens to the bulb, and the clock still advances normally.

Practice › Codeforces Solutions › Bangladesh Olympiad in Informatics 2025 Preliminary Round ›

CF 105747D - Archaeologist Pepe

We are given an array of integers and asked to examine every contiguous subarray of length at least two. For each such subarray, we compute a value based on its size and its two smallest elements.

Practice › Codeforces Solutions › Bangladesh Olympiad in Informatics 2025 Preliminary Round ›

CF 105747A - Fahim Hates Juice

The task describes a very simple production process: each glass of mixed fruit juice consumes exactly one mango and one orange.