Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	458	P1558D Top-Notch Insertions combinatorics data structures *2600	0 / 0	(None)
	457	P1558E Down Below binary search dfs and similar graphs greedy meet-in-the-middle shortest paths *3000	0 / 0	(None)
	456	P1558F Strange Sort data structures sortings *3300	0 / 0	(None)
	455	P1559A Mocha and Math bitmasks constructive algorithms math *900	0 / 0	(None)
	454	P1559B Mocha and Red and Blue dp greedy *900	0 / 0	(None)
	453	P1559C Mocha and Hiking constructive algorithms graphs *1200	0 / 0	(None)
	452	P1559D1 Mocha and Diana (Easy Version) brute force constructive algorithms dsu graphs greedy trees *1400	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)
	450	P1559E Mocha and Stars combinatorics dp fft math number theory *2200	0 / 0	(None)
	449	P1560A Dislike of Threes implementation *800	0 / 0	(None)
	448	P1560B Who's Opposite? math *800	0 / 0	(None)
	447	P1560C Infinity Table implementation math *800	0 / 0	(None)
	446	P1560D Make a Power of Two greedy math strings *1300	0 / 0	(None)
	445	P1560E Polycarp and String Transformation binary search implementation sortings strings *1800	0 / 0	(None)
	444	P1560F1 Nearest Beautiful Number (easy version) binary search bitmasks brute force constructive algorithms dfs and similar greedy *1900	0 / 0	(None)
	443	P1560F2 Nearest Beautiful Number (hard version) bitmasks brute force constructive algorithms dfs and similar dp greedy *2100	0 / 0	(None)
	442	P1561A Simply Strange Sort brute force implementation sortings *800	0 / 0	(None)
	441	P1561C Deep Down Below binary search greedy sortings *1300	0 / 0	(None)
	440	P1561D1 Up the Strip (simplified version) brute force data structures dp math number theory *1700	0 / 0	(None)
	439	P1562A The Miracle and the Sleeper greedy math *800	0 / 0	(None)

Pick a problem randomly based on the current filter.