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:1118-F1 | codeforces | 1118-F1 | Tree Cutting (Easy Version) | https://codeforces.com/problemset/problem/1118/F1 | [
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7004
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1118-E | codeforces | 1118-E | Yet Another Ball Problem | https://codeforces.com/problemset/problem/1118/E | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4533
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1118-D2 | codeforces | 1118-D2 | Coffee and Coursework (Hard Version) | https://codeforces.com/problemset/problem/1118/D2 | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7033
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1118-D1 | codeforces | 1118-D1 | Coffee and Coursework (Easy version) | https://codeforces.com/problemset/problem/1118/D1 | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6229
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1118-C | codeforces | 1118-C | Palindromic Matrix | https://codeforces.com/problemset/problem/1118/C | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6177
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1118-B | codeforces | 1118-B | Tanya and Candies | https://codeforces.com/problemset/problem/1118/B | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 13516
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1118-A | codeforces | 1118-A | Water Buying | https://codeforces.com/problemset/problem/1118/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21951
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1117-G | codeforces | 1117-G | Recursive Queries | https://codeforces.com/problemset/problem/1117/G | [
"data structures"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1012
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1117-F | codeforces | 1117-F | Crisp String | https://codeforces.com/problemset/problem/1117/F | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 714
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1117-E | codeforces | 1117-E | Decypher the String | https://codeforces.com/problemset/problem/1117/E | [
"bitmasks",
"chinese remainder theorem",
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1675
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1117-D | codeforces | 1117-D | Magic Gems | https://codeforces.com/problemset/problem/1117/D | [
"dp",
"math",
"matrices"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 5819
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1117-C | codeforces | 1117-C | Magic Ship | https://codeforces.com/problemset/problem/1117/C | [
"binary search"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 9936
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1117-B | codeforces | 1117-B | Emotes | https://codeforces.com/problemset/problem/1117/B | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 16124
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1117-A | codeforces | 1117-A | Best Subsegment | https://codeforces.com/problemset/problem/1117/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 11622
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1116-D6 | codeforces | 1116-D6 | Hessenberg matrix | https://codeforces.com/problemset/problem/1116/D6 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 82
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1116-D5 | codeforces | 1116-D5 | Creeper | https://codeforces.com/problemset/problem/1116/D5 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 153
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1116-D4 | codeforces | 1116-D4 | TIE fighter | https://codeforces.com/problemset/problem/1116/D4 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 172
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1116-D3 | codeforces | 1116-D3 | X-wing fighter | https://codeforces.com/problemset/problem/1116/D3 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 208
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1116-D2 | codeforces | 1116-D2 | Pattern of increasing blocks | https://codeforces.com/problemset/problem/1116/D2 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 237
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1116-D1 | codeforces | 1116-D1 | Block diagonal matrix | https://codeforces.com/problemset/problem/1116/D1 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 279
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1116-C3 | codeforces | 1116-C3 | ``Is the number of ones divisible by 3?'' oracle | https://codeforces.com/problemset/problem/1116/C3 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 188
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1116-C2 | codeforces | 1116-C2 | ``Is the bit string periodic?'' oracle | https://codeforces.com/problemset/problem/1116/C2 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 190
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1116-C1 | codeforces | 1116-C1 | Alternating bits oracle | https://codeforces.com/problemset/problem/1116/C1 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 269
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1116-B2 | codeforces | 1116-B2 | Not A, not B or not C? | https://codeforces.com/problemset/problem/1116/B2 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 63
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1116-B1 | codeforces | 1116-B1 | Distinguish three-qubit states | https://codeforces.com/problemset/problem/1116/B1 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 137
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1116-A2 | codeforces | 1116-A2 | Generate equal superposition of four basis states | https://codeforces.com/problemset/problem/1116/A2 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 185
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1116-A1 | codeforces | 1116-A1 | Generate state |00⟩ + |01⟩ + |10⟩ | https://codeforces.com/problemset/problem/1116/A1 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 329
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1115-U3 | codeforces | 1115-U3 | Block unitary | https://codeforces.com/problemset/problem/1115/U3 | [
"*special"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 201
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1115-U2 | codeforces | 1115-U2 | Chessboard unitary | https://codeforces.com/problemset/problem/1115/U2 | [
"*special"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 241
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1115-U1 | codeforces | 1115-U1 | Anti-diagonal unitary | https://codeforces.com/problemset/problem/1115/U1 | [
"*special"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 271
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1115-G3 | codeforces | 1115-G3 | Palindrome checker oracle | https://codeforces.com/problemset/problem/1115/G3 | [
"*special"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 238
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1115-G2 | codeforces | 1115-G2 | OR oracle | https://codeforces.com/problemset/problem/1115/G2 | [
"*special"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 318
} | 2026-11-02T05:37:07.883505+00:00 |
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-11-02T05:37:07.883505+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": 2669
} | 2026-11-02T05:37:07.883505+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": 3340
} | 2026-11-02T05:37:07.883505+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": 8587
} | 2026-11-02T05:37:07.883505+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": 8109
} | 2026-11-02T05:37:07.883505+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": 9493
} | 2026-11-02T05:37:07.883505+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": 19956
} | 2026-11-02T05:37:07.883505+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": 8410
} | 2026-11-02T05:37:07.883505+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": 18515
} | 2026-11-02T05:37:07.883505+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": 1204
} | 2026-11-02T05:37:07.883505+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": 1242
} | 2026-11-02T05:37:07.883505+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": 7336
} | 2026-11-02T05:37:07.883505+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": 6598
} | 2026-11-02T05:37:07.883505+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": 18328
} | 2026-11-02T05:37:07.883505+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": 481
} | 2026-11-02T05:37:07.883505+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": 797
} | 2026-11-02T05:37:07.883505+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": 2240
} | 2026-11-02T05:37:07.883505+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": 5243
} | 2026-11-02T05:37:07.883505+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": 4218
} | 2026-11-02T05:37:07.883505+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": 10171
} | 2026-11-02T05:37:07.883505+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": 18372
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1110-A | codeforces | 1110-A | Parity | https://codeforces.com/problemset/problem/1110/A | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 16348
} | 2026-11-02T05:37:07.883505+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": 455
} | 2026-11-02T05:37:07.883505+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": 668
} | 2026-11-02T05:37:07.883505+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": 1573
} | 2026-11-02T05:37:07.883505+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": 349
} | 2026-11-02T05:37:07.883505+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": 4598
} | 2026-11-02T05:37:07.883505+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": 9159
} | 2026-11-02T05:37:07.883505+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": 3871
} | 2026-11-02T05:37:07.883505+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": 2830
} | 2026-11-02T05:37:07.883505+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": 5046
} | 2026-11-02T05:37:07.883505+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": 16735
} | 2026-11-02T05:37:07.883505+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": 12868
} | 2026-11-02T05:37:07.883505+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": 25695
} | 2026-11-02T05:37:07.883505+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": 23627
} | 2026-11-02T05:37:07.883505+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": 1336
} | 2026-11-02T05:37:07.883505+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": 1032
} | 2026-11-02T05:37:07.883505+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": 3044
} | 2026-11-02T05:37:07.883505+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": 3947
} | 2026-11-02T05:37:07.883505+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": 11123
} | 2026-11-02T05:37:07.883505+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": 18125
} | 2026-11-02T05:37:07.883505+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": 12915
} | 2026-11-02T05:37:07.883505+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": 1266
} | 2026-11-02T05:37:07.883505+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": 2931
} | 2026-11-02T05:37:07.883505+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": 21577
} | 2026-11-02T05:37:07.883505+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": 16454
} | 2026-11-02T05:37:07.883505+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": 7048
} | 2026-11-02T05:37:07.883505+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": 12985
} | 2026-11-02T05:37:07.883505+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": 2107
} | 2026-11-02T05:37:07.883505+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": 4509
} | 2026-11-02T05:37:07.883505+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": 11950
} | 2026-11-02T05:37:07.883505+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": 10651
} | 2026-11-02T05:37:07.883505+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": 11678
} | 2026-11-02T05:37:07.883505+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": 17512
} | 2026-11-02T05:37:07.883505+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": 16013
} | 2026-11-02T05:37:07.883505+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": 421
} | 2026-11-02T05:37:07.883505+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": 581
} | 2026-11-02T05:37:07.883505+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": 1027
} | 2026-11-02T05:37:07.883505+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": 3585
} | 2026-11-02T05:37:07.883505+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": 10755
} | 2026-11-02T05:37:07.883505+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": 2487
} | 2026-11-02T05:37:07.883505+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": 7213
} | 2026-11-02T05:37:07.883505+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": 8662
} | 2026-11-02T05:37:07.883505+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": 14430
} | 2026-11-02T05:37:07.883505+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": 11285
} | 2026-11-02T05:37:07.883505+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": 27168
} | 2026-11-02T05:37:07.883505+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": 2368
} | 2026-11-02T05:37:07.883505+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": 1787
} | 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.