*2500 - Problem Set - 追梦算法网

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
5954	P1534F1 Falling Sand (Easy Version) dfs and similar graphs greedy *2500	0 / 0	(None)
5976	P1539E Game with Cards binary search constructive algorithms data structures dp greedy implementation *2500	0 / 0	(None)
5999	P1548C The Three Little Pigs combinatorics dp fft math *2500	0 / 0	(None)
6005	P1550E Stringforces binary search bitmasks brute force dp strings two pointers *2500	0 / 0	(None)
6030	P1556F Sports Betting bitmasks combinatorics dp graphs math probabilities *2500	0 / 0	(None)
6050	P1562E Rescue Niwen! dp greedy string suffix structures strings *2500	0 / 0	(None)
6066	P1571G A Battle Against a Dragon special problem data structures dp 2500	0 / 0	(None)
6076	P1574E Coloring combinatorics constructive algorithms implementation math *2500	0 / 0	(None)
6125	P1585G Poachers dp games graphs trees *2500	0 / 0	(None)
6196	P1611G Robot and Candies data structures graph matchings greedy *2500	0 / 0	(None)
6201	P1612G Max Sum Array combinatorics constructive algorithms greedy sortings *2500	0 / 0	(None)
6450	6450 Picking Strings constructive algorithms implementation strings *2500	0 / 0	(None)

Pick a problem randomly based on the current filter.

Categories