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: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": 14498
} | 2026-04-13T03:38:27.662191+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": 20411
} | 2026-04-13T03:38:27.662191+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": 620
} | 2026-04-13T03:38:27.662191+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": 3289
} | 2026-04-13T03:38:27.662191+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": 9349
} | 2026-04-13T03:38:27.662191+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": 17564
} | 2026-04-13T03:38:27.662191+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": 20963
} | 2026-04-13T03:38:27.662191+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": 29046
} | 2026-04-13T03:38:27.662191+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": 388
} | 2026-04-13T03:38:27.662191+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": 1396
} | 2026-04-13T03:38:27.662191+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": 5388
} | 2026-04-13T03:38:27.662191+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": 11889
} | 2026-04-13T03:38:27.662191+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": 19273
} | 2026-04-13T03:38:27.662191+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": 17780
} | 2026-04-13T03:38:27.662191+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": 20645
} | 2026-04-13T03:38:27.662191+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": 1895
} | 2026-04-13T03:38:27.662191+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": 2635
} | 2026-04-13T03:38:27.662191+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": 8518
} | 2026-04-13T03:38:27.662191+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": 15715
} | 2026-04-13T03:38:27.662191+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": 27156
} | 2026-04-13T03:38:27.662191+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": 29663
} | 2026-04-13T03:38:27.662191+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": 270
} | 2026-04-13T03:38:27.662191+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": 1750
} | 2026-04-13T03:38:27.662191+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": 5548
} | 2026-04-13T03:38:27.662191+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": 3168
} | 2026-04-13T03:38:27.662191+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": 8566
} | 2026-04-13T03:38:27.662191+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": 11300
} | 2026-04-13T03:38:27.662191+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": 17217
} | 2026-04-13T03:38:27.662191+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": 26825
} | 2026-04-13T03:38:27.662191+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": 538
} | 2026-04-13T03:38:27.662191+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": 868
} | 2026-04-13T03:38:27.662191+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": 2413
} | 2026-04-13T03:38:27.662191+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": 14549
} | 2026-04-13T03:38:27.662191+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": 14468
} | 2026-04-13T03:38:27.662191+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": 22079
} | 2026-04-13T03:38:27.662191+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": 488
} | 2026-04-13T03:38:27.662191+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": 1808
} | 2026-04-13T03:38:27.662191+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": 922
} | 2026-04-13T03:38:27.662191+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": 3516
} | 2026-04-13T03:38:27.662191+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": 11979
} | 2026-04-13T03:38:27.662191+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": 19631
} | 2026-04-13T03:38:27.662191+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": 22124
} | 2026-04-13T03:38:27.662191+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": 603
} | 2026-04-13T03:38:27.662191+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": 1603
} | 2026-04-13T03:38:27.662191+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": 4396
} | 2026-04-13T03:38:27.662191+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": 5895
} | 2026-04-13T03:38:27.662191+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": 12181
} | 2026-04-13T03:38:27.662191+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": 25477
} | 2026-04-13T03:38:27.662191+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": 28272
} | 2026-04-13T03:38:27.662191+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": 36231
} | 2026-04-13T03:38:27.662191+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": 522
} | 2026-04-13T03:38:27.662191+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": 711
} | 2026-04-13T03:38:27.662191+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": 7986
} | 2026-04-13T03:38:27.662191+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": 13083
} | 2026-04-13T03:38:27.662191+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": 17256
} | 2026-04-13T03:38:27.662191+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": 20585
} | 2026-04-13T03:38:27.662191+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": 26153
} | 2026-04-13T03:38:27.662191+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": 608
} | 2026-04-13T03:38:27.662191+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": 597
} | 2026-04-13T03:38:27.662191+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": 3954
} | 2026-04-13T03:38:27.662191+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": 10456
} | 2026-04-13T03:38:27.662191+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": 17591
} | 2026-04-13T03:38:27.662191+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": 24854
} | 2026-04-13T03:38:27.662191+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": 19700
} | 2026-04-13T03:38:27.662191+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": 21327
} | 2026-04-13T03:38:27.662191+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": 153
} | 2026-04-13T03:38:27.662191+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": 270
} | 2026-04-13T03:38:27.662191+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": 992
} | 2026-04-13T03:38:27.662191+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": 2248
} | 2026-04-13T03:38:27.662191+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": 6714
} | 2026-04-13T03:38:27.662191+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": 13354
} | 2026-04-13T03:38:27.662191+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": 7783
} | 2026-04-13T03:38:27.662191+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": 14668
} | 2026-04-13T03:38:27.662191+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": 182
} | 2026-04-13T03:38:27.662191+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": 271
} | 2026-04-13T03:38:27.662191+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": 528
} | 2026-04-13T03:38:27.662191+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": 1011
} | 2026-04-13T03:38:27.662191+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": 1876
} | 2026-04-13T03:38:27.662191+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": 8467
} | 2026-04-13T03:38:27.662191+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": 220
} | 2026-04-13T03:38:27.662191+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": 416
} | 2026-04-13T03:38:27.662191+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": 452
} | 2026-04-13T03:38:27.662191+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": 2025
} | 2026-04-13T03:38:27.662191+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": 5568
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2096-C | codeforces | 2096-C | Wonderful City | https://codeforces.com/problemset/problem/2096/C | [
"dp",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8156
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2096-B | codeforces | 2096-B | Wonderful Gloves | https://codeforces.com/problemset/problem/2096/B | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 16476
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2096-A | codeforces | 2096-A | Wonderful Sticks | https://codeforces.com/problemset/problem/2096/A | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20452
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2095-J | codeforces | 2095-J | Premiere at a Wrong Time | https://codeforces.com/problemset/problem/2095/J | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 541
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2095-I | codeforces | 2095-I | Mysterious Script | https://codeforces.com/problemset/problem/2095/I | [
"*special",
"expression parsing",
"number theory"
] | null | null | stdin_stdout | null | {
"solved_count": 639
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2095-H | codeforces | 2095-H | Blurry Vision | https://codeforces.com/problemset/problem/2095/H | [
"*special",
"fft",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 836
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2095-G | codeforces | 2095-G | Definitely a Geometry Problem | https://codeforces.com/problemset/problem/2095/G | [
"*special",
"geometry"
] | null | null | stdin_stdout | null | {
"solved_count": 956
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2095-F | codeforces | 2095-F | ⅓ оf а Рrоblеm | https://codeforces.com/problemset/problem/2095/F | [
"*special",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 832
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2095-E | codeforces | 2095-E | Pair Count | https://codeforces.com/problemset/problem/2095/E | [
"*special",
"number theory"
] | null | null | stdin_stdout | null | {
"solved_count": 781
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2095-D | codeforces | 2095-D | Where Am I? | https://codeforces.com/problemset/problem/2095/D | [
"*special",
"geometry"
] | null | null | stdin_stdout | null | {
"solved_count": 5287
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2095-C | codeforces | 2095-C | Would It Be Unrated? | https://codeforces.com/problemset/problem/2095/C | [
"*special",
"binary search",
"brute force"
] | null | null | stdin_stdout | null | {
"solved_count": 3731
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2095-B | codeforces | 2095-B | Plinko | https://codeforces.com/problemset/problem/2095/B | [
"*special",
"games",
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 5974
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2095-A | codeforces | 2095-A | Piecing It Together | https://codeforces.com/problemset/problem/2095/A | [
"*special",
"string suffix structures"
] | null | null | stdin_stdout | null | {
"solved_count": 13794
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2094-H | codeforces | 2094-H | La Vaca Saturno Saturnita | https://codeforces.com/problemset/problem/2094/H | [
"binary search",
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3766
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2094-G | codeforces | 2094-G | Chimpanzini Bananini | https://codeforces.com/problemset/problem/2094/G | [
"data structures",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7795
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2094-F | codeforces | 2094-F | Trulimero Trulicina | https://codeforces.com/problemset/problem/2094/F | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11339
} | 2026-04-13T03:38:27.662191+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.