题库 - implementation - 南阳理工学院OJ

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	8713	P1948E Clique Partition brute force constructive algorithms graphs greedy implementation *2100	0 / 0	7
	8701	P1949J Amanda the Amoeba graphs implementation trees two pointers	0 / 0	(无)
	8699	P1950A Stair, Peak, or Neither? implementation *800	0 / 0	3
	8698	P1950B Upscaling implementation *800	0 / 0	3
	8697	P1950C Clock Conversion implementation math *800	0 / 0	3
	8696	P1950D Product of Binary Decimals brute force dp implementation number theory *1100	0 / 0	3
	8695	P1950E Nearly Shortest Repeating Substring brute force implementation number theory strings *1500	0 / 0	5
	8694	P1950F 0, 1, 2, Tree! bitmasks brute force greedy implementation trees *1700	0 / 0	5
	8693	P1950G Shuffling Songs bitmasks dfs and similar dp graphs hashing implementation strings *1900	0 / 0	6
	8688	P1951E No Palindromes brute force constructive algorithms divide and conquer greedy hashing implementation math strings *2000	0 / 0	7
	8680	P1952D Are You a Procrastinator? implementation	0 / 0	(无)
	8676	P1952H Palindrome implementation strings	0 / 0	(无)
	8674	P1952J Help, what does it mean to be "Based" brute force constructive algorithms expression parsing implementation sortings	0 / 0	(无)
	8672	P1954B Make It Ugly implementation math *1200	0 / 0	4
	8669	P1954E Chain Reaction binary search data structures dsu greedy implementation math number theory *2200	0 / 0	8
	8666	P1955B Progressive Square constructive algorithms data structures implementation sortings *1000	0 / 0	3
	8665	P1955C Inhabitant of the Deep Sea greedy implementation math *1300	0 / 0	4
	8663	P1955E Long Inversions brute force greedy implementation sortings *1700	0 / 0	5
	8661	P1955G GCD on a grid brute force dfs and similar dp implementation math number theory *1900	0 / 0	6
	8656	P1956D Nene and the Mex Operator bitmasks brute force constructive algorithms divide and conquer dp greedy implementation math *2000	0 / 0	7
	8655	P1956E1 Nene vs brute force implementation math *2500	0 / 0	9
	8654	P1956E2 Nene vs brute force greedy implementation math *2700	0 / 0	10
	8651	P1957B A BIT of a Construction bitmasks constructive algorithms greedy implementation	0 / 0	(无)
	8844	P1979E Manhattan Triangle binary search constructive algorithms data structures geometry implementation two pointers *2400	0 / 0	9
	8839	P1980D GCD-sequence greedy implementation math number theory *1400	0 / 0	4
	8838	P1980E Permutation of Rows and Columns constructive algorithms data structures greedy hashing implementation math matrices sortings *1600	0 / 0	5
	8832	P1981C Turtle and an Incomplete Sequence bitmasks brute force constructive algorithms greedy implementation math *1800	0 / 0	6
	8828	P1982A Soccer greedy implementation math sortings *800	0 / 0	3
	8827	P1982B Collatz Conjecture brute force implementation math number theory *1200	0 / 0	4
	8825	P1982D Beauty of the mountains brute force data structures implementation math number theory *1700	0 / 0	5
	8821	P1983B Corner Twist constructive algorithms greedy implementation math *1200	0 / 0	4
	8820	P1983C Have Your Cake and Eat It Too binary search brute force greedy implementation *1400	0 / 0	4
	8814	P1984B Large Addition implementation math *1100	0 / 0	3
	8811	P1984D "a" String Problem brute force hashing implementation math string suffix structures strings *2000	0 / 0	7
	8808	P1984G Magic Trick II constructive algorithms implementation sortings *3200	0 / 0	10
	8806	P1985A Creating Words implementation strings *800	0 / 0	3
	8803	P1985D Manhattan Circle implementation math *900	0 / 0	3
	8799	P1985H1 Maximize the Largest Component (Easy Version) brute force data structures dfs and similar dsu graphs implementation *1700	0 / 0	5
	8798	P1985H2 Maximize the Largest Component (Hard Version) data structures dfs and similar dp dsu implementation *2200	0 / 0	8
	8794	P1986D Mathematical Problem brute force dp greedy implementation math two pointers *1400	0 / 0	4
	8779	P1988A Split the Multiset brute force greedy implementation math *900	0 / 0	3
	8778	P1988B Make Majority greedy implementation *900	0 / 0	3
	8775	P1988E Range Minimum Sum binary search brute force data structures divide and conquer implementation *2300	0 / 0	8
	8773	P1989A Catch the Coin implementation *800	0 / 0	3
	8762	P1990E2 Catch the Mole(Hard Version) binary search data structures dfs and similar implementation interactive trees	0 / 0	(无)
	8757	P1992D Test of Love dp greedy implementation *1200	0 / 0	4
	8756	P1992E Novice's Mistake brute force constructive algorithms implementation math strings *1700	0 / 0	5

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