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:1912-L | codeforces | 1912-L | LOL Lovers | https://codeforces.com/problemset/problem/1912/L | [
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 8779
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1912-K | codeforces | 1912-K | Kim's Quest | https://codeforces.com/problemset/problem/1912/K | [
"bitmasks",
"combinatorics",
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4466
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1912-J | codeforces | 1912-J | Joy of Pokémon Observation | https://codeforces.com/problemset/problem/1912/J | [] | null | null | stdin_stdout | 2,300 | {
"solved_count": 742
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1912-I | codeforces | 1912-I | Innovative Washing Machine | https://codeforces.com/problemset/problem/1912/I | [
"geometry",
"math",
"two pointers"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 66
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1912-H | codeforces | 1912-H | Hypercatapult Commute | https://codeforces.com/problemset/problem/1912/H | [
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 612
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1912-G | codeforces | 1912-G | Great City Saint Petersburg | https://codeforces.com/problemset/problem/1912/G | [
"data structures"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 589
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1912-F | codeforces | 1912-F | Fugitive Frenzy | https://codeforces.com/problemset/problem/1912/F | [
"math",
"probabilities"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 144
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1912-E | codeforces | 1912-E | Evaluate It and Back Again | https://codeforces.com/problemset/problem/1912/E | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1297
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1912-D | codeforces | 1912-D | Divisibility Test | https://codeforces.com/problemset/problem/1912/D | [
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2030
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1912-C | codeforces | 1912-C | Cactus Transformation | https://codeforces.com/problemset/problem/1912/C | [
"constructive algorithms"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 74
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1912-B | codeforces | 1912-B | Blueprint for Seating | https://codeforces.com/problemset/problem/1912/B | [
"combinatorics",
"divide and conquer",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1468
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1912-A | codeforces | 1912-A | Accumulator Apex | https://codeforces.com/problemset/problem/1912/A | [
"data structures",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3140
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1910-J | codeforces | 1910-J | Two Colors | https://codeforces.com/problemset/problem/1910/J | [
"*special"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 61
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1910-I | codeforces | 1910-I | Inverse Problem | https://codeforces.com/problemset/problem/1910/I | [
"*special",
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 70
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1910-H | codeforces | 1910-H | Sum of Digits of Sums | https://codeforces.com/problemset/problem/1910/H | [
"*special",
"binary search",
"data structures"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 113
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1910-G | codeforces | 1910-G | Pool Records | https://codeforces.com/problemset/problem/1910/G | [
"*special",
"greedy"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 79
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1910-F | codeforces | 1910-F | Build Railway Stations | https://codeforces.com/problemset/problem/1910/F | [
"*special",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 229
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1910-E | codeforces | 1910-E | Maximum Sum Subarrays | https://codeforces.com/problemset/problem/1910/E | [
"*special",
"dp"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 248
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1910-D | codeforces | 1910-D | Remove and Add | https://codeforces.com/problemset/problem/1910/D | [
"*special",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 413
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1910-C | codeforces | 1910-C | Poisonous Swamp | https://codeforces.com/problemset/problem/1910/C | [
"*special",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 747
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1910-B | codeforces | 1910-B | Security Guard | https://codeforces.com/problemset/problem/1910/B | [
"*special",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 811
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1910-A | codeforces | 1910-A | Username | https://codeforces.com/problemset/problem/1910/A | [
"*special",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 2027
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1909-I | codeforces | 1909-I | Short Permutation Problem | https://codeforces.com/problemset/problem/1909/I | [
"combinatorics",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 183
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1909-H | codeforces | 1909-H | Parallel Swaps Sort | https://codeforces.com/problemset/problem/1909/H | [
"constructive algorithms",
"data structures"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 116
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1909-G | codeforces | 1909-G | Pumping Lemma | https://codeforces.com/problemset/problem/1909/G | [
"hashing",
"strings"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 714
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1909-F2 | codeforces | 1909-F2 | Small Permutation Problem (Hard Version) | https://codeforces.com/problemset/problem/1909/F2 | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1279
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1909-F1 | codeforces | 1909-F1 | Small Permutation Problem (Easy Version) | https://codeforces.com/problemset/problem/1909/F1 | [
"brute force",
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2313
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1909-E | codeforces | 1909-E | Multiple Lamps | https://codeforces.com/problemset/problem/1909/E | [
"bitmasks",
"brute force",
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1740
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1909-D | codeforces | 1909-D | Split Plus K | https://codeforces.com/problemset/problem/1909/D | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5201
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1909-C | codeforces | 1909-C | Heavy Intervals | https://codeforces.com/problemset/problem/1909/C | [
"constructive algorithms",
"data structures",
"dsu",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 13432
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1909-B | codeforces | 1909-B | Make Almost Equal With Mod | https://codeforces.com/problemset/problem/1909/B | [
"bitmasks",
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 33684
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1909-A | codeforces | 1909-A | Distinct Buttons | https://codeforces.com/problemset/problem/1909/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19068
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1907-G | codeforces | 1907-G | Lights | https://codeforces.com/problemset/problem/1907/G | [
"brute force",
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2433
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1907-F | codeforces | 1907-F | Shift and Reverse | https://codeforces.com/problemset/problem/1907/F | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6079
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1907-E | codeforces | 1907-E | Good Triples | https://codeforces.com/problemset/problem/1907/E | [
"brute force",
"combinatorics",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 16785
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1907-D | codeforces | 1907-D | Jumping Through Segments | https://codeforces.com/problemset/problem/1907/D | [
"binary search",
"constructive algorithms"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 25396
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1907-C | codeforces | 1907-C | Removal of Unattractive Pairs | https://codeforces.com/problemset/problem/1907/C | [
"constructive algorithms",
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 23560
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1907-B | codeforces | 1907-B | YetnotherrokenKeoard | https://codeforces.com/problemset/problem/1907/B | [
"data structures",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 31041
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1907-A | codeforces | 1907-A | Rook | https://codeforces.com/problemset/problem/1907/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 42309
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1906-M | codeforces | 1906-M | Triangle Construction | https://codeforces.com/problemset/problem/1906/M | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3532
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1906-L | codeforces | 1906-L | Palindromic Parentheses | https://codeforces.com/problemset/problem/1906/L | [
"constructive algorithms"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 792
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1906-K | codeforces | 1906-K | Deck-Building Game | https://codeforces.com/problemset/problem/1906/K | [
"divide and conquer",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 618
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1906-J | codeforces | 1906-J | Count BFS Graph | https://codeforces.com/problemset/problem/1906/J | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1132
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1906-I | codeforces | 1906-I | Contingency Plan 2 | https://codeforces.com/problemset/problem/1906/I | [
"graph matchings"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 321
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1906-H | codeforces | 1906-H | Twin Friends | https://codeforces.com/problemset/problem/1906/H | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1134
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1906-G | codeforces | 1906-G | Grid Game 2 | https://codeforces.com/problemset/problem/1906/G | [
"games",
"number theory"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 444
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1906-F | codeforces | 1906-F | Maximize The Value | https://codeforces.com/problemset/problem/1906/F | [
"data structures",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1766
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1906-E | codeforces | 1906-E | Merge Not Sort | https://codeforces.com/problemset/problem/1906/E | [
"constructive algorithms",
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2558
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1906-D | codeforces | 1906-D | Spaceship Exploration | https://codeforces.com/problemset/problem/1906/D | [
"binary search",
"geometry"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 174
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1906-C | codeforces | 1906-C | Cursed Game | https://codeforces.com/problemset/problem/1906/C | [
"interactive"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 297
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1906-B | codeforces | 1906-B | Button Pressing | https://codeforces.com/problemset/problem/1906/B | [
"bitmasks",
"constructive algorithms",
"hashing"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 872
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1906-A | codeforces | 1906-A | Easy As ABC | https://codeforces.com/problemset/problem/1906/A | [
"brute force"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 6251
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1905-F | codeforces | 1905-F | Field Should Not Be Empty | https://codeforces.com/problemset/problem/1905/F | [
"brute force",
"data structures",
"divide and conquer"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 796
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1905-E | codeforces | 1905-E | One-X | https://codeforces.com/problemset/problem/1905/E | [
"combinatorics",
"dfs and similar",
"dp",
"math",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1322
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1905-D | codeforces | 1905-D | Cyclic MEX | https://codeforces.com/problemset/problem/1905/D | [
"data structures",
"implementation",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4756
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1905-C | codeforces | 1905-C | Largest Subsequence | https://codeforces.com/problemset/problem/1905/C | [
"greedy",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14443
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1905-B | codeforces | 1905-B | Begginer's Zelda | https://codeforces.com/problemset/problem/1905/B | [
"greedy",
"trees"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 18895
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1905-A | codeforces | 1905-A | Constructive Problems | https://codeforces.com/problemset/problem/1905/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24585
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1904-F | codeforces | 1904-F | Beautiful Tree | https://codeforces.com/problemset/problem/1904/F | [
"data structures",
"dfs and similar",
"graphs",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 621
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1904-E | codeforces | 1904-E | Tree Queries | https://codeforces.com/problemset/problem/1904/E | [
"data structures",
"dfs and similar",
"graphs",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1383
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1904-D2 | codeforces | 1904-D2 | Set To Max (Hard Version) | https://codeforces.com/problemset/problem/1904/D2 | [
"constructive algorithms",
"data structures",
"divide and conquer",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5856
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1904-D1 | codeforces | 1904-D1 | Set To Max (Easy Version) | https://codeforces.com/problemset/problem/1904/D1 | [
"brute force",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8830
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1904-C | codeforces | 1904-C | Array Game | https://codeforces.com/problemset/problem/1904/C | [
"binary search",
"brute force",
"data structures",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 25428
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1904-B | codeforces | 1904-B | Collecting Game | https://codeforces.com/problemset/problem/1904/B | [
"binary search",
"dp",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 30349
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1904-A | codeforces | 1904-A | Forked! | https://codeforces.com/problemset/problem/1904/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 44333
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1903-F | codeforces | 1903-F | Babysitting | https://codeforces.com/problemset/problem/1903/F | [
"2-sat",
"binary search",
"data structures",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 983
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1903-E | codeforces | 1903-E | Geo Game | https://codeforces.com/problemset/problem/1903/E | [
"greedy",
"interactive",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2602
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1903-D2 | codeforces | 1903-D2 | Maximum And Queries (hard version) | https://codeforces.com/problemset/problem/1903/D2 | [
"bitmasks",
"divide and conquer",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1105
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1903-D1 | codeforces | 1903-D1 | Maximum And Queries (easy version) | https://codeforces.com/problemset/problem/1903/D1 | [
"binary search",
"bitmasks",
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7442
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1903-C | codeforces | 1903-C | Theofanis' Nightmare | https://codeforces.com/problemset/problem/1903/C | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14799
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1903-B | codeforces | 1903-B | StORage room | https://codeforces.com/problemset/problem/1903/B | [
"bitmasks",
"brute force",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 15074
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1903-A | codeforces | 1903-A | Halloumi Boxes | https://codeforces.com/problemset/problem/1903/A | [
"brute force",
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 88197
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1902-F | codeforces | 1902-F | Trees and XOR Queries Again | https://codeforces.com/problemset/problem/1902/F | [
"data structures",
"dfs and similar",
"divide and conquer",
"graphs",
"implementation",
"math",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1545
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1902-E | codeforces | 1902-E | Collapsing Strings | https://codeforces.com/problemset/problem/1902/E | [
"data structures",
"strings",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5899
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1902-D | codeforces | 1902-D | Robot Queries | https://codeforces.com/problemset/problem/1902/D | [
"binary search",
"data structures",
"dp",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5436
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1902-C | codeforces | 1902-C | Insert and Equalize | https://codeforces.com/problemset/problem/1902/C | [
"brute force",
"constructive algorithms",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 17564
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1902-B | codeforces | 1902-B | Getting Points | https://codeforces.com/problemset/problem/1902/B | [
"binary search",
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 16668
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1902-A | codeforces | 1902-A | Binary Imbalance | https://codeforces.com/problemset/problem/1902/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23453
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1901-F | codeforces | 1901-F | Landscaping | https://codeforces.com/problemset/problem/1901/F | [
"binary search",
"geometry",
"two pointers"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 276
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1901-E | codeforces | 1901-E | Compressed Tree | https://codeforces.com/problemset/problem/1901/E | [
"dfs and similar",
"dp",
"graphs",
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2043
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1901-D | codeforces | 1901-D | Yet Another Monster Fight | https://codeforces.com/problemset/problem/1901/D | [
"binary search",
"dp",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8787
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1901-C | codeforces | 1901-C | Add, Divide and Floor | https://codeforces.com/problemset/problem/1901/C | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14537
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1901-B | codeforces | 1901-B | Chip and Ribbon | https://codeforces.com/problemset/problem/1901/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 17195
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1901-A | codeforces | 1901-A | Line Trip | https://codeforces.com/problemset/problem/1901/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 82994
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1900-F | codeforces | 1900-F | Local Deletions | https://codeforces.com/problemset/problem/1900/F | [
"binary search",
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 387
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1900-E | codeforces | 1900-E | Transitive Graph | https://codeforces.com/problemset/problem/1900/E | [
"dfs and similar",
"dp",
"dsu",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2726
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1900-D | codeforces | 1900-D | Small GCD | https://codeforces.com/problemset/problem/1900/D | [
"bitmasks",
"brute force",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5634
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1900-C | codeforces | 1900-C | Anji's Binary Tree | https://codeforces.com/problemset/problem/1900/C | [
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15397
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1900-B | codeforces | 1900-B | Laura and Operations | https://codeforces.com/problemset/problem/1900/B | [
"dp",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 20879
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1900-A | codeforces | 1900-A | Cover in Water | https://codeforces.com/problemset/problem/1900/A | [
"constructive algorithms",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 71034
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1899-G | codeforces | 1899-G | Unusual Entertainment | https://codeforces.com/problemset/problem/1899/G | [
"data structures",
"dfs and similar",
"dsu",
"shortest paths",
"sortings",
"trees",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4109
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1899-F | codeforces | 1899-F | Alex's whims | https://codeforces.com/problemset/problem/1899/F | [
"constructive algorithms",
"graphs",
"greedy",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9694
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1899-E | codeforces | 1899-E | Queue Sort | https://codeforces.com/problemset/problem/1899/E | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 18624
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1899-D | codeforces | 1899-D | Yarik and Musical Notes | https://codeforces.com/problemset/problem/1899/D | [
"hashing",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15924
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1899-C | codeforces | 1899-C | Yarik and Array | https://codeforces.com/problemset/problem/1899/C | [
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 37585
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1899-B | codeforces | 1899-B | 250 Thousand Tons of TNT | https://codeforces.com/problemset/problem/1899/B | [
"brute force",
"implementation",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 35749
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1899-A | codeforces | 1899-A | Game with Integers | https://codeforces.com/problemset/problem/1899/A | [
"games",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 101266
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1898-F | codeforces | 1898-F | Vova Escapes the Matrix | https://codeforces.com/problemset/problem/1898/F | [
"brute force",
"dfs and similar",
"divide and conquer",
"shortest paths"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1034
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1898-E | codeforces | 1898-E | Sofia and Strings | https://codeforces.com/problemset/problem/1898/E | [
"data structures",
"greedy",
"sortings",
"strings",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2797
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1898-D | codeforces | 1898-D | Absolute Beauty | https://codeforces.com/problemset/problem/1898/D | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6867
} | 2026-08-10T02:20:32.917453+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.