brute force - 题库 - 达芬奇编程

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	1708	P1671B Consecutive Points Segment brute force math sortings *1000	0 / 0	3
	1707	P1671C Dolce Vita binary search brute force greedy math *1200	0 / 0	4
	1706	P1671D Insert a Progression brute force constructive algorithms greedy *1600	0 / 0	5
	1704	P1671F Permutation Counting brute force combinatorics dp fft math *2700	0 / 0	10
	1692	P1673B A Perfectly Balanced String? brute force greedy strings *1100	0 / 0	3
	1691	P1673C Palindrome Basis brute force dp math number theory *1500	0 / 0	5
	1683	P1674E Breaking the Wall binary search brute force constructive algorithms greedy math *2000	0 / 0	7
	1671	P1676C Most Similar Words brute force greedy implementation implementation math strings *800	0 / 0	3
	1670	P1676D X-Sum brute force greedy implementation *1000	0 / 0	3
	1666	P1676H1 Maximum Crossings (Easy Version) brute force *1400	0 / 0	4
	1664	P1677A Tokitsukaze and Strange Inequality brute force data structures dp *1600	0 / 0	5
	1655	P1679A AvtoBus brute force greedy math number theory *900	0 / 0	3
	1649	P1680A Minimums and Maximums brute force math *800	0 / 0	3
	1646	P1680D Dog Walking brute force greedy math *2400	0 / 0	9
	1640	P1681D Required Length brute force dfs and similar dp hashing shortest paths *1700	0 / 0	5
	1629	P1684C Column Swapping brute force constructive algorithms greedy implementation sortings *1400	0 / 0	4
	1627	P1684E MEX vs DIFF binary search brute force constructive algorithms data structures greedy two pointers *2100	0 / 0	7
	1621	P1685C Bring Balance brute force constructive algorithms greedy *2600	0 / 0	10
	1615	P1687A The Enchanted Forest brute force greedy *1600	0 / 0	5
	1613	P1687C Sanae and Giant Robot binary search brute force data structures dsu greedy sortings *2500	0 / 0	9
	1612	P1687D Cute number binary search brute force data structures dsu implementation math *2900	0 / 0	10
	1609	P1688A Cirno's Perfect Bitmasks Classroom bitmasks brute force *800	0 / 0	3
	1606	P1689A Lex String brute force greedy implementation sortings two pointers *800	0 / 0	3
	1602	P1689E ANDfinity bitmasks brute force constructive algorithms dfs and similar dsu graphs *2500	0 / 0	9
	1594	P1691A Beat The Odds brute force greedy math *800	0 / 0	3
	1592	P1691C Sum of Substrings brute force constructive algorithms greedy math strings *1400	0 / 0	4
	1585	P1692D The Clock brute force implementation *1100	0 / 0	3
	1583	P1692F 3SUM brute force math *1300	0 / 0	4
	1577	P1693D Decinc Dividing brute force data structures divide and conquer dp greedy *2800	0 / 0	10
	1570	P1695C Zero Path brute force data structures dp graphs greedy shortest paths *1700	0 / 0	5
	1569	P1695D1 Tree Queries (Easy Version) brute force constructive algorithms dfs and similar dp greedy trees *2200	0 / 0	8
	1561	P1696F Tree Recovery brute force constructive algorithms dfs and similar dsu graphs trees *2600	0 / 0	10
	1560	P1696G Fishingprince Plays With Array Again brute force data structures geometry math *3300	0 / 0	10
	1559	P1696H Maximum Product? brute force combinatorics dp greedy implementation math two pointers *3500	0 / 0	10
	1554	P1697E Coloring brute force combinatorics constructive algorithms dp geometry graphs greedy implementation math *2400	0 / 0	9
	1552	P1698A XOR Mixup bitmasks brute force *800	0 / 0	3
	1550	P1698C 3SUM Closure brute force data structures *1300	0 / 0	4
	1548	P1698E PermutationForces II brute force combinatorics greedy sortings trees two pointers *2300	0 / 0	8
	1536	P1700E Serega the Pirate brute force constructive algorithms *2600	0 / 0	10
	1530	P1701E Text Editor brute force dp greedy strings *2500	0 / 0	9
	1520	P1703A YES or YES? brute force implementation strings *800	0 / 0	3
	1518	P1703C Cypher brute force implementation strings *800	0 / 0	3
	1517	P1703D Double Strings brute force data structures strings *1100	0 / 0	3
	1514	P1703G Good Key, Bad Key bitmasks brute force dp greedy math *1600	0 / 0	5
	1512	P1704B Luke is a Foodie brute force greedy implementation *1000	0 / 0	3
	1509	P1704E Count Seconds brute force constructive algorithms dp graphs implementation math *2200	0 / 0	8
	1502	P1705C Mark and His Unfinished Essay brute force implementation *1400	0 / 0	4
	1500	P1705E Mark and Professor Koro binary search bitmasks brute force combinatorics data structures greedy *2300	0 / 0	8
	1495	P1706D1 Chopping Carrots (Easy Version) binary search brute force constructive algorithms greedy number theory *1700	0 / 0	5
	1494	P1706D2 Chopping Carrots (Hard Version) brute force constructive algorithms data structures dp greedy math number theory two pointers *2400	0 / 0	9
	1491	P1707B Difference Array brute force data structures implementation sortings *1900	0 / 0	6
	1484	P1709A Three Doors brute force greedy implementation math *800	0 / 0	3
	1479	P1709F Multiset of Strings bitmasks brute force dp fft flows graphs math meet-in-the-middle trees *2500	0 / 0	9
	1477	P1710B Rain binary search brute force data structures geometry greedy implementation math *2100	0 / 0	7
	1476	P1710C XOR Triangle bitmasks brute force constructive algorithms dp greedy math *2500	0 / 0	9
	1472	P1711B Party brute force graphs *1300	0 / 0	4
	1467	P1712E1 LCM Sum (easy version) binary search brute force combinatorics math number theory two pointers *2300	0 / 0	8
	1466	P1712E2 LCM Sum (hard version) brute force data structures math number theory two pointers *2500	0 / 0	9
	1455	P1714D Color with Occurrences brute force data structures dp greedy strings *1600	0 / 0	5
	1454	P1714E Add Modulo 10 brute force math number theory *1400	0 / 0	4
	1442	P1716D Chip Move brute force dp math *2000	0 / 0	7
	1422	P1720B Interesting Sum brute force data structures greedy math sortings *800	0 / 0	3
	1420	P1720D1 Xor-Subsequence (easy version) bitmasks brute force dp strings trees two pointers *1800	0 / 0	6
	1412	P1721F Matching Reduction brute force constructive algorithms dfs and similar flows graph matchings graphs interactive *2800	0 / 0	10
	1407	P1722E Counting Rectangles brute force data structures dp implementation *1600	0 / 0	5
	1388	P1726D Edge Split brute force constructive algorithms dfs and similar dsu graphs probabilities trees *2000	0 / 0	7
	1383	P1728A Colored Balls: Revisited brute force greedy implementation sortings *800	0 / 0	3
	1379	P1728E Red-Black Pepper brute force data structures greedy math number theory *2300	0 / 0	8
	1377	P1728G Illumination binary search bitmasks brute force combinatorics dp math two pointers *2700	0 / 0	10
	1361	P1731C Even Subarrays bitmasks brute force hashing math number theory *1700	0 / 0	5
	1360	P1731D Valiant's New Map binary search brute force data structures dp two pointers *1700	0 / 0	5
	1358	P1731F Function Sum brute force combinatorics dp fft math *2500	0 / 0	9
	1357	P1732A Bestie brute force combinatorics constructive algorithms implementation math number theory *1000	0 / 0	3
	1356	P1732B Ugu brute force dp greedy implementation *900	0 / 0	3
	1354	P1732C2 Sheikh (Hard Version) binary search bitmasks brute force greedy implementation two pointers *2100	0 / 0	7
	1353	P1732D1 Balance (Easy version) brute force data structures implementation number theory *1500	0 / 0	5
	1352	P1732D2 Balance (Hard version) brute force data structures number theory *2400	0 / 0	9
	1344	P1734A Select Three Sticks brute force greedy sortings *800	0 / 0	3
	1335	P1735D Meta-set brute force combinatorics data structures hashing math *1700	0 / 0	5
	1332	P1736A Make A Equal to B brute force greedy sortings *800	0 / 0	3
	1323	P1737D Ela and the Wiring Wizard brute force dp graphs greedy implementation shortest paths *2200	0 / 0	8
	1294	P1741C Minimize the Thickness brute force greedy math two pointers *1100	0 / 0	3
	1290	P1741G Kirill and Company bitmasks brute force dfs and similar dp flows graphs shortest paths *2200	0 / 0	8
	1286	P1742D Coprime brute force greedy number theory *1100	0 / 0	3
	1283	P1742G Orray bitmasks brute force greedy math sortings *1500	0 / 0	5
	1282	P1743A Password brute force combinatorics implementation math *800	0 / 0	3
	1279	P1743D Problem with Random Tests brute force dp greedy probabilities *1700	0 / 0	5
	1271	P1744E1 Divisible Numbers (easy version) brute force math number theory *1500	0 / 0	5
	1270	P1744E2 Divisible Numbers (hard version) brute force math number theory *1900	0 / 0	6
	1254	P1748B Diverse Substrings brute force implementation strings *1400	0 / 0	4
	1253	P1748C Zero-Sum Prefixes brute force data structures dp greedy implementation *1600	0 / 0	5
	1242	P1750B Maximum Substring brute force greedy implementation *800	0 / 0	3
	1230	P1753E N Machines binary search brute force greedy *3300	0 / 0	10
	1229	P1753F Minecraft Series brute force two pointers *3500	0 / 0	10
	1223	P1758D Range = √Sum binary search brute force constructive algorithms math two pointers *1800	0 / 0	6
	1217	P1759D Make It Round brute force number theory *1400	0 / 0	4
	1216	P1759E The Humanoid brute force dp sortings *1500	0 / 0	5
	1206	P1761A Two Permutations brute force constructive algorithms *800	0 / 0	3
	1202	P1761E Make It Connected binary search brute force constructive algorithms dsu graphs greedy matrices trees two pointers *2400	0 / 0	9
	1190	P1763B Incinerate binary search brute force data structures implementation math sortings *1200	0 / 0	4

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