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: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 | null | {
"solved_count": 65
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2232-E | codeforces | 2232-E | Snaking Arrangement | https://codeforces.com/problemset/problem/2232/E | [
"combinatorics",
"constructive algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": 210
} | 2026-06-01T05:00:40.145500+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 | null | {
"solved_count": 1414
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2232-C2 | codeforces | 2232-C2 | Seating Arrangement (Hard Version) | https://codeforces.com/problemset/problem/2232/C2 | [
"binary search",
"greedy",
"ternary search",
"two pointers"
] | null | null | stdin_stdout | null | {
"solved_count": 5180
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2232-C1 | codeforces | 2232-C1 | Seating Arrangement (Easy Version) | https://codeforces.com/problemset/problem/2232/C1 | [
"binary search",
"dp",
"greedy",
"ternary search",
"two pointers"
] | null | null | stdin_stdout | null | {
"solved_count": 7991
} | 2026-06-01T05:00:40.145500+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 | null | {
"solved_count": 14338
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2232-A | codeforces | 2232-A | Convergence | https://codeforces.com/problemset/problem/2232/A | [
"greedy",
"sortings"
] | null | null | stdin_stdout | null | {
"solved_count": 16649
} | 2026-06-01T05:00:40.145500+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": 568
} | 2026-06-01T05:00:40.145500+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": 835
} | 2026-06-01T05:00:40.145500+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": 2885
} | 2026-06-01T05:00:40.145500+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": 9311
} | 2026-06-01T05:00:40.145500+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": 14617
} | 2026-06-01T05:00:40.145500+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": 20804
} | 2026-06-01T05:00:40.145500+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": 381
} | 2026-06-01T05:00:40.145500+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,100 | {
"solved_count": 1121
} | 2026-06-01T05:00:40.145500+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": 3943
} | 2026-06-01T05:00:40.145500+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": 9067
} | 2026-06-01T05:00:40.145500+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": 13737
} | 2026-06-01T05:00:40.145500+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": 18628
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2229-I | codeforces | 2229-I | The Endians | https://codeforces.com/problemset/problem/2229/I | [
"dp",
"trees"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 112
} | 2026-06-01T05:00:40.145500+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,200 | {
"solved_count": 132
} | 2026-06-01T05:00:40.145500+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 | 2,900 | {
"solved_count": 255
} | 2026-06-01T05:00:40.145500+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": 841
} | 2026-06-01T05:00:40.145500+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": 1529
} | 2026-06-01T05:00:40.145500+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": 4194
} | 2026-06-01T05:00:40.145500+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": 6996
} | 2026-06-01T05:00:40.145500+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": 12787
} | 2026-06-01T05:00:40.145500+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": 14617
} | 2026-06-01T05:00:40.145500+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": 15192
} | 2026-06-01T05:00:40.145500+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": 270
} | 2026-06-01T05:00:40.145500+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": 249
} | 2026-06-01T05:00:40.145500+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": 510
} | 2026-06-01T05:00:40.145500+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": 2338
} | 2026-06-01T05:00:40.145500+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": 4986
} | 2026-06-01T05:00:40.145500+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": 6803
} | 2026-06-01T05:00:40.145500+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": 14438
} | 2026-06-01T05:00:40.145500+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": 18940
} | 2026-06-01T05:00:40.145500+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": 1363
} | 2026-06-01T05:00:40.145500+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": 1793
} | 2026-06-01T05:00:40.145500+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": 3600
} | 2026-06-01T05:00:40.145500+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": 7796
} | 2026-06-01T05:00:40.145500+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": 11301
} | 2026-06-01T05:00:40.145500+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": 19451
} | 2026-06-01T05:00:40.145500+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": 23564
} | 2026-06-01T05:00:40.145500+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": 25862
} | 2026-06-01T05:00:40.145500+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": 160
} | 2026-06-01T05:00:40.145500+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": 223
} | 2026-06-01T05:00:40.145500+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": 873
} | 2026-06-01T05:00:40.145500+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": 2712
} | 2026-06-01T05:00:40.145500+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": 6810
} | 2026-06-01T05:00:40.145500+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": 12188
} | 2026-06-01T05:00:40.145500+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": 13467
} | 2026-06-01T05:00:40.145500+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": 229
} | 2026-06-01T05:00:40.145500+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": 669
} | 2026-06-01T05:00:40.145500+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": 1183
} | 2026-06-01T05:00:40.145500+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": 7277
} | 2026-06-01T05:00:40.145500+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": 12443
} | 2026-06-01T05:00:40.145500+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": 15445
} | 2026-06-01T05:00:40.145500+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": 19418
} | 2026-06-01T05:00:40.145500+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": 7006
} | 2026-06-01T05:00:40.145500+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": 10007
} | 2026-06-01T05:00:40.145500+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,400 | {
"solved_count": 74
} | 2026-06-01T05:00:40.145500+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": 24
} | 2026-06-01T05:00:40.145500+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": 296
} | 2026-06-01T05:00:40.145500+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": 781
} | 2026-06-01T05:00:40.145500+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": 2945
} | 2026-06-01T05:00:40.145500+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": 6238
} | 2026-06-01T05:00:40.145500+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": 125
} | 2026-06-01T05:00:40.145500+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": 189
} | 2026-06-01T05:00:40.145500+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": 661
} | 2026-06-01T05:00:40.145500+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": 2155
} | 2026-06-01T05:00:40.145500+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": 3529
} | 2026-06-01T05:00:40.145500+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": 5292
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2222-B | codeforces | 2222-B | Artistic Balance Tree | https://codeforces.com/problemset/problem/2222/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 7966
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2222-A | codeforces | 2222-A | A Wonderful Contest | https://codeforces.com/problemset/problem/2222/A | [
"brute force",
"dp",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 10960
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2220-B | codeforces | 2220-B | OIE Excursion | https://codeforces.com/problemset/problem/2220/B | [
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 13158
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2220-A | codeforces | 2220-A | Blocked | https://codeforces.com/problemset/problem/2220/A | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19279
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2219-E | codeforces | 2219-E | Weird Chessboard | https://codeforces.com/problemset/problem/2219/E | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 111
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2219-D | codeforces | 2219-D | MEX Replacement on Tree | https://codeforces.com/problemset/problem/2219/D | [
"data structures",
"implementation",
"math",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 471
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2219-C | codeforces | 2219-C | Coloring a Red Black Tree | https://codeforces.com/problemset/problem/2219/C | [
"dfs and similar",
"dp",
"greedy",
"math",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1293
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2219-B2 | codeforces | 2219-B2 | Unique Values (Hard version) | https://codeforces.com/problemset/problem/2219/B2 | [
"binary search",
"bitmasks",
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3459
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2219-B1 | codeforces | 2219-B1 | Unique Values (Easy version) | https://codeforces.com/problemset/problem/2219/B1 | [
"binary search",
"constructive algorithms",
"divide and conquer",
"interactive",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3868
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2219-A | codeforces | 2219-A | Grid L | https://codeforces.com/problemset/problem/2219/A | [
"brute force",
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 9669
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2218-G | codeforces | 2218-G | The 67th Iteration of "Counting is Fun" | https://codeforces.com/problemset/problem/2218/G | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4088
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2218-F | codeforces | 2218-F | The 67th Tree Problem | https://codeforces.com/problemset/problem/2218/F | [
"constructive algorithms",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 8201
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2218-E | codeforces | 2218-E | The 67th XOR Problem | https://codeforces.com/problemset/problem/2218/E | [
"binary search",
"bitmasks",
"brute force"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 15595
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2218-D | codeforces | 2218-D | The 67th OEIS Problem | https://codeforces.com/problemset/problem/2218/D | [
"constructive algorithms",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 19884
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2218-C | codeforces | 2218-C | The 67th Permutation Problem | https://codeforces.com/problemset/problem/2218/C | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28671
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2218-B | codeforces | 2218-B | The 67th 6-7 Integer Problem | https://codeforces.com/problemset/problem/2218/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 36615
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2218-A | codeforces | 2218-A | The 67th Integer Problem | https://codeforces.com/problemset/problem/2218/A | [
"brute force",
"games",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 38087
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2217-H | codeforces | 2217-H | Closer | https://codeforces.com/problemset/problem/2217/H | [
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 244
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2217-G | codeforces | 2217-G | Down the Pivot | https://codeforces.com/problemset/problem/2217/G | [
"combinatorics",
"dp",
"math",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 403
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2217-F | codeforces | 2217-F | Interval Game | https://codeforces.com/problemset/problem/2217/F | [
"bitmasks",
"combinatorics",
"constructive algorithms",
"dp",
"games",
"greedy",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 810
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2217-E | codeforces | 2217-E | Definitely Larger | https://codeforces.com/problemset/problem/2217/E | [
"binary search",
"constructive algorithms",
"data structures",
"graphs",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2305
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2217-D | codeforces | 2217-D | Flip the Bit (Hard Version) | https://codeforces.com/problemset/problem/2217/D | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3582
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2217-C | codeforces | 2217-C | Grid Covering | https://codeforces.com/problemset/problem/2217/C | [
"chinese remainder theorem",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 11254
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2217-B | codeforces | 2217-B | Flip the Bit (Easy Version) | https://codeforces.com/problemset/problem/2217/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 17342
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2217-A | codeforces | 2217-A | The Equalizer | https://codeforces.com/problemset/problem/2217/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23653
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2216-B | codeforces | 2216-B | THU Packing Puzzle | https://codeforces.com/problemset/problem/2216/B | [
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 4472
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2216-A | codeforces | 2216-A | Course Wishes | https://codeforces.com/problemset/problem/2216/A | [
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 5334
} | 2026-06-01T05:00:40.145500+00:00 |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 39