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:1080-B | codeforces | 1080-B | Margarite and the best present | https://codeforces.com/problemset/problem/1080/B | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 12748
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1080-A | codeforces | 1080-A | Petya and Origami | https://codeforces.com/problemset/problem/1080/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19251
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1078-E | codeforces | 1078-E | Negative Time Summation | https://codeforces.com/problemset/problem/1078/E | [
"constructive algorithms"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 107
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1077-F2 | codeforces | 1077-F2 | Pictures with Kittens (hard version) | https://codeforces.com/problemset/problem/1077/F2 | [
"data structures",
"dp"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4467
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1077-F1 | codeforces | 1077-F1 | Pictures with Kittens (easy version) | https://codeforces.com/problemset/problem/1077/F1 | [
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5549
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1077-E | codeforces | 1077-E | Thematic Contests | https://codeforces.com/problemset/problem/1077/E | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5160
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1077-D | codeforces | 1077-D | Cutting Out | https://codeforces.com/problemset/problem/1077/D | [
"binary search",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10670
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1077-C | codeforces | 1077-C | Good Array | https://codeforces.com/problemset/problem/1077/C | [] | null | null | stdin_stdout | 1,300 | {
"solved_count": 27345
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1077-B | codeforces | 1077-B | Disturbed People | https://codeforces.com/problemset/problem/1077/B | [
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 20659
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1077-A | codeforces | 1077-A | Frog Jumping | https://codeforces.com/problemset/problem/1077/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 32655
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1076-G | codeforces | 1076-G | Array Game | https://codeforces.com/problemset/problem/1076/G | [
"data structures",
"games"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 807
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1076-F | codeforces | 1076-F | Summer Practice Report | https://codeforces.com/problemset/problem/1076/F | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 775
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1076-E | codeforces | 1076-E | Vasya and a Tree | https://codeforces.com/problemset/problem/1076/E | [
"data structures",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4226
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1076-D | codeforces | 1076-D | Edge Deletion | https://codeforces.com/problemset/problem/1076/D | [
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6206
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1076-C | codeforces | 1076-C | Meme Problem | https://codeforces.com/problemset/problem/1076/C | [
"binary search",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13579
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1076-B | codeforces | 1076-B | Divisor Subtraction | https://codeforces.com/problemset/problem/1076/B | [
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 14858
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1076-A | codeforces | 1076-A | Minimizing the String | https://codeforces.com/problemset/problem/1076/A | [
"greedy",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 14327
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1075-B | codeforces | 1075-B | Taxi drivers and Lyft | https://codeforces.com/problemset/problem/1075/B | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 4612
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1075-A | codeforces | 1075-A | The King's Race | https://codeforces.com/problemset/problem/1075/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 9189
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1073-G | codeforces | 1073-G | Yet Another LCP Problem | https://codeforces.com/problemset/problem/1073/G | [
"data structures",
"string suffix structures"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1172
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1073-F | codeforces | 1073-F | Choosing Two Paths | https://codeforces.com/problemset/problem/1073/F | [
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 671
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1073-E | codeforces | 1073-E | Segment Sum | https://codeforces.com/problemset/problem/1073/E | [
"bitmasks",
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3840
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1073-D | codeforces | 1073-D | Berland Fair | https://codeforces.com/problemset/problem/1073/D | [
"binary search",
"brute force",
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6766
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1073-C | codeforces | 1073-C | Vasya and Robot | https://codeforces.com/problemset/problem/1073/C | [
"binary search",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5577
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1073-B | codeforces | 1073-B | Vasya and Books | https://codeforces.com/problemset/problem/1073/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 11300
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1073-A | codeforces | 1073-A | Diverse Substring | https://codeforces.com/problemset/problem/1073/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 17296
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1071-E | codeforces | 1071-E | Rain Protection | https://codeforces.com/problemset/problem/1071/E | [
"binary search",
"geometry"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 388
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1070-M | codeforces | 1070-M | Algoland and Berland | https://codeforces.com/problemset/problem/1070/M | [
"constructive algorithms",
"divide and conquer",
"geometry"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 92
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1070-L | codeforces | 1070-L | Odd Federalization | https://codeforces.com/problemset/problem/1070/L | [
"constructive algorithms"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 434
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1070-K | codeforces | 1070-K | Video Posts | https://codeforces.com/problemset/problem/1070/K | [
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 5432
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1070-J | codeforces | 1070-J | Streets and Avenues in Berhattan | https://codeforces.com/problemset/problem/1070/J | [
"dp"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 818
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1070-I | codeforces | 1070-I | Privatization of Roads in Berland | https://codeforces.com/problemset/problem/1070/I | [
"flows",
"graph matchings",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 813
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1070-H | codeforces | 1070-H | BerOS File Suggestion | https://codeforces.com/problemset/problem/1070/H | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 3876
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1070-G | codeforces | 1070-G | Monsters and Potions | https://codeforces.com/problemset/problem/1070/G | [
"brute force",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 962
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1070-F | codeforces | 1070-F | Debate | https://codeforces.com/problemset/problem/1070/F | [
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 3868
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1070-E | codeforces | 1070-E | Getting Deals Done | https://codeforces.com/problemset/problem/1070/E | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1496
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1070-D | codeforces | 1070-D | Garbage Disposal | https://codeforces.com/problemset/problem/1070/D | [
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 5258
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1070-C | codeforces | 1070-C | Cloud Computing | https://codeforces.com/problemset/problem/1070/C | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2376
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1070-B | codeforces | 1070-B | Berkomnadzor | https://codeforces.com/problemset/problem/1070/B | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 731
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1070-A | codeforces | 1070-A | Find a Number | https://codeforces.com/problemset/problem/1070/A | [
"dp",
"graphs",
"number theory",
"shortest paths"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2686
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1068-C | codeforces | 1068-C | Colored Rooks | https://codeforces.com/problemset/problem/1068/C | [
"constructive algorithms",
"graphs"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3373
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1068-B | codeforces | 1068-B | LCM | https://codeforces.com/problemset/problem/1068/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 13330
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1068-A | codeforces | 1068-A | Birthday | https://codeforces.com/problemset/problem/1068/A | [
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7328
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1067-E | codeforces | 1067-E | Random Forest Rank | https://codeforces.com/problemset/problem/1067/E | [
"dp",
"graph matchings",
"math",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 637
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1067-D | codeforces | 1067-D | Computer Game | https://codeforces.com/problemset/problem/1067/D | [
"dp",
"greedy",
"math",
"probabilities"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 749
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1067-C | codeforces | 1067-C | Knights | https://codeforces.com/problemset/problem/1067/C | [
"constructive algorithms"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 721
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1067-B | codeforces | 1067-B | Multihedgehog | https://codeforces.com/problemset/problem/1067/B | [
"dfs and similar",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2891
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1067-A | codeforces | 1067-A | Array Without Local Maximums | https://codeforces.com/problemset/problem/1067/A | [
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3192
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1066-F | codeforces | 1066-F | Yet another 2D Walking | https://codeforces.com/problemset/problem/1066/F | [
"dp"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2315
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1066-E | codeforces | 1066-E | Binary Numbers AND Sum | https://codeforces.com/problemset/problem/1066/E | [
"data structures",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6629
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1066-D | codeforces | 1066-D | Boxes Packing | https://codeforces.com/problemset/problem/1066/D | [
"binary search",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6007
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1066-C | codeforces | 1066-C | Books Queries | https://codeforces.com/problemset/problem/1066/C | [
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10415
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1066-B | codeforces | 1066-B | Heaters | https://codeforces.com/problemset/problem/1066/B | [
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9482
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1066-A | codeforces | 1066-A | Vova and Train | https://codeforces.com/problemset/problem/1066/A | [
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 15634
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1065-G | codeforces | 1065-G | Fibonacci Suffix | https://codeforces.com/problemset/problem/1065/G | [
"strings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 595
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1065-F | codeforces | 1065-F | Up and Down the Tree | https://codeforces.com/problemset/problem/1065/F | [
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1411
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1065-E | codeforces | 1065-E | Side Transmutations | https://codeforces.com/problemset/problem/1065/E | [
"combinatorics",
"strings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1421
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1065-D | codeforces | 1065-D | Three Pieces | https://codeforces.com/problemset/problem/1065/D | [
"dfs and similar",
"dp",
"shortest paths"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1467
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1065-C | codeforces | 1065-C | Make It Equal | https://codeforces.com/problemset/problem/1065/C | [
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8344
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1065-B | codeforces | 1065-B | Vasya and Isolated Vertices | https://codeforces.com/problemset/problem/1065/B | [
"constructive algorithms",
"graphs"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 11711
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1065-A | codeforces | 1065-A | Vasya and Chocolate | https://codeforces.com/problemset/problem/1065/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 15334
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1064-B | codeforces | 1064-B | Equations of Mathematical Magic | https://codeforces.com/problemset/problem/1064/B | [
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8006
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1064-A | codeforces | 1064-A | Make a triangle! | https://codeforces.com/problemset/problem/1064/A | [
"brute force",
"geometry",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25588
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1063-F | codeforces | 1063-F | String Journey | https://codeforces.com/problemset/problem/1063/F | [
"data structures",
"dp",
"string suffix structures"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 1155
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1063-E | codeforces | 1063-E | Lasers and Mirrors | https://codeforces.com/problemset/problem/1063/E | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 418
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1063-D | codeforces | 1063-D | Candies for Children | https://codeforces.com/problemset/problem/1063/D | [
"brute force",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 518
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1063-C | codeforces | 1063-C | Dwarves, Hats and Extrasensory Abilities | https://codeforces.com/problemset/problem/1063/C | [
"binary search",
"constructive algorithms",
"geometry",
"interactive"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3305
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1063-B | codeforces | 1063-B | Labyrinth | https://codeforces.com/problemset/problem/1063/B | [
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9721
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1063-A | codeforces | 1063-A | Oh Those Palindromes | https://codeforces.com/problemset/problem/1063/A | [
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 11171
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1062-F | codeforces | 1062-F | Upgrading Cities | https://codeforces.com/problemset/problem/1062/F | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1060
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1062-E | codeforces | 1062-E | Company | https://codeforces.com/problemset/problem/1062/E | [
"binary search",
"data structures",
"dfs and similar",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2150
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1062-D | codeforces | 1062-D | Fun with Integers | https://codeforces.com/problemset/problem/1062/D | [
"dfs and similar",
"graphs",
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4189
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1062-C | codeforces | 1062-C | Banh-mi | https://codeforces.com/problemset/problem/1062/C | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5997
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1062-B | codeforces | 1062-B | Math | https://codeforces.com/problemset/problem/1062/B | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 10134
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1062-A | codeforces | 1062-A | A Prank | https://codeforces.com/problemset/problem/1062/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9372
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1061-F | codeforces | 1061-F | Lost Root | https://codeforces.com/problemset/problem/1061/F | [
"interactive",
"probabilities"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 974
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1061-E | codeforces | 1061-E | Politics | https://codeforces.com/problemset/problem/1061/E | [
"flows",
"graphs"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 682
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1061-D | codeforces | 1061-D | TV Shows | https://codeforces.com/problemset/problem/1061/D | [
"data structures",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2600
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1061-C | codeforces | 1061-C | Multiplicity | https://codeforces.com/problemset/problem/1061/C | [
"data structures",
"dp",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11148
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1061-B | codeforces | 1061-B | Views Matter | https://codeforces.com/problemset/problem/1061/B | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7707
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1061-A | codeforces | 1061-A | Coins | https://codeforces.com/problemset/problem/1061/A | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24475
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1060-H | codeforces | 1060-H | Sophisticated Device | https://codeforces.com/problemset/problem/1060/H | [
"constructive algorithms"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 387
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1060-G | codeforces | 1060-G | Balls and Pockets | https://codeforces.com/problemset/problem/1060/G | [
"data structures"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 266
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1060-F | codeforces | 1060-F | Shrinking Tree | https://codeforces.com/problemset/problem/1060/F | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 852
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1060-E | codeforces | 1060-E | Sergey and Subway | https://codeforces.com/problemset/problem/1060/E | [
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3574
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1060-D | codeforces | 1060-D | Social Circles | https://codeforces.com/problemset/problem/1060/D | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3906
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1060-C | codeforces | 1060-C | Maximum Subrectangle | https://codeforces.com/problemset/problem/1060/C | [
"binary search",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5239
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1060-B | codeforces | 1060-B | Maximum Sum of Digits | https://codeforces.com/problemset/problem/1060/B | [
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 9581
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1060-A | codeforces | 1060-A | Phone Numbers | https://codeforces.com/problemset/problem/1060/A | [
"brute force"
] | null | null | stdin_stdout | 800 | {
"solved_count": 15997
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1059-E | codeforces | 1059-E | Split the Tree | https://codeforces.com/problemset/problem/1059/E | [
"binary search",
"data structures",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1668
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1059-D | codeforces | 1059-D | Nature Reserve | https://codeforces.com/problemset/problem/1059/D | [
"binary search",
"geometry",
"ternary search"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3060
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1059-C | codeforces | 1059-C | Sequence Transformation | https://codeforces.com/problemset/problem/1059/C | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7604
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1059-B | codeforces | 1059-B | Forgery | https://codeforces.com/problemset/problem/1059/B | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 7636
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1059-A | codeforces | 1059-A | Cashier | https://codeforces.com/problemset/problem/1059/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 14005
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1057-C | codeforces | 1057-C | Tanya and Colored Candies | https://codeforces.com/problemset/problem/1057/C | [
"*special",
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1220
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1057-B | codeforces | 1057-B | DDoS | https://codeforces.com/problemset/problem/1057/B | [
"*special",
"brute force"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 1991
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1057-A | codeforces | 1057-A | Bmail Computer Network | https://codeforces.com/problemset/problem/1057/A | [
"*special",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 900 | {
"solved_count": 7720
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1056-H | codeforces | 1056-H | Detect Robots | https://codeforces.com/problemset/problem/1056/H | [
"data structures",
"strings"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 313
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1056-G | codeforces | 1056-G | Take Metro | https://codeforces.com/problemset/problem/1056/G | [
"brute force",
"data structures",
"graphs"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 364
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1056-F | codeforces | 1056-F | Write The Contest | https://codeforces.com/problemset/problem/1056/F | [
"binary search",
"dp",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 744
} | 2026-08-17T01:43:56.191071+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.