constructive algorithms - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5962	P1536B Prinzessin der Verurteilung brute force constructive algorithms strings *1200	0 / 0	(None)
	5966	P1537B Bad Boy constructive algorithms greedy math *900	0 / 0	(None)
	5969	P1537F Figure Fixing constructive algorithms dfs and similar dsu graphs greedy math *2200	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)
	5988	P1543D2 RPD and Rap Sheet (Hard Version) brute force constructive algorithms interactive math *2200	0 / 0	(None)
	5990	P1545C AquaMoon and Permutations 2-sat brute force combinatorics constructive algorithms graph matchings graphs *2800	0 / 0	(None)
	6008	P1551B2 Wonderful Coloring - 2 binary search constructive algorithms data structures greedy *1400	0 / 0	(None)
	6009	P1551D1 Domino (easy version) constructive algorithms math *1700	0 / 0	(None)
	6012	P1552C Maximize the Intersections combinatorics constructive algorithms geometry greedy sortings *1800	0 / 0	(None)
	6013	P1552D Array Differentiation bitmasks brute force constructive algorithms dfs and similar dp graphs math *1800	0 / 0	(None)
	6025	P1555D Say No to Palindromes brute force constructive algorithms dp strings *1600	0 / 0	(None)
	6029	P1556D Take a Guess bitmasks constructive algorithms interactive math *1800	0 / 0	(None)
	6036	P1558C Bottom-Tier Reversals constructive algorithms greedy *2000	0 / 0	(None)
	6040	P1559D1 Mocha and Diana (Easy Version) brute force constructive algorithms dsu graphs greedy trees *1400	0 / 0	(None)
	6045	P1560F2 Nearest Beautiful Number (hard version) bitmasks brute force constructive algorithms dfs and similar dp greedy *2100	0 / 0	(None)
	6048	P1562C Rings constructive algorithms math *1500	0 / 0	(None)
	6052	P1566B MIN-MEX Cut bitmasks constructive algorithms dp greedy *800	0 / 0	(None)
	6054	P1566E Buds Re-hanging constructive algorithms dfs and similar dp greedy trees *2000	0 / 0	(None)
	6055	P1566G Four Vertices constructive algorithms data structures graphs greedy implementation shortest paths *3100	0 / 0	(None)

Pick a problem randomly based on the current filter.