strings - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	8049	P1750E Bracket Cost binary search data structures divide and conquer dp greedy strings	0 / 0	(None)
	8048	P1750F Majority combinatorics dp strings	0 / 0	(None)
	8079	P1759A Yes-Yes? implementation strings *800	0 / 0	3
	8125	P1771D Hossam and (sub-)palindromic tree brute force data structures dfs and similar dp strings trees *2100	0 / 0	7
	8123	P1771F Hossam and Range Minimum Query binary search bitmasks data structures hashing probabilities strings trees *2500	0 / 0	9
	8119	P1775A1 Gardener and the Capybaras (easy version) brute force implementation strings	0 / 0	(None)
	8118	P1775A2 Gardener and the Capybaras (hard version) constructive algorithms greedy strings	0 / 0	(None)
	8174	P1777F Comfortably Numb binary search bitmasks data structures divide and conquer dsu strings trees two pointers	0 / 0	(None)
	8229	P1778C Flexible String bitmasks brute force strings	0 / 0	(None)
	8112	P1779A Hall of Fame constructive algorithms greedy strings	0 / 0	(None)
	8171	P1781C Equal Frequencies brute force constructive algorithms greedy implementation sortings strings *1600	0 / 0	5
	8284	P1789B Serval and Inversion Magic brute force implementation strings two pointers *800	0 / 0	3
	8280	P1789F Serval and Brain Power bitmasks brute force dp greedy implementation strings *2700	0 / 0	10
	8201	P1790A Polycarp and the Day of Pi implementation math strings *800	0 / 0	3
	8194	P1791A Codeforces Checking implementation strings *800	0 / 0	3
	8191	P1791D Distinct Split brute force greedy strings *1000	0 / 0	3
	8279	P1794A Prefix and Suffix Array constructive algorithms strings	0 / 0	(None)
	8238	P1795A Two Towers brute force implementation strings *800	0 / 0	3
	8274	P1796A Typical Interview Problem brute force implementation strings *800	0 / 0	3
	8273	P1796B Asterisk-Minor Template implementation strings *1000	0 / 0	3

Pick a problem randomly based on the current filter.