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:1101-E | codeforces | 1101-E | Polycarp's New Job | https://codeforces.com/problemset/problem/1101/E | [
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 8309
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1101-D | codeforces | 1101-D | GCD Counting | https://codeforces.com/problemset/problem/1101/D | [
"data structures",
"dfs and similar",
"dp",
"number theory",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5693
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1101-C | codeforces | 1101-C | Division and Union | https://codeforces.com/problemset/problem/1101/C | [
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13428
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1101-B | codeforces | 1101-B | Accordion | https://codeforces.com/problemset/problem/1101/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 11206
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1101-A | codeforces | 1101-A | Minimum Integer | https://codeforces.com/problemset/problem/1101/A | [
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 19138
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1100-F | codeforces | 1100-F | Ivan and Burgers | https://codeforces.com/problemset/problem/1100/F | [
"data structures",
"divide and conquer",
"greedy",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 4116
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1100-E | codeforces | 1100-E | Andrew and Taxi | https://codeforces.com/problemset/problem/1100/E | [
"binary search",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2860
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1100-D | codeforces | 1100-D | Dasha and Chess | https://codeforces.com/problemset/problem/1100/D | [
"constructive algorithms",
"games",
"interactive"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 973
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1100-C | codeforces | 1100-C | NN and the Optical Illusion | https://codeforces.com/problemset/problem/1100/C | [
"binary search",
"geometry",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 11042
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1100-B | codeforces | 1100-B | Build a Contest | https://codeforces.com/problemset/problem/1100/B | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 11942
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1100-A | codeforces | 1100-A | Roman and Browser | https://codeforces.com/problemset/problem/1100/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 10862
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1099-F | codeforces | 1099-F | Cookies | https://codeforces.com/problemset/problem/1099/F | [
"binary search",
"data structures",
"dfs and similar",
"dp",
"games",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1106
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1099-C | codeforces | 1099-C | Postcard | https://codeforces.com/problemset/problem/1099/C | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 10564
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1099-B | codeforces | 1099-B | Squares and Segments | https://codeforces.com/problemset/problem/1099/B | [
"binary search",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 11620
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1099-A | codeforces | 1099-A | Snowball | https://codeforces.com/problemset/problem/1099/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 13476
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1098-F | codeforces | 1098-F | Ж-function | https://codeforces.com/problemset/problem/1098/F | [
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 294
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1098-E | codeforces | 1098-E | Fedya the Potter | https://codeforces.com/problemset/problem/1098/E | [
"binary search",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 449
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1098-D | codeforces | 1098-D | Eels | https://codeforces.com/problemset/problem/1098/D | [
"data structures"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 992
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1098-C | codeforces | 1098-C | Construct a tree | https://codeforces.com/problemset/problem/1098/C | [
"binary search",
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1197
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1098-B | codeforces | 1098-B | Nice table | https://codeforces.com/problemset/problem/1098/B | [
"brute force",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1832
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1098-A | codeforces | 1098-A | Sum in the tree | https://codeforces.com/problemset/problem/1098/A | [
"constructive algorithms",
"dfs and similar",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9793
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1097-H | codeforces | 1097-H | Mateusz and an Infinite Sequence | https://codeforces.com/problemset/problem/1097/H | [
"bitmasks",
"brute force",
"dp",
"strings"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 272
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1097-G | codeforces | 1097-G | Vladislav and a Great Legend | https://codeforces.com/problemset/problem/1097/G | [
"combinatorics",
"dp",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 1214
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1097-F | codeforces | 1097-F | Alex and a TV Show | https://codeforces.com/problemset/problem/1097/F | [
"bitmasks",
"combinatorics",
"number theory"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1570
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1097-E | codeforces | 1097-E | Egor and an RPG game | https://codeforces.com/problemset/problem/1097/E | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 764
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1097-D | codeforces | 1097-D | Makoto and a Blackboard | https://codeforces.com/problemset/problem/1097/D | [
"dp",
"math",
"number theory",
"probabilities"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3384
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1097-C | codeforces | 1097-C | Yuhao and a Parenthesis | https://codeforces.com/problemset/problem/1097/C | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 8875
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1097-B | codeforces | 1097-B | Petr and a Combination Lock | https://codeforces.com/problemset/problem/1097/B | [
"bitmasks",
"brute force",
"dp"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 39104
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1097-A | codeforces | 1097-A | Gennady and a Card Game | https://codeforces.com/problemset/problem/1097/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 45217
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1096-G | codeforces | 1096-G | Lucky Tickets | https://codeforces.com/problemset/problem/1096/G | [
"divide and conquer",
"dp",
"fft"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2197
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1096-F | codeforces | 1096-F | Inversion Expectation | https://codeforces.com/problemset/problem/1096/F | [
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2204
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1096-E | codeforces | 1096-E | The Top Scorer | https://codeforces.com/problemset/problem/1096/E | [
"combinatorics",
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1395
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1096-D | codeforces | 1096-D | Easy Problem | https://codeforces.com/problemset/problem/1096/D | [
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9794
} | 2026-11-02T05:37:07.883505+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": 7306
} | 2026-11-02T05:37:07.883505+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": 12062
} | 2026-11-02T05:37:07.883505+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": 19907
} | 2026-11-02T05:37:07.883505+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": 8174
} | 2026-11-02T05:37:07.883505+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": 4649
} | 2026-11-02T05:37:07.883505+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": 8189
} | 2026-11-02T05:37:07.883505+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": 20459
} | 2026-11-02T05:37:07.883505+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": 25130
} | 2026-11-02T05:37:07.883505+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": 37595
} | 2026-11-02T05:37:07.883505+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": 2394
} | 2026-11-02T05:37:07.883505+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": 1474
} | 2026-11-02T05:37:07.883505+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": 2034
} | 2026-11-02T05:37:07.883505+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": 12207
} | 2026-11-02T05:37:07.883505+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": 9786
} | 2026-11-02T05:37:07.883505+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": 17969
} | 2026-11-02T05:37:07.883505+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": 18494
} | 2026-11-02T05:37:07.883505+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": 12170
} | 2026-11-02T05:37:07.883505+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": 2278
} | 2026-11-02T05:37:07.883505+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": 3485
} | 2026-11-02T05:37:07.883505+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": 6004
} | 2026-11-02T05:37:07.883505+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": 6443
} | 2026-11-02T05:37:07.883505+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": 29859
} | 2026-11-02T05:37:07.883505+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": 17443
} | 2026-11-02T05:37:07.883505+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": 587
} | 2026-11-02T05:37:07.883505+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": 258
} | 2026-11-02T05:37:07.883505+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": 1021
} | 2026-11-02T05:37:07.883505+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": 1125
} | 2026-11-02T05:37:07.883505+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": 7610
} | 2026-11-02T05:37:07.883505+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": 10680
} | 2026-11-02T05:37:07.883505+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": 11088
} | 2026-11-02T05:37:07.883505+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": 18649
} | 2026-11-02T05:37:07.883505+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": 7365
} | 2026-11-02T05:37:07.883505+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": 1436
} | 2026-11-02T05:37:07.883505+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": 1207
} | 2026-11-02T05:37:07.883505+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": 626
} | 2026-11-02T05:37:07.883505+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": 1189
} | 2026-11-02T05:37:07.883505+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": 118
} | 2026-11-02T05:37:07.883505+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": 127
} | 2026-11-02T05:37:07.883505+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": 392
} | 2026-11-02T05:37:07.883505+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": 697
} | 2026-11-02T05:37:07.883505+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": 2398
} | 2026-11-02T05:37:07.883505+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": 595
} | 2026-11-02T05:37:07.883505+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": 1564
} | 2026-11-02T05:37:07.883505+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": 4998
} | 2026-11-02T05:37:07.883505+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": 658
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1089-L | codeforces | 1089-L | Lazyland | https://codeforces.com/problemset/problem/1089/L | [] | null | null | stdin_stdout | 900 | {
"solved_count": 4900
} | 2026-11-02T05:37:07.883505+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": 1274
} | 2026-11-02T05:37:07.883505+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": 149
} | 2026-11-02T05:37:07.883505+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": 487
} | 2026-11-02T05:37:07.883505+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": 131
} | 2026-11-02T05:37:07.883505+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": 3284
} | 2026-11-02T05:37:07.883505+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": 2182
} | 2026-11-02T05:37:07.883505+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": 2174
} | 2026-11-02T05:37:07.883505+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": 118
} | 2026-11-02T05:37:07.883505+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-11-02T05:37:07.883505+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": 254
} | 2026-11-02T05:37:07.883505+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": 1292
} | 2026-11-02T05:37:07.883505+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": 665
} | 2026-11-02T05:37:07.883505+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": 1675
} | 2026-11-02T05:37:07.883505+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": 3273
} | 2026-11-02T05:37:07.883505+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": 8574
} | 2026-11-02T05:37:07.883505+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": 13782
} | 2026-11-02T05:37:07.883505+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": 17787
} | 2026-11-02T05:37:07.883505+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": 463
} | 2026-11-02T05:37:07.883505+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": 1074
} | 2026-11-02T05:37:07.883505+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": 808
} | 2026-11-02T05:37:07.883505+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": 1166
} | 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.