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.
26 problems match · page 1 of 2
B066Water tanks the dye reaches
Find the number of water tanks the dye reaches when dye is poured into tank 1.
100 ptsrawCODEDepth-first search (DFS)Graph traversal
October 30
100 ptsB054Coffee bean tasting orderPrint every tasting record that picks M of the N kinds of coffee bean and drinks them in order, in lexicographic order.
200 ptsrawCODEBacktrackingCounting
October 30
200 ptsB055Lighthouse lighting orderPrint every order that lights all N lighthouses once each, in lexicographic order.
200 ptsrawCODEBacktrackingCounting
October 30
200 ptsB058Flag signalsPrint every signal that can be made by hanging flags of N colors one on each of the M flagpoles, in lexicographic order.
200 ptsrawCODEBacktrackingCounting
October 30
200 ptsB067Number of charging cablesFind the smallest number of cable reels needed to charge every electric car in a grid parking lot.
200 ptsrawCODEDepth-first search (DFS)Connected components
October 30
200 ptsB068Distance between sheltersWork out the distance between two shelters joined by trails, for each query in order.
200 ptsrawCODEDepth-first search (DFS)Trees
October 30
200 ptsB071Counting sand islandsFind the number of sand islands in the photo and the size of each one, from the smallest upward.
200 ptsrawCODEDepth-first search (DFS)Connected components
October 30
200 ptsB074Counting ore regionsCount the regions of connected matching mineral in a photo of a cut face, once the way an appraiser who tells all three minerals apart counts them and once the way a tester that cannot tell two of them apart counts them.
200 ptsrawCODEDepth-first search (DFS)Graph traversal
October 30
200 ptsB076Maximizing the temperature shockChange the order in which the freezer warehouses are visited and make the sum of the set temperature differences between warehouses visited one after the other as large as possible.
200 ptsrawCODEBacktrackingBrute force
October 30
200 ptsA003Comparing combat powerThere are N seats laid out in a row.
300 ptsrawCODEBacktrackingBrute force
October 30
300 ptsA009Hitting the targetsThere are K targets on an N×N board.
300 ptsrawCODEBacktrackingBrute force
October 30
300 ptsA012Wolves and chickensAn N×N map holds K wolves and K chickens.
300 ptsrawCODEBacktrackingBrute force
October 30
300 ptsA015Cooperation scoreYou want to split N students into K groups.
300 ptsrawCODEBacktrackingBrute force
October 30
300 ptsA018Rotating defenseThere is one hero character.
300 ptsrawCODEBacktrackingBrute force
October 30
300 ptsA021Placing the knightsK knights are placed on an N×N board, and you want to rearrange their positions to score as high as possible.
300 ptsrawCODEBacktrackingBrute force
October 30
300 ptsA028Target practiceThere is an N×N board with one or more targets on it.
300 ptsrawCODEBacktrackingBrute force
October 30
300 ptsB056Calculator expressionsFind every expression whose result is 0, built by putting a plus key, a minus key or no key at all between the number keys 1 through N.
300 ptsrawCODEBacktrackingCounting
October 30
300 ptsB060Island tourFind the smallest fuel a supply ship uses to start from island 1, visit every island once and come back.
300 ptsrawCODEBacktrackingCounting
October 30
300 ptsB063Arranging pots in a greenhouseCount the ways to place N pots in an N×N greenhouse so that no scents mix.
300 ptsrawCODEBacktrackingBrute force
October 30
300 ptsB064Stamp tour of a shopping mallFind the largest number of stamps a visitor can collect without taking a stamp from the same trade twice.
300 ptsrawCODEBacktrackingBrute force
October 30
300 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.