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:1841-D | codeforces | 1841-D | Pairs of Segments | https://codeforces.com/problemset/problem/1841/D | [
"data structures",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5266
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1841-C | codeforces | 1841-C | Ranom Numbers | https://codeforces.com/problemset/problem/1841/C | [
"brute force",
"dp",
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9028
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1841-B | codeforces | 1841-B | Keep it Beautiful | https://codeforces.com/problemset/problem/1841/B | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 24044
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1841-A | codeforces | 1841-A | Game with Board | https://codeforces.com/problemset/problem/1841/A | [
"constructive algorithms",
"games"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25964
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1840-G2 | codeforces | 1840-G2 | In Search of Truth (Hard Version) | https://codeforces.com/problemset/problem/1840/G2 | [
"constructive algorithms",
"interactive",
"math",
"meet-in-the-middle",
"probabilities"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1180
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1840-G1 | codeforces | 1840-G1 | In Search of Truth (Easy Version) | https://codeforces.com/problemset/problem/1840/G1 | [
"constructive algorithms",
"interactive",
"math",
"meet-in-the-middle",
"probabilities"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2768
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1840-F | codeforces | 1840-F | Railguns | https://codeforces.com/problemset/problem/1840/F | [
"brute force",
"dfs and similar",
"dp",
"graphs"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2102
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1840-E | codeforces | 1840-E | Character Blocking | https://codeforces.com/problemset/problem/1840/E | [
"data structures",
"hashing",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9270
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1840-D | codeforces | 1840-D | Wooden Toy Festival | https://codeforces.com/problemset/problem/1840/D | [
"binary search",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16226
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1840-C | codeforces | 1840-C | Ski Resort | https://codeforces.com/problemset/problem/1840/C | [
"combinatorics",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 47047
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1840-B | codeforces | 1840-B | Binary Cafe | https://codeforces.com/problemset/problem/1840/B | [
"bitmasks",
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 24653
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1840-A | codeforces | 1840-A | Cipher Shifer | https://codeforces.com/problemset/problem/1840/A | [
"implementation",
"strings",
"two pointers"
] | null | null | stdin_stdout | 800 | {
"solved_count": 37948
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1839-E | codeforces | 1839-E | Decreasing Game | https://codeforces.com/problemset/problem/1839/E | [
"constructive algorithms",
"dfs and similar",
"dp",
"greedy",
"interactive"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1526
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1839-D | codeforces | 1839-D | Ball Sorting | https://codeforces.com/problemset/problem/1839/D | [
"data structures",
"dp",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2684
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1839-C | codeforces | 1839-C | Insert Zero and Invert Prefix | https://codeforces.com/problemset/problem/1839/C | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13411
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1839-B | codeforces | 1839-B | Lamps | https://codeforces.com/problemset/problem/1839/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 16521
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1839-A | codeforces | 1839-A | The Good Array | https://codeforces.com/problemset/problem/1839/A | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18313
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1838-F | codeforces | 1838-F | Stuck Conveyor | https://codeforces.com/problemset/problem/1838/F | [
"binary search",
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 379
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1838-E | codeforces | 1838-E | Count Supersequences | https://codeforces.com/problemset/problem/1838/E | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1844
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1838-D | codeforces | 1838-D | Bracket Walk | https://codeforces.com/problemset/problem/1838/D | [
"data structures",
"greedy",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3683
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1838-C | codeforces | 1838-C | No Prime Differences | https://codeforces.com/problemset/problem/1838/C | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 17219
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1838-B | codeforces | 1838-B | Minimize Permutation Subarrays | https://codeforces.com/problemset/problem/1838/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 17782
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1838-A | codeforces | 1838-A | Blackboard List | https://codeforces.com/problemset/problem/1838/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22675
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1837-F | codeforces | 1837-F | Editorial for Two | https://codeforces.com/problemset/problem/1837/F | [
"binary search",
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2647
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1837-E | codeforces | 1837-E | Playoff Fixing | https://codeforces.com/problemset/problem/1837/E | [
"combinatorics",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2512
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1837-D | codeforces | 1837-D | Bracket Coloring | https://codeforces.com/problemset/problem/1837/D | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 21759
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1837-C | codeforces | 1837-C | Best Binary String | https://codeforces.com/problemset/problem/1837/C | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 24528
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1837-B | codeforces | 1837-B | Comparison String | https://codeforces.com/problemset/problem/1837/B | [
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 49555
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1837-A | codeforces | 1837-A | Grasshopper on a Line | https://codeforces.com/problemset/problem/1837/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 54125
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1836-B | codeforces | 1836-B | Astrophysicists | https://codeforces.com/problemset/problem/1836/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 13570
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1836-A | codeforces | 1836-A | Destroyer | https://codeforces.com/problemset/problem/1836/A | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21398
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1835-F | codeforces | 1835-F | Good Graph | https://codeforces.com/problemset/problem/1835/F | [
"bitmasks",
"dfs and similar",
"graph matchings",
"graphs",
"implementation"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 228
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1835-E | codeforces | 1835-E | Old Mobile | https://codeforces.com/problemset/problem/1835/E | [
"combinatorics",
"dp",
"probabilities"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 273
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1835-D | codeforces | 1835-D | Doctor's Brown Hypothesis | https://codeforces.com/problemset/problem/1835/D | [
"dfs and similar",
"graphs",
"math",
"number theory"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 653
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1835-C | codeforces | 1835-C | Twin Clusters | https://codeforces.com/problemset/problem/1835/C | [
"bitmasks",
"brute force",
"constructive algorithms",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1161
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1835-B | codeforces | 1835-B | Lottery | https://codeforces.com/problemset/problem/1835/B | [
"binary search",
"brute force",
"greedy",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1068
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1835-A | codeforces | 1835-A | k-th equality | https://codeforces.com/problemset/problem/1835/A | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8704
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1834-F | codeforces | 1834-F | Typewriter | https://codeforces.com/problemset/problem/1834/F | [
"brute force",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 638
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1834-E | codeforces | 1834-E | MEX of LCM | https://codeforces.com/problemset/problem/1834/E | [
"binary search",
"data structures",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2756
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1834-D | codeforces | 1834-D | Survey in Class | https://codeforces.com/problemset/problem/1834/D | [
"brute force",
"data structures",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5529
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1834-C | codeforces | 1834-C | Game with Reversing | https://codeforces.com/problemset/problem/1834/C | [
"games",
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 14989
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1834-B | codeforces | 1834-B | Maximum Strength | https://codeforces.com/problemset/problem/1834/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 16969
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1834-A | codeforces | 1834-A | Unit Array | https://codeforces.com/problemset/problem/1834/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 44974
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1833-G | codeforces | 1833-G | Ksyusha and Chinchilla | https://codeforces.com/problemset/problem/1833/G | [
"constructive algorithms",
"dfs and similar",
"dp",
"dsu",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6354
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1833-F | codeforces | 1833-F | Ira and Flamenco | https://codeforces.com/problemset/problem/1833/F | [
"combinatorics",
"constructive algorithms",
"data structures",
"implementation",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10048
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1833-E | codeforces | 1833-E | Round Dance | https://codeforces.com/problemset/problem/1833/E | [
"dfs and similar",
"dsu",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 18202
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1833-D | codeforces | 1833-D | Flipper | https://codeforces.com/problemset/problem/1833/D | [
"brute force",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15054
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1833-C | codeforces | 1833-C | Vlad Building Beautiful Array | https://codeforces.com/problemset/problem/1833/C | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27845
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1833-B | codeforces | 1833-B | Restore the Weather | https://codeforces.com/problemset/problem/1833/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 29546
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1833-A | codeforces | 1833-A | Musical Puzzle | https://codeforces.com/problemset/problem/1833/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 35005
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1832-F | codeforces | 1832-F | Zombies | https://codeforces.com/problemset/problem/1832/F | [
"binary search",
"dp"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 356
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1832-E | codeforces | 1832-E | Combinatorics Problem | https://codeforces.com/problemset/problem/1832/E | [
"brute force",
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2525
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1832-D2 | codeforces | 1832-D2 | Red-Blue Operations (Hard Version) | https://codeforces.com/problemset/problem/1832/D2 | [
"binary search",
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2330
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1832-D1 | codeforces | 1832-D1 | Red-Blue Operations (Easy Version) | https://codeforces.com/problemset/problem/1832/D1 | [
"binary search",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3369
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1832-C | codeforces | 1832-C | Contrast Value | https://codeforces.com/problemset/problem/1832/C | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 34004
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1832-B | codeforces | 1832-B | Maximum Sum | https://codeforces.com/problemset/problem/1832/B | [
"brute force",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 35087
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1832-A | codeforces | 1832-A | New Palindrome | https://codeforces.com/problemset/problem/1832/A | [
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28917
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1831-B | codeforces | 1831-B | Array merging | https://codeforces.com/problemset/problem/1831/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 34641
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1831-A | codeforces | 1831-A | Twin Permutations | https://codeforces.com/problemset/problem/1831/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 45679
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1830-F | codeforces | 1830-F | The Third Grace | https://codeforces.com/problemset/problem/1830/F | [
"data structures",
"dp"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 356
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1830-E | codeforces | 1830-E | Bully Sort | https://codeforces.com/problemset/problem/1830/E | [
"data structures",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 322
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1830-D | codeforces | 1830-D | Mex Tree | https://codeforces.com/problemset/problem/1830/D | [
"brute force",
"dp",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 921
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1830-C | codeforces | 1830-C | Hyperregular Bracket Strings | https://codeforces.com/problemset/problem/1830/C | [
"combinatorics",
"greedy",
"hashing",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2164
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1830-B | codeforces | 1830-B | The BOSS Can Count Pairs | https://codeforces.com/problemset/problem/1830/B | [
"brute force",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5805
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1830-A | codeforces | 1830-A | Copil Copac Draws Trees | https://codeforces.com/problemset/problem/1830/A | [
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 20136
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1829-H | codeforces | 1829-H | Don't Blame Me | https://codeforces.com/problemset/problem/1829/H | [
"bitmasks",
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10702
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1829-G | codeforces | 1829-G | Hits Different | https://codeforces.com/problemset/problem/1829/G | [
"data structures",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 14981
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1829-F | codeforces | 1829-F | Forever Winter | https://codeforces.com/problemset/problem/1829/F | [
"dfs and similar",
"graphs",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 21636
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1829-E | codeforces | 1829-E | The Lakes | https://codeforces.com/problemset/problem/1829/E | [
"dfs and similar",
"dsu",
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 26426
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1829-D | codeforces | 1829-D | Gold Rush | https://codeforces.com/problemset/problem/1829/D | [
"brute force",
"dfs and similar",
"dp",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 33112
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1829-C | codeforces | 1829-C | Mr. Perfectly Fine | https://codeforces.com/problemset/problem/1829/C | [
"bitmasks",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 32371
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1829-B | codeforces | 1829-B | Blank Space | https://codeforces.com/problemset/problem/1829/B | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 77002
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1829-A | codeforces | 1829-A | Love Story | https://codeforces.com/problemset/problem/1829/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 70150
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1828-B | codeforces | 1828-B | Permutation Swap | https://codeforces.com/problemset/problem/1828/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 38870
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1828-A | codeforces | 1828-A | Divisible Array | https://codeforces.com/problemset/problem/1828/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25306
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1827-F | codeforces | 1827-F | Copium Permutation | https://codeforces.com/problemset/problem/1827/F | [
"constructive algorithms",
"data structures",
"greedy"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 134
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1827-E | codeforces | 1827-E | Bus Routes | https://codeforces.com/problemset/problem/1827/E | [
"binary search",
"constructive algorithms",
"dfs and similar",
"greedy",
"trees"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 555
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1827-D | codeforces | 1827-D | Two Centroids | https://codeforces.com/problemset/problem/1827/D | [
"data structures",
"dfs and similar",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 948
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1827-C | codeforces | 1827-C | Palindrome Partition | https://codeforces.com/problemset/problem/1827/C | [
"binary search",
"brute force",
"data structures",
"dp",
"hashing",
"strings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1641
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1827-B2 | codeforces | 1827-B2 | Range Sorting (Hard Version) | https://codeforces.com/problemset/problem/1827/B2 | [
"binary search",
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2302
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1827-B1 | codeforces | 1827-B1 | Range Sorting (Easy Version) | https://codeforces.com/problemset/problem/1827/B1 | [
"binary search",
"dp",
"dsu",
"greedy",
"trees",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4516
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1827-A | codeforces | 1827-A | Counting Orders | https://codeforces.com/problemset/problem/1827/A | [
"combinatorics",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 28534
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1826-F | codeforces | 1826-F | Fading into Fog | https://codeforces.com/problemset/problem/1826/F | [
"geometry",
"interactive",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 454
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1826-E | codeforces | 1826-E | Walk the Runway | https://codeforces.com/problemset/problem/1826/E | [
"bitmasks",
"brute force",
"data structures",
"dp",
"graphs",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1944
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1826-D | codeforces | 1826-D | Running Miles | https://codeforces.com/problemset/problem/1826/D | [
"brute force",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 14787
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1826-C | codeforces | 1826-C | Dreaming of Freedom | https://codeforces.com/problemset/problem/1826/C | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15613
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1826-B | codeforces | 1826-B | Lunatic Never Content | https://codeforces.com/problemset/problem/1826/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 27799
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1826-A | codeforces | 1826-A | Trust Nobody | https://codeforces.com/problemset/problem/1826/A | [
"brute force",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17225
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1825-B | codeforces | 1825-B | LuoTianyi and the Table | https://codeforces.com/problemset/problem/1825/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 16061
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1825-A | codeforces | 1825-A | LuoTianyi and the Palindrome String | https://codeforces.com/problemset/problem/1825/A | [
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20728
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1824-E | codeforces | 1824-E | LuoTianyi and Cartridge | https://codeforces.com/problemset/problem/1824/E | [
"data structures",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 188
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1824-D | codeforces | 1824-D | LuoTianyi and the Function | https://codeforces.com/problemset/problem/1824/D | [
"data structures"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 647
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1824-C | codeforces | 1824-C | LuoTianyi and XOR-Tree | https://codeforces.com/problemset/problem/1824/C | [
"data structures",
"dfs and similar",
"dp",
"dsu",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1674
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1824-B2 | codeforces | 1824-B2 | LuoTianyi and the Floating Islands (Hard Version) | https://codeforces.com/problemset/problem/1824/B2 | [
"combinatorics",
"dfs and similar",
"math",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3335
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1824-B1 | codeforces | 1824-B1 | LuoTianyi and the Floating Islands (Easy Version) | https://codeforces.com/problemset/problem/1824/B1 | [
"combinatorics",
"math",
"probabilities",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5965
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1824-A | codeforces | 1824-A | LuoTianyi and the Show | https://codeforces.com/problemset/problem/1824/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 12496
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1823-F | codeforces | 1823-F | Random Walk | https://codeforces.com/problemset/problem/1823/F | [
"dp",
"graphs",
"math",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1281
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1823-E | codeforces | 1823-E | Removing Graph | https://codeforces.com/problemset/problem/1823/E | [
"brute force",
"dp",
"games",
"graphs",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1437
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1823-D | codeforces | 1823-D | Unique Palindromes | https://codeforces.com/problemset/problem/1823/D | [
"constructive algorithms",
"math",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4297
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1823-C | codeforces | 1823-C | Strongly Composite | https://codeforces.com/problemset/problem/1823/C | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13806
} | 2026-04-13T03:38:27.662191+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.