brute force - 题库 - 猫猫星の守望

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	195	P1535B Array Reodering brute force greedy math number theory sortings *900	0 / 0	(无)
	191	P1535F String Distance binary search brute force data structures hashing implementation strings *3000	0 / 0	(无)
	190	P1536A Omkar and Bad Story brute force constructive algorithms *800	0 / 0	(无)
	189	P1536B Prinzessin der Verurteilung brute force constructive algorithms strings *1200	0 / 0	(无)
	180	P1537E1 Erase and Extend (Easy Version) binary search brute force dp greedy hashing implementation string suffix structures strings two pointers *1600	1 / 5	10
	177	P1538A Stone Game brute force dp greedy *800	0 / 0	(无)
	163	P1540B Tree Array brute force combinatorics dp graphs math probabilities trees *2300	0 / 0	(无)
	160	P1540D Inverse Inversions binary search brute force data structures *3200	0 / 0	(无)
	157	P1541B Pleasant Pairs brute force implementation math number theory *1200	0 / 0	(无)
	148	P1543C Need for Pink Slips bitmasks brute force dfs and similar implementation math probabilities *1900	0 / 0	(无)
	146	P1543D2 RPD and Rap Sheet (Hard Version) brute force constructive algorithms interactive math *2200	0 / 0	(无)
	142	P1545C AquaMoon and Permutations 2-sat brute force combinatorics constructive algorithms graph matchings graphs *2800	0 / 0	(无)
	138	P1545F AquaMoon and Potatoes brute force data structures dp *3500	0 / 0	(无)
	137	P1546A AquaMoon and Two Arrays brute force greedy *800	0 / 0	(无)
	130	P1547F Array Stabilization (GCD version) binary search brute force data structures divide and conquer number theory two pointers *1900	0 / 0	(无)
	128	P1548A Web of Lies brute force graphs greedy *1400	0 / 0	(无)
	124	P1548D2 Gregor and the Odd Cows (Hard) brute force geometry math number theory *3300	0 / 0	(无)
	118	P1550C Manhattan Subarrays brute force geometry greedy implementation *1700	0 / 0	(无)
	116	P1550E Stringforces binary search bitmasks brute force dp strings two pointers *2500	0 / 0	(无)
	108	P1551E Fixed Points binary search brute force dp *2000	0 / 0	(无)
	107	P1551F Equidistant Vertices brute force combinatorics dfs and similar dp trees *2200	0 / 0	(无)
	103	P1552D Array Differentiation bitmasks brute force constructive algorithms dfs and similar dp graphs math *1800	0 / 0	(无)
	100	P1552G A Serious Referee bitmasks brute force dfs and similar sortings *3000	0 / 0	(无)
	96	P1553B Reverse String brute force dp hashing implementation strings *1300	0 / 0	(无)
	95	P1553C Penalty bitmasks brute force dp greedy *1200	0 / 0	(无)
	93	P1553E Permutation Shift brute force combinatorics constructive algorithms dfs and similar dsu graphs math *2100	0 / 0	(无)
	91	P1553G Common Divisor Graph brute force constructive algorithms dsu graphs hashing math number theory *2700	0 / 0	(无)
	87	P1554B Cobb bitmasks brute force greedy math *1700	0 / 0	(无)
	83	P1555A PizzaForces brute force math *900	0 / 0	(无)
	82	P1555B Two Tables brute force *1300	0 / 0	(无)
	81	P1555C Coin Rows brute force constructive algorithms dp implementation *1300	0 / 0	(无)
	80	P1555D Say No to Palindromes brute force constructive algorithms dp strings *1600	0 / 0	(无)
	75	P1556C Compressed Bracket Sequence brute force implementation *1800	0 / 0	(无)
	69	P1557A Ezzat and Two Subsequences brute force math sortings *800	0 / 0	(无)
	65	P1557E Assiut Chess brute force constructive algorithms interactive *2800	0 / 0	(无)
	64	P1558A Charmed by the Game brute force math *1300	0 / 0	(无)
	63	P1558B Up the Strip brute force dp math number theory two pointers *1900	0 / 0	(无)
	55	P1559D1 Mocha and Diana (Easy Version) brute force constructive algorithms dsu graphs greedy trees *1400	0 / 0	(无)
	54	P1559D2 Mocha and Diana (Hard Version) brute force constructive algorithms dfs and similar dsu graphs greedy trees two pointers *2500	0 / 0	(无)
	47	P1560F1 Nearest Beautiful Number (easy version) binary search bitmasks brute force constructive algorithms dfs and similar greedy *1900	0 / 0	(无)
	46	P1560F2 Nearest Beautiful Number (hard version) bitmasks brute force constructive algorithms dfs and similar dp greedy *2100	0 / 0	(无)
	45	P1561A Simply Strange Sort brute force implementation sortings *800	0 / 0	(无)
	43	P1561D1 Up the Strip (simplified version) brute force data structures dp math number theory *1700	0 / 0	(无)
	41	P1562B Scenes From a Memory brute force constructive algorithms implementation math number theory *1000	0 / 0	(无)
	16	P1569E Playoff Restoration bitmasks brute force hashing implementation meet-in-the-middle *2600	0 / 0	(无)
	15	P1569F Palindromic Hamiltonian Path brute force dfs and similar dp graphs hashing *3000	0 / 0	(无)
	14	P1572A Book binary search brute force data structures dp graphs implementation sortings *1800	0 / 0	(无)
	13	P1572B Xor of 3 brute force constructive algorithms greedy two pointers *2500	0 / 0	(无)
	3	P1574D The Strongest Build binary search brute force data structures dfs and similar graphs greedy hashing implementation *2000	0 / 0	(无)
	7241	P1575D Divisible by Twenty-Five brute force dfs and similar dp	0 / 0	(无)

根据当前过滤条件随机选择一道题