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: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": 15902
} | 2026-08-10T02:20:32.917453+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": 15906
} | 2026-08-10T02:20:32.917453+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": 30222
} | 2026-08-10T02:20:32.917453+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": 17530
} | 2026-08-10T02:20:32.917453+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": 16316
} | 2026-08-10T02:20:32.917453+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": 20962
} | 2026-08-10T02:20:32.917453+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": 197
} | 2026-08-10T02:20:32.917453+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": 852
} | 2026-08-10T02:20:32.917453+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": 1737
} | 2026-08-10T02:20:32.917453+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": 3574
} | 2026-08-10T02:20:32.917453+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": 6309
} | 2026-08-10T02:20:32.917453+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": 12672
} | 2026-08-10T02:20:32.917453+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": 1393
} | 2026-08-10T02:20:32.917453+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": 1507
} | 2026-08-10T02:20:32.917453+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": 4363
} | 2026-08-10T02:20:32.917453+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": 14003
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1823-B | codeforces | 1823-B | Sort with Step | https://codeforces.com/problemset/problem/1823/B | [
"brute force",
"math",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 18328
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1823-A | codeforces | 1823-A | A-characteristic | https://codeforces.com/problemset/problem/1823/A | [
"combinatorics",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17296
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1822-G2 | codeforces | 1822-G2 | Magic Triples (Hard Version) | https://codeforces.com/problemset/problem/1822/G2 | [
"brute force",
"data structures",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3135
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1822-G1 | codeforces | 1822-G1 | Magic Triples (Easy Version) | https://codeforces.com/problemset/problem/1822/G1 | [
"brute force",
"data structures",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9907
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1822-F | codeforces | 1822-F | Gardening Friends | https://codeforces.com/problemset/problem/1822/F | [
"brute force",
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7866
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1822-E | codeforces | 1822-E | Making Anti-Palindromes | https://codeforces.com/problemset/problem/1822/E | [
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12591
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1822-D | codeforces | 1822-D | Super-Permutation | https://codeforces.com/problemset/problem/1822/D | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 19246
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1822-C | codeforces | 1822-C | Bun Lover | https://codeforces.com/problemset/problem/1822/C | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24961
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1822-B | codeforces | 1822-B | Karina and Array | https://codeforces.com/problemset/problem/1822/B | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26750
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1822-A | codeforces | 1822-A | TubeTube Feed | https://codeforces.com/problemset/problem/1822/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26224
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1821-F | codeforces | 1821-F | Timber | https://codeforces.com/problemset/problem/1821/F | [
"combinatorics",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1021
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1821-E | codeforces | 1821-E | Rearrange Brackets | https://codeforces.com/problemset/problem/1821/E | [
"brute force",
"dp",
"greedy",
"sortings",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2770
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1821-D | codeforces | 1821-D | Black Cells | https://codeforces.com/problemset/problem/1821/D | [
"binary search",
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5609
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1821-C | codeforces | 1821-C | Tear It Apart | https://codeforces.com/problemset/problem/1821/C | [
"brute force",
"implementation",
"math",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16467
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1821-B | codeforces | 1821-B | Sort the Subarray | https://codeforces.com/problemset/problem/1821/B | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 30351
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1821-A | codeforces | 1821-A | Matching | https://codeforces.com/problemset/problem/1821/A | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21385
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1820-B | codeforces | 1820-B | JoJo's Incredible Adventures | https://codeforces.com/problemset/problem/1820/B | [
"math",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 24685
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1820-A | codeforces | 1820-A | Yura's New Name | https://codeforces.com/problemset/problem/1820/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17772
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1819-F | codeforces | 1819-F | Willy-nilly, Crack, Into Release! | https://codeforces.com/problemset/problem/1819/F | [
"data structures",
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 221
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1819-E | codeforces | 1819-E | Roads in E City | https://codeforces.com/problemset/problem/1819/E | [
"interactive",
"math",
"probabilities",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 384
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1819-D | codeforces | 1819-D | Misha and Apples | https://codeforces.com/problemset/problem/1819/D | [
"brute force",
"data structures",
"dp",
"two pointers"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 933
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1819-C | codeforces | 1819-C | The Fox and the Complete Tree Traversal | https://codeforces.com/problemset/problem/1819/C | [
"constructive algorithms",
"dp",
"implementation",
"math",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1779
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1819-B | codeforces | 1819-B | The Butcher | https://codeforces.com/problemset/problem/1819/B | [
"geometry",
"greedy",
"implementation",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4319
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1819-A | codeforces | 1819-A | Constructive Problem | https://codeforces.com/problemset/problem/1819/A | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 14760
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1818-B | codeforces | 1818-B | Indivisible | https://codeforces.com/problemset/problem/1818/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 900 | {
"solved_count": 17290
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1818-A | codeforces | 1818-A | Politics | https://codeforces.com/problemset/problem/1818/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 14605
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1817-F | codeforces | 1817-F | Entangled Substrings | https://codeforces.com/problemset/problem/1817/F | [
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 438
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1817-E | codeforces | 1817-E | Half-sum | https://codeforces.com/problemset/problem/1817/E | [
"brute force",
"divide and conquer",
"greedy"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 380
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1817-D | codeforces | 1817-D | Toy Machine | https://codeforces.com/problemset/problem/1817/D | [
"constructive algorithms",
"games",
"implementation"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1051
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1817-C | codeforces | 1817-C | Similar Polynomials | https://codeforces.com/problemset/problem/1817/C | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1255
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1817-B | codeforces | 1817-B | Fish Graph | https://codeforces.com/problemset/problem/1817/B | [
"brute force",
"constructive algorithms",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5252
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1817-A | codeforces | 1817-A | Almost Increasing Subsequence | https://codeforces.com/problemset/problem/1817/A | [
"binary search",
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12918
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1816-B | codeforces | 1816-B | Grid Reconstruction | https://codeforces.com/problemset/problem/1816/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 16851
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1816-A | codeforces | 1816-A | Ian Visits Mary | https://codeforces.com/problemset/problem/1816/A | [
"constructive algorithms",
"geometry",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18982
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1815-F | codeforces | 1815-F | OH NO1 (-2-3-4) | https://codeforces.com/problemset/problem/1815/F | [
"constructive algorithms",
"graphs",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 324
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1815-E | codeforces | 1815-E | Bosco and Particle | https://codeforces.com/problemset/problem/1815/E | [
"dp",
"math",
"number theory",
"strings"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 485
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1815-D | codeforces | 1815-D | XOR Counting | https://codeforces.com/problemset/problem/1815/D | [
"bitmasks",
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1558
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1815-C | codeforces | 1815-C | Between | https://codeforces.com/problemset/problem/1815/C | [
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2418
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1815-B | codeforces | 1815-B | Sum Graph | https://codeforces.com/problemset/problem/1815/B | [
"brute force",
"constructive algorithms",
"graphs",
"implementation",
"interactive",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3687
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1815-A | codeforces | 1815-A | Ian and Array Sorting | https://codeforces.com/problemset/problem/1815/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16199
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1814-F | codeforces | 1814-F | Communication Towers | https://codeforces.com/problemset/problem/1814/F | [
"brute force",
"divide and conquer",
"dsu"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1026
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1814-E | codeforces | 1814-E | Chain Chips | https://codeforces.com/problemset/problem/1814/E | [
"data structures",
"dp",
"matrices"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1847
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1814-D | codeforces | 1814-D | Balancing Weapons | https://codeforces.com/problemset/problem/1814/D | [
"binary search",
"brute force",
"data structures",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1076
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1814-C | codeforces | 1814-C | Search in Parallel | https://codeforces.com/problemset/problem/1814/C | [
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12646
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1814-B | codeforces | 1814-B | Long Legs | https://codeforces.com/problemset/problem/1814/B | [
"brute force",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11776
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1814-A | codeforces | 1814-A | Coins | https://codeforces.com/problemset/problem/1814/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 55945
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1812-J | codeforces | 1812-J | Unmysterious Language | https://codeforces.com/problemset/problem/1812/J | [
"*special",
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | null | {
"solved_count": 6312
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1812-I | codeforces | 1812-I | Mountain Climber | https://codeforces.com/problemset/problem/1812/I | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 293
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1812-H | codeforces | 1812-H | Expected Twist | https://codeforces.com/problemset/problem/1812/H | [
"*special",
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 176
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1812-G | codeforces | 1812-G | Colour Vision | https://codeforces.com/problemset/problem/1812/G | [
"*special",
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 627
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1812-F | codeforces | 1812-F | Factorization | https://codeforces.com/problemset/problem/1812/F | [
"*special",
"number theory"
] | null | null | stdin_stdout | null | {
"solved_count": 1337
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1812-E | codeforces | 1812-E | Not a Geometry Problem | https://codeforces.com/problemset/problem/1812/E | [
"*special",
"constructive algorithms",
"geometry",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 4319
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1812-D | codeforces | 1812-D | Trivial Conjecture | https://codeforces.com/problemset/problem/1812/D | [
"*special",
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | null | {
"solved_count": 4953
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1812-C | codeforces | 1812-C | Digits | https://codeforces.com/problemset/problem/1812/C | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 1379
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1812-B | codeforces | 1812-B | Was it Rated? | https://codeforces.com/problemset/problem/1812/B | [
"*special",
"brute force",
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 6083
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1812-A | codeforces | 1812-A | Are You a Robot? | https://codeforces.com/problemset/problem/1812/A | [
"*special",
"expression parsing",
"strings"
] | null | null | stdin_stdout | null | {
"solved_count": 14374
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1811-G2 | codeforces | 1811-G2 | Vlad and the Nice Paths (hard version) | https://codeforces.com/problemset/problem/1811/G2 | [
"binary search",
"combinatorics",
"data structures",
"dp",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2197
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1811-G1 | codeforces | 1811-G1 | Vlad and the Nice Paths (easy version) | https://codeforces.com/problemset/problem/1811/G1 | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2589
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1811-F | codeforces | 1811-F | Is It Flower? | https://codeforces.com/problemset/problem/1811/F | [
"dfs and similar",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2254
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1811-E | codeforces | 1811-E | Living Sequence | https://codeforces.com/problemset/problem/1811/E | [
"binary search",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14667
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1811-D | codeforces | 1811-D | Umka and a Long Flight | https://codeforces.com/problemset/problem/1811/D | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8787
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1811-C | codeforces | 1811-C | Restore the Array | https://codeforces.com/problemset/problem/1811/C | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 22496
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1811-B | codeforces | 1811-B | Conveyor Belts | https://codeforces.com/problemset/problem/1811/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 22567
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1811-A | codeforces | 1811-A | Insert Digit | https://codeforces.com/problemset/problem/1811/A | [
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 35002
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1810-H | codeforces | 1810-H | Last Number | https://codeforces.com/problemset/problem/1810/H | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 176
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1810-G | codeforces | 1810-G | The Maximum Prefix | https://codeforces.com/problemset/problem/1810/G | [
"dp"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 1346
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1810-F | codeforces | 1810-F | M-tree | https://codeforces.com/problemset/problem/1810/F | [
"data structures",
"math",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 707
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1810-E | codeforces | 1810-E | Monsters | https://codeforces.com/problemset/problem/1810/E | [
"brute force",
"data structures",
"dfs and similar",
"dsu",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4002
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1810-D | codeforces | 1810-D | Climbing the Tree | https://codeforces.com/problemset/problem/1810/D | [
"binary search",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8661
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1810-C | codeforces | 1810-C | Make It Permutation | https://codeforces.com/problemset/problem/1810/C | [
"brute force",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16754
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1810-B | codeforces | 1810-B | Candies | https://codeforces.com/problemset/problem/1810/B | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19023
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1810-A | codeforces | 1810-A | Beautiful Sequence | https://codeforces.com/problemset/problem/1810/A | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22054
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1809-G | codeforces | 1809-G | Prediction | https://codeforces.com/problemset/problem/1809/G | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 678
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1809-F | codeforces | 1809-F | Traveling in Berland | https://codeforces.com/problemset/problem/1809/F | [
"binary search",
"data structures",
"graphs",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 986
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1809-E | codeforces | 1809-E | Two Tanks | https://codeforces.com/problemset/problem/1809/E | [
"binary search",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1132
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1809-D | codeforces | 1809-D | Binary String Sorting | https://codeforces.com/problemset/problem/1809/D | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7426
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1809-C | codeforces | 1809-C | Sum on Subarrays | https://codeforces.com/problemset/problem/1809/C | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15465
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1809-B | codeforces | 1809-B | Points on Plane | https://codeforces.com/problemset/problem/1809/B | [
"binary search",
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 22736
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1809-A | codeforces | 1809-A | Garland | https://codeforces.com/problemset/problem/1809/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25329
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1808-E3 | codeforces | 1808-E3 | Minibuses on Venus (hard version) | https://codeforces.com/problemset/problem/1808/E3 | [
"brute force",
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 664
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1808-E2 | codeforces | 1808-E2 | Minibuses on Venus (medium version) | https://codeforces.com/problemset/problem/1808/E2 | [
"combinatorics",
"divide and conquer",
"dp",
"matrices"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 895
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1808-E1 | codeforces | 1808-E1 | Minibuses on Venus (easy version) | https://codeforces.com/problemset/problem/1808/E1 | [
"combinatorics",
"divide and conquer",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1650
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1808-D | codeforces | 1808-D | Petya, Petya, Petr, and Palindromes | https://codeforces.com/problemset/problem/1808/D | [
"binary search",
"brute force",
"data structures",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2795
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1808-C | codeforces | 1808-C | Unlucky Numbers | https://codeforces.com/problemset/problem/1808/C | [
"brute force",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4403
} | 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.