data structures - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5857	P1508E Tree Calendar brute force constructive algorithms data structures dfs and similar sortings trees *3100	0 / 0	(None)
	5858	P1508F Optimal Encoding brute force data structures *3500	0 / 0	(None)
	5868	P1511C Yet Another Card Deck brute force data structures implementation trees *1100	0 / 0	(None)
	5870	P1511F Chainword brute force data structures dp matrices string suffix structures strings *2700	0 / 0	(None)
	5874	P1512D Corrupted Array constructive algorithms data structures greedy *1200	0 / 0	(None)
	5879	P1513F Swapping Problem brute force constructive algorithms data structures sortings *2500	0 / 0	(None)
	5886	P1515H Phoenix and Bits bitmasks brute force data structures sortings *3500	0 / 0	(None)
	5893	P1517E Group Photo binary search data structures implementation two pointers *2500	0 / 0	(None)
	5897	P1519C Berland Regional brute force data structures greedy number theory sortings *1400	0 / 0	(None)
	5902	P1520D Same Differences data structures hashing math *1200	0 / 0	(None)
	5904	P1520F2 Guess the K-th Zero (Hard version) binary search constructive algorithms data structures interactive *2200	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)
	5910	P1523C Compression and Expansion brute force data structures greedy implementation trees *1600	0 / 0	(None)
	5913	P1523H Hopping Around the Array data structures dp *3500	0 / 0	(None)
	5915	P1525C Robot Collisions data structures greedy implementation sortings *2000	0 / 0	(None)
	5919	P1526C1 Potions (Easy Version) brute force data structures dp greedy *1500	0 / 0	(None)
	5920	P1526D Kill Anton brute force constructive algorithms data structures math strings *2200	0 / 0	(None)
	5926	P1527E Partition Game binary search data structures divide and conquer dp *2500	0 / 0	(None)
	5936	P1530H Turing's Award data structures dp *3400	0 / 0	(None)
	5948	P1533E Chess Team Forming *special problem binary search data structures greedy	0 / 0	(None)

Pick a problem randomly based on the current filter.