Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	8661	P1869A Make It Zero constructive algorithms	0 / 0	(None)
	8660	P1869B 2D Traveling geometry math shortest paths sortings	0 / 0	(None)
	8748	P1870A MEXanized Array constructive algorithms greedy math *800	0 / 0	3
	8747	P1870B Friendly Arrays bitmasks greedy math *1200	0 / 0	4
	8746	P1870C Colorful Table binary search data structures dp implementation math two pointers *1300	0 / 0	4
	8745	P1870D Prefix Purchase greedy implementation sortings *1800	0 / 0	6
	8744	P1870E Another MEX Problem bitmasks brute force dp shortest paths *2300	0 / 0	8
	8743	P1870F Lazy Numbers binary search math *2900	0 / 0	10
	8742	P1870G MEXanization data structures *3300	0 / 0	10
	8741	P1870H Standard Graph Problem data structures graphs greedy trees *3500	0 / 0	10
	8659	P1872A Two Vessels brute force greedy math	0 / 0	(None)
	8658	P1872B The Corridor or There and Back Again greedy implementation	0 / 0	(None)
	8657	P1872C Non-coprime Split math number theory	0 / 0	(None)
	8656	P1872D Plus Minus Permutation math	0 / 0	(None)
	8655	P1872E Data Structures Fan binary search bitmasks data structures dp	0 / 0	(None)
	8654	P1872F Selling a Menagerie dfs and similar dsu graphs implementation math	0 / 0	(None)
	8653	P1872G Replace With Product brute force greedy math	0 / 0	(None)
	8740	P1873A Short Sort brute force implementation *800	0 / 0	3
	8739	P1873B Good Kid brute force greedy math *800	0 / 0	3
	8738	P1873C Target Practice implementation math *800	0 / 0	3

Pick a problem randomly based on the current filter.