binary search - 题库 - 达芬奇编程

ID	题目显示标签隐藏标签	AC / 尝试	难度
9494	P1975C Chamo and Mocha's Array binary search brute force greedy *1200	0 / 0	4
9492	P1975E Chain Queries binary search data structures dfs and similar implementation trees *2100	0 / 0	7
9485	P1976C Job Interview binary search dp greedy implementation two pointers *1600	0 / 0	5
9484	P1976D Invertible Bracket Sequences binary search combinatorics data structures divide and conquer implementation two pointers *2000	0 / 0	7
9475	P1978B New Bakery binary search greedy math ternary search *800	0 / 0	3
9468	P1979C Earning on Bets binary search combinatorics constructive algorithms number theory *1200	0 / 0	4
9466	P1979E Manhattan Triangle binary search constructive algorithms data structures geometry implementation two pointers *2400	0 / 0	9
9448	P1982C Boring Day binary search data structures dp greedy two pointers	0 / 0	(无)
9445	P1982F Sorting Problem Again binary search data structures	0 / 0	(无)
9430	P1985F Final Boss binary search data structures *1500	1 / 1	5
9420	P1986G1 Permutation Problem (Simple Version) binary search brute force combinatorics data structures math number theory	0 / 0	(无)

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

分类