dp - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	412	P1569F Palindromic Hamiltonian Path brute force dfs and similar dp graphs hashing *3000	0 / 0	(None)
	407	P1571E Fix the String special problem bitmasks dp greedy 1700	0 / 0	(None)
	406	P1571F Kotlinforces special problem constructive algorithms dp 2000	0 / 0	(None)
	405	P1571G A Battle Against a Dragon special problem data structures dp 2500	0 / 0	(None)
	401	P1572A Book binary search brute force data structures dp graphs implementation sortings *1800	0 / 0	(None)
	399	P1572C Paint dp greedy *2700	0 / 0	(None)
	397	P1572E Polygon binary search dp geometry *3000	0 / 0	(None)
	388	P1574F Occurrences combinatorics dfs and similar dp dsu fft graphs *2700	0 / 0	(None)
	384	P1575D Divisible by Twenty-Five brute force dfs and similar dp *1800	0 / 0	(None)
	380	P1575H Holiday Wall Ornaments dp strings *2200	0 / 0	(None)
	376	P1575L Longest Array Deconstruction data structures divide and conquer dp sortings *2100	0 / 0	(None)
	353	P1579G Minimal Coverage dp *2200	0 / 0	(None)
	352	P1580A Portal brute force data structures dp greedy implementation *1700	0 / 0	(None)
	351	P1580B Mathematics Curriculum brute force combinatorics dp trees *2600	0 / 0	(None)
	349	P1580D Subsequence brute force divide and conquer dp greedy trees *2900	0 / 0	(None)
	340	P1582E Pchelyonok and Segments binary search data structures dp greedy math *2000	0 / 0	(None)
	339	P1582F1 Korney Korneevich and XOR (easy version) bitmasks dp greedy *1800	0 / 0	(None)
	338	P1582F2 Korney Korneevich and XOR (hard version) binary search brute force dp greedy two pointers *2400	0 / 0	(None)
	334	P1583C Omkar and Determination data structures dp *1700	0 / 0	(None)
	323	P1584F Strange LCS bitmasks dp graphs greedy strings *2600	0 / 0	(None)

Pick a problem randomly based on the current filter.