dp - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2227	P1519B The Cake Is a Lie dp math *800	0 / 0	3
	2225	P1519D Maximum Sum of Products brute force dp implementation math two pointers *1600	0 / 0	5
	2223	P1519F Chests and Keys bitmasks brute force dfs and similar dp flows *3200	0 / 0	10
	2209	P1521D Nastia Plays with a Tree constructive algorithms data structures dfs and similar dp dsu greedy implementation trees *2500	0 / 0	9
	2208	P1521E Nastia and a Beautiful Matrix binary search constructive algorithms dp greedy *2700	0 / 0	10
	2204	P1523D Love-Hate bitmasks brute force dp probabilities *2400	0 / 0	9
	2202	P1523E Crypto Lights combinatorics dp math probabilities *2600	0 / 0	10
	2200	P1523F Favorite Game bitmasks dp *3300	0 / 0	10
	2196	P1523H Hopping Around the Array data structures dp *3500	0 / 0	10
	2191	P1525D Armchairs dp flows graph matchings greedy *1800	0 / 0	6
	2190	P1525E Assimilation IV combinatorics dp math probabilities two pointers *2100	0 / 0	7
	2189	P1525F Goblins And Gnomes brute force dp flows graph matchings *2800	0 / 0	10
	2185	P1526B I Hate 1111 dp math number theory *1400	0 / 0	4
	2183	P1526C1 Potions (Easy Version) brute force data structures dp greedy *1500	0 / 0	5
	2169	P1527E Partition Game binary search data structures divide and conquer dp *2500	0 / 0	9
	2168	P1528A Parsa's Humongous Tree dfs and similar divide and conquer dp greedy trees *1600	0 / 0	5
	2165	P1528B Kavi on Pairing Duty combinatorics dp math *1700	0 / 0	5
	2161	P1528E Mashtali and Hagh Trees combinatorics dp trees *2900	0 / 0	10
	2148	P1530F Bingo bitmasks combinatorics dp math probabilities *2600	0 / 0	10
	2146	P1530H Turing's Award data structures dp *3400	0 / 0	10
	2129	P1533H Submatrices *special problem bitmasks data structures dp	0 / 0	(None)
	2124	P1534C Little Alawn's Puzzle combinatorics dp dsu graphs math *1300	0 / 0	4
	2116	P1534F2 Falling Sand (Hard Version) dfs and similar dp graphs greedy *3000	0 / 0	10
	2115	P1534G A New Beginning data structures dp geometry sortings *3300	0 / 0	10
	2112	P1534H Lost Nodes constructive algorithms dp graphs interactive sortings trees *3500	0 / 0	10
	2107	P1535C Unstable String binary search dp greedy implementation strings two pointers *1400	0 / 0	4
	2106	P1535D Playoff Tournament data structures dfs and similar dp implementation trees *1800	0 / 0	6
	2105	P1535E Gold Transfer binary search data structures dp greedy interactive trees *2200	0 / 0	8
	2099	P1536C Diluc and Kaeya data structures dp hashing number theory *1500	0 / 0	5
	2087	P1537E1 Erase and Extend (Easy Version) binary search brute force dp greedy hashing implementation string suffix structures strings two pointers *1600	0 / 0	5
	2084	P1538A Stone Game brute force dp greedy *800	0 / 0	3
	2079	P1538F Interesting Function binary search dp math number theory *1500	0 / 0	5
	2076	P1539B Love Song dp implementation strings *800	0 / 0	3
	2073	P1539E Game with Cards binary search constructive algorithms data structures dp greedy implementation *2500	0 / 0	9
	2070	P1540B Tree Array brute force combinatorics dp graphs math probabilities trees *2300	0 / 0	8
	2069	P1540C1 Converging Array (Easy Version) dp math *2700	0 / 0	10
	2068	P1540C2 Converging Array (Hard Version) dp math *2900	0 / 0	10
	2059	P1542D Priority Queue combinatorics dp implementation math ternary search *2200	0 / 0	8
	2058	P1542E1 Abnormal Permutation Pairs (easy version) combinatorics dp fft math *2400	0 / 0	9
	2057	P1542E2 Abnormal Permutation Pairs (hard version) combinatorics dp fft math *2700	0 / 0	10
	2046	P1545E1 AquaMoon and Time Stop (easy version) data structures dp *3500	0 / 0	10
	2045	P1545E2 AquaMoon and Time Stop (hard version) data structures dp *3500	0 / 0	10
	2044	P1545F AquaMoon and Potatoes brute force data structures dp *3500	0 / 0	10
	2036	P1547E Air Conditioners data structures dp implementation shortest paths sortings two pointers *1500	0 / 0	5
	2033	P1547G How Many Paths? dfs and similar dp graphs trees *2100	0 / 0	7
	2027	P1548C The Three Little Pigs combinatorics dp fft math *2500	0 / 0	9
	2020	P1549B Gregor and the Pawn Game dfs and similar dp flows graph matchings graphs greedy implementation *800	0 / 0	3
	2011	P1550E Stringforces binary search bitmasks brute force dp strings two pointers *2500	0 / 0	9
	2009	P1550F Jumping Around binary search data structures divide and conquer dp dsu graphs shortest paths *2700	0 / 0	10
	1995	P1551E Fixed Points binary search brute force dp *2000	0 / 0	7
	1992	P1551F Equidistant Vertices brute force combinatorics dfs and similar dp trees *2200	0 / 0	8
	1984	P1552D Array Differentiation bitmasks brute force constructive algorithms dfs and similar dp graphs math *1800	0 / 0	6
	1980	P1552F Telepanting binary search data structures dp sortings *2200	0 / 0	8
	1971	P1553B Reverse String brute force dp hashing implementation strings *1300	0 / 0	4
	1969	P1553C Penalty bitmasks brute force dp greedy *1200	0 / 0	4
	1967	P1553D Backspace dp greedy strings two pointers *1500	0 / 0	5
	1957	P1553I Stairs combinatorics divide and conquer dp fft math *3400	0 / 0	10
	1949	P1554E You dfs and similar dp math number theory *2600	0 / 0	10
	1946	P1555C Coin Rows brute force constructive algorithms dp implementation *1300	0 / 0	4
	1944	P1555D Say No to Palindromes brute force constructive algorithms dp strings *1600	0 / 0	5
	1937	P1556E Equilibrium data structures dp greedy *2200	0 / 0	8
	1936	P1556F Sports Betting bitmasks combinatorics dp graphs math probabilities *2500	0 / 0	9
	1930	P1557C Moamen and XOR bitmasks combinatorics dp math matrices *1700	0 / 0	5
	1929	P1557D Ezzat and Grid data structures dp greedy *2200	0 / 0	8
	1926	P1558B Up the Strip brute force dp math number theory two pointers *1900	0 / 0	6
	1920	P1559B Mocha and Red and Blue dp greedy *900	0 / 0	3
	1916	P1559E Mocha and Stars combinatorics dp fft math number theory *2200	0 / 0	8
	1905	P1560F2 Nearest Beautiful Number (hard version) bitmasks brute force constructive algorithms dfs and similar dp greedy *2100	0 / 0	7
	1902	P1561D1 Up the Strip (simplified version) brute force data structures dp math number theory *1700	0 / 0	5
	1898	P1562D1 Two Hundred Twenty One (easy version) data structures dp math *1700	0 / 0	5
	1896	P1562E Rescue Niwen! dp greedy string suffix structures strings *2500	0 / 0	9
	1893	P1566B MIN-MEX Cut bitmasks constructive algorithms dp greedy *800	0 / 0	3
	1892	P1566C MAX-MEX Cut bitmasks constructive algorithms dp greedy *1000	0 / 0	3
	1889	P1566E Buds Re-hanging constructive algorithms dfs and similar dp greedy trees *2000	0 / 0	7
	1887	P1566F Points Movement data structures dp greedy implementation sortings *2600	0 / 0	10
	1883	P1566H Xor-quiz constructive algorithms dp interactive math number theory *3200	0 / 0	10
	1878	P1567C Carrying Conundrum bitmasks combinatorics dp math *1600	0 / 0	5
	1859	P1569F Palindromic Hamiltonian Path brute force dfs and similar dp graphs hashing *3000	0 / 0	10
	1850	P1571E Fix the String special problem bitmasks dp greedy 1700	0 / 0	5
	1848	P1571F Kotlinforces special problem constructive algorithms dp 2000	0 / 0	7
	1845	P1571G A Battle Against a Dragon special problem data structures dp 2500	0 / 0	9
	1838	P1572A Book binary search brute force data structures dp graphs implementation sortings *1800	0 / 0	6
	1836	P1572C Paint dp greedy *2700	0 / 0	10
	1833	P1572E Polygon binary search dp geometry *3000	0 / 0	10
	1814	P1574F Occurrences combinatorics dfs and similar dp dsu fft graphs *2700	0 / 0	10
	1806	P1575D Divisible by Twenty-Five brute force dfs and similar dp *1800	0 / 0	6
	1801	P1575H Holiday Wall Ornaments dp strings *2200	0 / 0	8
	1797	P1575L Longest Array Deconstruction data structures divide and conquer dp sortings *2100	0 / 0	7
	1766	P1579G Minimal Coverage dp *2200	0 / 0	8
	1765	P1580A Portal brute force data structures dp greedy implementation *1700	0 / 0	5
	1764	P1580B Mathematics Curriculum brute force combinatorics dp trees *2600	0 / 0	10
	1762	P1580D Subsequence brute force divide and conquer dp greedy trees *2900	0 / 0	10
	1753	P1582E Pchelyonok and Segments binary search data structures dp greedy math *2000	0 / 0	7
	1752	P1582F1 Korney Korneevich and XOR (easy version) bitmasks dp greedy *1800	0 / 0	6
	1750	P1582F2 Korney Korneevich and XOR (hard version) binary search brute force dp greedy two pointers *2400	0 / 0	9
	1742	P1583C Omkar and Determination data structures dp *1700	0 / 0	5
	1727	P1584F Strange LCS bitmasks dp graphs greedy strings *2600	0 / 0	10
	1713	P1585F Non-equal Neighbours combinatorics dp math *2400	0 / 0	9
	1711	P1585G Poachers dp games graphs trees *2500	0 / 0	9
	1705	P1592C Bakry and Partitioning bitmasks constructive algorithms dfs and similar dp graphs trees *1700	0 / 0	5

Pick a problem randomly based on the current filter.