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:1216-B | codeforces | 1216-B | Shooting | https://codeforces.com/problemset/problem/1216/B | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 20033
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1216-A | codeforces | 1216-A | Prefixes | https://codeforces.com/problemset/problem/1216/A | [
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19761
} | 2026-11-02T05:37:07.883505+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": 1342
} | 2026-11-02T05:37:07.883505+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": 3686
} | 2026-11-02T05:37:07.883505+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": 6705
} | 2026-11-02T05:37:07.883505+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": 12176
} | 2026-11-02T05:37:07.883505+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": 20303
} | 2026-11-02T05:37:07.883505+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": 12365
} | 2026-11-02T05:37:07.883505+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": 539
} | 2026-11-02T05:37:07.883505+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": 484
} | 2026-11-02T05:37:07.883505+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": 554
} | 2026-11-02T05:37:07.883505+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": 2900
} | 2026-11-02T05:37:07.883505+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": 7239
} | 2026-11-02T05:37:07.883505+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": 14455
} | 2026-11-02T05:37:07.883505+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": 11570
} | 2026-11-02T05:37:07.883505+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": 9585
} | 2026-11-02T05:37:07.883505+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": 10587
} | 2026-11-02T05:37:07.883505+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": 3194
} | 2026-11-02T05:37:07.883505+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": 5545
} | 2026-11-02T05:37:07.883505+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": 12492
} | 2026-11-02T05:37:07.883505+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": 12283
} | 2026-11-02T05:37:07.883505+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": 19894
} | 2026-11-02T05:37:07.883505+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": 32820
} | 2026-11-02T05:37:07.883505+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": 25990
} | 2026-11-02T05:37:07.883505+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": 57
} | 2026-11-02T05:37:07.883505+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": 60
} | 2026-11-02T05:37:07.883505+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": 89
} | 2026-11-02T05:37:07.883505+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": 153
} | 2026-11-02T05:37:07.883505+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": 220
} | 2026-11-02T05:37:07.883505+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": 254
} | 2026-11-02T05:37:07.883505+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": 571
} | 2026-11-02T05:37:07.883505+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": 836
} | 2026-11-02T05:37:07.883505+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": 1644
} | 2026-11-02T05:37:07.883505+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": 396
} | 2026-11-02T05:37:07.883505+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": 542
} | 2026-11-02T05:37:07.883505+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": 515
} | 2026-11-02T05:37:07.883505+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": 472
} | 2026-11-02T05:37:07.883505+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": 1678
} | 2026-11-02T05:37:07.883505+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": 3695
} | 2026-11-02T05:37:07.883505+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": 6144
} | 2026-11-02T05:37:07.883505+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": 5605
} | 2026-11-02T05:37:07.883505+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": 375
} | 2026-11-02T05:37:07.883505+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": 610
} | 2026-11-02T05:37:07.883505+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": 4213
} | 2026-11-02T05:37:07.883505+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": 1516
} | 2026-11-02T05:37:07.883505+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": 2519
} | 2026-11-02T05:37:07.883505+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": 3386
} | 2026-11-02T05:37:07.883505+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": 11102
} | 2026-11-02T05:37:07.883505+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": 7988
} | 2026-11-02T05:37:07.883505+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": 8622
} | 2026-11-02T05:37:07.883505+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": 13016
} | 2026-11-02T05:37:07.883505+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": 329
} | 2026-11-02T05:37:07.883505+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": 996
} | 2026-11-02T05:37:07.883505+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": 3729
} | 2026-11-02T05:37:07.883505+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": 2367
} | 2026-11-02T05:37:07.883505+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": 5849
} | 2026-11-02T05:37:07.883505+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": 6480
} | 2026-11-02T05:37:07.883505+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": 12010
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1208-A | codeforces | 1208-A | XORinacci | https://codeforces.com/problemset/problem/1208/A | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 18458
} | 2026-11-02T05:37:07.883505+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": 1363
} | 2026-11-02T05:37:07.883505+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": 7319
} | 2026-11-02T05:37:07.883505+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": 6888
} | 2026-11-02T05:37:07.883505+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": 6844
} | 2026-11-02T05:37:07.883505+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": 11077
} | 2026-11-02T05:37:07.883505+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": 13861
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1207-A | codeforces | 1207-A | There Are Two Types Of Burgers | https://codeforces.com/problemset/problem/1207/A | [
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23770
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1206-B | codeforces | 1206-B | Make Product Equal One | https://codeforces.com/problemset/problem/1206/B | [
"dp",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 30152
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1206-A | codeforces | 1206-A | Choose Two Numbers | https://codeforces.com/problemset/problem/1206/A | [
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26415
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1205-F | codeforces | 1205-F | Beauty of a Permutation | https://codeforces.com/problemset/problem/1205/F | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 194
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1205-E | codeforces | 1205-E | Expected Value Again | https://codeforces.com/problemset/problem/1205/E | [
"combinatorics",
"strings"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 549
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1205-D | codeforces | 1205-D | Almost All | https://codeforces.com/problemset/problem/1205/D | [
"constructive algorithms",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 805
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1205-C | codeforces | 1205-C | Palindromic Paths | https://codeforces.com/problemset/problem/1205/C | [
"implementation",
"interactive"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1310
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1205-B | codeforces | 1205-B | Shortest Cycle | https://codeforces.com/problemset/problem/1205/B | [
"bitmasks",
"brute force",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7761
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1205-A | codeforces | 1205-A | Almost Equal | https://codeforces.com/problemset/problem/1205/A | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 14882
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1204-E | codeforces | 1204-E | Natasha, Sasha and the Prefix Sums | https://codeforces.com/problemset/problem/1204/E | [
"combinatorics",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2423
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1204-D2 | codeforces | 1204-D2 | Kirk and a Binary String (hard version) | https://codeforces.com/problemset/problem/1204/D2 | [
"data structures",
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3438
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1204-D1 | codeforces | 1204-D1 | Kirk and a Binary String (easy version) | https://codeforces.com/problemset/problem/1204/D1 | [
"brute force",
"greedy",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3321
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1204-C | codeforces | 1204-C | Anna, Svyatoslav and Maps | https://codeforces.com/problemset/problem/1204/C | [
"dp",
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7545
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1204-B | codeforces | 1204-B | Mislove Has Lost an Array | https://codeforces.com/problemset/problem/1204/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 18554
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1204-A | codeforces | 1204-A | BowWow and the Timetable | https://codeforces.com/problemset/problem/1204/A | [
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 22635
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1203-F2 | codeforces | 1203-F2 | Complete the Projects (hard version) | https://codeforces.com/problemset/problem/1203/F2 | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3591
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1203-F1 | codeforces | 1203-F1 | Complete the Projects (easy version) | https://codeforces.com/problemset/problem/1203/F1 | [
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4236
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1203-E | codeforces | 1203-E | Boxers | https://codeforces.com/problemset/problem/1203/E | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15360
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1203-D2 | codeforces | 1203-D2 | Remove the Substring (hard version) | https://codeforces.com/problemset/problem/1203/D2 | [
"binary search",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8497
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1203-D1 | codeforces | 1203-D1 | Remove the Substring (easy version) | https://codeforces.com/problemset/problem/1203/D1 | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9679
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1203-C | codeforces | 1203-C | Common Divisors | https://codeforces.com/problemset/problem/1203/C | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 25851
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1203-B | codeforces | 1203-B | Equal Rectangles | https://codeforces.com/problemset/problem/1203/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17184
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1203-A | codeforces | 1203-A | Circle of Students | https://codeforces.com/problemset/problem/1203/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 17999
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1202-F | codeforces | 1202-F | You Are Given Some Letters... | https://codeforces.com/problemset/problem/1202/F | [
"binary search",
"implementation",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 676
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1202-E | codeforces | 1202-E | You Are Given Some Strings... | https://codeforces.com/problemset/problem/1202/E | [
"brute force",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 3114
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1202-D | codeforces | 1202-D | Print a 1337-string... | https://codeforces.com/problemset/problem/1202/D | [
"combinatorics",
"constructive algorithms",
"math",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5683
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1202-C | codeforces | 1202-C | You Are Given a WASD-string... | https://codeforces.com/problemset/problem/1202/C | [
"brute force",
"data structures",
"dp",
"greedy",
"implementation",
"math",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2817
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1202-B | codeforces | 1202-B | You Are Given a Decimal String... | https://codeforces.com/problemset/problem/1202/B | [
"brute force",
"dp",
"shortest paths"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4876
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1202-A | codeforces | 1202-A | You Are Given Two Binary Strings... | https://codeforces.com/problemset/problem/1202/A | [
"bitmasks",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 11004
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1201-E2 | codeforces | 1201-E2 | Knightmare (hard) | https://codeforces.com/problemset/problem/1201/E2 | [
"graphs",
"interactive",
"shortest paths"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 185
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1201-E1 | codeforces | 1201-E1 | Knightmare (easy) | https://codeforces.com/problemset/problem/1201/E1 | [
"graphs",
"interactive",
"shortest paths"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 246
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1201-D | codeforces | 1201-D | Treasure Hunting | https://codeforces.com/problemset/problem/1201/D | [
"binary search",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2596
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1201-C | codeforces | 1201-C | Maximum Median | https://codeforces.com/problemset/problem/1201/C | [
"binary search",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 38149
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1201-B | codeforces | 1201-B | Zero Array | https://codeforces.com/problemset/problem/1201/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 27651
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1201-A | codeforces | 1201-A | Important Exam | https://codeforces.com/problemset/problem/1201/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 17347
} | 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.