greedy - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5969	P1537F Figure Fixing constructive algorithms dfs and similar dsu graphs greedy math *2200	0 / 0	(None)
	5970	P1538B Friends and Candies greedy math *800	0 / 0	(None)
	5973	P1538G Gift Set binary search greedy math ternary search *2100	0 / 0	(None)
	5974	P1539A Contest Start combinatorics geometry greedy math *1000	0 / 0	(None)
	5975	P1539C Stable Groups greedy sortings *1200	0 / 0	(None)
	5976	P1539E Game with Cards binary search constructive algorithms data structures dp greedy implementation *2500	0 / 0	(None)
	5977	P1540A Great Graphs constructive algorithms graphs greedy shortest paths sortings *1400	0 / 0	(None)
	5986	P1543B Customising the Track combinatorics greedy math *900	0 / 0	(None)
	5993	P1546A AquaMoon and Two Arrays brute force greedy *800	0 / 0	(None)
	5995	P1547C Pair Programming greedy two pointers *1100	0 / 0	(None)
	6001	P1548E Gregor and the Two Painters data structures divide and conquer graphs greedy math *3400	0 / 0	(None)
	6002	P1549B Gregor and the Pawn Game dfs and similar dp flows graph matchings graphs greedy implementation *800	0 / 0	(None)
	6003	P1550A Find The Array greedy math *800	0 / 0	(None)
	6004	P1550C Manhattan Subarrays brute force geometry greedy implementation *1700	0 / 0	(None)
	6007	P1551B1 Wonderful Coloring - 1 greedy strings *800	0 / 0	(None)
	6008	P1551B2 Wonderful Coloring - 2 binary search constructive algorithms data structures greedy *1400	0 / 0	(None)
	6012	P1552C Maximize the Intersections combinatorics constructive algorithms geometry greedy sortings *1800	0 / 0	(None)
	6018	P1553D Backspace dp greedy strings two pointers *1500	0 / 0	(None)
	6021	P1554A Cherry greedy *800	0 / 0	(None)
	6022	P1554C Mikasa binary search bitmasks greedy implementation *1800	0 / 0	(None)

Pick a problem randomly based on the current filter.