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:1090-L | codeforces | 1090-L | Berland University | https://codeforces.com/problemset/problem/1090/L | [
"greedy",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1421
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1090-K | codeforces | 1090-K | Right Expansion Of The Mind | https://codeforces.com/problemset/problem/1090/K | [
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1199
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1090-J | codeforces | 1090-J | Two Prefixes | https://codeforces.com/problemset/problem/1090/J | [
"strings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 604
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1090-I | codeforces | 1090-I | Minimal Product | https://codeforces.com/problemset/problem/1090/I | [] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1178
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1090-H | codeforces | 1090-H | Linearization | https://codeforces.com/problemset/problem/1090/H | [
"graphs"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 108
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1090-G | codeforces | 1090-G | Combostone | https://codeforces.com/problemset/problem/1090/G | [
"games",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 123
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1090-F | codeforces | 1090-F | How to Learn You Score | https://codeforces.com/problemset/problem/1090/F | [
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 378
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1090-E | codeforces | 1090-E | Horseback Riding | https://codeforces.com/problemset/problem/1090/E | [
"flows",
"graphs"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 683
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1090-D | codeforces | 1090-D | Similar Arrays | https://codeforces.com/problemset/problem/1090/D | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2368
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1090-C | codeforces | 1090-C | New Year Presents | https://codeforces.com/problemset/problem/1090/C | [
"constructive algorithms",
"data structures"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 574
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1090-B | codeforces | 1090-B | LaTeX Expert | https://codeforces.com/problemset/problem/1090/B | [] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1551
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1090-A | codeforces | 1090-A | Company Merging | https://codeforces.com/problemset/problem/1090/A | [
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 4951
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1089-M | codeforces | 1089-M | Minegraphed | https://codeforces.com/problemset/problem/1089/M | [
"constructive algorithms",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 656
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1089-L | codeforces | 1089-L | Lazyland | https://codeforces.com/problemset/problem/1089/L | [] | null | null | stdin_stdout | 900 | {
"solved_count": 4794
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1089-K | codeforces | 1089-K | King Kog's Reception | https://codeforces.com/problemset/problem/1089/K | [
"data structures"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1246
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1089-J | codeforces | 1089-J | JS Minification | https://codeforces.com/problemset/problem/1089/J | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 147
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1089-I | codeforces | 1089-I | Interval-Free Permutations | https://codeforces.com/problemset/problem/1089/I | [
"combinatorics"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 460
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1089-H | codeforces | 1089-H | Harder Satisfiability | https://codeforces.com/problemset/problem/1089/H | [
"2-sat",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 127
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1089-G | codeforces | 1089-G | Guest Student | https://codeforces.com/problemset/problem/1089/G | [
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 3232
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1089-F | codeforces | 1089-F | Fractions | https://codeforces.com/problemset/problem/1089/F | [
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2153
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1089-E | codeforces | 1089-E | Easy Chess | https://codeforces.com/problemset/problem/1089/E | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2143
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1089-D | codeforces | 1089-D | Distance Sum | https://codeforces.com/problemset/problem/1089/D | [
"graphs"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 111
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1089-C | codeforces | 1089-C | Cactus Search | https://codeforces.com/problemset/problem/1089/C | [
"interactive"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 464
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1089-B | codeforces | 1089-B | Bimatching | https://codeforces.com/problemset/problem/1089/B | [
"graphs"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 249
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1089-A | codeforces | 1089-A | Alice the Fan | https://codeforces.com/problemset/problem/1089/A | [
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1276
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1088-F | codeforces | 1088-F | Ehab and a weird weight formula | https://codeforces.com/problemset/problem/1088/F | [
"data structures",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 597
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1088-E | codeforces | 1088-E | Ehab and a component choosing problem | https://codeforces.com/problemset/problem/1088/E | [
"dp",
"greedy",
"math",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1620
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1088-D | codeforces | 1088-D | Ehab and another another xor problem | https://codeforces.com/problemset/problem/1088/D | [
"bitmasks",
"constructive algorithms",
"implementation",
"interactive"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3183
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1088-C | codeforces | 1088-C | Ehab and a 2-operation task | https://codeforces.com/problemset/problem/1088/C | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 8528
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1088-B | codeforces | 1088-B | Ehab and subtraction | https://codeforces.com/problemset/problem/1088/B | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 13615
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1088-A | codeforces | 1088-A | Ehab and another construction problem | https://codeforces.com/problemset/problem/1088/A | [
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17659
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1086-F | codeforces | 1086-F | Forest Fires | https://codeforces.com/problemset/problem/1086/F | [
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 318
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1085-G | codeforces | 1085-G | Beautiful Matrix | https://codeforces.com/problemset/problem/1085/G | [
"combinatorics",
"data structures",
"dp"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 711
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1085-F | codeforces | 1085-F | Rock-Paper-Scissors Champion | https://codeforces.com/problemset/problem/1085/F | [] | null | null | stdin_stdout | 2,500 | {
"solved_count": 711
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1085-E | codeforces | 1085-E | Vasya and Templates | https://codeforces.com/problemset/problem/1085/E | [
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1126
} | 2026-06-01T05:00:40.145500+00:00 |
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": 5918
} | 2026-06-01T05:00:40.145500+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": 5656
} | 2026-06-01T05:00:40.145500+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": 10097
} | 2026-06-01T05:00:40.145500+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": 12708
} | 2026-06-01T05:00:40.145500+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": 11878
} | 2026-06-01T05:00:40.145500+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": 8310
} | 2026-06-01T05:00:40.145500+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": 8260
} | 2026-06-01T05:00:40.145500+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": 319
} | 2026-06-01T05:00:40.145500+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": 5691
} | 2026-06-01T05:00:40.145500+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": 358
} | 2026-06-01T05:00:40.145500+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": 1118
} | 2026-06-01T05:00:40.145500+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": 2177
} | 2026-06-01T05:00:40.145500+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": 6318
} | 2026-06-01T05:00:40.145500+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": 2731
} | 2026-06-01T05:00:40.145500+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": 551
} | 2026-06-01T05:00:40.145500+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": 6403
} | 2026-06-01T05:00:40.145500+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": 4094
} | 2026-06-01T05:00:40.145500+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": 6145
} | 2026-06-01T05:00:40.145500+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": 8059
} | 2026-06-01T05:00:40.145500+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": 9320
} | 2026-06-01T05:00:40.145500+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": 131
} | 2026-06-01T05:00:40.145500+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": 434
} | 2026-06-01T05:00:40.145500+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": 506
} | 2026-06-01T05:00:40.145500+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": 2826
} | 2026-06-01T05:00:40.145500+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": 4677
} | 2026-06-01T05:00:40.145500+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": 8640
} | 2026-06-01T05:00:40.145500+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": 4673
} | 2026-06-01T05:00:40.145500+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": 13293
} | 2026-06-01T05:00:40.145500+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": 928
} | 2026-06-01T05:00:40.145500+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": 1322
} | 2026-06-01T05:00:40.145500+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": 1666
} | 2026-06-01T05:00:40.145500+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": 4227
} | 2026-06-01T05:00:40.145500+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": 12677
} | 2026-06-01T05:00:40.145500+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": 19189
} | 2026-06-01T05:00:40.145500+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": 105
} | 2026-06-01T05:00:40.145500+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": 4223
} | 2026-06-01T05:00:40.145500+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": 5410
} | 2026-06-01T05:00:40.145500+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": 5111
} | 2026-06-01T05:00:40.145500+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": 10526
} | 2026-06-01T05:00:40.145500+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": 25965
} | 2026-06-01T05:00:40.145500+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": 20488
} | 2026-06-01T05:00:40.145500+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": 32340
} | 2026-06-01T05:00:40.145500+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": 730
} | 2026-06-01T05:00:40.145500+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": 726
} | 2026-06-01T05:00:40.145500+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": 4160
} | 2026-06-01T05:00:40.145500+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": 5977
} | 2026-06-01T05:00:40.145500+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": 13448
} | 2026-06-01T05:00:40.145500+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": 14631
} | 2026-06-01T05:00:40.145500+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": 14193
} | 2026-06-01T05:00:40.145500+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": 4531
} | 2026-06-01T05:00:40.145500+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": 9158
} | 2026-06-01T05:00:40.145500+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": 1113
} | 2026-06-01T05:00:40.145500+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": 594
} | 2026-06-01T05:00:40.145500+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": 3623
} | 2026-06-01T05:00:40.145500+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": 6734
} | 2026-06-01T05:00:40.145500+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": 5465
} | 2026-06-01T05:00:40.145500+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": 11237
} | 2026-06-01T05:00:40.145500+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": 17113
} | 2026-06-01T05:00:40.145500+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": 160
} | 2026-06-01T05:00:40.145500+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": 89
} | 2026-06-01T05:00:40.145500+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": 382
} | 2026-06-01T05:00:40.145500+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": 5400
} | 2026-06-01T05:00:40.145500+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": 791
} | 2026-06-01T05:00:40.145500+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": 779
} | 2026-06-01T05:00:40.145500+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": 3857
} | 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.