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:2115-E | codeforces | 2115-E | Gellyfish and Mayflower | https://codeforces.com/problemset/problem/2115/E | [
"dp",
"graphs"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 427
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2115-D | codeforces | 2115-D | Gellyfish and Forget-Me-Not | https://codeforces.com/problemset/problem/2115/D | [
"bitmasks",
"dp",
"games",
"greedy",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 2658
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2115-C | codeforces | 2115-C | Gellyfish and Eternal Violet | https://codeforces.com/problemset/problem/2115/C | [
"combinatorics",
"dp",
"greedy",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1806
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2115-B | codeforces | 2115-B | Gellyfish and Camellia Japonica | https://codeforces.com/problemset/problem/2115/B | [
"brute force",
"constructive algorithms",
"dfs and similar",
"dp",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 5563
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2115-A | codeforces | 2115-A | Gellyfish and Flaming Peony | https://codeforces.com/problemset/problem/2115/A | [
"constructive algorithms",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 17143
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2114-G | codeforces | 2114-G | Build an Array | https://codeforces.com/problemset/problem/2114/G | [
"brute force",
"constructive algorithms",
"dp",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2087
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2114-F | codeforces | 2114-F | Small Operations | https://codeforces.com/problemset/problem/2114/F | [
"binary search",
"brute force",
"dfs and similar",
"dp",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5639
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2114-E | codeforces | 2114-E | Kirei Attacks the Estate | https://codeforces.com/problemset/problem/2114/E | [
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14488
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2114-D | codeforces | 2114-D | Come a Little Closer | https://codeforces.com/problemset/problem/2114/D | [
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15036
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2114-C | codeforces | 2114-C | Need More Arrays | https://codeforces.com/problemset/problem/2114/C | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 31680
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2114-B | codeforces | 2114-B | Not Quite a Palindromic String | https://codeforces.com/problemset/problem/2114/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 31159
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2114-A | codeforces | 2114-A | Square Year | https://codeforces.com/problemset/problem/2114/A | [
"binary search",
"brute force",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 44296
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2113-F | codeforces | 2113-F | Two Arrays | https://codeforces.com/problemset/problem/2113/F | [
"constructive algorithms",
"dfs and similar",
"graphs",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 996
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2113-E | codeforces | 2113-E | From Kazan with Love | https://codeforces.com/problemset/problem/2113/E | [
"dfs and similar",
"graphs",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 431
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2113-D | codeforces | 2113-D | Cheater | https://codeforces.com/problemset/problem/2113/D | [
"binary search",
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2965
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2113-C | codeforces | 2113-C | Smilo and Minecraft | https://codeforces.com/problemset/problem/2113/C | [
"brute force",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8251
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2113-B | codeforces | 2113-B | Good Start | https://codeforces.com/problemset/problem/2113/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 15052
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2113-A | codeforces | 2113-A | Shashliks | https://codeforces.com/problemset/problem/2113/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20744
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2112-F | codeforces | 2112-F | Variables and Operations | https://codeforces.com/problemset/problem/2112/F | [
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 664
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2112-E | codeforces | 2112-E | Tree Colorings | https://codeforces.com/problemset/problem/2112/E | [
"combinatorics",
"dfs and similar",
"dp",
"graphs",
"math",
"number theory",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3459
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2112-D | codeforces | 2112-D | Reachability and Tree | https://codeforces.com/problemset/problem/2112/D | [
"constructive algorithms",
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9788
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2112-C | codeforces | 2112-C | Coloring Game | https://codeforces.com/problemset/problem/2112/C | [
"binary search",
"brute force",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 18232
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2112-B | codeforces | 2112-B | Shrinking Array | https://codeforces.com/problemset/problem/2112/B | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 21600
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2112-A | codeforces | 2112-A | Race | https://codeforces.com/problemset/problem/2112/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29727
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2111-G | codeforces | 2111-G | Divisible Subarrays | https://codeforces.com/problemset/problem/2111/G | [
"binary search",
"bitmasks",
"brute force",
"data structures",
"interactive"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 425
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2111-F | codeforces | 2111-F | Puzzle | https://codeforces.com/problemset/problem/2111/F | [
"brute force",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1456
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2111-E | codeforces | 2111-E | Changing the String | https://codeforces.com/problemset/problem/2111/E | [
"binary search",
"data structures",
"greedy",
"implementation",
"sortings",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5513
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2111-D | codeforces | 2111-D | Creating a Schedule | https://codeforces.com/problemset/problem/2111/D | [
"constructive algorithms",
"data structures",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 12369
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2111-C | codeforces | 2111-C | Equal Values | https://codeforces.com/problemset/problem/2111/C | [
"brute force",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 20098
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2111-B | codeforces | 2111-B | Fibonacci Cubes | https://codeforces.com/problemset/problem/2111/B | [
"brute force",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 18282
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2111-A | codeforces | 2111-A | Energy Crystals | https://codeforces.com/problemset/problem/2111/A | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20908
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2110-F | codeforces | 2110-F | Faculty | https://codeforces.com/problemset/problem/2110/F | [
"brute force",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1958
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2110-E | codeforces | 2110-E | Melody | https://codeforces.com/problemset/problem/2110/E | [
"dfs and similar",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2817
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2110-D | codeforces | 2110-D | Fewer Batteries | https://codeforces.com/problemset/problem/2110/D | [
"binary search",
"dfs and similar",
"dp",
"graphs",
"greedy",
"hashing"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8874
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2110-C | codeforces | 2110-C | Racing | https://codeforces.com/problemset/problem/2110/C | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16290
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2110-B | codeforces | 2110-B | Down with Brackets | https://codeforces.com/problemset/problem/2110/B | [
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 28184
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2110-A | codeforces | 2110-A | Fashionable Array | https://codeforces.com/problemset/problem/2110/A | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 30321
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2109-F | codeforces | 2109-F | Penguin Steps | https://codeforces.com/problemset/problem/2109/F | [
"binary search",
"dfs and similar",
"flows",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 285
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2109-E | codeforces | 2109-E | Binary String Wowee | https://codeforces.com/problemset/problem/2109/E | [
"combinatorics",
"dp",
"strings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1874
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2109-D | codeforces | 2109-D | D/D/D | https://codeforces.com/problemset/problem/2109/D | [
"dfs and similar",
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5884
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2109-C3 | codeforces | 2109-C3 | Hacking Numbers (Hard Version) | https://codeforces.com/problemset/problem/2109/C3 | [
"constructive algorithms",
"interactive",
"math",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 3343
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2109-C2 | codeforces | 2109-C2 | Hacking Numbers (Medium Version) | https://codeforces.com/problemset/problem/2109/C2 | [
"constructive algorithms",
"interactive",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8935
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2109-C1 | codeforces | 2109-C1 | Hacking Numbers (Easy Version) | https://codeforces.com/problemset/problem/2109/C1 | [
"bitmasks",
"constructive algorithms",
"interactive",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 11812
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2109-B | codeforces | 2109-B | Slice to Survive | https://codeforces.com/problemset/problem/2109/B | [
"bitmasks",
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17793
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2109-A | codeforces | 2109-A | It's Time To Duel | https://codeforces.com/problemset/problem/2109/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27245
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2108-F | codeforces | 2108-F | Fallen Towers | https://codeforces.com/problemset/problem/2108/F | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 565
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2108-E | codeforces | 2108-E | Spruce Dispute | https://codeforces.com/problemset/problem/2108/E | [
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy",
"implementation",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 936
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2108-D | codeforces | 2108-D | Needle in a Numstack | https://codeforces.com/problemset/problem/2108/D | [
"binary search",
"brute force",
"implementation",
"interactive"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2465
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2108-C | codeforces | 2108-C | Neo's Escape | https://codeforces.com/problemset/problem/2108/C | [
"binary search",
"brute force",
"data structures",
"dp",
"dsu",
"graphs",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15198
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2108-B | codeforces | 2108-B | SUMdamental Decomposition | https://codeforces.com/problemset/problem/2108/B | [
"bitmasks",
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 14929
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2108-A | codeforces | 2108-A | Permutation Warm-Up | https://codeforces.com/problemset/problem/2108/A | [
"combinatorics",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22383
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2107-F2 | codeforces | 2107-F2 | Cycling (Hard Version) | https://codeforces.com/problemset/problem/2107/F2 | [
"binary search",
"brute force",
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 568
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2107-F1 | codeforces | 2107-F1 | Cycling (Easy Version) | https://codeforces.com/problemset/problem/2107/F1 | [
"binary search",
"brute force",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1886
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2107-E | codeforces | 2107-E | Ain and Apple Tree | https://codeforces.com/problemset/problem/2107/E | [
"binary search",
"constructive algorithms",
"greedy",
"math",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 962
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2107-D | codeforces | 2107-D | Apple Tree Traversing | https://codeforces.com/problemset/problem/2107/D | [
"brute force",
"dfs and similar",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3637
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2107-C | codeforces | 2107-C | Maximum Subarray Sum | https://codeforces.com/problemset/problem/2107/C | [
"binary search",
"constructive algorithms",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12501
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2107-B | codeforces | 2107-B | Apples in Boxes | https://codeforces.com/problemset/problem/2107/B | [
"games",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 20268
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2107-A | codeforces | 2107-A | LRC and VIP | https://codeforces.com/problemset/problem/2107/A | [
"greedy",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22461
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2106-G2 | codeforces | 2106-G2 | Baudelaire (hard version) | https://codeforces.com/problemset/problem/2106/G2 | [
"binary search",
"dfs and similar",
"divide and conquer",
"implementation",
"interactive",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 652
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2106-G1 | codeforces | 2106-G1 | Baudelaire (easy version) | https://codeforces.com/problemset/problem/2106/G1 | [
"binary search",
"constructive algorithms",
"divide and conquer",
"greedy",
"interactive",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1673
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2106-F | codeforces | 2106-F | Goblin | https://codeforces.com/problemset/problem/2106/F | [
"dfs and similar",
"dp",
"dsu",
"greedy",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4554
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2106-E | codeforces | 2106-E | Wolf | https://codeforces.com/problemset/problem/2106/E | [
"binary search",
"greedy",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6108
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2106-D | codeforces | 2106-D | Flower Boy | https://codeforces.com/problemset/problem/2106/D | [
"binary search",
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12673
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2106-C | codeforces | 2106-C | Cherry Bomb | https://codeforces.com/problemset/problem/2106/C | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 26264
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2106-B | codeforces | 2106-B | St. Chroma | https://codeforces.com/problemset/problem/2106/B | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 28964
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2106-A | codeforces | 2106-A | Dr. TC | https://codeforces.com/problemset/problem/2106/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 37126
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2104-G | codeforces | 2104-G | Modulo 3 | https://codeforces.com/problemset/problem/2104/G | [
"data structures",
"divide and conquer",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 556
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2104-F | codeforces | 2104-F | Numbers and Strings | https://codeforces.com/problemset/problem/2104/F | [
"binary search",
"brute force",
"dfs and similar",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 749
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2104-E | codeforces | 2104-E | Unpleasant Strings | https://codeforces.com/problemset/problem/2104/E | [
"binary search",
"dp",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8363
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2104-D | codeforces | 2104-D | Array and GCD | https://codeforces.com/problemset/problem/2104/D | [
"binary search",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 13714
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2104-C | codeforces | 2104-C | Card Game | https://codeforces.com/problemset/problem/2104/C | [
"brute force",
"constructive algorithms",
"games",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 17798
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2104-B | codeforces | 2104-B | Move to the End | https://codeforces.com/problemset/problem/2104/B | [
"brute force",
"data structures",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 21343
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2104-A | codeforces | 2104-A | Three Decks | https://codeforces.com/problemset/problem/2104/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26630
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2103-F | codeforces | 2103-F | Maximize Nor | https://codeforces.com/problemset/problem/2103/F | [
"bitmasks",
"data structures",
"dp",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 638
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2103-E | codeforces | 2103-E | Keep the Sum | https://codeforces.com/problemset/problem/2103/E | [
"constructive algorithms",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 623
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2103-D | codeforces | 2103-D | Local Construction | https://codeforces.com/problemset/problem/2103/D | [
"constructive algorithms",
"dfs and similar",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4067
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2103-C | codeforces | 2103-C | Median Splits | https://codeforces.com/problemset/problem/2103/C | [
"binary search",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10991
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2103-B | codeforces | 2103-B | Binary Typewriter | https://codeforces.com/problemset/problem/2103/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 18054
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2103-A | codeforces | 2103-A | Common Multiple | https://codeforces.com/problemset/problem/2103/A | [
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25236
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2102-B | codeforces | 2102-B | The Picky Cat | https://codeforces.com/problemset/problem/2102/B | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 20304
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2102-A | codeforces | 2102-A | Dinner Time | https://codeforces.com/problemset/problem/2102/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 22004
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2101-F | codeforces | 2101-F | Shoo Shatters the Sunshine | https://codeforces.com/problemset/problem/2101/F | [
"combinatorics",
"dp",
"trees"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 218
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2101-E | codeforces | 2101-E | Kia Bakes a Cake | https://codeforces.com/problemset/problem/2101/E | [
"data structures",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 2936
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2101-D | codeforces | 2101-D | Mani and Segments | https://codeforces.com/problemset/problem/2101/D | [
"data structures",
"implementation",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2106
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2101-C | codeforces | 2101-C | 23 Kingdom | https://codeforces.com/problemset/problem/2101/C | [
"binary search",
"brute force",
"data structures",
"greedy",
"ternary search",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4659
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2101-B | codeforces | 2101-B | Quartet Swapping | https://codeforces.com/problemset/problem/2101/B | [
"brute force",
"data structures",
"divide and conquer",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8681
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2101-A | codeforces | 2101-A | Mex in the Grid | https://codeforces.com/problemset/problem/2101/A | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15345
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2098-B | codeforces | 2098-B | Sasha and the Apartment Purchase | https://codeforces.com/problemset/problem/2098/B | [
"math",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 8193
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2098-A | codeforces | 2098-A | Vadim's Collection | https://codeforces.com/problemset/problem/2098/A | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 14949
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2097-F | codeforces | 2097-F | Lost Luggage | https://codeforces.com/problemset/problem/2097/F | [
"dp",
"flows"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 202
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2097-E | codeforces | 2097-E | Clearing the Snowdrift | https://codeforces.com/problemset/problem/2097/E | [
"data structures",
"dfs and similar",
"dp",
"greedy"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 292
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2097-D | codeforces | 2097-D | Homework | https://codeforces.com/problemset/problem/2097/D | [
"bitmasks",
"math",
"matrices"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 561
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2097-C | codeforces | 2097-C | Bermuda Triangle | https://codeforces.com/problemset/problem/2097/C | [
"chinese remainder theorem",
"geometry",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1051
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2097-B | codeforces | 2097-B | Baggage Claim | https://codeforces.com/problemset/problem/2097/B | [
"combinatorics",
"dfs and similar",
"dp",
"dsu",
"graphs",
"implementation",
"math",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1986
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2097-A | codeforces | 2097-A | Sports Betting | https://codeforces.com/problemset/problem/2097/A | [
"2-sat",
"brute force",
"math",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 8941
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2096-H | codeforces | 2096-H | Wonderful XOR Problem | https://codeforces.com/problemset/problem/2096/H | [
"bitmasks",
"combinatorics",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 237
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2096-G | codeforces | 2096-G | Wonderful Guessing Game | https://codeforces.com/problemset/problem/2096/G | [
"bitmasks",
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 456
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2096-F | codeforces | 2096-F | Wonderful Impostors | https://codeforces.com/problemset/problem/2096/F | [
"data structures",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 499
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2096-E | codeforces | 2096-E | Wonderful Teddy Bears | https://codeforces.com/problemset/problem/2096/E | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2094
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2096-D | codeforces | 2096-D | Wonderful Lightbulbs | https://codeforces.com/problemset/problem/2096/D | [
"combinatorics",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5714
} | 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.