greedy - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	8049	P1750E Bracket Cost binary search data structures divide and conquer dp greedy strings	0 / 0	(None)
	8028	P1753D The Beach graphs greedy implementation shortest paths *2400	0 / 0	9
	8027	P1753E N Machines binary search brute force greedy *3300	0 / 0	10
	8024	P1754B Kevin and Permutation constructive algorithms greedy math *800	0 / 0	3
	8077	P1759C Thermostat greedy math shortest paths *1100	0 / 0	3
	8074	P1759F All Possible Digits binary search data structures greedy math number theory *1800	0 / 0	6
	8073	P1759G Restore the Permutation binary search constructive algorithms data structures greedy math *1900	0 / 0	6
	8071	P1761B Elimination of a Ring constructive algorithms greedy implementation	0 / 0	(None)
	8070	P1761C Set Construction constructive algorithms dfs and similar graphs greedy	0 / 0	(None)
	8068	P1761E Make It Connected brute force constructive algorithms dsu graphs greedy	0 / 0	(None)
	8161	P1765H Hospital Queue binary search graphs greedy implementation *2200	0 / 0	8
	8158	P1765K Torus Path greedy math *1500	0 / 0	5
	8155	P1765N Number Reduction greedy *1500	0 / 0	5
	8147	P1767B Block Towers data structures greedy sortings *800	0 / 0	3
	8145	P1767D Playoff combinatorics constructive algorithms dp greedy math *1500	0 / 0	5
	8142	P1768A Greatest Convex greedy math number theory	0 / 0	(None)
	8141	P1768B Quick Sort greedy math	0 / 0	(None)
	8140	P1768C Elemental Decompress constructive algorithms greedy implementation sortings	0 / 0	(None)
	8139	P1768D Lucky Permutation constructive algorithms dfs and similar graphs greedy	0 / 0	(None)
	8137	P1768F Wonderful Jump dp greedy	0 / 0	(None)

Pick a problem randomly based on the current filter.