binary search - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	867	P1486E Paired Payment binary search brute force constructive algorithms dp flows graphs shortest paths *2200	0 / 0	(None)
	862	P1487D Pythagorean Triples binary search brute force math number theory *1500	0 / 0	(None)
	856	P1488C Two Policemen special problem binary search brute force math 1900	0 / 0	(None)
	855	P1488D Problemsolving Marathon special problem binary search greedy 1900	0 / 0	(None)
	853	P1488F Dogecoin special problem special problem binary search data structures *2300	0 / 0	(None)
	846	P1490C Sum of Cubes binary search brute force brute force math *1100	0 / 0	(None)
	844	P1490E Accidental Victory binary search data structures greedy *1400	0 / 0	(None)
	843	P1490F Equalize the Array binary search data structures greedy math sortings *1500	0 / 0	(None)
	842	P1490G Old Floppy Drive binary search data structures math *1900	0 / 0	(None)
	836	P1491F Magnets binary search constructive algorithms interactive *2700	0 / 0	(None)
	830	P1492C Maximum width binary search data structures dp greedy two pointers *1500	0 / 0	(None)
	825	P1493C K-beautiful Strings binary search brute force constructive algorithms greedy strings *2000	0 / 0	(None)
	819	P1494C 1D Sokoban binary search dp greedy implementation two pointers *1900	0 / 0	(None)
	799	P1498B Box Fitting binary search bitmasks data structures greedy *1300	0 / 0	(None)
	786	P1500B Two chandeliers binary search brute force chinese remainder theorem math number theory *2200	0 / 0	(None)
	783	P1500E Subset Trick binary search data structures *3300	0 / 0	(None)
	777	P1503C Travelling Salesman Problem binary search data structures dp greedy shortest paths sortings two pointers *2200	0 / 0	(None)
	754	P1508B Almost Sorted binary search combinatorics constructive algorithms implementation *1800	0 / 0	(None)
	712	P1514D Cut and Stick binary search data structures greedy implementation sortings *2000	0 / 0	(None)
	711	P1514E Baby Ehab's Hyper Apartment binary search graphs interactive sortings two pointers *2700	0 / 0	(None)

Pick a problem randomly based on the current filter.