dp - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1950	P1271E Common Number binary search combinatorics dp math *2100	0 / 0	(None)
	1946	P1272C Yet Another Broken Keyboard combinatorics dp implementation *1200	0 / 0	(None)
	1945	P1272D Remove One Element brute force dp *1500	0 / 0	(None)
	1943	P1272F Two Bracket Sequences dp strings two pointers *2200	0 / 0	(None)
	1934	P1276A As Simple as One and Two dp greedy *1400	0 / 0	(None)
	1931	P1276D Tree Elimination dp trees *2900	0 / 0	(None)
	1923	P1278C Berry Jam data structures dp greedy implementation *1700	0 / 0	(None)
	1920	P1278F Cards combinatorics dp math number theory probabilities *2600	0 / 0	(None)
	1915	P1279E New Year Permutations combinatorics dp *2700	0 / 0	(None)
	1914	P1279F New Year and Handle Change binary search dp *2800	0 / 0	(None)
	1910	P1280D Miss Punyverse dp greedy trees *2500	0 / 0	(None)
	1904	P1282B1 K for the Price of One (Easy Version) dp greedy sortings *1400	0 / 0	(None)
	1903	P1282B2 K for the Price of One (Hard Version) dp greedy sortings *1600	0 / 0	(None)
	1895	P1283E New Year Parties dp greedy *1800	0 / 0	(None)
	1892	P1284B New Year and Ascent Sequence binary search combinatorics data structures dp implementation sortings *1400	0 / 0	(None)
	1885	P1285B Just Eat It! dp greedy implementation *1300	0 / 0	(None)
	1883	P1285D Dr bitmasks brute force dfs and similar divide and conquer dp greedy strings trees *1900	0 / 0	(None)
	1882	P1285E Delete a Segment brute force constructive algorithms data structures dp graphs sortings trees two pointers *2300	0 / 0	(None)
	1880	P1286A Garland dp greedy sortings *1800	0 / 0	(None)
	1874	P1286F Harry The Potter brute force constructive algorithms dp fft implementation math *3100	0 / 0	(None)

Pick a problem randomly based on the current filter.