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:1948-F | codeforces | 1948-F | Rare Coins | https://codeforces.com/problemset/problem/1948/F | [
"combinatorics",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1778
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1948-E | codeforces | 1948-E | Clique Partition | https://codeforces.com/problemset/problem/1948/E | [
"brute force",
"constructive algorithms",
"graphs",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3660
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1948-D | codeforces | 1948-D | Tandem Repeats? | https://codeforces.com/problemset/problem/1948/D | [
"brute force",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 13179
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1948-C | codeforces | 1948-C | Arrow Path | https://codeforces.com/problemset/problem/1948/C | [
"brute force",
"constructive algorithms",
"dfs and similar",
"dp",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 21899
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1948-B | codeforces | 1948-B | Array Fix | https://codeforces.com/problemset/problem/1948/B | [
"brute force",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 26804
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1948-A | codeforces | 1948-A | Special Characters | https://codeforces.com/problemset/problem/1948/A | [
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31570
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1946-F | codeforces | 1946-F | Nobody is needed | https://codeforces.com/problemset/problem/1946/F | [
"2-sat",
"data structures",
"dfs and similar",
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1444
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1946-E | codeforces | 1946-E | Girl Permutation | https://codeforces.com/problemset/problem/1946/E | [
"combinatorics",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3388
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1946-D | codeforces | 1946-D | Birthday Gift | https://codeforces.com/problemset/problem/1946/D | [
"bitmasks",
"brute force",
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5774
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1946-C | codeforces | 1946-C | Tree Cutting | https://codeforces.com/problemset/problem/1946/C | [
"binary search",
"dp",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 14525
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1946-B | codeforces | 1946-B | Maximum Sum | https://codeforces.com/problemset/problem/1946/B | [
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 24125
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1946-A | codeforces | 1946-A | Median of an Array | https://codeforces.com/problemset/problem/1946/A | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29103
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1945-H | codeforces | 1945-H | GCD is Greater | https://codeforces.com/problemset/problem/1945/H | [
"brute force",
"data structures",
"math",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 998
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1945-G | codeforces | 1945-G | Cook and Porridge | https://codeforces.com/problemset/problem/1945/G | [
"binary search",
"constructive algorithms",
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 964
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1945-F | codeforces | 1945-F | Kirill and Mushrooms | https://codeforces.com/problemset/problem/1945/F | [
"data structures",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5307
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1945-E | codeforces | 1945-E | Binary Search | https://codeforces.com/problemset/problem/1945/E | [
"binary search",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10046
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1945-D | codeforces | 1945-D | Seraphim the Owl | https://codeforces.com/problemset/problem/1945/D | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 17702
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1945-C | codeforces | 1945-C | Left and Right Houses | https://codeforces.com/problemset/problem/1945/C | [
"brute force"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17905
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1945-B | codeforces | 1945-B | Fireworks | https://codeforces.com/problemset/problem/1945/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 26857
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1945-A | codeforces | 1945-A | Setting up Camp | https://codeforces.com/problemset/problem/1945/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 30930
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1944-B | codeforces | 1944-B | Equal XOR | https://codeforces.com/problemset/problem/1944/B | [
"bitmasks",
"constructive algorithms"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 18538
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1944-A | codeforces | 1944-A | Destroying Bridges | https://codeforces.com/problemset/problem/1944/A | [
"graphs",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 30023
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1943-F | codeforces | 1943-F | Minimum Hamming Distance | https://codeforces.com/problemset/problem/1943/F | [
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 154
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1943-E2 | codeforces | 1943-E2 | MEX Game 2 (Hard Version) | https://codeforces.com/problemset/problem/1943/E2 | [
"binary search",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 383
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1943-E1 | codeforces | 1943-E1 | MEX Game 2 (Easy Version) | https://codeforces.com/problemset/problem/1943/E1 | [
"binary search",
"brute force",
"greedy"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 559
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1943-D2 | codeforces | 1943-D2 | Counting Is Fun (Hard Version) | https://codeforces.com/problemset/problem/1943/D2 | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1258
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1943-D1 | codeforces | 1943-D1 | Counting Is Fun (Easy Version) | https://codeforces.com/problemset/problem/1943/D1 | [
"brute force",
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2071
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1943-C | codeforces | 1943-C | Tree Compass | https://codeforces.com/problemset/problem/1943/C | [
"constructive algorithms",
"dfs and similar",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2831
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1943-B | codeforces | 1943-B | Non-Palindromic Substring | https://codeforces.com/problemset/problem/1943/B | [
"hashing",
"implementation",
"math",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4758
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1943-A | codeforces | 1943-A | MEX Game 1 | https://codeforces.com/problemset/problem/1943/A | [
"games",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 22265
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1942-H | codeforces | 1942-H | Farmer John's Favorite Intern | https://codeforces.com/problemset/problem/1942/H | [
"data structures",
"dp",
"flows",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 275
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1942-G | codeforces | 1942-G | Bessie and Cards | https://codeforces.com/problemset/problem/1942/G | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 882
} | 2026-11-02T05:37:07.883505+00:00 |
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": 1022
} | 2026-11-02T05:37:07.883505+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": 2068
} | 2026-11-02T05:37:07.883505+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": 3460
} | 2026-11-02T05:37:07.883505+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": 7032
} | 2026-11-02T05:37:07.883505+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": 12658
} | 2026-11-02T05:37:07.883505+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": 15805
} | 2026-11-02T05:37:07.883505+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": 18696
} | 2026-11-02T05:37:07.883505+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": 5179
} | 2026-11-02T05:37:07.883505+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": 7692
} | 2026-11-02T05:37:07.883505+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": 12522
} | 2026-11-02T05:37:07.883505+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": 21554
} | 2026-11-02T05:37:07.883505+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": 40404
} | 2026-11-02T05:37:07.883505+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": 35803
} | 2026-11-02T05:37:07.883505+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": 48718
} | 2026-11-02T05:37:07.883505+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-11-02T05:37:07.883505+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": 46
} | 2026-11-02T05:37:07.883505+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-11-02T05:37:07.883505+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-11-02T05:37:07.883505+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": 116
} | 2026-11-02T05:37:07.883505+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": 421
} | 2026-11-02T05:37:07.883505+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": 311
} | 2026-11-02T05:37:07.883505+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": 31
} | 2026-11-02T05:37:07.883505+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": 107
} | 2026-11-02T05:37:07.883505+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": 370
} | 2026-11-02T05:37:07.883505+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": 815
} | 2026-11-02T05:37:07.883505+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": 1668
} | 2026-11-02T05:37:07.883505+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": 92
} | 2026-11-02T05:37:07.883505+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": 2785
} | 2026-11-02T05:37:07.883505+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": 1358
} | 2026-11-02T05:37:07.883505+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": 966
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1938-E | codeforces | 1938-E | Duplicates | https://codeforces.com/problemset/problem/1938/E | [] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1333
} | 2026-11-02T05:37:07.883505+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": 114
} | 2026-11-02T05:37:07.883505+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": 1911
} | 2026-11-02T05:37:07.883505+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-11-02T05:37:07.883505+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": 88
} | 2026-11-02T05:37:07.883505+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": 17761
} | 2026-11-02T05:37:07.883505+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": 25031
} | 2026-11-02T05:37:07.883505+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": 185
} | 2026-11-02T05:37:07.883505+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-11-02T05:37:07.883505+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": 739
} | 2026-11-02T05:37:07.883505+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": 1815
} | 2026-11-02T05:37:07.883505+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": 3686
} | 2026-11-02T05:37:07.883505+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": 8849
} | 2026-11-02T05:37:07.883505+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": 700
} | 2026-11-02T05:37:07.883505+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": 1728
} | 2026-11-02T05:37:07.883505+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": 11421
} | 2026-11-02T05:37:07.883505+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": 10069
} | 2026-11-02T05:37:07.883505+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": 21311
} | 2026-11-02T05:37:07.883505+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": 30736
} | 2026-11-02T05:37:07.883505+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": 416
} | 2026-11-02T05:37:07.883505+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": 1862
} | 2026-11-02T05:37:07.883505+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": 4326
} | 2026-11-02T05:37:07.883505+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": 8348
} | 2026-11-02T05:37:07.883505+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": 22634
} | 2026-11-02T05:37:07.883505+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": 27620
} | 2026-11-02T05:37:07.883505+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": 1237
} | 2026-11-02T05:37:07.883505+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": 3062
} | 2026-11-02T05:37:07.883505+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": 14043
} | 2026-11-02T05:37:07.883505+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": 24244
} | 2026-11-02T05:37:07.883505+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": 25927
} | 2026-11-02T05:37:07.883505+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": 37609
} | 2026-11-02T05:37:07.883505+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": 42918
} | 2026-11-02T05:37:07.883505+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": 1472
} | 2026-11-02T05:37:07.883505+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": 6252
} | 2026-11-02T05:37:07.883505+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": 10651
} | 2026-11-02T05:37:07.883505+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": 13833
} | 2026-11-02T05:37:07.883505+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": 19608
} | 2026-11-02T05:37:07.883505+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": 24248
} | 2026-11-02T05:37:07.883505+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.