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:1239-A | codeforces | 1239-A | Ivan the Fool and the Probability Theory | https://codeforces.com/problemset/problem/1239/A | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7939
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1238-G | codeforces | 1238-G | Adilbek and the Watering System | https://codeforces.com/problemset/problem/1238/G | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 546
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1238-F | codeforces | 1238-F | The Maximum Subtree | https://codeforces.com/problemset/problem/1238/F | [
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2268
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1238-E | codeforces | 1238-E | Keyboard Purchase | https://codeforces.com/problemset/problem/1238/E | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3727
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1238-D | codeforces | 1238-D | AB-string | https://codeforces.com/problemset/problem/1238/D | [
"binary search",
"combinatorics",
"dp",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6614
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1238-C | codeforces | 1238-C | Standard Free2play | https://codeforces.com/problemset/problem/1238/C | [
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7920
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1238-B | codeforces | 1238-B | Kill `Em All | https://codeforces.com/problemset/problem/1238/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15995
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1238-A | codeforces | 1238-A | Prime Subtraction | https://codeforces.com/problemset/problem/1238/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 28948
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1237-H | codeforces | 1237-H | Balanced Reversals | https://codeforces.com/problemset/problem/1237/H | [
"constructive algorithms"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 693
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1237-G | codeforces | 1237-G | Balanced Distribution | https://codeforces.com/problemset/problem/1237/G | [
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 169
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1237-F | codeforces | 1237-F | Balanced Domino Placements | https://codeforces.com/problemset/problem/1237/F | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1201
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1237-E | codeforces | 1237-E | Balanced Binary Search Trees | https://codeforces.com/problemset/problem/1237/E | [
"dp",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1759
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1237-D | codeforces | 1237-D | Balanced Playlist | https://codeforces.com/problemset/problem/1237/D | [
"binary search",
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5018
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1237-C2 | codeforces | 1237-C2 | Balanced Removals (Harder) | https://codeforces.com/problemset/problem/1237/C2 | [
"binary search",
"constructive algorithms",
"divide and conquer",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4622
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1237-C1 | codeforces | 1237-C1 | Balanced Removals (Easier) | https://codeforces.com/problemset/problem/1237/C1 | [
"constructive algorithms",
"geometry",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6359
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1237-B | codeforces | 1237-B | Balanced Tunnel | https://codeforces.com/problemset/problem/1237/B | [
"data structures",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 25255
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1237-A | codeforces | 1237-A | Balanced Rating Changes | https://codeforces.com/problemset/problem/1237/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 22718
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1236-F | codeforces | 1236-F | Alice and the Cactus | https://codeforces.com/problemset/problem/1236/F | [
"dfs and similar",
"graphs",
"math",
"probabilities"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 438
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1236-E | codeforces | 1236-E | Alice and the Unfair Game | https://codeforces.com/problemset/problem/1236/E | [
"binary search",
"data structures",
"dp",
"dsu"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 821
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1236-D | codeforces | 1236-D | Alice and the Doll | https://codeforces.com/problemset/problem/1236/D | [
"brute force",
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1775
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1236-C | codeforces | 1236-C | Labs | https://codeforces.com/problemset/problem/1236/C | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 10621
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1236-B | codeforces | 1236-B | Alice and the List of Presents | https://codeforces.com/problemset/problem/1236/B | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12310
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1236-A | codeforces | 1236-A | Stones | https://codeforces.com/problemset/problem/1236/A | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17409
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1234-F | codeforces | 1234-F | Yet Another Substring Reverse | https://codeforces.com/problemset/problem/1234/F | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3281
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1234-E | codeforces | 1234-E | Special Permutations | https://codeforces.com/problemset/problem/1234/E | [
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3118
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1234-D | codeforces | 1234-D | Distinct Characters Queries | https://codeforces.com/problemset/problem/1234/D | [
"data structures"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 20122
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1234-C | codeforces | 1234-C | Pipes | https://codeforces.com/problemset/problem/1234/C | [
"dp",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13774
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1234-B2 | codeforces | 1234-B2 | Social Network (hard version) | https://codeforces.com/problemset/problem/1234/B2 | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 18864
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1234-B1 | codeforces | 1234-B1 | Social Network (easy version) | https://codeforces.com/problemset/problem/1234/B1 | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 20022
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1234-A | codeforces | 1234-A | Equalize Prices Again | https://codeforces.com/problemset/problem/1234/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29898
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1231-E | codeforces | 1231-E | Middle-Out | https://codeforces.com/problemset/problem/1231/E | [
"constructive algorithms",
"greedy",
"strings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 957
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1231-C | codeforces | 1231-C | Increasing Matrix | https://codeforces.com/problemset/problem/1231/C | [
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 4472
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1230-B | codeforces | 1230-B | Ania and Minimizing | https://codeforces.com/problemset/problem/1230/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 19851
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1230-A | codeforces | 1230-A | Dawid and Bags of Candies | https://codeforces.com/problemset/problem/1230/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23264
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1228-F | codeforces | 1228-F | One Node is Gone | https://codeforces.com/problemset/problem/1228/F | [
"constructive algorithms",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 628
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1228-E | codeforces | 1228-E | Another Filling the Grid | https://codeforces.com/problemset/problem/1228/E | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3801
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1228-D | codeforces | 1228-D | Complete Tripartite | https://codeforces.com/problemset/problem/1228/D | [
"brute force",
"constructive algorithms",
"graphs",
"hashing",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5486
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1228-C | codeforces | 1228-C | Primes and Multiplication | https://codeforces.com/problemset/problem/1228/C | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9840
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1228-B | codeforces | 1228-B | Filling the Grid | https://codeforces.com/problemset/problem/1228/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11991
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1228-A | codeforces | 1228-A | Distinct Digits | https://codeforces.com/problemset/problem/1228/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23539
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1227-G | codeforces | 1227-G | Not Same | https://codeforces.com/problemset/problem/1227/G | [
"constructive algorithms"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1345
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1227-F2 | codeforces | 1227-F2 | Wrong Answer on test 233 (Hard Version) | https://codeforces.com/problemset/problem/1227/F2 | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1999
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1227-F1 | codeforces | 1227-F1 | Wrong Answer on test 233 (Easy Version) | https://codeforces.com/problemset/problem/1227/F1 | [
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2110
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1227-E | codeforces | 1227-E | Arson In Berland Forest | https://codeforces.com/problemset/problem/1227/E | [
"binary search",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1846
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1227-D2 | codeforces | 1227-D2 | Optimal Subsequences (Hard Version) | https://codeforces.com/problemset/problem/1227/D2 | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4798
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1227-D1 | codeforces | 1227-D1 | Optimal Subsequences (Easy Version) | https://codeforces.com/problemset/problem/1227/D1 | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6890
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1227-C | codeforces | 1227-C | Messy | https://codeforces.com/problemset/problem/1227/C | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5835
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1227-B | codeforces | 1227-B | Box | https://codeforces.com/problemset/problem/1227/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 10593
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1227-A | codeforces | 1227-A | Math Problem | https://codeforces.com/problemset/problem/1227/A | [
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 10370
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1225-G | codeforces | 1225-G | To Make 1 | https://codeforces.com/problemset/problem/1225/G | [
"bitmasks",
"constructive algorithms",
"dp",
"greedy",
"number theory"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 719
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1225-F | codeforces | 1225-F | Tree Factory | https://codeforces.com/problemset/problem/1225/F | [
"constructive algorithms",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1164
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1225-E | codeforces | 1225-E | Rock Is Push | https://codeforces.com/problemset/problem/1225/E | [
"binary search",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2207
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1225-D | codeforces | 1225-D | Power Products | https://codeforces.com/problemset/problem/1225/D | [
"hashing",
"math",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 10761
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1225-C | codeforces | 1225-C | p-binary | https://codeforces.com/problemset/problem/1225/C | [
"bitmasks",
"brute force",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9982
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1225-B2 | codeforces | 1225-B2 | TV Subscriptions (Hard Version) | https://codeforces.com/problemset/problem/1225/B2 | [
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12430
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1225-B1 | codeforces | 1225-B1 | TV Subscriptions (Easy Version) | https://codeforces.com/problemset/problem/1225/B1 | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 12660
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1225-A | codeforces | 1225-A | Forgetting Things | https://codeforces.com/problemset/problem/1225/A | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 16833
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1223-G | codeforces | 1223-G | Wooden Raft | https://codeforces.com/problemset/problem/1223/G | [
"binary search",
"math",
"number theory"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 434
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1223-F | codeforces | 1223-F | Stack Exterminable Arrays | https://codeforces.com/problemset/problem/1223/F | [
"data structures",
"divide and conquer",
"dp",
"hashing"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 2350
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1223-E | codeforces | 1223-E | Paint the Tree | https://codeforces.com/problemset/problem/1223/E | [
"dp",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3047
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1223-D | codeforces | 1223-D | Sequence Sorting | https://codeforces.com/problemset/problem/1223/D | [
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4602
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1223-C | codeforces | 1223-C | Save the Nature | https://codeforces.com/problemset/problem/1223/C | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10039
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1223-B | codeforces | 1223-B | Strings Equalization | https://codeforces.com/problemset/problem/1223/B | [
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 16311
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1223-A | codeforces | 1223-A | CME | https://codeforces.com/problemset/problem/1223/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22492
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1221-G | codeforces | 1221-G | Graph And Numbers | https://codeforces.com/problemset/problem/1221/G | [
"bitmasks",
"brute force",
"combinatorics",
"dp",
"meet-in-the-middle"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1061
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1221-F | codeforces | 1221-F | Choose a Square | https://codeforces.com/problemset/problem/1221/F | [
"binary search",
"data structures",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1317
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1221-E | codeforces | 1221-E | Game With String | https://codeforces.com/problemset/problem/1221/E | [
"games"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1205
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1221-D | codeforces | 1221-D | Make The Fence Great Again | https://codeforces.com/problemset/problem/1221/D | [
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 10643
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1221-C | codeforces | 1221-C | Perfect Team | https://codeforces.com/problemset/problem/1221/C | [
"binary search",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 25603
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1221-B | codeforces | 1221-B | Knights | https://codeforces.com/problemset/problem/1221/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 12617
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1221-A | codeforces | 1221-A | 2048 Game | https://codeforces.com/problemset/problem/1221/A | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 18476
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1220-G | codeforces | 1220-G | Geolocation | https://codeforces.com/problemset/problem/1220/G | [
"geometry"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 129
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1220-F | codeforces | 1220-F | Gardener Alex | https://codeforces.com/problemset/problem/1220/F | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 917
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1220-E | codeforces | 1220-E | Tourism | https://codeforces.com/problemset/problem/1220/E | [
"dfs and similar",
"dp",
"dsu",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3104
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1220-D | codeforces | 1220-D | Alex and Julian | https://codeforces.com/problemset/problem/1220/D | [
"bitmasks",
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4171
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1220-C | codeforces | 1220-C | Substring Game in the Lesson | https://codeforces.com/problemset/problem/1220/C | [
"games",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 10889
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1220-B | codeforces | 1220-B | Multiplication Table | https://codeforces.com/problemset/problem/1220/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12235
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1220-A | codeforces | 1220-A | Cards | https://codeforces.com/problemset/problem/1220/A | [
"implementation",
"sortings",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 33319
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1219-G | codeforces | 1219-G | Harvester | https://codeforces.com/problemset/problem/1219/G | [
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 874
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1219-C | codeforces | 1219-C | Periodic integer number | https://codeforces.com/problemset/problem/1219/C | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2509
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1218-I | codeforces | 1218-I | The Light Square | https://codeforces.com/problemset/problem/1218/I | [
"2-sat",
"dfs and similar",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 808
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1218-H | codeforces | 1218-H | Function Composition | https://codeforces.com/problemset/problem/1218/H | [
"dfs and similar"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 224
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1218-G | codeforces | 1218-G | Alpha planetary system | https://codeforces.com/problemset/problem/1218/G | [
"constructive algorithms",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 321
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1218-F | codeforces | 1218-F | Workout plan | https://codeforces.com/problemset/problem/1218/F | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 3241
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1218-E | codeforces | 1218-E | Product Tuples | https://codeforces.com/problemset/problem/1218/E | [
"divide and conquer",
"fft"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 543
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1218-D | codeforces | 1218-D | Xor Spanning Tree | https://codeforces.com/problemset/problem/1218/D | [
"divide and conquer",
"fft",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 634
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1218-C | codeforces | 1218-C | Jumping Transformers | https://codeforces.com/problemset/problem/1218/C | [
"dp"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 269
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1218-B | codeforces | 1218-B | Guarding warehouses | https://codeforces.com/problemset/problem/1218/B | [
"data structures",
"geometry"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 202
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1218-A | codeforces | 1218-A | BubbleReactor | https://codeforces.com/problemset/problem/1218/A | [
"dp",
"graphs"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 194
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1217-F | codeforces | 1217-F | Forced Online Queries Problem | https://codeforces.com/problemset/problem/1217/F | [
"data structures",
"divide and conquer",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 769
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1217-E | codeforces | 1217-E | Sum Queries? | https://codeforces.com/problemset/problem/1217/E | [
"data structures",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2145
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1217-D | codeforces | 1217-D | Coloring Edges | https://codeforces.com/problemset/problem/1217/D | [
"constructive algorithms",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 6156
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1217-C | codeforces | 1217-C | The Number Of Good Substrings | https://codeforces.com/problemset/problem/1217/C | [
"binary search",
"bitmasks",
"brute force"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7951
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1217-B | codeforces | 1217-B | Zmei Gorynich | https://codeforces.com/problemset/problem/1217/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11957
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1217-A | codeforces | 1217-A | Creating a Character | https://codeforces.com/problemset/problem/1217/A | [
"binary search",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15927
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1216-F | codeforces | 1216-F | Wi-Fi | https://codeforces.com/problemset/problem/1216/F | [
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3344
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1216-E2 | codeforces | 1216-E2 | Numerical Sequence (hard version) | https://codeforces.com/problemset/problem/1216/E2 | [
"binary search",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1712
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1216-E1 | codeforces | 1216-E1 | Numerical Sequence (easy version) | https://codeforces.com/problemset/problem/1216/E1 | [
"binary search",
"brute force",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3807
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1216-D | codeforces | 1216-D | Swords | https://codeforces.com/problemset/problem/1216/D | [
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12578
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1216-C | codeforces | 1216-C | White Sheet | https://codeforces.com/problemset/problem/1216/C | [
"geometry",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10685
} | 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.