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: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": 18631
} | 2026-11-02T05:37:07.883505+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": 1124
} | 2026-11-02T05:37:07.883505+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": 440
} | 2026-11-02T05:37:07.883505+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": 4365
} | 2026-11-02T05:37:07.883505+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": 15148
} | 2026-11-02T05:37:07.883505+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": 22762
} | 2026-11-02T05:37:07.883505+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": 23012
} | 2026-11-02T05:37:07.883505+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": 6234
} | 2026-11-02T05:37:07.883505+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": 3912
} | 2026-11-02T05:37:07.883505+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": 9004
} | 2026-11-02T05:37:07.883505+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": 27959
} | 2026-11-02T05:37:07.883505+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": 23201
} | 2026-11-02T05:37:07.883505+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": 22009
} | 2026-11-02T05:37:07.883505+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": 29232
} | 2026-11-02T05:37:07.883505+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": 35222
} | 2026-11-02T05:37:07.883505+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": 507
} | 2026-11-02T05:37:07.883505+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": 1776
} | 2026-11-02T05:37:07.883505+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": 9487
} | 2026-11-02T05:37:07.883505+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": 17408
} | 2026-11-02T05:37:07.883505+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": 24181
} | 2026-11-02T05:37:07.883505+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": 54670
} | 2026-11-02T05:37:07.883505+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": 317
} | 2026-11-02T05:37:07.883505+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": 1332
} | 2026-11-02T05:37:07.883505+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": 524
} | 2026-11-02T05:37:07.883505+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": 956
} | 2026-11-02T05:37:07.883505+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": 2283
} | 2026-11-02T05:37:07.883505+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": 14058
} | 2026-11-02T05:37:07.883505+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": 18227
} | 2026-11-02T05:37:07.883505+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": 20566
} | 2026-11-02T05:37:07.883505+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": 26122
} | 2026-11-02T05:37:07.883505+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": 2328
} | 2026-11-02T05:37:07.883505+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": 6603
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1843-E | codeforces | 1843-E | Tracking Segments | https://codeforces.com/problemset/problem/1843/E | [
"binary search",
"brute force",
"data structures",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 19651
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1843-D | codeforces | 1843-D | Apple Tree | https://codeforces.com/problemset/problem/1843/D | [
"combinatorics",
"dfs and similar",
"dp",
"math",
"trees"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 22894
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1843-C | codeforces | 1843-C | Sum in Binary Tree | https://codeforces.com/problemset/problem/1843/C | [
"bitmasks",
"combinatorics",
"math",
"trees"
] | null | null | stdin_stdout | 800 | {
"solved_count": 41057
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1843-B | codeforces | 1843-B | Long Long | https://codeforces.com/problemset/problem/1843/B | [
"greedy",
"math",
"two pointers"
] | null | null | stdin_stdout | 800 | {
"solved_count": 32773
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1843-A | codeforces | 1843-A | Sasha and Array Coloring | https://codeforces.com/problemset/problem/1843/A | [
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 800 | {
"solved_count": 38059
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1842-I | codeforces | 1842-I | Tenzing and Necklace | https://codeforces.com/problemset/problem/1842/I | [
"divide and conquer",
"dp",
"greedy"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 184
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1842-H | codeforces | 1842-H | Tenzing and Random Real Numbers | https://codeforces.com/problemset/problem/1842/H | [
"bitmasks",
"dp",
"graphs",
"math",
"probabilities"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 1164
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1842-G | codeforces | 1842-G | Tenzing and Random Operations | https://codeforces.com/problemset/problem/1842/G | [
"combinatorics",
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1845
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1842-F | codeforces | 1842-F | Tenzing and Tree | https://codeforces.com/problemset/problem/1842/F | [
"dfs and similar",
"greedy",
"shortest paths",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1980
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1842-E | codeforces | 1842-E | Tenzing and Triangle | https://codeforces.com/problemset/problem/1842/E | [
"data structures",
"dp",
"geometry",
"greedy",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1936
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1842-D | codeforces | 1842-D | Tenzing and His Animal Friends | https://codeforces.com/problemset/problem/1842/D | [
"constructive algorithms",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4933
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1842-C | codeforces | 1842-C | Tenzing and Balls | https://codeforces.com/problemset/problem/1842/C | [
"dp"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 17410
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1842-B | codeforces | 1842-B | Tenzing and Books | https://codeforces.com/problemset/problem/1842/B | [
"bitmasks",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 28790
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1842-A | codeforces | 1842-A | Tenzing and Tsondu | https://codeforces.com/problemset/problem/1842/A | [
"games",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21008
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1841-F | codeforces | 1841-F | Monocarp and a Strategic Game | https://codeforces.com/problemset/problem/1841/F | [
"geometry",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 652
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1841-E | codeforces | 1841-E | Fill the Matrix | https://codeforces.com/problemset/problem/1841/E | [
"data structures",
"greedy",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2528
} | 2026-11-02T05:37:07.883505+00:00 |
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": 5462
} | 2026-11-02T05:37:07.883505+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": 9360
} | 2026-11-02T05:37:07.883505+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": 24560
} | 2026-11-02T05:37:07.883505+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": 26226
} | 2026-11-02T05:37:07.883505+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": 1243
} | 2026-11-02T05:37:07.883505+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": 2908
} | 2026-11-02T05:37:07.883505+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": 2200
} | 2026-11-02T05:37:07.883505+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": 9673
} | 2026-11-02T05:37:07.883505+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": 16921
} | 2026-11-02T05:37:07.883505+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": 54659
} | 2026-11-02T05:37:07.883505+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": 25224
} | 2026-11-02T05:37:07.883505+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": 39328
} | 2026-11-02T05:37:07.883505+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": 1630
} | 2026-11-02T05:37:07.883505+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": 2805
} | 2026-11-02T05:37:07.883505+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": 13700
} | 2026-11-02T05:37:07.883505+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": 16790
} | 2026-11-02T05:37:07.883505+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": 18428
} | 2026-11-02T05:37:07.883505+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": 437
} | 2026-11-02T05:37:07.883505+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": 1978
} | 2026-11-02T05:37:07.883505+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": 3828
} | 2026-11-02T05:37:07.883505+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": 17827
} | 2026-11-02T05:37:07.883505+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": 18015
} | 2026-11-02T05:37:07.883505+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": 22843
} | 2026-11-02T05:37:07.883505+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": 2866
} | 2026-11-02T05:37:07.883505+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": 2610
} | 2026-11-02T05:37:07.883505+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": 24344
} | 2026-11-02T05:37:07.883505+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": 25209
} | 2026-11-02T05:37:07.883505+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": 57189
} | 2026-11-02T05:37:07.883505+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": 62465
} | 2026-11-02T05:37:07.883505+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": 13778
} | 2026-11-02T05:37:07.883505+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": 21685
} | 2026-11-02T05:37:07.883505+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": 478
} | 2026-11-02T05:37:07.883505+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": 360
} | 2026-11-02T05:37:07.883505+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": 757
} | 2026-11-02T05:37:07.883505+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": 1234
} | 2026-11-02T05:37:07.883505+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": 1154
} | 2026-11-02T05:37:07.883505+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": 8963
} | 2026-11-02T05:37:07.883505+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": 733
} | 2026-11-02T05:37:07.883505+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": 2940
} | 2026-11-02T05:37:07.883505+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": 5714
} | 2026-11-02T05:37:07.883505+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": 15406
} | 2026-11-02T05:37:07.883505+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": 17389
} | 2026-11-02T05:37:07.883505+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": 53084
} | 2026-11-02T05:37:07.883505+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": 6716
} | 2026-11-02T05:37:07.883505+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": 10963
} | 2026-11-02T05:37:07.883505+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": 20336
} | 2026-11-02T05:37:07.883505+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": 15411
} | 2026-11-02T05:37:07.883505+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": 28316
} | 2026-11-02T05:37:07.883505+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": 30361
} | 2026-11-02T05:37:07.883505+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": 35655
} | 2026-11-02T05:37:07.883505+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": 405
} | 2026-11-02T05:37:07.883505+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": 2691
} | 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.