binary search - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	8174	P1777F Comfortably Numb binary search bitmasks data structures divide and conquer dsu strings trees two pointers	0 / 0	(None)
	8223	P1780D Bit Guessing Game binary search bitmasks constructive algorithms interactive	0 / 0	(None)
	8222	P1780E Josuke and Complete Graph binary search brute force data structures math number theory	0 / 0	(None)
	8220	P1780G Delicious Dessert binary search dsu hashing math number theory string suffix structures	0 / 0	(None)
	8169	P1781E Rectangle Shrinking binary search brute force data structures greedy implementation two pointers *2300	0 / 0	8
	8102	P1783C Yet Another Tournament binary search greedy sortings	0 / 0	(None)
	8217	P1784C Monsters (hard version) binary search data structures greedy	0 / 0	(None)
	8203	P1787H Codeforces Scoreboard binary search data structures dp geometry *3300	0 / 0	10
	8247	P1788D Moving Dots binary search brute force combinatorics math two pointers *2000	0 / 0	7
	8189	P1791F Range Update Point Query binary search brute force data structures *1500	0 / 0	5
	8187	P1791G2 Teleporters (Hard Version) binary search greedy sortings *1900	0 / 0	6
	8184	P1792C Min Max Sort binary search brute force greedy math two pointers *1500	0 / 0	5
	8183	P1792D Fixed Prefix Permutations binary search bitmasks data structures hashing math sortings *1700	0 / 0	5
	8241	P1793D Moscow Gorillas binary search dp greedy implementation math two pointers *1800	0 / 0	6
	8240	P1793E Velepin and Marketing binary search data structures dp greedy sortings two pointers *2600	0 / 0	10
	8277	P1794C Scoring Subsequences binary search greedy math two pointers	0 / 0	(None)
	8236	P1795C Tea Tasting binary search data structures implementation *1500	0 / 0	5
	8234	P1795E Explosions? binary search data structures dp greedy math *2200	0 / 0	8
	8233	P1795F Blocking Chips binary search constructive algorithms dfs and similar greedy trees *2400	0 / 0	9
	8272	P1796C Maximum Set binary search dp math *1600	0 / 0	5

Pick a problem randomly based on the current filter.