*2200 - 题库 - Boyacoding

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	1525	P1474D Cleaning data structures dp greedy math *2200	0 / 0	8
	1506	P1477C Nezzar and Nice Beatmap constructive algorithms geometry greedy math sortings *2200	0 / 0	8
	1474	P1485D Multiples and Power Differences constructive algorithms graphs math number theory *2200	0 / 0	8
	1466	P1486E Paired Payment binary search brute force constructive algorithms dp flows graphs shortest paths *2200	0 / 0	8
	1453	P1488E Palindromic Doubles special problem data structures dp 2200	0 / 0	8
	1396	P1498D Bananas in a Microwave dfs and similar dp graphs implementation *2200	0 / 0	8
	1395	P1498E Two Houses brute force graphs greedy interactive sortings *2200	0 / 0	8
	1385	P1500B Two chandeliers binary search brute force chinese remainder theorem math number theory *2200	0 / 0	8
	1376	P1503C Travelling Salesman Problem binary search data structures dp greedy shortest paths sortings two pointers *2200	0 / 0	8
	1365	P1505F Math special problem math 2200	0 / 0	8
	1362	P1505I Mysterious language again, seriously? special problem 2200	0 / 0	8
	1305	P1515E Phoenix and Computers combinatorics dp math *2200	0 / 0	8
	1275	P1520F2 Guess the K-th Zero (Hard version) binary search constructive algorithms data structures interactive *2200	0 / 0	8
	1274	P1520G To Go Or Not To Go? brute force dfs and similar graphs greedy implementation shortest paths *2200	0 / 0	8
	1250	P1526D Kill Anton brute force constructive algorithms data structures math strings *2200	0 / 0	8
	1196	P1535E Gold Transfer binary search data structures dp greedy interactive trees *2200	0 / 0	8
	1183	P1537E2 Erase and Extend (Hard Version) binary search data structures greedy hashing string suffix structures strings two pointers *2200	0 / 0	8
	1182	P1537F Figure Fixing constructive algorithms dfs and similar dsu graphs greedy math *2200	0 / 0	8
	1157	P1542D Priority Queue combinatorics dp implementation math ternary search *2200	0 / 0	8
	1150	P1543D2 RPD and Rap Sheet (Hard Version) brute force constructive algorithms interactive math *2200	0 / 0	8
	1111	P1551F Equidistant Vertices brute force combinatorics dfs and similar dp trees *2200	0 / 0	8
	1105	P1552F Telepanting binary search data structures dp sortings *2200	0 / 0	8
	1077	P1556E Equilibrium data structures dp greedy *2200	0 / 0	8
	1070	P1557D Ezzat and Grid data structures dp greedy *2200	0 / 0	8
	1057	P1559E Mocha and Stars combinatorics dp fft math number theory *2200	0 / 0	8
	1042	P1562D2 Two Hundred Twenty One (hard version) data structures math *2200	0 / 0	8
	1026	P1567E Non-Decreasing Dilemma data structures divide and conquer math *2200	0 / 0	8
	988	P1575G GCD Festival math number theory *2200	0 / 0	8
	987	P1575H Holiday Wall Ornaments dp strings *2200	0 / 0	8
	984	P1575K Knitting Batik implementation math *2200	0 / 0	8
	960	P1579G Minimal Coverage dp *2200	0 / 0	8
	957	P1580C Train Maintenance brute force data structures implementation *2200	0 / 0	8
	939	P1583E Moment of Bloom constructive algorithms dfs and similar graph matchings graphs greedy trees *2200	0 / 0	8
	905	P1593G Changing Brackets constructive algorithms data structures dp greedy *2200	0 / 0	8
	843	P1607G Banquet Preparations 1 greedy *2200	0 / 0	8
	842	P1607H Banquet Preparations 2 greedy sortings two pointers *2200	0 / 0	8
	787	P1615D X(or)-mas Tree bitmasks dfs and similar dsu graphs trees *2200	0 / 0	8
	778	P1616E Lexicographically Small Enough brute force data structures greedy strings *2200	0 / 0	8
	762	P1618G Trader Problem data structures dsu greedy sortings *2200	0 / 0	8
	733	P1622E Math Test bitmasks brute force greedy *2200	0 / 0	8
	703	P1627E Not Escaping data structures dp implementation shortest paths two pointers *2200	0 / 0	8
	690	P1630C Paint the Middle dp greedy sortings two pointers *2200	0 / 0	8
	662	P1635E Cars 2-sat constructive algorithms dfs and similar dsu graphs greedy sortings *2200	0 / 0	8
	633	P1641C Anonymity Is Important binary search brute force data structures dsu greedy sortings *2200	0 / 0	8
	617	P1646E Power Board brute force dp math number theory *2200	0 / 0	8
	596	P1650F Vitaly and Advanced Useless Algorithms dp greedy implementation *2200	0 / 0	8
	576	P1656E Equal Tree Sums constructive algorithms dfs and similar math trees *2200	0 / 0	8
	567	P1657E Star MST combinatorics dp graph matchings math *2200	0 / 0	8
	554	P1659E AND-MEX Walk bitmasks brute force constructive algorithms dfs and similar dsu graphs *2200	0 / 0	8
	506	P1666F Fancy Stack combinatorics dp implementation *2200	0 / 0	8
	503	P1666I Interactive Treasure Hunt brute force constructive algorithms geometry interactive math *2200	0 / 0	8
	479	P1670E Hemose on the Tree bitmasks constructive algorithms dfs and similar trees *2200	0 / 0	8
	467	P1672E notepad.exe binary search constructive algorithms greedy interactive *2200	0 / 0	8
	337	P1695D1 Tree Queries (Easy Version) brute force constructive algorithms dfs and similar dp greedy trees *2200	0 / 0	8
	277	P1704E Count Seconds brute force constructive algorithms dp graphs implementation math *2200	0 / 0	8
	203	P1717E Madoka and The Best University math number theory *2200	0 / 0	8
	181	P1721E Prefix Function Queries dfs and similar dp hashing string suffix structures strings trees *2200	0 / 0	8
	134	P1730D Prefixes and Suffixes constructive algorithms strings two pointers *2200	0 / 0	8
	102	P1736D Equal Binary Subsequences constructive algorithms geometry greedy implementation strings *2200	0 / 0	8
	97	P1737D Ela and the Wiring Wizard brute force dp graphs greedy implementation shortest paths *2200	0 / 0	8
	64	P1741G Kirill and Company bitmasks brute force dfs and similar dp flows graphs shortest paths *2200	0 / 0	8
	8208	P1765F Chemistry Lab dp geometry probabilities *2200	0 / 0	8
	8206	P1765H Hospital Queue binary search graphs greedy *2200	0 / 0	8
	8299	P1773B BinCoin binary search divide and conquer hashing implementation probabilities trees *2200	0 / 0	8
	8368	P1795E Explosions? binary search data structures dp greedy math *2200	0 / 0	8
	8418	P1806E Tree Master brute force data structures dfs and similar trees *2200	0 / 0	8
	8467	P1808E1 Minibuses on Venus (easy version) combinatorics divide and conquer dp *2200	0 / 0	8
	8582	P1840F Railguns brute force dfs and similar dp graphs *2200	0 / 0	8
	8581	P1840G1 In Search of Truth (Easy Version) constructive algorithms interactive math meet-in-the-middle probabilities *2200	0 / 0	8
	8575	P1841E Fill the Matrix data structures greedy math *2200	0 / 0	8
	8525	P1848D Vika and Bonuses binary search brute force math ternary search *2200	0 / 0	8
	8615	P1858D Trees and Segments brute force data structures dp greedy two pointers *2200	0 / 0	8
	8684	P1867E2 Salyg1n and Array (hard version) constructive algorithms interactive *2200	0 / 0	8
	8802	P1898E Sofia and Strings data structures greedy sortings strings two pointers *2200	0 / 0	8
	8789	P1901E Compressed Tree dfs and similar dp graphs greedy sortings trees *2200	0 / 0	8
	8835	P1906H Twin Friends combinatorics dp *2200	0 / 0	8
	8823	P1907G Lights brute force constructive algorithms dfs and similar graphs greedy implementation *2200	0 / 0	8
	8909	P1909F1 Small Permutation Problem (Easy Version) brute force combinatorics dp math *2200	0 / 0	8
	8890	P1912E Evaluate It and Back Again constructive algorithms implementation math *2200	0 / 0	8
	9014	P1921G Mischievous Shooter brute force data structures divide and conquer dp implementation *2200	0 / 0	8
	9145	P1946E Girl Permutation combinatorics dp math number theory *2200	0 / 0	8
	9102	P1954E Chain Reaction binary search data structures dsu greedy implementation math number theory *2200	0 / 0	8
	9225	P1970E3 Trails (Hard) dp matrices *2200	0 / 0	8
	9220	P1970G2 Min-Fund Prison (Medium) brute force dfs and similar dp graphs trees *2200	0 / 0	8
	9274	P1985H2 Maximize the Largest Component (Hard Version) data structures dfs and similar dp dsu implementation *2200	0 / 0	8
	9267	P1986G1 Permutation Problem (Simple Version) binary search brute force combinatorics data structures math number theory *2200	0 / 0	8

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