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:44-H | codeforces | 44-H | Phone Number | https://codeforces.com/problemset/problem/44/H | [
"dp"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2014
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:44-G | codeforces | 44-G | Shooting Gallery | https://codeforces.com/problemset/problem/44/G | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 503
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:44-F | codeforces | 44-F | BerPaint | https://codeforces.com/problemset/problem/44/F | [
"geometry",
"graphs"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 80
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:44-E | codeforces | 44-E | Anfisa the Monkey | https://codeforces.com/problemset/problem/44/E | [
"dp"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 6152
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:44-D | codeforces | 44-D | Hyperdrive | https://codeforces.com/problemset/problem/44/D | [
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 804
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:44-C | codeforces | 44-C | Holidays | https://codeforces.com/problemset/problem/44/C | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 4069
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:44-B | codeforces | 44-B | Cola | https://codeforces.com/problemset/problem/44/B | [
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 2311
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:44-A | codeforces | 44-A | Indian Summer | https://codeforces.com/problemset/problem/44/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 17790
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:43-E | codeforces | 43-E | Race | https://codeforces.com/problemset/problem/43/E | [
"brute force",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 447
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:43-D | codeforces | 43-D | Journey | https://codeforces.com/problemset/problem/43/D | [
"brute force",
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1236
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:43-C | codeforces | 43-C | Lucky Tickets | https://codeforces.com/problemset/problem/43/C | [
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 4775
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:43-B | codeforces | 43-B | Letter | https://codeforces.com/problemset/problem/43/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 20591
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:43-A | codeforces | 43-A | Football | https://codeforces.com/problemset/problem/43/A | [
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 69691
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:42-E | codeforces | 42-E | Baldman and the military | https://codeforces.com/problemset/problem/42/E | [
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 244
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:42-D | codeforces | 42-D | Strange town | https://codeforces.com/problemset/problem/42/D | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 490
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:42-C | codeforces | 42-C | Safe cracking | https://codeforces.com/problemset/problem/42/C | [
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 577
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:42-B | codeforces | 42-B | Game of chess unfinished | https://codeforces.com/problemset/problem/42/B | [
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 1172
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:42-A | codeforces | 42-A | Guilty --- to the kitchen! | https://codeforces.com/problemset/problem/42/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 3179
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:41-E | codeforces | 41-E | 3-cycles | https://codeforces.com/problemset/problem/41/E | [
"constructive algorithms",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2240
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:41-D | codeforces | 41-D | Pawn | https://codeforces.com/problemset/problem/41/D | [
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2903
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:41-C | codeforces | 41-C | Email address | https://codeforces.com/problemset/problem/41/C | [
"expression parsing",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 4208
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:41-B | codeforces | 41-B | Martian Dollar | https://codeforces.com/problemset/problem/41/B | [
"brute force"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 4649
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:41-A | codeforces | 41-A | Translation | https://codeforces.com/problemset/problem/41/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 190057
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:40-E | codeforces | 40-E | Number Table | https://codeforces.com/problemset/problem/40/E | [
"combinatorics"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 810
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:40-D | codeforces | 40-D | Interesting Sequence | https://codeforces.com/problemset/problem/40/D | [
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 172
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:40-C | codeforces | 40-C | Berland Square | https://codeforces.com/problemset/problem/40/C | [
"implementation",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 329
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:40-B | codeforces | 40-B | Repaintings | https://codeforces.com/problemset/problem/40/B | [
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 1402
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:40-A | codeforces | 40-A | Find Color | https://codeforces.com/problemset/problem/40/A | [
"constructive algorithms",
"geometry",
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 4444
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:39-K | codeforces | 39-K | Testing | https://codeforces.com/problemset/problem/39/K | [] | null | null | stdin_stdout | 2,600 | {
"solved_count": 103
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:39-J | codeforces | 39-J | Spelling Check | https://codeforces.com/problemset/problem/39/J | [
"hashing",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 3596
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:39-I | codeforces | 39-I | Tram | https://codeforces.com/problemset/problem/39/I | [] | null | null | stdin_stdout | 2,500 | {
"solved_count": 200
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:39-H | codeforces | 39-H | Multiplication Table | https://codeforces.com/problemset/problem/39/H | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 3139
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:39-G | codeforces | 39-G | Inverse Function | https://codeforces.com/problemset/problem/39/G | [
"implementation"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 160
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:39-F | codeforces | 39-F | Pacifist frogs | https://codeforces.com/problemset/problem/39/F | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 1970
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:39-E | codeforces | 39-E | What Has Dirichlet Got to Do with That? | https://codeforces.com/problemset/problem/39/E | [
"dp",
"games"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1039
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:39-D | codeforces | 39-D | Cubical Planet | https://codeforces.com/problemset/problem/39/D | [
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 4683
} | 2026-06-01T05:00:40.145500+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": 699
} | 2026-06-01T05:00:40.145500+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": 3112
} | 2026-06-01T05:00:40.145500+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": 798
} | 2026-06-01T05:00:40.145500+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": 449
} | 2026-06-01T05:00:40.145500+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": 815
} | 2026-06-01T05:00:40.145500+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": 447
} | 2026-06-01T05:00:40.145500+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": 3003
} | 2026-06-01T05:00:40.145500+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": 1077
} | 2026-06-01T05:00:40.145500+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": 2569
} | 2026-06-01T05:00:40.145500+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": 4048
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:38-A | codeforces | 38-A | Army | https://codeforces.com/problemset/problem/38/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26651
} | 2026-06-01T05:00:40.145500+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": 680
} | 2026-06-01T05:00:40.145500+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": 559
} | 2026-06-01T05:00:40.145500+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": 2216
} | 2026-06-01T05:00:40.145500+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": 1097
} | 2026-06-01T05:00:40.145500+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": 27784
} | 2026-06-01T05:00:40.145500+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": 618
} | 2026-06-01T05:00:40.145500+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": 772
} | 2026-06-01T05:00:40.145500+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": 380
} | 2026-06-01T05:00:40.145500+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": 2043
} | 2026-06-01T05:00:40.145500+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": 3556
} | 2026-06-01T05:00:40.145500+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": 881
} | 2026-06-01T05:00:40.145500+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": 3875
} | 2026-06-01T05:00:40.145500+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": 8771
} | 2026-06-01T05:00:40.145500+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": 1200
} | 2026-06-01T05:00:40.145500+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": 7608
} | 2026-06-01T05:00:40.145500+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": 655
} | 2026-06-01T05:00:40.145500+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": 6523
} | 2026-06-01T05:00:40.145500+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": 4799
} | 2026-06-01T05:00:40.145500+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": 66500
} | 2026-06-01T05:00:40.145500+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": 34833
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:33-E | codeforces | 33-E | Helper | https://codeforces.com/problemset/problem/33/E | [] | null | null | stdin_stdout | 2,600 | {
"solved_count": 153
} | 2026-06-01T05:00:40.145500+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": 1575
} | 2026-06-01T05:00:40.145500+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": 3586
} | 2026-06-01T05:00:40.145500+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": 5840
} | 2026-06-01T05:00:40.145500+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": 4894
} | 2026-06-01T05:00:40.145500+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": 426
} | 2026-06-01T05:00:40.145500+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": 1494
} | 2026-06-01T05:00:40.145500+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": 2579
} | 2026-06-01T05:00:40.145500+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": 80312
} | 2026-06-01T05:00:40.145500+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": 14967
} | 2026-06-01T05:00:40.145500+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": 1307
} | 2026-06-01T05:00:40.145500+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": 1232
} | 2026-06-01T05:00:40.145500+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": 2036
} | 2026-06-01T05:00:40.145500+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": 4757
} | 2026-06-01T05:00:40.145500+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": 12699
} | 2026-06-01T05:00:40.145500+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": 925
} | 2026-06-01T05:00:40.145500+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": 499
} | 2026-06-01T05:00:40.145500+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": 2410
} | 2026-06-01T05:00:40.145500+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": 1390
} | 2026-06-01T05:00:40.145500+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": 4007
} | 2026-06-01T05:00:40.145500+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": 1139
} | 2026-06-01T05:00:40.145500+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": 2950
} | 2026-06-01T05:00:40.145500+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": 6547
} | 2026-06-01T05:00:40.145500+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": 3357
} | 2026-06-01T05:00:40.145500+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": 8321
} | 2026-06-01T05:00:40.145500+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": 109
} | 2026-06-01T05:00:40.145500+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": 681
} | 2026-06-01T05:00:40.145500+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": 1299
} | 2026-06-01T05:00:40.145500+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": 5554
} | 2026-06-01T05:00:40.145500+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": 976
} | 2026-06-01T05:00:40.145500+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": 4917
} | 2026-06-01T05:00:40.145500+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": 3113
} | 2026-06-01T05:00:40.145500+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": 3071
} | 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.