*2500 - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	639	P1528D It's a bird! No, it's a plane! No, it's AaParsa! constructive algorithms graphs shortest paths *2500	0 / 0	(None)
	597	P1534F1 Falling Sand (Easy Version) dfs and similar graphs greedy *2500	0 / 0	(None)
	563	P1539E Game with Cards binary search constructive algorithms data structures dp greedy implementation *2500	0 / 0	(None)
	523	P1548C The Three Little Pigs combinatorics dp fft math *2500	0 / 0	(None)
	513	P1550E Stringforces binary search bitmasks brute force dp strings two pointers *2500	0 / 0	(None)
	469	P1556F Sports Betting bitmasks combinatorics dp graphs math probabilities *2500	0 / 0	(None)
	451	P1559D2 Mocha and Diana (Hard Version) brute force constructive algorithms dfs and similar dsu graphs greedy trees two pointers *2500	0 / 0	(None)
	434	P1562E Rescue Niwen! dp greedy string suffix structures strings *2500	0 / 0	(None)
	405	P1571G A Battle Against a Dragon special problem data structures dp 2500	0 / 0	(None)
	400	P1572B Xor of 3 brute force constructive algorithms greedy two pointers *2500	0 / 0	(None)
	389	P1574E Coloring combinatorics constructive algorithms implementation math *2500	0 / 0	(None)
	331	P1583F Defender of Childhood Dreams bitmasks constructive algorithms divide and conquer *2500	0 / 0	(None)
	315	P1585G Poachers dp games graphs trees *2500	0 / 0	(None)
	203	P1611G Robot and Candies data structures graph matchings greedy *2500	0 / 0	(None)
	196	P1612G Max Sum Array combinatorics constructive algorithms greedy sortings *2500	0 / 0	(None)
	120	P1623E Middle Duplication data structures dfs and similar greedy strings trees *2500	0 / 0	(None)
	108	P1625E1 Cats on the Upgrade (easy version) brute force data structures dfs and similar divide and conquer dp graphs trees *2500	0 / 0	(None)
	48	P1637F Towers constructive algorithms dfs and similar dp greedy trees *2500	0 / 0	(None)
	7712	P1677D Tokitsukaze and Permutations dp math *2500	0 / 0	(None)
	7664	P1687C Sanae and Giant Robot binary search brute force data structures dsu greedy sortings *2500	0 / 0	(None)

Pick a problem randomly based on the current filter.