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:2092-A | codeforces | 2092-A | Kamilka and the Sheep | https://codeforces.com/problemset/problem/2092/A | [
"greedy",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28421
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2091-G | codeforces | 2091-G | Gleb and Boating | https://codeforces.com/problemset/problem/2091/G | [
"brute force",
"constructive algorithms",
"data structures",
"dp",
"graphs",
"greedy",
"math",
"number theory",
"shortest paths"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1536
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2091-F | codeforces | 2091-F | Igor and Mountain | https://codeforces.com/problemset/problem/2091/F | [
"binary search",
"brute force",
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6194
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2091-E | codeforces | 2091-E | Interesting Ratio | https://codeforces.com/problemset/problem/2091/E | [
"brute force",
"math",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 19857
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2091-D | codeforces | 2091-D | Place of the Olympiad | https://codeforces.com/problemset/problem/2091/D | [
"binary search",
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 23668
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2091-C | codeforces | 2091-C | Combination Lock | https://codeforces.com/problemset/problem/2091/C | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 29008
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2091-B | codeforces | 2091-B | Team Training | https://codeforces.com/problemset/problem/2091/B | [
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 32854
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2091-A | codeforces | 2091-A | Olympiad Date | https://codeforces.com/problemset/problem/2091/A | [
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 39154
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2090-C | codeforces | 2090-C | Dining Hall | https://codeforces.com/problemset/problem/2090/C | [
"data structures",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6394
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2090-B | codeforces | 2090-B | Pushing Balls | https://codeforces.com/problemset/problem/2090/B | [
"brute force",
"dp",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 16594
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2090-A | codeforces | 2090-A | Treasure Hunt | https://codeforces.com/problemset/problem/2090/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21445
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2089-E | codeforces | 2089-E | Black Cat Collapse | https://codeforces.com/problemset/problem/2089/E | [] | null | null | stdin_stdout | 3,500 | {
"solved_count": 128
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2089-D | codeforces | 2089-D | Conditional Operators | https://codeforces.com/problemset/problem/2089/D | [
"constructive algorithms"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 191
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2089-C2 | codeforces | 2089-C2 | Key of Like (Hard Version) | https://codeforces.com/problemset/problem/2089/C2 | [
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 263
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2089-C1 | codeforces | 2089-C1 | Key of Like (Easy Version) | https://codeforces.com/problemset/problem/2089/C1 | [
"dp",
"games",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1468
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2089-B2 | codeforces | 2089-B2 | Canteen (Hard Version) | https://codeforces.com/problemset/problem/2089/B2 | [
"binary search",
"data structures",
"dp",
"flows",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1291
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2089-B1 | codeforces | 2089-B1 | Canteen (Easy Version) | https://codeforces.com/problemset/problem/2089/B1 | [
"binary search",
"data structures",
"flows",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3253
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2089-A | codeforces | 2089-A | Simple Permutation | https://codeforces.com/problemset/problem/2089/A | [
"constructive algorithms",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7262
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2087-I | codeforces | 2087-I | Hamiltonian Partition | https://codeforces.com/problemset/problem/2087/I | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 26
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2087-H | codeforces | 2087-H | Nim with Special Numbers | https://codeforces.com/problemset/problem/2087/H | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 28
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2087-G | codeforces | 2087-G | Esports in Berland | https://codeforces.com/problemset/problem/2087/G | [
"*special",
"greedy"
] | null | null | stdin_stdout | null | {
"solved_count": 89
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2087-F | codeforces | 2087-F | Weapon Upgrade | https://codeforces.com/problemset/problem/2087/F | [
"*special",
"dp"
] | null | null | stdin_stdout | null | {
"solved_count": 70
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2087-E | codeforces | 2087-E | Color the Arrows | https://codeforces.com/problemset/problem/2087/E | [
"*special",
"dp"
] | null | null | stdin_stdout | null | {
"solved_count": 163
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2087-D | codeforces | 2087-D | Uppercase or Lowercase? | https://codeforces.com/problemset/problem/2087/D | [
"*special",
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 267
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2087-C | codeforces | 2087-C | Coin Game | https://codeforces.com/problemset/problem/2087/C | [
"*special",
"greedy"
] | null | null | stdin_stdout | null | {
"solved_count": 488
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2087-B | codeforces | 2087-B | Showmatch | https://codeforces.com/problemset/problem/2087/B | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 570
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2087-A | codeforces | 2087-A | Password Generator | https://codeforces.com/problemset/problem/2087/A | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 1053
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2086-F | codeforces | 2086-F | Online Palindrome | https://codeforces.com/problemset/problem/2086/F | [
"brute force",
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 142
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2086-E | codeforces | 2086-E | Zebra-like Numbers | https://codeforces.com/problemset/problem/2086/E | [
"bitmasks",
"brute force",
"constructive algorithms",
"dfs and similar",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1676
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2086-D | codeforces | 2086-D | Even String | https://codeforces.com/problemset/problem/2086/D | [
"brute force",
"combinatorics",
"dp",
"math",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8449
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2086-C | codeforces | 2086-C | Disappearing Permutation | https://codeforces.com/problemset/problem/2086/C | [
"dfs and similar",
"dp",
"dsu",
"graphs",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16253
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2086-B | codeforces | 2086-B | Large Array and Segments | https://codeforces.com/problemset/problem/2086/B | [
"binary search",
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 19110
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2086-A | codeforces | 2086-A | Cloudberry Jam | https://codeforces.com/problemset/problem/2086/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 33670
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2085-F2 | codeforces | 2085-F2 | Serval and Colorful Array (Hard Version) | https://codeforces.com/problemset/problem/2085/F2 | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 529
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2085-F1 | codeforces | 2085-F1 | Serval and Colorful Array (Easy Version) | https://codeforces.com/problemset/problem/2085/F1 | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 790
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2085-E | codeforces | 2085-E | Serval and Modulo | https://codeforces.com/problemset/problem/2085/E | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3178
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2085-D | codeforces | 2085-D | Serval and Kaitenzushi Buffet | https://codeforces.com/problemset/problem/2085/D | [
"data structures",
"graph matchings",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5371
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2085-C | codeforces | 2085-C | Serval and The Formula | https://codeforces.com/problemset/problem/2085/C | [
"bitmasks",
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 13728
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2085-B | codeforces | 2085-B | Serval and Final MEX | https://codeforces.com/problemset/problem/2085/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17210
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2085-A | codeforces | 2085-A | Serval and String Theory | https://codeforces.com/problemset/problem/2085/A | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 23657
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2084-H | codeforces | 2084-H | Turtle and Nediam 2 | https://codeforces.com/problemset/problem/2084/H | [
"dp",
"greedy"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 114
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2084-G2 | codeforces | 2084-G2 | Wish Upon a Satellite (Hard Version) | https://codeforces.com/problemset/problem/2084/G2 | [
"data structures",
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 109
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2084-G1 | codeforces | 2084-G1 | Wish Upon a Satellite (Easy Version) | https://codeforces.com/problemset/problem/2084/G1 | [
"dp",
"games"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 758
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2084-F | codeforces | 2084-F | Skyscape | https://codeforces.com/problemset/problem/2084/F | [
"constructive algorithms",
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 510
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2084-E | codeforces | 2084-E | Blossom | https://codeforces.com/problemset/problem/2084/E | [
"binary search",
"combinatorics",
"dp",
"implementation",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1803
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2084-D | codeforces | 2084-D | Arcology On Permafrost | https://codeforces.com/problemset/problem/2084/D | [
"binary search",
"brute force",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8931
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2084-C | codeforces | 2084-C | You Soared Afar With Grace | https://codeforces.com/problemset/problem/2084/C | [
"constructive algorithms",
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11809
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2084-B | codeforces | 2084-B | MIN = GCD | https://codeforces.com/problemset/problem/2084/B | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 16736
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2084-A | codeforces | 2084-A | Max and Mod | https://codeforces.com/problemset/problem/2084/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17470
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2082-B | codeforces | 2082-B | Floor or Ceil | https://codeforces.com/problemset/problem/2082/B | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8350
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2082-A | codeforces | 2082-A | Binary Matrix | https://codeforces.com/problemset/problem/2082/A | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 11242
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2081-G2 | codeforces | 2081-G2 | Hard Formula (Hard Version) | https://codeforces.com/problemset/problem/2081/G2 | [
"math"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 54
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2081-G1 | codeforces | 2081-G1 | Hard Formula | https://codeforces.com/problemset/problem/2081/G1 | [
"math",
"number theory"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 81
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2081-F | codeforces | 2081-F | Hot Matrix | https://codeforces.com/problemset/problem/2081/F | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 142
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2081-E | codeforces | 2081-E | Quantifier | https://codeforces.com/problemset/problem/2081/E | [
"combinatorics",
"dp",
"implementation"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 85
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2081-D | codeforces | 2081-D | MST in Modulo Graph | https://codeforces.com/problemset/problem/2081/D | [
"constructive algorithms",
"dsu",
"graphs",
"greedy",
"math",
"number theory",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1210
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2081-C | codeforces | 2081-C | Quaternary Matrix | https://codeforces.com/problemset/problem/2081/C | [
"bitmasks",
"constructive algorithms",
"greedy",
"implementation",
"matrices"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 361
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2081-B | codeforces | 2081-B | Balancing | https://codeforces.com/problemset/problem/2081/B | [
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1003
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2081-A | codeforces | 2081-A | Math Division | https://codeforces.com/problemset/problem/2081/A | [
"bitmasks",
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4120
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2080-D | codeforces | 2080-D | Order Statistics | https://codeforces.com/problemset/problem/2080/D | [
"*special",
"binary search"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 47
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2080-C | codeforces | 2080-C | Card Flip | https://codeforces.com/problemset/problem/2080/C | [
"*special"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 206
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2080-B | codeforces | 2080-B | Best Runner | https://codeforces.com/problemset/problem/2080/B | [
"*special"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 513
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2080-A | codeforces | 2080-A | Strong Connectivity Strikes Back | https://codeforces.com/problemset/problem/2080/A | [
"*special",
"constructive algorithms",
"graphs"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 46
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2079-D | codeforces | 2079-D | Cute Subsequences | https://codeforces.com/problemset/problem/2079/D | [
"*special",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 692
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2079-C | codeforces | 2079-C | Dreaming Is Not Harmful | https://codeforces.com/problemset/problem/2079/C | [
"*special"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 224
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2079-B | codeforces | 2079-B | Arithmetic Exercise | https://codeforces.com/problemset/problem/2079/B | [
"*special",
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 156
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2079-A | codeforces | 2079-A | Alice, Bob, And Two Arrays | https://codeforces.com/problemset/problem/2079/A | [
"*special",
"data structures",
"dp",
"games"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 38
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2078-D | codeforces | 2078-D | Scammy Game Ad | https://codeforces.com/problemset/problem/2078/D | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6589
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2078-B | codeforces | 2078-B | Vicious Labyrinth | https://codeforces.com/problemset/problem/2078/B | [
"constructive algorithms",
"graphs",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 18417
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2078-A | codeforces | 2078-A | Final Verdict | https://codeforces.com/problemset/problem/2078/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23352
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2077-G | codeforces | 2077-G | RGB Walking | https://codeforces.com/problemset/problem/2077/G | [
"bitmasks",
"chinese remainder theorem",
"dfs and similar",
"graphs",
"number theory"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 136
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2077-F | codeforces | 2077-F | AND x OR | https://codeforces.com/problemset/problem/2077/F | [
"bitmasks",
"constructive algorithms",
"dp"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 266
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2077-E | codeforces | 2077-E | Another Folding Strip | https://codeforces.com/problemset/problem/2077/E | [
"combinatorics",
"constructive algorithms",
"data structures",
"divide and conquer",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 613
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2077-D | codeforces | 2077-D | Maximum Polygon | https://codeforces.com/problemset/problem/2077/D | [
"brute force",
"data structures",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 388
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2077-C | codeforces | 2077-C | Binary Subsequence Value Sum | https://codeforces.com/problemset/problem/2077/C | [
"combinatorics",
"data structures",
"dp",
"fft",
"math",
"matrices"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2393
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2077-B | codeforces | 2077-B | Finding OR Sum | https://codeforces.com/problemset/problem/2077/B | [
"bitmasks",
"constructive algorithms",
"implementation",
"interactive",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3685
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2077-A | codeforces | 2077-A | Breach of Faith | https://codeforces.com/problemset/problem/2077/A | [
"constructive algorithms",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14694
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2075-F | codeforces | 2075-F | Beautiful Sequence Returns | https://codeforces.com/problemset/problem/2075/F | [
"binary search",
"brute force",
"data structures",
"implementation"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 526
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2075-E | codeforces | 2075-E | XOR Matrix | https://codeforces.com/problemset/problem/2075/E | [
"bitmasks",
"combinatorics",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1190
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2075-D | codeforces | 2075-D | Equalization | https://codeforces.com/problemset/problem/2075/D | [
"bitmasks",
"brute force",
"dp",
"graphs",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5872
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2075-C | codeforces | 2075-C | Two Colors | https://codeforces.com/problemset/problem/2075/C | [
"binary search",
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14496
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2075-B | codeforces | 2075-B | Array Recoloring | https://codeforces.com/problemset/problem/2075/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 18999
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2075-A | codeforces | 2075-A | To Zero | https://codeforces.com/problemset/problem/2075/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27975
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2074-G | codeforces | 2074-G | Game With Triangles: Season 2 | https://codeforces.com/problemset/problem/2074/G | [
"dp",
"geometry"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2187
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2074-F | codeforces | 2074-F | Counting Necessary Nodes | https://codeforces.com/problemset/problem/2074/F | [
"bitmasks",
"divide and conquer",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2495
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2074-E | codeforces | 2074-E | Empty Triangle | https://codeforces.com/problemset/problem/2074/E | [
"geometry",
"interactive",
"probabilities"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6717
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2074-D | codeforces | 2074-D | Counting Points | https://codeforces.com/problemset/problem/2074/D | [
"brute force",
"data structures",
"geometry",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 12151
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2074-C | codeforces | 2074-C | XOR and Triangle | https://codeforces.com/problemset/problem/2074/C | [
"bitmasks",
"brute force",
"geometry",
"greedy",
"probabilities"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 22076
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2074-B | codeforces | 2074-B | The Third Side | https://codeforces.com/problemset/problem/2074/B | [
"geometry",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 34895
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2074-A | codeforces | 2074-A | Draw a Square | https://codeforces.com/problemset/problem/2074/A | [
"geometry",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 44584
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2073-M | codeforces | 2073-M | Can You Reach There? | https://codeforces.com/problemset/problem/2073/M | [] | null | null | stdin_stdout | 3,300 | {
"solved_count": 82
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2073-L | codeforces | 2073-L | Boarding Queue | https://codeforces.com/problemset/problem/2073/L | [] | null | null | stdin_stdout | 1,300 | {
"solved_count": 1788
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2073-K | codeforces | 2073-K | Book Sorting | https://codeforces.com/problemset/problem/2073/K | [] | null | null | stdin_stdout | 2,900 | {
"solved_count": 247
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2073-J | codeforces | 2073-J | Gathering Sharks | https://codeforces.com/problemset/problem/2073/J | [] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1183
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2073-I | codeforces | 2073-I | Squares on Grid Lines | https://codeforces.com/problemset/problem/2073/I | [] | null | null | stdin_stdout | 3,100 | {
"solved_count": 123
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2073-H | codeforces | 2073-H | Secret Lilies and Roses | https://codeforces.com/problemset/problem/2073/H | [
"interactive"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 375
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2073-G | codeforces | 2073-G | Corrupted File | https://codeforces.com/problemset/problem/2073/G | [] | null | null | stdin_stdout | 2,200 | {
"solved_count": 927
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2073-F | codeforces | 2073-F | Hold the Star | https://codeforces.com/problemset/problem/2073/F | [] | null | null | stdin_stdout | 3,500 | {
"solved_count": 70
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2073-E | codeforces | 2073-E | Minus Operator | https://codeforces.com/problemset/problem/2073/E | [
"interactive"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 79
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2073-D | codeforces | 2073-D | Tower of Hanoi | https://codeforces.com/problemset/problem/2073/D | [] | null | null | stdin_stdout | 2,400 | {
"solved_count": 565
} | 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.