dp - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	10592	P1970C3 Game on Tree (Hard) dfs and similar dp games trees *1900	0 / 0	6
	10588	P1970E1 Trails (Easy) dp *1800	0 / 0	6
	10587	P1970E2 Trails (Medium) dp matrices *2000	0 / 0	7
	10586	P1970E3 Trails (Hard) dp matrices *2200	0 / 0	8
	10581	P1970G2 Min-Fund Prison (Medium) brute force dfs and similar dp graphs trees *2200	0 / 0	8
	10580	P1970G3 Min-Fund Prison (Hard) bitmasks dfs and similar dp graphs trees *2400	0 / 0	9
	10576	P1971D Binary Cut dp greedy implementation sortings strings *1100	0 / 0	3
	10569	P1973A Chess For Three brute force dp implementation math *900	0 / 0	3
	10564	P1973F Maximum GCD Sum Queries bitmasks brute force dp implementation number theory *3100	0 / 0	10
	10559	P1974E Money Buys Happiness dp *1800	0 / 0	6
	10553	P1975D Paint the Tree brute force dfs and similar dp greedy shortest paths trees *1700	0 / 0	5
	10551	P1975F Set bitmasks brute force combinatorics dfs and similar divide and conquer dp math *2600	0 / 0	10
	10548	P1975I Mind Bloom dp *3500	0 / 0	10
	10545	P1976C Job Interview binary search dp greedy implementation two pointers	0 / 0	(None)
	10542	P1976F Remove Bridges data structures dfs and similar dp greedy sortings trees	0 / 0	(None)
	10539	P1977C Nikita and LCM brute force data structures dp greedy math number theory sortings *1900	0 / 0	6
	10694	P1978E Computing Machine brute force data structures dp greedy implementation *2000	0 / 0	7
	10689	P1979D Fixing a Binary String bitmasks brute force constructive algorithms dp greedy hashing strings *1800	0 / 0	6
	10531	P1981F Turtle and Paths on a Tree data structures dp trees	0 / 0	(None)
	10676	P1982C Boring Day binary search data structures dp greedy two pointers *1200	0 / 0	4
	10674	P1982E Number of k-good subarrays bitmasks brute force combinatorics divide and conquer dp math meet-in-the-middle *2300	0 / 0	8
	10756	P1983G Your Loss bitmasks brute force dp trees *3000	0 / 0	10
	10670	P1984C1 Magnitude (Easy Version) dp greedy math *1300	0 / 0	4
	10669	P1984C2 Magnitude (Hard Version) combinatorics dp greedy math *1700	0 / 0	5
	10667	P1984E Shuffle dp greedy trees *2400	0 / 0	9
	10666	P1984F Reconstruction brute force dp math *2500	0 / 0	9
	10664	P1984H Tower Capturing combinatorics dp geometry *3300	0 / 0	10
	10655	P1985H2 Maximize the Largest Component (Hard Version) data structures dfs and similar dp dsu implementation *2200	0 / 0	8
	10651	P1986D Mathematical Problem brute force dp greedy implementation math two pointers *1400	0 / 0	4
	10644	P1987C Basil's Garden dp greedy *1200	0 / 0	4
	10643	P1987D World is Mine dp games *1800	0 / 0	6
	10641	P1987F1 Interesting Problem (Easy Version) dp *2500	0 / 0	9
	10640	P1987F2 Interesting Problem (Hard Version) dp *2600	0 / 0	10
	10639	P1987G1 Spinning Round (Easy Version) divide and conquer dp trees *2900	0 / 0	10
	10638	P1987G2 Spinning Round (Hard Version) divide and conquer dp trees *3500	0 / 0	10
	10752	P1988D The Omnipotent Monster Killer brute force dfs and similar dp trees *2000	0 / 0	7
	10750	P1988F Heartbeat combinatorics dp fft math *3000	0 / 0	10
	10633	P1989D Smithing Skill brute force data structures dp greedy math sortings two pointers *1900	0 / 0	6
	10632	P1989E Distance to Different combinatorics dp math *2300	0 / 0	8
	10746	P1990D Grid Puzzle bitmasks brute force dp greedy implementation *1800	0 / 0	6
	10743	P1990F Polygonal Segments brute force data structures divide and conquer dp greedy two pointers *2800	0 / 0	10
	10730	P1992D Test of Love dp greedy implementation *1200	0 / 0	4
	10728	P1992F Valuable Cards brute force dp greedy number theory two pointers *1900	0 / 0	6
	10727	P1992G Ultra-Meow combinatorics dp math *2000	0 / 0	7
	10724	P1994C Hungry Games binary search dp two pointers *1600	0 / 0	5
	10720	P1994G Minecraft bitmasks brute force dp graphs math *2600	0 / 0	10
	10714	P1995D Cases bitmasks brute force dp strings *2300	0 / 0	8
	10713	P1995E1 Let Me Teach You a Lesson (Easy Version) 2-sat data structures dp matrices two pointers *2700	0 / 0	10
	10712	P1995E2 Let Me Teach You a Lesson (Hard Version) data structures dp matrices two pointers *2900	0 / 0	10
	10709	P1996C Sort dp greedy sortings strings	0 / 0	(None)
	10701	P1997D Maximize the Root binary search dfs and similar dp greedy trees	0 / 0	(None)
	10699	P1997F Chips on a Line dp math	0 / 0	(None)

Pick a problem randomly based on the current filter.