hashing - 题库 - 达芬奇编程

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	4335	P1166F Vicky's Delivery Service data structures dsu graphs hashing *2400	0 / 0	9
	4291	P1175F The Number of Subpermutations brute force data structures divide and conquer hashing math *2500	0 / 0	9
	4256	P1182D Complete Mirror constructive algorithms dfs and similar dp hashing implementation trees *2400	0 / 0	9
	4148	P1200E Compress Words brute force hashing implementation string suffix structures strings *2000	0 / 0	7
	4106	P1207G Indie Album data structures dfs and similar hashing string suffix structures strings trees *2700	0 / 0	10
	4059	P1214D Treasure Island dfs and similar dp flows hashing *1900	0 / 0	6
	4005	P1223F Stack Exterminable Arrays data structures divide and conquer dp hashing *2600	0 / 0	10
	3999	P1225D Power Products hashing math number theory *1800	0 / 0	6
	3983	P1228D Complete Tripartite brute force constructive algorithms graphs hashing implementation *1900	0 / 0	6
	3880	P1252F Regular Forestation hashing trees *2400	0 / 0	9
	3847	P1257F Make Them Similar bitmasks brute force hashing meet-in-the-middle *2400	0 / 0	9
	3766	P1277D Let's Play the Words? data structures hashing implementation math *1900	0 / 0	6
	3730	P1284D New Year and Conference binary search data structures hashing sortings *2100	0 / 0	7
	3717	P1286C2 Madhouse (Hard version) brute force constructive algorithms hashing interactive math *2800	0 / 0	10
	3584	P1313E Concatenation with intersection data structures hashing strings two pointers *2700	0 / 0	10
	3571	P1320D Reachable Strings data structures hashing strings *2500	0 / 0	9
	3564	P1322C Instant Noodles graphs hashing math number theory *2300	0 / 0	8
	3543	P1326D1 Prefix-Suffix Palindrome (Easy version) hashing string suffix structures strings *1500	0 / 0	5
	3542	P1326D2 Prefix-Suffix Palindrome (Hard version) binary search greedy hashing string suffix structures strings *1800	0 / 0	6
	3461	P1340F Nastya and CBS brute force data structures hashing *3300	0 / 0	10
	3339	P1360F Spy-string bitmasks brute force constructive algorithms dp hashing strings *1700	0 / 0	5
	3162	P1393E1 Twilight and Ancient Scroll (easier version) dp hashing implementation string suffix structures strings *2800	0 / 0	10
	3161	P1393E2 Twilight and Ancient Scroll (harder version) dp hashing implementation string suffix structures strings two pointers *3200	0 / 0	10
	3159	P1394B Boboniu Walks on Graph brute force dfs and similar graphs hashing *2300	0 / 0	8
	3047	P1418G Three Occurrences data structures divide and conquer hashing two pointers *2500	0 / 0	9
	2885	P1451C String Equality dp greedy hashing implementation strings *1400	0 / 0	4
	2819	P1466G Song of the Sirens combinatorics divide and conquer hashing math string suffix structures strings *2600	0 / 0	10
	2806	P1468F Full Turn geometry hashing number theory *1700	0 / 0	5
	2793	P1469E A Bit Similar bitmasks brute force hashing string suffix structures strings two pointers *2400	0 / 0	9
	2790	P1470B Strange Definition bitmasks graphs hashing math number theory *1900	0 / 0	6
	2752	P1476E Pattern Matching bitmasks data structures dfs and similar graphs hashing sortings strings *2300	0 / 0	8
	2750	P1476G Minimum Difference data structures hashing sortings two pointers *3100	0 / 0	10
	2664	P1493D GCD of an Array brute force data structures hashing implementation math number theory sortings two pointers *2100	0 / 0	7
	2657	P1494E A-Z Graph constructive algorithms data structures graphs hashing *2400	0 / 0	9
	2627	P1500A Going Home brute force hashing implementation math *1800	0 / 0	6
	2519	P1520D Same Differences data structures hashing math *1200	0 / 0	4
	2485	P1527C Sequence Pair Weight hashing implementation math *1600	0 / 0	5
	2457	P1533D String Searching *special problem hashing	0 / 0	(无)
	2436	P1535F String Distance binary search brute force data structures hashing implementation strings *3000	0 / 0	10
	2433	P1536C Diluc and Kaeya data structures dp hashing number theory *1500	0 / 0	5
	2425	P1537E1 Erase and Extend (Easy Version) binary search brute force dp greedy hashing implementation string suffix structures strings two pointers *1600	0 / 0	5
	2424	P1537E2 Erase and Extend (Hard Version) binary search data structures greedy hashing string suffix structures strings two pointers *2200	0 / 0	8
	2418	P1538E Funny Substrings data structures hashing implementation matrices strings *2100	0 / 0	7
	2341	P1553B Reverse String brute force dp hashing implementation strings *1300	0 / 0	4
	2336	P1553G Common Divisor Graph brute force constructive algorithms dsu graphs hashing math number theory *2700	0 / 0	10
	2261	P1569E Playoff Restoration bitmasks brute force hashing implementation meet-in-the-middle *2600	0 / 0	10
	2260	P1569F Palindromic Hamiltonian Path brute force dfs and similar dp graphs hashing *3000	0 / 0	10
	2238	P1574D The Strongest Build binary search brute force data structures dfs and similar graphs greedy hashing implementation *2000	0 / 0	7
	2132	P1598G The Sum of Good Numbers hashing math string suffix structures strings *3200	0 / 0	10
	2126	P1599F Mars hashing *2700	0 / 0	10
	2076	P1608G Alphabetic Tree binary search data structures dfs and similar hashing string suffix structures strings trees *3500	0 / 0	10
	2061	P1610G AmShZ Wins a Bet data structures greedy hashing *3300	0 / 0	10
	1979	P1621I Two Sequences data structures hashing string suffix structures *3500	0 / 0	10
	1973	P1622F Quadratic Set constructive algorithms hashing math number theory *2900	0 / 0	10
	1963	P1624E Masha-forgetful brute force constructive algorithms dp hashing implementation strings *2000	0 / 0	7
	1907	P1634F Fibonacci Additions brute force data structures hashing implementation math *2700	0 / 0	10
	1908	P1634F Fibonacci Additions brute force data structures hashing implementation math *2700	0 / 0	10
	1864	P1641D Two Arrays bitmasks brute force combinatorics greedy hashing math two pointers *2700	0 / 0	10
	1831	P1650C Weight of the System of Nested Segments greedy hashing implementation sortings *1200	0 / 0	4
	1815	P1654F Minimal String Xoration bitmasks data structures divide and conquer greedy hashing sortings strings *2800	0 / 0	10
	1792	P1658E Gojou and Matrix Game data structures dp games hashing implementation math number theory sortings *2500	0 / 0	9
	1705	P1671E Preorder combinatorics divide and conquer dp dsu hashing sortings trees *2100	0 / 0	7
	1640	P1681D Required Length brute force dfs and similar dp hashing shortest paths *1700	0 / 0	5
	1510	P1704D Magical Array constructive algorithms hashing implementation math *1900	0 / 0	6
	1413	P1721E Prefix Function Queries dfs and similar dp hashing string suffix structures strings trees *2200	0 / 0	8
	1371	P1729F Kirei and the Linear Function hashing math *1900	0 / 0	6
	1370	P1729G Cut Substrings combinatorics dp hashing strings two pointers *2100	0 / 0	7
	1361	P1731C Even Subarrays bitmasks brute force hashing math number theory *1700	0 / 0	5
	1335	P1735D Meta-set brute force combinatorics data structures hashing math *1700	0 / 0	5
	1276	P1743G Antifibonacci Cut bitmasks combinatorics constructive algorithms data structures dp hashing math *3000	0 / 0	10
	1262	P1746F Kazaee data structures hashing probabilities *2800	0 / 0	10
	1130	P1771F Hossam and Range Minimum Query binary search bitmasks data structures hashing probabilities strings trees *2500	0 / 0	9
	1128	P1773B BinCoin binary search divide and conquer hashing implementation probabilities trees *2200	0 / 0	8
	1062	P1780G Delicious Dessert binary search dsu hashing math number theory string suffix structures *2400	0 / 0	9
	997	P1792D Fixed Prefix Permutations binary search bitmasks data structures hashing math sortings *1700	0 / 0	5
	983	P1794E Labeling the Tree with Distances data structures dp greedy hashing implementation trees *2400	0 / 0	9
	944	P1800D Remove Two Letters data structures greedy hashing strings *1200	0 / 0	4
	941	P1800F Dasha and Nightmares bitmasks hashing meet-in-the-middle strings *1900	0 / 0	6
	940	P1800G Symmetree dfs and similar hashing implementation trees *2200	0 / 0	8
	935	P1801E Gasoline prices data structures divide and conquer dsu hashing trees *3000	0 / 0	10
	793	P1827C Palindrome Partition binary search brute force data structures dp hashing strings *2600	0 / 0	10
	777	P1830C Hyperregular Bracket Strings combinatorics greedy hashing math number theory sortings *2400	0 / 0	9
	722	P1840E Character Blocking data structures hashing implementation *1600	0 / 0	5
	659	P1849C Binary String Copying binary search brute force data structures hashing strings *1600	0 / 0	5
	542	P1867F Most Different Tree brute force constructive algorithms dfs and similar greedy hashing *2700	0 / 0	10
	443	P1887C Minimum Array binary search brute force constructive algorithms data structures greedy hashing two pointers *2400	0 / 0	9
	415	P1895C Torn Lucky Ticket brute force dp hashing implementation math *1400	0 / 0	4
	392	P1899D Yarik and Musical Notes hashing math number theory *1300	0 / 0	4
	349	P1906B Button Pressing bitmasks constructive algorithms hashing *2600	0 / 0	10
	323	P1909G Pumping Lemma hashing strings *3000	0 / 0	10
	293	P1913F Palindromic Problem binary search data structures hashing string suffix structures strings *2800	0 / 0	10
	284	P1914G2 Light Bulbs (Hard Version) combinatorics data structures dfs and similar dp graphs hashing *2300	0 / 0	8
	220	P1923F Shrink-Reverse binary search brute force greedy hashing implementation string suffix structures strings *2800	0 / 0	10
	95	P1943B Non-Palindromic Substring hashing implementation math strings *2000	0 / 0	7
	48	P1950G Shuffling Songs bitmasks dfs and similar dp graphs hashing implementation strings *1900	0 / 0	6
	43	P1951E No Palindromes brute force constructive algorithms divide and conquer greedy hashing implementation math strings *2000	0 / 0	7
	2	P1957F1 Frequency Mismatch (Easy Version) binary search data structures hashing probabilities trees two pointers	0 / 0	(无)
	1	P1957F2 Frequency Mismatch (Hard Version) binary search data structures dfs and similar hashing trees	1 / 1	10
	9478	P1977D XORificator bitmasks brute force greedy hashing *2300	0 / 0	8
	9467	P1979D Fixing a Binary String bitmasks brute force constructive algorithms dp greedy hashing strings *1800	0 / 0	6

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