{"workbook":{"problemsBrief":"{\"CSES-1729\":[\"Stick Game\",3761,\"Mathematics\"],\"CSES-1725\":[\"Dice Probability\",3543,\"Mathematics\"],\"CSES-1726\":[\"Moving Robots\",1466,\"Mathematics\"],\"CSES-1727\":[\"Candy Lottery\",1280,\"Mathematics\"],\"CSES-1728\":[\"Inversion Probability\",464,\"Mathematics\"],\"CSES-1722\":[\"Fibonacci Numbers\",8470,\"Mathematics\"],\"CSES-1723\":[\"Graph Paths I\",4144,\"Mathematics\"],\"CSES-1724\":[\"Graph Paths II\",3366,\"Mathematics\"],\"CSES-1715\":[\"Creating Strings II\",10757,\"Mathematics\"],\"CSES-1716\":[\"Distributing Apples\",9741,\"Mathematics\"],\"CSES-1717\":[\"Christmas Party\",5979,\"Mathematics\"],\"CSES-1711\":[\"Distinct Routes\",2706,\"Graph Algorithms\"],\"CSES-1712\":[\"Exponentiation II\",19811,\"Mathematics\"],\"CSES-1713\":[\"Counting Divisors\",29379,\"Mathematics\"],\"CSES-1747\":[\"Pyramid Array\",710,\"Additional Problems I\"],\"CSES-1748\":[\"Increasing Subsequence II\",5580,\"Dynamic Programming\"],\"CSES-1749\":[\"List Removals\",10940,\"Range Queries\"],\"CSES-1628\":[\"Meet in the Middle\",7298,\"Advanced Techniques\"],\"CSES-1629\":[\"Movie Festival\",48123,\"Sorting and Searching\"],\"CSES-1622\":[\"Creating Strings\",48503,\"Introductory Problems\"],\"CSES-1743\":[\"String Reorder\",4433,\"Introductory Problems\"],\"CSES-1623\":[\"Apple Division\",51005,\"Introductory Problems\"],\"CSES-1744\":[\"Rectangle Cutting\",33627,\"Dynamic Programming\"],\"CSES-1624\":[\"Chessboard and Queens\",29749,\"Introductory Problems\"],\"CSES-1745\":[\"Money Sums\",31708,\"Dynamic Programming\"],\"CSES-1625\":[\"Grid Path Description\",10978,\"Introductory Problems\"],\"CSES-1746\":[\"Array Description\",40633,\"Dynamic Programming\"],\"CSES-1740\":[\"Intersection Points\",2220,\"Geometry\"],\"CSES-1620\":[\"Factory Machines\",35276,\"Sorting and Searching\"],\"CSES-1741\":[\"Area of Rectangles\",1289,\"Geometry\"],\"CSES-1621\":[\"Distinct Numbers\",93419,\"Sorting and Searching\"],\"CSES-1742\":[\"Robot Path\",338,\"Geometry\"],\"CSES-1619\":[\"Restaurant Customers\",52841,\"Sorting and Searching\"],\"CSES-1736\":[\"Polynomial Queries\",5272,\"Range Queries\"],\"CSES-1737\":[\"Range Queries and Copies\",2794,\"Range Queries\"],\"CSES-1617\":[\"Bit Strings\",56287,\"Introductory Problems\"],\"CSES-1618\":[\"Trailing Zeros\",64371,\"Introductory Problems\"],\"CSES-1739\":[\"Forest Queries II\",4122,\"Range Queries\"],\"CSES-1732\":[\"Finding Borders\",9414,\"String Algorithms\"],\"CSES-1733\":[\"Finding Periods\",7166,\"String Algorithms\"],\"CSES-1734\":[\"Distinct Values Queries\",8486,\"Range Queries\"],\"CSES-1735\":[\"Range Updates and Sums\",5662,\"Range Queries\"],\"CSES-1730\":[\"Nim Game I\",5451,\"Mathematics\"],\"CSES-1731\":[\"Word Combinations\",6964,\"String Algorithms\"],\"CSES-1648\":[\"Dynamic Range Sum Queries\",34067,\"Range Queries\"],\"CSES-1649\":[\"Dynamic Range Minimum Queries\",27635,\"Range Queries\"],\"CSES-1644\":[\"Maximum Subarray Sum II\",12975,\"Sorting and Searching\"],\"CSES-1645\":[\"Nearest Smaller Values\",23083,\"Sorting and Searching\"],\"CSES-1646\":[\"Static Range Sum Queries\",49325,\"Range Queries\"],\"CSES-1647\":[\"Static Range Minimum Queries\",29213,\"Range Queries\"],\"CSES-1640\":[\"Sum of Two Values\",63623,\"Sorting and Searching\"],\"CSES-1641\":[\"Sum of Three Values\",31468,\"Sorting and Searching\"],\"CSES-1642\":[\"Sum of Four Values\",19342,\"Sorting and Searching\"],\"CSES-1643\":[\"Maximum Subarray Sum\",56607,\"Sorting and Searching\"],\"CSES-1637\":[\"Removing Digits\",68742,\"Dynamic Programming\"],\"CSES-1638\":[\"Grid Paths I\",63616,\"Dynamic Programming\"],\"CSES-1639\":[\"Edit Distance\",43405,\"Dynamic Programming\"],\"CSES-1754\":[\"Coin Piles\",56182,\"Introductory Problems\"],\"CSES-1633\":[\"Dice Combinations\",90387,\"Dynamic Programming\"],\"CSES-1755\":[\"Palindrome Reorder\",54026,\"Introductory Problems\"],\"CSES-1634\":[\"Minimizing Coins\",77556,\"Dynamic Programming\"],\"CSES-1635\":[\"Coin Combinations I\",71024,\"Dynamic Programming\"],\"CSES-1756\":[\"Acyclic Graph Edges\",2301,\"Advanced Graph Problems\"],\"CSES-1636\":[\"Coin Combinations II\",59225,\"Dynamic Programming\"],\"CSES-1757\":[\"Course Schedule II\",2215,\"Advanced Graph Problems\"],\"CSES-1750\":[\"Planets Queries I\",13082,\"Graph Algorithms\"],\"CSES-1630\":[\"Tasks and Deadlines\",24421,\"Sorting and Searching\"],\"CSES-1751\":[\"Planets Cycles\",7700,\"Graph Algorithms\"],\"CSES-1631\":[\"Reading Books\",20737,\"Sorting and Searching\"],\"CSES-1752\":[\"Creating Offices\",462,\"Advanced Graph Problems\"],\"CSES-1632\":[\"Movie Festival II\",13237,\"Sorting and Searching\"],\"CSES-1753\":[\"String Matching\",14158,\"String Algorithms\"],\"CSES-1660\":[\"Subarray Sums I\",33343,\"Sorting and Searching\"],\"CSES-1661\":[\"Subarray Sums II\",31906,\"Sorting and Searching\"],\"CSES-1666\":[\"Building Roads\",55653,\"Graph Algorithms\"],\"CSES-1667\":[\"Message Route\",45402,\"Graph Algorithms\"],\"CSES-1668\":[\"Building Teams\",45978,\"Graph Algorithms\"],\"CSES-1669\":[\"Round Trip\",33686,\"Graph Algorithms\"],\"CSES-1662\":[\"Subarray Divisibility\",27677,\"Sorting and Searching\"],\"CSES-1664\":[\"Movie Festival Queries\",1347,\"Range Queries\"],\"CSES-1665\":[\"Coding Company\",1393,\"Additional Problems II\"],\"CSES-1650\":[\"Range Xor Queries\",29999,\"Range Queries\"],\"CSES-1655\":[\"Maximum Xor Subarray\",2924,\"Bitwise Operations\"],\"CSES-1651\":[\"Range Update Queries\",23413,\"Range Queries\"],\"CSES-1652\":[\"Forest Queries\",26026,\"Range Queries\"],\"CSES-1653\":[\"Elevator Rides\",14819,\"Dynamic Programming\"],\"CSES-1654\":[\"SOS Bit Problem\",2553,\"Bitwise Operations\"],\"CSES-1680\":[\"Longest Flight Route\",12637,\"Graph Algorithms\"],\"CSES-1681\":[\"Game Routes\",17981,\"Graph Algorithms\"],\"CSES-1682\":[\"Flight Routes Check\",13921,\"Graph Algorithms\"],\"CSES-1683\":[\"Planets and Kingdoms\",14142,\"Graph Algorithms\"],\"CSES-2418\":[\"Grid Path Construction\",130,\"Construction Problems\"],\"CSES-2419\":[\"Xor Pyramid Peak\",1934,\"Bitwise Operations\"],\"CSES-1688\":[\"Company Queries II\",19929,\"Tree Algorithms\"],\"CSES-2414\":[\"List of Sums\",472,\"Additional Problems I\"],\"CSES-1203\":[\"Visiting Cities\",697,\"Advanced Graph Problems\"],\"CSES-1202\":[\"Investigation\",14069,\"Graph Algorithms\"],\"CSES-1689\":[\"Knight\\u0027s Tour\",3291,\"Graph Algorithms\"],\"CSES-2415\":[\"Functional Graph Distribution\",247,\"Counting Problems\"],\"CSES-2416\":[\"Increasing Array Queries\",2730,\"Range Queries\"],\"CSES-2417\":[\"Counting Coprime Pairs\",3985,\"Mathematics\"],\"CSES-1684\":[\"Giant Pizza\",5942,\"Graph Algorithms\"],\"CSES-1685\":[\"New Flight Routes\",378,\"Advanced Graph Problems\"],\"CSES-1686\":[\"Coin Collector\",8588,\"Graph Algorithms\"],\"CSES-2413\":[\"Counting Towers\",20952,\"Dynamic Programming\"],\"CSES-1687\":[\"Company Queries I\",20276,\"Tree Algorithms\"],\"CSES-1670\":[\"Swap Game\",2239,\"Additional Problems I\"],\"CSES-1671\":[\"Shortest Routes I\",41009,\"Graph Algorithms\"],\"CSES-1672\":[\"Shortest Routes II\",30214,\"Graph Algorithms\"],\"CSES-1677\":[\"Network Breakdown\",1183,\"Advanced Graph Problems\"],\"CSES-1678\":[\"Round Trip II\",14094,\"Graph Algorithms\"],\"CSES-1679\":[\"Course Schedule\",26617,\"Graph Algorithms\"],\"CSES-1673\":[\"High Score\",18623,\"Graph Algorithms\"],\"CSES-1674\":[\"Subordinates\",37724,\"Tree Algorithms\"],\"CSES-1675\":[\"Road Reparation\",18613,\"Graph Algorithms\"],\"CSES-1676\":[\"Road Construction\",22426,\"Graph Algorithms\"],\"CSES-2402\":[\"Two Stacks Sorting\",183,\"Additional Problems II\"],\"CSES-2430\":[\"Binary Subsequences\",313,\"Additional Problems II\"],\"CSES-2431\":[\"Digit Queries\",19686,\"Introductory Problems\"],\"CSES-3408\":[\"MST Edge Set Check\",21,\"Advanced Graph Problems\"],\"CSES-3409\":[\"MST Edge Cost\",39,\"Advanced Graph Problems\"],\"CSES-3404\":[\"Permutation Subsequence\",19,\"Additional Problems I\"],\"CSES-3405\":[\"Sliding Window Or\",1066,\"Sliding Window Problems\"],\"CSES-3406\":[\"Triangle Number Sums\",27,\"Mathematics\"],\"CSES-3407\":[\"MST Edge Check\",186,\"Advanced Graph Problems\"],\"CSES-2432\":[\"Grid Puzzle I\",532,\"Additional Problems II\"],\"CSES-3400\":[\"Raab Game II\",80,\"Counting Problems\"],\"CSES-3401\":[\"Stick Difference\",308,\"Additional Problems II\"],\"CSES-3402\":[\"Minimum Cost Pairs\",71,\"Additional Problems II\"],\"CSES-3403\":[\"Longest Common Subsequence\",7954,\"Dynamic Programming\"],\"CSES-1691\":[\"Mail Delivery\",6997,\"Graph Algorithms\"],\"CSES-1692\":[\"De Bruijn Sequence\",3657,\"Graph Algorithms\"],\"CSES-1693\":[\"Teleporters Path\",5601,\"Graph Algorithms\"],\"CSES-1694\":[\"Download Speed\",5305,\"Graph Algorithms\"],\"CSES-2420\":[\"Palindrome Queries\",2396,\"String Algorithms\"],\"CSES-1690\":[\"Hamiltonian Flights\",9382,\"Graph Algorithms\"],\"CSES-2429\":[\"Grid Completion\",251,\"Counting Problems\"],\"CSES-2425\":[\"Stack Weights\",649,\"Additional Problems I\"],\"CSES-1699\":[\"Flight Route Requests\",495,\"Advanced Graph Problems\"],\"CSES-2426\":[\"Programmers and Artists\",538,\"Additional Problems II\"],\"CSES-2427\":[\"Letter Pair Move Game\",203,\"Additional Problems I\"],\"CSES-2428\":[\"Distinct Values Subarrays II\",17363,\"Sorting and Searching\"],\"CSES-1695\":[\"Police Chase\",4243,\"Graph Algorithms\"],\"CSES-2421\":[\"Counting Reorders\",323,\"Counting Problems\"],\"CSES-1696\":[\"School Dance\",4011,\"Graph Algorithms\"],\"CSES-2422\":[\"Multiplication Table\",7993,\"Additional Problems I\"],\"CSES-1697\":[\"Chess Tournament\",1201,\"Construction Problems\"],\"CSES-2423\":[\"Filling Trominos\",216,\"Construction Problems\"],\"CSES-1698\":[\"Swap Round Sorting\",630,\"Additional Problems II\"],\"CSES-2210\":[\"Counting Grids\",1765,\"Mathematics\"],\"CSES-3420\":[\"Distinct Values Subarrays\",3807,\"Sorting and Searching\"],\"CSES-3421\":[\"Distinct Values Subsequences\",6061,\"Sorting and Searching\"],\"CSES-2216\":[\"Collecting Numbers\",38051,\"Sorting and Searching\"],\"CSES-3305\":[\"K-th Highest Score\",219,\"Interactive Problems\"],\"CSES-3426\":[\"Sliding Window Xor\",202,\"Sliding Window Problems\"],\"CSES-2217\":[\"Collecting Numbers II\",15560,\"Sorting and Searching\"],\"CSES-3427\":[\"Line Segments Trace I\",20,\"Geometry\"],\"CSES-3306\":[\"Nearest Campsites I\",31,\"Additional Problems I\"],\"CSES-3428\":[\"Line Segments Trace II\",20,\"Geometry\"],\"CSES-3307\":[\"Nearest Campsites II\",132,\"Additional Problems I\"],\"CSES-3429\":[\"Lines and Queries I\",26,\"Geometry\"],\"CSES-3308\":[\"Graph Coloring\",110,\"Advanced Graph Problems\"],\"CSES-3422\":[\"Third Permutation\",382,\"Construction Problems\"],\"CSES-3301\":[\"Maximum Average Subarrays\",13,\"Additional Problems I\"],\"CSES-3423\":[\"Permutation Prime Sums\",198,\"Construction Problems\"],\"CSES-3302\":[\"Subsets with Fixed Average\",29,\"Additional Problems I\"],\"CSES-2214\":[\"Inverse Inversions\",1461,\"Construction Problems\"],\"CSES-3424\":[\"Distinct Sums Grid\",78,\"Construction Problems\"],\"CSES-3303\":[\"Nearest Shops\",669,\"Advanced Graph Problems\"],\"CSES-2215\":[\"Monotone Subsequences\",939,\"Construction Problems\"],\"CSES-3304\":[\"Visible Buildings Queries\",1706,\"Range Queries\"],\"CSES-3425\":[\"Same Sum Subsets\",124,\"Additional Problems II\"],\"CSES-3410\":[\"Maximum Manhattan Distances\",30,\"Geometry\"],\"CSES-1111\":[\"Longest Palindrome\",5581,\"String Algorithms\"],\"CSES-1110\":[\"Minimal Rotation\",2856,\"String Algorithms\"],\"CSES-2209\":[\"Counting Necklaces\",2077,\"Mathematics\"],\"CSES-3419\":[\"Mex Grid Construction\",3898,\"Introductory Problems\"],\"CSES-2205\":[\"Gray Code\",37172,\"Introductory Problems\"],\"CSES-3415\":[\"All Letter Subgrid Count I\",105,\"Counting Problems\"],\"CSES-2206\":[\"Pizzeria Queries\",6829,\"Range Queries\"],\"CSES-3416\":[\"All Letter Subgrid Count II\",92,\"Counting Problems\"],\"CSES-1113\":[\"String Transform\",588,\"String Algorithms\"],\"CSES-2207\":[\"Grundy\\u0027s Game\",1644,\"Mathematics\"],\"CSES-3417\":[\"Border Subgrid Count I\",115,\"Counting Problems\"],\"CSES-1112\":[\"Required Substring\",1635,\"String Algorithms\"],\"CSES-2208\":[\"Another Game\",2173,\"Mathematics\"],\"CSES-3418\":[\"Border Subgrid Count II\",62,\"Counting Problems\"],\"CSES-3411\":[\"All Manhattan Distances\",31,\"Geometry\"],\"CSES-3413\":[\"Filled Subgrid Count I\",403,\"Counting Problems\"],\"CSES-3414\":[\"Filled Subgrid Count II\",23,\"Counting Problems\"],\"CSES-1140\":[\"Projects\",22442,\"Dynamic Programming\"],\"CSES-2110\":[\"Substring Distribution\",970,\"String Algorithms\"],\"CSES-2111\":[\"Apples and Bananas\",891,\"Advanced Techniques\"],\"CSES-2112\":[\"One Bit Positions\",698,\"Advanced Techniques\"],\"CSES-1144\":[\"Salary Queries\",9583,\"Range Queries\"],\"CSES-1143\":[\"Hotel Queries\",16953,\"Range Queries\"],\"CSES-1142\":[\"Advertisement\",4751,\"Additional Problems I\"],\"CSES-1141\":[\"Playlist\",41016,\"Sorting and Searching\"],\"CSES-1148\":[\"Maximum Building II\",444,\"Additional Problems II\"],\"CSES-1147\":[\"Maximum Building I\",2037,\"Additional Problems I\"],\"CSES-1146\":[\"Counting Bits\",5071,\"Bitwise Operations\"],\"CSES-1145\":[\"Increasing Subsequence\",28308,\"Dynamic Programming\"],\"CSES-2113\":[\"Signal Processing\",639,\"Advanced Techniques\"],\"CSES-2115\":[\"Bit Substrings\",315,\"Additional Problems II\"],\"CSES-1149\":[\"Distinct Subsequences\",1163,\"String Algorithms\"],\"CSES-2220\":[\"Counting Numbers\",11193,\"Dynamic Programming\"],\"CSES-3430\":[\"Lines and Queries II\",315,\"Geometry\"],\"CSES-2101\":[\"New Roads Queries\",2572,\"Advanced Techniques\"],\"CSES-3311\":[\"Grid Coloring I\",4839,\"Introductory Problems\"],\"CSES-1133\":[\"Tree Distances II\",14498,\"Tree Algorithms\"],\"CSES-1132\":[\"Tree Distances I\",20309,\"Tree Algorithms\"],\"CSES-1131\":[\"Tree Diameter\",30638,\"Tree Algorithms\"],\"CSES-1130\":[\"Tree Matching\",20025,\"Tree Algorithms\"],\"CSES-1137\":[\"Subtree Queries\",11384,\"Tree Algorithms\"],\"CSES-2106\":[\"Repeating Substring\",2015,\"String Algorithms\"],\"CSES-1136\":[\"Counting Paths\",10170,\"Tree Algorithms\"],\"CSES-2107\":[\"String Functions\",1651,\"String Algorithms\"],\"CSES-2228\":[\"Counting Sequences\",719,\"Counting Problems\"],\"CSES-1135\":[\"Distance Queries\",14668,\"Tree Algorithms\"],\"CSES-2108\":[\"Substring Order I\",1125,\"String Algorithms\"],\"CSES-2229\":[\"Permutation Inversions\",1056,\"Counting Problems\"],\"CSES-1134\":[\"Prüfer Code\",1798,\"Advanced Graph Problems\"],\"CSES-2109\":[\"Substring Order II\",706,\"String Algorithms\"],\"CSES-2102\":[\"Finding Patterns\",2121,\"String Algorithms\"],\"CSES-3312\":[\"Grid Coloring II\",93,\"Additional Problems II\"],\"CSES-2103\":[\"Counting Patterns\",2054,\"String Algorithms\"],\"CSES-1139\":[\"Distinct Colors\",8261,\"Tree Algorithms\"],\"CSES-2104\":[\"Pattern Positions\",1352,\"String Algorithms\"],\"CSES-3314\":[\"Mountain Range\",3506,\"Dynamic Programming\"],\"CSES-1138\":[\"Path Queries\",8129,\"Tree Algorithms\"],\"CSES-2105\":[\"Distinct Substrings\",2025,\"String Algorithms\"],\"CSES-1162\":[\"Sorting Methods\",806,\"Additional Problems I\"],\"CSES-2131\":[\"Grid Puzzle II\",534,\"Additional Problems II\"],\"CSES-3220\":[\"Sliding Window Sum\",3758,\"Sliding Window Problems\"],\"CSES-2132\":[\"Increasing Array II\",839,\"Additional Problems II\"],\"CSES-1161\":[\"Stick Divisions\",4180,\"Additional Problems II\"],\"CSES-3221\":[\"Sliding Window Minimum\",2801,\"Sliding Window Problems\"],\"CSES-1160\":[\"Planets Queries II\",4501,\"Graph Algorithms\"],\"CSES-2133\":[\"Dynamic Connectivity\",1114,\"Advanced Techniques\"],\"CSES-3222\":[\"Sliding Window Distinct Values\",2409,\"Sliding Window Problems\"],\"CSES-2134\":[\"Path Queries II\",3700,\"Tree Algorithms\"],\"CSES-3223\":[\"Sliding Window Inversions\",937,\"Sliding Window Problems\"],\"CSES-1164\":[\"Room Allocation\",21111,\"Sorting and Searching\"],\"CSES-1163\":[\"Traffic Lights\",27292,\"Sorting and Searching\"],\"CSES-2130\":[\"Distinct Routes II\",512,\"Advanced Techniques\"],\"CSES-3228\":[\"Permuted Binary Strings\",306,\"Interactive Problems\"],\"CSES-3108\":[\"K Subset Sums I\",106,\"Additional Problems II\"],\"CSES-3109\":[\"K Subset Sums II\",79,\"Additional Problems II\"],\"CSES-3224\":[\"Sliding Window Mode\",2061,\"Sliding Window Problems\"],\"CSES-2136\":[\"Hamming Distance\",3519,\"Advanced Techniques\"],\"CSES-3225\":[\"Inverse Suffix Array\",529,\"String Algorithms\"],\"CSES-2137\":[\"Corner Subgrid Count\",2314,\"Advanced Techniques\"],\"CSES-3226\":[\"Subarray Sum Queries II\",2114,\"Range Queries\"],\"CSES-2138\":[\"Reachable Nodes\",2173,\"Advanced Techniques\"],\"CSES-3227\":[\"Sliding Window Advertisement\",138,\"Sliding Window Problems\"],\"CSES-2121\":[\"Parcel Delivery\",671,\"Advanced Techniques\"],\"CSES-3211\":[\"Number of Subset Xors\",439,\"Bitwise Operations\"],\"CSES-1159\":[\"Book Shop II\",1128,\"Additional Problems II\"],\"CSES-3217\":[\"Knight Moves Grid\",6089,\"Introductory Problems\"],\"CSES-1158\":[\"Book Shop\",55241,\"Dynamic Programming\"],\"CSES-2129\":[\"Task Assignment\",774,\"Advanced Techniques\"],\"CSES-3218\":[\"Knight Moves Queries\",83,\"Additional Problems II\"],\"CSES-1157\":[\"Mex Grid Queries\",831,\"Additional Problems II\"],\"CSES-3219\":[\"Sliding Window Mex\",2762,\"Sliding Window Problems\"],\"CSES-3213\":[\"Water Containers Moves\",19,\"Additional Problems I\"],\"CSES-3214\":[\"Water Containers Queries\",18,\"Additional Problems I\"],\"CSES-3215\":[\"Bouncing Ball Steps\",99,\"Additional Problems II\"],\"CSES-3216\":[\"Bouncing Ball Cycle\",47,\"Additional Problems II\"],\"CSES-1188\":[\"Bit Inversions\",2342,\"Additional Problems I\"],\"CSES-3360\":[\"Corner Subgrid Check\",409,\"Advanced Techniques\"],\"CSES-3361\":[\"Two Array Average\",48,\"Additional Problems I\"],\"CSES-1069\":[\"Repetitions\",128025,\"Introductory Problems\"],\"CSES-1068\":[\"Weird Algorithm\",176308,\"Introductory Problems\"],\"CSES-1189\":[\"Food Division\",513,\"Additional Problems II\"],\"CSES-2143\":[\"Reachability Queries\",1397,\"Advanced Techniques\"],\"CSES-3111\":[\"Transfer Speeds Sum\",21,\"Advanced Graph Problems\"],\"CSES-3232\":[\"Tournament Graph Distribution\",103,\"Counting Problems\"],\"CSES-3112\":[\"Hidden Integer\",1975,\"Interactive Problems\"],\"CSES-3233\":[\"All Subarray Xors\",148,\"Bitwise Operations\"],\"CSES-3355\":[\"Sum of Four Squares\",99,\"Mathematics\"],\"CSES-3356\":[\"Distinct Values Queries II\",1094,\"Range Queries\"],\"CSES-3114\":[\"Tree Coin Collecting I\",153,\"Advanced Graph Problems\"],\"CSES-3357\":[\"Fixed Length Walk Queries\",257,\"Advanced Graph Problems\"],\"CSES-3358\":[\"Split into Two Paths\",65,\"Advanced Graph Problems\"],\"CSES-3359\":[\"Minimal Grid Path\",3582,\"Dynamic Programming\"],\"CSES-1085\":[\"Array Division\",26691,\"Sorting and Searching\"],\"CSES-1084\":[\"Apartments\",67135,\"Sorting and Searching\"],\"CSES-2176\":[\"Counting Bishops\",427,\"Counting Problems\"],\"CSES-1083\":[\"Missing Number\",154609,\"Introductory Problems\"],\"CSES-2177\":[\"Strongly Connected Edges\",1747,\"Advanced Graph Problems\"],\"CSES-1082\":[\"Sum of Divisors\",9906,\"Mathematics\"],\"CSES-3140\":[\"Inversion Sorting\",262,\"Interactive Problems\"],\"CSES-1087\":[\"Shortest Subsequence\",3041,\"Additional Problems I\"],\"CSES-3141\":[\"And Subset Count\",63,\"Bitwise Operations\"],\"CSES-1086\":[\"Writing Numbers\",787,\"Additional Problems I\"],\"CSES-2174\":[\"Removing Digits II\",214,\"Additional Problems II\"],\"CSES-1081\":[\"Common Divisors\",16588,\"Mathematics\"],\"CSES-1080\":[\"Empty String\",1838,\"Counting Problems\"],\"CSES-2179\":[\"Even Outdegree Edges\",1361,\"Advanced Graph Problems\"],\"CSES-3149\":[\"Tree Coin Collecting II\",169,\"Advanced Graph Problems\"],\"CSES-1074\":[\"Stick Lengths\",49582,\"Sorting and Searching\"],\"CSES-1195\":[\"Flight Discount\",24636,\"Graph Algorithms\"],\"CSES-2164\":[\"Josephus Queries\",5291,\"Mathematics\"],\"CSES-1073\":[\"Towers\",37971,\"Sorting and Searching\"],\"CSES-2165\":[\"Tower of Hanoi\",35009,\"Introductory Problems\"],\"CSES-1194\":[\"Monsters\",25089,\"Graph Algorithms\"],\"CSES-1072\":[\"Two Knights\",57487,\"Introductory Problems\"],\"CSES-1193\":[\"Labyrinth\",42652,\"Graph Algorithms\"],\"CSES-2166\":[\"Prefix Sum Queries\",6955,\"Range Queries\"],\"CSES-1071\":[\"Number Spiral\",69234,\"Introductory Problems\"],\"CSES-1192\":[\"Counting Rooms\",64531,\"Graph Algorithms\"],\"CSES-1078\":[\"Grid Paths II\",807,\"Counting Problems\"],\"CSES-1077\":[\"Sliding Window Cost\",9309,\"Sliding Window Problems\"],\"CSES-1076\":[\"Sliding Window Median\",14521,\"Sliding Window Problems\"],\"CSES-2162\":[\"Josephus Problem I\",21729,\"Sorting and Searching\"],\"CSES-1197\":[\"Cycle Finding\",17580,\"Graph Algorithms\"],\"CSES-1075\":[\"Counting Permutations\",978,\"Counting Problems\"],\"CSES-2163\":[\"Josephus Problem II\",12080,\"Sorting and Searching\"],\"CSES-1196\":[\"Flight Routes\",16950,\"Graph Algorithms\"],\"CSES-1070\":[\"Permutations\",105962,\"Introductory Problems\"],\"CSES-1191\":[\"Cyclic Array\",1276,\"Additional Problems I\"],\"CSES-1190\":[\"Subarray Sum Queries\",8227,\"Range Queries\"],\"CSES-1079\":[\"Binomial Coefficients\",10356,\"Mathematics\"],\"CSES-2168\":[\"Nested Ranges Check\",9342,\"Sorting and Searching\"],\"CSES-2169\":[\"Nested Ranges Count\",6978,\"Sorting and Searching\"],\"CSES-3138\":[\"All Palindromes\",792,\"String Algorithms\"],\"CSES-3139\":[\"Hidden Permutation\",918,\"Interactive Problems\"],\"CSES-2076\":[\"Necessary Roads\",2187,\"Advanced Techniques\"],\"CSES-2077\":[\"Necessary Cities\",1721,\"Advanced Techniques\"],\"CSES-2078\":[\"Eulerian Subgraphs\",750,\"Advanced Techniques\"],\"CSES-2079\":[\"Finding a Centroid\",6577,\"Tree Algorithms\"],\"CSES-2193\":[\"Polygon Lattice Points\",2089,\"Geometry\"],\"CSES-2072\":[\"Cut and Paste\",1433,\"Advanced Techniques\"],\"CSES-3161\":[\"GCD Subsets\",274,\"Additional Problems II\"],\"CSES-2194\":[\"Minimum Euclidean Distance\",1838,\"Geometry\"],\"CSES-2073\":[\"Substring Reversals\",1254,\"Advanced Techniques\"],\"CSES-2195\":[\"Convex Hull\",3172,\"Geometry\"],\"CSES-2074\":[\"Reversals and Sums\",1239,\"Advanced Techniques\"],\"CSES-3163\":[\"Range Interval Queries\",797,\"Range Queries\"],\"CSES-2075\":[\"Reversal Sorting\",352,\"Additional Problems II\"],\"CSES-2190\":[\"Line Segment Intersection\",4643,\"Geometry\"],\"CSES-2191\":[\"Polygon Area\",4726,\"Geometry\"],\"CSES-2192\":[\"Point in Polygon\",2465,\"Geometry\"],\"CSES-3169\":[\"Counting LCM Arrays\",44,\"Additional Problems I\"],\"CSES-1096\":[\"Throwing Dice\",3449,\"Mathematics\"],\"CSES-2186\":[\"Special Substrings\",980,\"Additional Problems I\"],\"CSES-3396\":[\"Next Prime\",1875,\"Mathematics\"],\"CSES-3154\":[\"System of Linear Equations\",25,\"Mathematics\"],\"CSES-1095\":[\"Exponentiation\",24822,\"Mathematics\"],\"CSES-2187\":[\"Bracket Sequences II\",2286,\"Mathematics\"],\"CSES-3397\":[\"Permutation Order\",57,\"Mathematics\"],\"CSES-1094\":[\"Increasing Array\",122885,\"Introductory Problems\"],\"CSES-3398\":[\"Permutation Rounds\",1057,\"Mathematics\"],\"CSES-1093\":[\"Two Sets II\",29984,\"Dynamic Programming\"],\"CSES-2189\":[\"Point Location Test\",8700,\"Geometry\"],\"CSES-3399\":[\"Raab Game I\",5887,\"Introductory Problems\"],\"CSES-3157\":[\"Collecting Numbers Distribution\",132,\"Counting Problems\"],\"CSES-2182\":[\"Divisor Analysis\",5212,\"Mathematics\"],\"CSES-3150\":[\"Disctint Values Sum\",105,\"Additional Problems I\"],\"CSES-1099\":[\"Stair Game\",2400,\"Mathematics\"],\"CSES-2183\":[\"Missing Coin Sum\",36542,\"Sorting and Searching\"],\"CSES-3151\":[\"Bubble Sort Rounds I\",417,\"Additional Problems I\"],\"CSES-1098\":[\"Nim Game II\",4411,\"Mathematics\"],\"CSES-2184\":[\"Missing Coin Sum Queries\",718,\"Range Queries\"],\"CSES-3273\":[\"Colored Chairs\",258,\"Interactive Problems\"],\"CSES-3152\":[\"Bubble Sort Rounds II\",32,\"Additional Problems I\"],\"CSES-1097\":[\"Removal Game\",19850,\"Dynamic Programming\"],\"CSES-2185\":[\"Prime Multiples\",7294,\"Mathematics\"],\"CSES-2064\":[\"Bracket Sequences I\",4824,\"Mathematics\"],\"CSES-2180\":[\"Coin Arrangement\",340,\"Additional Problems II\"],\"CSES-2181\":[\"Counting Tilings\",8216,\"Dynamic Programming\"],\"CSES-1092\":[\"Two Sets\",61199,\"Introductory Problems\"],\"CSES-1091\":[\"Concert Tickets\",50848,\"Sorting and Searching\"],\"CSES-1090\":[\"Ferris Wheel\",63967,\"Sorting and Searching\"],\"CSES-3158\":[\"Bus Companies\",311,\"Advanced Graph Problems\"],\"CSES-3159\":[\"Replace with Difference\",348,\"Additional Problems II\"],\"CSES-2087\":[\"Houses and Schools\",884,\"Advanced Techniques\"],\"CSES-2088\":[\"Knuth Division\",810,\"Advanced Techniques\"],\"CSES-2084\":[\"Monster Game I\",1048,\"Advanced Techniques\"],\"CSES-3294\":[\"Subarray Sum Constraints\",18,\"Additional Problems I\"],\"CSES-2085\":[\"Monster Game II\",912,\"Advanced Techniques\"],\"CSES-2086\":[\"Subarray Squares\",1611,\"Advanced Techniques\"],\"CSES-3175\":[\"Beautiful Permutation II\",421,\"Additional Problems I\"],\"CSES-2080\":[\"Fixed-Length Paths I\",3514,\"Tree Algorithms\"],\"CSES-2081\":[\"Fixed-Length Paths II\",1544,\"Tree Algorithms\"],\"CSES-3194\":[\"Xor Pyramid Diagonal\",25,\"Bitwise Operations\"],\"CSES-3195\":[\"Xor Pyramid Row\",274,\"Bitwise Operations\"],\"CSES-3190\":[\"Distinct Values Splits\",41,\"Additional Problems I\"],\"CSES-3191\":[\"Maximum Xor Subset\",627,\"Bitwise Operations\"],\"CSES-3192\":[\"K Subset Xors\",421,\"Bitwise Operations\"],\"CSES-3193\":[\"Square Subsets\",23,\"Additional Problems I\"],\"CSES-1707\":[\"Graph Girth\",3838,\"Advanced Graph Problems\"],\"CSES-1709\":[\"Coin Grid\",877,\"Additional Problems II\"],\"CSES-1703\":[\"Critical Cities\",460,\"Advanced Graph Problems\"],\"CSES-1704\":[\"Network Renovation\",988,\"Advanced Graph Problems\"],\"CSES-1705\":[\"Forbidden Cities\",907,\"Advanced Graph Problems\"],\"CSES-1706\":[\"School Excursion\",1501,\"Additional Problems II\"],\"CSES-1700\":[\"Tree Isomorphism I\",1332,\"Advanced Graph Problems\"],\"CSES-1701\":[\"Tree Isomorphism II\",1056,\"Advanced Graph Problems\"],\"CSES-1702\":[\"Tree Traversals\",1397,\"Advanced Graph Problems\"]}","joined":false,"groups":{},"endTime":1924963199000},"managingGroups":{},"collectingGroups":[],"author":"tingshuo","updateTime":1780391410000,"title":"CSES Problem Set 个人记录","dislikeCnt":0,"content":"[end:1924963199]\n训练用\n#### Introductory Problems\n[problem:CSES-1068] [problem:CSES-1083] [problem:CSES-1069] 最长相同序列[problem:CSES-1094] 模拟[problem:CSES-1070] [problem:CSES-1071] [problem:CSES-1072] [problem:CSES-1092] 观察 + 推式子 [problem:CSES-1617] 组合数学，每个位都有0和1两种[problem:CSES-1618] 统计因子5的个数[problem:CSES-1754] [problem:CSES-1755] 重排得到回文字符串[problem:CSES-2205] [problem:CSES-2165] [problem:CSES-1622] [problem:CSES-1623] [problem:CSES-1624] [problem:CSES-3399] [problem:CSES-3419] [problem:CSES-3217] [problem:CSES-3311] [problem:CSES-2431] [problem:CSES-1743] [problem:CSES-1625]\n\n#### Sorting and Searching\n[problem:CSES-1621] set去重[problem:CSES-1084] 相向双指针[problem:CSES-1090] [problem:CSES-1091] [problem:CSES-1619] 一维差分，使用哈希表存 [problem:CSES-1629] 最大不相交区间数量 [problem:CSES-1640] [problem:CSES-1643] 最大利润问题，前缀和枚举 [problem:CSES-1074] [problem:CSES-2183] [problem:CSES-2216] [problem:CSES-2217] [problem:CSES-1141] 滑动窗口模版 [problem:CSES-1073] [problem:CSES-1163] [problem:CSES-3420] 滑动窗口模版 [problem:CSES-3421] [problem:CSES-2162] [problem:CSES-2163] [problem:CSES-2168] [problem:CSES-2169] [problem:CSES-1164] [problem:CSES-1620] [problem:CSES-1630] [problem:CSES-1631] [problem:CSES-1641] [problem:CSES-1642] [problem:CSES-1645] 单调栈模板[problem:CSES-1660] 滑动窗口模板 [problem:CSES-1661] 哈希表被卡，使用二分 [problem:CSES-1662] 前缀和（K倍区间问题）\n[problem:CSES-2428] 滑动窗口模版[problem:CSES-1085] 二分答案（画匠问题）\n[problem:CSES-1632] [problem:CSES-1644] \n\n#### Dynamic Programming\n[problem:CSES-1633] 排列型完全背包[problem:CSES-1634] 完全背包求最值[problem:CSES-1635]排列型完全背包py会超时，用c++ [problem:CSES-1636]组合型完全背包求方案数 [problem:CSES-1637] [problem:CSES-1638]网格图dp [problem:CSES-1158]01背包求最值模板 [problem:CSES-1746] [problem:CSES-2413] [problem:CSES-1639] [problem:CSES-3403] [problem:CSES-1744] [problem:CSES-3359] [problem:CSES-1745] 可行性01背包[problem:CSES-1097] [problem:CSES-1093] [problem:CSES-3314] [problem:CSES-1145] 最长上升子序列（二分）[problem:CSES-1140] [problem:CSES-1653] [problem:CSES-2181] [problem:CSES-2220] [problem:CSES-1748] \n\n#### Graph Algorithms\n[problem:CSES-1192]连通块问题\n[problem:CSES-1193]bfs并输出路径\n[problem:CSES-1666]并查集统计连通块数量，并连边\n[problem:CSES-1667]bfs最短路，并输出路径\n[problem:CSES-1668]二分图染色或扩展域并查集\n[problem:CSES-1669] dfs寻找环并回溯环上节点\n[problem:CSES-1194] 多源BFS并输出路径\n[problem:CSES-1671]Dijkstra模板\n[problem:CSES-1672]\n[problem:CSES-1673]SPFA最长路判正权环，不过有条件，这个环一定要可以到达n [problem:CSES-1195] \n[problem:CSES-1197] 找出负环\n[problem:CSES-1196]\n[problem:CSES-1678] \n[problem:CSES-1679]拓扑排序模板\n[problem:CSES-1680]拓扑排序+DP求最长路\n[problem:CSES-1681]拓扑排序+计数DP\n[problem:CSES-1202]\n[problem:CSES-1750] \n[problem:CSES-1160] \n[problem:CSES-1751]\n[problem:CSES-1675]MST模板\n[problem:CSES-1676] 并查集、记录最大sz\n[problem:CSES-1682] 强连通分量模板或两次bfs/dfs\n[problem:CSES-1683] 强连通分量模板\n[problem:CSES-1684]\n[problem:CSES-1686] 缩点求最长路模板\n[problem:CSES-1691]\n[problem:CSES-1692]\n[problem:CSES-1693]\n[problem:CSES-1690]\n[problem:CSES-1689] \n[problem:CSES-1694]\n[problem:CSES-1695]\n[problem:CSES-1696]\n[problem:CSES-1711] \n\n#### Range Queries\n[problem:CSES-1646] 前缀和模板\n[problem:CSES-1647] 倍增ST表\n[problem:CSES-1648] 树状数组单点更新区查\n[problem:CSES-1649] 单点更新，区间最值 \n[problem:CSES-1650] 前缀异或和\n[problem:CSES-1651] 树状数组点查区修\n[problem:CSES-1652]二维前缀和 \n[problem:CSES-1143] \n[problem:CSES-1749] \n[problem:CSES-1144] 离散化 + 单修区查 \n[problem:CSES-2166] \n[problem:CSES-2206] [problem:CSES-3304]\n[problem:CSES-3163] [problem:CSES-1190] \n[problem:CSES-3226] [problem:CSES-1734] 离线处理+ 区间种类数\n[problem:CSES-3356] [problem:CSES-2416] \n[problem:CSES-1664] [problem:CSES-1739] 二维树状数组\n[problem:CSES-1735] [problem:CSES-1736] \n[problem:CSES-1737] [problem:CSES-2184] \n\n#### Tree Algorithms\n[problem:CSES-1674] 树形DP或DFS递归返回每个结点的sz[problem:CSES-1130] [problem:CSES-1131] [problem:CSES-1132] [problem:CSES-1133] [problem:CSES-1687] 节点的第k个祖先查询[problem:CSES-1688] 最近公共祖先模板[problem:CSES-1135] [problem:CSES-1136] [problem:CSES-1137] dfs序与树状数组模板 [problem:CSES-1138] [problem:CSES-2134] [problem:CSES-1139] [problem:CSES-2079] [problem:CSES-2080] [problem:CSES-2081] \n\n#### Mathematics\n[problem:CSES-2164] \n[problem:CSES-1095]快速幂 \n[problem:CSES-1712] 快速幂 + 欧拉降幂 \n[problem:CSES-1713] 试除法求约数个数 \n[problem:CSES-1081] \n[problem:CSES-1082]\n[problem:CSES-2182] \n[problem:CSES-2185]\n[problem:CSES-2417] \n[problem:CSES-3396] \n[problem:CSES-1079] 阶乘逆元求组合数\n[problem:CSES-1715] \n[problem:CSES-1716]\n[problem:CSES-1717]\n[problem:CSES-3397] \n[problem:CSES-3398]\n[problem:CSES-2064] \n[problem:CSES-2187] \n[problem:CSES-2209] \n[problem:CSES-2210] [problem:CSES-1722] 矩阵快速幂优化\n[problem:CSES-1096] [problem:CSES-1723] [problem:CSES-1724] [problem:CSES-3154] [problem:CSES-3355] [problem:CSES-3406] [problem:CSES-1725] [problem:CSES-1726] [problem:CSES-1727] [problem:CSES-1728] [problem:CSES-1729] [problem:CSES-1730] [problem:CSES-1098] [problem:CSES-1099] [problem:CSES-2207] [problem:CSES-2208] \n\n#### String Algorithms\n[problem:CSES-1731] [problem:CSES-1753] [problem:CSES-1732] [problem:CSES-1733] [problem:CSES-1110] [problem:CSES-1111] [problem:CSES-3138] [problem:CSES-1112] [problem:CSES-2420] [problem:CSES-2102] [problem:CSES-2103] [problem:CSES-2104] [problem:CSES-2105] [problem:CSES-1149] [problem:CSES-2106] [problem:CSES-2107] [problem:CSES-3225] [problem:CSES-1113] [problem:CSES-2108] [problem:CSES-2109] [problem:CSES-2110] \n\n#### Geometry\n[problem:CSES-2189] [problem:CSES-2190] [problem:CSES-2191] [problem:CSES-2192] [problem:CSES-2193] [problem:CSES-2194] [problem:CSES-2195] [problem:CSES-3410] [problem:CSES-3411] [problem:CSES-1740] [problem:CSES-3427] [problem:CSES-3428] [problem:CSES-3429] [problem:CSES-3430] [problem:CSES-1741] [problem:CSES-1742] \n\n#### Advanced Techniques\n[problem:CSES-1628] [problem:CSES-2136] [problem:CSES-3360] [problem:CSES-2137] [problem:CSES-2138] [problem:CSES-2143] [problem:CSES-2072] [problem:CSES-2073] [problem:CSES-2074] [problem:CSES-2076] [problem:CSES-2077] [problem:CSES-2078] [problem:CSES-2084] [problem:CSES-2085] [problem:CSES-2086] [problem:CSES-2087] [problem:CSES-2088] [problem:CSES-2111] [problem:CSES-2112] [problem:CSES-2113] [problem:CSES-2101] [problem:CSES-2133] [problem:CSES-2121] [problem:CSES-2129] [problem:CSES-2130] \n\n#### Sliding Window Problems\n[problem:CSES-3220] [problem:CSES-3221] [problem:CSES-3426] [problem:CSES-3405] [problem:CSES-3222] [problem:CSES-3224] [problem:CSES-3219] [problem:CSES-1076] [problem:CSES-1077] [problem:CSES-3223] [problem:CSES-3227] \n\n#### Interactive Problems\n[problem:CSES-3112] [problem:CSES-3139] [problem:CSES-3305] [problem:CSES-3228] [problem:CSES-3273] [problem:CSES-3140] \n\n#### Bitwise Operations\n[problem:CSES-1146] [problem:CSES-1655] [problem:CSES-3191] [problem:CSES-3211] [problem:CSES-3192] [problem:CSES-3233] [problem:CSES-2419] [problem:CSES-3194] [problem:CSES-3195] [problem:CSES-1654] [problem:CSES-3141] \n\n#### Construction Problems\n[problem:CSES-2214] [problem:CSES-2215] [problem:CSES-3422] [problem:CSES-3423] [problem:CSES-1697] [problem:CSES-3424] [problem:CSES-2423] [problem:CSES-2418] \n\n#### Advanced Graph Problems\n[problem:CSES-3303] [problem:CSES-1134] [problem:CSES-1702] [problem:CSES-1757] 反图上最大堆拓扑排序 \n[problem:CSES-1756] [problem:CSES-2177] [problem:CSES-2179] [problem:CSES-1707] [problem:CSES-3357] [problem:CSES-3111] [problem:CSES-3407] [problem:CSES-3408] [problem:CSES-3409] [problem:CSES-1677] [problem:CSES-3114] [problem:CSES-3149] [problem:CSES-1700] [problem:CSES-1701] [problem:CSES-1699] [problem:CSES-1703] [problem:CSES-1203] [problem:CSES-3308] [problem:CSES-3158] [problem:CSES-3358] [problem:CSES-1704] [problem:CSES-1705] [problem:CSES-1752] [problem:CSES-1685] \n\n#### Counting Problems\n[problem:CSES-3413] [problem:CSES-3414] [problem:CSES-3415] [problem:CSES-3416] [problem:CSES-3417] [problem:CSES-3418] [problem:CSES-3400] [problem:CSES-1080] [problem:CSES-2229] [problem:CSES-2176] [problem:CSES-2228] [problem:CSES-1078] [problem:CSES-1075] [problem:CSES-2429] [problem:CSES-2421] [problem:CSES-3232] [problem:CSES-3157] [problem:CSES-2415] \n\n#### Additional Problems I\n[problem:CSES-1087] [problem:CSES-3150] [problem:CSES-3190] [problem:CSES-1670] [problem:CSES-3175] [problem:CSES-2422] [problem:CSES-3151] [problem:CSES-3152] [problem:CSES-3306] [problem:CSES-3307] [problem:CSES-1142] 单调栈与柱状图面积问题 [problem:CSES-2186] [problem:CSES-3169] [problem:CSES-3193] [problem:CSES-3294] [problem:CSES-3213] [problem:CSES-3214] [problem:CSES-2425] [problem:CSES-3301] [problem:CSES-3302] [problem:CSES-3361] [problem:CSES-1747] [problem:CSES-3404] [problem:CSES-1188] [problem:CSES-1086] [problem:CSES-2427] [problem:CSES-1147] [problem:CSES-1162] [problem:CSES-1191] [problem:CSES-2414] \n\n#### Additional Problems II\n[problem:CSES-3215] [problem:CSES-3216] [problem:CSES-3218] [problem:CSES-3108] [problem:CSES-3109] [problem:CSES-2132] [problem:CSES-1189] [problem:CSES-1698] [problem:CSES-2430] [problem:CSES-1706] [problem:CSES-1709] [problem:CSES-3312] [problem:CSES-2426] [problem:CSES-2174] [problem:CSES-2180] [problem:CSES-3159] [problem:CSES-2432] [problem:CSES-2131] [problem:CSES-2115] [problem:CSES-2075] [problem:CSES-1159] [problem:CSES-3161] [problem:CSES-3402] [problem:CSES-3425] [problem:CSES-1157] [problem:CSES-1148] [problem:CSES-1161] [problem:CSES-3401] [problem:CSES-1665] [problem:CSES-2402]\n\n---\nOld version: [~2025.05.12](https://vjudge.net/article/8688)\n\n\u003chr\u003e\u003cp\u003eCloned from \u003ca href\u003d\u0027/article/2856\u0027 target\u003d\u0027_blank\u0027\u003eIsun\u0027s article\u003c/a\u003e.\u003c/p\u003e","threadId":273524,"likeCnt":1,"createTime":1754831941000,"isWorkbook":true,"viewCnt":2500,"openness":2,"fav":false,"id":10496,"trustable":false}
