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:1975-A | codeforces | 1975-A | Bazoka and Mocha's Array | https://codeforces.com/problemset/problem/1975/A | [
"brute force",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20666
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1974-G | codeforces | 1974-G | Money Buys Less Happiness Now | https://codeforces.com/problemset/problem/1974/G | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5851
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1974-F | codeforces | 1974-F | Cutting Game | https://codeforces.com/problemset/problem/1974/F | [
"binary search",
"brute force",
"data structures",
"implementation",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4381
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1974-E | codeforces | 1974-E | Money Buys Happiness | https://codeforces.com/problemset/problem/1974/E | [
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 11214
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1974-D | codeforces | 1974-D | Ingenuity-2 | https://codeforces.com/problemset/problem/1974/D | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 17725
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1974-C | codeforces | 1974-C | Beautiful Triple Pairs | https://codeforces.com/problemset/problem/1974/C | [
"combinatorics",
"data structures"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 18973
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1974-B | codeforces | 1974-B | Symmetric Encoding | https://codeforces.com/problemset/problem/1974/B | [
"implementation",
"sortings",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 34313
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1974-A | codeforces | 1974-A | Phone Desktop | https://codeforces.com/problemset/problem/1974/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 37818
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1973-F | codeforces | 1973-F | Maximum GCD Sum Queries | https://codeforces.com/problemset/problem/1973/F | [
"bitmasks",
"brute force",
"dp",
"implementation",
"number theory"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 319
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1973-E | codeforces | 1973-E | Cat, Fox and Swaps | https://codeforces.com/problemset/problem/1973/E | [
"graphs",
"math",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 987
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1973-D | codeforces | 1973-D | Cat, Fox and Maximum Array Split | https://codeforces.com/problemset/problem/1973/D | [
"brute force",
"interactive",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2243
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1973-C | codeforces | 1973-C | Cat, Fox and Double Maximum | https://codeforces.com/problemset/problem/1973/C | [
"constructive algorithms",
"greedy",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9821
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1973-B | codeforces | 1973-B | Cat, Fox and the Lonely Array | https://codeforces.com/problemset/problem/1973/B | [
"binary search",
"bitmasks",
"data structures",
"greedy",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16764
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1973-A | codeforces | 1973-A | Chess For Three | https://codeforces.com/problemset/problem/1973/A | [
"brute force",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 28430
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1972-B | codeforces | 1972-B | Coin Games | https://codeforces.com/problemset/problem/1972/B | [
"games"
] | null | null | stdin_stdout | 900 | {
"solved_count": 25318
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1972-A | codeforces | 1972-A | Contest Proposal | https://codeforces.com/problemset/problem/1972/A | [
"brute force",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25853
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1971-H | codeforces | 1971-H | ±1 | https://codeforces.com/problemset/problem/1971/H | [
"2-sat",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2704
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1971-G | codeforces | 1971-G | XOUR | https://codeforces.com/problemset/problem/1971/G | [
"data structures",
"dsu",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11436
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1971-F | codeforces | 1971-F | Circle Perimeter | https://codeforces.com/problemset/problem/1971/F | [
"binary search",
"brute force",
"dfs and similar",
"geometry",
"implementation",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12410
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1971-E | codeforces | 1971-E | Find the Car | https://codeforces.com/problemset/problem/1971/E | [
"binary search",
"math",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 18120
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1971-D | codeforces | 1971-D | Binary Cut | https://codeforces.com/problemset/problem/1971/D | [
"dp",
"greedy",
"implementation",
"sortings",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 30459
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1971-C | codeforces | 1971-C | Clock and Strings | https://codeforces.com/problemset/problem/1971/C | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 41324
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1971-B | codeforces | 1971-B | Different String | https://codeforces.com/problemset/problem/1971/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 44382
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1971-A | codeforces | 1971-A | My First Sorting Problem | https://codeforces.com/problemset/problem/1971/A | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 58915
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1970-G3 | codeforces | 1970-G3 | Min-Fund Prison (Hard) | https://codeforces.com/problemset/problem/1970/G3 | [
"bitmasks",
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 537
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1970-G2 | codeforces | 1970-G2 | Min-Fund Prison (Medium) | https://codeforces.com/problemset/problem/1970/G2 | [
"brute force",
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 864
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1970-G1 | codeforces | 1970-G1 | Min-Fund Prison (Easy) | https://codeforces.com/problemset/problem/1970/G1 | [
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1896
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1970-F3 | codeforces | 1970-F3 | Playing Quidditch (Hard) | https://codeforces.com/problemset/problem/1970/F3 | [
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 532
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1970-F2 | codeforces | 1970-F2 | Playing Quidditch (Medium) | https://codeforces.com/problemset/problem/1970/F2 | [
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 510
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1970-F1 | codeforces | 1970-F1 | Playing Quidditch (Easy) | https://codeforces.com/problemset/problem/1970/F1 | [
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 629
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1970-E3 | codeforces | 1970-E3 | Trails (Hard) | https://codeforces.com/problemset/problem/1970/E3 | [
"dp",
"matrices"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1165
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1970-E2 | codeforces | 1970-E2 | Trails (Medium) | https://codeforces.com/problemset/problem/1970/E2 | [
"dp",
"matrices"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2038
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1970-E1 | codeforces | 1970-E1 | Trails (Easy) | https://codeforces.com/problemset/problem/1970/E1 | [
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3410
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1970-D3 | codeforces | 1970-D3 | Arithmancy (Hard) | https://codeforces.com/problemset/problem/1970/D3 | [
"interactive"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 160
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1970-D2 | codeforces | 1970-D2 | Arithmancy (Medium) | https://codeforces.com/problemset/problem/1970/D2 | [
"constructive algorithms",
"interactive",
"probabilities",
"strings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 306
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1970-D1 | codeforces | 1970-D1 | Arithmancy (Easy) | https://codeforces.com/problemset/problem/1970/D1 | [
"brute force",
"constructive algorithms",
"interactive",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 934
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1970-C3 | codeforces | 1970-C3 | Game on Tree (Hard) | https://codeforces.com/problemset/problem/1970/C3 | [
"dfs and similar",
"dp",
"games",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2406
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1970-C2 | codeforces | 1970-C2 | Game on Tree (Medium) | https://codeforces.com/problemset/problem/1970/C2 | [
"dfs and similar",
"dp",
"games",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4311
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1970-C1 | codeforces | 1970-C1 | Game on Tree (Easy) | https://codeforces.com/problemset/problem/1970/C1 | [
"games"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 4989
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1970-B3 | codeforces | 1970-B3 | Exact Neighbours (Hard) | https://codeforces.com/problemset/problem/1970/B3 | [
"constructive algorithms"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 711
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1970-B2 | codeforces | 1970-B2 | Exact Neighbours (Medium) | https://codeforces.com/problemset/problem/1970/B2 | [
"constructive algorithms"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1205
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1970-B1 | codeforces | 1970-B1 | Exact Neighbours (Easy) | https://codeforces.com/problemset/problem/1970/B1 | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1632
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1970-A3 | codeforces | 1970-A3 | Balanced Unshuffle (Hard) | https://codeforces.com/problemset/problem/1970/A3 | [
"constructive algorithms",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 661
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1970-A2 | codeforces | 1970-A2 | Balanced Unshuffle (Medium) | https://codeforces.com/problemset/problem/1970/A2 | [
"brute force",
"constructive algorithms",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 597
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1970-A1 | codeforces | 1970-A1 | Balanced Shuffle (Easy) | https://codeforces.com/problemset/problem/1970/A1 | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 7166
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1969-F | codeforces | 1969-F | Card Pairing | https://codeforces.com/problemset/problem/1969/F | [
"dp",
"greedy",
"hashing",
"implementation"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 400
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1969-E | codeforces | 1969-E | Unique Array | https://codeforces.com/problemset/problem/1969/E | [
"binary search",
"data structures",
"divide and conquer",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1837
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1969-D | codeforces | 1969-D | Shop Game | https://codeforces.com/problemset/problem/1969/D | [
"data structures",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5677
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1969-C | codeforces | 1969-C | Minimizing the Sum | https://codeforces.com/problemset/problem/1969/C | [
"dp",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11422
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1969-B | codeforces | 1969-B | Shifts and Sorting | https://codeforces.com/problemset/problem/1969/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 22260
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1969-A | codeforces | 1969-A | Two Friends | https://codeforces.com/problemset/problem/1969/A | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21995
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1968-G2 | codeforces | 1968-G2 | Division + LCP (hard version) | https://codeforces.com/problemset/problem/1968/G2 | [
"binary search",
"brute force",
"data structures",
"dp",
"hashing",
"math",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2489
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1968-G1 | codeforces | 1968-G1 | Division + LCP (easy version) | https://codeforces.com/problemset/problem/1968/G1 | [
"binary search",
"data structures",
"dp",
"hashing",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5260
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1968-F | codeforces | 1968-F | Equal XOR Segments | https://codeforces.com/problemset/problem/1968/F | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6889
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1968-E | codeforces | 1968-E | Cells Arrangement | https://codeforces.com/problemset/problem/1968/E | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12592
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1968-D | codeforces | 1968-D | Permutation Game | https://codeforces.com/problemset/problem/1968/D | [
"brute force",
"dfs and similar",
"games",
"graphs",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 17351
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1968-C | codeforces | 1968-C | Assembly via Remainders | https://codeforces.com/problemset/problem/1968/C | [
"constructive algorithms",
"number theory"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 29117
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1968-B | codeforces | 1968-B | Prefiquence | https://codeforces.com/problemset/problem/1968/B | [
"greedy",
"two pointers"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31326
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1968-A | codeforces | 1968-A | Maximize? | https://codeforces.com/problemset/problem/1968/A | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 39302
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1967-F | codeforces | 1967-F | Next and Prev | https://codeforces.com/problemset/problem/1967/F | [
"brute force",
"data structures",
"implementation"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 97
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1967-E2 | codeforces | 1967-E2 | Again Counting Arrays (Hard Version) | https://codeforces.com/problemset/problem/1967/E2 | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 212
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1967-E1 | codeforces | 1967-E1 | Again Counting Arrays (Easy Version) | https://codeforces.com/problemset/problem/1967/E1 | [
"combinatorics",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 376
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1967-D | codeforces | 1967-D | Long Way to be Non-decreasing | https://codeforces.com/problemset/problem/1967/D | [
"binary search",
"dfs and similar",
"graphs",
"implementation",
"shortest paths",
"two pointers"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 970
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1967-C | codeforces | 1967-C | Fenwick Tree | https://codeforces.com/problemset/problem/1967/C | [
"bitmasks",
"brute force",
"combinatorics",
"data structures",
"dp",
"math",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2223
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1967-B2 | codeforces | 1967-B2 | Reverse Card (Hard Version) | https://codeforces.com/problemset/problem/1967/B2 | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4832
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1967-B1 | codeforces | 1967-B1 | Reverse Card (Easy Version) | https://codeforces.com/problemset/problem/1967/B1 | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15987
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1967-A | codeforces | 1967-A | Permutation Counting | https://codeforces.com/problemset/problem/1967/A | [
"binary search",
"greedy",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14895
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1966-B | codeforces | 1966-B | Rectangle Filling | https://codeforces.com/problemset/problem/1966/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 17164
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1966-A | codeforces | 1966-A | Card Exchange | https://codeforces.com/problemset/problem/1966/A | [
"constructive algorithms",
"games",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19537
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1965-F | codeforces | 1965-F | Conference | https://codeforces.com/problemset/problem/1965/F | [
"data structures",
"flows"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 277
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1965-E | codeforces | 1965-E | Connected Cubes | https://codeforces.com/problemset/problem/1965/E | [
"constructive algorithms",
"games"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 461
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1965-D | codeforces | 1965-D | Missing Subarray Sum | https://codeforces.com/problemset/problem/1965/D | [
"constructive algorithms"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 536
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1965-C | codeforces | 1965-C | Folding Strip | https://codeforces.com/problemset/problem/1965/C | [
"constructive algorithms",
"greedy",
"strings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2343
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1965-B | codeforces | 1965-B | Missing Subsequence Sum | https://codeforces.com/problemset/problem/1965/B | [
"bitmasks",
"constructive algorithms",
"greedy",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8081
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1965-A | codeforces | 1965-A | Everything Nim | https://codeforces.com/problemset/problem/1965/A | [
"games",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16632
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1958-J | codeforces | 1958-J | Necromancer | https://codeforces.com/problemset/problem/1958/J | [
"*special"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 44
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1958-I | codeforces | 1958-I | Equal Trees | https://codeforces.com/problemset/problem/1958/I | [
"*special",
"graphs",
"meet-in-the-middle"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 50
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1958-H | codeforces | 1958-H | Composite Spells | https://codeforces.com/problemset/problem/1958/H | [
"*special",
"dp"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 91
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1958-G | codeforces | 1958-G | Observation Towers | https://codeforces.com/problemset/problem/1958/G | [
"*special"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 126
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1958-F | codeforces | 1958-F | Narrow Paths | https://codeforces.com/problemset/problem/1958/F | [
"*special",
"combinatorics"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 251
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1958-E | codeforces | 1958-E | Yet Another Permutation Constructive | https://codeforces.com/problemset/problem/1958/E | [
"*special",
"constructive algorithms"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 329
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1958-D | codeforces | 1958-D | Staircase | https://codeforces.com/problemset/problem/1958/D | [
"*special"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 708
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1958-C | codeforces | 1958-C | Firewood | https://codeforces.com/problemset/problem/1958/C | [
"*special"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 990
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1958-B | codeforces | 1958-B | Clock in the Pool | https://codeforces.com/problemset/problem/1958/B | [
"*special",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 1182
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1958-A | codeforces | 1958-A | 1-3-5 | https://codeforces.com/problemset/problem/1958/A | [
"*special",
"dp"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 2562
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1957-F2 | codeforces | 1957-F2 | Frequency Mismatch (Hard Version) | https://codeforces.com/problemset/problem/1957/F2 | [
"binary search",
"data structures",
"dfs and similar",
"hashing",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 602
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1957-F1 | codeforces | 1957-F1 | Frequency Mismatch (Easy Version) | https://codeforces.com/problemset/problem/1957/F1 | [
"binary search",
"data structures",
"divide and conquer",
"hashing",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 657
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1957-E | codeforces | 1957-E | Carousel of Combinations | https://codeforces.com/problemset/problem/1957/E | [
"brute force",
"combinatorics",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1614
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1957-D | codeforces | 1957-D | A BIT of an Inequality | https://codeforces.com/problemset/problem/1957/D | [
"bitmasks",
"brute force",
"dp",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5770
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1957-C | codeforces | 1957-C | How Does the Rook Move? | https://codeforces.com/problemset/problem/1957/C | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11888
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1957-B | codeforces | 1957-B | A BIT of a Construction | https://codeforces.com/problemset/problem/1957/B | [
"bitmasks",
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 20346
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1957-A | codeforces | 1957-A | Stickogon | https://codeforces.com/problemset/problem/1957/A | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25640
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1956-F | codeforces | 1956-F | Nene and the Passing Game | https://codeforces.com/problemset/problem/1956/F | [
"constructive algorithms",
"data structures",
"dsu",
"graphs",
"sortings"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 479
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1956-E2 | codeforces | 1956-E2 | Nene vs. Monsters (Hard Version) | https://codeforces.com/problemset/problem/1956/E2 | [
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1113
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1956-E1 | codeforces | 1956-E1 | Nene vs. Monsters (Easy Version) | https://codeforces.com/problemset/problem/1956/E1 | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1666
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1956-D | codeforces | 1956-D | Nene and the Mex Operator | https://codeforces.com/problemset/problem/1956/D | [
"bitmasks",
"brute force",
"constructive algorithms",
"divide and conquer",
"dp",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4750
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1956-C | codeforces | 1956-C | Nene's Magical Matrix | https://codeforces.com/problemset/problem/1956/C | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 15093
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1956-B | codeforces | 1956-B | Nene and the Card Game | https://codeforces.com/problemset/problem/1956/B | [
"games",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22887
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1956-A | codeforces | 1956-A | Nene's Game | https://codeforces.com/problemset/problem/1956/A | [
"binary search",
"brute force",
"data structures",
"games",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24128
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1955-H | codeforces | 1955-H | The Most Reckless Defense | https://codeforces.com/problemset/problem/1955/H | [
"bitmasks",
"brute force",
"constructive algorithms",
"dp",
"flows",
"graph matchings",
"shortest paths"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1512
} | 2026-04-13T03:38:27.662191+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.