binary search - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1555	P1354C2 Not So Simple Polygon Embedding binary search brute force geometry math *2000	0 / 0	(None)
	1554	P1354D Multiset binary search data structures *1900	0 / 0	(None)
	1551	P1354G Find a Gift binary search interactive probabilities *2600	0 / 0	(None)
	1548	P1355C Count Triangles binary search implementation math two pointers *1800	0 / 0	(None)
	1546	P1355E Restorer Distance binary search greedy math sortings ternary search *2100	0 / 0	(None)
	1513	P1358D The Best Vacation binary search brute force greedy implementation two pointers *1900	0 / 0	(None)
	1511	P1358F Tasty Cookie binary search constructive algorithms greedy implementation *2700	0 / 0	(None)
	1508	P1359C Mixing Water binary search math *1700	0 / 0	(None)
	1505	P1359F RC Kaboom Show binary search brute force data structures geometry math *2900	0 / 0	(None)
	1497	P1360H Binary Median binary search bitmasks brute force constructive algorithms *2100	0 / 0	(None)
	1494	P1361C Johnny and Megan's Necklace binary search bitmasks constructive algorithms dfs and similar dsu graphs *2500	0 / 0	(None)
	1484	P1363D Guess The Maximums binary search implementation interactive math *2100	0 / 0	(None)
	1469	P1366A Shovels and Swords binary search greedy math *1100	0 / 0	(None)
	1465	P1366E Two Arrays binary search brute force combinatorics constructive algorithms dp two pointers *2100	0 / 0	(None)
	1464	P1366F Jog Around The Graph binary search dp geometry graphs *2700	0 / 0	(None)
	1456	P1367F2 Flying Sort (Hard Version) binary search data structures dp greedy sortings two pointers *2400	0 / 0	(None)
	1437	P1370D Odd-Even Subsequence binary search dp dsu greedy implementation *2000	0 / 0	(None)
	1436	P1370E Binary Subsequence Rotation binary search constructive algorithms data structures greedy *2100	0 / 0	(None)
	1435	P1370F1 The Hidden Pair (Easy Version) binary search dfs and similar graphs interactive shortest paths trees *2400	0 / 0	(None)
	1434	P1370F2 The Hidden Pair (Hard Version) binary search dfs and similar graphs interactive shortest paths trees *2700	0 / 0	(None)

Pick a problem randomly based on the current filter.