Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	8069	P1761D Carry Bit brute force combinatorics fft math	0 / 0	(None)
	8068	P1761E Make It Connected brute force constructive algorithms dsu graphs greedy	0 / 0	(None)
	8067	P1761F1 Anti-median (Easy Version) dp math	0 / 0	(None)
	8066	P1761F2 Anti-median (Hard Version) combinatorics dp math	0 / 0	(None)
	8065	P1761G Centroid Guess interactive probabilities trees	0 / 0	(None)
	8164	P1765E Exchange brute force math *1000	0 / 0	3
	8163	P1765F Chemistry Lab dp geometry probabilities *2200	0 / 0	8
	8162	P1765G Guess the String constructive algorithms interactive probabilities *2600	0 / 0	10
	8161	P1765H Hospital Queue binary search graphs greedy implementation *2200	0 / 0	8
	8160	P1765I Infinite Chess implementation shortest paths *2800	0 / 0	10
	8159	P1765J Hero to Zero graph matchings math *2900	0 / 0	10
	8158	P1765K Torus Path greedy math *1500	0 / 0	5
	8157	P1765L Project Manager brute force data structures implementation *2400	0 / 0	9
	8156	P1765M Minimum LCM math number theory *1000	0 / 0	3
	8155	P1765N Number Reduction greedy *1500	0 / 0	5
	8154	P1766A Extremely Round brute force implementation *800	0 / 0	3
	8153	P1766B Notepad# implementation *1000	0 / 0	3
	8152	P1766C Hamiltonian Wall dp implementation *1300	0 / 0	4
	8151	P1766D Lucky Chains math number theory *1600	0 / 0	5
	8150	P1766E Decomposition binary search brute force data structures divide and conquer dp two pointers *2300	0 / 0	8

Pick a problem randomly based on the current filter.