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.
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 ptsB078Setting the dialFind 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 ptsB079Moves of the shuttle robotFor 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 ptsB083Members who hear the news on day KNews 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 ptsB085Substations that get the maintenance noticeFind the number of substations reached from substation 1 over two or fewer transmission lines.
200 ptsrawCODEBreadth-first search (BFS)Shortest path
October 30
200 ptsB087Changing the safe's numberUsing 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 ptsA006Touch missionThere are two or more target points on an N×N board.
300 ptsrawCODEBrute forceBreadth-first search (BFS)
October 30
300 ptsA011Two knightsAn N×N board holds 1 hero and 2 knights, and at least 1 enemy.
300 ptsrawCODEBrute forceBreadth-first search (BFS)
October 30
300 ptsA012Wolves and chickensAn N×N map holds K wolves and K chickens.
300 ptsrawCODEBacktrackingBrute force
October 30
300 ptsB080Splitting workers between two work areasFor 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 ptsB081Making a number with four buttonsFind 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 ptsB082Where the ink has spreadOn 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 ptsB084Number of languages passed throughSwitching 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 ptsB086Erosion of the islandLand 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 ptsB088Sharing the water between cellsA 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 pts20 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.