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:1581-A | codeforces | 1581-A | CQXYM Count Permutations | https://codeforces.com/problemset/problem/1581/A | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 14353
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1580-F | codeforces | 1580-F | Problems for Codeforces | https://codeforces.com/problemset/problem/1580/F | [
"combinatorics",
"fft",
"math"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 255
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1580-E | codeforces | 1580-E | Railway Construction | https://codeforces.com/problemset/problem/1580/E | [
"brute force",
"constructive algorithms",
"data structures",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 126
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1580-D | codeforces | 1580-D | Subsequence | https://codeforces.com/problemset/problem/1580/D | [
"brute force",
"divide and conquer",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1183
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1580-C | codeforces | 1580-C | Train Maintenance | https://codeforces.com/problemset/problem/1580/C | [
"brute force",
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2333
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1580-B | codeforces | 1580-B | Mathematics Curriculum | https://codeforces.com/problemset/problem/1580/B | [
"brute force",
"combinatorics",
"dp",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1359
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1580-A | codeforces | 1580-A | Portal | https://codeforces.com/problemset/problem/1580/A | [
"brute force",
"data structures",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3945
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1579-G | codeforces | 1579-G | Minimal Coverage | https://codeforces.com/problemset/problem/1579/G | [
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2805
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1579-F | codeforces | 1579-F | Array Stabilization (AND version) | https://codeforces.com/problemset/problem/1579/F | [
"brute force",
"graphs",
"math",
"number theory",
"shortest paths"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5416
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1579-E2 | codeforces | 1579-E2 | Array Optimization by Deque | https://codeforces.com/problemset/problem/1579/E2 | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7509
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1579-E1 | codeforces | 1579-E1 | Permutation Minimization by Deque | https://codeforces.com/problemset/problem/1579/E1 | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 25729
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1579-D | codeforces | 1579-D | Productive Meeting | https://codeforces.com/problemset/problem/1579/D | [
"constructive algorithms",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 18647
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1579-C | codeforces | 1579-C | Ticks | https://codeforces.com/problemset/problem/1579/C | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 11743
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1579-B | codeforces | 1579-B | Shifting Sort | https://codeforces.com/problemset/problem/1579/B | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 19022
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1579-A | codeforces | 1579-A | Casimir's String Solitaire | https://codeforces.com/problemset/problem/1579/A | [
"math",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 42539
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1578-M | codeforces | 1578-M | The Mind | https://codeforces.com/problemset/problem/1578/M | [
"constructive algorithms",
"interactive",
"probabilities"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 545
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1578-L | codeforces | 1578-L | Labyrinth | https://codeforces.com/problemset/problem/1578/L | [
"binary search",
"dsu",
"greedy"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1459
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1578-K | codeforces | 1578-K | Kingdom of Islands | https://codeforces.com/problemset/problem/1578/K | [
"brute force",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 456
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1578-J | codeforces | 1578-J | Just Kingdom | https://codeforces.com/problemset/problem/1578/J | [
"brute force",
"data structures",
"dfs and similar"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 390
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1578-I | codeforces | 1578-I | Interactive Rays | https://codeforces.com/problemset/problem/1578/I | [
"geometry",
"interactive"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 91
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1578-H | codeforces | 1578-H | Higher Order Functions | https://codeforces.com/problemset/problem/1578/H | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2189
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1578-G | codeforces | 1578-G | Game of Chance | https://codeforces.com/problemset/problem/1578/G | [
"math",
"probabilities"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 100
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1578-F | codeforces | 1578-F | Framing Pictures | https://codeforces.com/problemset/problem/1578/F | [
"geometry"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 246
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1578-E | codeforces | 1578-E | Easy Scheduling | https://codeforces.com/problemset/problem/1578/E | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 4210
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1578-D | codeforces | 1578-D | Dragon Curve | https://codeforces.com/problemset/problem/1578/D | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 110
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1578-C | codeforces | 1578-C | Cactus Lady and her Cing | https://codeforces.com/problemset/problem/1578/C | [] | null | null | stdin_stdout | 3,500 | {
"solved_count": 32
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1578-B | codeforces | 1578-B | Building Forest Trails | https://codeforces.com/problemset/problem/1578/B | [
"data structures",
"dsu"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 496
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1578-A | codeforces | 1578-A | Anti-Tetris | https://codeforces.com/problemset/problem/1578/A | [
"constructive algorithms",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 473
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1576-A | codeforces | 1576-A | Communication Routing Challenge | https://codeforces.com/problemset/problem/1576/A | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 0
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1575-M | codeforces | 1575-M | Managing Telephone Poles | https://codeforces.com/problemset/problem/1575/M | [
"data structures",
"geometry"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 385
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1575-L | codeforces | 1575-L | Longest Array Deconstruction | https://codeforces.com/problemset/problem/1575/L | [
"data structures",
"divide and conquer",
"dp",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1767
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1575-K | codeforces | 1575-K | Knitting Batik | https://codeforces.com/problemset/problem/1575/K | [
"implementation",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 826
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1575-J | codeforces | 1575-J | Jeopardy of Dropped Balls | https://codeforces.com/problemset/problem/1575/J | [
"binary search",
"brute force",
"dsu",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4335
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1575-I | codeforces | 1575-I | Illusions of the Desert | https://codeforces.com/problemset/problem/1575/I | [
"data structures",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1063
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1575-H | codeforces | 1575-H | Holiday Wall Ornaments | https://codeforces.com/problemset/problem/1575/H | [
"dp",
"strings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 800
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1575-G | codeforces | 1575-G | GCD Festival | https://codeforces.com/problemset/problem/1575/G | [
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 877
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1575-F | codeforces | 1575-F | Finding Expected Value | https://codeforces.com/problemset/problem/1575/F | [
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 220
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1575-E | codeforces | 1575-E | Eye-Pleasing City Park Tour | https://codeforces.com/problemset/problem/1575/E | [
"data structures",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 435
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1575-D | codeforces | 1575-D | Divisible by Twenty-Five | https://codeforces.com/problemset/problem/1575/D | [
"brute force",
"dfs and similar",
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2914
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1575-C | codeforces | 1575-C | Cyclic Sum | https://codeforces.com/problemset/problem/1575/C | [
"data structures",
"fft",
"number theory"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 320
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1575-B | codeforces | 1575-B | Building an Amusement Park | https://codeforces.com/problemset/problem/1575/B | [
"binary search",
"geometry"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 565
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1575-A | codeforces | 1575-A | Another Sorting Problem | https://codeforces.com/problemset/problem/1575/A | [
"data structures",
"sortings",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 5281
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1574-F | codeforces | 1574-F | Occurrences | https://codeforces.com/problemset/problem/1574/F | [
"combinatorics",
"dfs and similar",
"dp",
"dsu",
"fft",
"graphs"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 789
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1574-E | codeforces | 1574-E | Coloring | https://codeforces.com/problemset/problem/1574/E | [
"combinatorics",
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1108
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1574-D | codeforces | 1574-D | The Strongest Build | https://codeforces.com/problemset/problem/1574/D | [
"binary search",
"brute force",
"data structures",
"dfs and similar",
"graphs",
"greedy",
"hashing",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4908
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1574-C | codeforces | 1574-C | Slay the Dragon | https://codeforces.com/problemset/problem/1574/C | [
"binary search",
"greedy",
"sortings",
"ternary search"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 18765
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1574-B | codeforces | 1574-B | Combinatorics Homework | https://codeforces.com/problemset/problem/1574/B | [
"combinatorics",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 18310
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1574-A | codeforces | 1574-A | Regular Bracket Sequences | https://codeforces.com/problemset/problem/1574/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23220
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1573-B | codeforces | 1573-B | Swaps | https://codeforces.com/problemset/problem/1573/B | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15680
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1573-A | codeforces | 1573-A | Countdown | https://codeforces.com/problemset/problem/1573/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22055
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1572-F | codeforces | 1572-F | Stations | https://codeforces.com/problemset/problem/1572/F | [
"data structures"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 595
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1572-E | codeforces | 1572-E | Polygon | https://codeforces.com/problemset/problem/1572/E | [
"binary search",
"dp",
"geometry"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 386
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1572-D | codeforces | 1572-D | Bridge Club | https://codeforces.com/problemset/problem/1572/D | [
"flows",
"graph matchings",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 683
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1572-C | codeforces | 1572-C | Paint | https://codeforces.com/problemset/problem/1572/C | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1779
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1572-B | codeforces | 1572-B | Xor of 3 | https://codeforces.com/problemset/problem/1572/B | [
"brute force",
"constructive algorithms",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2075
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1572-A | codeforces | 1572-A | Book | https://codeforces.com/problemset/problem/1572/A | [
"binary search",
"brute force",
"data structures",
"dp",
"graphs",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 10665
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1571-J | codeforces | 1571-J | Two Railroads | https://codeforces.com/problemset/problem/1571/J | [
"*special"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 53
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1571-I | codeforces | 1571-I | Physical Examination | https://codeforces.com/problemset/problem/1571/I | [
"*special",
"binary search",
"data structures"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 67
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1571-H | codeforces | 1571-H | Laser Beams | https://codeforces.com/problemset/problem/1571/H | [
"*special",
"geometry",
"probabilities"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 59
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1571-G | codeforces | 1571-G | A Battle Against a Dragon | https://codeforces.com/problemset/problem/1571/G | [
"*special",
"data structures",
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 89
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1571-F | codeforces | 1571-F | Kotlinforces | https://codeforces.com/problemset/problem/1571/F | [
"*special",
"constructive algorithms",
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 231
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1571-E | codeforces | 1571-E | Fix the String | https://codeforces.com/problemset/problem/1571/E | [
"*special",
"bitmasks",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 376
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1571-D | codeforces | 1571-D | Sweepstake | https://codeforces.com/problemset/problem/1571/D | [
"*special",
"brute force",
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 373
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1571-C | codeforces | 1571-C | Rhyme | https://codeforces.com/problemset/problem/1571/C | [
"*special",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 402
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1571-B | codeforces | 1571-B | Epic Novel | https://codeforces.com/problemset/problem/1571/B | [
"*special",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 762
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1571-A | codeforces | 1571-A | Sequence of Comparisons | https://codeforces.com/problemset/problem/1571/A | [
"*special"
] | null | null | stdin_stdout | 800 | {
"solved_count": 1658
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1569-F | codeforces | 1569-F | Palindromic Hamiltonian Path | https://codeforces.com/problemset/problem/1569/F | [
"brute force",
"dfs and similar",
"dp",
"graphs",
"hashing"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 517
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1569-E | codeforces | 1569-E | Playoff Restoration | https://codeforces.com/problemset/problem/1569/E | [
"bitmasks",
"brute force",
"hashing",
"implementation",
"meet-in-the-middle"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 905
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1569-D | codeforces | 1569-D | Inconvenient Pairs | https://codeforces.com/problemset/problem/1569/D | [
"binary search",
"data structures",
"implementation",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4622
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1569-C | codeforces | 1569-C | Jury Meeting | https://codeforces.com/problemset/problem/1569/C | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13493
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1569-B | codeforces | 1569-B | Chess Tournament | https://codeforces.com/problemset/problem/1569/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 19935
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1569-A | codeforces | 1569-A | Balanced Substring | https://codeforces.com/problemset/problem/1569/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26664
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1567-F | codeforces | 1567-F | One-Four Overload | https://codeforces.com/problemset/problem/1567/F | [
"2-sat",
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 889
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1567-E | codeforces | 1567-E | Non-Decreasing Dilemma | https://codeforces.com/problemset/problem/1567/E | [
"data structures",
"divide and conquer",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4376
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1567-D | codeforces | 1567-D | Expression Evaluation Error | https://codeforces.com/problemset/problem/1567/D | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4952
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1567-C | codeforces | 1567-C | Carrying Conundrum | https://codeforces.com/problemset/problem/1567/C | [
"bitmasks",
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 13294
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1567-B | codeforces | 1567-B | MEXor Mixup | https://codeforces.com/problemset/problem/1567/B | [
"bitmasks",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 35116
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1567-A | codeforces | 1567-A | Domino Disaster | https://codeforces.com/problemset/problem/1567/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31881
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1566-H | codeforces | 1566-H | Xor-quiz | https://codeforces.com/problemset/problem/1566/H | [
"constructive algorithms",
"dp",
"interactive",
"math",
"number theory"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 184
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1566-G | codeforces | 1566-G | Four Vertices | https://codeforces.com/problemset/problem/1566/G | [
"constructive algorithms",
"data structures",
"graphs",
"greedy",
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 444
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1566-F | codeforces | 1566-F | Points Movement | https://codeforces.com/problemset/problem/1566/F | [
"data structures",
"dp",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1272
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1566-E | codeforces | 1566-E | Buds Re-hanging | https://codeforces.com/problemset/problem/1566/E | [
"constructive algorithms",
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4482
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1566-D2 | codeforces | 1566-D2 | Seating Arrangements (hard version) | https://codeforces.com/problemset/problem/1566/D2 | [
"data structures",
"greedy",
"implementation",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8371
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1566-D1 | codeforces | 1566-D1 | Seating Arrangements (easy version) | https://codeforces.com/problemset/problem/1566/D1 | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 14780
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1566-C | codeforces | 1566-C | MAX-MEX Cut | https://codeforces.com/problemset/problem/1566/C | [
"bitmasks",
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 19223
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1566-B | codeforces | 1566-B | MIN-MEX Cut | https://codeforces.com/problemset/problem/1566/B | [
"bitmasks",
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21447
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1566-A | codeforces | 1566-A | Median Maximization | https://codeforces.com/problemset/problem/1566/A | [
"binary search",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25601
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1562-F | codeforces | 1562-F | Tubular Bells | https://codeforces.com/problemset/problem/1562/F | [
"interactive",
"math",
"number theory",
"probabilities"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 479
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1562-E | codeforces | 1562-E | Rescue Niwen! | https://codeforces.com/problemset/problem/1562/E | [
"dp",
"greedy",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1630
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1562-D2 | codeforces | 1562-D2 | Two Hundred Twenty One (hard version) | https://codeforces.com/problemset/problem/1562/D2 | [
"data structures",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2287
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1562-D1 | codeforces | 1562-D1 | Two Hundred Twenty One (easy version) | https://codeforces.com/problemset/problem/1562/D1 | [
"data structures",
"dp",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6693
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1562-C | codeforces | 1562-C | Rings | https://codeforces.com/problemset/problem/1562/C | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14388
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1562-B | codeforces | 1562-B | Scenes From a Memory | https://codeforces.com/problemset/problem/1562/B | [
"brute force",
"constructive algorithms",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 20683
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1562-A | codeforces | 1562-A | The Miracle and the Sleeper | https://codeforces.com/problemset/problem/1562/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26443
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1561-D1 | codeforces | 1561-D1 | Up the Strip (simplified version) | https://codeforces.com/problemset/problem/1561/D1 | [
"brute force",
"data structures",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6181
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1561-C | codeforces | 1561-C | Deep Down Below | https://codeforces.com/problemset/problem/1561/C | [
"binary search",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 22870
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1561-A | codeforces | 1561-A | Simply Strange Sort | https://codeforces.com/problemset/problem/1561/A | [
"brute force",
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17251
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1560-F2 | codeforces | 1560-F2 | Nearest Beautiful Number (hard version) | https://codeforces.com/problemset/problem/1560/F2 | [
"bitmasks",
"brute force",
"constructive algorithms",
"dfs and similar",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 5095
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1560-F1 | codeforces | 1560-F1 | Nearest Beautiful Number (easy version) | https://codeforces.com/problemset/problem/1560/F1 | [
"binary search",
"bitmasks",
"brute force",
"constructive algorithms",
"dfs and similar",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6833
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1560-E | codeforces | 1560-E | Polycarp and String Transformation | https://codeforces.com/problemset/problem/1560/E | [
"binary search",
"implementation",
"sortings",
"strings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8934
} | 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.