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:879-B | codeforces | 879-B | Table Tennis | https://codeforces.com/problemset/problem/879/B | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 14840
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:879-A | codeforces | 879-A | Borya's Diagnosis | https://codeforces.com/problemset/problem/879/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 9663
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:878-E | codeforces | 878-E | Numbers on the blackboard | https://codeforces.com/problemset/problem/878/E | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 778
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:878-D | codeforces | 878-D | Magic Breeding | https://codeforces.com/problemset/problem/878/D | [
"bitmasks"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 961
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:878-C | codeforces | 878-C | Tournament | https://codeforces.com/problemset/problem/878/C | [
"data structures",
"graphs"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1075
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:878-B | codeforces | 878-B | Teams Formation | https://codeforces.com/problemset/problem/878/B | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1138
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:878-A | codeforces | 878-A | Short Program | https://codeforces.com/problemset/problem/878/A | [
"bitmasks",
"constructive algorithms"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6036
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:877-F | codeforces | 877-F | Ann and Books | https://codeforces.com/problemset/problem/877/F | [
"data structures",
"flows",
"hashing"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2465
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:877-E | codeforces | 877-E | Danil and a Part-time Job | https://codeforces.com/problemset/problem/877/E | [
"bitmasks",
"data structures",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5854
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:877-D | codeforces | 877-D | Olya and Energy Drinks | https://codeforces.com/problemset/problem/877/D | [
"data structures",
"dfs and similar",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 5289
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:877-C | codeforces | 877-C | Slava and tanks | https://codeforces.com/problemset/problem/877/C | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6088
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:877-B | codeforces | 877-B | Nikita and string | https://codeforces.com/problemset/problem/877/B | [
"brute force",
"dp"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12174
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:877-A | codeforces | 877-A | Alex and broken contest | https://codeforces.com/problemset/problem/877/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 11623
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:876-B | codeforces | 876-B | Divisiblity of Differences | https://codeforces.com/problemset/problem/876/B | [
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 10490
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:876-A | codeforces | 876-A | Trip For Meal | https://codeforces.com/problemset/problem/876/A | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 10152
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:875-F | codeforces | 875-F | Royal Questions | https://codeforces.com/problemset/problem/875/F | [
"dsu",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1667
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:875-E | codeforces | 875-E | Delivery Club | https://codeforces.com/problemset/problem/875/E | [
"binary search",
"data structures",
"dp"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1050
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:875-D | codeforces | 875-D | High Cry | https://codeforces.com/problemset/problem/875/D | [
"binary search",
"bitmasks",
"combinatorics",
"data structures",
"divide and conquer"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2594
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:875-C | codeforces | 875-C | National Property | https://codeforces.com/problemset/problem/875/C | [
"2-sat",
"dfs and similar",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2425
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:875-B | codeforces | 875-B | Sorting the Coins | https://codeforces.com/problemset/problem/875/B | [
"dsu",
"implementation",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 5409
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:875-A | codeforces | 875-A | Classroom Watch | https://codeforces.com/problemset/problem/875/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 10344
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:873-F | codeforces | 873-F | Forbidden Indices | https://codeforces.com/problemset/problem/873/F | [
"dsu",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1950
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:873-E | codeforces | 873-E | Awards For Contestants | https://codeforces.com/problemset/problem/873/E | [
"brute force",
"data structures",
"dp"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 822
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:873-D | codeforces | 873-D | Merge Sort | https://codeforces.com/problemset/problem/873/D | [
"constructive algorithms",
"divide and conquer"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4164
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:873-C | codeforces | 873-C | Strange Game On Matrix | https://codeforces.com/problemset/problem/873/C | [
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 3678
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:873-B | codeforces | 873-B | Balanced Substring | https://codeforces.com/problemset/problem/873/B | [
"dp",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9269
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:873-A | codeforces | 873-A | Chores | https://codeforces.com/problemset/problem/873/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 10729
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:871-E | codeforces | 871-E | Restore the Tree | https://codeforces.com/problemset/problem/871/E | [
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 244
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:870-F | codeforces | 870-F | Paths | https://codeforces.com/problemset/problem/870/F | [
"data structures",
"number theory"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 736
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:870-E | codeforces | 870-E | Points, Lines and Ready-made Titles | https://codeforces.com/problemset/problem/870/E | [
"dfs and similar",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1345
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:870-D | codeforces | 870-D | Something with XOR Queries | https://codeforces.com/problemset/problem/870/D | [
"brute force",
"interactive",
"probabilities"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1327
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:870-C | codeforces | 870-C | Maximum splitting | https://codeforces.com/problemset/problem/870/C | [
"dp",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9842
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:870-B | codeforces | 870-B | Maximum of Maximums of Minimums | https://codeforces.com/problemset/problem/870/B | [
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 10829
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:870-A | codeforces | 870-A | Search for Pretty Integers | https://codeforces.com/problemset/problem/870/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 10897
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:869-E | codeforces | 869-E | The Untended Antiquity | https://codeforces.com/problemset/problem/869/E | [
"data structures",
"hashing"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2355
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:869-D | codeforces | 869-D | The Overdosing Ubiquity | https://codeforces.com/problemset/problem/869/D | [
"brute force",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 372
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:869-C | codeforces | 869-C | The Intriguing Obsession | https://codeforces.com/problemset/problem/869/C | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5312
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:869-B | codeforces | 869-B | The Eternal Immortality | https://codeforces.com/problemset/problem/869/B | [
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 15875
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:869-A | codeforces | 869-A | The Artful Expedient | https://codeforces.com/problemset/problem/869/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 9842
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:868-G | codeforces | 868-G | El Toll Caves | https://codeforces.com/problemset/problem/868/G | [
"math"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 199
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:868-F | codeforces | 868-F | Yet Another Minimization Problem | https://codeforces.com/problemset/problem/868/F | [
"divide and conquer",
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 5497
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:868-E | codeforces | 868-E | Policeman and a Tree | https://codeforces.com/problemset/problem/868/E | [
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 569
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:868-D | codeforces | 868-D | Huge Strings | https://codeforces.com/problemset/problem/868/D | [
"bitmasks",
"brute force",
"dp",
"implementation",
"strings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1031
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:868-C | codeforces | 868-C | Qualification Rounds | https://codeforces.com/problemset/problem/868/C | [
"bitmasks",
"brute force",
"constructive algorithms",
"dp"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 5069
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:868-B | codeforces | 868-B | Race Against Time | https://codeforces.com/problemset/problem/868/B | [
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 3973
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:868-A | codeforces | 868-A | Bark to Unlock | https://codeforces.com/problemset/problem/868/A | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 10177
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:867-A | codeforces | 867-A | Between the Offices | https://codeforces.com/problemset/problem/867/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20907
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:865-G | codeforces | 865-G | Flowers and Chocolate | https://codeforces.com/problemset/problem/865/G | [
"combinatorics",
"math",
"matrices"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 339
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:865-F | codeforces | 865-F | Egg Roulette | https://codeforces.com/problemset/problem/865/F | [
"bitmasks",
"brute force",
"divide and conquer",
"math",
"meet-in-the-middle"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 81
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:865-E | codeforces | 865-E | Hex Dyslexia | https://codeforces.com/problemset/problem/865/E | [
"bitmasks",
"brute force",
"dp",
"graphs"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 164
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:865-D | codeforces | 865-D | Buy Low Sell High | https://codeforces.com/problemset/problem/865/D | [
"constructive algorithms",
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 8658
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:865-C | codeforces | 865-C | Gotta Go Fast | https://codeforces.com/problemset/problem/865/C | [
"binary search",
"dp"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 963
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:865-B | codeforces | 865-B | Ordering Pizza | https://codeforces.com/problemset/problem/865/B | [
"binary search",
"sortings",
"ternary search"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1955
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:865-A | codeforces | 865-A | Save the problem! | https://codeforces.com/problemset/problem/865/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 4448
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:864-F | codeforces | 864-F | Cities Excursions | https://codeforces.com/problemset/problem/864/F | [
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 706
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:864-E | codeforces | 864-E | Fire | https://codeforces.com/problemset/problem/864/E | [
"dp",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4825
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:864-D | codeforces | 864-D | Make a Permutation! | https://codeforces.com/problemset/problem/864/D | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6399
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:864-C | codeforces | 864-C | Bus | https://codeforces.com/problemset/problem/864/C | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6253
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:864-B | codeforces | 864-B | Polycarp and Letters | https://codeforces.com/problemset/problem/864/B | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 10076
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:864-A | codeforces | 864-A | Fair Game | https://codeforces.com/problemset/problem/864/A | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 12350
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:863-G | codeforces | 863-G | Graphic Settings | https://codeforces.com/problemset/problem/863/G | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 65
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:863-F | codeforces | 863-F | Almost Permutation | https://codeforces.com/problemset/problem/863/F | [
"flows"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1610
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:863-E | codeforces | 863-E | Turn Off The TV | https://codeforces.com/problemset/problem/863/E | [
"data structures",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4339
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:863-D | codeforces | 863-D | Yet Another Array Queries Problem | https://codeforces.com/problemset/problem/863/D | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3887
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:863-C | codeforces | 863-C | 1-2-3 | https://codeforces.com/problemset/problem/863/C | [
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2739
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:863-B | codeforces | 863-B | Kayaking | https://codeforces.com/problemset/problem/863/B | [
"brute force",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 11546
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:863-A | codeforces | 863-A | Quasi-palindrome | https://codeforces.com/problemset/problem/863/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 11069
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:862-F | codeforces | 862-F | Mahmoud and Ehab and the final stage | https://codeforces.com/problemset/problem/862/F | [
"data structures",
"strings"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 297
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:862-E | codeforces | 862-E | Mahmoud and Ehab and the function | https://codeforces.com/problemset/problem/862/E | [
"binary search",
"data structures",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2362
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:862-D | codeforces | 862-D | Mahmoud and Ehab and the binary string | https://codeforces.com/problemset/problem/862/D | [
"binary search",
"divide and conquer",
"interactive"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2098
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:862-C | codeforces | 862-C | Mahmoud and Ehab and the xor | https://codeforces.com/problemset/problem/862/C | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4561
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:862-B | codeforces | 862-B | Mahmoud and Ehab and the bipartiteness | https://codeforces.com/problemset/problem/862/B | [
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 27491
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:862-A | codeforces | 862-A | Mahmoud and Ehab and the MEX | https://codeforces.com/problemset/problem/862/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 10800
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:860-E | codeforces | 860-E | Arkady and a Nobody-men | https://codeforces.com/problemset/problem/860/E | [
"data structures",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 555
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:859-G | codeforces | 859-G | Circle of Numbers | https://codeforces.com/problemset/problem/859/G | [
"math"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 327
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:859-F | codeforces | 859-F | Ordering T-Shirts | https://codeforces.com/problemset/problem/859/F | [
"greedy"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 283
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:859-E | codeforces | 859-E | Desk Disorder | https://codeforces.com/problemset/problem/859/E | [
"combinatorics",
"dfs and similar",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2161
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:859-D | codeforces | 859-D | Third Month Insanity | https://codeforces.com/problemset/problem/859/D | [
"dp",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1158
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:859-C | codeforces | 859-C | Pie Rules | https://codeforces.com/problemset/problem/859/C | [
"dp",
"games"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6257
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:859-B | codeforces | 859-B | Lazy Security Guard | https://codeforces.com/problemset/problem/859/B | [
"brute force",
"geometry",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 7983
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:859-A | codeforces | 859-A | Declined Finalists | https://codeforces.com/problemset/problem/859/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 8708
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:858-F | codeforces | 858-F | Wizard's Tour | https://codeforces.com/problemset/problem/858/F | [
"constructive algorithms",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2168
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:858-E | codeforces | 858-E | Tests Renumeration | https://codeforces.com/problemset/problem/858/E | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 554
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:858-D | codeforces | 858-D | Polycarp's phone book | https://codeforces.com/problemset/problem/858/D | [
"data structures",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4402
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:858-C | codeforces | 858-C | Did you mean... | https://codeforces.com/problemset/problem/858/C | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 5923
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:858-B | codeforces | 858-B | Which floor? | https://codeforces.com/problemset/problem/858/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4129
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:858-A | codeforces | 858-A | k-rounding | https://codeforces.com/problemset/problem/858/A | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 9404
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:856-F | codeforces | 856-F | To Play or not to Play | https://codeforces.com/problemset/problem/856/F | [
"greedy"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 130
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:856-E | codeforces | 856-E | Satellites | https://codeforces.com/problemset/problem/856/E | [] | null | null | stdin_stdout | 3,100 | {
"solved_count": 179
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:856-D | codeforces | 856-D | Masha and Cactus | https://codeforces.com/problemset/problem/856/D | [
"dp",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 627
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:856-C | codeforces | 856-C | Eleventh Birthday | https://codeforces.com/problemset/problem/856/C | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 753
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:856-B | codeforces | 856-B | Similar Words | https://codeforces.com/problemset/problem/856/B | [
"dp",
"hashing",
"strings",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 655
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:856-A | codeforces | 856-A | Set Theory | https://codeforces.com/problemset/problem/856/A | [
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 1649
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:855-G | codeforces | 855-G | Harry Vs Voldemort | https://codeforces.com/problemset/problem/855/G | [
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 458
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:855-F | codeforces | 855-F | Nagini | https://codeforces.com/problemset/problem/855/F | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 682
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:855-E | codeforces | 855-E | Salazar Slytherin's Locket | https://codeforces.com/problemset/problem/855/E | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2279
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:855-D | codeforces | 855-D | Rowena Ravenclaw's Diadem | https://codeforces.com/problemset/problem/855/D | [
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 636
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:855-C | codeforces | 855-C | Helga Hufflepuff's Cup | https://codeforces.com/problemset/problem/855/C | [
"dp",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2476
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:855-B | codeforces | 855-B | Marvolo Gaunt's Ring | https://codeforces.com/problemset/problem/855/B | [
"brute force",
"data structures",
"dp"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 10053
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:855-A | codeforces | 855-A | Tom Riddle's Diary | https://codeforces.com/problemset/problem/855/A | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28333
} | 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.