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:1890-A | codeforces | 1890-A | Doremy's Paint 3 | https://codeforces.com/problemset/problem/1890/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 58626
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1889-F | codeforces | 1889-F | Doremy's Average Tree | https://codeforces.com/problemset/problem/1889/F | [
"data structures",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 157
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1889-E | codeforces | 1889-E | Doremy's Swapping Trees | https://codeforces.com/problemset/problem/1889/E | [
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 180
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1889-D | codeforces | 1889-D | Game of Stacks | https://codeforces.com/problemset/problem/1889/D | [
"brute force",
"dfs and similar",
"graphs",
"implementation",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 941
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1889-C2 | codeforces | 1889-C2 | Doremy's Drying Plan (Hard Version) | https://codeforces.com/problemset/problem/1889/C2 | [
"data structures",
"dp"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1209
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1889-C1 | codeforces | 1889-C1 | Doremy's Drying Plan (Easy Version) | https://codeforces.com/problemset/problem/1889/C1 | [
"brute force",
"data structures",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3924
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1889-B | codeforces | 1889-B | Doremy's Connecting Plan | https://codeforces.com/problemset/problem/1889/B | [
"constructive algorithms",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8657
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1889-A | codeforces | 1889-A | Qingshan Loves Strings 2 | https://codeforces.com/problemset/problem/1889/A | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15372
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1887-F | codeforces | 1887-F | Minimum Segments | https://codeforces.com/problemset/problem/1887/F | [
"constructive algorithms"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 248
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1887-E | codeforces | 1887-E | Good Colorings | https://codeforces.com/problemset/problem/1887/E | [
"binary search",
"constructive algorithms",
"graphs",
"interactive"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 507
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1887-D | codeforces | 1887-D | Split | https://codeforces.com/problemset/problem/1887/D | [
"binary search",
"data structures",
"divide and conquer",
"dsu",
"math",
"trees",
"two pointers"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1263
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1887-C | codeforces | 1887-C | Minimum Array | https://codeforces.com/problemset/problem/1887/C | [
"binary search",
"brute force",
"constructive algorithms",
"data structures",
"greedy",
"hashing",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2304
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1887-B | codeforces | 1887-B | Time Travel | https://codeforces.com/problemset/problem/1887/B | [
"binary search",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3957
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1886-F | codeforces | 1886-F | Diamond Theft | https://codeforces.com/problemset/problem/1886/F | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 247
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1886-E | codeforces | 1886-E | I Wanna be the Team Leader | https://codeforces.com/problemset/problem/1886/E | [
"bitmasks",
"constructive algorithms",
"dp",
"greedy",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1860
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1886-D | codeforces | 1886-D | Monocarp and the Set | https://codeforces.com/problemset/problem/1886/D | [
"combinatorics",
"data structures",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4194
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1886-C | codeforces | 1886-C | Decreasing String | https://codeforces.com/problemset/problem/1886/C | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 16828
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1886-B | codeforces | 1886-B | Fear of the Dark | https://codeforces.com/problemset/problem/1886/B | [
"binary search",
"geometry",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 18078
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1886-A | codeforces | 1886-A | Sum of Three | https://codeforces.com/problemset/problem/1886/A | [
"brute force",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27787
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1885-A | codeforces | 1885-A | Deterministic Scheduling for Extended Reality over 5G and Beyond | https://codeforces.com/problemset/problem/1885/A | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 0
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1884-E | codeforces | 1884-E | Hard Design | https://codeforces.com/problemset/problem/1884/E | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 404
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1884-D | codeforces | 1884-D | Counting Rhyme | https://codeforces.com/problemset/problem/1884/D | [
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4154
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1884-C | codeforces | 1884-C | Medium Design | https://codeforces.com/problemset/problem/1884/C | [
"brute force",
"data structures",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7391
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1884-B | codeforces | 1884-B | Haunted House | https://codeforces.com/problemset/problem/1884/B | [
"binary search",
"greedy",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 14771
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1884-A | codeforces | 1884-A | Simple Design | https://codeforces.com/problemset/problem/1884/A | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19189
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1883-G2 | codeforces | 1883-G2 | Dances (Hard Version) | https://codeforces.com/problemset/problem/1883/G2 | [
"binary search",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6785
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1883-G1 | codeforces | 1883-G1 | Dances (Easy version) | https://codeforces.com/problemset/problem/1883/G1 | [
"binary search",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 19926
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1883-F | codeforces | 1883-F | You Are So Beautiful | https://codeforces.com/problemset/problem/1883/F | [
"data structures"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11920
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1883-E | codeforces | 1883-E | Look Back | https://codeforces.com/problemset/problem/1883/E | [
"bitmasks",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9975
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1883-D | codeforces | 1883-D | In Love | https://codeforces.com/problemset/problem/1883/D | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14631
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1883-C | codeforces | 1883-C | Raspberries | https://codeforces.com/problemset/problem/1883/C | [
"dp",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 51291
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1883-B | codeforces | 1883-B | Chemistry | https://codeforces.com/problemset/problem/1883/B | [
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 60992
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1883-A | codeforces | 1883-A | Morning | https://codeforces.com/problemset/problem/1883/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29392
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1882-E2 | codeforces | 1882-E2 | Two Permutations (Hard Version) | https://codeforces.com/problemset/problem/1882/E2 | [
"constructive algorithms"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 379
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1882-E1 | codeforces | 1882-E1 | Two Permutations (Easy Version) | https://codeforces.com/problemset/problem/1882/E1 | [
"brute force",
"constructive algorithms",
"greedy",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1233
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1882-D | codeforces | 1882-D | Tree XOR | https://codeforces.com/problemset/problem/1882/D | [
"bitmasks",
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7149
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1882-C | codeforces | 1882-C | Card Game | https://codeforces.com/problemset/problem/1882/C | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14513
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1882-B | codeforces | 1882-B | Sets and Union | https://codeforces.com/problemset/problem/1882/B | [
"bitmasks",
"brute force",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 17456
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1882-A | codeforces | 1882-A | Increasing Sequence | https://codeforces.com/problemset/problem/1882/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27372
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1881-G | codeforces | 1881-G | Anya and the Mysterious String | https://codeforces.com/problemset/problem/1881/G | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2900
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1881-F | codeforces | 1881-F | Minimum Maximum Distance | https://codeforces.com/problemset/problem/1881/F | [
"dfs and similar",
"dp",
"graphs",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9666
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1881-E | codeforces | 1881-E | Block Sequence | https://codeforces.com/problemset/problem/1881/E | [
"dp"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 24107
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1881-D | codeforces | 1881-D | Divide and Equalize | https://codeforces.com/problemset/problem/1881/D | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 28929
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1881-C | codeforces | 1881-C | Perfect Square | https://codeforces.com/problemset/problem/1881/C | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 19326
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1881-B | codeforces | 1881-B | Three Threadlets | https://codeforces.com/problemset/problem/1881/B | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 28823
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1881-A | codeforces | 1881-A | Don't Try to Count | https://codeforces.com/problemset/problem/1881/A | [
"brute force",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 61178
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1879-F | codeforces | 1879-F | Last Man Standing | https://codeforces.com/problemset/problem/1879/F | [
"brute force",
"data structures",
"number theory"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 610
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1879-E | codeforces | 1879-E | Interactive Game with Coloring | https://codeforces.com/problemset/problem/1879/E | [
"brute force",
"constructive algorithms",
"dfs and similar",
"graphs",
"implementation",
"interactive",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1584
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1879-D | codeforces | 1879-D | Sum of XOR Functions | https://codeforces.com/problemset/problem/1879/D | [
"bitmasks",
"combinatorics",
"divide and conquer",
"dp",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10721
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1879-C | codeforces | 1879-C | Make it Alternating | https://codeforces.com/problemset/problem/1879/C | [
"combinatorics",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 27565
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1879-B | codeforces | 1879-B | Chips on the Board | https://codeforces.com/problemset/problem/1879/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 25128
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1879-A | codeforces | 1879-A | Rigged! | https://codeforces.com/problemset/problem/1879/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24559
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1878-G | codeforces | 1878-G | wxhtzdy ORO Tree | https://codeforces.com/problemset/problem/1878/G | [
"binary search",
"bitmasks",
"brute force",
"data structures",
"dfs and similar",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1468
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1878-F | codeforces | 1878-F | Vasilije Loves Number Theory | https://codeforces.com/problemset/problem/1878/F | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4957
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1878-E | codeforces | 1878-E | Iva & Pav | https://codeforces.com/problemset/problem/1878/E | [
"binary search",
"bitmasks",
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 21356
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1878-D | codeforces | 1878-D | Reverse Madness | https://codeforces.com/problemset/problem/1878/D | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10159
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1878-C | codeforces | 1878-C | Vasilije in Cacak | https://codeforces.com/problemset/problem/1878/C | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 58878
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1878-B | codeforces | 1878-B | Aleksa and Stack | https://codeforces.com/problemset/problem/1878/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 34302
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1878-A | codeforces | 1878-A | How Much Does Daytona Cost? | https://codeforces.com/problemset/problem/1878/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 80511
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1877-C | codeforces | 1877-C | Joyboard | https://codeforces.com/problemset/problem/1877/C | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 12884
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1877-A | codeforces | 1877-A | Goals of Victory | https://codeforces.com/problemset/problem/1877/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 53834
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1876-G | codeforces | 1876-G | Clubstep | https://codeforces.com/problemset/problem/1876/G | [
"binary search",
"brute force",
"data structures",
"greedy",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 281
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1876-F | codeforces | 1876-F | Indefinite Clownfish | https://codeforces.com/problemset/problem/1876/F | [
"binary search",
"graphs"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 186
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1876-E | codeforces | 1876-E | Ball-Stackable | https://codeforces.com/problemset/problem/1876/E | [
"constructive algorithms",
"data structures",
"dp",
"trees"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 350
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1876-D | codeforces | 1876-D | Lexichromatography | https://codeforces.com/problemset/problem/1876/D | [
"combinatorics",
"dfs and similar",
"dsu",
"graphs",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1050
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1876-C | codeforces | 1876-C | Autosynthesis | https://codeforces.com/problemset/problem/1876/C | [
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2726
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1876-B | codeforces | 1876-B | Effects of Anti Pimples | https://codeforces.com/problemset/problem/1876/B | [
"combinatorics",
"number theory",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 10069
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1876-A | codeforces | 1876-A | Helmets in Night Light | https://codeforces.com/problemset/problem/1876/A | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 35782
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1875-D | codeforces | 1875-D | Jellyfish and Mex | https://codeforces.com/problemset/problem/1875/D | [
"dp"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11491
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1875-C | codeforces | 1875-C | Jellyfish and Green Apple | https://codeforces.com/problemset/problem/1875/C | [
"bitmasks",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 13930
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1875-A | codeforces | 1875-A | Jellyfish and Undertale | https://codeforces.com/problemset/problem/1875/A | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 48090
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1874-G | codeforces | 1874-G | Jellyfish and Inscryption | https://codeforces.com/problemset/problem/1874/G | [
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 159
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1874-F | codeforces | 1874-F | Jellyfish and OEIS | https://codeforces.com/problemset/problem/1874/F | [
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 477
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1874-E | codeforces | 1874-E | Jellyfish and Hack | https://codeforces.com/problemset/problem/1874/E | [
"dp",
"math"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 585
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1874-D | codeforces | 1874-D | Jellyfish and Miku | https://codeforces.com/problemset/problem/1874/D | [
"divide and conquer",
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 947
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1874-C | codeforces | 1874-C | Jellyfish and EVA | https://codeforces.com/problemset/problem/1874/C | [
"dp",
"graphs",
"greedy",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2202
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1874-B | codeforces | 1874-B | Jellyfish and Math | https://codeforces.com/problemset/problem/1874/B | [
"bitmasks",
"brute force",
"dfs and similar",
"dp",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1398
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1874-A | codeforces | 1874-A | Jellyfish and Game | https://codeforces.com/problemset/problem/1874/A | [
"brute force",
"games",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 19454
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1873-H | codeforces | 1873-H | Mad City | https://codeforces.com/problemset/problem/1873/H | [
"dfs and similar",
"dsu",
"games",
"graphs",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9591
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1873-G | codeforces | 1873-G | ABBC or BACB | https://codeforces.com/problemset/problem/1873/G | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 16983
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1873-F | codeforces | 1873-F | Money Trees | https://codeforces.com/problemset/problem/1873/F | [
"binary search",
"greedy",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 19842
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1873-E | codeforces | 1873-E | Building an Aquarium | https://codeforces.com/problemset/problem/1873/E | [
"binary search",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 44468
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1873-D | codeforces | 1873-D | 1D Eraser | https://codeforces.com/problemset/problem/1873/D | [
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 800 | {
"solved_count": 43305
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1873-C | codeforces | 1873-C | Target Practice | https://codeforces.com/problemset/problem/1873/C | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 71479
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1873-B | codeforces | 1873-B | Good Kid | https://codeforces.com/problemset/problem/1873/B | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 63154
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1873-A | codeforces | 1873-A | Short Sort | https://codeforces.com/problemset/problem/1873/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 71996
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1872-G | codeforces | 1872-G | Replace With Product | https://codeforces.com/problemset/problem/1872/G | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5059
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1872-F | codeforces | 1872-F | Selling a Menagerie | https://codeforces.com/problemset/problem/1872/F | [
"dfs and similar",
"dsu",
"graphs",
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7578
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1872-E | codeforces | 1872-E | Data Structures Fan | https://codeforces.com/problemset/problem/1872/E | [
"binary search",
"bitmasks",
"data structures",
"dp"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 21703
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1872-D | codeforces | 1872-D | Plus Minus Permutation | https://codeforces.com/problemset/problem/1872/D | [
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 39533
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1872-C | codeforces | 1872-C | Non-coprime Split | https://codeforces.com/problemset/problem/1872/C | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 26497
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1872-B | codeforces | 1872-B | The Corridor or There and Back Again | https://codeforces.com/problemset/problem/1872/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 30583
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1872-A | codeforces | 1872-A | Two Vessels | https://codeforces.com/problemset/problem/1872/A | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 43322
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1870-H | codeforces | 1870-H | Standard Graph Problem | https://codeforces.com/problemset/problem/1870/H | [
"data structures",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 122
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1870-G | codeforces | 1870-G | MEXanization | https://codeforces.com/problemset/problem/1870/G | [
"data structures"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 397
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1870-F | codeforces | 1870-F | Lazy Numbers | https://codeforces.com/problemset/problem/1870/F | [
"binary search",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 563
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1870-E | codeforces | 1870-E | Another MEX Problem | https://codeforces.com/problemset/problem/1870/E | [
"bitmasks",
"brute force",
"dp",
"shortest paths"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2976
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1870-D | codeforces | 1870-D | Prefix Purchase | https://codeforces.com/problemset/problem/1870/D | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8064
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1870-C | codeforces | 1870-C | Colorful Table | https://codeforces.com/problemset/problem/1870/C | [
"binary search",
"data structures",
"dp",
"implementation",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13153
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1870-B | codeforces | 1870-B | Friendly Arrays | https://codeforces.com/problemset/problem/1870/B | [
"bitmasks",
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 16257
} | 2026-06-01T05:00:40.145500+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.