dp - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5076	P1260D A Game with Traps binary search dp greedy sortings *1900	0 / 0	(None)
	5077	P1260E Tournament brute force dp greedy *2400	0 / 0	(None)
	5087	P1265E Beautiful Mirrors data structures dp math probabilities *2100	0 / 0	(None)
	5099	P1268B Domino for Young dp greedy math *2000	0 / 0	(None)
	5101	P1268E Happy Cactus dp *3400	0 / 0	(None)
	5111	P1271E Common Number binary search combinatorics dp math *2100	0 / 0	(None)
	5114	P1272D Remove One Element brute force dp *1500	0 / 0	(None)
	5122	P1276A As Simple as One and Two dp greedy *1400	0 / 0	(None)
	5129	P1278C Berry Jam data structures dp greedy implementation *1700	0 / 0	(None)
	5131	P1278F Cards combinatorics dp math number theory probabilities *2600	0 / 0	(None)
	5135	P1279E New Year Permutations combinatorics dp *2700	0 / 0	(None)
	5143	P1282B2 K for the Price of One (Hard Version) dp greedy sortings *1600	0 / 0	(None)
	5149	P1283E New Year Parties dp greedy *1800	0 / 0	(None)
	5155	P1285B Just Eat It! dp greedy implementation *1300	0 / 0	(None)
	5156	P1285D Dr bitmasks brute force dfs and similar divide and conquer dp greedy strings trees *1900	0 / 0	(None)
	5157	P1285E Delete a Segment brute force constructive algorithms data structures dp graphs sortings trees two pointers *2300	0 / 0	(None)
	5158	P1286A Garland dp greedy sortings *1800	0 / 0	(None)
	5161	P1286F Harry The Potter brute force constructive algorithms dp fft implementation math *3100	0 / 0	(None)
	5164	P1288C Two Arrays combinatorics dp *1600	0 / 0	(None)
	5165	P1288D Minimax Problem binary search bitmasks dp *2000	0 / 0	(None)

Pick a problem randomly based on the current filter.