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:2101-E | codeforces | 2101-E | Kia Bakes a Cake | https://codeforces.com/problemset/problem/2101/E | [
"data structures",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 3305
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2101-D | codeforces | 2101-D | Mani and Segments | https://codeforces.com/problemset/problem/2101/D | [
"data structures",
"implementation",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2354
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2101-C | codeforces | 2101-C | 23 Kingdom | https://codeforces.com/problemset/problem/2101/C | [
"binary search",
"brute force",
"data structures",
"greedy",
"ternary search",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 5105
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2101-B | codeforces | 2101-B | Quartet Swapping | https://codeforces.com/problemset/problem/2101/B | [
"brute force",
"data structures",
"divide and conquer",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9204
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2101-A | codeforces | 2101-A | Mex in the Grid | https://codeforces.com/problemset/problem/2101/A | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15885
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2098-B | codeforces | 2098-B | Sasha and the Apartment Purchase | https://codeforces.com/problemset/problem/2098/B | [
"math",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 8333
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2098-A | codeforces | 2098-A | Vadim's Collection | https://codeforces.com/problemset/problem/2098/A | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 15072
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2097-F | codeforces | 2097-F | Lost Luggage | https://codeforces.com/problemset/problem/2097/F | [
"dp",
"flows"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 213
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2097-E | codeforces | 2097-E | Clearing the Snowdrift | https://codeforces.com/problemset/problem/2097/E | [
"data structures",
"dfs and similar",
"dp",
"greedy"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 302
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2097-D | codeforces | 2097-D | Homework | https://codeforces.com/problemset/problem/2097/D | [
"bitmasks",
"math",
"matrices"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 573
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2097-C | codeforces | 2097-C | Bermuda Triangle | https://codeforces.com/problemset/problem/2097/C | [
"chinese remainder theorem",
"geometry",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1079
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2097-B | codeforces | 2097-B | Baggage Claim | https://codeforces.com/problemset/problem/2097/B | [
"combinatorics",
"dfs and similar",
"dp",
"dsu",
"graphs",
"implementation",
"math",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2030
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2097-A | codeforces | 2097-A | Sports Betting | https://codeforces.com/problemset/problem/2097/A | [
"2-sat",
"brute force",
"math",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 9113
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2096-H | codeforces | 2096-H | Wonderful XOR Problem | https://codeforces.com/problemset/problem/2096/H | [
"bitmasks",
"combinatorics",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 239
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2096-G | codeforces | 2096-G | Wonderful Guessing Game | https://codeforces.com/problemset/problem/2096/G | [
"bitmasks",
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 472
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2096-F | codeforces | 2096-F | Wonderful Impostors | https://codeforces.com/problemset/problem/2096/F | [
"data structures",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 563
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2096-E | codeforces | 2096-E | Wonderful Teddy Bears | https://codeforces.com/problemset/problem/2096/E | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2140
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2096-D | codeforces | 2096-D | Wonderful Lightbulbs | https://codeforces.com/problemset/problem/2096/D | [
"combinatorics",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5785
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2096-C | codeforces | 2096-C | Wonderful City | https://codeforces.com/problemset/problem/2096/C | [
"dp",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8576
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2096-B | codeforces | 2096-B | Wonderful Gloves | https://codeforces.com/problemset/problem/2096/B | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 17139
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2096-A | codeforces | 2096-A | Wonderful Sticks | https://codeforces.com/problemset/problem/2096/A | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21023
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2095-J | codeforces | 2095-J | Premiere at a Wrong Time | https://codeforces.com/problemset/problem/2095/J | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 557
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2095-I | codeforces | 2095-I | Mysterious Script | https://codeforces.com/problemset/problem/2095/I | [
"*special",
"expression parsing",
"number theory"
] | null | null | stdin_stdout | null | {
"solved_count": 646
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2095-H | codeforces | 2095-H | Blurry Vision | https://codeforces.com/problemset/problem/2095/H | [
"*special",
"fft",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 857
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2095-G | codeforces | 2095-G | Definitely a Geometry Problem | https://codeforces.com/problemset/problem/2095/G | [
"*special",
"geometry"
] | null | null | stdin_stdout | null | {
"solved_count": 977
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2095-F | codeforces | 2095-F | ⅓ оf а Рrоblеm | https://codeforces.com/problemset/problem/2095/F | [
"*special",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 863
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2095-E | codeforces | 2095-E | Pair Count | https://codeforces.com/problemset/problem/2095/E | [
"*special",
"number theory"
] | null | null | stdin_stdout | null | {
"solved_count": 798
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2095-D | codeforces | 2095-D | Where Am I? | https://codeforces.com/problemset/problem/2095/D | [
"*special",
"geometry"
] | null | null | stdin_stdout | null | {
"solved_count": 5359
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2095-C | codeforces | 2095-C | Would It Be Unrated? | https://codeforces.com/problemset/problem/2095/C | [
"*special",
"binary search",
"brute force"
] | null | null | stdin_stdout | null | {
"solved_count": 3813
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2095-B | codeforces | 2095-B | Plinko | https://codeforces.com/problemset/problem/2095/B | [
"*special",
"games",
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 6096
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2095-A | codeforces | 2095-A | Piecing It Together | https://codeforces.com/problemset/problem/2095/A | [
"*special",
"string suffix structures"
] | null | null | stdin_stdout | null | {
"solved_count": 13935
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2094-H | codeforces | 2094-H | La Vaca Saturno Saturnita | https://codeforces.com/problemset/problem/2094/H | [
"binary search",
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3994
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2094-G | codeforces | 2094-G | Chimpanzini Bananini | https://codeforces.com/problemset/problem/2094/G | [
"data structures",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8349
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2094-F | codeforces | 2094-F | Trulimero Trulicina | https://codeforces.com/problemset/problem/2094/F | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12067
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2094-E | codeforces | 2094-E | Boneca Ambalabu | https://codeforces.com/problemset/problem/2094/E | [
"bitmasks"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 19411
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2094-D | codeforces | 2094-D | Tung Tung Sahur | https://codeforces.com/problemset/problem/2094/D | [
"greedy",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 25125
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2094-C | codeforces | 2094-C | Brr Brrr Patapim | https://codeforces.com/problemset/problem/2094/C | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 31795
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2094-B | codeforces | 2094-B | Bobritto Bandito | https://codeforces.com/problemset/problem/2094/B | [
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 34336
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2094-A | codeforces | 2094-A | Trippi Troppi | https://codeforces.com/problemset/problem/2094/A | [
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 59416
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2093-G | codeforces | 2093-G | Shorten the Array | https://codeforces.com/problemset/problem/2093/G | [
"binary search",
"bitmasks",
"data structures",
"dfs and similar",
"greedy",
"strings",
"trees",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4132
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2093-F | codeforces | 2093-F | Hackers and Neural Networks | https://codeforces.com/problemset/problem/2093/F | [
"bitmasks",
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6110
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2093-E | codeforces | 2093-E | Min Max MEX | https://codeforces.com/problemset/problem/2093/E | [
"binary search",
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14197
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2093-D | codeforces | 2093-D | Skibidi Table | https://codeforces.com/problemset/problem/2093/D | [
"bitmasks",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 12722
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2093-C | codeforces | 2093-C | Simple Repetition | https://codeforces.com/problemset/problem/2093/C | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 32141
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2093-B | codeforces | 2093-B | Expensive Number | https://codeforces.com/problemset/problem/2093/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 32065
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2093-A | codeforces | 2093-A | Ideal Generator | https://codeforces.com/problemset/problem/2093/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 42081
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2092-F | codeforces | 2092-F | Andryusha and CCB | https://codeforces.com/problemset/problem/2092/F | [
"brute force",
"constructive algorithms",
"greedy",
"math",
"number theory",
"strings"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 452
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2092-E | codeforces | 2092-E | She knows... | https://codeforces.com/problemset/problem/2092/E | [
"combinatorics",
"constructive algorithms",
"graphs",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3978
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2092-D | codeforces | 2092-D | Mishkin Energizer | https://codeforces.com/problemset/problem/2092/D | [
"brute force",
"constructive algorithms",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7093
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2092-C | codeforces | 2092-C | Asuna and the Mosquitoes | https://codeforces.com/problemset/problem/2092/C | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 23468
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2092-B | codeforces | 2092-B | Lady Bug | https://codeforces.com/problemset/problem/2092/B | [
"brute force",
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 25727
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2092-A | codeforces | 2092-A | Kamilka and the Sheep | https://codeforces.com/problemset/problem/2092/A | [
"greedy",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29079
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2091-G | codeforces | 2091-G | Gleb and Boating | https://codeforces.com/problemset/problem/2091/G | [
"brute force",
"constructive algorithms",
"data structures",
"dp",
"graphs",
"greedy",
"math",
"number theory",
"shortest paths"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1680
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2091-F | codeforces | 2091-F | Igor and Mountain | https://codeforces.com/problemset/problem/2091/F | [
"binary search",
"brute force",
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6447
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2091-E | codeforces | 2091-E | Interesting Ratio | https://codeforces.com/problemset/problem/2091/E | [
"brute force",
"math",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 20552
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2091-D | codeforces | 2091-D | Place of the Olympiad | https://codeforces.com/problemset/problem/2091/D | [
"binary search",
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 24441
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2091-C | codeforces | 2091-C | Combination Lock | https://codeforces.com/problemset/problem/2091/C | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 29728
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2091-B | codeforces | 2091-B | Team Training | https://codeforces.com/problemset/problem/2091/B | [
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 33442
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2091-A | codeforces | 2091-A | Olympiad Date | https://codeforces.com/problemset/problem/2091/A | [
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 39912
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2090-C | codeforces | 2090-C | Dining Hall | https://codeforces.com/problemset/problem/2090/C | [
"data structures",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6601
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2090-B | codeforces | 2090-B | Pushing Balls | https://codeforces.com/problemset/problem/2090/B | [
"brute force",
"dp",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 17069
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2090-A | codeforces | 2090-A | Treasure Hunt | https://codeforces.com/problemset/problem/2090/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21840
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2089-E | codeforces | 2089-E | Black Cat Collapse | https://codeforces.com/problemset/problem/2089/E | [] | null | null | stdin_stdout | 3,500 | {
"solved_count": 135
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2089-D | codeforces | 2089-D | Conditional Operators | https://codeforces.com/problemset/problem/2089/D | [
"constructive algorithms"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 200
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2089-C2 | codeforces | 2089-C2 | Key of Like (Hard Version) | https://codeforces.com/problemset/problem/2089/C2 | [
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 276
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2089-C1 | codeforces | 2089-C1 | Key of Like (Easy Version) | https://codeforces.com/problemset/problem/2089/C1 | [
"dp",
"games",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1533
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2089-B2 | codeforces | 2089-B2 | Canteen (Hard Version) | https://codeforces.com/problemset/problem/2089/B2 | [
"binary search",
"data structures",
"dp",
"flows",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1368
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2089-B1 | codeforces | 2089-B1 | Canteen (Easy Version) | https://codeforces.com/problemset/problem/2089/B1 | [
"binary search",
"data structures",
"flows",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3387
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2089-A | codeforces | 2089-A | Simple Permutation | https://codeforces.com/problemset/problem/2089/A | [
"constructive algorithms",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7562
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2087-I | codeforces | 2087-I | Hamiltonian Partition | https://codeforces.com/problemset/problem/2087/I | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 27
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2087-H | codeforces | 2087-H | Nim with Special Numbers | https://codeforces.com/problemset/problem/2087/H | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 28
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2087-G | codeforces | 2087-G | Esports in Berland | https://codeforces.com/problemset/problem/2087/G | [
"*special",
"greedy"
] | null | null | stdin_stdout | null | {
"solved_count": 90
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2087-F | codeforces | 2087-F | Weapon Upgrade | https://codeforces.com/problemset/problem/2087/F | [
"*special",
"dp"
] | null | null | stdin_stdout | null | {
"solved_count": 70
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2087-E | codeforces | 2087-E | Color the Arrows | https://codeforces.com/problemset/problem/2087/E | [
"*special",
"dp"
] | null | null | stdin_stdout | null | {
"solved_count": 164
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2087-D | codeforces | 2087-D | Uppercase or Lowercase? | https://codeforces.com/problemset/problem/2087/D | [
"*special",
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 268
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2087-C | codeforces | 2087-C | Coin Game | https://codeforces.com/problemset/problem/2087/C | [
"*special",
"greedy"
] | null | null | stdin_stdout | null | {
"solved_count": 490
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2087-B | codeforces | 2087-B | Showmatch | https://codeforces.com/problemset/problem/2087/B | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 571
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2087-A | codeforces | 2087-A | Password Generator | https://codeforces.com/problemset/problem/2087/A | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 1059
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2086-F | codeforces | 2086-F | Online Palindrome | https://codeforces.com/problemset/problem/2086/F | [
"brute force",
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 155
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2086-E | codeforces | 2086-E | Zebra-like Numbers | https://codeforces.com/problemset/problem/2086/E | [
"bitmasks",
"brute force",
"constructive algorithms",
"dfs and similar",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1741
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2086-D | codeforces | 2086-D | Even String | https://codeforces.com/problemset/problem/2086/D | [
"brute force",
"combinatorics",
"dp",
"math",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8789
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2086-C | codeforces | 2086-C | Disappearing Permutation | https://codeforces.com/problemset/problem/2086/C | [
"dfs and similar",
"dp",
"dsu",
"graphs",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16808
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2086-B | codeforces | 2086-B | Large Array and Segments | https://codeforces.com/problemset/problem/2086/B | [
"binary search",
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 19580
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2086-A | codeforces | 2086-A | Cloudberry Jam | https://codeforces.com/problemset/problem/2086/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 34331
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2085-F2 | codeforces | 2085-F2 | Serval and Colorful Array (Hard Version) | https://codeforces.com/problemset/problem/2085/F2 | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 577
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2085-F1 | codeforces | 2085-F1 | Serval and Colorful Array (Easy Version) | https://codeforces.com/problemset/problem/2085/F1 | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 837
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2085-E | codeforces | 2085-E | Serval and Modulo | https://codeforces.com/problemset/problem/2085/E | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3309
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2085-D | codeforces | 2085-D | Serval and Kaitenzushi Buffet | https://codeforces.com/problemset/problem/2085/D | [
"data structures",
"graph matchings",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5669
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2085-C | codeforces | 2085-C | Serval and The Formula | https://codeforces.com/problemset/problem/2085/C | [
"bitmasks",
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 14307
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2085-B | codeforces | 2085-B | Serval and Final MEX | https://codeforces.com/problemset/problem/2085/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17694
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2085-A | codeforces | 2085-A | Serval and String Theory | https://codeforces.com/problemset/problem/2085/A | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 24176
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2084-H | codeforces | 2084-H | Turtle and Nediam 2 | https://codeforces.com/problemset/problem/2084/H | [
"dp",
"greedy"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 124
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2084-G2 | codeforces | 2084-G2 | Wish Upon a Satellite (Hard Version) | https://codeforces.com/problemset/problem/2084/G2 | [
"data structures",
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 123
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2084-G1 | codeforces | 2084-G1 | Wish Upon a Satellite (Easy Version) | https://codeforces.com/problemset/problem/2084/G1 | [
"dp",
"games"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 783
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2084-F | codeforces | 2084-F | Skyscape | https://codeforces.com/problemset/problem/2084/F | [
"constructive algorithms",
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 529
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2084-E | codeforces | 2084-E | Blossom | https://codeforces.com/problemset/problem/2084/E | [
"binary search",
"combinatorics",
"dp",
"implementation",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1856
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2084-D | codeforces | 2084-D | Arcology On Permafrost | https://codeforces.com/problemset/problem/2084/D | [
"binary search",
"brute force",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9284
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2084-C | codeforces | 2084-C | You Soared Afar With Grace | https://codeforces.com/problemset/problem/2084/C | [
"constructive algorithms",
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 12226
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2084-B | codeforces | 2084-B | MIN = GCD | https://codeforces.com/problemset/problem/2084/B | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 17417
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2084-A | codeforces | 2084-A | Max and Mod | https://codeforces.com/problemset/problem/2084/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17684
} | 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.