uid stringlengths 9 18 | source stringclasses 2
values | native_id stringlengths 3 7 | title stringlengths 2 64 | url stringlengths 36 49 | tags listlengths 0 11 | time_limit_ms null | memory_limit_mb null | io_type stringclasses 1
value | difficulty_rating int64 800 3.5k ⌀ | stats dict | last_scraped_at stringclasses 2
values |
|---|---|---|---|---|---|---|---|---|---|---|---|
cses:1634 | cses | 1634 | Minimizing Coins | https://cses.fi/problemset/task/1634 | [
"Dynamic Programming"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1635 | cses | 1635 | Coin Combinations I | https://cses.fi/problemset/task/1635 | [
"Dynamic Programming"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1636 | cses | 1636 | Coin Combinations II | https://cses.fi/problemset/task/1636 | [
"Dynamic Programming"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1637 | cses | 1637 | Removing Digits | https://cses.fi/problemset/task/1637 | [
"Dynamic Programming"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1638 | cses | 1638 | Grid Paths I | https://cses.fi/problemset/task/1638 | [
"Dynamic Programming"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1158 | cses | 1158 | Book Shop | https://cses.fi/problemset/task/1158 | [
"Dynamic Programming"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1746 | cses | 1746 | Array Description | https://cses.fi/problemset/task/1746 | [
"Dynamic Programming"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:2413 | cses | 2413 | Counting Towers | https://cses.fi/problemset/task/2413 | [
"Dynamic Programming"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1639 | cses | 1639 | Edit Distance | https://cses.fi/problemset/task/1639 | [
"Dynamic Programming"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:3403 | cses | 3403 | Longest Common Subsequence | https://cses.fi/problemset/task/3403 | [
"Dynamic Programming"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1744 | cses | 1744 | Rectangle Cutting | https://cses.fi/problemset/task/1744 | [
"Dynamic Programming"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:3359 | cses | 3359 | Minimal Grid Path | https://cses.fi/problemset/task/3359 | [
"Dynamic Programming"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1745 | cses | 1745 | Money Sums | https://cses.fi/problemset/task/1745 | [
"Dynamic Programming"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1097 | cses | 1097 | Removal Game | https://cses.fi/problemset/task/1097 | [
"Dynamic Programming"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1093 | cses | 1093 | Two Sets II | https://cses.fi/problemset/task/1093 | [
"Dynamic Programming"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:3314 | cses | 3314 | Mountain Range | https://cses.fi/problemset/task/3314 | [
"Dynamic Programming"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1145 | cses | 1145 | Increasing Subsequence | https://cses.fi/problemset/task/1145 | [
"Dynamic Programming"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1140 | cses | 1140 | Projects | https://cses.fi/problemset/task/1140 | [
"Dynamic Programming"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1653 | cses | 1653 | Elevator Rides | https://cses.fi/problemset/task/1653 | [
"Dynamic Programming"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:2181 | cses | 2181 | Counting Tilings | https://cses.fi/problemset/task/2181 | [
"Dynamic Programming"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:2220 | cses | 2220 | Counting Numbers | https://cses.fi/problemset/task/2220 | [
"Dynamic Programming"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1748 | cses | 1748 | Increasing Subsequence II | https://cses.fi/problemset/task/1748 | [
"Dynamic Programming"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1192 | cses | 1192 | Counting Rooms | https://cses.fi/problemset/task/1192 | [
"Graph Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1193 | cses | 1193 | Labyrinth | https://cses.fi/problemset/task/1193 | [
"Graph Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1666 | cses | 1666 | Building Roads | https://cses.fi/problemset/task/1666 | [
"Graph Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1667 | cses | 1667 | Message Route | https://cses.fi/problemset/task/1667 | [
"Graph Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1668 | cses | 1668 | Building Teams | https://cses.fi/problemset/task/1668 | [
"Graph Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1669 | cses | 1669 | Round Trip | https://cses.fi/problemset/task/1669 | [
"Graph Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1194 | cses | 1194 | Monsters | https://cses.fi/problemset/task/1194 | [
"Graph Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1671 | cses | 1671 | Shortest Routes I | https://cses.fi/problemset/task/1671 | [
"Graph Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1672 | cses | 1672 | Shortest Routes II | https://cses.fi/problemset/task/1672 | [
"Graph Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1673 | cses | 1673 | High Score | https://cses.fi/problemset/task/1673 | [
"Graph Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1195 | cses | 1195 | Flight Discount | https://cses.fi/problemset/task/1195 | [
"Graph Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1197 | cses | 1197 | Cycle Finding | https://cses.fi/problemset/task/1197 | [
"Graph Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1196 | cses | 1196 | Flight Routes | https://cses.fi/problemset/task/1196 | [
"Graph Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1678 | cses | 1678 | Round Trip II | https://cses.fi/problemset/task/1678 | [
"Graph Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1679 | cses | 1679 | Course Schedule | https://cses.fi/problemset/task/1679 | [
"Graph Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1680 | cses | 1680 | Longest Flight Route | https://cses.fi/problemset/task/1680 | [
"Graph Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1681 | cses | 1681 | Game Routes | https://cses.fi/problemset/task/1681 | [
"Graph Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1202 | cses | 1202 | Investigation | https://cses.fi/problemset/task/1202 | [
"Graph Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1750 | cses | 1750 | Planets Queries I | https://cses.fi/problemset/task/1750 | [
"Graph Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1160 | cses | 1160 | Planets Queries II | https://cses.fi/problemset/task/1160 | [
"Graph Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1751 | cses | 1751 | Planets Cycles | https://cses.fi/problemset/task/1751 | [
"Graph Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1675 | cses | 1675 | Road Reparation | https://cses.fi/problemset/task/1675 | [
"Graph Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1676 | cses | 1676 | Road Construction | https://cses.fi/problemset/task/1676 | [
"Graph Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1682 | cses | 1682 | Flight Routes Check | https://cses.fi/problemset/task/1682 | [
"Graph Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1683 | cses | 1683 | Planets and Kingdoms | https://cses.fi/problemset/task/1683 | [
"Graph Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1684 | cses | 1684 | Giant Pizza | https://cses.fi/problemset/task/1684 | [
"Graph Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1686 | cses | 1686 | Coin Collector | https://cses.fi/problemset/task/1686 | [
"Graph Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1691 | cses | 1691 | Mail Delivery | https://cses.fi/problemset/task/1691 | [
"Graph Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1692 | cses | 1692 | De Bruijn Sequence | https://cses.fi/problemset/task/1692 | [
"Graph Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1693 | cses | 1693 | Teleporters Path | https://cses.fi/problemset/task/1693 | [
"Graph Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1690 | cses | 1690 | Hamiltonian Flights | https://cses.fi/problemset/task/1690 | [
"Graph Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1689 | cses | 1689 | Knight's Tour | https://cses.fi/problemset/task/1689 | [
"Graph Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1694 | cses | 1694 | Download Speed | https://cses.fi/problemset/task/1694 | [
"Graph Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1695 | cses | 1695 | Police Chase | https://cses.fi/problemset/task/1695 | [
"Graph Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1696 | cses | 1696 | School Dance | https://cses.fi/problemset/task/1696 | [
"Graph Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1711 | cses | 1711 | Distinct Routes | https://cses.fi/problemset/task/1711 | [
"Graph Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1646 | cses | 1646 | Static Range Sum Queries | https://cses.fi/problemset/task/1646 | [
"Range Queries"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1647 | cses | 1647 | Static Range Minimum Queries | https://cses.fi/problemset/task/1647 | [
"Range Queries"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1648 | cses | 1648 | Dynamic Range Sum Queries | https://cses.fi/problemset/task/1648 | [
"Range Queries"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1649 | cses | 1649 | Dynamic Range Minimum Queries | https://cses.fi/problemset/task/1649 | [
"Range Queries"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1650 | cses | 1650 | Range Xor Queries | https://cses.fi/problemset/task/1650 | [
"Range Queries"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1651 | cses | 1651 | Range Update Queries | https://cses.fi/problemset/task/1651 | [
"Range Queries"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1652 | cses | 1652 | Forest Queries | https://cses.fi/problemset/task/1652 | [
"Range Queries"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1143 | cses | 1143 | Hotel Queries | https://cses.fi/problemset/task/1143 | [
"Range Queries"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1749 | cses | 1749 | List Removals | https://cses.fi/problemset/task/1749 | [
"Range Queries"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1144 | cses | 1144 | Salary Queries | https://cses.fi/problemset/task/1144 | [
"Range Queries"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:2166 | cses | 2166 | Prefix Sum Queries | https://cses.fi/problemset/task/2166 | [
"Range Queries"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:2206 | cses | 2206 | Pizzeria Queries | https://cses.fi/problemset/task/2206 | [
"Range Queries"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:3304 | cses | 3304 | Visible Buildings Queries | https://cses.fi/problemset/task/3304 | [
"Range Queries"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:3163 | cses | 3163 | Range Interval Queries | https://cses.fi/problemset/task/3163 | [
"Range Queries"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1190 | cses | 1190 | Subarray Sum Queries | https://cses.fi/problemset/task/1190 | [
"Range Queries"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:3226 | cses | 3226 | Subarray Sum Queries II | https://cses.fi/problemset/task/3226 | [
"Range Queries"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1734 | cses | 1734 | Distinct Values Queries | https://cses.fi/problemset/task/1734 | [
"Range Queries"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:3356 | cses | 3356 | Distinct Values Queries II | https://cses.fi/problemset/task/3356 | [
"Range Queries"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:2416 | cses | 2416 | Increasing Array Queries | https://cses.fi/problemset/task/2416 | [
"Range Queries"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1664 | cses | 1664 | Movie Festival Queries | https://cses.fi/problemset/task/1664 | [
"Range Queries"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1739 | cses | 1739 | Forest Queries II | https://cses.fi/problemset/task/1739 | [
"Range Queries"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1735 | cses | 1735 | Range Updates and Sums | https://cses.fi/problemset/task/1735 | [
"Range Queries"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1736 | cses | 1736 | Polynomial Queries | https://cses.fi/problemset/task/1736 | [
"Range Queries"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1737 | cses | 1737 | Range Queries and Copies | https://cses.fi/problemset/task/1737 | [
"Range Queries"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:2184 | cses | 2184 | Missing Coin Sum Queries | https://cses.fi/problemset/task/2184 | [
"Range Queries"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1674 | cses | 1674 | Subordinates | https://cses.fi/problemset/task/1674 | [
"Tree Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1130 | cses | 1130 | Tree Matching | https://cses.fi/problemset/task/1130 | [
"Tree Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1131 | cses | 1131 | Tree Diameter | https://cses.fi/problemset/task/1131 | [
"Tree Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1132 | cses | 1132 | Tree Distances I | https://cses.fi/problemset/task/1132 | [
"Tree Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1133 | cses | 1133 | Tree Distances II | https://cses.fi/problemset/task/1133 | [
"Tree Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1687 | cses | 1687 | Company Queries I | https://cses.fi/problemset/task/1687 | [
"Tree Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1688 | cses | 1688 | Company Queries II | https://cses.fi/problemset/task/1688 | [
"Tree Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1135 | cses | 1135 | Distance Queries | https://cses.fi/problemset/task/1135 | [
"Tree Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1136 | cses | 1136 | Counting Paths | https://cses.fi/problemset/task/1136 | [
"Tree Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1137 | cses | 1137 | Subtree Queries | https://cses.fi/problemset/task/1137 | [
"Tree Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1138 | cses | 1138 | Path Queries | https://cses.fi/problemset/task/1138 | [
"Tree Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:2134 | cses | 2134 | Path Queries II | https://cses.fi/problemset/task/2134 | [
"Tree Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1139 | cses | 1139 | Distinct Colors | https://cses.fi/problemset/task/1139 | [
"Tree Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:2079 | cses | 2079 | Finding a Centroid | https://cses.fi/problemset/task/2079 | [
"Tree Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:2080 | cses | 2080 | Fixed-Length Paths I | https://cses.fi/problemset/task/2080 | [
"Tree Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:2081 | cses | 2081 | Fixed-Length Paths II | https://cses.fi/problemset/task/2081 | [
"Tree Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:2164 | cses | 2164 | Josephus Queries | https://cses.fi/problemset/task/2164 | [
"Mathematics"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.