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

ID	题目显示标签隐藏标签	AC / 尝试	难度
8147	P1840F Railguns brute force dfs and similar dp graphs *2200	0 / 0	8
8146	P1840G1 In Search of Truth (Easy Version) constructive algorithms interactive math meet-in-the-middle probabilities *2200	0 / 0	8
8140	P1841E Fill the Matrix data structures greedy math *2200	0 / 0	8
8247	P1858D Trees and Segments brute force data structures dp greedy two pointers *2200	0 / 0	8
8446	P1898E Sofia and Strings data structures greedy sortings strings two pointers *2200	0 / 0	8
8492	P1901E Compressed Tree dfs and similar dp graphs greedy sortings trees *2200	0 / 0	8
8463	P1906H Twin Friends combinatorics dp *2200	0 / 0	8
8451	P1907G Lights brute force constructive algorithms dfs and similar graphs greedy implementation *2200	0 / 0	(无)
8604	P1921G Mischievous Shooter brute force data structures divide and conquer dp implementation *2200	0 / 0	8
8719	P1946E Girl Permutation combinatorics dp math number theory *2200	0 / 0	8
8669	P1954E Chain Reaction binary search data structures dsu greedy implementation math number theory *2200	0 / 0	8
8798	P1985H2 Maximize the Largest Component (Hard Version) data structures dfs and similar dp dsu implementation *2200	0 / 0	8
8791	P1986G1 Permutation Problem (Simple Version) binary search brute force combinatorics data structures math number theory *2200	0 / 0	8

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

分类