*2800 - 题库 - 达芬奇编程

ID	题目显示标签隐藏标签	AC / 尝试	难度
248	P1919F2 Wine Factory (Hard Version) data structures dp flows greedy matrices *2800	0 / 0	10
220	P1923F Shrink-Reverse binary search brute force greedy hashing implementation string suffix structures strings *2800	0 / 0	10
142	P1935F Andrey's Tree binary search constructive algorithms data structures dfs and similar dsu greedy implementation trees *2800	0 / 0	10
98	P1942G Bessie and Cards combinatorics dp math *2800	0 / 0	10
92	P1943D2 Counting Is Fun (Hard Version) combinatorics dp *2800	0 / 0	10
9482	P1976F Remove Bridges data structures dfs and similar dp greedy sortings trees *2800	0 / 0	10

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

分类