*2000 - 题库 - bzoj.org

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	8662	P1841D Pairs of Segments data structures greedy sortings two pointers *2000	0 / 0	7
	8808	P1857G Counting Graphs combinatorics divide and conquer dsu graphs greedy sortings trees *2000	0 / 0	7
	9067	P1893C Freedom of Choice brute force greedy implementation *2000	0 / 0	7
	9037	P1900D Small GCD bitmasks brute force dp math number theory *2000	0 / 0	7
	9017	P1903E Geo Game greedy interactive math *2000	0 / 0	7
	9125	P1905D Cyclic MEX data structures implementation math two pointers *2000	0 / 0	7
	9003	P1906F Maximize The Value data structures sortings *2000	0 / 0	7
	9107	P1910F Build Railway Stations special problem greedy trees 2000	0 / 0	7
	9101	P1912B Blueprint for Seating combinatorics divide and conquer math *2000	0 / 0	7
	9190	P1931G One-Dimensional Puzzle combinatorics math number theory *2000	0 / 0	7
	9305	P1941G Rudolf and Subway constructive algorithms dfs and similar graphs shortest paths *2000	0 / 0	7
	9362	P1951D Buying Jewels constructive algorithms greedy math *2000	0 / 0	7
	9361	P1951E No Palindromes brute force constructive algorithms divide and conquer greedy hashing implementation math strings *2000	0 / 0	7
	9329	P1956D Nene and the Mex Operator bitmasks brute force constructive algorithms divide and conquer dp greedy implementation math *2000	0 / 0	7
	9465	P1958F Narrow Paths special problem combinatorics 2000	0 / 0	7
	9417	P1970E2 Trails (Medium) dp matrices *2000	0 / 0	7
	9491	P1974G Money Buys Less Happiness Now data structures greedy sortings *2000	0 / 0	7
	9514	P1984D "a" String Problem brute force implementation math string suffix structures strings *2000	0 / 0	7
	9559	P1987E Wonderful Tree! brute force dfs and similar dp greedy trees *2000	0 / 0	7
	9632	P1988D The Omnipotent Monster Killer brute force dfs and similar dp trees *2000	0 / 0	7
	9607	P1992G Ultra-Meow combinatorics dp math *2000	0 / 0	7
	9602	P1994E Wooden Game bitmasks greedy math trees *2000	0 / 0	7

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