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:68-C | codeforces | 68-C | Synchrophasotron | https://codeforces.com/problemset/problem/68/C | [
"brute force"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 396
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:68-B | codeforces | 68-B | Energy exchange | https://codeforces.com/problemset/problem/68/B | [
"binary search"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5751
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:68-A | codeforces | 68-A | Irrational problem | https://codeforces.com/problemset/problem/68/A | [
"implementation",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 5428
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:67-E | codeforces | 67-E | Save the City! | https://codeforces.com/problemset/problem/67/E | [
"geometry"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 444
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:67-D | codeforces | 67-D | Optical Experiment | https://codeforces.com/problemset/problem/67/D | [
"binary search",
"data structures",
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1805
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:67-C | codeforces | 67-C | Sequence of Balls | https://codeforces.com/problemset/problem/67/C | [
"dp"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 788
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:67-B | codeforces | 67-B | Restoration of the Permutation | https://codeforces.com/problemset/problem/67/B | [
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 956
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:67-A | codeforces | 67-A | Partial Teacher | https://codeforces.com/problemset/problem/67/A | [
"dp",
"graphs",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2557
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:66-E | codeforces | 66-E | Petya and Post | https://codeforces.com/problemset/problem/66/E | [
"data structures",
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 956
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:66-D | codeforces | 66-D | Petya and His Friends | https://codeforces.com/problemset/problem/66/D | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3769
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:66-C | codeforces | 66-C | Petya and File System | https://codeforces.com/problemset/problem/66/C | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1198
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:66-B | codeforces | 66-B | Petya and Countryside | https://codeforces.com/problemset/problem/66/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 23399
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:66-A | codeforces | 66-A | Petya and Java | https://codeforces.com/problemset/problem/66/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 7139
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:65-E | codeforces | 65-E | Harry Potter and Moving Staircases | https://codeforces.com/problemset/problem/65/E | [
"dfs and similar",
"implementation"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 109
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:65-D | codeforces | 65-D | Harry Potter and the Sorting Hat | https://codeforces.com/problemset/problem/65/D | [
"brute force",
"dfs and similar",
"hashing"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 500
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:65-C | codeforces | 65-C | Harry Potter and the Golden Snitch | https://codeforces.com/problemset/problem/65/C | [
"binary search",
"geometry"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 896
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:65-B | codeforces | 65-B | Harry Potter and the History of Magic | https://codeforces.com/problemset/problem/65/B | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 1563
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:65-A | codeforces | 65-A | Harry Potter and Three Spells | https://codeforces.com/problemset/problem/65/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2043
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:64-I | codeforces | 64-I | Sort the Table | https://codeforces.com/problemset/problem/64/I | [
"*special",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 94
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:64-H | codeforces | 64-H | Table Bowling | https://codeforces.com/problemset/problem/64/H | [
"*special",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 122
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:64-G | codeforces | 64-G | Path Canonization | https://codeforces.com/problemset/problem/64/G | [
"*special"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 129
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:64-F | codeforces | 64-F | Domain | https://codeforces.com/problemset/problem/64/F | [
"*special",
"expression parsing"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 193
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:64-E | codeforces | 64-E | Prime Segment | https://codeforces.com/problemset/problem/64/E | [
"*special",
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 295
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:64-D | codeforces | 64-D | Presents | https://codeforces.com/problemset/problem/64/D | [
"*special",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 298
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:64-C | codeforces | 64-C | Table | https://codeforces.com/problemset/problem/64/C | [
"*special",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 358
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:64-B | codeforces | 64-B | Expression | https://codeforces.com/problemset/problem/64/B | [
"*special",
"expression parsing"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 1057
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:64-A | codeforces | 64-A | Factorial | https://codeforces.com/problemset/problem/64/A | [
"*special",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 4403
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:63-E | codeforces | 63-E | Sweets Game | https://codeforces.com/problemset/problem/63/E | [
"bitmasks",
"dfs and similar",
"dp",
"games",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 895
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:63-D | codeforces | 63-D | Dividing Island | https://codeforces.com/problemset/problem/63/D | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1460
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:63-C | codeforces | 63-C | Bulls and Cows | https://codeforces.com/problemset/problem/63/C | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2021
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:63-B | codeforces | 63-B | Settlers' Training | https://codeforces.com/problemset/problem/63/B | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 5250
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:63-A | codeforces | 63-A | Sinking Ship | https://codeforces.com/problemset/problem/63/A | [
"implementation",
"sortings",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 13638
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:62-E | codeforces | 62-E | World Evil | https://codeforces.com/problemset/problem/62/E | [
"dp",
"flows"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 340
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:62-D | codeforces | 62-D | Wormhouse | https://codeforces.com/problemset/problem/62/D | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 473
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:62-C | codeforces | 62-C | Inquisition | https://codeforces.com/problemset/problem/62/C | [
"geometry",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 363
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:62-B | codeforces | 62-B | Tyndex.Brome | https://codeforces.com/problemset/problem/62/B | [
"binary search",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1414
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:62-A | codeforces | 62-A | A Student's Dream | https://codeforces.com/problemset/problem/62/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 3837
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:61-E | codeforces | 61-E | Enemy is weak | https://codeforces.com/problemset/problem/61/E | [
"data structures",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 16226
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:61-D | codeforces | 61-D | Eternal Victory | https://codeforces.com/problemset/problem/61/D | [
"dfs and similar",
"graphs",
"greedy",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7798
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:61-C | codeforces | 61-C | Capture Valerian | https://codeforces.com/problemset/problem/61/C | [
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1004
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:61-B | codeforces | 61-B | Hard Work | https://codeforces.com/problemset/problem/61/B | [
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 4298
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:61-A | codeforces | 61-A | Ultra-Fast Mathematician | https://codeforces.com/problemset/problem/61/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 140170
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:60-E | codeforces | 60-E | Mushroom Gnomes | https://codeforces.com/problemset/problem/60/E | [
"math",
"matrices"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 525
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:60-D | codeforces | 60-D | Savior | https://codeforces.com/problemset/problem/60/D | [
"brute force",
"dsu",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 597
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:60-C | codeforces | 60-C | Mushroom Strife | https://codeforces.com/problemset/problem/60/C | [
"brute force",
"dfs and similar"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 721
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:60-B | codeforces | 60-B | Serial Time! | https://codeforces.com/problemset/problem/60/B | [
"dfs and similar",
"dsu"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 5375
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:60-A | codeforces | 60-A | Where Are My Flakes? | https://codeforces.com/problemset/problem/60/A | [
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 4420
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:59-E | codeforces | 59-E | Shortest Path | https://codeforces.com/problemset/problem/59/E | [
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5168
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:59-D | codeforces | 59-D | Team Arrangement | https://codeforces.com/problemset/problem/59/D | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 774
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:59-C | codeforces | 59-C | Title | https://codeforces.com/problemset/problem/59/C | [
"expression parsing"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2489
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:59-B | codeforces | 59-B | Fortune Telling | https://codeforces.com/problemset/problem/59/B | [
"implementation",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8125
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:59-A | codeforces | 59-A | Word | https://codeforces.com/problemset/problem/59/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 236511
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:58-E | codeforces | 58-E | Expression | https://codeforces.com/problemset/problem/58/E | [
"dp"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 480
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:58-D | codeforces | 58-D | Calendar | https://codeforces.com/problemset/problem/58/D | [
"greedy",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 867
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:58-C | codeforces | 58-C | Trees | https://codeforces.com/problemset/problem/58/C | [
"brute force"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2283
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:58-B | codeforces | 58-B | Coins | https://codeforces.com/problemset/problem/58/B | [
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13407
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:58-A | codeforces | 58-A | Chat room | https://codeforces.com/problemset/problem/58/A | [
"greedy",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 160081
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:57-E | codeforces | 57-E | Chess | https://codeforces.com/problemset/problem/57/E | [
"math",
"shortest paths"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 391
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:57-D | codeforces | 57-D | Journey | https://codeforces.com/problemset/problem/57/D | [
"dp",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 367
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:57-C | codeforces | 57-C | Array | https://codeforces.com/problemset/problem/57/C | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4339
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:57-B | codeforces | 57-B | Martian Architecture | https://codeforces.com/problemset/problem/57/B | [
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 1176
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:57-A | codeforces | 57-A | Square Earth? | https://codeforces.com/problemset/problem/57/A | [
"dfs and similar",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 3303
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:56-E | codeforces | 56-E | Domino Principle | https://codeforces.com/problemset/problem/56/E | [
"binary search",
"data structures",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2915
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:56-D | codeforces | 56-D | Changing a String | https://codeforces.com/problemset/problem/56/D | [
"dp"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2195
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:56-C | codeforces | 56-C | Corporation Mail | https://codeforces.com/problemset/problem/56/C | [
"data structures",
"expression parsing",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 1319
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:56-B | codeforces | 56-B | Spoilt Permutation | https://codeforces.com/problemset/problem/56/B | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 4078
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:56-A | codeforces | 56-A | Bar | https://codeforces.com/problemset/problem/56/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 9772
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:55-E | codeforces | 55-E | Very simple problem | https://codeforces.com/problemset/problem/55/E | [
"geometry",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 881
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:55-D | codeforces | 55-D | Beautiful numbers | https://codeforces.com/problemset/problem/55/D | [
"dp",
"number theory"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 4883
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:55-C | codeforces | 55-C | Pie or die | https://codeforces.com/problemset/problem/55/C | [
"games"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1848
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:55-B | codeforces | 55-B | Smallest number | https://codeforces.com/problemset/problem/55/B | [
"brute force"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 3490
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:55-A | codeforces | 55-A | Flea travel | https://codeforces.com/problemset/problem/55/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 3950
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:54-E | codeforces | 54-E | Vacuum Сleaner | https://codeforces.com/problemset/problem/54/E | [
"geometry"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 255
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:54-D | codeforces | 54-D | Writing a Song | https://codeforces.com/problemset/problem/54/D | [
"brute force",
"dp",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 738
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:54-C | codeforces | 54-C | First Digit Law | https://codeforces.com/problemset/problem/54/C | [
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1738
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:54-B | codeforces | 54-B | Cutting Jigsaw Puzzle | https://codeforces.com/problemset/problem/54/B | [
"hashing",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 923
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:54-A | codeforces | 54-A | Presents | https://codeforces.com/problemset/problem/54/A | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 2599
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:53-E | codeforces | 53-E | Dead Ends | https://codeforces.com/problemset/problem/53/E | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1347
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:53-D | codeforces | 53-D | Physical Education | https://codeforces.com/problemset/problem/53/D | [
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 2670
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:53-C | codeforces | 53-C | Little Frog | https://codeforces.com/problemset/problem/53/C | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 7286
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:53-B | codeforces | 53-B | Blog Photo | https://codeforces.com/problemset/problem/53/B | [
"binary search",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 1587
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:53-A | codeforces | 53-A | Autocomplete | https://codeforces.com/problemset/problem/53/A | [
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 5872
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:52-C | codeforces | 52-C | Circular RMQ | https://codeforces.com/problemset/problem/52/C | [
"data structures"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 11790
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:52-B | codeforces | 52-B | Right Triangles | https://codeforces.com/problemset/problem/52/B | [
"combinatorics"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2440
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:52-A | codeforces | 52-A | 123-sequence | https://codeforces.com/problemset/problem/52/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 10815
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:51-F | codeforces | 51-F | Caterpillar | https://codeforces.com/problemset/problem/51/F | [
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 860
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:51-E | codeforces | 51-E | Pentagon | https://codeforces.com/problemset/problem/51/E | [
"combinatorics",
"graphs",
"matrices"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 498
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:51-D | codeforces | 51-D | Geometrical problem | https://codeforces.com/problemset/problem/51/D | [
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 616
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:51-C | codeforces | 51-C | Three Base Stations | https://codeforces.com/problemset/problem/51/C | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2980
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:51-B | codeforces | 51-B | bHTML Tables Analisys | https://codeforces.com/problemset/problem/51/B | [
"expression parsing"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 1057
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:51-A | codeforces | 51-A | Cheaterius's Problem | https://codeforces.com/problemset/problem/51/A | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 2109
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:50-E | codeforces | 50-E | Square Equation Roots | https://codeforces.com/problemset/problem/50/E | [
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 467
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:50-D | codeforces | 50-D | Bombing | https://codeforces.com/problemset/problem/50/D | [
"binary search",
"dp",
"probabilities"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 746
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:50-C | codeforces | 50-C | Happy Farm 5 | https://codeforces.com/problemset/problem/50/C | [
"geometry"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 932
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:50-B | codeforces | 50-B | Choosing Symbol Pairs | https://codeforces.com/problemset/problem/50/B | [
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6568
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:50-A | codeforces | 50-A | Domino piling | https://codeforces.com/problemset/problem/50/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 330082
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:49-E | codeforces | 49-E | Common ancestor | https://codeforces.com/problemset/problem/49/E | [
"dp"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 821
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:49-D | codeforces | 49-D | Game | https://codeforces.com/problemset/problem/49/D | [
"brute force",
"dp",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2155
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:49-C | codeforces | 49-C | Disposition | https://codeforces.com/problemset/problem/49/C | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 1897
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:49-B | codeforces | 49-B | Sum | https://codeforces.com/problemset/problem/49/B | [
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 2838
} | 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.