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: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": 7577
} | 2026-11-02T05:37:07.883505+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": 14757
} | 2026-11-02T05:37:07.883505+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": 17787
} | 2026-11-02T05:37:07.883505+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": 27559
} | 2026-11-02T05:37:07.883505+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": 3076
} | 2026-11-02T05:37:07.883505+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": 10292
} | 2026-11-02T05:37:07.883505+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": 26914
} | 2026-11-02T05:37:07.883505+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": 32009
} | 2026-11-02T05:37:07.883505+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": 19976
} | 2026-11-02T05:37:07.883505+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": 29368
} | 2026-11-02T05:37:07.883505+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": 69461
} | 2026-11-02T05:37:07.883505+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": 678
} | 2026-11-02T05:37:07.883505+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": 1651
} | 2026-11-02T05:37:07.883505+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": 11553
} | 2026-11-02T05:37:07.883505+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": 30380
} | 2026-11-02T05:37:07.883505+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": 25583
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1879-A | codeforces | 1879-A | Rigged! | https://codeforces.com/problemset/problem/1879/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24797
} | 2026-11-02T05:37:07.883505+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": 1538
} | 2026-11-02T05:37:07.883505+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": 5087
} | 2026-11-02T05:37:07.883505+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": 23579
} | 2026-11-02T05:37:07.883505+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": 10392
} | 2026-11-02T05:37:07.883505+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": 65972
} | 2026-11-02T05:37:07.883505+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": 34744
} | 2026-11-02T05:37:07.883505+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": 90461
} | 2026-11-02T05:37:07.883505+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": 13306
} | 2026-11-02T05:37:07.883505+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": 62094
} | 2026-11-02T05:37:07.883505+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": 320
} | 2026-11-02T05:37:07.883505+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": 249
} | 2026-11-02T05:37:07.883505+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": 379
} | 2026-11-02T05:37:07.883505+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": 1117
} | 2026-11-02T05:37:07.883505+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": 2905
} | 2026-11-02T05:37:07.883505+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": 10403
} | 2026-11-02T05:37:07.883505+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": 40995
} | 2026-11-02T05:37:07.883505+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": 11998
} | 2026-11-02T05:37:07.883505+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": 14239
} | 2026-11-02T05:37:07.883505+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": 54264
} | 2026-11-02T05:37:07.883505+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": 173
} | 2026-11-02T05:37:07.883505+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": 523
} | 2026-11-02T05:37:07.883505+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": 812
} | 2026-11-02T05:37:07.883505+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": 1054
} | 2026-11-02T05:37:07.883505+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": 2279
} | 2026-11-02T05:37:07.883505+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": 1464
} | 2026-11-02T05:37:07.883505+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": 19893
} | 2026-11-02T05:37:07.883505+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": 9967
} | 2026-11-02T05:37:07.883505+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": 17631
} | 2026-11-02T05:37:07.883505+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": 20878
} | 2026-11-02T05:37:07.883505+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": 49470
} | 2026-11-02T05:37:07.883505+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": 45075
} | 2026-11-02T05:37:07.883505+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": 80083
} | 2026-11-02T05:37:07.883505+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": 65778
} | 2026-11-02T05:37:07.883505+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": 75453
} | 2026-11-02T05:37:07.883505+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": 5234
} | 2026-11-02T05:37:07.883505+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": 7853
} | 2026-11-02T05:37:07.883505+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": 23720
} | 2026-11-02T05:37:07.883505+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": 43661
} | 2026-11-02T05:37:07.883505+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": 27093
} | 2026-11-02T05:37:07.883505+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": 30964
} | 2026-11-02T05:37:07.883505+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": 44092
} | 2026-11-02T05:37:07.883505+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": 131
} | 2026-11-02T05:37:07.883505+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": 440
} | 2026-11-02T05:37:07.883505+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": 588
} | 2026-11-02T05:37:07.883505+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": 3144
} | 2026-11-02T05:37:07.883505+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": 8263
} | 2026-11-02T05:37:07.883505+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": 13492
} | 2026-11-02T05:37:07.883505+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": 16771
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1870-A | codeforces | 1870-A | MEXanized Array | https://codeforces.com/problemset/problem/1870/A | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20445
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1869-B | codeforces | 1869-B | 2D Traveling | https://codeforces.com/problemset/problem/1869/B | [
"geometry",
"math",
"shortest paths",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 28976
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1869-A | codeforces | 1869-A | Make It Zero | https://codeforces.com/problemset/problem/1869/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 900 | {
"solved_count": 46030
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1868-F | codeforces | 1868-F | LIS? | https://codeforces.com/problemset/problem/1868/F | [
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 145
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1868-E | codeforces | 1868-E | Min-Sum-Max | https://codeforces.com/problemset/problem/1868/E | [
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 135
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1868-D | codeforces | 1868-D | Flower-like Pseudotree | https://codeforces.com/problemset/problem/1868/D | [
"constructive algorithms",
"graphs",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 445
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1868-C | codeforces | 1868-C | Travel Plan | https://codeforces.com/problemset/problem/1868/C | [
"combinatorics",
"dp",
"implementation",
"math",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1426
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1868-B2 | codeforces | 1868-B2 | Candy Party (Hard Version) | https://codeforces.com/problemset/problem/1868/B2 | [
"bitmasks",
"constructive algorithms",
"dp",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2835
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1868-B1 | codeforces | 1868-B1 | Candy Party (Easy Version) | https://codeforces.com/problemset/problem/1868/B1 | [
"bitmasks",
"constructive algorithms",
"graphs",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8532
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1868-A | codeforces | 1868-A | Fill in the Matrix | https://codeforces.com/problemset/problem/1868/A | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13912
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1867-F | codeforces | 1867-F | Most Different Tree | https://codeforces.com/problemset/problem/1867/F | [
"brute force",
"constructive algorithms",
"dfs and similar",
"greedy",
"hashing"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 628
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1867-E2 | codeforces | 1867-E2 | Salyg1n and Array (hard version) | https://codeforces.com/problemset/problem/1867/E2 | [
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3867
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1867-E1 | codeforces | 1867-E1 | Salyg1n and Array (simple version) | https://codeforces.com/problemset/problem/1867/E1 | [
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4471
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1867-D | codeforces | 1867-D | Cyclic Operations | https://codeforces.com/problemset/problem/1867/D | [
"brute force",
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7053
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1867-C | codeforces | 1867-C | Salyg1n and the MEX Game | https://codeforces.com/problemset/problem/1867/C | [
"constructive algorithms",
"data structures",
"games",
"greedy",
"interactive"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12909
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1867-B | codeforces | 1867-B | XOR Palindromes | https://codeforces.com/problemset/problem/1867/B | [
"bitmasks",
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 18909
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1867-A | codeforces | 1867-A | green_gold_dog, array and permutation | https://codeforces.com/problemset/problem/1867/A | [
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21276
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1866-M | codeforces | 1866-M | Mighty Rock Tower | https://codeforces.com/problemset/problem/1866/M | [
"brute force",
"combinatorics",
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1034
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1866-L | codeforces | 1866-L | Lihmuf Balling | https://codeforces.com/problemset/problem/1866/L | [
"binary search",
"brute force",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 921
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1866-K | codeforces | 1866-K | Keen Tree Calculation | https://codeforces.com/problemset/problem/1866/K | [
"binary search",
"data structures",
"dp",
"geometry",
"graphs",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 604
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1866-J | codeforces | 1866-J | Jackets and Packets | https://codeforces.com/problemset/problem/1866/J | [
"dp"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 456
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1866-I | codeforces | 1866-I | Imagination Castle | https://codeforces.com/problemset/problem/1866/I | [
"dp",
"games",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 988
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1866-H | codeforces | 1866-H | Happy Sets | https://codeforces.com/problemset/problem/1866/H | [
"combinatorics"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1983
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1866-G | codeforces | 1866-G | Grouped Carriages | https://codeforces.com/problemset/problem/1866/G | [
"binary search",
"data structures",
"dp",
"flows",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2344
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1866-F | codeforces | 1866-F | Freak Joker Process | https://codeforces.com/problemset/problem/1866/F | [
"binary search",
"data structures",
"sortings"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 210
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1866-E | codeforces | 1866-E | Elevators of Tamem | https://codeforces.com/problemset/problem/1866/E | [
"dp"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 580
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1866-D | codeforces | 1866-D | Digital Wallet | https://codeforces.com/problemset/problem/1866/D | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1628
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1866-C | codeforces | 1866-C | Completely Searching for Inversions | https://codeforces.com/problemset/problem/1866/C | [
"dfs and similar",
"dp",
"graphs"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3498
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1866-B | codeforces | 1866-B | Battling with Numbers | https://codeforces.com/problemset/problem/1866/B | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 9583
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1866-A | codeforces | 1866-A | Ambitious Kid | https://codeforces.com/problemset/problem/1866/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 61175
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1864-I | codeforces | 1864-I | Future Dominators | https://codeforces.com/problemset/problem/1864/I | [
"graphs",
"greedy"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 112
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1864-H | codeforces | 1864-H | Asterism Stream | https://codeforces.com/problemset/problem/1864/H | [
"dp",
"math",
"matrices"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 640
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1864-G | codeforces | 1864-G | Magic Square | https://codeforces.com/problemset/problem/1864/G | [
"combinatorics",
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 405
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1864-F | codeforces | 1864-F | Exotic Queries | https://codeforces.com/problemset/problem/1864/F | [
"data structures",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1706
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1864-E | codeforces | 1864-E | Guess Game | https://codeforces.com/problemset/problem/1864/E | [
"bitmasks",
"data structures",
"games",
"math",
"probabilities",
"sortings",
"strings",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3178
} | 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.