Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	4129	P909E Coprocessor dfs and similar dp graphs greedy *1900	0 / 0	(None)
	4130	P910A The Way to Home dfs and similar dp greedy implementation *800	0 / 0	(None)
	4131	P910C Minimum Sum constructive algorithms greedy math *1700	0 / 0	(None)
	4132	P911A Nearest Minimums implementation *1100	0 / 0	(None)
	4133	P911C Three Garlands brute force constructive algorithms *1400	0 / 0	(None)
	4134	P911E Stack Sorting constructive algorithms data structures greedy implementation *2000	0 / 0	(None)
	4135	P911F Tree Destruction constructive algorithms dfs and similar graphs greedy trees *2400	0 / 0	(None)
	4136	P912A Tricky Alchemy implementation *800	0 / 0	(None)
	4137	P912B New Year's Eve bitmasks constructive algorithms number theory *1300	0 / 0	(None)
	4138	P912C Perun, Ult! brute force greedy sortings *2500	0 / 0	(None)
	4139	P912D Fishes data structures graphs greedy probabilities shortest paths *2100	0 / 0	(None)
	4140	P913A Modular Exponentiation implementation math *900	0 / 0	(None)
	4141	P913C Party Lemonade bitmasks dp greedy *1600	0 / 0	(None)
	4142	P913E Logical Expression bitmasks dp shortest paths *2400	0 / 0	(None)
	4143	P913G Power Substring math number theory *3200	0 / 0	(None)
	4144	P914A Perfect Squares brute force implementation math *900	0 / 0	(None)
	4145	P914B Conan and Agasa play a Card Game games greedy implementation *1200	0 / 0	(None)
	4146	P914D Bash and a Tough Math Puzzle data structures number theory *1900	0 / 0	(None)
	4147	P914E Palindromes in a Tree bitmasks data structures divide and conquer trees *2400	0 / 0	(None)
	6459	P914G Sum the Fibonacci bitmasks divide and conquer dp fft math *2600	0 / 0	(None)

Pick a problem randomly based on the current filter.