dp - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	7985	P1741E Sending a Sequence Over the Network dp	0 / 0	(None)
	7983	P1741G Kirill and Company bitmasks brute force dfs and similar dp flows graphs shortest paths	0 / 0	(None)
	8015	P1743C Save the Magazines constructive algorithms dp greedy *1100	0 / 0	3
	8013	P1743E FTL dp greedy *2400	0 / 0	9
	8011	P1743G Antifibonacci Cut bitmasks combinatorics constructive algorithms data structures dp math *3000	0 / 0	10
	8000	P1746D Paths on the Tree dfs and similar dp greedy sortings trees *1900	0 / 0	6
	7998	P1746E2 Joking (Hard Version) dp interactive *3200	0 / 0	10
	7996	P1746G Olympiad Training binary search data structures dp flows geometry implementation sortings *3500	0 / 0	10
	8054	P1747E List Generation combinatorics dp math *2900	0 / 0	10
	8062	P1748C Zero-Sum Prefixes brute force data structures dp greedy implementation *1600	0 / 0	5
	8061	P1748D ConstructOR bitmasks combinatorics constructive algorithms dp math number theory *2100	0 / 0	7
	8060	P1748E Yet Another Array Counting Problem data structures divide and conquer dp flows math trees *2300	0 / 0	8
	8020	P1749D Counting Arrays combinatorics dp math number theory	0 / 0	(None)
	8049	P1750E Bracket Cost binary search data structures divide and conquer dp greedy strings	0 / 0	(None)
	8048	P1750F Majority combinatorics dp strings	0 / 0	(None)
	8047	P1750G Doping combinatorics dp math	0 / 0	(None)
	8046	P1750H BinaryStringForces constructive algorithms data structures dp	0 / 0	(None)
	8032	P1753A1 Make Nonzero Sum (easy version) constructive algorithms dp *1300	0 / 0	4
	8031	P1753A2 Make Nonzero Sum (hard version) constructive algorithms dp *1500	0 / 0	5
	8029	P1753C Wish I Knew How to Sort dp probabilities *2000	0 / 0	7

Pick a problem randomly based on the current filter.