Log inSign up

Problems

By default we show the easiest problems first. If this is your first visit, work down from the top. The AI model runs on your own device, so a desktop is recommended. On mobile, judging one problem can take several minutes.

Filter by tag (70)· 너비 우선 탐색(BFS)

15 problems match

A017The staff fighter
One staff fighter has to fight many grapplers on an N×N board.
200 ptsrawCODEBreadth-first search (BFS)Korean
October 30
200 pts
B078Setting the dial
Find the shortest time to reach the target mark using only the three moves of turning the dial down by 1, up by 1, or to twice its mark.
200 ptsrawCODEBreadth-first search (BFS)Shortest path
October 30
200 pts
B079Moves of the shuttle robot
For each warehouse, find the smallest number of moves a shuttle robot needs to reach the target cell, where one move goes two cells along one axis and one cell along the other.
200 ptsrawCODEBreadth-first search (BFS)Shortest path
October 30
200 pts
B083Members who hear the news on day K
News spreads along relations that work in one direction only, and every member whose first day of hearing it is exactly day K has to be found.
200 ptsrawCODEBreadth-first search (BFS)Shortest path
October 30
200 pts
B085Substations that get the maintenance notice
Find the number of substations reached from substation 1 over two or fewer transmission lines.
200 ptsrawCODEBreadth-first search (BFS)Shortest path
October 30
200 pts
B087Changing the safe's number
Using only doubling and appending a 1 on the right to change the number A into B, find the smallest number of lines left in the logbook.
200 ptsrawCODEBreadth-first search (BFS)Shortest path
October 30
200 pts
A006Touch mission
There are two or more target points on an N×N board.
300 ptsrawCODEBrute forceBreadth-first search (BFS)
October 30
300 pts
A011Two knights
An N×N board holds 1 hero and 2 knights, and at least 1 enemy.
300 ptsrawCODEBrute forceBreadth-first search (BFS)
October 30
300 pts
A012Wolves and chickens
An N×N map holds K wolves and K chickens.
300 ptsrawCODEBacktrackingBrute force
October 30
300 pts
B080Splitting workers between two work areas
For each factory, decide whether every worker can be assigned to two work areas without breaking a single pair of workers that cannot be put together.
300 ptsrawCODEBreadth-first search (BFS)Graph traversal
October 30
300 pts
B081Making a number with four buttons
Find the shortest sequence of button presses that puts the target number on the display, using only four buttons that each combine the number on the display with itself.
300 ptsrawCODEBreadth-first search (BFS)Shortest path
October 30
300 pts
B082Where the ink has spread
On blotting paper where the lower-numbered ink spreads first, find the number of the ink on one particular cell after exactly S seconds.
300 ptsrawCODEBreadth-first search (BFS)Simulation
October 30
300 pts
B084Number of languages passed through
Switching from one dictionary to another to carry a document written in language 1 over to language N, find the smallest number of languages the document passes through.
300 ptsrawCODEBreadth-first search (BFS)Shortest path
October 30
300 pts
B086Erosion of the island
Land cells touching the outer sea on two or more sides erode away each year, and the number of years it takes for all the land to disappear has to be found.
400 ptsrawCODEBreadth-first search (BFS)Simulation
October 30
400 pts
B088Sharing the water between cells
A partition opens between two touching cells when the amounts of water they hold differ by an amount from L to R, and the cells connected that way then share their water evenly. Find how many rounds the water moved in.
400 ptsrawCODEBreadth-first search (BFS)Simulation
October 30
400 pts

20 per page. If you are unsure how to solve them, read the Guidefirst, or just open problem 1 and start there.

If a problem will not open, or the model will not load Q&A is the first place to look. Common questions are collected there. If it is not there either, Contact and I will answer you myself.