Dynamic programming ladder

Every judgeable DP problem, easiest first

Under construction

Still being built. Things may change

Total results6,386 problems

Commemorative Photos
Medium4
Sorting, Dynamic programming
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Sparkling Pluses
Medium4
Matrix, Dynamic programming
No attempts yet
Time limit
4s
Memory limit
1024 MB
Judgeable
Unlocking
Medium4
Dynamic programming, Sorting+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Gagarin Cup
Medium4
Probability, Dynamic programming
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Super Massive Black Hole
Medium4
Sorting, Dynamic programming+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Playlist
Medium4
Dynamic programming, Implementation
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Chemical Cipher
Medium4
Dynamic programming, Greedy+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Tree
Medium4
Tree, Dynamic programming
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Advertising Poster
Medium4
Dynamic programming, String
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Last-minute cramming
Medium4
Dynamic programming
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
DDR Stamina Management
Medium4
Dynamic programming, Implementation
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Square Root Sequence
Medium4
Dynamic programming, Prefix sum
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Carrying the Bags
Medium4
Dynamic programming, Math
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Racing Strategy
Medium4
Dynamic programming
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Strange Machine
Medium4
Dynamic programming, Simulation
No attempts yet
Time limit
3s
Memory limit
1024 MB
Judgeable
Machine Shop
Medium4
Dynamic programming, Graph+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Multiples of K
Medium4
Dynamic programming, Math
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Bicycle
Medium4
Dynamic programming
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Candy Split
Medium4
Dynamic programming, Array+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Mysterious words
Medium4
Dynamic programming, Hash map+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Stubborn Little Frog
Medium4
Dynamic programming, Sliding window
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Chunbae Who Stole Nabi's Snack
Medium4
Dynamic programming, Brute force
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Rebirth
Medium4
Dynamic programming, Array
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
Group Jump Rope
Medium4
Dynamic programming, Array
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Switch
Medium4
Dynamic programming, Array
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Spy Network
Medium4
Dynamic programming, String
No attempts yet
Time limit
5s
Memory limit
1024 MB
Judgeable
Dance Time
Medium4
Dynamic programming, Implementation
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Yukhoe Bibimbap
Medium4
Dynamic programming, Bit manipulation
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
Heiroglyphics
Medium4
Dynamic programming, Combinatorics+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Corrupted Gradebook
Medium4
Dynamic programming, String
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Dao's Race Competition
Medium4
Dynamic programming, Array
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Gas and Minerals
Medium4
Dynamic programming
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Yanggallae Rescue
Medium4
Tree, Dynamic programming+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
DP (Small)
Medium4
Dynamic programming, Array
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Jaewoo's Retake 1
Medium4
Dynamic programming, Greedy
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Special Oreum Climb
Medium4
Dynamic programming, Implementation
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
KMOP
Medium4
Dynamic programming, String
No attempts yet
Time limit
0.5s
Memory limit
1024 MB
Judgeable
Sequence and Queries
Medium4
Dynamic programming, Array
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Fix the Expression
Medium4
Dynamic programming
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Password Generation
Medium4
Dynamic programming, Prefix sum
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
The True FA Student
Medium4
Dynamic programming, Simulation
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
Painting the Floodwall
Medium4
Dynamic programming, Sorting+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Solution Relay
Medium4
Dynamic programming, Math
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Mukjjippa
Medium4
Dynamic programming, Probability+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Up and Down
Medium4
Dynamic programming, Binary search
No attempts yet
Time limit
3s
Memory limit
1024 MB
Judgeable
Connecting Grid Cells
Medium4
Dynamic programming, Matrix
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Herb Mixing
Medium4
Dynamic programming, Implementation
No attempts yet
Time limit
1s
Memory limit
2048 MB
Judgeable
Kim's Quest
Medium4
Dynamic programming, Math
No attempts yet
Time limit
3s
Memory limit
2048 MB
Judgeable
Savvy Seller
Medium4
Dynamic programming, Binary search+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Fastest Thing Alive
Medium4
Dynamic programming, Matrix
No attempts yet
Time limit
2s
Memory limit
2048 MB
Judgeable
Excursion
Medium4
Tree, Dynamic programming+1
No attempts yet
Time limit
7s
Memory limit
2048 MB
Judgeable
Range Digit Sum
Medium5
Math, Dynamic programming+1
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Unknown Sentence
Medium5
Dynamic programming, String+1
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Hotel
Medium5
Dynamic programming, Math
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Prefix
Medium5
Trie, Dynamic programming+2
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Solving Problems
Medium5
Dynamic programming, Graph+2
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Tangled Electric Wires
Medium5
Dynamic programming, Binary search+1
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Array Value
Medium5
Dynamic programming, Math+2
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Substring Picking Game
Medium5
Game theory, Dynamic programming+2
No attempts yet
Time limit
2s
Memory limit
256 MB
Judgeable
New Year Party
Medium5
Dynamic programming, Tree+1
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Making the Best Team
Medium5
Dynamic programming, Greedy+1
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Captain Dasom
Medium5
Dynamic programming, Math+1
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Summit Handshakes 2
Medium5
Dynamic programming, Combinatorics+1
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Number Game
Medium5
Dynamic programming, Math+1
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Making a Palindrome
Medium5
Dynamic programming, Array+1
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Tiling
Medium5
Dynamic programming, Math+1
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Sorting the Bookshelf
Medium5
Dynamic programming, Array+1
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Highway
Medium5
Dynamic programming, Graph+1
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Word Extension
Medium5
Dynamic programming, String+1
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Coin Distribution
Medium5
Dynamic programming, Array
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Cheers
Medium5
Dynamic programming, Intervals
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Jump Jump Championship
Medium5
Dynamic programming, Binary search+1
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Relay Race
Medium5
Dynamic programming
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Traveling Salesperson Tour
Medium5
Dynamic programming, Bit manipulation+1
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Bug on a Tree
Medium5
Tree, Dynamic programming+1
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Wine Tasting
Medium5
Dynamic programming
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
In-Flight Meal Trip
Medium5
Dynamic programming, Graph
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Mountain Bike
Medium5
Shortest path, Graph+1
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Letter Board
Medium5
Dynamic programming, Matrix+1
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
String Copy
Medium5
Dynamic programming, String+1
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Marbles in Boxes
Medium5
Dynamic programming, Array+1
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Team Formation
Medium5
Dynamic programming, Array+1
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Sequence Reduction
Medium5
Dynamic programming, Recursion
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Plum Tree
Medium5
Dynamic programming
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Jump
Medium5
Dynamic programming, BFS+1
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Theater Seats
Medium5
Dynamic programming, Combinatorics+1
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Buying Jewels
Medium5
Dynamic programming, Array+1
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Tree Cutting
Medium5
Tree, Dynamic programming+1
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Fax Compression
Medium5
Dynamic programming, String+1
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Dance Pad Minimum Energy
Medium5
Dynamic programming, Simulation
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Polygon Partitions
Medium5
Combinatorics, Dynamic programming+1
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Number of Permutations
Medium5
Dynamic programming, Combinatorics
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Sum of Powers of Two
Medium5
Dynamic programming, Math+1
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Brotherly Field Division
Medium5
Dynamic programming, Brute force+1
No attempts yet
Time limit
1s
Memory limit
256 MB
Judgeable
Paramecia
Medium5
Dynamic programming, Simulation+1
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Electric Wires
Medium5
Dynamic programming, Binary search+1
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Crossing the Stone Bridges
Medium5
Dynamic programming, String
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Corporate Investment
Medium5
Dynamic programming, Array+1
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Submarine Identification
Medium5
Dynamic programming, String matching+1
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Glass Balls
Medium5
Dynamic programming, Math+1
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable

Title	Level	Topics	Solved	Time limit	Memory limit	Judge
Commemorative PhotosSplit heights into the fewest groups of up to three, where a triple spans at most 10 cm and a pair at most 20 cm.	Medium4	SortingDynamic programming	No attempts yet	2s	1024 MB	Judgeable
Sparkling PlusesGiven an n by m matrix of 0s and 1s, find the largest plus shape made of 1s and print its size and the row and column of its center.	Medium4	MatrixDynamic programming	No attempts yet	4s	1024 MB	Judgeable
UnlockingGiven an n by m grid of integers, find the longest path of adjacent cells whose values increase by exactly 1 at each step.	Medium4	Dynamic programmingSorting+1	No attempts yet	2s	1024 MB	Judgeable
Gagarin CupGiven per-venue win probabilities for two teams in a first-to-four series with a 2-2-1-1-1 schedule, find the chance the series ends with a given score.	Medium4	ProbabilityDynamic programming	No attempts yet	2s	1024 MB	Judgeable
Super Massive Black HoleGiven n black holes with masses w_i and a deadline D, find the minimum total cost to produce one per day and move each to day D.	Medium4	SortingDynamic programming+1	No attempts yet	2s	1024 MB	Judgeable
PlaylistDecide whether the first song can be playing at second T when the shuffle plays every song once per round in random order.	Medium4	Dynamic programmingImplementation	No attempts yet	2s	1024 MB	Judgeable
Chemical CipherGiven a cipher string and a list of element symbols, find the fewest symbols whose concatenation contains the cipher as a subsequence, or -1 if none exists.	Medium4	Dynamic programmingGreedy+1	No attempts yet	2s	1024 MB	Judgeable
TreeCount the red and green colorings of a rooted tree's edges where each vertex has at most one red edge from its children, modulo 10^9 + 7.	Medium4	TreeDynamic programming	No attempts yet	2s	1024 MB	Judgeable
Advertising PosterEach word of a slogan is placed horizontally or vertically, with no two vertical words in a row, to minimize the longest horizontal word.	Medium4	Dynamic programmingString	No attempts yet	2s	1024 MB	Judgeable
Last-minute crammingChoose which problems to solve within T days so that the total fine of the unsolved problems is as small as possible.	Medium4	Dynamic programming	No attempts yet	1s	1024 MB	Judgeable
DDR Stamina ManagementChoose which sections to play so total points are maximized, where stamina recovers by K before each section (capped at 100) and playing costs h_i stamina.	Medium4	Dynamic programmingImplementation	No attempts yet	1s	1024 MB	Judgeable
Square Root SequenceCount the sequences of length L that start at N, end at 1, and where each term is less than the square root of the term before it.	Medium4	Dynamic programmingPrefix sum	No attempts yet	1s	1024 MB	Judgeable
Carrying the BagsGiven K bags, a walking time X, and a per-bag delay Y, find the trip plan that moves all bags to the award table in the least total time.	Medium4	Dynamic programmingMath	No attempts yet	1s	1024 MB	Judgeable
Racing StrategyPick a starting tyre and pit stops over N laps so the total race time is minimal, given each tyre's first-lap time, per-lap wear, and a fixed pit cost K.	Medium4	Dynamic programming	No attempts yet	1s	1024 MB	Judgeable
Strange MachineGiven a button press sequence where some presses are unknown (-1), find which of the four bulbs can be lit after the last press.	Medium4	Dynamic programmingSimulation	No attempts yet	3s	1024 MB	Judgeable
Machine ShopFind the lowest cost of obtaining machine K, either by buying it outright or by building it from its component machines, each obtained at its own lowest cost.	Medium4	Dynamic programmingGraph+1	No attempts yet	1s	1024 MB	Judgeable
Multiples of KCount the M-digit numbers made only from the given digits that are multiples of K, modulo 1,000,000,007.	Medium4	Dynamic programmingMath	No attempts yet	1s	1024 MB	Judgeable
BicycleGiven morning and evening rain forecasts for N days, find the maximum number of days Aleksas can ride his bike, tracking whether the bike is at home or at work.	Medium4	Dynamic programming	No attempts yet	1s	1024 MB	Judgeable
Candy SplitChoose a set of candy boxes whose total is even and as large as possible, then print half of that total.	Medium4	Dynamic programmingArray+1	No attempts yet	1s	1024 MB	Judgeable
Mysterious wordsGiven a dictionary of words, find the longest chain of dictionary words where each one is formed by deleting a single letter from the previous one, and output the chain's length.	Medium4	Dynamic programmingHash map+1	No attempts yet	1s	1024 MB	Judgeable
Stubborn Little FrogFind the least total fly-catching time for a frog to hop from leaf 0 to the shore leaf, jumping at most L leaves at a time.	Medium4	Dynamic programmingSliding window	No attempts yet	1s	1024 MB	Judgeable
Chunbae Who Stole Nabi's SnackChunbae picks Crouch, Walk on all fours, or Scare Nabi each turn to keep the most HP after N punches, with damage reduced by distance.	Medium4	Dynamic programmingBrute force	No attempts yet	1s	1024 MB	Judgeable
RebirthDecide whether choosing Correct or Wrong for each of K problems can move Sii from dimension M to 0 while avoiding L unstable dimensions.	Medium4	Dynamic programmingArray	No attempts yet	1s	512 MB	Judgeable
Group Jump RopeGiven student heights, find the largest group that can line up so heights strictly rise toward the middle and then strictly fall, so no one faces someone as tall or taller.	Medium4	Dynamic programmingArray	No attempts yet	1s	1024 MB	Judgeable
SwitchChoose windows of three consecutive seconds, none overlapping, to double their points, and find the maximum total score.	Medium4	Dynamic programmingArray	No attempts yet	1s	1024 MB	Judgeable
Spy NetworkFor each of the 10 secret words, compute the edit distance to the paragraph word at its given position, then print the results.	Medium4	Dynamic programmingString	No attempts yet	5s	1024 MB	Judgeable
Dance TimeCount the dance choices Hoyeong can make over N rounds so that he errs at most once, where the correct move depends on Woojin's facing direction.	Medium4	Dynamic programmingImplementation	No attempts yet	1s	1024 MB	Judgeable
Yukhoe BibimbapBosun must visit all N stations in some order where consecutive glare products stay at most K, maximizing the sum of A of the previous station times B of the next.	Medium4	Dynamic programmingBit manipulation	No attempts yet	1s	512 MB	Judgeable
HeiroglyphicsCounts the distinct words that fit a tablet pattern with '?' gaps, where no two vowels are adjacent and at least one vowel appears.	Medium4	Dynamic programmingCombinatorics+1	No attempts yet	1s	1024 MB	Judgeable
Corrupted GradebookSplit each digit string into exactly G grades from 0 to 100 with no leading zeros, then print the largest possible average rounded to the nearest integer.	Medium4	Dynamic programmingString	No attempts yet	1s	1024 MB	Judgeable
Dao's Race CompetitionFind the fewest tracks to extend by K (each at most once) so the lengths strictly increase, or report -1 if impossible.	Medium4	Dynamic programmingArray	No attempts yet	1s	1024 MB	Judgeable
Gas and MineralsGiven minerals and gas budgets and n building types with costs and defense values, unbounded knapsack with two resource constraints finds the maximum total defense.	Medium4	Dynamic programming	No attempts yet	1s	1024 MB	Judgeable
Yanggallae RescueGiven a tree rooted at room 1, find the minimum total thickness of vines to cut so that no leaf room stays connected to room 1.	Medium4	TreeDynamic programming+1	No attempts yet	1s	1024 MB	Judgeable
DP (Small)For each queried problem, find the longest sequence ending at it where both the problem numbers and the difficulties strictly increase.	Medium4	Dynamic programmingArray	No attempts yet	2s	1024 MB	Judgeable
Jaewoo's Retake 1Find the minimum time to swim from (0,0) to (w,d) in a pool where each lane has its own cost per unit distance, moving only parallel to the axes.	Medium4	Dynamic programmingGreedy	No attempts yet	1s	1024 MB	Judgeable
Special Oreum ClimbFind the highest y coordinate on any valid path from (0, 0) to (2N, 0) that avoids teacher points, or report -1 if no such path exists.	Medium4	Dynamic programmingImplementation	No attempts yet	1s	1024 MB	Judgeable
KMOPPick a prefix of 1 to 3 letters from each word so the concatenated acronym has no three consonants in a row, minimizing its length.	Medium4	Dynamic programmingString	No attempts yet	0.5s	1024 MB	Judgeable
Sequence and QueriesCount triples (i, j, k) where the length-k runs starting at positions i and j satisfy s[i+t] <= s[j+t] for every offset t below k.	Medium4	Dynamic programmingArray	No attempts yet	1s	1024 MB	Judgeable
Fix the ExpressionGiven a T/F expression with \| and & evaluated left to right, find the fewest value or operator changes needed to reach the desired result C.	Medium4	Dynamic programming	No attempts yet	2s	1024 MB	Judgeable
Password GenerationCount the length-M strings over letters A to Z where each pair of adjacent letters is at least N apart, modulo 1,000,000,007.	Medium4	Dynamic programmingPrefix sum	No attempts yet	1s	512 MB	Judgeable
The True FA StudentFind the minimum time to reach zone N, choosing at each crosswalk whether to wait for the green signal or take the footbridge.	Medium4	Dynamic programmingSimulation	No attempts yet	1s	512 MB	Judgeable
Painting the FloodwallPick non-overlapping wall intervals from the applications to maximize total painted length, where a mural may start where another ends.	Medium4	Dynamic programmingSorting+1	No attempts yet	1s	1024 MB	Judgeable
Solution RelayCount the ways to call students in N rows of two so everyone hears the solution and no two consecutive rows lack a relay, modulo 10^9+7.	Medium4	Dynamic programmingMath	No attempts yet	1s	1024 MB	Judgeable
MukjjippaGiven each player's per-turn choice probabilities, find the probability that A wins mukjjippa, printed as a value modulo 998244353.	Medium4	Dynamic programmingProbability+1	No attempts yet	2s	1024 MB	Judgeable
Up and DownFind the longest subsequence that strictly increases up to one peak element and then strictly decreases, with at least two elements on each side.	Medium4	Dynamic programmingBinary search	No attempts yet	3s	1024 MB	Judgeable
Connecting Grid CellsGiven an N by M grid of integers, find the maximum sum of cell values along a shortest path between two chosen cells.	Medium4	Dynamic programmingMatrix	No attempts yet	1s	1024 MB	Judgeable
Herb MixingGiven counts of green and red herbs, find the maximum health boost from combining them using the listed recipes.	Medium4	Dynamic programmingImplementation	No attempts yet	1s	2048 MB	Judgeable
Kim's QuestCount the subsequences of length at least 3 in which every three consecutive elements have an even sum, modulo 998244353.	Medium4	Dynamic programmingMath	No attempts yet	3s	2048 MB	Judgeable
Savvy SellerPick meetings whose time intervals do not overlap (touching endpoints allowed) to maximize the total expected profit.	Medium4	Dynamic programmingBinary search+1	No attempts yet	1s	1024 MB	Judgeable
Fastest Thing AliveFind a route from a blank cell in the first row to a blank cell in the last row, moving down one row per step and shifting at most one lane left or right.	Medium4	Dynamic programmingMatrix	No attempts yet	2s	2048 MB	Judgeable
ExcursionGiven a tree with a value on each node, find the maximum sum of values along a simple path that includes at least one node.	Medium4	TreeDynamic programming+1	No attempts yet	7s	2048 MB	Judgeable
Range Digit SumSum the decimal digits of every integer from L to U, inclusive, where U can reach two billion.	Medium5	MathDynamic programming+1	No attempts yet	2s	128 MB	Judgeable
Unknown SentencePartition a sentence into segments that are anagrams of given words, minimizing total letters moved from their original word positions.	Medium5	Dynamic programmingString+1	No attempts yet	2s	128 MB	Judgeable
HotelGiven advertising costs and customer gains for up to 20 cities with unlimited repeats, find the minimum total cost to gain at least C new customers.	Medium5	Dynamic programmingMath	No attempts yet	2s	128 MB	Judgeable
PrefixGiven up to 50 words, find the largest subset where no word is a prefix of another, using a trie and tree DP.	Medium5	TrieDynamic programming+2	No attempts yet	2s	128 MB	Judgeable
Solving ProblemsGiven N interest values and a rule to move forward by 1 or 2 steps starting at problem 1, find the minimum number of problems solved before the range of solved values reaches at least V.	Medium5	Dynamic programmingGraph+2	No attempts yet	2s	128 MB	Judgeable
Tangled Electric WiresGiven a matching between left and right poles, find the minimum number of wires to cut so no two remaining wires cross, which reduces to computing N minus the longest increasing subsequence.	Medium5	Dynamic programmingBinary search+1	No attempts yet	1s	128 MB	Judgeable
Array ValueFind a path from top-left to bottom-right of an N by N grid, avoiding zero cells, that minimizes the trailing zeros in the product of visited values.	Medium5	Dynamic programmingMath+2	No attempts yet	2s	128 MB	Judgeable
Substring Picking GamePlayers alternately subtract a value formed by a proper substring of the current number's digits, and you must find the smallest first move that forces a win, or -1 if none exists.	Medium5	Game theoryDynamic programming+2	No attempts yet	2s	256 MB	Judgeable
New Year PartyPick a maximum-score guest list from a company tree so no employee and their direct manager both attend, computed with and without the root.	Medium5	Dynamic programmingTree+1	No attempts yet	2s	128 MB	Judgeable
Making the Best TeamChoose 15 players for white and 15 for black from a list of up to 1000 players to maximize the total ability sum.	Medium5	Dynamic programmingGreedy+1	No attempts yet	1s	128 MB	Judgeable
Captain DasomGiven N cannonballs, find the minimum number of tetrahedral-number piles whose sizes sum exactly to N using unbounded coin-change style DP.	Medium5	Dynamic programmingMath+1	No attempts yet	2s	128 MB	Judgeable
Summit Handshakes 2Given N seats around a round table, count the ways N representatives can pair up with non-crossing handshake segments, modulo 987654321.	Medium5	Dynamic programmingCombinatorics+1	No attempts yet	2s	128 MB	Judgeable
Number GameGiven a set of numbers including 1 and a limit K, find the first integer that cannot be formed using at most K chosen numbers, then decide the game winner by turn parity.	Medium5	Dynamic programmingMath+1	No attempts yet	2s	128 MB	Judgeable
Making a PalindromeFind the minimum number of integers to insert into a sequence so it becomes a palindrome, using interval or LCS-based dynamic programming.	Medium5	Dynamic programmingArray+1	No attempts yet	2s	128 MB	Judgeable
TilingCount the number of ways to tile a 2×n rectangle using 2×1 and 2×2 tiles for multiple values of n up to 250.	Medium5	Dynamic programmingMath+1	No attempts yet	1s	128 MB	Judgeable
Sorting the BookshelfFind the minimum number of single-book relocations needed to sort a permutation of N books into increasing order.	Medium5	Dynamic programmingArray+1	No attempts yet	2s	128 MB	Judgeable
HighwayGiven a directed graph with edge lengths and tolls, find the minimum length path from city 1 to city N whose total toll does not exceed a budget K.	Medium5	Dynamic programmingGraph+1	No attempts yet	2s	128 MB	Judgeable
Word ExtensionGiven a dictionary and a starting 3-letter word, find the longest word reachable by repeatedly inserting one letter such that each intermediate word exists in the dictionary.	Medium5	Dynamic programmingString+1	No attempts yet	2s	128 MB	Judgeable
Coin DistributionGiven several coin denominations with counts, decide for three test cases whether the coins can be split into two subsets of equal total value.	Medium5	Dynamic programmingArray	No attempts yet	2s	128 MB	Judgeable
CheersGiven N people around a circle each drinking a cola brand, find the maximum number of non-crossing pairs connecting people with the same brand.	Medium5	Dynamic programmingIntervals	No attempts yet	2s	128 MB	Judgeable
Jump Jump ChampionshipGiven an array, find the longest strictly increasing subsequence and output its length plus the indices of one such subsequence.	Medium5	Dynamic programmingBinary search+1	No attempts yet	2s	128 MB	Judgeable
Relay RaceGiven N runners in fixed order each running 1 to 3 consecutive days, find the day-count assignment summing to exactly D that maximizes total distance, or -1 if invalid.	Medium5	Dynamic programming	No attempts yet	2s	128 MB	Judgeable
Traveling Salesperson TourFind the minimum cost Hamiltonian cycle in a directed graph with up to 16 cities using bitmask dynamic programming.	Medium5	Dynamic programmingBit manipulation+1	No attempts yet	1s	128 MB	Judgeable
Bug on a TreeGiven a tree with fruit values on vertices, find the maximum sum path (simple path) and its smallest-numbered starting endpoint.	Medium5	TreeDynamic programming+1	No attempts yet	2s	128 MB	Judgeable
Wine TastingPick numbers from a sequence maximizing sum while never selecting three consecutive elements.	Medium5	Dynamic programming	No attempts yet	2s	128 MB	Judgeable
In-Flight Meal TripFind the maximum-score path from city 1 to city N using at most M cities, moving only to strictly increasing city numbers along available flights.	Medium5	Dynamic programmingGraph	No attempts yet	2s	128 MB	Judgeable
Mountain BikeFind the minimum travel time from top-left to bottom-right of a grid where each move's duration depends on cumulative speed changes from height differences, solvable via Dijkstra with speed encoded as exponent sums.	Medium5	Shortest pathGraph+1	No attempts yet	2s	128 MB	Judgeable
Letter BoardCount the number of paths on an N by M letter grid that spell a given word, moving 1 to K cells in one straight direction per step.	Medium5	Dynamic programmingMatrix+1	No attempts yet	2s	128 MB	Judgeable
String CopyFind the minimum number of substring-copy operations from S needed to reconstruct P using greedy/DP over matching positions.	Medium5	Dynamic programmingString+1	No attempts yet	2s	128 MB	Judgeable
Marbles in BoxesGiven two marble sequences and a pairwise score table, choose a sequence of pop/pop/pop-both operations to maximize total matched-pair score, using LCS-like DP with reconstruction.	Medium5	Dynamic programmingArray+1	No attempts yet	2s	128 MB	Judgeable
Team FormationPartition an age-ordered score sequence into contiguous groups to maximize the sum of each group's max-minus-min score.	Medium5	Dynamic programmingArray+1	No attempts yet	2s	128 MB	Judgeable
Sequence ReductionDecide if repeatedly merging adjacent elements as A[i]-A[i+1] can reduce the sequence to a single target value T.	Medium5	Dynamic programmingRecursion	No attempts yet	2s	128 MB	Judgeable
Plum TreeGiven a sequence of falling trees over T seconds, find the max plums caught starting at tree 1 with at most W moves between trees.	Medium5	Dynamic programming	No attempts yet	2s	128 MB	Judgeable
JumpFind the minimum number of jumps from stone 1 to stone N where jump lengths change by at most 1 each step and some stones are blocked.	Medium5	Dynamic programmingBFS+1	No attempts yet	2s	128 MB	Judgeable
Theater SeatsCount permutations where each ticket holder sits in their own or adjacent seat, with VIP seats fixed and splitting the row into independent segments counted by a Fibonacci-like recurrence.	Medium5	Dynamic programmingCombinatorics+1	No attempts yet	2s	128 MB	Judgeable
Buying JewelsFor each of n rows pick a contiguous non-empty subarray maximizing summed total value, breaking ties by fewest jewels then lexicographically smallest index sequence.	Medium5	Dynamic programmingArray+1	No attempts yet	2s	128 MB	Judgeable
Tree CuttingGiven a tree with n vertices, find the minimum number of edges to cut so some resulting piece has exactly m vertices, or report impossibility.	Medium5	TreeDynamic programming+1	No attempts yet	2s	128 MB	Judgeable
Fax CompressionChoose a quantization of a sequence into 4 levels with run-length style bit encoding to minimize error plus weighted code length.	Medium5	Dynamic programmingString+1	No attempts yet	2s	128 MB	Judgeable
Dance Pad Minimum EnergyGiven a sequence of dance pad moves, compute the minimum total energy to press each in order by choosing which of two feet to move each time.	Medium5	Dynamic programmingSimulation	No attempts yet	2s	128 MB	Judgeable
Polygon PartitionsCount noncrossing dissections of a regular N-gon into all triangles or all quadrilaterals, modulo 1e9, using Catalan-like combinatorics.	Medium5	CombinatoricsDynamic programming+1	No attempts yet	2s	128 MB	Judgeable
Number of PermutationsGiven a permutation's up-down pattern, count permutations of size n sharing the same pattern, modulo 1,000,000,000.	Medium5	Dynamic programmingCombinatorics	No attempts yet	2s	128 MB	Judgeable
Sum of Powers of TwoCount the ways to write N as an unordered sum of powers of two, modulo one billion.	Medium5	Dynamic programmingMath+1	No attempts yet	2s	128 MB	Judgeable
Brotherly Field DivisionChoose a non-decreasing staircase cut across N columns of an N x N grid to minimize the harvest difference between the two regions, and output one such cut.	Medium5	Dynamic programmingBrute force+1	No attempts yet	1s	256 MB	Judgeable
ParameciaSimulate a population where each individual matures, reproduces daily within an age window, dies at a fixed age, and count survivors on day N modulo 1000.	Medium5	Dynamic programmingSimulation+1	No attempts yet	1s	128 MB	Judgeable
Electric WiresGiven wires connecting positions on two poles, find the minimum removals so remaining wires never cross, equivalent to n minus the longest increasing subsequence.	Medium5	Dynamic programmingBinary search+1	No attempts yet	1s	128 MB	Judgeable
Crossing the Stone BridgesCount ways to match a scroll string to positions across two parallel bridge strings, alternating bridges and strictly increasing positions.	Medium5	Dynamic programmingString	No attempts yet	1s	128 MB	Judgeable
Corporate InvestmentAllocate exactly N integer units of money across M companies using given profit tables to maximize total profit, then output an allocation, a classic knapsack-style DP task.	Medium5	Dynamic programmingArray+1	No attempts yet	1s	128 MB	Judgeable
Submarine IdentificationDecide whether a binary string can be split into pieces of '01' or '1' followed by at least two 0s and at least one 1, using pattern matching or DP.	Medium5	Dynamic programmingString matching+1	No attempts yet	1s	128 MB	Judgeable
Glass BallsGiven B balls and M floors, compute the minimum number of drops needed to guarantee finding the critical breaking floor in the worst case.	Medium5	Dynamic programmingMath+1	No attempts yet	1s	128 MB	Judgeable