题库 - 南阳理工学院OJ

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	255	P1567B MEXor Mixup bitmasks greedy *1000	0 / 0	(无)
	254	P1567C Carrying Conundrum bitmasks combinatorics dp math *1600	0 / 0	(无)
	253	P1567D Expression Evaluation Error constructive algorithms greedy implementation math *2000	0 / 0	(无)
	252	P1567E Non-Decreasing Dilemma data structures divide and conquer math *2200	0 / 0	(无)
	251	P1567F One-Four Overload 2-sat constructive algorithms dfs and similar dsu graphs implementation *2700	0 / 0	(无)
	250	P1569A Balanced Substring implementation *800	0 / 0	(无)
	249	P1569B Chess Tournament constructive algorithms *1000	0 / 0	(无)
	248	P1569C Jury Meeting combinatorics math *1500	0 / 0	(无)
	247	P1569D Inconvenient Pairs binary search data structures implementation sortings two pointers *1900	0 / 0	(无)
	246	P1569E Playoff Restoration bitmasks brute force hashing implementation meet-in-the-middle *2600	0 / 0	(无)
	245	P1569F Palindromic Hamiltonian Path brute force dfs and similar dp graphs hashing *3000	0 / 0	(无)
	244	P1570A A+B (Trial Problem) *special problem	0 / 0	(无)
	243	P1570B Yellow Cards *special problem math	0 / 0	(无)
	242	P1570C Shooting *special problem greedy implementation	0 / 0	(无)
	241	P1570D Reachable Numbers *special problem implementation	0 / 0	(无)
	240	P1570E Erasing Zeroes *special problem strings	0 / 0	(无)
	239	P1570F Square Filling *special problem	0 / 0	(无)
	238	P1570G XOR Guessing *special problem interactive	0 / 0	(无)
	237	P1570H Chainword *special problem data structures strings	0 / 0	(无)
	236	P1570I Minimum Difference *special problem	0 / 0	(无)
	235	P1571A Sequence of Comparisons special problem 800	0 / 0	(无)
	234	P1571B Epic Novel special problem math 1300	0 / 0	(无)
	233	P1571C Rhyme special problem implementation 1800	0 / 0	(无)
	232	P1571D Sweepstake special problem brute force constructive algorithms implementation math 1800	0 / 0	(无)
	231	P1571E Fix the String special problem bitmasks dp greedy 1700	0 / 0	(无)
	230	P1571F Kotlinforces special problem constructive algorithms dp 2000	0 / 0	(无)
	229	P1571G A Battle Against a Dragon special problem data structures dp 2500	0 / 0	(无)
	228	P1571H Laser Beams special problem geometry probabilities 2900	0 / 0	(无)
	227	P1571I Physical Examination special problem binary search data structures 3200	0 / 0	(无)
	226	P1571J Two Railroads special problem 3000	0 / 0	(无)
	225	P1572A Book binary search brute force data structures dp graphs implementation sortings *1800	0 / 0	(无)
	224	P1572B Xor of 3 brute force constructive algorithms greedy two pointers *2500	0 / 0	(无)
	223	P1572C Paint dp greedy *2700	0 / 0	(无)
	222	P1572D Bridge Club flows graph matchings graphs greedy *2800	0 / 0	(无)
	221	P1572E Polygon binary search dp geometry *3000	0 / 0	(无)
	220	P1572F Stations data structures *3400	0 / 0	(无)
	219	P1573A Countdown greedy *800	0 / 0	(无)
	218	P1573B Swaps greedy math sortings *1400	0 / 0	(无)
	217	P1574A Regular Bracket Sequences constructive algorithms *800	0 / 0	(无)
	216	P1574B Combinatorics Homework combinatorics greedy math *1100	0 / 0	(无)
	215	P1574C Slay the Dragon binary search greedy sortings ternary search *1300	0 / 0	(无)
	214	P1574D The Strongest Build binary search brute force data structures dfs and similar graphs greedy hashing implementation *2000	0 / 0	(无)
	213	P1574E Coloring combinatorics constructive algorithms implementation math *2500	0 / 0	(无)
	212	P1574F Occurrences combinatorics dfs and similar dp dsu fft graphs *2700	0 / 0	(无)
	211	P1575A Another Sorting Problem data structures sortings strings *1100	0 / 0	(无)
	210	P1575B Building an Amusement Park binary search geometry *2300	0 / 0	(无)
	209	P1575C Cyclic Sum data structures fft number theory *3000	0 / 0	(无)
	208	P1575D Divisible by Twenty-Five brute force dfs and similar dp *1800	0 / 0	(无)
	207	P1575E Eye-Pleasing City Park Tour data structures trees *2600	0 / 0	(无)
	206	P1575F Finding Expected Value math *2900	0 / 0	(无)

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