Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5052	P600C Make Palindrome constructive algorithms greedy strings *1800	0 / 0	(None)
	5051	P600D Area of Two Circles' Intersection geometry *2000	0 / 0	(None)
	5050	P600E Lomsat gelral data structures dfs and similar dsu trees *2300	0 / 0	(None)
	5049	P600F Edge coloring of bipartite graph graphs *2800	0 / 0	(None)
	5048	P601A The Two Routes graphs shortest paths *1600	0 / 0	(None)
	5047	P601B Lipshitz Sequence data structures math *2100	0 / 0	(None)
	5046	P601C Kleofáš and the n-thlon dp math probabilities *2300	0 / 0	(None)
	5045	P601D Acyclic Organic Compounds data structures dfs and similar dsu hashing strings trees *2400	0 / 0	(None)
	5044	P601E A Museum Robbery data structures dp *2800	0 / 0	(None)
	5043	P602A Two Bases brute force implementation *1100	0 / 0	(None)
	5042	P602B Approximating a Constant Range dp implementation two pointers *1400	0 / 0	(None)
	5041	P603A Alternative Thinking dp greedy math *1600	0 / 0	(None)
	5040	P603B Moodular Arithmetic combinatorics dfs and similar dsu math number theory *1800	0 / 0	(None)
	5039	P603C Lieges of Legendre games math *2200	0 / 0	(None)
	5038	P603D Ruminations on Ruminants geometry math *2900	0 / 0	(None)
	5037	P603E Pastoral Oddities data structures divide and conquer dsu math trees *3000	0 / 0	(None)
	5036	P604A Uncowed Forces implementation *1000	0 / 0	(None)
	5035	P604B More Cowbell binary search greedy *1400	0 / 0	(None)
	5034	P605A Sorting Railway Cars constructive algorithms greedy *1600	0 / 0	(None)
	5033	P605B Lazy Student constructive algorithms data structures graphs *1700	0 / 0	(None)

Pick a problem randomly based on the current filter.