greedy - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3258	P1009D Relatively Prime Graph brute force constructive algorithms graphs greedy math *1700	0 / 0	(None)
	3255	P1009G Allowed Letters bitmasks flows graph matchings graphs greedy *2400	0 / 0	(None)
	3248	P1011A Stages greedy implementation sortings *900	0 / 0	(None)
	3239	P1013B And greedy *1200	0 / 0	(None)
	3235	P1015D Walking Between Houses constructive algorithms greedy *1600	0 / 0	(None)
	3234	P1015E1 Stars Drawing (Easy Edition) brute force dp greedy *1700	0 / 0	(None)
	3233	P1015E2 Stars Drawing (Hard Edition) binary search dp greedy *1900	0 / 0	(None)
	3231	P1016A Death Note greedy implementation math *900	0 / 0	(None)
	3222	P1017C The Phone Number constructive algorithms greedy *1600	0 / 0	(None)
	3216	P1019A Elections brute force greedy *1700	0 / 0	(None)
	3207	P1023C Bracket Subsequence greedy *1200	0 / 0	(None)
	3201	P1025B Weakened Common Divisor brute force greedy number theory *1600	0 / 0	(None)
	3193	P1027C Minimum Value Rectangle greedy *1600	0 / 0	(None)
	3185	P1028D Order book combinatorics data structures greedy *2100	0 / 0	(None)
	3179	P1029B Creating the Contest dp greedy math *1200	0 / 0	(None)
	3178	P1029C Maximal Intersection greedy math sortings *1600	0 / 0	(None)
	3176	P1029E Tree with Small Distances dp graphs greedy *2100	0 / 0	(None)
	3165	P1031C Cram Time greedy *1600	0 / 0	(None)
	3164	P1031D Minimum path greedy *1900	0 / 0	(None)
	3139	P1036D Vasya and Arrays greedy two pointers *1600	0 / 0	(None)

Pick a problem randomly based on the current filter.