Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5991	P1545E1 AquaMoon and Time Stop (easy version) data structures dp *3500	0 / 0	(None)
	5992	P1545F AquaMoon and Potatoes brute force data structures dp *3500	0 / 0	(None)
	5993	P1546A AquaMoon and Two Arrays brute force greedy *800	0 / 0	(None)
	5994	P1547A Shortest Path with Obstacle implementation math *800	0 / 0	(None)
	5995	P1547C Pair Programming greedy two pointers *1100	0 / 0	(None)
	5996	P1547E Air Conditioners data structures dp implementation shortest paths sortings two pointers *1500	0 / 0	(None)
	5997	P1547G How Many Paths? dfs and similar dp graphs trees *2100	0 / 0	(None)
	5998	P1548B Integers Have Friends binary search data structures divide and conquer math number theory two pointers *1800	0 / 0	(None)
	5999	P1548C The Three Little Pigs combinatorics dp fft math *2500	0 / 0	(None)
	6000	P1548D2 Gregor and the Odd Cows (Hard) brute force geometry math number theory *3300	0 / 0	(None)
	6001	P1548E Gregor and the Two Painters data structures divide and conquer graphs greedy math *3400	0 / 0	(None)
	6002	P1549B Gregor and the Pawn Game dfs and similar dp flows graph matchings graphs greedy implementation *800	0 / 0	(None)
	6003	P1550A Find The Array greedy math *800	0 / 0	(None)
	6004	P1550C Manhattan Subarrays brute force geometry greedy implementation *1700	0 / 0	(None)
	6005	P1550E Stringforces binary search bitmasks brute force dp strings two pointers *2500	0 / 0	(None)
	6006	P1550F Jumping Around binary search data structures divide and conquer dp dsu graphs shortest paths *2700	0 / 0	(None)
	6512	P1551 all不了两次博弈论	2 / 9	10
	6007	P1551B1 Wonderful Coloring - 1 greedy strings *800	0 / 0	(None)
	6008	P1551B2 Wonderful Coloring - 2 binary search constructive algorithms data structures greedy *1400	0 / 0	(None)
	6009	P1551D1 Domino (easy version) constructive algorithms math *1700	0 / 0	(None)

Pick a problem randomly based on the current filter.