greedy - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	9055	P1926G Vlad and Trouble at MIT dfs and similar dp flows graphs greedy implementation trees	0 / 0	(None)
	9054	P1927A Make it White greedy strings *800	0 / 0	3
	9053	P1927B Following the String constructive algorithms greedy strings *900	0 / 0	3
	9052	P1927C Choose the Different Ones! brute force greedy math *1000	0 / 0	3
	9051	P1927D Find the Different Ones! binary search brute force data structures dp dsu greedy two pointers *1300	0 / 0	4
	9049	P1927F Microcycle data structures dfs and similar dsu graphs greedy implementation sortings trees *1900	0 / 0	6
	9048	P1927G Paint Charges data structures dp greedy math *2300	0 / 0	8
	9046	P1928B Equalize binary search greedy sortings two pointers *1200	0 / 0	4
	9044	P1928D Lonely Mountain Dungeons brute force data structures greedy math ternary search *1900	0 / 0	6
	9043	P1928E Modular Sequence brute force constructive algorithms dp graphs greedy math number theory *2300	0 / 0	8
	9041	P1929A Sasha and the Beautiful Array constructive algorithms greedy math sortings *800	0 / 0	3
	9040	P1929B Sasha and the Drawing constructive algorithms greedy math *800	0 / 0	3
	9039	P1929C Sasha and the Casino binary search brute force constructive algorithms games greedy math *1400	0 / 0	4
	9037	P1929E Sasha and the Happy Tree Cutting bitmasks brute force dfs and similar dp graphs greedy math trees *2300	0 / 0	8
	9035	P1930A Maximise The Score greedy sortings	0 / 0	(None)
	9033	P1930C Lexicographically Largest binary search constructive algorithms data structures greedy sortings	0 / 0	(None)
	9032	P1930D1 Sum over all Substrings (Easy Version) brute force dp greedy strings	0 / 0	(None)
	9031	P1930D2 Sum over all Substrings (Hard Version) bitmasks divide and conquer dp dsu greedy implementation strings	0 / 0	(None)
	9024	P1931B Make Equal greedy *800	0 / 0	3
	9023	P1931C Make Equal Again brute force greedy math *1000	0 / 0	3

Pick a problem randomly based on the current filter.