*3000 - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2036	P57E Chess math shortest paths *3000	0 / 0	(None)
	2253	P135E Weak Subsequence combinatorics *3000	0 / 0	(None)
	2290	P150E Freezing with Style binary search data structures divide and conquer trees *3000	0 / 0	(None)
	2305	P156E Mrs brute force dp *3000	0 / 0	(None)
	2394	P185E Soap Time! - 2 binary search data structures *3000	0 / 0	(None)
	2460	P212A Privatization flows graphs *3000	0 / 0	(None)
	2489	P223D Spider geometry graphs *3000	0 / 0	(None)
	2511	P232E Quick Tortoise bitmasks divide and conquer dp *3000	0 / 0	(None)
	2538	P243E Matrix data structures *3000	0 / 0	(None)
	2558	P251E Tree and Table dfs and similar dp implementation trees *3000	0 / 0	(None)
	2589	P264E Roadside Trees data structures dp *3000	0 / 0	(None)
	2612	P274E Mirror Room data structures implementation *3000	0 / 0	(None)
	2625	P280E Sequence Transformation brute force data structures dp implementation math *3000	0 / 0	(None)
	2667	P297E Mystic Carvings data structures *3000	0 / 0	(None)
	2680	P303E Random Ranking dp math probabilities *3000	0 / 0	(None)
	2717	P319E Ping-Pong data structures *3000	0 / 0	(None)
	2810	P356E Xenia and String Problem dp hashing implementation string suffix structures strings *3000	0 / 0	(None)
	2831	P364E Empty Rectangles divide and conquer two pointers *3000	0 / 0	(None)
	2860	P375E Red and Black Tree dp implementation math *3000	0 / 0	(None)
	2981	P429E Points and Segments graphs *3000	0 / 0	(None)

Pick a problem randomly based on the current filter.