dp - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	6039	P1559B Mocha and Red and Blue dp greedy *900	3 / 10	10
	6041	P1559E Mocha and Stars combinatorics dp fft math number theory *2200	0 / 0	(None)
	6045	P1560F2 Nearest Beautiful Number (hard version) bitmasks brute force constructive algorithms dfs and similar dp greedy *2100	0 / 0	(None)
	6049	P1562D1 Two Hundred Twenty One (easy version) data structures dp math *1700	0 / 0	(None)
	6050	P1562E Rescue Niwen! dp greedy string suffix structures strings *2500	0 / 0	(None)
	6052	P1566B MIN-MEX Cut bitmasks constructive algorithms dp greedy *800	0 / 0	(None)
	6054	P1566E Buds Re-hanging constructive algorithms dfs and similar dp greedy trees *2000	0 / 0	(None)
	6057	P1567C Carrying Conundrum bitmasks combinatorics dp math *1600	0 / 0	(None)
	6065	P1571E Fix the String special problem bitmasks dp greedy 1700	0 / 0	(None)
	6066	P1571G A Battle Against a Dragon special problem data structures dp 2500	0 / 0	(None)
	6069	P1572A Book binary search brute force data structures dp graphs implementation sortings *1800	0 / 0	(None)
	6070	P1572C Paint dp greedy *2700	0 / 0	(None)
	6071	P1572E Polygon binary search dp geometry *3000	0 / 0	(None)
	6077	P1574F Occurrences combinatorics dfs and similar dp dsu fft graphs *2700	0 / 0	(None)
	6079	P1575D Divisible by Twenty-Five brute force dfs and similar dp *1800	0 / 0	(None)
	6082	P1575H Holiday Wall Ornaments dp strings *2200	0 / 0	(None)
	6100	P1580A Portal brute force data structures dp greedy implementation *1700	0 / 0	(None)
	6101	P1580B Mathematics Curriculum brute force combinatorics dp trees *2600	0 / 0	(None)
	6102	P1580D Subsequence brute force divide and conquer dp greedy trees *2900	0 / 0	(None)
	6108	P1582E Pchelyonok and Segments binary search data structures dp greedy math *2000	0 / 0	(None)

Pick a problem randomly based on the current filter.