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)· 다이나믹 프로그래밍

13 problems match

A020Dodging walls
In the Dodging walls game you are given an N×M grid.
200 ptsrawCODESimulationDynamic programming
October 30
200 pts
B090The bell and the drum
A job order calls up the two orders below its own number, according to the number it carries. Find how many times the bell rings and how many times the drum rings when order N is given.
200 ptsrawCODEDynamic programmingRecursion
October 30
200 pts
B091Filling the measure
A measure N beats long is filled with one-beat notes and two-beat notes and no gaps. Find the remainder of the number of ways divided by 15,746.
200 ptsrawCODEDynamic programmingRecurrence relation
October 30
200 pts
B093Bamboo segment lengths
Segments 1, 2 and 3 of a bamboo are each 1 long, and every segment above them is the segment two places below added to the segment three places below. Find the length of segment N.
200 ptsrawCODEDynamic programmingRecurrence relation
October 30
200 pts
B094Picking plots on a terraced field
A farmer goes down a terraced field one level at a time from level 1 to level N, picking plots. Find the largest total yield that can be harvested.
200 ptsrawCODEDynamic programmingRecurrence relation
October 30
200 pts
B095Growth multipliers
Find the largest value that can come out of multiplying together the growth multipliers of a run of consecutive days.
200 ptsrawCODEDynamic programmingKorean
October 30
200 pts
B099Cutting down the water in the tank
Only three operations are available for bringing the water in the tank down to exactly 1 liter. Find the smallest number of operations needed.
200 ptsrawCODEDynamic programmingKorean
October 30
200 pts
B101Booth carpets
Booths that touch have to get carpets of different colors. Find the smallest cost of carpeting every booth.
200 ptsrawCODEDynamic programmingKorean
October 30
200 pts
B092Opening the beehives
Beehives stand in a row and three hives with consecutive numbers cannot all be opened. Find the largest amount of honey that can be collected.
300 ptsrawCODEDynamic programmingRecurrence relation
October 30
300 pts
B096Assigning parking slots
Each car can use only its own slot or a slot right beside it, and the charging slots are fixed. Find the number of possible ways to park.
300 ptsrawCODEDynamic programmingCounting
October 30
300 pts
B097Joining up a fence
At most one plank is taken from each workshop. Find the number of ways to build a fence whose total length is exactly H.
300 ptsrawCODEDynamic programmingKnapsack
October 30
300 pts
B098Taking boxes off the shelf
The shelf is tidied so that the weights fall from left to right. Find the smallest number of boxes that have to be taken off.
300 ptsrawCODEDynamic programmingLongest increasing subsequence
October 30
300 pts
B100Sluice gate levels
The levels of two neighboring sluice gates differ by exactly 1 and the first gate is not at level 0. Find the number of such settings.
300 ptsrawCODEDynamic programmingCounting
October 30
300 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.