brute force - 题库 - 思+学堂

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	9390	P1970A2 Balanced Unshuffle (Medium) brute force constructive algorithms trees *2400	0 / 0	9
	9381	P1970D1 Arithmancy (Easy) brute force constructive algorithms interactive strings *2100	0 / 0	7
	9371	P1970G2 Min-Fund Prison (Medium) brute force dfs and similar dp graphs trees *2200	0 / 0	8
	9364	P1971F Circle Perimeter binary search brute force dfs and similar geometry implementation math *1600	0 / 0	5
	9361	P1972A Contest Proposal brute force greedy two pointers *800	0 / 0	3
	9359	P1973A Chess For Three brute force dp implementation math *900	0 / 0	3
	9356	P1973D Cat, Fox and Maximum Array Split brute force interactive math *2400	0 / 0	9
	9354	P1973F Maximum GCD Sum Queries bitmasks brute force dp implementation number theory *3100	0 / 0	10
	9348	P1974F Cutting Game binary search brute force data structures implementation sortings two pointers *1900	0 / 0	6
	9346	P1975A Bazoka and Mocha's Array brute force greedy implementation sortings *800	0 / 0	3
	9345	P1975B 378QAQ and Mocha's Array brute force greedy math sortings *1000	0 / 0	3
	9344	P1975C Chamo and Mocha's Array binary search brute force greedy *1200	0 / 0	4
	9343	P1975D Paint the Tree brute force dfs and similar dp greedy shortest paths trees *1700	0 / 0	5
	9341	P1975F Set bitmasks brute force combinatorics dfs and similar divide and conquer dp math *2600	0 / 0	10
	9329	P1977C Nikita and LCM brute force data structures dp greedy math number theory sortings *1900	0 / 0	6
	9328	P1977D XORificator bitmasks brute force greedy hashing *2300	0 / 0	8
	9326	P1979A Guess the Maximum brute force greedy implementation *800	0 / 0	3
	9324	P1979D Fixing a Binary String bitmasks brute force constructive algorithms greedy hashing strings *1800	0 / 0	6
	9322	P1979F Kostyanych's Theorem brute force constructive algorithms graphs interactive *2900	0 / 0	10
	9311	P1981A Turtle and Piggy Are Playing a Game brute force greedy math *800	0 / 0	3
	9310	P1981C Turtle and an Incomplete Sequence bitmasks brute force constructive algorithms greedy implementation math *1800	0 / 0	6
	9466	P1982B Collatz Conjecture brute force implementation math number theory *1200	0 / 0	4
	9464	P1982D Beauty of the mountains brute force data structures implementation math number theory *1700	0 / 0	5
	9463	P1982E Number of k-good subarrays bitmasks brute force combinatorics divide and conquer dp math meet-in-the-middle *2300	0 / 0	8
	9459	P1983C Have Your Cake and Eat It Too binary search bitmasks brute force constructive algorithms dp greedy implementation	0 / 0	(无)
	9455	P1983G Your Loss bitmasks brute force dp trees	0 / 0	(无)
	9419	P1984D "a" String Problem brute force hashing implementation math string suffix structures strings *2000	0 / 0	7
	9417	P1984F Reconstruction brute force dp math *2500	0 / 0	9
	9413	P1985B Maximum Multiple Sum brute force math number theory	0 / 0	(无)
	9410	P1985E Secret Box brute force combinatorics math	0 / 0	(无)
	9408	P1985H1 Maximize the Largest Component (Easy Version) brute force data structures dfs and similar dsu graphs implementation	0 / 0	(无)
	9454	P1986A X Axis brute force geometry math sortings *800	0 / 0	3
	9453	P1986B Matrix Stabilization brute force data structures greedy sortings *1000	0 / 0	3
	9451	P1986D Mathematical Problem brute force dp greedy implementation math two pointers *1400	0 / 0	4
	9448	P1986G1 Permutation Problem (Simple Version) binary search brute force combinatorics data structures math number theory *2200	0 / 0	8
	9447	P1986G2 Permutation Problem (Hard Version) brute force data structures hashing math number theory *2500	0 / 0	9
	9442	P1987E Wonderful Tree! brute force data structures dfs and similar dsu greedy trees *2000	0 / 0	7
	9435	P1989B Substring and Subsequence brute force greedy strings *1200	0 / 0	4
	9433	P1989D Smithing Skill brute force data structures dp greedy math sortings two pointers *1900	0 / 0	6

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