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:912-A | codeforces | 912-A | Tricky Alchemy | https://codeforces.com/problemset/problem/912/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 14589
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:911-G | codeforces | 911-G | Mass Change Queries | https://codeforces.com/problemset/problem/911/G | [
"data structures"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 4138
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:911-F | codeforces | 911-F | Tree Destruction | https://codeforces.com/problemset/problem/911/F | [
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2448
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:911-E | codeforces | 911-E | Stack Sorting | https://codeforces.com/problemset/problem/911/E | [
"constructive algorithms",
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3023
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:911-D | codeforces | 911-D | Inversion Counting | https://codeforces.com/problemset/problem/911/D | [
"brute force",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5227
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:911-C | codeforces | 911-C | Three Garlands | https://codeforces.com/problemset/problem/911/C | [
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7386
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:911-B | codeforces | 911-B | Two Cakes | https://codeforces.com/problemset/problem/911/B | [
"binary search",
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 13041
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:911-A | codeforces | 911-A | Nearest Minimums | https://codeforces.com/problemset/problem/911/A | [
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 12541
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:910-C | codeforces | 910-C | Minimum Sum | https://codeforces.com/problemset/problem/910/C | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2202
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:910-B | codeforces | 910-B | Door Frames | https://codeforces.com/problemset/problem/910/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 1911
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:910-A | codeforces | 910-A | The Way to Home | https://codeforces.com/problemset/problem/910/A | [
"dfs and similar",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 14636
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:909-F | codeforces | 909-F | AND-permutations | https://codeforces.com/problemset/problem/909/F | [
"constructive algorithms"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 702
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:909-E | codeforces | 909-E | Coprocessor | https://codeforces.com/problemset/problem/909/E | [
"dfs and similar",
"dp",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2627
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:909-D | codeforces | 909-D | Colorful Points | https://codeforces.com/problemset/problem/909/D | [
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2220
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:909-C | codeforces | 909-C | Python Indentation | https://codeforces.com/problemset/problem/909/C | [
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5602
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:909-B | codeforces | 909-B | Segments | https://codeforces.com/problemset/problem/909/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 6859
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:909-A | codeforces | 909-A | Generate Login | https://codeforces.com/problemset/problem/909/A | [
"brute force",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 10493
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:908-H | codeforces | 908-H | New Year and Boolean Bridges | https://codeforces.com/problemset/problem/908/H | [] | null | null | stdin_stdout | 3,100 | {
"solved_count": 671
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:908-G | codeforces | 908-G | New Year and Original Order | https://codeforces.com/problemset/problem/908/G | [
"dp",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1799
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:908-F | codeforces | 908-F | New Year and Rainbow Roads | https://codeforces.com/problemset/problem/908/F | [
"graphs",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1675
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:908-E | codeforces | 908-E | New Year and Entity Enumeration | https://codeforces.com/problemset/problem/908/E | [
"bitmasks",
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 880
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:908-D | codeforces | 908-D | New Year and Arbitrary Arrangement | https://codeforces.com/problemset/problem/908/D | [
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2813
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:908-C | codeforces | 908-C | New Year and Curling | https://codeforces.com/problemset/problem/908/C | [
"brute force",
"geometry",
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 7286
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:908-B | codeforces | 908-B | New Year and Buggy Bot | https://codeforces.com/problemset/problem/908/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8130
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:908-A | codeforces | 908-A | New Year and Counting Cards | https://codeforces.com/problemset/problem/908/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16043
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:907-B | codeforces | 907-B | Tic-Tac-Toe | https://codeforces.com/problemset/problem/907/B | [
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 4427
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:907-A | codeforces | 907-A | Masha and Bears | https://codeforces.com/problemset/problem/907/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 6092
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:906-E | codeforces | 906-E | Reverses | https://codeforces.com/problemset/problem/906/E | [
"dp",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 604
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:906-D | codeforces | 906-D | Power Tower | https://codeforces.com/problemset/problem/906/D | [
"chinese remainder theorem",
"math",
"number theory"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 2924
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:906-C | codeforces | 906-C | Party | https://codeforces.com/problemset/problem/906/C | [
"bitmasks",
"brute force",
"dp",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1598
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:906-B | codeforces | 906-B | Seating of Students | https://codeforces.com/problemset/problem/906/B | [
"brute force",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1375
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:906-A | codeforces | 906-A | Shockers | https://codeforces.com/problemset/problem/906/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4516
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:903-G | codeforces | 903-G | Yet Another Maxflow Problem | https://codeforces.com/problemset/problem/903/G | [
"data structures",
"flows",
"graphs"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 779
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:903-F | codeforces | 903-F | Clear The Matrix | https://codeforces.com/problemset/problem/903/F | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 826
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:903-E | codeforces | 903-E | Swapping Characters | https://codeforces.com/problemset/problem/903/E | [
"brute force",
"hashing",
"implementation",
"strings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1636
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:903-D | codeforces | 903-D | Almost Difference | https://codeforces.com/problemset/problem/903/D | [
"data structures",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 5305
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:903-C | codeforces | 903-C | Boxes Packing | https://codeforces.com/problemset/problem/903/C | [
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 24105
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:903-B | codeforces | 903-B | The Modcrab | https://codeforces.com/problemset/problem/903/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8202
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:903-A | codeforces | 903-A | Hungry Student Problem | https://codeforces.com/problemset/problem/903/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 15736
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:902-B | codeforces | 902-B | Coloring a Tree | https://codeforces.com/problemset/problem/902/B | [
"dfs and similar",
"dsu",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 12216
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:902-A | codeforces | 902-A | Visiting a Friend | https://codeforces.com/problemset/problem/902/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 10373
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:901-E | codeforces | 901-E | Cyclic Cipher | https://codeforces.com/problemset/problem/901/E | [
"fft",
"math"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 108
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:901-D | codeforces | 901-D | Weighting a Tree | https://codeforces.com/problemset/problem/901/D | [
"constructive algorithms",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 699
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:901-C | codeforces | 901-C | Bipartite Segments | https://codeforces.com/problemset/problem/901/C | [
"binary search",
"data structures",
"dfs and similar",
"dsu",
"graphs",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1353
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:901-B | codeforces | 901-B | GCD of Polynomials | https://codeforces.com/problemset/problem/901/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1656
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:901-A | codeforces | 901-A | Hashing Trees | https://codeforces.com/problemset/problem/901/A | [
"constructive algorithms",
"trees"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 5434
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:900-E | codeforces | 900-E | Maximum Questions | https://codeforces.com/problemset/problem/900/E | [
"data structures",
"dp",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1467
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:900-D | codeforces | 900-D | Unusual Sequences | https://codeforces.com/problemset/problem/900/D | [
"bitmasks",
"combinatorics",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4023
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:900-C | codeforces | 900-C | Remove Extra One | https://codeforces.com/problemset/problem/900/C | [
"brute force",
"data structures",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5136
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:900-B | codeforces | 900-B | Position in Fraction | https://codeforces.com/problemset/problem/900/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 8597
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:900-A | codeforces | 900-A | Find Extra One | https://codeforces.com/problemset/problem/900/A | [
"geometry",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 15247
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:899-F | codeforces | 899-F | Letters Removing | https://codeforces.com/problemset/problem/899/F | [
"data structures",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2122
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:899-E | codeforces | 899-E | Segments Removal | https://codeforces.com/problemset/problem/899/E | [
"data structures",
"dsu",
"flows",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3750
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:899-D | codeforces | 899-D | Shovel Sale | https://codeforces.com/problemset/problem/899/D | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3292
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:899-C | codeforces | 899-C | Dividing the numbers | https://codeforces.com/problemset/problem/899/C | [
"constructive algorithms",
"graphs",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9143
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:899-B | codeforces | 899-B | Months and Years | https://codeforces.com/problemset/problem/899/B | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 6568
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:899-A | codeforces | 899-A | Splitting in Teams | https://codeforces.com/problemset/problem/899/A | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 11227
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:898-F | codeforces | 898-F | Restoring the Expression | https://codeforces.com/problemset/problem/898/F | [
"brute force",
"hashing",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1511
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:898-E | codeforces | 898-E | Squares and not squares | https://codeforces.com/problemset/problem/898/E | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4925
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:898-D | codeforces | 898-D | Alarm Clock | https://codeforces.com/problemset/problem/898/D | [
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4669
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:898-C | codeforces | 898-C | Phone Numbers | https://codeforces.com/problemset/problem/898/C | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 5928
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:898-B | codeforces | 898-B | Proper Nutrition | https://codeforces.com/problemset/problem/898/B | [
"brute force",
"implementation",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 10917
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:898-A | codeforces | 898-A | Rounding | https://codeforces.com/problemset/problem/898/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17835
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:897-B | codeforces | 897-B | Chtholly's request | https://codeforces.com/problemset/problem/897/B | [
"brute force"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 7634
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:897-A | codeforces | 897-A | Scarborough Fair | https://codeforces.com/problemset/problem/897/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 15286
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:896-E | codeforces | 896-E | Welcome home, Chtholly | https://codeforces.com/problemset/problem/896/E | [
"data structures",
"dsu"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 2602
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:896-D | codeforces | 896-D | Nephren Runs a Cinema | https://codeforces.com/problemset/problem/896/D | [
"chinese remainder theorem",
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 786
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:896-C | codeforces | 896-C | Willem, Chtholly and Seniorious | https://codeforces.com/problemset/problem/896/C | [
"data structures",
"probabilities"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 4785
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:896-B | codeforces | 896-B | Ithea Plays With Chtholly | https://codeforces.com/problemset/problem/896/B | [
"binary search",
"constructive algorithms",
"games",
"greedy",
"interactive"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2372
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:896-A | codeforces | 896-A | Nephren gives a riddle | https://codeforces.com/problemset/problem/896/A | [
"binary search",
"dfs and similar"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3937
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:895-E | codeforces | 895-E | Eyes Closed | https://codeforces.com/problemset/problem/895/E | [
"data structures",
"probabilities"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1328
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:895-D | codeforces | 895-D | String Mark | https://codeforces.com/problemset/problem/895/D | [
"combinatorics",
"math",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1300
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:895-C | codeforces | 895-C | Square Subsets | https://codeforces.com/problemset/problem/895/C | [
"bitmasks",
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 8065
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:895-B | codeforces | 895-B | XK Segments | https://codeforces.com/problemset/problem/895/B | [
"binary search",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3857
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:895-A | codeforces | 895-A | Pizza Separation | https://codeforces.com/problemset/problem/895/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 7009
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:894-E | codeforces | 894-E | Ralph and Mushrooms | https://codeforces.com/problemset/problem/894/E | [
"dp",
"graphs"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3628
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:894-D | codeforces | 894-D | Ralph And His Tour in Binary Country | https://codeforces.com/problemset/problem/894/D | [
"brute force",
"data structures",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1244
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:894-C | codeforces | 894-C | Marco and GCD Sequence | https://codeforces.com/problemset/problem/894/C | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4686
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:894-B | codeforces | 894-B | Ralph And His Magic Field | https://codeforces.com/problemset/problem/894/B | [
"combinatorics",
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4758
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:894-A | codeforces | 894-A | QAQ | https://codeforces.com/problemset/problem/894/A | [
"brute force",
"dp"
] | null | null | stdin_stdout | 800 | {
"solved_count": 40489
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:893-F | codeforces | 893-F | Subtree Minimum Query | https://codeforces.com/problemset/problem/893/F | [
"data structures",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2686
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:893-E | codeforces | 893-E | Counting Arrays | https://codeforces.com/problemset/problem/893/E | [
"combinatorics",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4407
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:893-D | codeforces | 893-D | Credit Card | https://codeforces.com/problemset/problem/893/D | [
"data structures",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3411
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:893-C | codeforces | 893-C | Rumor | https://codeforces.com/problemset/problem/893/C | [
"dfs and similar",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 29956
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:893-B | codeforces | 893-B | Beautiful Divisors | https://codeforces.com/problemset/problem/893/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 13029
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:893-A | codeforces | 893-A | Chess For Three | https://codeforces.com/problemset/problem/893/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 11325
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:892-B | codeforces | 892-B | Wrath | https://codeforces.com/problemset/problem/892/B | [
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 10380
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:892-A | codeforces | 892-A | Greed | https://codeforces.com/problemset/problem/892/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 15299
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:891-E | codeforces | 891-E | Lust | https://codeforces.com/problemset/problem/891/E | [
"combinatorics",
"math",
"matrices"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 1295
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:891-D | codeforces | 891-D | Sloth | https://codeforces.com/problemset/problem/891/D | [
"dfs and similar",
"dp",
"graph matchings",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 490
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:891-C | codeforces | 891-C | Envy | https://codeforces.com/problemset/problem/891/C | [
"data structures",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3326
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:891-B | codeforces | 891-B | Gluttony | https://codeforces.com/problemset/problem/891/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3305
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:891-A | codeforces | 891-A | Pride | https://codeforces.com/problemset/problem/891/A | [
"brute force",
"dp",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15656
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:889-E | codeforces | 889-E | Mod Mod Mod | https://codeforces.com/problemset/problem/889/E | [
"binary search",
"dp",
"math"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 831
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:888-G | codeforces | 888-G | Xor-MST | https://codeforces.com/problemset/problem/888/G | [
"bitmasks",
"constructive algorithms",
"data structures"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 6423
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:888-F | codeforces | 888-F | Connecting Vertices | https://codeforces.com/problemset/problem/888/F | [
"dp",
"graphs"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1234
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:888-E | codeforces | 888-E | Maximum Subsequence | https://codeforces.com/problemset/problem/888/E | [
"bitmasks",
"divide and conquer",
"meet-in-the-middle"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 10199
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:888-D | codeforces | 888-D | Almost Identity Permutations | https://codeforces.com/problemset/problem/888/D | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11217
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:888-C | codeforces | 888-C | K-Dominant Character | https://codeforces.com/problemset/problem/888/C | [
"binary search",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 9193
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:888-B | codeforces | 888-B | Buggy Robot | https://codeforces.com/problemset/problem/888/B | [
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 10950
} | 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.