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:847-K | codeforces | 847-K | Travel Cards | https://codeforces.com/problemset/problem/847/K | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1923
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:847-J | codeforces | 847-J | Students Initiation | https://codeforces.com/problemset/problem/847/J | [
"binary search",
"flows",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 784
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:847-I | codeforces | 847-I | Noise Level | https://codeforces.com/problemset/problem/847/I | [
"dfs and similar",
"implementation",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1656
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:847-H | codeforces | 847-H | Load Testing | https://codeforces.com/problemset/problem/847/H | [
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2611
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:847-G | codeforces | 847-G | University Classes | https://codeforces.com/problemset/problem/847/G | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 7679
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:847-F | codeforces | 847-F | Berland Elections | https://codeforces.com/problemset/problem/847/F | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1006
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:847-E | codeforces | 847-E | Packmen | https://codeforces.com/problemset/problem/847/E | [
"binary search",
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3703
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:847-D | codeforces | 847-D | Dog Show | https://codeforces.com/problemset/problem/847/D | [
"constructive algorithms",
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1392
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:847-C | codeforces | 847-C | Sum of Nestings | https://codeforces.com/problemset/problem/847/C | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2590
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:847-B | codeforces | 847-B | Preparing for Merge Sort | https://codeforces.com/problemset/problem/847/B | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6329
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:847-A | codeforces | 847-A | Union of Doubly Linked Lists | https://codeforces.com/problemset/problem/847/A | [
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 3882
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:846-F | codeforces | 846-F | Random Query | https://codeforces.com/problemset/problem/846/F | [
"data structures",
"math",
"probabilities",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2677
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:846-E | codeforces | 846-E | Chemistry in Berland | https://codeforces.com/problemset/problem/846/E | [
"dfs and similar",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1034
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:846-D | codeforces | 846-D | Monitor | https://codeforces.com/problemset/problem/846/D | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2846
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:846-C | codeforces | 846-C | Four Segments | https://codeforces.com/problemset/problem/846/C | [
"brute force",
"data structures",
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2984
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:846-B | codeforces | 846-B | Math Show | https://codeforces.com/problemset/problem/846/B | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2843
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:846-A | codeforces | 846-A | Curriculum Vitae | https://codeforces.com/problemset/problem/846/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4688
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:845-G | codeforces | 845-G | Shortest Path Problem? | https://codeforces.com/problemset/problem/845/G | [
"dfs and similar",
"graphs",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2181
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:845-F | codeforces | 845-F | Guards In The Storehouse | https://codeforces.com/problemset/problem/845/F | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 633
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:845-E | codeforces | 845-E | Fire in the City | https://codeforces.com/problemset/problem/845/E | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 694
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:845-D | codeforces | 845-D | Driving Test | https://codeforces.com/problemset/problem/845/D | [
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2583
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:845-C | codeforces | 845-C | Two TVs | https://codeforces.com/problemset/problem/845/C | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13982
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:845-B | codeforces | 845-B | Luba And The Ticket | https://codeforces.com/problemset/problem/845/B | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5550
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:845-A | codeforces | 845-A | Chess Tourney | https://codeforces.com/problemset/problem/845/A | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 8498
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:844-B | codeforces | 844-B | Rectangles | https://codeforces.com/problemset/problem/844/B | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9094
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:844-A | codeforces | 844-A | Diversity | https://codeforces.com/problemset/problem/844/A | [
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 12233
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:843-E | codeforces | 843-E | Maximum Flow | https://codeforces.com/problemset/problem/843/E | [
"flows",
"graphs"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 488
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:843-D | codeforces | 843-D | Dynamic Shortest Path | https://codeforces.com/problemset/problem/843/D | [
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 1206
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:843-C | codeforces | 843-C | Upgrading Tree | https://codeforces.com/problemset/problem/843/C | [
"constructive algorithms",
"dfs and similar",
"graphs",
"math",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 408
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:843-B | codeforces | 843-B | Interactive LowerBound | https://codeforces.com/problemset/problem/843/B | [
"brute force",
"interactive",
"probabilities"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2589
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:843-A | codeforces | 843-A | Sorting by Subsequences | https://codeforces.com/problemset/problem/843/A | [
"dfs and similar",
"dsu",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 5978
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:842-E | codeforces | 842-E | Nikita and game | https://codeforces.com/problemset/problem/842/E | [
"binary search",
"dfs and similar",
"divide and conquer",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 502
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:842-D | codeforces | 842-D | Vitya and Strange Lesson | https://codeforces.com/problemset/problem/842/D | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4524
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:842-C | codeforces | 842-C | Ilya And The Tree | https://codeforces.com/problemset/problem/842/C | [
"dfs and similar",
"graphs",
"math",
"number theory",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3777
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:842-B | codeforces | 842-B | Gleb And Pizza | https://codeforces.com/problemset/problem/842/B | [
"geometry"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 11000
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:842-A | codeforces | 842-A | Kirill And The Game | https://codeforces.com/problemset/problem/842/A | [
"brute force",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 11245
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:841-B | codeforces | 841-B | Godsend | https://codeforces.com/problemset/problem/841/B | [
"games",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 13204
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:841-A | codeforces | 841-A | Generous Kefa | https://codeforces.com/problemset/problem/841/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 14073
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:840-E | codeforces | 840-E | In a Trap | https://codeforces.com/problemset/problem/840/E | [
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 576
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:840-D | codeforces | 840-D | Destiny | https://codeforces.com/problemset/problem/840/D | [
"data structures",
"probabilities"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 4005
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:840-C | codeforces | 840-C | On the Bench | https://codeforces.com/problemset/problem/840/C | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2085
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:840-B | codeforces | 840-B | Leha and another game about graph | https://codeforces.com/problemset/problem/840/B | [
"constructive algorithms",
"data structures",
"dfs and similar",
"dp",
"graphs"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2816
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:840-A | codeforces | 840-A | Leha and Function | https://codeforces.com/problemset/problem/840/A | [
"combinatorics",
"greedy",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 7494
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:839-E | codeforces | 839-E | Mother of Dragons | https://codeforces.com/problemset/problem/839/E | [
"brute force",
"graphs",
"math",
"meet-in-the-middle"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1016
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:839-D | codeforces | 839-D | Winter is here | https://codeforces.com/problemset/problem/839/D | [
"combinatorics",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3572
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:839-C | codeforces | 839-C | Journey | https://codeforces.com/problemset/problem/839/C | [
"dfs and similar",
"dp",
"graphs",
"probabilities",
"trees"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 20320
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:839-B | codeforces | 839-B | Game of the Rows | https://codeforces.com/problemset/problem/839/B | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3441
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:839-A | codeforces | 839-A | Arya and Bran | https://codeforces.com/problemset/problem/839/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 14963
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:838-F | codeforces | 838-F | Expected Earnings | https://codeforces.com/problemset/problem/838/F | [] | null | null | stdin_stdout | 2,800 | {
"solved_count": 112
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:838-E | codeforces | 838-E | Convex Countour | https://codeforces.com/problemset/problem/838/E | [
"dp"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 414
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:838-D | codeforces | 838-D | Airplane Arrangements | https://codeforces.com/problemset/problem/838/D | [
"math",
"number theory"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1140
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:838-C | codeforces | 838-C | Future Failure | https://codeforces.com/problemset/problem/838/C | [
"dp",
"games"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 407
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:838-B | codeforces | 838-B | Diverging Directions | https://codeforces.com/problemset/problem/838/B | [
"data structures",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1097
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:838-A | codeforces | 838-A | Binary Blocks | https://codeforces.com/problemset/problem/838/A | [
"brute force"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 1058
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:837-G | codeforces | 837-G | Functions On The Segments | https://codeforces.com/problemset/problem/837/G | [
"data structures"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 915
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:837-F | codeforces | 837-F | Prefix Sums | https://codeforces.com/problemset/problem/837/F | [
"binary search",
"brute force",
"combinatorics",
"math",
"matrices"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1082
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:837-E | codeforces | 837-E | Vasya's Function | https://codeforces.com/problemset/problem/837/E | [
"binary search",
"implementation",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2078
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:837-D | codeforces | 837-D | Round Subset | https://codeforces.com/problemset/problem/837/D | [
"dp",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 7628
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:837-C | codeforces | 837-C | Two Seals | https://codeforces.com/problemset/problem/837/C | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4575
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:837-B | codeforces | 837-B | Flag of Berland | https://codeforces.com/problemset/problem/837/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4368
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:837-A | codeforces | 837-A | Text Volume | https://codeforces.com/problemset/problem/837/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 10128
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:835-F | codeforces | 835-F | Roads in the Kingdom | https://codeforces.com/problemset/problem/835/F | [
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1253
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:835-E | codeforces | 835-E | The penguin's game | https://codeforces.com/problemset/problem/835/E | [
"binary search",
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1354
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:835-D | codeforces | 835-D | Palindromic characteristics | https://codeforces.com/problemset/problem/835/D | [
"brute force",
"dp",
"hashing",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4693
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:835-C | codeforces | 835-C | Star sky | https://codeforces.com/problemset/problem/835/C | [
"dp",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9475
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:835-B | codeforces | 835-B | The number on the board | https://codeforces.com/problemset/problem/835/B | [
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 11437
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:835-A | codeforces | 835-A | Key races | https://codeforces.com/problemset/problem/835/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21765
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:834-B | codeforces | 834-B | The Festive Evening | https://codeforces.com/problemset/problem/834/B | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 9389
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:834-A | codeforces | 834-A | The Useless Toy | https://codeforces.com/problemset/problem/834/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 9110
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:833-E | codeforces | 833-E | Caramel Clouds | https://codeforces.com/problemset/problem/833/E | [
"data structures",
"dp",
"sortings"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 276
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:833-D | codeforces | 833-D | Red-Black Cobweb | https://codeforces.com/problemset/problem/833/D | [
"data structures",
"divide and conquer",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 487
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:833-C | codeforces | 833-C | Ever-Hungry Krakozyabra | https://codeforces.com/problemset/problem/833/C | [
"brute force",
"combinatorics",
"greedy",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 508
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:833-B | codeforces | 833-B | The Bakery | https://codeforces.com/problemset/problem/833/B | [
"binary search",
"data structures",
"divide and conquer",
"dp",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 6560
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:833-A | codeforces | 833-A | The Meaningless Game | https://codeforces.com/problemset/problem/833/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6573
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:832-E | codeforces | 832-E | Vasya and Shifts | https://codeforces.com/problemset/problem/832/E | [
"matrices"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 378
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:832-D | codeforces | 832-D | Misha, Grisha and Underground | https://codeforces.com/problemset/problem/832/D | [
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4538
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:832-C | codeforces | 832-C | Strange Radiation | https://codeforces.com/problemset/problem/832/C | [
"binary search",
"implementation",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 484
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:832-B | codeforces | 832-B | Petya and Exam | https://codeforces.com/problemset/problem/832/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4687
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:832-A | codeforces | 832-A | Sasha and Sticks | https://codeforces.com/problemset/problem/832/A | [
"games",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22181
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:831-C | codeforces | 831-C | Jury Marks | https://codeforces.com/problemset/problem/831/C | [
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5549
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:831-B | codeforces | 831-B | Keyboard Layouts | https://codeforces.com/problemset/problem/831/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 15713
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:831-A | codeforces | 831-A | Unimodal Array | https://codeforces.com/problemset/problem/831/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 11070
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:830-E | codeforces | 830-E | Perpetual Motion Machine | https://codeforces.com/problemset/problem/830/E | [
"constructive algorithms",
"dp",
"graphs",
"implementation",
"math",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 338
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:830-D | codeforces | 830-D | Singer House | https://codeforces.com/problemset/problem/830/D | [
"combinatorics",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 982
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:830-C | codeforces | 830-C | Bamboo Partition | https://codeforces.com/problemset/problem/830/C | [
"brute force",
"data structures",
"implementation",
"math",
"number theory",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1316
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:830-B | codeforces | 830-B | Cards Sorting | https://codeforces.com/problemset/problem/830/B | [
"data structures",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 3058
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:830-A | codeforces | 830-A | Office Keys | https://codeforces.com/problemset/problem/830/A | [
"binary search",
"brute force",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8265
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:828-B | codeforces | 828-B | Black Square | https://codeforces.com/problemset/problem/828/B | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 6130
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:828-A | codeforces | 828-A | Restaurant Tables | https://codeforces.com/problemset/problem/828/A | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8415
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:827-F | codeforces | 827-F | Dirty Arkady's Kitchen | https://codeforces.com/problemset/problem/827/F | [
"data structures",
"dp",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 584
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:827-E | codeforces | 827-E | Rusty String | https://codeforces.com/problemset/problem/827/E | [
"fft",
"math",
"strings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1224
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:827-D | codeforces | 827-D | Best Edge Weight | https://codeforces.com/problemset/problem/827/D | [
"data structures",
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1382
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:827-C | codeforces | 827-C | DNA Evolution | https://codeforces.com/problemset/problem/827/C | [
"data structures",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1792
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:827-B | codeforces | 827-B | High Load | https://codeforces.com/problemset/problem/827/B | [
"constructive algorithms",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3702
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:827-A | codeforces | 827-A | String Reconstruction | https://codeforces.com/problemset/problem/827/A | [
"data structures",
"greedy",
"sortings",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4341
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:825-G | codeforces | 825-G | Tree Queries | https://codeforces.com/problemset/problem/825/G | [
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1479
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:825-F | codeforces | 825-F | String Compression | https://codeforces.com/problemset/problem/825/F | [
"dp",
"hashing",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1986
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:825-E | codeforces | 825-E | Minimal Labels | https://codeforces.com/problemset/problem/825/E | [
"data structures",
"dfs and similar",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 4341
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:825-D | codeforces | 825-D | Suitable Replacement | https://codeforces.com/problemset/problem/825/D | [
"binary search",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 3740
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:825-C | codeforces | 825-C | Multi-judge Solving | https://codeforces.com/problemset/problem/825/C | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4891
} | 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.