Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3892	P867A Between the Offices implementation *800	0 / 0	(None)
	3891	P868A Bark to Unlock brute force implementation strings *900	0 / 0	(None)
	3890	P868B Race Against Time implementation *1400	0 / 0	(None)
	3889	P868C Qualification Rounds bitmasks brute force constructive algorithms dp *1500	0 / 0	(None)
	3888	P868D Huge Strings bitmasks brute force dp implementation strings *2200	0 / 0	(None)
	3887	P868E Policeman and a Tree dp graphs trees *2700	0 / 0	(None)
	3886	P868F Yet Another Minimization Problem divide and conquer dp *2500	0 / 0	(None)
	3885	P868G El Toll Caves math *3300	0 / 0	(None)
	3884	P869A The Artful Expedient brute force implementation *1100	0 / 0	(None)
	3883	P869B The Eternal Immortality math *1100	0 / 0	(None)
	3882	P869C The Intriguing Obsession combinatorics dp math *1800	0 / 0	(None)
	3881	P869D The Overdosing Ubiquity brute force dfs and similar graphs *2800	0 / 0	(None)
	3880	P869E The Untended Antiquity data structures hashing *2400	0 / 0	(None)
	3879	P870A Search for Pretty Integers brute force implementation *900	0 / 0	(None)
	3878	P870B Maximum of Maximums of Minimums greedy *1200	0 / 0	(None)
	3877	P870C Maximum splitting dp greedy math number theory *1300	0 / 0	(None)
	3876	P870D Something with XOR Queries brute force interactive probabilities *2000	0 / 0	(None)
	3875	P870E Points, Lines and Ready-made Titles dfs and similar dsu graphs trees *2300	0 / 0	(None)
	3874	P870F Paths data structures number theory *2700	0 / 0	(None)
	3873	P871E Restore the Tree graphs greedy trees *2900	0 / 0	(None)

Pick a problem randomly based on the current filter.