题库 - 南阳理工学院OJ

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	8636	P1938D __NO_TITLE__	0 / 0	(无)
	8635	P1938E __NO_TITLE__	0 / 0	(无)
	8634	P1938F __NO_TITLE__	0 / 0	(无)
	8633	P1938G __NO_TITLE__	0 / 0	(无)
	8632	P1938H __NO_TITLE__	0 / 0	(无)
	8631	P1938I __NO_TITLE__	0 / 0	(无)
	8630	P1938J __NO_TITLE__	0 / 0	(无)
	8629	P1938K __NO_TITLE__	0 / 0	(无)
	8628	P1938L __NO_TITLE__	0 / 0	(无)
	8627	P1938M __NO_TITLE__	0 / 0	(无)
	8626	P1939A __NO_TITLE__	0 / 0	(无)
	8625	P1939B __NO_TITLE__	0 / 0	(无)
	8624	P1939C __NO_TITLE__	0 / 0	(无)
	8623	P1939D __NO_TITLE__	0 / 0	(无)
	8622	P1940A __NO_TITLE__	0 / 0	(无)
	8621	P1940B __NO_TITLE__	0 / 0	(无)
	8620	P1940C __NO_TITLE__	0 / 0	(无)
	8619	P1940D __NO_TITLE__	0 / 0	(无)
	8618	P1941A Rudolf and the Ticket brute force math *800	0 / 0	3
	8617	P1941B Rudolf and 121 brute force dp greedy math *1000	0 / 0	3
	8616	P1941C Rudolf and the Ugly String dp greedy strings *900	0 / 0	3
	8615	P1941D Rudolf and the Ball Game dfs and similar dp implementation *1200	0 / 0	4
	8614	P1941E Rudolf and k Bridges binary search data structures dp two pointers *1600	0 / 0	5
	8613	P1941F Rudolf and Imbalance binary search greedy sortings two pointers *1800	0 / 0	6
	8612	P1941G Rudolf and Subway constructive algorithms dfs and similar graphs shortest paths *2000	0 / 0	7
	8745	P1942E Farm Game combinatorics games *2300	0 / 0	8
	8744	P1942F Farmer John's Favorite Function brute force data structures implementation math *2700	0 / 0	10
	8743	P1942G Bessie and Cards combinatorics dp math *2800	0 / 0	10
	8742	P1942H Farmer John's Favorite Intern data structures dp flows trees *3500	0 / 0	10
	8741	P1943A MEX Game 1 games greedy *1300	0 / 0	4
	8740	P1943B Non-Palindromic Substring hashing implementation math strings *2000	0 / 0	7
	8739	P1943C Tree Compass constructive algorithms dfs and similar greedy trees *2300	0 / 0	8
	8738	P1943D1 Counting Is Fun (Easy Version) brute force combinatorics dp math *2400	0 / 0	9
	8737	P1943D2 Counting Is Fun (Hard Version) combinatorics dp *2800	0 / 0	10
	8736	P1943E1 MEX Game 2 (Easy Version) binary search brute force greedy *2900	0 / 0	10
	8735	P1943E2 MEX Game 2 (Hard Version) binary search greedy two pointers *3300	0 / 0	10
	8734	P1943F Minimum Hamming Distance dp *3500	0 / 0	10
	8733	P1944A Destroying Bridges graphs greedy math *800	0 / 0	3
	8732	P1944B Equal XOR bitmasks constructive algorithms *1100	0 / 0	3
	8731	P1945A Setting up Camp greedy math *800	0 / 0	3
	8730	P1945B Fireworks math number theory *900	0 / 0	3
	8729	P1945C Left and Right Houses brute force *1200	0 / 0	4
	8728	P1945D Seraphim the Owl dp greedy *1300	0 / 0	4
	8727	P1945E Binary Search binary search constructive algorithms greedy *1700	0 / 0	5
	8726	P1945F Kirill and Mushrooms data structures sortings *1900	0 / 0	6
	8725	P1945G Cook and Porridge binary search constructive algorithms data structures implementation *2500	0 / 0	9
	8724	P1945H GCD is Greater brute force data structures math number theory *2600	0 / 0	10
	8723	P1946A Median of an Array greedy implementation sortings *800	0 / 0	3
	8722	P1946B Maximum Sum dp greedy math *1100	0 / 0	3
	8721	P1946C Tree Cutting binary search dp greedy implementation trees *1600	0 / 0	5

根据当前过滤条件随机选择一道题