binary search - 题库 - HydroOJ

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	9661	P1976C Job Interview binary search implementation	0 / 0	(无)
	9660	P1976D Invertible Bracket Sequences binary search combinatorics data structures implementation two pointers	0 / 0	(无)
	9706	P1978B New Bakery binary search greedy math ternary search	0 / 0	(无)
	9681	P1979C Earning on Bets binary search combinatorics constructive algorithms number theory	0 / 0	(无)
	9679	P1979E Manhattan Triangle binary search constructive algorithms data structures geometry implementation two pointers	0 / 0	(无)
	9719	P1982C Boring Day binary search data structures dp greedy two pointers	0 / 0	(无)
	9716	P1982F Sorting Problem Again binary search data structures	0 / 0	(无)
	9742	P1983C Have Your Cake and Eat It Too binary search bitmasks brute force constructive algorithms dp greedy implementation	0 / 0	(无)
	9739	P1983F array-value binary search bitmasks data structures greedy two pointers	0 / 0	(无)
	9687	P1985F Final Boss binary search data structures	1 / 3	10
	9709	P1986G1 Permutation Problem (Simple Version) binary search brute force combinatorics data structures math number theory	0 / 0	(无)
	9753	P1988E Range Minimum Sum binary search brute force data structures implementation	0 / 0	(无)
	9768	P1990E1 Catch the Mole(Easy Version) binary search constructive algorithms data structures interactive trees	0 / 0	(无)
	9767	P1990E2 Catch the Mole(Hard Version) binary search data structures dfs and similar interactive trees	0 / 0	(无)
	9813	P1993D Med-imize binary search dp greedy	0 / 0	(无)
	9763	P1994C Hungry Games binary search dp two pointers	0 / 0	(无)
	9785	P1995B1 Bouquet (Easy Version) binary search brute force greedy sortings two pointers	0 / 0	(无)
	9784	P1995B2 Bouquet (Hard Version) binary search data structures greedy math sortings two pointers	0 / 0	(无)
	9774	P1996F Bomb binary search greedy math	0 / 0	(无)
	9790	P1997C Even Positions binary search constructive algorithms data structures greedy	0 / 0	(无)
	9789	P1997D Maximize the Root binary search dfs and similar dp greedy trees	0 / 0	(无)
	9788	P1997E Level Up binary search brute force data structures divide and conquer implementation	0 / 0	(无)
	9851	P1998C Perform Operations to Maximize Score binary search brute force constructive algorithms greedy implementation *1900	0 / 0	6
	9849	P1998E1 Eliminating Balls With Merging (Easy Version) binary search brute force data structures divide and conquer greedy *2200	0 / 0	8
	9848	P1998E2 Eliminating Balls With Merging (Hard Version) binary search brute force data structures divide and conquer greedy implementation *2500	0 / 0	9
	9803	P1999G1 Ruler (easy version) binary search interactive	0 / 0	(无)
	9802	P1999G2 Ruler (hard version) binary search interactive ternary search	0 / 0	(无)
	9841	P2000G Call During the Journey binary search brute force graphs greedy shortest paths *2100	0 / 0	7
	9840	P2000H Ksyusha and the Loaded Set binary search brute force data structures implementation *2200	0 / 0	8
	9837	P2001C Guess The Tree binary search brute force dfs and similar divide and conquer dsu greedy interactive trees *1500	0 / 0	5
	9829	P2002D2 DFS Checker (Hard Version) binary search data structures dfs and similar graphs hashing trees *2300	0 / 0	8
	9820	P2004D Colored Portals binary search brute force data structures graphs greedy implementation shortest paths *1600	0 / 0	5
	9818	P2004F Make a Palindrome binary search brute force data structures greedy math *2600	0 / 0	10
	9880	P2008C Longest Good Array binary search brute force math	0 / 0	(无)
	9876	P2008G Sakurako's Task binary search greedy math number theory	0 / 0	(无)
	9875	P2008H Sakurako's Test binary search brute force greedy math number theory	0 / 0	(无)
	9870	P2009E Klee's SUPER DUPER LARGE Array!!! binary search math ternary search	0 / 0	(无)
	9868	P2009G1 Yunli's Subarray Queries (easy version) binary search two pointers	0 / 0	(无)
	9867	P2009G2 Yunli's Subarray Queries (hard version) binary search data structures	0 / 0	(无)

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