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:2201-A1 | codeforces | 2201-A1 | Lost Civilization (Easy Version) | https://codeforces.com/problemset/problem/2201/A1 | [
"data structures"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 11493
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2200-H | codeforces | 2200-H | Six Seven | https://codeforces.com/problemset/problem/2200/H | [
"divide and conquer",
"math",
"number theory",
"strings",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 479
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2200-G | codeforces | 2200-G | Operation Permutation | https://codeforces.com/problemset/problem/2200/G | [
"combinatorics",
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1086
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2200-F | codeforces | 2200-F | Mooclear Reactor 2 | https://codeforces.com/problemset/problem/2200/F | [
"brute force",
"data structures",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3028
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2200-E | codeforces | 2200-E | Divisive Battle | https://codeforces.com/problemset/problem/2200/E | [
"games",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 8570
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2200-D | codeforces | 2200-D | Portal | https://codeforces.com/problemset/problem/2200/D | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12404
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2200-C | codeforces | 2200-C | Specialty String | https://codeforces.com/problemset/problem/2200/C | [
"brute force",
"greedy",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 22725
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2200-B | codeforces | 2200-B | Deletion Sort | https://codeforces.com/problemset/problem/2200/B | [
"bitmasks",
"brute force",
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26463
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2200-A | codeforces | 2200-A | Eating Game | https://codeforces.com/problemset/problem/2200/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29351
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2199-I | codeforces | 2199-I | Strange Process | https://codeforces.com/problemset/problem/2199/I | [
"*special"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 36
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2199-H | codeforces | 2199-H | Sum of MEX | https://codeforces.com/problemset/problem/2199/H | [
"*special",
"combinatorics",
"data structures",
"dp",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 94
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2199-G | codeforces | 2199-G | Jammer | https://codeforces.com/problemset/problem/2199/G | [
"*special",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 60
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2199-F | codeforces | 2199-F | Self-Produced Sequences | https://codeforces.com/problemset/problem/2199/F | [
"*special",
"combinatorics",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 157
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2199-E | codeforces | 2199-E | Supersequence | https://codeforces.com/problemset/problem/2199/E | [
"*special",
"binary search",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 188
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2199-D | codeforces | 2199-D | Two Arrays | https://codeforces.com/problemset/problem/2199/D | [
"*special",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 296
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2199-C | codeforces | 2199-C | Minesweeper | https://codeforces.com/problemset/problem/2199/C | [
"*special",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 460
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2199-B | codeforces | 2199-B | Two Towers | https://codeforces.com/problemset/problem/2199/B | [
"*special",
"greedy",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 1023
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2199-A | codeforces | 2199-A | Game | https://codeforces.com/problemset/problem/2199/A | [
"*special"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 1488
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2197-B | codeforces | 2197-B | Array and Permutation | https://codeforces.com/problemset/problem/2197/B | [
"implementation",
"schedules",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 16333
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2197-A | codeforces | 2197-A | Friendly Numbers | https://codeforces.com/problemset/problem/2197/A | [
"binary search",
"brute force",
"expression parsing",
"math",
"schedules"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23281
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2196-F | codeforces | 2196-F | Indivisible | https://codeforces.com/problemset/problem/2196/F | [
"brute force",
"constructive algorithms",
"graphs"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 110
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2196-E2 | codeforces | 2196-E2 | Fuzzy Concatenation (Hard version) | https://codeforces.com/problemset/problem/2196/E2 | [
"binary search",
"bitmasks",
"data structures",
"dp",
"greedy",
"string suffix structures"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 206
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2196-E1 | codeforces | 2196-E1 | Fuzzy Concatenation (Easy Version) | https://codeforces.com/problemset/problem/2196/E1 | [
"binary search",
"bitmasks",
"brute force",
"data structures",
"greedy",
"string suffix structures"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 291
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2196-D | codeforces | 2196-D | Double Bracket Sequence | https://codeforces.com/problemset/problem/2196/D | [
"data structures",
"dp",
"expression parsing",
"flows",
"greedy",
"strings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1029
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2196-C2 | codeforces | 2196-C2 | Interactive Graph (Hard Version) | https://codeforces.com/problemset/problem/2196/C2 | [
"combinatorics",
"dfs and similar",
"dp",
"graphs",
"interactive"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2612
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2196-C1 | codeforces | 2196-C1 | Interactive Graph (Simple Version) | https://codeforces.com/problemset/problem/2196/C1 | [
"binary search",
"combinatorics",
"dfs and similar",
"dp",
"graphs",
"interactive"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3717
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2196-B | codeforces | 2196-B | Another Problem about Beautiful Pairs | https://codeforces.com/problemset/problem/2196/B | [
"brute force",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8895
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2196-A | codeforces | 2196-A | Game with a Fraction | https://codeforces.com/problemset/problem/2196/A | [
"games",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 16432
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2195-H | codeforces | 2195-H | Codeforces Heuristic Contest 001 | https://codeforces.com/problemset/problem/2195/H | [
"brute force",
"constructive algorithms",
"geometry",
"implementation"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 490
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2195-G | codeforces | 2195-G | Idiot First Search and Queries | https://codeforces.com/problemset/problem/2195/G | [
"binary search",
"data structures",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1092
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2195-F | codeforces | 2195-F | Parabola Independence | https://codeforces.com/problemset/problem/2195/F | [
"dp",
"graphs",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2803
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2195-E | codeforces | 2195-E | Idiot First Search | https://codeforces.com/problemset/problem/2195/E | [
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 8899
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2195-D | codeforces | 2195-D | Absolute Cinema | https://codeforces.com/problemset/problem/2195/D | [
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 14067
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2195-C | codeforces | 2195-C | Dice Roll Sequence | https://codeforces.com/problemset/problem/2195/C | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 21120
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2195-B | codeforces | 2195-B | Heapify 1 | https://codeforces.com/problemset/problem/2195/B | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 25552
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2195-A | codeforces | 2195-A | Sieve of Erato67henes | https://codeforces.com/problemset/problem/2195/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 36234
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2194-F2 | codeforces | 2194-F2 | Again Trees... (hard version) | https://codeforces.com/problemset/problem/2194/F2 | [
"bitmasks",
"data structures",
"dfs and similar",
"dp",
"fft",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 176
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2194-F1 | codeforces | 2194-F1 | Again Trees... (Easy Version) | https://codeforces.com/problemset/problem/2194/F1 | [
"bitmasks",
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 914
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2194-E | codeforces | 2194-E | The Turtle Strikes Back | https://codeforces.com/problemset/problem/2194/E | [
"dp",
"graphs",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2733
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2194-D | codeforces | 2194-D | Table Cut | https://codeforces.com/problemset/problem/2194/D | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8170
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2194-C | codeforces | 2194-C | Secret message | https://codeforces.com/problemset/problem/2194/C | [
"bitmasks",
"brute force",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 11188
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2194-B | codeforces | 2194-B | Offshores | https://codeforces.com/problemset/problem/2194/B | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 19005
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2194-A | codeforces | 2194-A | Lawn Mower | https://codeforces.com/problemset/problem/2194/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24333
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2193-H | codeforces | 2193-H | Remove the Grail Tree | https://codeforces.com/problemset/problem/2193/H | [
"dfs and similar",
"dp",
"graphs",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1080
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2193-G | codeforces | 2193-G | Paths in a Tree | https://codeforces.com/problemset/problem/2193/G | [
"dfs and similar",
"interactive",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2295
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2193-F | codeforces | 2193-F | Pizza Delivery | https://codeforces.com/problemset/problem/2193/F | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8728
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2193-E | codeforces | 2193-E | Product Queries | https://codeforces.com/problemset/problem/2193/E | [
"dp",
"math",
"number theory",
"shortest paths"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15508
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2193-D | codeforces | 2193-D | Monster Game | https://codeforces.com/problemset/problem/2193/D | [
"binary search",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 21964
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2193-C | codeforces | 2193-C | Replace and Sum | https://codeforces.com/problemset/problem/2193/C | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 29312
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2193-B | codeforces | 2193-B | Reverse a Permutation | https://codeforces.com/problemset/problem/2193/B | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 30553
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2193-A | codeforces | 2193-A | DBMB and the Array | https://codeforces.com/problemset/problem/2193/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 43234
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2192-F | codeforces | 2192-F | Fish Fight | https://codeforces.com/problemset/problem/2192/F | [
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 179
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2192-E | codeforces | 2192-E | Swap to Rearrange | https://codeforces.com/problemset/problem/2192/E | [
"constructive algorithms",
"dfs and similar",
"graph matchings",
"graphs",
"greedy",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2163
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2192-D | codeforces | 2192-D | Cost of Tree | https://codeforces.com/problemset/problem/2192/D | [
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3694
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2192-C | codeforces | 2192-C | All-in-one Gun | https://codeforces.com/problemset/problem/2192/C | [
"binary search",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 11433
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2192-B | codeforces | 2192-B | Flipping Binary String | https://codeforces.com/problemset/problem/2192/B | [
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 15053
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2192-A | codeforces | 2192-A | String Rotation Game | https://codeforces.com/problemset/problem/2192/A | [
"brute force",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18327
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2191-B | codeforces | 2191-B | MEX Reordering | https://codeforces.com/problemset/problem/2191/B | [
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 20279
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2191-A | codeforces | 2191-A | Array Coloring | https://codeforces.com/problemset/problem/2191/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28156
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2190-G | codeforces | 2190-G | Maximize Determinant | https://codeforces.com/problemset/problem/2190/G | [
"graphs"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 99
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2190-F | codeforces | 2190-F | Xor Product | https://codeforces.com/problemset/problem/2190/F | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 95
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2190-E | codeforces | 2190-E | Median Permutation | https://codeforces.com/problemset/problem/2190/E | [
"combinatorics"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 243
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2190-D | codeforces | 2190-D | Prufer Vertex | https://codeforces.com/problemset/problem/2190/D | [
"combinatorics",
"dsu",
"number theory",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 973
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2190-C | codeforces | 2190-C | Comparable Permutations | https://codeforces.com/problemset/problem/2190/C | [
"greedy",
"implementation",
"interactive",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1315
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2190-B2 | codeforces | 2190-B2 | Sub-RBS (Hard Version) | https://codeforces.com/problemset/problem/2190/B2 | [
"dp",
"games",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3252
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2190-B1 | codeforces | 2190-B1 | Sub-RBS (Easy Version) | https://codeforces.com/problemset/problem/2190/B1 | [
"combinatorics",
"constructive algorithms",
"dp",
"greedy",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10973
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2190-A | codeforces | 2190-A | Sorting Game | https://codeforces.com/problemset/problem/2190/A | [
"constructive algorithms",
"games",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17532
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2189-F | codeforces | 2189-F | Zhora the Vacuum Cleaner | https://codeforces.com/problemset/problem/2189/F | [
"data structures",
"dfs and similar",
"dp",
"greedy",
"implementation",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 230
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2189-E | codeforces | 2189-E | Majority Wins? | https://codeforces.com/problemset/problem/2189/E | [
"constructive algorithms",
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 848
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2189-D2 | codeforces | 2189-D2 | Little String (Hard Version) | https://codeforces.com/problemset/problem/2189/D2 | [
"combinatorics",
"dp",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1972
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2189-D1 | codeforces | 2189-D1 | Little String (Easy Version) | https://codeforces.com/problemset/problem/2189/D1 | [
"combinatorics",
"dp",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4034
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2189-C2 | codeforces | 2189-C2 | XOR-convenience (Hard Version) | https://codeforces.com/problemset/problem/2189/C2 | [
"bitmasks",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6302
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2189-C1 | codeforces | 2189-C1 | XOR Convenience (Easy Version) | https://codeforces.com/problemset/problem/2189/C1 | [
"bitmasks",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 14169
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2189-B | codeforces | 2189-B | The Curse of the Frog | https://codeforces.com/problemset/problem/2189/B | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 15653
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2189-A | codeforces | 2189-A | Table with Numbers | https://codeforces.com/problemset/problem/2189/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24633
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2188-B | codeforces | 2188-B | Seats | https://codeforces.com/problemset/problem/2188/B | [
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 21452
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2188-A | codeforces | 2188-A | Divisible Permutation | https://codeforces.com/problemset/problem/2188/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26198
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2187-G | codeforces | 2187-G | Many Cartesian Trees | https://codeforces.com/problemset/problem/2187/G | [
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 104
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2187-F2 | codeforces | 2187-F2 | Al Fine (Counting Version) | https://codeforces.com/problemset/problem/2187/F2 | [
"dp",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 77
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2187-F1 | codeforces | 2187-F1 | Al Fine (Maximizing Version) | https://codeforces.com/problemset/problem/2187/F1 | [
"binary search",
"data structures",
"divide and conquer",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 229
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2187-E | codeforces | 2187-E | Doors and Keys | https://codeforces.com/problemset/problem/2187/E | [
"brute force",
"data structures",
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 342
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2187-D | codeforces | 2187-D | Cool Problem | https://codeforces.com/problemset/problem/2187/D | [
"bitmasks",
"dp",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 658
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2187-C | codeforces | 2187-C | Jerry and Tom | https://codeforces.com/problemset/problem/2187/C | [
"data structures",
"dfs and similar",
"dsu",
"games",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1410
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2187-B | codeforces | 2187-B | Shortest Statement Ever | https://codeforces.com/problemset/problem/2187/B | [
"bitmasks",
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5417
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2187-A | codeforces | 2187-A | Restricted Sorting | https://codeforces.com/problemset/problem/2187/A | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16171
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2185-H | codeforces | 2185-H | BattleCows 2 | https://codeforces.com/problemset/problem/2185/H | [
"binary search",
"brute force",
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 713
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2185-G | codeforces | 2185-G | Mixing MEXes | https://codeforces.com/problemset/problem/2185/G | [
"data structures",
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3427
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2185-F | codeforces | 2185-F | BattleCows | https://codeforces.com/problemset/problem/2185/F | [
"data structures",
"divide and conquer",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5147
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2185-E | codeforces | 2185-E | The Robotic Rush | https://codeforces.com/problemset/problem/2185/E | [
"binary search",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 10492
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2185-D | codeforces | 2185-D | OutOfMemoryError | https://codeforces.com/problemset/problem/2185/D | [
"data structures",
"implementation",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 21074
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2185-C | codeforces | 2185-C | Shifted MEX | https://codeforces.com/problemset/problem/2185/C | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 29586
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2185-B | codeforces | 2185-B | Prefix Max | https://codeforces.com/problemset/problem/2185/B | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 41508
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2185-A | codeforces | 2185-A | Perfect Root | https://codeforces.com/problemset/problem/2185/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 43982
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2184-G | codeforces | 2184-G | Nastiness of Segments | https://codeforces.com/problemset/problem/2184/G | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3022
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2184-F | codeforces | 2184-F | Cherry Tree | https://codeforces.com/problemset/problem/2184/F | [
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4016
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2184-E | codeforces | 2184-E | Exquisite Array | https://codeforces.com/problemset/problem/2184/E | [
"combinatorics",
"data structures",
"dsu",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5895
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2184-D | codeforces | 2184-D | Unfair Game | https://codeforces.com/problemset/problem/2184/D | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9705
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2184-C | codeforces | 2184-C | Huge Pile | https://codeforces.com/problemset/problem/2184/C | [
"binary search",
"dfs and similar",
"dp",
"graphs",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 22205
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2184-B | codeforces | 2184-B | Hourglass | https://codeforces.com/problemset/problem/2184/B | [
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 24481
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2184-A | codeforces | 2184-A | Social Experiment | https://codeforces.com/problemset/problem/2184/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 38655
} | 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.