*2000 - 题库 - Boyacoding

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	8858	P1900D Small GCD bitmasks brute force dp math number theory *2000	0 / 0	7
	8844	P1903E Geo Game greedy interactive math *2000	0 / 0	7
	8917	P1905D Cyclic MEX data structures implementation math two pointers *2000	0 / 0	7
	8837	P1906F Maximize The Value data structures sortings *2000	0 / 0	7
	8899	P1910F Build Railway Stations special problem greedy trees 2000	0 / 0	7
	8893	P1912B Blueprint for Seating combinatorics divide and conquer math *2000	0 / 0	7
	8950	P1931G One-Dimensional Puzzle combinatorics math number theory *2000	0 / 0	7
	9045	P1941G Rudolf and Subway constructive algorithms dfs and similar graphs shortest paths *2000	0 / 0	7
	9122	P1951D Buying Jewels constructive algorithms greedy math *2000	0 / 0	7
	9121	P1951E No Palindromes brute force constructive algorithms divide and conquer greedy hashing implementation math strings *2000	0 / 0	7
	9088	P1956D Nene and the Mex Operator bitmasks brute force constructive algorithms divide and conquer dp greedy implementation math *2000	0 / 0	7
	9244	P1958F Narrow Paths special problem combinatorics 2000	0 / 0	7
	9226	P1970E2 Trails (Medium) dp matrices *2000	0 / 0	7
	9338	P1976D Invertible Bracket Sequences binary search combinatorics data structures divide and conquer implementation two pointers *2000	0 / 0	7
	9326	P1978E Computing Machine brute force data structures dp greedy implementation *2000	0 / 0	7
	9287	P1984D "a" String Problem brute force hashing implementation math string suffix structures strings *2000	0 / 0	7
	9261	P1987E Wonderful Tree! brute force data structures dfs and similar dsu greedy trees *2000	0 / 0	7
	9381	P1988D The Omnipotent Monster Killer brute force dfs and similar dp trees *2000	0 / 0	7
	9350	P1992G Ultra-Meow combinatorics dp math number theory *2000	0 / 0	7

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