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:1115-G1 | codeforces | 1115-G1 | AND oracle | https://codeforces.com/problemset/problem/1115/G1 | [
"*special"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 404
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1114-F | codeforces | 1114-F | Please, another Queries on Array? | https://codeforces.com/problemset/problem/1114/F | [
"bitmasks",
"data structures",
"divide and conquer",
"math",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2594
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1114-E | codeforces | 1114-E | Arithmetic Progression | https://codeforces.com/problemset/problem/1114/E | [
"binary search",
"interactive",
"number theory",
"probabilities"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3275
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1114-D | codeforces | 1114-D | Flood Fill | https://codeforces.com/problemset/problem/1114/D | [
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 8369
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1114-C | codeforces | 1114-C | Trailing Loves (or L'oeufs?) | https://codeforces.com/problemset/problem/1114/C | [
"brute force",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8032
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1114-B | codeforces | 1114-B | Yet Another Array Partitioning Task | https://codeforces.com/problemset/problem/1114/B | [
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9450
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1114-A | codeforces | 1114-A | Got Any Grapes? | https://codeforces.com/problemset/problem/1114/A | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19838
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1113-B | codeforces | 1113-B | Sasha and Magnetic Machines | https://codeforces.com/problemset/problem/1113/B | [
"greedy",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 8357
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1113-A | codeforces | 1113-A | Sasha and His Trip | https://codeforces.com/problemset/problem/1113/A | [
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 18440
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1111-E | codeforces | 1111-E | Tree | https://codeforces.com/problemset/problem/1111/E | [
"data structures",
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1184
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1111-D | codeforces | 1111-D | Destroy the Colony | https://codeforces.com/problemset/problem/1111/D | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1191
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1111-C | codeforces | 1111-C | Creative Snap | https://codeforces.com/problemset/problem/1111/C | [
"binary search",
"brute force",
"divide and conquer",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7173
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1111-B | codeforces | 1111-B | Average Superhero Gang Power | https://codeforces.com/problemset/problem/1111/B | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6579
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1111-A | codeforces | 1111-A | Superhero Transformation | https://codeforces.com/problemset/problem/1111/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 18258
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1110-H | codeforces | 1110-H | Modest Substrings | https://codeforces.com/problemset/problem/1110/H | [
"dp",
"strings"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 473
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1110-G | codeforces | 1110-G | Tree-Tac-Toe | https://codeforces.com/problemset/problem/1110/G | [
"constructive algorithms",
"games",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 778
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1110-F | codeforces | 1110-F | Nearest Leaf | https://codeforces.com/problemset/problem/1110/F | [
"data structures",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 2195
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1110-E | codeforces | 1110-E | Magic Stones | https://codeforces.com/problemset/problem/1110/E | [
"constructive algorithms",
"math",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 5072
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1110-D | codeforces | 1110-D | Jongmah | https://codeforces.com/problemset/problem/1110/D | [
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4164
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1110-C | codeforces | 1110-C | Meaningless Operations | https://codeforces.com/problemset/problem/1110/C | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 10110
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1110-B | codeforces | 1110-B | Tape | https://codeforces.com/problemset/problem/1110/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 17707
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1110-A | codeforces | 1110-A | Parity | https://codeforces.com/problemset/problem/1110/A | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 16223
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1109-F | codeforces | 1109-F | Sasha and Algorithm of Silence's Sounds | https://codeforces.com/problemset/problem/1109/F | [
"data structures",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 452
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1109-E | codeforces | 1109-E | Sasha and a Very Easy Test | https://codeforces.com/problemset/problem/1109/E | [
"data structures",
"number theory"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 662
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1109-D | codeforces | 1109-D | Sasha and Interesting Fact from Graph Theory | https://codeforces.com/problemset/problem/1109/D | [
"brute force",
"combinatorics",
"dp",
"math",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1551
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1109-C | codeforces | 1109-C | Sasha and a Patient Friend | https://codeforces.com/problemset/problem/1109/C | [
"binary search",
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 338
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1109-B | codeforces | 1109-B | Sasha and One More Name | https://codeforces.com/problemset/problem/1109/B | [
"constructive algorithms",
"hashing",
"strings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4572
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1109-A | codeforces | 1109-A | Sasha and a Bit of Relax | https://codeforces.com/problemset/problem/1109/A | [
"dp",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9134
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1108-F | codeforces | 1108-F | MST Unification | https://codeforces.com/problemset/problem/1108/F | [
"binary search",
"dsu",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3751
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1108-E2 | codeforces | 1108-E2 | Array and Segments (Hard version) | https://codeforces.com/problemset/problem/1108/E2 | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2781
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1108-E1 | codeforces | 1108-E1 | Array and Segments (Easy version) | https://codeforces.com/problemset/problem/1108/E1 | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5008
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1108-D | codeforces | 1108-D | Diverse Garland | https://codeforces.com/problemset/problem/1108/D | [
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16612
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1108-C | codeforces | 1108-C | Nice Garland | https://codeforces.com/problemset/problem/1108/C | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12804
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1108-B | codeforces | 1108-B | Divisors of Two Integers | https://codeforces.com/problemset/problem/1108/B | [
"brute force",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 25459
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1108-A | codeforces | 1108-A | Two distinct points | https://codeforces.com/problemset/problem/1108/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23517
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1107-G | codeforces | 1107-G | Vasya and Maximum Profit | https://codeforces.com/problemset/problem/1107/G | [
"binary search",
"constructive algorithms",
"data structures",
"dp",
"dsu"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1300
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1107-F | codeforces | 1107-F | Vasya and Endless Credits | https://codeforces.com/problemset/problem/1107/F | [
"dp",
"flows",
"graph matchings",
"graphs",
"sortings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1012
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1107-E | codeforces | 1107-E | Vasya and Binary String | https://codeforces.com/problemset/problem/1107/E | [
"dp"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2917
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1107-D | codeforces | 1107-D | Compression | https://codeforces.com/problemset/problem/1107/D | [
"dp",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3933
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1107-C | codeforces | 1107-C | Brutality | https://codeforces.com/problemset/problem/1107/C | [
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 11086
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1107-B | codeforces | 1107-B | Digital root | https://codeforces.com/problemset/problem/1107/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 17971
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1107-A | codeforces | 1107-A | Digits Sequence Dividing | https://codeforces.com/problemset/problem/1107/A | [
"greedy",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 12858
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1106-F | codeforces | 1106-F | Lunar New Year and a Recursive Sequence | https://codeforces.com/problemset/problem/1106/F | [
"math",
"matrices",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1247
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1106-E | codeforces | 1106-E | Lunar New Year and Red Envelopes | https://codeforces.com/problemset/problem/1106/E | [
"data structures",
"dp"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2893
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1106-D | codeforces | 1106-D | Lunar New Year and a Wander | https://codeforces.com/problemset/problem/1106/D | [
"data structures",
"dfs and similar",
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 20935
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1106-C | codeforces | 1106-C | Lunar New Year and Number Division | https://codeforces.com/problemset/problem/1106/C | [
"greedy",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 16323
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1106-B | codeforces | 1106-B | Lunar New Year and Food Ordering | https://codeforces.com/problemset/problem/1106/B | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 7029
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1106-A | codeforces | 1106-A | Lunar New Year and Cross Counting | https://codeforces.com/problemset/problem/1106/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 12952
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1105-E | codeforces | 1105-E | Helping Hiasat | https://codeforces.com/problemset/problem/1105/E | [
"bitmasks",
"brute force",
"dp",
"meet-in-the-middle"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2077
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1105-D | codeforces | 1105-D | Kilani and the Game | https://codeforces.com/problemset/problem/1105/D | [
"dfs and similar",
"graphs",
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4472
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1105-C | codeforces | 1105-C | Ayoub and Lost Array | https://codeforces.com/problemset/problem/1105/C | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 11772
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1105-B | codeforces | 1105-B | Zuhair and Strings | https://codeforces.com/problemset/problem/1105/B | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 10609
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1105-A | codeforces | 1105-A | Salem and Sticks | https://codeforces.com/problemset/problem/1105/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 11628
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1104-B | codeforces | 1104-B | Game with string | https://codeforces.com/problemset/problem/1104/B | [
"data structures",
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17234
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1104-A | codeforces | 1104-A | Splitting into digits | https://codeforces.com/problemset/problem/1104/A | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 15958
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1103-E | codeforces | 1103-E | Radix sum | https://codeforces.com/problemset/problem/1103/E | [
"fft",
"math",
"number theory"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 413
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1103-D | codeforces | 1103-D | Professional layer | https://codeforces.com/problemset/problem/1103/D | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 565
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1103-C | codeforces | 1103-C | Johnny Solving | https://codeforces.com/problemset/problem/1103/C | [
"constructive algorithms",
"dfs and similar",
"graphs",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1015
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1103-B | codeforces | 1103-B | Game with modulo | https://codeforces.com/problemset/problem/1103/B | [
"binary search",
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3572
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1103-A | codeforces | 1103-A | Grid game | https://codeforces.com/problemset/problem/1103/A | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10688
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1102-F | codeforces | 1102-F | Elongated Matrix | https://codeforces.com/problemset/problem/1102/F | [
"binary search",
"bitmasks",
"brute force",
"dp",
"graphs"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2448
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1102-E | codeforces | 1102-E | Monotonic Renumeration | https://codeforces.com/problemset/problem/1102/E | [
"combinatorics",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7107
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1102-D | codeforces | 1102-D | Balanced Ternary String | https://codeforces.com/problemset/problem/1102/D | [
"greedy",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 8621
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1102-C | codeforces | 1102-C | Doors Breaking and Repairing | https://codeforces.com/problemset/problem/1102/C | [
"games"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 14310
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1102-B | codeforces | 1102-B | Array K-Coloring | https://codeforces.com/problemset/problem/1102/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11225
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1102-A | codeforces | 1102-A | Integer Sequence Dividing | https://codeforces.com/problemset/problem/1102/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26935
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1101-G | codeforces | 1101-G | (Zero XOR Subset)-less | https://codeforces.com/problemset/problem/1101/G | [
"math",
"matrices"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2304
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1101-F | codeforces | 1101-F | Trucks and Cities | https://codeforces.com/problemset/problem/1101/F | [
"binary search",
"dp"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1711
} | 2026-08-17T01:43:56.191071+00:00 |
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": 8291
} | 2026-08-17T01:43:56.191071+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": 5601
} | 2026-08-17T01:43:56.191071+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": 12945
} | 2026-08-17T01:43:56.191071+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": 11162
} | 2026-08-17T01:43:56.191071+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": 18955
} | 2026-08-17T01:43:56.191071+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": 3959
} | 2026-08-17T01:43:56.191071+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": 2778
} | 2026-08-17T01:43:56.191071+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": 971
} | 2026-08-17T01:43:56.191071+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": 10977
} | 2026-08-17T01:43:56.191071+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": 11873
} | 2026-08-17T01:43:56.191071+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": 10797
} | 2026-08-17T01:43:56.191071+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": 1084
} | 2026-08-17T01:43:56.191071+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": 10500
} | 2026-08-17T01:43:56.191071+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": 11567
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1099-A | codeforces | 1099-A | Snowball | https://codeforces.com/problemset/problem/1099/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 13388
} | 2026-08-17T01:43:56.191071+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": 289
} | 2026-08-17T01:43:56.191071+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-08-17T01:43:56.191071+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": 969
} | 2026-08-17T01:43:56.191071+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": 1186
} | 2026-08-17T01:43:56.191071+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": 1823
} | 2026-08-17T01:43:56.191071+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": 9706
} | 2026-08-17T01:43:56.191071+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": 267
} | 2026-08-17T01:43:56.191071+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": 1195
} | 2026-08-17T01:43:56.191071+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": 1547
} | 2026-08-17T01:43:56.191071+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": 758
} | 2026-08-17T01:43:56.191071+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": 3326
} | 2026-08-17T01:43:56.191071+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": 8832
} | 2026-08-17T01:43:56.191071+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": 37319
} | 2026-08-17T01:43:56.191071+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": 44696
} | 2026-08-17T01:43:56.191071+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": 2114
} | 2026-08-17T01:43:56.191071+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": 2150
} | 2026-08-17T01:43:56.191071+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": 1370
} | 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.