dp - 题库 - Boyacoding

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	420	P1679D Toss a Coin to Your Graph... binary search dfs and similar dp graphs *1900	0 / 0	6
	419	P1679E Typical Party in Dorm bitmasks combinatorics dp strings *2400	0 / 0	9
	418	P1679F Formalism for Formalism bitmasks dp math *2600	0 / 0	10
	413	P1680E Moving Chips bitmasks dp greedy *2000	0 / 0	7
	408	P1681D Required Length brute force dfs and similar dp hashing shortest paths *1700	0 / 0	5
	407	P1681E Labyrinth Adventures data structures dp matrices shortest paths *2600	0 / 0	10
	406	P1681F Unique Occurrences data structures dfs and similar divide and conquer dp dsu trees *2300	0 / 0	8
	384	P1686B Odd Subarrays dp greedy *800	0 / 0	3
	372	P1689C Infected Tree dfs and similar dp trees *1600	0 / 0	5
	371	P1689D Lena and Matrix data structures dp geometry shortest paths *1900	0 / 0	6
	357	P1691F K-Set Tree combinatorics dfs and similar dp math trees *2500	0 / 0	9
	350	P1692G 2^Sort data structures dp sortings two pointers *1400	0 / 0	4
	349	P1692H Gambling data structures dp greedy math *1700	0 / 0	5
	347	P1693B Fake Plastic Trees dfs and similar dp greedy trees *1700	0 / 0	5
	345	P1693D Decinc Dividing brute force data structures divide and conquer dp greedy *2800	0 / 0	10
	338	P1695C Zero Path brute force data structures dp graphs greedy shortest paths *1700	0 / 0	5
	337	P1695D1 Tree Queries (Easy Version) brute force constructive algorithms dfs and similar dp greedy trees *2200	0 / 0	8
	336	P1695D2 Tree Queries (Hard Version) constructive algorithms dfs and similar dp greedy trees *2300	0 / 0	8
	327	P1696H Maximum Product? brute force combinatorics dp greedy implementation math two pointers *3500	0 / 0	10
	322	P1697E Coloring brute force combinatorics constructive algorithms dp geometry graphs greedy implementation math *2400	0 / 0	9
	310	P1699D Almost Triple Deletions data structures dp greedy *2300	0 / 0	8
	309	P1699E Three Days Grace data structures dp greedy math number theory two pointers *2600	0 / 0	10
	305	P1700D River Locks binary search dp greedy math *1900	0 / 0	6
	303	P1700F Puzzle constructive algorithms dp greedy *2600	0 / 0	10
	298	P1701E Text Editor brute force dp greedy strings *2500	0 / 0	9
	283	P1703F Yet Another Problem About Pairs Satisfying an Inequality binary search data structures dp greedy sortings *1300	0 / 0	4
	282	P1703G Good Key, Bad Key bitmasks brute force dp greedy math *1600	0 / 0	5
	277	P1704E Count Seconds brute force constructive algorithms dp graphs implementation math *2200	0 / 0	8
	276	P1704F Colouring Game constructive algorithms dp games *2600	0 / 0	10
	274	P1704H1 Game of AI (easy version) combinatorics constructive algorithms dp fft math *3200	0 / 0	10
	265	P1706B Making Towers dp greedy math *1100	0 / 0	3
	264	P1706C Qpwoeirut And The City dp flows greedy implementation *1400	0 / 0	4
	262	P1706D2 Chopping Carrots (Hard Version) brute force constructive algorithms data structures dp greedy math number theory two pointers *2400	0 / 0	9
	257	P1707D Partial Virtual Trees combinatorics dfs and similar dp math trees *3000	0 / 0	10
	255	P1707F Bugaboo bitmasks constructive algorithms dp number theory *3500	0 / 0	10
	251	P1709B Also Try Minecraft data structures dp implementation *900	0 / 0	3
	247	P1709F Multiset of Strings bitmasks brute force dp fft flows graphs math meet-in-the-middle trees *2500	0 / 0	9
	244	P1710C XOR Triangle bitmasks brute force constructive algorithms dp greedy math *2500	0 / 0	9
	230	P1713C Build Permutation constructive algorithms dp math *1200	0 / 0	4
	227	P1713F Lost Array bitmasks combinatorics constructive algorithms dp math *2900	0 / 0	10
	223	P1714D Color with Occurrences brute force data structures dp greedy strings *1600	0 / 0	5
	215	P1715E Long Way Home data structures divide and conquer dp geometry graphs greedy shortest paths *2400	0 / 0	9
	211	P1716C Robot in a Hallway data structures dp greedy implementation ternary search *2000	0 / 0	7
	210	P1716D Chip Move brute force dp math *2000	0 / 0	7
	209	P1716E Swap and Maximum Block bitmasks data structures dfs and similar divide and conquer dp *2500	0 / 0	9
	208	P1716F Bags with Balls combinatorics dp math number theory *2500	0 / 0	9
	201	P1718A1 Burenka and Traditions (easy version) dp greedy *1800	0 / 0	6
	200	P1718A2 Burenka and Traditions (hard version) data structures dp greedy *1900	0 / 0	6
	188	P1720D1 Xor-Subsequence (easy version) bitmasks brute force dp strings trees two pointers *1800	0 / 0	6
	187	P1720D2 Xor-Subsequence (hard version) bitmasks data structures dp strings trees *2400	0 / 0	9
	181	P1721E Prefix Function Queries dfs and similar dp hashing string suffix structures strings trees *2200	0 / 0	8
	175	P1722E Counting Rectangles brute force data structures dp implementation *1600	0 / 0	5
	168	P1725E Electrical Efficiency combinatorics data structures dp math number theory trees *2500	0 / 0	9
	163	P1725J Journey dp trees *2500	0 / 0	9
	160	P1725M Moving Both Hands dp graphs shortest paths *1800	0 / 0	6
	148	P1728D Letter Picking constructive algorithms dp games two pointers *1800	0 / 0	6
	145	P1728G Illumination binary search bitmasks brute force combinatorics dp math two pointers *2700	0 / 0	10
	138	P1729G Cut Substrings combinatorics dp hashing strings two pointers *2100	0 / 0	7
	132	P1730F Almost Sorted bitmasks data structures dp *2700	0 / 0	10
	130	P1732B Ugu brute force dp greedy implementation *900	0 / 0	3
	125	P1732E Location data structures dp math number theory *2800	0 / 0	10
	120	P1733D2 Zero-One (Hard Version) dp greedy *2000	0 / 0	7
	119	P1733E Conveyor constructive algorithms dp math *2700	0 / 0	10
	115	P1734D Slime Escape data structures dp greedy two pointers *1800	0 / 0	6
	113	P1734F Zeros and Ones bitmasks divide and conquer dp math *2500	0 / 0	9
	103	P1736C2 Good Subarrays (Hard Version) binary search data structures dp two pointers *2400	0 / 0	9
	101	P1736E Swap and Take dp greedy *2600	0 / 0	10
	97	P1737D Ela and the Wiring Wizard brute force dp graphs greedy implementation shortest paths *2200	0 / 0	8
	96	P1737E Ela Goes Hiking combinatorics dp math probabilities *2500	0 / 0	9
	91	P1738C Even Number Addicts dp games greedy math *1500	0 / 0	5
	89	P1738E Balance Addicts combinatorics dp math two pointers *2300	0 / 0	8
	87	P1738G Anti-Increasing Addicts constructive algorithms dp greedy math *2900	0 / 0	10
	83	P1739C Card Game combinatorics constructive algorithms dp games *1500	0 / 0	5
	81	P1739E Cleaning Robot bitmasks dp *2400	0 / 0	9
	80	P1739F Keyboard Design bitmasks data structures dp string suffix structures strings *2600	0 / 0	10
	75	P1740E Hanging Hearts constructive algorithms data structures dfs and similar dp greedy trees *1800	0 / 0	6
	74	P1740F Conditional Mix combinatorics dp math *2600	0 / 0	10
	71	P1740I Arranging Crystal Balls data structures divide and conquer divide and conquer dp geometry graphs number theory *3500	0 / 0	10
	66	P1741E Sending a Sequence Over the Network dp *1600	0 / 0	5
	64	P1741G Kirill and Company bitmasks brute force dfs and similar dp flows graphs shortest paths *2200	0 / 0	8
	54	P1743C Save the Magazines constructive algorithms dp greedy *1100	0 / 0	3
	53	P1743D Problem with Random Tests brute force dp greedy probabilities *1700	0 / 0	5
	52	P1743E FTL binary search dp *2400	0 / 0	9
	51	P1743F Intersection and Union data structures dp matrices probabilities *2300	0 / 0	8
	50	P1743G Antifibonacci Cut bitmasks combinatorics constructive algorithms data structures dp hashing math *3000	0 / 0	10
	39	P1746D Paths on the Tree dfs and similar dp greedy sortings trees *1900	0 / 0	6
	37	P1746E2 Joking (Hard Version) dp interactive *3200	0 / 0	10
	35	P1746G Olympiad Training binary search data structures dp flows geometry implementation sortings *3500	0 / 0	10
	30	P1747E List Generation combinatorics dp math *2900	0 / 0	10
	27	P1748C Zero-Sum Prefixes brute force data structures dp greedy implementation *1600	0 / 0	5
	25	P1748E Yet Another Array Counting Problem combinatorics data structures divide and conquer dp trees *2300	0 / 0	8
	20	P1749D Counting Arrays combinatorics dp math number theory *1900	0 / 0	6
	13	P1750E Bracket Cost binary search data structures divide and conquer dp greedy strings *2400	0 / 0	9
	12	P1750F Majority combinatorics dp math strings *2700	0 / 0	10
	11	P1750G Doping combinatorics dp math *3300	0 / 0	10
	10	P1750H BinaryStringForces constructive algorithms data structures dp *3500	0 / 0	10
	9	P1753A1 Make Nonzero Sum (easy version) constructive algorithms dp greedy *1300	0 / 0	4
	8	P1753A2 Make Nonzero Sum (hard version) constructive algorithms dp greedy *1500	0 / 0	5
	6	P1753C Wish I Knew How to Sort dp math probabilities *2000	0 / 0	7
	8188	P1759E The Humanoid brute force dp sortings *1500	0 / 0	5

根据当前过滤条件随机选择一道题