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:1249-C1 | codeforces | 1249-C1 | Good Numbers (easy version) | https://codeforces.com/problemset/problem/1249/C1 | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16578
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1249-B2 | codeforces | 1249-B2 | Books Exchange (hard version) | https://codeforces.com/problemset/problem/1249/B2 | [
"dfs and similar",
"dsu",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 18441
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1249-B1 | codeforces | 1249-B1 | Books Exchange (easy version) | https://codeforces.com/problemset/problem/1249/B1 | [
"dsu",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 22351
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1249-A | codeforces | 1249-A | Yet Another Dividing into Teams | https://codeforces.com/problemset/problem/1249/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23737
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1248-D1 | codeforces | 1248-D1 | The World Is Just a Programming Task (Easy Version) | https://codeforces.com/problemset/problem/1248/D1 | [
"brute force",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2525
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1248-B | codeforces | 1248-B | Grow The Tree | https://codeforces.com/problemset/problem/1248/B | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 18046
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1248-A | codeforces | 1248-A | Integer Points | https://codeforces.com/problemset/problem/1248/A | [
"geometry",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 15121
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1246-F | codeforces | 1246-F | Cursor Distance | https://codeforces.com/problemset/problem/1246/F | [] | null | null | stdin_stdout | 3,500 | {
"solved_count": 207
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1245-F | codeforces | 1245-F | Daniel and Spring Cleaning | https://codeforces.com/problemset/problem/1245/F | [
"bitmasks",
"brute force",
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2270
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1245-E | codeforces | 1245-E | Hyakugoku and Ladders | https://codeforces.com/problemset/problem/1245/E | [
"dp",
"probabilities",
"shortest paths"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1371
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1245-D | codeforces | 1245-D | Shichikuji and Power Grid | https://codeforces.com/problemset/problem/1245/D | [
"dsu",
"graphs",
"greedy",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 9749
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1245-C | codeforces | 1245-C | Constanze's Machine | https://codeforces.com/problemset/problem/1245/C | [
"dp"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 20018
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1245-B | codeforces | 1245-B | Restricted RPS | https://codeforces.com/problemset/problem/1245/B | [
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 14550
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1245-A | codeforces | 1245-A | Good ol' Numbers Coloring | https://codeforces.com/problemset/problem/1245/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 14922
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1244-G | codeforces | 1244-G | Running in Pairs | https://codeforces.com/problemset/problem/1244/G | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1547
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1244-F | codeforces | 1244-F | Chips | https://codeforces.com/problemset/problem/1244/F | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1637
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1244-E | codeforces | 1244-E | Minimizing Difference | https://codeforces.com/problemset/problem/1244/E | [
"binary search",
"constructive algorithms",
"greedy",
"sortings",
"ternary search",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6468
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1244-D | codeforces | 1244-D | Paint the Tree | https://codeforces.com/problemset/problem/1244/D | [
"brute force",
"constructive algorithms",
"dp",
"graphs",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8320
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1244-C | codeforces | 1244-C | The Football Season | https://codeforces.com/problemset/problem/1244/C | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 8332
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1244-B | codeforces | 1244-B | Rooms and Staircases | https://codeforces.com/problemset/problem/1244/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 17616
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1244-A | codeforces | 1244-A | Pens and Pencils | https://codeforces.com/problemset/problem/1244/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20103
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1243-B2 | codeforces | 1243-B2 | Character Swap (Hard Version) | https://codeforces.com/problemset/problem/1243/B2 | [
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7314
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1243-B1 | codeforces | 1243-B1 | Character Swap (Easy Version) | https://codeforces.com/problemset/problem/1243/B1 | [
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 15375
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1243-A | codeforces | 1243-A | Maximum Square | https://codeforces.com/problemset/problem/1243/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16399
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1242-E | codeforces | 1242-E | Planar Perimeter | https://codeforces.com/problemset/problem/1242/E | [
"constructive algorithms",
"graphs"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 157
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1242-D | codeforces | 1242-D | Number Discovery | https://codeforces.com/problemset/problem/1242/D | [
"math"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 234
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1242-C | codeforces | 1242-C | Sum Balance | https://codeforces.com/problemset/problem/1242/C | [
"bitmasks",
"dfs and similar",
"dp",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1956
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1242-B | codeforces | 1242-B | 0-1 MST | https://codeforces.com/problemset/problem/1242/B | [
"dfs and similar",
"dsu",
"graphs",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 9391
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1242-A | codeforces | 1242-A | Tile Painting | https://codeforces.com/problemset/problem/1242/A | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13279
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1240-F | codeforces | 1240-F | Football | https://codeforces.com/problemset/problem/1240/F | [
"graphs"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 327
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1239-F | codeforces | 1239-F | Swiper, no swiping! | https://codeforces.com/problemset/problem/1239/F | [
"graphs",
"implementation"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 317
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1239-E | codeforces | 1239-E | Turtle | https://codeforces.com/problemset/problem/1239/E | [
"dp",
"implementation"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 1169
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1239-D | codeforces | 1239-D | Catowice City | https://codeforces.com/problemset/problem/1239/D | [
"2-sat",
"dfs and similar",
"graph matchings",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2616
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1239-C | codeforces | 1239-C | Queue in the Train | https://codeforces.com/problemset/problem/1239/C | [
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1810
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1239-B | codeforces | 1239-B | The World Is Just a Programming Task (Hard Version) | https://codeforces.com/problemset/problem/1239/B | [
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1122
} | 2026-06-01T05:00:40.145500+00:00 |
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": 7796
} | 2026-06-01T05:00:40.145500+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": 493
} | 2026-06-01T05:00:40.145500+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": 2078
} | 2026-06-01T05:00:40.145500+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": 3486
} | 2026-06-01T05:00:40.145500+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": 6448
} | 2026-06-01T05:00:40.145500+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": 7864
} | 2026-06-01T05:00:40.145500+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": 15733
} | 2026-06-01T05:00:40.145500+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": 28237
} | 2026-06-01T05:00:40.145500+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": 438
} | 2026-06-01T05:00:40.145500+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": 166
} | 2026-06-01T05:00:40.145500+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": 1103
} | 2026-06-01T05:00:40.145500+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": 1523
} | 2026-06-01T05:00:40.145500+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": 4792
} | 2026-06-01T05:00:40.145500+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": 4536
} | 2026-06-01T05:00:40.145500+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": 6304
} | 2026-06-01T05:00:40.145500+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": 23103
} | 2026-06-01T05:00:40.145500+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": 22182
} | 2026-06-01T05:00:40.145500+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": 213
} | 2026-06-01T05:00:40.145500+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": 735
} | 2026-06-01T05:00:40.145500+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": 1738
} | 2026-06-01T05:00:40.145500+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": 10559
} | 2026-06-01T05:00:40.145500+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": 12074
} | 2026-06-01T05:00:40.145500+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": 17272
} | 2026-06-01T05:00:40.145500+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": 2984
} | 2026-06-01T05:00:40.145500+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": 2987
} | 2026-06-01T05:00:40.145500+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": 18792
} | 2026-06-01T05:00:40.145500+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": 13508
} | 2026-06-01T05:00:40.145500+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": 18481
} | 2026-06-01T05:00:40.145500+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": 19797
} | 2026-06-01T05:00:40.145500+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": 29614
} | 2026-06-01T05:00:40.145500+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": 934
} | 2026-06-01T05:00:40.145500+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": 4393
} | 2026-06-01T05:00:40.145500+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": 19659
} | 2026-06-01T05:00:40.145500+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": 22950
} | 2026-06-01T05:00:40.145500+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": 479
} | 2026-06-01T05:00:40.145500+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": 3491
} | 2026-06-01T05:00:40.145500+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": 5441
} | 2026-06-01T05:00:40.145500+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": 9655
} | 2026-06-01T05:00:40.145500+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": 11900
} | 2026-06-01T05:00:40.145500+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": 23323
} | 2026-06-01T05:00:40.145500+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": 1190
} | 2026-06-01T05:00:40.145500+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": 1940
} | 2026-06-01T05:00:40.145500+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": 2065
} | 2026-06-01T05:00:40.145500+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": 1650
} | 2026-06-01T05:00:40.145500+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": 4741
} | 2026-06-01T05:00:40.145500+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": 6844
} | 2026-06-01T05:00:40.145500+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": 5796
} | 2026-06-01T05:00:40.145500+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": 10445
} | 2026-06-01T05:00:40.145500+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": 10284
} | 2026-06-01T05:00:40.145500+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": 661
} | 2026-06-01T05:00:40.145500+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": 995
} | 2026-06-01T05:00:40.145500+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": 2104
} | 2026-06-01T05:00:40.145500+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": 10240
} | 2026-06-01T05:00:40.145500+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": 9807
} | 2026-06-01T05:00:40.145500+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": 12223
} | 2026-06-01T05:00:40.145500+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": 12527
} | 2026-06-01T05:00:40.145500+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": 16652
} | 2026-06-01T05:00:40.145500+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": 276
} | 2026-06-01T05:00:40.145500+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": 2270
} | 2026-06-01T05:00:40.145500+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": 2901
} | 2026-06-01T05:00:40.145500+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": 4473
} | 2026-06-01T05:00:40.145500+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": 9826
} | 2026-06-01T05:00:40.145500+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": 16068
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1223-A | codeforces | 1223-A | CME | https://codeforces.com/problemset/problem/1223/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22308
} | 2026-06-01T05:00:40.145500+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": 882
} | 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.