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:994-A | codeforces | 994-A | Fingerprints | https://codeforces.com/problemset/problem/994/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 15286
} | 2026-08-17T01:43:56.191071+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": 202
} | 2026-08-17T01:43:56.191071+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": 1898
} | 2026-08-17T01:43:56.191071+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": 866
} | 2026-08-17T01:43:56.191071+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": 1841
} | 2026-08-17T01:43:56.191071+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": 2061
} | 2026-08-17T01:43:56.191071+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": 4574
} | 2026-08-17T01:43:56.191071+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": 1826
} | 2026-08-17T01:43:56.191071+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": 2041
} | 2026-08-17T01:43:56.191071+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": 4889
} | 2026-08-17T01:43:56.191071+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": 6826
} | 2026-08-17T01:43:56.191071+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": 14450
} | 2026-08-17T01:43:56.191071+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": 415
} | 2026-08-17T01:43:56.191071+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": 3764
} | 2026-08-17T01:43:56.191071+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": 7809
} | 2026-08-17T01:43:56.191071+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": 11692
} | 2026-08-17T01:43:56.191071+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": 13854
} | 2026-08-17T01:43:56.191071+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": 11289
} | 2026-08-17T01:43:56.191071+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": 2433
} | 2026-08-17T01:43:56.191071+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": 1147
} | 2026-08-17T01:43:56.191071+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": 2200
} | 2026-08-17T01:43:56.191071+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": 4145
} | 2026-08-17T01:43:56.191071+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": 6337
} | 2026-08-17T01:43:56.191071+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": 8671
} | 2026-08-17T01:43:56.191071+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": 11316
} | 2026-08-17T01:43:56.191071+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": 352
} | 2026-08-17T01:43:56.191071+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": 630
} | 2026-08-17T01:43:56.191071+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": 4102
} | 2026-08-17T01:43:56.191071+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": 7315
} | 2026-08-17T01:43:56.191071+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": 11246
} | 2026-08-17T01:43:56.191071+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": 2847
} | 2026-08-17T01:43:56.191071+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": 4501
} | 2026-08-17T01:43:56.191071+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": 8133
} | 2026-08-17T01:43:56.191071+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": 11309
} | 2026-08-17T01:43:56.191071+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": 20600
} | 2026-08-17T01:43:56.191071+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": 29047
} | 2026-08-17T01:43:56.191071+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": 15323
} | 2026-08-17T01:43:56.191071+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": 12288
} | 2026-08-17T01:43:56.191071+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": 17695
} | 2026-08-17T01:43:56.191071+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": 894
} | 2026-08-17T01:43:56.191071+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": 970
} | 2026-08-17T01:43:56.191071+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": 400
} | 2026-08-17T01:43:56.191071+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": 2802
} | 2026-08-17T01:43:56.191071+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": 5100
} | 2026-08-17T01:43:56.191071+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": 8683
} | 2026-08-17T01:43:56.191071+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": 844
} | 2026-08-17T01:43:56.191071+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": 2241
} | 2026-08-17T01:43:56.191071+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": 4309
} | 2026-08-17T01:43:56.191071+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": 2885
} | 2026-08-17T01:43:56.191071+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": 6030
} | 2026-08-17T01:43:56.191071+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": 7972
} | 2026-08-17T01:43:56.191071+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": 8466
} | 2026-08-17T01:43:56.191071+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": 8041
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:984-A | codeforces | 984-A | Game | https://codeforces.com/problemset/problem/984/A | [
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20919
} | 2026-08-17T01:43:56.191071+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": 1268
} | 2026-08-17T01:43:56.191071+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": 579
} | 2026-08-17T01:43:56.191071+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": 1013
} | 2026-08-17T01:43:56.191071+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": 6491
} | 2026-08-17T01:43:56.191071+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": 4859
} | 2026-08-17T01:43:56.191071+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": 230
} | 2026-08-17T01:43:56.191071+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": 882
} | 2026-08-17T01:43:56.191071+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": 2561
} | 2026-08-17T01:43:56.191071+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": 16810
} | 2026-08-17T01:43:56.191071+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": 9054
} | 2026-08-17T01:43:56.191071+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": 9859
} | 2026-08-17T01:43:56.191071+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": 502
} | 2026-08-17T01:43:56.191071+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": 844
} | 2026-08-17T01:43:56.191071+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": 964
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:981-E | codeforces | 981-E | Addition on Segments | https://codeforces.com/problemset/problem/981/E | [
"bitmasks",
"data structures",
"divide and conquer",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2651
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:981-D | codeforces | 981-D | Bookshelves | https://codeforces.com/problemset/problem/981/D | [
"bitmasks",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3593
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:981-C | codeforces | 981-C | Useful Decomposition | https://codeforces.com/problemset/problem/981/C | [
"implementation",
"trees"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 6987
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:981-B | codeforces | 981-B | Businessmen Problems | https://codeforces.com/problemset/problem/981/B | [
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 8147
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:981-A | codeforces | 981-A | Antipalindrome | https://codeforces.com/problemset/problem/981/A | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 10417
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:980-F | codeforces | 980-F | Cactus to Tree | https://codeforces.com/problemset/problem/980/F | [
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 241
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:980-E | codeforces | 980-E | The Number Games | https://codeforces.com/problemset/problem/980/E | [
"data structures",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2382
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:980-D | codeforces | 980-D | Perfect Groups | https://codeforces.com/problemset/problem/980/D | [
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3100
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:980-C | codeforces | 980-C | Posterized | https://codeforces.com/problemset/problem/980/C | [
"games",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3961
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:980-B | codeforces | 980-B | Marlin | https://codeforces.com/problemset/problem/980/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4976
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:980-A | codeforces | 980-A | Links and Pearls | https://codeforces.com/problemset/problem/980/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 11033
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:979-E | codeforces | 979-E | Kuro and Topological Parity | https://codeforces.com/problemset/problem/979/E | [
"dp"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 956
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:979-D | codeforces | 979-D | Kuro and GCD and XOR and SUM | https://codeforces.com/problemset/problem/979/D | [
"binary search",
"bitmasks",
"brute force",
"data structures",
"dp",
"dsu",
"greedy",
"math",
"number theory",
"strings",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2267
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:979-C | codeforces | 979-C | Kuro and Walking Route | https://codeforces.com/problemset/problem/979/C | [
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7512
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:979-B | codeforces | 979-B | Treasure Hunt | https://codeforces.com/problemset/problem/979/B | [
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4824
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:979-A | codeforces | 979-A | Pizza, Pizza, Pizza!!! | https://codeforces.com/problemset/problem/979/A | [
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 14786
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:978-G | codeforces | 978-G | Petya's Exams | https://codeforces.com/problemset/problem/978/G | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4989
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:978-F | codeforces | 978-F | Mentors | https://codeforces.com/problemset/problem/978/F | [
"binary search",
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9364
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:978-E | codeforces | 978-E | Bus Video System | https://codeforces.com/problemset/problem/978/E | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10719
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:978-D | codeforces | 978-D | Almost Arithmetic Progression | https://codeforces.com/problemset/problem/978/D | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 10112
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:978-C | codeforces | 978-C | Letters | https://codeforces.com/problemset/problem/978/C | [
"binary search",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 30794
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:978-B | codeforces | 978-B | File Name | https://codeforces.com/problemset/problem/978/B | [
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 41524
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:978-A | codeforces | 978-A | Remove Duplicates | https://codeforces.com/problemset/problem/978/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31492
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:977-F | codeforces | 977-F | Consecutive Subsequence | https://codeforces.com/problemset/problem/977/F | [
"dp"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 26184
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:977-E | codeforces | 977-E | Cyclic Components | https://codeforces.com/problemset/problem/977/E | [
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 26899
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:977-D | codeforces | 977-D | Divide by three, multiply by two | https://codeforces.com/problemset/problem/977/D | [
"dfs and similar",
"math",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 20952
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:977-C | codeforces | 977-C | Less or Equal | https://codeforces.com/problemset/problem/977/C | [
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 45261
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:977-B | codeforces | 977-B | Two-gram | https://codeforces.com/problemset/problem/977/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 51469
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:977-A | codeforces | 977-A | Wrong Subtraction | https://codeforces.com/problemset/problem/977/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 226227
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:976-F | codeforces | 976-F | Minimal k-covering | https://codeforces.com/problemset/problem/976/F | [
"flows",
"graphs"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 708
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:976-E | codeforces | 976-E | Well played! | https://codeforces.com/problemset/problem/976/E | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2603
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:976-D | codeforces | 976-D | Degree Set | https://codeforces.com/problemset/problem/976/D | [
"constructive algorithms",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 789
} | 2026-08-17T01:43:56.191071+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.