greedy - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	4766	P1165E Two Arrays and Sum of Functions greedy math sortings *1600	0 / 0	(None)
	4767	P1165F2 Microtransactions (hard version) binary search greedy implementation *2000	0 / 0	(None)
	4768	P1166A Silent Classroom combinatorics greedy *900	3 / 6	10
	4771	P1167A Telephone Number brute force greedy strings *800	0 / 0	(None)
	4773	P1167D Bicolored RBS constructive algorithms greedy *1500	0 / 0	(None)
	4775	P1168A Increasing by Modulo binary search greedy *1700	0 / 0	(None)
	4784	P1172A Nauuo and Cards greedy implementation *1800	0 / 0	(None)
	4788	P1173A Nauuo and Votes greedy *800	1 / 1	10
	4789	P1174A Ehab Fails to Be Thanos constructive algorithms greedy sortings *1000	0 / 0	(None)
	4795	P1175D Array Splitting greedy sortings *1900	0 / 0	(None)
	4796	P1175E Minimal Segment Cover data structures dfs and similar divide and conquer dp greedy implementation trees *2200	0 / 0	(None)
	4798	P1176A Divide it! brute force greedy implementation *800	0 / 0	(None)
	4799	P1176C Lose it! dp greedy implementation *1300	0 / 0	(None)
	4800	P1176D Recover it! dfs and similar graphs greedy number theory sortings *1800	0 / 0	(None)
	4803	P1178A Prime Minister greedy *800	0 / 0	(None)
	4805	P1178D Prime Graph constructive algorithms greedy math number theory *1500	0 / 0	(None)
	4809	P1179C Serge and Dining Room binary search data structures graph matchings greedy implementation math trees *2200	0 / 0	(None)
	4812	P1181A Chunga-Changa greedy math *1000	0 / 0	(None)
	4821	P1183D Candy Box (easy version) greedy sortings *1400	0 / 0	(None)
	4823	P1183G Candy Box (hard version) greedy implementation sortings *2000	0 / 0	(None)

Pick a problem randomly based on the current filter.