Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	4031	P868F Yet Another Minimization Problem divide and conquer dp *2500	0 / 0	(None)
	4032	P868G El Toll Caves math *3300	0 / 0	(None)
	4033	P869B The Eternal Immortality math *1100	0 / 0	(None)
	4034	P869D The Overdosing Ubiquity brute force dfs and similar graphs *2800	0 / 0	(None)
	4035	P870A Search for Pretty Integers brute force implementation *900	4 / 10	9
	4036	P870C Maximum splitting dp greedy math number theory *1300	0 / 0	(None)
	4037	P870D Something with XOR Queries brute force interactive probabilities *2000	0 / 0	(None)
	4038	P870E Points, Lines and Ready-made Titles dfs and similar dsu graphs trees *2300	0 / 0	(None)
	4039	P871E Restore the Tree graphs greedy trees *2900	0 / 0	(None)
	4040	P873B Balanced Substring dp implementation *1500	0 / 0	(None)
	4041	P873D Merge Sort constructive algorithms divide and conquer *1800	0 / 0	(None)
	4042	P873F Forbidden Indices dsu string suffix structures strings *2400	0 / 0	(None)
	4043	P875A Classroom Watch brute force math *1200	0 / 0	(None)
	4044	P875C National Property 2-sat dfs and similar graphs implementation *2100	0 / 0	(None)
	4045	P875D High Cry binary search bitmasks combinatorics data structures divide and conquer *2200	0 / 0	(None)
	4046	P875F Royal Questions dsu graphs greedy *2500	0 / 0	(None)
	4047	P876A Trip For Meal math *900	5 / 8	10
	4048	P877A Alex and broken contest implementation strings *1100	0 / 0	(None)
	4049	P877C Slava and tanks constructive algorithms *1600	0 / 0	(None)
	4050	P877E Danil and a Part-time Job bitmasks data structures trees *2000	0 / 0	(None)

Pick a problem randomly based on the current filter.