Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2827	P363C Fixing Typos greedy implementation *1400	0 / 0	(None)
	2828	P363E Two Circles brute force data structures implementation *2500	0 / 0	(None)
	2829	P364B Free Market dp greedy *2200	0 / 0	(None)
	2830	P364C Beautiful Set brute force number theory *2300	0 / 0	(None)
	2831	P364E Empty Rectangles divide and conquer two pointers *3000	0 / 0	(None)
	2832	P365A Good Number implementation *1100	0 / 0	(None)
	2833	P366A Dima and Guards implementation *1100	0 / 0	(None)
	2834	P366B Dima and To-do List brute force implementation *1200	0 / 0	(None)
	2835	P366D Dima and Trap Graph binary search data structures dfs and similar dsu shortest paths two pointers *2000	0 / 0	(None)
	2836	P367A Sereja and Algorithm data structures implementation *1500	0 / 0	(None)
	2837	P367C Sereja and the Arrangement of Numbers graphs greedy sortings *2000	0 / 0	(None)
	2838	P367D Sereja and Sets bitmasks dfs and similar *2400	0 / 0	(None)
	2839	P368A Sereja and Coat Rack implementation *1000	0 / 0	(None)
	2840	P369A Valera and Plates greedy implementation *900	0 / 0	(None)
	2841	P369B Valera and Contest constructive algorithms implementation math *1400	0 / 0	(None)
	2842	P369D Valera and Fools dfs and similar dp graphs shortest paths *2200	0 / 0	(None)
	2843	P369E Valera and Queries binary search data structures *2200	0 / 0	(None)
	2844	P370A Rook, Bishop and King graphs math shortest paths *1100	0 / 0	(None)
	2845	P370B Berland Bingo implementation *1300	0 / 0	(None)
	2846	P370D Broken Monitor brute force constructive algorithms greedy implementation *2100	0 / 0	(None)

Pick a problem randomly based on the current filter.