dp - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	6200	P1612F Armor and Weapons brute force dp greedy shortest paths *2800	0 / 0	(None)
	6204	P1613D MEX Sequences dp math *1900	0 / 0	(None)
	6207	P1614C Divan and bitwise operations bitmasks combinatorics constructive algorithms dp math *1500	0 / 0	(None)
	6208	P1614D1 Divan and Kostomuksha (easy version) dp number theory *2100	0 / 0	(None)
	6217	P1616D Keep the Average High dp greedy math *2000	0 / 0	(None)
	6219	P1616G Just Add an Edge dfs and similar dp graphs *3500	0 / 0	(None)
	6230	P1619E MEX and Increments constructive algorithms data structures dp greedy implementation math sortings *1700	0 / 0	(None)
	6236	P1620F Bipartite Array dp greedy *2800	0 / 0	(None)
	6239	P1621E New School binary search data structures dp greedy implementation sortings *2300	0 / 0	(None)
	6258	P1626F A Random Code Problem combinatorics dp math number theory probabilities *2800	0 / 0	(None)
	6262	P1627E Not Escaping data structures dp implementation shortest paths two pointers *2200	0 / 0	(None)
	6265	P1628D2 Game on Sum (Hard Version) combinatorics dp games math *2400	0 / 0	(None)
	6270	P1630C Paint the Middle dp greedy sortings two pointers *2200	0 / 0	(None)
	6290	P1637B MEX and Array brute force dp greedy math *1100	0 / 0	(None)
	6291	P1637D Yet Another Minimization Problem dp greedy math *1800	0 / 0	(None)
	6310	P1644C Increase Subarray Sums brute force dp greedy implementation *1400	0 / 0	(None)
	6314	P1646C Factorials and Powers of Two bitmasks brute force constructive algorithms dp math *1500	0 / 0	(None)
	6315	P1646E Power Board brute force dp math number theory *2200	0 / 0	(None)
	6318	P1648D Serious Business data structures dp shortest paths	0 / 0	(None)
	3293	P1650F Vitaly and Advanced Useless Algorithms dp greedy	0 / 0	(None)

Pick a problem randomly based on the current filter.