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: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": 1242
} | 2026-06-01T05:00:40.145500+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": 1174
} | 2026-06-01T05:00:40.145500+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": 10228
} | 2026-06-01T05:00:40.145500+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": 24783
} | 2026-06-01T05:00:40.145500+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": 12540
} | 2026-06-01T05:00:40.145500+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": 18199
} | 2026-06-01T05:00:40.145500+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": 74
} | 2026-06-01T05:00:40.145500+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": 856
} | 2026-06-01T05:00:40.145500+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": 3010
} | 2026-06-01T05:00:40.145500+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": 4144
} | 2026-06-01T05:00:40.145500+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": 10822
} | 2026-06-01T05:00:40.145500+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": 12160
} | 2026-06-01T05:00:40.145500+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": 32887
} | 2026-06-01T05:00:40.145500+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": 824
} | 2026-06-01T05:00:40.145500+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": 2483
} | 2026-06-01T05:00:40.145500+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": 748
} | 2026-06-01T05:00:40.145500+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": 157
} | 2026-06-01T05:00:40.145500+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": 164
} | 2026-06-01T05:00:40.145500+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": 3199
} | 2026-06-01T05:00:40.145500+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": 479
} | 2026-06-01T05:00:40.145500+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": 607
} | 2026-06-01T05:00:40.145500+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": 220
} | 2026-06-01T05:00:40.145500+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": 95
} | 2026-06-01T05:00:40.145500+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": 180
} | 2026-06-01T05:00:40.145500+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": 725
} | 2026-06-01T05:00:40.145500+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": 2064
} | 2026-06-01T05:00:40.145500+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": 5973
} | 2026-06-01T05:00:40.145500+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": 7868
} | 2026-06-01T05:00:40.145500+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": 11890
} | 2026-06-01T05:00:40.145500+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": 15838
} | 2026-06-01T05:00:40.145500+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": 3117
} | 2026-06-01T05:00:40.145500+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": 1660
} | 2026-06-01T05:00:40.145500+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": 3750
} | 2026-06-01T05:00:40.145500+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": 12260
} | 2026-06-01T05:00:40.145500+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": 10405
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1216-B | codeforces | 1216-B | Shooting | https://codeforces.com/problemset/problem/1216/B | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 19767
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1216-A | codeforces | 1216-A | Prefixes | https://codeforces.com/problemset/problem/1216/A | [
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19575
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1215-F | codeforces | 1215-F | Radio Stations | https://codeforces.com/problemset/problem/1215/F | [
"2-sat"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1196
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1215-E | codeforces | 1215-E | Marbles | https://codeforces.com/problemset/problem/1215/E | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3468
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1215-D | codeforces | 1215-D | Ticket Game | https://codeforces.com/problemset/problem/1215/D | [
"games",
"greedy",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6576
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1215-C | codeforces | 1215-C | Swap Letters | https://codeforces.com/problemset/problem/1215/C | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 11970
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1215-B | codeforces | 1215-B | The Number of Products | https://codeforces.com/problemset/problem/1215/B | [
"combinatorics",
"dp",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 18640
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1215-A | codeforces | 1215-A | Yellow Cards | https://codeforces.com/problemset/problem/1215/A | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 12195
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1214-H | codeforces | 1214-H | Tiles Placement | https://codeforces.com/problemset/problem/1214/H | [
"constructive algorithms",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 461
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1214-G | codeforces | 1214-G | Feeling Good | https://codeforces.com/problemset/problem/1214/G | [
"bitmasks",
"data structures"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 336
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1214-F | codeforces | 1214-F | Employment | https://codeforces.com/problemset/problem/1214/F | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 502
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1214-E | codeforces | 1214-E | Petya and Construction Set | https://codeforces.com/problemset/problem/1214/E | [
"constructive algorithms",
"graphs",
"math",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2866
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1214-D | codeforces | 1214-D | Treasure Island | https://codeforces.com/problemset/problem/1214/D | [
"dfs and similar",
"dp",
"flows",
"hashing"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7173
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1214-C | codeforces | 1214-C | Bad Sequence | https://codeforces.com/problemset/problem/1214/C | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 14219
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1214-B | codeforces | 1214-B | Badges | https://codeforces.com/problemset/problem/1214/B | [
"brute force",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 11502
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1214-A | codeforces | 1214-A | Optimal Currency Exchange | https://codeforces.com/problemset/problem/1214/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 9498
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1213-G | codeforces | 1213-G | Path Queries | https://codeforces.com/problemset/problem/1213/G | [
"divide and conquer",
"dsu",
"graphs",
"sortings",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9617
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1213-F | codeforces | 1213-F | Unstable String Sort | https://codeforces.com/problemset/problem/1213/F | [
"data structures",
"dfs and similar",
"dsu",
"graphs",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3032
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1213-E | codeforces | 1213-E | Two Small Strings | https://codeforces.com/problemset/problem/1213/E | [
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5476
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1213-D2 | codeforces | 1213-D2 | Equalizing by Division (hard version) | https://codeforces.com/problemset/problem/1213/D2 | [
"brute force",
"math",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12240
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1213-D1 | codeforces | 1213-D1 | Equalizing by Division (easy version) | https://codeforces.com/problemset/problem/1213/D1 | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12109
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1213-C | codeforces | 1213-C | Book Reading | https://codeforces.com/problemset/problem/1213/C | [
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 19658
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1213-B | codeforces | 1213-B | Bad Prices | https://codeforces.com/problemset/problem/1213/B | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 31702
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1213-A | codeforces | 1213-A | Chips Moving | https://codeforces.com/problemset/problem/1213/A | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 25641
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1211-I | codeforces | 1211-I | Unusual Graph | https://codeforces.com/problemset/problem/1211/I | [
"*special",
"graphs"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 52
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1211-H | codeforces | 1211-H | Road Repair in Treeland | https://codeforces.com/problemset/problem/1211/H | [
"*special",
"binary search",
"dp",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 57
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1211-G | codeforces | 1211-G | King's Path | https://codeforces.com/problemset/problem/1211/G | [
"*special",
"math",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 84
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1211-F | codeforces | 1211-F | kotlinkotlinkotlinkotlin... | https://codeforces.com/problemset/problem/1211/F | [
"*special",
"graphs",
"implementation",
"strings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 149
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1211-E | codeforces | 1211-E | Double Permutation Inc. | https://codeforces.com/problemset/problem/1211/E | [
"*special",
"binary search",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 216
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1211-D | codeforces | 1211-D | Teams | https://codeforces.com/problemset/problem/1211/D | [
"*special",
"binary search",
"greedy",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 252
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1211-C | codeforces | 1211-C | Ice Cream | https://codeforces.com/problemset/problem/1211/C | [
"*special",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 569
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1211-B | codeforces | 1211-B | Traveling Around the Golden Ring of Berland | https://codeforces.com/problemset/problem/1211/B | [
"*special",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 801
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1211-A | codeforces | 1211-A | Three Problems | https://codeforces.com/problemset/problem/1211/A | [
"*special",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 1594
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1210-G | codeforces | 1210-G | Mateusz and Escape Room | https://codeforces.com/problemset/problem/1210/G | [
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 309
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1210-F2 | codeforces | 1210-F2 | Marek and Matching (hard version) | https://codeforces.com/problemset/problem/1210/F2 | [
"brute force",
"probabilities"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 437
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1210-F1 | codeforces | 1210-F1 | Marek and Matching (easy version) | https://codeforces.com/problemset/problem/1210/F1 | [
"brute force",
"probabilities"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 354
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1210-E | codeforces | 1210-E | Wojtek and Card Tricks | https://codeforces.com/problemset/problem/1210/E | [
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 441
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1210-D | codeforces | 1210-D | Konrad and Company Evaluation | https://codeforces.com/problemset/problem/1210/D | [
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1628
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1210-C | codeforces | 1210-C | Kamil and Making a Stream | https://codeforces.com/problemset/problem/1210/C | [
"math",
"number theory",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3601
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1210-B | codeforces | 1210-B | Marcin and Training Camp | https://codeforces.com/problemset/problem/1210/B | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6044
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1210-A | codeforces | 1210-A | Anadi and Domino | https://codeforces.com/problemset/problem/1210/A | [
"brute force",
"graphs"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5549
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1209-H | codeforces | 1209-H | Moving Walkways | https://codeforces.com/problemset/problem/1209/H | [
"data structures",
"greedy",
"math"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 231
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1209-G2 | codeforces | 1209-G2 | Into Blocks (hard version) | https://codeforces.com/problemset/problem/1209/G2 | [
"data structures"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 531
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1209-G1 | codeforces | 1209-G1 | Into Blocks (easy version) | https://codeforces.com/problemset/problem/1209/G1 | [
"data structures",
"dsu",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3983
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1209-F | codeforces | 1209-F | Koala and Notebook | https://codeforces.com/problemset/problem/1209/F | [
"data structures",
"dfs and similar",
"graphs",
"shortest paths",
"strings",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1367
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1209-E2 | codeforces | 1209-E2 | Rotate Columns (hard version) | https://codeforces.com/problemset/problem/1209/E2 | [
"bitmasks",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2311
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1209-E1 | codeforces | 1209-E1 | Rotate Columns (easy version) | https://codeforces.com/problemset/problem/1209/E1 | [
"bitmasks",
"brute force",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3258
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1209-D | codeforces | 1209-D | Cow and Snacks | https://codeforces.com/problemset/problem/1209/D | [
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10803
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1209-C | codeforces | 1209-C | Paint the Digits | https://codeforces.com/problemset/problem/1209/C | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 7866
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1209-B | codeforces | 1209-B | Koala and Lights | https://codeforces.com/problemset/problem/1209/B | [
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 8520
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1209-A | codeforces | 1209-A | Paint the Numbers | https://codeforces.com/problemset/problem/1209/A | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 12851
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1208-H | codeforces | 1208-H | Red Blue Tree | https://codeforces.com/problemset/problem/1208/H | [
"data structures",
"implementation",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 189
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1208-G | codeforces | 1208-G | Polygons | https://codeforces.com/problemset/problem/1208/G | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 928
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1208-F | codeforces | 1208-F | Bits And Pieces | https://codeforces.com/problemset/problem/1208/F | [
"bitmasks",
"dfs and similar",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 3323
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1208-E | codeforces | 1208-E | Let Them Slide | https://codeforces.com/problemset/problem/1208/E | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2193
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1208-D | codeforces | 1208-D | Restore Permutation | https://codeforces.com/problemset/problem/1208/D | [
"binary search",
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5488
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1208-C | codeforces | 1208-C | Magic Grid | https://codeforces.com/problemset/problem/1208/C | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6375
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1208-B | codeforces | 1208-B | Uniqueness | https://codeforces.com/problemset/problem/1208/B | [
"binary search",
"brute force",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 11690
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1208-A | codeforces | 1208-A | XORinacci | https://codeforces.com/problemset/problem/1208/A | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 18077
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1207-G | codeforces | 1207-G | Indie Album | https://codeforces.com/problemset/problem/1207/G | [
"data structures",
"dfs and similar",
"hashing",
"string suffix structures",
"strings",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1236
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1207-F | codeforces | 1207-F | Remainder Problem | https://codeforces.com/problemset/problem/1207/F | [
"brute force",
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 6865
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1207-E | codeforces | 1207-E | XOR Guessing | https://codeforces.com/problemset/problem/1207/E | [
"bitmasks",
"interactive",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6668
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1207-D | codeforces | 1207-D | Number Of Permutations | https://codeforces.com/problemset/problem/1207/D | [
"combinatorics"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6727
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1207-C | codeforces | 1207-C | Gas Pipeline | https://codeforces.com/problemset/problem/1207/C | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 10502
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1207-B | codeforces | 1207-B | Square Filling | https://codeforces.com/problemset/problem/1207/B | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 13780
} | 2026-06-01T05:00:40.145500+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.