binary search - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1248	P1408H Rainbow Triples binary search data structures flows greedy *3300	0 / 0	(None)
	1242	P1409E Two Platforms binary search dp sortings two pointers *1800	0 / 0	(None)
	1231	P1413C Perform Easily binary search brute force dp implementation sortings two pointers *1900	0 / 0	(None)
	1221	P1416A k-Amazing Numbers binary search data structures implementation two pointers *1500	0 / 0	(None)
	1217	P1416E Split binary search data structures dp greedy *3200	0 / 0	(None)
	1209	P1418E Expected Damage binary search combinatorics probabilities *2400	0 / 0	(None)
	1203	P1419D1 Sage's Birthday (easy version) binary search constructive algorithms greedy sortings *1000	0 / 0	(None)
	1202	P1419D2 Sage's Birthday (hard version) binary search brute force constructive algorithms greedy sortings two pointers *1500	0 / 0	(None)
	1200	P1419F Rain of Fire binary search data structures dfs and similar dsu graphs implementation *2800	0 / 0	(None)
	1181	P1423B Valuable Paper binary search flows graph matchings graphs *1900	0 / 0	(None)
	1172	P1423K Lonely Numbers binary search math number theory two pointers *1600	0 / 0	(None)
	1156	P1426C Increase and Copy binary search constructive algorithms math *1100	0 / 0	(None)
	1145	P1427H Prison Break binary search games geometry ternary search *3500	0 / 0	(None)
	1140	P1428E Carrots for Rabbits binary search data structures greedy math sortings *2200	0 / 0	(None)
	1139	P1428F Fruit Sequences binary search data structures divide and conquer dp two pointers *2400	0 / 0	(None)
	1136	P1428H Rotary Laser Lock binary search interactive *3500	0 / 0	(None)
	1132	P1430D String Deletion binary search data structures greedy two pointers *1700	0 / 0	(None)
	1123	P1431F Neural Network Problem special problem binary search greedy 2100	0 / 0	(None)
	1108	P1436C Binary Search binary search combinatorics *1500	0 / 0	(None)
	1107	P1436D Bandit in a City binary search dfs and similar graphs greedy trees *1900	0 / 0	(None)

Pick a problem randomly based on the current filter.