Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3551	P679B Bear and Tower of Cubes binary search dp greedy *2200	0 / 0	(None)
	3552	P679D Bear and Chase brute force dfs and similar graphs implementation math probabilities *2900	0 / 0	(None)
	3553	P680A Bear and Five Cards constructive algorithms implementation *800	0 / 0	(None)
	3554	P680B Bear and Finding Criminals constructive algorithms implementation *1000	0 / 0	(None)
	3555	P681B Economy Game brute force *1300	0 / 0	(None)
	3556	P681D Gifts by the List constructive algorithms dfs and similar graphs trees *2000	0 / 0	(None)
	3557	P682A Alyona and Numbers constructive algorithms math number theory *1100	0 / 0	(None)
	3558	P682C Alyona and the Tree dfs and similar dp graphs trees *1600	0 / 0	(None)
	3559	P682D Alyona and Strings dp strings *1900	0 / 0	(None)
	3560	P682E Alyona and Triangles geometry two pointers *2600	0 / 0	(None)
	3561	P683A The Check of the Point special problem geometry 1200	0 / 0	(None)
	3562	P683C Symmetric Difference special problem 1600	0 / 0	(None)
	3563	P683E Hammer throwing special problem 1800	0 / 0	(None)
	3564	P683F Reformat the String special problem 1800	0 / 0	(None)
	3565	P683H Exchange of Books special problem 1900	0 / 0	(None)
	3566	P683J The Hero with Bombs special problem 3000	0 / 0	(None)
	3567	P685A Robbers' watch brute force combinatorics dp math *1700	0 / 0	(None)
	3568	P685B Kay and Snowflake data structures dfs and similar dp trees *1900	0 / 0	(None)
	3569	P685C Optimal Point binary search math *2900	0 / 0	(None)
	3570	P685E Travelling Through the Snow Queen's Kingdom bitmasks brute force divide and conquer graphs *2800	0 / 0	(None)

Pick a problem randomly based on the current filter.