*2000 - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5001	P1237D Balanced Playlist binary search data structures implementation *2000	0 / 0	(None)
	5044	P1250N Wires dfs and similar graphs greedy *2000	0 / 0	(None)
	5069	P1256E Yet Another Division Into Teams dp greedy sortings *2000	0 / 0	(None)
	5099	P1268B Domino for Young dp greedy math *2000	0 / 0	(None)
	5138	P1280C Jeremy Bearimy dfs and similar graphs greedy trees *2000	0 / 0	(None)
	5165	P1288D Minimax Problem binary search bitmasks dp *2000	0 / 0	(None)
	5233	P1311D Three Integers brute force math *2000	0 / 0	(None)
	5250	P1320C World of Darkraft: Battle for Azathoth brute force data structures sortings *2000	0 / 0	(None)
	5334	P1346F Dune II: Battle For Arrakis special problem data structures greedy math 2000	0 / 0	(None)
	5342	P1349B Orac and Medians constructive algorithms greedy math *2000	0 / 0	(None)
	5386	P1359E Modular Stability combinatorics math number theory *2000	0 / 0	(None)
	5399	P1363E Tree Shuffling dfs and similar dp greedy trees *2000	0 / 0	(None)
	5410	P1366D Two Divisors constructive algorithms math number theory *2000	0 / 0	(None)
	5432	P1370D Odd-Even Subsequence binary search dp dsu greedy implementation *2000	0 / 0	(None)
	5460	P1379C Choosing flowers binary search brute force data structures dfs and similar dp greedy sortings two pointers *2000	0 / 0	(None)
	5465	P1380D Berserk And Fireball constructive algorithms greedy implementation math two pointers *2000	0 / 0	(None)
	5480	P1385E Directing Edges constructive algorithms dfs and similar graphs *2000	0 / 0	(None)
	5489	P1388D Captain Flint and Treasure data structures dfs and similar graphs greedy implementation trees *2000	0 / 0	(None)
	5496	P1391D 505 bitmasks brute force constructive algorithms dp greedy implementation *2000	0 / 0	(None)
	5525	P1399E1 Weights Division (easy version) data structures dfs and similar greedy trees *2000	0 / 0	(None)

Pick a problem randomly based on the current filter.