Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	878	P1485A Add and Divide brute force greedy math number theory *1000	0 / 0	(None)
	877	P1485B Replace and Keep Sorted dp implementation math *1200	0 / 0	(None)
	876	P1485C Floor and Mod binary search brute force math number theory *1700	0 / 0	(None)
	875	P1485D Multiples and Power Differences constructive algorithms graphs math number theory *2200	0 / 0	(None)
	874	P1485E Move and Swap dfs and similar dp greedy trees *2500	0 / 0	(None)
	873	P1485F Copy or Prefix Sum combinatorics data structures dp sortings *2400	0 / 0	(None)
	872	P1486A Shifting Stacks greedy implementation *900	0 / 0	(None)
	871	P1486B Eastern Exhibition binary search geometry shortest paths sortings *1500	0 / 0	(None)
	870	P1486C1 Guessing the Greatest (easy version) binary search interactive *1600	0 / 0	(None)
	869	P1486C2 Guessing the Greatest (hard version) binary search interactive *1900	0 / 0	(None)
	868	P1486D Max Median binary search data structures dp *2100	0 / 0	(None)
	867	P1486E Paired Payment binary search brute force constructive algorithms dp flows graphs shortest paths *2200	0 / 0	(None)
	866	P1486F Pairs of Paths combinatorics data structures dfs and similar dp trees *2600	0 / 0	(None)
	865	P1487A Arena implementation sortings *800	0 / 0	(None)
	864	P1487B Cat Cycle math number theory *1200	0 / 0	(None)
	863	P1487C Minimum Ties brute force constructive algorithms dfs and similar graphs greedy implementation math *1500	0 / 0	(None)
	862	P1487D Pythagorean Triples binary search brute force math number theory *1500	0 / 0	(None)
	861	P1487E Cheap Dinner brute force data structures graphs greedy implementation sortings two pointers *2000	0 / 0	(None)
	860	P1487F Ones dp greedy shortest paths *2900	0 / 0	(None)
	859	P1487G String Counting combinatorics dp fft math *2700	0 / 0	(None)

Pick a problem randomly based on the current filter.