binary search - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	10697	P1978B New Bakery binary search greedy math ternary search *800	0 / 0	3
	10690	P1979C Earning on Bets binary search combinatorics constructive algorithms number theory *1200	0 / 0	4
	10688	P1979E Manhattan Triangle binary search constructive algorithms data structures geometry implementation two pointers *2400	0 / 0	9
	10676	P1982C Boring Day binary search data structures dp greedy two pointers *1200	0 / 0	4
	10673	P1982F Sorting Problem Again binary search data structures sortings *2600	0 / 0	10
	10658	P1985F Final Boss binary search data structures *1500	0 / 0	5
	10648	P1986G1 Permutation Problem (Simple Version) binary search brute force combinatorics data structures math number theory *2200	0 / 0	8
	10751	P1988E Range Minimum Sum binary search brute force data structures divide and conquer implementation *2300	0 / 0	8
	10745	P1990E1 Catch the Mole(Easy Version) binary search data structures dfs and similar interactive trees *2500	0 / 0	9
	10744	P1990E2 Catch the Mole(Hard Version) binary search data structures dfs and similar divide and conquer interactive trees *2600	0 / 0	10
	10724	P1994C Hungry Games binary search dp two pointers *1600	0 / 0	5
	10717	P1995B1 Bouquet (Easy Version) binary search brute force greedy sortings two pointers *1100	0 / 0	3
	10716	P1995B2 Bouquet (Hard Version) binary search data structures greedy math sortings two pointers *1700	0 / 0	5
	10711	P1996A Legs binary search math ternary search	0 / 0	(None)
	10708	P1996D Fun binary search brute force combinatorics math number theory	0 / 0	(None)
	10706	P1996F Bomb binary search greedy math	0 / 0	(None)
	10701	P1997D Maximize the Root binary search dfs and similar dp greedy trees	0 / 0	(None)
	10700	P1997E Level Up binary search brute force data structures divide and conquer implementation	0 / 0	(None)

Pick a problem randomly based on the current filter.