*2000 - 题库

ID	题目显示标签隐藏标签	AC / 尝试	难度
8647	P1912B Blueprint for Seating combinatorics divide and conquer math *2000	0 / 0	7
8838	P1941G Rudolf and Subway constructive algorithms dfs and similar graphs shortest paths *2000	0 / 0	7
8827	P1943B Non-Palindromic Substring hashing implementation math strings *2000	0 / 0	7
8777	P1951D Buying Jewels constructive algorithms greedy math *2000	0 / 0	7
8776	P1951E No Palindromes brute force constructive algorithms divide and conquer greedy hashing implementation math strings *2000	0 / 0	7
8743	P1956D Nene and the Mex Operator bitmasks brute force constructive algorithms divide and conquer dp greedy implementation math *2000	0 / 0	7
8912	P1958F Narrow Paths special problem combinatorics 2000	0 / 0	7
8957	P1974G Money Buys Less Happiness Now data structures greedy sortings *2000	0 / 0	7
9004	P1978E Computing Machine brute force data structures dp greedy implementation *2000	0 / 0	7
8977	P1984D "a" String Problem brute force hashing implementation math string suffix structures strings *2000	0 / 0	7
9041	P1987E Wonderful Tree! brute force data structures dfs and similar dsu greedy trees *2000	0 / 0	7
9017	P1992G Ultra-Meow combinatorics dp math *2000	0 / 0	7

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

分类