dp - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1328	P1392H ZS Shuffles Cards combinatorics dp math probabilities *3000	0 / 0	(None)
	1323	P1393D Rarity and New Dress dfs and similar dp implementation shortest paths *2100	0 / 0	(None)
	1322	P1393E1 Twilight and Ancient Scroll (easier version) dp hashing implementation string suffix structures strings *2800	0 / 0	(None)
	1321	P1393E2 Twilight and Ancient Scroll (harder version) dp hashing implementation string suffix structures strings two pointers *3200	0 / 0	(None)
	1320	P1394A Boboniu Chats with Du dp greedy sortings two pointers *1800	0 / 0	(None)
	1317	P1394D Boboniu and Jianghu dp greedy sortings trees *2800	0 / 0	(None)
	1313	P1395C Boboniu and Bit Operations bitmasks brute force dp greedy *1600	0 / 0	(None)
	1310	P1396C Monster Invaders dp greedy implementation *2300	0 / 0	(None)
	1303	P1398C Good Subarrays data structures dp math *1600	0 / 0	(None)
	1302	P1398D Colored Rectangles dp greedy sortings *1800	0 / 0	(None)
	1300	P1398F Controversial Rounds binary search data structures dp greedy two pointers *2500	0 / 0	(None)
	1292	P1399F Yet Another Segments Subset data structures dp graphs sortings *2300	0 / 0	(None)
	1287	P1400E Clear the Multiset data structures divide and conquer dp greedy *2200	0 / 0	(None)
	1286	P1400F x-prime Substrings brute force dfs and similar dp string suffix structures strings *2800	0 / 0	(None)
	1285	P1400G Mercenaries bitmasks brute force combinatorics dp dsu math two pointers *2600	0 / 0	(None)
	1281	P1401D Maximum Distributed Tree dfs and similar dp greedy implementation math number theory sortings trees *1800	0 / 0	(None)
	1276	P1402C Star Trek special problem combinatorics dfs and similar dp games graphs matrices trees 2600	0 / 0	(None)
	1273	P1403C Chess Rush special problem combinatorics dp implementation math 3200	0 / 0	(None)
	1271	P1404B Tree Tag dfs and similar dp games trees *1900	0 / 0	(None)
	1264	P1406B Maximum Product brute force dp greedy implementation sortings *1200	0 / 0	(None)

Pick a problem randomly based on the current filter.