题库 - trees - 南阳理工学院OJ

ID	题目显示标签隐藏标签	AC / 尝试	难度
8781	P1987G2 Spinning Round (Hard Version) divide and conquer dp trees *3500	0 / 0	10
8776	P1988D The Omnipotent Monster Killer brute force dfs and similar dp trees *2000	0 / 0	7
8763	P1990E1 Catch the Mole(Easy Version) binary search constructive algorithms data structures dfs and similar interactive trees	0 / 0	(无)
8762	P1990E2 Catch the Mole(Hard Version) binary search data structures dfs and similar implementation interactive trees	0 / 0	(无)
8750	P1994D Funny Game constructive algorithms dsu graph matchings graphs greedy math number theory trees	0 / 0	(无)
8749	P1994E Wooden Game bitmasks greedy math trees	0 / 0	(无)
8748	P1994F Stardew Valley constructive algorithms dfs and similar dsu graphs trees	0 / 0	(无)

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

分类