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:227-B | codeforces | 227-B | Effective Approach | https://codeforces.com/problemset/problem/227/B | [
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 33080
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:227-A | codeforces | 227-A | Where do I Turn? | https://codeforces.com/problemset/problem/227/A | [
"geometry"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 4681
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:226-E | codeforces | 226-E | Noble Knight's Path | https://codeforces.com/problemset/problem/226/E | [
"data structures",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 664
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:226-D | codeforces | 226-D | The table | https://codeforces.com/problemset/problem/226/D | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1193
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:226-C | codeforces | 226-C | Anniversary | https://codeforces.com/problemset/problem/226/C | [
"data structures",
"implementation",
"math",
"matrices",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1049
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:226-B | codeforces | 226-B | Naughty Stone Piles | https://codeforces.com/problemset/problem/226/B | [
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1726
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:226-A | codeforces | 226-A | Flying Saucer Segments | https://codeforces.com/problemset/problem/226/A | [
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 4399
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:225-E | codeforces | 225-E | Unsolvable | https://codeforces.com/problemset/problem/225/E | [
"math",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 927
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:225-D | codeforces | 225-D | Snake | https://codeforces.com/problemset/problem/225/D | [
"bitmasks",
"dfs and similar",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1076
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:225-C | codeforces | 225-C | Barcode | https://codeforces.com/problemset/problem/225/C | [
"dp",
"matrices"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10326
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:225-B | codeforces | 225-B | Well-known Numbers | https://codeforces.com/problemset/problem/225/B | [
"binary search",
"greedy",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 3420
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:225-A | codeforces | 225-A | Dice Tower | https://codeforces.com/problemset/problem/225/A | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 14461
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:224-B | codeforces | 224-B | Array | https://codeforces.com/problemset/problem/224/B | [
"bitmasks",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 8179
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:224-A | codeforces | 224-A | Parallelepiped | https://codeforces.com/problemset/problem/224/A | [
"brute force",
"geometry",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 30781
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:223-E | codeforces | 223-E | Planar Graph | https://codeforces.com/problemset/problem/223/E | [
"flows",
"geometry",
"graphs"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 288
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:223-D | codeforces | 223-D | Spider | https://codeforces.com/problemset/problem/223/D | [
"geometry",
"graphs"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 92
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:223-C | codeforces | 223-C | Partial Sums | https://codeforces.com/problemset/problem/223/C | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1766
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:223-B | codeforces | 223-B | Two Strings | https://codeforces.com/problemset/problem/223/B | [
"data structures",
"dp",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2043
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:223-A | codeforces | 223-A | Bracket Sequence | https://codeforces.com/problemset/problem/223/A | [
"data structures",
"expression parsing",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2922
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:222-E | codeforces | 222-E | Decoding Genome | https://codeforces.com/problemset/problem/222/E | [
"dp",
"matrices"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3731
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:222-D | codeforces | 222-D | Olympiad | https://codeforces.com/problemset/problem/222/D | [
"binary search",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2354
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:222-C | codeforces | 222-C | Reducing Fractions | https://codeforces.com/problemset/problem/222/C | [
"implementation",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3034
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:222-B | codeforces | 222-B | Cosmic Tables | https://codeforces.com/problemset/problem/222/B | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 6615
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:222-A | codeforces | 222-A | Shooshuns and Sequence | https://codeforces.com/problemset/problem/222/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 11995
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:221-B | codeforces | 221-B | Little Elephant and Numbers | https://codeforces.com/problemset/problem/221/B | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 4962
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:221-A | codeforces | 221-A | Little Elephant and Function | https://codeforces.com/problemset/problem/221/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 16992
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:220-E | codeforces | 220-E | Little Elephant and Inversions | https://codeforces.com/problemset/problem/220/E | [
"data structures",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1780
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:220-D | codeforces | 220-D | Little Elephant and Triangle | https://codeforces.com/problemset/problem/220/D | [
"geometry",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 359
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:220-C | codeforces | 220-C | Little Elephant and Shifts | https://codeforces.com/problemset/problem/220/C | [
"data structures"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1065
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:220-B | codeforces | 220-B | Little Elephant and Array | https://codeforces.com/problemset/problem/220/B | [
"constructive algorithms",
"data structures"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 13445
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:220-A | codeforces | 220-A | Little Elephant and Problem | https://codeforces.com/problemset/problem/220/A | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13410
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:219-E | codeforces | 219-E | Parking Lot | https://codeforces.com/problemset/problem/219/E | [
"data structures"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 729
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:219-D | codeforces | 219-D | Choosing Capital for Treeland | https://codeforces.com/problemset/problem/219/D | [
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 13092
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:219-C | codeforces | 219-C | Color Stripe | https://codeforces.com/problemset/problem/219/C | [
"brute force",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7288
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:219-B | codeforces | 219-B | Special Offer! Super Price 999 Bourles! | https://codeforces.com/problemset/problem/219/B | [
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 6185
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:219-A | codeforces | 219-A | k-String | https://codeforces.com/problemset/problem/219/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 33076
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:218-B | codeforces | 218-B | Airport | https://codeforces.com/problemset/problem/218/B | [
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 18675
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:218-A | codeforces | 218-A | Mountain Scenery | https://codeforces.com/problemset/problem/218/A | [
"brute force",
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 10679
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:217-E | codeforces | 217-E | Alien DNA | https://codeforces.com/problemset/problem/217/E | [
"data structures",
"dsu",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 360
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:217-D | codeforces | 217-D | Bitonix' Patrol | https://codeforces.com/problemset/problem/217/D | [
"bitmasks",
"brute force",
"combinatorics",
"dfs and similar",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 282
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:217-C | codeforces | 217-C | Formurosa | https://codeforces.com/problemset/problem/217/C | [
"divide and conquer",
"dp",
"expression parsing"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 403
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:217-B | codeforces | 217-B | Blackboard Fibonacci | https://codeforces.com/problemset/problem/217/B | [
"brute force",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1246
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:217-A | codeforces | 217-A | Ice Skating | https://codeforces.com/problemset/problem/217/A | [
"brute force",
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 25347
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:216-E | codeforces | 216-E | Martian Luck | https://codeforces.com/problemset/problem/216/E | [
"math",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 701
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:216-D | codeforces | 216-D | Spider's Web | https://codeforces.com/problemset/problem/216/D | [
"binary search",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 1507
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:216-C | codeforces | 216-C | Hiring Staff | https://codeforces.com/problemset/problem/216/C | [
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1943
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:216-B | codeforces | 216-B | Forming Teams | https://codeforces.com/problemset/problem/216/B | [
"dfs and similar",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7120
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:216-A | codeforces | 216-A | Tiling with Hexagons | https://codeforces.com/problemset/problem/216/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 5328
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:215-E | codeforces | 215-E | Periodical Numbers | https://codeforces.com/problemset/problem/215/E | [
"combinatorics",
"dp",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 698
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:215-D | codeforces | 215-D | Hot Days | https://codeforces.com/problemset/problem/215/D | [
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1694
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:215-C | codeforces | 215-C | Crosses | https://codeforces.com/problemset/problem/215/C | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 739
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:215-B | codeforces | 215-B | Olympic Medal | https://codeforces.com/problemset/problem/215/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 6037
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:215-A | codeforces | 215-A | Bicycle Chain | https://codeforces.com/problemset/problem/215/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 16344
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:214-B | codeforces | 214-B | Hometask | https://codeforces.com/problemset/problem/214/B | [
"brute force",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5393
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:214-A | codeforces | 214-A | System of Equations | https://codeforces.com/problemset/problem/214/A | [
"brute force"
] | null | null | stdin_stdout | 800 | {
"solved_count": 43934
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:213-E | codeforces | 213-E | Two Permutations | https://codeforces.com/problemset/problem/213/E | [
"data structures",
"hashing",
"strings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1038
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:213-D | codeforces | 213-D | Stars | https://codeforces.com/problemset/problem/213/D | [
"constructive algorithms",
"geometry"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 382
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:213-C | codeforces | 213-C | Relay Race | https://codeforces.com/problemset/problem/213/C | [
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3331
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:213-B | codeforces | 213-B | Numbers | https://codeforces.com/problemset/problem/213/B | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2001
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:213-A | codeforces | 213-A | Game | https://codeforces.com/problemset/problem/213/A | [
"dfs and similar",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 1935
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:212-E | codeforces | 212-E | IT Restaurants | https://codeforces.com/problemset/problem/212/E | [
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 2279
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:212-D | codeforces | 212-D | Cutting a Fence | https://codeforces.com/problemset/problem/212/D | [
"binary search",
"data structures",
"dsu"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 686
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:212-C | codeforces | 212-C | Cowboys | https://codeforces.com/problemset/problem/212/C | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 520
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:212-B | codeforces | 212-B | Polycarpus is Looking for Good Substrings | https://codeforces.com/problemset/problem/212/B | [
"bitmasks",
"hashing",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 406
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:212-A | codeforces | 212-A | Privatization | https://codeforces.com/problemset/problem/212/A | [
"flows",
"graphs"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 323
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:209-C | codeforces | 209-C | Trails and Glades | https://codeforces.com/problemset/problem/209/C | [
"constructive algorithms",
"dsu",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 925
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:209-B | codeforces | 209-B | Pixels | https://codeforces.com/problemset/problem/209/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 507
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:209-A | codeforces | 209-A | Multicolored Marbles | https://codeforces.com/problemset/problem/209/A | [
"dp",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2913
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:208-E | codeforces | 208-E | Blood Cousins | https://codeforces.com/problemset/problem/208/E | [
"binary search",
"data structures",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 9540
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:208-D | codeforces | 208-D | Prizes, Prizes, more Prizes | https://codeforces.com/problemset/problem/208/D | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8098
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:208-C | codeforces | 208-C | Police Station | https://codeforces.com/problemset/problem/208/C | [
"dp",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2188
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:208-B | codeforces | 208-B | Solitaire | https://codeforces.com/problemset/problem/208/B | [
"dfs and similar",
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1526
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:208-A | codeforces | 208-A | Dubstep | https://codeforces.com/problemset/problem/208/A | [
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 107482
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:207-D9 | codeforces | 207-D9 | The Beaver's Problem - 3 | https://codeforces.com/problemset/problem/207/D9 | [] | null | null | stdin_stdout | 1,800 | {
"solved_count": 99
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:207-D8 | codeforces | 207-D8 | The Beaver's Problem - 3 | https://codeforces.com/problemset/problem/207/D8 | [] | null | null | stdin_stdout | 2,300 | {
"solved_count": 101
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:207-D7 | codeforces | 207-D7 | The Beaver's Problem - 3 | https://codeforces.com/problemset/problem/207/D7 | [] | null | null | stdin_stdout | 1,600 | {
"solved_count": 114
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:207-D6 | codeforces | 207-D6 | The Beaver's Problem - 3 | https://codeforces.com/problemset/problem/207/D6 | [] | null | null | stdin_stdout | 2,100 | {
"solved_count": 90
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:207-D5 | codeforces | 207-D5 | The Beaver's Problem - 3 | https://codeforces.com/problemset/problem/207/D5 | [] | null | null | stdin_stdout | 1,600 | {
"solved_count": 157
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:207-D4 | codeforces | 207-D4 | The Beaver's Problem - 3 | https://codeforces.com/problemset/problem/207/D4 | [] | null | null | stdin_stdout | 2,100 | {
"solved_count": 174
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:207-D3 | codeforces | 207-D3 | The Beaver's Problem - 3 | https://codeforces.com/problemset/problem/207/D3 | [] | null | null | stdin_stdout | 2,000 | {
"solved_count": 149
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:207-D2 | codeforces | 207-D2 | The Beaver's Problem - 3 | https://codeforces.com/problemset/problem/207/D2 | [] | null | null | stdin_stdout | 2,000 | {
"solved_count": 118
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:207-D10 | codeforces | 207-D10 | The Beaver's Problem - 3 | https://codeforces.com/problemset/problem/207/D10 | [] | null | null | stdin_stdout | 2,100 | {
"solved_count": 87
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:207-D1 | codeforces | 207-D1 | The Beaver's Problem - 3 | https://codeforces.com/problemset/problem/207/D1 | [] | null | null | stdin_stdout | 1,800 | {
"solved_count": 125
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:207-C3 | codeforces | 207-C3 | Game with Two Trees | https://codeforces.com/problemset/problem/207/C3 | [
"data structures"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 164
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:207-C2 | codeforces | 207-C2 | Game with Two Trees | https://codeforces.com/problemset/problem/207/C2 | [] | null | null | stdin_stdout | 2,200 | {
"solved_count": 106
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:207-C1 | codeforces | 207-C1 | Game with Two Trees | https://codeforces.com/problemset/problem/207/C1 | [] | null | null | stdin_stdout | 2,100 | {
"solved_count": 138
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:207-B3 | codeforces | 207-B3 | Military Trainings | https://codeforces.com/problemset/problem/207/B3 | [] | null | null | stdin_stdout | 1,700 | {
"solved_count": 221
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:207-B2 | codeforces | 207-B2 | Military Trainings | https://codeforces.com/problemset/problem/207/B2 | [] | null | null | stdin_stdout | 1,900 | {
"solved_count": 244
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:207-B1 | codeforces | 207-B1 | Military Trainings | https://codeforces.com/problemset/problem/207/B1 | [] | null | null | stdin_stdout | 1,600 | {
"solved_count": 363
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:207-A3 | codeforces | 207-A3 | Beaver's Calculator 1.0 | https://codeforces.com/problemset/problem/207/A3 | [
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 311
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:207-A2 | codeforces | 207-A2 | Beaver's Calculator 1.0 | https://codeforces.com/problemset/problem/207/A2 | [
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 307
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:207-A1 | codeforces | 207-A1 | Beaver's Calculator 1.0 | https://codeforces.com/problemset/problem/207/A1 | [
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 373
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:205-B | codeforces | 205-B | Little Elephant and Sorting | https://codeforces.com/problemset/problem/205/B | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 6516
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:205-A | codeforces | 205-A | Little Elephant and Rozdil | https://codeforces.com/problemset/problem/205/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 25560
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:204-E | codeforces | 204-E | Little Elephant and Strings | https://codeforces.com/problemset/problem/204/E | [
"data structures",
"implementation",
"string suffix structures",
"two pointers"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1713
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:204-D | codeforces | 204-D | Little Elephant and Retro Strings | https://codeforces.com/problemset/problem/204/D | [
"dp"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 673
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:204-C | codeforces | 204-C | Little Elephant and Furik and Rubik | https://codeforces.com/problemset/problem/204/C | [
"math",
"probabilities"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1300
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:204-B | codeforces | 204-B | Little Elephant and Cards | https://codeforces.com/problemset/problem/204/B | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 5994
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:204-A | codeforces | 204-A | Little Elephant and Interval | https://codeforces.com/problemset/problem/204/A | [
"binary search",
"combinatorics",
"dp"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6769
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:203-E | codeforces | 203-E | Transportation | https://codeforces.com/problemset/problem/203/E | [
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 337
} | 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.