dp - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5840	P1501B Napoleon Cake dp implementation sortings *900	3 / 18	9
	5842	P1503C Travelling Salesman Problem binary search data structures dp greedy shortest paths sortings two pointers *2200	0 / 0	(None)
	5843	P1503E 2-Coloring combinatorics dp math *3100	0 / 0	(None)
	5854	P1506G Maximize the Remaining String brute force data structures dp greedy strings *2000	0 / 0	(None)
	5869	P1511E Colorings and Dominoes combinatorics dp greedy math *2100	0 / 0	(None)
	5870	P1511F Chainword brute force data structures dp matrices string suffix structures strings *2700	0 / 0	(None)
	5875	P1512F Education brute force dp greedy implementation *1900	0 / 0	(None)
	5888	P1516B AGAGA XOOORRR bitmasks brute force dp greedy *1500	0 / 0	(None)
	5889	P1516C Baby Ehab Partitions Again bitmasks constructive algorithms dp math *1700	0 / 0	(None)
	5890	P1516E Baby Ehab Plays with Permutations combinatorics dp math *2500	0 / 0	(None)
	5892	P1517D Explorer Space dp graphs shortest paths *1800	0 / 0	(None)
	5894	P1517F Reunion combinatorics dp trees *3200	0 / 0	(None)
	5895	P1517H Fly Around the World dp geometry *3500	0 / 0	(None)
	5896	P1519B The Cake Is a Lie dp math *800	0 / 0	(None)
	5898	P1519D Maximum Sum of Products brute force dp implementation math two pointers *1600	0 / 0	(None)
	5899	P1519F Chests and Keys bitmasks brute force dfs and similar dp flows *3200	0 / 0	(None)
	5907	P1521D Nastia Plays with a Tree constructive algorithms data structures dfs and similar dp dsu greedy implementation trees *2500	0 / 0	(None)
	5908	P1521E Nastia and a Beautiful Matrix binary search constructive algorithms dp greedy *2700	0 / 0	(None)
	5911	P1523D Love-Hate bitmasks brute force dp probabilities *2400	0 / 0	(None)
	5912	P1523F Favorite Game bitmasks dp *3300	0 / 0	(None)

Pick a problem randomly based on the current filter.