BFS BFS - MTA

9 problems from BFS BFS - MTA (contest 106137), difficulty -. 5/9 solutions verified against sample I/O.

9 items

BFS BFS - MTA

Special | 9 problems | 5/9 verified | Difficulty - | 4m 20s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Make it Divisible by 25				33s	✓
B	Gregor and the Pawn Game				40s	✓
C	The Lakes				38s	✓
D	Apple Tree				19s
E	Computer Game				25s
F	Gold Rush				21s
G	White-Black Balanced Subtrees				30s	✓
H	Game on Ranges				20s
O	Fall Down				34s	✓

Practice › Codeforces Solutions › BFS BFS - MTA ›

CF 106137O - Fall Down

We are given a rectangular grid that represents a vertical chamber where some cells are blocked and some contain movable pieces affected by gravity.

Practice › Codeforces Solutions › BFS BFS - MTA ›

CF 106137G - White-Black Balanced Subtrees

We have a rooted tree whose root is vertex 1. Every vertex has one of two colors, black or white. For each vertex, we consider the subtree that starts at that vertex and contains all descendants of that vertex, including the vertex itself.

Practice › Codeforces Solutions › BFS BFS - MTA ›

CF 106137H - Game on Ranges

I can’t write a correct editorial for that problem yet because the actual problem statement is missing from your prompt.

Practice › Codeforces Solutions › BFS BFS - MTA ›

CF 106137E - Computer Game

I can’t write a correct editorial for “Codeforces 106137E - Computer Game” yet because I don’t actually have the problem statement. The search results do not contain that problem.

Practice › Codeforces Solutions › BFS BFS - MTA ›

CF 106137F - Gold Rush

I can absolutely write this editorial in the exact format you want, but I’m missing the actual problem statement for Codeforces 106137F - Gold Rush.

Practice › Codeforces Solutions › BFS BFS - MTA ›

CF 106137D - Apple Tree

I can write the full editorial, but I need the actual problem statement for Codeforces 106137D - Apple Tree. The title and ID do not uniquely identify a Codeforces problem in the public archive I can verify. The well-known Codeforces problem titled “D.

Practice › Codeforces Solutions › BFS BFS - MTA ›

CF 106137B - Gregor and the Pawn Game

We are given a chessboard-like setup where Gregor controls pawns placed on the bottom row and there are enemy pawns placed on the top row. The pawns move only upward, one row at a time. A pawn can always move straight up if the square above is empty.

Practice › Codeforces Solutions › BFS BFS - MTA ›

CF 106137C - The Lakes

The task is built around a rectangular grid where each cell either contributes some non-negative value or represents empty ground.

Practice › Codeforces Solutions › BFS BFS - MTA ›

CF 106137A - Make it Divisible by 25

The task is to remove the minimum number of digits from a given positive integer so that the remaining digits form a number divisible by 25. The order of the remaining digits must stay the same because removing digits does not allow rearranging the number.