greedy - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2572	P1152D Neko and Aki's Prank dp greedy trees *2100	0 / 0	(None)
	2567	P1153B Serval and Toy Bricks constructive algorithms greedy *1200	0 / 0	(None)
	2566	P1153C Serval and Parenthesis Sequence greedy strings *1700	0 / 0	(None)
	2565	P1153D Serval and Rooted Tree binary search dfs and similar dp greedy trees *1900	0 / 0	(None)
	2559	P1154D Walking Robot greedy *1500	0 / 0	(None)
	2557	P1154F Shovels Shop dp greedy sortings *2100	0 / 0	(None)
	2556	P1154G Minimum Possible LCM brute force greedy math number theory *2200	0 / 0	(None)
	2554	P1155B Game with Telephone Numbers games greedy implementation *1200	0 / 0	(None)
	2552	P1155D Beautiful Array brute force data structures divide and conquer dp greedy *1900	0 / 0	(None)
	2548	P1156B Ugly Pairs dfs and similar greedy implementation sortings strings *1800	0 / 0	(None)
	2547	P1156C Match Points binary search greedy sortings ternary search two pointers *2000	0 / 0	(None)
	2543	P1156G Optimizer graphs greedy hashing implementation *2700	0 / 0	(None)
	2541	P1157B Long Number greedy *1300	0 / 0	(None)
	2540	P1157C1 Increasing Subsequence (easy version) greedy *1300	0 / 0	(None)
	2539	P1157C2 Increasing Subsequence (hard version) greedy *1700	0 / 0	(None)
	2538	P1157D N Problems During K Days constructive algorithms greedy math *1900	0 / 0	(None)
	2537	P1157E Minimum Array binary search data structures greedy *1700	0 / 0	(None)
	2536	P1157F Maximum Balanced Circle constructive algorithms dp greedy two pointers *2000	0 / 0	(None)
	2534	P1158A The Party and Sweets binary search constructive algorithms greedy implementation math sortings two pointers *1500	0 / 0	(None)
	2532	P1158C Permutation recovery constructive algorithms data structures dfs and similar graphs greedy math sortings *2100	0 / 0	(None)

Pick a problem randomly based on the current filter.