brute force - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	8802	P1884A Simple Design brute force greedy math	0 / 0	(None)
	8800	P1884C Medium Design brute force data structures dp greedy sortings	0 / 0	(None)
	8754	P1886A Sum of Three brute force constructive algorithms math	0 / 0	(None)
	8796	P1887C Minimum Array binary search brute force constructive algorithms data structures greedy hashing two pointers	0 / 0	(None)
	8790	P1889C1 Doremy's Drying Plan (Easy Version) brute force data structures dp greedy sortings	0 / 0	(None)
	8788	P1889D Game of Stacks brute force dfs and similar graphs implementation trees	0 / 0	(None)
	8782	P1891B Deja Vu brute force math sortings	0 / 0	(None)
	8780	P1891D Suspicious logarithms binary search brute force math	0 / 0	(None)
	8779	P1891E Brukhovich and Exams brute force greedy implementation math sortings	0 / 0	(None)
	8877	P1893A Anonymous Informant brute force dfs and similar graphs implementation *1400	0 / 0	4
	8875	P1893C Freedom of Choice brute force greedy implementation *2000	0 / 0	7
	8775	P1895C Torn Lucky Ticket brute force dp hashing implementation math	0 / 0	(None)
	8773	P1895E Infinite Card Game binary search brute force dfs and similar dsu games graphs greedy sortings two pointers	0 / 0	(None)
	8863	P1896H1 Cyclic Hamming (Easy Version) brute force divide and conquer dp fft math number theory *3400	0 / 0	10
	8862	P1896H2 Cyclic Hamming (Hard Version) brute force dp fft math number theory *3500	0 / 0	10
	8861	P1898A Milica and String brute force implementation strings *800	0 / 0	3
	8856	P1898F Vova Escapes the Matrix brute force dfs and similar divide and conquer shortest paths *2600	0 / 0	10
	8854	P1899B 250 Thousand Tons of TNT brute force implementation number theory *1100	0 / 0	3
	8845	P1900D Small GCD bitmasks brute force dp math number theory *2000	0 / 0	7
	8836	P1902A Halloumi Boxes brute force greedy sortings *800	0 / 0	3

Pick a problem randomly based on the current filter.