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:917-C | codeforces | 917-C | Pollywog | https://codeforces.com/problemset/problem/917/C | [
"combinatorics",
"dp",
"matrices"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 451
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:917-B | codeforces | 917-B | MADMAX | https://codeforces.com/problemset/problem/917/B | [
"dfs and similar",
"dp",
"games",
"graphs"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4009
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:917-A | codeforces | 917-A | The Monster | https://codeforces.com/problemset/problem/917/A | [
"dp",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3680
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:916-E | codeforces | 916-E | Jamie and Tree | https://codeforces.com/problemset/problem/916/E | [
"data structures",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2124
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:916-D | codeforces | 916-D | Jamie and To-do List | https://codeforces.com/problemset/problem/916/D | [
"data structures",
"interactive",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 567
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:916-C | codeforces | 916-C | Jamie and Interesting Graph | https://codeforces.com/problemset/problem/916/C | [
"constructive algorithms",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5559
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:916-B | codeforces | 916-B | Jamie and Binary Sequence (changed after round) | https://codeforces.com/problemset/problem/916/B | [
"bitmasks",
"greedy",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2013
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:916-A | codeforces | 916-A | Jamie and Alarm Snooze | https://codeforces.com/problemset/problem/916/A | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 9574
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:915-G | codeforces | 915-G | Coprime Arrays | https://codeforces.com/problemset/problem/915/G | [
"math",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1464
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:915-F | codeforces | 915-F | Imbalance Value of a Tree | https://codeforces.com/problemset/problem/915/F | [
"data structures",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 3090
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:915-E | codeforces | 915-E | Physical Education Lessons | https://codeforces.com/problemset/problem/915/E | [
"data structures",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 5610
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:915-D | codeforces | 915-D | Almost Acyclic Graph | https://codeforces.com/problemset/problem/915/D | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4090
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:915-C | codeforces | 915-C | Permute Digits | https://codeforces.com/problemset/problem/915/C | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7577
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:915-B | codeforces | 915-B | Browser | https://codeforces.com/problemset/problem/915/B | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 8407
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:915-A | codeforces | 915-A | Garden | https://codeforces.com/problemset/problem/915/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 16055
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:914-H | codeforces | 914-H | Ember and Storm's Tree Game | https://codeforces.com/problemset/problem/914/H | [
"combinatorics",
"dp",
"games",
"trees"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 279
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:914-G | codeforces | 914-G | Sum the Fibonacci | https://codeforces.com/problemset/problem/914/G | [
"bitmasks",
"divide and conquer",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1142
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:914-F | codeforces | 914-F | Substrings in a String | https://codeforces.com/problemset/problem/914/F | [
"bitmasks",
"brute force",
"data structures",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 2159
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:914-E | codeforces | 914-E | Palindromes in a Tree | https://codeforces.com/problemset/problem/914/E | [
"bitmasks",
"data structures",
"divide and conquer",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1942
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:914-D | codeforces | 914-D | Bash and a Tough Math Puzzle | https://codeforces.com/problemset/problem/914/D | [
"data structures",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6420
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:914-C | codeforces | 914-C | Travelling Salesman and Special Numbers | https://codeforces.com/problemset/problem/914/C | [
"brute force",
"combinatorics",
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4248
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:914-B | codeforces | 914-B | Conan and Agasa play a Card Game | https://codeforces.com/problemset/problem/914/B | [
"games",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 9084
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:914-A | codeforces | 914-A | Perfect Squares | https://codeforces.com/problemset/problem/914/A | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 15778
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:913-H | codeforces | 913-H | Don't Exceed | https://codeforces.com/problemset/problem/913/H | [
"math",
"probabilities"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 143
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:913-G | codeforces | 913-G | Power Substring | https://codeforces.com/problemset/problem/913/G | [
"math",
"number theory"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 235
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:913-F | codeforces | 913-F | Strongly Connected Tournament | https://codeforces.com/problemset/problem/913/F | [
"dp",
"graphs",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 773
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:913-E | codeforces | 913-E | Logical Expression | https://codeforces.com/problemset/problem/913/E | [
"bitmasks",
"dp",
"shortest paths"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 888
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:913-D | codeforces | 913-D | Too Easy Problems | https://codeforces.com/problemset/problem/913/D | [
"binary search",
"brute force",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5146
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:913-C | codeforces | 913-C | Party Lemonade | https://codeforces.com/problemset/problem/913/C | [
"bitmasks",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8478
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:913-B | codeforces | 913-B | Christmas Spruce | https://codeforces.com/problemset/problem/913/B | [
"implementation",
"trees"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 19592
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:913-A | codeforces | 913-A | Modular Exponentiation | https://codeforces.com/problemset/problem/913/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 24279
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:912-E | codeforces | 912-E | Prime Gift | https://codeforces.com/problemset/problem/912/E | [
"binary search",
"dfs and similar",
"math",
"meet-in-the-middle",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2064
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:912-D | codeforces | 912-D | Fishes | https://codeforces.com/problemset/problem/912/D | [
"data structures",
"graphs",
"greedy",
"probabilities",
"shortest paths"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2151
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:912-C | codeforces | 912-C | Perun, Ult! | https://codeforces.com/problemset/problem/912/C | [
"brute force",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 542
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:912-B | codeforces | 912-B | New Year's Eve | https://codeforces.com/problemset/problem/912/B | [
"bitmasks",
"constructive algorithms",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13948
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:912-A | codeforces | 912-A | Tricky Alchemy | https://codeforces.com/problemset/problem/912/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 14408
} | 2026-06-01T05:00:40.145500+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": 3830
} | 2026-06-01T05:00:40.145500+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": 2300
} | 2026-06-01T05:00:40.145500+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": 2858
} | 2026-06-01T05:00:40.145500+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": 5131
} | 2026-06-01T05:00:40.145500+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": 7340
} | 2026-06-01T05:00:40.145500+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": 12833
} | 2026-06-01T05:00:40.145500+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": 12333
} | 2026-06-01T05:00:40.145500+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": 2170
} | 2026-06-01T05:00:40.145500+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": 1878
} | 2026-06-01T05:00:40.145500+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": 14074
} | 2026-06-01T05:00:40.145500+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": 637
} | 2026-06-01T05:00:40.145500+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": 2473
} | 2026-06-01T05:00:40.145500+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": 2110
} | 2026-06-01T05:00:40.145500+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": 5507
} | 2026-06-01T05:00:40.145500+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": 6776
} | 2026-06-01T05:00:40.145500+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": 10390
} | 2026-06-01T05:00:40.145500+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": 476
} | 2026-06-01T05:00:40.145500+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": 1675
} | 2026-06-01T05:00:40.145500+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": 1624
} | 2026-06-01T05:00:40.145500+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": 839
} | 2026-06-01T05:00:40.145500+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": 2622
} | 2026-06-01T05:00:40.145500+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": 7219
} | 2026-06-01T05:00:40.145500+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": 7908
} | 2026-06-01T05:00:40.145500+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": 15858
} | 2026-06-01T05:00:40.145500+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": 4230
} | 2026-06-01T05:00:40.145500+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": 5974
} | 2026-06-01T05:00:40.145500+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": 575
} | 2026-06-01T05:00:40.145500+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": 2701
} | 2026-06-01T05:00:40.145500+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": 1513
} | 2026-06-01T05:00:40.145500+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": 1324
} | 2026-06-01T05:00:40.145500+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": 4426
} | 2026-06-01T05:00:40.145500+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": 706
} | 2026-06-01T05:00:40.145500+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": 774
} | 2026-06-01T05:00:40.145500+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": 1581
} | 2026-06-01T05:00:40.145500+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": 4490
} | 2026-06-01T05:00:40.145500+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": 22839
} | 2026-06-01T05:00:40.145500+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": 8136
} | 2026-06-01T05:00:40.145500+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": 15534
} | 2026-06-01T05:00:40.145500+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": 11986
} | 2026-06-01T05:00:40.145500+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": 10282
} | 2026-06-01T05:00:40.145500+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": 99
} | 2026-06-01T05:00:40.145500+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": 639
} | 2026-06-01T05:00:40.145500+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": 1300
} | 2026-06-01T05:00:40.145500+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": 1641
} | 2026-06-01T05:00:40.145500+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": 5391
} | 2026-06-01T05:00:40.145500+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": 1397
} | 2026-06-01T05:00:40.145500+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": 3823
} | 2026-06-01T05:00:40.145500+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": 5013
} | 2026-06-01T05:00:40.145500+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": 8390
} | 2026-06-01T05:00:40.145500+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": 14990
} | 2026-06-01T05:00:40.145500+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": 2035
} | 2026-06-01T05:00:40.145500+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": 3547
} | 2026-06-01T05:00:40.145500+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": 3268
} | 2026-06-01T05:00:40.145500+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": 9057
} | 2026-06-01T05:00:40.145500+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": 6452
} | 2026-06-01T05:00:40.145500+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": 11113
} | 2026-06-01T05:00:40.145500+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": 1461
} | 2026-06-01T05:00:40.145500+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": 4876
} | 2026-06-01T05:00:40.145500+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": 4558
} | 2026-06-01T05:00:40.145500+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": 5810
} | 2026-06-01T05:00:40.145500+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": 10681
} | 2026-06-01T05:00:40.145500+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": 17613
} | 2026-06-01T05:00:40.145500+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": 7555
} | 2026-06-01T05:00:40.145500+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": 15125
} | 2026-06-01T05:00:40.145500+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.