Dynamic programming ladder

Every judgeable DP problem, easiest first

Under construction

Still being built. Things may change

Total results6,386 problems

The Rice Cake Seller and the Tiger
Easy3
Dynamic programming, Backtracking+1
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Potato Sacks
Easy3
Dynamic programming, Bit manipulation+1
No attempts yet
Time limit
2s
Memory limit
512 MB
Judgeable
Multinomial Coefficient
Easy3
Dynamic programming, Combinatorics
No attempts yet
Time limit
2s
Memory limit
256 MB
Judgeable
License Plate 2
Easy3
Dynamic programming, Math+2
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
Good Day Bad Day
Easy3
Probability, Dynamic programming+2
No attempts yet
Time limit
1s
Memory limit
256 MB
Judgeable
Payment Helper for the Moon Rabbit
Easy3
Dynamic programming, Greedy+1
No attempts yet
Time limit
1s
Memory limit
256 MB
Judgeable
Fruit Stealing
Easy3
Combinatorics, Dynamic programming+1
No attempts yet
Time limit
1s
Memory limit
256 MB
Judgeable
League of Legensal (Small)
Easy3
Dynamic programming, Combinatorics
No attempts yet
Time limit
1s
Memory limit
256 MB
Judgeable
Changyeong and Coffee
Easy3
Dynamic programming, Array+2
No attempts yet
Time limit
2s
Memory limit
512 MB
Judgeable
Increasing Substring
Easy3
String, Dynamic programming+1
No attempts yet
Time limit
Not set
Memory limit
1024 MB
Judgeable
Garden (Easy)
Easy3
Dynamic programming, Simulation+2
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
Yeongjae's Stepping Stones
Easy3
Dynamic programming, Matrix
No attempts yet
Time limit
0.5s
Memory limit
512 MB
Judgeable
Algorithm Class - Fibonacci Number 2
Easy3
Math, Dynamic programming+2
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
Algorithm Class - Matrix Path Problem 1
Easy3
Dynamic programming, Recursion+2
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
The weight of words
Easy3
Dynamic programming, String
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
I Really Can't Whistle
Easy3
String, Dynamic programming
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
Counting integers with adjacent digits differing by at most 2
Easy3
Dynamic programming
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
Find DKSH
Easy3
Dynamic programming, String
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
Minimum cost to color a tree
Easy3
Dynamic programming, Tree
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
Bicycle Stunts
Easy3
Dynamic programming, Array
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Pseudo Pseudo Random Numbers
Easy3
Dynamic programming, Combinatorics
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Tower Climbing
Easy3
Dynamic programming, Array
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Rock is rock too
Easy3
Dynamic programming, String
No attempts yet
Time limit
2s
Memory limit
512 MB
Judgeable
Jumping Frog
Easy3
Dynamic programming, String
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
The Gourmet
Easy3
Dynamic programming
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Plankan
Easy3
Dynamic programming
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Leapcow
Easy3
Dynamic programming, Array
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Sum
Easy3
Dynamic programming
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
RGB트리
Easy3
Tree, Dynamic programming
No attempts yet
Time limit
1.5s
Memory limit
1024 MB
Judgeable
Sum of Primes
Easy3
Dynamic programming, Number theory
No attempts yet
Time limit
3s
Memory limit
128 MB
Judgeable
Boredom buster (Easy)
Easy3
Dynamic programming, Recursion
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Knee problems (Easy)
Easy3
Dynamic programming
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Buying Stamps
Easy3
Dynamic programming
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Bucket Game
Easy3
Graph, Topological sort+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
XOR Card Game
Easy3
Dynamic programming, Bit manipulation
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
I want to do conventional deadlifts
Easy3
Dynamic programming, Matrix
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Lucky Seven
Easy3
Dynamic programming, Math
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Bank Robbery
Easy3
Dynamic programming
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Typing Text
Easy3
Dynamic programming, Implementation
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Solitaire
Easy3
Dynamic programming, Array
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Run, Alf! Run!
Easy3
Dynamic programming, Matrix
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Coins and Nests
Easy3
Dynamic programming
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Rabbit Hooks
Easy3
Array, Dynamic programming
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Golden coins
Easy3
Matrix, Dynamic programming
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Building a KOREA String
Easy3
String, Dynamic programming
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Parking Payment
Easy3
Greedy, Math+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
The Longest Force Protecting the Republic of Korea
Easy3
Dynamic programming, String
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Pentagon
Easy3
Geometry, Dynamic programming
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Special Magic Attack
Easy3
Dynamic programming, Array
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Stacking Cups
Easy3
Dynamic programming
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Events are coming (Easy)
Easy3
Dynamic programming, Simulation
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Pascal Multiple
Easy3
Dynamic programming, Math
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Potion
Medium4
Graph, Dynamic programming+2
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Zoo
Medium4
Dynamic programming, Combinatorics+1
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Infinite Sequence
Medium4
Recursion, Dynamic programming+2
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Tournament Winner
Medium4
Probability, Dynamic programming+2
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Highway Shortcuts
Medium4
Shortest path, Graph+2
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Guitarist
Medium4
Dynamic programming, Array
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Building Completion Times
Medium4
Topological sort, Dynamic programming+1
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Downhill Paths
Medium4
Dynamic programming, DFS+1
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Document Search
Medium4
String matching, Greedy+1
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Perfect Attendance Award
Medium4
Dynamic programming, String+1
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Number of Roads
Medium4
Dynamic programming, Matrix+1
No attempts yet
Time limit
2s
Memory limit
16 MB
Judgeable
Sum of Squares
Medium4
Dynamic programming, Math
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Parcel Routing
Medium4
Shortest path, Graph+2
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Wormholes
Medium4
Shortest path, Graph+1
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Jump
Medium4
Dynamic programming, Matrix
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Largest Square
Medium4
Dynamic programming, Matrix
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Gift Exchange
Medium4
Dynamic programming, Math+1
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Exercise Route
Medium4
Shortest path, Graph+1
No attempts yet
Time limit
2s
Memory limit
192 MB
Judgeable
LCS of Three Strings
Medium4
Dynamic programming, String
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Box Nesting
Medium4
Dynamic programming, Binary search+1
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Decode Count
Medium4
Dynamic programming, String
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Minimum Time to Complete Tasks
Medium4
Dynamic programming, Topological sort+1
No attempts yet
Time limit
2s
Memory limit
256 MB
Judgeable
Tiling a 3-by-N Wall
Medium4
Dynamic programming, Combinatorics
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Kimchi Delivery
Medium4
Greedy, Dynamic programming+1
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Collecting Jewels
Medium4
Prefix sum, Dynamic programming+1
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Maximum Independent Set in a Tree
Medium4
Dynamic programming, Tree+1
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
String Alignment Score
Medium4
Dynamic programming, String
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Coin 1
Medium4
Dynamic programming
No attempts yet
Time limit
0.5s
Memory limit
4 MB
Judgeable
Semiconductor Design
Medium4
Dynamic programming, Binary search
No attempts yet
Time limit
2s
Memory limit
128 MB
Judgeable
Word Grid
Medium4
Dynamic programming, Matrix+1
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Color Wheel
Medium4
Combinatorics, Math+1
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Climbing Stairs
Medium4
Dynamic programming
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Fire Engines
Medium4
Greedy, Dynamic programming+1
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Number Cards
Medium4
Dynamic programming, String
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Marble Game
Medium4
Dynamic programming, Game theory+1
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Changing a Bill with Coins
Medium4
Dynamic programming
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Balance Scale
Medium4
Dynamic programming, Brute force+1
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Toy Assembly
Medium4
Graph, DFS+1
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Stacking Colored Paper
Medium4
Dynamic programming, Sorting+1
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Maximum Product of a Contiguous Subsequence
Medium4
Dynamic programming, Array
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Maximum Number of Noncrossing Circle Chords
Medium4
Dynamic programming, Intervals+1
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Lotto
Medium4
Dynamic programming, Combinatorics+1
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Apple Catching Game
Medium4
Dynamic programming, Greedy+1
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Bridging Signals
Medium4
Binary search, Dynamic programming+1
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
String Expansion and Distance
Medium4
Dynamic programming, String
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Board Jump
Medium4
Dynamic programming, Matrix+1
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
The Vow
Medium4
Dynamic programming, String
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Piggy-Bank
Medium4
Dynamic programming
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable

Title	Level	Topics	Solved	Time limit	Memory limit	Judge
The Rice Cake Seller and the TigerPick one rice cake kind from each day's set so consecutive picks differ; output the daily picks or -1 if impossible.	Easy3	Dynamic programmingBacktracking+1	No attempts yet	1s	128 MB	Judgeable
Potato SacksGiven ten potato weights and a capacity C, decide whether some subset of the potatoes sums to exactly C and print YES or NO.	Easy3	Dynamic programmingBit manipulation+1	No attempts yet	2s	512 MB	Judgeable
Multinomial CoefficientGiven exponents n and m and a power k, compute the coefficient of x^k in (1+x+...+x^n)^m modulo 1,000,000,009.	Easy3	Dynamic programmingCombinatorics	No attempts yet	2s	256 MB	Judgeable
License Plate 2Count strings matching a pattern of letter and digit slots, where no two adjacent characters are equal, modulo 1,000,000,009.	Easy3	Dynamic programmingMath+2	No attempts yet	1s	512 MB	Judgeable
Good Day Bad DayGiven a two-state Markov chain's transition probabilities and a starting mood, compute the probability of each mood N days later and print each scaled by 1000.	Easy3	ProbabilityDynamic programming+2	No attempts yet	1s	256 MB	Judgeable
Payment Helper for the Moon RabbitFind the minimum number of 1, 2, 5, and 7 won coins that sum to a given amount N.	Easy3	Dynamic programmingGreedy+1	No attempts yet	1s	256 MB	Judgeable
Fruit StealingCount the ways to distribute M identical stolen fruits among N labeled kinds so each kind receives at least one.	Easy3	CombinatoricsDynamic programming+1	No attempts yet	1s	256 MB	Judgeable
League of Legensal (Small)Count sequences of 1-second A casts and M-second B casts that fill exactly N seconds, modulo 1,000,000,007.	Easy3	Dynamic programmingCombinatorics	No attempts yet	1s	256 MB	Judgeable
Changyeong and CoffeeGiven N coffee cups with caffeine amounts, find the minimum number of cups whose contents sum to exactly K, or -1 if impossible.	Easy3	Dynamic programmingArray+2	No attempts yet	2s	512 MB	Judgeable
Increasing SubstringFor each position in a string, report the length of the longest strictly increasing substring ending there.	Easy3	StringDynamic programming+1	No attempts yet	Not set	1024 MB	Judgeable
Garden (Easy)Fill an N by M grid where each cell is yellow if its left and upper neighbors match, red otherwise, then report the bottom-right cell's color.	Easy3	Dynamic programmingSimulation+2	No attempts yet	1s	512 MB	Judgeable
Yeongjae's Stepping StonesCount the paths across an N by M glass bridge where each step moves to one of three adjacent cells in the next row and only tempered glass cells may be stepped on, modulo 1,000,000,007.	Easy3	Dynamic programmingMatrix	No attempts yet	0.5s	512 MB	Judgeable
Algorithm Class - Fibonacci Number 2For a given n, count the base-case calls of recursive Fibonacci and the loop iterations of the DP version, each modulo 1e9+7.	Easy3	MathDynamic programming+2	No attempts yet	1s	512 MB	Judgeable
Algorithm Class - Matrix Path Problem 1Count how many times the base case of a recursive matrix path search runs versus the inner assignment of the dynamic programming version.	Easy3	Dynamic programmingRecursion+2	No attempts yet	1s	512 MB	Judgeable
The weight of wordsGiven a length l and a total weight w, build a lowercase string of length l whose letter weights (a is 1, z is 26) sum to w, or report impossible.	Easy3	Dynamic programmingString	No attempts yet	1s	1024 MB	Judgeable
I Really Can't WhistleCount the subsequences of S that spell W, H, then two or more E's (WHEE, WHEEE, and so on), modulo 1,000,000,007.	Easy3	StringDynamic programming	No attempts yet	1s	512 MB	Judgeable
Counting integers with adjacent digits differing by at most 2Count n-digit positive integers with nonzero digits where adjacent digits differ by at most 2, modulo 987,654,321.	Easy3	Dynamic programming	No attempts yet	1s	512 MB	Judgeable
Find DKSHCount the subsequences of a string of up to 100,000 uppercase letters that spell DKSH in order.	Easy3	Dynamic programmingString	No attempts yet	1s	512 MB	Judgeable
Minimum cost to color a treeGiven a tree rooted at 0 with white and black costs per vertex, find the minimum total cost so that every adjacent pair has different colors.	Easy3	Dynamic programmingTree	No attempts yet	1s	512 MB	Judgeable
Bicycle StuntsFor each starting cell, count how many cells the rider steps on when riding forward over ramps on a road of N cells.	Easy3	Dynamic programmingArray	No attempts yet	1s	1024 MB	Judgeable
Pseudo Pseudo Random NumbersCount the binary strings of length n that have no run of identical bits longer than k.	Easy3	Dynamic programmingCombinatorics	No attempts yet	1s	1024 MB	Judgeable
Tower ClimbingFind the minimum total jump time from the first to the last platform when each jump rises at most k layers and costs \|dx\| + dy^2.	Easy3	Dynamic programmingArray	No attempts yet	1s	1024 MB	Judgeable
Rock is rock tooCount the subsequences of a string of up to 1,000,000 uppercase letters that spell ROCK, modulo 1e9+7.	Easy3	Dynamic programmingString	No attempts yet	2s	512 MB	Judgeable
Jumping FrogGiven a row of cells where some are blocked, find the fewest jumps of at most d+1 positions needed to go from the first cell to the last, or 0 if impossible.	Easy3	Dynamic programmingString	No attempts yet	1s	1024 MB	Judgeable
The GourmetCount the ordered sequences of dish times, chosen from the N given values, whose total eating time is exactly M minutes.	Easy3	Dynamic programming	No attempts yet	1s	1024 MB	Judgeable
PlankanCount the ordered ways to write a length n as a sum of parts 1, 2, and 3, where the order of boards matters.	Easy3	Dynamic programming	No attempts yet	1s	1024 MB	Judgeable
LeapcowFind the fewest leaps of length 1 to L needed to go from 0 to E on a number line without landing on any of the buried cow positions.	Easy3	Dynamic programmingArray	No attempts yet	1s	1024 MB	Judgeable
SumCount the ways to write a given integer n (1 to 1000) as a sum of odd summands, where summands in a different order count as the same.	Easy3	Dynamic programming	No attempts yet	1s	1024 MB	Judgeable
RGB트리Color each bulb of a tree red, green, or blue so adjacent bulbs differ, maximizing the total beauty, and print the best sum and coloring.	Easy3	TreeDynamic programming	No attempts yet	1.5s	1024 MB	Judgeable
Sum of PrimesCount the ways to write each query n as an unordered sum of primes, modulo 1,000,000,007, with up to 10,000 queries and n up to 100,000.	Easy3	Dynamic programmingNumber theory	No attempts yet	3s	128 MB	Judgeable
Boredom buster (Easy)Given n, split each integer by fixed rules and find the maximum total of y*z over all splits until n ones remain.	Easy3	Dynamic programmingRecursion	No attempts yet	1s	1024 MB	Judgeable
Knee problems (Easy)Given n steps, count the ways to climb using steps of 1 or 2 and descend using steps of 1 to 4, modulo 10^9 + 9.	Easy3	Dynamic programming	No attempts yet	1s	1024 MB	Judgeable
Buying StampsCount the ways to buy stamps worth exactly K won from N kinds of 1-won and M kinds of 2-won stamps, modulo a prime P.	Easy3	Dynamic programming	No attempts yet	1s	1024 MB	Judgeable
Bucket GameWater poured into bucket 1 splits equally among each bucket's outgoing hoses in a DAG. Find the largest amount any single bucket holds.	Easy3	GraphTopological sort+1	No attempts yet	2s	1024 MB	Judgeable
XOR Card GameSplit the deck into consecutive groups of 2 or 3 cards to maximize the total count of 1 bits in each group's XOR. A leftover single card gives 0.	Easy3	Dynamic programmingBit manipulation	No attempts yet	1s	1024 MB	Judgeable
I want to do conventional deadliftsFind the minimum sum of watchfulness values on a right-and-down path from the top-left to the bottom-right cell of a grid, then check whether it is at most H.	Easy3	Dynamic programmingMatrix	No attempts yet	1s	1024 MB	Judgeable
Lucky SevenStarting from K=1, each of N turns offers two operations (add or multiply by a digit 1 to 9). Decide whether K can end as a multiple of 7.	Easy3	Dynamic programmingMath	No attempts yet	1s	1024 MB	Judgeable
Bank RobberyCount the length-n lock codes over letters a to z whose first letter and adjacent letter gaps match the hint, modulo 1000000007.	Easy3	Dynamic programming	No attempts yet	2s	1024 MB	Judgeable
Typing TextGiven a string typed on a QWERTY keyboard, find the fewest key presses when holding shift can cover several characters at once.	Easy3	Dynamic programmingImplementation	No attempts yet	2s	1024 MB	Judgeable
SolitaireFind the length of the longest subsequence of the cards that is strictly increasing and alternates between even and odd numbers.	Easy3	Dynamic programmingArray	No attempts yet	2s	1024 MB	Judgeable
Run, Alf! Run!Find the most coins Alf can collect on an n by 3 grid, moving down one row at a time diagonally or straight while avoiding walls.	Easy3	Dynamic programmingMatrix	No attempts yet	2s	1024 MB	Judgeable
Coins and NestsGiven n nests holding a_i coins that fall at b_i, pick nests to fill with at most m coins to maximize the total b_i collected from fallen nests.	Easy3	Dynamic programming	No attempts yet	2s	1024 MB	Judgeable
Rabbit HooksGiven N points recorded in order, find the most hops in a consecutive run where northeast and southeast hops strictly alternate.	Easy3	ArrayDynamic programming	No attempts yet	1s	1024 MB	Judgeable
Golden coinsFind the maximum gold coins collected on a grid moving only down or right from the top left cell, avoiding buildings.	Easy3	MatrixDynamic programming	No attempts yet	1s	1024 MB	Judgeable
Building a KOREA StringGiven a string of the letters K, O, R, E, A, find the length of the longest subsequence that spells KOREA repeatedly, starting with K.	Easy3	StringDynamic programming	No attempts yet	1s	1024 MB	Judgeable
Parking PaymentGiven three pass prices for 1, 7, and 28 days and a number of days n, find the minimum cost to cover all n days.	Easy3	GreedyMath+1	No attempts yet	2s	1024 MB	Judgeable
The Longest Force Protecting the Republic of KoreaGiven a digit string, split it into the fewest pieces where each piece is a number from 1 to 641 without leading zeros.	Easy3	Dynamic programmingString	No attempts yet	1s	1024 MB	Judgeable
PentagonGiven up to 10,000 pentagons by their vertex coordinates, count the triangulations of each one, where every pentagon has 5 possible diagonal sets with at most 5 triangulations per shape.	Easy3	GeometryDynamic programming	No attempts yet	2s	1024 MB	Judgeable
Special Magic AttackFind the minimum total energy to punish students in a line so that every pair of adjacent students has at least one punished.	Easy3	Dynamic programmingArray	No attempts yet	1s	1024 MB	Judgeable
Stacking CupsCount the ways to pick cups from N kinds, each in unlimited supply, so their rim heights sum to exactly H, modulo 1000000007.	Easy3	Dynamic programming	No attempts yet	1s	1024 MB	Judgeable
Events are coming (Easy)Given times T with forbidden open intervals (A, B), find the minimum distance Minjeong walks from 0 at speed at most 1 to avoid them, or report -1.	Easy3	Dynamic programmingSimulation	No attempts yet	1s	1024 MB	Judgeable
Pascal MultipleCount the entries C(i,j) in the first N+1 rows of Pascal's triangle that are divisible by K, for given N and K.	Easy3	Dynamic programmingMath	No attempts yet	1s	1024 MB	Judgeable
PotionGiven market prices and mixture recipes, compute the cheapest cost to produce one unit of the potion named LOVE.	Medium4	GraphDynamic programming+2	No attempts yet	2s	128 MB	Judgeable
ZooCount the ways to place non-attacking lions in a 2 by N grid so that no two lions sit in adjacent cells, modulo 9901.	Medium4	Dynamic programmingCombinatorics+1	No attempts yet	2s	128 MB	Judgeable
Infinite SequenceCompute the N-th term of a sequence where A_i equals A at floor(i/P) plus A at floor(i/Q), using memoized recursion for huge N.	Medium4	RecursionDynamic programming+2	No attempts yet	2s	128 MB	Judgeable
Tournament WinnerGiven all pairwise win probabilities among 8 players in a fixed single-elimination bracket, compute each player's probability of winning the whole tournament.	Medium4	ProbabilityDynamic programming+2	No attempts yet	2s	128 MB	Judgeable
Highway ShortcutsCompute the minimum driving distance from position 0 to D on a highway with up to 12 one-way shortcuts that skip forward sections.	Medium4	Shortest pathGraph+2	No attempts yet	2s	128 MB	Judgeable
GuitaristGiven a starting volume and a sequence of forced up/down changes bounded by [0, M], find the maximum achievable volume for the last song using reachability DP.	Medium4	Dynamic programmingArray	No attempts yet	2s	128 MB	Judgeable
Building Completion TimesGiven N buildings with construction times and prerequisite dependencies, compute for each building the earliest possible completion time assuming unlimited parallel construction.	Medium4	Topological sortDynamic programming+1	No attempts yet	2s	128 MB	Judgeable
Downhill PathsCount the number of strictly decreasing height paths from the top-left to the bottom-right cell of a grid, moving only to adjacent cells, using memoized DFS.	Medium4	Dynamic programmingDFS+1	No attempts yet	2s	128 MB	Judgeable
Document SearchGiven a document and a word, find the maximum number of non-overlapping occurrences of the word within the document.	Medium4	String matchingGreedy+1	No attempts yet	2s	128 MB	Judgeable
Perfect Attendance AwardCount length-N attendance strings over O, L, A that have at most one L and no three consecutive A's, modulo 1,000,000.	Medium4	Dynamic programmingString+1	No attempts yet	2s	128 MB	Judgeable
Number of RoadsCount right/up lattice paths from (0,0) to (N,M) on a grid where certain unit edges are blocked by construction.	Medium4	Dynamic programmingMatrix+1	No attempts yet	2s	16 MB	Judgeable
Sum of SquaresGiven N up to 100,000, find the minimum number of perfect squares that sum to N.	Medium4	Dynamic programmingMath	No attempts yet	2s	128 MB	Judgeable
Parcel RoutingGiven a weighted graph, compute for every pair of hubs the next hub to visit on a shortest path using all-pairs shortest paths.	Medium4	Shortest pathGraph+2	No attempts yet	2s	128 MB	Judgeable
WormholesGiven roads with positive weights and wormholes with negative weights, detect whether any negative cycle exists in the resulting directed graph using Bellman-Ford.	Medium4	Shortest pathGraph+1	No attempts yet	2s	128 MB	Judgeable
JumpCount the number of paths from top-left to bottom-right of a grid where each cell's value fixes the exact jump distance right or down.	Medium4	Dynamic programmingMatrix	No attempts yet	1s	128 MB	Judgeable
Largest SquareGiven a binary grid, find the area of the largest square consisting entirely of 1s using dynamic programming.	Medium4	Dynamic programmingMatrix	No attempts yet	1s	128 MB	Judgeable
Gift ExchangeCompute the number of derangements of N items modulo 1,000,000,000.	Medium4	Dynamic programmingMath+1	No attempts yet	2s	128 MB	Judgeable
Exercise RouteFind the minimum weight cycle in a directed graph with up to 400 vertices, essentially detecting the shortest cycle via all-pairs shortest paths.	Medium4	Shortest pathGraph+1	No attempts yet	2s	192 MB	Judgeable
LCS of Three StringsCompute the length of the longest common subsequence shared by three given strings using dynamic programming.	Medium4	Dynamic programmingString	No attempts yet	2s	128 MB	Judgeable
Box NestingFind the length of the longest strictly increasing subsequence of box sizes given in order.	Medium4	Dynamic programmingBinary search+1	No attempts yet	2s	128 MB	Judgeable
Decode CountCount the number of ways to decode a digit string into letters A-Z, modulo 1,000,000.	Medium4	Dynamic programmingString	No attempts yet	2s	128 MB	Judgeable
Minimum Time to Complete TasksGiven tasks with durations and prerequisites forming a DAG (prerequisites always have smaller index), compute the minimum total time to finish all tasks using longest path via DP.	Medium4	Dynamic programmingTopological sort+1	No attempts yet	2s	256 MB	Judgeable
Tiling a 3-by-N WallCount the number of ways to tile a 3-by-N wall using 2x1 dominoes, for N up to 30.	Medium4	Dynamic programmingCombinatorics	No attempts yet	2s	128 MB	Judgeable
Kimchi DeliveryGiven N cities on a line and a starting point, find the order of visiting all cities minimizing the sum of arrival times.	Medium4	GreedyDynamic programming+1	No attempts yet	2s	128 MB	Judgeable
Collecting JewelsGiven N values in a line, find the maximum sum of a single contiguous run of length at least M taken once.	Medium4	Prefix sumDynamic programming+1	No attempts yet	2s	128 MB	Judgeable
Maximum Independent Set in a TreeGiven a weighted tree, compute a maximum weight independent set using tree DP and output the chosen vertices.	Medium4	Dynamic programmingTree+1	No attempts yet	2s	128 MB	Judgeable
String Alignment ScoreCompute the maximum scoring alignment of two strings using gap and mismatch/match scoring, which is a classic sequence alignment (edit distance style) DP.	Medium4	Dynamic programmingString	No attempts yet	2s	128 MB	Judgeable
Coin 1Given n coin denominations, count the number of combinations (order irrelevant, unlimited supply) that sum exactly to k.	Medium4	Dynamic programming	No attempts yet	0.5s	4 MB	Judgeable
Semiconductor DesignGiven a permutation of port connections, find the longest increasing subsequence to avoid crossing lines.	Medium4	Dynamic programmingBinary search	No attempts yet	2s	128 MB	Judgeable
Word GridCount the number of paths in an HxW grid moving to 8-directional neighbors (cells reusable) that spell out a given word of length L.	Medium4	Dynamic programmingMatrix+1	No attempts yet	1s	128 MB	Judgeable
Color WheelCount the ways to choose K non-adjacent colors from N colors arranged in a circle, modulo 1,000,000,003.	Medium4	CombinatoricsMath+1	No attempts yet	1s	128 MB	Judgeable
Climbing StairsFind the maximum score reachable by climbing stairs one or two at a time without stepping on three consecutive stairs, ending on the last stair.	Medium4	Dynamic programming	No attempts yet	1s	128 MB	Judgeable
Fire EnginesGiven sorted positions of pumps and fire engines on a line, assign each engine a distinct pump to minimize total distance connected.	Medium4	GreedyDynamic programming+1	No attempts yet	1s	128 MB	Judgeable
Number CardsCount the ways to split a digit string into tokens each representing a valid card number from 1 to 34 (no leading zero issues implied).	Medium4	Dynamic programmingString	No attempts yet	1s	128 MB	Judgeable
Marble GameCompute Grundy-style win/lose states for a two-pile subtraction game with three fixed move sizes and report the winner for five given starting positions.	Medium4	Dynamic programmingGame theory+1	No attempts yet	1s	128 MB	Judgeable
Changing a Bill with CoinsCount the number of ways to make an exact target sum T using bounded quantities of k coin denominations.	Medium4	Dynamic programming	No attempts yet	1s	128 MB	Judgeable
Balance ScaleGiven a set of weights, determine for each marble weight whether it can be balanced using weights placed on either pan (subset sums with +/- coefficients).	Medium4	Dynamic programmingBrute force+1	No attempts yet	1s	128 MB	Judgeable
Toy AssemblyCompute how many units of each basic part are needed to build one finished toy given a DAG of assembly quantities.	Medium4	GraphDFS+1	No attempts yet	1s	128 MB	Judgeable
Stacking Colored PaperGiven N rectangles with allowed 90-degree rotation, find the longest chain where each sheet fits entirely inside the previous one.	Medium4	Dynamic programmingSorting+1	No attempts yet	1s	128 MB	Judgeable
Maximum Product of a Contiguous SubsequenceGiven N decimal numbers between 0.0 and 9.9, find the contiguous subsequence with the maximum product and print it rounded to three decimals.	Medium4	Dynamic programmingArray	No attempts yet	1s	128 MB	Judgeable
Maximum Number of Noncrossing Circle ChordsGiven up to 50 chords on 100 circle points with distinct endpoints, find the maximum subset of chords with no two crossing.	Medium4	Dynamic programmingIntervals+1	No attempts yet	1s	128 MB	Judgeable
LottoCount n-element increasing subsequences from 1..m where each next number is at least double the previous, using combinatorics or DP.	Medium4	Dynamic programmingCombinatorics+1	No attempts yet	1s	128 MB	Judgeable
Apple Catching GameMove a fixed-size basket left or right along N cells to catch a sequence of falling apples with minimum total movement distance.	Medium4	Dynamic programmingGreedy+1	No attempts yet	1s	128 MB	Judgeable
Bridging SignalsGiven a permutation of wire connections between two ports, find the longest increasing subsequence to maximize non-crossing signals.	Medium4	Binary searchDynamic programming+1	No attempts yet	1s	128 MB	Judgeable
String Expansion and DistanceCompute the minimum alignment cost between two strings using edit-distance style dynamic programming with character mismatch costs and a fixed gap penalty K.	Medium4	Dynamic programmingString	No attempts yet	1s	128 MB	Judgeable
Board JumpCount distinct paths from top-left to bottom-right of an N×N grid where each cell's digit fixes the exact jump length right or down, using big-integer DP.	Medium4	Dynamic programmingMatrix+1	No attempts yet	1s	128 MB	Judgeable
The VowDetermine, for each word and up to length 50000, whether it can be split into a sequence of one or two letter chemical element symbols using DP.	Medium4	Dynamic programmingString	No attempts yet	1s	128 MB	Judgeable
Piggy-BankGiven empty and full weights of a piggy bank and coin value/weight pairs, find the minimum possible total coin value achieving the exact weight difference, using unbounded knapsack.	Medium4	Dynamic programming	No attempts yet	1s	128 MB	Judgeable