dp - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	8289	P1801F Another n-dimensional chocolate bar dp number theory	0 / 0	(None)
	8298	P1804E Routing bitmasks brute force dfs and similar dp graphs	0 / 0	(None)
	8295	P1804H Code Lock bitmasks dp	0 / 0	(None)
	8359	P1805D A Wide, Wide Graph dfs and similar dp dsu greedy trees	0 / 0	(None)
	8306	P1806D DSU Master combinatorics dp dsu math	0 / 0	(None)
	8311	P1807G1 Subsequence Addition (Easy Version) dp greedy implementation sortings	0 / 0	(None)
	8310	P1807G2 Subsequence Addition (Hard Version) data structures dp greedy implementation sortings	0 / 0	(None)
	8351	P1808E1 Minibuses on Venus (easy version) combinatorics dp *2200	0 / 0	8
	8350	P1808E2 Minibuses on Venus (medium version) combinatorics divide and conquer dp matrices *2500	0 / 0	9
	8349	P1808E3 Minibuses on Venus (hard version) brute force combinatorics dp math *2800	0 / 0	10
	8320	P1809E Two Tanks binary search dp implementation math *2400	0 / 0	9
	8318	P1809G Prediction combinatorics dp math *2800	0 / 0	10
	8342	P1810G The Maximum Prefix dp *3200	0 / 0	10
	8372	P1811E Living Sequence binary search dp math number theory *1500	0 / 0	5
	8370	P1811G1 Vlad and the Nice Paths (easy version) combinatorics dp math *2100	0 / 0	7
	8369	P1811G2 Vlad and the Nice Paths (hard version) binary search combinatorics data structures dp math two pointers *2200	0 / 0	8
	8364	P1814E Chain Chips data structures dp	0 / 0	(None)
	8395	P1815D XOR Counting bitmasks combinatorics dp math *2600	0 / 0	10
	8394	P1815E Bosco and Particle dp math number theory strings *3100	0 / 0	10
	8388	P1819C The Fox and the Complete Tree Traversal constructive algorithms dp implementation math trees *2400	0 / 0	9

Pick a problem randomly based on the current filter.