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:1085-D | codeforces | 1085-D | Minimum Diameter Tree | https://codeforces.com/problemset/problem/1085/D | [
"constructive algorithms",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6017
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1085-C | codeforces | 1085-C | Connect Three | https://codeforces.com/problemset/problem/1085/C | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5715
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1085-B | codeforces | 1085-B | Div Times Mod | https://codeforces.com/problemset/problem/1085/B | [
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 10384
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1085-A | codeforces | 1085-A | Right-Left Cipher | https://codeforces.com/problemset/problem/1085/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 12795
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1084-C | codeforces | 1084-C | The Fair Nut and String | https://codeforces.com/problemset/problem/1084/C | [
"combinatorics",
"dp",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12995
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1084-B | codeforces | 1084-B | Kvass and the Fair Nut | https://codeforces.com/problemset/problem/1084/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8366
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1084-A | codeforces | 1084-A | The Fair Nut and Elevator | https://codeforces.com/problemset/problem/1084/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 8370
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1083-F | codeforces | 1083-F | The Fair Nut and Amusing Xor | https://codeforces.com/problemset/problem/1083/F | [
"data structures"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 493
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1083-E | codeforces | 1083-E | The Fair Nut and Rectangles | https://codeforces.com/problemset/problem/1083/E | [
"data structures",
"dp",
"geometry"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 6178
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1083-D | codeforces | 1083-D | The Fair Nut's getting crazy | https://codeforces.com/problemset/problem/1083/D | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 649
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1083-C | codeforces | 1083-C | Max Mex | https://codeforces.com/problemset/problem/1083/C | [
"data structures",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1218
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1083-B | codeforces | 1083-B | The Fair Nut and Strings | https://codeforces.com/problemset/problem/1083/B | [
"greedy",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2316
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1083-A | codeforces | 1083-A | The Fair Nut and the Best Path | https://codeforces.com/problemset/problem/1083/A | [
"data structures",
"dp",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6580
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1082-G | codeforces | 1082-G | Petya and Graph | https://codeforces.com/problemset/problem/1082/G | [
"flows",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2958
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1082-F | codeforces | 1082-F | Speed Dial | https://codeforces.com/problemset/problem/1082/F | [
"dp",
"strings",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 645
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1082-E | codeforces | 1082-E | Increasing Frequency | https://codeforces.com/problemset/problem/1082/E | [
"binary search",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 7055
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1082-D | codeforces | 1082-D | Maximum Diameter Graph | https://codeforces.com/problemset/problem/1082/D | [
"constructive algorithms",
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4215
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1082-C | codeforces | 1082-C | Multi-Subject Competition | https://codeforces.com/problemset/problem/1082/C | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6278
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1082-B | codeforces | 1082-B | Vova and Trophies | https://codeforces.com/problemset/problem/1082/B | [
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8115
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1082-A | codeforces | 1082-A | Vasya and Book | https://codeforces.com/problemset/problem/1082/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 9511
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1081-H | codeforces | 1081-H | Palindromic Magic | https://codeforces.com/problemset/problem/1081/H | [
"data structures",
"hashing",
"strings"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 136
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1081-G | codeforces | 1081-G | Mergesort Strikes Back | https://codeforces.com/problemset/problem/1081/G | [
"math",
"probabilities"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 526
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1081-F | codeforces | 1081-F | Tricky Interactor | https://codeforces.com/problemset/problem/1081/F | [
"constructive algorithms",
"implementation",
"interactive"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 578
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1081-E | codeforces | 1081-E | Missing Numbers | https://codeforces.com/problemset/problem/1081/E | [
"binary search",
"constructive algorithms",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2864
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1081-D | codeforces | 1081-D | Maximum Distance | https://codeforces.com/problemset/problem/1081/D | [
"dsu",
"graphs",
"shortest paths",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4919
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1081-C | codeforces | 1081-C | Colorful Bricks | https://codeforces.com/problemset/problem/1081/C | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 8885
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1081-B | codeforces | 1081-B | Farewell Party | https://codeforces.com/problemset/problem/1081/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4726
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1081-A | codeforces | 1081-A | Definite Game | https://codeforces.com/problemset/problem/1081/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 13400
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1080-F | codeforces | 1080-F | Katya and Segments Sets | https://codeforces.com/problemset/problem/1080/F | [
"data structures",
"interactive",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1032
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1080-E | codeforces | 1080-E | Sonya and Matrix Beauty | https://codeforces.com/problemset/problem/1080/E | [
"strings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1401
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1080-D | codeforces | 1080-D | Olya and magical square | https://codeforces.com/problemset/problem/1080/D | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1703
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1080-C | codeforces | 1080-C | Masha and two friends | https://codeforces.com/problemset/problem/1080/C | [
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4261
} | 2026-11-02T05:37:07.883505+00:00 |
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": 12812
} | 2026-11-02T05:37:07.883505+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": 19361
} | 2026-11-02T05:37:07.883505+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": 110
} | 2026-11-02T05:37:07.883505+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": 4648
} | 2026-11-02T05:37:07.883505+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": 5727
} | 2026-11-02T05:37:07.883505+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": 5217
} | 2026-11-02T05:37:07.883505+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": 10805
} | 2026-11-02T05:37:07.883505+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": 28344
} | 2026-11-02T05:37:07.883505+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": 20796
} | 2026-11-02T05:37:07.883505+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": 32863
} | 2026-11-02T05:37:07.883505+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": 813
} | 2026-11-02T05:37:07.883505+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": 780
} | 2026-11-02T05:37:07.883505+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": 4328
} | 2026-11-02T05:37:07.883505+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": 6351
} | 2026-11-02T05:37:07.883505+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": 13675
} | 2026-11-02T05:37:07.883505+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": 15058
} | 2026-11-02T05:37:07.883505+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": 14466
} | 2026-11-02T05:37:07.883505+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": 4632
} | 2026-11-02T05:37:07.883505+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": 9226
} | 2026-11-02T05:37:07.883505+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": 1194
} | 2026-11-02T05:37:07.883505+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": 679
} | 2026-11-02T05:37:07.883505+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": 4004
} | 2026-11-02T05:37:07.883505+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": 6803
} | 2026-11-02T05:37:07.883505+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": 5628
} | 2026-11-02T05:37:07.883505+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": 11350
} | 2026-11-02T05:37:07.883505+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": 17458
} | 2026-11-02T05:37:07.883505+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-11-02T05:37:07.883505+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": 94
} | 2026-11-02T05:37:07.883505+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": 441
} | 2026-11-02T05:37:07.883505+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": 5471
} | 2026-11-02T05:37:07.883505+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": 831
} | 2026-11-02T05:37:07.883505+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": 815
} | 2026-11-02T05:37:07.883505+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": 3893
} | 2026-11-02T05:37:07.883505+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": 966
} | 2026-11-02T05:37:07.883505+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": 3890
} | 2026-11-02T05:37:07.883505+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": 1510
} | 2026-11-02T05:37:07.883505+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": 5285
} | 2026-11-02T05:37:07.883505+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": 2390
} | 2026-11-02T05:37:07.883505+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": 733
} | 2026-11-02T05:37:07.883505+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": 2714
} | 2026-11-02T05:37:07.883505+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": 3390
} | 2026-11-02T05:37:07.883505+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": 13454
} | 2026-11-02T05:37:07.883505+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": 7375
} | 2026-11-02T05:37:07.883505+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": 654
} | 2026-11-02T05:37:07.883505+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": 764
} | 2026-11-02T05:37:07.883505+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": 730
} | 2026-11-02T05:37:07.883505+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": 2926
} | 2026-11-02T05:37:07.883505+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": 3244
} | 2026-11-02T05:37:07.883505+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": 2353
} | 2026-11-02T05:37:07.883505+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": 6679
} | 2026-11-02T05:37:07.883505+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": 6091
} | 2026-11-02T05:37:07.883505+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": 10498
} | 2026-11-02T05:37:07.883505+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": 9552
} | 2026-11-02T05:37:07.883505+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": 15731
} | 2026-11-02T05:37:07.883505+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": 598
} | 2026-11-02T05:37:07.883505+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": 1423
} | 2026-11-02T05:37:07.883505+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": 1460
} | 2026-11-02T05:37:07.883505+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": 1477
} | 2026-11-02T05:37:07.883505+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": 8392
} | 2026-11-02T05:37:07.883505+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": 11791
} | 2026-11-02T05:37:07.883505+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": 15393
} | 2026-11-02T05:37:07.883505+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": 8087
} | 2026-11-02T05:37:07.883505+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": 26203
} | 2026-11-02T05:37:07.883505+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": 1198
} | 2026-11-02T05:37:07.883505+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": 481
} | 2026-11-02T05:37:07.883505+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": 571
} | 2026-11-02T05:37:07.883505+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": 3408
} | 2026-11-02T05:37:07.883505+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": 10138
} | 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.