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:1859-F | codeforces | 1859-F | Teleportation in Byteland | https://codeforces.com/problemset/problem/1859/F | [
"data structures",
"dfs and similar",
"divide and conquer",
"graphs",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 594
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1859-E | codeforces | 1859-E | Maximum Monogonosity | https://codeforces.com/problemset/problem/1859/E | [
"brute force",
"dp",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2175
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1859-D | codeforces | 1859-D | Andrey and Escape from Capygrad | https://codeforces.com/problemset/problem/1859/D | [
"binary search",
"data structures",
"dp",
"dsu",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8085
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1859-C | codeforces | 1859-C | Another Permutation Problem | https://codeforces.com/problemset/problem/1859/C | [
"brute force",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 18894
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1859-B | codeforces | 1859-B | Olya and Game with Arrays | https://codeforces.com/problemset/problem/1859/B | [
"constructive algorithms",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 47191
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1859-A | codeforces | 1859-A | United We Stand | https://codeforces.com/problemset/problem/1859/A | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 59060
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1858-E2 | codeforces | 1858-E2 | Rollbacks (Hard Version) | https://codeforces.com/problemset/problem/1858/E2 | [
"data structures",
"interactive",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1304
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1858-E1 | codeforces | 1858-E1 | Rollbacks (Easy Version) | https://codeforces.com/problemset/problem/1858/E1 | [
"brute force",
"data structures",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1656
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1858-D | codeforces | 1858-D | Trees and Segments | https://codeforces.com/problemset/problem/1858/D | [
"brute force",
"data structures",
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3264
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1858-C | codeforces | 1858-C | Yet Another Permutation Problem | https://codeforces.com/problemset/problem/1858/C | [
"constructive algorithms",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 25792
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1858-B | codeforces | 1858-B | The Walkway | https://codeforces.com/problemset/problem/1858/B | [
"brute force",
"dp",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13206
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1858-A | codeforces | 1858-A | Buttons | https://codeforces.com/problemset/problem/1858/A | [
"games",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 71622
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1857-G | codeforces | 1857-G | Counting Graphs | https://codeforces.com/problemset/problem/1857/G | [
"combinatorics",
"divide and conquer",
"dsu",
"graphs",
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5657
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1857-F | codeforces | 1857-F | Sum and Product | https://codeforces.com/problemset/problem/1857/F | [
"binary search",
"data structures",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 14654
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1857-E | codeforces | 1857-E | Power of Points | https://codeforces.com/problemset/problem/1857/E | [
"math",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15079
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1857-D | codeforces | 1857-D | Strong Vertices | https://codeforces.com/problemset/problem/1857/D | [
"math",
"sortings",
"trees"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 31193
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1857-C | codeforces | 1857-C | Assembly via Minimums | https://codeforces.com/problemset/problem/1857/C | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 44714
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1857-B | codeforces | 1857-B | Maximum Rounding | https://codeforces.com/problemset/problem/1857/B | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 24942
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1857-A | codeforces | 1857-A | Array Coloring | https://codeforces.com/problemset/problem/1857/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 84657
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1856-E2 | codeforces | 1856-E2 | PermuTree (hard version) | https://codeforces.com/problemset/problem/1856/E2 | [
"bitmasks",
"dfs and similar",
"dp",
"fft",
"greedy",
"implementation",
"math",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1820
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1856-E1 | codeforces | 1856-E1 | PermuTree (easy version) | https://codeforces.com/problemset/problem/1856/E1 | [
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6597
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1856-D | codeforces | 1856-D | More Wrong | https://codeforces.com/problemset/problem/1856/D | [
"divide and conquer",
"interactive"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3870
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1856-C | codeforces | 1856-C | To Become Max | https://codeforces.com/problemset/problem/1856/C | [
"binary search",
"brute force",
"data structures",
"dp"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 19326
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1856-B | codeforces | 1856-B | Good Arrays | https://codeforces.com/problemset/problem/1856/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 27842
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1856-A | codeforces | 1856-A | Tales of a Sort | https://codeforces.com/problemset/problem/1856/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28293
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1855-B | codeforces | 1855-B | Longest Divisors Interval | https://codeforces.com/problemset/problem/1855/B | [
"brute force",
"combinatorics",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 48618
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1855-A | codeforces | 1855-A | Dalton the Teacher | https://codeforces.com/problemset/problem/1855/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 30134
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1854-F | codeforces | 1854-F | Mark and Spaceship | https://codeforces.com/problemset/problem/1854/F | [
"brute force",
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 149
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1854-E | codeforces | 1854-E | Game Bundles | https://codeforces.com/problemset/problem/1854/E | [
"brute force",
"constructive algorithms",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 581
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1854-D | codeforces | 1854-D | Michael and Hotel | https://codeforces.com/problemset/problem/1854/D | [
"binary search",
"interactive",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 701
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1854-C | codeforces | 1854-C | Expected Destruction | https://codeforces.com/problemset/problem/1854/C | [
"combinatorics",
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1976
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1854-B | codeforces | 1854-B | Earn or Unlock | https://codeforces.com/problemset/problem/1854/B | [
"bitmasks",
"brute force",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4416
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1854-A2 | codeforces | 1854-A2 | Dual (Hard Version) | https://codeforces.com/problemset/problem/1854/A2 | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 8057
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1854-A1 | codeforces | 1854-A1 | Dual (Easy Version) | https://codeforces.com/problemset/problem/1854/A1 | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16191
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1853-B | codeforces | 1853-B | Fibonaccharsis | https://codeforces.com/problemset/problem/1853/B | [
"binary search",
"brute force",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 20030
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1853-A | codeforces | 1853-A | Desorting | https://codeforces.com/problemset/problem/1853/A | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 60559
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1852-F | codeforces | 1852-F | Panda Meetups | https://codeforces.com/problemset/problem/1852/F | [
"data structures",
"dp",
"flows"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 151
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1852-E | codeforces | 1852-E | Rivalries | https://codeforces.com/problemset/problem/1852/E | [
"constructive algorithms",
"data structures",
"greedy"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 250
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1852-D | codeforces | 1852-D | Miriany and Matchstick | https://codeforces.com/problemset/problem/1852/D | [
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 673
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1852-C | codeforces | 1852-C | Ina of the Mountain | https://codeforces.com/problemset/problem/1852/C | [
"data structures",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2166
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1852-B | codeforces | 1852-B | Imbalanced Arrays | https://codeforces.com/problemset/problem/1852/B | [
"constructive algorithms",
"graphs",
"greedy",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5551
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1852-A | codeforces | 1852-A | Ntarsis' Set | https://codeforces.com/problemset/problem/1852/A | [
"binary search",
"math",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9360
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1851-G | codeforces | 1851-G | Vlad and the Mountains | https://codeforces.com/problemset/problem/1851/G | [
"binary search",
"data structures",
"dsu",
"graphs",
"implementation",
"sortings",
"trees",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4217
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1851-F | codeforces | 1851-F | Lisa and the Martians | https://codeforces.com/problemset/problem/1851/F | [
"bitmasks",
"greedy",
"math",
"strings",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7801
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1851-E | codeforces | 1851-E | Nastya and Potions | https://codeforces.com/problemset/problem/1851/E | [
"dfs and similar",
"dp",
"graphs",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13618
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1851-D | codeforces | 1851-D | Prefix Permutation Sums | https://codeforces.com/problemset/problem/1851/D | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 17542
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1851-C | codeforces | 1851-C | Tiles Comeback | https://codeforces.com/problemset/problem/1851/C | [
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 26173
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1851-B | codeforces | 1851-B | Parity Sort | https://codeforces.com/problemset/problem/1851/B | [
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 800 | {
"solved_count": 32950
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1851-A | codeforces | 1851-A | Escalator Conversations | https://codeforces.com/problemset/problem/1851/A | [
"brute force",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31757
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1850-H | codeforces | 1850-H | The Third Letter | https://codeforces.com/problemset/problem/1850/H | [
"dfs and similar",
"dsu",
"graphs",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10218
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1850-G | codeforces | 1850-G | The Morning Star | https://codeforces.com/problemset/problem/1850/G | [
"combinatorics",
"data structures",
"geometry",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15819
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1850-F | codeforces | 1850-F | We Were Both Children | https://codeforces.com/problemset/problem/1850/F | [
"brute force",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 25446
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1850-E | codeforces | 1850-E | Cardboard for Pictures | https://codeforces.com/problemset/problem/1850/E | [
"binary search",
"geometry",
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 37459
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1850-D | codeforces | 1850-D | Balanced Round | https://codeforces.com/problemset/problem/1850/D | [
"brute force",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 65309
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1850-C | codeforces | 1850-C | Word on the Paper | https://codeforces.com/problemset/problem/1850/C | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 54725
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1850-B | codeforces | 1850-B | Ten Words of Wisdom | https://codeforces.com/problemset/problem/1850/B | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 51324
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1850-A | codeforces | 1850-A | To My Critics | https://codeforces.com/problemset/problem/1850/A | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 76273
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1849-F | codeforces | 1849-F | XOR Partition | https://codeforces.com/problemset/problem/1849/F | [
"binary search",
"bitmasks",
"data structures",
"divide and conquer",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 912
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1849-E | codeforces | 1849-E | Max to the Right of Min | https://codeforces.com/problemset/problem/1849/E | [
"binary search",
"data structures",
"divide and conquer",
"dp",
"dsu",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2306
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1849-D | codeforces | 1849-D | Array Painting | https://codeforces.com/problemset/problem/1849/D | [
"constructive algorithms",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10531
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1849-C | codeforces | 1849-C | Binary String Copying | https://codeforces.com/problemset/problem/1849/C | [
"binary search",
"brute force",
"data structures",
"hashing",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12748
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1849-B | codeforces | 1849-B | Monsters | https://codeforces.com/problemset/problem/1849/B | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 47938
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1849-A | codeforces | 1849-A | Morning Sandwich | https://codeforces.com/problemset/problem/1849/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 32389
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1848-F | codeforces | 1848-F | Vika and Wiki | https://codeforces.com/problemset/problem/1848/F | [
"binary search",
"bitmasks",
"combinatorics",
"divide and conquer",
"dp",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2135
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1848-E | codeforces | 1848-E | Vika and Stone Skipping | https://codeforces.com/problemset/problem/1848/E | [
"brute force",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 983
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1848-D | codeforces | 1848-D | Vika and Bonuses | https://codeforces.com/problemset/problem/1848/D | [
"binary search",
"brute force",
"math",
"ternary search"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3037
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1848-C | codeforces | 1848-C | Vika and Price Tags | https://codeforces.com/problemset/problem/1848/C | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7265
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1848-B | codeforces | 1848-B | Vika and the Bridge | https://codeforces.com/problemset/problem/1848/B | [
"binary search",
"data structures",
"greedy",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 26368
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1848-A | codeforces | 1848-A | Vika and Her Friends | https://codeforces.com/problemset/problem/1848/A | [
"games",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 18547
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1847-F | codeforces | 1847-F | The Boss's Identity | https://codeforces.com/problemset/problem/1847/F | [
"binary search",
"bitmasks",
"data structures",
"dfs and similar",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1119
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1847-E | codeforces | 1847-E | Triangle Platinum? | https://codeforces.com/problemset/problem/1847/E | [
"brute force",
"combinatorics",
"implementation",
"interactive",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 429
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1847-D | codeforces | 1847-D | Professor Higashikata | https://codeforces.com/problemset/problem/1847/D | [
"data structures",
"dsu",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4317
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1847-C | codeforces | 1847-C | Vampiric Powers, anyone? | https://codeforces.com/problemset/problem/1847/C | [
"bitmasks",
"brute force",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15012
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1847-B | codeforces | 1847-B | Hamon Odyssey | https://codeforces.com/problemset/problem/1847/B | [
"bitmasks",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 22571
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1847-A | codeforces | 1847-A | The Man who became a God | https://codeforces.com/problemset/problem/1847/A | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22972
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1846-G | codeforces | 1846-G | Rudolf and CodeVid-23 | https://codeforces.com/problemset/problem/1846/G | [
"bitmasks",
"dp",
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6058
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1846-F | codeforces | 1846-F | Rudolph and Mimic | https://codeforces.com/problemset/problem/1846/F | [
"constructive algorithms",
"implementation",
"interactive"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3849
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1846-E2 | codeforces | 1846-E2 | Rudolf and Snowflakes (hard version) | https://codeforces.com/problemset/problem/1846/E2 | [
"binary search",
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8784
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1846-E1 | codeforces | 1846-E1 | Rudolf and Snowflakes (simple version) | https://codeforces.com/problemset/problem/1846/E1 | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 26862
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1846-D | codeforces | 1846-D | Rudolph and Christmas Tree | https://codeforces.com/problemset/problem/1846/D | [
"constructive algorithms",
"geometry",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 22942
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1846-C | codeforces | 1846-C | Rudolf and the Another Competition | https://codeforces.com/problemset/problem/1846/C | [
"constructive algorithms",
"data structures",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 21828
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1846-B | codeforces | 1846-B | Rudolph and Tic-Tac-Toe | https://codeforces.com/problemset/problem/1846/B | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29119
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1846-A | codeforces | 1846-A | Rudolph and Cut the Rope | https://codeforces.com/problemset/problem/1846/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 35033
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1845-F | codeforces | 1845-F | Swimmers in the Pool | https://codeforces.com/problemset/problem/1845/F | [
"dp",
"fft",
"math",
"number theory"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 502
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1845-E | codeforces | 1845-E | Boxes and Balls | https://codeforces.com/problemset/problem/1845/E | [
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1668
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1845-D | codeforces | 1845-D | Rating System | https://codeforces.com/problemset/problem/1845/D | [
"binary search",
"brute force",
"data structures",
"dp",
"dsu",
"greedy",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9192
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1845-C | codeforces | 1845-C | Strong Password | https://codeforces.com/problemset/problem/1845/C | [
"binary search",
"dp",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 17118
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1845-B | codeforces | 1845-B | Come Together | https://codeforces.com/problemset/problem/1845/B | [
"geometry",
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 24064
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1845-A | codeforces | 1845-A | Forbidden Integer | https://codeforces.com/problemset/problem/1845/A | [
"constructive algorithms",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 51717
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1844-H | codeforces | 1844-H | Multiple of Three Cycles | https://codeforces.com/problemset/problem/1844/H | [
"combinatorics",
"data structures",
"dp",
"dsu",
"math"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 307
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1844-G | codeforces | 1844-G | Tree Weights | https://codeforces.com/problemset/problem/1844/G | [
"bitmasks",
"constructive algorithms",
"data structures",
"dfs and similar",
"implementation",
"math",
"matrices",
"number theory",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 1213
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1844-F2 | codeforces | 1844-F2 | Min Cost Permutation (Hard Version) | https://codeforces.com/problemset/problem/1844/F2 | [
"binary search",
"constructive algorithms",
"data structures",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 511
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1844-F1 | codeforces | 1844-F1 | Min Cost Permutation (Easy Version) | https://codeforces.com/problemset/problem/1844/F1 | [
"brute force",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 940
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1844-E | codeforces | 1844-E | Great Grids | https://codeforces.com/problemset/problem/1844/E | [
"2-sat",
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2208
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1844-D | codeforces | 1844-D | Row Major | https://codeforces.com/problemset/problem/1844/D | [
"constructive algorithms",
"greedy",
"math",
"number theory",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 13978
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1844-C | codeforces | 1844-C | Particles | https://codeforces.com/problemset/problem/1844/C | [
"dp",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 18113
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1844-B | codeforces | 1844-B | Permutations & Primes | https://codeforces.com/problemset/problem/1844/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 20408
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1844-A | codeforces | 1844-A | Subtraction Game | https://codeforces.com/problemset/problem/1844/A | [
"constructive algorithms",
"games"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26068
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1843-F2 | codeforces | 1843-F2 | Omsk Metro (hard version) | https://codeforces.com/problemset/problem/1843/F2 | [
"data structures",
"dfs and similar",
"divide and conquer",
"dp",
"math",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2250
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1843-F1 | codeforces | 1843-F1 | Omsk Metro (simple version) | https://codeforces.com/problemset/problem/1843/F1 | [
"data structures",
"dfs and similar",
"dp",
"graphs",
"greedy",
"math",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6491
} | 2026-08-10T02:20:32.917453+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.