题库 - *2300 - 南阳理工学院OJ

ID	题目显示标签隐藏标签	AC / 尝试	难度
8558	P1929E Sasha and the Happy Tree Cutting bitmasks brute force dfs and similar dp graphs greedy math trees *2300	0 / 0	8
8557	P1929F Sasha and the Wedding Binary Search Tree brute force combinatorics data structures dfs and similar math trees *2300	0 / 0	8
8745	P1942E Farm Game combinatorics games *2300	0 / 0	8
8739	P1943C Tree Compass constructive algorithms dfs and similar greedy trees *2300	0 / 0	8
8660	P1955H The Most Reckless Defense bitmasks brute force constructive algorithms dp flows graph matchings shortest paths *2300	0 / 0	8
8835	P1980G Yasya and the Mysterious Tree bitmasks data structures dfs and similar graphs greedy strings trees *2300	0 / 0	8
8824	P1982E Number of k-good subarrays bitmasks brute force combinatorics divide and conquer dp math meet-in-the-middle *2300	0 / 0	8
8818	P1983E I Love Balls combinatorics math probabilities *2300	0 / 0	8
8775	P1988E Range Minimum Sum binary search brute force data structures divide and conquer implementation *2300	0 / 0	8
8769	P1989E Distance to Different combinatorics dp math *2300	0 / 0	8

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

分类