greedy - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	8464	P1837B Comparison String greedy	0 / 0	(None)
	8463	P1837C Best Binary String constructive algorithms greedy	0 / 0	(None)
	8462	P1837D Bracket Coloring constructive algorithms greedy	0 / 0	(None)
	8460	P1837F Editorial for Two binary search data structures greedy implementation	0 / 0	(None)
	8456	P1838D Bracket Walk data structures greedy strings	0 / 0	(None)
	8453	P1839A The Good Array greedy implementation math	0 / 0	(None)
	8452	P1839B Lamps greedy sortings	0 / 0	(None)
	8449	P1839E Decreasing Game constructive algorithms dfs and similar dp greedy interactive	0 / 0	(None)
	8445	P1840D Wooden Toy Festival binary search greedy sortings	0 / 0	(None)
	8502	P1841C Ranom Numbers brute force dp greedy math strings *1800	0 / 0	6
	8501	P1841D Pairs of Segments data structures dp greedy sortings two pointers *2000	0 / 0	7
	8500	P1841E Fill the Matrix data structures greedy math *2200	0 / 0	8
	8548	P1842B Tenzing and Books bitmasks greedy math *1100	0 / 0	3
	8546	P1842D Tenzing and His Animal Friends constructive algorithms graphs greedy *1900	0 / 0	6
	8545	P1842E Tenzing and Triangle data structures dp geometry greedy math *2300	0 / 0	8
	8544	P1842F Tenzing and Tree dfs and similar greedy shortest paths sortings trees *2500	0 / 0	9
	8541	P1842I Tenzing and Necklace divide and conquer dp greedy *3500	0 / 0	10
	8540	P1843A Sasha and Array Coloring greedy sortings two pointers *800	0 / 0	3
	8539	P1843B Long Long greedy math two pointers *800	0 / 0	3
	8535	P1843F1 Omsk Metro (simple version) data structures dfs and similar dp graphs greedy math trees *1800	0 / 0	6

Pick a problem randomly based on the current filter.