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: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": 8038
} | 2026-11-02T05:37:07.883505+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": 10333
} | 2026-11-02T05:37:07.883505+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": 325
} | 2026-11-02T05:37:07.883505+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": 2599
} | 2026-11-02T05:37:07.883505+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": 1628
} | 2026-11-02T05:37:07.883505+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": 2645
} | 2026-11-02T05:37:07.883505+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": 901
} | 2026-11-02T05:37:07.883505+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": 592
} | 2026-11-02T05:37:07.883505+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": 1184
} | 2026-11-02T05:37:07.883505+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": 9028
} | 2026-11-02T05:37:07.883505+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": 9916
} | 2026-11-02T05:37:07.883505+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": 15050
} | 2026-11-02T05:37:07.883505+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": 15823
} | 2026-11-02T05:37:07.883505+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": 1398
} | 2026-11-02T05:37:07.883505+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": 394
} | 2026-11-02T05:37:07.883505+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": 1324
} | 2026-11-02T05:37:07.883505+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": 3233
} | 2026-11-02T05:37:07.883505+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": 21321
} | 2026-11-02T05:37:07.883505+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": 20381
} | 2026-11-02T05:37:07.883505+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": 11000
} | 2026-11-02T05:37:07.883505+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": 11922
} | 2026-11-02T05:37:07.883505+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": 497
} | 2026-11-02T05:37:07.883505+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": 1926
} | 2026-11-02T05:37:07.883505+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": 1814
} | 2026-11-02T05:37:07.883505+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": 10911
} | 2026-11-02T05:37:07.883505+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": 15039
} | 2026-11-02T05:37:07.883505+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": 6030
} | 2026-11-02T05:37:07.883505+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": 10729
} | 2026-11-02T05:37:07.883505+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": 833
} | 2026-11-02T05:37:07.883505+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": 627
} | 2026-11-02T05:37:07.883505+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": 1168
} | 2026-11-02T05:37:07.883505+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": 2362
} | 2026-11-02T05:37:07.883505+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": 10391
} | 2026-11-02T05:37:07.883505+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": 672
} | 2026-11-02T05:37:07.883505+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": 523
} | 2026-11-02T05:37:07.883505+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": 892
} | 2026-11-02T05:37:07.883505+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": 2702
} | 2026-11-02T05:37:07.883505+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": 6476
} | 2026-11-02T05:37:07.883505+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": 12472
} | 2026-11-02T05:37:07.883505+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": 16844
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1032-G | codeforces | 1032-G | Chattering | https://codeforces.com/problemset/problem/1032/G | [] | null | null | stdin_stdout | 2,900 | {
"solved_count": 565
} | 2026-11-02T05:37:07.883505+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": 1212
} | 2026-11-02T05:37:07.883505+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": 1936
} | 2026-11-02T05:37:07.883505+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": 3010
} | 2026-11-02T05:37:07.883505+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": 4421
} | 2026-11-02T05:37:07.883505+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": 5211
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1032-A | codeforces | 1032-A | Kitchen Utensils | https://codeforces.com/problemset/problem/1032/A | [] | null | null | stdin_stdout | 900 | {
"solved_count": 7480
} | 2026-11-02T05:37:07.883505+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": 330
} | 2026-11-02T05:37:07.883505+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": 667
} | 2026-11-02T05:37:07.883505+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": 3031
} | 2026-11-02T05:37:07.883505+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": 5640
} | 2026-11-02T05:37:07.883505+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": 4140
} | 2026-11-02T05:37:07.883505+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": 13508
} | 2026-11-02T05:37:07.883505+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": 496
} | 2026-11-02T05:37:07.883505+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": 974
} | 2026-11-02T05:37:07.883505+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": 3424
} | 2026-11-02T05:37:07.883505+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": 6348
} | 2026-11-02T05:37:07.883505+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": 10056
} | 2026-11-02T05:37:07.883505+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": 13458
} | 2026-11-02T05:37:07.883505+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": 183991
} | 2026-11-02T05:37:07.883505+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": 2920
} | 2026-11-02T05:37:07.883505+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": 3599
} | 2026-11-02T05:37:07.883505+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": 4359
} | 2026-11-02T05:37:07.883505+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": 8623
} | 2026-11-02T05:37:07.883505+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": 18868
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1029-A | codeforces | 1029-A | Many Equal Substrings | https://codeforces.com/problemset/problem/1029/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13820
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1028-H | codeforces | 1028-H | Make Square | https://codeforces.com/problemset/problem/1028/H | [
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 637
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1028-G | codeforces | 1028-G | Guess the number | https://codeforces.com/problemset/problem/1028/G | [
"dp",
"interactive"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 750
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1028-F | codeforces | 1028-F | Make Symmetrical | https://codeforces.com/problemset/problem/1028/F | [
"brute force"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 677
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1028-E | codeforces | 1028-E | Restore Array | https://codeforces.com/problemset/problem/1028/E | [
"constructive algorithms"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1238
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1028-D | codeforces | 1028-D | Order book | https://codeforces.com/problemset/problem/1028/D | [
"combinatorics",
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1853
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1028-C | codeforces | 1028-C | Rectangles | https://codeforces.com/problemset/problem/1028/C | [
"geometry",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5203
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1028-B | codeforces | 1028-B | Unnatural Conditions | https://codeforces.com/problemset/problem/1028/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 10547
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1028-A | codeforces | 1028-A | Find Square | https://codeforces.com/problemset/problem/1028/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 11701
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1027-G | codeforces | 1027-G | X-mouse in the Campus | https://codeforces.com/problemset/problem/1027/G | [
"bitmasks",
"math",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 390
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1027-F | codeforces | 1027-F | Session in BSU | https://codeforces.com/problemset/problem/1027/F | [
"binary search",
"dfs and similar",
"dsu",
"graph matchings",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2096
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1027-E | codeforces | 1027-E | Inverse Coloring | https://codeforces.com/problemset/problem/1027/E | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2462
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1027-D | codeforces | 1027-D | Mouse Hunt | https://codeforces.com/problemset/problem/1027/D | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8802
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1027-C | codeforces | 1027-C | Minimum Value Rectangle | https://codeforces.com/problemset/problem/1027/C | [
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7218
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1027-B | codeforces | 1027-B | Numbers on the Chessboard | https://codeforces.com/problemset/problem/1027/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8848
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1027-A | codeforces | 1027-A | Palindromic Twist | https://codeforces.com/problemset/problem/1027/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 19442
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1025-G | codeforces | 1025-G | Company Acquisitions | https://codeforces.com/problemset/problem/1025/G | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 1064
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1025-F | codeforces | 1025-F | Disjoint Triangles | https://codeforces.com/problemset/problem/1025/F | [
"geometry"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 966
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1025-E | codeforces | 1025-E | Colored Cubes | https://codeforces.com/problemset/problem/1025/E | [
"constructive algorithms",
"implementation",
"matrices"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 634
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1025-D | codeforces | 1025-D | Recovering BST | https://codeforces.com/problemset/problem/1025/D | [
"brute force",
"dp",
"math",
"number theory",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4413
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1025-C | codeforces | 1025-C | Plasticine zebra | https://codeforces.com/problemset/problem/1025/C | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6594
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1025-B | codeforces | 1025-B | Weakened Common Divisor | https://codeforces.com/problemset/problem/1025/B | [
"brute force",
"greedy",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8893
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1025-A | codeforces | 1025-A | Doggo Recoloring | https://codeforces.com/problemset/problem/1025/A | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 16838
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1023-G | codeforces | 1023-G | Pisces | https://codeforces.com/problemset/problem/1023/G | [
"data structures",
"flows",
"trees"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 199
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1023-F | codeforces | 1023-F | Mobile Phone Network | https://codeforces.com/problemset/problem/1023/F | [
"dfs and similar",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1087
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1023-E | codeforces | 1023-E | Down or Right | https://codeforces.com/problemset/problem/1023/E | [
"constructive algorithms",
"interactive",
"matrices"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2289
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1023-D | codeforces | 1023-D | Array Restoration | https://codeforces.com/problemset/problem/1023/D | [
"constructive algorithms",
"data structures"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4368
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1023-C | codeforces | 1023-C | Bracket Subsequence | https://codeforces.com/problemset/problem/1023/C | [
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 11148
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1023-B | codeforces | 1023-B | Pair of Toys | https://codeforces.com/problemset/problem/1023/B | [
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 11903
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1023-A | codeforces | 1023-A | Single Wildcard Pattern Matching | https://codeforces.com/problemset/problem/1023/A | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 9435
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1020-B | codeforces | 1020-B | Badge | https://codeforces.com/problemset/problem/1020/B | [
"brute force",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 26818
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1020-A | codeforces | 1020-A | New Building for SIS | https://codeforces.com/problemset/problem/1020/A | [
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 9533
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1019-E | codeforces | 1019-E | Raining season | https://codeforces.com/problemset/problem/1019/E | [
"data structures",
"divide and conquer",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 546
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1019-D | codeforces | 1019-D | Large Triangle | https://codeforces.com/problemset/problem/1019/D | [
"binary search",
"geometry",
"sortings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 780
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1019-C | codeforces | 1019-C | Sergey's problem | https://codeforces.com/problemset/problem/1019/C | [
"constructive algorithms",
"graphs"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 1638
} | 2026-11-02T05:37:07.883505+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.