greedy - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	452	P1559D1 Mocha and Diana (Easy Version) brute force constructive algorithms dsu graphs greedy trees *1400	0 / 0	(None)
	451	P1559D2 Mocha and Diana (Hard Version) brute force constructive algorithms dfs and similar dsu graphs greedy trees two pointers *2500	0 / 0	(None)
	446	P1560D Make a Power of Two greedy math strings *1300	0 / 0	(None)
	444	P1560F1 Nearest Beautiful Number (easy version) binary search bitmasks brute force constructive algorithms dfs and similar greedy *1900	0 / 0	(None)
	443	P1560F2 Nearest Beautiful Number (hard version) bitmasks brute force constructive algorithms dfs and similar dp greedy *2100	0 / 0	(None)
	441	P1561C Deep Down Below binary search greedy sortings *1300	0 / 0	(None)
	439	P1562A The Miracle and the Sleeper greedy math *800	0 / 0	(None)
	434	P1562E Rescue Niwen! dp greedy string suffix structures strings *2500	0 / 0	(None)
	432	P1566A Median Maximization binary search greedy math *800	0 / 0	(None)
	431	P1566B MIN-MEX Cut bitmasks constructive algorithms dp greedy *800	0 / 0	(None)
	430	P1566C MAX-MEX Cut bitmasks constructive algorithms dp greedy *1000	0 / 0	(None)
	429	P1566D1 Seating Arrangements (easy version) data structures greedy sortings *1100	0 / 0	(None)
	428	P1566D2 Seating Arrangements (hard version) data structures greedy implementation sortings two pointers *1600	0 / 0	(None)
	427	P1566E Buds Re-hanging constructive algorithms dfs and similar dp greedy trees *2000	0 / 0	(None)
	426	P1566F Points Movement data structures dp greedy implementation sortings *2600	0 / 0	(None)
	425	P1566G Four Vertices constructive algorithms data structures graphs greedy implementation shortest paths *3100	0 / 0	(None)
	422	P1567B MEXor Mixup bitmasks greedy *1000	0 / 0	(None)
	420	P1567D Expression Evaluation Error constructive algorithms greedy implementation math *2000	0 / 0	(None)
	407	P1571E Fix the String special problem bitmasks dp greedy 1700	0 / 0	(None)
	400	P1572B Xor of 3 brute force constructive algorithms greedy two pointers *2500	0 / 0	(None)

Pick a problem randomly based on the current filter.