*2200 - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	8500	P1841E Fill the Matrix data structures greedy math *2200	0 / 0	8
	8587	P1848D Vika and Bonuses binary search brute force math ternary search *2200	0 / 0	8
	8628	P1854B Earn or Unlock bitmasks brute force dp *2200	0 / 0	8
	8605	P1858D Trees and Segments brute force data structures dp greedy two pointers *2200	0 / 0	8
	8857	P1898E Sofia and Strings data structures greedy sortings strings two pointers *2200	0 / 0	8
	8838	P1901E Compressed Tree dfs and similar dp graphs greedy sortings trees *2200	0 / 0	8
	8900	P1907G Lights brute force constructive algorithms dfs and similar graphs greedy implementation *2200	0 / 0	8
	8970	P1909F1 Small Permutation Problem (Easy Version) brute force combinatorics dp math *2200	0 / 0	8
	8885	P1912E Evaluate It and Back Again constructive algorithms implementation math *2200	0 / 0	8
	8991	P1921G Mischievous Shooter brute force data structures divide and conquer dp implementation *2200	0 / 0	8
	9087	P1946E Girl Permutation combinatorics dp math number theory *2200	0 / 0	8
	9234	P1954E Chain Reaction binary search data structures dsu greedy implementation math number theory *2200	0 / 0	8
	9200	P1967B2 Reverse Card (Hard Version) brute force math number theory *2200	0 / 0	8
	9187	P1968G2 Division + LCP (hard version) binary search brute force data structures dp hashing math string suffix structures strings *2200	0 / 0	8
	9337	P1985H2 Maximize the Largest Component (Hard Version) data structures dfs and similar dp dsu implementation *2200	0 / 0	8
	9330	P1986G1 Permutation Problem (Simple Version) binary search brute force combinatorics data structures math number theory *2200	0 / 0	8

Pick a problem randomly based on the current filter.