Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3589	P690F3 Tree of Life (hard) trees *3200	0 / 0	(None)
	3590	P691B s-palindrome implementation strings *1600	0 / 0	(None)
	3591	P691D Swaps in Permutation dfs and similar dsu math *1700	0 / 0	(None)
	3592	P691F Couple Cover brute force dp number theory *2200	0 / 0	(None)
	3593	P696A Lorenzo Von Matterhorn brute force data structures implementation trees *1500	0 / 0	(None)
	3594	P696C PLEASE combinatorics dp implementation math matrices *2000	0 / 0	(None)
	3595	P696D Legen... data structures dp matrices strings *2500	0 / 0	(None)
	3596	P696F ...Dary! binary search geometry two pointers *3300	0 / 0	(None)
	3597	P697B Barnicle brute force implementation math strings *1400	0 / 0	(None)
	3598	P698B Fix a Tree constructive algorithms dfs and similar dsu graphs trees *1700	0 / 0	(None)
	3599	P698D Limak and Shooting Points brute force geometry math *2600	0 / 0	(None)
	3600	P698F Coprime Permutation combinatorics number theory *3000	0 / 0	(None)
	3601	P699B One Bomb implementation *1400	0 / 0	(None)
	3602	P700A As Fast As Possible binary search math *1900	0 / 0	(None)
	3603	P700C Break Up dfs and similar graphs *2600	0 / 0	(None)
	3604	P700D Huffman Coding on Segment data structures greedy *3100	0 / 0	(None)
	3605	P701A Cards greedy implementation *800	0 / 0	(None)
	3606	P701C They Are Everywhere binary search strings two pointers *1500	0 / 0	(None)
	3607	P702A Maximum Increase dp greedy implementation *800	0 / 0	(None)
	3608	P702C Cellular Network binary search implementation two pointers *1500	0 / 0	(None)

Pick a problem randomly based on the current filter.