sortings - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	927	P1474C Array Destruction brute force constructive algorithms data structures greedy implementation sortings *1700	0 / 0	(None)
	920	P1475D Cleaning the Phone binary search dp sortings two pointers *1800	0 / 0	(None)
	919	P1475E Advertising Agency combinatorics math sortings *1600	0 / 0	(None)
	917	P1475G Strange Beauty dp math number theory sortings *1900	0 / 0	(None)
	912	P1476E Pattern Matching bitmasks data structures dfs and similar graphs hashing sortings strings *2300	0 / 0	(None)
	910	P1476G Minimum Difference data structures hashing sortings two pointers *3100	0 / 0	(None)
	907	P1477C Nezzar and Nice Beatmap constructive algorithms geometry greedy math sortings *2200	0 / 0	(None)
	901	P1478C Nezzar and Symmetric Array implementation math sortings *1700	0 / 0	(None)
	893	P1480B The Great Hero greedy implementation sortings *900	0 / 0	(None)
	873	P1485F Copy or Prefix Sum combinatorics data structures dp sortings *2400	0 / 0	(None)
	871	P1486B Eastern Exhibition binary search geometry shortest paths sortings *1500	0 / 0	(None)
	865	P1487A Arena implementation sortings *800	0 / 0	(None)
	861	P1487E Cheap Dinner brute force data structures graphs greedy implementation sortings two pointers *2000	0 / 0	(None)
	843	P1490F Equalize the Array binary search data structures greedy math sortings *1500	0 / 0	(None)
	824	P1493D GCD of an Array brute force data structures hashing implementation math number theory sortings two pointers *2100	0 / 0	(None)
	818	P1494D Dogeforces constructive algorithms data structures dfs and similar divide and conquer dsu greedy sortings trees *2300	0 / 0	(None)
	815	P1495A Diamond Miner geometry greedy math sortings *1200	0 / 0	(None)
	807	P1497A Meximization brute force data structures greedy sortings *800	0 / 0	(None)
	796	P1498E Two Houses brute force graphs greedy interactive sortings *2200	0 / 0	(None)
	784	P1500D Tiles for Bathroom data structures sortings two pointers *2900	0 / 0	(None)

Pick a problem randomly based on the current filter.