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:1977-B | codeforces | 1977-B | Binary Colouring | https://codeforces.com/problemset/problem/1977/B | [
"bitmasks",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 20140
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1977-A | codeforces | 1977-A | Little Nikita | https://codeforces.com/problemset/problem/1977/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 39781
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1976-F | codeforces | 1976-F | Remove Bridges | https://codeforces.com/problemset/problem/1976/F | [
"data structures",
"dfs and similar",
"dp",
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 933
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1976-E | codeforces | 1976-E | Splittable Permutations | https://codeforces.com/problemset/problem/1976/E | [
"combinatorics",
"data structures",
"dfs and similar",
"greedy",
"math",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1345
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1976-D | codeforces | 1976-D | Invertible Bracket Sequences | https://codeforces.com/problemset/problem/1976/D | [
"binary search",
"combinatorics",
"data structures",
"divide and conquer",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5930
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1976-C | codeforces | 1976-C | Job Interview | https://codeforces.com/problemset/problem/1976/C | [
"binary search",
"dp",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12683
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1976-B | codeforces | 1976-B | Increase/Decrease/Copy | https://codeforces.com/problemset/problem/1976/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 25374
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1976-A | codeforces | 1976-A | Verify Password | https://codeforces.com/problemset/problem/1976/A | [
"implementation",
"sortings",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 32915
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1975-I | codeforces | 1975-I | Mind Bloom | https://codeforces.com/problemset/problem/1975/I | [
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 189
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1975-H | codeforces | 1975-H | 378QAQ and Core | https://codeforces.com/problemset/problem/1975/H | [
"greedy",
"strings"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 221
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1975-G | codeforces | 1975-G | Zimpha Fan Club | https://codeforces.com/problemset/problem/1975/G | [
"fft",
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 357
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1975-F | codeforces | 1975-F | Set | https://codeforces.com/problemset/problem/1975/F | [
"bitmasks",
"brute force",
"combinatorics",
"dfs and similar",
"divide and conquer",
"dp",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1084
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1975-E | codeforces | 1975-E | Chain Queries | https://codeforces.com/problemset/problem/1975/E | [
"binary search",
"data structures",
"dfs and similar",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2961
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1975-D | codeforces | 1975-D | Paint the Tree | https://codeforces.com/problemset/problem/1975/D | [
"brute force",
"dfs and similar",
"dp",
"greedy",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7668
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1975-C | codeforces | 1975-C | Chamo and Mocha's Array | https://codeforces.com/problemset/problem/1975/C | [
"binary search",
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17435
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1975-B | codeforces | 1975-B | 378QAQ and Mocha's Array | https://codeforces.com/problemset/problem/1975/B | [
"brute force",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 21313
} | 2026-08-10T02:20:32.917453+00:00 |
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": 20941
} | 2026-08-10T02:20:32.917453+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": 6191
} | 2026-08-10T02:20:32.917453+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": 4478
} | 2026-08-10T02:20:32.917453+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": 11863
} | 2026-08-10T02:20:32.917453+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": 18069
} | 2026-08-10T02:20:32.917453+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": 19373
} | 2026-08-10T02:20:32.917453+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": 34883
} | 2026-08-10T02:20:32.917453+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": 38347
} | 2026-08-10T02:20:32.917453+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": 357
} | 2026-08-10T02:20:32.917453+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": 1038
} | 2026-08-10T02:20:32.917453+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": 2332
} | 2026-08-10T02:20:32.917453+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": 9995
} | 2026-08-10T02:20:32.917453+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": 17125
} | 2026-08-10T02:20:32.917453+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": 28992
} | 2026-08-10T02:20:32.917453+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": 25809
} | 2026-08-10T02:20:32.917453+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": 26215
} | 2026-08-10T02:20:32.917453+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": 2916
} | 2026-08-10T02:20:32.917453+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": 11791
} | 2026-08-10T02:20:32.917453+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": 12786
} | 2026-08-10T02:20:32.917453+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": 18732
} | 2026-08-10T02:20:32.917453+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": 31083
} | 2026-08-10T02:20:32.917453+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": 42481
} | 2026-08-10T02:20:32.917453+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": 45571
} | 2026-08-10T02:20:32.917453+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": 60965
} | 2026-08-10T02:20:32.917453+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": 578
} | 2026-08-10T02:20:32.917453+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": 914
} | 2026-08-10T02:20:32.917453+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": 1973
} | 2026-08-10T02:20:32.917453+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": 558
} | 2026-08-10T02:20:32.917453+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": 538
} | 2026-08-10T02:20:32.917453+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": 660
} | 2026-08-10T02:20:32.917453+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": 1235
} | 2026-08-10T02:20:32.917453+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": 2179
} | 2026-08-10T02:20:32.917453+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": 3545
} | 2026-08-10T02:20:32.917453+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": 169
} | 2026-08-10T02:20:32.917453+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": 336
} | 2026-08-10T02:20:32.917453+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": 971
} | 2026-08-10T02:20:32.917453+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": 2536
} | 2026-08-10T02:20:32.917453+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": 4560
} | 2026-08-10T02:20:32.917453+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": 5232
} | 2026-08-10T02:20:32.917453+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": 737
} | 2026-08-10T02:20:32.917453+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": 1249
} | 2026-08-10T02:20:32.917453+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": 1678
} | 2026-08-10T02:20:32.917453+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": 689
} | 2026-08-10T02:20:32.917453+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": 621
} | 2026-08-10T02:20:32.917453+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": 7488
} | 2026-08-10T02:20:32.917453+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": 415
} | 2026-08-10T02:20:32.917453+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": 1926
} | 2026-08-10T02:20:32.917453+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": 5816
} | 2026-08-10T02:20:32.917453+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": 11924
} | 2026-08-10T02:20:32.917453+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": 22612
} | 2026-08-10T02:20:32.917453+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": 22330
} | 2026-08-10T02:20:32.917453+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": 2654
} | 2026-08-10T02:20:32.917453+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": 5453
} | 2026-08-10T02:20:32.917453+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": 7090
} | 2026-08-10T02:20:32.917453+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": 12889
} | 2026-08-10T02:20:32.917453+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": 17714
} | 2026-08-10T02:20:32.917453+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": 29728
} | 2026-08-10T02:20:32.917453+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": 31926
} | 2026-08-10T02:20:32.917453+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": 40020
} | 2026-08-10T02:20:32.917453+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": 104
} | 2026-08-10T02:20:32.917453+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": 237
} | 2026-08-10T02:20:32.917453+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": 475
} | 2026-08-10T02:20:32.917453+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": 1006
} | 2026-08-10T02:20:32.917453+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": 2313
} | 2026-08-10T02:20:32.917453+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": 4974
} | 2026-08-10T02:20:32.917453+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": 16376
} | 2026-08-10T02:20:32.917453+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": 15257
} | 2026-08-10T02:20:32.917453+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": 17495
} | 2026-08-10T02:20:32.917453+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": 19724
} | 2026-08-10T02:20:32.917453+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": 298
} | 2026-08-10T02:20:32.917453+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": 478
} | 2026-08-10T02:20:32.917453+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": 595
} | 2026-08-10T02:20:32.917453+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": 2480
} | 2026-08-10T02:20:32.917453+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": 8309
} | 2026-08-10T02:20:32.917453+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": 17223
} | 2026-08-10T02:20:32.917453+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": 48
} | 2026-08-10T02:20:32.917453+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": 53
} | 2026-08-10T02:20:32.917453+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": 97
} | 2026-08-10T02:20:32.917453+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": 131
} | 2026-08-10T02:20:32.917453+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": 267
} | 2026-08-10T02:20:32.917453+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": 337
} | 2026-08-10T02:20:32.917453+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": 736
} | 2026-08-10T02:20:32.917453+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": 1023
} | 2026-08-10T02:20:32.917453+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": 1208
} | 2026-08-10T02:20:32.917453+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.