Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3391	P600C Make Palindrome constructive algorithms greedy strings *1800	0 / 0	(None)
	3392	P600E Lomsat gelral data structures dfs and similar dsu trees *2300	0 / 0	(None)
	3393	P600F Edge coloring of bipartite graph graphs *2800	0 / 0	(None)
	3394	P601B Lipshitz Sequence data structures math *2100	0 / 0	(None)
	3395	P601C Kleofáš and the n-thlon dp math probabilities *2300	0 / 0	(None)
	3396	P601E A Museum Robbery data structures dp *2800	0 / 0	(None)
	3397	P602B Approximating a Constant Range dp implementation two pointers *1400	0 / 0	(None)
	3398	P603A Alternative Thinking dp greedy math *1600	0 / 0	(None)
	3399	P603B Moodular Arithmetic combinatorics dfs and similar dsu math number theory *1800	0 / 0	(None)
	3400	P603C Lieges of Legendre games math *2200	0 / 0	(None)
	3401	P603E Pastoral Oddities data structures divide and conquer dsu math trees *3000	0 / 0	(None)
	3402	P604A Uncowed Forces implementation *1000	0 / 0	(None)
	3403	P604B More Cowbell binary search greedy *1400	0 / 0	(None)
	3404	P605B Lazy Student constructive algorithms data structures graphs *1700	0 / 0	(None)
	3405	P605D Board Game data structures dfs and similar *2500	0 / 0	(None)
	3406	P606A Magic Spheres implementation *1200	0 / 0	(None)
	3407	P613E Puzzle Lover dp hashing strings *3200	0 / 0	(None)
	3408	P614A Link/Cut Tree brute force implementation *1500	0 / 0	(None)
	3409	P615A Bulbs implementation *800	0 / 0	(None)
	3410	P615C Running Track dp greedy strings trees *2000	0 / 0	(None)

Pick a problem randomly based on the current filter.