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: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": 17655
} | 2026-06-01T05:00:40.145500+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": 175
} | 2026-06-01T05:00:40.145500+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": 380
} | 2026-06-01T05:00:40.145500+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": 843
} | 2026-06-01T05:00:40.145500+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": 1742
} | 2026-06-01T05:00:40.145500+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": 4254
} | 2026-06-01T05:00:40.145500+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": 14641
} | 2026-06-01T05:00:40.145500+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": 17129
} | 2026-06-01T05:00:40.145500+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": 14444
} | 2026-06-01T05:00:40.145500+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": 332
} | 2026-06-01T05:00:40.145500+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": 321
} | 2026-06-01T05:00:40.145500+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": 1038
} | 2026-06-01T05:00:40.145500+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": 1230
} | 2026-06-01T05:00:40.145500+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": 5141
} | 2026-06-01T05:00:40.145500+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": 12799
} | 2026-06-01T05:00:40.145500+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": 16730
} | 2026-06-01T05:00:40.145500+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": 18894
} | 2026-06-01T05:00:40.145500+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": 316
} | 2026-06-01T05:00:40.145500+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": 422
} | 2026-06-01T05:00:40.145500+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": 1505
} | 2026-06-01T05:00:40.145500+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": 2366
} | 2026-06-01T05:00:40.145500+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": 3620
} | 2026-06-01T05:00:40.145500+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": 16025
} | 2026-06-01T05:00:40.145500+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": 943
} | 2026-06-01T05:00:40.145500+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": 1755
} | 2026-06-01T05:00:40.145500+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": 1031
} | 2026-06-01T05:00:40.145500+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": 12504
} | 2026-06-01T05:00:40.145500+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": 11618
} | 2026-06-01T05:00:40.145500+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": 52709
} | 2026-06-01T05:00:40.145500+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": 6294
} | 2026-06-01T05:00:40.145500+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": 290
} | 2026-06-01T05:00:40.145500+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": 174
} | 2026-06-01T05:00:40.145500+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": 623
} | 2026-06-01T05:00:40.145500+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": 1335
} | 2026-06-01T05:00:40.145500+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": 4306
} | 2026-06-01T05:00:40.145500+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": 4905
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1812-C | codeforces | 1812-C | Digits | https://codeforces.com/problemset/problem/1812/C | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 1372
} | 2026-06-01T05:00:40.145500+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": 6062
} | 2026-06-01T05:00:40.145500+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": 14344
} | 2026-06-01T05:00:40.145500+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": 2145
} | 2026-06-01T05:00:40.145500+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": 2520
} | 2026-06-01T05:00:40.145500+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": 2184
} | 2026-06-01T05:00:40.145500+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": 14486
} | 2026-06-01T05:00:40.145500+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": 8680
} | 2026-06-01T05:00:40.145500+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": 22290
} | 2026-06-01T05:00:40.145500+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": 22385
} | 2026-06-01T05:00:40.145500+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": 34715
} | 2026-06-01T05:00:40.145500+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": 170
} | 2026-06-01T05:00:40.145500+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": 1269
} | 2026-06-01T05:00:40.145500+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": 666
} | 2026-06-01T05:00:40.145500+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": 3942
} | 2026-06-01T05:00:40.145500+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": 8574
} | 2026-06-01T05:00:40.145500+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": 16604
} | 2026-06-01T05:00:40.145500+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": 18972
} | 2026-06-01T05:00:40.145500+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": 21937
} | 2026-06-01T05:00:40.145500+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": 567
} | 2026-06-01T05:00:40.145500+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": 935
} | 2026-06-01T05:00:40.145500+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": 1081
} | 2026-06-01T05:00:40.145500+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": 7311
} | 2026-06-01T05:00:40.145500+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": 15254
} | 2026-06-01T05:00:40.145500+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": 22420
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1809-A | codeforces | 1809-A | Garland | https://codeforces.com/problemset/problem/1809/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25213
} | 2026-06-01T05:00:40.145500+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": 580
} | 2026-06-01T05:00:40.145500+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": 853
} | 2026-06-01T05:00:40.145500+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": 1611
} | 2026-06-01T05:00:40.145500+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": 2734
} | 2026-06-01T05:00:40.145500+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": 4365
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1808-B | codeforces | 1808-B | Playing in a Casino | https://codeforces.com/problemset/problem/1808/B | [
"math",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 30318
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1808-A | codeforces | 1808-A | Lucky Numbers | https://codeforces.com/problemset/problem/1808/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 20726
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1807-G2 | codeforces | 1807-G2 | Subsequence Addition (Hard Version) | https://codeforces.com/problemset/problem/1807/G2 | [
"bitmasks",
"dp",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 28296
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1807-G1 | codeforces | 1807-G1 | Subsequence Addition (Easy Version) | https://codeforces.com/problemset/problem/1807/G1 | [
"brute force",
"data structures",
"dp",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 22383
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1807-F | codeforces | 1807-F | Bouncy Ball | https://codeforces.com/problemset/problem/1807/F | [
"brute force",
"dfs and similar",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7353
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1807-E | codeforces | 1807-E | Interview | https://codeforces.com/problemset/problem/1807/E | [
"binary search",
"implementation",
"interactive"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16881
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1807-D | codeforces | 1807-D | Odd Queries | https://codeforces.com/problemset/problem/1807/D | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 57825
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1807-C | codeforces | 1807-C | Find and Replace | https://codeforces.com/problemset/problem/1807/C | [
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 34453
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1807-B | codeforces | 1807-B | Grab the Candies | https://codeforces.com/problemset/problem/1807/B | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 49576
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1807-A | codeforces | 1807-A | Plus or Minus | https://codeforces.com/problemset/problem/1807/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 85457
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1806-F2 | codeforces | 1806-F2 | GCD Master (hard version) | https://codeforces.com/problemset/problem/1806/F2 | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 476
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1806-F1 | codeforces | 1806-F1 | GCD Master (easy version) | https://codeforces.com/problemset/problem/1806/F1 | [
"greedy",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 473
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1806-E | codeforces | 1806-E | Tree Master | https://codeforces.com/problemset/problem/1806/E | [
"brute force",
"data structures",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3463
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1806-D | codeforces | 1806-D | DSU Master | https://codeforces.com/problemset/problem/1806/D | [
"combinatorics",
"dp",
"dsu",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1196
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1806-C | codeforces | 1806-C | Sequence Master | https://codeforces.com/problemset/problem/1806/C | [
"brute force",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8687
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1806-B | codeforces | 1806-B | Mex Master | https://codeforces.com/problemset/problem/1806/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 19829
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1806-A | codeforces | 1806-A | Walking Master | https://codeforces.com/problemset/problem/1806/A | [
"geometry",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 44533
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1805-F2 | codeforces | 1805-F2 | Survival of the Weakest (hard version) | https://codeforces.com/problemset/problem/1805/F2 | [
"greedy",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 518
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1805-F1 | codeforces | 1805-F1 | Survival of the Weakest (easy version) | https://codeforces.com/problemset/problem/1805/F1 | [
"binary search",
"brute force",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1353
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1805-E | codeforces | 1805-E | There Should Be a Lot of Maximums | https://codeforces.com/problemset/problem/1805/E | [
"brute force",
"data structures",
"dfs and similar",
"dp",
"trees",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1921
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1805-D | codeforces | 1805-D | A Wide, Wide Graph | https://codeforces.com/problemset/problem/1805/D | [
"dfs and similar",
"dp",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9171
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1805-C | codeforces | 1805-C | Place for a Selfie | https://codeforces.com/problemset/problem/1805/C | [
"binary search",
"data structures",
"geometry",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14218
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1805-B | codeforces | 1805-B | The String Has a Target | https://codeforces.com/problemset/problem/1805/B | [
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20046
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1805-A | codeforces | 1805-A | We Need the Zero | https://codeforces.com/problemset/problem/1805/A | [
"bitmasks",
"brute force"
] | null | null | stdin_stdout | 800 | {
"solved_count": 42961
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1804-H | codeforces | 1804-H | Code Lock | https://codeforces.com/problemset/problem/1804/H | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 250
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1804-G | codeforces | 1804-G | Flow Control | https://codeforces.com/problemset/problem/1804/G | [
"data structures",
"dsu",
"implementation"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 239
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1804-F | codeforces | 1804-F | Approximate Diameter | https://codeforces.com/problemset/problem/1804/F | [
"binary search",
"divide and conquer",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1179
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1804-E | codeforces | 1804-E | Routing | https://codeforces.com/problemset/problem/1804/E | [
"bitmasks",
"brute force",
"dfs and similar",
"dp",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1714
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1804-D | codeforces | 1804-D | Accommodation | https://codeforces.com/problemset/problem/1804/D | [
"brute force",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5282
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1804-C | codeforces | 1804-C | Pull Your Luck | https://codeforces.com/problemset/problem/1804/C | [
"brute force",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13878
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1804-B | codeforces | 1804-B | Vaccination | https://codeforces.com/problemset/problem/1804/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 15668
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1804-A | codeforces | 1804-A | Lame King | https://codeforces.com/problemset/problem/1804/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18705
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1802-B | codeforces | 1802-B | Settlement of Guinea Pigs | https://codeforces.com/problemset/problem/1802/B | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 14688
} | 2026-06-01T05:00:40.145500+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.