dp - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	4323	P1000G Two-Paths data structures dp trees *2700	0 / 0	(None)
	6372	P1003F Abbreviation dp hashing strings *2200	0 / 0	(None)
	6368	P1004E Sonya and Ice Cream binary search data structures dp greedy shortest paths trees *2400	0 / 0	(None)
	6365	P1005D Polycarp and Div 3 dp greedy number theory *1500	0 / 0	(None)
	6343	P1012C Hills dp *1900	0 / 0	(None)
	6337	P1015E2 Stars Drawing (Hard Edition) binary search dp greedy *1900	0 / 0	(None)
	6335	P1016C Vasya And The Mushrooms dp implementation *1800	0 / 0	(None)
	6333	P1016F Road Projects dfs and similar dp trees *2600	0 / 0	(None)
	4344	P1027E Inverse Coloring combinatorics dp math *2100	0 / 0	(None)
	4351	P1029B Creating the Contest dp greedy math *1200	0 / 0	(None)
	4353	P1029E Tree with Small Distances dp graphs greedy *2100	0 / 0	(None)
	4364	P1032C Playing Piano constructive algorithms dp *1700	0 / 0	(None)
	4365	P1032E The Unbearable Lightness of Weights dp math *2100	0 / 0	(None)
	4372	P1034C Region Separation combinatorics dp number theory trees *2700	0 / 0	(None)
	4373	P1034E Little C Loves 3 III bitmasks dp math *3200	0 / 0	(None)
	4376	P1036C Classy Numbers combinatorics dp *1900	0 / 0	(None)
	4380	P1037C Equalize dp greedy strings *1300	0 / 0	(None)
	4386	P1038D Slime dp greedy implementation *1800	0 / 0	(None)
	4387	P1038E Maximum Matching bitmasks brute force dfs and similar dp graphs *2400	0 / 0	(None)
	4390	P1039D You Are Given a Tree data structures dp trees *2800	0 / 0	(None)

Pick a problem randomly based on the current filter.