dp - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	6109	P1582F1 Korney Korneevich and XOR (easy version) bitmasks dp greedy *1800	0 / 0	(None)
	6113	P1583C Omkar and Determination data structures dp *1700	0 / 0	(None)
	6120	P1584F Strange LCS bitmasks dp graphs greedy strings *2600	0 / 0	(None)
	6125	P1585G Poachers dp games graphs trees *2500	0 / 0	(None)
	6134	P1593G Changing Brackets constructive algorithms data structures dp greedy *2200	0 / 0	(None)
	6136	P1594D The Number of Imposters constructive algorithms dfs and similar dp dsu graphs *1700	0 / 0	(None)
	6140	P1598C Delete Two Elements data structures dp implementation math two pointers *1200	0 / 0	(None)
	6141	P1598E Staircases brute force combinatorics data structures dfs and similar dp implementation math *2100	0 / 0	(None)
	6152	P1601B Frog Traveler data structures dfs and similar dp graphs shortest paths two pointers *1900	0 / 0	(None)
	6153	P1601C Optimal Insertion data structures divide and conquer dp greedy sortings *2300	0 / 0	(None)
	6154	P1601D Difficult Mountain data structures dp greedy sortings *2700	0 / 0	(None)
	6158	P1603C Extreme Extension dp greedy math number theory *2300	0 / 0	(None)
	6159	P1603D Artistic Partition divide and conquer dp number theory *3000	0 / 0	(None)
	6160	P1603F October 18, 2017 combinatorics dp implementation math *2700	0 / 0	(None)
	6169	P1606E Arena combinatorics dp math *2100	0 / 0	(None)
	6181	P1609C Complex Market Analysis binary search dp implementation number theory schedules two pointers *1400	0 / 0	(None)
	6183	P1609E William The Oblivious bitmasks data structures dp matrices *2400	0 / 0	(None)
	6188	P1610D Not Quite Lee combinatorics dp math number theory *2000	0 / 0	(None)
	6195	P1611E2 Escape The Maze (hard version) dfs and similar dp greedy shortest paths trees *1900	0 / 0	(None)
	6199	P1612E Messages brute force dp greedy probabilities sortings *2000	0 / 0	(None)

Pick a problem randomly based on the current filter.