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:1090 | cses | 1090 | Ferris Wheel | https://cses.fi/problemset/task/1090 | [
"Sorting and Searching"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-10-26T04:20:42.405372+00:00 |
cses:1091 | cses | 1091 | Concert Tickets | https://cses.fi/problemset/task/1091 | [
"Sorting and Searching"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-10-26T04:20:42.405372+00:00 |
cses:1619 | cses | 1619 | Restaurant Customers | https://cses.fi/problemset/task/1619 | [
"Sorting and Searching"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-10-26T04:20:42.405372+00:00 |
cses:1629 | cses | 1629 | Movie Festival | https://cses.fi/problemset/task/1629 | [
"Sorting and Searching"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-10-26T04:20:42.405372+00:00 |
cses:1640 | cses | 1640 | Sum of Two Values | https://cses.fi/problemset/task/1640 | [
"Sorting and Searching"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-10-26T04:20:42.405372+00:00 |
cses:1643 | cses | 1643 | Maximum Subarray Sum | https://cses.fi/problemset/task/1643 | [
"Sorting and Searching"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-10-26T04:20:42.405372+00:00 |
cses:1074 | cses | 1074 | Stick Lengths | https://cses.fi/problemset/task/1074 | [
"Sorting and Searching"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-10-26T04:20:42.405372+00:00 |
cses:2183 | cses | 2183 | Missing Coin Sum | https://cses.fi/problemset/task/2183 | [
"Sorting and Searching"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-10-26T04:20:42.405372+00:00 |
cses:2216 | cses | 2216 | Collecting Numbers | https://cses.fi/problemset/task/2216 | [
"Sorting and Searching"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-10-26T04:20:42.405372+00:00 |
cses:2217 | cses | 2217 | Collecting Numbers II | https://cses.fi/problemset/task/2217 | [
"Sorting and Searching"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-10-26T04:20:42.405372+00:00 |
cses:1141 | cses | 1141 | Playlist | https://cses.fi/problemset/task/1141 | [
"Sorting and Searching"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-10-26T04:20:42.405372+00:00 |
cses:1073 | cses | 1073 | Towers | https://cses.fi/problemset/task/1073 | [
"Sorting and Searching"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-10-26T04:20:42.405372+00:00 |
cses:1163 | cses | 1163 | Traffic Lights | https://cses.fi/problemset/task/1163 | [
"Sorting and Searching"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-10-26T04:20:42.405372+00:00 |
cses:3420 | cses | 3420 | Distinct Values Subarrays | https://cses.fi/problemset/task/3420 | [
"Sorting and Searching"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-10-26T04:20:42.405372+00:00 |
cses:3421 | cses | 3421 | Distinct Values Subsequences | https://cses.fi/problemset/task/3421 | [
"Sorting and Searching"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-10-26T04:20:42.405372+00:00 |
cses:2162 | cses | 2162 | Josephus Problem I | https://cses.fi/problemset/task/2162 | [
"Sorting and Searching"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-10-26T04:20:42.405372+00:00 |
cses:2163 | cses | 2163 | Josephus Problem II | https://cses.fi/problemset/task/2163 | [
"Sorting and Searching"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-10-26T04:20:42.405372+00:00 |
cses:2168 | cses | 2168 | Nested Ranges Check | https://cses.fi/problemset/task/2168 | [
"Sorting and Searching"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-10-26T04:20:42.405372+00:00 |
cses:2169 | cses | 2169 | Nested Ranges Count | https://cses.fi/problemset/task/2169 | [
"Sorting and Searching"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-10-26T04:20:42.405372+00:00 |
cses:1164 | cses | 1164 | Room Allocation | https://cses.fi/problemset/task/1164 | [
"Sorting and Searching"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-10-26T04:20:42.405372+00:00 |
cses:1620 | cses | 1620 | Factory Machines | https://cses.fi/problemset/task/1620 | [
"Sorting and Searching"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-10-26T04:20:42.405372+00:00 |
cses:1630 | cses | 1630 | Tasks and Deadlines | https://cses.fi/problemset/task/1630 | [
"Sorting and Searching"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-10-26T04:20:42.405372+00:00 |
cses:1631 | cses | 1631 | Reading Books | https://cses.fi/problemset/task/1631 | [
"Sorting and Searching"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-10-26T04:20:42.405372+00:00 |
cses:1641 | cses | 1641 | Sum of Three Values | https://cses.fi/problemset/task/1641 | [
"Sorting and Searching"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-10-26T04:20:42.405372+00:00 |
cses:1642 | cses | 1642 | Sum of Four Values | https://cses.fi/problemset/task/1642 | [
"Sorting and Searching"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-10-26T04:20:42.405372+00:00 |
cses:1645 | cses | 1645 | Nearest Smaller Values | https://cses.fi/problemset/task/1645 | [
"Sorting and Searching"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-10-26T04:20:42.405372+00:00 |
cses:1660 | cses | 1660 | Subarray Sums I | https://cses.fi/problemset/task/1660 | [
"Sorting and Searching"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-10-26T04:20:42.405372+00:00 |
cses:1661 | cses | 1661 | Subarray Sums II | https://cses.fi/problemset/task/1661 | [
"Sorting and Searching"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-10-26T04:20:42.405372+00:00 |
cses:1662 | cses | 1662 | Subarray Divisibility | https://cses.fi/problemset/task/1662 | [
"Sorting and Searching"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-10-26T04:20:42.405372+00:00 |
cses:2428 | cses | 2428 | Distinct Values Subarrays II | https://cses.fi/problemset/task/2428 | [
"Sorting and Searching"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-10-26T04:20:42.405372+00:00 |
cses:1085 | cses | 1085 | Array Division | https://cses.fi/problemset/task/1085 | [
"Sorting and Searching"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-10-26T04:20:42.405372+00:00 |
cses:1632 | cses | 1632 | Movie Festival II | https://cses.fi/problemset/task/1632 | [
"Sorting and Searching"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-10-26T04:20:42.405372+00:00 |
cses:1644 | cses | 1644 | Maximum Subarray Sum II | https://cses.fi/problemset/task/1644 | [
"Sorting and Searching"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-10-26T04:20:42.405372+00:00 |
cses:1633 | cses | 1633 | Dice Combinations | https://cses.fi/problemset/task/1633 | [
"Dynamic Programming"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-10-26T04:20:42.405372+00:00 |
cses:1634 | cses | 1634 | Minimizing Coins | https://cses.fi/problemset/task/1634 | [
"Dynamic Programming"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+00:00 |
cses:1140 | cses | 1140 | Projects | https://cses.fi/problemset/task/1140 | [
"Dynamic Programming"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+00:00 |
cses:1193 | cses | 1193 | Labyrinth | https://cses.fi/problemset/task/1193 | [
"Graph Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+00:00 |
cses:1194 | cses | 1194 | Monsters | https://cses.fi/problemset/task/1194 | [
"Graph Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+00:00 |
cses:1202 | cses | 1202 | Investigation | https://cses.fi/problemset/task/1202 | [
"Graph Algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+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-10-26T04:20:42.405372+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.