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:1267-C | codeforces | 1267-C | Cactus Revenge | https://codeforces.com/problemset/problem/1267/C | [
"constructive algorithms"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 393
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1267-B | codeforces | 1267-B | Balls of Buma | https://codeforces.com/problemset/problem/1267/B | [] | null | null | stdin_stdout | 900 | {
"solved_count": 4551
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1267-A | codeforces | 1267-A | Apprentice Learning Trajectory | https://codeforces.com/problemset/problem/1267/A | [] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1063
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1266-H | codeforces | 1266-H | Red-Blue Graph | https://codeforces.com/problemset/problem/1266/H | [
"dp",
"graphs",
"math",
"matrices",
"meet-in-the-middle"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 133
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1266-G | codeforces | 1266-G | Permutation Concatenation | https://codeforces.com/problemset/problem/1266/G | [
"string suffix structures"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 139
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1266-F | codeforces | 1266-F | Almost Same Distance | https://codeforces.com/problemset/problem/1266/F | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 377
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1266-E | codeforces | 1266-E | Spaceship Solitaire | https://codeforces.com/problemset/problem/1266/E | [
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2353
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1266-D | codeforces | 1266-D | Decreasing Debts | https://codeforces.com/problemset/problem/1266/D | [
"constructive algorithms",
"data structures",
"graphs",
"greedy",
"implementation",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3877
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1266-C | codeforces | 1266-C | Diverse Matrix | https://codeforces.com/problemset/problem/1266/C | [
"constructive algorithms",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10075
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1266-B | codeforces | 1266-B | Dice Tower | https://codeforces.com/problemset/problem/1266/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 16616
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1266-A | codeforces | 1266-A | Competitive Programmer | https://codeforces.com/problemset/problem/1266/A | [
"chinese remainder theorem",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 17568
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1265-E | codeforces | 1265-E | Beautiful Mirrors | https://codeforces.com/problemset/problem/1265/E | [
"data structures",
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4557
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1265-B | codeforces | 1265-B | Beautiful Numbers | https://codeforces.com/problemset/problem/1265/B | [
"data structures",
"implementation",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13546
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1265-A | codeforces | 1265-A | Beautiful String | https://codeforces.com/problemset/problem/1265/A | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 15970
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1264-F | codeforces | 1264-F | Beautiful Fibonacci Problem | https://codeforces.com/problemset/problem/1264/F | [
"constructive algorithms",
"number theory"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 1098
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1264-E | codeforces | 1264-E | Beautiful League | https://codeforces.com/problemset/problem/1264/E | [
"constructive algorithms",
"flows",
"graph matchings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 930
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1264-D2 | codeforces | 1264-D2 | Beautiful Bracket Sequence (hard version) | https://codeforces.com/problemset/problem/1264/D2 | [
"combinatorics",
"probabilities"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1360
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1264-D1 | codeforces | 1264-D1 | Beautiful Bracket Sequence (easy version) | https://codeforces.com/problemset/problem/1264/D1 | [
"combinatorics",
"dp",
"probabilities"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1541
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1264-C | codeforces | 1264-C | Beautiful Mirrors with queries | https://codeforces.com/problemset/problem/1264/C | [
"data structures",
"probabilities"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1327
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1264-B | codeforces | 1264-B | Beautiful Sequence | https://codeforces.com/problemset/problem/1264/B | [
"brute force",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6057
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1264-A | codeforces | 1264-A | Beautiful Regional Contest | https://codeforces.com/problemset/problem/1264/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 10452
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1263-F | codeforces | 1263-F | Economic Difficulties | https://codeforces.com/problemset/problem/1263/F | [
"data structures",
"dfs and similar",
"dp",
"flows",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 957
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1263-E | codeforces | 1263-E | Editor | https://codeforces.com/problemset/problem/1263/E | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2981
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1263-D | codeforces | 1263-D | Secret Passwords | https://codeforces.com/problemset/problem/1263/D | [
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 16083
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1263-C | codeforces | 1263-C | Everyone is a Winner! | https://codeforces.com/problemset/problem/1263/C | [
"binary search",
"math",
"meet-in-the-middle",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14682
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1263-B | codeforces | 1263-B | PIN Codes | https://codeforces.com/problemset/problem/1263/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11822
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1263-A | codeforces | 1263-A | Sweet Problem | https://codeforces.com/problemset/problem/1263/A | [
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 17245
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1261-F | codeforces | 1261-F | Xor-Set | https://codeforces.com/problemset/problem/1261/F | [
"bitmasks",
"divide and conquer",
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 443
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1260-F | codeforces | 1260-F | Colored Tree | https://codeforces.com/problemset/problem/1260/F | [
"data structures",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 647
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1260-E | codeforces | 1260-E | Tournament | https://codeforces.com/problemset/problem/1260/E | [
"brute force",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1891
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1260-D | codeforces | 1260-D | A Game with Traps | https://codeforces.com/problemset/problem/1260/D | [
"binary search",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4200
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1260-C | codeforces | 1260-C | Infinite Fence | https://codeforces.com/problemset/problem/1260/C | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8805
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1260-B | codeforces | 1260-B | Obtain Two Zeroes | https://codeforces.com/problemset/problem/1260/B | [
"binary search",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16753
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1260-A | codeforces | 1260-A | Heating | https://codeforces.com/problemset/problem/1260/A | [
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 15862
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1257-G | codeforces | 1257-G | Divisor Set | https://codeforces.com/problemset/problem/1257/G | [
"divide and conquer",
"fft",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 740
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1257-F | codeforces | 1257-F | Make Them Similar | https://codeforces.com/problemset/problem/1257/F | [
"bitmasks",
"brute force",
"hashing",
"meet-in-the-middle"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2329
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1257-E | codeforces | 1257-E | The Contest | https://codeforces.com/problemset/problem/1257/E | [
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4575
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1257-D | codeforces | 1257-D | Yet Another Monster Killing Problem | https://codeforces.com/problemset/problem/1257/D | [
"binary search",
"data structures",
"dp",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8184
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1257-C | codeforces | 1257-C | Dominated Subarray | https://codeforces.com/problemset/problem/1257/C | [
"greedy",
"implementation",
"sortings",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17177
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1257-B | codeforces | 1257-B | Magic Stick | https://codeforces.com/problemset/problem/1257/B | [
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 22573
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1257-A | codeforces | 1257-A | Two Rival Students | https://codeforces.com/problemset/problem/1257/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21679
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1256-F | codeforces | 1256-F | Equalizing Two Strings | https://codeforces.com/problemset/problem/1256/F | [
"constructive algorithms",
"sortings",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3627
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1256-E | codeforces | 1256-E | Yet Another Division Into Teams | https://codeforces.com/problemset/problem/1256/E | [
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4614
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1256-D | codeforces | 1256-D | Binary String Minimizing | https://codeforces.com/problemset/problem/1256/D | [
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12778
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1256-C | codeforces | 1256-C | Platforms Jumping | https://codeforces.com/problemset/problem/1256/C | [
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7332
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1256-B | codeforces | 1256-B | Minimize the Permutation | https://codeforces.com/problemset/problem/1256/B | [
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 13696
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1256-A | codeforces | 1256-A | Payment Without Change | https://codeforces.com/problemset/problem/1256/A | [
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 32513
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1255-C | codeforces | 1255-C | League of Leesins | https://codeforces.com/problemset/problem/1255/C | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7234
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1255-B | codeforces | 1255-B | Fridge Lockers | https://codeforces.com/problemset/problem/1255/B | [
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 12550
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1255-A | codeforces | 1255-A | Changing Volume | https://codeforces.com/problemset/problem/1255/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18007
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1254-E | codeforces | 1254-E | Send Tree to Charlie | https://codeforces.com/problemset/problem/1254/E | [
"combinatorics",
"dfs and similar",
"dsu",
"trees"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 366
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1254-D | codeforces | 1254-D | Tree Queries | https://codeforces.com/problemset/problem/1254/D | [
"data structures",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1564
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1254-C | codeforces | 1254-C | Point Ordering | https://codeforces.com/problemset/problem/1254/C | [
"constructive algorithms",
"geometry",
"interactive",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1601
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1254-B2 | codeforces | 1254-B2 | Send Boxes to Alice (Hard Version) | https://codeforces.com/problemset/problem/1254/B2 | [
"constructive algorithms",
"greedy",
"math",
"number theory",
"ternary search",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3425
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1254-B1 | codeforces | 1254-B1 | Send Boxes to Alice (Easy Version) | https://codeforces.com/problemset/problem/1254/B1 | [
"constructive algorithms",
"greedy",
"math",
"number theory",
"ternary search",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5017
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1254-A | codeforces | 1254-A | Feeding Chicken | https://codeforces.com/problemset/problem/1254/A | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5518
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1253-F | codeforces | 1253-F | Cheap Robot | https://codeforces.com/problemset/problem/1253/F | [
"binary search",
"dsu",
"graphs",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2266
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1253-E | codeforces | 1253-E | Antenna Coverage | https://codeforces.com/problemset/problem/1253/E | [
"data structures",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3073
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1253-D | codeforces | 1253-D | Harmonious Graph | https://codeforces.com/problemset/problem/1253/D | [
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10274
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1253-C | codeforces | 1253-C | Sweets Eating | https://codeforces.com/problemset/problem/1253/C | [
"dp",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15389
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1253-B | codeforces | 1253-B | Silly Mistake | https://codeforces.com/problemset/problem/1253/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11719
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1253-A | codeforces | 1253-A | Single Push | https://codeforces.com/problemset/problem/1253/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 19462
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1252-L | codeforces | 1252-L | Road Construction | https://codeforces.com/problemset/problem/1252/L | [
"flows",
"graphs"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 646
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1252-K | codeforces | 1252-K | Addition Robot | https://codeforces.com/problemset/problem/1252/K | [
"data structures",
"math",
"matrices"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2080
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1252-J | codeforces | 1252-J | Tiling Terrace | https://codeforces.com/problemset/problem/1252/J | [
"brute force",
"dp"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 786
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1252-I | codeforces | 1252-I | Mission Possible | https://codeforces.com/problemset/problem/1252/I | [] | null | null | stdin_stdout | 3,000 | {
"solved_count": 35
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1252-H | codeforces | 1252-H | Twin Buildings | https://codeforces.com/problemset/problem/1252/H | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2852
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1252-G | codeforces | 1252-G | Performance Review | https://codeforces.com/problemset/problem/1252/G | [
"data structures"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1558
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1252-F | codeforces | 1252-F | Regular Forestation | https://codeforces.com/problemset/problem/1252/F | [
"hashing",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1086
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1252-E | codeforces | 1252-E | Songwriter | https://codeforces.com/problemset/problem/1252/E | [
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1366
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1252-D | codeforces | 1252-D | Find String in a Grid | https://codeforces.com/problemset/problem/1252/D | [
"data structures",
"dp",
"strings",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 415
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1252-C | codeforces | 1252-C | Even Path | https://codeforces.com/problemset/problem/1252/C | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 3990
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1252-B | codeforces | 1252-B | Cleaning Robots | https://codeforces.com/problemset/problem/1252/B | [
"dp",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 588
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1252-A | codeforces | 1252-A | Copying Homework | https://codeforces.com/problemset/problem/1252/A | [] | null | null | stdin_stdout | 1,000 | {
"solved_count": 6036
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1251-F | codeforces | 1251-F | Red-White Fence | https://codeforces.com/problemset/problem/1251/F | [
"combinatorics",
"fft"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 988
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1251-E2 | codeforces | 1251-E2 | Voting (Hard Version) | https://codeforces.com/problemset/problem/1251/E2 | [
"binary search",
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2969
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1251-E1 | codeforces | 1251-E1 | Voting (Easy Version) | https://codeforces.com/problemset/problem/1251/E1 | [
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2596
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1251-D | codeforces | 1251-D | Salary Changing | https://codeforces.com/problemset/problem/1251/D | [
"binary search",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6484
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1251-C | codeforces | 1251-C | Minimize The Integer | https://codeforces.com/problemset/problem/1251/C | [
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 14414
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1251-B | codeforces | 1251-B | Binary Palindromes | https://codeforces.com/problemset/problem/1251/B | [
"greedy",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11640
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1251-A | codeforces | 1251-A | Broken Keyboard | https://codeforces.com/problemset/problem/1251/A | [
"brute force",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 21622
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1250-N | codeforces | 1250-N | Wires | https://codeforces.com/problemset/problem/1250/N | [
"dfs and similar",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1766
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1250-M | codeforces | 1250-M | SmartGarden | https://codeforces.com/problemset/problem/1250/M | [
"constructive algorithms",
"divide and conquer"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 393
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1250-L | codeforces | 1250-L | Divide The Students | https://codeforces.com/problemset/problem/1250/L | [
"binary search",
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4693
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1250-K | codeforces | 1250-K | Projectors | https://codeforces.com/problemset/problem/1250/K | [
"flows",
"graphs"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 322
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1250-J | codeforces | 1250-J | The Parade | https://codeforces.com/problemset/problem/1250/J | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3246
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1250-I | codeforces | 1250-I | Show Must Go On | https://codeforces.com/problemset/problem/1250/I | [
"binary search",
"brute force",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 177
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1250-H | codeforces | 1250-H | Happy Birthday | https://codeforces.com/problemset/problem/1250/H | [
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4302
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1250-G | codeforces | 1250-G | Discarding Game | https://codeforces.com/problemset/problem/1250/G | [
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 779
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1250-F | codeforces | 1250-F | Data Center | https://codeforces.com/problemset/problem/1250/F | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 8404
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1250-E | codeforces | 1250-E | The Coronation | https://codeforces.com/problemset/problem/1250/E | [
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 913
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1250-D | codeforces | 1250-D | Conference Problem | https://codeforces.com/problemset/problem/1250/D | [
"dp"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 216
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1250-C | codeforces | 1250-C | Trip to Saint Petersburg | https://codeforces.com/problemset/problem/1250/C | [
"data structures"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1448
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1250-B | codeforces | 1250-B | The Feast and the Bus | https://codeforces.com/problemset/problem/1250/B | [
"brute force",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2799
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1250-A | codeforces | 1250-A | Berstagram | https://codeforces.com/problemset/problem/1250/A | [
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 4423
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1249-F | codeforces | 1249-F | Maximum Weight Subset | https://codeforces.com/problemset/problem/1249/F | [
"dp",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2757
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1249-E | codeforces | 1249-E | By Elevator or Stairs? | https://codeforces.com/problemset/problem/1249/E | [
"dp",
"shortest paths"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11100
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1249-D2 | codeforces | 1249-D2 | Too Many Segments (hard version) | https://codeforces.com/problemset/problem/1249/D2 | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5794
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1249-D1 | codeforces | 1249-D1 | Too Many Segments (easy version) | https://codeforces.com/problemset/problem/1249/D1 | [
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5520
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1249-C2 | codeforces | 1249-C2 | Good Numbers (hard version) | https://codeforces.com/problemset/problem/1249/C2 | [
"binary search",
"greedy",
"math",
"meet-in-the-middle"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13554
} | 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.