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:1942-F | codeforces | 1942-F | Farmer John's Favorite Function | https://codeforces.com/problemset/problem/1942/F | [
"brute force",
"data structures",
"implementation",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1010
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1942-E | codeforces | 1942-E | Farm Game | https://codeforces.com/problemset/problem/1942/E | [
"combinatorics",
"games"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2033
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1942-D | codeforces | 1942-D | Learning to Paint | https://codeforces.com/problemset/problem/1942/D | [
"binary search",
"data structures",
"dfs and similar",
"dp",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3406
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1942-C2 | codeforces | 1942-C2 | Bessie's Birthday Cake (Hard Version) | https://codeforces.com/problemset/problem/1942/C2 | [
"geometry",
"greedy",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6977
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1942-C1 | codeforces | 1942-C1 | Bessie's Birthday Cake (Easy Version) | https://codeforces.com/problemset/problem/1942/C1 | [
"geometry",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12580
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1942-B | codeforces | 1942-B | Bessie and MEX | https://codeforces.com/problemset/problem/1942/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 15701
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1942-A | codeforces | 1942-A | Farmer John's Challenge | https://codeforces.com/problemset/problem/1942/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18603
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1941-G | codeforces | 1941-G | Rudolf and Subway | https://codeforces.com/problemset/problem/1941/G | [
"constructive algorithms",
"dfs and similar",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4942
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1941-F | codeforces | 1941-F | Rudolf and Imbalance | https://codeforces.com/problemset/problem/1941/F | [
"binary search",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7572
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1941-E | codeforces | 1941-E | Rudolf and k Bridges | https://codeforces.com/problemset/problem/1941/E | [
"binary search",
"data structures",
"dp",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12259
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1941-D | codeforces | 1941-D | Rudolf and the Ball Game | https://codeforces.com/problemset/problem/1941/D | [
"dfs and similar",
"dp",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 21316
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1941-C | codeforces | 1941-C | Rudolf and the Ugly String | https://codeforces.com/problemset/problem/1941/C | [
"dp",
"greedy",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 39889
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1941-B | codeforces | 1941-B | Rudolf and 121 | https://codeforces.com/problemset/problem/1941/B | [
"brute force",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 35419
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1941-A | codeforces | 1941-A | Rudolf and the Ticket | https://codeforces.com/problemset/problem/1941/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 48269
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1940-D | codeforces | 1940-D | Almost Certainly | https://codeforces.com/problemset/problem/1940/D | [
"*special",
"constructive algorithms",
"data structures",
"sortings"
] | null | null | stdin_stdout | null | {
"solved_count": 177
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1940-C | codeforces | 1940-C | Burenka and Pether | https://codeforces.com/problemset/problem/1940/C | [
"*special",
"data structures",
"dfs and similar",
"divide and conquer",
"dsu",
"graphs",
"sortings",
"trees"
] | null | null | stdin_stdout | null | {
"solved_count": 44
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1940-B | codeforces | 1940-B | Three Arrays | https://codeforces.com/problemset/problem/1940/B | [
"*special",
"constructive algorithms",
"implementation",
"sortings"
] | null | null | stdin_stdout | null | {
"solved_count": 275
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1940-A | codeforces | 1940-A | Parallel Universes | https://codeforces.com/problemset/problem/1940/A | [
"*special",
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | null | {
"solved_count": 106
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1939-D | codeforces | 1939-D | Big Persimmon | https://codeforces.com/problemset/problem/1939/D | [
"*special",
"dp",
"games"
] | null | null | stdin_stdout | null | {
"solved_count": 115
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1939-C | codeforces | 1939-C | More Gifts | https://codeforces.com/problemset/problem/1939/C | [
"*special",
"dfs and similar",
"two pointers"
] | null | null | stdin_stdout | null | {
"solved_count": 419
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1939-B | codeforces | 1939-B | Evidence Board | https://codeforces.com/problemset/problem/1939/B | [
"*special",
"constructive algorithms",
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | null | {
"solved_count": 308
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1939-A | codeforces | 1939-A | Draw Polygon Lines | https://codeforces.com/problemset/problem/1939/A | [
"*special",
"constructive algorithms",
"dp",
"geometry",
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 30
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1938-M | codeforces | 1938-M | Zig-zag | https://codeforces.com/problemset/problem/1938/M | [] | null | null | stdin_stdout | 3,500 | {
"solved_count": 101
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1938-L | codeforces | 1938-L | XOR Operations | https://codeforces.com/problemset/problem/1938/L | [] | null | null | stdin_stdout | 2,800 | {
"solved_count": 357
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1938-K | codeforces | 1938-K | Tree Quiz | https://codeforces.com/problemset/problem/1938/K | [] | null | null | stdin_stdout | 2,400 | {
"solved_count": 797
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1938-J | codeforces | 1938-J | There and Back Again | https://codeforces.com/problemset/problem/1938/J | [] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1620
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1938-I | codeforces | 1938-I | Symmetric Boundary | https://codeforces.com/problemset/problem/1938/I | [] | null | null | stdin_stdout | 2,800 | {
"solved_count": 89
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1938-H | codeforces | 1938-H | Pho Restaurant | https://codeforces.com/problemset/problem/1938/H | [] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2724
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1938-G | codeforces | 1938-G | Personality Test | https://codeforces.com/problemset/problem/1938/G | [] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1320
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1938-F | codeforces | 1938-F | Forming Groups | https://codeforces.com/problemset/problem/1938/F | [] | null | null | stdin_stdout | 2,400 | {
"solved_count": 943
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1938-E | codeforces | 1938-E | Duplicates | https://codeforces.com/problemset/problem/1938/E | [] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1294
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1938-D | codeforces | 1938-D | Bánh Bò | https://codeforces.com/problemset/problem/1938/D | [] | null | null | stdin_stdout | 3,300 | {
"solved_count": 113
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1938-C | codeforces | 1938-C | Bit Counting Sequence | https://codeforces.com/problemset/problem/1938/C | [] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1858
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1938-B | codeforces | 1938-B | Attraction Score | https://codeforces.com/problemset/problem/1938/B | [] | null | null | stdin_stdout | 3,000 | {
"solved_count": 234
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1938-A | codeforces | 1938-A | Antiparticle Antiphysics | https://codeforces.com/problemset/problem/1938/A | [] | null | null | stdin_stdout | 3,500 | {
"solved_count": 82
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1937-B | codeforces | 1937-B | Binary Path | https://codeforces.com/problemset/problem/1937/B | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 17600
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1937-A | codeforces | 1937-A | Shuffle Party | https://codeforces.com/problemset/problem/1937/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24920
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1936-F | codeforces | 1936-F | Grand Finale: Circles | https://codeforces.com/problemset/problem/1936/F | [
"binary search",
"geometry"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 184
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1936-E | codeforces | 1936-E | Yet Yet Another Permutation Problem | https://codeforces.com/problemset/problem/1936/E | [
"divide and conquer",
"fft",
"math"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 162
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1936-D | codeforces | 1936-D | Bitwise Paradox | https://codeforces.com/problemset/problem/1936/D | [
"binary search",
"bitmasks",
"data structures",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 723
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1936-C | codeforces | 1936-C | Pokémon Arena | https://codeforces.com/problemset/problem/1936/C | [
"data structures",
"graphs",
"greedy",
"implementation",
"shortest paths",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1777
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1936-B | codeforces | 1936-B | Pinball | https://codeforces.com/problemset/problem/1936/B | [
"binary search",
"data structures",
"implementation",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3635
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1936-A | codeforces | 1936-A | Bitwise Operation Wizard | https://codeforces.com/problemset/problem/1936/A | [
"bitmasks",
"constructive algorithms",
"greedy",
"interactive",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8780
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1935-F | codeforces | 1935-F | Andrey's Tree | https://codeforces.com/problemset/problem/1935/F | [
"binary search",
"constructive algorithms",
"data structures",
"dfs and similar",
"dsu",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 680
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1935-E | codeforces | 1935-E | Distance Learning Courses in MAC | https://codeforces.com/problemset/problem/1935/E | [
"bitmasks",
"brute force",
"data structures",
"greedy",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1691
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1935-D | codeforces | 1935-D | Exam in MAC | https://codeforces.com/problemset/problem/1935/D | [
"binary search",
"combinatorics",
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 11097
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1935-C | codeforces | 1935-C | Messenger in MAC | https://codeforces.com/problemset/problem/1935/C | [
"binary search",
"brute force",
"constructive algorithms",
"data structures",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9945
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1935-B | codeforces | 1935-B | Informatics in MAC | https://codeforces.com/problemset/problem/1935/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 21152
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1935-A | codeforces | 1935-A | Entertainment in MAC | https://codeforces.com/problemset/problem/1935/A | [
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 30545
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1934-E | codeforces | 1934-E | Weird LCM Operations | https://codeforces.com/problemset/problem/1934/E | [
"brute force",
"constructive algorithms",
"number theory"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 403
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1934-D2 | codeforces | 1934-D2 | XOR Break --- Game Version | https://codeforces.com/problemset/problem/1934/D2 | [
"bitmasks",
"games",
"greedy",
"interactive"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1827
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1934-D1 | codeforces | 1934-D1 | XOR Break --- Solo Version | https://codeforces.com/problemset/problem/1934/D1 | [
"bitmasks",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4255
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1934-C | codeforces | 1934-C | Find a Mine | https://codeforces.com/problemset/problem/1934/C | [
"binary search",
"constructive algorithms",
"geometry",
"greedy",
"interactive",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8258
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1934-B | codeforces | 1934-B | Yet Another Coin Problem | https://codeforces.com/problemset/problem/1934/B | [
"brute force",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 22421
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1934-A | codeforces | 1934-A | Too Min Too Max | https://codeforces.com/problemset/problem/1934/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27498
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1933-G | codeforces | 1933-G | Turtle Magic: Royal Turtle Shell Pattern | https://codeforces.com/problemset/problem/1933/G | [
"bitmasks",
"brute force",
"combinatorics",
"constructive algorithms",
"dfs and similar",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1219
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1933-F | codeforces | 1933-F | Turtle Mission: Robot and the Earthquake | https://codeforces.com/problemset/problem/1933/F | [
"dfs and similar",
"dp",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3023
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1933-E | codeforces | 1933-E | Turtle vs. Rabbit Race: Optimal Trainings | https://codeforces.com/problemset/problem/1933/E | [
"binary search",
"implementation",
"math",
"ternary search"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13883
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1933-D | codeforces | 1933-D | Turtle Tenacity: Continual Mods | https://codeforces.com/problemset/problem/1933/D | [
"constructive algorithms",
"greedy",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 23982
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1933-C | codeforces | 1933-C | Turtle Fingers: Count the Values of k | https://codeforces.com/problemset/problem/1933/C | [
"brute force",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 25732
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1933-B | codeforces | 1933-B | Turtle Math: Fast Three Task | https://codeforces.com/problemset/problem/1933/B | [
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 37069
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1933-A | codeforces | 1933-A | Turtle Puzzle: Rearrange and Negate | https://codeforces.com/problemset/problem/1933/A | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 42547
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1932-G | codeforces | 1932-G | Moving Platforms | https://codeforces.com/problemset/problem/1932/G | [
"graphs",
"math",
"number theory",
"shortest paths"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1423
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1932-F | codeforces | 1932-F | Feed Cats | https://codeforces.com/problemset/problem/1932/F | [
"data structures",
"dp",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5886
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1932-E | codeforces | 1932-E | Final Countdown | https://codeforces.com/problemset/problem/1932/E | [
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10477
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1932-D | codeforces | 1932-D | Card Game | https://codeforces.com/problemset/problem/1932/D | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 13671
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1932-C | codeforces | 1932-C | LR-remainders | https://codeforces.com/problemset/problem/1932/C | [
"brute force",
"data structures",
"implementation",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 19317
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1932-B | codeforces | 1932-B | Chaya Calendar | https://codeforces.com/problemset/problem/1932/B | [
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 24046
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1932-A | codeforces | 1932-A | Thorns and Coins | https://codeforces.com/problemset/problem/1932/A | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 34466
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1931-G | codeforces | 1931-G | One-Dimensional Puzzle | https://codeforces.com/problemset/problem/1931/G | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3817
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1931-F | codeforces | 1931-F | Chat Screenshots | https://codeforces.com/problemset/problem/1931/F | [
"combinatorics",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 12709
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1931-E | codeforces | 1931-E | Anna and the Valentine's Day Gift | https://codeforces.com/problemset/problem/1931/E | [
"games",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 27627
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1931-D | codeforces | 1931-D | Divisible Pairs | https://codeforces.com/problemset/problem/1931/D | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 32987
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1931-C | codeforces | 1931-C | Make Equal Again | https://codeforces.com/problemset/problem/1931/C | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 34402
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1931-B | codeforces | 1931-B | Make Equal | https://codeforces.com/problemset/problem/1931/B | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 35695
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1931-A | codeforces | 1931-A | Recovering a Small String | https://codeforces.com/problemset/problem/1931/A | [
"brute force",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 40328
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1930-I | codeforces | 1930-I | Counting Is Fun | https://codeforces.com/problemset/problem/1930/I | [
"combinatorics"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 111
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1930-H | codeforces | 1930-H | Interactive Mex Tree | https://codeforces.com/problemset/problem/1930/H | [
"constructive algorithms",
"dfs and similar",
"interactive",
"trees"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 412
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1930-G | codeforces | 1930-G | Prefix Max Set Counting | https://codeforces.com/problemset/problem/1930/G | [
"data structures",
"dp",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 538
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1930-F | codeforces | 1930-F | Maximize the Difference | https://codeforces.com/problemset/problem/1930/F | [
"bitmasks",
"brute force",
"dfs and similar"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 982
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1930-E | codeforces | 1930-E | 2..3...4.... Wonderful! Wonderful! | https://codeforces.com/problemset/problem/1930/E | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1528
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1930-D2 | codeforces | 1930-D2 | Sum over all Substrings (Hard Version) | https://codeforces.com/problemset/problem/1930/D2 | [
"bitmasks",
"divide and conquer",
"dp",
"dsu",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3132
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1930-D1 | codeforces | 1930-D1 | Sum over all Substrings (Easy Version) | https://codeforces.com/problemset/problem/1930/D1 | [
"brute force",
"dp",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4928
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1930-C | codeforces | 1930-C | Lexicographically Largest | https://codeforces.com/problemset/problem/1930/C | [
"binary search",
"constructive algorithms",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8263
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1930-B | codeforces | 1930-B | Permutation Printing | https://codeforces.com/problemset/problem/1930/B | [
"brute force",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 17892
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1930-A | codeforces | 1930-A | Maximise The Score | https://codeforces.com/problemset/problem/1930/A | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20434
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1929-F | codeforces | 1929-F | Sasha and the Wedding Binary Search Tree | https://codeforces.com/problemset/problem/1929/F | [
"brute force",
"combinatorics",
"data structures",
"dfs and similar",
"math",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2356
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1929-E | codeforces | 1929-E | Sasha and the Happy Tree Cutting | https://codeforces.com/problemset/problem/1929/E | [
"bitmasks",
"brute force",
"dfs and similar",
"dp",
"graphs",
"greedy",
"math",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2149
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1929-D | codeforces | 1929-D | Sasha and a Walk in the City | https://codeforces.com/problemset/problem/1929/D | [
"combinatorics",
"dp",
"math",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5921
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1929-C | codeforces | 1929-C | Sasha and the Casino | https://codeforces.com/problemset/problem/1929/C | [
"binary search",
"brute force",
"constructive algorithms",
"games",
"greedy",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 17583
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1929-B | codeforces | 1929-B | Sasha and the Drawing | https://codeforces.com/problemset/problem/1929/B | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26893
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1929-A | codeforces | 1929-A | Sasha and the Beautiful Array | https://codeforces.com/problemset/problem/1929/A | [
"constructive algorithms",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 35382
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1928-F | codeforces | 1928-F | Digital Patterns | https://codeforces.com/problemset/problem/1928/F | [
"combinatorics",
"data structures",
"implementation",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 496
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1928-E | codeforces | 1928-E | Modular Sequence | https://codeforces.com/problemset/problem/1928/E | [
"brute force",
"constructive algorithms",
"dp",
"graphs",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2260
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1928-D | codeforces | 1928-D | Lonely Mountain Dungeons | https://codeforces.com/problemset/problem/1928/D | [
"brute force",
"data structures",
"greedy",
"math",
"ternary search"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5268
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1928-C | codeforces | 1928-C | Physical Education Lesson | https://codeforces.com/problemset/problem/1928/C | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10558
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1928-B | codeforces | 1928-B | Equalize | https://codeforces.com/problemset/problem/1928/B | [
"binary search",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 21240
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1928-A | codeforces | 1928-A | Rectangle Cutting | https://codeforces.com/problemset/problem/1928/A | [
"geometry",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24565
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1927-G | codeforces | 1927-G | Paint Charges | https://codeforces.com/problemset/problem/1927/G | [
"data structures",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2056
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1927-F | codeforces | 1927-F | Microcycle | https://codeforces.com/problemset/problem/1927/F | [
"data structures",
"dfs and similar",
"dsu",
"graphs",
"greedy",
"implementation",
"sortings",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5634
} | 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.