dp - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1700	P1326F1 Wise Men (Easy Version) bitmasks brute force dp meet-in-the-middle *2600	0 / 0	(None)
	1699	P1326F2 Wise Men (Hard Version) bitmasks dp math *3200	0 / 0	(None)
	1698	P1326G Spiderweb Trees dp geometry trees *3500	0 / 0	(None)
	1693	P1327E Count The Blocks combinatorics dp math *1800	0 / 0	(None)
	1692	P1327F AND Segments bitmasks combinatorics data structures dp two pointers *2500	0 / 0	(None)
	1691	P1327G Letters and Question Marks bitmasks dp string suffix structures *2800	0 / 0	(None)
	1687	P1328D Carousel constructive algorithms dp graphs greedy math *1800	0 / 0	(None)
	1672	P1331F Elementary! *special problem brute force dp strings	0 / 0	(None)
	1664	P1332F Independent Set dfs and similar dp trees *2500	0 / 0	(None)
	1651	P1334F Strange Function binary search data structures dp greedy *2500	0 / 0	(None)
	1645	P1335E1 Three Blocks Palindrome (easy version) binary search brute force data structures dp two pointers *1700	0 / 0	(None)
	1644	P1335E2 Three Blocks Palindrome (hard version) brute force data structures dp two pointers *1800	0 / 0	(None)
	1642	P1336A Linova and Kingdom dfs and similar dp greedy sortings trees *1600	0 / 0	(None)
	1640	P1336C Kaavi and Magic Spell dp strings *2200	0 / 0	(None)
	1630	P1338D Nested Rubber Bands constructive algorithms dfs and similar dp math trees *2700	0 / 0	(None)
	1628	P1339A Filling Diamonds brute force dp implementation math *900	0 / 0	(None)
	1625	P1340B Nastya and Scoreboard bitmasks dp graphs greedy *1700	0 / 0	(None)
	1624	P1340C Nastya and Unexpected Guest dfs and similar dp graphs shortest paths *2400	0 / 0	(None)
	1613	P1342F Make It Ascending bitmasks brute force dp *3000	0 / 0	(None)
	1610	P1343C Alternating Subsequence dp greedy two pointers *1200	0 / 0	(None)

Pick a problem randomly based on the current filter.