Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	9110	P1941G Rudolf and Subway constructive algorithms dfs and similar graphs shortest paths *2000	0 / 0	7
	9109	P1943A MEX Game 1 games greedy *1300	0 / 0	4
	9108	P1943B Non-Palindromic Substring hashing implementation math strings *2000	0 / 0	7
	9107	P1943C Tree Compass constructive algorithms dfs and similar greedy trees *2300	0 / 0	8
	9106	P1943D1 Counting Is Fun (Easy Version) brute force combinatorics dp math *2400	0 / 0	9
	9105	P1943D2 Counting Is Fun (Hard Version) combinatorics dp *2800	0 / 0	10
	9104	P1943E1 MEX Game 2 (Easy Version) binary search brute force greedy *2900	0 / 0	10
	9103	P1943E2 MEX Game 2 (Hard Version) binary search greedy two pointers *3300	0 / 0	10
	9102	P1943F Minimum Hamming Distance dp *3500	0 / 0	10
	9101	P1944A Destroying Bridges graphs greedy math *800	0 / 0	3
	9100	P1944B Equal XOR bitmasks constructive algorithms *1100	0 / 0	3
	9099	P1945A Setting up Camp greedy math *800	0 / 0	3
	9098	P1945B Fireworks math number theory *900	0 / 0	3
	9097	P1945C Left and Right Houses brute force *1200	0 / 0	4
	9096	P1945D Seraphim the Owl dp greedy *1300	0 / 0	4
	9095	P1945E Binary Search binary search constructive algorithms greedy *1700	0 / 0	5
	9094	P1945F Kirill and Mushrooms data structures sortings *1900	0 / 0	6
	9093	P1945G Cook and Porridge binary search constructive algorithms data structures implementation *2500	0 / 0	9
	9092	P1945H GCD is Greater brute force data structures math number theory *2600	0 / 0	10
	9091	P1946A Median of an Array greedy implementation sortings *800	0 / 0	3

Pick a problem randomly based on the current filter.