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:1096-D | codeforces | 1096-D | Easy Problem | https://codeforces.com/problemset/problem/1096/D | [
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9615
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1096-C | codeforces | 1096-C | Polygon for the Angle | https://codeforces.com/problemset/problem/1096/C | [
"brute force",
"geometry"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7275
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1096-B | codeforces | 1096-B | Substring Removal | https://codeforces.com/problemset/problem/1096/B | [
"combinatorics",
"math",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 11888
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1096-A | codeforces | 1096-A | Find Divisible | https://codeforces.com/problemset/problem/1096/A | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19776
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1095-F | codeforces | 1095-F | Make It Connected | https://codeforces.com/problemset/problem/1095/F | [
"dsu",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7867
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1095-E | codeforces | 1095-E | Almost Regular Bracket Sequence | https://codeforces.com/problemset/problem/1095/E | [
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4575
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1095-D | codeforces | 1095-D | Circular Dance | https://codeforces.com/problemset/problem/1095/D | [
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8153
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1095-C | codeforces | 1095-C | Powers Of Two | https://codeforces.com/problemset/problem/1095/C | [
"bitmasks",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 20214
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1095-B | codeforces | 1095-B | Array Stabilization | https://codeforces.com/problemset/problem/1095/B | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 24892
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1095-A | codeforces | 1095-A | Repeating Cipher | https://codeforces.com/problemset/problem/1095/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 37246
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1093-G | codeforces | 1093-G | Multidimensional Queries | https://codeforces.com/problemset/problem/1093/G | [
"bitmasks",
"data structures"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2294
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1093-F | codeforces | 1093-F | Vasya and Array | https://codeforces.com/problemset/problem/1093/F | [
"dp"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1444
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1093-E | codeforces | 1093-E | Intersection of Permutations | https://codeforces.com/problemset/problem/1093/E | [
"data structures"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1989
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1093-D | codeforces | 1093-D | Beautiful Graph | https://codeforces.com/problemset/problem/1093/D | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11877
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1093-C | codeforces | 1093-C | Mishka and the Last Exam | https://codeforces.com/problemset/problem/1093/C | [
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9754
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1093-B | codeforces | 1093-B | Letters Rearranging | https://codeforces.com/problemset/problem/1093/B | [
"constructive algorithms",
"greedy",
"sortings",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 17861
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1093-A | codeforces | 1093-A | Dice Rolling | https://codeforces.com/problemset/problem/1093/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18419
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1092-F | codeforces | 1092-F | Tree with Maximum Cost | https://codeforces.com/problemset/problem/1092/F | [
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 11632
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1092-E | codeforces | 1092-E | Minimal Diameter Forest | https://codeforces.com/problemset/problem/1092/E | [
"constructive algorithms",
"dfs and similar",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2237
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1092-D2 | codeforces | 1092-D2 | Great Vova Wall (Version 2) | https://codeforces.com/problemset/problem/1092/D2 | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3440
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1092-D1 | codeforces | 1092-D1 | Great Vova Wall (Version 1) | https://codeforces.com/problemset/problem/1092/D1 | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 5884
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1092-C | codeforces | 1092-C | Prefixes and Suffixes | https://codeforces.com/problemset/problem/1092/C | [
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6395
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1092-B | codeforces | 1092-B | Teams Forming | https://codeforces.com/problemset/problem/1092/B | [
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29497
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1092-A | codeforces | 1092-A | Uniform String | https://codeforces.com/problemset/problem/1092/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17363
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1091-H | codeforces | 1091-H | New Year and the Tricolore Recreation | https://codeforces.com/problemset/problem/1091/H | [
"games"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 577
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1091-G | codeforces | 1091-G | New Year and the Factorisation Collaboration | https://codeforces.com/problemset/problem/1091/G | [
"interactive",
"math",
"number theory"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 257
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1091-F | codeforces | 1091-F | New Year and the Mallard Expedition | https://codeforces.com/problemset/problem/1091/F | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 937
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1091-E | codeforces | 1091-E | New Year and the Acquaintance Estimation | https://codeforces.com/problemset/problem/1091/E | [
"binary search",
"data structures",
"graphs",
"greedy",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1120
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1091-D | codeforces | 1091-D | New Year and the Permutation Concatenation | https://codeforces.com/problemset/problem/1091/D | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7560
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1091-C | codeforces | 1091-C | New Year and the Sphere Transmission | https://codeforces.com/problemset/problem/1091/C | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10628
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1091-B | codeforces | 1091-B | New Year and the Treasure Geolocation | https://codeforces.com/problemset/problem/1091/B | [
"brute force",
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 11055
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1091-A | codeforces | 1091-A | New Year and the Christmas Ornament | https://codeforces.com/problemset/problem/1091/A | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18604
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1090-M | codeforces | 1090-M | The Pleasant Walk | https://codeforces.com/problemset/problem/1090/M | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 7279
} | 2026-08-17T01:43:56.191071+00:00 |
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": 1429
} | 2026-08-17T01:43:56.191071+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": 1204
} | 2026-08-17T01:43:56.191071+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": 615
} | 2026-08-17T01:43:56.191071+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": 1185
} | 2026-08-17T01:43:56.191071+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": 112
} | 2026-08-17T01:43:56.191071+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": 124
} | 2026-08-17T01:43:56.191071+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": 385
} | 2026-08-17T01:43:56.191071+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": 694
} | 2026-08-17T01:43:56.191071+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": 2380
} | 2026-08-17T01:43:56.191071+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": 586
} | 2026-08-17T01:43:56.191071+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": 1558
} | 2026-08-17T01:43:56.191071+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": 4977
} | 2026-08-17T01:43:56.191071+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": 657
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1089-L | codeforces | 1089-L | Lazyland | https://codeforces.com/problemset/problem/1089/L | [] | null | null | stdin_stdout | 900 | {
"solved_count": 4836
} | 2026-08-17T01:43:56.191071+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": 1260
} | 2026-08-17T01:43:56.191071+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": 148
} | 2026-08-17T01:43:56.191071+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": 481
} | 2026-08-17T01:43:56.191071+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": 129
} | 2026-08-17T01:43:56.191071+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": 3250
} | 2026-08-17T01:43:56.191071+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": 2172
} | 2026-08-17T01:43:56.191071+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": 2153
} | 2026-08-17T01:43:56.191071+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": 112
} | 2026-08-17T01:43:56.191071+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": 466
} | 2026-08-17T01:43:56.191071+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": 252
} | 2026-08-17T01:43:56.191071+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": 1282
} | 2026-08-17T01:43:56.191071+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": 647
} | 2026-08-17T01:43:56.191071+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": 1658
} | 2026-08-17T01:43:56.191071+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": 3240
} | 2026-08-17T01:43:56.191071+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": 8556
} | 2026-08-17T01:43:56.191071+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": 13700
} | 2026-08-17T01:43:56.191071+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": 17701
} | 2026-08-17T01:43:56.191071+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": 461
} | 2026-08-17T01:43:56.191071+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": 1066
} | 2026-08-17T01:43:56.191071+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": 801
} | 2026-08-17T01:43:56.191071+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": 1159
} | 2026-08-17T01:43:56.191071+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": 5978
} | 2026-08-17T01:43:56.191071+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": 5688
} | 2026-08-17T01:43:56.191071+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": 10339
} | 2026-08-17T01:43:56.191071+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": 12758
} | 2026-08-17T01:43:56.191071+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": 12532
} | 2026-08-17T01:43:56.191071+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": 8340
} | 2026-08-17T01:43:56.191071+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": 8297
} | 2026-08-17T01:43:56.191071+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": 490
} | 2026-08-17T01:43:56.191071+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": 5980
} | 2026-08-17T01:43:56.191071+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": 647
} | 2026-08-17T01:43:56.191071+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": 1189
} | 2026-08-17T01:43:56.191071+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": 2285
} | 2026-08-17T01:43:56.191071+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": 6437
} | 2026-08-17T01:43:56.191071+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": 2836
} | 2026-08-17T01:43:56.191071+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": 632
} | 2026-08-17T01:43:56.191071+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": 6708
} | 2026-08-17T01:43:56.191071+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": 4166
} | 2026-08-17T01:43:56.191071+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": 6250
} | 2026-08-17T01:43:56.191071+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": 8094
} | 2026-08-17T01:43:56.191071+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": 9453
} | 2026-08-17T01:43:56.191071+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": 134
} | 2026-08-17T01:43:56.191071+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": 514
} | 2026-08-17T01:43:56.191071+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": 571
} | 2026-08-17T01:43:56.191071+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": 2848
} | 2026-08-17T01:43:56.191071+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": 4802
} | 2026-08-17T01:43:56.191071+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": 8794
} | 2026-08-17T01:43:56.191071+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": 4715
} | 2026-08-17T01:43:56.191071+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": 13353
} | 2026-08-17T01:43:56.191071+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": 1008
} | 2026-08-17T01:43:56.191071+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": 1382
} | 2026-08-17T01:43:56.191071+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": 1699
} | 2026-08-17T01:43:56.191071+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": 4237
} | 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.