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:2110-D | codeforces | 2110-D | Fewer Batteries | https://codeforces.com/problemset/problem/2110/D | [
"binary search",
"dfs and similar",
"dp",
"graphs",
"greedy",
"hashing"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8683
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2110-C | codeforces | 2110-C | Racing | https://codeforces.com/problemset/problem/2110/C | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15960
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2110-B | codeforces | 2110-B | Down with Brackets | https://codeforces.com/problemset/problem/2110/B | [
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 27535
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2110-A | codeforces | 2110-A | Fashionable Array | https://codeforces.com/problemset/problem/2110/A | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 30022
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2109-F | codeforces | 2109-F | Penguin Steps | https://codeforces.com/problemset/problem/2109/F | [
"binary search",
"dfs and similar",
"flows",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 278
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2109-E | codeforces | 2109-E | Binary String Wowee | https://codeforces.com/problemset/problem/2109/E | [
"combinatorics",
"dp",
"strings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1803
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2109-D | codeforces | 2109-D | D/D/D | https://codeforces.com/problemset/problem/2109/D | [
"dfs and similar",
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5686
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2109-C3 | codeforces | 2109-C3 | Hacking Numbers (Hard Version) | https://codeforces.com/problemset/problem/2109/C3 | [
"constructive algorithms",
"interactive",
"math",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 3243
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2109-C2 | codeforces | 2109-C2 | Hacking Numbers (Medium Version) | https://codeforces.com/problemset/problem/2109/C2 | [
"constructive algorithms",
"interactive",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8733
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2109-C1 | codeforces | 2109-C1 | Hacking Numbers (Easy Version) | https://codeforces.com/problemset/problem/2109/C1 | [
"bitmasks",
"constructive algorithms",
"interactive",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 11535
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2109-B | codeforces | 2109-B | Slice to Survive | https://codeforces.com/problemset/problem/2109/B | [
"bitmasks",
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17448
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2109-A | codeforces | 2109-A | It's Time To Duel | https://codeforces.com/problemset/problem/2109/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27032
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2108-F | codeforces | 2108-F | Fallen Towers | https://codeforces.com/problemset/problem/2108/F | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 550
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2108-E | codeforces | 2108-E | Spruce Dispute | https://codeforces.com/problemset/problem/2108/E | [
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy",
"implementation",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 899
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2108-D | codeforces | 2108-D | Needle in a Numstack | https://codeforces.com/problemset/problem/2108/D | [
"binary search",
"brute force",
"implementation",
"interactive"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2428
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2108-C | codeforces | 2108-C | Neo's Escape | https://codeforces.com/problemset/problem/2108/C | [
"binary search",
"brute force",
"data structures",
"dp",
"dsu",
"graphs",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14865
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2108-B | codeforces | 2108-B | SUMdamental Decomposition | https://codeforces.com/problemset/problem/2108/B | [
"bitmasks",
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 14646
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2108-A | codeforces | 2108-A | Permutation Warm-Up | https://codeforces.com/problemset/problem/2108/A | [
"combinatorics",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22208
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2107-F2 | codeforces | 2107-F2 | Cycling (Hard Version) | https://codeforces.com/problemset/problem/2107/F2 | [
"binary search",
"brute force",
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 513
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2107-F1 | codeforces | 2107-F1 | Cycling (Easy Version) | https://codeforces.com/problemset/problem/2107/F1 | [
"binary search",
"brute force",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1834
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2107-E | codeforces | 2107-E | Ain and Apple Tree | https://codeforces.com/problemset/problem/2107/E | [
"binary search",
"constructive algorithms",
"greedy",
"math",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 946
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2107-D | codeforces | 2107-D | Apple Tree Traversing | https://codeforces.com/problemset/problem/2107/D | [
"brute force",
"dfs and similar",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3567
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2107-C | codeforces | 2107-C | Maximum Subarray Sum | https://codeforces.com/problemset/problem/2107/C | [
"binary search",
"constructive algorithms",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12201
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2107-B | codeforces | 2107-B | Apples in Boxes | https://codeforces.com/problemset/problem/2107/B | [
"games",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 19916
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2107-A | codeforces | 2107-A | LRC and VIP | https://codeforces.com/problemset/problem/2107/A | [
"greedy",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22263
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2106-G2 | codeforces | 2106-G2 | Baudelaire (hard version) | https://codeforces.com/problemset/problem/2106/G2 | [
"binary search",
"dfs and similar",
"divide and conquer",
"implementation",
"interactive",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 623
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2106-G1 | codeforces | 2106-G1 | Baudelaire (easy version) | https://codeforces.com/problemset/problem/2106/G1 | [
"binary search",
"constructive algorithms",
"divide and conquer",
"greedy",
"interactive",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1625
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2106-F | codeforces | 2106-F | Goblin | https://codeforces.com/problemset/problem/2106/F | [
"dfs and similar",
"dp",
"dsu",
"greedy",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4460
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2106-E | codeforces | 2106-E | Wolf | https://codeforces.com/problemset/problem/2106/E | [
"binary search",
"greedy",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5976
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2106-D | codeforces | 2106-D | Flower Boy | https://codeforces.com/problemset/problem/2106/D | [
"binary search",
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12391
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2106-C | codeforces | 2106-C | Cherry Bomb | https://codeforces.com/problemset/problem/2106/C | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 25782
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2106-B | codeforces | 2106-B | St. Chroma | https://codeforces.com/problemset/problem/2106/B | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 28527
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2106-A | codeforces | 2106-A | Dr. TC | https://codeforces.com/problemset/problem/2106/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 36533
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2104-G | codeforces | 2104-G | Modulo 3 | https://codeforces.com/problemset/problem/2104/G | [
"data structures",
"divide and conquer",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 540
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2104-F | codeforces | 2104-F | Numbers and Strings | https://codeforces.com/problemset/problem/2104/F | [
"binary search",
"brute force",
"dfs and similar",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 731
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2104-E | codeforces | 2104-E | Unpleasant Strings | https://codeforces.com/problemset/problem/2104/E | [
"binary search",
"dp",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8168
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2104-D | codeforces | 2104-D | Array and GCD | https://codeforces.com/problemset/problem/2104/D | [
"binary search",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 13331
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2104-C | codeforces | 2104-C | Card Game | https://codeforces.com/problemset/problem/2104/C | [
"brute force",
"constructive algorithms",
"games",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 17498
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2104-B | codeforces | 2104-B | Move to the End | https://codeforces.com/problemset/problem/2104/B | [
"brute force",
"data structures",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 20908
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2104-A | codeforces | 2104-A | Three Decks | https://codeforces.com/problemset/problem/2104/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26405
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2103-F | codeforces | 2103-F | Maximize Nor | https://codeforces.com/problemset/problem/2103/F | [
"bitmasks",
"data structures",
"dp",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 623
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2103-E | codeforces | 2103-E | Keep the Sum | https://codeforces.com/problemset/problem/2103/E | [
"constructive algorithms",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 611
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2103-D | codeforces | 2103-D | Local Construction | https://codeforces.com/problemset/problem/2103/D | [
"constructive algorithms",
"dfs and similar",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4009
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2103-C | codeforces | 2103-C | Median Splits | https://codeforces.com/problemset/problem/2103/C | [
"binary search",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10669
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2103-B | codeforces | 2103-B | Binary Typewriter | https://codeforces.com/problemset/problem/2103/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 17810
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2103-A | codeforces | 2103-A | Common Multiple | https://codeforces.com/problemset/problem/2103/A | [
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25033
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2102-B | codeforces | 2102-B | The Picky Cat | https://codeforces.com/problemset/problem/2102/B | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 19943
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2102-A | codeforces | 2102-A | Dinner Time | https://codeforces.com/problemset/problem/2102/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 21611
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2101-F | codeforces | 2101-F | Shoo Shatters the Sunshine | https://codeforces.com/problemset/problem/2101/F | [
"combinatorics",
"dp",
"trees"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 160
} | 2026-06-01T05:00:40.145500+00:00 |
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": 538
} | 2026-06-01T05:00:40.145500+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": 1298
} | 2026-06-01T05:00:40.145500+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": 2585
} | 2026-06-01T05:00:40.145500+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": 7124
} | 2026-06-01T05:00:40.145500+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": 13749
} | 2026-06-01T05:00:40.145500+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": 7967
} | 2026-06-01T05:00:40.145500+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": 14806
} | 2026-06-01T05:00:40.145500+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": 188
} | 2026-06-01T05:00:40.145500+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": 282
} | 2026-06-01T05:00:40.145500+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": 555
} | 2026-06-01T05:00:40.145500+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": 1028
} | 2026-06-01T05:00:40.145500+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": 1947
} | 2026-06-01T05:00:40.145500+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": 8685
} | 2026-06-01T05:00:40.145500+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": 226
} | 2026-06-01T05:00:40.145500+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": 433
} | 2026-06-01T05:00:40.145500+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": 469
} | 2026-06-01T05:00:40.145500+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": 2063
} | 2026-06-01T05:00:40.145500+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": 5641
} | 2026-06-01T05:00:40.145500+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": 8290
} | 2026-06-01T05:00:40.145500+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": 16668
} | 2026-06-01T05:00:40.145500+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": 20658
} | 2026-06-01T05:00:40.145500+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": 543
} | 2026-06-01T05:00:40.145500+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": 640
} | 2026-06-01T05:00:40.145500+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": 844
} | 2026-06-01T05:00:40.145500+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": 963
} | 2026-06-01T05:00:40.145500+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": 840
} | 2026-06-01T05:00:40.145500+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": 787
} | 2026-06-01T05:00:40.145500+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": 5311
} | 2026-06-01T05:00:40.145500+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": 3753
} | 2026-06-01T05:00:40.145500+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": 6010
} | 2026-06-01T05:00:40.145500+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": 13836
} | 2026-06-01T05:00:40.145500+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": 3819
} | 2026-06-01T05:00:40.145500+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": 7938
} | 2026-06-01T05:00:40.145500+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": 11537
} | 2026-06-01T05:00:40.145500+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": 18687
} | 2026-06-01T05:00:40.145500+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": 24081
} | 2026-06-01T05:00:40.145500+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": 30709
} | 2026-06-01T05:00:40.145500+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": 33345
} | 2026-06-01T05:00:40.145500+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": 56783
} | 2026-06-01T05:00:40.145500+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": 3848
} | 2026-06-01T05:00:40.145500+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": 5918
} | 2026-06-01T05:00:40.145500+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": 13566
} | 2026-06-01T05:00:40.145500+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": 12359
} | 2026-06-01T05:00:40.145500+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": 31043
} | 2026-06-01T05:00:40.145500+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": 31006
} | 2026-06-01T05:00:40.145500+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": 40988
} | 2026-06-01T05:00:40.145500+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": 432
} | 2026-06-01T05:00:40.145500+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": 3868
} | 2026-06-01T05:00:40.145500+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": 6918
} | 2026-06-01T05:00:40.145500+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": 22745
} | 2026-06-01T05:00:40.145500+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": 25017
} | 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.