brute force - 题库 - 思+学堂

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	155	P1709F Multiset of Strings bitmasks brute force dp fft flows graphs math meet-in-the-middle trees *2500	0 / 0	9
	153	P1710B Rain binary search brute force data structures geometry greedy implementation math *2100	0 / 0	7
	152	P1710C XOR Triangle bitmasks brute force constructive algorithms dp greedy math *2500	0 / 0	9
	148	P1711B Party brute force graphs *1300	0 / 0	4
	143	P1712E1 LCM Sum (easy version) binary search brute force combinatorics math number theory two pointers *2300	0 / 0	8
	142	P1712E2 LCM Sum (hard version) brute force data structures math number theory two pointers *2500	0 / 0	9
	131	P1714D Color with Occurrences brute force data structures dp greedy strings *1600	0 / 0	5
	130	P1714E Add Modulo 10 brute force math number theory *1400	0 / 0	4
	118	P1716D Chip Move brute force dp math *2000	0 / 0	7
	98	P1720B Interesting Sum brute force data structures greedy math sortings *800	0 / 0	3
	96	P1720D1 Xor-Subsequence (easy version) bitmasks brute force dp strings trees two pointers *1800	1 / 1	6
	88	P1721F Matching Reduction brute force constructive algorithms dfs and similar flows graph matchings graphs interactive *2800	0 / 0	10
	83	P1722E Counting Rectangles brute force data structures dp implementation *1600	0 / 0	5
	64	P1726D Edge Split brute force constructive algorithms dfs and similar dsu graphs probabilities trees *2000	0 / 0	7
	59	P1728A Colored Balls: Revisited brute force greedy implementation sortings *800	0 / 0	3
	55	P1728E Red-Black Pepper brute force data structures greedy math number theory *2300	0 / 0	8
	53	P1728G Illumination binary search bitmasks brute force combinatorics dp math two pointers *2700	0 / 0	10
	8146	P1732C2 Sheikh (Hard Version) binary search bitmasks brute force greedy implementation two pointers *2100	0 / 0	7
	8145	P1732D1 Balance (Easy version) brute force data structures implementation *1500	0 / 0	5
	8144	P1732D2 Balance (Hard version) brute force data structures *2400	0 / 0	9
	33	P1734A Select Three Sticks brute force greedy sortings *800	0 / 0	3
	24	P1735D Meta-set brute force combinatorics data structures hashing math *1700	0 / 0	5
	8097	P1741C Minimize the Thickness brute force greedy math two pointers	0 / 0	(无)
	8093	P1741G Kirill and Company bitmasks brute force dp graphs shortest paths	0 / 0	(无)
	8102	P1742D Coprime brute force greedy number theory *1100	0 / 0	3
	8113	P1742G Orray bitmasks brute force greedy math sortings *1500	0 / 0	5
	8124	P1743D Problem with Random Tests brute force constructive algorithms implementation probabilities *1700	0 / 0	5
	8116	P1744E1 Divisible Numbers (easy version) brute force math number theory	0 / 0	(无)
	8115	P1744E2 Divisible Numbers (hard version) brute force math number theory	0 / 0	(无)
	8114	P1744F MEX vs MED brute force math two pointers	0 / 0	(无)
	8160	P1748B Diverse Substrings brute force implementation strings *1400	0 / 0	4
	8158	P1748C Zero-Sum Prefixes brute force data structures dp greedy implementation *1600	0 / 0	5
	8154	P1750B Maximum Substring brute force greedy implementation *800	0 / 0	3
	8137	P1753E N Machines binary search brute force greedy *3300	0 / 0	10
	8135	P1753F Minecraft Series brute force two pointers *3500	0 / 0	10
	8258	P1765E Exchange brute force math *1000	0 / 0	3
	8251	P1765L Project Manager brute force data structures implementation *2400	0 / 0	9
	8248	P1766A Extremely Round brute force implementation *800	0 / 0	3
	8244	P1766E Decomposition binary search brute force data structures divide and conquer dp two pointers *2300	0 / 0	8
	8238	P1767E Algebra Flash bitmasks brute force dp graphs math meet-in-the-middle trees *2500	0 / 0	9
	8230	P1770A Koxia and Whiteboards brute force greedy	0 / 0	(无)
	8228	P1770C Koxia and Number Theory brute force chinese remainder theorem math number theory	0 / 0	(无)
	8219	P1771D Hossam and (sub-)palindromic tree brute force data structures dfs and similar dp strings trees *2100	0 / 0	7
	8218	P1771E Hossam and a Letter brute force dp implementation two pointers *2500	0 / 0	9
	8215	P1772B Matrix Rotation brute force implementation *800	0 / 0	3
	8203	P1773I Interactive Factorial Guessing brute force games implementation interactive *2500	0 / 0	9
	8195	P1774D Same Count One brute force constructive algorithms greedy implementation two pointers *1600	0 / 0	5
	8193	P1774F1 Magician and Pigs (Easy Version) brute force data structures implementation *2400	0 / 0	9
	8192	P1774F2 Magician and Pigs (Hard Version) binary search brute force data structures implementation *2700	0 / 0	10
	8191	P1774G Segment Covering brute force combinatorics constructive algorithms data structures dp trees *3200	0 / 0	10

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