Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	8356	P1805F2 Survival of the Weakest (hard version) greedy math sortings two pointers	0 / 0	(None)
	8309	P1806A Walking Master geometry greedy math	0 / 0	(None)
	8308	P1806B Mex Master constructive algorithms greedy	0 / 0	(None)
	8307	P1806C Sequence Master brute force constructive algorithms math	0 / 0	(None)
	8306	P1806D DSU Master combinatorics dp dsu math	0 / 0	(None)
	8305	P1806E Tree Master brute force data structures dfs and similar hashing trees	0 / 0	(None)
	8304	P1806F1 GCD Master (easy version) greedy math number theory sortings	0 / 0	(None)
	8303	P1806F2 GCD Master (hard version) greedy math sortings	0 / 0	(None)
	8317	P1807A Plus or Minus implementation	0 / 0	(None)
	8316	P1807B Grab the Candies greedy	0 / 0	(None)
	8315	P1807C Find and Replace implementation strings	0 / 0	(None)
	8314	P1807D Odd Queries data structures implementation	0 / 0	(None)
	8313	P1807E Interview binary search implementation interactive	0 / 0	(None)
	8312	P1807F Bouncy Ball brute force dfs and similar implementation	0 / 0	(None)
	8311	P1807G1 Subsequence Addition (Easy Version) dp greedy implementation sortings	0 / 0	(None)
	8310	P1807G2 Subsequence Addition (Hard Version) data structures dp greedy implementation sortings	0 / 0	(None)
	8355	P1808A Lucky Numbers brute force implementation *900	0 / 0	3
	8354	P1808B Playing in a Casino math sortings *1200	0 / 0	4
	8353	P1808C Unlucky Numbers brute force greedy implementation *1900	0 / 0	6
	8352	P1808D Petya, Petya, Petr, and Palindromes binary search brute force data structures two pointers *2100	0 / 0	7

Pick a problem randomly based on the current filter.