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:33-E | codeforces | 33-E | Helper | https://codeforces.com/problemset/problem/33/E | [] | null | null | stdin_stdout | 2,600 | {
"solved_count": 175
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:33-D | codeforces | 33-D | Knights | https://codeforces.com/problemset/problem/33/D | [
"geometry",
"graphs",
"shortest paths",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1623
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:33-C | codeforces | 33-C | Wonderful Randomized Sum | https://codeforces.com/problemset/problem/33/C | [
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3642
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:33-B | codeforces | 33-B | String Problem | https://codeforces.com/problemset/problem/33/B | [
"shortest paths"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6050
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:33-A | codeforces | 33-A | What is for dinner? | https://codeforces.com/problemset/problem/33/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 5027
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:32-E | codeforces | 32-E | Hide-and-Seek | https://codeforces.com/problemset/problem/32/E | [
"geometry",
"implementation"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 447
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:32-D | codeforces | 32-D | Constellation | https://codeforces.com/problemset/problem/32/D | [
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 1507
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:32-C | codeforces | 32-C | Flea | https://codeforces.com/problemset/problem/32/C | [
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2623
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:32-B | codeforces | 32-B | Borze | https://codeforces.com/problemset/problem/32/B | [
"expression parsing",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 82129
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:32-A | codeforces | 32-A | Reconnaissance | https://codeforces.com/problemset/problem/32/A | [
"brute force"
] | null | null | stdin_stdout | 800 | {
"solved_count": 15250
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:31-E | codeforces | 31-E | TV Game | https://codeforces.com/problemset/problem/31/E | [
"dp"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1362
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:31-D | codeforces | 31-D | Chocolate | https://codeforces.com/problemset/problem/31/D | [
"dfs and similar",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1258
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:31-C | codeforces | 31-C | Schedule | https://codeforces.com/problemset/problem/31/C | [
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2065
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:31-B | codeforces | 31-B | Sysadmin Bob | https://codeforces.com/problemset/problem/31/B | [
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4805
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:31-A | codeforces | 31-A | Worms Evolution | https://codeforces.com/problemset/problem/31/A | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 12888
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:30-E | codeforces | 30-E | Tricky and Clever Password | https://codeforces.com/problemset/problem/30/E | [
"binary search",
"constructive algorithms",
"data structures",
"greedy",
"hashing",
"strings"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 971
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:30-D | codeforces | 30-D | King's Problem? | https://codeforces.com/problemset/problem/30/D | [
"geometry",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 531
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:30-C | codeforces | 30-C | Shooting Gallery | https://codeforces.com/problemset/problem/30/C | [
"dp",
"probabilities"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2457
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:30-B | codeforces | 30-B | Codeforces World Finals | https://codeforces.com/problemset/problem/30/B | [
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 1405
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:30-A | codeforces | 30-A | Accounting | https://codeforces.com/problemset/problem/30/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 4075
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:29-E | codeforces | 29-E | Quarrel | https://codeforces.com/problemset/problem/29/E | [
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1184
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:29-D | codeforces | 29-D | Ant on the Tree | https://codeforces.com/problemset/problem/29/D | [
"constructive algorithms",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3044
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:29-C | codeforces | 29-C | Mail Stamps | https://codeforces.com/problemset/problem/29/C | [
"data structures",
"dfs and similar",
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6745
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:29-B | codeforces | 29-B | Traffic Lights | https://codeforces.com/problemset/problem/29/B | [
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 3403
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:29-A | codeforces | 29-A | Spit Problem | https://codeforces.com/problemset/problem/29/A | [
"brute force"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 8447
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:28-E | codeforces | 28-E | DravDe saves the world | https://codeforces.com/problemset/problem/28/E | [
"geometry",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 201
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:28-D | codeforces | 28-D | Don't fear, DravDe is kind | https://codeforces.com/problemset/problem/28/D | [
"binary search",
"data structures",
"dp",
"hashing"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 726
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:28-C | codeforces | 28-C | Bath Queue | https://codeforces.com/problemset/problem/28/C | [
"combinatorics",
"dp",
"probabilities"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1356
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:28-B | codeforces | 28-B | pSort | https://codeforces.com/problemset/problem/28/B | [
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5680
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:28-A | codeforces | 28-A | Bender Problem | https://codeforces.com/problemset/problem/28/A | [
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 993
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:27-E | codeforces | 27-E | Number With The Given Amount Of Divisors | https://codeforces.com/problemset/problem/27/E | [
"brute force",
"dp",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4996
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:27-D | codeforces | 27-D | Ring Road 2 | https://codeforces.com/problemset/problem/27/D | [
"2-sat",
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3171
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:27-C | codeforces | 27-C | Unordered Subsequence | https://codeforces.com/problemset/problem/27/C | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3110
} | 2026-08-10T02:20:32.917453+00:00 |
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": 5978
} | 2026-08-10T02:20:32.917453+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": 23457
} | 2026-08-10T02:20:32.917453+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": 438
} | 2026-08-10T02:20:32.917453+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": 989
} | 2026-08-10T02:20:32.917453+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": 1068
} | 2026-08-10T02:20:32.917453+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": 27040
} | 2026-08-10T02:20:32.917453+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": 44858
} | 2026-08-10T02:20:32.917453+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": 3433
} | 2026-08-10T02:20:32.917453+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": 16561
} | 2026-08-10T02:20:32.917453+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": 8642
} | 2026-08-10T02:20:32.917453+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": 11514
} | 2026-08-10T02:20:32.917453+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": 106410
} | 2026-08-10T02:20:32.917453+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": 1081
} | 2026-08-10T02:20:32.917453+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": 2819
} | 2026-08-10T02:20:32.917453+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": 1471
} | 2026-08-10T02:20:32.917453+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": 2088
} | 2026-08-10T02:20:32.917453+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": 7234
} | 2026-08-10T02:20:32.917453+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": 768
} | 2026-08-10T02:20:32.917453+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": 430
} | 2026-08-10T02:20:32.917453+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": 1763
} | 2026-08-10T02:20:32.917453+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": 3939
} | 2026-08-10T02:20:32.917453+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": 6502
} | 2026-08-10T02:20:32.917453+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": 2178
} | 2026-08-10T02:20:32.917453+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": 3493
} | 2026-08-10T02:20:32.917453+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": 3917
} | 2026-08-10T02:20:32.917453+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": 4869
} | 2026-08-10T02:20:32.917453+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": 28019
} | 2026-08-10T02:20:32.917453+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": 1392
} | 2026-08-10T02:20:32.917453+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": 2625
} | 2026-08-10T02:20:32.917453+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": 1653
} | 2026-08-10T02:20:32.917453+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": 2319
} | 2026-08-10T02:20:32.917453+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": 49904
} | 2026-08-10T02:20:32.917453+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": 4974
} | 2026-08-10T02:20:32.917453+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": 7252
} | 2026-08-10T02:20:32.917453+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": 2654
} | 2026-08-10T02:20:32.917453+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": 3379
} | 2026-08-10T02:20:32.917453+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": 1400
} | 2026-08-10T02:20:32.917453+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": 6057
} | 2026-08-10T02:20:32.917453+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": 3246
} | 2026-08-10T02:20:32.917453+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": 1311
} | 2026-08-10T02:20:32.917453+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": 1322
} | 2026-08-10T02:20:32.917453+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": 15756
} | 2026-08-10T02:20:32.917453+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": 2463
} | 2026-08-10T02:20:32.917453+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": 7120
} | 2026-08-10T02:20:32.917453+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": 2176
} | 2026-08-10T02:20:32.917453+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": 1385
} | 2026-08-10T02:20:32.917453+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": 1077
} | 2026-08-10T02:20:32.917453+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": 6678
} | 2026-08-10T02:20:32.917453+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": 22336
} | 2026-08-10T02:20:32.917453+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": 6849
} | 2026-08-10T02:20:32.917453+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": 1899
} | 2026-08-10T02:20:32.917453+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": 5509
} | 2026-08-10T02:20:32.917453+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": 21153
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:16-A | codeforces | 16-A | Flag | https://codeforces.com/problemset/problem/16/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17761
} | 2026-08-10T02:20:32.917453+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": 694
} | 2026-08-10T02:20:32.917453+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": 979
} | 2026-08-10T02:20:32.917453+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": 2971
} | 2026-08-10T02:20:32.917453+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": 1715
} | 2026-08-10T02:20:32.917453+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": 4582
} | 2026-08-10T02:20:32.917453+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": 2115
} | 2026-08-10T02:20:32.917453+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": 5417
} | 2026-08-10T02:20:32.917453+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": 3915
} | 2026-08-10T02:20:32.917453+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": 8437
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:14-A | codeforces | 14-A | Letter | https://codeforces.com/problemset/problem/14/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 12752
} | 2026-08-10T02:20:32.917453+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": 8475
} | 2026-08-10T02:20:32.917453+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": 774
} | 2026-08-10T02:20:32.917453+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": 5651
} | 2026-08-10T02:20:32.917453+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.