binary search - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	4430	P1055E Segments on the Line binary search dp *2500	0 / 0	(None)
	4441	P1059D Nature Reserve binary search geometry ternary search *2200	0 / 0	(None)
	4443	P1060C Maximum Subrectangle binary search implementation two pointers *1600	0 / 0	(None)
	4465	P1066D Boxes Packing binary search implementation *1800	0 / 0	(None)
	4474	P1070E Getting Deals Done binary search data structures *2100	0 / 0	(None)
	4480	P1071E Rain Protection binary search geometry *3500	0 / 0	(None)
	4482	P1073D Berland Fair binary search brute force data structures greedy *1700	0 / 0	(None)
	4493	P1077D Cutting Out binary search sortings *1600	0 / 0	(None)
	4502	P1081E Missing Numbers binary search constructive algorithms greedy math number theory *1900	0 / 0	(None)
	4508	P1082E Increasing Frequency binary search dp greedy *2000	0 / 0	(None)
	4565	P1098C Construct a tree binary search constructive algorithms dfs and similar graphs greedy trees *2400	0 / 0	(None)
	4566	P1098E Fedya the Potter binary search implementation math number theory *3400	0 / 0	(None)
	4570	P1100C NN and the Optical Illusion binary search geometry math *1200	0 / 0	(None)
	4571	P1100E Andrew and Taxi binary search dfs and similar graphs *2200	0 / 0	(None)
	4575	P1101F Trucks and Cities binary search dp *2400	0 / 0	(None)
	4579	P1102F Elongated Matrix binary search bitmasks brute force dp graphs *2000	0 / 0	(None)
	4581	P1103B Game with modulo binary search constructive algorithms interactive *2000	0 / 0	(None)
	4595	P1107G Vasya and Maximum Profit binary search constructive algorithms data structures dp dsu *2400	0 / 0	(None)
	4600	P1108F MST Unification binary search dsu graphs greedy *2100	0 / 0	(None)
	4635	P1118D2 Coffee and Coursework (Hard Version) binary search greedy *1700	0 / 0	(None)

Pick a problem randomly based on the current filter.