binary search - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	397	P1572E Polygon binary search dp geometry *3000	0 / 0	(None)
	391	P1574C Slay the Dragon binary search greedy sortings ternary search *1300	0 / 0	(None)
	390	P1574D The Strongest Build binary search brute force data structures dfs and similar graphs greedy hashing implementation *2000	0 / 0	(None)
	386	P1575B Building an Amusement Park binary search geometry *2300	0 / 0	(None)
	378	P1575J Jeopardy of Dropped Balls binary search brute force dsu implementation *1500	0 / 0	(None)
	362	P1578L Labyrinth binary search dsu greedy *2400	0 / 0	(None)
	340	P1582E Pchelyonok and Segments binary search data structures dp greedy math *2000	0 / 0	(None)
	338	P1582F2 Korney Korneevich and XOR (hard version) binary search brute force dp greedy two pointers *2400	0 / 0	(None)
	325	P1584D Guess the Permutation binary search combinatorics interactive math *2000	0 / 0	(None)
	324	P1584E Game with Stones binary search data structures games greedy *2300	0 / 0	(None)
	313	P1588F Jumping Through the Array binary search data structures graphs two pointers *3500	0 / 0	(None)
	312	P1592A Gamer Hemose binary search greedy math sortings *800	0 / 0	(None)
	309	P1592D Hemose in ICPC ? binary search dfs and similar implementation interactive math number theory trees *2300	0 / 0	(None)
	303	P1593C Save More Mice binary search greedy greedy *1000	0 / 0	(None)
	285	P1598F RBS binary search bitmasks brute force data structures dp *2400	0 / 0	(None)
	265	P1601F Two Sorts binary search dfs and similar math meet-in-the-middle *3400	0 / 0	(None)
	250	P1605E Array Equalizer binary search greedy implementation math number theory sortings two pointers *2400	0 / 0	(None)
	230	P1608E The Cells on the Paper binary search implementation sortings *2800	0 / 0	(None)
	228	P1608G Alphabetic Tree binary search data structures dfs and similar hashing string suffix structures strings trees *3500	0 / 0	(None)
	225	P1609C Complex Market Analysis binary search dp implementation number theory schedules two pointers *1400	0 / 0	(None)

Pick a problem randomly based on the current filter.