*2000 - 题库 - 达芬奇编程

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	3683	P1294F Three Paths on a Tree dfs and similar dp greedy trees *2000	0 / 0	7
	3671	P1296E2 String Coloring (hard version) data structures dp *2000	0 / 0	7
	3650	P1301D Time to Run constructive algorithms graphs implementation *2000	0 / 0	7
	3626	P1304E 1-Trees and Queries data structures dfs and similar shortest paths trees *2000	0 / 0	7
	3599	P1311D Three Integers brute force math *2000	0 / 0	7
	3577	P1316D Nash Matrix constructive algorithms dfs and similar graphs implementation *2000	0 / 0	7
	3572	P1320C World of Darkraft: Battle for Azathoth brute force data structures sortings *2000	0 / 0	7
	3445	P1344B Monopole Magnets constructive algorithms dfs and similar dsu graphs *2000	0 / 0	7
	3433	P1346F Dune II: Battle For Arrakis special problem data structures greedy math 2000	0 / 0	7
	3422	P1349B Orac and Medians constructive algorithms greedy math *2000	0 / 0	7
	3421	P1349C Orac and Game of Life dfs and similar graphs implementation shortest paths *2000	0 / 0	7
	3395	P1354C2 Not So Simple Polygon Embedding binary search brute force geometry math *2000	0 / 0	7
	3347	P1359D Yet Another Yet Another Task data structures dp implementation two pointers *2000	0 / 0	7
	3346	P1359E Modular Stability combinatorics math number theory *2000	0 / 0	7
	3323	P1363E Tree Shuffling dfs and similar dp greedy trees *2000	0 / 0	7
	3306	P1366D Two Divisors constructive algorithms math number theory *2000	0 / 0	7
	3277	P1370D Odd-Even Subsequence binary search dp dsu greedy implementation *2000	0 / 0	7
	3235	P1379C Choosing flowers binary search brute force data structures dfs and similar dp greedy sortings two pointers *2000	0 / 0	7
	3227	P1380D Berserk And Fireball constructive algorithms greedy implementation math two pointers *2000	0 / 0	7
	3202	P1385E Directing Edges constructive algorithms dfs and similar graphs *2000	0 / 0	7
	3189	P1388D Captain Flint and Treasure data structures dfs and similar graphs greedy implementation trees *2000	0 / 0	7
	3177	P1391D 505 bitmasks brute force constructive algorithms dp greedy implementation *2000	0 / 0	7
	3134	P1399E1 Weights Division (easy version) data structures dfs and similar greedy trees *2000	0 / 0	7
	3092	P1408D Searchlights binary search brute force data structures dp implementation sortings two pointers *2000	0 / 0	7
	3064	P1415D XOR-gun bitmasks brute force constructive algorithms *2000	0 / 0	7
	3060	P1416B Make Them Equal constructive algorithms greedy math *2000	0 / 0	7
	3059	P1416C XOR Inverse bitmasks data structures divide and conquer dp greedy math sortings strings trees *2000	0 / 0	7
	2993	P1426F Number of Subsequences combinatorics dp strings *2000	0 / 0	7
	2990	P1427C The Hard Work of Paparazzi dp *2000	0 / 0	7
	2989	P1427D Unshuffling a Deck constructive algorithms implementation *2000	0 / 0	7
	2964	P1431E Chess Match special problem 2000	0 / 0	7
	2935	P1438C Engineer Artem 2-sat chinese remainder theorem constructive algorithms fft flows *2000	0 / 0	7
	2883	P1451E1 Bitwise Queries (Easy Version) bitmasks constructive algorithms interactive math *2000	0 / 0	7
	2863	P1454E Number of Simple Paths combinatorics dfs and similar graphs trees *2000	0 / 0	7
	2852	P1458B Glass Half Spilled dp *2000	0 / 0	7
	2729	P1481D AB Graph brute force constructive algorithms graphs greedy implementation *2000	0 / 0	7
	2701	P1487E Cheap Dinner brute force data structures graphs greedy implementation sortings two pointers *2000	0 / 0	7
	2665	P1493C K-beautiful Strings binary search brute force constructive algorithms greedy strings *2000	0 / 0	7
	2597	P1506F Triangular Paths constructive algorithms graphs math shortest paths sortings *2000	0 / 0	7
	2596	P1506G Maximize the Remaining String brute force data structures dp greedy strings *2000	0 / 0	7
	2558	P1513D GCD and MST constructive algorithms dsu graphs greedy number theory sortings *2000	0 / 0	7
	2552	P1514D Cut and Stick binary search data structures greedy implementation sortings *2000	0 / 0	7
	2512	P1521C Nastia and a Hidden Permutation constructive algorithms interactive *2000	0 / 0	7
	2499	P1525C Robot Collisions data structures greedy implementation sortings *2000	0 / 0	7
	2432	P1536D Omkar and Medians data structures greedy implementation *2000	0 / 0	7
	2353	P1551E Fixed Points binary search brute force dp *2000	0 / 0	7
	2307	P1558C Bottom-Tier Reversals constructive algorithms greedy *2000	0 / 0	7
	2275	P1566E Buds Re-hanging constructive algorithms dfs and similar dp greedy trees *2000	0 / 0	7
	2268	P1567D Expression Evaluation Error constructive algorithms greedy implementation math *2000	0 / 0	7
	2254	P1571F Kotlinforces special problem constructive algorithms dp 2000	0 / 0	7
	2238	P1574D The Strongest Build binary search brute force data structures dfs and similar graphs greedy hashing implementation *2000	0 / 0	7
	2188	P1582E Pchelyonok and Segments binary search data structures dp greedy math *2000	0 / 0	7
	2173	P1584D Guess the Permutation binary search combinatorics interactive math *2000	0 / 0	7
	2129	P1599C Bubble Strike combinatorics math probabilities ternary search *2000	0 / 0	7
	2064	P1610D Not Quite Lee combinatorics dp math number theory *2000	0 / 0	7
	2046	P1612E Messages brute force dp greedy probabilities sortings *2000	0 / 0	7
	2039	P1613E Crazy Robot dfs and similar graphs *2000	0 / 0	7
	2020	P1616D Keep the Average High dp greedy math *2000	0 / 0	7
	2004	P1618F Reverse bitmasks constructive algorithms dfs and similar implementation math strings *2000	0 / 0	7
	1997	P1619F Let's Play the Hat? brute force constructive algorithms greedy math *2000	0 / 0	7
	1996	P1619G Unusual Minesweeper binary search dfs and similar dsu greedy sortings *2000	0 / 0	7
	1991	P1620D Exact Change brute force constructive algorithms greedy *2000	0 / 0	7
	1975	P1622D Shuffle combinatorics math two pointers *2000	0 / 0	7
	1963	P1624E Masha-forgetful brute force constructive algorithms dp hashing implementation strings *2000	0 / 0	7
	1962	P1624F Interacdive Problem binary search constructive algorithms interactive *2000	0 / 0	7
	1922	P1632D New Year Concert binary search data structures greedy math number theory two pointers *2000	0 / 0	7
	1910	P1634D Finding Zero constructive algorithms interactive math *2000	0 / 0	7
	1882	P1638D Big Brush constructive algorithms data structures greedy implementation *2000	0 / 0	7
	1883	P1638D Big Brush constructive algorithms data structures greedy implementation *2000	0 / 0	7
	1866	P1641B Repetitions Decoding constructive algorithms implementation sortings *2000	0 / 0	7
	1850	P1646D Weight the Tree constructive algorithms dfs and similar dp implementation trees *2000	0 / 0	7
	1800	P1657D For Gamers binary search brute force greedy math sortings *2000	0 / 0	7
	1745	P1665D GCD Guess bitmasks chinese remainder theorem constructive algorithms games interactive math number theory *2000	0 / 0	7
	1698	P1672F1 Array Shuffling constructive algorithms graphs greedy *2000	0 / 0	7
	1683	P1674E Breaking the Wall binary search brute force constructive algorithms greedy math *2000	0 / 0	7
	1681	P1674G Remove Directed Edges dfs and similar dp graphs *2000	0 / 0	7
	1645	P1680E Moving Chips bitmasks dp greedy *2000	0 / 0	7
	1634	P1682D Circular Spanning Tree constructive algorithms implementation trees *2000	0 / 0	7
	1622	P1685B Linguistics greedy implementation sortings strings *2000	0 / 0	7
	1595	P1690G Count the Trains binary search data structures greedy sortings *2000	0 / 0	7
	1562	P1696E Placing Jinas combinatorics math *2000	0 / 0	7
	1521	P1702G2 Passable Paths (hard version) data structures dfs and similar trees *2000	0 / 0	7
	1468	P1712D Empty Graph binary search constructive algorithms data structures greedy shortest paths *2000	0 / 0	7
	1443	P1716C Robot in a Hallway data structures dp greedy implementation ternary search *2000	0 / 0	7
	1442	P1716D Chip Move brute force dp math *2000	0 / 0	7
	1431	P1718B Fibonacci Strings greedy implementation math number theory *2000	0 / 0	7
	1402	P1725C Circular Mirror binary search combinatorics geometry math two pointers *2000	0 / 0	7
	1388	P1726D Edge Split brute force constructive algorithms dfs and similar dsu graphs probabilities trees *2000	0 / 0	7
	1359	P1731E Graph Cost dp greedy math number theory *2000	0 / 0	7
	1346	P1733D2 Zero-One (Hard Version) dp greedy *2000	0 / 0	7
	1291	P1741F Multi-Colored Segments binary search data structures math sortings *2000	0 / 0	7
	1269	P1744F MEX vs MED math two pointers *2000	0 / 0	7
	1232	P1753C Wish I Knew How to Sort dp math probabilities *2000	0 / 0	7
	1189	P1763C Another Array Problem brute force constructive algorithms greedy *2000	0 / 0	7
	1182	P1764D Doremy's Pegging Game combinatorics dp math *2000	0 / 0	7
	1140	P1770D Koxia and Game constructive algorithms data structures dfs and similar dsu flows games graph matchings graphs implementation *2000	0 / 0	7
	1049	P1783D Different Arrays brute force dp implementation *2000	0 / 0	7
	1024	P1788D Moving Dots binary search brute force combinatorics math two pointers *2000	0 / 0	7
	972	P1796D Maximum Subarray data structures dp greedy two pointers *2000	0 / 0	7
	927	P1804D Accommodation brute force dp greedy implementation *2000	0 / 0	7

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