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:2237-E | codeforces | 2237-E | Permutation Commutation | https://codeforces.com/problemset/problem/2237/E | [
"data structures",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2189
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2237-D | codeforces | 2237-D | Fullmetal Bitchemist | https://codeforces.com/problemset/problem/2237/D | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6739
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2237-C | codeforces | 2237-C | Duck Surplus | https://codeforces.com/problemset/problem/2237/C | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 16769
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2237-B | codeforces | 2237-B | Annoying the Ghost | https://codeforces.com/problemset/problem/2237/B | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 15498
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2237-A | codeforces | 2237-A | Destroying Towers | https://codeforces.com/problemset/problem/2237/A | [
"games",
"greedy",
"schedules"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22562
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2236-G | codeforces | 2236-G | Criterion in Burlandia | https://codeforces.com/problemset/problem/2236/G | [
"binary search",
"bitmasks",
"brute force",
"data structures",
"dfs and similar",
"divide and conquer",
"implementation",
"trees",
"two pointers"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 456
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2236-F2 | codeforces | 2236-F2 | Elections in Saransk (hard version) | https://codeforces.com/problemset/problem/2236/F2 | [
"combinatorics",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1275
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2236-F1 | codeforces | 2236-F1 | Elections in Saransk (easy version) | https://codeforces.com/problemset/problem/2236/F1 | [
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5366
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2236-E | codeforces | 2236-E | Friendly Gifts | https://codeforces.com/problemset/problem/2236/E | [
"brute force",
"dp"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6883
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2236-D | codeforces | 2236-D | Brand New Tatar TV Show | https://codeforces.com/problemset/problem/2236/D | [
"binary search",
"constructive algorithms",
"dp",
"games",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13494
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2236-C | codeforces | 2236-C | Omsk Programmers | https://codeforces.com/problemset/problem/2236/C | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 22116
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2236-B | codeforces | 2236-B | Tatar TV Show | https://codeforces.com/problemset/problem/2236/B | [
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29622
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2236-A | codeforces | 2236-A | Games on the Train | https://codeforces.com/problemset/problem/2236/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 36300
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2234-G | codeforces | 2234-G | Stripe, Token and Two Players | https://codeforces.com/problemset/problem/2234/G | [
"data structures",
"dp",
"games"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 410
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2234-F | codeforces | 2234-F | Vessels, Heights and Two Versions (Hard Version) | https://codeforces.com/problemset/problem/2234/F | [
"data structures",
"dfs and similar",
"dsu",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2484
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2234-E | codeforces | 2234-E | Vlad, Misha and Two Arrays | https://codeforces.com/problemset/problem/2234/E | [
"brute force",
"combinatorics",
"dfs and similar",
"divide and conquer",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2230
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2234-D | codeforces | 2234-D | XOR, Expression and Two Binary Numbers | https://codeforces.com/problemset/problem/2234/D | [
"bitmasks",
"divide and conquer",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9199
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2234-C | codeforces | 2234-C | Vessels, Heights and Two Versions (Easy Version) | https://codeforces.com/problemset/problem/2234/C | [
"dfs and similar",
"dsu",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 12720
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2234-B | codeforces | 2234-B | Palindrome, Twelve and Two Terms | https://codeforces.com/problemset/problem/2234/B | [
"brute force",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22994
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2234-A | codeforces | 2234-A | Euclid, Sequence and Two Numbers | https://codeforces.com/problemset/problem/2234/A | [
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25023
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2233-F | codeforces | 2233-F | Shortest GCD Paths | https://codeforces.com/problemset/problem/2233/F | [
"dp",
"graphs",
"math",
"number theory",
"shortest paths"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 550
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2233-E2 | codeforces | 2233-E2 | Permutation Transmission (Difficult Version) | https://codeforces.com/problemset/problem/2233/E2 | [
"bitmasks",
"combinatorics",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1393
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2233-E1 | codeforces | 2233-E1 | Permutation Transmission (Easy Version) | https://codeforces.com/problemset/problem/2233/E1 | [
"bitmasks",
"combinatorics",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1312
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2233-D | codeforces | 2233-D | Goods on the Shelf | https://codeforces.com/problemset/problem/2233/D | [
"brute force",
"data structures",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3754
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2233-C | codeforces | 2233-C | Cost of a Bracket Sequence | https://codeforces.com/problemset/problem/2233/C | [
"brute force",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10019
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2233-B | codeforces | 2233-B | Different Distances | https://codeforces.com/problemset/problem/2233/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 900 | {
"solved_count": 18774
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2233-A | codeforces | 2233-A | AI Project Development | https://codeforces.com/problemset/problem/2233/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23797
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2232-F | codeforces | 2232-F | The Cake Is a Lie | https://codeforces.com/problemset/problem/2232/F | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 321
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2232-E | codeforces | 2232-E | Snaking Arrangement | https://codeforces.com/problemset/problem/2232/E | [
"combinatorics",
"constructive algorithms"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 658
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2232-D | codeforces | 2232-D | Magical Tiered Cake | https://codeforces.com/problemset/problem/2232/D | [
"constructive algorithms",
"dfs and similar",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2866
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2232-C2 | codeforces | 2232-C2 | Seating Arrangement (Hard Version) | https://codeforces.com/problemset/problem/2232/C2 | [
"binary search",
"greedy",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9177
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2232-C1 | codeforces | 2232-C1 | Seating Arrangement (Easy Version) | https://codeforces.com/problemset/problem/2232/C1 | [
"binary search",
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12663
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2232-B | codeforces | 2232-B | Cake Leveling | https://codeforces.com/problemset/problem/2232/B | [
"binary search",
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 21917
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2232-A | codeforces | 2232-A | Convergence | https://codeforces.com/problemset/problem/2232/A | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23928
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2231-F | codeforces | 2231-F | Quadratic Jumps | https://codeforces.com/problemset/problem/2231/F | [
"brute force",
"constructive algorithms",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 858
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2231-E | codeforces | 2231-E | Graph Cutting | https://codeforces.com/problemset/problem/2231/E | [
"dfs and similar",
"dp",
"math",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1251
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2231-D | codeforces | 2231-D | Maximum Prefix Sums | https://codeforces.com/problemset/problem/2231/D | [
"constructive algorithms",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4022
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2231-C | codeforces | 2231-C | Chipmunk Theo and Equality | https://codeforces.com/problemset/problem/2231/C | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 12549
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2231-B | codeforces | 2231-B | Another Sorting Problem | https://codeforces.com/problemset/problem/2231/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 18824
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2231-A | codeforces | 2231-A | Construct an Array | https://codeforces.com/problemset/problem/2231/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26298
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2230-F | codeforces | 2230-F | Game on Growing Tree | https://codeforces.com/problemset/problem/2230/F | [
"binary search",
"dfs and similar",
"divide and conquer",
"dp",
"games",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 545
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2230-E | codeforces | 2230-E | Minimum Influence | https://codeforces.com/problemset/problem/2230/E | [
"binary search",
"data structures",
"greedy",
"implementation",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1584
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2230-D | codeforces | 2230-D | Good Schedule | https://codeforces.com/problemset/problem/2230/D | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5683
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2230-C | codeforces | 2230-C | Arrange the Numbers in a Circle | https://codeforces.com/problemset/problem/2230/C | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12169
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2230-B | codeforces | 2230-B | Digit String | https://codeforces.com/problemset/problem/2230/B | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 17980
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2230-A | codeforces | 2230-A | Optimal Purchase | https://codeforces.com/problemset/problem/2230/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24347
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2229-I | codeforces | 2229-I | The Endians | https://codeforces.com/problemset/problem/2229/I | [
"dp",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 253
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2229-H | codeforces | 2229-H | Wowee Binary String | https://codeforces.com/problemset/problem/2229/H | [
"combinatorics",
"dp",
"strings"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 296
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2229-G | codeforces | 2229-G | Roadworks | https://codeforces.com/problemset/problem/2229/G | [
"binary search",
"data structures",
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 386
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2229-F | codeforces | 2229-F | Load Unbalancing | https://codeforces.com/problemset/problem/2229/F | [
"binary search",
"bitmasks",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1182
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2229-E | codeforces | 2229-E | Deconstruction Tree | https://codeforces.com/problemset/problem/2229/E | [
"combinatorics",
"data structures",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2113
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2229-D | codeforces | 2229-D | Me When Median Problem | https://codeforces.com/problemset/problem/2229/D | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5594
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2229-C2 | codeforces | 2229-C2 | We Be Flipping (Hard Version) | https://codeforces.com/problemset/problem/2229/C2 | [
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 9122
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2229-C1 | codeforces | 2229-C1 | We Be Flipping (Easy Version) | https://codeforces.com/problemset/problem/2229/C1 | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 16547
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2229-B | codeforces | 2229-B | Absolute Cinema | https://codeforces.com/problemset/problem/2229/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19189
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2229-A | codeforces | 2229-A | Slimes on a Line | https://codeforces.com/problemset/problem/2229/A | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19265
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2228-F | codeforces | 2228-F | Momoyo and the Network | https://codeforces.com/problemset/problem/2228/F | [
"binary search",
"dfs and similar",
"divide and conquer",
"dp",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 384
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2228-E2 | codeforces | 2228-E2 | Amanojaku and Sequence (Hard Version) | https://codeforces.com/problemset/problem/2228/E2 | [
"combinatorics",
"data structures",
"implementation",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 394
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2228-E1 | codeforces | 2228-E1 | Amanojaku and Sequence (Easy Version) | https://codeforces.com/problemset/problem/2228/E1 | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 679
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2228-D | codeforces | 2228-D | Sanae, Cross and Color | https://codeforces.com/problemset/problem/2228/D | [
"binary search",
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3056
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2228-C2 | codeforces | 2228-C2 | Cirno and Number (Hard Version) | https://codeforces.com/problemset/problem/2228/C2 | [
"binary search",
"dfs and similar",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6582
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2228-C1 | codeforces | 2228-C1 | Cirno and Number (Easy Version) | https://codeforces.com/problemset/problem/2228/C1 | [
"binary search",
"brute force",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 8479
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2228-B | codeforces | 2228-B | Remilia Plays Soku | https://codeforces.com/problemset/problem/2228/B | [
"games",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 17762
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2228-A | codeforces | 2228-A | Marisa Steals Reimu's Takeout | https://codeforces.com/problemset/problem/2228/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22541
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2227-H | codeforces | 2227-H | Fallen Leaves | https://codeforces.com/problemset/problem/2227/H | [
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1827
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2227-G | codeforces | 2227-G | Drowning | https://codeforces.com/problemset/problem/2227/G | [
"binary search",
"data structures",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2398
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2227-F | codeforces | 2227-F | It Just Keeps Going Sideways | https://codeforces.com/problemset/problem/2227/F | [
"binary search",
"data structures",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4750
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2227-E | codeforces | 2227-E | It All Went Sideways | https://codeforces.com/problemset/problem/2227/E | [
"binary search",
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10492
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2227-D | codeforces | 2227-D | Palindromex | https://codeforces.com/problemset/problem/2227/D | [
"binary search",
"brute force",
"constructive algorithms",
"data structures",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 15099
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2227-C | codeforces | 2227-C | Snowfall | https://codeforces.com/problemset/problem/2227/C | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23987
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2227-B | codeforces | 2227-B | Party Monster | https://codeforces.com/problemset/problem/2227/B | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29107
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2227-A | codeforces | 2227-A | Koshary | https://codeforces.com/problemset/problem/2227/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 33214
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2226-G | codeforces | 2226-G | Stop Spot | https://codeforces.com/problemset/problem/2226/G | [
"implementation",
"strings",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 214
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2226-F | codeforces | 2226-F | Inversion Invasion | https://codeforces.com/problemset/problem/2226/F | [
"math",
"number theory"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 313
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2226-E | codeforces | 2226-E | Mental Monumental (Hard Version) | https://codeforces.com/problemset/problem/2226/E | [
"data structures",
"greedy",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1113
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2226-D | codeforces | 2226-D | Reserved Reversals | https://codeforces.com/problemset/problem/2226/D | [
"constructive algorithms",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3411
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2226-C | codeforces | 2226-C | Mental Monumental (Easy Version) | https://codeforces.com/problemset/problem/2226/C | [
"binary search",
"data structures",
"greedy",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 8617
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2226-B | codeforces | 2226-B | Everything Everywhere | https://codeforces.com/problemset/problem/2226/B | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 15593
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2226-A | codeforces | 2226-A | Disturbing Distribution | https://codeforces.com/problemset/problem/2226/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16184
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2225-G | codeforces | 2225-G | Simple Problem | https://codeforces.com/problemset/problem/2225/G | [
"brute force",
"graphs",
"greedy",
"number theory"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 290
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2225-F | codeforces | 2225-F | String Cutting | https://codeforces.com/problemset/problem/2225/F | [
"binary search",
"brute force",
"greedy",
"hashing",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 810
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2225-E | codeforces | 2225-E | Covering Points with Circles | https://codeforces.com/problemset/problem/2225/E | [
"constructive algorithms",
"geometry",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1356
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2225-D | codeforces | 2225-D | Exceptional Segments | https://codeforces.com/problemset/problem/2225/D | [
"bitmasks",
"brute force",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 8788
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2225-C | codeforces | 2225-C | Red-Black Pairs | https://codeforces.com/problemset/problem/2225/C | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 14775
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2225-B | codeforces | 2225-B | Alternating String | https://codeforces.com/problemset/problem/2225/B | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 18101
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2225-A | codeforces | 2225-A | A Number Between Two Others | https://codeforces.com/problemset/problem/2225/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22549
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2224-B | codeforces | 2224-B | Zhily and Mex and Max | https://codeforces.com/problemset/problem/2224/B | [
"constructive algorithms",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 9858
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2224-A | codeforces | 2224-A | Zhily and Array Operating | https://codeforces.com/problemset/problem/2224/A | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 12498
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2223-F | codeforces | 2223-F | Zhily and Colorful Strings | https://codeforces.com/problemset/problem/2223/F | [
"divide and conquer",
"fft",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 125
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2223-E | codeforces | 2223-E | Zhily and Permutation | https://codeforces.com/problemset/problem/2223/E | [
"data structures",
"divide and conquer",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 80
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2223-D | codeforces | 2223-D | Zhily and Cycle | https://codeforces.com/problemset/problem/2223/D | [
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 398
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2223-C | codeforces | 2223-C | Zhily and Signpost | https://codeforces.com/problemset/problem/2223/C | [
"chinese remainder theorem",
"dfs and similar",
"math",
"number theory",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1007
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2223-B | codeforces | 2223-B | Zhily and Barknights | https://codeforces.com/problemset/problem/2223/B | [
"binary search",
"data structures",
"dp",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4110
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2223-A | codeforces | 2223-A | Zhily and Bracket Swapping | https://codeforces.com/problemset/problem/2223/A | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 8537
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2222-H | codeforces | 2222-H | Counting Sort? | https://codeforces.com/problemset/problem/2222/H | [
"brute force",
"combinatorics",
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 165
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2222-G | codeforces | 2222-G | Statistics on Tree | https://codeforces.com/problemset/problem/2222/G | [
"binary search",
"brute force",
"dfs and similar",
"divide and conquer",
"graphs",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 239
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2222-F | codeforces | 2222-F | Building Tree | https://codeforces.com/problemset/problem/2222/F | [
"data structures",
"divide and conquer",
"dsu",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 772
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2222-E | codeforces | 2222-E | Seek the Truth | https://codeforces.com/problemset/problem/2222/E | [
"binary search",
"bitmasks",
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2503
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2222-D | codeforces | 2222-D | Permutation Construction | https://codeforces.com/problemset/problem/2222/D | [
"constructive algorithms",
"data structures",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4325
} | 2026-10-12T05:34:17.574904+00:00 |
codeforces:2222-C | codeforces | 2222-C | Median Partition | https://codeforces.com/problemset/problem/2222/C | [
"dp",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6600
} | 2026-10-12T05:34:17.574904+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.