sortings - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5762	P1477C Nezzar and Nice Beatmap constructive algorithms geometry greedy math sortings *2200	0 / 0	(None)
	5783	P1486B Eastern Exhibition binary search geometry shortest paths sortings *1500	0 / 0	(None)
	5789	P1487E Cheap Dinner brute force data structures graphs greedy implementation sortings two pointers *2000	0 / 0	(None)
	5817	P1495A Diamond Miner geometry greedy math sortings *1200	0 / 0	(None)
	5822	P1497A Meximization brute force data structures greedy sortings *800	0 / 0	(None)
	5829	P1498E Two Houses brute force graphs greedy interactive sortings *2200	0 / 0	(None)
	5840	P1501B Napoleon Cake dp implementation sortings *900	3 / 18	9
	5842	P1503C Travelling Salesman Problem binary search data structures dp greedy shortest paths sortings two pointers *2200	0 / 0	(None)
	5856	P1508D Swap Pass constructive algorithms geometry sortings *3000	0 / 0	(None)
	5857	P1508E Tree Calendar brute force constructive algorithms data structures dfs and similar sortings trees *3100	0 / 0	(None)
	5878	P1513D GCD and MST constructive algorithms dsu graphs greedy number theory sortings *2000	0 / 0	(None)
	5879	P1513F Swapping Problem brute force constructive algorithms data structures sortings *2500	0 / 0	(None)
	5882	P1514E Baby Ehab's Hyper Apartment binary search graphs interactive sortings two pointers *2700	0 / 0	(None)
	5884	P1515D Phoenix and Socks greedy sortings two pointers *1500	0 / 0	(None)
	5886	P1515H Phoenix and Bits bitmasks brute force data structures sortings *3500	0 / 0	(None)
	5891	P1517B Morning Jogging constructive algorithms greedy sortings *1200	0 / 0	(None)
	5897	P1519C Berland Regional brute force data structures greedy number theory sortings *1400	0 / 0	(None)
	5915	P1525C Robot Collisions data structures greedy implementation sortings *2000	0 / 0	(None)
	5931	P1529B Sifid and Strange Subsequences greedy math sortings *1100	0 / 0	(None)
	5933	P1530C Pursuit binary search brute force greedy sortings *1200	0 / 0	(None)

Pick a problem randomly based on the current filter.