Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5018	P1244A Pens and Pencils math *800	0 / 0	(None)
	5019	P1244B Rooms and Staircases brute force implementation *1000	0 / 0	(None)
	5020	P1244D Paint the Tree brute force constructive algorithms dp graphs implementation trees *1800	0 / 0	(None)
	5021	P1244F Chips constructive algorithms implementation *2300	0 / 0	(None)
	5022	P1245A Good ol' Numbers Coloring math number theory *1000	0 / 0	(None)
	5023	P1245B Restricted RPS constructive algorithms dp greedy *1200	0 / 0	(None)
	5024	P1245C Constanze's Machine dp *1400	0 / 0	(None)
	5025	P1245D Shichikuji and Power Grid dsu graphs greedy shortest paths trees *1900	0 / 0	(None)
	5026	P1245F Daniel and Spring Cleaning bitmasks brute force combinatorics dp *2300	0 / 0	(None)
	5027	P1246F Cursor Distance *3500	0 / 0	(None)
	5028	P1248B Grow The Tree greedy math sortings *900	0 / 0	(None)
	5029	P1249A Yet Another Dividing into Teams math *800	0 / 0	(None)
	5030	P1249B2 Books Exchange (hard version) dfs and similar dsu math *1300	0 / 0	(None)
	5031	P1249C2 Good Numbers (hard version) binary search greedy math meet-in-the-middle *1500	0 / 0	(None)
	5032	P1249D1 Too Many Segments (easy version) greedy *1800	0 / 0	(None)
	5033	P1249E By Elevator or Stairs? dp shortest paths *1700	0 / 0	(None)
	5034	P1249F Maximum Weight Subset dp trees *2200	0 / 0	(None)
	5035	P1250B The Feast and the Bus brute force constructive algorithms greedy math *1800	0 / 0	(None)
	5036	P1250C Trip to Saint Petersburg data structures *2100	0 / 0	(None)
	5037	P1250D Conference Problem dp *3000	0 / 0	(None)

Pick a problem randomly based on the current filter.