data structures - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5789	P1487E Cheap Dinner brute force data structures graphs greedy implementation sortings two pointers *2000	0 / 0	(None)
	5794	P1488F Dogecoin special problem special problem binary search data structures *2300	0 / 0	(None)
	5795	P1488H Build From Suffixes special problem combinatorics data structures 2800	0 / 0	(None)
	5800	P1490E Accidental Victory binary search data structures greedy *1400	0 / 0	(None)
	5801	P1490G Old Floppy Drive binary search data structures math *1900	0 / 0	(None)
	5806	P1491I Ruler Of The Zoo brute force data structures *3500	0 / 0	(None)
	5807	P1492B Card Deck data structures greedy math *1100	0 / 0	(None)
	5808	P1492C Maximum width binary search data structures dp greedy two pointers *1500	0 / 0	(None)
	5816	P1494E A-Z Graph constructive algorithms data structures graphs hashing *2400	0 / 0	(None)
	5819	P1495E Qingshan and Daniel brute force data structures greedy implementation *3200	0 / 0	(None)
	5822	P1497A Meximization brute force data structures greedy sortings *800	0 / 0	(None)
	5826	P1497E2 Square-free division (hard version) data structures dp greedy math number theory two pointers *2500	0 / 0	(None)
	5828	P1498C Planar Reflections brute force data structures dp *1600	0 / 0	(None)
	5830	P1498F Christmas Game bitmasks data structures dfs and similar dp games math trees *2500	0 / 0	(None)
	5832	P1499C Minimum Grid Path brute force data structures greedy math *1500	0 / 0	(None)
	5835	P1499G Graph Coloring data structures graphs interactive *3100	0 / 0	(None)
	5838	P1500E Subset Trick binary search data structures *3300	0 / 0	(None)
	5842	P1503C Travelling Salesman Problem binary search data structures dp greedy shortest paths sortings two pointers *2200	0 / 0	(None)
	5844	P1503F Balance the Cards constructive algorithms data structures divide and conquer geometry graphs implementation *3500	0 / 0	(None)
	5854	P1506G Maximize the Remaining String brute force data structures dp greedy strings *2000	0 / 0	(None)

Pick a problem randomly based on the current filter.