题库 - *2000 - HydroOJ

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	7490	P1610D Not Quite Lee combinatorics dp math number theory *2000	0 / 0	7
	7580	P1616D Keep the Average High dp greedy math *2000	0 / 0	7
	7700	P1646D Weight the Tree constructive algorithms dfs and similar dp implementation trees *2000	0 / 0	7
	7809	P1672F1 Array Shuffling constructive algorithms graphs greedy *2000	0 / 0	(无)
	7934	P1685B Linguistics greedy implementation strings *2000	0 / 0	(无)
	7951	P1690G Count the Trains binary search data structures sortings *2000	1 / 5	10
	8000	P1696E Placing Jinas combinatorics math *2000	0 / 0	(无)
	8023	P1702G2 Passable Paths (hard version) dfs and similar trees *2000	0 / 0	7
	8090	P1716C Robot in a Hallway data structures dp greedy implementation *2000	0 / 0	7
	8089	P1716D Chip Move dp math *2000	0 / 0	7
	8460	P1731E Graph Cost dp greedy math number theory *2000	1 / 3	7
	8255	P1744F MEX vs MED brute force math two pointers *2000	0 / 0	7
	8593	P1796D Maximum Subarray data structures divide and conquer dp greedy math two pointers *2000	0 / 0	7
	8699	P1815B Sum Graph brute force constructive algorithms graphs implementation interactive shortest paths trees *2000	0 / 0	7
	9147	P1893C Freedom of Choice brute force greedy implementation *2000	1 / 1	7
	9205	P1906F Maximize The Value data structures sortings *2000	0 / 0	7
	9233	P1910F Build Railway Stations special problem greedy trees 2000	0 / 0	7
	9227	P1912B Blueprint for Seating combinatorics divide and conquer fft math *2000	0 / 0	7
	9351	P1931G One-Dimensional Puzzle combinatorics math number theory *2000	1 / 1	7
	9595	P1956D Nene and the Mex Operator bitmasks brute force constructive algorithms divide and conquer dp greedy implementation math *2000	0 / 0	7

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