*1900 - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3478	P961E Tufurama data structures *1900	0 / 0	(None)
	3458	P965D Single-use Stones binary search flows greedy two pointers *1900	0 / 0	(None)
	3416	P981D Bookshelves bitmasks dp greedy *1900	0 / 0	(None)
	3408	P982D Shark brute force data structures dsu trees *1900	0 / 0	(None)
	3352	P993B Open Communication bitmasks brute force *1900	0 / 0	(None)
	3327	P999D Equalize the Remainders data structures greedy implementation *1900	0 / 0	(None)
	3321	P1000D Yet Another Problem On a Subsequence combinatorics dp *1900	0 / 0	(None)
	3305	P1002A4 Generate W state *1900	0 / 0	(None)
	3294	P1002E2 Another array reconstruction algorithm *1900	0 / 0	(None)
	3245	P1012B Chemical table constructive algorithms dfs and similar dsu graphs matrices *1900	0 / 0	(None)
	3244	P1012C Hills dp *1900	0 / 0	(None)
	3233	P1015E2 Stars Drawing (Hard Edition) binary search dp greedy *1900	0 / 0	(None)
	3221	P1017D The Wu bitmasks brute force data structures *1900	0 / 0	(None)
	3177	P1029D Concatenated Multiples implementation math *1900	0 / 0	(None)
	3164	P1031D Minimum path greedy *1900	0 / 0	(None)
	3158	P1032D Barcelonian Distance geometry implementation *1900	0 / 0	(None)
	3140	P1036C Classy Numbers combinatorics dp *1900	0 / 0	(None)
	3110	P1041E Tree Reconstruction constructive algorithms data structures graphs greedy *1900	0 / 0	(None)
	3098	P1043E Train Hard, Win Easy constructive algorithms greedy math sortings *1900	0 / 0	(None)
	3094	P1044B Intersecting Subtrees dfs and similar interactive trees *1900	0 / 0	(None)

Pick a problem randomly based on the current filter.