greedy - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	4978	P1225G To Make 1 bitmasks constructive algorithms dp greedy number theory *3100	0 / 0	(None)
	4981	P1227D2 Optimal Subsequences (Hard Version) data structures greedy *1800	0 / 0	(None)
	4988	P1230B Ania and Minimizing greedy implementation *1000	0 / 0	(None)
	4989	P1231C Increasing Matrix greedy *1100	0 / 0	(None)
	4995	P1236A Stones brute force greedy math *800	0 / 0	(None)
	4996	P1236C Labs constructive algorithms greedy implementation *1300	0 / 0	(None)
	4997	P1236D Alice and the Doll brute force data structures greedy implementation *2300	0 / 0	(None)
	5000	P1237C1 Balanced Removals (Easier) constructive algorithms geometry greedy *1700	0 / 0	(None)
	5004	P1237G Balanced Distribution data structures dp greedy *3500	0 / 0	(None)
	5006	P1238C Standard Free2play dp greedy math *1600	0 / 0	(None)
	5008	P1238G Adilbek and the Watering System data structures greedy sortings *2700	0 / 0	(None)
	5023	P1245B Restricted RPS constructive algorithms dp greedy *1200	0 / 0	(None)
	5025	P1245D Shichikuji and Power Grid dsu graphs greedy shortest paths trees *1900	0 / 0	(None)
	5028	P1248B Grow The Tree greedy math sortings *900	0 / 0	(None)
	5031	P1249C2 Good Numbers (hard version) binary search greedy math meet-in-the-middle *1500	0 / 0	(None)
	5032	P1249D1 Too Many Segments (easy version) greedy *1800	0 / 0	(None)
	5035	P1250B The Feast and the Bus brute force constructive algorithms greedy math *1800	0 / 0	(None)
	5039	P1250G Discarding Game dp greedy two pointers *2300	0 / 0	(None)
	5040	P1250I Show Must Go On binary search brute force greedy shortest paths *3100	0 / 0	(None)
	5041	P1250J The Parade binary search greedy *1800	0 / 0	(None)

Pick a problem randomly based on the current filter.