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:2038-C | codeforces | 2038-C | DIY | https://codeforces.com/problemset/problem/2038/C | [
"data structures",
"geometry",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7220
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2038-B | codeforces | 2038-B | Make It Equal | https://codeforces.com/problemset/problem/2038/B | [
"binary search",
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1978
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2038-A | codeforces | 2038-A | Bonus Project | https://codeforces.com/problemset/problem/2038/A | [
"games",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 5636
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2037-G | codeforces | 2037-G | Natlan Exploring | https://codeforces.com/problemset/problem/2037/G | [
"bitmasks",
"combinatorics",
"data structures",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3896
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2037-F | codeforces | 2037-F | Ardent Flames | https://codeforces.com/problemset/problem/2037/F | [
"binary search",
"data structures",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3038
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2037-E | codeforces | 2037-E | Kachina's Favorite Binary String | https://codeforces.com/problemset/problem/2037/E | [
"dp",
"greedy",
"interactive",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7623
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2037-D | codeforces | 2037-D | Sharky Surfing | https://codeforces.com/problemset/problem/2037/D | [
"data structures",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15084
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2037-C | codeforces | 2037-C | Superultra's Favorite Permutation | https://codeforces.com/problemset/problem/2037/C | [
"constructive algorithms",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 26087
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2037-B | codeforces | 2037-B | Intercepted Inputs | https://codeforces.com/problemset/problem/2037/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25819
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2037-A | codeforces | 2037-A | Twice | https://codeforces.com/problemset/problem/2037/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 36369
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2036-G | codeforces | 2036-G | Library of Magic | https://codeforces.com/problemset/problem/2036/G | [
"binary search",
"constructive algorithms",
"divide and conquer",
"interactive",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1741
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2036-F | codeforces | 2036-F | XORificator 3000 | https://codeforces.com/problemset/problem/2036/F | [
"bitmasks",
"dp",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5507
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2036-E | codeforces | 2036-E | Reverse the Rivers | https://codeforces.com/problemset/problem/2036/E | [
"binary search",
"constructive algorithms",
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9824
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2036-D | codeforces | 2036-D | I Love 1543 | https://codeforces.com/problemset/problem/2036/D | [
"brute force",
"implementation",
"matrices"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16318
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2036-C | codeforces | 2036-C | Anya and 1100 | https://codeforces.com/problemset/problem/2036/C | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 22526
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2036-B | codeforces | 2036-B | Startup | https://codeforces.com/problemset/problem/2036/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 30065
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2036-A | codeforces | 2036-A | Quintomania | https://codeforces.com/problemset/problem/2036/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 41242
} | 2026-08-10T02:20:32.917453+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": 102
} | 2026-08-10T02:20:32.917453+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": 116
} | 2026-08-10T02:20:32.917453+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": 177
} | 2026-08-10T02:20:32.917453+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": 1125
} | 2026-08-10T02:20:32.917453+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": 1990
} | 2026-08-10T02:20:32.917453+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": 5923
} | 2026-08-10T02:20:32.917453+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": 11809
} | 2026-08-10T02:20:32.917453+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": 20979
} | 2026-08-10T02:20:32.917453+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": 18039
} | 2026-08-10T02:20:32.917453+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": 200
} | 2026-08-10T02:20:32.917453+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": 86
} | 2026-08-10T02:20:32.917453+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": 82
} | 2026-08-10T02:20:32.917453+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": 612
} | 2026-08-10T02:20:32.917453+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": 911
} | 2026-08-10T02:20:32.917453+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": 2057
} | 2026-08-10T02:20:32.917453+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": 6807
} | 2026-08-10T02:20:32.917453+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": 9390
} | 2026-08-10T02:20:32.917453+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": 16120
} | 2026-08-10T02:20:32.917453+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": 18625
} | 2026-08-10T02:20:32.917453+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": 2061
} | 2026-08-10T02:20:32.917453+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": 7315
} | 2026-08-10T02:20:32.917453+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": 14825
} | 2026-08-10T02:20:32.917453+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": 18614
} | 2026-08-10T02:20:32.917453+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": 18321
} | 2026-08-10T02:20:32.917453+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": 29331
} | 2026-08-10T02:20:32.917453+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": 41771
} | 2026-08-10T02:20:32.917453+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": 501
} | 2026-08-10T02:20:32.917453+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": 1429
} | 2026-08-10T02:20:32.917453+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": 6352
} | 2026-08-10T02:20:32.917453+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": 16624
} | 2026-08-10T02:20:32.917453+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": 21088
} | 2026-08-10T02:20:32.917453+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": 24959
} | 2026-08-10T02:20:32.917453+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": 483
} | 2026-08-10T02:20:32.917453+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": 2766
} | 2026-08-10T02:20:32.917453+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": 10143
} | 2026-08-10T02:20:32.917453+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": 16087
} | 2026-08-10T02:20:32.917453+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": 21184
} | 2026-08-10T02:20:32.917453+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": 21293
} | 2026-08-10T02:20:32.917453+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": 209
} | 2026-08-10T02:20:32.917453+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": 272
} | 2026-08-10T02:20:32.917453+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": 1217
} | 2026-08-10T02:20:32.917453+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": 2012
} | 2026-08-10T02:20:32.917453+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": 8890
} | 2026-08-10T02:20:32.917453+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": 20210
} | 2026-08-10T02:20:32.917453+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": 24067
} | 2026-08-10T02:20:32.917453+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": 27837
} | 2026-08-10T02:20:32.917453+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": 173
} | 2026-08-10T02:20:32.917453+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": 112
} | 2026-08-10T02:20:32.917453+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": 266
} | 2026-08-10T02:20:32.917453+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": 869
} | 2026-08-10T02:20:32.917453+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": 3606
} | 2026-08-10T02:20:32.917453+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": 4020
} | 2026-08-10T02:20:32.917453+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": 7860
} | 2026-08-10T02:20:32.917453+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": 12001
} | 2026-08-10T02:20:32.917453+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": 14320
} | 2026-08-10T02:20:32.917453+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": 560
} | 2026-08-10T02:20:32.917453+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": 1991
} | 2026-08-10T02:20:32.917453+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": 3836
} | 2026-08-10T02:20:32.917453+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": 10296
} | 2026-08-10T02:20:32.917453+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": 13611
} | 2026-08-10T02:20:32.917453+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": 20689
} | 2026-08-10T02:20:32.917453+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": 112
} | 2026-08-10T02:20:32.917453+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": 272
} | 2026-08-10T02:20:32.917453+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": 1948
} | 2026-08-10T02:20:32.917453+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": 7156
} | 2026-08-10T02:20:32.917453+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": 14191
} | 2026-08-10T02:20:32.917453+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": 18018
} | 2026-08-10T02:20:32.917453+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": 22268
} | 2026-08-10T02:20:32.917453+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": 415
} | 2026-08-10T02:20:32.917453+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": 2118
} | 2026-08-10T02:20:32.917453+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": 6130
} | 2026-08-10T02:20:32.917453+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": 12963
} | 2026-08-10T02:20:32.917453+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": 16850
} | 2026-08-10T02:20:32.917453+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": 20573
} | 2026-08-10T02:20:32.917453+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": 234
} | 2026-08-10T02:20:32.917453+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": 1087
} | 2026-08-10T02:20:32.917453+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": 2401
} | 2026-08-10T02:20:32.917453+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": 8079
} | 2026-08-10T02:20:32.917453+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": 19500
} | 2026-08-10T02:20:32.917453+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": 19888
} | 2026-08-10T02:20:32.917453+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": 29217
} | 2026-08-10T02:20:32.917453+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": 17392
} | 2026-08-10T02:20:32.917453+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": 23248
} | 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.