dp - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	9221	P1956D Nene and the Mex Operator bitmasks brute force constructive algorithms divide and conquer dp greedy implementation math *2000	0 / 0	7
	9215	P1957C How Does the Rook Move? combinatorics dp math *1600	0 / 0	5
	9214	P1957D A BIT of an Inequality bitmasks brute force dp math *1900	0 / 0	6
	9213	P1957E Carousel of Combinations brute force combinatorics dp math number theory *2400	0 / 0	9
	9199	P1967C Fenwick Tree bitmasks brute force combinatorics data structures dp math trees *2300	0 / 0	8
	9197	P1967E1 Again Counting Arrays (Easy Version) combinatorics dp fft math *3100	0 / 0	10
	9196	P1967E2 Again Counting Arrays (Hard Version) combinatorics dp math *3500	0 / 0	10
	9188	P1968G1 Division + LCP (easy version) binary search data structures dp hashing string suffix structures strings *1900	0 / 0	6
	9187	P1968G2 Division + LCP (hard version) binary search brute force data structures dp hashing math string suffix structures strings *2200	0 / 0	8
	9184	P1969C Minimizing the Sum dp implementation *1700	0 / 0	5
	9182	P1969E Unique Array binary search data structures divide and conquer dp greedy *2400	0 / 0	9
	9181	P1969F Card Pairing dp greedy hashing implementation *3000	0 / 0	10
	9173	P1970C2 Game on Tree (Medium) dfs and similar dp games trees	0 / 0	(None)
	9172	P1970C3 Game on Tree (Hard) dfs and similar dp games trees	0 / 0	(None)
	9168	P1970E1 Trails (Easy) dp	0 / 0	(None)
	9167	P1970E2 Trails (Medium) dp matrices	0 / 0	(None)
	9166	P1970E3 Trails (Hard) dp matrices	0 / 0	(None)
	9161	P1970G2 Min-Fund Prison (Medium) brute force dfs and similar dp graphs trees	0 / 0	(None)
	9160	P1970G3 Min-Fund Prison (Hard) bitmasks dfs and similar dp graphs trees	0 / 0	(None)
	9309	P1971D Binary Cut dp greedy implementation sortings strings *1100	0 / 0	3

Pick a problem randomly based on the current filter.