dp - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	4245	P977F Consecutive Subsequence dp *1700	0 / 0	(None)
	4252	P979E Kuro and Topological Parity dp *2400	0 / 0	(None)
	4255	P980D Perfect Groups dp math number theory *2100	0 / 0	(None)
	4256	P980F Cactus to Tree dp graphs trees *2900	0 / 0	(None)
	4259	P981E Addition on Segments bitmasks data structures divide and conquer dp *2200	0 / 0	(None)
	4261	P981H K Paths combinatorics data structures dp fft math *3100	0 / 0	(None)
	4266	P983B XOR-pyramid dp *1800	0 / 0	(None)
	4267	P983C Elevator dp graphs shortest paths *2400	0 / 0	(None)
	4274	P985E Pencils and Boxes binary search data structures dp greedy two pointers *2100	0 / 0	(None)
	4281	P987C Three displays brute force dp implementation *1400	0 / 0	(None)
	4285	P988F Rain and Umbrellas dp *2100	0 / 0	(None)
	4292	P990F Flow Control dfs and similar dp greedy trees *2400	0 / 0	(None)
	4293	P990G GCD Counting divide and conquer dp dsu number theory trees *2400	0 / 0	(None)
	4295	P991D Bishwock dp greedy *1500	0 / 0	(None)
	4302	P993D Compute Power binary search dp greedy *2500	0 / 0	(None)
	4308	P995F Cowmpany Cowmpensation combinatorics dp math trees *2700	0 / 0	(None)
	4309	P996A Hit the Lottery dp greedy *800	0 / 0	(None)
	4311	P997B Roman Digits brute force combinatorics dp greedy math *2000	0 / 0	(None)
	4314	P998B Cutting dp greedy sortings *1200	0 / 0	(None)
	4321	P1000D Yet Another Problem On a Subsequence combinatorics dp *1900	0 / 0	(None)

Pick a problem randomly based on the current filter.