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:2066-A | codeforces | 2066-A | Object Identification | https://codeforces.com/problemset/problem/2066/A | [
"graphs",
"greedy",
"implementation",
"interactive"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7504
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2065-H | codeforces | 2065-H | Bro Thinks He's Him | https://codeforces.com/problemset/problem/2065/H | [
"combinatorics",
"data structures",
"divide and conquer",
"dp",
"math",
"matrices"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2086
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2065-G | codeforces | 2065-G | Skibidus and Capping | https://codeforces.com/problemset/problem/2065/G | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6711
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2065-F | codeforces | 2065-F | Skibidus and Slay | https://codeforces.com/problemset/problem/2065/F | [
"data structures",
"dfs and similar",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7555
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2065-E | codeforces | 2065-E | Skibidus and Rizz | https://codeforces.com/problemset/problem/2065/E | [
"constructive algorithms",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12643
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2065-D | codeforces | 2065-D | Skibidus and Sigma | https://codeforces.com/problemset/problem/2065/D | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 21495
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2065-C2 | codeforces | 2065-C2 | Skibidus and Fanum Tax (hard version) | https://codeforces.com/problemset/problem/2065/C2 | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 19617
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2065-C1 | codeforces | 2065-C1 | Skibidus and Fanum Tax (easy version) | https://codeforces.com/problemset/problem/2065/C1 | [
"binary search",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 28862
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2065-B | codeforces | 2065-B | Skibidus and Ohio | https://codeforces.com/problemset/problem/2065/B | [
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 43723
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2065-A | codeforces | 2065-A | Skibidus and Amog'u | https://codeforces.com/problemset/problem/2065/A | [
"brute force",
"constructive algorithms",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 58031
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2064-F | codeforces | 2064-F | We Be Summing | https://codeforces.com/problemset/problem/2064/F | [
"binary search",
"data structures",
"dp",
"two pointers"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 750
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2064-E | codeforces | 2064-E | Mycraft Sand Sort | https://codeforces.com/problemset/problem/2064/E | [
"combinatorics",
"data structures",
"dsu",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1572
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2064-D | codeforces | 2064-D | Eating | https://codeforces.com/problemset/problem/2064/D | [
"binary search",
"bitmasks",
"brute force",
"data structures",
"dp",
"greedy",
"trees",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6117
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2064-C | codeforces | 2064-C | Remove the Ends | https://codeforces.com/problemset/problem/2064/C | [
"brute force",
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 18461
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2064-B | codeforces | 2064-B | Variety is Discouraged | https://codeforces.com/problemset/problem/2064/B | [
"binary search",
"constructive algorithms",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 20685
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2064-A | codeforces | 2064-A | Brogramming Contest | https://codeforces.com/problemset/problem/2064/A | [
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27501
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2063-F2 | codeforces | 2063-F2 | Counting Is Not Fun (Hard Version) | https://codeforces.com/problemset/problem/2063/F2 | [
"combinatorics",
"data structures",
"dfs and similar",
"dsu",
"graphs",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 993
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2063-F1 | codeforces | 2063-F1 | Counting Is Not Fun (Easy Version) | https://codeforces.com/problemset/problem/2063/F1 | [
"combinatorics",
"data structures",
"dfs and similar",
"dp",
"dsu",
"graphs",
"hashing",
"implementation",
"math",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1616
} | 2026-10-26T04:20:41.456672+00:00 |
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": 2481
} | 2026-10-26T04:20:41.456672+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": 5262
} | 2026-10-26T04:20:41.456672+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": 15605
} | 2026-10-26T04:20:41.456672+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": 23887
} | 2026-10-26T04:20:41.456672+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": 32599
} | 2026-10-26T04:20:41.456672+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": 213
} | 2026-10-26T04:20:41.456672+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": 227
} | 2026-10-26T04:20:41.456672+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": 651
} | 2026-10-26T04:20:41.456672+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": 491
} | 2026-10-26T04:20:41.456672+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": 4488
} | 2026-10-26T04:20:41.456672+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": 3711
} | 2026-10-26T04:20:41.456672+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": 18981
} | 2026-10-26T04:20:41.456672+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": 24438
} | 2026-10-26T04:20:41.456672+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": 28781
} | 2026-10-26T04:20:41.456672+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": 148
} | 2026-10-26T04:20:41.456672+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": 86
} | 2026-10-26T04:20:41.456672+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": 114
} | 2026-10-26T04:20:41.456672+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": 569
} | 2026-10-26T04:20:41.456672+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": 159
} | 2026-10-26T04:20:41.456672+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": 2346
} | 2026-10-26T04:20:41.456672+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": 4150
} | 2026-10-26T04:20:41.456672+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": 11264
} | 2026-10-26T04:20:41.456672+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": 10506
} | 2026-10-26T04:20:41.456672+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": 15135
} | 2026-10-26T04:20:41.456672+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": 22621
} | 2026-10-26T04:20:41.456672+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": 1367
} | 2026-10-26T04:20:41.456672+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": 2723
} | 2026-10-26T04:20:41.456672+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": 13241
} | 2026-10-26T04:20:41.456672+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": 27031
} | 2026-10-26T04:20:41.456672+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": 33496
} | 2026-10-26T04:20:41.456672+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": 29370
} | 2026-10-26T04:20:41.456672+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": 42209
} | 2026-10-26T04:20:41.456672+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": 362
} | 2026-10-26T04:20:41.456672+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": 918
} | 2026-10-26T04:20:41.456672+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": 6874
} | 2026-10-26T04:20:41.456672+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": 13049
} | 2026-10-26T04:20:41.456672+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": 19370
} | 2026-10-26T04:20:41.456672+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": 29622
} | 2026-10-26T04:20:41.456672+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": 193
} | 2026-10-26T04:20:41.456672+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": 833
} | 2026-10-26T04:20:41.456672+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": 256
} | 2026-10-26T04:20:41.456672+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": 2256
} | 2026-10-26T04:20:41.456672+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": 2822
} | 2026-10-26T04:20:41.456672+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": 5634
} | 2026-10-26T04:20:41.456672+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": 14333
} | 2026-10-26T04:20:41.456672+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": 23905
} | 2026-10-26T04:20:41.456672+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": 27911
} | 2026-10-26T04:20:41.456672+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": 379
} | 2026-10-26T04:20:41.456672+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": 469
} | 2026-10-26T04:20:41.456672+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": 1080
} | 2026-10-26T04:20:41.456672+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": 3788
} | 2026-10-26T04:20:41.456672+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": 20035
} | 2026-10-26T04:20:41.456672+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": 18434
} | 2026-10-26T04:20:41.456672+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": 27098
} | 2026-10-26T04:20:41.456672+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": 92
} | 2026-10-26T04:20:41.456672+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": 636
} | 2026-10-26T04:20:41.456672+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": 4499
} | 2026-10-26T04:20:41.456672+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": 17869
} | 2026-10-26T04:20:41.456672+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": 28020
} | 2026-10-26T04:20:41.456672+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": 34277
} | 2026-10-26T04:20:41.456672+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": 112
} | 2026-10-26T04:20:41.456672+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": 577
} | 2026-10-26T04:20:41.456672+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": 91
} | 2026-10-26T04:20:41.456672+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": 267
} | 2026-10-26T04:20:41.456672+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": 984
} | 2026-10-26T04:20:41.456672+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": 4659
} | 2026-10-26T04:20:41.456672+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": 7899
} | 2026-10-26T04:20:41.456672+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": 12755
} | 2026-10-26T04:20:41.456672+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": 17432
} | 2026-10-26T04:20:41.456672+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": 21464
} | 2026-10-26T04:20:41.456672+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": 505
} | 2026-10-26T04:20:41.456672+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": 166
} | 2026-10-26T04:20:41.456672+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": 110
} | 2026-10-26T04:20:41.456672+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": 1647
} | 2026-10-26T04:20:41.456672+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": 173
} | 2026-10-26T04:20:41.456672+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": 85
} | 2026-10-26T04:20:41.456672+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": 214
} | 2026-10-26T04:20:41.456672+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": 3991
} | 2026-10-26T04:20:41.456672+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": 1593
} | 2026-10-26T04:20:41.456672+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": 1280
} | 2026-10-26T04:20:41.456672+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": 85
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2052-B | codeforces | 2052-B | BitBitJump | https://codeforces.com/problemset/problem/2052/B | [] | null | null | stdin_stdout | 2,400 | {
"solved_count": 467
} | 2026-10-26T04:20:41.456672+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.