Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	518	P1549B Gregor and the Pawn Game dfs and similar dp flows graph matchings graphs greedy implementation *800	0 / 0	(None)
	517	P1550A Find The Array greedy math *800	0 / 0	(None)
	516	P1550B Maximum Cost Deletion greedy math *1000	0 / 0	(None)
	515	P1550C Manhattan Subarrays brute force geometry greedy implementation *1700	0 / 0	(None)
	514	P1550D Excellent Arrays binary search combinatorics constructive algorithms implementation math sortings two pointers *2300	0 / 0	(None)
	513	P1550E Stringforces binary search bitmasks brute force dp strings two pointers *2500	0 / 0	(None)
	512	P1550F Jumping Around binary search data structures divide and conquer dp dsu graphs shortest paths *2700	0 / 0	(None)
	511	P1551A Polycarp and Coins greedy math *800	0 / 0	(None)
	510	P1551B1 Wonderful Coloring - 1 greedy strings *800	0 / 0	(None)
	509	P1551B2 Wonderful Coloring - 2 binary search constructive algorithms data structures greedy *1400	0 / 0	(None)
	508	P1551C Interesting Story greedy sortings strings *1500	0 / 0	(None)
	507	P1551D1 Domino (easy version) constructive algorithms math *1700	0 / 0	(None)
	506	P1551D2 Domino (hard version) constructive algorithms implementation math *2100	0 / 0	(None)
	505	P1551E Fixed Points binary search brute force dp *2000	0 / 0	(None)
	504	P1551F Equidistant Vertices brute force combinatorics dfs and similar dp trees *2200	0 / 0	(None)
	503	P1552A Subsequence Permutation sortings strings *800	0 / 0	(None)
	502	P1552B Running for Gold combinatorics graphs greedy sortings *1500	0 / 0	(None)
	501	P1552C Maximize the Intersections combinatorics constructive algorithms geometry greedy sortings *1800	0 / 0	(None)
	500	P1552D Array Differentiation bitmasks brute force constructive algorithms dfs and similar dp graphs math *1800	0 / 0	(None)
	499	P1552E Colors and Intervals constructive algorithms data structures greedy sortings *2300	0 / 0	(None)

Pick a problem randomly based on the current filter.