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: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": 138
} | 2026-08-10T02:20:32.917453+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": 195
} | 2026-08-10T02:20:32.917453+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": 615
} | 2026-08-10T02:20:32.917453+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": 1403
} | 2026-08-10T02:20:32.917453+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": 7314
} | 2026-08-10T02:20:32.917453+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": 16954
} | 2026-08-10T02:20:32.917453+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": 732
} | 2026-08-10T02:20:32.917453+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": 782
} | 2026-08-10T02:20:32.917453+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": 850
} | 2026-08-10T02:20:32.917453+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": 4154
} | 2026-08-10T02:20:32.917453+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": 6786
} | 2026-08-10T02:20:32.917453+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": 14948
} | 2026-08-10T02:20:32.917453+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": 17452
} | 2026-08-10T02:20:32.917453+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": 729
} | 2026-08-10T02:20:32.917453+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": 1257
} | 2026-08-10T02:20:32.917453+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": 1967
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2021-D | codeforces | 2021-D | Boss, Thirsty | https://codeforces.com/problemset/problem/2021/D | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 978
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2021-C2 | codeforces | 2021-C2 | Adjust The Presentation (Hard Version) | https://codeforces.com/problemset/problem/2021/C2 | [
"constructive algorithms",
"data structures",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4601
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2021-C1 | codeforces | 2021-C1 | Adjust The Presentation (Easy Version) | https://codeforces.com/problemset/problem/2021/C1 | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 14367
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2021-B | codeforces | 2021-B | Maximize Mex | https://codeforces.com/problemset/problem/2021/B | [
"brute force",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 19211
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2021-A | codeforces | 2021-A | Meaning Mean | https://codeforces.com/problemset/problem/2021/A | [
"data structures",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21830
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2020-F | codeforces | 2020-F | Count Leaves | https://codeforces.com/problemset/problem/2020/F | [
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 275
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2020-E | codeforces | 2020-E | Expected Power | https://codeforces.com/problemset/problem/2020/E | [
"bitmasks",
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4105
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2020-D | codeforces | 2020-D | Connect the Dots | https://codeforces.com/problemset/problem/2020/D | [
"brute force",
"dp",
"dsu",
"graphs",
"math",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7599
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2020-C | codeforces | 2020-C | Bitwise Balancing | https://codeforces.com/problemset/problem/2020/C | [
"bitmasks",
"hashing",
"implementation",
"math",
"schedules",
"ternary search"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 18781
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2020-B | codeforces | 2020-B | Brightness Begins | https://codeforces.com/problemset/problem/2020/B | [
"binary search",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 22147
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2020-A | codeforces | 2020-A | Find Minimum Operations | https://codeforces.com/problemset/problem/2020/A | [
"bitmasks",
"brute force",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26326
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2019-B | codeforces | 2019-B | All Pairs Segments | https://codeforces.com/problemset/problem/2019/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17613
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2019-A | codeforces | 2019-A | Max Plus Size | https://codeforces.com/problemset/problem/2019/A | [
"brute force",
"dp",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27595
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2018-F3 | codeforces | 2018-F3 | Speedbreaker Counting (Hard Version) | https://codeforces.com/problemset/problem/2018/F3 | [
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 340
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2018-F2 | codeforces | 2018-F2 | Speedbreaker Counting (Medium Version) | https://codeforces.com/problemset/problem/2018/F2 | [
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 302
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2018-F1 | codeforces | 2018-F1 | Speedbreaker Counting (Easy Version) | https://codeforces.com/problemset/problem/2018/F1 | [
"combinatorics",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 345
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2018-E2 | codeforces | 2018-E2 | Complex Segments (Hard Version) | https://codeforces.com/problemset/problem/2018/E2 | [
"binary search",
"data structures",
"divide and conquer",
"dsu",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 211
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2018-E1 | codeforces | 2018-E1 | Complex Segments (Easy Version) | https://codeforces.com/problemset/problem/2018/E1 | [
"binary search",
"data structures",
"divide and conquer",
"dsu",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 247
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2018-D | codeforces | 2018-D | Max Plus Min Plus Size | https://codeforces.com/problemset/problem/2018/D | [
"data structures",
"dp",
"dsu",
"greedy",
"implementation",
"matrices",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2251
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2018-C | codeforces | 2018-C | Tree Pruning | https://codeforces.com/problemset/problem/2018/C | [
"brute force",
"dfs and similar",
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10223
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2018-B | codeforces | 2018-B | Speedbreaker | https://codeforces.com/problemset/problem/2018/B | [
"binary search",
"data structures",
"dp",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5331
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2018-A | codeforces | 2018-A | Cards Partition | https://codeforces.com/problemset/problem/2018/A | [
"2-sat",
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12871
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2014-H | codeforces | 2014-H | Robin Hood Archery | https://codeforces.com/problemset/problem/2014/H | [
"data structures",
"divide and conquer",
"greedy",
"hashing"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6089
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2014-G | codeforces | 2014-G | Milky Days | https://codeforces.com/problemset/problem/2014/G | [
"brute force",
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1835
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2014-F | codeforces | 2014-F | Sheriff's Defense | https://codeforces.com/problemset/problem/2014/F | [
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5319
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2014-E | codeforces | 2014-E | Rendez-vous de Marian et Robin | https://codeforces.com/problemset/problem/2014/E | [
"dfs and similar",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9443
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2014-D | codeforces | 2014-D | Robert Hood and Mrs Hood | https://codeforces.com/problemset/problem/2014/D | [
"brute force",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16323
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2014-C | codeforces | 2014-C | Robin Hood in Town | https://codeforces.com/problemset/problem/2014/C | [
"binary search",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 28161
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2014-B | codeforces | 2014-B | Robin Hood and the Major Oak | https://codeforces.com/problemset/problem/2014/B | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 33821
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2014-A | codeforces | 2014-A | Robin Helps | https://codeforces.com/problemset/problem/2014/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 46509
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2013-F2 | codeforces | 2013-F2 | Game in Tree (Hard Version) | https://codeforces.com/problemset/problem/2013/F2 | [
"binary search",
"data structures",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 172
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2013-F1 | codeforces | 2013-F1 | Game in Tree (Easy Version) | https://codeforces.com/problemset/problem/2013/F1 | [
"binary search",
"brute force",
"data structures",
"dp",
"games",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 680
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2013-E | codeforces | 2013-E | Prefix GCD | https://codeforces.com/problemset/problem/2013/E | [
"brute force",
"dp",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4391
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2013-D | codeforces | 2013-D | Minimize the Difference | https://codeforces.com/problemset/problem/2013/D | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7653
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2013-C | codeforces | 2013-C | Password Cracking | https://codeforces.com/problemset/problem/2013/C | [
"constructive algorithms",
"interactive",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14885
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2013-B | codeforces | 2013-B | Battle for Survive | https://codeforces.com/problemset/problem/2013/B | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 28703
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2013-A | codeforces | 2013-A | Zhan's Blender | https://codeforces.com/problemset/problem/2013/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31535
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2011-I | codeforces | 2011-I | Stack and Queue | https://codeforces.com/problemset/problem/2011/I | [
"*special",
"data structures",
"divide and conquer"
] | null | null | stdin_stdout | null | {
"solved_count": 24
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2011-H | codeforces | 2011-H | Strange Matrix | https://codeforces.com/problemset/problem/2011/H | [
"*special",
"graphs",
"greedy"
] | null | null | stdin_stdout | null | {
"solved_count": 58
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2011-G | codeforces | 2011-G | Removal of a Permutation | https://codeforces.com/problemset/problem/2011/G | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 51
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2011-F | codeforces | 2011-F | Good Subarray | https://codeforces.com/problemset/problem/2011/F | [
"*special",
"data structures",
"greedy"
] | null | null | stdin_stdout | null | {
"solved_count": 132
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2011-E | codeforces | 2011-E | Rock-Paper-Scissors Bot | https://codeforces.com/problemset/problem/2011/E | [
"*special",
"greedy",
"strings"
] | null | null | stdin_stdout | null | {
"solved_count": 185
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2011-D | codeforces | 2011-D | Among Wolves | https://codeforces.com/problemset/problem/2011/D | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 285
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2011-C | codeforces | 2011-C | Split the Expression | https://codeforces.com/problemset/problem/2011/C | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 382
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2011-B | codeforces | 2011-B | Shuffle | https://codeforces.com/problemset/problem/2011/B | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 679
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2011-A | codeforces | 2011-A | Problem Solving | https://codeforces.com/problemset/problem/2011/A | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 1142
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2010-C2 | codeforces | 2010-C2 | Message Transmission Error (hard version) | https://codeforces.com/problemset/problem/2010/C2 | [
"hashing",
"string suffix structures",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4788
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2010-C1 | codeforces | 2010-C1 | Message Transmission Error (easy version) | https://codeforces.com/problemset/problem/2010/C1 | [
"brute force",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 9474
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2010-B | codeforces | 2010-B | Three Brothers | https://codeforces.com/problemset/problem/2010/B | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25029
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2010-A | codeforces | 2010-A | Alternating Sum of Numbers | https://codeforces.com/problemset/problem/2010/A | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21546
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2009-G3 | codeforces | 2009-G3 | Yunli's Subarray Queries (extreme version) | https://codeforces.com/problemset/problem/2009/G3 | [
"data structures",
"dp",
"implementation"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 555
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2009-G2 | codeforces | 2009-G2 | Yunli's Subarray Queries (hard version) | https://codeforces.com/problemset/problem/2009/G2 | [
"binary search",
"data structures",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1842
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2009-G1 | codeforces | 2009-G1 | Yunli's Subarray Queries (easy version) | https://codeforces.com/problemset/problem/2009/G1 | [
"binary search",
"data structures",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5637
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2009-F | codeforces | 2009-F | Firefly's Queries | https://codeforces.com/problemset/problem/2009/F | [
"bitmasks",
"data structures",
"flows",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8692
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2009-E | codeforces | 2009-E | Klee's SUPER DUPER LARGE Array!!! | https://codeforces.com/problemset/problem/2009/E | [
"binary search",
"math",
"ternary search"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 18182
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2009-D | codeforces | 2009-D | Satyam and Counting | https://codeforces.com/problemset/problem/2009/D | [
"geometry",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 19253
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2009-C | codeforces | 2009-C | The Legend of Freya the Frog | https://codeforces.com/problemset/problem/2009/C | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 33852
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2009-B | codeforces | 2009-B | osu!mania | https://codeforces.com/problemset/problem/2009/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 54389
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2009-A | codeforces | 2009-A | Minimize! | https://codeforces.com/problemset/problem/2009/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 75450
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2008-H | codeforces | 2008-H | Sakurako's Test | https://codeforces.com/problemset/problem/2008/H | [
"binary search",
"brute force",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3681
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2008-G | codeforces | 2008-G | Sakurako's Task | https://codeforces.com/problemset/problem/2008/G | [
"binary search",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6821
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2008-F | codeforces | 2008-F | Sakurako's Box | https://codeforces.com/problemset/problem/2008/F | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16000
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2008-E | codeforces | 2008-E | Alternating String | https://codeforces.com/problemset/problem/2008/E | [
"brute force",
"data structures",
"dp",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13926
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2008-D | codeforces | 2008-D | Sakurako's Hobby | https://codeforces.com/problemset/problem/2008/D | [
"dp",
"dsu",
"graphs",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 23926
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2008-C | codeforces | 2008-C | Longest Good Array | https://codeforces.com/problemset/problem/2008/C | [
"binary search",
"brute force",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 37087
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2008-B | codeforces | 2008-B | Square or Not | https://codeforces.com/problemset/problem/2008/B | [
"brute force",
"math",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 33314
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2008-A | codeforces | 2008-A | Sakurako's Exam | https://codeforces.com/problemset/problem/2008/A | [
"brute force",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 42414
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2007-C | codeforces | 2007-C | Dora and C++ | https://codeforces.com/problemset/problem/2007/C | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 16426
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2007-B | codeforces | 2007-B | Index and Maximum Value | https://codeforces.com/problemset/problem/2007/B | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 26039
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2007-A | codeforces | 2007-A | Dora's Set | https://codeforces.com/problemset/problem/2007/A | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25487
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2006-F | codeforces | 2006-F | Dora's Paint | https://codeforces.com/problemset/problem/2006/F | [
"brute force",
"combinatorics",
"constructive algorithms",
"graphs",
"implementation"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 178
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2006-E | codeforces | 2006-E | Iris's Full Binary Tree | https://codeforces.com/problemset/problem/2006/E | [
"brute force",
"data structures",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 328
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2006-D | codeforces | 2006-D | Iris and Adjacent Products | https://codeforces.com/problemset/problem/2006/D | [
"data structures",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 999
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2006-C | codeforces | 2006-C | Eri and Expanded Sets | https://codeforces.com/problemset/problem/2006/C | [
"data structures",
"divide and conquer",
"math",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2111
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2006-B | codeforces | 2006-B | Iris and the Tree | https://codeforces.com/problemset/problem/2006/B | [
"brute force",
"data structures",
"dfs and similar",
"dsu",
"math",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4450
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2006-A | codeforces | 2006-A | Iris and Game on the Tree | https://codeforces.com/problemset/problem/2006/A | [
"constructive algorithms",
"dfs and similar",
"games",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9801
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2005-E2 | codeforces | 2005-E2 | Subtangle Game (Hard Version) | https://codeforces.com/problemset/problem/2005/E2 | [
"data structures",
"dp",
"games",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1093
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2005-E1 | codeforces | 2005-E1 | Subtangle Game (Easy Version) | https://codeforces.com/problemset/problem/2005/E1 | [
"dp",
"games",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3377
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2005-D | codeforces | 2005-D | Alter the GCD | https://codeforces.com/problemset/problem/2005/D | [
"binary search",
"brute force",
"data structures",
"divide and conquer",
"implementation",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1287
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2005-C | codeforces | 2005-C | Lazy Narek | https://codeforces.com/problemset/problem/2005/C | [
"dp",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8847
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2005-B2 | codeforces | 2005-B2 | The Strict Teacher (Hard Version) | https://codeforces.com/problemset/problem/2005/B2 | [
"binary search",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 22229
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2005-B1 | codeforces | 2005-B1 | The Strict Teacher (Easy Version) | https://codeforces.com/problemset/problem/2005/B1 | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 25217
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2005-A | codeforces | 2005-A | Simple Palindrome | https://codeforces.com/problemset/problem/2005/A | [
"combinatorics",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 26765
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2004-G | codeforces | 2004-G | Substring Compression | https://codeforces.com/problemset/problem/2004/G | [
"data structures",
"dp",
"matrices"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 427
} | 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.