ID 题目 显示标签 隐藏标签 AC / 尝试 难度
3216 P1294F   Three Paths on a Tree 0 / 0 7
3204 P1296E2   String Coloring (hard version) 0 / 0 7
3183 P1301D   Time to Run 0 / 0 7
3159 P1304E   1-Trees and Queries 0 / 0 7
3132 P1311D   Three Integers 0 / 0 7
3110 P1316D   Nash Matrix 0 / 0 7
3105 P1320C   World of Darkraft: Battle for Azathoth 0 / 0 7
2978 P1344B   Monopole Magnets 0 / 0 7
2966 P1346F   Dune II: Battle For Arrakis 0 / 0 7
2955 P1349B   Orac and Medians 0 / 0 7
2954 P1349C   Orac and Game of Life 0 / 0 7
2928 P1354C2   Not So Simple Polygon Embedding 0 / 0 7
2880 P1359D   Yet Another Yet Another Task 0 / 0 7
2879 P1359E   Modular Stability 0 / 0 7
2856 P1363E   Tree Shuffling 0 / 0 7
2839 P1366D   Two Divisors 0 / 0 7
2810 P1370D   Odd-Even Subsequence 0 / 0 7
2768 P1379C   Choosing flowers 0 / 0 7
2760 P1380D   Berserk And Fireball 0 / 0 7
2735 P1385E   Directing Edges 0 / 0 7
2722 P1388D   Captain Flint and Treasure 0 / 0 7
2710 P1391D   505 0 / 0 7
2667 P1399E1   Weights Division (easy version) 0 / 0 7
2625 P1408D   Searchlights 0 / 0 7
2597 P1415D   XOR-gun 0 / 0 7
2593 P1416B   Make Them Equal 0 / 0 7
2592 P1416C   XOR Inverse 0 / 0 7
2526 P1426F   Number of Subsequences 0 / 0 7
2523 P1427C   The Hard Work of Paparazzi 0 / 0 7
2522 P1427D   Unshuffling a Deck 0 / 0 7
2497 P1431E   Chess Match 0 / 0 7
2468 P1438C   Engineer Artem 0 / 0 7
2416 P1451E1   Bitwise Queries (Easy Version) 0 / 0 7
2396 P1454E   Number of Simple Paths 0 / 0 7
2385 P1458B   Glass Half Spilled 0 / 0 7
2262 P1481D   AB Graph 0 / 0 7
2234 P1487E   Cheap Dinner 0 / 0 7
2198 P1493C   K-beautiful Strings 0 / 0 7
2130 P1506F   Triangular Paths 0 / 0 7
2129 P1506G   Maximize the Remaining String 0 / 0 7
2091 P1513D   GCD and MST 0 / 0 7
2085 P1514D   Cut and Stick 0 / 0 7
2045 P1521C   Nastia and a Hidden Permutation 0 / 0 7
2032 P1525C   Robot Collisions 0 / 0 7
1965 P1536D   Omkar and Medians 0 / 0 7
1886 P1551E   Fixed Points 0 / 0 7
1840 P1558C   Bottom-Tier Reversals 0 / 0 7
1808 P1566E   Buds Re-hanging 0 / 0 7
1801 P1567D   Expression Evaluation Error 0 / 0 7
1787 P1571F   Kotlinforces 0 / 0 7
1771 P1574D   The Strongest Build 0 / 0 7
1721 P1582E   Pchelyonok and Segments 0 / 0 7
1706 P1584D   Guess the Permutation 0 / 0 7
1662 P1599C   Bubble Strike 0 / 0 7
1597 P1610D   Not Quite Lee 0 / 0 7
1579 P1612E   Messages 0 / 0 7
1572 P1613E   Crazy Robot 0 / 0 7
1553 P1616D   Keep the Average High 0 / 0 7
1537 P1618F   Reverse 0 / 0 7
1530 P1619F   Let's Play the Hat? 0 / 0 7
1529 P1619G   Unusual Minesweeper 0 / 0 7
1524 P1620D   Exact Change 0 / 0 7
1508 P1622D   Shuffle 0 / 0 7
1496 P1624E   Masha-forgetful 0 / 0 7
1495 P1624F   Interacdive Problem 0 / 0 7
1455 P1632D   New Year Concert 0 / 0 7
1443 P1634D   Finding Zero 0 / 0 7
1423 P1638D   Big Brush 0 / 0 7
1408 P1641B   Repetitions Decoding 0 / 0 7
1392 P1646D   Weight the Tree 0 / 0 7
1342 P1657D   For Gamers 0 / 0 7
1287 P1665D   GCD Guess 0 / 0 7
1240 P1672F1   Array Shuffling 0 / 0 7
1225 P1674E   Breaking the Wall 0 / 0 7
1223 P1674G   Remove Directed Edges 0 / 0 7
1187 P1680E   Moving Chips 0 / 0 7
1176 P1682D   Circular Spanning Tree 0 / 0 7
1164 P1685B   Linguistics 0 / 0 7
1137 P1690G   Count the Trains 0 / 0 7
1104 P1696E   Placing Jinas 0 / 0 7
1063 P1702G2   Passable Paths (hard version) 0 / 0 7
1010 P1712D   Empty Graph 0 / 0 7
985 P1716C   Robot in a Hallway 0 / 0 7
984 P1716D   Chip Move 0 / 0 7
973 P1718B   Fibonacci Strings 0 / 0 7
944 P1725C   Circular Mirror 0 / 0 7
930 P1726D   Edge Split 0 / 0 7
901 P1731E   Graph Cost 0 / 0 7
888 P1733D2   Zero-One (Hard Version) 0 / 0 7
833 P1741F   Multi-Colored Segments 0 / 0 7
811 P1744F   MEX vs MED 0 / 0 7
774 P1753C   Wish I Knew How to Sort 0 / 0 7
731 P1763C   Another Array Problem 0 / 0 7
724 P1764D   Doremy's Pegging Game 0 / 0 7
682 P1770D   Koxia and Game 0 / 0 7
591 P1783D   Different Arrays 0 / 0 7
566 P1788D   Moving Dots 0 / 0 7
514 P1796D   Maximum Subarray 0 / 0 7
469 P1804D   Accommodation 0 / 0 7
395 P1815B   Sum Graph 0 / 0 7

分类

手气不错

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