dp - 题库 - Boyacoding

ID	题目显示标签隐藏标签	AC / 尝试	难度
118	CF1895C Torn Lucky Ticket brute force dp hashing implementation math	7 / 24	7
119	CF1895E Infinite Card Game binary search data structures dfs and similar dp games graphs greedy sortings two pointers	1 / 6	10
121	CF1895G Two Characters, Two Colors binary search data structures dp flows geometry	0 / 0	(无)
250	P474E Pillars binary search data structures dp sortings trees *2000	7 / 71	9
255	P1557C Moamen and XOR bitmasks combinatorics dp math matrices *1700	7 / 30	8
256	P1557D Ezzat and Grid data structures dp greedy *2200	7 / 47	8
17	P1747E List Generation combinatorics dp math *2900	0 / 0	(无)
235	P1889C1 Doremy's Drying Plan (Easy Version) brute force data structures dp greedy sortings	1 / 13	10
233	P1889C2 Doremy's Drying Plan (Hard Version) data structures dp	0 / 0	(无)
265	P1900B Laura and Operations dp math *900	10 / 27	6
266	P1900C Anji's Binary Tree dfs and similar dp trees *1300	11 / 12	8
267	P1900D Small GCD bitmasks brute force dp math number theory *2000	4 / 17	9
268	P1900E Transitive Graph dfs and similar dp dsu graphs implementation *2100	2 / 10	10
220	P1948B Array Fix brute force dp greedy implementation	10 / 23	6
221	P1948C Arrow Path dfs and similar dp graphs shortest paths	9 / 17	7
222	P1948D Tandem Repeats? brute force dp expression parsing hashing strings two pointers	8 / 33	7

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

分类