*2500 - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5588	P1420E Battle Lemmings dp greedy *2500	0 / 0	(None)
	5600	P1423H Virus data structures divide and conquer dsu graphs *2500	0 / 0	(None)
	5615	P1427E Xum bitmasks constructive algorithms math matrices number theory *2500	0 / 0	(None)
	5650	P1438E Yurii Can Do Everything binary search bitmasks brute force constructive algorithms divide and conquer two pointers *2500	0 / 0	(None)
	5722	P1467E Distinctive Roots in a Tree data structures dfs and similar dp trees *2500	0 / 0	(None)
	5727	P1468G Hobbits binary search geometry *2500	0 / 0	(None)
	5736	P1470C Strange Shuffle binary search brute force constructive algorithms interactive *2500	0 / 0	(None)
	5750	P1474E What Is It? constructive algorithms greedy *2500	0 / 0	(None)
	5772	P1481E Sorting Books data structures dp greedy *2500	0 / 0	(None)
	5781	P1485E Move and Swap dfs and similar dp greedy trees *2500	0 / 0	(None)
	5809	P1492E Almost Fault-Tolerant Database brute force constructive algorithms dfs and similar greedy implementation *2500	0 / 0	(None)
	5825	P1497D Genius bitmasks dp graphs number theory *2500	0 / 0	(None)
	5826	P1497E2 Square-free division (hard version) data structures dp greedy math number theory two pointers *2500	0 / 0	(None)
	5830	P1498F Christmas Game bitmasks data structures dfs and similar dp games math trees *2500	0 / 0	(None)
	5879	P1513F Swapping Problem brute force constructive algorithms data structures sortings *2500	0 / 0	(None)
	5890	P1516E Baby Ehab Plays with Permutations combinatorics dp math *2500	0 / 0	(None)
	5893	P1517E Group Photo binary search data structures implementation two pointers *2500	0 / 0	(None)
	5907	P1521D Nastia Plays with a Tree constructive algorithms data structures dfs and similar dp dsu greedy implementation trees *2500	0 / 0	(None)
	5926	P1527E Partition Game binary search data structures divide and conquer dp *2500	0 / 0	(None)
	5928	P1528D It's a bird! No, it's a plane! No, it's AaParsa! constructive algorithms graphs shortest paths *2500	0 / 0	(None)

Pick a problem randomly based on the current filter.