binary search - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	8008	P1744C Traffic Light binary search implementation two pointers *1000	0 / 0	3
	7999	P1746E1 Joking (Easy Version) binary search constructive algorithms interactive ternary search *2500	0 / 0	9
	7996	P1746G Olympiad Training binary search data structures dp flows geometry implementation sortings *3500	0 / 0	10
	8055	P1747D Yet Another Problem binary search bitmasks constructive algorithms data structures *1900	0 / 0	6
	8021	P1749C Number Game binary search data structures games greedy implementation	0 / 0	(None)
	8049	P1750E Bracket Cost binary search data structures divide and conquer dp greedy strings	0 / 0	(None)
	8027	P1753E N Machines binary search brute force greedy *3300	0 / 0	10
	8074	P1759F All Possible Digits binary search data structures greedy math number theory *1800	0 / 0	6
	8073	P1759G Restore the Permutation binary search constructive algorithms data structures greedy math *1900	0 / 0	6
	8161	P1765H Hospital Queue binary search graphs greedy implementation *2200	0 / 0	8
	8150	P1766E Decomposition binary search brute force data structures divide and conquer dp two pointers *2300	0 / 0	8
	8127	P1771B Hossam and Friends binary search constructive algorithms dp two pointers *1400	0 / 0	4
	8123	P1771F Hossam and Range Minimum Query binary search bitmasks data structures hashing probabilities strings trees *2500	0 / 0	9
	8121	P1773B BinCoin binary search divide and conquer hashing implementation probabilities trees *2200	0 / 0	8
	8093	P1773H Hot and Cold binary search interactive *2600	0 / 0	10
	8082	P1774F2 Magician and Pigs (Hard Version) binary search brute force data structures implementation *2700	0 / 0	10
	8116	P1775C Interesting Sequence binary search bitmasks	0 / 0	(None)
	8113	P1775F Laboratory on Pluto binary search combinatorics constructive algorithms dp greedy math	0 / 0	(None)
	8177	P1777C Quiz Master binary search math number theory sortings two pointers	0 / 0	(None)
	8175	P1777E Edge Reverse binary search dfs and similar graphs implementation sortings trees	0 / 0	(None)

Pick a problem randomly based on the current filter.