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:1986-G1 | codeforces | 1986-G1 | Permutation Problem (Simple Version) | https://codeforces.com/problemset/problem/1986/G1 | [
"binary search",
"brute force",
"combinatorics",
"data structures",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1919
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1986-F | codeforces | 1986-F | Non-academic Problem | https://codeforces.com/problemset/problem/1986/F | [
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6516
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1986-E | codeforces | 1986-E | Beautiful Array | https://codeforces.com/problemset/problem/1986/E | [
"greedy",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10918
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1986-D | codeforces | 1986-D | Mathematical Problem | https://codeforces.com/problemset/problem/1986/D | [
"brute force",
"dp",
"greedy",
"implementation",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 18048
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1986-C | codeforces | 1986-C | Update Queries | https://codeforces.com/problemset/problem/1986/C | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 26117
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1986-B | codeforces | 1986-B | Matrix Stabilization | https://codeforces.com/problemset/problem/1986/B | [
"brute force",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 30212
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1986-A | codeforces | 1986-A | X Axis | https://codeforces.com/problemset/problem/1986/A | [
"brute force",
"geometry",
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 48167
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1985-H2 | codeforces | 1985-H2 | Maximize the Largest Component (Hard Version) | https://codeforces.com/problemset/problem/1985/H2 | [
"data structures",
"dfs and similar",
"dp",
"dsu",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1918
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1985-H1 | codeforces | 1985-H1 | Maximize the Largest Component (Easy Version) | https://codeforces.com/problemset/problem/1985/H1 | [
"brute force",
"data structures",
"dfs and similar",
"dsu",
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7305
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1985-G | codeforces | 1985-G | D-Function | https://codeforces.com/problemset/problem/1985/G | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12299
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1985-F | codeforces | 1985-F | Final Boss | https://codeforces.com/problemset/problem/1985/F | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 20139
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1985-E | codeforces | 1985-E | Secret Box | https://codeforces.com/problemset/problem/1985/E | [
"brute force",
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 23620
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1985-D | codeforces | 1985-D | Manhattan Circle | https://codeforces.com/problemset/problem/1985/D | [
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 41597
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1985-C | codeforces | 1985-C | Good Prefixes | https://codeforces.com/problemset/problem/1985/C | [
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 40365
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1985-B | codeforces | 1985-B | Maximum Multiple Sum | https://codeforces.com/problemset/problem/1985/B | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 57107
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1985-A | codeforces | 1985-A | Creating Words | https://codeforces.com/problemset/problem/1985/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 72899
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1984-H | codeforces | 1984-H | Tower Capturing | https://codeforces.com/problemset/problem/1984/H | [
"combinatorics",
"dp",
"geometry"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 210
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1984-G | codeforces | 1984-G | Magic Trick II | https://codeforces.com/problemset/problem/1984/G | [
"constructive algorithms",
"implementation",
"sortings"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 302
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1984-F | codeforces | 1984-F | Reconstruction | https://codeforces.com/problemset/problem/1984/F | [
"brute force",
"dp",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1145
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1984-E | codeforces | 1984-E | Shuffle | https://codeforces.com/problemset/problem/1984/E | [
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1822
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1984-D | codeforces | 1984-D | ''a'' String Problem | https://codeforces.com/problemset/problem/1984/D | [
"brute force",
"hashing",
"implementation",
"math",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3897
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1984-C2 | codeforces | 1984-C2 | Magnitude (Hard Version) | https://codeforces.com/problemset/problem/1984/C2 | [
"combinatorics",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8744
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1984-C1 | codeforces | 1984-C1 | Magnitude (Easy Version) | https://codeforces.com/problemset/problem/1984/C1 | [
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 20283
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1984-B | codeforces | 1984-B | Large Addition | https://codeforces.com/problemset/problem/1984/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 21010
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1984-A | codeforces | 1984-A | Strange Splitting | https://codeforces.com/problemset/problem/1984/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22908
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1983-G | codeforces | 1983-G | Your Loss | https://codeforces.com/problemset/problem/1983/G | [
"bitmasks",
"brute force",
"dp",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 286
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1983-F | codeforces | 1983-F | array-value | https://codeforces.com/problemset/problem/1983/F | [
"binary search",
"bitmasks",
"data structures",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1537
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1983-E | codeforces | 1983-E | I Love Balls | https://codeforces.com/problemset/problem/1983/E | [
"combinatorics",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2488
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1983-D | codeforces | 1983-D | Swap Dilemma | https://codeforces.com/problemset/problem/1983/D | [
"constructive algorithms",
"data structures",
"divide and conquer",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11189
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1983-C | codeforces | 1983-C | Have Your Cake and Eat It Too | https://codeforces.com/problemset/problem/1983/C | [
"binary search",
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14784
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1983-B | codeforces | 1983-B | Corner Twist | https://codeforces.com/problemset/problem/1983/B | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 18467
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1983-A | codeforces | 1983-A | Array Divisibility | https://codeforces.com/problemset/problem/1983/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28159
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1982-F | codeforces | 1982-F | Sorting Problem Again | https://codeforces.com/problemset/problem/1982/F | [
"binary search",
"data structures",
"sortings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1298
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1982-E | codeforces | 1982-E | Number of k-good subarrays | https://codeforces.com/problemset/problem/1982/E | [
"bitmasks",
"brute force",
"combinatorics",
"divide and conquer",
"dp",
"math",
"meet-in-the-middle"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1911
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1982-D | codeforces | 1982-D | Beauty of the mountains | https://codeforces.com/problemset/problem/1982/D | [
"brute force",
"data structures",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9905
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1982-C | codeforces | 1982-C | Boring Day | https://codeforces.com/problemset/problem/1982/C | [
"binary search",
"data structures",
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 22019
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1982-B | codeforces | 1982-B | Collatz Conjecture | https://codeforces.com/problemset/problem/1982/B | [
"brute force",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 19820
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1982-A | codeforces | 1982-A | Soccer | https://codeforces.com/problemset/problem/1982/A | [
"greedy",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27549
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1981-F | codeforces | 1981-F | Turtle and Paths on a Tree | https://codeforces.com/problemset/problem/1981/F | [
"data structures",
"dp",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 352
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1981-E | codeforces | 1981-E | Turtle and Intersected Segments | https://codeforces.com/problemset/problem/1981/E | [
"data structures",
"dsu",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1246
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1981-D | codeforces | 1981-D | Turtle and Multiplication | https://codeforces.com/problemset/problem/1981/D | [
"constructive algorithms",
"dfs and similar",
"graphs",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2157
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1981-C | codeforces | 1981-C | Turtle and an Incomplete Sequence | https://codeforces.com/problemset/problem/1981/C | [
"bitmasks",
"brute force",
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6377
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1981-B | codeforces | 1981-B | Turtle and an Infinite Sequence | https://codeforces.com/problemset/problem/1981/B | [
"bitmasks",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16607
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1981-A | codeforces | 1981-A | Turtle and Piggy Are Playing a Game | https://codeforces.com/problemset/problem/1981/A | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24281
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1980-G | codeforces | 1980-G | Yasya and the Mysterious Tree | https://codeforces.com/problemset/problem/1980/G | [
"bitmasks",
"data structures",
"dfs and similar",
"graphs",
"greedy",
"strings",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1715
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1980-F2 | codeforces | 1980-F2 | Field Division (hard version) | https://codeforces.com/problemset/problem/1980/F2 | [
"math",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1237
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1980-F1 | codeforces | 1980-F1 | Field Division (easy version) | https://codeforces.com/problemset/problem/1980/F1 | [
"data structures",
"math",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4410
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1980-E | codeforces | 1980-E | Permutation of Rows and Columns | https://codeforces.com/problemset/problem/1980/E | [
"constructive algorithms",
"data structures",
"greedy",
"hashing",
"implementation",
"math",
"matrices",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 13089
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1980-D | codeforces | 1980-D | GCD-sequence | https://codeforces.com/problemset/problem/1980/D | [
"greedy",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 17455
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1980-C | codeforces | 1980-C | Sofia and the Lost Operations | https://codeforces.com/problemset/problem/1980/C | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 21799
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1980-B | codeforces | 1980-B | Choosing Cubes | https://codeforces.com/problemset/problem/1980/B | [
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 38593
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1980-A | codeforces | 1980-A | Problem Generator | https://codeforces.com/problemset/problem/1980/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 47776
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1979-F | codeforces | 1979-F | Kostyanych's Theorem | https://codeforces.com/problemset/problem/1979/F | [
"brute force",
"constructive algorithms",
"graphs",
"interactive"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 440
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1979-E | codeforces | 1979-E | Manhattan Triangle | https://codeforces.com/problemset/problem/1979/E | [
"binary search",
"constructive algorithms",
"data structures",
"geometry",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1828
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1979-D | codeforces | 1979-D | Fixing a Binary String | https://codeforces.com/problemset/problem/1979/D | [
"bitmasks",
"brute force",
"constructive algorithms",
"dp",
"greedy",
"hashing",
"strings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7888
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1979-C | codeforces | 1979-C | Earning on Bets | https://codeforces.com/problemset/problem/1979/C | [
"binary search",
"combinatorics",
"constructive algorithms",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 22294
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1979-B | codeforces | 1979-B | XOR Sequences | https://codeforces.com/problemset/problem/1979/B | [
"bitmasks",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 26552
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1979-A | codeforces | 1979-A | Guess the Maximum | https://codeforces.com/problemset/problem/1979/A | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31854
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1978-F | codeforces | 1978-F | Large Graph | https://codeforces.com/problemset/problem/1978/F | [
"data structures",
"dfs and similar",
"dsu",
"graphs",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1593
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1978-E | codeforces | 1978-E | Computing Machine | https://codeforces.com/problemset/problem/1978/E | [
"brute force",
"data structures",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4628
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1978-D | codeforces | 1978-D | Elections | https://codeforces.com/problemset/problem/1978/D | [
"data structures",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 13714
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1978-C | codeforces | 1978-C | Manhattan Permutations | https://codeforces.com/problemset/problem/1978/C | [
"constructive algorithms",
"data structures",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 17867
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1978-B | codeforces | 1978-B | New Bakery | https://codeforces.com/problemset/problem/1978/B | [
"binary search",
"greedy",
"math",
"ternary search"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25449
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1978-A | codeforces | 1978-A | Alice and Books | https://codeforces.com/problemset/problem/1978/A | [
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28678
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1977-E | codeforces | 1977-E | Tensor | https://codeforces.com/problemset/problem/1977/E | [
"constructive algorithms",
"graphs",
"interactive"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 938
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1977-D | codeforces | 1977-D | XORificator | https://codeforces.com/problemset/problem/1977/D | [
"bitmasks",
"brute force",
"greedy",
"hashing"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2377
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1977-C | codeforces | 1977-C | Nikita and LCM | https://codeforces.com/problemset/problem/1977/C | [
"brute force",
"data structures",
"dp",
"greedy",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 8068
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1977-B | codeforces | 1977-B | Binary Colouring | https://codeforces.com/problemset/problem/1977/B | [
"bitmasks",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 19951
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1977-A | codeforces | 1977-A | Little Nikita | https://codeforces.com/problemset/problem/1977/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 39362
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1976-F | codeforces | 1976-F | Remove Bridges | https://codeforces.com/problemset/problem/1976/F | [
"data structures",
"dfs and similar",
"dp",
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 841
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1976-E | codeforces | 1976-E | Splittable Permutations | https://codeforces.com/problemset/problem/1976/E | [
"combinatorics",
"data structures",
"dfs and similar",
"greedy",
"math",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1312
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1976-D | codeforces | 1976-D | Invertible Bracket Sequences | https://codeforces.com/problemset/problem/1976/D | [
"binary search",
"combinatorics",
"data structures",
"divide and conquer",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5833
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1976-C | codeforces | 1976-C | Job Interview | https://codeforces.com/problemset/problem/1976/C | [
"binary search",
"dp",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12489
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1976-B | codeforces | 1976-B | Increase/Decrease/Copy | https://codeforces.com/problemset/problem/1976/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 25156
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1976-A | codeforces | 1976-A | Verify Password | https://codeforces.com/problemset/problem/1976/A | [
"implementation",
"sortings",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 32718
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1975-I | codeforces | 1975-I | Mind Bloom | https://codeforces.com/problemset/problem/1975/I | [
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 184
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1975-H | codeforces | 1975-H | 378QAQ and Core | https://codeforces.com/problemset/problem/1975/H | [
"greedy",
"strings"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 218
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1975-G | codeforces | 1975-G | Zimpha Fan Club | https://codeforces.com/problemset/problem/1975/G | [
"fft",
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 345
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1975-F | codeforces | 1975-F | Set | https://codeforces.com/problemset/problem/1975/F | [
"bitmasks",
"brute force",
"combinatorics",
"dfs and similar",
"divide and conquer",
"dp",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1045
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1975-E | codeforces | 1975-E | Chain Queries | https://codeforces.com/problemset/problem/1975/E | [
"binary search",
"data structures",
"dfs and similar",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2896
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1975-D | codeforces | 1975-D | Paint the Tree | https://codeforces.com/problemset/problem/1975/D | [
"brute force",
"dfs and similar",
"dp",
"greedy",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7541
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1975-C | codeforces | 1975-C | Chamo and Mocha's Array | https://codeforces.com/problemset/problem/1975/C | [
"binary search",
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17228
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1975-B | codeforces | 1975-B | 378QAQ and Mocha's Array | https://codeforces.com/problemset/problem/1975/B | [
"brute force",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 21151
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1975-A | codeforces | 1975-A | Bazoka and Mocha's Array | https://codeforces.com/problemset/problem/1975/A | [
"brute force",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20778
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1974-G | codeforces | 1974-G | Money Buys Less Happiness Now | https://codeforces.com/problemset/problem/1974/G | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5954
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1974-F | codeforces | 1974-F | Cutting Game | https://codeforces.com/problemset/problem/1974/F | [
"binary search",
"brute force",
"data structures",
"implementation",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4418
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1974-E | codeforces | 1974-E | Money Buys Happiness | https://codeforces.com/problemset/problem/1974/E | [
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 11444
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1974-D | codeforces | 1974-D | Ingenuity-2 | https://codeforces.com/problemset/problem/1974/D | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 17877
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1974-C | codeforces | 1974-C | Beautiful Triple Pairs | https://codeforces.com/problemset/problem/1974/C | [
"combinatorics",
"data structures"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 19119
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1974-B | codeforces | 1974-B | Symmetric Encoding | https://codeforces.com/problemset/problem/1974/B | [
"implementation",
"sortings",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 34589
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1974-A | codeforces | 1974-A | Phone Desktop | https://codeforces.com/problemset/problem/1974/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 38052
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1973-F | codeforces | 1973-F | Maximum GCD Sum Queries | https://codeforces.com/problemset/problem/1973/F | [
"bitmasks",
"brute force",
"dp",
"implementation",
"number theory"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 320
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1973-E | codeforces | 1973-E | Cat, Fox and Swaps | https://codeforces.com/problemset/problem/1973/E | [
"graphs",
"math",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 994
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1973-D | codeforces | 1973-D | Cat, Fox and Maximum Array Split | https://codeforces.com/problemset/problem/1973/D | [
"brute force",
"interactive",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2265
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1973-C | codeforces | 1973-C | Cat, Fox and Double Maximum | https://codeforces.com/problemset/problem/1973/C | [
"constructive algorithms",
"greedy",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9885
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1973-B | codeforces | 1973-B | Cat, Fox and the Lonely Array | https://codeforces.com/problemset/problem/1973/B | [
"binary search",
"bitmasks",
"data structures",
"greedy",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16894
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1973-A | codeforces | 1973-A | Chess For Three | https://codeforces.com/problemset/problem/1973/A | [
"brute force",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 28674
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1972-B | codeforces | 1972-B | Coin Games | https://codeforces.com/problemset/problem/1972/B | [
"games"
] | null | null | stdin_stdout | 900 | {
"solved_count": 25513
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1972-A | codeforces | 1972-A | Contest Proposal | https://codeforces.com/problemset/problem/1972/A | [
"brute force",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25961
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1971-H | codeforces | 1971-H | ±1 | https://codeforces.com/problemset/problem/1971/H | [
"2-sat",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2782
} | 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.