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:1252-G | codeforces | 1252-G | Performance Review | https://codeforces.com/problemset/problem/1252/G | [
"data structures"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1588
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1252-F | codeforces | 1252-F | Regular Forestation | https://codeforces.com/problemset/problem/1252/F | [
"hashing",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1102
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1252-E | codeforces | 1252-E | Songwriter | https://codeforces.com/problemset/problem/1252/E | [
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1390
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1252-D | codeforces | 1252-D | Find String in a Grid | https://codeforces.com/problemset/problem/1252/D | [
"data structures",
"dp",
"strings",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 505
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1252-C | codeforces | 1252-C | Even Path | https://codeforces.com/problemset/problem/1252/C | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4018
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1252-B | codeforces | 1252-B | Cleaning Robots | https://codeforces.com/problemset/problem/1252/B | [
"dp",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 617
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1252-A | codeforces | 1252-A | Copying Homework | https://codeforces.com/problemset/problem/1252/A | [] | null | null | stdin_stdout | 1,000 | {
"solved_count": 6081
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1251-F | codeforces | 1251-F | Red-White Fence | https://codeforces.com/problemset/problem/1251/F | [
"combinatorics",
"fft"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1080
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1251-E2 | codeforces | 1251-E2 | Voting (Hard Version) | https://codeforces.com/problemset/problem/1251/E2 | [
"binary search",
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 3049
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1251-E1 | codeforces | 1251-E1 | Voting (Easy Version) | https://codeforces.com/problemset/problem/1251/E1 | [
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2651
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1251-D | codeforces | 1251-D | Salary Changing | https://codeforces.com/problemset/problem/1251/D | [
"binary search",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6717
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1251-C | codeforces | 1251-C | Minimize The Integer | https://codeforces.com/problemset/problem/1251/C | [
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 14709
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1251-B | codeforces | 1251-B | Binary Palindromes | https://codeforces.com/problemset/problem/1251/B | [
"greedy",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11693
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1251-A | codeforces | 1251-A | Broken Keyboard | https://codeforces.com/problemset/problem/1251/A | [
"brute force",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 21769
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1250-N | codeforces | 1250-N | Wires | https://codeforces.com/problemset/problem/1250/N | [
"dfs and similar",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1805
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1250-M | codeforces | 1250-M | SmartGarden | https://codeforces.com/problemset/problem/1250/M | [
"constructive algorithms",
"divide and conquer"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 401
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1250-L | codeforces | 1250-L | Divide The Students | https://codeforces.com/problemset/problem/1250/L | [
"binary search",
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4726
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1250-K | codeforces | 1250-K | Projectors | https://codeforces.com/problemset/problem/1250/K | [
"flows",
"graphs"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 432
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1250-J | codeforces | 1250-J | The Parade | https://codeforces.com/problemset/problem/1250/J | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3422
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1250-I | codeforces | 1250-I | Show Must Go On | https://codeforces.com/problemset/problem/1250/I | [
"binary search",
"brute force",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 240
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1250-H | codeforces | 1250-H | Happy Birthday | https://codeforces.com/problemset/problem/1250/H | [
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4331
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1250-G | codeforces | 1250-G | Discarding Game | https://codeforces.com/problemset/problem/1250/G | [
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 809
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1250-F | codeforces | 1250-F | Data Center | https://codeforces.com/problemset/problem/1250/F | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 8451
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1250-E | codeforces | 1250-E | The Coronation | https://codeforces.com/problemset/problem/1250/E | [
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 940
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1250-D | codeforces | 1250-D | Conference Problem | https://codeforces.com/problemset/problem/1250/D | [
"dp"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 310
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1250-C | codeforces | 1250-C | Trip to Saint Petersburg | https://codeforces.com/problemset/problem/1250/C | [
"data structures"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1483
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1250-B | codeforces | 1250-B | The Feast and the Bus | https://codeforces.com/problemset/problem/1250/B | [
"brute force",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2822
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1250-A | codeforces | 1250-A | Berstagram | https://codeforces.com/problemset/problem/1250/A | [
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 4452
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1249-F | codeforces | 1249-F | Maximum Weight Subset | https://codeforces.com/problemset/problem/1249/F | [
"dp",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2851
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1249-E | codeforces | 1249-E | By Elevator or Stairs? | https://codeforces.com/problemset/problem/1249/E | [
"dp",
"shortest paths"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11388
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1249-D2 | codeforces | 1249-D2 | Too Many Segments (hard version) | https://codeforces.com/problemset/problem/1249/D2 | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5932
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1249-D1 | codeforces | 1249-D1 | Too Many Segments (easy version) | https://codeforces.com/problemset/problem/1249/D1 | [
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5569
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1249-C2 | codeforces | 1249-C2 | Good Numbers (hard version) | https://codeforces.com/problemset/problem/1249/C2 | [
"binary search",
"greedy",
"math",
"meet-in-the-middle"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13668
} | 2026-08-17T01:43:56.191071+00:00 |
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": 16667
} | 2026-08-17T01:43:56.191071+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": 18672
} | 2026-08-17T01:43:56.191071+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": 22572
} | 2026-08-17T01:43:56.191071+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": 23818
} | 2026-08-17T01:43:56.191071+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": 2570
} | 2026-08-17T01:43:56.191071+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": 18146
} | 2026-08-17T01:43:56.191071+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": 15162
} | 2026-08-17T01:43:56.191071+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": 218
} | 2026-08-17T01:43:56.191071+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": 2323
} | 2026-08-17T01:43:56.191071+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": 1398
} | 2026-08-17T01:43:56.191071+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": 10203
} | 2026-08-17T01:43:56.191071+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": 20316
} | 2026-08-17T01:43:56.191071+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": 14611
} | 2026-08-17T01:43:56.191071+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": 14997
} | 2026-08-17T01:43:56.191071+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": 1580
} | 2026-08-17T01:43:56.191071+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": 1665
} | 2026-08-17T01:43:56.191071+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": 6856
} | 2026-08-17T01:43:56.191071+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": 8417
} | 2026-08-17T01:43:56.191071+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": 8466
} | 2026-08-17T01:43:56.191071+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": 17845
} | 2026-08-17T01:43:56.191071+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": 20205
} | 2026-08-17T01:43:56.191071+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": 7414
} | 2026-08-17T01:43:56.191071+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": 15421
} | 2026-08-17T01:43:56.191071+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": 16460
} | 2026-08-17T01:43:56.191071+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": 173
} | 2026-08-17T01:43:56.191071+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": 254
} | 2026-08-17T01:43:56.191071+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": 1990
} | 2026-08-17T01:43:56.191071+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": 9681
} | 2026-08-17T01:43:56.191071+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": 13333
} | 2026-08-17T01:43:56.191071+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": 418
} | 2026-08-17T01:43:56.191071+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": 322
} | 2026-08-17T01:43:56.191071+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": 1269
} | 2026-08-17T01:43:56.191071+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": 2674
} | 2026-08-17T01:43:56.191071+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": 1831
} | 2026-08-17T01:43:56.191071+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": 1187
} | 2026-08-17T01:43:56.191071+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": 7847
} | 2026-08-17T01:43:56.191071+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": 536
} | 2026-08-17T01:43:56.191071+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": 2236
} | 2026-08-17T01:43:56.191071+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": 3597
} | 2026-08-17T01:43:56.191071+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": 6536
} | 2026-08-17T01:43:56.191071+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": 7894
} | 2026-08-17T01:43:56.191071+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": 15802
} | 2026-08-17T01:43:56.191071+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": 28605
} | 2026-08-17T01:43:56.191071+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": 691
} | 2026-08-17T01:43:56.191071+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": 168
} | 2026-08-17T01:43:56.191071+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": 1186
} | 2026-08-17T01:43:56.191071+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": 1746
} | 2026-08-17T01:43:56.191071+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": 4930
} | 2026-08-17T01:43:56.191071+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": 4568
} | 2026-08-17T01:43:56.191071+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": 6340
} | 2026-08-17T01:43:56.191071+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": 24355
} | 2026-08-17T01:43:56.191071+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": 22522
} | 2026-08-17T01:43:56.191071+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": 436
} | 2026-08-17T01:43:56.191071+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": 794
} | 2026-08-17T01:43:56.191071+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": 1772
} | 2026-08-17T01:43:56.191071+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": 10593
} | 2026-08-17T01:43:56.191071+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": 12206
} | 2026-08-17T01:43:56.191071+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": 17336
} | 2026-08-17T01:43:56.191071+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": 3045
} | 2026-08-17T01:43:56.191071+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": 3081
} | 2026-08-17T01:43:56.191071+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": 19460
} | 2026-08-17T01:43:56.191071+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": 13615
} | 2026-08-17T01:43:56.191071+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": 18697
} | 2026-08-17T01:43:56.191071+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": 19911
} | 2026-08-17T01:43:56.191071+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": 29751
} | 2026-08-17T01:43:56.191071+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": 953
} | 2026-08-17T01:43:56.191071+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": 4448
} | 2026-08-17T01:43:56.191071+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.