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:2036-A | codeforces | 2036-A | Quintomania | https://codeforces.com/problemset/problem/2036/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 40542
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2035-H | codeforces | 2035-H | Peak Productivity Forces | https://codeforces.com/problemset/problem/2035/H | [
"constructive algorithms"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 96
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2035-G2 | codeforces | 2035-G2 | Go Learn! (Hard Version) | https://codeforces.com/problemset/problem/2035/G2 | [
"divide and conquer",
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 110
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2035-G1 | codeforces | 2035-G1 | Go Learn! (Easy Version) | https://codeforces.com/problemset/problem/2035/G1 | [
"dp",
"trees"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 171
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2035-F | codeforces | 2035-F | Tree Operations | https://codeforces.com/problemset/problem/2035/F | [
"binary search",
"brute force",
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1090
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2035-E | codeforces | 2035-E | Monster | https://codeforces.com/problemset/problem/2035/E | [
"binary search",
"brute force",
"constructive algorithms",
"greedy",
"implementation",
"math",
"ternary search"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1956
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2035-D | codeforces | 2035-D | Yet Another Real Number Problem | https://codeforces.com/problemset/problem/2035/D | [
"binary search",
"data structures",
"divide and conquer",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5803
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2035-C | codeforces | 2035-C | Alya and Permutation | https://codeforces.com/problemset/problem/2035/C | [
"bitmasks",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11472
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2035-B | codeforces | 2035-B | Everyone Loves Tres | https://codeforces.com/problemset/problem/2035/B | [
"constructive algorithms",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 20508
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2035-A | codeforces | 2035-A | Sliding | https://codeforces.com/problemset/problem/2035/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17825
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2034-H | codeforces | 2034-H | Rayan vs. Rayaneh | https://codeforces.com/problemset/problem/2034/H | [
"brute force",
"dfs and similar",
"dp",
"number theory"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 195
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2034-G2 | codeforces | 2034-G2 | Simurgh's Watch (Hard Version) | https://codeforces.com/problemset/problem/2034/G2 | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 77
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2034-G1 | codeforces | 2034-G1 | Simurgh's Watch (Easy Version) | https://codeforces.com/problemset/problem/2034/G1 | [
"constructive algorithms",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 77
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2034-F2 | codeforces | 2034-F2 | Khayyam's Royal Decree (Hard Version) | https://codeforces.com/problemset/problem/2034/F2 | [
"combinatorics",
"dp",
"math",
"sortings"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 592
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2034-F1 | codeforces | 2034-F1 | Khayyam's Royal Decree (Easy Version) | https://codeforces.com/problemset/problem/2034/F1 | [
"combinatorics",
"dp",
"math",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 884
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2034-E | codeforces | 2034-E | Permutations Harmony | https://codeforces.com/problemset/problem/2034/E | [
"combinatorics",
"constructive algorithms",
"greedy",
"hashing",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2014
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2034-D | codeforces | 2034-D | Darius' Wisdom | https://codeforces.com/problemset/problem/2034/D | [
"constructive algorithms",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6569
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2034-C | codeforces | 2034-C | Trapped in the Witch's Labyrinth | https://codeforces.com/problemset/problem/2034/C | [
"constructive algorithms",
"dfs and similar",
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 9086
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2034-B | codeforces | 2034-B | Rakhsh's Revival | https://codeforces.com/problemset/problem/2034/B | [
"data structures",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 15687
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2034-A | codeforces | 2034-A | King Keykhosrow's Mystery | https://codeforces.com/problemset/problem/2034/A | [
"brute force",
"chinese remainder theorem",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18364
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2033-G | codeforces | 2033-G | Sakurako and Chefir | https://codeforces.com/problemset/problem/2033/G | [
"data structures",
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1988
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2033-F | codeforces | 2033-F | Kosuke's Sloth | https://codeforces.com/problemset/problem/2033/F | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7094
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2033-E | codeforces | 2033-E | Sakurako, Kosuke, and the Permutation | https://codeforces.com/problemset/problem/2033/E | [
"brute force",
"data structures",
"dfs and similar",
"dsu",
"graphs",
"greedy",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14066
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2033-D | codeforces | 2033-D | Kousuke's Assignment | https://codeforces.com/problemset/problem/2033/D | [
"data structures",
"dp",
"dsu",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 18125
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2033-C | codeforces | 2033-C | Sakurako's Field Trip | https://codeforces.com/problemset/problem/2033/C | [
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 17740
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2033-B | codeforces | 2033-B | Sakurako and Water | https://codeforces.com/problemset/problem/2033/B | [
"brute force",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 28785
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2033-A | codeforces | 2033-A | Sakurako and Kosuke | https://codeforces.com/problemset/problem/2033/A | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 41041
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2032-F | codeforces | 2032-F | Peanuts | https://codeforces.com/problemset/problem/2032/F | [
"combinatorics",
"dp",
"games",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 478
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2032-E | codeforces | 2032-E | Balanced | https://codeforces.com/problemset/problem/2032/E | [
"constructive algorithms",
"data structures",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1385
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2032-D | codeforces | 2032-D | Genokraken | https://codeforces.com/problemset/problem/2032/D | [
"constructive algorithms",
"data structures",
"graphs",
"greedy",
"implementation",
"interactive",
"trees",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6166
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2032-C | codeforces | 2032-C | Trinity | https://codeforces.com/problemset/problem/2032/C | [
"binary search",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16085
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2032-B | codeforces | 2032-B | Medians | https://codeforces.com/problemset/problem/2032/B | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 20528
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2032-A | codeforces | 2032-A | Circuit | https://codeforces.com/problemset/problem/2032/A | [
"greedy",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24628
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2031-F | codeforces | 2031-F | Penchick and Even Medians | https://codeforces.com/problemset/problem/2031/F | [
"binary search",
"constructive algorithms",
"interactive",
"probabilities"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 449
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2031-E | codeforces | 2031-E | Penchick and Chloe's Trees | https://codeforces.com/problemset/problem/2031/E | [
"data structures",
"dfs and similar",
"dp",
"greedy",
"implementation",
"math",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2673
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2031-D | codeforces | 2031-D | Penchick and Desert Rabbit | https://codeforces.com/problemset/problem/2031/D | [
"binary search",
"data structures",
"dfs and similar",
"dp",
"dsu",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9627
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2031-C | codeforces | 2031-C | Penchick and BBQ Buns | https://codeforces.com/problemset/problem/2031/C | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15654
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2031-B | codeforces | 2031-B | Penchick and Satay Sticks | https://codeforces.com/problemset/problem/2031/B | [
"brute force",
"greedy",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 20731
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2031-A | codeforces | 2031-A | Penchick and Modern Monument | https://codeforces.com/problemset/problem/2031/A | [
"constructive algorithms",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20879
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2030-G2 | codeforces | 2030-G2 | The Destruction of the Universe (Hard Version) | https://codeforces.com/problemset/problem/2030/G2 | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 197
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2030-G1 | codeforces | 2030-G1 | The Destruction of the Universe (Easy Version) | https://codeforces.com/problemset/problem/2030/G1 | [
"combinatorics",
"greedy",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 258
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2030-F | codeforces | 2030-F | Orangutan Approved Subarrays | https://codeforces.com/problemset/problem/2030/F | [
"binary search",
"data structures",
"dp",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1151
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2030-E | codeforces | 2030-E | MEXimize the Score | https://codeforces.com/problemset/problem/2030/E | [
"combinatorics",
"data structures",
"dp",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1958
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2030-D | codeforces | 2030-D | QED's Favorite Permutation | https://codeforces.com/problemset/problem/2030/D | [
"data structures",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8563
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2030-C | codeforces | 2030-C | A TRUE Battle | https://codeforces.com/problemset/problem/2030/C | [
"brute force",
"games",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 19754
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2030-B | codeforces | 2030-B | Minimise Oneness | https://codeforces.com/problemset/problem/2030/B | [
"combinatorics",
"constructive algorithms",
"games",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23612
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2030-A | codeforces | 2030-A | A Gift From Orangutan | https://codeforces.com/problemset/problem/2030/A | [
"constructive algorithms",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27528
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2029-I | codeforces | 2029-I | Variance Challenge | https://codeforces.com/problemset/problem/2029/I | [
"flows",
"graphs",
"greedy"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 145
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2029-H | codeforces | 2029-H | Message Spread | https://codeforces.com/problemset/problem/2029/H | [
"bitmasks",
"brute force",
"combinatorics",
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 110
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2029-G | codeforces | 2029-G | Balanced Problem | https://codeforces.com/problemset/problem/2029/G | [
"data structures",
"dp"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 255
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2029-F | codeforces | 2029-F | Palindrome Everywhere | https://codeforces.com/problemset/problem/2029/F | [
"constructive algorithms",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 844
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2029-E | codeforces | 2029-E | Common Generator | https://codeforces.com/problemset/problem/2029/E | [
"brute force",
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3515
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2029-D | codeforces | 2029-D | Cool Graph | https://codeforces.com/problemset/problem/2029/D | [
"constructive algorithms",
"data structures",
"dfs and similar",
"dsu",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3901
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2029-C | codeforces | 2029-C | New Rating | https://codeforces.com/problemset/problem/2029/C | [
"binary search",
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7544
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2029-B | codeforces | 2029-B | Replacement | https://codeforces.com/problemset/problem/2029/B | [
"constructive algorithms",
"games",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 11682
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2029-A | codeforces | 2029-A | Set | https://codeforces.com/problemset/problem/2029/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 14130
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2028-F | codeforces | 2028-F | Alice's Adventures in Addition | https://codeforces.com/problemset/problem/2028/F | [
"bitmasks",
"brute force",
"dp",
"implementation"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 532
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2028-E | codeforces | 2028-E | Alice's Adventures in the Rabbit Hole | https://codeforces.com/problemset/problem/2028/E | [
"combinatorics",
"dfs and similar",
"dp",
"games",
"greedy",
"math",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1891
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2028-D | codeforces | 2028-D | Alice's Adventures in Cards | https://codeforces.com/problemset/problem/2028/D | [
"constructive algorithms",
"data structures",
"dp",
"graphs",
"greedy",
"implementation",
"ternary search"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3719
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2028-C | codeforces | 2028-C | Alice's Adventures in Cutting Cake | https://codeforces.com/problemset/problem/2028/C | [
"binary search",
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9906
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2028-B | codeforces | 2028-B | Alice's Adventures in Permuting | https://codeforces.com/problemset/problem/2028/B | [
"binary search",
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 13223
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2028-A | codeforces | 2028-A | Alice's Adventures in ''Chess'' | https://codeforces.com/problemset/problem/2028/A | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 20236
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2027-E2 | codeforces | 2027-E2 | Bit Game (Hard Version) | https://codeforces.com/problemset/problem/2027/E2 | [
"bitmasks",
"dp",
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 109
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2027-E1 | codeforces | 2027-E1 | Bit Game (Easy Version) | https://codeforces.com/problemset/problem/2027/E1 | [
"bitmasks",
"brute force",
"games",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 247
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2027-D2 | codeforces | 2027-D2 | The Endspeaker (Hard Version) | https://codeforces.com/problemset/problem/2027/D2 | [
"binary search",
"data structures",
"dp",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1895
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2027-D1 | codeforces | 2027-D1 | The Endspeaker (Easy Version) | https://codeforces.com/problemset/problem/2027/D1 | [
"binary search",
"dp",
"graphs",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6925
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2027-C | codeforces | 2027-C | Add Zeros | https://codeforces.com/problemset/problem/2027/C | [
"brute force",
"data structures",
"dfs and similar",
"dp",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13586
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2027-B | codeforces | 2027-B | Stalin Sort | https://codeforces.com/problemset/problem/2027/B | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 17668
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2027-A | codeforces | 2027-A | Rectangle Arrangement | https://codeforces.com/problemset/problem/2027/A | [
"geometry",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22002
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2026-F | codeforces | 2026-F | Bermart Ice Cream | https://codeforces.com/problemset/problem/2026/F | [
"data structures",
"dfs and similar",
"divide and conquer",
"dp",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 394
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2026-E | codeforces | 2026-E | Best Subsequence | https://codeforces.com/problemset/problem/2026/E | [
"bitmasks",
"dfs and similar",
"flows",
"graph matchings",
"graphs"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2000
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2026-D | codeforces | 2026-D | Sums of Segments | https://codeforces.com/problemset/problem/2026/D | [
"binary search",
"data structures",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5803
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2026-C | codeforces | 2026-C | Action Figures | https://codeforces.com/problemset/problem/2026/C | [
"binary search",
"brute force",
"constructive algorithms",
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12560
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2026-B | codeforces | 2026-B | Black Cells | https://codeforces.com/problemset/problem/2026/B | [
"binary search",
"brute force",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16446
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2026-A | codeforces | 2026-A | Perpendicular Segments | https://codeforces.com/problemset/problem/2026/A | [
"constructive algorithms",
"geometry",
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 20210
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2025-G | codeforces | 2025-G | Variable Damage | https://codeforces.com/problemset/problem/2025/G | [
"data structures",
"flows"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 227
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2025-F | codeforces | 2025-F | Choose Your Queries | https://codeforces.com/problemset/problem/2025/F | [
"constructive algorithms",
"dfs and similar",
"dp",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1047
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2025-E | codeforces | 2025-E | Card Game | https://codeforces.com/problemset/problem/2025/E | [
"combinatorics",
"dp",
"fft",
"greedy",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2353
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2025-D | codeforces | 2025-D | Attribute Checks | https://codeforces.com/problemset/problem/2025/D | [
"brute force",
"data structures",
"dp",
"implementation",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7828
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2025-C | codeforces | 2025-C | New Game | https://codeforces.com/problemset/problem/2025/C | [
"binary search",
"brute force",
"greedy",
"implementation",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 18947
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2025-B | codeforces | 2025-B | Binomial Coefficients, Kind Of | https://codeforces.com/problemset/problem/2025/B | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 19571
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2025-A | codeforces | 2025-A | Two Screens | https://codeforces.com/problemset/problem/2025/A | [
"binary search",
"greedy",
"strings",
"two pointers"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28467
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2024-B | codeforces | 2024-B | Buying Lemonade | https://codeforces.com/problemset/problem/2024/B | [
"binary search",
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 16993
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2024-A | codeforces | 2024-A | Profitable Interest Rate | https://codeforces.com/problemset/problem/2024/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22971
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2023-F | codeforces | 2023-F | Hills and Pits | https://codeforces.com/problemset/problem/2023/F | [
"data structures",
"greedy",
"math",
"matrices"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 132
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2023-E | codeforces | 2023-E | Tree of Life | https://codeforces.com/problemset/problem/2023/E | [
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 173
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2023-D | codeforces | 2023-D | Many Games | https://codeforces.com/problemset/problem/2023/D | [
"brute force",
"dp",
"greedy",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 596
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2023-C | codeforces | 2023-C | C+K+S | https://codeforces.com/problemset/problem/2023/C | [
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy",
"hashing",
"implementation",
"strings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1369
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2023-B | codeforces | 2023-B | Skipping | https://codeforces.com/problemset/problem/2023/B | [
"binary search",
"dp",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7033
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2023-A | codeforces | 2023-A | Concatenation of Arrays | https://codeforces.com/problemset/problem/2023/A | [
"constructive algorithms",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16515
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2022-E2 | codeforces | 2022-E2 | Billetes MX (Hard Version) | https://codeforces.com/problemset/problem/2022/E2 | [
"binary search",
"combinatorics",
"data structures",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 701
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2022-E1 | codeforces | 2022-E1 | Billetes MX (Easy Version) | https://codeforces.com/problemset/problem/2022/E1 | [
"2-sat",
"binary search",
"combinatorics",
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 752
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2022-D2 | codeforces | 2022-D2 | Asesino (Hard Version) | https://codeforces.com/problemset/problem/2022/D2 | [
"constructive algorithms",
"dp",
"interactive"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 823
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2022-D1 | codeforces | 2022-D1 | Asesino (Easy Version) | https://codeforces.com/problemset/problem/2022/D1 | [
"binary search",
"brute force",
"constructive algorithms",
"implementation",
"interactive"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3975
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2022-C | codeforces | 2022-C | Gerrymandering | https://codeforces.com/problemset/problem/2022/C | [
"dp",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6329
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2022-B | codeforces | 2022-B | Kar Salesman | https://codeforces.com/problemset/problem/2022/B | [
"binary search",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 14460
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2022-A | codeforces | 2022-A | Bus to Pénjamo | https://codeforces.com/problemset/problem/2022/A | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17185
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2021-E3 | codeforces | 2021-E3 | Digital Village (Extreme Version) | https://codeforces.com/problemset/problem/2021/E3 | [
"data structures",
"dfs and similar",
"dp",
"dsu",
"graphs",
"greedy",
"math",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 675
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2021-E2 | codeforces | 2021-E2 | Digital Village (Hard Version) | https://codeforces.com/problemset/problem/2021/E2 | [
"data structures",
"dp",
"dsu",
"graphs",
"math",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1196
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2021-E1 | codeforces | 2021-E1 | Digital Village (Easy Version) | https://codeforces.com/problemset/problem/2021/E1 | [
"brute force",
"data structures",
"dfs and similar",
"dp",
"dsu",
"fft",
"graphs",
"greedy",
"implementation",
"math",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1916
} | 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.