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:2073-C | codeforces | 2073-C | Cactus Connectivity | https://codeforces.com/problemset/problem/2073/C | [] | null | null | stdin_stdout | 2,700 | {
"solved_count": 337
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2073-B | codeforces | 2073-B | Three-Dimensional Embedding | https://codeforces.com/problemset/problem/2073/B | [] | null | null | stdin_stdout | 3,500 | {
"solved_count": 44
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2073-A | codeforces | 2073-A | Control Towers | https://codeforces.com/problemset/problem/2073/A | [] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1247
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2072-G | codeforces | 2072-G | I've Been Flipping Numbers for 300 Years and Calculated the Sum | https://codeforces.com/problemset/problem/2072/G | [
"binary search",
"brute force",
"combinatorics",
"divide and conquer",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2162
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2072-F | codeforces | 2072-F | Goodbye, Banker Life | https://codeforces.com/problemset/problem/2072/F | [
"2-sat",
"bitmasks",
"combinatorics",
"constructive algorithms",
"fft",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8521
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2072-E | codeforces | 2072-E | Do You Love Your Hero and His Two-Hit Multi-Target Attacks? | https://codeforces.com/problemset/problem/2072/E | [
"binary search",
"brute force",
"constructive algorithms",
"dp",
"geometry",
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12371
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2072-D | codeforces | 2072-D | For Wizards, the Exam Is Easy, but I Couldn't Handle It | https://codeforces.com/problemset/problem/2072/D | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 17764
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2072-C | codeforces | 2072-C | Creating Keys for StORages Has Become My Main Skill | https://codeforces.com/problemset/problem/2072/C | [
"bitmasks",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 19691
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2072-B | codeforces | 2072-B | Having Been a Treasurer in the Past, I Help Goblins Deceive | https://codeforces.com/problemset/problem/2072/B | [
"combinatorics",
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 31088
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2072-A | codeforces | 2072-A | New World, New Me, New Array | https://codeforces.com/problemset/problem/2072/A | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 40803
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2071-F | codeforces | 2071-F | Towering Arrays | https://codeforces.com/problemset/problem/2071/F | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 349
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2071-E | codeforces | 2071-E | LeaFall | https://codeforces.com/problemset/problem/2071/E | [
"combinatorics",
"dp",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 826
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2071-D2 | codeforces | 2071-D2 | Infinite Sequence (Hard Version) | https://codeforces.com/problemset/problem/2071/D2 | [
"bitmasks",
"brute force",
"constructive algorithms",
"data structures",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1110
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2071-D1 | codeforces | 2071-D1 | Infinite Sequence (Easy Version) | https://codeforces.com/problemset/problem/2071/D1 | [
"bitmasks",
"brute force",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6746
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2071-C | codeforces | 2071-C | Trapmigiano Reggiano | https://codeforces.com/problemset/problem/2071/C | [
"constructive algorithms",
"data structures",
"dfs and similar",
"dp",
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9777
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2071-B | codeforces | 2071-B | Perfecto | https://codeforces.com/problemset/problem/2071/B | [
"brute force",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 20989
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2071-A | codeforces | 2071-A | The Play Never Ends | https://codeforces.com/problemset/problem/2071/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27907
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2070-F | codeforces | 2070-F | Friends and Pizza | https://codeforces.com/problemset/problem/2070/F | [
"bitmasks",
"divide and conquer",
"dp",
"fft"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 373
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2070-E | codeforces | 2070-E | Game with Binary String | https://codeforces.com/problemset/problem/2070/E | [
"constructive algorithms",
"data structures",
"divide and conquer",
"games",
"greedy",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1876
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2070-D | codeforces | 2070-D | Tree Jumps | https://codeforces.com/problemset/problem/2070/D | [
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11235
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2070-C | codeforces | 2070-C | Limited Repainting | https://codeforces.com/problemset/problem/2070/C | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13947
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2070-B | codeforces | 2070-B | Robot Program | https://codeforces.com/problemset/problem/2070/B | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 19794
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2070-A | codeforces | 2070-A | FizzBuzz Remixed | https://codeforces.com/problemset/problem/2070/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26569
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2069-F | codeforces | 2069-F | Graph Inclusion | https://codeforces.com/problemset/problem/2069/F | [
"data structures",
"dfs and similar",
"divide and conquer",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 796
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2069-E | codeforces | 2069-E | A, B, AB and BA | https://codeforces.com/problemset/problem/2069/E | [
"constructive algorithms",
"greedy",
"sortings",
"strings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1929
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2069-D | codeforces | 2069-D | Palindrome Shuffle | https://codeforces.com/problemset/problem/2069/D | [
"binary search",
"greedy",
"hashing",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7104
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2069-C | codeforces | 2069-C | Beautiful Sequence | https://codeforces.com/problemset/problem/2069/C | [
"combinatorics",
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14950
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2069-B | codeforces | 2069-B | Set of Strangers | https://codeforces.com/problemset/problem/2069/B | [
"greedy",
"matrices"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 18901
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2069-A | codeforces | 2069-A | Was there an Array? | https://codeforces.com/problemset/problem/2069/A | [
"graph matchings",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26602
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2068-K | codeforces | 2068-K | Amusement Park Rides | https://codeforces.com/problemset/problem/2068/K | [
"flows",
"graphs"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 209
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2068-J | codeforces | 2068-J | The Ultimate Wine Tasting Event | https://codeforces.com/problemset/problem/2068/J | [
"combinatorics",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1634
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2068-I | codeforces | 2068-I | Pinball | https://codeforces.com/problemset/problem/2068/I | [
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 62
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2068-H | codeforces | 2068-H | Statues | https://codeforces.com/problemset/problem/2068/H | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 410
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2068-G | codeforces | 2068-G | A Very Long Hike | https://codeforces.com/problemset/problem/2068/G | [
"shortest paths"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 65
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2068-F | codeforces | 2068-F | Mascot Naming | https://codeforces.com/problemset/problem/2068/F | [
"brute force",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1511
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2068-E | codeforces | 2068-E | Porto Vs. Benfica | https://codeforces.com/problemset/problem/2068/E | [
"data structures",
"dfs and similar",
"dsu",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 372
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2068-D | codeforces | 2068-D | Morse Code | https://codeforces.com/problemset/problem/2068/D | [
"dp",
"sortings",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 267
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2068-C | codeforces | 2068-C | Ads | https://codeforces.com/problemset/problem/2068/C | [
"binary search",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1657
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2068-B | codeforces | 2068-B | Urban Planning | https://codeforces.com/problemset/problem/2068/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 145
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2068-A | codeforces | 2068-A | Condorcet Elections | https://codeforces.com/problemset/problem/2068/A | [
"constructive algorithms",
"graphs",
"greedy",
"probabilities"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1009
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2067-C | codeforces | 2067-C | Devyatkino | https://codeforces.com/problemset/problem/2067/C | [
"brute force",
"dfs and similar",
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12825
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2067-B | codeforces | 2067-B | Two Large Bags | https://codeforces.com/problemset/problem/2067/B | [
"brute force",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 19118
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2067-A | codeforces | 2067-A | Adjacent Digit Sums | https://codeforces.com/problemset/problem/2067/A | [
"brute force",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25773
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2066-F | codeforces | 2066-F | Curse | https://codeforces.com/problemset/problem/2066/F | [
"constructive algorithms",
"dp",
"math"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 73
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2066-E | codeforces | 2066-E | Tropical Season | https://codeforces.com/problemset/problem/2066/E | [
"binary search",
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 421
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2066-D2 | codeforces | 2066-D2 | Club of Young Aircraft Builders (hard version) | https://codeforces.com/problemset/problem/2066/D2 | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 633
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2066-D1 | codeforces | 2066-D1 | Club of Young Aircraft Builders (easy version) | https://codeforces.com/problemset/problem/2066/D1 | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1456
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2066-C | codeforces | 2066-C | Bitwise Slides | https://codeforces.com/problemset/problem/2066/C | [
"bitmasks",
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2541
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2066-B | codeforces | 2066-B | White Magic | https://codeforces.com/problemset/problem/2066/B | [
"constructive algorithms",
"data structures",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5509
} | 2026-06-01T05:00:40.145500+00:00 |
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": 7234
} | 2026-06-01T05:00:40.145500+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": 1997
} | 2026-06-01T05:00:40.145500+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": 6361
} | 2026-06-01T05:00:40.145500+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": 7194
} | 2026-06-01T05:00:40.145500+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": 12082
} | 2026-06-01T05:00:40.145500+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": 20778
} | 2026-06-01T05:00:40.145500+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": 18934
} | 2026-06-01T05:00:40.145500+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": 27952
} | 2026-06-01T05:00:40.145500+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": 42349
} | 2026-06-01T05:00:40.145500+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": 56031
} | 2026-06-01T05:00:40.145500+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": 711
} | 2026-06-01T05:00:40.145500+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": 1484
} | 2026-06-01T05:00:40.145500+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": 5912
} | 2026-06-01T05:00:40.145500+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": 17882
} | 2026-06-01T05:00:40.145500+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": 20212
} | 2026-06-01T05:00:40.145500+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": 27161
} | 2026-06-01T05:00:40.145500+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": 934
} | 2026-06-01T05:00:40.145500+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": 1559
} | 2026-06-01T05:00:40.145500+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": 2399
} | 2026-06-01T05:00:40.145500+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": 5078
} | 2026-06-01T05:00:40.145500+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": 14787
} | 2026-06-01T05:00:40.145500+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": 23302
} | 2026-06-01T05:00:40.145500+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": 31855
} | 2026-06-01T05:00:40.145500+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": 177
} | 2026-06-01T05:00:40.145500+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": 180
} | 2026-06-01T05:00:40.145500+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": 615
} | 2026-06-01T05:00:40.145500+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": 456
} | 2026-06-01T05:00:40.145500+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": 4352
} | 2026-06-01T05:00:40.145500+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": 3571
} | 2026-06-01T05:00:40.145500+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": 18489
} | 2026-06-01T05:00:40.145500+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": 23887
} | 2026-06-01T05:00:40.145500+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": 28342
} | 2026-06-01T05:00:40.145500+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": 131
} | 2026-06-01T05:00:40.145500+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": 64
} | 2026-06-01T05:00:40.145500+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": 106
} | 2026-06-01T05:00:40.145500+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": 522
} | 2026-06-01T05:00:40.145500+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": 152
} | 2026-06-01T05:00:40.145500+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": 2280
} | 2026-06-01T05:00:40.145500+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": 4016
} | 2026-06-01T05:00:40.145500+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": 10864
} | 2026-06-01T05:00:40.145500+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": 10041
} | 2026-06-01T05:00:40.145500+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": 14763
} | 2026-06-01T05:00:40.145500+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": 22390
} | 2026-06-01T05:00:40.145500+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": 1318
} | 2026-06-01T05:00:40.145500+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": 2610
} | 2026-06-01T05:00:40.145500+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": 12394
} | 2026-06-01T05:00:40.145500+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": 26337
} | 2026-06-01T05:00:40.145500+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": 32264
} | 2026-06-01T05:00:40.145500+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": 28755
} | 2026-06-01T05:00:40.145500+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": 41291
} | 2026-06-01T05:00:40.145500+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": 351
} | 2026-06-01T05:00:40.145500+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.