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:39-D | codeforces | 39-D | Cubical Planet | https://codeforces.com/problemset/problem/39/D | [
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 4845
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:39-C | codeforces | 39-C | Moon Craters | https://codeforces.com/problemset/problem/39/C | [
"dp",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 728
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:39-B | codeforces | 39-B | Company Income Growth | https://codeforces.com/problemset/problem/39/B | [
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 3194
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:39-A | codeforces | 39-A | C*++ Calculations | https://codeforces.com/problemset/problem/39/A | [
"expression parsing",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 839
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:38-H | codeforces | 38-H | The Great Marathon | https://codeforces.com/problemset/problem/38/H | [
"dp"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 497
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:38-G | codeforces | 38-G | Queue | https://codeforces.com/problemset/problem/38/G | [
"data structures"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 971
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:38-F | codeforces | 38-F | Smart Boy | https://codeforces.com/problemset/problem/38/F | [
"dp",
"games",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 468
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:38-E | codeforces | 38-E | Let's Go Rolling! | https://codeforces.com/problemset/problem/38/E | [
"dp",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3063
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:38-D | codeforces | 38-D | Vasya the Architect | https://codeforces.com/problemset/problem/38/D | [
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1102
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:38-C | codeforces | 38-C | Blinds | https://codeforces.com/problemset/problem/38/C | [
"brute force"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 2642
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:38-B | codeforces | 38-B | Chess | https://codeforces.com/problemset/problem/38/B | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 4194
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:38-A | codeforces | 38-A | Army | https://codeforces.com/problemset/problem/38/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28064
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:37-E | codeforces | 37-E | Trial for Chief | https://codeforces.com/problemset/problem/37/E | [
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 727
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:37-D | codeforces | 37-D | Lesson Timetable | https://codeforces.com/problemset/problem/37/D | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 605
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:37-C | codeforces | 37-C | Old Berland Language | https://codeforces.com/problemset/problem/37/C | [
"data structures",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2393
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:37-B | codeforces | 37-B | Computer Game | https://codeforces.com/problemset/problem/37/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1125
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:37-A | codeforces | 37-A | Towers | https://codeforces.com/problemset/problem/37/A | [
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 28544
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:36-E | codeforces | 36-E | Two Paths | https://codeforces.com/problemset/problem/36/E | [
"constructive algorithms",
"dsu",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 658
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:36-D | codeforces | 36-D | New Game with a Chess Piece | https://codeforces.com/problemset/problem/36/D | [
"games"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 791
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:36-C | codeforces | 36-C | Bowls | https://codeforces.com/problemset/problem/36/C | [
"geometry",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 399
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:36-B | codeforces | 36-B | Fractal | https://codeforces.com/problemset/problem/36/B | [
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2115
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:36-A | codeforces | 36-A | Extra-terrestrial Intelligence | https://codeforces.com/problemset/problem/36/A | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 3676
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:35-E | codeforces | 35-E | Parade | https://codeforces.com/problemset/problem/35/E | [
"data structures",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 913
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:35-D | codeforces | 35-D | Animals | https://codeforces.com/problemset/problem/35/D | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3984
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:35-C | codeforces | 35-C | Fire Again | https://codeforces.com/problemset/problem/35/C | [
"brute force",
"dfs and similar",
"shortest paths"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9271
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:35-B | codeforces | 35-B | Warehouse | https://codeforces.com/problemset/problem/35/B | [
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 1239
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:35-A | codeforces | 35-A | Shell Game | https://codeforces.com/problemset/problem/35/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 7803
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:34-E | codeforces | 34-E | Collisions | https://codeforces.com/problemset/problem/34/E | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 700
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:34-D | codeforces | 34-D | Road Map | https://codeforces.com/problemset/problem/34/D | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6854
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:34-C | codeforces | 34-C | Page Numbers | https://codeforces.com/problemset/problem/34/C | [
"expression parsing",
"implementation",
"sortings",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 4983
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:34-B | codeforces | 34-B | Sale | https://codeforces.com/problemset/problem/34/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 70197
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:34-A | codeforces | 34-A | Reconnaissance 2 | https://codeforces.com/problemset/problem/34/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 36326
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:33-E | codeforces | 33-E | Helper | https://codeforces.com/problemset/problem/33/E | [] | null | null | stdin_stdout | 2,600 | {
"solved_count": 185
} | 2026-11-02T05:37:07.883505+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": 1666
} | 2026-11-02T05:37:07.883505+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": 3684
} | 2026-11-02T05:37:07.883505+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": 6253
} | 2026-11-02T05:37:07.883505+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": 5186
} | 2026-11-02T05:37:07.883505+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": 453
} | 2026-11-02T05:37:07.883505+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": 1548
} | 2026-11-02T05:37:07.883505+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": 2683
} | 2026-11-02T05:37:07.883505+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": 84078
} | 2026-11-02T05:37:07.883505+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": 15669
} | 2026-11-02T05:37:07.883505+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": 1386
} | 2026-11-02T05:37:07.883505+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": 1275
} | 2026-11-02T05:37:07.883505+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": 2101
} | 2026-11-02T05:37:07.883505+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": 4856
} | 2026-11-02T05:37:07.883505+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": 13155
} | 2026-11-02T05:37:07.883505+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": 984
} | 2026-11-02T05:37:07.883505+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": 538
} | 2026-11-02T05:37:07.883505+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": 2516
} | 2026-11-02T05:37:07.883505+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": 1447
} | 2026-11-02T05:37:07.883505+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": 4173
} | 2026-11-02T05:37:07.883505+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": 1212
} | 2026-11-02T05:37:07.883505+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": 3110
} | 2026-11-02T05:37:07.883505+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": 6911
} | 2026-11-02T05:37:07.883505+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": 3455
} | 2026-11-02T05:37:07.883505+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": 8614
} | 2026-11-02T05:37:07.883505+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": 205
} | 2026-11-02T05:37:07.883505+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": 751
} | 2026-11-02T05:37:07.883505+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": 1376
} | 2026-11-02T05:37:07.883505+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": 5764
} | 2026-11-02T05:37:07.883505+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": 1012
} | 2026-11-02T05:37:07.883505+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": 5074
} | 2026-11-02T05:37:07.883505+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": 3259
} | 2026-11-02T05:37:07.883505+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": 3143
} | 2026-11-02T05:37:07.883505+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": 6055
} | 2026-11-02T05:37:07.883505+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": 23816
} | 2026-11-02T05:37:07.883505+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": 463
} | 2026-11-02T05:37:07.883505+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": 1031
} | 2026-11-02T05:37:07.883505+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": 1090
} | 2026-11-02T05:37:07.883505+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": 28129
} | 2026-11-02T05:37:07.883505+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": 46593
} | 2026-11-02T05:37:07.883505+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": 3564
} | 2026-11-02T05:37:07.883505+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": 17275
} | 2026-11-02T05:37:07.883505+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": 8967
} | 2026-11-02T05:37:07.883505+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": 11686
} | 2026-11-02T05:37:07.883505+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": 108649
} | 2026-11-02T05:37:07.883505+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": 1107
} | 2026-11-02T05:37:07.883505+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": 2912
} | 2026-11-02T05:37:07.883505+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": 1492
} | 2026-11-02T05:37:07.883505+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": 2124
} | 2026-11-02T05:37:07.883505+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": 7569
} | 2026-11-02T05:37:07.883505+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": 786
} | 2026-11-02T05:37:07.883505+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": 461
} | 2026-11-02T05:37:07.883505+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": 1840
} | 2026-11-02T05:37:07.883505+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": 3996
} | 2026-11-02T05:37:07.883505+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": 6607
} | 2026-11-02T05:37:07.883505+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": 2253
} | 2026-11-02T05:37:07.883505+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": 3578
} | 2026-11-02T05:37:07.883505+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": 4014
} | 2026-11-02T05:37:07.883505+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": 4981
} | 2026-11-02T05:37:07.883505+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": 28751
} | 2026-11-02T05:37:07.883505+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": 1469
} | 2026-11-02T05:37:07.883505+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": 2677
} | 2026-11-02T05:37:07.883505+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": 1693
} | 2026-11-02T05:37:07.883505+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": 2376
} | 2026-11-02T05:37:07.883505+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": 51578
} | 2026-11-02T05:37:07.883505+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": 5205
} | 2026-11-02T05:37:07.883505+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": 7372
} | 2026-11-02T05:37:07.883505+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": 2739
} | 2026-11-02T05:37:07.883505+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.