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:1586-I | codeforces | 1586-I | Omkar and Mosaic | https://codeforces.com/problemset/problem/1586/I | [
"combinatorics",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 400
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1585-G | codeforces | 1585-G | Poachers | https://codeforces.com/problemset/problem/1585/G | [
"dp",
"games",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 346
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1585-F | codeforces | 1585-F | Non-equal Neighbours | https://codeforces.com/problemset/problem/1585/F | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1814
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1585-E | codeforces | 1585-E | Frequency Queries | https://codeforces.com/problemset/problem/1585/E | [
"data structures",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1269
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1585-D | codeforces | 1585-D | Yet Another Sorting Problem | https://codeforces.com/problemset/problem/1585/D | [
"data structures",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4555
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1585-C | codeforces | 1585-C | Minimize Distance | https://codeforces.com/problemset/problem/1585/C | [
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12975
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1585-B | codeforces | 1585-B | Array Eversion | https://codeforces.com/problemset/problem/1585/B | [
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 16475
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1585-A | codeforces | 1585-A | Life of a Flower | https://codeforces.com/problemset/problem/1585/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19249
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1584-G | codeforces | 1584-G | Eligible Segments | https://codeforces.com/problemset/problem/1584/G | [
"geometry"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 286
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1584-F | codeforces | 1584-F | Strange LCS | https://codeforces.com/problemset/problem/1584/F | [
"bitmasks",
"dp",
"graphs",
"greedy",
"strings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1214
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1584-E | codeforces | 1584-E | Game with Stones | https://codeforces.com/problemset/problem/1584/E | [
"binary search",
"data structures",
"games",
"greedy"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1540
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1584-D | codeforces | 1584-D | Guess the Permutation | https://codeforces.com/problemset/problem/1584/D | [
"binary search",
"combinatorics",
"interactive",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4074
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1584-C | codeforces | 1584-C | Two Arrays | https://codeforces.com/problemset/problem/1584/C | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 18009
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1584-B | codeforces | 1584-B | Coloring Rectangles | https://codeforces.com/problemset/problem/1584/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 14497
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1584-A | codeforces | 1584-A | Mathematical Addition | https://codeforces.com/problemset/problem/1584/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 15695
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1583-H | codeforces | 1583-H | Omkar and Tours | https://codeforces.com/problemset/problem/1583/H | [
"data structures",
"divide and conquer",
"sortings",
"trees"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 535
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1583-G | codeforces | 1583-G | Omkar and Time Travel | https://codeforces.com/problemset/problem/1583/G | [
"data structures",
"math"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 575
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1583-F | codeforces | 1583-F | Defender of Childhood Dreams | https://codeforces.com/problemset/problem/1583/F | [
"bitmasks",
"constructive algorithms",
"divide and conquer"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1686
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1583-E | codeforces | 1583-E | Moment of Bloom | https://codeforces.com/problemset/problem/1583/E | [
"constructive algorithms",
"dfs and similar",
"graph matchings",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2589
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1583-D | codeforces | 1583-D | Omkar and the Meaning of Life | https://codeforces.com/problemset/problem/1583/D | [
"constructive algorithms",
"greedy",
"interactive"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6013
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1583-C | codeforces | 1583-C | Omkar and Determination | https://codeforces.com/problemset/problem/1583/C | [
"data structures",
"dp"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7544
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1583-B | codeforces | 1583-B | Omkar and Heavenly Tree | https://codeforces.com/problemset/problem/1583/B | [
"constructive algorithms",
"trees"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 13510
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1583-A | codeforces | 1583-A | Windblume Ode | https://codeforces.com/problemset/problem/1583/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 14504
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1582-G | codeforces | 1582-G | Kuzya and Homework | https://codeforces.com/problemset/problem/1582/G | [
"data structures",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 757
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1582-F2 | codeforces | 1582-F2 | Korney Korneevich and XOR (hard version) | https://codeforces.com/problemset/problem/1582/F2 | [
"binary search",
"brute force",
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2221
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1582-F1 | codeforces | 1582-F1 | Korney Korneevich and XOR (easy version) | https://codeforces.com/problemset/problem/1582/F1 | [
"bitmasks",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6798
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1582-E | codeforces | 1582-E | Pchelyonok and Segments | https://codeforces.com/problemset/problem/1582/E | [
"binary search",
"data structures",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4356
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1582-D | codeforces | 1582-D | Vupsen, Pupsen and 0 | https://codeforces.com/problemset/problem/1582/D | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11786
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1582-C | codeforces | 1582-C | Grandma Capa Knits a Scarf | https://codeforces.com/problemset/problem/1582/C | [
"brute force",
"data structures",
"greedy",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 26409
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1582-B | codeforces | 1582-B | Luntik and Subsequences | https://codeforces.com/problemset/problem/1582/B | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 37944
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1582-A | codeforces | 1582-A | Luntik and Concerts | https://codeforces.com/problemset/problem/1582/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19947
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1581-B | codeforces | 1581-B | Diameter of Graph | https://codeforces.com/problemset/problem/1581/B | [
"constructive algorithms",
"graphs",
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 12798
} | 2026-11-02T05:37:07.883505+00:00 |
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": 14417
} | 2026-11-02T05:37:07.883505+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": 256
} | 2026-11-02T05:37:07.883505+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-11-02T05:37:07.883505+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": 1211
} | 2026-11-02T05:37:07.883505+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": 2501
} | 2026-11-02T05:37:07.883505+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": 1394
} | 2026-11-02T05:37:07.883505+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": 3968
} | 2026-11-02T05:37:07.883505+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": 2881
} | 2026-11-02T05:37:07.883505+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": 5506
} | 2026-11-02T05:37:07.883505+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": 7619
} | 2026-11-02T05:37:07.883505+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": 26281
} | 2026-11-02T05:37:07.883505+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": 18888
} | 2026-11-02T05:37:07.883505+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": 11839
} | 2026-11-02T05:37:07.883505+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": 19125
} | 2026-11-02T05:37:07.883505+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": 42837
} | 2026-11-02T05:37:07.883505+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": 560
} | 2026-11-02T05:37:07.883505+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": 1494
} | 2026-11-02T05:37:07.883505+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": 464
} | 2026-11-02T05:37:07.883505+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": 396
} | 2026-11-02T05:37:07.883505+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": 95
} | 2026-11-02T05:37:07.883505+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": 2225
} | 2026-11-02T05:37:07.883505+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": 110
} | 2026-11-02T05:37:07.883505+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": 258
} | 2026-11-02T05:37:07.883505+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": 4268
} | 2026-11-02T05:37:07.883505+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": 115
} | 2026-11-02T05:37:07.883505+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": 86
} | 2026-11-02T05:37:07.883505+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": 522
} | 2026-11-02T05:37:07.883505+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": 479
} | 2026-11-02T05:37:07.883505+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-11-02T05:37:07.883505+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": 394
} | 2026-11-02T05:37:07.883505+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": 1794
} | 2026-11-02T05:37:07.883505+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": 832
} | 2026-11-02T05:37:07.883505+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": 4355
} | 2026-11-02T05:37:07.883505+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": 1072
} | 2026-11-02T05:37:07.883505+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": 816
} | 2026-11-02T05:37:07.883505+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": 890
} | 2026-11-02T05:37:07.883505+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": 222
} | 2026-11-02T05:37:07.883505+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": 475
} | 2026-11-02T05:37:07.883505+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": 2941
} | 2026-11-02T05:37:07.883505+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": 328
} | 2026-11-02T05:37:07.883505+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": 567
} | 2026-11-02T05:37:07.883505+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": 5354
} | 2026-11-02T05:37:07.883505+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": 829
} | 2026-11-02T05:37:07.883505+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": 1141
} | 2026-11-02T05:37:07.883505+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": 4964
} | 2026-11-02T05:37:07.883505+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": 19067
} | 2026-11-02T05:37:07.883505+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": 18503
} | 2026-11-02T05:37:07.883505+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": 23428
} | 2026-11-02T05:37:07.883505+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": 15773
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1573-A | codeforces | 1573-A | Countdown | https://codeforces.com/problemset/problem/1573/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22095
} | 2026-11-02T05:37:07.883505+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": 604
} | 2026-11-02T05:37:07.883505+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": 396
} | 2026-11-02T05:37:07.883505+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": 737
} | 2026-11-02T05:37:07.883505+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": 1825
} | 2026-11-02T05:37:07.883505+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": 2294
} | 2026-11-02T05:37:07.883505+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": 10926
} | 2026-11-02T05:37:07.883505+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": 54
} | 2026-11-02T05:37:07.883505+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-11-02T05:37:07.883505+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-11-02T05:37:07.883505+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-11-02T05:37:07.883505+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-11-02T05:37:07.883505+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": 377
} | 2026-11-02T05:37:07.883505+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": 375
} | 2026-11-02T05:37:07.883505+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": 404
} | 2026-11-02T05:37:07.883505+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": 766
} | 2026-11-02T05:37:07.883505+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": 1676
} | 2026-11-02T05:37:07.883505+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": 531
} | 2026-11-02T05:37:07.883505+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": 921
} | 2026-11-02T05:37:07.883505+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.