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:1045-J | codeforces | 1045-J | Moonwalk challenge | https://codeforces.com/problemset/problem/1045/J | [
"data structures",
"strings",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 210
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1045-I | codeforces | 1045-I | Palindrome Pairs | https://codeforces.com/problemset/problem/1045/I | [
"hashing",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5495
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1045-H | codeforces | 1045-H | Self-exploration | https://codeforces.com/problemset/problem/1045/H | [
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 441
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1045-G | codeforces | 1045-G | AI robots | https://codeforces.com/problemset/problem/1045/G | [
"data structures"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2000
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1045-F | codeforces | 1045-F | Shady Lady | https://codeforces.com/problemset/problem/1045/F | [
"geometry",
"math"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 114
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1045-E | codeforces | 1045-E | Ancient civilizations | https://codeforces.com/problemset/problem/1045/E | [
"constructive algorithms",
"geometry"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 251
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1045-D | codeforces | 1045-D | Interstellar battle | https://codeforces.com/problemset/problem/1045/D | [
"math",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 868
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1045-C | codeforces | 1045-C | Hyperspace Highways | https://codeforces.com/problemset/problem/1045/C | [
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 830
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1045-B | codeforces | 1045-B | Space Isaac | https://codeforces.com/problemset/problem/1045/B | [
"hashing",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 597
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1045-A | codeforces | 1045-A | Last chance | https://codeforces.com/problemset/problem/1045/A | [
"data structures",
"flows",
"graph matchings",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 575
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1044-F | codeforces | 1044-F | DFS | https://codeforces.com/problemset/problem/1044/F | [
"data structures"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 684
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1044-E | codeforces | 1044-E | Grid Sort | https://codeforces.com/problemset/problem/1044/E | [
"implementation"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 129
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1044-D | codeforces | 1044-D | Deduction Queries | https://codeforces.com/problemset/problem/1044/D | [
"data structures",
"dsu"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1195
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1044-C | codeforces | 1044-C | Optimal Polygon Perimeter | https://codeforces.com/problemset/problem/1044/C | [
"dp",
"geometry"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1410
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1044-B | codeforces | 1044-B | Intersecting Subtrees | https://codeforces.com/problemset/problem/1044/B | [
"dfs and similar",
"interactive",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1713
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1044-A | codeforces | 1044-A | The Tower is Going Home | https://codeforces.com/problemset/problem/1044/A | [
"binary search",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3081
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1043-G | codeforces | 1043-G | Speckled Band | https://codeforces.com/problemset/problem/1043/G | [
"data structures",
"divide and conquer",
"hashing",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 325
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1043-F | codeforces | 1043-F | Make It One | https://codeforces.com/problemset/problem/1043/F | [
"bitmasks",
"combinatorics",
"dp",
"math",
"number theory",
"shortest paths"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 3018
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1043-E | codeforces | 1043-E | Train Hard, Win Easy | https://codeforces.com/problemset/problem/1043/E | [
"constructive algorithms",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3464
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1043-D | codeforces | 1043-D | Mysterious Crime | https://codeforces.com/problemset/problem/1043/D | [
"brute force",
"combinatorics",
"math",
"meet-in-the-middle",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4772
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1043-C | codeforces | 1043-C | Smallest Word | https://codeforces.com/problemset/problem/1043/C | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 7234
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1043-B | codeforces | 1043-B | Lost Array | https://codeforces.com/problemset/problem/1043/B | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 6557
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1043-A | codeforces | 1043-A | Elections | https://codeforces.com/problemset/problem/1043/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 11292
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1042-F | codeforces | 1042-F | Leaf Sets | https://codeforces.com/problemset/problem/1042/F | [
"data structures",
"dfs and similar",
"dsu",
"graphs",
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1492
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1042-E | codeforces | 1042-E | Vasya and Magic Matrix | https://codeforces.com/problemset/problem/1042/E | [
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2087
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1042-D | codeforces | 1042-D | Petya and Array | https://codeforces.com/problemset/problem/1042/D | [
"data structures",
"divide and conquer",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7454
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1042-C | codeforces | 1042-C | Array Product | https://codeforces.com/problemset/problem/1042/C | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4976
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1042-B | codeforces | 1042-B | Vitamins | https://codeforces.com/problemset/problem/1042/B | [
"bitmasks",
"brute force",
"dp",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 19247
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1042-A | codeforces | 1042-A | Benches | https://codeforces.com/problemset/problem/1042/A | [
"binary search",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 14114
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1041-F | codeforces | 1041-F | Ray in the tube | https://codeforces.com/problemset/problem/1041/F | [
"data structures",
"divide and conquer",
"dp",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1618
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1041-E | codeforces | 1041-E | Tree Reconstruction | https://codeforces.com/problemset/problem/1041/E | [
"constructive algorithms",
"data structures",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3862
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1041-D | codeforces | 1041-D | Glider | https://codeforces.com/problemset/problem/1041/D | [
"binary search",
"data structures",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6439
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1041-C | codeforces | 1041-C | Coffee Break | https://codeforces.com/problemset/problem/1041/C | [
"binary search",
"data structures",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10264
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1041-B | codeforces | 1041-B | Buying a TV Set | https://codeforces.com/problemset/problem/1041/B | [
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 15071
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1041-A | codeforces | 1041-A | Heist | https://codeforces.com/problemset/problem/1041/A | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26889
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1040-B | codeforces | 1040-B | Shashlik Cooking | https://codeforces.com/problemset/problem/1040/B | [
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 7496
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1040-A | codeforces | 1040-A | Palindrome Dance | https://codeforces.com/problemset/problem/1040/A | [
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 10222
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1039-E | codeforces | 1039-E | Summer Oenothera Exhibition | https://codeforces.com/problemset/problem/1039/E | [
"data structures"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 319
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1039-D | codeforces | 1039-D | You Are Given a Tree | https://codeforces.com/problemset/problem/1039/D | [
"data structures",
"dp",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 2330
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1039-C | codeforces | 1039-C | Network Safety | https://codeforces.com/problemset/problem/1039/C | [
"dfs and similar",
"dsu",
"graphs",
"math",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1495
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1039-B | codeforces | 1039-B | Subway Pursuit | https://codeforces.com/problemset/problem/1039/B | [
"binary search",
"interactive",
"probabilities"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2599
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1039-A | codeforces | 1039-A | Timetable | https://codeforces.com/problemset/problem/1039/A | [
"constructive algorithms",
"data structures",
"greedy",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 871
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1038-F | codeforces | 1038-F | Wrap Around | https://codeforces.com/problemset/problem/1038/F | [
"dp",
"strings"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 479
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1038-E | codeforces | 1038-E | Maximum Matching | https://codeforces.com/problemset/problem/1038/E | [
"bitmasks",
"brute force",
"dfs and similar",
"dp",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1099
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1038-D | codeforces | 1038-D | Slime | https://codeforces.com/problemset/problem/1038/D | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8880
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1038-C | codeforces | 1038-C | Gambling | https://codeforces.com/problemset/problem/1038/C | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9837
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1038-B | codeforces | 1038-B | Non-Coprime Partition | https://codeforces.com/problemset/problem/1038/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 14754
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1038-A | codeforces | 1038-A | Equality | https://codeforces.com/problemset/problem/1038/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 15664
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1037-H | codeforces | 1037-H | Security | https://codeforces.com/problemset/problem/1037/H | [
"data structures",
"string suffix structures"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 1214
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1037-G | codeforces | 1037-G | A Game on Strings | https://codeforces.com/problemset/problem/1037/G | [
"games"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 373
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1037-F | codeforces | 1037-F | Maximum Reduction | https://codeforces.com/problemset/problem/1037/F | [
"combinatorics",
"data structures",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1273
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1037-E | codeforces | 1037-E | Trips | https://codeforces.com/problemset/problem/1037/E | [
"graphs"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3134
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1037-D | codeforces | 1037-D | Valid BFS? | https://codeforces.com/problemset/problem/1037/D | [
"dfs and similar",
"graphs",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 19311
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1037-C | codeforces | 1037-C | Equalize | https://codeforces.com/problemset/problem/1037/C | [
"dp",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 20133
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1037-B | codeforces | 1037-B | Reach Median | https://codeforces.com/problemset/problem/1037/B | [
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 10888
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1037-A | codeforces | 1037-A | Packets | https://codeforces.com/problemset/problem/1037/A | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 11843
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1036-G | codeforces | 1036-G | Sources and Sinks | https://codeforces.com/problemset/problem/1036/G | [
"bitmasks",
"brute force",
"dfs and similar"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 431
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1036-F | codeforces | 1036-F | Relatively Prime Powers | https://codeforces.com/problemset/problem/1036/F | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1863
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1036-E | codeforces | 1036-E | Covered Points | https://codeforces.com/problemset/problem/1036/E | [
"fft",
"geometry",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1772
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1036-D | codeforces | 1036-D | Vasya and Arrays | https://codeforces.com/problemset/problem/1036/D | [
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10715
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1036-C | codeforces | 1036-C | Classy Numbers | https://codeforces.com/problemset/problem/1036/C | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 13552
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1036-B | codeforces | 1036-B | Diagonal Walking v.2 | https://codeforces.com/problemset/problem/1036/B | [
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5989
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1036-A | codeforces | 1036-A | Function Height | https://codeforces.com/problemset/problem/1036/A | [
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 10631
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1034-E | codeforces | 1034-E | Little C Loves 3 III | https://codeforces.com/problemset/problem/1034/E | [
"bitmasks",
"dp",
"math"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 755
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1034-D | codeforces | 1034-D | Intervals of Intervals | https://codeforces.com/problemset/problem/1034/D | [
"binary search",
"data structures",
"two pointers"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 589
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1034-C | codeforces | 1034-C | Region Separation | https://codeforces.com/problemset/problem/1034/C | [
"combinatorics",
"dp",
"number theory",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 999
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1034-B | codeforces | 1034-B | Little C Loves 3 II | https://codeforces.com/problemset/problem/1034/B | [
"brute force",
"constructive algorithms",
"flows",
"graph matchings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2293
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1034-A | codeforces | 1034-A | Enlarge GCD | https://codeforces.com/problemset/problem/1034/A | [
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9978
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1033-G | codeforces | 1033-G | Chip Game | https://codeforces.com/problemset/problem/1033/G | [
"games"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 508
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1033-F | codeforces | 1033-F | Boolean Computer | https://codeforces.com/problemset/problem/1033/F | [
"bitmasks",
"brute force",
"fft",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 466
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1033-E | codeforces | 1033-E | Hidden Bipartite Graph | https://codeforces.com/problemset/problem/1033/E | [
"binary search",
"constructive algorithms",
"dfs and similar",
"graphs",
"interactive"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 795
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1033-D | codeforces | 1033-D | Divisors | https://codeforces.com/problemset/problem/1033/D | [
"interactive",
"math",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2625
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1033-C | codeforces | 1033-C | Permutation Game | https://codeforces.com/problemset/problem/1033/C | [
"brute force",
"dp",
"games"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6235
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1033-B | codeforces | 1033-B | Square Difference | https://codeforces.com/problemset/problem/1033/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 12011
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1033-A | codeforces | 1033-A | King Escape | https://codeforces.com/problemset/problem/1033/A | [
"dfs and similar",
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 16169
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1032-G | codeforces | 1032-G | Chattering | https://codeforces.com/problemset/problem/1032/G | [] | null | null | stdin_stdout | 2,900 | {
"solved_count": 511
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1032-F | codeforces | 1032-F | Vasya and Maximum Matching | https://codeforces.com/problemset/problem/1032/F | [
"dp",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1148
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1032-E | codeforces | 1032-E | The Unbearable Lightness of Weights | https://codeforces.com/problemset/problem/1032/E | [
"dp",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1870
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1032-D | codeforces | 1032-D | Barcelonian Distance | https://codeforces.com/problemset/problem/1032/D | [
"geometry",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2981
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1032-C | codeforces | 1032-C | Playing Piano | https://codeforces.com/problemset/problem/1032/C | [
"constructive algorithms",
"dp"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4348
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1032-B | codeforces | 1032-B | Personalized Cup | https://codeforces.com/problemset/problem/1032/B | [] | null | null | stdin_stdout | 1,200 | {
"solved_count": 5151
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1032-A | codeforces | 1032-A | Kitchen Utensils | https://codeforces.com/problemset/problem/1032/A | [] | null | null | stdin_stdout | 900 | {
"solved_count": 7356
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1031-F | codeforces | 1031-F | Familiar Operations | https://codeforces.com/problemset/problem/1031/F | [
"brute force",
"graphs",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 311
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1031-E | codeforces | 1031-E | Triple Flips | https://codeforces.com/problemset/problem/1031/E | [
"constructive algorithms"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 575
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1031-D | codeforces | 1031-D | Minimum path | https://codeforces.com/problemset/problem/1031/D | [
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2995
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1031-C | codeforces | 1031-C | Cram Time | https://codeforces.com/problemset/problem/1031/C | [
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5612
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1031-B | codeforces | 1031-B | Curiosity Has No Limits | https://codeforces.com/problemset/problem/1031/B | [] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4072
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1031-A | codeforces | 1031-A | Golden Plate | https://codeforces.com/problemset/problem/1031/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 13414
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1030-G | codeforces | 1030-G | Linear Congruential Generator | https://codeforces.com/problemset/problem/1030/G | [
"number theory"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 398
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1030-F | codeforces | 1030-F | Putting Boxes Together | https://codeforces.com/problemset/problem/1030/F | [
"data structures"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 908
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1030-E | codeforces | 1030-E | Vasya and Good Sequences | https://codeforces.com/problemset/problem/1030/E | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3361
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1030-D | codeforces | 1030-D | Vasya and Triangle | https://codeforces.com/problemset/problem/1030/D | [
"geometry",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6262
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1030-C | codeforces | 1030-C | Vasya and Golden Ticket | https://codeforces.com/problemset/problem/1030/C | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9942
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1030-B | codeforces | 1030-B | Vasya and Cornfield | https://codeforces.com/problemset/problem/1030/B | [
"geometry"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 13289
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1030-A | codeforces | 1030-A | In Search of an Easy Problem | https://codeforces.com/problemset/problem/1030/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 172964
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1029-F | codeforces | 1029-F | Multicolored Markers | https://codeforces.com/problemset/problem/1029/F | [
"binary search",
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2771
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1029-E | codeforces | 1029-E | Tree with Small Distances | https://codeforces.com/problemset/problem/1029/E | [
"dp",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3439
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1029-D | codeforces | 1029-D | Concatenated Multiples | https://codeforces.com/problemset/problem/1029/D | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4250
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1029-C | codeforces | 1029-C | Maximal Intersection | https://codeforces.com/problemset/problem/1029/C | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8309
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1029-B | codeforces | 1029-B | Creating the Contest | https://codeforces.com/problemset/problem/1029/B | [
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 18520
} | 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.