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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
codeforces:10-A | codeforces | 10-A | Power Consumption Calculation | https://codeforces.com/problemset/problem/10/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 8313
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:9-E | codeforces | 9-E | Interestring graph and Apples | https://codeforces.com/problemset/problem/9/E | [
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1156
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:9-D | codeforces | 9-D | How many trees? | https://codeforces.com/problemset/problem/9/D | [
"combinatorics",
"divide and conquer",
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4486
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:9-C | codeforces | 9-C | Hexadecimal's Numbers | https://codeforces.com/problemset/problem/9/C | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 14293
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:9-B | codeforces | 9-B | Running Student | https://codeforces.com/problemset/problem/9/B | [
"brute force",
"geometry",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 6165
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:9-A | codeforces | 9-A | Die Roll | https://codeforces.com/problemset/problem/9/A | [
"math",
"probabilities"
] | null | null | stdin_stdout | 800 | {
"solved_count": 69203
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:8-E | codeforces | 8-E | Beads | https://codeforces.com/problemset/problem/8/E | [
"dp",
"graphs"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 754
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:8-D | codeforces | 8-D | Two Friends | https://codeforces.com/problemset/problem/8/D | [
"binary search",
"geometry"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 577
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:8-C | codeforces | 8-C | Looking for Order | https://codeforces.com/problemset/problem/8/C | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4191
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:8-B | codeforces | 8-B | Obsession with Robots | https://codeforces.com/problemset/problem/8/B | [
"constructive algorithms",
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 4940
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:8-A | codeforces | 8-A | Train and Peter | https://codeforces.com/problemset/problem/8/A | [
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 6702
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:7-E | codeforces | 7-E | Defining Macros | https://codeforces.com/problemset/problem/7/E | [
"dp",
"expression parsing",
"implementation"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 774
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:7-D | codeforces | 7-D | Palindrome Degree | https://codeforces.com/problemset/problem/7/D | [
"hashing",
"strings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4441
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:7-C | codeforces | 7-C | Line | https://codeforces.com/problemset/problem/7/C | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5449
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:7-B | codeforces | 7-B | Memory Manager | https://codeforces.com/problemset/problem/7/B | [
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2946
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:7-A | codeforces | 7-A | Kalevitch and Chess | https://codeforces.com/problemset/problem/7/A | [
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 7999
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:6-E | codeforces | 6-E | Exposition | https://codeforces.com/problemset/problem/6/E | [
"binary search",
"data structures",
"dsu",
"trees",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3852
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:6-D | codeforces | 6-D | Lizards and Basements 2 | https://codeforces.com/problemset/problem/6/D | [
"brute force",
"dp"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 2264
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:6-C | codeforces | 6-C | Alice, Bob and Chocolate | https://codeforces.com/problemset/problem/6/C | [
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17335
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:6-B | codeforces | 6-B | President's Office | https://codeforces.com/problemset/problem/6/B | [
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 14758
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:6-A | codeforces | 6-A | Triangle | https://codeforces.com/problemset/problem/6/A | [
"brute force",
"geometry"
] | null | null | stdin_stdout | 900 | {
"solved_count": 22681
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:5-E | codeforces | 5-E | Bindian Signalizing | https://codeforces.com/problemset/problem/5/E | [
"data structures"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2478
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:5-D | codeforces | 5-D | Follow Traffic Rules | https://codeforces.com/problemset/problem/5/D | [
"implementation",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1925
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:5-C | codeforces | 5-C | Longest Regular Bracket Sequence | https://codeforces.com/problemset/problem/5/C | [
"constructive algorithms",
"data structures",
"dp",
"greedy",
"sortings",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 17964
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:5-B | codeforces | 5-B | Center Alignment | https://codeforces.com/problemset/problem/5/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 6728
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:5-A | codeforces | 5-A | Chat Servers Outgoing Traffic | https://codeforces.com/problemset/problem/5/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 11043
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:4-D | codeforces | 4-D | Mysterious Present | https://codeforces.com/problemset/problem/4/D | [
"dp",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 12037
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:4-C | codeforces | 4-C | Registration System | https://codeforces.com/problemset/problem/4/C | [
"data structures",
"hashing",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 106687
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:4-B | codeforces | 4-B | Before an Exam | https://codeforces.com/problemset/problem/4/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 29304
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:4-A | codeforces | 4-A | Watermelon | https://codeforces.com/problemset/problem/4/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 682024
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:3-D | codeforces | 3-D | Least Cost Bracket Sequence | https://codeforces.com/problemset/problem/3/D | [
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 3918
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:3-C | codeforces | 3-C | Tic-tac-toe | https://codeforces.com/problemset/problem/3/C | [
"brute force",
"games",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8237
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:3-B | codeforces | 3-B | Lorry | https://codeforces.com/problemset/problem/3/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5184
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:3-A | codeforces | 3-A | Shortest path of the king | https://codeforces.com/problemset/problem/3/A | [
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 21946
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2-C | codeforces | 2-C | Commentator problem | https://codeforces.com/problemset/problem/2/C | [
"geometry"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 2004
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2-B | codeforces | 2-B | The least round way | https://codeforces.com/problemset/problem/2/B | [
"dp",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 12859
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2-A | codeforces | 2-A | Winner | https://codeforces.com/problemset/problem/2/A | [
"hashing",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 30947
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1-C | codeforces | 1-C | Ancient Berland Circus | https://codeforces.com/problemset/problem/1/C | [
"geometry",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 6440
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1-B | codeforces | 1-B | Spreadsheet | https://codeforces.com/problemset/problem/1/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 26178
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1-A | codeforces | 1-A | Theatre Square | https://codeforces.com/problemset/problem/1/A | [
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 318261
} | 2026-04-13T03:38:27.662191+00:00 |
cses:1068 | cses | 1068 | Weird Algorithm | https://cses.fi/problemset/task/1068 | [
"Introductory Problems"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1083 | cses | 1083 | Missing Number | https://cses.fi/problemset/task/1083 | [
"Introductory Problems"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1069 | cses | 1069 | Repetitions | https://cses.fi/problemset/task/1069 | [
"Introductory Problems"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1094 | cses | 1094 | Increasing Array | https://cses.fi/problemset/task/1094 | [
"Introductory Problems"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1070 | cses | 1070 | Permutations | https://cses.fi/problemset/task/1070 | [
"Introductory Problems"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1071 | cses | 1071 | Number Spiral | https://cses.fi/problemset/task/1071 | [
"Introductory Problems"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1072 | cses | 1072 | Two Knights | https://cses.fi/problemset/task/1072 | [
"Introductory Problems"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1092 | cses | 1092 | Two Sets | https://cses.fi/problemset/task/1092 | [
"Introductory Problems"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1617 | cses | 1617 | Bit Strings | https://cses.fi/problemset/task/1617 | [
"Introductory Problems"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1618 | cses | 1618 | Trailing Zeros | https://cses.fi/problemset/task/1618 | [
"Introductory Problems"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1754 | cses | 1754 | Coin Piles | https://cses.fi/problemset/task/1754 | [
"Introductory Problems"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1755 | cses | 1755 | Palindrome Reorder | https://cses.fi/problemset/task/1755 | [
"Introductory Problems"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:2205 | cses | 2205 | Gray Code | https://cses.fi/problemset/task/2205 | [
"Introductory Problems"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:2165 | cses | 2165 | Tower of Hanoi | https://cses.fi/problemset/task/2165 | [
"Introductory Problems"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1622 | cses | 1622 | Creating Strings | https://cses.fi/problemset/task/1622 | [
"Introductory Problems"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1623 | cses | 1623 | Apple Division | https://cses.fi/problemset/task/1623 | [
"Introductory Problems"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1624 | cses | 1624 | Chessboard and Queens | https://cses.fi/problemset/task/1624 | [
"Introductory Problems"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:3399 | cses | 3399 | Raab Game I | https://cses.fi/problemset/task/3399 | [
"Introductory Problems"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:3419 | cses | 3419 | Mex Grid Construction | https://cses.fi/problemset/task/3419 | [
"Introductory Problems"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:3217 | cses | 3217 | Knight Moves Grid | https://cses.fi/problemset/task/3217 | [
"Introductory Problems"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:3311 | cses | 3311 | Grid Coloring I | https://cses.fi/problemset/task/3311 | [
"Introductory Problems"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:2431 | cses | 2431 | Digit Queries | https://cses.fi/problemset/task/2431 | [
"Introductory Problems"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1743 | cses | 1743 | String Reorder | https://cses.fi/problemset/task/1743 | [
"Introductory Problems"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1625 | cses | 1625 | Grid Path Description | https://cses.fi/problemset/task/1625 | [
"Introductory Problems"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1621 | cses | 1621 | Distinct Numbers | https://cses.fi/problemset/task/1621 | [
"Sorting and Searching"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1084 | cses | 1084 | Apartments | https://cses.fi/problemset/task/1084 | [
"Sorting and Searching"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+00:00 |
cses:1090 | cses | 1090 | Ferris Wheel | https://cses.fi/problemset/task/1090 | [
"Sorting and Searching"
] | null | null | stdin_stdout | null | {
"solved_count": null
} | 2026-04-13T03:38:28.809639+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-04-13T03:38:28.809639+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-04-13T03:38:28.809639+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-04-13T03:38:28.809639+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-04-13T03:38:28.809639+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-04-13T03:38:28.809639+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-04-13T03:38:28.809639+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-04-13T03:38:28.809639+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-04-13T03:38:28.809639+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-04-13T03:38:28.809639+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-04-13T03:38:28.809639+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-04-13T03:38:28.809639+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-04-13T03:38:28.809639+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-04-13T03:38:28.809639+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-04-13T03:38:28.809639+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-04-13T03:38:28.809639+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-04-13T03:38:28.809639+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-04-13T03:38:28.809639+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-04-13T03:38:28.809639+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-04-13T03:38:28.809639+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-04-13T03:38:28.809639+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-04-13T03:38:28.809639+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-04-13T03:38:28.809639+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-04-13T03:38:28.809639+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-04-13T03:38:28.809639+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-04-13T03:38:28.809639+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-04-13T03:38:28.809639+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-04-13T03:38:28.809639+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-04-13T03:38:28.809639+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-04-13T03:38:28.809639+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-04-13T03:38:28.809639+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-04-13T03:38:28.809639+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-04-13T03:38:28.809639+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-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.