题库 - 达芬奇编程

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	1604	P1689C Infected Tree dfs and similar dp trees *1600	0 / 0	5
	1603	P1689D Lena and Matrix data structures dp geometry shortest paths *1900	0 / 0	6
	1602	P1689E ANDfinity bitmasks brute force constructive algorithms dfs and similar dsu graphs *2500	0 / 0	9
	1601	P1690A Print a Pedestal (Codeforces logo?) constructive algorithms greedy *800	0 / 0	3
	1600	P1690B Array Decrements greedy implementation *800	0 / 0	3
	1599	P1690C Restoring the Duration of Tasks data structures greedy implementation *800	0 / 0	3
	1598	P1690D Black and White Stripe implementation two pointers *1000	0 / 0	3
	1597	P1690E Price Maximization binary search greedy math two pointers *1500	0 / 0	5
	1596	P1690F Shifting String graphs math number theory strings *1700	0 / 0	5
	1595	P1690G Count the Trains binary search data structures greedy sortings *2000	0 / 0	7
	1594	P1691A Beat The Odds brute force greedy math *800	0 / 0	3
	1593	P1691B Shoe Shuffling constructive algorithms greedy implementation two pointers *1000	0 / 0	3
	1592	P1691C Sum of Substrings brute force constructive algorithms greedy math strings *1400	0 / 0	4
	1591	P1691D Max GEQ Sum binary search constructive algorithms data structures divide and conquer implementation two pointers *1800	0 / 0	6
	1590	P1691E Number of Groups data structures dfs and similar dsu graphs greedy sortings *2300	0 / 0	8
	1589	P1691F K-Set Tree combinatorics dfs and similar dp math trees *2500	0 / 0	9
	1588	P1692A Marathon implementation *800	0 / 0	3
	1587	P1692B All Distinct greedy sortings *800	0 / 0	3
	1586	P1692C Where's the Bishop? implementation *800	0 / 0	3
	1585	P1692D The Clock brute force implementation *1100	0 / 0	3
	1584	P1692E Binary Deque binary search implementation two pointers *1200	0 / 0	4
	1583	P1692F 3SUM brute force math *1300	0 / 0	4
	1582	P1692G 2^Sort data structures dp sortings two pointers *1400	0 / 0	4
	1581	P1692H Gambling data structures dp greedy math *1700	0 / 0	5
	1580	P1693A Directional Increase greedy *1300	0 / 0	4
	1579	P1693B Fake Plastic Trees dfs and similar dp greedy trees *1700	0 / 0	5
	1578	P1693C Keshi in Search of AmShZ graphs greedy shortest paths *2300	0 / 0	8
	1577	P1693D Decinc Dividing brute force data structures divide and conquer dp greedy *2800	0 / 0	10
	1576	P1693E Outermost Maximums data structures greedy *3400	0 / 0	10
	1575	P1693F I Might Be Wrong binary search greedy two pointers *3400	0 / 0	10
	1574	P1694A Creep greedy implementation *800	0 / 0	3
	1573	P1694B Paranoid String constructive algorithms greedy *1200	0 / 0	4
	1572	P1695A Subrectangle Guess games *800	0 / 0	3
	1571	P1695B Circle Game games greedy *1000	0 / 0	3
	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
	1568	P1695D2 Tree Queries (Hard Version) constructive algorithms dfs and similar dp greedy trees *2300	0 / 0	8
	1567	P1695E Ambiguous Dominoes constructive algorithms dfs and similar graphs *2700	0 / 0	10
	1566	P1696A NIT orz! bitmasks greedy *800	0 / 0	3
	1565	P1696B NIT Destroys the Universe greedy *900	0 / 0	3
	1564	P1696C Fishingprince Plays With Array constructive algorithms greedy implementation math *1400	0 / 0	4
	1563	P1696D Permutation Graph binary search constructive algorithms data structures divide and conquer greedy shortest paths *1900	0 / 0	6
	1562	P1696E Placing Jinas combinatorics math *2000	0 / 0	7
	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
	1558	P1697A Parkway Walk greedy implementation *800	0 / 0	3
	1557	P1697B Promo greedy sortings *900	0 / 0	3
	1556	P1697C awoo's Favorite Problem binary search constructive algorithms data structures greedy implementation strings two pointers *1400	0 / 0	4
	1555	P1697D Guess The String binary search constructive algorithms interactive *1900	0 / 0	6
	1554	P1697E Coloring brute force combinatorics constructive algorithms dp geometry graphs greedy implementation math *2400	0 / 0	9
	1553	P1697F Too Many Constraints 2-sat constructive algorithms graphs implementation *2800	0 / 0	10
	1552	P1698A XOR Mixup bitmasks brute force *800	0 / 0	3
	1551	P1698B Rising Sand constructive algorithms greedy implementation *800	0 / 0	3
	1550	P1698C 3SUM Closure brute force data structures *1300	0 / 0	4
	1549	P1698D Fixed Point Guessing binary search constructive algorithms interactive *1600	0 / 0	5
	1548	P1698E PermutationForces II brute force combinatorics greedy sortings trees two pointers *2300	0 / 0	8
	1547	P1698F Equal Reversal constructive algorithms graphs implementation math *2800	0 / 0	10
	1546	P1698G Long Binary String bitmasks math matrices meet-in-the-middle number theory *2900	0 / 0	10
	1545	P1699A The Third Three Number Problem constructive algorithms math *800	0 / 0	3
	1544	P1699B Almost Ternary Matrix bitmasks constructive algorithms matrices *900	0 / 0	3
	1543	P1699C The Third Problem combinatorics constructive algorithms math *1700	0 / 0	5
	1542	P1699D Almost Triple Deletions data structures dp greedy *2300	0 / 0	8
	1541	P1699E Three Days Grace data structures dp greedy math number theory two pointers *2600	0 / 0	10
	1540	P1700A Optimal Path constructive algorithms greedy math *800	0 / 0	3
	1539	P1700B Palindromic Numbers constructive algorithms implementation math *1100	0 / 0	3
	1538	P1700C Helping the Nature constructive algorithms data structures greedy *1700	0 / 0	5
	1537	P1700D River Locks binary search dp greedy math *1900	0 / 0	6
	1536	P1700E Serega the Pirate brute force constructive algorithms *2600	0 / 0	10
	1535	P1700F Puzzle constructive algorithms dp greedy *2600	0 / 0	10
	1534	P1701A Grass Field implementation *800	0 / 0	3
	1533	P1701B Permutation greedy *800	0 / 0	3
	1532	P1701C Schedule Management binary search greedy implementation two pointers *1400	0 / 0	4
	1531	P1701D Permutation Restoration binary search data structures greedy math sortings two pointers *1900	0 / 0	6
	1530	P1701E Text Editor brute force dp greedy strings *2500	0 / 0	9
	1529	P1701F Points combinatorics data structures implementation math matrices *2500	0 / 0	9
	1528	P1702A Round Down the Price constructive algorithms *800	0 / 0	3
	1527	P1702B Polycarp Writes a String from Memory greedy *800	0 / 0	3
	1526	P1702C Train and Queries data structures greedy *1100	0 / 0	3
	1525	P1702D Not a Cheap String greedy *1000	0 / 0	3
	1524	P1702E Split Into Two Sets dfs and similar dsu graphs *1600	0 / 0	5
	1523	P1702F Equate Multisets constructive algorithms data structures greedy math number theory *1700	0 / 0	5
	1522	P1702G1 Passable Paths (easy version) dfs and similar trees *1900	0 / 0	6
	1521	P1702G2 Passable Paths (hard version) data structures dfs and similar trees *2000	0 / 0	7
	1520	P1703A YES or YES? brute force implementation strings *800	0 / 0	3
	1519	P1703B ICPC Balloons data structures implementation *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
	1516	P1703E Mirror Grid implementation *1200	0 / 4	4
	1515	P1703F Yet Another Problem About Pairs Satisfying an Inequality binary search data structures dp greedy sortings *1300	0 / 0	4
	1514	P1703G Good Key, Bad Key bitmasks brute force dp greedy math *1600	0 / 0	5
	1513	P1704A Two 0-1 Sequences constructive algorithms greedy *800	0 / 0	3
	1512	P1704B Luke is a Foodie brute force greedy implementation *1000	0 / 0	3
	1511	P1704C Virus greedy implementation sortings *1200	0 / 0	4
	1510	P1704D Magical Array constructive algorithms hashing implementation math *1900	0 / 0	6
	1509	P1704E Count Seconds brute force constructive algorithms dp graphs implementation math *2200	0 / 0	8
	1508	P1704F Colouring Game constructive algorithms dp games *2600	0 / 0	10
	1507	P1704G Mio and Lucky Array constructive algorithms fft math strings *3500	0 / 0	10
	1506	P1704H1 Game of AI (easy version) combinatorics constructive algorithms dp fft math *3200	0 / 0	10
	1505	P1704H2 Game of AI (hard version) combinatorics fft math *3500	0 / 0	10

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