greedy - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2460	P1175E Minimal Segment Cover data structures dfs and similar divide and conquer dp greedy implementation trees *2200	0 / 0	(None)
	2457	P1176A Divide it! brute force greedy implementation *800	0 / 0	(None)
	2455	P1176C Lose it! dp greedy implementation *1300	0 / 0	(None)
	2454	P1176D Recover it! dfs and similar graphs greedy number theory sortings *1800	0 / 0	(None)
	2449	P1178A Prime Minister greedy *800	0 / 0	(None)
	2447	P1178C Tiles combinatorics greedy math *1300	0 / 0	(None)
	2446	P1178D Prime Graph constructive algorithms greedy math number theory *1500	0 / 0	(None)
	2445	P1178E Archaeology brute force constructive algorithms greedy strings *1900	0 / 0	(None)
	2438	P1179C Serge and Dining Room binary search data structures graph matchings greedy implementation math trees *2200	0 / 0	(None)
	2434	P1180B Nick and Array greedy implementation *1500	0 / 0	(None)
	2433	P1181A Chunga-Changa greedy math *1000	0 / 0	(None)
	2432	P1181B Split a Number greedy implementation strings *1500	0 / 0	(None)
	2428	P1181E2 A Story of One Country (Hard) brute force greedy sortings *3000	0 / 0	(None)
	2425	P1182C Beautiful Lyrics data structures greedy strings *1700	0 / 0	(None)
	2418	P1183D Candy Box (easy version) greedy sortings *1400	0 / 0	(None)
	2415	P1183G Candy Box (hard version) greedy implementation sortings *2000	0 / 0	(None)
	2397	P1185C1 Exam in BerSU (easy version) greedy sortings *1200	0 / 0	(None)
	2396	P1185C2 Exam in BerSU (hard version) brute force data structures greedy math *1700	0 / 0	(None)
	2388	P1186D Vus the Cossack and Numbers constructive algorithms greedy math *1500	0 / 0	(None)
	2386	P1186F Vus the Cossack and a Graph dfs and similar graphs greedy implementation *2400	0 / 0	(None)

Pick a problem randomly based on the current filter.