Problem Set - 追梦算法网

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
3952	P853A Planning greedy *1500	0 / 0	(None)
3951	P853B Jury Meeting greedy sortings two pointers *1800	0 / 0	(None)
3950	P853C Boredom data structures *2100	0 / 0	(None)
3949	P853D Michael and Charging Stations binary search dp greedy *2400	0 / 0	(None)
3948	P853E Lada Malina data structures geometry *3400	0 / 0	(None)
3947	P854A Fraction brute force constructive algorithms math *800	0 / 0	(None)
3946	P854B Maxim Buys an Apartment constructive algorithms math *1200	0 / 0	(None)
3945	P855A Tom Riddle's Diary brute force implementation strings *800	0 / 0	(None)
3944	P855B Marvolo Gaunt's Ring brute force data structures dp *1500	0 / 0	(None)
3943	P855C Helga Hufflepuff's Cup dp trees *2000	0 / 0	(None)
3942	P855D Rowena Ravenclaw's Diadem trees *2500	0 / 0	(None)
3941	P855E Salazar Slytherin's Locket bitmasks dp *2200	0 / 0	(None)
3940	P855F Nagini binary search data structures *3100	0 / 0	(None)
3939	P855G Harry Vs Voldemort dfs and similar dp graphs trees *3300	0 / 0	(None)
3938	P856A Set Theory brute force constructive algorithms *1600	0 / 0	(None)
3937	P856B Similar Words dp hashing strings trees *2300	0 / 0	(None)
3936	P856C Eleventh Birthday combinatorics dp math *2400	0 / 0	(None)
3935	P856D Masha and Cactus dp trees *2400	0 / 0	(None)
3934	P856E Satellites *3100	0 / 0	(None)
3933	P856F To Play or not to Play greedy *3000	0 / 0	(None)

Pick a problem randomly based on the current filter.

Categories