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:2063-E | codeforces | 2063-E | Triangle Tree | https://codeforces.com/problemset/problem/2063/E | [
"data structures",
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2433
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2063-D | codeforces | 2063-D | Game With Triangles | https://codeforces.com/problemset/problem/2063/D | [
"binary search",
"brute force",
"data structures",
"geometry",
"greedy",
"implementation",
"math",
"ternary search",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5184
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2063-C | codeforces | 2063-C | Remove Exactly Two | https://codeforces.com/problemset/problem/2063/C | [
"brute force",
"data structures",
"dfs and similar",
"dp",
"graphs",
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 15285
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2063-B | codeforces | 2063-B | Subsequence Update | https://codeforces.com/problemset/problem/2063/B | [
"constructive algorithms",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 23651
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2063-A | codeforces | 2063-A | Minimal Coprime | https://codeforces.com/problemset/problem/2063/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 32375
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2062-H | codeforces | 2062-H | Galaxy Generator | https://codeforces.com/problemset/problem/2062/H | [
"bitmasks",
"combinatorics",
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 206
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2062-G | codeforces | 2062-G | Permutation Factory | https://codeforces.com/problemset/problem/2062/G | [
"flows",
"geometry",
"graph matchings",
"graphs"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 211
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2062-F | codeforces | 2062-F | Traveling Salescat | https://codeforces.com/problemset/problem/2062/F | [
"constructive algorithms",
"dp",
"geometry",
"graphs",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 637
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2062-E2 | codeforces | 2062-E2 | The Game (Hard Version) | https://codeforces.com/problemset/problem/2062/E2 | [
"data structures",
"dfs and similar",
"games",
"graphs",
"implementation",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 466
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2062-E1 | codeforces | 2062-E1 | The Game (Easy Version) | https://codeforces.com/problemset/problem/2062/E1 | [
"data structures",
"dfs and similar",
"games",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4418
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2062-D | codeforces | 2062-D | Balanced Tree | https://codeforces.com/problemset/problem/2062/D | [
"dfs and similar",
"dp",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3637
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2062-C | codeforces | 2062-C | Cirno and Operations | https://codeforces.com/problemset/problem/2062/C | [
"brute force",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 18745
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2062-B | codeforces | 2062-B | Clockwork | https://codeforces.com/problemset/problem/2062/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 24165
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2062-A | codeforces | 2062-A | String | https://codeforces.com/problemset/problem/2062/A | [
"constructive algorithms",
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28592
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2061-I | codeforces | 2061-I | Kevin and Nivek | https://codeforces.com/problemset/problem/2061/I | [
"divide and conquer",
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 136
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2061-H2 | codeforces | 2061-H2 | Kevin and Stones (Hard Version) | https://codeforces.com/problemset/problem/2061/H2 | [
"flows",
"graphs"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 72
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2061-H1 | codeforces | 2061-H1 | Kevin and Stones (Easy Version) | https://codeforces.com/problemset/problem/2061/H1 | [
"flows",
"graph matchings",
"graphs"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 110
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2061-G | codeforces | 2061-G | Kevin and Teams | https://codeforces.com/problemset/problem/2061/G | [
"constructive algorithms",
"graphs",
"interactive"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 531
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2061-F2 | codeforces | 2061-F2 | Kevin and Binary String (Hard Version) | https://codeforces.com/problemset/problem/2061/F2 | [
"data structures",
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 155
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2061-F1 | codeforces | 2061-F1 | Kevin and Binary String (Easy Version) | https://codeforces.com/problemset/problem/2061/F1 | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2309
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2061-E | codeforces | 2061-E | Kevin and And | https://codeforces.com/problemset/problem/2061/E | [
"bitmasks",
"brute force",
"dp",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4077
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2061-D | codeforces | 2061-D | Kevin and Numbers | https://codeforces.com/problemset/problem/2061/D | [
"bitmasks",
"data structures"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11084
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2061-C | codeforces | 2061-C | Kevin and Puzzle | https://codeforces.com/problemset/problem/2061/C | [
"2-sat",
"combinatorics",
"dp"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10286
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2061-B | codeforces | 2061-B | Kevin and Geometry | https://codeforces.com/problemset/problem/2061/B | [
"binary search",
"geometry"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 14980
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2061-A | codeforces | 2061-A | Kevin and Arithmetic | https://codeforces.com/problemset/problem/2061/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22518
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2060-G | codeforces | 2060-G | Bugged Sort | https://codeforces.com/problemset/problem/2060/G | [
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1331
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2060-F | codeforces | 2060-F | Multiplicative Arrays | https://codeforces.com/problemset/problem/2060/F | [
"combinatorics",
"dp",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2659
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2060-E | codeforces | 2060-E | Graph Composition | https://codeforces.com/problemset/problem/2060/E | [
"dfs and similar",
"dsu",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12891
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2060-D | codeforces | 2060-D | Subtract Min Sort | https://codeforces.com/problemset/problem/2060/D | [
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 26721
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2060-C | codeforces | 2060-C | Game of Mathletes | https://codeforces.com/problemset/problem/2060/C | [
"games",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 900 | {
"solved_count": 32891
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2060-B | codeforces | 2060-B | Farmer John's Card Game | https://codeforces.com/problemset/problem/2060/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 29074
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2060-A | codeforces | 2060-A | Fibonacciness | https://codeforces.com/problemset/problem/2060/A | [
"brute force"
] | null | null | stdin_stdout | 800 | {
"solved_count": 41736
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2059-E2 | codeforces | 2059-E2 | Stop Gaming (Hard Version) | https://codeforces.com/problemset/problem/2059/E2 | [
"brute force",
"constructive algorithms",
"data structures",
"hashing",
"strings"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 357
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2059-E1 | codeforces | 2059-E1 | Stop Gaming (Easy Version) | https://codeforces.com/problemset/problem/2059/E1 | [
"brute force",
"constructive algorithms",
"greedy",
"hashing",
"strings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 909
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2059-D | codeforces | 2059-D | Graph and Graph | https://codeforces.com/problemset/problem/2059/D | [
"data structures",
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6764
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2059-C | codeforces | 2059-C | Customer Service | https://codeforces.com/problemset/problem/2059/C | [
"brute force",
"constructive algorithms",
"graph matchings",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12865
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2059-B | codeforces | 2059-B | Cost of the Array | https://codeforces.com/problemset/problem/2059/B | [
"brute force",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 19174
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2059-A | codeforces | 2059-A | Milya and Two Arrays | https://codeforces.com/problemset/problem/2059/A | [
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29449
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2057-H | codeforces | 2057-H | Coffee Break | https://codeforces.com/problemset/problem/2057/H | [
"data structures",
"greedy",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 190
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2057-G | codeforces | 2057-G | Secret Message | https://codeforces.com/problemset/problem/2057/G | [
"constructive algorithms",
"dfs and similar",
"math"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 768
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2057-F | codeforces | 2057-F | Formation | https://codeforces.com/problemset/problem/2057/F | [
"binary search",
"data structures",
"dp",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 250
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2057-E2 | codeforces | 2057-E2 | Another Exercise on Graphs (hard version) | https://codeforces.com/problemset/problem/2057/E2 | [
"binary search",
"dfs and similar",
"dp",
"dsu",
"graphs",
"shortest paths",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1993
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2057-E1 | codeforces | 2057-E1 | Another Exercise on Graphs (Easy Version) | https://codeforces.com/problemset/problem/2057/E1 | [
"binary search",
"brute force",
"dp",
"dsu",
"graphs",
"shortest paths",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2692
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2057-D | codeforces | 2057-D | Gifts Order | https://codeforces.com/problemset/problem/2057/D | [
"data structures",
"greedy",
"implementation",
"math",
"matrices"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5556
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2057-C | codeforces | 2057-C | Trip to the Olympiad | https://codeforces.com/problemset/problem/2057/C | [
"bitmasks",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14159
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2057-B | codeforces | 2057-B | Gorilla and the Exam | https://codeforces.com/problemset/problem/2057/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 23682
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2057-A | codeforces | 2057-A | MEX Table | https://codeforces.com/problemset/problem/2057/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27770
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2056-F2 | codeforces | 2056-F2 | Xor of Median (Hard Version) | https://codeforces.com/problemset/problem/2056/F2 | [
"bitmasks",
"brute force",
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 364
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2056-F1 | codeforces | 2056-F1 | Xor of Median (Easy Version) | https://codeforces.com/problemset/problem/2056/F1 | [
"bitmasks",
"brute force",
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 455
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2056-E | codeforces | 2056-E | Nested Segments | https://codeforces.com/problemset/problem/2056/E | [
"combinatorics",
"dfs and similar",
"dp",
"dsu",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1063
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2056-D | codeforces | 2056-D | Unique Median | https://codeforces.com/problemset/problem/2056/D | [
"binary search",
"brute force",
"combinatorics",
"data structures",
"divide and conquer",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3729
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2056-C | codeforces | 2056-C | Palindromic Subsequences | https://codeforces.com/problemset/problem/2056/C | [
"brute force",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 19821
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2056-B | codeforces | 2056-B | Find the Permutation | https://codeforces.com/problemset/problem/2056/B | [
"brute force",
"dfs and similar",
"graphs",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 18230
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2056-A | codeforces | 2056-A | Shape Perimeter | https://codeforces.com/problemset/problem/2056/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26979
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2055-F | codeforces | 2055-F | Cosmic Divide | https://codeforces.com/problemset/problem/2055/F | [
"brute force",
"geometry",
"hashing",
"math",
"strings"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 91
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2055-E | codeforces | 2055-E | Haystacks | https://codeforces.com/problemset/problem/2055/E | [
"brute force",
"constructive algorithms",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 506
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2055-D | codeforces | 2055-D | Scarecrow | https://codeforces.com/problemset/problem/2055/D | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4431
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2055-C | codeforces | 2055-C | The Trail | https://codeforces.com/problemset/problem/2055/C | [
"brute force",
"constructive algorithms",
"greedy",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 17614
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2055-B | codeforces | 2055-B | Crafting | https://codeforces.com/problemset/problem/2055/B | [
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 27764
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2055-A | codeforces | 2055-A | Two Frogs | https://codeforces.com/problemset/problem/2055/A | [
"constructive algorithms",
"games",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 34022
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2053-I2 | codeforces | 2053-I2 | Affectionate Arrays (Hard Version) | https://codeforces.com/problemset/problem/2053/I2 | [
"data structures",
"dp",
"graphs",
"greedy",
"math",
"shortest paths",
"two pointers"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 111
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2053-I1 | codeforces | 2053-I1 | Affectionate Arrays (Easy Version) | https://codeforces.com/problemset/problem/2053/I1 | [
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 567
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2053-H | codeforces | 2053-H | Delicate Anti-monotonous Operations | https://codeforces.com/problemset/problem/2053/H | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 85
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2053-G | codeforces | 2053-G | Naive String Splits | https://codeforces.com/problemset/problem/2053/G | [
"binary search",
"brute force",
"greedy",
"hashing",
"math",
"number theory",
"strings"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 229
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2053-F | codeforces | 2053-F | Earnest Matrix Complement | https://codeforces.com/problemset/problem/2053/F | [
"brute force",
"data structures",
"dp",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 964
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2053-E | codeforces | 2053-E | Resourceful Caterpillar Sequence | https://codeforces.com/problemset/problem/2053/E | [
"dfs and similar",
"dp",
"games",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4586
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2053-D | codeforces | 2053-D | Refined Product Optimality | https://codeforces.com/problemset/problem/2053/D | [
"binary search",
"data structures",
"greedy",
"math",
"schedules",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7841
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2053-C | codeforces | 2053-C | Bewitching Stargazer | https://codeforces.com/problemset/problem/2053/C | [
"bitmasks",
"divide and conquer",
"dp",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12609
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2053-B | codeforces | 2053-B | Outstanding Impressionist | https://codeforces.com/problemset/problem/2053/B | [
"binary search",
"brute force",
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17282
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2053-A | codeforces | 2053-A | Tender Carpenter | https://codeforces.com/problemset/problem/2053/A | [
"dp",
"geometry",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21394
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2052-M | codeforces | 2052-M | Managing Cluster | https://codeforces.com/problemset/problem/2052/M | [
"dp",
"graphs",
"math",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 405
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2052-L | codeforces | 2052-L | Legacy Screensaver | https://codeforces.com/problemset/problem/2052/L | [] | null | null | stdin_stdout | 2,900 | {
"solved_count": 159
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2052-K | codeforces | 2052-K | Knowns and Unknowns | https://codeforces.com/problemset/problem/2052/K | [] | null | null | stdin_stdout | 2,800 | {
"solved_count": 103
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2052-J | codeforces | 2052-J | Judicious Watching | https://codeforces.com/problemset/problem/2052/J | [
"binary search",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1585
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2052-I | codeforces | 2052-I | Incompetent Delivery Guy | https://codeforces.com/problemset/problem/2052/I | [
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 155
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2052-H | codeforces | 2052-H | Hunting Hoglins in Hogwarts | https://codeforces.com/problemset/problem/2052/H | [
"interactive"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 74
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2052-G | codeforces | 2052-G | Geometric Balance | https://codeforces.com/problemset/problem/2052/G | [
"data structures",
"geometry",
"implementation"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 210
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2052-F | codeforces | 2052-F | Fix Flooded Floor | https://codeforces.com/problemset/problem/2052/F | [
"constructive algorithms",
"dp",
"graphs"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3884
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2052-E | codeforces | 2052-E | Expression Correction | https://codeforces.com/problemset/problem/2052/E | [
"brute force",
"expression parsing",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1540
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2052-D | codeforces | 2052-D | DAG Serialization | https://codeforces.com/problemset/problem/2052/D | [
"brute force",
"graphs"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1241
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2052-C | codeforces | 2052-C | Cactus without Bridges | https://codeforces.com/problemset/problem/2052/C | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 65
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2052-B | codeforces | 2052-B | BitBitJump | https://codeforces.com/problemset/problem/2052/B | [] | null | null | stdin_stdout | 2,400 | {
"solved_count": 455
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2052-A | codeforces | 2052-A | Adrenaline Rush | https://codeforces.com/problemset/problem/2052/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4423
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2051-G | codeforces | 2051-G | Snakes | https://codeforces.com/problemset/problem/2051/G | [
"bitmasks",
"dp",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2498
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2051-F | codeforces | 2051-F | Joker | https://codeforces.com/problemset/problem/2051/F | [
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4082
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2051-E | codeforces | 2051-E | Best Price | https://codeforces.com/problemset/problem/2051/E | [
"binary search",
"brute force",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12345
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2051-D | codeforces | 2051-D | Counting Pairs | https://codeforces.com/problemset/problem/2051/D | [
"binary search",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 24759
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2051-C | codeforces | 2051-C | Preparing for the Exam | https://codeforces.com/problemset/problem/2051/C | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 28554
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2051-B | codeforces | 2051-B | Journey | https://codeforces.com/problemset/problem/2051/B | [
"binary search",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 40702
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2051-A | codeforces | 2051-A | Preparing for the Olympiad | https://codeforces.com/problemset/problem/2051/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 35578
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2050-G | codeforces | 2050-G | Tree Destruction | https://codeforces.com/problemset/problem/2050/G | [
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5563
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2050-F | codeforces | 2050-F | Maximum modulo equality | https://codeforces.com/problemset/problem/2050/F | [
"data structures",
"divide and conquer",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11398
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2050-E | codeforces | 2050-E | Three Strings | https://codeforces.com/problemset/problem/2050/E | [
"dp",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15068
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2050-D | codeforces | 2050-D | Digital string maximization | https://codeforces.com/problemset/problem/2050/D | [
"brute force",
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 19486
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2050-C | codeforces | 2050-C | Uninteresting Number | https://codeforces.com/problemset/problem/2050/C | [
"brute force",
"dp",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 25701
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2050-B | codeforces | 2050-B | Transfusion | https://codeforces.com/problemset/problem/2050/B | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 27770
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2050-A | codeforces | 2050-A | Line Breaks | https://codeforces.com/problemset/problem/2050/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 36882
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2049-F | codeforces | 2049-F | MEX OR Mania | https://codeforces.com/problemset/problem/2049/F | [
"bitmasks",
"brute force",
"data structures",
"dsu",
"implementation"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 601
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2049-E | codeforces | 2049-E | Broken Queries | https://codeforces.com/problemset/problem/2049/E | [
"binary search",
"bitmasks",
"brute force",
"constructive algorithms",
"implementation",
"interactive"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1628
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:2049-D | codeforces | 2049-D | Shift + Esc | https://codeforces.com/problemset/problem/2049/D | [
"brute force",
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6161
} | 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.