brute force - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	8952	P1914G1 Light Bulbs (Easy Version) brute force combinatorics dfs and similar dp dsu graphs math trees *2100	0 / 0	7
	8949	P1915B Not Quite Latin Square bitmasks brute force implementation *800	0 / 0	3
	8940	P1916D Mathematical Problem brute force constructive algorithms geometry math *1700	0 / 0	5
	8936	P1916H1 Matrix Rank (Easy Version) brute force combinatorics dp math matrices *2700	0 / 0	10
	8933	P1917B Erase First or Second Letter brute force combinatorics data structures dp strings *1100	0 / 0	3
	8932	P1917C Watering an Array brute force greedy implementation math *1600	0 / 0	5
	9004	P1920A Satisfying Constraints brute force greedy math *800	0 / 0	3
	9002	P1920C Partitioning the Array brute force math number theory *1500	0 / 0	5
	9001	P1920D Array Repetition binary search brute force dsu implementation math *1800	0 / 0	6
	8999	P1920F1 Smooth Sailing (Easy Version) binary search brute force data structures dfs and similar dsu graphs shortest paths *2500	0 / 0	9
	8993	P1921E Eat the Chip brute force games greedy math *1600	0 / 0	5
	8992	P1921F Sum of Progression brute force data structures dp implementation math *1900	0 / 0	6
	8991	P1921G Mischievous Shooter brute force data structures divide and conquer dp implementation *2200	0 / 0	8
	8987	P1922D Berserk Monsters brute force data structures dsu implementation math *1900	0 / 0	6
	9062	P1923F Shrink-Reverse binary search brute force greedy hashing implementation string suffix structures strings	0 / 0	(None)
	8977	P1925B A Balanced Problemset? brute force greedy math number theory	0 / 0	(None)
	9056	P1926F Vlad and Avoiding X bitmasks brute force dfs and similar dp implementation	0 / 0	(None)
	9052	P1927C Choose the Different Ones! brute force greedy math *1000	0 / 0	3
	9051	P1927D Find the Different Ones! binary search brute force data structures dp dsu greedy two pointers *1300	0 / 0	4
	9045	P1928C Physical Education Lesson brute force math number theory *1600	0 / 0	5

Pick a problem randomly based on the current filter.