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

ID	题目显示标签隐藏标签	AC / 尝试	难度
8240	P1859E Maximum Monogonosity brute force dp math *2500	0 / 0	9
8480	P1903D2 Maximum And Queries (hard version) bitmasks divide and conquer dp greedy *2500	0 / 0	9
8478	P1903F Babysitting 2-sat binary search data structures graphs trees *2500	0 / 0	9
8460	P1906K Deck-Building Game divide and conquer math *2500	0 / 0	9
8459	P1906L Palindromic Parentheses constructive algorithms *2500	0 / 0	9
8598	P1922F Replace on Segment dp graph matchings *2500	0 / 0	9
8725	P1945G Cook and Porridge binary search constructive algorithms data structures implementation *2500	0 / 0	9
8718	P1946F Nobody is needed 2-sat data structures dfs and similar dp *2500	0 / 0	9
8712	P1948F Rare Coins combinatorics math probabilities *2500	0 / 0	9
8687	P1951F Inversion Composition constructive algorithms data structures greedy *2500	0 / 0	9
8655	P1956E1 Nene vs brute force implementation math *2500	0 / 0	9
8817	P1983F array-value binary search bitmasks data structures greedy two pointers *2500	0 / 0	9
8809	P1984F Reconstruction brute force dp math *2500	0 / 0	9
8790	P1986G2 Permutation Problem (Hard Version) brute force data structures hashing math number theory *2500	0 / 0	9
8784	P1987F1 Interesting Problem (Easy Version) dp *2500	0 / 0	9

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

分类