brute force - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	9301	P1973D Cat, Fox and Maximum Array Split brute force interactive math *2400	0 / 0	9
	9299	P1973F Maximum GCD Sum Queries bitmasks brute force dp implementation number theory *3100	0 / 0	10
	9293	P1974F Cutting Game binary search brute force data structures implementation sortings two pointers *1900	0 / 0	6
	9291	P1975A Bazoka and Mocha's Array brute force greedy implementation sortings *800	0 / 0	3
	9290	P1975B 378QAQ and Mocha's Array brute force greedy math sortings *1000	0 / 0	3
	9289	P1975C Chamo and Mocha's Array binary search brute force greedy *1200	0 / 0	4
	9288	P1975D Paint the Tree brute force dfs and similar dp greedy shortest paths trees *1700	0 / 0	5
	9286	P1975F Set bitmasks brute force combinatorics dfs and similar divide and conquer dp math *2600	0 / 0	10
	9274	P1977C Nikita and LCM brute force data structures dp greedy math number theory sortings *1900	0 / 0	6
	9273	P1977D XORificator bitmasks brute force greedy hashing *2300	0 / 0	8
	9375	P1978E Computing Machine brute force data structures dp greedy implementation *2000	0 / 0	7
	9373	P1979A Guess the Maximum brute force greedy implementation *800	0 / 0	3
	9370	P1979D Fixing a Binary String bitmasks brute force constructive algorithms dp greedy hashing strings *1800	0 / 0	6
	9368	P1979F Kostyanych's Theorem brute force constructive algorithms graphs interactive *2900	0 / 0	10
	9263	P1981A Turtle and Piggy Are Playing a Game brute force greedy math	0 / 0	(None)
	9261	P1981C Turtle and an Incomplete Sequence bitmasks brute force constructive algorithms greedy implementation math	0 / 0	(None)
	9366	P1982B Collatz Conjecture brute force implementation math number theory *1200	0 / 0	4
	9364	P1982D Beauty of the mountains brute force data structures implementation math number theory *1700	0 / 0	5
	9363	P1982E Number of k-good subarrays bitmasks brute force combinatorics divide and conquer dp math meet-in-the-middle *2300	0 / 0	8
	9359	P1983C Have Your Cake and Eat It Too binary search brute force dp greedy implementation	0 / 0	(None)

Pick a problem randomly based on the current filter.