brute force - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	478	P1555C Coin Rows brute force constructive algorithms dp implementation *1300	0 / 0	(None)
	477	P1555D Say No to Palindromes brute force constructive algorithms dp strings *1600	0 / 0	(None)
	472	P1556C Compressed Bracket Sequence brute force implementation *1800	0 / 0	(None)
	466	P1557A Ezzat and Two Subsequences brute force math sortings *800	0 / 0	(None)
	462	P1557E Assiut Chess brute force constructive algorithms interactive *2800	0 / 0	(None)
	461	P1558A Charmed by the Game brute force math *1300	0 / 0	(None)
	460	P1558B Up the Strip brute force dp math number theory two pointers *1900	0 / 0	(None)
	452	P1559D1 Mocha and Diana (Easy Version) brute force constructive algorithms dsu graphs greedy trees *1400	0 / 0	(None)
	451	P1559D2 Mocha and Diana (Hard Version) brute force constructive algorithms dfs and similar dsu graphs greedy trees two pointers *2500	0 / 0	(None)
	444	P1560F1 Nearest Beautiful Number (easy version) binary search bitmasks brute force constructive algorithms dfs and similar greedy *1900	0 / 0	(None)
	443	P1560F2 Nearest Beautiful Number (hard version) bitmasks brute force constructive algorithms dfs and similar dp greedy *2100	0 / 0	(None)
	442	P1561A Simply Strange Sort brute force implementation sortings *800	0 / 0	(None)
	440	P1561D1 Up the Strip (simplified version) brute force data structures dp math number theory *1700	0 / 0	(None)
	438	P1562B Scenes From a Memory brute force constructive algorithms implementation math number theory *1000	0 / 0	(None)
	413	P1569E Playoff Restoration bitmasks brute force hashing implementation meet-in-the-middle *2600	0 / 0	(None)
	412	P1569F Palindromic Hamiltonian Path brute force dfs and similar dp graphs hashing *3000	0 / 0	(None)
	408	P1571D Sweepstake special problem brute force constructive algorithms implementation math 1800	0 / 0	(None)
	401	P1572A Book binary search brute force data structures dp graphs implementation sortings *1800	0 / 0	(None)
	400	P1572B Xor of 3 brute force constructive algorithms greedy two pointers *2500	0 / 0	(None)
	390	P1574D The Strongest Build binary search brute force data structures dfs and similar graphs greedy hashing implementation *2000	0 / 0	(None)

Pick a problem randomly based on the current filter.