Dynamic programming ladder

Every judgeable DP problem, easiest first

Under construction

Still being built. Things may change

Total results6,386 problems

Matchsticks
Medium4
Dynamic programming, Greedy+1
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Rising Trend
Medium4
Dynamic programming, Binary search+1
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Tour
Medium4
Dynamic programming, Geometry+1
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Common Subsequence
Medium4
Dynamic programming, String
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Cash Machine
Medium4
Dynamic programming, Brute force
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Expected Allowance
Medium4
Dynamic programming, Math+1
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Babs’ Box Boutique
Medium4
Dynamic programming, Sorting+2
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
sqrt log sin
Medium4
Dynamic programming, Math+2
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Is Bigger Smarter?
Medium4
Dynamic programming, Sorting
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Is the Kid in Green Zelda?
Medium4
Graph, Shortest path+2
No attempts yet
Time limit
1s
Memory limit
256 MB
Judgeable
Pascal's Travels
Medium4
Dynamic programming, Array+2
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Robot Navigation
Medium4
BFS, Graph+1
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Triangle Graph
Medium4
Dynamic programming, Graph
No attempts yet
Time limit
1s
Memory limit
256 MB
Judgeable
Discounts
Medium4
Dynamic programming, Greedy+2
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Exotic Foods
Medium4
Dynamic programming, Array+2
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Frodo Sequence
Medium4
Math, Dynamic programming+2
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Transport
Medium4
Brute force, Backtracking+1
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Coin Collection
Medium4
Dynamic programming, Matrix+2
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Pasta
Medium4
Dynamic programming, Implementation
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Road Shop
Medium4
Combinatorics, Math+1
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Hexagonal Tiles
Medium4
Dynamic programming, Combinatorics+2
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Tile Exchanging
Medium4
Dynamic programming, Math
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Bessie's Weight Problem
Medium4
Dynamic programming, Array+2
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Cow Pinball
Medium4
Dynamic programming, Array+2
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Longest Contiguous Subsequence
Medium4
Dynamic programming, Array+2
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Strange Towers of Hanoi
Medium4
Dynamic programming, Recursion+2
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Dairy Queen
Medium4
Dynamic programming, Combinatorics+1
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Dining Cows
Medium4
Dynamic programming, Prefix sum+2
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Clear and Present Danger
Medium4
Graph, Shortest path+2
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Cow Pie Treasures
Medium4
Dynamic programming, Matrix
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Hungry Cows
Medium4
Dynamic programming, Binary search+2
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
The Bale Tower
Medium4
Dynamic programming, Sorting+2
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Cow Solitaire
Medium4
Dynamic programming, Matrix+2
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Optimal Array Multiplication Sequence
Medium4
Dynamic programming, Matrix+2
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Compromise
Medium4
Dynamic programming, String
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Keep on Truckin'
Medium4
Dynamic programming, Array+1
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Waterpark
Medium4
Dynamic programming, Graph
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Bridge Crossing
Medium4
Dynamic programming, Array+2
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Golf
Medium4
Dynamic programming, Greedy+2
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Herb Trees
Medium4
Dynamic programming
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Bukazoids
Medium4
Dynamic programming, Greedy+2
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Dart Challenge
Medium4
Dynamic programming, Array+2
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Filthy Rich
Medium4
Dynamic programming, Matrix+1
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Holiday Gifts
Medium4
Tree, Dynamic programming+2
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Baking Cakes
Medium4
Dynamic programming, Greedy+2
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Numbers With No Repeated Digits
Medium4
Brute force, Dynamic programming+1
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Indomie
Medium4
Probability, Combinatorics+2
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Longest Ordered Subsequence
Medium4
Dynamic programming, Array+2
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Handshakes
Medium4
Dynamic programming, Combinatorics+1
No attempts yet
Time limit
1s
Memory limit
256 MB
Judgeable
Ladder
Medium4
Dynamic programming, Math
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Matches
Medium4
Dynamic programming, Array
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Merchant
Medium4
Tree, Dynamic programming+1
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Missile Protector
Medium4
Dynamic programming, Binary search
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Coins
Medium4
Dynamic programming, Combinatorics
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
The Frobenius Problem
Medium4
Dynamic programming, Number theory
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Job Scheduling by Open Bidding
Medium4
Dynamic programming
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Mixing Words
Medium4
Dynamic programming, String
No attempts yet
Time limit
1s
Memory limit
256 MB
Judgeable
Longest Common Subsequence
Medium4
Dynamic programming
No attempts yet
Time limit
0.1s
Memory limit
256 MB
Judgeable
Privacy Loss
Medium4
Dynamic programming
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Stickers
Medium4
Dynamic programming, Array
No attempts yet
Time limit
1s
Memory limit
256 MB
Judgeable
Tree Coloring
Medium4
Dynamic programming, Tree+1
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Diamond Mining Profits
Medium4
Dynamic programming, Array+1
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Sums of Distinct Natural Numbers
Medium4
Dynamic programming, Combinatorics
No attempts yet
Time limit
7s
Memory limit
128 MB
Judgeable
Joint Venture
Medium4
Dynamic programming
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Magic Multiplying Machine
Medium4
Dynamic programming, Math
No attempts yet
Time limit
2s
Memory limit
64 MB
Judgeable
Walking
Medium4
Dynamic programming, Sorting
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Housing
Medium4
Dynamic programming, Combinatorics
No attempts yet
Time limit
2s
Memory limit
512 MB
Judgeable
Paths
Medium4
BFS, Dynamic programming
No attempts yet
Time limit
2s
Memory limit
512 MB
Judgeable
Coin
Medium4
Dynamic programming
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Digit Sums
Medium4
Dynamic programming, Math
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Troyangles
Medium4
Dynamic programming, Matrix
No attempts yet
Time limit
1s
Memory limit
256 MB
Judgeable
Turtle Elder
Medium4
Tree, Dynamic programming
No attempts yet
Time limit
5s
Memory limit
256 MB
Judgeable
Plane Ticket Pricing
Medium4
Dynamic programming
No attempts yet
Time limit
2s
Memory limit
256 MB
Judgeable
Push-Ups
Medium4
Dynamic programming
No attempts yet
Time limit
1s
Memory limit
256 MB
Judgeable
Diamonds
Medium4
Dynamic programming
No attempts yet
Time limit
5s
Memory limit
256 MB
Judgeable
Ambiguous Encodings
Medium4
Dynamic programming, String
No attempts yet
Time limit
1s
Memory limit
256 MB
Judgeable
Silk Road
Medium4
Dynamic programming
No attempts yet
Time limit
1s
Memory limit
256 MB
Judgeable
Cow Hopscotch
Medium4
Dynamic programming, Matrix
No attempts yet
Time limit
1s
Memory limit
256 MB
Judgeable
Palindrome?
Medium4
Dynamic programming, Intervals
No attempts yet
Time limit
0.5s
Memory limit
256 MB
Judgeable
Dormitory Reassignment
Medium4
Combinatorics, Dynamic programming
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Drinks
Medium4
Probability, Dynamic programming+1
No attempts yet
Time limit
2s
Memory limit
256 MB
Judgeable
Study Time Allocation
Medium4
Dynamic programming
No attempts yet
Time limit
1s
Memory limit
256 MB
Judgeable
Josephus Problem 3
Medium4
Math, Dynamic programming
No attempts yet
Time limit
1s
Memory limit
16 MB
Judgeable
Matrix chain multiplication order
Medium4
Dynamic programming, Matrix
No attempts yet
Time limit
1s
Memory limit
256 MB
Judgeable
Longest Increasing Subsequence
Medium4
Dynamic programming, Binary search
No attempts yet
Time limit
1s
Memory limit
256 MB
Judgeable
Shortest string containing both
Medium4
Dynamic programming, String
No attempts yet
Time limit
1s
Memory limit
256 MB
Judgeable
Jump Jump
Medium4
Dynamic programming, Greedy
No attempts yet
Time limit
1s
Memory limit
256 MB
Judgeable
Card Game
Medium4
Dynamic programming, Game theory
No attempts yet
Time limit
1s
Memory limit
256 MB
Judgeable
Diana and the Golden Apples
Medium4
Dynamic programming
No attempts yet
Time limit
2s
Memory limit
256 MB
Judgeable
The Knight's Scouting Mission
Medium4
BFS, Dynamic programming
No attempts yet
Time limit
2s
Memory limit
256 MB
Judgeable
Candy Store
Medium4
Dynamic programming
No attempts yet
Time limit
1s
Memory limit
256 MB
Judgeable
Horn Blowing
Medium4
Dynamic programming, Probability
No attempts yet
Time limit
2s
Memory limit
256 MB
Judgeable
Floyd
Medium4
Shortest path, Graph+1
No attempts yet
Time limit
1s
Memory limit
256 MB
Judgeable
Word Clouds Revisited
Medium4
Dynamic programming, Prefix sum
No attempts yet
Time limit
2s
Memory limit
256 MB
Judgeable
Polynomial Game
Medium4
Dynamic programming, Combinatorics
No attempts yet
Time limit
1s
Memory limit
256 MB
Judgeable
Mingyun's Scheme
Medium4
Dynamic programming, Binary search
No attempts yet
Time limit
1s
Memory limit
256 MB
Judgeable
Box Splitting Game
Medium4
Game theory, Dynamic programming
No attempts yet
Time limit
2s
Memory limit
512 MB
Judgeable
Stock Purchase Plan
Medium4
Dynamic programming, Binary search
No attempts yet
Time limit
5s
Memory limit
512 MB
Judgeable
Longest Increasing Subsequence 2
Medium4
Binary search, Dynamic programming
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
ABC Street
Medium4
Dynamic programming
No attempts yet
Time limit
2s
Memory limit
512 MB
Judgeable

Title	Level	Topics	Solved	Time limit	Memory limit	Judge
MatchsticksGiven a number of matchsticks, find the smallest and largest positive numbers (no leading zero) that can be formed using exactly that many matchsticks based on per-digit costs.	Medium4	Dynamic programmingGreedy+1	No attempts yet	1s	128 MB	Judgeable
Rising TrendFor each test case, compute the length of the longest strictly increasing subsequence in a sequence of up to 100000 prices.	Medium4	Dynamic programmingBinary search+1	No attempts yet	1s	128 MB	Judgeable
TourGiven points sorted by x-coordinate, compute the shortest bitonic tour that goes strictly left-to-right then strictly right-to-left, using classic O(n^2) DP.	Medium4	Dynamic programmingGeometry+1	No attempts yet	1s	128 MB	Judgeable
Common SubsequenceCompute the length of the longest common subsequence of two given strings for multiple test cases.	Medium4	Dynamic programmingString	No attempts yet	1s	128 MB	Judgeable
Cash MachineGiven a cash target and limited counts of several bill denominations, find the maximum total not exceeding the target using a bounded-knapsack style search.	Medium4	Dynamic programmingBrute force	No attempts yet	1s	128 MB	Judgeable
Expected AllowanceGiven n m-sided dice and a cutback k, compute the exact reduced fraction for the expected value of max(1, sum of dice - k).	Medium4	Dynamic programmingMath+1	No attempts yet	1s	128 MB	Judgeable
Babs’ Box BoutiqueGiven up to 10 boxes, each orientable in 3 ways, find the largest subset that can be stacked with each base fitting inside the one below.	Medium4	Dynamic programmingSorting+2	No attempts yet	1s	128 MB	Judgeable
sqrt log sinPrecompute x_i for all i up to 10^6 using the given recurrence with floating point floors, then answer each query modulo 10^6.	Medium4	Dynamic programmingMath+2	No attempts yet	1s	128 MB	Judgeable
Is Bigger Smarter?Given pairs of weight and IQ for up to 1000 elephants, find the largest subset whose weights strictly increase while IQs strictly decrease.	Medium4	Dynamic programmingSorting	No attempts yet	1s	128 MB	Judgeable
Is the Kid in Green Zelda?Find the minimum total cost path from the top-left to the bottom-right cell of an N x N grid where each cell's value is paid when visited.	Medium4	GraphShortest path+2	No attempts yet	1s	256 MB	Judgeable
Pascal's TravelsCount paths on an n by n digit board from top-left to bottom-right, where each square's digit sets the exact right or down step length.	Medium4	Dynamic programmingArray+2	No attempts yet	1s	128 MB	Judgeable
Robot NavigationFind the length of the shortest command program that walks a robot from start to destination with turns and moves, and count distinct shortest programs modulo m.	Medium4	BFSGraph+1	No attempts yet	1s	128 MB	Judgeable
Triangle GraphFind the minimum vertex-cost path from top-center to bottom-center in a layered 3-column DAG over N rows.	Medium4	Dynamic programmingGraph	No attempts yet	1s	256 MB	Judgeable
DiscountsFor each product, given buy-B-get-F-free offers and query amounts, find the maximum saving in dollars for each quantity.	Medium4	Dynamic programmingGreedy+2	No attempts yet	1s	128 MB	Judgeable
Exotic FoodsGiven a sequence of food values, choose a subset with no two chosen positions adjacent so the total value is as large as possible.	Medium4	Dynamic programmingArray+2	No attempts yet	1s	128 MB	Judgeable
Frodo SequenceGiven repeated values of n less than 2^31, print the n-th term of the sequence defined by Fro_n = Fro_{n-1} + Fro_{n-2} - Fro_{n-3}.	Medium4	MathDynamic programming+2	No attempts yet	1s	128 MB	Judgeable
TransportWith at most 20 items, choose a subset whose total weight is at most W and whose total value is as large as possible.	Medium4	Brute forceBacktracking+1	No attempts yet	1s	128 MB	Judgeable
Coin CollectionA robot walks right or down only from the top-left to the bottom-right of a grid, and we want the most coins it can pick up along the way.	Medium4	Dynamic programmingMatrix+2	No attempts yet	1s	128 MB	Judgeable
PastaCount sequences of length N over three kinds where no kind appears three or more times in a row, with some positions fixed, modulo 10000.	Medium4	Dynamic programmingImplementation	No attempts yet	1s	128 MB	Judgeable
Road ShopCount the number of ways to choose bead counts for n colors summing to r, with at least m beads of each color.	Medium4	CombinatoricsMath+1	No attempts yet	1s	128 MB	Judgeable
Hexagonal TilesCount the sequences of increasing tile numbers from the start tile to tile N, where each move goes forward by 1 or 2.	Medium4	Dynamic programmingCombinatorics+2	No attempts yet	1s	128 MB	Judgeable
Tile ExchangingFor each of N tiles, pick a new side length (or keep the old one) so the total area equals M, minimizing the sum of squared side-length changes.	Medium4	Dynamic programmingMath	No attempts yet	1s	128 MB	Judgeable
Bessie's Weight ProblemGiven N haybale weights and a limit H, find the largest total weight at most H that can be formed by choosing each bale at most once.	Medium4	Dynamic programmingArray+2	No attempts yet	1s	128 MB	Judgeable
Cow PinballGiven a triangle of nail scores with R rows, find the maximum sum along a path from the top nail down to the last row, moving to one of the two adjacent nails below each step.	Medium4	Dynamic programmingArray+2	No attempts yet	1s	128 MB	Judgeable
Longest Contiguous SubsequenceGiven two integer sequences, find the length of the longest run of consecutive elements that appears in both.	Medium4	Dynamic programmingArray+2	No attempts yet	1s	128 MB	Judgeable
Strange Towers of HanoiCompute the minimum number of moves to transfer n disks (n at most 12) from tower A to tower D using four towers.	Medium4	Dynamic programmingRecursion+2	No attempts yet	1s	128 MB	Judgeable
Dairy QueenCount the number of ways to make N cents using unlimited coins of the given C denominations, ignoring order.	Medium4	Dynamic programmingCombinatorics+1	No attempts yet	1s	128 MB	Judgeable
Dining CowsGiven a sequence of 1s and 2s, find the minimum number of values to change so the sequence becomes nondecreasing.	Medium4	Dynamic programmingPrefix sum+2	No attempts yet	1s	128 MB	Judgeable
Clear and Present DangerGiven a danger matrix and a required sequence of islands, find the minimum total danger of a walk that visits those islands in order, allowing detours through others.	Medium4	GraphShortest path+2	No attempts yet	1s	128 MB	Judgeable
Cow Pie TreasuresGiven an R by C grid of coin counts, find the maximum sum collected moving right one column each step, changing row by at most one, starting at (1,1) and ending at (R,C).	Medium4	Dynamic programmingMatrix	No attempts yet	1s	128 MB	Judgeable
Hungry CowsGiven a sequence of N cow brands, find the length of the longest strictly increasing subsequence in the given order.	Medium4	Dynamic programmingBinary search+2	No attempts yet	1s	128 MB	Judgeable
The Bale TowerGiven up to 20 bales with distinct widths and breadths, find the longest chain where each bale is strictly smaller than the one below it.	Medium4	Dynamic programmingSorting+2	No attempts yet	1s	128 MB	Judgeable
Cow SolitaireGiven an N by N grid of cards with point values, find the maximum total score along a monotone path from the lower-left corner to the upper-right corner moving only right or up.	Medium4	Dynamic programmingMatrix+2	No attempts yet	1s	128 MB	Judgeable
Optimal Array Multiplication SequenceGiven the dimensions of a chain of matrices, find the minimum number of scalar multiplications needed to compute their product.	Medium4	Dynamic programmingMatrix+2	No attempts yet	1s	128 MB	Judgeable
CompromiseFor each pair of word lists terminated by #, print the lexicographically smallest longest common subsequence of words.	Medium4	Dynamic programmingString	No attempts yet	1s	128 MB	Judgeable
Keep on Truckin'Given fixed and added motel distances, count overnight stop sequences where each day covers between A and B km.	Medium4	Dynamic programmingArray+1	No attempts yet	1s	128 MB	Judgeable
WaterparkCount the number of distinct paths from point 1 to point n in a DAG where every edge goes from a lower to a higher numbered point.	Medium4	Dynamic programmingGraph	No attempts yet	1s	128 MB	Judgeable
Bridge CrossingSplit a line of people into consecutive groups of at most M, where each group costs its slowest member's time, and minimize the total cost.	Medium4	Dynamic programmingArray+2	No attempts yet	1s	128 MB	Judgeable
GolfGiven a target distance and up to 32 distinct club distances, find how many strokes give an exact sum, using unlimited repeats of each club.	Medium4	Dynamic programmingGreedy+2	No attempts yet	1s	128 MB	Judgeable
Herb TreesPick trees to keep so that no two kept trees are adjacent, maximizing the sum of their berry counts.	Medium4	Dynamic programming	No attempts yet	1s	1024 MB	Judgeable
BukazoidsGiven cell counts and a fixed number of single and double jumps, maximize collected bukazoids and output the lexicographically smallest optimal visit sequence.	Medium4	Dynamic programmingGreedy+2	No attempts yet	1s	128 MB	Judgeable
Dart ChallengeFor each dartboard, count how many distinct total scores k darts can produce, where each dart misses or scores s_i, 2s_i, or 3s_i (no triple on the top area).	Medium4	Dynamic programmingArray+2	No attempts yet	1s	128 MB	Judgeable
Filthy RichGiven a grid of gold amounts, find the maximum sum along a path from the top-left to the bottom-right cell, moving only east, south, or south-east.	Medium4	Dynamic programmingMatrix+1	No attempts yet	2s	128 MB	Judgeable
Holiday GiftsAssign one of two priced gifts to each node of a rooted tree so no two adjacent employees share a gift, minimizing total cost.	Medium4	TreeDynamic programming+2	No attempts yet	1s	128 MB	Judgeable
Baking CakesGiven up to 40 cake baking times and 3 ovens, find the minimum time to bake all cakes.	Medium4	Dynamic programmingGreedy+2	No attempts yet	1s	128 MB	Judgeable
Numbers With No Repeated DigitsGiven n up to one million, print the n-th positive integer whose decimal digits are all distinct.	Medium4	Brute forceDynamic programming+1	No attempts yet	1s	128 MB	Judgeable
IndomieEach of the N people ahead takes a uniformly random remaining item among rice, sugar, and Indomie (Indomie limited to S). Find the probability Indomie remains for Felix, as a percentage.	Medium4	ProbabilityCombinatorics+2	No attempts yet	1s	128 MB	Judgeable
Longest Ordered SubsequenceGiven a sequence of N integers, find the length of the longest non-decreasing subsequence.	Medium4	Dynamic programmingArray+2	No attempts yet	1s	128 MB	Judgeable
HandshakesCount the matchings of a path with n vertices, then print the last digit of that count.	Medium4	Dynamic programmingCombinatorics+1	No attempts yet	1s	256 MB	Judgeable
LadderCount the ways to climb s rungs with steps of one or two and report each answer modulo 2^p for up to a million queries.	Medium4	Dynamic programmingMath	No attempts yet	1s	128 MB	Judgeable
MatchesStarting from one match, fire spreads to each neighbor no taller than the burning match, and the task asks for the largest group that can burn.	Medium4	Dynamic programmingArray	No attempts yet	1s	128 MB	Judgeable
MerchantFind the simple path, possibly empty, in a weighted tree whose edge weights sum to the largest value.	Medium4	TreeDynamic programming+1	No attempts yet	1s	128 MB	Judgeable
Missile ProtectorSelect the most missiles that form a non-decreasing height sequence in arrival order.	Medium4	Dynamic programmingBinary search	No attempts yet	1s	128 MB	Judgeable
CoinsCount the unordered combinations of up to 20 coin values that sum to the target amount M.	Medium4	Dynamic programmingCombinatorics	No attempts yet	1s	128 MB	Judgeable
The Frobenius ProblemCount the integers up to 1,000,000 that are not nonnegative combinations of four given numbers and report the largest such integer.	Medium4	Dynamic programmingNumber theory	No attempts yet	1s	128 MB	Judgeable
Job Scheduling by Open BiddingPick bids whose total seconds fit the available time so the total payment is as large as possible.	Medium4	Dynamic programming	No attempts yet	1s	128 MB	Judgeable
Mixing WordsDecide whether the third word interleaves the first two words while keeping each word's letter order.	Medium4	Dynamic programmingString	No attempts yet	1s	256 MB	Judgeable
Longest Common SubsequenceCompute the length of the longest subsequence shared by two uppercase strings of length up to 1000.	Medium4	Dynamic programming	No attempts yet	0.1s	256 MB	Judgeable
Privacy LossPick a subset of options that maximizes total security benefit without exceeding the money budget and the privacy limit.	Medium4	Dynamic programming	No attempts yet	1s	128 MB	Judgeable
StickersPick stickers from a 2 by n grid with no two sharing an edge to maximize the total score.	Medium4	Dynamic programmingArray	No attempts yet	1s	256 MB	Judgeable
Tree ColoringCount colorings of an N-node tree with K colors so adjacent nodes differ, modulo 93563.	Medium4	Dynamic programmingTree+1	No attempts yet	1s	128 MB	Judgeable
Diamond Mining ProfitsFind the contiguous period with the largest total gain across up to 2000 test cases, breaking ties by shorter length then earlier start.	Medium4	Dynamic programmingArray+1	No attempts yet	1s	128 MB	Judgeable
Sums of Distinct Natural NumbersCount the partitions of each given N into distinct positive integers, including N itself, modulo 100999.	Medium4	Dynamic programmingCombinatorics	No attempts yet	7s	128 MB	Judgeable
Joint VentureAssign each of the M modules to company A or B so total days stay within D and both budgets hold while total cost is minimized.	Medium4	Dynamic programming	No attempts yet	1s	128 MB	Judgeable
Magic Multiplying MachineChoose any subset of the given levers, including none, to maximize the product of chosen numbers modulo M.	Medium4	Dynamic programmingMath	No attempts yet	2s	64 MB	Judgeable
WalkingWalkers start at distinct times with fixed speeds, and a later starter who arrives earlier befriends the other; find the largest group where every pair meets.	Medium4	Dynamic programmingSorting	No attempts yet	1s	128 MB	Judgeable
HousingCount the unordered splits of n into parts of at least 5 for n between 5 and 100.	Medium4	Dynamic programmingCombinatorics	No attempts yet	2s	512 MB	Judgeable
PathsFind the cheapest total cost among the directed paths from node 0 to node 1 that use the fewest links.	Medium4	BFSDynamic programming	No attempts yet	2s	512 MB	Judgeable
CoinFind the fewest coins from unlimited denominations whose values sum to V and weights sum to W.	Medium4	Dynamic programming	No attempts yet	2s	1024 MB	Judgeable
Digit SumsCount positive integers up to A whose base-B digits add up to C for each query line.	Medium4	Dynamic programmingMath	No attempts yet	1s	128 MB	Judgeable
TroyanglesCount all centered triangles of `#` cells in an N-by-N grid where row i of a height-h triangle holds 2i-1 cells.	Medium4	Dynamic programmingMatrix	No attempts yet	1s	256 MB	Judgeable
Turtle ElderPick safe start and end islands in a tree so the sum of values along the path is as large as possible, staying home when the best sum is not positive.	Medium4	TreeDynamic programming	No attempts yet	5s	256 MB	Judgeable
Plane Ticket PricingSet each week's ticket price from that week's demand estimates to maximize total revenue over the remaining seats and weeks.	Medium4	Dynamic programming	No attempts yet	2s	256 MB	Judgeable
Push-UpsGiven a push-up total equal to the sum of running scores, find the largest final score reachable with the allowed scoring plays.	Medium4	Dynamic programming	No attempts yet	1s	256 MB	Judgeable
DiamondsFind the longest subsequence of diamonds in input order with strictly rising weight and strictly falling clarity.	Medium4	Dynamic programming	No attempts yet	5s	256 MB	Judgeable
Ambiguous EncodingsCount how many letter strings map to each digit string when A is 1 through Z at 26.	Medium4	Dynamic programmingString	No attempts yet	1s	256 MB	Judgeable
Silk RoadChoose N of M days in order for the eastward moves so the sum of distance times daily badness is smallest.	Medium4	Dynamic programming	No attempts yet	1s	256 MB	Judgeable
Cow HopscotchCount paths from the top-left cell to the bottom-right cell that move strictly down and right onto cells of the opposite color.	Medium4	Dynamic programmingMatrix	No attempts yet	1s	256 MB	Judgeable
Palindrome?Answer up to a million queries asking whether a given range of the number sequence is a palindrome.	Medium4	Dynamic programmingIntervals	No attempts yet	0.5s	256 MB	Judgeable
Dormitory ReassignmentCount the permutations of N students to rooms in which no student keeps the same room.	Medium4	CombinatoricsDynamic programming	No attempts yet	1s	128 MB	Judgeable
DrinksTwo players alternately draw balls without replacement until the first red ball appears, and you compute the chance the first player draws it.	Medium4	ProbabilityDynamic programming+1	No attempts yet	2s	256 MB	Judgeable
Study Time AllocationDistribute up to H study hours among courses with tiered grade costs to maximize the average grade points.	Medium4	Dynamic programming	No attempts yet	1s	256 MB	Judgeable
Josephus Problem 3Find the number of the last person remaining after removing every K-th of N people seated in a circle.	Medium4	MathDynamic programming	No attempts yet	1s	16 MB	Judgeable
Matrix chain multiplication orderFind the parenthesization of N given matrices that minimizes the total number of scalar multiplications.	Medium4	Dynamic programmingMatrix	No attempts yet	1s	256 MB	Judgeable
Longest Increasing SubsequenceFind the length of the longest strictly increasing subsequence of the given sequence.	Medium4	Dynamic programmingBinary search	No attempts yet	1s	256 MB	Judgeable
Shortest string containing bothFind the length of the shortest string that has both given strings as subsequences.	Medium4	Dynamic programmingString	No attempts yet	1s	256 MB	Judgeable
Jump JumpStarting from the first cell, find the fewest rightward jumps bounded by each cell value to reach the last cell, or -1 when unreachable.	Medium4	Dynamic programmingGreedy	No attempts yet	1s	256 MB	Judgeable
Card GameBoth players alternately take the left or right end card to maximize their own sum, and you compute the first player best total score.	Medium4	Dynamic programmingGame theory	No attempts yet	1s	256 MB	Judgeable
Diana and the Golden ApplesPick the apples with the greatest total weight so the extra carrying time stays strictly below her lead over Humperdonkey.	Medium4	Dynamic programming	No attempts yet	2s	256 MB	Judgeable
The Knight's Scouting MissionFind the shortest knight distance from (1,1) to (r,c) on an r by c board, count those routes modulo 1000000009, and report None when unreachable.	Medium4	BFSDynamic programming	No attempts yet	2s	256 MB	Judgeable
Candy StoreCount the subsets of candy prices whose total is at least C for each test case, modulo 65537.	Medium4	Dynamic programming	No attempts yet	1s	256 MB	Judgeable
Horn BlowingCompute the probability that the summed start-up delays of N vehicles with given discrete distributions total at most T seconds.	Medium4	Dynamic programmingProbability	No attempts yet	2s	256 MB	Judgeable
FloydFor every pair of n cities, compute the cheapest directed bus fare from up to 100,000 routes and print 0 where no route connects them.	Medium4	Shortest pathGraph+1	No attempts yet	1s	256 MB	Judgeable
Word Clouds RevisitedPlace N ordered boxes of given widths and heights into width-limited rows to minimize the sum of row heights.	Medium4	Dynamic programmingPrefix sum	No attempts yet	2s	256 MB	Judgeable
Polynomial GameFor each test case, compute the coefficient of x^N in the product of (1+x+...+x^i) for i from 1 to k.	Medium4	Dynamic programmingCombinatorics	No attempts yet	1s	256 MB	Judgeable
Mingyun's SchemeGiven N cards in order, compute the length of the longest strictly increasing subsequence.	Medium4	Dynamic programmingBinary search	No attempts yet	1s	256 MB	Judgeable
Box Splitting GameDecide whether the first or second player wins the two-box stone-splitting game from starting counts N and M.	Medium4	Game theoryDynamic programming	No attempts yet	2s	512 MB	Judgeable
Stock Purchase PlanFor each test case, decide whether the daily prices contain a strictly increasing subsequence of length K.	Medium4	Dynamic programmingBinary search	No attempts yet	5s	512 MB	Judgeable
Longest Increasing Subsequence 2Given up to 1,000,000 numbers, compute the length of the longest strictly increasing subsequence.	Medium4	Binary searchDynamic programming	No attempts yet	1s	512 MB	Judgeable
ABC StreetStarting from block 1, hop forward across A, B, C blocks in repeating order to reach block N while minimizing the sum of squared jump lengths.	Medium4	Dynamic programming	No attempts yet	2s	512 MB	Judgeable