dp - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1257	P1407D Discrete Centrifugal Jumps data structures dp graphs *2200	0 / 0	(None)
	1256	P1407E Egor in the Republic of Dagestan constructive algorithms dfs and similar dp graphs greedy shortest paths *2500	0 / 0	(None)
	1253	P1408C Discrete Acceleration binary search dp implementation math two pointers *1500	0 / 0	(None)
	1252	P1408D Searchlights binary search brute force data structures dp implementation sortings two pointers *2000	0 / 0	(None)
	1249	P1408G Clusterization Counting combinatorics dp dsu fft graphs trees *2700	0 / 0	(None)
	1247	P1408I Bitwise Magic dp math *3200	0 / 0	(None)
	1242	P1409E Two Platforms binary search dp sortings two pointers *1800	0 / 0	(None)
	1241	P1409F Subsequences of Length Two dp strings *2100	0 / 0	(None)
	1231	P1413C Perform Easily binary search brute force dp implementation sortings two pointers *1900	0 / 0	(None)
	1225	P1415C Bouncing Ball brute force dp implementation *1400	0 / 0	(None)
	1222	P1415F Cakes for Clones dp *2900	0 / 0	(None)
	1219	P1416C XOR Inverse bitmasks data structures divide and conquer dp greedy math sortings strings trees *2000	0 / 0	(None)
	1217	P1416E Split binary search data structures dp greedy *3200	0 / 0	(None)
	1211	P1418C Mortal Kombat Tower dp graphs greedy shortest paths *1500	0 / 0	(None)
	1197	P1420C1 Pokémon Army (easy version) constructive algorithms dp greedy *1300	0 / 0	(None)
	1196	P1420C2 Pokémon Army (hard version) data structures divide and conquer dp greedy implementation *2100	0 / 0	(None)
	1194	P1420E Battle Lemmings dp greedy *2500	0 / 0	(None)
	1189	P1421E Swedish Heroes brute force dp implementation *2700	0 / 0	(None)
	1186	P1422C Bargain combinatorics dp math *1700	0 / 0	(None)
	1184	P1422E Minlexes dp greedy implementation strings *2700	0 / 0	(None)

Pick a problem randomly based on the current filter.