binary search - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	9280	P1976C Job Interview binary search dp greedy implementation two pointers	0 / 0	(None)
	9279	P1976D Invertible Bracket Sequences binary search combinatorics data structures divide and conquer implementation two pointers	0 / 0	(None)
	9378	P1978B New Bakery binary search greedy math ternary search *800	0 / 0	3
	9371	P1979C Earning on Bets binary search combinatorics constructive algorithms number theory *1200	0 / 0	4
	9369	P1979E Manhattan Triangle binary search constructive algorithms data structures geometry implementation two pointers *2400	0 / 0	9
	9365	P1982C Boring Day binary search data structures dp greedy two pointers *1200	0 / 0	4
	9362	P1982F Sorting Problem Again binary search data structures sortings *2600	0 / 0	10
	9359	P1983C Have Your Cake and Eat It Too binary search brute force dp greedy implementation	0 / 0	(None)
	9356	P1983F array-value binary search bitmasks data structures greedy two pointers	0 / 0	(None)
	9340	P1985F Final Boss binary search data structures *1500	0 / 0	5
	9330	P1986G1 Permutation Problem (Simple Version) binary search brute force combinatorics data structures math number theory *2200	0 / 0	8
	9388	P1988E Range Minimum Sum binary search brute force data structures implementation	0 / 0	(None)
	9403	P1990E1 Catch the Mole(Easy Version) binary search constructive algorithms data structures interactive trees	0 / 0	(None)
	9402	P1990E2 Catch the Mole(Hard Version) binary search data structures dfs and similar implementation interactive trees	0 / 0	(None)
	9398	P1994C Hungry Games binary search dp two pointers	0 / 0	(None)
	9413	P1995B1 Bouquet (Easy Version) binary search brute force greedy sortings two pointers	0 / 0	(None)
	9412	P1995B2 Bouquet (Hard Version) binary search data structures greedy math sortings two pointers	0 / 0	(None)

Pick a problem randomly based on the current filter.