dp - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	8713	P1879C Make it Alternating combinatorics dp greedy *1300	0 / 0	4
	8712	P1879D Sum of XOR Functions bitmasks combinatorics divide and conquer dp math *1700	0 / 0	5
	8757	P1881E Block Sequence dp	0 / 0	(None)
	8756	P1881F Minimum Maximum Distance dfs and similar dp graphs shortest paths trees	0 / 0	(None)
	8706	P1882D Tree XOR bitmasks dfs and similar dp greedy trees	0 / 0	(None)
	8808	P1883C Raspberries dp math	0 / 0	(None)
	8800	P1884C Medium Design brute force data structures dp greedy sortings	0 / 0	(None)
	8799	P1884D Counting Rhyme dp math number theory	0 / 0	(None)
	8750	P1886E I Wanna be the Team Leader bitmasks constructive algorithms dp greedy math sortings two pointers	0 / 0	(None)
	8790	P1889C1 Doremy's Drying Plan (Easy Version) brute force data structures dp greedy sortings	0 / 0	(None)
	8789	P1889C2 Doremy's Drying Plan (Hard Version) data structures dp	0 / 0	(None)
	8786	P1889F Doremy's Average Tree data structures dp greedy trees	0 / 0	(None)
	8873	P1893E Cacti Symphony combinatorics dfs and similar dp graphs *3500	0 / 0	10
	8775	P1895C Torn Lucky Ticket brute force dp hashing implementation math	0 / 0	(None)
	8772	P1895F Fancy Arrays combinatorics dp flows hashing math matrices	0 / 0	(None)
	8771	P1895G Two Characters, Two Colors binary search data structures dp flows greedy	0 / 0	(None)
	8863	P1896H1 Cyclic Hamming (Easy Version) brute force divide and conquer dp fft math number theory *3400	0 / 0	10
	8862	P1896H2 Cyclic Hamming (Hard Version) brute force dp fft math number theory *3500	0 / 0	10
	8853	P1899C Yarik and Array dp greedy two pointers *1100	0 / 0	3
	8847	P1900B Laura and Operations dp math *900	0 / 0	3

Pick a problem randomly based on the current filter.