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:1864-D | codeforces | 1864-D | Matrix Cascade | https://codeforces.com/problemset/problem/1864/D | [
"brute force",
"constructive algorithms",
"data structures",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7816
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1864-C | codeforces | 1864-C | Divisor Chain | https://codeforces.com/problemset/problem/1864/C | [
"bitmasks",
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15646
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1864-B | codeforces | 1864-B | Swap and Reverse | https://codeforces.com/problemset/problem/1864/B | [
"constructive algorithms",
"greedy",
"sortings",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 16896
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1864-A | codeforces | 1864-A | Increasing and Decreasing | https://codeforces.com/problemset/problem/1864/A | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21608
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1863-I | codeforces | 1863-I | Redundant Routes | https://codeforces.com/problemset/problem/1863/I | [
"constructive algorithms",
"dp",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 139
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1863-H | codeforces | 1863-H | Goldberg Machine 3 | https://codeforces.com/problemset/problem/1863/H | [
"dp",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 117
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1863-G | codeforces | 1863-G | Swaps | https://codeforces.com/problemset/problem/1863/G | [
"combinatorics",
"dp",
"graphs",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1108
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1863-F | codeforces | 1863-F | Divide, XOR, and Conquer | https://codeforces.com/problemset/problem/1863/F | [
"bitmasks",
"dp",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1422
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1863-E | codeforces | 1863-E | Speedrun | https://codeforces.com/problemset/problem/1863/E | [
"brute force",
"dfs and similar",
"dp",
"graphs",
"greedy",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3350
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1863-D | codeforces | 1863-D | Two-Colored Dominoes | https://codeforces.com/problemset/problem/1863/D | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10998
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1863-C | codeforces | 1863-C | MEX Repetition | https://codeforces.com/problemset/problem/1863/C | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 15798
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1863-B | codeforces | 1863-B | Split Sort | https://codeforces.com/problemset/problem/1863/B | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 16987
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1863-A | codeforces | 1863-A | Channel | https://codeforces.com/problemset/problem/1863/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18967
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1862-G | codeforces | 1862-G | The Great Equalizer | https://codeforces.com/problemset/problem/1862/G | [
"binary search",
"data structures",
"math",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3575
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1862-F | codeforces | 1862-F | Magic Will Save the World | https://codeforces.com/problemset/problem/1862/F | [
"binary search",
"bitmasks",
"brute force",
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7908
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1862-E | codeforces | 1862-E | Kolya and Movie Theatre | https://codeforces.com/problemset/problem/1862/E | [
"constructive algorithms",
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 13172
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1862-D | codeforces | 1862-D | Ice Cream Balls | https://codeforces.com/problemset/problem/1862/D | [
"binary search",
"combinatorics",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 20513
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1862-C | codeforces | 1862-C | Flower City Fence | https://codeforces.com/problemset/problem/1862/C | [
"binary search",
"data structures",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 23544
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1862-B | codeforces | 1862-B | Sequence Game | https://codeforces.com/problemset/problem/1862/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 63197
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1862-A | codeforces | 1862-A | Gift Carpet | https://codeforces.com/problemset/problem/1862/A | [
"dp",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 36943
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1861-F | codeforces | 1861-F | Four Suits | https://codeforces.com/problemset/problem/1861/F | [
"binary search",
"bitmasks",
"flows",
"greedy"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 358
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1861-E | codeforces | 1861-E | Non-Intersecting Subpermutations | https://codeforces.com/problemset/problem/1861/E | [
"combinatorics",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2138
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1861-D | codeforces | 1861-D | Sorting By Multiplication | https://codeforces.com/problemset/problem/1861/D | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8234
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1861-C | codeforces | 1861-C | Queries for the Array | https://codeforces.com/problemset/problem/1861/C | [
"data structures",
"dfs and similar",
"implementation",
"strings",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12666
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1861-B | codeforces | 1861-B | Two Binary Strings | https://codeforces.com/problemset/problem/1861/B | [
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 24452
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1861-A | codeforces | 1861-A | Prime Deletion | https://codeforces.com/problemset/problem/1861/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26309
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1860-F | codeforces | 1860-F | Evaluate RBS | https://codeforces.com/problemset/problem/1860/F | [
"data structures",
"geometry",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 366
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1860-E | codeforces | 1860-E | Fast Travel Text Editor | https://codeforces.com/problemset/problem/1860/E | [
"data structures",
"dfs and similar",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1910
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1860-D | codeforces | 1860-D | Balanced String | https://codeforces.com/problemset/problem/1860/D | [
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3746
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1860-C | codeforces | 1860-C | Game on Permutation | https://codeforces.com/problemset/problem/1860/C | [
"data structures",
"dp",
"games",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16140
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1860-B | codeforces | 1860-B | Fancy Coins | https://codeforces.com/problemset/problem/1860/B | [
"binary search",
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 19397
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1860-A | codeforces | 1860-A | Not a Substring | https://codeforces.com/problemset/problem/1860/A | [
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 23945
} | 2026-11-02T05:37:07.883505+00:00 |
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": 623
} | 2026-11-02T05:37:07.883505+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": 2198
} | 2026-11-02T05:37:07.883505+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": 8205
} | 2026-11-02T05:37:07.883505+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": 19038
} | 2026-11-02T05:37:07.883505+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": 49698
} | 2026-11-02T05:37:07.883505+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": 62257
} | 2026-11-02T05:37:07.883505+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": 1358
} | 2026-11-02T05:37:07.883505+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": 1681
} | 2026-11-02T05:37:07.883505+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": 3319
} | 2026-11-02T05:37:07.883505+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": 25956
} | 2026-11-02T05:37:07.883505+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": 13308
} | 2026-11-02T05:37:07.883505+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": 75887
} | 2026-11-02T05:37:07.883505+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": 5810
} | 2026-11-02T05:37:07.883505+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": 14887
} | 2026-11-02T05:37:07.883505+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": 15287
} | 2026-11-02T05:37:07.883505+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": 32417
} | 2026-11-02T05:37:07.883505+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": 46798
} | 2026-11-02T05:37:07.883505+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": 25111
} | 2026-11-02T05:37:07.883505+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": 89366
} | 2026-11-02T05:37:07.883505+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": 1869
} | 2026-11-02T05:37:07.883505+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": 6727
} | 2026-11-02T05:37:07.883505+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": 3937
} | 2026-11-02T05:37:07.883505+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": 20032
} | 2026-11-02T05:37:07.883505+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": 28221
} | 2026-11-02T05:37:07.883505+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": 28395
} | 2026-11-02T05:37:07.883505+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": 51391
} | 2026-11-02T05:37:07.883505+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": 30266
} | 2026-11-02T05:37:07.883505+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": 155
} | 2026-11-02T05:37:07.883505+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": 594
} | 2026-11-02T05:37:07.883505+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": 725
} | 2026-11-02T05:37:07.883505+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": 2028
} | 2026-11-02T05:37:07.883505+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": 4473
} | 2026-11-02T05:37:07.883505+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": 8184
} | 2026-11-02T05:37:07.883505+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": 16300
} | 2026-11-02T05:37:07.883505+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": 20197
} | 2026-11-02T05:37:07.883505+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": 64112
} | 2026-11-02T05:37:07.883505+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": 154
} | 2026-11-02T05:37:07.883505+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": 251
} | 2026-11-02T05:37:07.883505+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": 686
} | 2026-11-02T05:37:07.883505+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": 2213
} | 2026-11-02T05:37:07.883505+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": 5621
} | 2026-11-02T05:37:07.883505+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": 9466
} | 2026-11-02T05:37:07.883505+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": 4336
} | 2026-11-02T05:37:07.883505+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": 7963
} | 2026-11-02T05:37:07.883505+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": 13862
} | 2026-11-02T05:37:07.883505+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": 17730
} | 2026-11-02T05:37:07.883505+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": 26372
} | 2026-11-02T05:37:07.883505+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": 33309
} | 2026-11-02T05:37:07.883505+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": 31894
} | 2026-11-02T05:37:07.883505+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": 10415
} | 2026-11-02T05:37:07.883505+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": 16086
} | 2026-11-02T05:37:07.883505+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": 26068
} | 2026-11-02T05:37:07.883505+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": 39183
} | 2026-11-02T05:37:07.883505+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": 68942
} | 2026-11-02T05:37:07.883505+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": 55779
} | 2026-11-02T05:37:07.883505+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": 52189
} | 2026-11-02T05:37:07.883505+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": 78611
} | 2026-11-02T05:37:07.883505+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": 933
} | 2026-11-02T05:37:07.883505+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": 2383
} | 2026-11-02T05:37:07.883505+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": 10662
} | 2026-11-02T05:37:07.883505+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": 12896
} | 2026-11-02T05:37:07.883505+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": 50869
} | 2026-11-02T05:37:07.883505+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": 32620
} | 2026-11-02T05:37:07.883505+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": 2215
} | 2026-11-02T05:37:07.883505+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": 996
} | 2026-11-02T05:37:07.883505+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": 3064
} | 2026-11-02T05:37:07.883505+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": 7337
} | 2026-11-02T05:37:07.883505+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": 27657
} | 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.