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:27-B | codeforces | 27-B | Tournament | https://codeforces.com/problemset/problem/27/B | [
"bitmasks",
"brute force",
"dfs and similar",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 5908
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:27-A | codeforces | 27-A | Next Test | https://codeforces.com/problemset/problem/27/A | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 23086
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:26-E | codeforces | 26-E | Multithreading | https://codeforces.com/problemset/problem/26/E | [
"constructive algorithms"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 415
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:26-D | codeforces | 26-D | Tickets | https://codeforces.com/problemset/problem/26/D | [
"combinatorics",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 937
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:26-C | codeforces | 26-C | Parquet | https://codeforces.com/problemset/problem/26/C | [
"combinatorics",
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1022
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:26-B | codeforces | 26-B | Regular Bracket Sequence | https://codeforces.com/problemset/problem/26/B | [
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 26109
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:26-A | codeforces | 26-A | Almost Prime | https://codeforces.com/problemset/problem/26/A | [
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 43225
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:25-E | codeforces | 25-E | Test | https://codeforces.com/problemset/problem/25/E | [
"hashing",
"strings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3188
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:25-D | codeforces | 25-D | Roads not only in Berland | https://codeforces.com/problemset/problem/25/D | [
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 15760
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:25-C | codeforces | 25-C | Roads in Berland | https://codeforces.com/problemset/problem/25/C | [
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 8174
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:25-B | codeforces | 25-B | Phone numbers | https://codeforces.com/problemset/problem/25/B | [
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 11319
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:25-A | codeforces | 25-A | IQ test | https://codeforces.com/problemset/problem/25/A | [
"brute force"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 104522
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:24-E | codeforces | 24-E | Berland collider | https://codeforces.com/problemset/problem/24/E | [
"binary search"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1030
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:24-D | codeforces | 24-D | Broken robot | https://codeforces.com/problemset/problem/24/D | [
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2690
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:24-C | codeforces | 24-C | Sequence of points | https://codeforces.com/problemset/problem/24/C | [
"geometry",
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1454
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:24-B | codeforces | 24-B | F1 Champions | https://codeforces.com/problemset/problem/24/B | [
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 2051
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:24-A | codeforces | 24-A | Ring road | https://codeforces.com/problemset/problem/24/A | [
"graphs"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 6972
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:23-E | codeforces | 23-E | Tree | https://codeforces.com/problemset/problem/23/E | [
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 733
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:23-D | codeforces | 23-D | Tetragon | https://codeforces.com/problemset/problem/23/D | [
"geometry",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 384
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:23-C | codeforces | 23-C | Oranges and Apples | https://codeforces.com/problemset/problem/23/C | [
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1705
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:23-B | codeforces | 23-B | Party | https://codeforces.com/problemset/problem/23/B | [
"constructive algorithms",
"graphs",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 3894
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:23-A | codeforces | 23-A | You're Given a String... | https://codeforces.com/problemset/problem/23/A | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 6350
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:22-E | codeforces | 22-E | Scheme | https://codeforces.com/problemset/problem/22/E | [
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2103
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:22-D | codeforces | 22-D | Segments | https://codeforces.com/problemset/problem/22/D | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3441
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:22-C | codeforces | 22-C | System Administrator | https://codeforces.com/problemset/problem/22/C | [
"graphs"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3838
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:22-B | codeforces | 22-B | Bargaining Table | https://codeforces.com/problemset/problem/22/B | [
"brute force",
"dp"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4805
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:22-A | codeforces | 22-A | Second Order Statistics | https://codeforces.com/problemset/problem/22/A | [
"brute force"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27345
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:21-D | codeforces | 21-D | Traveling Graph | https://codeforces.com/problemset/problem/21/D | [
"bitmasks",
"graph matchings",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1306
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:21-C | codeforces | 21-C | Stripe 2 | https://codeforces.com/problemset/problem/21/C | [
"binary search",
"dp",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2546
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:21-B | codeforces | 21-B | Intersection | https://codeforces.com/problemset/problem/21/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1594
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:21-A | codeforces | 21-A | Jabber ID | https://codeforces.com/problemset/problem/21/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2283
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:20-C | codeforces | 20-C | Dijkstra? | https://codeforces.com/problemset/problem/20/C | [
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 47698
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:20-B | codeforces | 20-B | Equation | https://codeforces.com/problemset/problem/20/B | [
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4835
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:20-A | codeforces | 20-A | BerOS file system | https://codeforces.com/problemset/problem/20/A | [
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7156
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:19-E | codeforces | 19-E | Fairy | https://codeforces.com/problemset/problem/19/E | [
"dfs and similar",
"divide and conquer",
"dsu"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 2531
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:19-D | codeforces | 19-D | Points | https://codeforces.com/problemset/problem/19/D | [
"data structures"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 3201
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:19-C | codeforces | 19-C | Deletion of Repeats | https://codeforces.com/problemset/problem/19/C | [
"greedy",
"hashing",
"string suffix structures"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1346
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:19-B | codeforces | 19-B | Checkout Assistant | https://codeforces.com/problemset/problem/19/B | [
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5868
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:19-A | codeforces | 19-A | World Football Cup | https://codeforces.com/problemset/problem/19/A | [
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 3155
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:18-E | codeforces | 18-E | Flag 2 | https://codeforces.com/problemset/problem/18/E | [
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1273
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:18-D | codeforces | 18-D | Seller Bob | https://codeforces.com/problemset/problem/18/D | [
"brute force",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1296
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:18-C | codeforces | 18-C | Stripe | https://codeforces.com/problemset/problem/18/C | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 15489
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:18-B | codeforces | 18-B | Platforms | https://codeforces.com/problemset/problem/18/B | [
"brute force",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2435
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:18-A | codeforces | 18-A | Triangle | https://codeforces.com/problemset/problem/18/A | [
"brute force",
"geometry"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6983
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:17-E | codeforces | 17-E | Palisection | https://codeforces.com/problemset/problem/17/E | [
"strings"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 2006
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:17-D | codeforces | 17-D | Notepad | https://codeforces.com/problemset/problem/17/D | [
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1335
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:17-C | codeforces | 17-C | Balance | https://codeforces.com/problemset/problem/17/C | [
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1032
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:17-B | codeforces | 17-B | Hierarchy | https://codeforces.com/problemset/problem/17/B | [
"dfs and similar",
"dsu",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6219
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:17-A | codeforces | 17-A | Noldbach problem | https://codeforces.com/problemset/problem/17/A | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 21535
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:16-E | codeforces | 16-E | Fish | https://codeforces.com/problemset/problem/16/E | [
"bitmasks",
"dp",
"probabilities"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6588
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:16-D | codeforces | 16-D | Logging | https://codeforces.com/problemset/problem/16/D | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1869
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:16-C | codeforces | 16-C | Monitor | https://codeforces.com/problemset/problem/16/C | [
"binary search",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5442
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:16-B | codeforces | 16-B | Burglar and Matches | https://codeforces.com/problemset/problem/16/B | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 20858
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:16-A | codeforces | 16-A | Flag | https://codeforces.com/problemset/problem/16/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17367
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:15-E | codeforces | 15-E | Triangles | https://codeforces.com/problemset/problem/15/E | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 674
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:15-D | codeforces | 15-D | Map | https://codeforces.com/problemset/problem/15/D | [
"data structures",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 925
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:15-C | codeforces | 15-C | Industrial Nim | https://codeforces.com/problemset/problem/15/C | [
"games"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2872
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:15-B | codeforces | 15-B | Laser | https://codeforces.com/problemset/problem/15/B | [
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1684
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:15-A | codeforces | 15-A | Cottage Village | https://codeforces.com/problemset/problem/15/A | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 4515
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:14-E | codeforces | 14-E | Camels | https://codeforces.com/problemset/problem/14/E | [
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2097
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:14-D | codeforces | 14-D | Two Paths | https://codeforces.com/problemset/problem/14/D | [
"dfs and similar",
"dp",
"graphs",
"shortest paths",
"trees",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5301
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:14-C | codeforces | 14-C | Four Segments | https://codeforces.com/problemset/problem/14/C | [
"brute force",
"constructive algorithms",
"geometry",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3871
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:14-B | codeforces | 14-B | Young Photographer | https://codeforces.com/problemset/problem/14/B | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 8335
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:14-A | codeforces | 14-A | Letter | https://codeforces.com/problemset/problem/14/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 12471
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:13-E | codeforces | 13-E | Holes | https://codeforces.com/problemset/problem/13/E | [
"data structures",
"dsu"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 8105
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:13-D | codeforces | 13-D | Triangles | https://codeforces.com/problemset/problem/13/D | [
"dp",
"geometry"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 738
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:13-C | codeforces | 13-C | Sequence | https://codeforces.com/problemset/problem/13/C | [
"dp",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 5502
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:13-B | codeforces | 13-B | Letter A | https://codeforces.com/problemset/problem/13/B | [
"geometry",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1127
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:13-A | codeforces | 13-A | Numbers | https://codeforces.com/problemset/problem/13/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 9497
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:12-E | codeforces | 12-E | Start of the session | https://codeforces.com/problemset/problem/12/E | [
"constructive algorithms"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1463
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:12-D | codeforces | 12-D | Ball | https://codeforces.com/problemset/problem/12/D | [
"data structures",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2913
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:12-C | codeforces | 12-C | Fruits | https://codeforces.com/problemset/problem/12/C | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 7373
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:12-B | codeforces | 12-B | Correct Solution? | https://codeforces.com/problemset/problem/12/B | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 9704
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:12-A | codeforces | 12-A | Super Agent | https://codeforces.com/problemset/problem/12/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 15506
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:11-E | codeforces | 11-E | Forward, march! | https://codeforces.com/problemset/problem/11/E | [
"binary search",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 441
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:11-D | codeforces | 11-D | A Simple Task | https://codeforces.com/problemset/problem/11/D | [
"bitmasks",
"dp",
"graphs"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 6483
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:11-C | codeforces | 11-C | How Many Squares? | https://codeforces.com/problemset/problem/11/C | [
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 696
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:11-B | codeforces | 11-B | Jumping Jack | https://codeforces.com/problemset/problem/11/B | [
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5741
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:11-A | codeforces | 11-A | Increasing Sequence | https://codeforces.com/problemset/problem/11/A | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 15585
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:10-E | codeforces | 10-E | Greedy Change | https://codeforces.com/problemset/problem/10/E | [
"constructive algorithms"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 934
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:10-D | codeforces | 10-D | LCIS | https://codeforces.com/problemset/problem/10/D | [
"dp"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 5672
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:10-C | codeforces | 10-C | Digital Root | https://codeforces.com/problemset/problem/10/C | [
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1716
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:10-B | codeforces | 10-B | Cinema Cashier | https://codeforces.com/problemset/problem/10/B | [
"dp",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 2071
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:10-A | codeforces | 10-A | Power Consumption Calculation | https://codeforces.com/problemset/problem/10/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 8377
} | 2026-06-01T05:00:40.145500+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": 1166
} | 2026-06-01T05:00:40.145500+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": 4529
} | 2026-06-01T05:00:40.145500+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": 14399
} | 2026-06-01T05:00:40.145500+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": 6209
} | 2026-06-01T05:00:40.145500+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": 70205
} | 2026-06-01T05:00:40.145500+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": 760
} | 2026-06-01T05:00:40.145500+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": 581
} | 2026-06-01T05:00:40.145500+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": 4244
} | 2026-06-01T05:00:40.145500+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": 4990
} | 2026-06-01T05:00:40.145500+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": 6759
} | 2026-06-01T05:00:40.145500+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": 782
} | 2026-06-01T05:00:40.145500+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": 4549
} | 2026-06-01T05:00:40.145500+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": 5532
} | 2026-06-01T05:00:40.145500+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": 2964
} | 2026-06-01T05:00:40.145500+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": 8046
} | 2026-06-01T05:00:40.145500+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": 3904
} | 2026-06-01T05:00:40.145500+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.