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:1001-C | codeforces | 1001-C | Generate GHZ state | https://codeforces.com/problemset/problem/1001/C | [
"*special"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 669
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1001-B | codeforces | 1001-B | Generate Bell state | https://codeforces.com/problemset/problem/1001/B | [
"*special"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 724
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1001-A | codeforces | 1001-A | Generate plus state or minus state | https://codeforces.com/problemset/problem/1001/A | [
"*special"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 1047
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1000-G | codeforces | 1000-G | Two-Paths | https://codeforces.com/problemset/problem/1000/G | [
"data structures",
"dp",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 825
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1000-F | codeforces | 1000-F | One Occurrence | https://codeforces.com/problemset/problem/1000/F | [
"data structures",
"divide and conquer"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 5368
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1000-E | codeforces | 1000-E | We Need More Bosses | https://codeforces.com/problemset/problem/1000/E | [
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 7365
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1000-D | codeforces | 1000-D | Yet Another Problem On a Subsequence | https://codeforces.com/problemset/problem/1000/D | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5285
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1000-C | codeforces | 1000-C | Covered Points Count | https://codeforces.com/problemset/problem/1000/C | [
"data structures",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9136
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1000-B | codeforces | 1000-B | Light It Up | https://codeforces.com/problemset/problem/1000/B | [
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6281
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1000-A | codeforces | 1000-A | Codehorses T-shirts | https://codeforces.com/problemset/problem/1000/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 9549
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:999-F | codeforces | 999-F | Cards and Joy | https://codeforces.com/problemset/problem/999/F | [
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3416
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:999-E | codeforces | 999-E | Reachability from the Capital | https://codeforces.com/problemset/problem/999/E | [
"dfs and similar",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 8517
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:999-D | codeforces | 999-D | Equalize the Remainders | https://codeforces.com/problemset/problem/999/D | [
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5022
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:999-C | codeforces | 999-C | Alphabetic Removals | https://codeforces.com/problemset/problem/999/C | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 21565
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:999-B | codeforces | 999-B | Reversing Encryption | https://codeforces.com/problemset/problem/999/B | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 19791
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:999-A | codeforces | 999-A | Mishka and Contest | https://codeforces.com/problemset/problem/999/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25748
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:998-B | codeforces | 998-B | Cutting | https://codeforces.com/problemset/problem/998/B | [
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 14639
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:998-A | codeforces | 998-A | Balloons | https://codeforces.com/problemset/problem/998/A | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 10280
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:997-E | codeforces | 997-E | Good Subsegments | https://codeforces.com/problemset/problem/997/E | [
"data structures"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 1885
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:997-D | codeforces | 997-D | Cycles in product | https://codeforces.com/problemset/problem/997/D | [
"combinatorics",
"divide and conquer",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 925
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:997-C | codeforces | 997-C | Sky Full of Stars | https://codeforces.com/problemset/problem/997/C | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2512
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:997-B | codeforces | 997-B | Roman Digits | https://codeforces.com/problemset/problem/997/B | [
"brute force",
"combinatorics",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3256
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:997-A | codeforces | 997-A | Convert to Ones | https://codeforces.com/problemset/problem/997/A | [
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 8735
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:996-B | codeforces | 996-B | World Cup | https://codeforces.com/problemset/problem/996/B | [
"binary search",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 10062
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:996-A | codeforces | 996-A | Hit the Lottery | https://codeforces.com/problemset/problem/996/A | [
"dp",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 127044
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:995-F | codeforces | 995-F | Cowmpany Cowmpensation | https://codeforces.com/problemset/problem/995/F | [
"combinatorics",
"dp",
"math",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1886
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:995-E | codeforces | 995-E | Number Clicker | https://codeforces.com/problemset/problem/995/E | [
"divide and conquer",
"graphs",
"meet-in-the-middle",
"number theory"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1035
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:995-D | codeforces | 995-D | Game | https://codeforces.com/problemset/problem/995/D | [
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 988
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:995-C | codeforces | 995-C | Leaving the Bar | https://codeforces.com/problemset/problem/995/C | [
"brute force",
"data structures",
"geometry",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2181
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:995-B | codeforces | 995-B | Suit and Tie | https://codeforces.com/problemset/problem/995/B | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7508
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:995-A | codeforces | 995-A | Tesla | https://codeforces.com/problemset/problem/995/A | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1866
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:994-B | codeforces | 994-B | Knights of a Polygonal Table | https://codeforces.com/problemset/problem/994/B | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 6124
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:994-A | codeforces | 994-A | Fingerprints | https://codeforces.com/problemset/problem/994/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 15354
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:993-F | codeforces | 993-F | The Moral Dilemma | https://codeforces.com/problemset/problem/993/F | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 203
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:993-E | codeforces | 993-E | Nikita and Order Statistics | https://codeforces.com/problemset/problem/993/E | [
"chinese remainder theorem",
"fft",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1981
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:993-D | codeforces | 993-D | Compute Power | https://codeforces.com/problemset/problem/993/D | [
"binary search",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 870
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:993-C | codeforces | 993-C | Careful Maneuvering | https://codeforces.com/problemset/problem/993/C | [
"bitmasks",
"brute force",
"geometry"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1852
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:993-B | codeforces | 993-B | Open Communication | https://codeforces.com/problemset/problem/993/B | [
"bitmasks",
"brute force"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2066
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:993-A | codeforces | 993-A | Two Squares | https://codeforces.com/problemset/problem/993/A | [
"geometry",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4607
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:992-E | codeforces | 992-E | Nastya and King-Shamans | https://codeforces.com/problemset/problem/992/E | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1876
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:992-D | codeforces | 992-D | Nastya and a Game | https://codeforces.com/problemset/problem/992/D | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2046
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:992-C | codeforces | 992-C | Nastya and a Wardrobe | https://codeforces.com/problemset/problem/992/C | [
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4903
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:992-B | codeforces | 992-B | Nastya Studies Informatics | https://codeforces.com/problemset/problem/992/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6859
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:992-A | codeforces | 992-A | Nastya and an Array | https://codeforces.com/problemset/problem/992/A | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 14545
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:991-F | codeforces | 991-F | Concise and clear | https://codeforces.com/problemset/problem/991/F | [
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 417
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:991-E | codeforces | 991-E | Bus Number | https://codeforces.com/problemset/problem/991/E | [
"brute force",
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3802
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:991-D | codeforces | 991-D | Bishwock | https://codeforces.com/problemset/problem/991/D | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 7835
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:991-C | codeforces | 991-C | Candies | https://codeforces.com/problemset/problem/991/C | [
"binary search",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 11785
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:991-B | codeforces | 991-B | Getting an A | https://codeforces.com/problemset/problem/991/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 13964
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:991-A | codeforces | 991-A | If at first you don't succeed... | https://codeforces.com/problemset/problem/991/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 11341
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:990-G | codeforces | 990-G | GCD Counting | https://codeforces.com/problemset/problem/990/G | [
"divide and conquer",
"dp",
"dsu",
"number theory",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2500
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:990-F | codeforces | 990-F | Flow Control | https://codeforces.com/problemset/problem/990/F | [
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1154
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:990-E | codeforces | 990-E | Post Lamps | https://codeforces.com/problemset/problem/990/E | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2211
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:990-D | codeforces | 990-D | Graph And Its Complement | https://codeforces.com/problemset/problem/990/D | [
"constructive algorithms",
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4181
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:990-C | codeforces | 990-C | Bracket Sequences Concatenation Problem | https://codeforces.com/problemset/problem/990/C | [
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6369
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:990-B | codeforces | 990-B | Micro-World | https://codeforces.com/problemset/problem/990/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8696
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:990-A | codeforces | 990-A | Commentary Boxes | https://codeforces.com/problemset/problem/990/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 11351
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:989-E | codeforces | 989-E | A Trance of Nightfall | https://codeforces.com/problemset/problem/989/E | [
"dp",
"geometry",
"matrices",
"probabilities"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 356
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:989-D | codeforces | 989-D | A Shade of Moonlight | https://codeforces.com/problemset/problem/989/D | [
"binary search",
"geometry",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 635
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:989-C | codeforces | 989-C | A Mist of Florescence | https://codeforces.com/problemset/problem/989/C | [
"constructive algorithms",
"graphs"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4121
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:989-B | codeforces | 989-B | A Tide of Riverscape | https://codeforces.com/problemset/problem/989/B | [
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 7337
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:989-A | codeforces | 989-A | A Blend of Springtime | https://codeforces.com/problemset/problem/989/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 11281
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:988-F | codeforces | 988-F | Rain and Umbrellas | https://codeforces.com/problemset/problem/988/F | [
"dp"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2882
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:988-E | codeforces | 988-E | Divisibility by 25 | https://codeforces.com/problemset/problem/988/E | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4553
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:988-D | codeforces | 988-D | Points and Powers of Two | https://codeforces.com/problemset/problem/988/D | [
"brute force",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8208
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:988-C | codeforces | 988-C | Equal Sums | https://codeforces.com/problemset/problem/988/C | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11384
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:988-B | codeforces | 988-B | Substrings Sort | https://codeforces.com/problemset/problem/988/B | [
"sortings",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 20760
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:988-A | codeforces | 988-A | Diverse Team | https://codeforces.com/problemset/problem/988/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29415
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:987-C | codeforces | 987-C | Three displays | https://codeforces.com/problemset/problem/987/C | [
"brute force",
"dp",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15427
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:987-B | codeforces | 987-B | High School: Become Human | https://codeforces.com/problemset/problem/987/B | [
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 12319
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:987-A | codeforces | 987-A | Infinity Gauntlet | https://codeforces.com/problemset/problem/987/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17755
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:986-F | codeforces | 986-F | Oppa Funcan Style Remastered | https://codeforces.com/problemset/problem/986/F | [
"graphs",
"math",
"number theory",
"shortest paths"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 979
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:986-E | codeforces | 986-E | Prince's Problem | https://codeforces.com/problemset/problem/986/E | [
"brute force",
"data structures",
"math",
"number theory",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 992
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:986-D | codeforces | 986-D | Perfect Encoding | https://codeforces.com/problemset/problem/986/D | [
"fft",
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 401
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:986-C | codeforces | 986-C | AND Graph | https://codeforces.com/problemset/problem/986/C | [
"bitmasks",
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2830
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:986-B | codeforces | 986-B | Petr and Permutations | https://codeforces.com/problemset/problem/986/B | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5130
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:986-A | codeforces | 986-A | Fair | https://codeforces.com/problemset/problem/986/A | [
"graphs",
"greedy",
"number theory",
"shortest paths"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8851
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:985-G | codeforces | 985-G | Team Players | https://codeforces.com/problemset/problem/985/G | [
"combinatorics"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 858
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:985-F | codeforces | 985-F | Isomorphic Strings | https://codeforces.com/problemset/problem/985/F | [
"hashing",
"strings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2289
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:985-E | codeforces | 985-E | Pencils and Boxes | https://codeforces.com/problemset/problem/985/E | [
"binary search",
"data structures",
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4362
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:985-D | codeforces | 985-D | Sand Fortress | https://codeforces.com/problemset/problem/985/D | [
"binary search",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2901
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:985-C | codeforces | 985-C | Liebig's Barrels | https://codeforces.com/problemset/problem/985/C | [
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6066
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:985-B | codeforces | 985-B | Switches and Lamps | https://codeforces.com/problemset/problem/985/B | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8043
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:985-A | codeforces | 985-A | Chess Placing | https://codeforces.com/problemset/problem/985/A | [
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 8487
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:984-B | codeforces | 984-B | Minesweeper | https://codeforces.com/problemset/problem/984/B | [
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 8059
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:984-A | codeforces | 984-A | Game | https://codeforces.com/problemset/problem/984/A | [
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21006
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:983-E | codeforces | 983-E | NN country | https://codeforces.com/problemset/problem/983/E | [
"binary search",
"data structures",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1294
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:983-D | codeforces | 983-D | Arkady and Rectangles | https://codeforces.com/problemset/problem/983/D | [
"data structures"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 589
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:983-C | codeforces | 983-C | Elevator | https://codeforces.com/problemset/problem/983/C | [
"dp",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1025
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:983-B | codeforces | 983-B | XOR-pyramid | https://codeforces.com/problemset/problem/983/B | [
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6542
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:983-A | codeforces | 983-A | Finite or not? | https://codeforces.com/problemset/problem/983/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4882
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:982-F | codeforces | 982-F | The Meeting Place Cannot Be Changed | https://codeforces.com/problemset/problem/982/F | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 245
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:982-E | codeforces | 982-E | Billiard | https://codeforces.com/problemset/problem/982/E | [
"geometry",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 893
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:982-D | codeforces | 982-D | Shark | https://codeforces.com/problemset/problem/982/D | [
"brute force",
"data structures",
"dsu",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2589
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:982-C | codeforces | 982-C | Cut 'em all! | https://codeforces.com/problemset/problem/982/C | [
"dfs and similar",
"dp",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 17466
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:982-B | codeforces | 982-B | Bus of Characters | https://codeforces.com/problemset/problem/982/B | [
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9102
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:982-A | codeforces | 982-A | Row | https://codeforces.com/problemset/problem/982/A | [
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 9898
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:981-H | codeforces | 981-H | K Paths | https://codeforces.com/problemset/problem/981/H | [
"combinatorics",
"data structures",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 503
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:981-G | codeforces | 981-G | Magic multisets | https://codeforces.com/problemset/problem/981/G | [
"data structures"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 849
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:981-F | codeforces | 981-F | Round Marriage | https://codeforces.com/problemset/problem/981/F | [
"binary search",
"graph matchings",
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 997
} | 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.