dp - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5834	P401D Roman and Numbers bitmasks brute force combinatorics dp number theory *2000	0 / 0	(None)
	5829	P402D Upgrading Array dp greedy math number theory *1800	0 / 0	(None)
	5827	P403D Beautiful Pairs of Numbers combinatorics dp *2300	0 / 0	(None)
	5822	P404D Minesweeper 1D dp implementation *1900	0 / 0	(None)
	5812	P407B Long Path dp implementation *1600	0 / 0	(None)
	5810	P407D Largest Submatrix 3 dp hashing *2700	0 / 0	(None)
	5786	P413D 2048 bitmasks dp *2000	0 / 0	(None)
	5783	P414B Mashmokh and ACM combinatorics dp number theory *1400	0 / 0	(None)
	5776	P416B Art Union brute force dp implementation *1300	0 / 0	(None)
	5775	P416C Booking System binary search dp greedy implementation *1600	0 / 0	(None)
	5773	P416E President's Path dp graphs shortest paths *2500	0 / 0	(None)
	5772	P417A Elimination dp implementation math *1500	0 / 0	(None)
	5769	P417D Cunning Gena bitmasks dp greedy sortings *1900	0 / 0	(None)
	5755	P424D Biathlon Track binary search brute force constructive algorithms data structures dp *2300	0 / 0	(None)
	5754	P424E Colored Jenga dfs and similar dp probabilities *2500	0 / 0	(None)
	5751	P425C Sereja and Two Sequences data structures dp *2300	0 / 0	(None)
	5749	P425E Sereja and Sets dp *2500	0 / 0	(None)
	5743	P427D Match & Catch dp string suffix structures strings *2200	0 / 0	(None)
	5740	P429B Working out dp *1600	0 / 0	(None)
	5739	P429C Guess the Tree bitmasks constructive algorithms dp greedy trees *2300	0 / 0	(None)

Pick a problem randomly based on the current filter.