greedy - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	811	P1495E Qingshan and Daniel brute force data structures greedy implementation *3200	0 / 0	(None)
	809	P1496A Split it! brute force constructive algorithms greedy strings *900	0 / 0	(None)
	807	P1497A Meximization brute force data structures greedy sortings *800	0 / 0	(None)
	806	P1497B M-arrays constructive algorithms greedy math *1200	0 / 0	(None)
	802	P1497E1 Square-free division (easy version) data structures dp greedy math number theory two pointers *1700	0 / 0	(None)
	801	P1497E2 Square-free division (hard version) data structures dp greedy math number theory two pointers *2500	0 / 0	(None)
	799	P1498B Box Fitting binary search bitmasks data structures greedy *1300	0 / 0	(None)
	796	P1498E Two Houses brute force graphs greedy interactive sortings *2200	0 / 0	(None)
	793	P1499B Binary Removals brute force dp greedy implementation *1000	0 / 0	(None)
	792	P1499C Minimum Grid Path brute force data structures greedy math *1500	0 / 0	(None)
	785	P1500C Matrix Sorting bitmasks brute force constructive algorithms greedy two pointers *2600	0 / 0	(None)
	779	P1503A Balance the Bits constructive algorithms greedy *1600	0 / 0	(None)
	777	P1503C Travelling Salesman Problem binary search data structures dp greedy shortest paths sortings two pointers *2200	0 / 0	(None)
	776	P1503D Flip the Cards 2-sat constructive algorithms data structures greedy sortings two pointers *2600	0 / 0	(None)
	772	P1504B Flip the Bits constructive algorithms greedy implementation math *1200	0 / 0	(None)
	767	P1505E Cakewalk special problem greedy implementation shortest paths 1800	0 / 0	(None)
	761	P1506B Partial Replacement greedy implementation *1100	0 / 0	(None)
	759	P1506D Epic Transformation constructive algorithms data structures greedy *1400	0 / 0	(None)
	756	P1506G Maximize the Remaining String brute force data structures dp greedy strings *2000	0 / 0	(None)
	755	P1508A Binary Literature constructive algorithms greedy implementation strings two pointers *1900	0 / 0	(None)

Pick a problem randomly based on the current filter.